Class

org.clulab.struct

IntHashTrie

Related Doc: package struct

Permalink

class IntHashTrie 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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntHashTrie
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntHashTrie(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], completePath: Int, overwrite: Boolean): Unit

    Permalink

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. val caseInsensitive: Boolean

    Permalink

  7. def clone(): AnyRef

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

  8. val entries: HashMap[String, IntTrieNode]

    Permalink

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

  9. def entriesSize: Int

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  12. def equalsForSerialization(other: AnyRef, labels: Seq[String]): Boolean

    Permalink

  13. def finalize(): Unit

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

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

    Permalink

    Returns the length of the matched span, which may be 0, along with the value of completePath for that match.

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  17. def in(s: String): String

    Permalink
    Attributes
    protected

  18. val internStrings: Boolean

    Permalink

  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(labels: Seq[String]): String

    Permalink

  25. def toString(stringBuilder: StringBuilder, labels: Seq[String]): Unit

    Permalink

  26. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  27. final def wait(): Unit

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

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

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

  29. 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