|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.apache.mahout.math.PersistentObject
org.apache.mahout.math.set.AbstractSet
org.apache.mahout.math.map.AbstractShortObjectMap<T>
org.apache.mahout.math.map.OpenShortObjectHashMap<T>
public class OpenShortObjectHashMap<T>
| Field Summary |
|---|
| Fields inherited from class org.apache.mahout.math.set.AbstractSet |
|---|
DEFAULT_CAPACITY, DEFAULT_MAX_LOAD_FACTOR, DEFAULT_MIN_LOAD_FACTOR, distinct, highWaterMark, lowWaterMark, maxLoadFactor, minLoadFactor |
| Constructor Summary | |
|---|---|
OpenShortObjectHashMap()
Constructs an empty map with default capacity and default load factors. |
|
OpenShortObjectHashMap(int initialCapacity)
Constructs an empty map with the specified initial capacity and default load factors. |
|
OpenShortObjectHashMap(int initialCapacity,
double minLoadFactor,
double maxLoadFactor)
Constructs an empty map with the specified initial capacity and the specified minimum and maximum load factor. |
|
| Method Summary | |
|---|---|
void |
clear()
Removes all (key,value) associations from the receiver. |
OpenShortObjectHashMap<T> |
clone()
Returns a deep copy of the receiver. |
boolean |
containsKey(short key)
Returns true if the receiver contains the specified key. |
boolean |
containsValue(T 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(ShortProcedure procedure)
Applies a procedure to each key of the receiver, if any. |
boolean |
forEachPair(ShortObjectProcedure<T> procedure)
Applies a procedure to each (key,value) pair of the receiver, if any. |
T |
get(short 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(short key)
|
protected int |
indexOfKey(short key)
|
protected int |
indexOfValue(T value)
|
void |
keys(ShortArrayList list)
Fills all keys contained in the receiver into the specified list. |
void |
pairsMatching(ShortObjectProcedure<T> condition,
ShortArrayList keyList,
List<T> valueList)
Fills all pairs satisfying a given condition into the specified lists. |
boolean |
put(short key,
T 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(short 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(List<T> list)
Fills all values contained in the receiver into the specified list. |
| Methods inherited from class org.apache.mahout.math.map.AbstractShortObjectMap |
|---|
copy, equals, hashCode, keys, keysSortedByValue, pairsSortedByKey, pairsSortedByValue, toString, toStringByValue, values |
| Methods inherited from class org.apache.mahout.math.set.AbstractSet |
|---|
chooseGrowCapacity, chooseHighWaterMark, chooseLowWaterMark, chooseMeanCapacity, chooseShrinkCapacity, equalsMindTheNull, isEmpty, nextPrime, size |
| Methods inherited from class java.lang.Object |
|---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public OpenShortObjectHashMap()
public OpenShortObjectHashMap(int initialCapacity)
initialCapacity - the initial capacity of the map.
IllegalArgumentException - if the initial capacity is less than zero.
public OpenShortObjectHashMap(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).| Method Detail |
|---|
public void clear()
clear in class AbstractSetpublic OpenShortObjectHashMap<T> clone()
clone in class PersistentObjectpublic boolean containsKey(short key)
containsKey in class AbstractShortObjectMap<T>public boolean containsValue(T value)
containsValue in class AbstractShortObjectMap<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 AbstractSetminCapacity - the desired minimum capacity.public boolean forEachKey(ShortProcedure procedure)
forEachKey in class AbstractShortObjectMap<T>procedure - the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.
public boolean forEachPair(ShortObjectProcedure<T> procedure)
forEachKey(ShortProcedure).
forEachPair in class AbstractShortObjectMap<T>procedure - the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.
public T get(short key)
get in class AbstractShortObjectMap<T>key - the key to be searched for.
protected int indexOfInsertion(short key)
key - the key to be added to the receiver.
protected int indexOfKey(short key)
key - the key to be searched in the receiver.
protected int indexOfValue(T value)
value - the value to be searched in the receiver.
public void keys(ShortArrayList list)
forEachKey(ShortProcedure). This method can be used to iterate over the keys of the receiver.
keys in class AbstractShortObjectMap<T>list - the list to be filled, can have any size.
public void pairsMatching(ShortObjectProcedure<T> condition,
ShortArrayList keyList,
List<T> valueList)
forEachKey(ShortProcedure).
Example:
ShortObjectProcedure condition = new ShortObjectProcedure() { // match even keys only
public boolean apply(short key, Object value) { return key%2==0; }
}
keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)
pairsMatching in class AbstractShortObjectMap<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(short key,
T value)
put in class AbstractShortObjectMap<T>key - the key the value shall be associated with.value - the value to be associated.
protected void rehash(int newCapacity)
public boolean removeKey(short key)
removeKey in class AbstractShortObjectMap<T>key - the key to be removed from the receiver.
protected final void setUp(int initialCapacity,
double minLoadFactor,
double maxLoadFactor)
setUp in class AbstractSetinitialCapacity - 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 AbstractSetpublic void values(List<T> list)
This method can be used to iterate over the values of the receiver.
values in class AbstractShortObjectMap<T>list - the list to be filled, can have any size.
protected void getInternalFactors(int[] capacity,
double[] minLoadFactor,
double[] maxLoadFactor)
capacity - minLoadFactor - maxLoadFactor -
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||