Function sapling_crypto_ce::circuit::as_waksman::prove_shuffle

pub fn prove_shuffle<E, CS>(
    cs: CS, 
    original: &[AllocatedNum<E>], 
    permuted: &[AllocatedNum<E>], 
    permuted_order: &IntegerPermutation
) -> Result<(), SynthesisError> where
    CS: ConstraintSystem<E>,
    E: Engine, 

prove permutation by routing elements through the permutation network Topology is calculated exclusively based on the size on the network, and permuted elements can be anything. Caller be responsible for validity if elements are unique or not