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.
AbstractInt2BooleanSortedMap.KeySetIterator, AbstractInt2BooleanSortedMap.ValuesCollection, AbstractInt2BooleanSortedMap.ValuesIteratorAbstractInt2BooleanMap.BasicEntry, AbstractInt2BooleanMap.BasicEntrySetInt2BooleanSortedMap.FastSortedEntrySetInt2BooleanMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected IntComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Int2BooleanMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected IntSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super Integer> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected BooleanCollection |
values
Cached collection of values.
|
defRetValue| 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 of the mappings from this map (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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(boolean v)
Returns
true if this map maps one or more keys to the specified value. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
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()
Returns the last (highest) key currently in this map.
|
boolean |
put(int k,
boolean v)
Adds a pair to the map (optional operation).
|
boolean |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacetestand, negate, orprotected transient it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Int2BooleanMap.Entry> entries
protected transient IntSortedSet keys
protected transient BooleanCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Integer> storedComparator
protected transient IntComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public 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 Int2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(int k)
Int2BooleanFunctionremove in interface Int2BooleanFunctionk - the key.Function.remove(Object)public boolean containsValue(boolean v)
Int2BooleanMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2BooleanMapcontainsValue in class AbstractInt2BooleanMapMap.containsValue(Object)public void clear()
Int2BooleanMapclear in interface Int2BooleanMapclear in interface Map<Integer,Boolean>Map.clear()public boolean containsKey(int k)
Int2BooleanMapcontainsKey in interface Int2BooleanFunctioncontainsKey in interface Int2BooleanMapcontainsKey in class AbstractInt2BooleanMapk - the key.key.Map.containsKey(Object)public int size()
Int2BooleanMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public boolean get(int k)
Int2BooleanFunctionget in interface Int2BooleanFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2BooleanSortedMapfirstIntKey in interface Int2BooleanSortedMapSortedMap.firstKey()public int lastIntKey()
Int2BooleanSortedMaplastIntKey in interface Int2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2BooleanMap.Entry> int2BooleanEntrySet()
Int2BooleanSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2BooleanEntrySet 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()
Int2BooleanSortedMapNote 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.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Int2BooleanSortedMapSortedMap.headMap(Object)public Int2BooleanSortedMap tailMap(int from)
Int2BooleanSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Int2BooleanSortedMapSortedMap.tailMap(Object)public Int2BooleanSortedMap subMap(int from, int to)
Int2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
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.
Copyright © 2020. All rights reserved.