This class offers a dynamic array of integers. The array is technically broken up into several smaller
integer arrays of size 2FRAGSIZE2POW. If the array fragment does not contain any value
it is not allocated at all and its values are supposed to be 0.
Calculates this/by+addition (this and addition are vectors). The maximum difference
between the current vector and the vector after calculation is returned.
Returns:
the maximum difference in any cell after the calculation, -1 when vectors are not fragmented the same way
or when addition is empty
dump
public void dump(java.io.PrintStream out,
int from_index)
store
public void store(DataOutput out)
throws java.io.IOException
Throws:
java.io.IOException
highestSet
public int highestSet()
Highest index set by @{link #set} method.
Returns:
the highest offset occupied by some user-set value, or -1 when @{link #set} was not called yet