in scala/collection/immutable/Tree-class
object GBNil
-
case object GBNil
- extends GBTree[A,B]
- with ScalaObject
Method Summary
|
final
|
def apply(key: A): All
|
final
|
def balance(s: Int): GBNil
|
final
|
def count: Info
Calculates 2^h, and size, where h is the height of the tree
and size is the number of nodes in the tree.
|
final
|
def delete(_key: A): All
|
final
|
def get(_key: A): None
|
final override
|
def hashCode(): Int
|
final
|
def insert(key: A, value: B, s: Int): InsertTree[A,B]
|
final
|
def is_defined(key: A): Boolean
|
final
|
def merge(larger: GBTree[A,B]): GBTree[A,B]
|
final
|
def mk_iter(iter_tail: List[GBTree[A,B]]): List[GBTree[A,B]]
|
final
|
def take_smallest: Tuple2[B,GBTree[A,B]]
|
final
|
def toList(acc: List[B]): List[B]
|
final
|
def update(key: A, value: B): All
|
count
final def count: Info
-
Calculates 2^h, and size, where h is the height of the tree
and size is the number of nodes in the tree.
is_defined
final def is_defined(key: A): Boolean
get
final def get(_key: A): None
apply
final def apply(key: A): All
update
final def update(key: A, value: B): All
insert
final def insert(key: A, value: B, s: Int): InsertTree[A,B]
toList
final def toList(acc: List[B]): List[B]
mk_iter
final def mk_iter(iter_tail: List[GBTree[A,B]]): List[GBTree[A,B]]
merge
final def merge(larger: GBTree[A,B]): GBTree[A,B]
take_smallest
final def take_smallest: Tuple2[B,GBTree[A,B]]
delete
final def delete(_key: A): All
balance
final def balance(s: Int): GBNil
hashCode
final override def hashCode(): Int