Struct reference_trie::ExtensionLayout

pub struct ExtensionLayout;

Trie layout using extension nodes.

Trait Implementations

impl TrieLayout for ExtensionLayout

const USE_EXTENSION: bool

If true, the trie will use extension nodes and no partial in branch, if false the trie will only use branch and node with partials in both.

type Hash = KeccakHasher

Hasher to use for this trie.

type Codec = ReferenceNodeCodec

Codec to use (needs to match hasher and nibble ops).

impl TrieConfiguration for ExtensionLayout

fn trie_build<DB, I, A, B>(db: &mut DB, input: I) -> <Self::Hash as Hasher>::Out where
    A: AsRef<[u8]> + Ord,
    B: AsRef<[u8]>,
    DB: HashDB<Self::Hash, usize>,
    I: IntoIterator<Item = (A, B)>, 

Operation to build a trie db from its ordered iterator over its key/values.

fn trie_root<I, A, B>(input: I) -> <Self::Hash as Hasher>::Out where
    A: AsRef<[u8]> + Ord,
    B: AsRef<[u8]>,
    I: IntoIterator<Item = (A, B)>, 

Determines a trie root given its ordered contents, closed form.

fn trie_root_unhashed<I, A, B>(input: I) -> Vec<u8> where
    A: AsRef<[u8]> + Ord,
    B: AsRef<[u8]>,
    I: IntoIterator<Item = (A, B)>, 

Determines a trie root node's data given its ordered contents, closed form.

fn encode_index(input: u32) -> Vec<u8>

Encoding of index as a key (when reusing general trie for indexed trie).

fn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Out where
    A: AsRef<[u8]>,
    I: IntoIterator<Item = A>, 

A trie root formed from the items, with keys attached according to their compact-encoded index (using parity-codec crate).