public class Int2BooleanRBTreeMap extends AbstractInt2BooleanSortedMap implements Serializable, 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.
AbstractInt2BooleanMap.BasicEntryInt2BooleanSortedMap.FastSortedEntrySetInt2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Int2BooleanRBTreeMap()
Creates a new empty tree map.
|
Int2BooleanRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2BooleanRBTreeMap(int[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2BooleanRBTreeMap(int[] k,
boolean[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Int2BooleanRBTreeMap(Int2BooleanMap m)
Creates a new tree map copying a given map.
|
Int2BooleanRBTreeMap(Int2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2BooleanRBTreeMap(Map<? extends Integer,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Int2BooleanRBTreeMap(SortedMap<Integer,Boolean> 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).
|
Int2BooleanRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractInt2BooleanMap.values(). |
int |
firstIntKey() |
boolean |
get(int k)
Returns the value to which the given key is mapped.
|
Int2BooleanSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
ObjectSortedSet<Int2BooleanMap.Entry> |
int2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
int |
lastIntKey() |
boolean |
put(int k,
boolean v)
Adds a pair to the map.
|
Boolean |
put(Integer ok,
Boolean ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
boolean |
remove(int k)
Removes the mapping with the given key.
|
Boolean |
remove(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.
|
Int2BooleanSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2BooleanSortedMap |
tailMap(int 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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Int2BooleanRBTreeMap()
public Int2BooleanRBTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2BooleanRBTreeMap(Map<? extends Integer,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Int2BooleanRBTreeMap(SortedMap<Integer,Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2BooleanRBTreeMap(Int2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Int2BooleanRBTreeMap(Int2BooleanSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2BooleanRBTreeMap(int[] k,
boolean[] v,
Comparator<? super Integer> 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 Int2BooleanRBTreeMap(int[] 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.public boolean put(int k,
boolean v)
Int2BooleanFunctionput in interface Int2BooleanFunctionput in class AbstractInt2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(int k)
Int2BooleanFunctionremove in interface Int2BooleanFunctionremove in class AbstractInt2BooleanFunctionk - the key.Function.remove(Object)@Deprecated public Boolean put(Integer ok, Boolean 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<Integer,Boolean>put in interface Map<Integer,Boolean>put in class AbstractInt2BooleanFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Boolean remove(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.
public boolean containsValue(boolean v)
AbstractInt2BooleanMapAbstractInt2BooleanMap.values().containsValue in interface Int2BooleanMapcontainsValue in class AbstractInt2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2BooleanMapAbstractInt2BooleanMap.keySet().containsKey in interface Int2BooleanFunctioncontainsKey in class AbstractInt2BooleanMapFunction.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()
public boolean get(int k)
Int2BooleanFunctionget in interface Int2BooleanFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2BooleanSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2BooleanMap.Entry> int2BooleanEntrySet()
Int2BooleanSortedMapint2BooleanEntrySet in interface Int2BooleanMapint2BooleanEntrySet in interface Int2BooleanSortedMapInt2BooleanSortedMap.entrySet()public IntSortedSet 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 Int2BooleanMapkeySet in interface Int2BooleanSortedMapkeySet in interface Map<Integer,Boolean>keySet in interface SortedMap<Integer,Boolean>keySet in class AbstractInt2BooleanSortedMapMap.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 Int2BooleanMapvalues in interface Int2BooleanSortedMapvalues in interface Map<Integer,Boolean>values in interface SortedMap<Integer,Boolean>values in class AbstractInt2BooleanSortedMapMap.values()public IntComparator comparator()
Int2BooleanSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Int2BooleanSortedMapcomparator in interface SortedMap<Integer,Boolean>SortedMap.comparator()public Int2BooleanSortedMap headMap(int to)
Int2BooleanSortedMaptoKey.headMap in interface Int2BooleanSortedMapSortedMap.headMap(Object)public Int2BooleanSortedMap tailMap(int from)
Int2BooleanSortedMapfromKey.tailMap in interface Int2BooleanSortedMapSortedMap.tailMap(Object)public Int2BooleanSortedMap subMap(int from, int to)
Int2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2BooleanSortedMapSortedMap.subMap(Object,Object)public Int2BooleanRBTreeMap 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.