public class Object2BooleanRBTreeMap<K> extends AbstractObject2BooleanSortedMap<K> implements Serializable, 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>Object2BooleanSortedMap.FastSortedEntrySet<K>Object2BooleanMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2BooleanRBTreeMap()
Creates a new empty tree map.
|
Object2BooleanRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
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.
|
Object2BooleanRBTreeMap(Map<? extends K,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Object2BooleanRBTreeMap(Object2BooleanMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2BooleanRBTreeMap(Object2BooleanSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2BooleanRBTreeMap(SortedMap<K,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).
|
Object2BooleanRBTreeMap<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)
Returns
true 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 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(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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySetcomputeBoolean, computeBooleanIfAbsent, computeBooleanIfAbsentPartial, computeBooleanIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeBoolean, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacetestcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAllpublic Object2BooleanRBTreeMap()
public Object2BooleanRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2BooleanRBTreeMap(Map<? extends K,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Object2BooleanRBTreeMap(SortedMap<K,Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2BooleanRBTreeMap(Object2BooleanMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2BooleanRBTreeMap(Object2BooleanSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2BooleanRBTreeMap(K[] k, boolean[] v, 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.IllegalArgumentException - if k and v have different lengths.public Object2BooleanRBTreeMap(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.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(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()
Object2BooleanMapclear in interface Object2BooleanMap<K>clear in interface Map<K,Boolean>Map.clear()public boolean containsKey(Object k)
Object2BooleanMapcontainsKey in interface Object2BooleanMap<K>containsKey in interface Map<K,Boolean>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()
public boolean getBoolean(Object k)
Object2BooleanFunctiongetBoolean in interface Object2BooleanFunction<K>k - the key.Function.get(Object)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 Object2BooleanMap<K>keySet in interface Object2BooleanSortedMap<K>keySet in interface Map<K,Boolean>keySet in interface SortedMap<K,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 Object2BooleanMap<K>values in interface Object2BooleanSortedMap<K>values in interface Map<K,Boolean>values in interface SortedMap<K,Boolean>values in class AbstractObject2BooleanSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2BooleanSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2BooleanSortedMap<K>comparator in interface SortedMap<K,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 SortedMap<K,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 SortedMap<K,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 SortedMap<K,Boolean>SortedMap.subMap(Object,Object)public Object2BooleanRBTreeMap<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.