Function reference_trie::proof::generate_proof

pub fn generate_proof<'a, T, L, I, K>(
    trie: &T, 
    keys: I
) -> Result<Vec<Vec<u8>>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>> where
    I: IntoIterator<Item = &'a K>,
    K: 'a + AsRef<[u8]>,
    L: TrieLayout,
    T: Trie<L>, 

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

Assumes inline nodes have only inline children.