TreeLike

abstract def appendWith(a: T, key: Key): T

abstract def empty: T

a null-graph (no verticies/K0)

abstract def getClass(): Class[_]

abstract def listSubtrees(a: T): List[Key]

abstract def one(in: Value): T

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

abstract def prefixWith(a: T, key: Key): T

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

abstract def subTree(a: T, key: Key): T

gives the subtree at a given key

abstract def valueAtRoot(a: T): Option[Value]

final def !=(arg0: Any): Boolean

final def ##(): Int

def /(a: T, key: Key): T

gives the subtree at a given key

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def atPath(a: T, path: List[Key]): T

gives the subtree at a given path

def definedAt(a: T, key: Key): Boolean

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

def definedAtPath(a: T, key: List[Key]): Boolean

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

def definedAtRoot(a: T): Boolean

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

def equals(arg0: Any): Boolean

def hashCode(): Int

def isEmpty(a: T): Boolean

final def isInstanceOf[T0]: Boolean

def isNonEmpty(a: T): Boolean

def prefixWithMany(value: T, key: List[Key]): T

def toString(): String

def valueAt(a: T, key: Key): Option[Value]

def valueAtPath(a: T, key: List[Key]): Option[Value]