Struct LinkedChunkBuilder

pub struct LinkedChunkBuilder<const CAP: usize, Item, Gap> { /* private fields */ }

A data structure to rebuild a linked chunk from its raw representation.

A linked chunk can be rebuilt incrementally from its internal representation, with the chunks being added in any order, as long as they form a single connected component eventually (viz., there’s no subgraphs/sublists isolated from the one final linked list). If they don’t, then the final call to LinkedChunkBuilder::build() will result in an error).

Implementations

impl<const CAP: usize, Item, Gap> LinkedChunkBuilder<CAP, Item, Gap>

pub fn new() -> LinkedChunkBuilder<CAP, Item, Gap>

Create an empty LinkedChunkBuilder with no update history.

pub fn push_gap( &mut self, previous: Option<ChunkIdentifier>, id: ChunkIdentifier, next: Option<ChunkIdentifier>, content: Gap, )

Stash a gap chunk with its content.

This can be called even if the previous and next chunks have not been added yet. Resolving these chunks will happen at the time of calling LinkedChunkBuilder::build().

pub fn push_items( &mut self, previous: Option<ChunkIdentifier>, id: ChunkIdentifier, next: Option<ChunkIdentifier>, items: impl IntoIterator<Item = Item>, )

Stash an item chunk with its contents.

This can be called even if the previous and next chunks have not been added yet. Resolving these chunks will happen at the time of calling LinkedChunkBuilder::build().

pub fn with_update_history(&mut self)

Request that the resulting linked chunk will have an update history, as if it were created with LinkedChunk::new_with_update_history.

pub fn build( self, ) -> Result<Option<LinkedChunk<CAP, Item, Gap>>, LinkedChunkBuilderError>

Trait Implementations

impl<const CAP: usize, Item, Gap> Default for LinkedChunkBuilder<CAP, Item, Gap>

fn default() -> LinkedChunkBuilder<CAP, Item, Gap>

Returns the “default value” for a type.