Struct rin::math::PermutationSequence

pub struct PermutationSequence<D> where
    D: Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,  { /* fields omitted */ }

A sequence of row or column permutations.

Implementations

impl<D> PermutationSequence<D> where
    D: DimName,
    DefaultAllocator: Allocator<(usize, usize), D, U1>, 

pub fn identity() -> PermutationSequence<D>

Creates a new statically-allocated sequence of D identity permutations.

impl PermutationSequence<Dynamic> where
    DefaultAllocator: Allocator<(usize, usize), Dynamic, U1>, 

pub fn identity(n: usize) -> PermutationSequence<Dynamic>

Creates a new dynamically-allocated sequence of n identity permutations.

impl<D> PermutationSequence<D> where
    D: Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>, 

pub fn identity_generic(dim: D) -> PermutationSequence<D>

Creates a new sequence of D identity permutations.

pub fn append_permutation(&mut self, i: usize, i2: usize)

Adds the interchange of the row (or column) i with the row (or column) i2 to this sequence of permutations.

pub fn permute_rows<N, R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
    N: Scalar,
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>, 

Applies this sequence of permutations to the rows of rhs.

pub fn inv_permute_rows<N, R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
    N: Scalar,
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>, 

Applies this sequence of permutations in reverse to the rows of rhs.

pub fn permute_columns<N, R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
    N: Scalar,
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>, 

Applies this sequence of permutations to the columns of rhs.

pub fn inv_permute_columns<N, R2, C2, S2>(
    &self,
    rhs: &mut Matrix<N, R2, C2, S2>
) where
    N: Scalar,
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>, 

Applies this sequence of permutations in reverse to the columns of rhs.

pub fn len(&self) -> usize

The number of non-identity permutations applied by this sequence.

pub fn is_empty(&self) -> bool

Returns true if the permutation sequence contains no elements.

pub fn determinant<N>(&self) -> N where
    N: One + ClosedNeg, 

The determinant of the matrix corresponding to this permutation.

Trait Implementations

impl<D> Clone for PermutationSequence<D> where
    D: Clone + Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>, 

pub fn clone(&self) -> PermutationSequence<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D> Debug for PermutationSequence<D> where
    D: Debug + Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>, 

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

Formats the value using the given formatter.

impl<'de, D> Deserialize<'de> for PermutationSequence<D> where
    D: Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    Matrix<(usize, usize), D, U1, <DefaultAllocator as Allocator<(usize, usize), D, U1>>::Buffer>: Deserialize<'de>, 

pub fn deserialize<__D>(
    __deserializer: __D
) -> Result<PermutationSequence<D>, <__D as Deserializer<'de>>::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<D> Serialize for PermutationSequence<D> where
    D: Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    Matrix<(usize, usize), D, U1, <DefaultAllocator as Allocator<(usize, usize), D, U1>>::Buffer>: Serialize, 

pub fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<D> Copy for PermutationSequence<D> where
    D: Dim,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    Matrix<(usize, usize), D, U1, <DefaultAllocator as Allocator<(usize, usize), D, U1>>::Buffer>: Copy,