public class Int2ByteAVLTreeMap extends AbstractInt2ByteSortedMap 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.
AbstractInt2ByteMap.BasicEntry
Int2ByteSortedMap.FastSortedEntrySet
Int2ByteMap.FastEntrySet
Constructor and Description |
---|
Int2ByteAVLTreeMap()
Creates a new empty tree map.
|
Int2ByteAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ByteAVLTreeMap(int[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ByteAVLTreeMap(int[] k,
byte[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2ByteAVLTreeMap(Int2ByteMap m)
Creates a new tree map copying a given map.
|
Int2ByteAVLTreeMap(Int2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2ByteAVLTreeMap(Map<? extends Integer,? extends Byte> m)
Creates a new tree map copying a given map.
|
Int2ByteAVLTreeMap(SortedMap<Integer,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).
|
Int2ByteAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractInt2ByteMap.values() . |
int |
firstIntKey() |
byte |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ByteSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
ObjectSortedSet<Int2ByteMap.Entry> |
int2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey() |
byte |
put(int k,
byte v)
Adds a pair to the map.
|
Byte |
put(Integer ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(int 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.
|
Int2ByteSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Int2ByteSortedMap |
tailMap(int 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 Int2ByteAVLTreeMap()
public Int2ByteAVLTreeMap(Comparator<? super Integer> c)
c
- a (possibly type-specific) comparator.public Int2ByteAVLTreeMap(Map<? extends Integer,? extends Byte> m)
m
- a Map
to be copied into the new tree map.public Int2ByteAVLTreeMap(SortedMap<Integer,Byte> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2ByteAVLTreeMap(Int2ByteMap m)
m
- a type-specific map to be copied into the new tree map.public Int2ByteAVLTreeMap(Int2ByteSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2ByteAVLTreeMap(int[] k, byte[] v, Comparator<? super Integer> 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 Int2ByteAVLTreeMap(int[] 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(int k, byte v)
Int2ByteFunction
put
in interface Int2ByteFunction
put
in class AbstractInt2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(int k)
Int2ByteFunction
remove
in interface Int2ByteFunction
remove
in class AbstractInt2ByteFunction
k
- the key.Function.remove(Object)
public Byte put(Integer ok, Byte ov)
AbstractInt2ByteFunction
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)
AbstractInt2ByteFunction
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)
AbstractInt2ByteMap
AbstractInt2ByteMap.values()
.containsValue
in interface Int2ByteMap
containsValue
in class AbstractInt2ByteMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2ByteMap
AbstractInt2ByteMap.keySet()
.containsKey
in interface Int2ByteFunction
containsKey
in class AbstractInt2ByteMap
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(int k)
Int2ByteFunction
get
in interface Int2ByteFunction
k
- the key.Function.get(Object)
public int firstIntKey()
firstIntKey
in interface Int2ByteSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2ByteMap.Entry> int2ByteEntrySet()
Int2ByteSortedMap
int2ByteEntrySet
in interface Int2ByteMap
int2ByteEntrySet
in interface Int2ByteSortedMap
Int2ByteSortedMap.entrySet()
public IntSortedSet 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 Int2ByteMap
keySet
in interface Int2ByteSortedMap
keySet
in interface Map<Integer,Byte>
keySet
in interface SortedMap<Integer,Byte>
keySet
in class AbstractInt2ByteSortedMap
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 Int2ByteMap
values
in interface Int2ByteSortedMap
values
in interface Map<Integer,Byte>
values
in interface SortedMap<Integer,Byte>
values
in class AbstractInt2ByteSortedMap
Map.values()
public IntComparator comparator()
Int2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2ByteSortedMap
comparator
in interface SortedMap<Integer,Byte>
SortedMap.comparator()
public Int2ByteSortedMap headMap(int to)
Int2ByteSortedMap
toKey
.headMap
in interface Int2ByteSortedMap
SortedMap.headMap(Object)
public Int2ByteSortedMap tailMap(int from)
Int2ByteSortedMap
fromKey
.tailMap
in interface Int2ByteSortedMap
SortedMap.tailMap(Object)
public Int2ByteSortedMap subMap(int from, int to)
Int2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2ByteSortedMap
SortedMap.subMap(Object,Object)
public Int2ByteAVLTreeMap 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.