public class SparseBinSearchDoubleArray extends SparseDoubleArray
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.
SparseDoubleArray.DualEntry, SparseDoubleArray.Entry| Modifier and Type | Field and Description | 
|---|---|
| protected int[] | keys | 
| protected int | used | 
| protected double[] | values | 
DEFAULT_CAPACITY, length| Constructor and Description | 
|---|
| SparseBinSearchDoubleArray(double[] values)Construct from an existing array of values | 
| SparseBinSearchDoubleArray(int length)Construct the array with the given length | 
| SparseBinSearchDoubleArray(int length,
                          float density)Construct the array with the given length and expected density | 
| SparseBinSearchDoubleArray(int length,
                          int capacity)Construct the array with the given length and capacity for non-zero elements | 
| SparseBinSearchDoubleArray(int length,
                          int used,
                          int[] keys,
                          double[] values)Generate a new  SparseBinSearchDoubleArraywrapper 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. | 
| SparseDoubleArray | copy()Deep copy the array. | 
| Iterable<SparseDoubleArray.Entry> | entries()Provide an iterator over the non-zero values. | 
| boolean | equals(Object obj) | 
| double | get(int key)Get the value at the given index. | 
| int | hashCode() | 
| double | increment(int key,
         double value)Increment the value at the given index. | 
| int[] | indices() | 
| boolean | isUsed(int key)Check whether the given index is used (i.e. | 
| SparseDoubleArray | reverse()Reverse the elements, returning this. | 
| double | set(int key,
   double value)Set the value at the given index. | 
| Iterable<SparseDoubleArray.DualEntry> | unionEntries(SparseBinSearchDoubleArray otherArray)Provide an iterator over the union of values present in
 both this array and another array. | 
| Iterable<SparseDoubleArray.DualEntry> | unionEntries(SparseDoubleArray otherArray)Provide an iterator over the union of values present in
 both this array and another array. | 
| int | used() | 
| double[] | 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 SparseBinSearchDoubleArray(double[] values)
values - the valuespublic SparseBinSearchDoubleArray(int length, int used, int[] keys, double[] values)
SparseBinSearchDoubleArray wrapper which works around
 an existing array of keys and valueslength - used - keys - values - public SparseBinSearchDoubleArray(int length)
length - the lengthpublic SparseBinSearchDoubleArray(int length, int capacity)
length - the lengthcapacity - the capacitypublic SparseBinSearchDoubleArray(int length, float density)
length - the lengthdensity - the densitypublic int[] indices()
indices in class SparseDoubleArraypublic double[] values()
values in class SparseDoubleArraypublic Iterable<SparseDoubleArray.DualEntry> unionEntries(SparseDoubleArray otherArray)
SparseDoubleArray
 Note: the SparseDoubleArray.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 SparseDoubleArray.DualEntry has no effect
 on the actual array).
unionEntries in class SparseDoubleArrayotherArray - the second arraypublic Iterable<SparseDoubleArray.DualEntry> unionEntries(SparseBinSearchDoubleArray otherArray)
 Note: the SparseDoubleArray.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 SparseDoubleArray.DualEntry has no effect
 on the actual array).
otherArray - the second arraypublic Iterable<SparseDoubleArray.Entry> entries()
SparseDoubleArray
 Note: the SparseDoubleArray.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 SparseDoubleArray.Entry has no effect
 on the actual array).
entries in class SparseDoubleArraypublic double get(int key)
SparseDoubleArrayget in class SparseDoubleArraykey - the indexpublic boolean isUsed(int key)
SparseDoubleArrayisUsed in class SparseDoubleArraykey - the indexpublic double set(int key, double value)
SparseDoubleArrayset in class SparseDoubleArraykey - the index.value - the value to set.public double increment(int key, double value)
SparseDoubleArrayincrement in class SparseDoubleArraykey - the indexvalue - the amount to increment by.public int used()
used in class SparseDoubleArraypublic void compact()
SparseDoubleArraycompact in class SparseDoubleArraypublic SparseDoubleArray copy()
SparseDoubleArraycopy in class SparseDoubleArraypublic SparseDoubleArray reverse()
SparseDoubleArrayreverse in class SparseDoubleArray