Function trie_db::proof::generate_proof

pub fn generate_proof<'a, T, L, I, K>(
    trie: &T, 
    keys: I
) -> TrieResult<Vec<Vec<u8>>, TrieHash<L>, CError<L>> where
    T: Trie<L>,
    L: TrieLayout,
    I: IntoIterator<Item = &'a K>,
    K: 'a + AsRef<[u8]>, 

Generate a compact proof for key-value pairs in a trie given a set of keys.

Assumes inline nodes have only inline children.