DNAPrefixTrie

Abstract Value Members

abstract def contains(key: String): Boolean

Checks whether this tree contains a specific key.
Checks whether this tree contains a specific key. The contains method accepts wildcards (either '*' or 'N') for doing a wildcard content check.
key
Key to check for the existance of.
returns
Returns true if the key is found.
abstract def get(key: String): V

Gets the value of a key that is contained in the tree.
Gets the value of a key that is contained in the tree. This method throws an exception if the key is not found in the tree. This method and all other getters do not take wildcards.
key
Key to search for the value of.
returns
Returns the value corresponding to this key.

Exceptions thrown
IllegalArgumentException
Throws an exception if the key is not in the collection.
See also
search
getIfExists
getOrElse
abstract def getIfExists(key: String): Option[V]

Gets the value of a key that is contained in the tree, wrapped as an option.
Gets the value of a key that is contained in the tree, wrapped as an option. None is returned if the key is not found. This method and all other getters do not take wildcards.
key
Key to search for the value of.
returns
Returns the value wrapped in an option. None is returned if the key is not found.

See also
search
getOrElse
get
abstract def getOrElse(key: String, default: V): V

Gets the value of a key that is contained in the tree.
Gets the value of a key that is contained in the tree. If this key is not found, a user-provided default value is returned. This method and all other getters do not take wildcards.
key
Key to search for the value of.
default
Default value to return if the key is not found.
returns
Returns the value corresponding to this key, or a default value if the key is not found.

See also
search
getIfExists
get
abstract def prefixSearch(key: String): Map[String, V]

Searches for all keys that match a given prefix.
Searches for all keys that match a given prefix. The prefix can include wildcards. The behavior of this method is identical to the other search method.
key
Key to search for, with wildcards.
returns
Returns a map containing all keys that match this search key, and their values.

See also
suffixSearch
search
abstract def search(key: String): Map[String, V]

Searches for all possible values that match a key, including wildcards.
Searches for all possible values that match a key, including wildcards. Returns the values and keys that match the wildcard in a map.
key
Key to search for, with wildcards.
returns
Returns a map containing all keys that match this search key, and their values.

See also
suffixSearch
prefixSearch
abstract def size: Int

Returns the number of key/value pairs stored in this trie.
Returns the number of key/value pairs stored in this trie.
returns
The count of key/value pairs in this trie.
abstract def suffixSearch(key: String): Map[String, V]

Searches for all keys that match a given suffix.
Searches for all keys that match a given suffix. The suffix can include wildcards. The behavior of this method is identical to the other search method.
key
Key to search for, with wildcards.
returns
Returns a map containing all keys that match this search key, and their values.

See also
prefixSearch
search

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

trait DNAPrefixTrie[V] extends Serializable

Abstract Value Members

abstract def contains(key: String): Boolean

abstract def get(key: String): V

abstract def getIfExists(key: String): Option[V]

abstract def getOrElse(key: String, default: V): V

abstract def prefixSearch(key: String): Map[String, V]

abstract def search(key: String): Map[String, V]

abstract def size: Int

abstract def suffixSearch(key: String): Map[String, V]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped