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
Long2ByteSortedMap.FastSortedEntrySet
Long2ByteMap.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 |
---|---|
void |
clear()
Removes all associations from this function (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)
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, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
public 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 put(long k, byte v)
Long2ByteFunction
put
in interface Long2ByteFunction
put
in class AbstractLong2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(long k)
Long2ByteFunction
remove
in interface Long2ByteFunction
remove
in class AbstractLong2ByteFunction
Function.remove(Object)
public Byte put(Long ok, Byte ov)
AbstractLong2ByteFunction
null
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)
AbstractLong2ByteFunction
null
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)
AbstractLong2ByteMap
AbstractLong2ByteMap.values()
.containsValue
in interface Long2ByteMap
containsValue
in class AbstractLong2ByteMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(long k)
AbstractLong2ByteMap
AbstractLong2ByteMap.keySet()
.containsKey
in interface Long2ByteFunction
containsKey
in class AbstractLong2ByteMap
Function.containsKey(Object)
public int size()
Function
Most 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)
Long2ByteFunction
get
in interface Long2ByteFunction
k
- the key.Function.get(Object)
public long firstLongKey()
firstLongKey
in interface Long2ByteSortedMap
SortedMap.firstKey()
public long lastLongKey()
lastLongKey
in interface Long2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Long2ByteMap.Entry> long2ByteEntrySet()
Long2ByteSortedMap
long2ByteEntrySet
in interface Long2ByteMap
long2ByteEntrySet
in interface Long2ByteSortedMap
Long2ByteSortedMap.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 Long2ByteMap
keySet
in interface Long2ByteSortedMap
keySet
in interface Map<Long,Byte>
keySet
in interface SortedMap<Long,Byte>
keySet
in class AbstractLong2ByteSortedMap
Map.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 Long2ByteMap
values
in interface Long2ByteSortedMap
values
in interface Map<Long,Byte>
values
in interface SortedMap<Long,Byte>
values
in class AbstractLong2ByteSortedMap
Map.values()
public LongComparator comparator()
Long2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Long2ByteSortedMap
comparator
in interface SortedMap<Long,Byte>
SortedMap.comparator()
public Long2ByteSortedMap headMap(long to)
Long2ByteSortedMap
toKey
.headMap
in interface Long2ByteSortedMap
SortedMap.headMap(Object)
public Long2ByteSortedMap tailMap(long from)
Long2ByteSortedMap
fromKey
.tailMap
in interface Long2ByteSortedMap
SortedMap.tailMap(Object)
public Long2ByteSortedMap subMap(long from, long to)
Long2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Long2ByteSortedMap
SortedMap.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.