Struct Permutation 

pub struct Permutation { /* private fields */ }

A bit-position permutation derived from a cost-weighted PRNG walk.

map[original_position] = new_position.

Implementations

impl Permutation

pub fn identity(len: usize) -> Self

Identity permutation — no reordering.

pub fn apply(&self, data: &mut [u8])

Apply the permutation to data in-place (cycle-following algorithm).

pub fn inverse(&self) -> Self

Return the inverse permutation such that inv.apply(p.apply(x)) == x.

pub fn as_slice(&self) -> &[usize]

Raw permutation map (original_position -> new_position).

Trait Implementations

impl Clone for Permutation

fn clone(&self) -> Permutation

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Permutation

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Permutation

fn eq(&self, other: &Permutation) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Permutation

impl StructuralPartialEq for Permutation