public class SparseHashedIntArray extends SparseIntArray
SparseIntArray implementation based on a
TIntIntHashMap. Unlike the SparseBinSearchIntArray
implementation, this class should be good for the case
where random insertion is used frequently (O(1) insert complexity).
In the worst-case search is O(n), although in practice it should be better.
Note that the entries() method will in general not return
the entries in index order.
SparseIntArray.DualEntry, SparseIntArray.EntryDEFAULT_CAPACITY, length| Constructor and Description |
|---|
SparseHashedIntArray(int length)
Construct the array with the given length
|
SparseHashedIntArray(int[] values) |
SparseHashedIntArray(int length,
float density)
Construct the array with the given length and expected density
|
SparseHashedIntArray(int length,
int capacity)
Construct the array with the given length and capacity for non-zero elements
|
| Modifier and Type | Method and Description |
|---|---|
void |
compact()
Compact the space being used by the array if possible.
|
SparseIntArray |
copy()
Deep copy the array.
|
Iterable<SparseIntArray.Entry> |
entries()
Provide an iterator over the non-zero values.
|
boolean |
equals(Object obj) |
int |
get(int key)
Get the value at the given index.
|
int |
hashCode() |
int |
increment(int key,
int value)
Increment the value at the given index.
|
int[] |
indices() |
boolean |
isUsed(int key)
Check whether the given index is used (i.e.
|
SparseIntArray |
reverse()
Reverse the elements, returning this.
|
int |
set(int key,
int value)
Set the value at the given index.
|
int |
used() |
int[] |
values() |
add, addInplace, asciiHeader, binaryHeader, concatenate, concatenate, concatenateArrays, density, dotProduct, intersectEntries, length, maxIndex, maxValue, minIndex, minValue, multiply, multiplyInplace, readASCII, readBinary, setLength, size, subtract, subtractInplace, sumValues, sumValuesSquared, toArray, toArray, unionEntries, writeASCII, writeBinarypublic SparseHashedIntArray(int[] values)
values - public SparseHashedIntArray(int length)
length - the lengthpublic SparseHashedIntArray(int length, int capacity)
length - the lengthcapacity - the capacitypublic SparseHashedIntArray(int length, float density)
length - the lengthdensity - the densitypublic int increment(int key, int value)
SparseIntArrayincrement in class SparseIntArraykey - the indexvalue - the amount to increment by.public int[] indices()
indices in class SparseIntArraypublic int[] values()
values in class SparseIntArraypublic Iterable<SparseIntArray.Entry> entries()
SparseIntArray
Note: the SparseIntArray.Entry returned by the iterator
is always the same object. In addition, the iterator
cannot affect the value of anything in the array (i.e.
changing anything in the SparseIntArray.Entry has no effect
on the actual array).
entries in class SparseIntArraypublic int get(int key)
SparseIntArrayget in class SparseIntArraykey - the indexpublic boolean isUsed(int key)
SparseIntArrayisUsed in class SparseIntArraykey - the indexpublic int set(int key, int value)
SparseIntArrayset in class SparseIntArraykey - the index.value - the value to set.public int used()
used in class SparseIntArraypublic void compact()
SparseIntArraycompact in class SparseIntArraypublic SparseIntArray copy()
SparseIntArraycopy in class SparseIntArraypublic SparseIntArray reverse()
SparseIntArrayreverse in class SparseIntArray