public class Long2ByteRBTreeMap 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.BasicEntryLong2ByteSortedMap.FastSortedEntrySetLong2ByteMap.FastEntrySet| Constructor and Description |
|---|
Long2ByteRBTreeMap()
Creates a new empty tree map.
|
Long2ByteRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2ByteRBTreeMap(long[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2ByteRBTreeMap(long[] k,
byte[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2ByteRBTreeMap(Long2ByteMap m)
Creates a new tree map copying a given map.
|
Long2ByteRBTreeMap(Long2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2ByteRBTreeMap(Map<? extends Long,? extends Byte> m)
Creates a new tree map copying a given map.
|
Long2ByteRBTreeMap(SortedMap<Long,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Long2ByteRBTreeMap |
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)
Checks whether the given value is contained in
AbstractLong2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractLong2ByteMap.values(). |
long |
firstLongKey() |
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() |
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.
|
Byte |
put(Long ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(long k)
Removes the mapping with the given key.
|
Byte |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic Long2ByteRBTreeMap()
public Long2ByteRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2ByteRBTreeMap(Map<? extends Long,? extends Byte> m)
m - a Map to be copied into the new tree map.public Long2ByteRBTreeMap(SortedMap<Long,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2ByteRBTreeMap(Long2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Long2ByteRBTreeMap(Long2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2ByteRBTreeMap(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 Long2ByteRBTreeMap(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 put(long k,
byte v)
Long2ByteFunctionput in interface Long2ByteFunctionput in class AbstractLong2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(long k)
Long2ByteFunctionremove in interface Long2ByteFunctionremove in class AbstractLong2ByteFunctionFunction.remove(Object)public Byte put(Long ok, Byte ov)
AbstractLong2ByteFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public Byte remove(Object ok)
AbstractLong2ByteFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public boolean containsValue(byte v)
AbstractLong2ByteMapAbstractLong2ByteMap.values().containsValue in interface Long2ByteMapcontainsValue in class AbstractLong2ByteMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(long k)
AbstractLong2ByteMapAbstractLong2ByteMap.keySet().containsKey in interface Long2ByteFunctioncontainsKey in class AbstractLong2ByteMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public byte get(long k)
Long2ByteFunctionget in interface Long2ByteFunctionk - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2ByteSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2ByteMap.Entry> long2ByteEntrySet()
Long2ByteSortedMaplong2ByteEntrySet 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.headMap in interface Long2ByteSortedMapSortedMap.headMap(Object)public Long2ByteSortedMap tailMap(long from)
Long2ByteSortedMapfromKey.tailMap in interface Long2ByteSortedMapSortedMap.tailMap(Object)public Long2ByteSortedMap subMap(long from, long to)
Long2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Long2ByteSortedMapSortedMap.subMap(Object,Object)public Long2ByteRBTreeMap 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.