public class Byte2LongRBTreeMap extends AbstractByte2LongSortedMap 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.
AbstractByte2LongMap.BasicEntry, AbstractByte2LongMap.BasicEntrySetByte2LongSortedMap.FastSortedEntrySetByte2LongMap.FastEntrySet| Constructor and Description |
|---|
Byte2LongRBTreeMap()
Creates a new empty tree map.
|
Byte2LongRBTreeMap(byte[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2LongRBTreeMap(byte[] k,
long[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2LongRBTreeMap(Byte2LongMap m)
Creates a new tree map copying a given map.
|
Byte2LongRBTreeMap(Byte2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2LongRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2LongRBTreeMap(Map<? extends Byte,? extends Long> m)
Creates a new tree map copying a given map.
|
Byte2LongRBTreeMap(SortedMap<Byte,Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(byte k,
long incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2LongMap.Entry> |
byte2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Byte2LongRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(byte k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(long v)
Returns
true if this map maps one or more keys to the specified value. |
byte |
firstByteKey()
Returns the first (lowest) key currently in this map.
|
long |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2LongSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
byte |
lastByteKey()
Returns the last (highest) key currently in this map.
|
long |
put(byte k,
long v)
Adds a pair to the map (optional operation).
|
long |
remove(byte k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Byte2LongSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2LongSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, 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, replaceapplyAsLongpublic Byte2LongRBTreeMap()
public Byte2LongRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2LongRBTreeMap(Map<? extends Byte,? extends Long> m)
m - a Map to be copied into the new tree map.public Byte2LongRBTreeMap(SortedMap<Byte,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2LongRBTreeMap(Byte2LongMap m)
m - a type-specific map to be copied into the new tree map.public Byte2LongRBTreeMap(Byte2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2LongRBTreeMap(byte[] k,
long[] v,
Comparator<? super Byte> c)
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.IllegalArgumentException - if k and v have different lengths.public Byte2LongRBTreeMap(byte[] k,
long[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.IllegalArgumentException - if k and v have different lengths.public long addTo(byte k,
long incr)
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.
k - the key.incr - the increment.public long put(byte k,
long v)
Byte2LongFunctionput in interface Byte2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(byte k)
Byte2LongFunctionremove in interface Byte2LongFunctionk - the key.Function.remove(Object)public boolean containsValue(long v)
Byte2LongMaptrue if this map maps one or more keys to the specified value.containsValue in interface Byte2LongMapcontainsValue in class AbstractByte2LongMapMap.containsValue(Object)public void clear()
Byte2LongMapclear in interface Byte2LongMapclear in interface Map<Byte,Long>Map.clear()public boolean containsKey(byte k)
Byte2LongMapcontainsKey in interface Byte2LongFunctioncontainsKey in interface Byte2LongMapcontainsKey in class AbstractByte2LongMapk - the key.key.Map.containsKey(Object)public int size()
Byte2LongMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public long get(byte k)
Byte2LongFunctionget in interface Byte2LongFunctionk - the key.Function.get(Object)public byte firstByteKey()
Byte2LongSortedMapfirstByteKey in interface Byte2LongSortedMapSortedMap.firstKey()public byte lastByteKey()
Byte2LongSortedMaplastByteKey in interface Byte2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2LongMap.Entry> byte2LongEntrySet()
Byte2LongSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
byte2LongEntrySet in interface Byte2LongMapbyte2LongEntrySet in interface Byte2LongSortedMapByte2LongSortedMap.entrySet()public ByteSortedSet keySet()
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.
keySet in interface Byte2LongMapkeySet in interface Byte2LongSortedMapkeySet in interface Map<Byte,Long>keySet in interface SortedMap<Byte,Long>keySet in class AbstractByte2LongSortedMapMap.keySet()public LongCollection values()
In addition to the semantics of Map.values(), you can
safely cast the collection returned by this call to a type-specific collection
interface.
values in interface Byte2LongMapvalues in interface Byte2LongSortedMapvalues in interface Map<Byte,Long>values in interface SortedMap<Byte,Long>values in class AbstractByte2LongSortedMapMap.values()public ByteComparator comparator()
Byte2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2LongSortedMapcomparator in interface SortedMap<Byte,Long>SortedMap.comparator()public Byte2LongSortedMap headMap(byte to)
Byte2LongSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Byte2LongSortedMapSortedMap.headMap(Object)public Byte2LongSortedMap tailMap(byte from)
Byte2LongSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Byte2LongSortedMapSortedMap.tailMap(Object)public Byte2LongSortedMap subMap(byte from, byte to)
Byte2LongSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Byte2LongSortedMapSortedMap.subMap(Object,Object)public Byte2LongRBTreeMap clone()
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.