Storage
Interface for an unboxed iterable, of sorts, for things backed by a flat array of elements.
Value members
Abstract methods
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.)
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. (May be false anyway)
Only gives true if isActive would return true for all i. (May be false anyway)
Some storages (namely HashStorage) won't have active indices packed. This lets you know if the bin is actively in use.
Some storages (namely HashStorage) won't have active indices packed. This lets you know if the bin is actively in use.
- Value parameters:
- i
index into index/data arrays
Concrete methods
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.)
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.)