MapTreeLike

A tree with a map structure for the descendants data structure. Note: Map keys are invariant. We could make K contravariant and use existential types in the type lambda to make it so we could construct MapTree without having to specify the type in the root instance or leave instance.

K: key type of the map structure
A: type of the descendant data structure.

Linear Supertypes

Tree[A, [+V]Map[K, V], MapTreeLike[K, A]], AnyRef, Any

Known Subclasses

PolynomialEvaluator

Abstract Value Members

abstract def descendants: Map[K, _ <: MapTreeLike[K, A]]

Definition Classes
Tree
abstract val value: A

Definition Classes
Tree

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def dfs(): Iterator[(MapTreeLike[K, A], Int)]

Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering.
Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering. Each iterator value contains the node in the tree and the depth (root has 0 depth). This iterator requires O(B * D) auxiliary space where B is the branching factor and D is the tree depth.
returns
a NON thread-safe iterator over the nodes in the tree for a DFS ordering.

Definition Classes
Tree
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

trait MapTreeLike[K, +A] extends Tree[A, [+V]Map[K, V], MapTreeLike[K, A]]

Abstract Value Members

abstract def descendants: Map[K, _ <: MapTreeLike[K, A]]

abstract val value: A

Concrete 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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dfs(): Iterator[(MapTreeLike[K, A], Int)]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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 Tree[A, [+V]Map[K, V], MapTreeLike[K, A]]

Inherited from AnyRef

Inherited from Any

Ungrouped