public class Int2ByteAVLTreeMap extends AbstractInt2ByteSortedMap implements java.io.Serializable, java.lang.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.BasicEntryInt2ByteSortedMap.FastSortedEntrySetInt2ByteMap.FastEntrySet| Constructor and Description |
|---|
Int2ByteAVLTreeMap()
Creates a new empty tree map.
|
Int2ByteAVLTreeMap(java.util.Comparator<? super java.lang.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,
java.util.Comparator<? super java.lang.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(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Int2ByteAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(int k,
byte incr)
Adds an increment to value currently associated with a key.
|
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.
|
java.lang.Byte |
put(java.lang.Integer ok,
java.lang.Byte ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
byte |
remove(int k)
Removes the mapping with the given key.
|
java.lang.Byte |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
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, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getpublic Int2ByteAVLTreeMap()
public Int2ByteAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c - a (possibly type-specific) comparator.public Int2ByteAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
m - a Map to be copied into the new tree map.public Int2ByteAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.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,
java.util.Comparator<? super java.lang.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.java.lang.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.java.lang.IllegalArgumentException - if k and v have different lengths.public byte addTo(int 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(int k,
byte v)
Int2ByteFunctionput in interface Int2ByteFunctionput in class AbstractInt2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(int k)
Int2ByteFunctionremove in interface Int2ByteFunctionremove in class AbstractInt2ByteFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Byte put(java.lang.Integer ok,
java.lang.Byte ov)
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.
put in interface Function<java.lang.Integer,java.lang.Byte>put in interface java.util.Map<java.lang.Integer,java.lang.Byte>put in class AbstractInt2ByteFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Byte remove(java.lang.Object ok)
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.
remove in interface Function<java.lang.Integer,java.lang.Byte>remove in interface java.util.Map<java.lang.Integer,java.lang.Byte>remove in class AbstractInt2ByteFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(byte v)
AbstractInt2ByteMapAbstractInt2ByteMap.values().containsValue in interface Int2ByteMapcontainsValue in class AbstractInt2ByteMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Integer,java.lang.Byte>clear in interface java.util.Map<java.lang.Integer,java.lang.Byte>clear in class AbstractInt2ByteFunctionMap.clear()public boolean containsKey(int k)
AbstractInt2ByteMapAbstractInt2ByteMap.keySet().containsKey in interface Int2ByteFunctioncontainsKey in class AbstractInt2ByteMapFunction.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()
isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Byte>isEmpty in class AbstractInt2ByteMappublic byte get(int k)
Int2ByteFunctionget in interface Int2ByteFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2ByteSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2ByteMap.Entry> int2ByteEntrySet()
Int2ByteSortedMapint2ByteEntrySet in interface Int2ByteMapint2ByteEntrySet in interface Int2ByteSortedMapInt2ByteSortedMap.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 Int2ByteMapkeySet in interface Int2ByteSortedMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Byte>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>keySet in class AbstractInt2ByteSortedMapMap.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 Int2ByteMapvalues in interface Int2ByteSortedMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Byte>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>values in class AbstractInt2ByteSortedMapMap.values()public IntComparator comparator()
Int2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2ByteSortedMapcomparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>SortedMap.comparator()public Int2ByteSortedMap headMap(int to)
Int2ByteSortedMaptoKey.headMap in interface Int2ByteSortedMapSortedMap.headMap(Object)public Int2ByteSortedMap tailMap(int from)
Int2ByteSortedMapfromKey.tailMap in interface Int2ByteSortedMapSortedMap.tailMap(Object)public Int2ByteSortedMap subMap(int from, int to)
Int2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2ByteSortedMapSortedMap.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.
clone in class java.lang.Object