Function<K,java.lang.Integer>, Object2IntFunction<K>, Object2IntMap<K>, Object2IntSortedMap<K>, java.io.Serializable, java.util.function.Function<K,java.lang.Integer>, java.util.function.ToIntFunction<K>, java.util.Map<K,java.lang.Integer>, java.util.SortedMap<K,java.lang.Integer>Object2IntAVLTreeMap, Object2IntLinkedOpenCustomHashMap, Object2IntLinkedOpenHashMap, Object2IntRBTreeMappublic abstract class AbstractObject2IntSortedMap<K> extends AbstractObject2IntMap<K> implements Object2IntSortedMap<K>
AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>Object2IntMap.Entry<K>, Object2IntMap.FastEntrySet<K>Object2IntSortedMap.FastSortedEntrySet<K>| Modifier and Type | Method | Description |
|---|---|---|
ObjectSortedSet<K> |
keySet() |
Returns a type-specific-set view of the keys of this map.
|
IntCollection |
values() |
Returns a type-specific-set view of the values of this map.
|
defaultReturnValue, defaultReturnValuecontainsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, isEmpty, putAll, replaceAllapplyAsInt, getInt, put, removeIntclear, computeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizecomparator, entrySet, headMap, object2IntEntrySet, subMap, tailMappublic 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 java.util.Map<K,java.lang.Integer>keySet in interface Object2IntMap<K>keySet in interface Object2IntSortedMap<K>keySet in interface java.util.SortedMap<K,java.lang.Integer>keySet in class AbstractObject2IntMap<K>Map.keySet()public IntCollection 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 java.util.Map<K,java.lang.Integer>values in interface Object2IntMap<K>values in interface Object2IntSortedMap<K>values in interface java.util.SortedMap<K,java.lang.Integer>values in class AbstractObject2IntMap<K>Map.values()