Class Char2ReferenceRBTreeMap<V>
- All Implemented Interfaces:
Char2ReferenceFunction<V>,Char2ReferenceMap<V>,Char2ReferenceSortedMap<V>,Function<Character,V>,Serializable,Cloneable,Function<Character,V>,IntFunction<V>,Map<Character,V>,SortedMap<Character,V>
public class Char2ReferenceRBTreeMap<V> extends AbstractChar2ReferenceSortedMap<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.chars.AbstractChar2ReferenceMap
AbstractChar2ReferenceMap.BasicEntry<V>, AbstractChar2ReferenceMap.BasicEntrySet<V>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceMap
Char2ReferenceMap.FastEntrySet<V>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceSortedMap
Char2ReferenceSortedMap.FastSortedEntrySet<V> -
Constructor Summary
Constructors Constructor Description Char2ReferenceRBTreeMap()Creates a new empty tree map.Char2ReferenceRBTreeMap(char[] k, V[] v)Creates a new tree map using the elements of two parallel arrays.Char2ReferenceRBTreeMap(char[] k, V[] v, Comparator<? super Character> c)Creates a new tree map using the elements of two parallel arrays and the given comparator.Char2ReferenceRBTreeMap(Char2ReferenceMap<? extends V> m)Creates a new tree map copying a given map.Char2ReferenceRBTreeMap(Char2ReferenceSortedMap<V> m)Creates a new tree map copying a given sorted map (and itsComparator).Char2ReferenceRBTreeMap(Comparator<? super Character> c)Creates a new empty tree map with the given comparator.Char2ReferenceRBTreeMap(Map<? extends Character,? extends V> m)Creates a new tree map copying a given map.Char2ReferenceRBTreeMap(SortedMap<Character,V> m)Creates a new tree map copying a given sorted map (and itsComparator). -
Method Summary
Modifier and Type Method Description ObjectSortedSet<Char2ReferenceMap.Entry<V>>char2ReferenceEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.voidclear()Removes all of the mappings from this map (optional operation).Char2ReferenceRBTreeMap<V>clone()Returns a deep copy of this tree map.CharComparatorcomparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleancontainsKey(char k)Returns true if this function contains a mapping for the specified key.booleancontainsValue(Object v)charfirstCharKey()Returns the first (lowest) key currently in this map.Vget(char k)Returns the value to which the given key is mapped.Char2ReferenceSortedMap<V>headMap(char to)Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()CharSortedSetkeySet()Returns a type-specific sorted set view of the keys contained in this map.charlastCharKey()Returns the last (highest) key currently in this map.Vput(char k, V v)Adds a pair to the map (optional operation).Vremove(char k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Char2ReferenceSortedMap<V>subMap(char from, char to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Char2ReferenceSortedMap<V>tailMap(char 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.chars.AbstractChar2ReferenceMap
equals, hashCode, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceMap
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.chars.Char2ReferenceSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMapMethods inherited from interface java.util.Map
containsKey, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
Constructor Details
-
Char2ReferenceRBTreeMap
public Char2ReferenceRBTreeMap()Creates a new empty tree map. -
Char2ReferenceRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Char2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Char2ReferenceRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Char2ReferenceRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Char2ReferenceRBTreeMap
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.
-
Char2ReferenceRBTreeMap
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.
-
Char2ReferenceRBTreeMap
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:Char2ReferenceFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceChar2ReferenceFunction<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:Char2ReferenceFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removein interfaceChar2ReferenceFunction<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<Character,V>- Overrides:
containsValuein classAbstractChar2ReferenceMap<V>
-
clear
public void clear()Description copied from interface:Char2ReferenceMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
public boolean containsKey(char k)Description copied from interface:Char2ReferenceMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceChar2ReferenceFunction<V>- Specified by:
containsKeyin interfaceChar2ReferenceMap<V>- Overrides:
containsKeyin classAbstractChar2ReferenceMap<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:Char2ReferenceMapReturns 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:Char2ReferenceFunctionReturns the value to which the given key is mapped.- Specified by:
getin interfaceChar2ReferenceFunction<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)
-
firstCharKey
public char firstCharKey()Description copied from interface:Char2ReferenceSortedMapReturns the first (lowest) key currently in this map.- Specified by:
firstCharKeyin interfaceChar2ReferenceSortedMap<V>- See Also:
SortedMap.firstKey()
-
lastCharKey
public char lastCharKey()Description copied from interface:Char2ReferenceSortedMapReturns the last (highest) key currently in this map.- Specified by:
lastCharKeyin interfaceChar2ReferenceSortedMap<V>- See Also:
SortedMap.lastKey()
-
char2ReferenceEntrySet
Description copied from interface:Char2ReferenceSortedMapReturns 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:
char2ReferenceEntrySetin interfaceChar2ReferenceMap<V>- Specified by:
char2ReferenceEntrySetin interfaceChar2ReferenceSortedMap<V>- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Char2ReferenceSortedMap.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 interfaceChar2ReferenceMap<V>- Specified by:
keySetin interfaceChar2ReferenceSortedMap<V>- Specified by:
keySetin interfaceMap<Character,V>- Specified by:
keySetin interfaceSortedMap<Character,V>- Overrides:
keySetin classAbstractChar2ReferenceSortedMap<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 interfaceChar2ReferenceMap<V>- Specified by:
valuesin interfaceChar2ReferenceSortedMap<V>- Specified by:
valuesin interfaceMap<Character,V>- Specified by:
valuesin interfaceSortedMap<Character,V>- Overrides:
valuesin classAbstractChar2ReferenceSortedMap<V>- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
Description copied from interface:Char2ReferenceSortedMapReturns 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 interfaceChar2ReferenceSortedMap<V>- Specified by:
comparatorin interfaceSortedMap<Character,V>- See Also:
SortedMap.comparator()
-
headMap
Description copied from interface:Char2ReferenceSortedMapReturns 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 interfaceChar2ReferenceSortedMap<V>- See Also:
SortedMap.headMap(Object)
-
tailMap
Description copied from interface:Char2ReferenceSortedMapReturns 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 interfaceChar2ReferenceSortedMap<V>- See Also:
SortedMap.tailMap(Object)
-
subMap
Description copied from interface:Char2ReferenceSortedMapReturns 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 interfaceChar2ReferenceSortedMap<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.
-