pub fn child_trie_root<H: Hasher, I, A, B>(_storage_key: &[u8], input: I) -> Vec<u8> where
	I: IntoIterator<Item = (A, B)>,
	A: AsRef<[u8]> + Ord,
	B: AsRef<[u8]>,
{
	trie_root::<H, _, _, _>(input).as_ref().iter().cloned().collect()
}
/// Determine a child trie root given its ordered contents, closed form. H is the default hasher, but a generic
/// implementation may ignore this type parameter and use other hashers.
Determine a child trie root given its ordered contents, closed form. H is the default hasher, but a generic
implementation may ignore this type parameter and use other hashers.
Determine a child trie root given its ordered contents closed form . H is the default hasher but a generic implementation may ignore this type parameter and use other hashers .
pub fn child_trie_root<H: Hasher, I, A, B>(_storage_key: &[u8], input: I) -> Vec<u8> where
	I: IntoIterator<Item = (A, B)>,
	A: AsRef<[u8]> + Ord,
	B: AsRef<[u8]>,
{
	trie_root::<H, _, _, _>(input).as_ref().iter().cloned().collect()
}
pub fn child_trie_root < H : Hasher , I , A , B > ( _storage_key : & [ u8 ] , input : I ) -> Vec < u8 > where I : IntoIterator < Item = ( A , B ) > , A : AsRef < [ u8 ] > + Ord , B : AsRef < [ u8 ] > , { trie_root :: < H , _ , _ , _ > ( input ) . as_ref ( ) . iter ( ) . cloned ( ) . collect ( ) }
Determine a child trie root given its ordered contents, closed form.
Determine a child trie root given its ordered contents closed form .
_storage_key
&[u8]
input
I
_storage_key
&[u8]
input
I