in scala/collection/immutable
class GBTree
-
protected abstract class GBTree[A,B](view: (A) => Ordered[A])
- extends Object
- with ScalaObject
- with java.io.Serializable
-
GBTree is an internal class used by Tree.
Method Summary
|
abstract
|
def apply(key: A): B
|
abstract
|
def balance(s: Int): GBTree[A,B]
|
abstract
|
def count: Tuple2[Int,Int]
Calculates 2^h, and size, where h is the height of the tree
and size is the number of nodes in the tree.
|
abstract
|
def delete(key: A): GBTree[A,B]
|
abstract
|
def get(key: A): Option[B]
|
abstract
|
def insert(key: A, value: B, size: Int): InsertTree[A,B]
|
abstract
|
def isDefinedAt(Key: A): Boolean
|
abstract
|
def merge(t: GBTree[A,B]): GBTree[A,B]
|
abstract
|
def mk_iter(iter_tail: List[GBTree[A,B]]): List[GBTree[A,B]]
|
abstract
|
def takeSmallest: Tuple3[A,B,GBTree[A,B]]
|
abstract
|
def toList(acc: List[Tuple2[A,B]]): List[Tuple2[A,B]]
|
abstract
|
def update(key: A, value: B): GBTree[A,B]
|
Methods inherited from java/lang/Object-class
|
clone, eq, equals, finalize, getClass, hashCode, ne, notify, notifyAll, synchronized, toString, wait, wait, wait |
aNode
type aNode = GBTree[A,B]
anInsertTree
type anInsertTree = InsertTree[A,B]
count
abstract def count: Tuple2[Int,Int]
-
Calculates 2^h, and size, where h is the height of the tree
and size is the number of nodes in the tree.
isDefinedAt
abstract def isDefinedAt(Key: A): Boolean
get
abstract def get(key: A): Option[B]
apply
abstract def apply(key: A): B
update
abstract def update(key: A, value: B): GBTree[A,B]
insert
abstract def insert(key: A, value: B, size: Int): InsertTree[A,B]
toList
abstract def toList(acc: List[Tuple2[A,B]]): List[Tuple2[A,B]]
mk_iter
abstract def mk_iter(iter_tail: List[GBTree[A,B]]): List[GBTree[A,B]]
delete
abstract def delete(key: A): GBTree[A,B]
merge
abstract def merge(t: GBTree[A,B]): GBTree[A,B]
takeSmallest
abstract def takeSmallest: Tuple3[A,B,GBTree[A,B]]
balance
abstract def balance(s: Int): GBTree[A,B]