pub fn compute_root<Header, Hasher, I>(
	cht_size: u64,
	cht_num: Header::Number,
	hashes: I,
) -> ClientResult<Hasher::Out>
	where
		Header: HeaderT,
		Hasher: hash_db::Hasher,
		Hasher::Out: Ord,
		I: IntoIterator<Item=ClientResult<Option<Header::Hash>>>,
{
	Ok(trie::trie_root::<Hasher, _, _, _>(
		build_pairs::<Header, I>(cht_size, cht_num, hashes)?
	))
}
/// Compute a CHT root from an iterator of block hashes. Fails if shorter than
/// SIZE items. The items are assumed to proceed sequentially from `start_number(cht_num)`.
/// Discards the trie's nodes.
Compute a CHT root from an iterator of block hashes. Fails if shorter than
SIZE items. The items are assumed to proceed sequentially from `start_number(cht_num)`.
Discards the trie's nodes.
Compute a CHT root from an iterator of block hashes . Fails if shorter than SIZE items . The items are assumed to proceed sequentially from ` start_number ( cht_num ) ` . Discards the trie ' s nodes .
pub fn compute_root<Header, Hasher, I>(
	cht_size: u64,
	cht_num: Header::Number,
	hashes: I,
) -> ClientResult<Hasher::Out>
	where
		Header: HeaderT,
		Hasher: hash_db::Hasher,
		Hasher::Out: Ord,
		I: IntoIterator<Item=ClientResult<Option<Header::Hash>>>,
{
	Ok(trie::trie_root::<Hasher, _, _, _>(
		build_pairs::<Header, I>(cht_size, cht_num, hashes)?
	))
}
pub fn compute_root < Header , Hasher , I > ( cht_size : u64 , cht_num : Header :: Number , hashes : I , ) -> ClientResult < Hasher :: Out > where Header : HeaderT , Hasher : hash_db :: Hasher , Hasher :: Out : Ord , I : IntoIterator < Item = ClientResult < Option < Header :: Hash > > > , { Ok ( trie :: trie_root :: < Hasher , _ , _ , _ > ( build_pairs :: < Header , I > ( cht_size , cht_num , hashes ) ? ) ) }
Compute a CHT root from an iterator of block hashes.
Compute a CHT root from an iterator of block hashes .
cht_size
u64
cht_num
Header::Number
hashes
I
cht_size
u64
cht_num
Header::Number
hashes
I