public class Byte2IntAVLTreeMap extends AbstractByte2IntSortedMap 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.
AbstractByte2IntMap.BasicEntryByte2IntSortedMap.FastSortedEntrySetByte2IntMap.FastEntrySet| Constructor and Description |
|---|
Byte2IntAVLTreeMap()
Creates a new empty tree map.
|
Byte2IntAVLTreeMap(byte[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2IntAVLTreeMap(byte[] k,
int[] v,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2IntAVLTreeMap(Byte2IntMap m)
Creates a new tree map copying a given map.
|
Byte2IntAVLTreeMap(Byte2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2IntAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2IntAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Integer> m)
Creates a new tree map copying a given map.
|
Byte2IntAVLTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(byte k,
int incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2IntMap.Entry> |
byte2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2IntAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractByte2IntMap.values(). |
byte |
firstByteKey() |
int |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2IntSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
byte |
lastByteKey() |
int |
put(byte k,
int v)
Adds a pair to the map.
|
java.lang.Integer |
put(java.lang.Byte ok,
java.lang.Integer ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
remove(byte k)
Removes the mapping with the given key.
|
java.lang.Integer |
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.
|
Byte2IntSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2IntSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
IntCollection |
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 Byte2IntAVLTreeMap()
public Byte2IntAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c - a (possibly type-specific) comparator.public Byte2IntAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Integer> m)
m - a Map to be copied into the new tree map.public Byte2IntAVLTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2IntAVLTreeMap(Byte2IntMap m)
m - a type-specific map to be copied into the new tree map.public Byte2IntAVLTreeMap(Byte2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2IntAVLTreeMap(byte[] k,
int[] v,
java.util.Comparator<? super java.lang.Byte> 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 Byte2IntAVLTreeMap(byte[] k,
int[] 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 int addTo(byte k,
int 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 int put(byte k,
int v)
Byte2IntFunctionput in interface Byte2IntFunctionput in class AbstractByte2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(byte k)
Byte2IntFunctionremove in interface Byte2IntFunctionremove in class AbstractByte2IntFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Integer put(java.lang.Byte ok,
java.lang.Integer 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.Byte,java.lang.Integer>put in interface java.util.Map<java.lang.Byte,java.lang.Integer>put in class AbstractByte2IntFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Integer 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.Byte,java.lang.Integer>remove in interface java.util.Map<java.lang.Byte,java.lang.Integer>remove in class AbstractByte2IntFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(int v)
AbstractByte2IntMapAbstractByte2IntMap.values().containsValue in interface Byte2IntMapcontainsValue in class AbstractByte2IntMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Byte,java.lang.Integer>clear in interface java.util.Map<java.lang.Byte,java.lang.Integer>clear in class AbstractByte2IntFunctionMap.clear()public boolean containsKey(byte k)
AbstractByte2IntMapAbstractByte2IntMap.keySet().containsKey in interface Byte2IntFunctioncontainsKey in class AbstractByte2IntMapFunction.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.Byte,java.lang.Integer>isEmpty in class AbstractByte2IntMappublic int get(byte k)
Byte2IntFunctionget in interface Byte2IntFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2IntSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2IntMap.Entry> byte2IntEntrySet()
Byte2IntSortedMapbyte2IntEntrySet in interface Byte2IntMapbyte2IntEntrySet in interface Byte2IntSortedMapByte2IntSortedMap.entrySet()public ByteSortedSet 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 Byte2IntMapkeySet in interface Byte2IntSortedMapkeySet in interface java.util.Map<java.lang.Byte,java.lang.Integer>keySet in interface java.util.SortedMap<java.lang.Byte,java.lang.Integer>keySet in class AbstractByte2IntSortedMapMap.keySet()public IntCollection 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 Byte2IntMapvalues in interface Byte2IntSortedMapvalues in interface java.util.Map<java.lang.Byte,java.lang.Integer>values in interface java.util.SortedMap<java.lang.Byte,java.lang.Integer>values in class AbstractByte2IntSortedMapMap.values()public ByteComparator comparator()
Byte2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2IntSortedMapcomparator in interface java.util.SortedMap<java.lang.Byte,java.lang.Integer>SortedMap.comparator()public Byte2IntSortedMap headMap(byte to)
Byte2IntSortedMaptoKey.headMap in interface Byte2IntSortedMapSortedMap.headMap(Object)public Byte2IntSortedMap tailMap(byte from)
Byte2IntSortedMapfromKey.tailMap in interface Byte2IntSortedMapSortedMap.tailMap(Object)public Byte2IntSortedMap subMap(byte from, byte to)
Byte2IntSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2IntSortedMapSortedMap.subMap(Object,Object)public Byte2IntAVLTreeMap 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