public abstract class AbstractObject2ObjectSortedMap<K,V> extends AbstractObject2ObjectMap<K,V> implements Object2ObjectSortedMap<K,V>
AbstractObject2ObjectMap.BasicEntry<K,V>Object2ObjectSortedMap.FastSortedEntrySet<K,V>Object2ObjectMap.Entry<K,V>, Object2ObjectMap.FastEntrySet<K,V>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringdefaultReturnValue, defaultReturnValuecomparator, entrySet, headMap, object2ObjectEntrySet, subMap, tailMapclear, containsKey, defaultReturnValue, defaultReturnValue, put, remove, sizegetcompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic ObjectSortedSet<K> keySet()
The view is backed by the set returned by Map.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.
The view is backed by the sorted set returned by
Map.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 Object2ObjectMap<K,V>keySet in interface Object2ObjectSortedMap<K,V>keySet in interface Map<K,V>keySet in interface SortedMap<K,V>keySet in class AbstractObject2ObjectMap<K,V>Map.keySet()public ObjectCollection<V> values()
The view is backed by the set returned by Map.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.
The view is backed by the sorted set returned by
Map.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 Object2ObjectMap<K,V>values in interface Object2ObjectSortedMap<K,V>values in interface Map<K,V>values in interface SortedMap<K,V>values in class AbstractObject2ObjectMap<K,V>Map.values()