| 
 | GNU Trove | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface TShortIntMap
Interface for a primitive map of short keys and int values.
| Method Summary | |
|---|---|
|  int | adjustOrPutValue(short key,
                 int adjust_amount,
                 int put_amount)Adjusts the primitive value mapped to the key if the key is present in the map. | 
|  boolean | adjustValue(short key,
            int amount)Adjusts the primitive value mapped to key. | 
|  void | clear()Empties the map. | 
|  boolean | containsKey(short key)Checks for the present of key in the keys of the map. | 
|  boolean | containsValue(int val)Checks for the presence of val in the values of the map. | 
|  boolean | forEachEntry(TShortIntProcedure procedure)Executes procedure for each key/value entry in the map. | 
|  boolean | forEachKey(TShortProcedure procedure)Executes procedure for each key in the map. | 
|  boolean | forEachValue(TIntProcedure procedure)Executes procedure for each value in the map. | 
|  int | get(short key)Retrieves the value for key | 
|  short | getNoEntryKey()Returns the value that will be returned from get(short)orput(short, int)if no
 entry exists for a given key. | 
|  int | getNoEntryValue()Returns the value that will be returned from get(short)orput(short, int)if no
 entry exists for a given key. | 
|  boolean | increment(short key)Increments the primitive value mapped to key by 1 | 
|  boolean | isEmpty()Returns true if this map contains no key-value mappings. | 
|  TShortIntIterator | iterator() | 
|  short[] | keys()Returns the keys of the map as an array of short values. | 
|  short[] | keys(short[] array)Returns the keys of the map. | 
|  TShortSet | keySet()Returns the keys of the map as a TShortSet | 
|  int | put(short key,
    int value)Inserts a key/value pair into the map. | 
|  void | putAll(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map)Put all the entries from the given Map into this map. | 
|  void | putAll(TShortIntMap map)Put all the entries from the given map into this map. | 
|  int | putIfAbsent(short key,
            int value)Inserts a key/value pair into the map if the specified key is not already associated with a value. | 
|  int | remove(short key)Deletes a key/value pair from the map. | 
|  boolean | retainEntries(TShortIntProcedure procedure)Retains only those entries in the map for which the procedure returns a true value. | 
|  int | size()Returns an int value that is the number of elements in the map. | 
|  void | transformValues(TIntFunction function)Transform the values in this map using function. | 
|  TIntCollection | valueCollection()Returns the values of the map as a TIntCollection | 
|  int[] | values()Returns the values of the map as an array of #e# values. | 
|  int[] | values(int[] array)Returns the values of the map using an existing array. | 
| Method Detail | 
|---|
short getNoEntryKey()
get(short) or put(short, int) if no
 entry exists for a given key. The default value is generally zero, but can be
 changed during construction of the collection.
int getNoEntryValue()
get(short) or put(short, int) if no
 entry exists for a given key. The default value is generally zero, but can be
 changed during construction of the collection.
int put(short key,
        int value)
key - an short valuevalue - an int value
getNoEntryValue()).
int putIfAbsent(short key,
                int value)
key - an short valuevalue - an int value
getNoEntryValue()).void putAll(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> map)
map - The Map from which entries will be obtained to put into this map.void putAll(TShortIntMap map)
map - The map from which entries will be obtained to put into this map.int get(short key)
key - an short value
getNoEntryValue()).void clear()
boolean isEmpty()
int remove(short key)
key - an short value
getNoEntryValue()).int size()
TShortSet keySet()
short[] keys()
short[] keys(short[] array)
array - the array into which the elements of the list are to be stored,
                if it is big enough; otherwise, a new array of the same type is
                allocated for this purpose.
TIntCollection valueCollection()
int[] values()
int[] values(int[] array)
array - the array into which the elements of the list are to be stored,
                if it is big enough; otherwise, a new array of the same type is
                allocated for this purpose.
boolean containsValue(int val)
val - an int value
boolean valueboolean containsKey(short key)
key - an short value
boolean valueTShortIntIterator iterator()
boolean forEachKey(TShortProcedure procedure)
procedure - a TShortProcedure value
boolean forEachValue(TIntProcedure procedure)
procedure - a T#F#Procedure value
boolean forEachEntry(TShortIntProcedure procedure)
procedure - a TOShortIntProcedure value
void transformValues(TIntFunction function)
function - a TIntFunction valueboolean retainEntries(TShortIntProcedure procedure)
procedure - determines which entries to keep
boolean increment(short key)
key - the key of the value to increment
boolean adjustValue(short key,
                    int amount)
key - the key of the value to incrementamount - the amount to adjust the value by.
int adjustOrPutValue(short key,
                     int adjust_amount,
                     int put_amount)
key - the key of the value to incrementadjust_amount - the amount to adjust the value byput_amount - the value put into the map if the key is not initial present
| 
 | GNU Trove | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||