|
Scala 2.3.2
|
protected
class
Node
[B]
extends
scala.collection.immutable.UnbalancedTreeMap[A, B]
with
scala.ScalaObject
Constructor Summary | |
def
this
(key: A, value: B, left: scala.collection.immutable.UnbalancedTreeMap[A, B], right: scala.collection.immutable.UnbalancedTreeMap[A, B])
|
Val Summary | |
override protected
|
val
key
: A
|
override protected
|
val
value
: B
|
Def Summary | |
override
|
def
-
(k: A)
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
override protected
|
def
add
[B1 >: B]
(k: A, v: B1)
: scala.collection.immutable.UnbalancedTreeMap.Node[B1]
|
override
|
def
elements
: scala.Iterator[scala.Tuple2[A, B]]
|
override protected
|
def
findValue
(k: A)
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
override
|
def
isEmpty
: scala.Boolean
|
override
|
def
size
: scala.Int
|
override protected
|
def
smallest
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
Def inherited from scala.collection.immutable.UnbalancedTreeMap[A, B] | |
- , add, apply, elements, empty, findValue, get, insert, isEmpty, key, size, smallest, update, value |
Constructor Detail |
def
this
(key: A, value: B, left: scala.collection.immutable.UnbalancedTreeMap[A, B], right: scala.collection.immutable.UnbalancedTreeMap[A, B])
Val Detail |
Def Detail |
override
def
-
(k: A): scala.collection.immutable.UnbalancedTreeMap[A, B]
override protected
def
add
[B1 >: B](k: A, v: B1): scala.collection.immutable.UnbalancedTreeMap.Node[B1]
override
def
elements
: scala.Iterator[scala.Tuple2[A, B]]
override protected
def
findValue
(k: A): scala.collection.immutable.UnbalancedTreeMap[A, B]
override
def
isEmpty
: scala.Boolean
override
def
size
: scala.Int
override protected
def
smallest
: scala.collection.immutable.UnbalancedTreeMap[A, B]