Package it.unimi.dsi.fastutil.objects
Class Object2BooleanRBTreeMap<K>
java.lang.Object
it.unimi.dsi.fastutil.objects.AbstractObject2BooleanFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2BooleanMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2BooleanSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2BooleanRBTreeMap<K>
- All Implemented Interfaces:
Function<K,,Boolean> Object2BooleanFunction<K>,Object2BooleanMap<K>,Object2BooleanSortedMap<K>,Serializable,Cloneable,Function<K,,Boolean> Predicate<K>,Map<K,,Boolean> SortedMap<K,Boolean>
public class Object2BooleanRBTreeMap<K>
extends AbstractObject2BooleanSortedMap<K>
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.objects.AbstractObject2BooleanMap
AbstractObject2BooleanMap.BasicEntry<K>, AbstractObject2BooleanMap.BasicEntrySet<K>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanMap
Object2BooleanMap.FastEntrySet<K>Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanSortedMap
Object2BooleanSortedMap.FastSortedEntrySet<K> -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new empty tree map.Object2BooleanRBTreeMap(Object2BooleanMap<? extends K> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator).Object2BooleanRBTreeMap(Comparator<? super K> c) Creates a new empty tree map with the given comparator.Object2BooleanRBTreeMap(Map<? extends K, ? extends Boolean> m) Creates a new tree map copying a given map.Creates a new tree map copying a given sorted map (and itsComparator).Object2BooleanRBTreeMap(K[] k, boolean[] v) Creates a new tree map using the elements of two parallel arrays.Object2BooleanRBTreeMap(K[] k, boolean[] v, Comparator<? super K> c) Creates a new tree map using the elements of two parallel arrays and the given comparator. -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()Removes all of the mappings from this map (optional operation).clone()Returns a deep copy of this tree map.Comparator<? super K>Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.booleanReturns true if this function contains a mapping for the specified key.booleancontainsValue(boolean v) Returnstrueif this map maps one or more keys to the specified value.firstKey()booleangetBoolean(Object k) Returns the value to which the given key is mapped.Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()keySet()Returns a type-specific sorted set view of the keys contained in this map.lastKey()Returns a type-specific sorted-set view of the mappings contained in this map.booleanAdds a pair to the map (optional operation).booleanRemoves the mapping with the given key (optional operation).intsize()Returns the number of key/value mappings in this map.Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.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.objects.AbstractObject2BooleanMap
equals, hashCode, putAll, toStringMethods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2BooleanFunction
defaultReturnValue, defaultReturnValueMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, get, getOrDefault, hashCode, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAllMethods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, testMethods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanMap
computeBoolean, computeBooleanIfAbsent, computeBooleanIfAbsentPartial, computeBooleanIfPresent, computeIfAbsent, computeIfAbsent, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceMethods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanSortedMap
entrySet
-
Constructor Details
-
Object2BooleanRBTreeMap
public Object2BooleanRBTreeMap()Creates a new empty tree map. -
Object2BooleanRBTreeMap
Creates a new empty tree map with the given comparator.- Parameters:
c- a (possibly type-specific) comparator.
-
Object2BooleanRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- aMapto be copied into the new tree map.
-
Object2BooleanRBTreeMap
Creates a new tree map copying a given sorted map (and itsComparator).- Parameters:
m- aSortedMapto be copied into the new tree map.
-
Object2BooleanRBTreeMap
Creates a new tree map copying a given map.- Parameters:
m- a type-specific map to be copied into the new tree map.
-
Object2BooleanRBTreeMap
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.
-
Object2BooleanRBTreeMap
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- ifkandvhave different lengths.
-
Object2BooleanRBTreeMap
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- ifkandvhave different lengths.
-
-
Method Details
-
put
Description copied from interface:Object2BooleanFunctionAdds a pair to the map (optional operation).- Specified by:
putin interfaceObject2BooleanFunction<K>- 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:
-
removeBoolean
Description copied from interface:Object2BooleanFunctionRemoves the mapping with the given key (optional operation).- Specified by:
removeBooleanin interfaceObject2BooleanFunction<K>- 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:AbstractObject2BooleanMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceObject2BooleanMap<K>- Overrides:
containsValuein classAbstractObject2BooleanMap<K>- See Also:
-
clear
public void clear()Description copied from interface:Object2BooleanMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
Description copied from class:AbstractObject2BooleanMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceFunction<K,Boolean> - Specified by:
containsKeyin interfaceMap<K,Boolean> - Specified by:
containsKeyin interfaceObject2BooleanMap<K>- Overrides:
containsKeyin classAbstractObject2BooleanMap<K>- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
-
size
public int size()Description copied from interface:Object2BooleanMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE. -
isEmpty
public boolean isEmpty() -
getBoolean
Description copied from interface:Object2BooleanFunctionReturns the value to which the given key is mapped.- Specified by:
getBooleanin interfaceObject2BooleanFunction<K>- Parameters:
k- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
-
firstKey
-
lastKey
-
object2BooleanEntrySet
Description copied from interface:Object2BooleanSortedMapReturns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
object2BooleanEntrySetin interfaceObject2BooleanMap<K>- Specified by:
object2BooleanEntrySetin interfaceObject2BooleanSortedMap<K>- 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:
keySetin interfaceMap<K,Boolean> - Specified by:
keySetin interfaceObject2BooleanMap<K>- Specified by:
keySetin interfaceObject2BooleanSortedMap<K>- Specified by:
keySetin interfaceSortedMap<K,Boolean> - Overrides:
keySetin classAbstractObject2BooleanSortedMap<K>- 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:
valuesin interfaceMap<K,Boolean> - Specified by:
valuesin interfaceObject2BooleanMap<K>- Specified by:
valuesin interfaceObject2BooleanSortedMap<K>- Specified by:
valuesin interfaceSortedMap<K,Boolean> - Overrides:
valuesin classAbstractObject2BooleanSortedMap<K>- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
comparator
Description copied from interface:Object2BooleanSortedMapReturns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparatorin interfaceObject2BooleanSortedMap<K>- Specified by:
comparatorin interfaceSortedMap<K,Boolean> - See Also:
-
headMap
Description copied from interface:Object2BooleanSortedMapReturns a view of the portion of this sorted map whose keys are strictly less thantoKey. -
tailMap
Description copied from interface:Object2BooleanSortedMapReturns a view of the portion of this sorted map whose keys are greater than or equal tofromKey. -
subMap
Description copied from interface:Object2BooleanSortedMapReturns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive. -
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.
-