public abstract class AbstractObject2ReferenceSortedMap<K,V> extends AbstractObject2ReferenceMap<K,V> implements Object2ReferenceSortedMap<K,V>
| Modifier and Type | Class and Description |
|---|---|
protected class |
AbstractObject2ReferenceSortedMap.KeySet
A wrapper exhibiting the keys of a map.
|
protected static class |
AbstractObject2ReferenceSortedMap.KeySetIterator<K,V>
A wrapper exhibiting a map iterator as an iterator on keys.
|
protected class |
AbstractObject2ReferenceSortedMap.ValuesCollection
A wrapper exhibiting the values of a map.
|
protected static class |
AbstractObject2ReferenceSortedMap.ValuesIterator<K,V>
A wrapper exhibiting a map iterator as an iterator on values.
|
AbstractObject2ReferenceMap.BasicEntry<K,V>, AbstractObject2ReferenceMap.BasicEntrySet<K,V>Object2ReferenceSortedMap.FastSortedEntrySet<K,V>Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.FastEntrySet<K,V>defRetValue| Modifier | Constructor and Description |
|---|---|
protected |
AbstractObject2ReferenceSortedMap() |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringdefaultReturnValue, defaultReturnValueclone, finalize, getClass, notify, notifyAll, wait, wait, waitcomparator, entrySet, headMap, object2ReferenceEntrySet, 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 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 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 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()Copyright © 2020. All rights reserved.