Class Object2BooleanAVLTreeMap<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.Object2BooleanAVLTreeMap<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 Object2BooleanAVLTreeMap<K> extends AbstractObject2BooleanSortedMap<K> implements Serializable, Cloneable
A type-specific AVL 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:
- Serialized Form
-
-
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
Constructors Constructor Description Object2BooleanAVLTreeMap()
Creates a new empty tree map.Object2BooleanAVLTreeMap(Object2BooleanMap<? extends K> m)
Creates a new tree map copying a given map.Object2BooleanAVLTreeMap(Object2BooleanSortedMap<K> m)
Creates a new tree map copying a given sorted map (and itsComparator
).Object2BooleanAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.Object2BooleanAVLTreeMap(Map<? extends K,? extends Boolean> m)
Creates a new tree map copying a given map.Object2BooleanAVLTreeMap(SortedMap<K,Boolean> m)
Creates a new tree map copying a given sorted map (and itsComparator
).Object2BooleanAVLTreeMap(K[] k, boolean[] v)
Creates a new tree map using the elements of two parallel arrays.Object2BooleanAVLTreeMap(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
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
Removes all of the mappings from this map (optional operation).Object2BooleanAVLTreeMap<K>
clone()
Returns a deep copy of this tree map.Comparator<? super K>
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.boolean
containsKey(Object 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.K
firstKey()
boolean
getBoolean(Object k)
Returns the value to which the given key is mapped.Object2BooleanSortedMap<K>
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.boolean
isEmpty()
ObjectSortedSet<K>
keySet()
Returns a type-specific sorted set view of the keys contained in this map.K
lastKey()
ObjectSortedSet<Object2BooleanMap.Entry<K>>
object2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.boolean
put(K k, boolean v)
Adds a pair to the map (optional operation).boolean
removeBoolean(Object k)
Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.Object2BooleanSortedMap<K>
subMap(K from, K to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Object2BooleanSortedMap<K>
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.BooleanCollection
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, toString
-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2BooleanFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, get, hashCode, put, putAll, remove, replaceAll
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanFunction
test
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanMap
computeBoolean, computeBooleanIfAbsent, computeBooleanIfAbsentPartial, computeBooleanIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeBoolean, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2BooleanSortedMap
entrySet
-
-
-
-
Constructor Detail
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap()
Creates a new empty tree map.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.- Parameters:
c
- a (possibly type-specific) comparator.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(Map<? extends K,? extends Boolean> m)
Creates a new tree map copying a given map.- Parameters:
m
- aMap
to be copied into the new tree map.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(SortedMap<K,Boolean> m)
Creates a new tree map copying a given sorted map (and itsComparator
).- Parameters:
m
- aSortedMap
to be copied into the new tree map.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(Object2BooleanMap<? extends K> m)
Creates a new tree map copying a given map.- Parameters:
m
- a type-specific map to be copied into the new tree map.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(Object2BooleanSortedMap<K> m)
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.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(K[] k, boolean[] v, Comparator<? super K> c)
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.
-
Object2BooleanAVLTreeMap
public Object2BooleanAVLTreeMap(K[] 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 Detail
-
put
public boolean put(K k, boolean v)
Description copied from interface:Object2BooleanFunction
Adds a pair to the map (optional operation).- Specified by:
put
in 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:
Function.put(Object,Object)
-
removeBoolean
public boolean removeBoolean(Object k)
Description copied from interface:Object2BooleanFunction
Removes the mapping with the given key (optional operation).- Specified by:
removeBoolean
in 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:
Function.remove(Object)
-
containsValue
public boolean containsValue(boolean v)
Description copied from interface:Object2BooleanMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceObject2BooleanMap<K>
- Overrides:
containsValue
in classAbstractObject2BooleanMap<K>
- See Also:
Map.containsValue(Object)
-
clear
public void clear()
Description copied from interface:Object2BooleanMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
containsKey
public boolean containsKey(Object k)
Description copied from interface:Object2BooleanMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceFunction<K,Boolean>
- Specified by:
containsKey
in interfaceMap<K,Boolean>
- Specified by:
containsKey
in interfaceObject2BooleanMap<K>
- Overrides:
containsKey
in classAbstractObject2BooleanMap<K>
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
Map.containsKey(Object)
-
size
public int size()
Description copied from interface:Object2BooleanMap
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()
-
getBoolean
public boolean getBoolean(Object k)
Description copied from interface:Object2BooleanFunction
Returns the value to which the given key is mapped.- Specified by:
getBoolean
in 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:
Function.get(Object)
-
object2BooleanEntrySet
public ObjectSortedSet<Object2BooleanMap.Entry<K>> object2BooleanEntrySet()
Description copied from interface:Object2BooleanSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
- Specified by:
object2BooleanEntrySet
in interfaceObject2BooleanMap<K>
- Specified by:
object2BooleanEntrySet
in interfaceObject2BooleanSortedMap<K>
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Object2BooleanSortedMap.entrySet()
-
keySet
public ObjectSortedSet<K> 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 interfaceMap<K,Boolean>
- Specified by:
keySet
in interfaceObject2BooleanMap<K>
- Specified by:
keySet
in interfaceObject2BooleanSortedMap<K>
- Specified by:
keySet
in interfaceSortedMap<K,Boolean>
- Overrides:
keySet
in classAbstractObject2BooleanSortedMap<K>
- Returns:
- a type-specific sorted set view of the keys contained in this map.
- See Also:
Map.keySet()
-
values
public BooleanCollection 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 interfaceMap<K,Boolean>
- Specified by:
values
in interfaceObject2BooleanMap<K>
- Specified by:
values
in interfaceObject2BooleanSortedMap<K>
- Specified by:
values
in interfaceSortedMap<K,Boolean>
- Overrides:
values
in classAbstractObject2BooleanSortedMap<K>
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
comparator
public Comparator<? super K> comparator()
Description copied from interface:Object2BooleanSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.Note that this specification strengthens the one given in
SortedMap.comparator()
.- Specified by:
comparator
in interfaceObject2BooleanSortedMap<K>
- Specified by:
comparator
in interfaceSortedMap<K,Boolean>
- See Also:
SortedMap.comparator()
-
headMap
public Object2BooleanSortedMap<K> headMap(K to)
Description copied from interface:Object2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.Note that this specification strengthens the one given in
SortedMap.headMap(Object)
.- Specified by:
headMap
in interfaceObject2BooleanSortedMap<K>
- Specified by:
headMap
in interfaceSortedMap<K,Boolean>
- See Also:
SortedMap.headMap(Object)
-
tailMap
public Object2BooleanSortedMap<K> tailMap(K from)
Description copied from interface:Object2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.Note that this specification strengthens the one given in
SortedMap.tailMap(Object)
.- Specified by:
tailMap
in interfaceObject2BooleanSortedMap<K>
- Specified by:
tailMap
in interfaceSortedMap<K,Boolean>
- See Also:
SortedMap.tailMap(Object)
-
subMap
public Object2BooleanSortedMap<K> subMap(K from, K to)
Description copied from interface:Object2BooleanSortedMap
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object)
.- Specified by:
subMap
in interfaceObject2BooleanSortedMap<K>
- Specified by:
subMap
in interfaceSortedMap<K,Boolean>
- See Also:
SortedMap.subMap(Object,Object)
-
clone
public Object2BooleanAVLTreeMap<K> 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.
-
-