Struct aljabar::Permutation

pub struct Permutation<const N: usize> { /* fields omitted */ }

Permutation matrix created for LU decomposition.

Implementations

impl<const N: usize> Permutation<{ N }>

pub fn unit() -> Permutation<{ N }>

Returns the unit permutation.

pub fn swap(&mut self, a: usize, b: usize)

Swaps two rows and increments the number of swaps.

pub fn num_swaps(&self) -> usize

Returns the number of swaps that have occurred.

Trait Implementations

impl<const N: usize> Clone for Permutation<N>

fn clone(&self) -> Permutation<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Copy for Permutation<N>

impl<const N: usize> Debug for Permutation<{ N }>

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

Formats the value using the given formatter.

impl<const N: usize> Deref for Permutation<{ N }>

type Target = [usize; N]

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<const N: usize> DerefMut for Permutation<{ N }>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T, const N: usize> Mul<Vector<T, N>> for Permutation<{ N }> where
    T: Clone, 

type Output = Vector<T, { N }>

The resulting type after applying the * operator.

fn mul(self, rhs: Vector<T, { N }>) -> Self::Output

Performs the * operation.

impl<RHS, const N: usize> PartialEq<RHS> for Permutation<{ N }> where
    RHS: Deref<Target = [usize; N]>, 

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.