|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2IntFunction
it.unimi.dsi.fastutil.bytes.AbstractByte2IntMap
it.unimi.dsi.fastutil.bytes.AbstractByte2IntSortedMap
it.unimi.dsi.fastutil.bytes.Byte2IntRBTreeMap
public class Byte2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntMap |
---|
AbstractByte2IntMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2IntSortedMap |
---|
Byte2IntSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2IntMap |
---|
Byte2IntMap.FastEntrySet |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Byte2IntRBTreeMap()
Creates a new empty tree map. |
|
Byte2IntRBTreeMap(byte[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Byte2IntRBTreeMap(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. |
|
Byte2IntRBTreeMap(Byte2IntMap m)
Creates a new tree map copying a given map. |
|
Byte2IntRBTreeMap(Byte2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Byte2IntRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator. |
|
Byte2IntRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Integer> m)
Creates a new tree map copying a given map. |
|
Byte2IntRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Integer> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
ObjectSortedSet<Byte2IntMap.Entry> |
byte2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
java.lang.Object |
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)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
int |
remove(byte k)
Removes the mapping with the given key. |
java.lang.Integer |
remove(java.lang.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. |
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. |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2IntFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2IntFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Byte2IntRBTreeMap()
public Byte2IntRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2IntRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Integer> m)
m
- a Map
to be copied into the new tree map.public Byte2IntRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Integer> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Byte2IntRBTreeMap(Byte2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Byte2IntRBTreeMap(Byte2IntSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Byte2IntRBTreeMap(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 Byte2IntRBTreeMap(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.Method Detail |
---|
public int put(byte k, int v)
Byte2IntFunction
put
in interface Byte2IntFunction
put
in class AbstractByte2IntFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public int remove(byte k)
Byte2IntFunction
remove
in interface Byte2IntFunction
remove
in class AbstractByte2IntFunction
Function.remove(Object)
public java.lang.Integer put(java.lang.Byte ok, java.lang.Integer ov)
AbstractByte2IntFunction
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 AbstractByte2IntFunction
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Integer remove(java.lang.Object ok)
AbstractByte2IntFunction
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 AbstractByte2IntFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(int v)
AbstractByte2IntMap
AbstractByte2IntMap.values()
.
containsValue
in interface Byte2IntMap
containsValue
in class AbstractByte2IntMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Byte,java.lang.Integer>
clear
in interface java.util.Map<java.lang.Byte,java.lang.Integer>
clear
in class AbstractByte2IntFunction
Map.clear()
public boolean containsKey(byte k)
AbstractByte2IntMap
AbstractByte2IntMap.keySet()
.
containsKey
in interface Byte2IntFunction
containsKey
in class AbstractByte2IntMap
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.
size
in interface Function<java.lang.Byte,java.lang.Integer>
size
in interface java.util.Map<java.lang.Byte,java.lang.Integer>
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Integer>
isEmpty
in class AbstractByte2IntMap
public int get(byte k)
Byte2IntFunction
get
in interface Byte2IntFunction
k
- the key.
Function.get(Object)
public byte firstByteKey()
firstByteKey
in interface Byte2IntSortedMap
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2IntSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Byte2IntMap.Entry> byte2IntEntrySet()
Byte2IntMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2IntMap.entrySet()
so that it returns an ObjectSet
of objects of type Byte2IntMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
byte2IntEntrySet
in interface Byte2IntMap
byte2IntEntrySet
in interface Byte2IntSortedMap
Byte2IntMap.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 Byte2IntMap
keySet
in interface Byte2IntSortedMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Integer>
keySet
in class AbstractByte2IntSortedMap
Map.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 Byte2IntMap
values
in interface Byte2IntSortedMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Integer>
values
in class AbstractByte2IntSortedMap
Map.values()
public ByteComparator comparator()
Byte2IntSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2IntSortedMap
comparator
in interface java.util.SortedMap<java.lang.Byte,java.lang.Integer>
SortedMap.comparator()
public Byte2IntSortedMap headMap(byte to)
Byte2IntSortedMap
toKey
.
headMap
in interface Byte2IntSortedMap
SortedMap.headMap(Object)
public Byte2IntSortedMap tailMap(byte from)
Byte2IntSortedMap
fromKey
.
tailMap
in interface Byte2IntSortedMap
SortedMap.tailMap(Object)
public Byte2IntSortedMap subMap(byte from, byte to)
Byte2IntSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Byte2IntSortedMap
SortedMap.subMap(Object,Object)
public java.lang.Object 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
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |