Struct nalgebra::linalg::PermutationSequence [−][src]
pub struct PermutationSequence<D: Dim> where
DefaultAllocator: Allocator<(usize, usize), D>, { /* fields omitted */ }
Expand description
A sequence of row or column permutations.
Implementations
Creates a new sequence of D identity permutations.
Adds the interchange of the row (or column) i
with the row (or column) i2
to this
sequence of permutations.
pub fn permute_rows<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
pub fn permute_rows<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
Applies this sequence of permutations to the rows of rhs
.
pub fn inv_permute_rows<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
pub fn inv_permute_rows<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
Applies this sequence of permutations in reverse to the rows of rhs
.
pub fn permute_columns<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
pub fn permute_columns<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
Applies this sequence of permutations to the columns of rhs
.
pub fn inv_permute_columns<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
pub fn inv_permute_columns<T: Scalar, R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
S2: StorageMut<T, R2, C2>,
Applies this sequence of permutations in reverse to the columns of rhs
.
The determinant of the matrix corresponding to this permutation.
Trait Implementations
impl<'de, D: Dim> Deserialize<'de> for PermutationSequence<D> where
DefaultAllocator: Allocator<(usize, usize), D>,
DefaultAllocator: Allocator<(usize, usize), D>,
OVector<(usize, usize), D>: Deserialize<'de>,
impl<'de, D: Dim> Deserialize<'de> for PermutationSequence<D> where
DefaultAllocator: Allocator<(usize, usize), D>,
DefaultAllocator: Allocator<(usize, usize), D>,
OVector<(usize, usize), D>: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations
impl<D> !RefUnwindSafe for PermutationSequence<D>
impl<D> !Send for PermutationSequence<D>
impl<D> !Sync for PermutationSequence<D>
impl<D> !Unpin for PermutationSequence<D>
impl<D> !UnwindSafe for PermutationSequence<D>
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.