object
RadixTree
Type Members
-
trait
Key[K] extends Eq[K] with Hash[K]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
implicit
def
additiveMonoid[K, V](implicit arg0: Key[K], arg1: AdditiveSemigroup[V]): AdditiveMonoid[RadixTree[K, V]]
-
def
apply[K, V](kvs: (K, V)*)(implicit arg0: Key[K]): RadixTree[K, V]
-
implicit
def
arrayIsKey[K](implicit arg0: Order[K], arg1: Hash[K], arg2: ClassTag[K]): Key[Array[K]]
-
final
def
asInstanceOf[T0]: T0
-
implicit
val
byteArrayIsKey: Key[Array[Byte]]
-
implicit
val
charArrayIsKey: Key[Array[Char]]
-
def
clone(): AnyRef
-
def
empty[K, V](implicit arg0: Key[K], K: Key[K]): RadixTree[K, V]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
implicit
def
eqv[K, V](implicit arg0: Eq[K], arg1: Eq[V]): Eq[RadixTree[K, V]]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
implicit
def
hash[K, V](implicit arg0: Hash[K], arg1: Hash[V]): Hash[RadixTree[K, V]]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
implicit
def
monoid[K, V](implicit arg0: Key[K]): Monoid[RadixTree[K, V]]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
show[K, V](implicit arg0: Key[K], arg1: Show[K], arg2: Show[V]): Show[RadixTree[K, V]]
-
def
singleton[K, V](key: K, value: V)(implicit arg0: Key[K]): RadixTree[K, V]
-
implicit
val
stringIsKey: Key[String]
-
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 AnyRef
Inherited from Any
