public class SparseBinSearchLongArray extends SparseLongArray
Element access has worst-case O(log n) performance. Appends (where the index being added is greater than the existing indices) has O(1) complexity. Random puts have worst case O(n + log n) complexity. Complexity for getting values by increasing index for iteration through the non-zero values is O(1).
In summary, this implementation has good access performance, and is fast for appending values, but slow for putting at random indices. It is is optimal for a scenario where you first create the sparse array and put values in order of increasing indices, and later use the array mostly for reading.
SparseLongArray.DualEntry, SparseLongArray.Entry| Modifier and Type | Field and Description |
|---|---|
protected int[] |
keys |
protected int |
used |
protected long[] |
values |
DEFAULT_CAPACITY, length| Constructor and Description |
|---|
SparseBinSearchLongArray(int length)
Construct the array with the given length
|
SparseBinSearchLongArray(int length,
float density)
Construct the array with the given length and expected density
|
SparseBinSearchLongArray(int length,
int capacity)
Construct the array with the given length and capacity for non-zero elements
|
SparseBinSearchLongArray(int length,
int used,
int[] keys,
long[] values)
Generate a new
SparseBinSearchLongArray wrapper which works around
an existing array of keys and values |
SparseBinSearchLongArray(long[] values)
Construct from an existing array of values
|
| Modifier and Type | Method and Description |
|---|---|
void |
compact()
Compact the space being used by the array if possible.
|
SparseLongArray |
copy()
Deep copy the array.
|
Iterable<SparseLongArray.Entry> |
entries()
Provide an iterator over the non-zero values.
|
boolean |
equals(Object obj) |
long |
get(int key)
Get the value at the given index.
|
int |
hashCode() |
long |
increment(int key,
long value)
Increment the value at the given index.
|
int[] |
indices() |
boolean |
isUsed(int key)
Check whether the given index is used (i.e.
|
SparseLongArray |
reverse()
Reverse the elements, returning this.
|
long |
set(int key,
long value)
Set the value at the given index.
|
Iterable<SparseLongArray.DualEntry> |
unionEntries(SparseBinSearchLongArray otherArray)
Provide an iterator over the union of values present in
both this array and another array.
|
Iterable<SparseLongArray.DualEntry> |
unionEntries(SparseLongArray otherArray)
Provide an iterator over the union of values present in
both this array and another array.
|
int |
used() |
long[] |
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, writeASCII, writeBinarypublic SparseBinSearchLongArray(long[] values)
values - the valuespublic SparseBinSearchLongArray(int length, int used, int[] keys, long[] values)
SparseBinSearchLongArray wrapper which works around
an existing array of keys and valueslength - used - keys - values - public SparseBinSearchLongArray(int length)
length - the lengthpublic SparseBinSearchLongArray(int length, int capacity)
length - the lengthcapacity - the capacitypublic SparseBinSearchLongArray(int length, float density)
length - the lengthdensity - the densitypublic int[] indices()
indices in class SparseLongArraypublic long[] values()
values in class SparseLongArraypublic Iterable<SparseLongArray.DualEntry> unionEntries(SparseLongArray otherArray)
SparseLongArray
Note: the SparseLongArray.DualEntry 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 SparseLongArray.DualEntry has no effect
on the actual array).
unionEntries in class SparseLongArrayotherArray - the second arraypublic Iterable<SparseLongArray.DualEntry> unionEntries(SparseBinSearchLongArray otherArray)
Note: the SparseLongArray.DualEntry 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 SparseLongArray.DualEntry has no effect
on the actual array).
otherArray - the second arraypublic Iterable<SparseLongArray.Entry> entries()
SparseLongArray
Note: the SparseLongArray.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 SparseLongArray.Entry has no effect
on the actual array).
entries in class SparseLongArraypublic long get(int key)
SparseLongArrayget in class SparseLongArraykey - the indexpublic boolean isUsed(int key)
SparseLongArrayisUsed in class SparseLongArraykey - the indexpublic long set(int key, long value)
SparseLongArrayset in class SparseLongArraykey - the index.value - the value to set.public long increment(int key, long value)
SparseLongArrayincrement in class SparseLongArraykey - the indexvalue - the amount to increment by.public int used()
used in class SparseLongArraypublic void compact()
SparseLongArraycompact in class SparseLongArraypublic SparseLongArray copy()
SparseLongArraycopy in class SparseLongArraypublic SparseLongArray reverse()
SparseLongArrayreverse in class SparseLongArray