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)
Returns the actual flat array of elements used.
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 are logically stored here.
How many elements are logically stored here. This may be <= activeSize.
same as data(i).
same as data(i). Gives the value at the underlying offset.
index into the data array
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.)
Interface for an unboxed iterable, of sorts, for things backed by a flat array of elements.