IntIntBTreeMap (btreemap 1.1.0 API)

java.lang.Object
- uk.co.omegaprime.btreemap.IntIntBTreeMap

All Implemented Interfaces:

java.util.Map<java.lang.Integer,java.lang.Integer>, java.util.NavigableMap<java.lang.Integer,java.lang.Integer>, java.util.SortedMap<java.lang.Integer,java.lang.Integer>
```
public class IntIntBTreeMap
extends java.lang.Object
implements java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
```
A B-tree based NavigableMap implementation for int keys and int values.
To get started, call create().
All values in the map are stored at leaf nodes, and all leaf nodes are at the same depth. This ensures that accesses to the map via e.g. get, put and remove all take log(n) time. In contrast to a balanced binary tree (like that used by TreeMap), each node may holds more than one key. This makes the datastructure more cache-friendly: you can expect it to be around 50% faster than TreeMap for workloads that do not fit in cache.
The map is sorted either according to the Comparable method of the key type, or via a user-supplied Comparator. This ordering should be consistent with equals.
The implementation is unsynchronized, and there are no guarantees as to what will happen if you make use of iterator that was created before some operation that modified the map.
Entry instances returned by this class are immutable and hence do not support the Entry#setValue(Object) method.

Nested Class Summary
- Nested classes/interfaces inherited from interface java.util.Map
  java.util.Map.Entry<K,V>

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`ceilingEntry(int key)` Returns the entry with smallest key greater than or equal to `key`, or null if no such entry exists
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`ceilingEntry(java.lang.Integer key)`
`java.lang.Integer`	`ceilingKey(int key)` Returns the key of the entry returned by `ceilingEntry(java.lang.Integer)`, or null if no such entry exists
`java.lang.Integer`	`ceilingKey(java.lang.Integer key)`
`int`	`ceilingKeyInt(int key)` Returns the key of the entry returned by `ceilingEntry(java.lang.Integer)`, or the most negative `int` value if no such entry exists
`void`	`clear()`
`IntComparator`	`comparator()`
`boolean`	`containsKey(int key)` Returns true iff an entry exists in the map with the supplied key.
`boolean`	`containsKey(java.lang.Object key)`
`boolean`	`containsValue(java.lang.Object value)`
`static IntIntBTreeMap`	`create()` Create as empty `BTreeMap` that uses the natural order of the keys
`static IntIntBTreeMap`	`create(java.util.Comparator<? super java.lang.Integer> comparator)` Create an empty `BTreeMap` that uses a custom comparator on the keys.
`static IntIntBTreeMap`	`create(IntComparator comparator)` Create an empty `BTreeMap` that uses a custom comparator on the keys.
`static IntIntBTreeMap`	`create(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> that)` Create a new map that contains the same entries as the specified `Map`, and uses the natural ordering on the keys
`static IntIntBTreeMap`	`create(java.util.SortedMap<java.lang.Integer,? extends java.lang.Integer> that)` Create a new map that contains the same entries as the specified `SortedMap`, and also shares a key ordering with it
`java.util.NavigableSet<java.lang.Integer>`	`descendingKeySet()`
`java.util.NavigableMap<java.lang.Integer,java.lang.Integer>`	`descendingMap()`
`java.util.Set<java.util.Map.Entry<java.lang.Integer,java.lang.Integer>>`	`entrySet()`
`boolean`	`equals(java.lang.Object that)`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`firstEntry()`
`java.lang.Integer`	`firstKey()`
`int`	`firstKeyInt()` Returns the key of the entry that would be returned by `firstEntry()`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`floorEntry(int key)` Returns entry with largest key less than or equal to `key`, or null if no such entry exists
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`floorEntry(java.lang.Integer key)`
`java.lang.Integer`	`floorKey(int key)` Returns the key of the entry returned by `floorEntry(java.lang.Integer)`, or null if no such entry exists
`java.lang.Integer`	`floorKey(java.lang.Integer key)`
`int`	`floorKeyInt(int key)` Returns the key of the entry returned by `floorEntry(java.lang.Integer)`, or the most negative `int` value if no such entry exists
`java.lang.Integer`	`get(int key)` Gets the value at the given key.
`java.lang.Integer`	`get(java.lang.Object key)`
`int`	`getInt(int key)` Gets the value at the given key.
`int`	`getInt(java.lang.Object key)` Gets the value at the given key.
`java.lang.Integer`	`getOrDefault(int key, java.lang.Integer dflt)` Gets the value at the given key.
`java.lang.Integer`	`getOrDefault(java.lang.Object key, java.lang.Integer dflt)`
`int`	`getOrDefaultInt(int key, int dflt)` Gets the value at the given key.
`int`	`getOrDefaultInt(java.lang.Object key, int dflt)` Gets the value at the given key.
`int`	`hashCode()`
`java.util.SortedMap<java.lang.Integer,java.lang.Integer>`	`headMap(java.lang.Integer toKey)`
`java.util.NavigableMap<java.lang.Integer,java.lang.Integer>`	`headMap(java.lang.Integer toKey, boolean inclusive)`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`higherEntry(int key)` Returns the entry with smallest key strictly greater than `key`, or null if no such entry exists
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`higherEntry(java.lang.Integer key)`
`java.lang.Integer`	`higherKey(int key)` Returns the key of the entry returned by `higherEntry(java.lang.Integer)`, or null if no such entry exists
`java.lang.Integer`	`higherKey(java.lang.Integer key)`
`int`	`higherKeyInt(int key)` Returns the key of the entry returned by `higherEntry(java.lang.Integer)`, or the most negative `int` value if no such entry exists
`boolean`	`isEmpty()`
`java.util.NavigableSet<java.lang.Integer>`	`keySet()`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`lastEntry()`
`java.lang.Integer`	`lastKey()`
`int`	`lastKeyInt()` Returns the key of the entry that would be returned by `lastEntry()`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`lowerEntry(int key)` Returns the entry with largest key strictly less than `key`, or null if no such entry exists
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`lowerEntry(java.lang.Integer key)`
`java.lang.Integer`	`lowerKey(int key)` Returns the key of the entry returned by `lowerEntry(java.lang.Integer)`, or null if no such entry exists
`java.lang.Integer`	`lowerKey(java.lang.Integer key)`
`int`	`lowerKeyInt(int key)` Returns the key of the entry returned by `lowerEntry(java.lang.Integer)`, or the most negative `int` value if no such entry exists
`java.util.NavigableSet<java.lang.Integer>`	`navigableKeySet()`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`pollFirstEntry()`
`java.util.Map.Entry<java.lang.Integer,java.lang.Integer>`	`pollLastEntry()`
`java.lang.Integer`	`put(java.lang.Integer key, java.lang.Integer value)`
`java.lang.Integer`	`put(int key, int value)` Adds a new entry to the map, and returns the old value associated with this key.
`void`	`putAll(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> that)`
`int`	`putInt(int key, int value)` Adds a new entry to the map, and returns the old value associated with this key.
`java.lang.Integer`	`remove(int key)` Remove the entry with the specified key, returning the value of the removed entry.
`java.lang.Integer`	`remove(java.lang.Object key)`
`int`	`removeInt(int key)` Remove the entry with the specified key, returning the value of the removed entry.
`int`	`removeInt(java.lang.Object key)` Remove the entry with the specified key, returning the value of the removed entry.
`int`	`size()`
`java.util.NavigableMap<java.lang.Integer,java.lang.Integer>`	`subMap(java.lang.Integer fromKey, boolean fromInclusive, java.lang.Integer toKey, boolean toInclusive)`
`java.util.SortedMap<java.lang.Integer,java.lang.Integer>`	`subMap(java.lang.Integer fromKey, java.lang.Integer toKey)`
`java.util.SortedMap<java.lang.Integer,java.lang.Integer>`	`tailMap(java.lang.Integer fromKey)`
`java.util.NavigableMap<java.lang.Integer,java.lang.Integer>`	`tailMap(java.lang.Integer fromKey, boolean inclusive)`
`java.lang.String`	`toString()`
`java.util.Collection<java.lang.Integer>`	`values()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, forEach, merge, putIfAbsent, remove, replace, replace, replaceAll

- Method Detail
  - create
```
public static IntIntBTreeMap create()
```
    Create as empty BTreeMap that uses the natural order of the keys
  - create
```
public static IntIntBTreeMap create(java.util.Comparator<? super java.lang.Integer> comparator)
```
    Create an empty BTreeMap that uses a custom comparator on the keys.
    
    Parameters:
    
    comparator - If null, the natural order of the keys will be used
  - create
```
public static IntIntBTreeMap create(IntComparator comparator)
```
    Create an empty BTreeMap that uses a custom comparator on the keys.
    
    Parameters:
    
    comparator - If null, the natural order of the keys will be used
  - create
```
public static IntIntBTreeMap create(java.util.SortedMap<java.lang.Integer,? extends java.lang.Integer> that)
```
    Create a new map that contains the same entries as the specified SortedMap, and also shares a key ordering with it
  - create
```
public static IntIntBTreeMap create(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> that)
```
    Create a new map that contains the same entries as the specified Map, and uses the natural ordering on the keys
  - clear
```
public void clear()
```
    Specified by:
    
    clear in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - comparator
```
public IntComparator comparator()
```
    Specified by:
    
    comparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - putAll
```
public void putAll(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> that)
```
    Specified by:
    
    putAll in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - get
```
public java.lang.Integer get(java.lang.Object key)
```
    Specified by:
    
    get in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - getInt
```
public int getInt(java.lang.Object key)
```
    Gets the value at the given key. If no such value was found, returns the most negative int value.
  - get
```
public java.lang.Integer get(int key)
```
    Gets the value at the given key. If no such value was found, returns null.
  - getInt
```
public int getInt(int key)
```
    Gets the value at the given key. If no such value was found, returns the most negative int value.
  - getOrDefault
```
public java.lang.Integer getOrDefault(java.lang.Object key,
                                      java.lang.Integer dflt)
```
    Specified by:
    
    getOrDefault in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - getOrDefault
```
public java.lang.Integer getOrDefault(int key,
                                      java.lang.Integer dflt)
```
    Gets the value at the given key. If no such value was found, returns the specified default.
  - getOrDefaultInt
```
public int getOrDefaultInt(java.lang.Object key,
                           int dflt)
```
    Gets the value at the given key. If no such value was found, returns the most negative int value.
  - getOrDefaultInt
```
public int getOrDefaultInt(int key,
                           int dflt)
```
    Gets the value at the given key. If no such value was found, returns the specified default.
  - containsKey
```
public boolean containsKey(java.lang.Object key)
```
    Specified by:
    
    containsKey in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - containsKey
```
public boolean containsKey(int key)
```
    Returns true iff an entry exists in the map with the supplied key.
  - put
```
public java.lang.Integer put(int key,
                             int value)
```
    Adds a new entry to the map, and returns the old value associated with this key. If no prior entry existed, returns null.
  - putInt
```
public int putInt(int key,
                  int value)
```
    Adds a new entry to the map, and returns the old value associated with this key. If no prior entry existed, returns the most negative int value.
  - put
```
public java.lang.Integer put(java.lang.Integer key,
                             java.lang.Integer value)
```
    Specified by:
    
    put in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if either the key or value are null
  - size
```
public int size()
```
    Specified by:
    
    size in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - containsValue
```
public boolean containsValue(java.lang.Object value)
```
    Specified by:
    
    containsValue in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - toString
```
public java.lang.String toString()
```
    Overrides:
    
    toString in class java.lang.Object
  - equals
```
public boolean equals(java.lang.Object that)
```
    Specified by:
    
    equals in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Overrides:
    
    equals in class java.lang.Object
  - hashCode
```
public int hashCode()
```
    Specified by:
    
    hashCode in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Overrides:
    
    hashCode in class java.lang.Object
  - lowerKey
```
public java.lang.Integer lowerKey(java.lang.Integer key)
```
    Specified by:
    
    lowerKey in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if the key is null
  - lowerKeyInt
```
public int lowerKeyInt(int key)
```
    Returns the key of the entry returned by lowerEntry(java.lang.Integer), or the most negative int value if no such entry exists
  - lowerKey
```
public java.lang.Integer lowerKey(int key)
```
    Returns the key of the entry returned by lowerEntry(java.lang.Integer), or null if no such entry exists
  - higherKey
```
public java.lang.Integer higherKey(java.lang.Integer key)
```
    Specified by:
    
    higherKey in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if the key is null
  - higherKeyInt
```
public int higherKeyInt(int key)
```
    Returns the key of the entry returned by higherEntry(java.lang.Integer), or the most negative int value if no such entry exists
  - higherKey
```
public java.lang.Integer higherKey(int key)
```
    Returns the key of the entry returned by higherEntry(java.lang.Integer), or null if no such entry exists
  - floorKey
```
public java.lang.Integer floorKey(java.lang.Integer key)
```
    Specified by:
    
    floorKey in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if the key is null
  - floorKeyInt
```
public int floorKeyInt(int key)
```
    Returns the key of the entry returned by floorEntry(java.lang.Integer), or the most negative int value if no such entry exists
  - floorKey
```
public java.lang.Integer floorKey(int key)
```
    Returns the key of the entry returned by floorEntry(java.lang.Integer), or null if no such entry exists
  - ceilingKey
```
public java.lang.Integer ceilingKey(java.lang.Integer key)
```
    Specified by:
    
    ceilingKey in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if the key is null
  - ceilingKeyInt
```
public int ceilingKeyInt(int key)
```
    Returns the key of the entry returned by ceilingEntry(java.lang.Integer), or the most negative int value if no such entry exists
  - ceilingKey
```
public java.lang.Integer ceilingKey(int key)
```
    Returns the key of the entry returned by ceilingEntry(java.lang.Integer), or null if no such entry exists
  - lowerEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> lowerEntry(java.lang.Integer key)
```
    Specified by:
    
    lowerEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if key is null
  - lowerEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> lowerEntry(int key)
```
    Returns the entry with largest key strictly less than key, or null if no such entry exists
  - floorEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> floorEntry(java.lang.Integer key)
```
    Specified by:
    
    floorEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if key is null
  - floorEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> floorEntry(int key)
```
    Returns entry with largest key less than or equal to key, or null if no such entry exists
  - ceilingEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> ceilingEntry(java.lang.Integer key)
```
    Specified by:
    
    ceilingEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if key is null
  - ceilingEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> ceilingEntry(int key)
```
    Returns the entry with smallest key greater than or equal to key, or null if no such entry exists
  - higherEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> higherEntry(java.lang.Integer key)
```
    Specified by:
    
    higherEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Throws:
    
    java.lang.NullPointerException - if key is null
  - higherEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> higherEntry(int key)
```
    Returns the entry with smallest key strictly greater than key, or null if no such entry exists
  - firstEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> firstEntry()
```
    Specified by:
    
    firstEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - lastEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> lastEntry()
```
    Specified by:
    
    lastEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - pollFirstEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> pollFirstEntry()
```
    Specified by:
    
    pollFirstEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - pollLastEntry
```
public java.util.Map.Entry<java.lang.Integer,java.lang.Integer> pollLastEntry()
```
    Specified by:
    
    pollLastEntry in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - descendingMap
```
public java.util.NavigableMap<java.lang.Integer,java.lang.Integer> descendingMap()
```
    Specified by:
    
    descendingMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - navigableKeySet
```
public java.util.NavigableSet<java.lang.Integer> navigableKeySet()
```
    Specified by:
    
    navigableKeySet in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - descendingKeySet
```
public java.util.NavigableSet<java.lang.Integer> descendingKeySet()
```
    Specified by:
    
    descendingKeySet in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - subMap
```
public java.util.NavigableMap<java.lang.Integer,java.lang.Integer> subMap(java.lang.Integer fromKey,
                                                                          boolean fromInclusive,
                                                                          java.lang.Integer toKey,
                                                                          boolean toInclusive)
```
    Specified by:
    
    subMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - headMap
```
public java.util.NavigableMap<java.lang.Integer,java.lang.Integer> headMap(java.lang.Integer toKey,
                                                                           boolean inclusive)
```
    Specified by:
    
    headMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - tailMap
```
public java.util.NavigableMap<java.lang.Integer,java.lang.Integer> tailMap(java.lang.Integer fromKey,
                                                                           boolean inclusive)
```
    Specified by:
    
    tailMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
  - subMap
```
public java.util.SortedMap<java.lang.Integer,java.lang.Integer> subMap(java.lang.Integer fromKey,
                                                                       java.lang.Integer toKey)
```
    Specified by:
    
    subMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    subMap in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - headMap
```
public java.util.SortedMap<java.lang.Integer,java.lang.Integer> headMap(java.lang.Integer toKey)
```
    Specified by:
    
    headMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    headMap in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - tailMap
```
public java.util.SortedMap<java.lang.Integer,java.lang.Integer> tailMap(java.lang.Integer fromKey)
```
    Specified by:
    
    tailMap in interface java.util.NavigableMap<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    tailMap in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - firstKey
```
public java.lang.Integer firstKey()
```
    Specified by:
    
    firstKey in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - firstKeyInt
```
public int firstKeyInt()
```
    Returns the key of the entry that would be returned by firstEntry()
    
    Throws:
    
    java.util.NoSuchElementException - if the map is empty
  - lastKey
```
public java.lang.Integer lastKey()
```
    Specified by:
    
    lastKey in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - lastKeyInt
```
public int lastKeyInt()
```
    Returns the key of the entry that would be returned by lastEntry()
    
    Throws:
    
    java.util.NoSuchElementException - if the map is empty
  - keySet
```
public java.util.NavigableSet<java.lang.Integer> keySet()
```
    Specified by:
    
    keySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - values
```
public java.util.Collection<java.lang.Integer> values()
```
    Specified by:
    
    values in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    values in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - entrySet
```
public java.util.Set<java.util.Map.Entry<java.lang.Integer,java.lang.Integer>> entrySet()
```
    Specified by:
    
    entrySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>
    
    Specified by:
    
    entrySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
  - removeInt
```
public int removeInt(java.lang.Object key)
```
    Remove the entry with the specified key, returning the value of the removed entry. If no such entry existed, returns the most negative int value.
  - removeInt
```
public int removeInt(int key)
```
    Remove the entry with the specified key, returning the value of the removed entry. If no such entry existed, returns the most negative int value.
  - remove
```
public java.lang.Integer remove(java.lang.Object key)
```
    Specified by:
    
    remove in interface java.util.Map<java.lang.Integer,java.lang.Integer>
  - remove
```
public java.lang.Integer remove(int key)
```
    Remove the entry with the specified key, returning the value of the removed entry. If no such entry existed, returns null.

Class IntIntBTreeMap

Nested Class Summary

Nested classes/interfaces inherited from interface java.util.Map

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface java.util.Map

Method Detail

create

create

create

create

create

clear

comparator

putAll

get

getInt

get

getInt

getOrDefault

getOrDefault

getOrDefaultInt

getOrDefaultInt

containsKey

containsKey

put

putInt

put

size

isEmpty

containsValue

toString

equals

hashCode

lowerKey

lowerKeyInt

lowerKey

higherKey

higherKeyInt

higherKey

floorKey

floorKeyInt

floorKey

ceilingKey

ceilingKeyInt

ceilingKey

lowerEntry

lowerEntry

floorEntry

floorEntry

ceilingEntry

ceilingEntry

higherEntry

higherEntry

firstEntry

lastEntry

pollFirstEntry

pollLastEntry

descendingMap

navigableKeySet

descendingKeySet

subMap

headMap

tailMap

subMap

headMap

tailMap

firstKey

firstKeyInt

lastKey

lastKeyInt

keySet

values

entrySet

removeInt

removeInt

remove

remove