Class Object2IntAVLTreeMap<K>
- java.lang.Object
-
- it.unimi.dsi.fastutil.objects.AbstractObject2IntFunction<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObject2IntMap<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObject2IntSortedMap<K>
-
- it.unimi.dsi.fastutil.objects.Object2IntAVLTreeMap<K>
-
- All Implemented Interfaces:
Function<K,Integer>,Object2IntFunction<K>,Object2IntMap<K>,Object2IntSortedMap<K>,Serializable,Cloneable,Function<K,Integer>,ToIntFunction<K>,Map<K,Integer>,SortedMap<K,Integer>
public class Object2IntAVLTreeMap<K> extends AbstractObject2IntSortedMap<K> implements Serializable, Cloneable
A type-specific AVL 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.objects.AbstractObject2IntMap
AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2IntMap
Object2IntMap.FastEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2IntSortedMap
Object2IntSortedMap.FastSortedEntrySet<K>
-
-
Constructor Summary
Constructors Constructor Description Object2IntAVLTreeMap()Creates a new empty tree map.Object2IntAVLTreeMap(Object2IntMap<? extends K> m)Creates a new tree map copying a given map.Object2IntAVLTreeMap(Object2IntSortedMap<K> m)Creates a new tree map copying a given sorted map (and itsComparator).Object2IntAVLTreeMap(Comparator<? super K> c)Creates a new empty tree map with the given comparator.Object2IntAVLTreeMap(Map<? extends K,? extends Integer> m)Creates a new tree map copying a given map.Object2IntAVLTreeMap(SortedMap<K,Integer> m)Creates a new tree map copying a given sorted map (and itsComparator).Object2IntAVLTreeMap(K[] k, int[] v)Creates a new tree map using the elements of two parallel arrays.Object2IntAVLTreeMap(K[] k, int[] v, Comparator<? super K> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.
-
Method Summary
Modifier and Type Method Description intaddTo(K k, int incr)Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).Object2IntAVLTreeMap<K>clone()Returns a deep copy of this tree map.Comparator<? super K>comparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(Object k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(int v)Returnstrueif this map maps one or more keys to the specified value.KfirstKey()intgetInt(Object k)Returns the value to which the given key is mapped.Object2IntSortedMap<K>headMap(K to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()ObjectSortedSet<K>keySet()Returns a type-specific sorted set view of the keys contained in this map.KlastKey()ObjectSortedSet<Object2IntMap.Entry<K>>object2IntEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.intput(K k, int v)Adds a pair to the map (optional operation).intremoveInt(Object k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Object2IntSortedMap<K>subMap(K from, K to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Object2IntSortedMap<K>tailMap(K from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.IntCollectionvalues()Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2IntMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2IntFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2IntFunction
applyAsInt
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2IntMap
computeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2IntSortedMap
entrySet
-
-
-
-
Constructor Detail
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap()
Creates a new empty tree map.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(Map<? extends K,? extends Integer> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(SortedMap<K,Integer> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(Object2IntMap<? extends K> m)
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(Object2IntSortedMap<K> m)
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.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(K[] k, int[] v, Comparator<? super K> 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- ifkandvhave different lengths.
-
Object2IntAVLTreeMap
public Object2IntAVLTreeMap(K[] k, int[] 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- ifkandvhave different lengths.
-
-
Method Detail
-
addTo
public int addTo(K k, int incr)
Adds an increment to value currently associated with a key.Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
- Parameters:
k- the key.incr- the increment.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
put
public int put(K k, int v)
Description copied from interface:Object2IntFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceObject2IntFunction<K>- 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)
-
removeInt
public int removeInt(Object k)
Description copied from interface:Object2IntFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removeIntin interfaceObject2IntFunction<K>- 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
public boolean containsValue(int v)
Description copied from interface:Object2IntMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceObject2IntMap<K>- Overrides:
containsValuein classAbstractObject2IntMap<K>- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Object2IntMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
containsKey
public boolean containsKey(Object k)
Description copied from interface:Object2IntMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceFunction<K,Integer>- Specified by:
containsKeyin interfaceMap<K,Integer>- Specified by:
containsKeyin interfaceObject2IntMap<K>- Overrides:
containsKeyin classAbstractObject2IntMap<K>- 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:Object2IntMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE.
-
isEmpty
public boolean isEmpty()
-
getInt
public int getInt(Object k)
Description copied from interface:Object2IntFunctionReturns the value to which the given key is mapped.- Specified by:
getIntin interfaceObject2IntFunction<K>- 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)
-
object2IntEntrySet
public ObjectSortedSet<Object2IntMap.Entry<K>> object2IntEntrySet()
Description copied from interface:Object2IntSortedMapReturns 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:
object2IntEntrySetin interfaceObject2IntMap<K>- Specified by:
object2IntEntrySetin interfaceObject2IntSortedMap<K>- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Object2IntSortedMap.entrySet()
-
keySet
public ObjectSortedSet<K> 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 interfaceMap<K,Integer>- Specified by:
keySetin interfaceObject2IntMap<K>- Specified by:
keySetin interfaceObject2IntSortedMap<K>- Specified by:
keySetin interfaceSortedMap<K,Integer>- Overrides:
keySetin classAbstractObject2IntSortedMap<K>- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public IntCollection 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 interfaceMap<K,Integer>- Specified by:
valuesin interfaceObject2IntMap<K>- Specified by:
valuesin interfaceObject2IntSortedMap<K>- Specified by:
valuesin interfaceSortedMap<K,Integer>- Overrides:
valuesin classAbstractObject2IntSortedMap<K>- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public Comparator<? super K> comparator()
Description copied from interface:Object2IntSortedMapReturns 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 interfaceObject2IntSortedMap<K>- Specified by:
comparatorin interfaceSortedMap<K,Integer>- See Also:
SortedMap.comparator()
-
headMap
public Object2IntSortedMap<K> headMap(K to)
Description copied from interface:Object2IntSortedMapReturns 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 interfaceObject2IntSortedMap<K>- Specified by:
headMapin interfaceSortedMap<K,Integer>- See Also:
SortedMap.headMap(Object)
-
tailMap
public Object2IntSortedMap<K> tailMap(K from)
Description copied from interface:Object2IntSortedMapReturns 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 interfaceObject2IntSortedMap<K>- Specified by:
tailMapin interfaceSortedMap<K,Integer>- See Also:
SortedMap.tailMap(Object)
-
subMap
public Object2IntSortedMap<K> subMap(K from, K to)
Description copied from interface:Object2IntSortedMapReturns 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 interfaceObject2IntSortedMap<K>- Specified by:
subMapin interfaceSortedMap<K,Integer>- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Object2IntAVLTreeMap<K> 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.
-
-