Struct NodeBuilder 

pub struct NodeBuilder<T, N = Node<T>, S = DefaultNodeSerializer>
where
    T: Clone,
    S: NodeSerializer<N, T>,
{ /* private fields */ }

Create a balances merkle tree of Node blocks.

Note: This implementation requires the data to fit into memory.

Implementations

impl<T, N, S> NodeBuilder<T, N, S>

where T: Clone + Serialize, S: NodeSerializer<N, T>,

pub fn new(max_block_size: usize, max_children: usize, serializer: S) -> Self

pub fn with_items_size_max(self, items_size_max: usize) -> Self

pub fn push(&mut self, item: T) -> Result<(), NodeBuilderError>

pub fn extend( &mut self, items: impl IntoIterator<Item = T>, ) -> Result<(), NodeBuilderError>

pub fn take_blocks(&mut self) -> impl Iterator<Item = Block>

Take blocks from builder that already has been created.

pub fn into_blocks( self, ) -> Result<(OptionLink<N>, Vec<Block>), NodeBuilderError>

Convert builder into blocks. All blocks that are not yet taken using NodeBuilder::take_blocks are returned.

pub fn into_node(self) -> Result<(N, Vec<Block>), NodeBuilderError>

Convert builder into a node and blocks if needed. All blocks that are not yet taken using NodeBuilder::take_blocks are returned. The root node is returned directly and not put into a block.

Trait Implementations

impl<T> Default for NodeBuilder<T, Node<T>, DefaultNodeSerializer>

where T: Clone + Serialize,

fn default() -> Self

Returns the “default value” for a type.