Class

ltbs.uniform.TreeLikeInstances

MapTree

Related Doc: package TreeLikeInstances

Permalink

class MapTree[K, V] extends TreeLike[Map[List[K], V]]

Linear Supertypes
TreeLike[Map[List[K], V]], Serializable, Serializable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MapTree
  2. TreeLike
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MapTree()

    Permalink

Type Members

  1. type Key = K

    Permalink
    Definition Classes
    MapTreeTreeLike
  2. type T = Map[List[K], V]

    Permalink
  3. type Value = V

    Permalink
    Definition Classes
    MapTreeTreeLike

Value Members

  1. final def !=(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def /(a: Map[List[K], V], key: Key): Map[List[K], V]

    Permalink

    gives the subtree at a given key

    gives the subtree at a given key

    Definition Classes
    TreeLike
  4. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  5. def appendWith(a: T, key: Key): T

    Permalink
    Definition Classes
    MapTreeTreeLike
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def atPath(a: Map[List[K], V], path: List[Key]): Map[List[K], V]

    Permalink

    gives the subtree at a given path

    gives the subtree at a given path

    Definition Classes
    TreeLike
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def definedAt(a: Map[List[K], V], key: Key): Boolean

    Permalink

    returns 'true' if there is a subtree at the given key

    returns 'true' if there is a subtree at the given key

    Definition Classes
    TreeLike
  10. def definedAtPath(a: Map[List[K], V], key: List[Key]): Boolean

    Permalink

    returns 'true' if there is a subtree at the given path

    returns 'true' if there is a subtree at the given path

    Definition Classes
    TreeLike
  11. def definedAtRoot(a: Map[List[K], V]): Boolean

    Permalink

    returns 'true' if there is a subtree at the given path

    returns 'true' if there is a subtree at the given path

    Definition Classes
    TreeLike
  12. val empty: Map[List[K], V]

    Permalink

    a null-graph (no verticies/K0)

    a null-graph (no verticies/K0)

    Definition Classes
    MapTreeTreeLike
  13. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  18. def isEmpty(a: Map[List[K], V]): Boolean

    Permalink
    Definition Classes
    TreeLike
  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  20. def isNonEmpty(a: Map[List[K], V]): Boolean

    Permalink
    Definition Classes
    TreeLike
  21. def listSubtrees(a: T): List[Key]

    Permalink
    Definition Classes
    MapTreeTreeLike
  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. def one(in: Value): T

    Permalink

    create a tree with a single vertex (a singleton graph)

    create a tree with a single vertex (a singleton graph)

    Definition Classes
    MapTreeTreeLike
  26. def prefixWith(a: T, key: Key): T

    Permalink

    Add an key to the start of each existing key, effectively creating a new tree with the existing tree as a single subtree

    Add an key to the start of each existing key, effectively creating a new tree with the existing tree as a single subtree

    Definition Classes
    MapTreeTreeLike
  27. def prefixWithMany(value: Map[List[K], V], key: List[Key]): Map[List[K], V]

    Permalink
    Definition Classes
    TreeLike
  28. def subTree(a: T, key: Key): T

    Permalink

    gives the subtree at a given key

    gives the subtree at a given key

    Definition Classes
    MapTreeTreeLike
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. def valueAt(a: Map[List[K], V], key: Key): Option[Value]

    Permalink
    Definition Classes
    TreeLike
  32. def valueAtPath(a: Map[List[K], V], key: List[Key]): Option[Value]

    Permalink
    Definition Classes
    TreeLike
  33. def valueAtRoot(a: T): Option[Value]

    Permalink
    Definition Classes
    MapTreeTreeLike
  34. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from TreeLike[Map[List[K], V]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped