class
FullBinaryTreeOpsForAnnotatedTree[K, V, T, A] extends FullBinaryTreeOps[AnnotatedTree[K, V, T, A], (K, Predicate[V], A), (Int, T, A)]
Instance Constructors
-
new
FullBinaryTreeOpsForAnnotatedTree()
Type Members
-
type
Label = Either[(K, Predicate[V], A), (Int, T, A)]
-
-
implicit
class
OpsForNode extends AnyRef
-
implicit
class
OpsForTree extends AnyRef
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
children(node: Node): Iterable[Node]
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fold[A](tree: AnnotatedTree[K, V, T, A])(f: (Either[(K, Predicate[V], A), (Int, T, A)], Iterable[Node]) ⇒ A): Option[A]
-
def
fold[A](node: Node)(f: (Either[(K, Predicate[V], A), (Int, T, A)], Iterable[Node]) ⇒ A): A
-
def
foldNode[B](node: Node)(f: (Node, Node, (K, Predicate[V], A)) ⇒ B, g: ((Int, T, A)) ⇒ B): B
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
label(node: Node): Either[(K, Predicate[V], A), (Int, T, A)]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reduce[A](node: Node)(f: (Label, Iterable[A]) ⇒ A): A
-
def
reduce[A](tree: AnnotatedTree[K, V, T, A])(f: (Either[(K, Predicate[V], A), (Int, T, A)], Iterable[A]) ⇒ A): Option[A]
-
def
reduceNode[A](node: Node)(f: ((K, Predicate[V], A), Iterable[A]) ⇒ A)(g: ((Int, T, A)) ⇒ A): A
-
def
root(t: AnnotatedTree[K, V, T, A]): Option[Node]
-
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
