it.unimi.dsi.fastutil.floats
Class Float2ReferenceRBTreeMap<V>

java.lang.Object
  extended by it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceFunction<V>
      extended by it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceMap<V>
          extended by it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceSortedMap<V>
              extended by it.unimi.dsi.fastutil.floats.Float2ReferenceRBTreeMap<V>
All Implemented Interfaces:
Float2ReferenceFunction<V>, Float2ReferenceMap<V>, Float2ReferenceSortedMap<V>, Function<Float,V>, Serializable, Cloneable, Map<Float,V>, SortedMap<Float,V>

public class Float2ReferenceRBTreeMap<V>
extends AbstractFloat2ReferenceSortedMap<V>
implements Serializable, Cloneable

A type-specific red-black tree map with a fast, small-footprint implementation.

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.

See Also:
Serialized Form

Nested Class Summary
 
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceMap
AbstractFloat2ReferenceMap.BasicEntry<V>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ReferenceSortedMap
Float2ReferenceSortedMap.FastSortedEntrySet<V>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ReferenceMap
Float2ReferenceMap.FastEntrySet<V>
 
Field Summary
static long serialVersionUID
           
 
Constructor Summary
Float2ReferenceRBTreeMap()
          Creates a new empty tree map.
Float2ReferenceRBTreeMap(Comparator<? super Float> c)
          Creates a new empty tree map with the given comparator.
Float2ReferenceRBTreeMap(float[] k, V[] v)
          Creates a new tree map using the elements of two parallel arrays.
Float2ReferenceRBTreeMap(float[] k, V[] v, Comparator<? super Float> c)
          Creates a new tree map using the elements of two parallel arrays and the given comparator.
Float2ReferenceRBTreeMap(Float2ReferenceMap<? extends V> m)
          Creates a new tree map copying a given map.
Float2ReferenceRBTreeMap(Float2ReferenceSortedMap<V> m)
          Creates a new tree map copying a given sorted map (and its Comparator).
Float2ReferenceRBTreeMap(Map<? extends Float,? extends V> m)
          Creates a new tree map copying a given map.
Float2ReferenceRBTreeMap(SortedMap<Float,V> m)
          Creates a new tree map copying a given sorted map (and its Comparator).
 
Method Summary
 void clear()
          Removes all associations from this function (optional operation).
 Float2ReferenceRBTreeMap<V> clone()
          Returns a deep copy of this tree map.
 FloatComparator comparator()
          Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
 boolean containsKey(float k)
          Checks whether the given value is contained in AbstractFloat2ReferenceMap.keySet().
 boolean containsValue(Object v)
          Checks whether the given value is contained in AbstractFloat2ReferenceMap.values().
 float firstFloatKey()
           
 ObjectSortedSet<Float2ReferenceMap.Entry<V>> float2ReferenceEntrySet()
          Returns a type-specific sorted-set view of the mappings contained in this map.
 V get(float k)
          Returns the value to which the given key is mapped.
 Float2ReferenceSortedMap<V> headMap(float to)
          Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
 boolean isEmpty()
           
 FloatSortedSet keySet()
          Returns a type-specific sorted set view of the keys contained in this map.
 float lastFloatKey()
           
 V put(float k, V v)
          Adds a pair to the map.
 V put(Float ok, V ov)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 V remove(float k)
          Removes the mapping with the given key.
 V remove(Object ok)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 int size()
          Returns the intended number of keys in this function, or -1 if no such number exists.
 Float2ReferenceSortedMap<V> subMap(float from, float to)
          Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
 Float2ReferenceSortedMap<V> tailMap(float from)
          Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
 ReferenceCollection<V> values()
          Returns a type-specific collection view of the values contained in this map.
 
Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
 
Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceMap
equals, hashCode, putAll, toString
 
Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ReferenceFunction
containsKey, defaultReturnValue, defaultReturnValue, get
 
Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait
 
Methods inherited from interface it.unimi.dsi.fastutil.floats.Float2ReferenceFunction
defaultReturnValue, defaultReturnValue
 
Methods inherited from interface it.unimi.dsi.fastutil.Function
containsKey, get
 
Methods inherited from interface java.util.Map
containsKey, equals, get, hashCode, putAll
 

Field Detail

serialVersionUID

public static final long serialVersionUID
See Also:
Constant Field Values
Constructor Detail

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap()
Creates a new empty tree map.


Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.

Parameters:
c - a (possibly type-specific) comparator.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(Map<? extends Float,? extends V> m)
Creates a new tree map copying a given map.

Parameters:
m - a Map to be copied into the new tree map.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(SortedMap<Float,V> m)
Creates a new tree map copying a given sorted map (and its Comparator).

Parameters:
m - a SortedMap to be copied into the new tree map.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(Float2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.

Parameters:
m - a type-specific map to be copied into the new tree map.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(Float2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator).

Parameters:
m - a type-specific sorted map to be copied into the new tree map.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(float[] k,
                                V[] v,
                                Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.

Parameters:
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.
Throws:
IllegalArgumentException - if k and v have different lengths.

Float2ReferenceRBTreeMap

public Float2ReferenceRBTreeMap(float[] k,
                                V[] v)
Creates a new tree map using the elements of two parallel arrays.

Parameters:
k - the array of keys of the new tree map.
v - the array of corresponding values in the new tree map.
Throws:
IllegalArgumentException - if k and v have different lengths.
Method Detail

put

public V put(float k,
             V v)
Description copied from interface: Float2ReferenceFunction
Adds a pair to the map.

Specified by:
put in interface Float2ReferenceFunction<V>
Overrides:
put in class AbstractFloat2ReferenceFunction<V>
Parameters:
k - the key.
v - the value.
Returns:
the old value, or the default return value if no value was present for the given key.
See Also:
Function.put(Object,Object)

remove

public V remove(float k)
Description copied from interface: Float2ReferenceFunction
Removes the mapping with the given key.

Specified by:
remove in interface Float2ReferenceFunction<V>
Overrides:
remove in class AbstractFloat2ReferenceFunction<V>
Returns:
the old value, or the default return value if no value was present for the given key.
See Also:
Function.remove(Object)

put

public V put(Float ok,
             V ov)
Description copied from class: AbstractFloat2ReferenceFunction
Delegates to the corresponding type-specific method, taking care of returning 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.

Specified by:
put in interface Function<Float,V>
Specified by:
put in interface Map<Float,V>
Overrides:
put in class AbstractFloat2ReferenceFunction<V>
Parameters:
ok - the key.
ov - the value.
Returns:
the old value, or null if no value was present for the given key.
See Also:
Map.put(Object,Object)

remove

public V remove(Object ok)
Description copied from class: AbstractFloat2ReferenceFunction
Delegates to the corresponding type-specific method, taking care of returning 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.

Specified by:
remove in interface Function<Float,V>
Specified by:
remove in interface Map<Float,V>
Overrides:
remove in class AbstractFloat2ReferenceFunction<V>
Returns:
the old value, or null if no value was present for the given key.
See Also:
Map.remove(Object)

containsValue

public boolean containsValue(Object v)
Description copied from class: AbstractFloat2ReferenceMap
Checks whether the given value is contained in AbstractFloat2ReferenceMap.values().

Specified by:
containsValue in interface Map<Float,V>
Overrides:
containsValue in class AbstractFloat2ReferenceMap<V>

clear

public void clear()
Description copied from interface: Function
Removes all associations from this function (optional operation).

Specified by:
clear in interface Function<Float,V>
Specified by:
clear in interface Map<Float,V>
Overrides:
clear in class AbstractFloat2ReferenceFunction<V>
See Also:
Map.clear()

containsKey

public boolean containsKey(float k)
Description copied from class: AbstractFloat2ReferenceMap
Checks whether the given value is contained in AbstractFloat2ReferenceMap.keySet().

Specified by:
containsKey in interface Float2ReferenceFunction<V>
Overrides:
containsKey in class AbstractFloat2ReferenceMap<V>
See Also:
Function.containsKey(Object)

size

public int size()
Description copied from interface: Function
Returns the intended number of keys in this function, or -1 if no such number exists.

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.

Specified by:
size in interface Function<Float,V>
Specified by:
size in interface Map<Float,V>
Returns:
the intended number of keys in this function, or -1 if that number is not available.

isEmpty

public boolean isEmpty()
Specified by:
isEmpty in interface Map<Float,V>
Overrides:
isEmpty in class AbstractFloat2ReferenceMap<V>

get

public V get(float k)
Description copied from interface: Float2ReferenceFunction
Returns the value to which the given key is mapped.

Specified by:
get in interface Float2ReferenceFunction<V>
Parameters:
k - the key.
Returns:
the corresponding value, or the default return value if no value was present for the given key.
See Also:
Function.get(Object)

firstFloatKey

public float firstFloatKey()
Specified by:
firstFloatKey in interface Float2ReferenceSortedMap<V>
See Also:
SortedMap.firstKey()

lastFloatKey

public float lastFloatKey()
Specified by:
lastFloatKey in interface Float2ReferenceSortedMap<V>
See Also:
SortedMap.lastKey()

float2ReferenceEntrySet

public ObjectSortedSet<Float2ReferenceMap.Entry<V>> float2ReferenceEntrySet()
Description copied from interface: Float2ReferenceSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map. Note that this specification strengthens the one given in the corresponding type-specific unsorted map.

Specified by:
float2ReferenceEntrySet in interface Float2ReferenceMap<V>
Specified by:
float2ReferenceEntrySet in interface Float2ReferenceSortedMap<V>
Returns:
a type-specific sorted-set view of the mappings contained in this map.
See Also:
Float2ReferenceSortedMap.entrySet()

keySet

public FloatSortedSet keySet()
Returns a type-specific sorted set view of the keys contained in this map.

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.

Specified by:
keySet in interface Float2ReferenceMap<V>
Specified by:
keySet in interface Float2ReferenceSortedMap<V>
Specified by:
keySet in interface Map<Float,V>
Specified by:
keySet in interface SortedMap<Float,V>
Overrides:
keySet in class AbstractFloat2ReferenceSortedMap<V>
Returns:
a type-specific sorted set view of the keys contained in this map.
See Also:
Map.keySet()

values

public ReferenceCollection<V> values()
Returns a type-specific collection view of the values contained in this map.

In addition to the semantics of Map.values(), you can safely cast the collection returned by this call to a type-specific collection interface.

Specified by:
values in interface Float2ReferenceMap<V>
Specified by:
values in interface Float2ReferenceSortedMap<V>
Specified by:
values in interface Map<Float,V>
Specified by:
values in interface SortedMap<Float,V>
Overrides:
values in class AbstractFloat2ReferenceSortedMap<V>
Returns:
a type-specific collection view of the values contained in this map.
See Also:
Map.values()

comparator

public FloatComparator comparator()
Description copied from interface: Float2ReferenceSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.

Note that this specification strengthens the one given in SortedMap.comparator().

Specified by:
comparator in interface Float2ReferenceSortedMap<V>
Specified by:
comparator in interface SortedMap<Float,V>
See Also:
SortedMap.comparator()

headMap

public Float2ReferenceSortedMap<V> headMap(float to)
Description copied from interface: Float2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less than toKey.

Specified by:
headMap in interface Float2ReferenceSortedMap<V>
See Also:
SortedMap.headMap(Object)

tailMap

public Float2ReferenceSortedMap<V> tailMap(float from)
Description copied from interface: Float2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.

Specified by:
tailMap in interface Float2ReferenceSortedMap<V>
See Also:
SortedMap.tailMap(Object)

subMap

public Float2ReferenceSortedMap<V> subMap(float from,
                                          float to)
Description copied from interface: Float2ReferenceSortedMap
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.

Specified by:
subMap in interface Float2ReferenceSortedMap<V>
See Also:
SortedMap.subMap(Object,Object)

clone

public Float2ReferenceRBTreeMap<V> clone()
Returns a deep copy of this tree map.

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.

Overrides:
clone in class Object
Returns:
a deep copy of this tree map.