public abstract class AbstractInt2IntSortedMap extends AbstractInt2IntMap implements Int2IntSortedMap
AbstractInt2IntMap.BasicEntryInt2IntSortedMap.FastSortedEntrySetInt2IntMap.Entry, Int2IntMap.FastEntrySet| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<Integer,Integer>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
Integer |
firstKey()
Delegates to the corresponding type-specific method.
|
Int2IntSortedMap |
headMap(Integer to)
Delegates to the corresponding type-specific method.
|
IntSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
Integer |
lastKey()
Delegates to the corresponding type-specific method.
|
Int2IntSortedMap |
subMap(Integer from,
Integer to)
Delegates to the corresponding type-specific method.
|
Int2IntSortedMap |
tailMap(Integer from)
Delegates to the corresponding type-specific method.
|
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, containsKey, defaultReturnValue, defaultReturnValue, get, put, put, remove, removecomparator, firstIntKey, headMap, int2IntEntrySet, lastIntKey, subMap, tailMapcontainsValuecontainsKey, defaultReturnValue, defaultReturnValue, get, put, removeclear, 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 Int2IntSortedMap headMap(Integer to)
headMap in interface Int2IntSortedMapheadMap in interface SortedMap<Integer,Integer>SortedMap.headMap(Object)public Int2IntSortedMap tailMap(Integer from)
tailMap in interface Int2IntSortedMaptailMap in interface SortedMap<Integer,Integer>SortedMap.tailMap(Object)public Int2IntSortedMap subMap(Integer from, Integer to)
subMap in interface Int2IntSortedMapsubMap in interface SortedMap<Integer,Integer>SortedMap.subMap(Object,Object)public Integer firstKey()
public Integer lastKey()
public IntSortedSet 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 Int2IntMapkeySet in interface Int2IntSortedMapkeySet in interface Map<Integer,Integer>keySet in interface SortedMap<Integer,Integer>keySet in class AbstractInt2IntMapMap.keySet()public IntCollection 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 Int2IntMapvalues in interface Int2IntSortedMapvalues in interface Map<Integer,Integer>values in interface SortedMap<Integer,Integer>values in class AbstractInt2IntMapMap.values()public ObjectSortedSet<Map.Entry<Integer,Integer>> entrySet()
Int2IntMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Int2IntMapentrySet in interface Int2IntSortedMapentrySet in interface Map<Integer,Integer>entrySet in interface SortedMap<Integer,Integer>entrySet in class AbstractInt2IntMapMap.entrySet()