class
StructuredMapOfList[V] extends AbstractStructuredMap[V, List[V]]
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
-
def
apply(key: String): List[V]
-
final
def
asInstanceOf[T0]: T0
-
def
blankI: List[Nothing]
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fold[Acc](node: DataAndChildren[V, List[V]], initial: Acc, fn: (Acc, String, List[V]) ⇒ Acc): Acc
-
def
fold[Acc](initial: Acc)(fn: (Acc, String, List[V]) ⇒ Acc): Acc
-
def
get(key: String): List[V]
-
def
get(depth: Int, key: Key, node: DataAndChildren[V, List[V]]): List[V]
-
final
def
getClass(): Class[_]
-
def
getNodeWithKey(depth: Int, key: Key, node: DataAndChildren[V, List[V]]): Option[DataAndChildren[V, List[V]]]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
kidsOf(key: Key): List[Key]
-
def
makeNewV(key: Key, oldI: List[V], v: V): List[V]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
put(depth: Int, key: Key, node: DataAndChildren[V, List[V]], value: V): DataAndChildren[V, List[V]]
-
implicit
def
stringToKey(key: String): Key
-
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
-
def
walk(node: DataAndChildren[V, List[V]], fn: (String, List[V]) ⇒ Unit): Unit
-
def
walk(fn: (String, List[V]) ⇒ Unit): Unit
Inherited from AnyRef
Inherited from Any
