|
||||||||||
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.AbstractObjectIntMap<T>
public abstract class AbstractObjectIntMap<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 | |
---|---|
AbstractObjectIntMap()
|
Method Summary | |
---|---|
int |
adjustOrPutValue(T key,
int newValue,
int incrValue)
Check the map for a key. |
boolean |
containsKey(T key)
Returns true if the receiver contains the specified key. |
boolean |
containsValue(int value)
Returns true if the receiver contains the specified value. |
AbstractObjectIntMap<T> |
copy()
Returns a deep copy of the receiver; uses clone() and casts the result. |
boolean |
equals(Object obj)
Compares the specified object with this map for equality. |
abstract boolean |
forEachKey(ObjectProcedure<T> procedure)
Applies a procedure to each key of the receiver, if any. |
boolean |
forEachPair(ObjectIntProcedure<T> procedure)
Applies a procedure to each (key,value) pair of the receiver, if any. |
abstract int |
get(T key)
Returns the value associated with the specified key. |
int |
hashCode()
|
List<T> |
keys()
Returns a list filled with all keys contained in the receiver. |
void |
keys(List<T> list)
Fills all keys contained in the receiver into the specified list. |
void |
keysSortedByValue(List<T> keyList)
Fills all keys sorted ascending by their associated value into the specified list. |
void |
pairsMatching(ObjectIntProcedure<T> condition,
List<T> keyList,
IntArrayList valueList)
Fills all pairs satisfying a given condition into the specified lists. |
void |
pairsSortedByKey(List<T> keyList,
IntArrayList valueList)
Fills all keys and values sorted ascending by key into the specified lists. |
void |
pairsSortedByValue(List<T> keyList,
IntArrayList valueList)
Fills all keys and values sorted ascending by value into the specified lists. |
abstract boolean |
put(T key,
int value)
Associates the given key with the given value. |
abstract boolean |
removeKey(T key)
Removes the given key with its associated element from the receiver, if present. |
String |
toString()
Returns a string representation of the receiver, containing the String representation of each key-value pair, sorted ascending by key. |
String |
toStringByValue()
Returns a string representation of the receiver, containing the String representation of each key-value pair, sorted ascending by value. |
IntArrayList |
values()
Returns a list filled with all values contained in the receiver. |
void |
values(IntArrayList list)
Fills all values contained in the receiver into the specified list. |
Methods inherited from class org.apache.mahout.math.set.AbstractSet |
---|
chooseGrowCapacity, chooseHighWaterMark, chooseLowWaterMark, chooseMeanCapacity, chooseShrinkCapacity, clear, ensureCapacity, equalsMindTheNull, isEmpty, nextPrime, setUp, size, trimToSize |
Methods inherited from class org.apache.mahout.math.PersistentObject |
---|
clone |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public AbstractObjectIntMap()
Method Detail |
---|
public boolean containsKey(T key)
public boolean containsValue(int value)
public AbstractObjectIntMap<T> copy()
clone()
and casts the result.
public boolean equals(Object obj)
m1.forEachPair( new ObjectIntProcedureThis implementation first checks if the specified object is this map; if so it returns true. Then, it checks if the specified object is a map whose size is identical to the size of this set; if not, it it returns false. If so, it applies the iteration as described above.() { public boolean apply(T key, int value) { return m2.containsKey(key) && m2.get(key) == value; } } ) && m2.forEachPair( new ObjectIntProcedure () { public boolean apply(T key, int value) { return m1.containsKey(key) && m1.get(key) == value; } } );
equals
in class Object
obj
- object to be compared for equality with this map.
public int hashCode()
hashCode
in class Object
public abstract boolean forEachKey(ObjectProcedure<T> procedure)
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.
public boolean forEachPair(ObjectIntProcedure<T> procedure)
forEachKey(ObjectProcedure)
.
procedure
- the procedure to be applied. Stops iteration if the procedure returns false, otherwise
continues.
public abstract int 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.
key
- the key to be searched for.
public List<T> keys()
forEachKey(ObjectProcedure)
. This method can be used to iterate over the keys of the receiver.
public void keys(List<T> list)
forEachKey(ObjectProcedure)
. This method can be used to iterate over the keys of the receiver.
list
- the list to be filled, can have any size.public void keysSortedByValue(List<T> keyList)
Example:
keys = (8,7,6), values = (1,2,2) --> keyList =
(8,6,7)
keyList
- the list to be filled, can have any size.public void pairsMatching(ObjectIntProcedure<T> condition, List<T> keyList, IntArrayList valueList)
forEachKey(ObjectProcedure)
.
Example:
IntIntProcedure condition = new IntIntProcedure() { // match even keys only public boolean apply(int key, int value) { return key%2==0; } } keys = (8,7,6), values = (1,2,2) --> keyList = (6,8), valueList = (2,1)
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 void pairsSortedByKey(List<T> keyList, IntArrayList valueList)
Example:
keys = (8,7,6), values = (1,2,2) --> keyList = (6,7,8), valueList = (2,2,1)
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 void pairsSortedByValue(List<T> keyList, IntArrayList valueList)
Example:
keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7),
valueList = (1,2,2)
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 abstract boolean put(T key, int value)
key
- the key the value shall be associated with.value
- the value to be associated.
public abstract boolean removeKey(T key)
key
- the key to be removed from the receiver.
public String toString()
toString
in class Object
public String toStringByValue()
public IntArrayList values()
forEachKey(ObjectProcedure)
. This method can be used to iterate over the values of the receiver.
public void values(IntArrayList list)
forEachKey(ObjectProcedure)
. This method can be used to iterate over the values of the receiver.
list
- the list to be filled, can have any size.public int adjustOrPutValue(T key, int newValue, int incrValue)
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |