Struct sp_trie::Layout

pub struct Layout<H>(_);

substrate trie layout

Trait Implementations

impl<H: Default> Default for Layout<H>

pub fn default() -> Layout<H>

Returns the "default value" for a type.

impl<H: Hasher> TrieConfiguration for Layout<H>

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

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

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

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

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

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

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

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

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

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

impl<H: Hasher> TrieLayout for Layout<H>

pub 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.

pub const ALLOW_EMPTY: bool

If true, the trie will allow empty values into TrieDBMut

type Hash = H

Hasher to use for this trie.

type Codec = NodeCodec<Self::Hash>

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