Trait sp_trie::TrieConfiguration[−][src]

pub trait TrieConfiguration: TrieLayout {
    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>,
    { ... }

    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]>,
    { ... }

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

    pub fn encode_index(input: u32) -> Vec<u8, Global> { ... }

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

Various re-exports from the trie-db crate. This trait associates a trie definition with preferred methods. It also contains own default implementations and can be used to allow switching implementation.

Provided methods

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>, [src]

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

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]>, [src]

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

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

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

pub fn encode_index(input: u32) -> Vec<u8, Global>[src]

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

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

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

Loading content...

Implementors

impl<H: Hasher> TrieConfiguration for Layout<H>[src]

Loading content...