public class Object2FloatRBTreeMap<K> extends AbstractObject2FloatSortedMap<K> implements java.io.Serializable, java.lang.Cloneable
The iterators provided by the views of this class are type-specific bidirectional iterators.
Moreover, the iterator returned by iterator()
can be safely cast
to a type-specific list iterator.
AbstractObject2FloatMap.BasicEntry<K>
Object2FloatSortedMap.FastSortedEntrySet<K>
Object2FloatMap.FastEntrySet<K>
Constructor and Description |
---|
Object2FloatRBTreeMap()
Creates a new empty tree map.
|
Object2FloatRBTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2FloatRBTreeMap(K[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2FloatRBTreeMap(K[] k,
float[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2FloatRBTreeMap(java.util.Map<? extends K,? extends java.lang.Float> m)
Creates a new tree map copying a given map.
|
Object2FloatRBTreeMap(Object2FloatMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2FloatRBTreeMap(Object2FloatSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Object2FloatRBTreeMap(java.util.SortedMap<K,java.lang.Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2FloatRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(java.lang.Object k)
Checks whether the given value is contained in
AbstractObject2FloatMap.keySet() . |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractObject2FloatMap.values() . |
K |
firstKey() |
java.lang.Float |
get(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
getFloat(java.lang.Object k)
Returns the value to which the given key is mapped.
|
Object2FloatSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2FloatMap.Entry<K>> |
object2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
float |
put(K k,
float v)
Adds a pair to the map.
|
java.lang.Float |
put(K ok,
java.lang.Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
java.lang.Float |
remove(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
removeFloat(java.lang.Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Object2FloatSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Object2FloatSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet
containsValue, equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
defaultReturnValue, defaultReturnValue
public Object2FloatRBTreeMap()
public Object2FloatRBTreeMap(java.util.Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2FloatRBTreeMap(java.util.Map<? extends K,? extends java.lang.Float> m)
m
- a Map
to be copied into the new tree map.public Object2FloatRBTreeMap(java.util.SortedMap<K,java.lang.Float> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Object2FloatRBTreeMap(Object2FloatMap<? extends K> m)
m
- a type-specific map to be copied into the new tree map.public Object2FloatRBTreeMap(Object2FloatSortedMap<K> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Object2FloatRBTreeMap(K[] k, float[] v, java.util.Comparator<? super K> c)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.c
- a (possibly type-specific) comparator.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Object2FloatRBTreeMap(K[] k, float[] v)
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public float put(K k, float v)
Object2FloatFunction
put
in interface Object2FloatFunction<K>
put
in class AbstractObject2FloatFunction<K>
k
- the key.v
- the value.Function.put(Object,Object)
public float removeFloat(java.lang.Object k)
Object2FloatFunction
removeFloat
in interface Object2FloatFunction<K>
removeFloat
in class AbstractObject2FloatFunction<K>
k
- the key.Function.remove(Object)
public java.lang.Float put(K ok, java.lang.Float ov)
AbstractObject2FloatFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
put
in interface Function<K,java.lang.Float>
put
in interface java.util.Map<K,java.lang.Float>
put
in class AbstractObject2FloatFunction<K>
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Float remove(java.lang.Object ok)
AbstractObject2FloatFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
remove
in interface Function<K,java.lang.Float>
remove
in interface java.util.Map<K,java.lang.Float>
remove
in class AbstractObject2FloatFunction<K>
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(float v)
AbstractObject2FloatMap
AbstractObject2FloatMap.values()
.containsValue
in interface Object2FloatMap<K>
containsValue
in class AbstractObject2FloatMap<K>
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(java.lang.Object k)
AbstractObject2FloatMap
AbstractObject2FloatMap.keySet()
.containsKey
in interface Function<K,java.lang.Float>
containsKey
in interface java.util.Map<K,java.lang.Float>
containsKey
in class AbstractObject2FloatMap<K>
k
- the key.key
.Map.containsKey(Object)
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
isEmpty
in interface java.util.Map<K,java.lang.Float>
isEmpty
in class AbstractObject2FloatMap<K>
public float getFloat(java.lang.Object k)
Object2FloatFunction
getFloat
in interface Object2FloatFunction<K>
k
- the key.Function.get(Object)
public java.lang.Float get(java.lang.Object ok)
AbstractObject2FloatFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
get
in interface Function<K,java.lang.Float>
get
in interface java.util.Map<K,java.lang.Float>
get
in class AbstractObject2FloatFunction<K>
ok
- the key.null
if no value was present for the given key.Map.get(Object)
public K firstKey()
firstKey
in interface java.util.SortedMap<K,java.lang.Float>
public K lastKey()
lastKey
in interface java.util.SortedMap<K,java.lang.Float>
public ObjectSortedSet<Object2FloatMap.Entry<K>> object2FloatEntrySet()
Object2FloatSortedMap
object2FloatEntrySet
in interface Object2FloatMap<K>
object2FloatEntrySet
in interface Object2FloatSortedMap<K>
Object2FloatSortedMap.entrySet()
public ObjectSortedSet<K> keySet()
In addition to the semantics of Map.keySet()
, you can
safely cast the set returned by this call to a type-specific sorted
set interface.
keySet
in interface Object2FloatMap<K>
keySet
in interface Object2FloatSortedMap<K>
keySet
in interface java.util.Map<K,java.lang.Float>
keySet
in interface java.util.SortedMap<K,java.lang.Float>
keySet
in class AbstractObject2FloatSortedMap<K>
Map.keySet()
public FloatCollection values()
In addition to the semantics of Map.values()
, you can
safely cast the collection returned by this call to a type-specific collection
interface.
values
in interface Object2FloatMap<K>
values
in interface Object2FloatSortedMap<K>
values
in interface java.util.Map<K,java.lang.Float>
values
in interface java.util.SortedMap<K,java.lang.Float>
values
in class AbstractObject2FloatSortedMap<K>
Map.values()
public java.util.Comparator<? super K> comparator()
Object2FloatSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Object2FloatSortedMap<K>
comparator
in interface java.util.SortedMap<K,java.lang.Float>
SortedMap.comparator()
public Object2FloatSortedMap<K> headMap(K to)
Object2FloatSortedMap
toKey
.
Note that this specification strengthens the one given in SortedMap.headMap(Object)
.
headMap
in interface Object2FloatSortedMap<K>
headMap
in interface java.util.SortedMap<K,java.lang.Float>
SortedMap.headMap(Object)
public Object2FloatSortedMap<K> tailMap(K from)
Object2FloatSortedMap
fromKey
.
Note that this specification strengthens the one given in SortedMap.tailMap(Object)
.
tailMap
in interface Object2FloatSortedMap<K>
tailMap
in interface java.util.SortedMap<K,java.lang.Float>
SortedMap.tailMap(Object)
public Object2FloatSortedMap<K> subMap(K from, K to)
Object2FloatSortedMap
fromKey
, inclusive, to toKey
, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object)
.
subMap
in interface Object2FloatSortedMap<K>
subMap
in interface java.util.SortedMap<K,java.lang.Float>
SortedMap.subMap(Object,Object)
public Object2FloatRBTreeMap<K> clone()
This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone
in class java.lang.Object