Class

org.clulab.struct

BooleanHashTrie

Related Doc: package struct

Permalink

class BooleanHashTrie extends Serializable

A more efficient trie implementation, where the first layer is stored as a hash map for efficiency (the rest are the usual trees) The find* methods are thread safe User: mihais Date: 5/12/15

Annotations
@SerialVersionUID()
Linear Supertypes
Serializable, Serializable, AnyRef, Any
Known Subclasses
DebugBooleanHashTrie, HashTrie
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BooleanHashTrie
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BooleanHashTrie(label: String, caseInsensitive: Boolean = true, internStrings: Boolean = true)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. def add(tokens: Array[String]): Unit

    Permalink

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. val bLabel: String

    Permalink

  7. val caseInsensitive: Boolean

    Permalink

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. val entries: HashMap[String, BooleanTrieNode]

    Permalink

    Stores the first layer, i.e., the entry points in the trie

    Stores the first layer, i.e., the entry points in the trie

    Attributes
    protected

  10. def entriesSize: Int

    Permalink

  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  13. def equalsForSerialization(other: AnyRef): Boolean

    Permalink

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. def findAt(sequenceNormalized: Array[String], offset: Int): Match

    Permalink

    Returns the length of the matched span, which may be 0.

    Returns the length of the matched span, which may be 0. When multiple paths are found, the longest one is kept Text must be normalized (i.e., case folding) BEFORE this call, if necessary!

  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  18. val iLabel: String

    Permalink

  19. def in(s: String): String

    Permalink
    Attributes
    protected

  20. val internStrings: Boolean

    Permalink

  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  22. val label: String

    Permalink

  23. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    BooleanHashTrie → AnyRef → Any

  28. def toString(stringBuilder: StringBuilder): Unit

    Permalink

  29. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  30. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped