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

impl<D: DimName> PermutationSequence<D> where
    DefaultAllocator: Allocator<(usize, usize), D>, [src]

pub fn identity() -> Self[src]

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

impl PermutationSequence<Dynamic> where
    DefaultAllocator: Allocator<(usize, usize), Dynamic>, [src]

pub fn identity(n: usize) -> Self[src]

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

impl<D: Dim> PermutationSequence<D> where
    DefaultAllocator: Allocator<(usize, usize), D>, [src]

pub fn identity_generic(dim: D) -> Self[src]

Creates a new sequence of D identity permutations.

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

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>, [src]

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>, [src]

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>, [src]

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>, [src]

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

pub fn len(&self) -> usize[src]

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

pub fn is_empty(&self) -> bool[src]

Returns true if the permutation sequence contains no elements.

pub fn determinant<T: One + ClosedNeg>(&self) -> T[src]

The determinant of the matrix corresponding to this permutation.

Trait Implementations

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

fn clone(&self) -> PermutationSequence<D>[src]

Returns a copy of the value. Read more

fn clone_from(&mut self, source: &Self)1.0.0[src]

Performs copy-assignment from source. Read more

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

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

Formats the value using the given formatter. Read more

impl<D: Dim> Copy for PermutationSequence<D> where
    DefaultAllocator: Allocator<(usize, usize), D>,
    OVector<(usize, usize), D>: Copy, [src]

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

Mutably borrows from an owned value. Read more

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, [src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<T> Same<T> for T[src]

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, [src]

pub fn to_subset(&self) -> Option<SS>[src]

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

pub fn is_in_subset(&self) -> bool[src]

Checks if self is actually part of its subset T (and can be converted to it).

pub fn to_subset_unchecked(&self) -> SS[src]

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

pub fn from_subset(element: &SS) -> SP[src]

The inclusion map: converts self to the equivalent element of its superset.

impl<T> ToOwned for T where
    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T[src]

Creates owned data from borrowed data, usually by cloning. Read more

pub fn clone_into(&self, target: &mut T)[src]

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

Performs the conversion.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>, 

pub fn vzip(self) -> V