public abstract class AbstractObject2ReferenceSortedMap<K,V> extends AbstractObject2ReferenceMap<K,V> implements Object2ReferenceSortedMap<K,V>
AbstractObject2ReferenceMap.BasicEntry<K,V>Object2ReferenceSortedMap.FastSortedEntrySet<K,V>Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.FastEntrySet<K,V>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<K,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, defaultReturnValue, defaultReturnValue, put, removecomparator, headMap, object2ReferenceEntrySet, subMap, tailMapdefaultReturnValue, defaultReturnValueclear, 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 ObjectSortedSet<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 Object2ReferenceMap<K,V>keySet in interface Object2ReferenceSortedMap<K,V>keySet in interface Map<K,V>keySet in interface SortedMap<K,V>keySet in class AbstractObject2ReferenceMap<K,V>Map.keySet()public ReferenceCollection<V> 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 Object2ReferenceMap<K,V>values in interface Object2ReferenceSortedMap<K,V>values in interface Map<K,V>values in interface SortedMap<K,V>values in class AbstractObject2ReferenceMap<K,V>Map.values()public ObjectSortedSet<Map.Entry<K,V>> entrySet()
Object2ReferenceMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Object2ReferenceMap<K,V>entrySet in interface Object2ReferenceSortedMap<K,V>entrySet in interface Map<K,V>entrySet in interface SortedMap<K,V>entrySet in class AbstractObject2ReferenceMap<K,V>Map.entrySet()