public class SparseBinSearchIntArray extends SparseIntArray
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.
SparseIntArray.DualEntry, SparseIntArray.Entry| Modifier and Type | Field and Description |
|---|---|
protected int[] |
keys |
protected int |
used |
protected int[] |
values |
DEFAULT_CAPACITY, length| Constructor and Description |
|---|
SparseBinSearchIntArray(int length)
Construct the array with the given length
|
SparseBinSearchIntArray(int[] values)
Construct from an existing array of values
|
SparseBinSearchIntArray(int length,
float density)
Construct the array with the given length and expected density
|
SparseBinSearchIntArray(int length,
int capacity)
Construct the array with the given length and capacity for non-zero elements
|
SparseBinSearchIntArray(int length,
int used,
int[] keys,
int[] values)
Generate a new
SparseBinSearchIntArray wrapper which works around
an existing array of keys and values |
| 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.
|
Iterable<SparseIntArray.DualEntry> |
unionEntries(SparseBinSearchIntArray otherArray)
Provide an iterator over the union of values present in
both this array and another array.
|
Iterable<SparseIntArray.DualEntry> |
unionEntries(SparseIntArray otherArray)
Provide an iterator over the union of values present in
both this array and another array.
|
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, writeASCII, writeBinarypublic SparseBinSearchIntArray(int[] values)
values - the valuespublic SparseBinSearchIntArray(int length, int used, int[] keys, int[] values)
SparseBinSearchIntArray wrapper which works around
an existing array of keys and valueslength - used - keys - values - public SparseBinSearchIntArray(int length)
length - the lengthpublic SparseBinSearchIntArray(int length, int capacity)
length - the lengthcapacity - the capacitypublic SparseBinSearchIntArray(int length, float density)
length - the lengthdensity - the densitypublic int[] indices()
indices in class SparseIntArraypublic int[] values()
values in class SparseIntArraypublic Iterable<SparseIntArray.DualEntry> unionEntries(SparseIntArray otherArray)
SparseIntArray
Note: the SparseIntArray.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 SparseIntArray.DualEntry has no effect
on the actual array).
unionEntries in class SparseIntArrayotherArray - the second arraypublic Iterable<SparseIntArray.DualEntry> unionEntries(SparseBinSearchIntArray otherArray)
Note: the SparseIntArray.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 SparseIntArray.DualEntry has no effect
on the actual array).
otherArray - the second arraypublic 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 increment(int key, int value)
SparseIntArrayincrement in class SparseIntArraykey - the indexvalue - the amount to increment by.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