Struct Permutation 

pub struct Permutation {
    pub perm: Vec<usize>,
}

A permutation of indices 0..n.

Fields

perm: Vec<usize>

Implementations

impl Permutation

pub fn identity(n: usize) -> Self

Create the identity permutation of size n.

pub fn from_sort_order<T: Ord>(v: &[T]) -> Self

Create a permutation from a sorted-order vector.

perm[i] = j means that position i in the sorted order came from position j in the original.

pub fn apply<T: Clone>(&self, v: &[T]) -> Vec<T>

Apply the permutation to a slice, returning a new Vec.

pub fn inverse(&self) -> Self

Compute the inverse permutation.

pub fn compose(&self, other: &Self) -> Self

Compose two permutations (self after other).

pub fn len(&self) -> usize

Size of the permutation.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn is_identity(&self) -> bool

Check if this is the identity permutation.

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