|
Scala 2.4.0-RC1
|
class
UnbalancedTreeMap
[A, +B]
extends
java.lang.Object
with
scala.collection.immutable.Map[A, B]
with
scala.ScalaObject
Class Summary | |
protected
|
class
Node
[+B]
|
Constructor Summary | |
def
this
()(view$2: (A) => scala.Ordered[A])
|
Def Summary | |
def
-
(key: A)
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
|
protected
|
def
add
[B1 >: B]
(key: A, value: B1)
: scala.collection.immutable.UnbalancedTreeMap.Node[B1]
|
override
|
def
apply
(key: A)
: B
Retrieve the value which is associated with the given key. This method throws an exception if there is no mapping from the given key to a value. |
def
elements
: scala.Iterator[scala.Tuple2[A, B]]
Creates a new iterator over all elements contained in this object. |
|
def
empty
[C]
: scala.collection.immutable.UnbalancedTreeMap[A, C]
A factory to create empty maps of the same type of keys. |
|
protected
|
def
findValue
(key: A)
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
override
|
def
get
(key: A)
: scala.Option[B]
Check if this map maps key to a value and return the
value if it exists.
|
def
insert
[B1 >: B]
(key: A, value: B1)
: scala.collection.immutable.UnbalancedTreeMap.Node[B1]
A new TreeMap with the entry added is returned, assuming that key is not in the TreeMap. |
|
override
|
def
isEmpty
: scala.Boolean
|
protected
|
def
key
: A
|
def
size
: scala.Int
|
|
protected
|
def
smallest
: scala.collection.immutable.UnbalancedTreeMap[A, B]
|
def
update
[B1 >: B]
(key: A, value: B1)
: scala.collection.immutable.UnbalancedTreeMap.Node[B1]
A new TreeMap with the entry added is returned, if key is not in the TreeMap, otherwise the key is updated with the new entry. |
|
protected
|
def
value
: B
|
Def inherited from scala.collection.immutable.Map[A, B] | |
+ , +, +, ++, ++, -, -, --, --, empty, excl, excl, filter, incl, incl, mappingToString, transform, update, withDefault, withDefaultValue |
Constructor Detail |
Def Detail |
def
-
(key: A): scala.collection.immutable.UnbalancedTreeMap[A, B]
protected
def
add
[B1 >: B](key: A, value: B1): scala.collection.immutable.UnbalancedTreeMap.Node[B1]
key -
the key
Error("key -
not found").
def
elements
: scala.Iterator[scala.Tuple2[A, B]]
def
empty
[C]: scala.collection.immutable.UnbalancedTreeMap[A, C]
protected
def
findValue
(key: A): scala.collection.immutable.UnbalancedTreeMap[A, B]
override
def
get
(key: A): scala.Option[B]
key
to a value and return the
value if it exists.key -
the key of the mapping of interest
def
insert
[B1 >: B](key: A, value: B1): scala.collection.immutable.UnbalancedTreeMap.Node[B1]
override
def
isEmpty
: scala.Boolean
protected
def
key
: A
def
size
: scala.Int
protected
def
smallest
: scala.collection.immutable.UnbalancedTreeMap[A, B]
def
update
[B1 >: B](key: A, value: B1): scala.collection.immutable.UnbalancedTreeMap.Node[B1]
key -
...
value -
...
protected
def
value
: B