public class Long2ByteAVLTreeMap extends AbstractLong2ByteSortedMap 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.
AbstractLong2ByteMap.BasicEntry, AbstractLong2ByteMap.BasicEntrySetLong2ByteSortedMap.FastSortedEntrySetLong2ByteMap.FastEntrySet| Constructor and Description |
|---|
Long2ByteAVLTreeMap()
Creates a new empty tree map.
|
Long2ByteAVLTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2ByteAVLTreeMap(long[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2ByteAVLTreeMap(long[] k,
byte[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2ByteAVLTreeMap(Long2ByteMap m)
Creates a new tree map copying a given map.
|
Long2ByteAVLTreeMap(Long2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2ByteAVLTreeMap(Map<? extends Long,? extends Byte> m)
Creates a new tree map copying a given map.
|
Long2ByteAVLTreeMap(SortedMap<Long,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(long k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Long2ByteAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(byte v)
Returns
true if this map maps one or more keys to the specified value. |
long |
firstLongKey()
Returns the first (lowest) key currently in this map.
|
byte |
get(long k)
Returns the value to which the given key is mapped.
|
Long2ByteSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Long2ByteMap.Entry> |
long2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
byte |
put(long k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2ByteSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2ByteSortedMap |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ByteCollection |
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, replaceapplyAsIntpublic Long2ByteAVLTreeMap()
public Long2ByteAVLTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2ByteAVLTreeMap(Map<? extends Long,? extends Byte> m)
m - a Map to be copied into the new tree map.public Long2ByteAVLTreeMap(SortedMap<Long,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2ByteAVLTreeMap(Long2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Long2ByteAVLTreeMap(Long2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2ByteAVLTreeMap(long[] k,
byte[] v,
Comparator<? super Long> 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 Long2ByteAVLTreeMap(long[] k,
byte[] 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 byte addTo(long k,
byte 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 byte put(long k,
byte v)
Long2ByteFunctionput in interface Long2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(long k)
Long2ByteFunctionremove in interface Long2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Long2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Long2ByteMapcontainsValue in class AbstractLong2ByteMapMap.containsValue(Object)public void clear()
Long2ByteMapclear in interface Long2ByteMapclear in interface Map<Long,Byte>Map.clear()public boolean containsKey(long k)
Long2ByteMapcontainsKey in interface Long2ByteFunctioncontainsKey in interface Long2ByteMapcontainsKey in class AbstractLong2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Long2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte get(long k)
Long2ByteFunctionget in interface Long2ByteFunctionk - the key.Function.get(Object)public long firstLongKey()
Long2ByteSortedMapfirstLongKey in interface Long2ByteSortedMapSortedMap.firstKey()public long lastLongKey()
Long2ByteSortedMaplastLongKey in interface Long2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2ByteMap.Entry> long2ByteEntrySet()
Long2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
long2ByteEntrySet in interface Long2ByteMaplong2ByteEntrySet in interface Long2ByteSortedMapLong2ByteSortedMap.entrySet()public LongSortedSet 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 Long2ByteMapkeySet in interface Long2ByteSortedMapkeySet in interface Map<Long,Byte>keySet in interface SortedMap<Long,Byte>keySet in class AbstractLong2ByteSortedMapMap.keySet()public ByteCollection 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 Long2ByteMapvalues in interface Long2ByteSortedMapvalues in interface Map<Long,Byte>values in interface SortedMap<Long,Byte>values in class AbstractLong2ByteSortedMapMap.values()public LongComparator comparator()
Long2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2ByteSortedMapcomparator in interface SortedMap<Long,Byte>SortedMap.comparator()public Long2ByteSortedMap headMap(long to)
Long2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Long2ByteSortedMapSortedMap.headMap(Object)public Long2ByteSortedMap tailMap(long from)
Long2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Long2ByteSortedMapSortedMap.tailMap(Object)public Long2ByteSortedMap subMap(long from, long to)
Long2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Long2ByteSortedMapSortedMap.subMap(Object,Object)public Long2ByteAVLTreeMap 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.