|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2BooleanFunction
it.unimi.dsi.fastutil.longs.AbstractLong2BooleanMap
it.unimi.dsi.fastutil.longs.AbstractLong2BooleanSortedMap
it.unimi.dsi.fastutil.longs.Long2BooleanRBTreeMap
public class Long2BooleanRBTreeMap
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.longs.AbstractLong2BooleanMap |
|---|
AbstractLong2BooleanMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanSortedMap |
|---|
Long2BooleanSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2BooleanMap |
|---|
Long2BooleanMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Long2BooleanRBTreeMap()
Creates a new empty tree map. |
|
Long2BooleanRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator. |
|
Long2BooleanRBTreeMap(long[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Long2BooleanRBTreeMap(long[] k,
boolean[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Long2BooleanRBTreeMap(Long2BooleanMap m)
Creates a new tree map copying a given map. |
|
Long2BooleanRBTreeMap(Long2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Long2BooleanRBTreeMap(Map<? extends Long,? extends Boolean> m)
Creates a new tree map copying a given map. |
|
Long2BooleanRBTreeMap(SortedMap<Long,Boolean> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this tree map. |
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(long k)
Checks whether the given value is contained in AbstractLong2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in AbstractLong2BooleanMap.values(). |
long |
firstLongKey()
|
boolean |
get(long k)
Returns the value to which the given key is mapped. |
Long2BooleanSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey. |
boolean |
isEmpty()
|
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
long |
lastLongKey()
|
ObjectSortedSet<Long2BooleanMap.Entry> |
long2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
boolean |
put(long k,
boolean v)
Adds a pair to the map. |
Boolean |
put(Long ok,
Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
boolean |
remove(long 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. |
Long2BooleanSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Long2BooleanSortedMap |
tailMap(long 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.longs.AbstractLong2BooleanSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2BooleanMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2BooleanFunction |
|---|
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.longs.Long2BooleanFunction |
|---|
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 Long2BooleanRBTreeMap()
public Long2BooleanRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2BooleanRBTreeMap(Map<? extends Long,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Long2BooleanRBTreeMap(SortedMap<Long,Boolean> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Long2BooleanRBTreeMap(Long2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Long2BooleanRBTreeMap(Long2BooleanSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Long2BooleanRBTreeMap(long[] k,
boolean[] v,
Comparator<? super Long> 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 Long2BooleanRBTreeMap(long[] 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(long k,
boolean v)
Long2BooleanFunction
put in interface Long2BooleanFunctionput in class AbstractLong2BooleanFunctionk - the key.v - the value.
Function.put(Object,Object)public boolean remove(long k)
Long2BooleanFunction
remove in interface Long2BooleanFunctionremove in class AbstractLong2BooleanFunctionFunction.remove(Object)
public Boolean put(Long ok,
Boolean ov)
AbstractLong2BooleanFunctionnull 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<Long,Boolean>put in interface Map<Long,Boolean>put in class AbstractLong2BooleanFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Boolean remove(Object ok)
AbstractLong2BooleanFunctionnull 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<Long,Boolean>remove in interface Map<Long,Boolean>remove in class AbstractLong2BooleanFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(boolean v)
AbstractLong2BooleanMapAbstractLong2BooleanMap.values().
containsValue in interface Long2BooleanMapcontainsValue in class AbstractLong2BooleanMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Long,Boolean>clear in interface Map<Long,Boolean>clear in class AbstractLong2BooleanFunctionMap.clear()public boolean containsKey(long k)
AbstractLong2BooleanMapAbstractLong2BooleanMap.keySet().
containsKey in interface Long2BooleanFunctioncontainsKey in class AbstractLong2BooleanMapFunction.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<Long,Boolean>size in interface Map<Long,Boolean>public boolean isEmpty()
isEmpty in interface Map<Long,Boolean>isEmpty in class AbstractLong2BooleanMappublic boolean get(long k)
Long2BooleanFunction
get in interface Long2BooleanFunctionk - the key.
Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2BooleanSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2BooleanMap.Entry> long2BooleanEntrySet()
Long2BooleanMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2BooleanMap.entrySet()
so that it returns an ObjectSet
of objects of type Long2BooleanMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
long2BooleanEntrySet in interface Long2BooleanMaplong2BooleanEntrySet in interface Long2BooleanSortedMapLong2BooleanMap.entrySet()public LongSortedSet 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 Long2BooleanMapkeySet in interface Long2BooleanSortedMapkeySet in interface Map<Long,Boolean>keySet in class AbstractLong2BooleanSortedMapMap.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 Long2BooleanMapvalues in interface Long2BooleanSortedMapvalues in interface Map<Long,Boolean>values in class AbstractLong2BooleanSortedMapMap.values()public LongComparator comparator()
Long2BooleanSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2BooleanSortedMapcomparator in interface SortedMap<Long,Boolean>SortedMap.comparator()public Long2BooleanSortedMap headMap(long to)
Long2BooleanSortedMaptoKey.
headMap in interface Long2BooleanSortedMapSortedMap.headMap(Object)public Long2BooleanSortedMap tailMap(long from)
Long2BooleanSortedMapfromKey.
tailMap in interface Long2BooleanSortedMapSortedMap.tailMap(Object)
public Long2BooleanSortedMap subMap(long from,
long to)
Long2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Long2BooleanSortedMapSortedMap.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 | ||||||||