Struct OrderedTrieRootEncodedBuilder 

pub struct OrderedTrieRootEncodedBuilder { /* private fields */ }

A builder for computing ordered trie roots from an append-only stream of pre-encoded items.

This type does not require the total item count up front. It relies on a strict input contract instead: every pushed item must be the next contiguous item in the final list.

This builder is intended for transaction and receipt root computation while a block is still being built. It buffers only index 0, then streams all other leaves directly into the HashBuilder in the same order as alloy_trie::root::ordered_trie_root_encoded.

Implementations

impl OrderedTrieRootEncodedBuilder

pub fn new() -> Self

Creates an empty builder.

pub fn push_next(&mut self, bytes: &[u8])

Pushes the next pre-encoded item.

Items must be pushed in their final contiguous order.

pub const fn pushed_count(&self) -> usize

Returns the number of items pushed so far.

pub const fn is_empty(&self) -> bool

Returns true if no items have been pushed.

pub fn finalize(self) -> B256

Finalizes the builder and returns the trie root.

This method is the end-of-stream signal. If fewer than 129 items were pushed, index 0 is inserted here because it is the final leaf in RLP key order for that short list.

Trait Implementations

impl Debug for OrderedTrieRootEncodedBuilder

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

Formats the value using the given formatter.

impl Default for OrderedTrieRootEncodedBuilder

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 552 bytes