public abstract class AbstractReference2ReferenceSortedMap<K,V> extends AbstractReference2ReferenceMap<K,V> implements Reference2ReferenceSortedMap<K,V>
AbstractReference2ReferenceMap.BasicEntry<K,V>Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>Reference2ReferenceMap.Entry<K,V>, Reference2ReferenceMap.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.
|
ReferenceSortedSet<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, reference2ReferenceEntrySet, 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 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 Reference2ReferenceMap<K,V>keySet in interface Reference2ReferenceSortedMap<K,V>keySet in interface Map<K,V>keySet in interface SortedMap<K,V>keySet in class AbstractReference2ReferenceMap<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 Reference2ReferenceMap<K,V>values in interface Reference2ReferenceSortedMap<K,V>values in interface Map<K,V>values in interface SortedMap<K,V>values in class AbstractReference2ReferenceMap<K,V>Map.values()public ObjectSortedSet<Map.Entry<K,V>> entrySet()
Reference2ReferenceMap
Note that this specification strengthens the one given in
Map.entrySet().
entrySet in interface Reference2ReferenceMap<K,V>entrySet in interface Reference2ReferenceSortedMap<K,V>entrySet in interface Map<K,V>entrySet in interface SortedMap<K,V>entrySet in class AbstractReference2ReferenceMap<K,V>Map.entrySet()