final
class
RadixTree[K, V] extends NoEquals
Instance Constructors
-
new
RadixTree(prefix: K, children: Array[RadixTree[K, V]], valueOpt: Opt[V])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply(key: K)(implicit K: Key[K]): V
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
contains(key: K)(implicit K: Key[K]): Boolean
-
def
count: Int
-
def
entries(implicit K: Key[K]): Traversable[(K, V)]
-
final
def
eq(arg0: AnyRef): Boolean
-
final
def
equals(that: Any): Boolean
-
def
filter(f: (K, V) ⇒ Boolean)(implicit K: Key[K]): RadixTree[K, V]
-
def
filterKeysContaining(fragment: K)(implicit K: Key[K], v: Hash[V]): RadixTree[K, V]
-
def
filterPrefix(prefix: K)(implicit K: Key[K]): RadixTree[K, V]
-
def
finalize(): Unit
-
def
get(key: K)(implicit K: Key[K]): Option[V]
-
final
def
getClass(): Class[_]
-
final
def
hashCode(): Int
-
def
isEmpty(implicit K: Key[K]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
keys(implicit K: Key[K]): Traversable[K]
-
def
merge(other: RadixTree[K, V], collision: (V, V) ⇒ V)(implicit K: Key[K]): RadixTree[K, V]
-
def
merge(other: RadixTree[K, V])(implicit K: Key[K]): RadixTree[K, V]
-
def
modifyOrRemove(f: (K, V, Int) ⇒ Option[V])(implicit K: Key[K]): RadixTree[K, V]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
packed(implicit K: Key[K], V: Hash[V]): RadixTree[K, V]
-
val
prefix: K
-
def
prepend(prefix: K)(implicit K: Key[K]): RadixTree[K, V]
-
def
printStructure: String
-
def
startsWith(prefix: K)(implicit K: Key[K]): Boolean
-
def
subtreeWithPrefix(prefix: K)(implicit K: Key[K]): RadixTree[K, _ <: V]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
values(implicit K: Key[K]): Traversable[V]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from NoEquals
Inherited from AnyRef
Inherited from Any
