Function sp_trie::encode_compact

pub fn encode_compact<L>(
    proof: StorageProof, 
    root: TrieHash<L>
) -> Result<CompactProof, Error<L>> where
    L: TrieConfiguration, 

Encode a compact proof.

Takes as input all full encoded node from the proof, and the root. Then parse all child trie root and compress main trie content first then all child trie contents. Child trie are ordered by the order of their roots in the top trie.