public abstract class AbstractReference2BooleanSortedMap<K> extends AbstractReference2BooleanMap<K> implements Reference2BooleanSortedMap<K>
AbstractReference2BooleanMap.BasicEntry<K>Reference2BooleanSortedMap.FastSortedEntrySet<K>Reference2BooleanMap.Entry<K>, Reference2BooleanMap.FastEntrySet<K>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<K,Boolean>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
ReferenceSortedSet<K> |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
BooleanCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, defaultReturnValue, defaultReturnValue, get, put, put, remove, removeBooleancomparator, headMap, reference2BooleanEntrySet, subMap, tailMapcontainsValuedefaultReturnValue, defaultReturnValue, getBoolean, put, removeBooleanclear, containsKey, get, put, remove, sizeclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizepublic ReferenceSortedSet<K> keySet()
The view is backed by the sorted set returned by entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes
that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more
efficient ad-hoc implementations.
keySet in interface Reference2BooleanMap<K>keySet in interface Reference2BooleanSortedMap<K>keySet in interface Map<K,Boolean>keySet in interface SortedMap<K,Boolean>keySet in class AbstractReference2BooleanMap<K>Map.keySet()public BooleanCollection values()
The view is backed by the sorted set returned by entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes
that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more
efficient ad-hoc implementations.
values in interface Reference2BooleanMap<K>values in interface Reference2BooleanSortedMap<K>values in interface Map<K,Boolean>values in interface SortedMap<K,Boolean>values in class AbstractReference2BooleanMap<K>Map.values()public ObjectSortedSet<Map.Entry<K,Boolean>> entrySet()
Reference2BooleanMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Reference2BooleanMap<K>entrySet in interface Reference2BooleanSortedMap<K>entrySet in interface Map<K,Boolean>entrySet in interface SortedMap<K,Boolean>entrySet in class AbstractReference2BooleanMap<K>Map.entrySet()