Function<java.lang.Integer,java.lang.Integer>, Int2IntFunction, Int2IntMap, Int2IntSortedMap, java.io.Serializable, java.util.function.Function<java.lang.Integer,java.lang.Integer>, java.util.function.IntUnaryOperator, java.util.Map<java.lang.Integer,java.lang.Integer>, java.util.SortedMap<java.lang.Integer,java.lang.Integer>Int2IntAVLTreeMap, Int2IntLinkedOpenHashMap, Int2IntRBTreeMappublic abstract class AbstractInt2IntSortedMap extends AbstractInt2IntMap implements Int2IntSortedMap
AbstractInt2IntMap.BasicEntry, AbstractInt2IntMap.BasicEntrySetInt2IntMap.Entry, Int2IntMap.FastEntrySetInt2IntSortedMap.FastSortedEntrySet| Modifier and Type | Method | Description |
|---|---|---|
IntSortedSet |
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, toStringapplyAsInt, get, put, removeclear, compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizecomparator, entrySet, firstIntKey, firstKey, headMap, headMap, int2IntEntrySet, lastIntKey, lastKey, subMap, subMap, tailMap, tailMappublic IntSortedSet 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 Int2IntMapkeySet in interface Int2IntSortedMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>keySet in class AbstractInt2IntMapMap.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 Int2IntMapvalues in interface Int2IntSortedMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>values in class AbstractInt2IntMapMap.values()