Class Int2CharRBTreeMap
- java.lang.Object
-
- it.unimi.dsi.fastutil.ints.AbstractInt2CharFunction
-
- it.unimi.dsi.fastutil.ints.AbstractInt2CharMap
-
- it.unimi.dsi.fastutil.ints.AbstractInt2CharSortedMap
-
- it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap
-
- All Implemented Interfaces:
Function<Integer,Character>,Int2CharFunction,Int2CharMap,Int2CharSortedMap,Serializable,Cloneable,Function<Integer,Character>,IntUnaryOperator,Map<Integer,Character>,SortedMap<Integer,Character>
public class Int2CharRBTreeMap extends AbstractInt2CharSortedMap 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.ints.AbstractInt2CharMap
AbstractInt2CharMap.BasicEntry, AbstractInt2CharMap.BasicEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2CharMap
Int2CharMap.FastEntrySet
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2CharSortedMap
Int2CharSortedMap.FastSortedEntrySet
-
-
Constructor Summary
Constructors Constructor Description Int2CharRBTreeMap()Creates a new empty tree map.Int2CharRBTreeMap(int[] k, char[] v)Creates a new tree map using the elements of two parallel arrays.Int2CharRBTreeMap(int[] k, char[] v, Comparator<? super Integer> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.Int2CharRBTreeMap(Int2CharMap m)Creates a new tree map copying a given map.Int2CharRBTreeMap(Int2CharSortedMap m)Creates a new tree map copying a given sorted map (and itsComparator).Int2CharRBTreeMap(Comparator<? super Integer> c)Creates a new empty tree map with the given comparator.Int2CharRBTreeMap(Map<? extends Integer,? extends Character> m)Creates a new tree map copying a given map.Int2CharRBTreeMap(SortedMap<Integer,Character> m)Creates a new tree map copying a given sorted map (and itsComparator).
-
Method Summary
Modifier and Type Method Description charaddTo(int k, char incr)Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).Int2CharRBTreeMapclone()Returns a deep copy of this tree map.IntComparatorcomparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(int k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(char v)Returnstrueif this map maps one or more keys to the specified value.intfirstIntKey()Returns the first (lowest) key currently in this map.charget(int k)Returns the value to which the given key is mapped.Int2CharSortedMapheadMap(int to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.ObjectSortedSet<Int2CharMap.Entry>int2CharEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.booleanisEmpty()IntSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.intlastIntKey()Returns the last (highest) key currently in this map.charput(int k, char v)Adds a pair to the map (optional operation).charremove(int k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Int2CharSortedMapsubMap(int from, int to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Int2CharSortedMaptailMap(int from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.CharCollectionvalues()Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2CharMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2CharFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2CharFunction
applyAsInt
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2CharMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2CharSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
-
Methods inherited from interface java.util.function.IntUnaryOperator
andThen, compose
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
-
-
-
Constructor Detail
-
Int2CharRBTreeMap
public Int2CharRBTreeMap()
Creates a new empty tree map.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(Map<? extends Integer,? extends Character> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(SortedMap<Integer,Character> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(Int2CharMap m)
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(Int2CharSortedMap 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.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(int[] k, char[] v, Comparator<? super Integer> 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.
-
Int2CharRBTreeMap
public Int2CharRBTreeMap(int[] k, char[] 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 char addTo(int k, char 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 char put(int k, char v)Description copied from interface:Int2CharFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceInt2CharFunction- 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 char remove(int k)
Description copied from interface:Int2CharFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceInt2CharFunction- 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(char v)
Description copied from interface:Int2CharMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceInt2CharMap- Overrides:
containsValuein classAbstractInt2CharMap- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Int2CharMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
containsKey
public boolean containsKey(int k)
Description copied from interface:Int2CharMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceInt2CharFunction- Specified by:
containsKeyin interfaceInt2CharMap- Overrides:
containsKeyin classAbstractInt2CharMap- 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:Int2CharMapReturns 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
public char get(int k)
Description copied from interface:Int2CharFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceInt2CharFunction- 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)
-
firstIntKey
public int firstIntKey()
Description copied from interface:Int2CharSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstIntKeyin interfaceInt2CharSortedMap- See Also:
SortedMap.firstKey()
-
lastIntKey
public int lastIntKey()
Description copied from interface:Int2CharSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastIntKeyin interfaceInt2CharSortedMap- See Also:
SortedMap.lastKey()
-
int2CharEntrySet
public ObjectSortedSet<Int2CharMap.Entry> int2CharEntrySet()
Description copied from interface:Int2CharSortedMapReturns 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:
int2CharEntrySetin interfaceInt2CharMap- Specified by:
int2CharEntrySetin interfaceInt2CharSortedMap- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Int2CharSortedMap.entrySet()
-
keySet
public IntSortedSet 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 interfaceInt2CharMap- Specified by:
keySetin interfaceInt2CharSortedMap- Specified by:
keySetin interfaceMap<Integer,Character>- Specified by:
keySetin interfaceSortedMap<Integer,Character>- Overrides:
keySetin classAbstractInt2CharSortedMap- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public CharCollection 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 interfaceInt2CharMap- Specified by:
valuesin interfaceInt2CharSortedMap- Specified by:
valuesin interfaceMap<Integer,Character>- Specified by:
valuesin interfaceSortedMap<Integer,Character>- Overrides:
valuesin classAbstractInt2CharSortedMap- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public IntComparator comparator()
Description copied from interface:Int2CharSortedMapReturns 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 interfaceInt2CharSortedMap- Specified by:
comparatorin interfaceSortedMap<Integer,Character>- See Also:
SortedMap.comparator()
-
headMap
public Int2CharSortedMap headMap(int to)
Description copied from interface:Int2CharSortedMapReturns 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 interfaceInt2CharSortedMap- See Also:
SortedMap.headMap(Object)
-
tailMap
public Int2CharSortedMap tailMap(int from)
Description copied from interface:Int2CharSortedMapReturns 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 interfaceInt2CharSortedMap- See Also:
SortedMap.tailMap(Object)
-
subMap
public Int2CharSortedMap subMap(int from, int to)
Description copied from interface:Int2CharSortedMapReturns 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 interfaceInt2CharSortedMap- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Int2CharRBTreeMap 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.
-
-