Struct bevy_rapier2d::prelude::nalgebra::PermutationSequence [−][src]
pub struct PermutationSequence<D> where
D: Dim,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>, { /* fields omitted */ }
Expand description
A sequence of row or column permutations.
Implementations
impl<D> PermutationSequence<D> where
D: DimName,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
[src]
impl<D> PermutationSequence<D> where
D: DimName,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
[src]Creates a new statically-allocated sequence of D
identity permutations.
Creates a new dynamically-allocated sequence of n
identity permutations.
impl<D> PermutationSequence<D> where
D: Dim,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
[src]
impl<D> PermutationSequence<D> where
D: Dim,
DefaultAllocator: Allocator<(usize, usize), D, Const<1_usize>>,
[src]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, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]
pub fn permute_rows<T, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]Applies this sequence of permutations to the rows of rhs
.
pub fn inv_permute_rows<T, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]
pub fn inv_permute_rows<T, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]Applies this sequence of permutations in reverse to the rows of rhs
.
pub fn permute_columns<T, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]
pub fn permute_columns<T, R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]Applies this sequence of permutations to the columns of rhs
.
pub fn inv_permute_columns<T, R2, C2, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]
pub fn inv_permute_columns<T, R2, C2, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>
) where
T: Scalar,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
[src]Applies this sequence of permutations in reverse to the columns of rhs
.
The determinant of the matrix corresponding to this permutation.
Trait Implementations
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
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V