Class Long2ReferenceRBTreeMap<V>
- All Implemented Interfaces:
Function<Long,V>,Long2ReferenceFunction<V>,Long2ReferenceMap<V>,Long2ReferenceSortedMap<V>,Serializable,Cloneable,Function<Long,V>,LongFunction<V>,Map<Long,V>,SortedMap<Long,V>
public class Long2ReferenceRBTreeMap<V> extends AbstractLong2ReferenceSortedMap<V> implements Serializable, 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.
- See Also:
- Serialized Form
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap
AbstractLong2ReferenceMap.BasicEntry<V>, AbstractLong2ReferenceMap.BasicEntrySet<V>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceMap
Long2ReferenceMap.FastEntrySet<V>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceSortedMap
Long2ReferenceSortedMap.FastSortedEntrySet<V> -
Constructor Summary
Constructors Constructor Description Long2ReferenceRBTreeMap()Creates a new empty tree map.Long2ReferenceRBTreeMap(long[] k, V[] v)Creates a new tree map using the elements of two parallel arrays.Long2ReferenceRBTreeMap(long[] k, V[] v, Comparator<? super Long> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.Long2ReferenceRBTreeMap(Long2ReferenceMap<? extends V> m)Creates a new tree map copying a given map.Long2ReferenceRBTreeMap(Long2ReferenceSortedMap<V> m)Creates a new tree map copying a given sorted map (and itsComparator).Long2ReferenceRBTreeMap(Comparator<? super Long> c)Creates a new empty tree map with the given comparator.Long2ReferenceRBTreeMap(Map<? extends Long,? extends V> m)Creates a new tree map copying a given map.Long2ReferenceRBTreeMap(SortedMap<Long,V> m)Creates a new tree map copying a given sorted map (and itsComparator). -
Method Summary
Modifier and Type Method Description voidclear()Removes all of the mappings from this map (optional operation).Long2ReferenceRBTreeMap<V>clone()Returns a deep copy of this tree map.LongComparatorcomparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(long k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(Object v)longfirstLongKey()Returns the first (lowest) key currently in this map.Vget(long k)Returns the value to which the given key is mapped.Long2ReferenceSortedMap<V>headMap(long to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()LongSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.longlastLongKey()Returns the last (highest) key currently in this map.ObjectSortedSet<Long2ReferenceMap.Entry<V>>long2ReferenceEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.Vput(long k, V v)Adds a pair to the map (optional operation).Vremove(long k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Long2ReferenceSortedMap<V>subMap(long from, long to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Long2ReferenceSortedMap<V>tailMap(long from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.ReferenceCollection<V>values()Returns a type-specific collection view of the values contained in this map.Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap
equals, hashCode, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceMethods inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMapMethods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
Constructor Details
-
Long2ReferenceRBTreeMap
public Long2ReferenceRBTreeMap()Creates a new empty tree map. -
Long2ReferenceRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Long2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Long2ReferenceRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Long2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Long2ReferenceRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- a type-specific sorted map to be copied into the new tree map.
-
Long2ReferenceRBTreeMap
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- ifkandvhave different lengths.
-
Long2ReferenceRBTreeMap
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- ifkandvhave different lengths.
-
-
Method Details
-
put
Description copied from interface:Long2ReferenceFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceLong2ReferenceFunction<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
Description copied from interface:Long2ReferenceFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceLong2ReferenceFunction<V>- Parameters:
k- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
Function.remove(Object)
-
containsValue
- Specified by:
containsValuein interfaceMap<Long,V>- Overrides:
containsValuein classAbstractLong2ReferenceMap<V>
-
clear
public void clear()Description copied from interface:Long2ReferenceMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
public boolean containsKey(long k)Description copied from interface:Long2ReferenceMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceLong2ReferenceFunction<V>- Specified by:
containsKeyin interfaceLong2ReferenceMap<V>- Overrides:
containsKeyin classAbstractLong2ReferenceMap<V>- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
Map.containsKey(Object)
-
size
public int size()Description copied from interface:Long2ReferenceMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE. -
isEmpty
public boolean isEmpty() -
get
Description copied from interface:Long2ReferenceFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceLong2ReferenceFunction<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)
-
firstLongKey
public long firstLongKey()Description copied from interface:Long2ReferenceSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstLongKeyin interfaceLong2ReferenceSortedMap<V>- See Also:
SortedMap.firstKey()
-
lastLongKey
public long lastLongKey()Description copied from interface:Long2ReferenceSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastLongKeyin interfaceLong2ReferenceSortedMap<V>- See Also:
SortedMap.lastKey()
-
long2ReferenceEntrySet
Description copied from interface:Long2ReferenceSortedMapReturns 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:
long2ReferenceEntrySetin interfaceLong2ReferenceMap<V>- Specified by:
long2ReferenceEntrySetin interfaceLong2ReferenceSortedMap<V>- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Long2ReferenceSortedMap.entrySet()
-
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:
keySetin interfaceLong2ReferenceMap<V>- Specified by:
keySetin interfaceLong2ReferenceSortedMap<V>- Specified by:
keySetin interfaceMap<Long,V>- Specified by:
keySetin interfaceSortedMap<Long,V>- Overrides:
keySetin classAbstractLong2ReferenceSortedMap<V>- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
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:
valuesin interfaceLong2ReferenceMap<V>- Specified by:
valuesin interfaceLong2ReferenceSortedMap<V>- Specified by:
valuesin interfaceMap<Long,V>- Specified by:
valuesin interfaceSortedMap<Long,V>- Overrides:
valuesin classAbstractLong2ReferenceSortedMap<V>- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
Description copied from interface:Long2ReferenceSortedMapReturns 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:
comparatorin interfaceLong2ReferenceSortedMap<V>- Specified by:
comparatorin interfaceSortedMap<Long,V>- See Also:
SortedMap.comparator()
-
headMap
Description copied from interface:Long2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys are strictly less thantoKey.Note that this specification strengthens the one given in
SortedMap.headMap(Object).- Specified by:
headMapin interfaceLong2ReferenceSortedMap<V>- See Also:
SortedMap.headMap(Object)
-
tailMap
Description copied from interface:Long2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.Note that this specification strengthens the one given in
SortedMap.tailMap(Object).- Specified by:
tailMapin interfaceLong2ReferenceSortedMap<V>- See Also:
SortedMap.tailMap(Object)
-
subMap
Description copied from interface:Long2ReferenceSortedMapReturns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).- Specified by:
subMapin interfaceLong2ReferenceSortedMap<V>- See Also:
SortedMap.subMap(Object,Object)
-
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.
- Returns:
- a deep copy of this tree map.
-