public class OpenDoubleIntHashMap extends AbstractDoubleIntMap
Modifier and Type | Class and Description |
---|---|
class |
OpenDoubleIntHashMap.MapElement |
class |
OpenDoubleIntHashMap.MapIterator |
Modifier and Type | Field and Description |
---|---|
protected static byte |
FREE |
protected int |
freeEntries
The number of table entries in state==FREE.
|
protected static byte |
FULL |
protected static double |
NO_KEY_VALUE |
protected static byte |
REMOVED |
protected byte[] |
state
The state of each hash table entry (FREE, FULL, REMOVED).
|
protected double[] |
table
The hash table keys.
|
protected int[] |
values
The hash table values.
|
DEFAULT_CAPACITY, DEFAULT_MAX_LOAD_FACTOR, DEFAULT_MIN_LOAD_FACTOR, distinct, highWaterMark, lowWaterMark, maxLoadFactor, minLoadFactor
Constructor and Description |
---|
OpenDoubleIntHashMap()
Constructs an empty map with default capacity and default load factors.
|
OpenDoubleIntHashMap(int initialCapacity)
Constructs an empty map with the specified initial capacity and default load factors.
|
OpenDoubleIntHashMap(int initialCapacity,
double minLoadFactor,
double maxLoadFactor)
Constructs an empty map with the specified initial capacity and the specified minimum and maximum load factor.
|
Modifier and Type | Method and Description |
---|---|
int |
adjustOrPutValue(double key,
int newValue,
int incrValue)
Check the map for a key.
|
void |
clear()
Removes all (key,value) associations from the receiver.
|
Object |
clone()
Returns a deep copy of the receiver.
|
boolean |
containsKey(double key)
Returns true if the receiver contains the specified key.
|
boolean |
containsValue(int value)
Returns true if the receiver contains the specified value.
|
void |
ensureCapacity(int minCapacity)
Ensures that the receiver can hold at least the specified number of associations without needing to allocate new
internal memory.
|
boolean |
forEachKey(DoubleProcedure procedure)
Applies a procedure to each key of the receiver, if any.
|
boolean |
forEachPair(DoubleIntProcedure procedure)
Applies a procedure to each (key,value) pair of the receiver, if any.
|
int |
get(double key)
Returns the value associated with the specified key.
|
protected void |
getInternalFactors(int[] capacity,
double[] minLoadFactor,
double[] maxLoadFactor)
Access for unit tests.
|
protected int |
indexOfInsertion(double key) |
protected int |
indexOfKey(double key) |
protected int |
indexOfValue(int value) |
Iterator<OpenDoubleIntHashMap.MapElement> |
iterator() |
void |
keys(DoubleArrayList list)
Fills all keys contained in the receiver into the specified list.
|
void |
pairsMatching(DoubleIntProcedure condition,
DoubleArrayList keyList,
IntArrayList valueList)
Fills all pairs satisfying a given condition into the specified lists.
|
boolean |
put(double key,
int value)
Associates the given key with the given value.
|
protected void |
rehash(int newCapacity)
Rehashes the contents of the receiver into a new table with a smaller or larger capacity.
|
boolean |
removeKey(double key)
Removes the given key with its associated element from the receiver, if present.
|
protected void |
setUp(int initialCapacity,
double minLoadFactor,
double maxLoadFactor)
Initializes the receiver.
|
void |
trimToSize()
Trims the capacity of the receiver to be the receiver's current size.
|
void |
values(IntArrayList list)
Fills all values contained in the receiver into the specified list.
|
copy, equals, hashCode, keys, keysSortedByValue, pairsSortedByKey, pairsSortedByValue, toString, toStringByValue, values
chooseGrowCapacity, chooseHighWaterMark, chooseLowWaterMark, chooseMeanCapacity, chooseShrinkCapacity, equalsMindTheNull, isEmpty, nextPrime, size
protected static final byte FREE
protected static final byte FULL
protected static final byte REMOVED
protected static final double NO_KEY_VALUE
protected double[] table
protected int[] values
protected byte[] state
protected int freeEntries
public OpenDoubleIntHashMap()
public OpenDoubleIntHashMap(int initialCapacity)
initialCapacity
- the initial capacity of the map.IllegalArgumentException
- if the initial capacity is less than zero.public OpenDoubleIntHashMap(int initialCapacity, double minLoadFactor, double maxLoadFactor)
initialCapacity
- the initial capacity.minLoadFactor
- the minimum load factor.maxLoadFactor
- the maximum load factor.IllegalArgumentException
- if initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) ||
(maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >=
maxLoadFactor).public void clear()
clear
in class AbstractSet
public Object clone()
clone
in class PersistentObject
public boolean containsKey(double key)
containsKey
in class AbstractDoubleIntMap
public boolean containsValue(int value)
containsValue
in class AbstractDoubleIntMap
public void ensureCapacity(int minCapacity)
This method never need be called; it is for performance tuning only. Calling this method before put()ing a large number of associations boosts performance, because the receiver will grow only once instead of potentially many times and hash collisions get less probable.
ensureCapacity
in class AbstractSet
minCapacity
- the desired minimum capacity.public boolean forEachKey(DoubleProcedure procedure)
forEachKey
in class AbstractDoubleIntMap
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.public boolean forEachPair(DoubleIntProcedure procedure)
forEachKey(DoubleProcedure)
.forEachPair
in class AbstractDoubleIntMap
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.public int get(double key)
get
in class AbstractDoubleIntMap
key
- the key to be searched for.protected int indexOfInsertion(double key)
key
- the key to be added to the receiver.protected int indexOfKey(double key)
key
- the key to be searched in the receiver.protected int indexOfValue(int value)
value
- the value to be searched in the receiver.public void keys(DoubleArrayList list)
forEachKey(DoubleProcedure)
.
This method can be used to iterate over the keys of the receiver.
keys
in class AbstractDoubleIntMap
list
- the list to be filled, can have any size.public Iterator<OpenDoubleIntHashMap.MapElement> iterator()
public void pairsMatching(DoubleIntProcedure condition, DoubleArrayList keyList, IntArrayList valueList)
forEachKey(DoubleProcedure)
. Example:
DoubleIntProcedure condition = new DoubleIntProcedure() { // match even values only public boolean apply(double key, int value) { return value%2==0; } } keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)
pairsMatching
in class AbstractDoubleIntMap
condition
- the condition to be matched. Takes the current key as first and the current value as second
argument.keyList
- the list to be filled with keys, can have any size.valueList
- the list to be filled with values, can have any size.public boolean put(double key, int value)
put
in class AbstractDoubleIntMap
key
- the key the value shall be associated with.value
- the value to be associated.public int adjustOrPutValue(double key, int newValue, int incrValue)
AbstractDoubleIntMap
adjustOrPutValue
in class AbstractDoubleIntMap
key
- the key.newValue
- the value to store if the key is not currently in the map.incrValue
- the value to be added to the current value in the map.protected void rehash(int newCapacity)
public boolean removeKey(double key)
removeKey
in class AbstractDoubleIntMap
key
- the key to be removed from the receiver.protected final void setUp(int initialCapacity, double minLoadFactor, double maxLoadFactor)
setUp
in class AbstractSet
initialCapacity
- the initial capacity of the receiver.minLoadFactor
- the minLoadFactor of the receiver.maxLoadFactor
- the maxLoadFactor of the receiver.IllegalArgumentException
- if initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) ||
(maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >=
maxLoadFactor).public void trimToSize()
trimToSize
in class AbstractSet
public void values(IntArrayList list)
forEachKey(DoubleProcedure)
.
This method can be used to iterate over the values of the receiver.
values
in class AbstractDoubleIntMap
list
- the list to be filled, can have any size.protected void getInternalFactors(int[] capacity, double[] minLoadFactor, double[] maxLoadFactor)
capacity
- minLoadFactor
- maxLoadFactor
- Copyright © 2008–2017 The Apache Software Foundation. All rights reserved.