pub fn from_publickeys<B, I, A>(iter: I, depth: usize) -> Self
    where
        B: Borrow<PublicKey>,
        I: IntoIterator<Item=B>,
        A: 'static + PoseidonArity,
    {
        let mut list = iter.into_iter().map( |pk| pk.borrow().0.to_affine().get_u() ).collect::<Vec<_>>();
        assert!(list.len() > 1);
        RingRoot(merkleize( depth, list.as_mut_slice(), 0 , |_: CopathPoint<A>| () ))
    }
/// Get the merkle root from a list of public keys. Panic if length of the list is zero.
///
/// TODO: We do no initial hashing here for the leaves, but maybe that's fine.
Get the merkle root from a list of public keys. Panic if length of the list is zero.
TODO: We do no initial hashing here for the leaves, but maybe that's fine.
Get the merkle root from a list of public keys . Panic if length of the list is zero . TODO : We do no initial hashing here for the leaves but maybe that ' s fine .
pub fn from_publickeys<B, I, A>(iter: I, depth: usize) -> Self
    where
        B: Borrow<PublicKey>,
        I: IntoIterator<Item=B>,
        A: 'static + PoseidonArity,
    {
        let mut list = iter.into_iter().map( |pk| pk.borrow().0.to_affine().get_u() ).collect::<Vec<_>>();
        assert!(list.len() > 1);
        RingRoot(merkleize( depth, list.as_mut_slice(), 0 , |_: CopathPoint<A>| () ))
    }
pub fn from_publickeys < B , I , A > ( iter : I , depth : usize ) -> Self where B : Borrow < PublicKey > , I : IntoIterator < Item = B > , A : ' static + PoseidonArity , { let mut list = iter . into_iter ( ) . map ( | pk | pk . borrow ( ) . 0 . to_affine ( ) . get_u ( ) ) . collect :: < Vec < _ > > ( ) ; assert ! ( list len ( ) 1 ) ; RingRoot ( merkleize ( depth , list . as_mut_slice ( ) , 0 , | _ : CopathPoint < A > | ( ) ) ) }
Get the merkle root from a list of public keys.
Get the merkle root from a list of public keys .
iter
I
depth
usize
iter
I
depth
usize