public class IntFloatMap extends Object implements Iterable<IntFloatMap.Entry>
This class performs fast contains and remove (typically O(1), worst case O(n) but that is rare in practice). Add may be slightly slower, depending on hash collisions. Hashcodes are rehashed to reduce collisions and the need to resize. Load factors greater than 0.91 greatly increase the chances to resize to the next higher POT size.
Unordered sets and maps are not designed to provide especially fast iteration. Iteration is faster with OrderedSet and OrderedMap.
This implementation uses linear probing with the backward shift algorithm for removal. Hashcodes are rehashed using Fibonacci hashing, instead of the more common power-of-two mask, to better distribute poor hashCodes (see Malte Skarupke's blog post). Linear probing continues to work even when all hashCodes collide, just more slowly.
Modifier and Type | Class and Description |
---|---|
static class |
IntFloatMap.Entries |
static class |
IntFloatMap.Entry |
static class |
IntFloatMap.Keys |
static class |
IntFloatMap.Values |
Modifier and Type | Field and Description |
---|---|
int |
size |
Constructor and Description |
---|
IntFloatMap()
Creates a new map with an initial capacity of 51 and a load factor of 0.8.
|
IntFloatMap(int initialCapacity)
Creates a new map with a load factor of 0.8.
|
IntFloatMap(int initialCapacity,
float loadFactor)
Creates a new map with the specified initial capacity and load factor.
|
IntFloatMap(IntFloatMap map)
Creates a new map identical to the specified map.
|
Modifier and Type | Method and Description |
---|---|
void |
clear() |
void |
clear(int maximumCapacity)
Clears the map and reduces the size of the backing arrays to be the specified capacity / loadFactor, if they are larger.
|
boolean |
containsKey(int key) |
boolean |
containsValue(float value)
Returns true if the specified value is in the map.
|
boolean |
containsValue(float value,
float epsilon)
Returns true if the specified value is in the map.
|
void |
ensureCapacity(int additionalCapacity)
Increases the size of the backing array to accommodate the specified number of additional items / loadFactor.
|
IntFloatMap.Entries |
entries()
Returns an iterator for the entries in the map.
|
boolean |
equals(Object obj) |
int |
findKey(float value,
float epsilon,
int notFound)
Returns the key for the specified value, or notFound if it is not in the map.
|
int |
findKey(float value,
int notFound)
Returns the key for the specified value, or notFound if it is not in the map.
|
float |
get(int key,
float defaultValue) |
float |
getAndIncrement(int key,
float defaultValue,
float increment)
Returns the key's current value and increments the stored value.
|
int |
hashCode() |
boolean |
isEmpty()
Returns true if the map is empty.
|
Iterator<IntFloatMap.Entry> |
iterator() |
IntFloatMap.Keys |
keys()
Returns an iterator for the keys in the map.
|
boolean |
notEmpty()
Returns true if the map has one or more items.
|
void |
put(int key,
float value) |
float |
put(int key,
float value,
float defaultValue)
Returns the old value associated with the specified key, or the specified default value.
|
void |
putAll(IntFloatMap map) |
float |
remove(int key,
float defaultValue)
Returns the value for the removed key, or the default value if the key is not in the map.
|
void |
shrink(int maximumCapacity)
Reduces the size of the backing arrays to be the specified capacity / loadFactor, or less.
|
String |
toString() |
IntFloatMap.Values |
values()
Returns an iterator for the values in the map.
|
forEach, spliterator
public IntFloatMap()
public IntFloatMap(int initialCapacity)
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.public IntFloatMap(int initialCapacity, float loadFactor)
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.public IntFloatMap(IntFloatMap map)
public void put(int key, float value)
public float put(int key, float value, float defaultValue)
defaultValue
- Float.NaN
can be used for a value unlikely to be in the map.public void putAll(IntFloatMap map)
public float get(int key, float defaultValue)
defaultValue
- Float.NaN
can be used for a value unlikely to be in the map.public float getAndIncrement(int key, float defaultValue, float increment)
public float remove(int key, float defaultValue)
defaultValue
- Float.NaN
can be used for a value unlikely to be in the map.public boolean notEmpty()
public boolean isEmpty()
public void shrink(int maximumCapacity)
public void clear(int maximumCapacity)
public void clear()
public boolean containsValue(float value)
public boolean containsValue(float value, float epsilon)
public boolean containsKey(int key)
public int findKey(float value, int notFound)
public int findKey(float value, float epsilon, int notFound)
public void ensureCapacity(int additionalCapacity)
public Iterator<IntFloatMap.Entry> iterator()
iterator
in interface Iterable<IntFloatMap.Entry>
public IntFloatMap.Entries entries()
If Collections.allocateIterators
is false, the same iterator instance is returned each time this method is called.
Use the IntFloatMap.Entries
constructor for nested or multithreaded iteration.
public IntFloatMap.Values values()
If Collections.allocateIterators
is false, the same iterator instance is returned each time this method is called.
Use the IntFloatMap.Entries
constructor for nested or multithreaded iteration.
public IntFloatMap.Keys keys()
If Collections.allocateIterators
is false, the same iterator instance is returned each time this method is called.
Use the IntFloatMap.Entries
constructor for nested or multithreaded iteration.
Copyright © 2020. All rights reserved.