Struct sp_trie::LayoutV1

pub struct LayoutV1<H>(_);

substrate trie layout, with external value nodes.

Trait Implementations

impl<H> TrieConfiguration for LayoutV1<H>where H: Hasher,

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

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

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.

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

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

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

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

fn ordered_trie_root<I, A>(input: I) -> <Self::Hash as Hasher>::Outwhere 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> TrieLayout for LayoutV1<H>where H: Hasher,

const USE_EXTENSION: bool = false

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.

const ALLOW_EMPTY: bool = true

If true, the trie will allow empty values into TrieDBMut

const MAX_INLINE_VALUE: Option<u32> = _

Threshold above which an external node should be use to store a node value.

type Hash = H

Hasher to use for this trie.

type Codec = NodeCodec<<LayoutV1<H> as TrieLayout>::Hash>

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