public class Object2BooleanAVLTreeMap<K> extends AbstractObject2BooleanSortedMap<K> implements java.io.Serializable, java.lang.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.
AbstractObject2BooleanSortedMap.KeySetIterator<K>, AbstractObject2BooleanSortedMap.ValuesCollection, AbstractObject2BooleanSortedMap.ValuesIterator<K>AbstractObject2BooleanMap.BasicEntry<K>, AbstractObject2BooleanMap.BasicEntrySet<K>Object2BooleanSortedMap.FastSortedEntrySet<K>Object2BooleanMap.FastEntrySet<K>| Modifier and Type | Field and Description |
|---|---|
protected java.util.Comparator<? super K> |
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 it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2BooleanMap.Entry<K>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> |
firstEntry
The first key in this map.
|
protected it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> |
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 java.util.Comparator<? super K> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> |
tree
A reference to the root entry.
|
protected it.unimi.dsi.fastutil.booleans.BooleanCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Object2BooleanAVLTreeMap()
Creates a new empty tree map.
|
Object2BooleanAVLTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2BooleanAVLTreeMap(K[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2BooleanAVLTreeMap(K[] k,
boolean[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2BooleanAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Boolean> m)
Creates a new tree map copying a given 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 its
Comparator). |
Object2BooleanAVLTreeMap(java.util.SortedMap<K,java.lang.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).
|
Object2BooleanAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(java.lang.Object 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. |
K |
firstKey() |
boolean |
getBoolean(java.lang.Object k) |
Object2BooleanSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
it.unimi.dsi.fastutil.objects.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) |
boolean |
removeBoolean(java.lang.Object k) |
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 from
fromKey, inclusive, to toKey, exclusive. |
Object2BooleanSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
it.unimi.dsi.fastutil.booleans.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, waitentrySetcomputeBoolean, computeBooleanIfAbsent, computeBooleanIfAbsentPartial, computeBooleanIfPresent, computeIfAbsent, computeIfAbsent, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceandThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, testprotected transient it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> tree
protected int count
protected transient it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> firstEntry
protected transient it.unimi.dsi.fastutil.objects.Object2BooleanAVLTreeMap.Entry<K> lastEntry
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2BooleanMap.Entry<K>> entries
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> keys
protected transient it.unimi.dsi.fastutil.booleans.BooleanCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected java.util.Comparator<? super K> storedComparator
protected transient java.util.Comparator<? super K> actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Object2BooleanAVLTreeMap()
public Object2BooleanAVLTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2BooleanAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Boolean> m)
m - a Map to be copied into the new tree map.public Object2BooleanAVLTreeMap(java.util.SortedMap<K,java.lang.Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2BooleanAVLTreeMap(Object2BooleanMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2BooleanAVLTreeMap(Object2BooleanSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2BooleanAVLTreeMap(K[] k, boolean[] v, java.util.Comparator<? super K> 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.java.lang.IllegalArgumentException - if k and v have different lengths.public Object2BooleanAVLTreeMap(K[] k, boolean[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.java.lang.IllegalArgumentException - if k and v have different lengths.public boolean put(K k, boolean v)
put in interface it.unimi.dsi.fastutil.objects.Object2BooleanFunction<K>public boolean removeBoolean(java.lang.Object k)
removeBoolean in interface it.unimi.dsi.fastutil.objects.Object2BooleanFunction<K>public boolean containsValue(boolean v)
AbstractObject2BooleanMaptrue if this map maps one or more keys to the specified value.containsValue in interface Object2BooleanMap<K>containsValue in class AbstractObject2BooleanMap<K>Map.containsValue(Object)public void clear()
Object2BooleanMapclear in interface Object2BooleanMap<K>clear in interface java.util.Map<K,java.lang.Boolean>public boolean containsKey(java.lang.Object k)
AbstractObject2BooleanMapcontainsKey in interface Object2BooleanMap<K>containsKey in interface java.util.Map<K,java.lang.Boolean>containsKey in class AbstractObject2BooleanMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2BooleanMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.size in interface Object2BooleanMap<K>size in interface java.util.Map<K,java.lang.Boolean>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Boolean>isEmpty in class AbstractObject2BooleanMap<K>public boolean getBoolean(java.lang.Object k)
getBoolean in interface it.unimi.dsi.fastutil.objects.Object2BooleanFunction<K>public K firstKey()
firstKey in interface java.util.SortedMap<K,java.lang.Boolean>public K lastKey()
lastKey in interface java.util.SortedMap<K,java.lang.Boolean>public it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2BooleanMap.Entry<K>> object2BooleanEntrySet()
Object2BooleanSortedMapobject2BooleanEntrySet in interface Object2BooleanMap<K>object2BooleanEntrySet in interface Object2BooleanSortedMap<K>Object2BooleanSortedMap.entrySet()public it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> 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 Object2BooleanMap<K>keySet in interface Object2BooleanSortedMap<K>keySet in interface java.util.Map<K,java.lang.Boolean>keySet in interface java.util.SortedMap<K,java.lang.Boolean>keySet in class AbstractObject2BooleanSortedMap<K>Map.keySet()public it.unimi.dsi.fastutil.booleans.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 Object2BooleanMap<K>values in interface Object2BooleanSortedMap<K>values in interface java.util.Map<K,java.lang.Boolean>values in interface java.util.SortedMap<K,java.lang.Boolean>values in class AbstractObject2BooleanSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2BooleanSortedMapcomparator in interface Object2BooleanSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.Boolean>SortedMap.comparator()public Object2BooleanSortedMap<K> headMap(K to)
Object2BooleanSortedMaptoKey.headMap in interface Object2BooleanSortedMap<K>headMap in interface java.util.SortedMap<K,java.lang.Boolean>SortedMap.headMap(Object)public Object2BooleanSortedMap<K> tailMap(K from)
Object2BooleanSortedMapfromKey.tailMap in interface Object2BooleanSortedMap<K>tailMap in interface java.util.SortedMap<K,java.lang.Boolean>SortedMap.tailMap(Object)public Object2BooleanSortedMap<K> subMap(K from, K to)
Object2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Object2BooleanSortedMap<K>subMap in interface java.util.SortedMap<K,java.lang.Boolean>SortedMap.subMap(Object,Object)public Object2BooleanAVLTreeMap<K> 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.
clone in class java.lang.Object