@@ -1629,7 +1629,7 @@ impl<
1629
1629
1630
1630
let mut data = S :: new ( size) . expect ( "failed to create data store" ) ;
1631
1631
1632
- populate_data_par :: < E , A , S , BaseTreeArity , _ > ( & mut data, iter) ?;
1632
+ populate_data_par :: < E , A , S , _ > ( & mut data, iter) ?;
1633
1633
let root = S :: build :: < A , BaseTreeArity > ( & mut data, leafs, row_count, None ) ?;
1634
1634
1635
1635
Ok ( MerkleTree {
@@ -1689,7 +1689,7 @@ impl<
1689
1689
} ) ;
1690
1690
}
1691
1691
1692
- populate_data_par :: < E , A , S , BaseTreeArity , _ > ( & mut data, iter) ?;
1692
+ populate_data_par :: < E , A , S , _ > ( & mut data, iter) ?;
1693
1693
let root = S :: build :: < A , BaseTreeArity > ( & mut data, leafs, row_count, Some ( config) ) ?;
1694
1694
1695
1695
Ok ( MerkleTree {
@@ -2049,12 +2049,11 @@ pub fn populate_data<
2049
2049
Ok ( ( ) )
2050
2050
}
2051
2051
2052
- fn populate_data_par < E , A , S , BaseTreeArity , I > ( data : & mut S , iter : I ) -> Result < ( ) >
2052
+ fn populate_data_par < E , A , S , I > ( data : & mut S , iter : I ) -> Result < ( ) >
2053
2053
where
2054
2054
E : Element ,
2055
2055
A : Algorithm < E > ,
2056
2056
S : Store < E > ,
2057
- BaseTreeArity : Unsigned ,
2058
2057
I : ParallelIterator < Item = E > + IndexedParallelIterator ,
2059
2058
{
2060
2059
if !data. is_empty ( ) {
0 commit comments