DebugBooleanHashTrie

Instance Constructors

new DebugBooleanHashTrie(label: String, caseInsensitive: Boolean = true, internStrings: Boolean = true)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def add(tokens: Array[String]): Unit

Definition Classes
DebugBooleanHashTrie → BooleanHashTrie
var addedCount: Int
var addedTokensCount: Int
final def asInstanceOf[T0]: T0

Definition Classes
Any
val bLabel: String

Definition Classes
BooleanHashTrie
val caseInsensitive: Boolean

Definition Classes
BooleanHashTrie
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val entries: HashMap[String, BooleanTrieNode]

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
Definition Classes
BooleanHashTrie
def entriesSize: Int

Definition Classes
BooleanHashTrie
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(sequence: Array[String], outsideLabel: String): Array[String]

Generates BIO labels for this sequence when complete trie paths match When multiple paths match, the longest one is kept
def findAt(sequenceNormalized: Array[String], offset: Int): Match

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!

Definition Classes
BooleanHashTrie
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
val iLabel: String

Definition Classes
BooleanHashTrie
def in(s: String): String

Definition Classes
DebugBooleanHashTrie → BooleanHashTrie
val internStrings: Boolean

Definition Classes
BooleanHashTrie
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val label: String

Definition Classes
BooleanHashTrie
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def showStats: Unit
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
BooleanHashTrie → AnyRef → Any
def toString(stringBuilder: StringBuilder): Unit

Definition Classes
BooleanHashTrie
val tokenHistogram: HashMap[Int, Int]
val uniqueStrings: HashSet[String]
def uniqueStringsSize: Int
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package struct

class DebugBooleanHashTrie extends BooleanHashTrie

Instance Constructors

new DebugBooleanHashTrie(label: String, caseInsensitive: Boolean = true, internStrings: Boolean = true)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

var addedCount: Int

var addedTokensCount: Int

final def asInstanceOf[T0]: T0

val bLabel: String

val caseInsensitive: Boolean

def clone(): AnyRef

val entries: HashMap[String, BooleanTrieNode]

def entriesSize: Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def find(sequence: Array[String], outsideLabel: String): Array[String]

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

final def getClass(): Class[_]

def hashCode(): Int

val iLabel: String

def in(s: String): String

val internStrings: Boolean

final def isInstanceOf[T0]: Boolean

val label: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def showStats: Unit

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

def toString(): String

def toString(stringBuilder: StringBuilder): Unit

val tokenHistogram: HashMap[Int, Int]

val uniqueStrings: HashSet[String]

def uniqueStringsSize: Int

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from BooleanHashTrie

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped