How many elements are stored in terms of space.
How many elements are stored in terms of space. In HashVectors, activeSize is the number of non-zero elements, while iterableSize is the number of buckets currently allocated. (activeSize <= iterableSize in general, activeSize == iterableSize for everything except hashing implementations.)
Only gives true if isActive would return true for all i.
Only gives true if isActive would return true for all i. (May be false anyway)
Compacts the array by removing all stored default values.
Returns the actual flat array of elements used.
Filter's the array by removing all values for which f is false.
Returns the offset into index and data for the requested vector index.
Returns the offset into index and data for the requested vector index. If the requested index is not found, the value is negative and can be converted into an insertion point with ~rv.
Only iterates "active" elements.
Only iterates "active" elements. I'm not sure how I feel about this behavior, since it's inconsistent with the rest of Breeze. I will think on it.
Gives the logical index from the physical index.
Some storages (namely HashStorage) won't have active indices packed.
Some storages (namely HashStorage) won't have active indices packed. This lets you know if the bin is actively in use.
index into index/data arrays
How many elements must be iterated over using valueAt/indexAt.
How many elements must be iterated over using valueAt/indexAt. In HashVectors, activeSize is the number of non-zero elements, while iterableSize is the number of buckets currently allocated. (activeSize <= iterableSize in general, activeSize == iterableSize for everything except hashing implementations.)
Only iterates "active" elements
Only iterates "active" elements
Only iterates "active" keys
Only iterates "active" keys
Maps all values.
Maps all values. If f(this.default) is not equal to the new default value, the result may be an efficiently dense (or almost dense) paired array.
Like compact, but doesn't look for defaultValues that can be removed.
How many elements are logically stored here.
How many elements are logically stored here. This may be <= activeSize.
Sets the given value at the given index if the value is not equal to the current default.
Sets the given value at the given index if the value is not equal to the current default. The data and index arrays will be grown to support the insertion if necessary. The growth schedule doubles the amount of allocated memory at each allocation request up until the sparse array contains 1024 values, at which point the growth is additive: an additional n * 1024 spaces will be allocated for n in 1,2,4,8,16. The largest amount of space added to this vector will be an additional 16*1024*(sizeof(Elem)+4), which is 196608 bytes at a time for a SparseVector[Double], although more space is needed temporarily while moving to the new arrays.
same as data(i).
same as data(i). Gives the value at the underlying offset.
index into the data array
Only iterates "active" elements
Only iterates "active" elements
A SparseArray is a sparse representation of an array using a two-array binary-search approach. There are two arrays: index and data, which together are pairs (i, v) of indices into the array and the value at that position.
The default value is assumed to be null for AnyRef, and 0 for AnyVal types.