public class OpenObjectShortHashMap<T> extends AbstractObjectShortMap<T>
Modifier and Type | Field and Description |
---|---|
protected static byte |
FREE |
protected static byte |
FULL |
protected static Object |
NO_KEY_VALUE |
protected static byte |
REMOVED |
DEFAULT_CAPACITY, DEFAULT_MAX_LOAD_FACTOR, DEFAULT_MIN_LOAD_FACTOR, distinct, highWaterMark, lowWaterMark, maxLoadFactor, minLoadFactor
Constructor and Description |
---|
OpenObjectShortHashMap()
Constructs an empty map with default capacity and default load factors.
|
OpenObjectShortHashMap(int initialCapacity)
Constructs an empty map with the specified initial capacity and default load factors.
|
OpenObjectShortHashMap(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 |
---|---|
short |
adjustOrPutValue(T key,
short newValue,
short 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(T key)
Returns true if the receiver contains the specified key.
|
boolean |
containsValue(short 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(ObjectProcedure<T> procedure)
Applies a procedure to each key of the receiver, if any.
|
boolean |
forEachPair(ObjectShortProcedure<T> procedure)
Applies a procedure to each (key,value) pair of the receiver, if any.
|
short |
get(T 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(T key) |
protected int |
indexOfKey(T key) |
protected int |
indexOfValue(short value) |
void |
keys(List<T> list)
Fills all keys contained in the receiver into the specified list.
|
void |
pairsMatching(ObjectShortProcedure<T> condition,
List<T> keyList,
ShortArrayList valueList)
Fills all pairs satisfying a given condition into the specified lists.
|
boolean |
put(T key,
short 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(T 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(ShortArrayList 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 Object NO_KEY_VALUE
public OpenObjectShortHashMap()
public OpenObjectShortHashMap(int initialCapacity)
initialCapacity
- the initial capacity of the map.IllegalArgumentException
- if the initial capacity is less than zero.public OpenObjectShortHashMap(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(T key)
containsKey
in class AbstractObjectShortMap<T>
public boolean containsValue(short value)
containsValue
in class AbstractObjectShortMap<T>
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(ObjectProcedure<T> procedure)
forEachKey
in class AbstractObjectShortMap<T>
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.public boolean forEachPair(ObjectShortProcedure<T> procedure)
forEachKey(ObjectProcedure)
.forEachPair
in class AbstractObjectShortMap<T>
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.public short get(T key)
containsKey(Object)
whether the given key has a value associated or not,
i.e. whether there exists an association for the given key or not.get
in class AbstractObjectShortMap<T>
key
- the key to be searched for.protected int indexOfInsertion(T key)
key
- the key to be added to the receiver.protected int indexOfKey(T key)
key
- the key to be searched in the receiver.protected int indexOfValue(short value)
value
- the value to be searched in the receiver.public void keys(List<T> list)
keys
in class AbstractObjectShortMap<T>
list
- the list to be filled, can have any size.public void pairsMatching(ObjectShortProcedure<T> condition, List<T> keyList, ShortArrayList valueList)
Example:
ObjectShortProcedurecondition = new ObjectShortProcedure () { // match even values only public boolean apply(T key, short value) { return value%2==0; } } keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)
pairsMatching
in class AbstractObjectShortMap<T>
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(T key, short value)
put
in class AbstractObjectShortMap<T>
key
- the key the value shall be associated with.value
- the value to be associated.public short adjustOrPutValue(T key, short newValue, short incrValue)
AbstractObjectShortMap
adjustOrPutValue
in class AbstractObjectShortMap<T>
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(T key)
removeKey
in class AbstractObjectShortMap<T>
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(ShortArrayList list)
This method can be used to iterate over the values of the receiver.
values
in class AbstractObjectShortMap<T>
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.