Package it.unimi.dsi.fastutil.ints
Class Int2BooleanRBTreeMap
java.lang.Object
it.unimi.dsi.fastutil.ints.AbstractInt2BooleanFunction
it.unimi.dsi.fastutil.ints.AbstractInt2BooleanMap
it.unimi.dsi.fastutil.ints.AbstractInt2BooleanSortedMap
it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap
- All Implemented Interfaces:
Function<Integer,
,Boolean> Int2BooleanFunction
,Int2BooleanMap
,Int2BooleanSortedMap
,Serializable
,Cloneable
,Function<Integer,
,Boolean> IntPredicate
,Map<Integer,
,Boolean> SequencedMap<Integer,
,Boolean> SortedMap<Integer,
Boolean>
public class Int2BooleanRBTreeMap
extends AbstractInt2BooleanSortedMap
implements Serializable, Cloneable
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.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2BooleanMap
AbstractInt2BooleanMap.BasicEntry, AbstractInt2BooleanMap.BasicEntrySet
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2BooleanMap
Int2BooleanMap.FastEntrySet
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2BooleanSortedMap
Int2BooleanSortedMap.FastSortedEntrySet
-
Constructor Summary
ConstructorDescriptionCreates a new empty tree map.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.Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator
).Int2BooleanRBTreeMap
(Comparator<? super Integer> c) Creates a new empty tree map with the given comparator.Int2BooleanRBTreeMap
(Map<? extends Integer, ? extends Boolean> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator
). -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Removes all of the mappings from this map (optional operation).clone()
Returns a deep copy of this tree map.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) Returnstrue
if this map maps one or more keys to the specified value.int
Returns the first (lowest) key currently in this map.boolean
get
(int k) Returns the value to which the given key is mapped.headMap
(int to) Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.Returns a type-specific sorted-set view of the mappings contained in this map.boolean
isEmpty()
keySet()
Returns a type-specific sorted set view of the keys contained in this map.int
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.subMap
(int from, int to) Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.tailMap
(int from) Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.values()
Returns a type-specific collection view of the values contained in this map.Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2BooleanMap
equals, hashCode, putAll, toString
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2BooleanFunction
defaultReturnValue, defaultReturnValue
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2BooleanFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, test
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2BooleanMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2BooleanSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
Methods inherited from interface java.util.function.IntPredicate
and, negate, or
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll
Methods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues
-
Constructor Details
-
Int2BooleanRBTreeMap
public Int2BooleanRBTreeMap()Creates a new empty tree map. -
Int2BooleanRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Int2BooleanRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Int2BooleanRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Int2BooleanRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Int2BooleanRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- a type-specific sorted map to be copied into the new tree map.
-
Int2BooleanRBTreeMap
Creates a new tree map using the elements of two parallel arrays and the given comparator.- Parameters:
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.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
Int2BooleanRBTreeMap
public Int2BooleanRBTreeMap(int[] k, boolean[] v) Creates a new tree map using the elements of two parallel arrays.- Parameters:
k
- the array of keys of the new tree map.v
- the array of corresponding values in the new tree map.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Details
-
put
public boolean put(int k, boolean v) Description copied from interface:Int2BooleanFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceInt2BooleanFunction
- Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
remove
public boolean remove(int k) Description copied from interface:Int2BooleanFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceInt2BooleanFunction
- Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
containsValue
public boolean containsValue(boolean v) Description copied from class:AbstractInt2BooleanMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceInt2BooleanMap
- Overrides:
containsValue
in classAbstractInt2BooleanMap
- See Also:
-
clear
public void clear()Description copied from interface:Int2BooleanMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
public boolean containsKey(int k) Description copied from class:AbstractInt2BooleanMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceInt2BooleanFunction
- Specified by:
containsKey
in interfaceInt2BooleanMap
- Overrides:
containsKey
in classAbstractInt2BooleanMap
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
-
size
public int size()Description copied from interface:Int2BooleanMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
. -
isEmpty
public boolean isEmpty() -
get
public boolean get(int k) Description copied from interface:Int2BooleanFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceInt2BooleanFunction
- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
-
firstIntKey
public int firstIntKey()Description copied from interface:Int2BooleanSortedMap
Returns the first (lowest) key currently in this map.- Specified by:
firstIntKey
in interfaceInt2BooleanSortedMap
- See Also:
-
lastIntKey
public int lastIntKey()Description copied from interface:Int2BooleanSortedMap
Returns the last (highest) key currently in this map.- Specified by:
lastIntKey
in interfaceInt2BooleanSortedMap
- See Also:
-
int2BooleanEntrySet
Description copied from interface:Int2BooleanSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
int2BooleanEntrySet
in interfaceInt2BooleanMap
- Specified by:
int2BooleanEntrySet
in interfaceInt2BooleanSortedMap
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
-
keySet
Returns a type-specific sorted set view of the keys contained in this map.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.- Specified by:
keySet
in interfaceInt2BooleanMap
- Specified by:
keySet
in interfaceInt2BooleanSortedMap
- Specified by:
keySet
in interfaceMap<Integer,
Boolean> - Specified by:
keySet
in interfaceSortedMap<Integer,
Boolean> - Overrides:
keySet
in classAbstractInt2BooleanSortedMap
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
-
values
Returns a type-specific collection view of the values contained in this map.In addition to the semantics of
Map.values()
, you can safely cast the collection returned by this call to a type-specific collection interface.- Specified by:
values
in interfaceInt2BooleanMap
- Specified by:
values
in interfaceInt2BooleanSortedMap
- Specified by:
values
in interfaceMap<Integer,
Boolean> - Specified by:
values
in interfaceSortedMap<Integer,
Boolean> - Overrides:
values
in classAbstractInt2BooleanSortedMap
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Int2BooleanSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparator
in interfaceInt2BooleanSortedMap
- Specified by:
comparator
in interfaceSortedMap<Integer,
Boolean> - See Also:
-
headMap
Description copied from interface:Int2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.- Specified by:
headMap
in interfaceInt2BooleanSortedMap
- See Also:
-
tailMap
Description copied from interface:Int2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.- Specified by:
tailMap
in interfaceInt2BooleanSortedMap
- See Also:
-
subMap
Description copied from interface:Int2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.- Specified by:
subMap
in interfaceInt2BooleanSortedMap
- See Also:
-
clone
Returns a deep copy of this tree map.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.
- Returns:
- a deep copy of this tree map.
-