Function sp_trie::decode_compact

pub fn decode_compact<'a, L, DB, I>(
    db: &mut DB, 
    encoded: I, 
    expected_root: Option<&TrieHash<L>>
) -> Result<TrieHash<L>, Error<L>> where
    L: TrieConfiguration,
    DB: HashDBT<L::Hash, DBValue> + HashDBRef<L::Hash, DBValue>,
    I: IntoIterator<Item = &'a [u8]>, 

Decode a compact proof.

Takes as input a destination db for decoded node and encoded an iterator of compact encoded nodes.

Child trie are decoded in order of child trie root present in the top trie.