public class Short2ByteRBTreeMap extends AbstractShort2ByteSortedMap 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.
AbstractShort2ByteMap.BasicEntry
Short2ByteSortedMap.FastSortedEntrySet
Short2ByteMap.FastEntrySet
Constructor and Description |
---|
Short2ByteRBTreeMap()
Creates a new empty tree map.
|
Short2ByteRBTreeMap(java.util.Comparator<? super java.lang.Short> c)
Creates a new empty tree map with the given comparator.
|
Short2ByteRBTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Short2ByteRBTreeMap(short[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2ByteRBTreeMap(short[] k,
byte[] v,
java.util.Comparator<? super java.lang.Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2ByteRBTreeMap(Short2ByteMap m)
Creates a new tree map copying a given map.
|
Short2ByteRBTreeMap(Short2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Short2ByteRBTreeMap(java.util.SortedMap<java.lang.Short,java.lang.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).
|
Short2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractShort2ByteMap.values() . |
short |
firstShortKey() |
byte |
get(short k)
Returns the value to which the given key is mapped.
|
Short2ByteSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
short |
lastShortKey() |
byte |
put(short k,
byte v)
Adds a pair to the map.
|
java.lang.Byte |
put(java.lang.Short ok,
java.lang.Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
java.lang.Byte |
remove(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2ByteMap.Entry> |
short2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Short2ByteSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Short2ByteSortedMap |
tailMap(short 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
public Short2ByteRBTreeMap()
public Short2ByteRBTreeMap(java.util.Comparator<? super java.lang.Short> c)
c
- a (possibly type-specific) comparator.public Short2ByteRBTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Byte> m)
m
- a Map
to be copied into the new tree map.public Short2ByteRBTreeMap(java.util.SortedMap<java.lang.Short,java.lang.Byte> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteMap m)
m
- a type-specific map to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Short2ByteRBTreeMap(short[] k, byte[] v, java.util.Comparator<? super java.lang.Short> 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 Short2ByteRBTreeMap(short[] 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 put(short k, byte v)
Short2ByteFunction
put
in interface Short2ByteFunction
put
in class AbstractShort2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(short k)
Short2ByteFunction
remove
in interface Short2ByteFunction
remove
in class AbstractShort2ByteFunction
k
- the key.Function.remove(Object)
public java.lang.Byte put(java.lang.Short ok, java.lang.Byte ov)
AbstractShort2ByteFunction
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.Short,java.lang.Byte>
put
in interface java.util.Map<java.lang.Short,java.lang.Byte>
put
in class AbstractShort2ByteFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Byte remove(java.lang.Object ok)
AbstractShort2ByteFunction
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.Short,java.lang.Byte>
remove
in interface java.util.Map<java.lang.Short,java.lang.Byte>
remove
in class AbstractShort2ByteFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(byte v)
AbstractShort2ByteMap
AbstractShort2ByteMap.values()
.containsValue
in interface Short2ByteMap
containsValue
in class AbstractShort2ByteMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Short,java.lang.Byte>
clear
in interface java.util.Map<java.lang.Short,java.lang.Byte>
clear
in class AbstractShort2ByteFunction
Map.clear()
public boolean containsKey(short k)
AbstractShort2ByteMap
AbstractShort2ByteMap.keySet()
.containsKey
in interface Short2ByteFunction
containsKey
in class AbstractShort2ByteMap
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()
isEmpty
in interface java.util.Map<java.lang.Short,java.lang.Byte>
isEmpty
in class AbstractShort2ByteMap
public byte get(short k)
Short2ByteFunction
get
in interface Short2ByteFunction
k
- the key.Function.get(Object)
public short firstShortKey()
firstShortKey
in interface Short2ByteSortedMap
SortedMap.firstKey()
public short lastShortKey()
lastShortKey
in interface Short2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Short2ByteMap.Entry> short2ByteEntrySet()
Short2ByteSortedMap
short2ByteEntrySet
in interface Short2ByteMap
short2ByteEntrySet
in interface Short2ByteSortedMap
Short2ByteSortedMap.entrySet()
public ShortSortedSet 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 Short2ByteMap
keySet
in interface Short2ByteSortedMap
keySet
in interface java.util.Map<java.lang.Short,java.lang.Byte>
keySet
in interface java.util.SortedMap<java.lang.Short,java.lang.Byte>
keySet
in class AbstractShort2ByteSortedMap
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 Short2ByteMap
values
in interface Short2ByteSortedMap
values
in interface java.util.Map<java.lang.Short,java.lang.Byte>
values
in interface java.util.SortedMap<java.lang.Short,java.lang.Byte>
values
in class AbstractShort2ByteSortedMap
Map.values()
public ShortComparator comparator()
Short2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Short2ByteSortedMap
comparator
in interface java.util.SortedMap<java.lang.Short,java.lang.Byte>
SortedMap.comparator()
public Short2ByteSortedMap headMap(short to)
Short2ByteSortedMap
toKey
.headMap
in interface Short2ByteSortedMap
SortedMap.headMap(Object)
public Short2ByteSortedMap tailMap(short from)
Short2ByteSortedMap
fromKey
.tailMap
in interface Short2ByteSortedMap
SortedMap.tailMap(Object)
public Short2ByteSortedMap subMap(short from, short to)
Short2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Short2ByteSortedMap
SortedMap.subMap(Object,Object)
public Short2ByteRBTreeMap 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