Class Object2ByteRBTreeMap<K>
- java.lang.Object
-
- it.unimi.dsi.fastutil.objects.AbstractObject2ByteFunction<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObject2ByteMap<K>
-
- it.unimi.dsi.fastutil.objects.AbstractObject2ByteSortedMap<K>
-
- it.unimi.dsi.fastutil.objects.Object2ByteRBTreeMap<K>
-
- All Implemented Interfaces:
Function<K,Byte>,Object2ByteFunction<K>,Object2ByteMap<K>,Object2ByteSortedMap<K>,Serializable,Cloneable,Function<K,Byte>,ToIntFunction<K>,Map<K,Byte>,SortedMap<K,Byte>
public class Object2ByteRBTreeMap<K> extends AbstractObject2ByteSortedMap<K> 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.objects.AbstractObject2ByteMap
AbstractObject2ByteMap.BasicEntry<K>, AbstractObject2ByteMap.BasicEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteMap
Object2ByteMap.FastEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteSortedMap
Object2ByteSortedMap.FastSortedEntrySet<K>
-
-
Constructor Summary
Constructors Constructor Description Object2ByteRBTreeMap()Creates a new empty tree map.Object2ByteRBTreeMap(Object2ByteMap<? extends K> m)Creates a new tree map copying a given map.Object2ByteRBTreeMap(Object2ByteSortedMap<K> m)Creates a new tree map copying a given sorted map (and itsComparator).Object2ByteRBTreeMap(Comparator<? super K> c)Creates a new empty tree map with the given comparator.Object2ByteRBTreeMap(Map<? extends K,? extends Byte> m)Creates a new tree map copying a given map.Object2ByteRBTreeMap(SortedMap<K,Byte> m)Creates a new tree map copying a given sorted map (and itsComparator).Object2ByteRBTreeMap(K[] k, byte[] v)Creates a new tree map using the elements of two parallel arrays.Object2ByteRBTreeMap(K[] k, byte[] 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 byteaddTo(K k, byte incr)Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).Object2ByteRBTreeMap<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(byte v)Returnstrueif this map maps one or more keys to the specified value.KfirstKey()bytegetByte(Object k)Returns the value to which the given key is mapped.Object2ByteSortedMap<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<Object2ByteMap.Entry<K>>object2ByteEntrySet()Returns a type-specific sorted-set view of the mappings contained in this map.byteput(K k, byte v)Adds a pair to the map (optional operation).byteremoveByte(Object k)Removes the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Object2ByteSortedMap<K>subMap(K from, K to)Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.Object2ByteSortedMap<K>tailMap(K from)Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.ByteCollectionvalues()Returns a type-specific collection view of the values contained in this map.-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ByteMap
equals, hashCode, putAll, toString
-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ByteFunction
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.Object2ByteFunction
applyAsInt
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteMap
computeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteSortedMap
entrySet
-
-
-
-
Constructor Detail
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap()
Creates a new empty tree map.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(Map<? extends K,? extends Byte> m)
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(SortedMap<K,Byte> m)
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(Object2ByteMap<? 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.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(Object2ByteSortedMap<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.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(K[] k, byte[] 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.
-
Object2ByteRBTreeMap
public Object2ByteRBTreeMap(K[] k, byte[] 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 byte addTo(K k, byte 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 byte put(K k, byte v)
Description copied from interface:Object2ByteFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceObject2ByteFunction<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)
-
removeByte
public byte removeByte(Object k)
Description copied from interface:Object2ByteFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removeBytein interfaceObject2ByteFunction<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(byte v)
Description copied from interface:Object2ByteMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceObject2ByteMap<K>- Overrides:
containsValuein classAbstractObject2ByteMap<K>- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Object2ByteMapRemoves 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:Object2ByteMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceFunction<K,Byte>- Specified by:
containsKeyin interfaceMap<K,Byte>- Specified by:
containsKeyin interfaceObject2ByteMap<K>- Overrides:
containsKeyin classAbstractObject2ByteMap<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:Object2ByteMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE.
-
isEmpty
public boolean isEmpty()
-
getByte
public byte getByte(Object k)
Description copied from interface:Object2ByteFunctionReturns the value to which the given key is mapped.- Specified by:
getBytein interfaceObject2ByteFunction<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)
-
object2ByteEntrySet
public ObjectSortedSet<Object2ByteMap.Entry<K>> object2ByteEntrySet()
Description copied from interface:Object2ByteSortedMapReturns 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:
object2ByteEntrySetin interfaceObject2ByteMap<K>- Specified by:
object2ByteEntrySetin interfaceObject2ByteSortedMap<K>- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Object2ByteSortedMap.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,Byte>- Specified by:
keySetin interfaceObject2ByteMap<K>- Specified by:
keySetin interfaceObject2ByteSortedMap<K>- Specified by:
keySetin interfaceSortedMap<K,Byte>- Overrides:
keySetin classAbstractObject2ByteSortedMap<K>- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public ByteCollection 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,Byte>- Specified by:
valuesin interfaceObject2ByteMap<K>- Specified by:
valuesin interfaceObject2ByteSortedMap<K>- Specified by:
valuesin interfaceSortedMap<K,Byte>- Overrides:
valuesin classAbstractObject2ByteSortedMap<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:Object2ByteSortedMapReturns 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 interfaceObject2ByteSortedMap<K>- Specified by:
comparatorin interfaceSortedMap<K,Byte>- See Also:
SortedMap.comparator()
-
headMap
public Object2ByteSortedMap<K> headMap(K to)
Description copied from interface:Object2ByteSortedMapReturns 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 interfaceObject2ByteSortedMap<K>- Specified by:
headMapin interfaceSortedMap<K,Byte>- See Also:
SortedMap.headMap(Object)
-
tailMap
public Object2ByteSortedMap<K> tailMap(K from)
Description copied from interface:Object2ByteSortedMapReturns 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 interfaceObject2ByteSortedMap<K>- Specified by:
tailMapin interfaceSortedMap<K,Byte>- See Also:
SortedMap.tailMap(Object)
-
subMap
public Object2ByteSortedMap<K> subMap(K from, K to)
Description copied from interface:Object2ByteSortedMapReturns 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 interfaceObject2ByteSortedMap<K>- Specified by:
subMapin interfaceSortedMap<K,Byte>- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Object2ByteRBTreeMap<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.
-
-