Function<K,java.lang.Boolean>, Object2BooleanFunction<K>, Object2BooleanMap<K>, Object2BooleanSortedMap<K>, java.io.Serializable, java.lang.Cloneable, java.util.function.Function<K,java.lang.Boolean>, java.util.function.Predicate<K>, java.util.Map<K,java.lang.Boolean>, java.util.SortedMap<K,java.lang.Boolean>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.
AbstractObject2BooleanMap.BasicEntry<K>, AbstractObject2BooleanMap.BasicEntrySet<K>Object2BooleanMap.FastEntrySet<K>Object2BooleanSortedMap.FastSortedEntrySet<K>| 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 its
Comparator). |
Object2BooleanAVLTreeMap(java.util.Comparator<? super K> c) |
Creates a new empty tree map with the given comparator.
|
Object2BooleanAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Boolean> m) |
Creates a new tree map copying a given map.
|
Object2BooleanAVLTreeMap(java.util.SortedMap<K,java.lang.Boolean> m) |
Creates a new tree map copying a given sorted map (and its
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.
|
| 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.
|
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) |
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
than
toKey. |
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(java.lang.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 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. |
BooleanCollection |
values() |
Returns a type-specific collection view of the values contained in this map.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAlltestcomputeBoolean, computeBooleanIfAbsent, computeBooleanIfAbsentPartial, computeBooleanIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeBoolean, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceentrySetpublic 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)
Object2BooleanFunctionput in interface Object2BooleanFunction<K>k - the key.v - the value.Function.put(Object,Object)public boolean removeBoolean(java.lang.Object k)
Object2BooleanFunctionremoveBoolean in interface Object2BooleanFunction<K>k - the key.Function.remove(Object)public boolean containsValue(boolean v)
Object2BooleanMaptrue 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()
Object2BooleanMappublic boolean containsKey(java.lang.Object k)
Object2BooleanMapcontainsKey in interface Function<K,java.lang.Boolean>containsKey in interface java.util.Map<K,java.lang.Boolean>containsKey in interface Object2BooleanMap<K>containsKey in class AbstractObject2BooleanMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2BooleanMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Boolean>isEmpty in class AbstractObject2BooleanMap<K>public boolean getBoolean(java.lang.Object k)
Object2BooleanFunctiongetBoolean in interface Object2BooleanFunction<K>k - the key.Function.get(Object)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 ObjectSortedSet<Object2BooleanMap.Entry<K>> object2BooleanEntrySet()
Object2BooleanSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
object2BooleanEntrySet in interface Object2BooleanMap<K>object2BooleanEntrySet in interface Object2BooleanSortedMap<K>Object2BooleanSortedMap.entrySet()public 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 java.util.Map<K,java.lang.Boolean>keySet in interface Object2BooleanMap<K>keySet in interface Object2BooleanSortedMap<K>keySet in interface java.util.SortedMap<K,java.lang.Boolean>keySet in class AbstractObject2BooleanSortedMap<K>Map.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 java.util.Map<K,java.lang.Boolean>values in interface Object2BooleanMap<K>values in interface Object2BooleanSortedMap<K>values in interface java.util.SortedMap<K,java.lang.Boolean>values in class AbstractObject2BooleanSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2BooleanSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2BooleanSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.Boolean>SortedMap.comparator()public Object2BooleanSortedMap<K> headMap(K to)
Object2BooleanSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
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.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
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.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
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.