public class SparseHashedShortArray extends SparseShortArray
SparseShortArray
implementation based on a
TIntShortHashMap
. Unlike the SparseBinSearchShortArray
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.
SparseShortArray.DualEntry, SparseShortArray.Entry
DEFAULT_CAPACITY, length
Constructor and Description |
---|
SparseHashedShortArray(int length)
Construct the array with the given length
|
SparseHashedShortArray(int length,
float density)
Construct the array with the given length and expected density
|
SparseHashedShortArray(int length,
int capacity)
Construct the array with the given length and capacity for non-zero elements
|
SparseHashedShortArray(short[] values) |
Modifier and Type | Method and Description |
---|---|
void |
compact()
Compact the space being used by the array if possible.
|
SparseShortArray |
copy()
Deep copy the array.
|
Iterable<SparseShortArray.Entry> |
entries()
Provide an iterator over the non-zero values.
|
boolean |
equals(Object obj) |
short |
get(int key)
Get the value at the given index.
|
int |
hashCode() |
short |
increment(int key,
short value)
Increment the value at the given index.
|
int[] |
indices() |
boolean |
isUsed(int key)
Check whether the given index is used (i.e.
|
SparseShortArray |
reverse()
Reverse the elements, returning this.
|
short |
set(int key,
short value)
Set the value at the given index.
|
int |
used() |
short[] |
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, writeBinary
public SparseHashedShortArray(short[] values)
values
- public SparseHashedShortArray(int length)
length
- the lengthpublic SparseHashedShortArray(int length, int capacity)
length
- the lengthcapacity
- the capacitypublic SparseHashedShortArray(int length, float density)
length
- the lengthdensity
- the densitypublic short increment(int key, short value)
SparseShortArray
increment
in class SparseShortArray
key
- the indexvalue
- the amount to increment by.public int[] indices()
indices
in class SparseShortArray
public short[] values()
values
in class SparseShortArray
public Iterable<SparseShortArray.Entry> entries()
SparseShortArray
Note: the SparseShortArray.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 SparseShortArray.Entry
has no effect
on the actual array).
entries
in class SparseShortArray
public short get(int key)
SparseShortArray
get
in class SparseShortArray
key
- the indexpublic boolean isUsed(int key)
SparseShortArray
isUsed
in class SparseShortArray
key
- the indexpublic short set(int key, short value)
SparseShortArray
set
in class SparseShortArray
key
- the index.value
- the value to set.public int used()
used
in class SparseShortArray
public void compact()
SparseShortArray
compact
in class SparseShortArray
public SparseShortArray copy()
SparseShortArray
copy
in class SparseShortArray
public SparseShortArray reverse()
SparseShortArray
reverse
in class SparseShortArray