|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2BooleanFunction
it.unimi.dsi.fastutil.bytes.AbstractByte2BooleanMap
it.unimi.dsi.fastutil.bytes.AbstractByte2BooleanSortedMap
it.unimi.dsi.fastutil.bytes.Byte2BooleanRBTreeMap
public class Byte2BooleanRBTreeMap
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.AbstractByte2BooleanMap |
|---|
AbstractByte2BooleanMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2BooleanSortedMap |
|---|
Byte2BooleanSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2BooleanMap |
|---|
Byte2BooleanMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Byte2BooleanRBTreeMap()
Creates a new empty tree map. |
|
Byte2BooleanRBTreeMap(byte[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Byte2BooleanRBTreeMap(byte[] k,
boolean[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Byte2BooleanRBTreeMap(Byte2BooleanMap m)
Creates a new tree map copying a given map. |
|
Byte2BooleanRBTreeMap(Byte2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Byte2BooleanRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator. |
|
Byte2BooleanRBTreeMap(Map<? extends Byte,? extends Boolean> m)
Creates a new tree map copying a given map. |
|
Byte2BooleanRBTreeMap(SortedMap<Byte,Boolean> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
ObjectSortedSet<Byte2BooleanMap.Entry> |
byte2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
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 AbstractByte2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in AbstractByte2BooleanMap.values(). |
byte |
firstByteKey()
|
boolean |
get(byte k)
Returns the value to which the given key is mapped. |
Byte2BooleanSortedMap |
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()
|
boolean |
put(byte k,
boolean v)
Adds a pair to the map. |
Boolean |
put(Byte ok,
Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
boolean |
remove(byte k)
Removes the mapping with the given key. |
Boolean |
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. |
Byte2BooleanSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Byte2BooleanSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
BooleanCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2BooleanSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2BooleanMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2BooleanFunction |
|---|
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.Byte2BooleanFunction |
|---|
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 Byte2BooleanRBTreeMap()
public Byte2BooleanRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2BooleanRBTreeMap(Map<? extends Byte,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Byte2BooleanRBTreeMap(SortedMap<Byte,Boolean> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Byte2BooleanRBTreeMap(Byte2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Byte2BooleanRBTreeMap(Byte2BooleanSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Byte2BooleanRBTreeMap(byte[] k,
boolean[] v,
Comparator<? super 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.
IllegalArgumentException - if k and v have different lengths.
public Byte2BooleanRBTreeMap(byte[] k,
boolean[] 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.| Method Detail |
|---|
public boolean put(byte k,
boolean v)
Byte2BooleanFunction
put in interface Byte2BooleanFunctionput in class AbstractByte2BooleanFunctionk - the key.v - the value.
Function.put(Object,Object)public boolean remove(byte k)
Byte2BooleanFunction
remove in interface Byte2BooleanFunctionremove in class AbstractByte2BooleanFunctionFunction.remove(Object)
public Boolean put(Byte ok,
Boolean ov)
AbstractByte2BooleanFunctionnull 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<Byte,Boolean>put in interface Map<Byte,Boolean>put in class AbstractByte2BooleanFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Boolean remove(Object ok)
AbstractByte2BooleanFunctionnull 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<Byte,Boolean>remove in interface Map<Byte,Boolean>remove in class AbstractByte2BooleanFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(boolean v)
AbstractByte2BooleanMapAbstractByte2BooleanMap.values().
containsValue in interface Byte2BooleanMapcontainsValue in class AbstractByte2BooleanMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Byte,Boolean>clear in interface Map<Byte,Boolean>clear in class AbstractByte2BooleanFunctionMap.clear()public boolean containsKey(byte k)
AbstractByte2BooleanMapAbstractByte2BooleanMap.keySet().
containsKey in interface Byte2BooleanFunctioncontainsKey in class AbstractByte2BooleanMapFunction.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.
size in interface Function<Byte,Boolean>size in interface Map<Byte,Boolean>public boolean isEmpty()
isEmpty in interface Map<Byte,Boolean>isEmpty in class AbstractByte2BooleanMappublic boolean get(byte k)
Byte2BooleanFunction
get in interface Byte2BooleanFunctionk - the key.
Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2BooleanSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2BooleanMap.Entry> byte2BooleanEntrySet()
Byte2BooleanMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2BooleanMap.entrySet()
so that it returns an ObjectSet
of objects of type Byte2BooleanMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
byte2BooleanEntrySet in interface Byte2BooleanMapbyte2BooleanEntrySet in interface Byte2BooleanSortedMapByte2BooleanMap.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 Byte2BooleanMapkeySet in interface Byte2BooleanSortedMapkeySet in interface Map<Byte,Boolean>keySet in class AbstractByte2BooleanSortedMapMap.keySet()public BooleanCollection 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 Byte2BooleanMapvalues in interface Byte2BooleanSortedMapvalues in interface Map<Byte,Boolean>values in class AbstractByte2BooleanSortedMapMap.values()public ByteComparator comparator()
Byte2BooleanSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2BooleanSortedMapcomparator in interface SortedMap<Byte,Boolean>SortedMap.comparator()public Byte2BooleanSortedMap headMap(byte to)
Byte2BooleanSortedMaptoKey.
headMap in interface Byte2BooleanSortedMapSortedMap.headMap(Object)public Byte2BooleanSortedMap tailMap(byte from)
Byte2BooleanSortedMapfromKey.
tailMap in interface Byte2BooleanSortedMapSortedMap.tailMap(Object)
public Byte2BooleanSortedMap subMap(byte from,
byte to)
Byte2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Byte2BooleanSortedMapSortedMap.subMap(Object,Object)public 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 Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||