Struct PartialArrayBuilder 

pub struct PartialArrayBuilder<T, B> { /* private fields */ }

Builder for creating an immutable partial array.

The builder allows you to specify the array length and then add (position, value) pairs. Positions must be added in strictly increasing order.

To get a builder you can use either new_dense or new_sparse.

Implementations

impl<T> PartialArrayBuilder<T, BitVec<Box<[usize]>>>

pub fn set(&mut self, position: usize, value: T)

Sets a value at the given position.

The provided position must be greater than the last position set.

pub fn build(self) -> PartialArray<T, Rank9<BitVec<Box<[usize]>>>>

Builds the immutable dense partial array.

impl<T> PartialArrayBuilder<T, EliasFanoBuilder>

pub fn set(&mut self, position: usize, value: T)

Sets a value at the given position.

The provided position must be greater than the last position set.

pub fn build(self) -> PartialArray<T, SparseIndex<Box<[usize]>>>

Builds the immutable sparse partial array.

Trait Implementations

impl<T: Clone, B: Clone> Clone for PartialArrayBuilder<T, B>

fn clone(&self) -> PartialArrayBuilder<T, B>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug, B: Debug> Debug for PartialArrayBuilder<T, B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Extend<(usize, T)> for PartialArrayBuilder<T, BitVec<Box<[usize]>>>

Extends the builder with an iterator of (position, value) pairs.

Position must be in strictly increasing order. The first returned position must be greater than the last position set.

fn extend<I: IntoIterator<Item = (usize, T)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<(usize, T)> for PartialArrayBuilder<T, EliasFanoBuilder>

Extends the builder with an iterator of (position, value) pairs.

Position must be in strictly increasing order. The first returned position must be greater than the last position set.

fn extend<I: IntoIterator<Item = (usize, T)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, B> FlatType for PartialArrayBuilder<T, B>

where B: MemSize + FlatType, Vec<T>: MemSize + FlatType, usize: MemSize + FlatType,

type Flat = False

impl<T, B> MemDbgImpl for PartialArrayBuilder<T, B>

where B: MemDbgImpl + FlatType, Vec<T>: MemDbgImpl + FlatType, usize: MemDbgImpl + FlatType,

fn _mem_dbg_rec_on( &self, _memdbg_writer: &mut impl Write, _memdbg_total_size: usize, _memdbg_max_depth: usize, _memdbg_prefix: &mut String, _memdbg_is_last: bool, _memdbg_flags: DbgFlags, _memdbg_refs: &mut HashSet<usize>, ) -> Result

fn _mem_dbg_depth_on( &self, writer: &mut impl Write, total_size: usize, max_depth: usize, prefix: &mut String, field_name: Option<&str>, is_last: bool, padded_size: usize, flags: DbgFlags, dbg_refs: &mut HashSet<usize>, ) -> Result<(), Error>

fn _mem_dbg_depth_on_impl( &self, writer: &mut impl Write, total_size: usize, max_depth: usize, prefix: &mut String, field_name: Option<&str>, is_last: bool, padded_size: usize, flags: DbgFlags, dbg_refs: &mut HashSet<usize>, ref_display: RefDisplay, ) -> Result<(), Error>

Internal implementation for depth display.

impl<T, B> MemSize for PartialArrayBuilder<T, B>

where B: MemSize + FlatType, Vec<T>: MemSize + FlatType, usize: MemSize + FlatType,

fn mem_size_rec( &self, _memsize_flags: SizeFlags, _memsize_refs: &mut HashMap<usize, usize>, ) -> usize

Recursive implementation that tracks visited references for deduplication.

fn mem_size(&self, flags: SizeFlags) -> usize

Returns the (recursively computed) overall memory size of the structure in bytes.