Expand description
The most generic column-major matrix (and vector) type.
It combines four type parameters:
N
: for the matrix components scalar type.R
: for the matrix number of rows.C
: for the matrix number of columns.S
: for the matrix data storage, i.e., the buffer that actually contains the matrix components.
The matrix dimensions parameters R
and C
can either be:
- type-level unsigned integer constants (e.g.
U1
,U124
) from thenalgebra::
root module. All numbers from 0 to 127 are defined that way. - type-level unsigned integer constants (e.g.
U1024
,U10000
) from thetypenum::
crate. Using those, you will not get error messages as nice as for numbers smaller than 128 defined on thenalgebra::
module. - the special value
Dynamic
from thenalgebra::
root module. This indicates that the specified dimension is not known at compile-time. Note that this will generally imply that the matrix data storageS
performs a dynamic allocation and contains extra metadata for the matrix shape.
Note that mixing Dynamic
with type-level unsigned integers is allowed. Actually, a
dynamically-sized column vector should be represented as a Matrix<N, Dynamic, U1, S>
(given
some concrete types for N
and a compatible data storage type S
).
Fields§
§data: S
The data storage that contains all the matrix components and informations about its number of rows and column (if needed).
Implementations§
source§impl<N: Scalar + PartialOrd + Signed, D: Dim, S: Storage<N, D>> Matrix<N, D, U1, S>
impl<N: Scalar + PartialOrd + Signed, D: Dim, S: Storage<N, D>> Matrix<N, D, U1, S>
source§impl<N: Scalar + PartialOrd + Signed, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar + PartialOrd + Signed, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn iamax_full(&self) -> (usize, usize)
pub fn iamax_full(&self) -> (usize, usize)
Computes the index of the matrix component with the largest absolute value.
source§impl<N, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
impl<N, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
sourcepub fn dot<R2: Dim, C2: Dim, SB>(&self, rhs: &Matrix<N, R2, C2, SB>) -> Nwhere
SB: Storage<N, R2, C2>,
ShapeConstraint: DimEq<R, R2> + DimEq<C, C2>,
pub fn dot<R2: Dim, C2: Dim, SB>(&self, rhs: &Matrix<N, R2, C2, SB>) -> Nwhere
SB: Storage<N, R2, C2>,
ShapeConstraint: DimEq<R, R2> + DimEq<C, C2>,
The dot product between two matrices (seen as vectors).
Note that this is not the matrix multiplication as in, e.g., numpy. For matrix
multiplication, use one of: .gemm
, mul_to
, .mul
, *
.
source§impl<N, D: Dim, S> Matrix<N, D, U1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
S: StorageMut<N, D>,
impl<N, D: Dim, S> Matrix<N, D, U1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
S: StorageMut<N, D>,
sourcepub fn axpy<D2: Dim, SB>(&mut self, a: N, x: &Vector<N, D2, SB>, b: N)where
SB: Storage<N, D2>,
ShapeConstraint: DimEq<D, D2>,
pub fn axpy<D2: Dim, SB>(&mut self, a: N, x: &Vector<N, D2, SB>, b: N)where
SB: Storage<N, D2>,
ShapeConstraint: DimEq<D, D2>,
Computes self = a * x + b * self
.
If be is zero, self
is never read from.
sourcepub fn gemv<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, R2> + AreMultipliable<R2, C2, D3, U1>,
pub fn gemv<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, R2> + AreMultipliable<R2, C2, D3, U1>,
Computes self = alpha * a * x + beta * self
, where a
is a matrix, x
a vector, and
alpha, beta
two scalars.
If beta
is zero, self
is never read.
sourcepub fn gemv_symm<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &SquareMatrix<N, D2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, D2> + AreMultipliable<D2, D2, D3, U1>,
pub fn gemv_symm<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &SquareMatrix<N, D2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, D2> + AreMultipliable<D2, D2, D3, U1>,
Computes self = alpha * a * x + beta * self
, where a
is a symmetric matrix, x
a
vector, and alpha, beta
two scalars.
If beta
is zero, self
is never read. If self
is read, only its lower-triangular part
(including the diagonal) is actually read.
sourcepub fn gemv_tr<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, C2> + AreMultipliable<C2, R2, D3, U1>,
pub fn gemv_tr<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
x: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<D, C2> + AreMultipliable<C2, R2, D3, U1>,
Computes self = alpha * a.transpose() * x + beta * self
, where a
is a matrix, x
a vector, and
alpha, beta
two scalars.
If beta
is zero, self
is never read.
source§impl<N, R1: Dim, C1: Dim, S: StorageMut<N, R1, C1>> Matrix<N, R1, C1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
impl<N, R1: Dim, C1: Dim, S: StorageMut<N, R1, C1>> Matrix<N, R1, C1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
sourcepub fn ger<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
x: &Vector<N, D2, SB>,
y: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<R1, D2> + DimEq<C1, D3>,
pub fn ger<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
x: &Vector<N, D2, SB>,
y: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<R1, D2> + DimEq<C1, D3>,
Computes self = alpha * x * y.transpose() + beta * self
.
If beta
is zero, self
is never read.
sourcepub fn gemm<R2: Dim, C2: Dim, R3: Dim, C3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C3> + AreMultipliable<R2, C2, R3, C3>,
pub fn gemm<R2: Dim, C2: Dim, R3: Dim, C3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C3> + AreMultipliable<R2, C2, R3, C3>,
Computes self = alpha * a * b + beta * self
, where a, b, self
are matrices.
alpha
and beta
are scalar.
If beta
is zero, self
is never read.
sourcepub fn gemm_tr<R2: Dim, C2: Dim, R3: Dim, C3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, C2> + SameNumberOfColumns<C1, C3> + AreMultipliable<C2, R2, R3, C3>,
pub fn gemm_tr<R2: Dim, C2: Dim, R3: Dim, C3: Dim, SB, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: One,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, C2> + SameNumberOfColumns<C1, C3> + AreMultipliable<C2, R2, R3, C3>,
Computes self = alpha * a.transpose() * b + beta * self
, where a, b, self
are matrices.
alpha
and beta
are scalar.
If beta
is zero, self
is never read.
source§impl<N, R1: Dim, C1: Dim, S: StorageMut<N, R1, C1>> Matrix<N, R1, C1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
impl<N, R1: Dim, C1: Dim, S: StorageMut<N, R1, C1>> Matrix<N, R1, C1, S>where
N: Scalar + Zero + ClosedAdd + ClosedMul,
sourcepub fn ger_symm<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
x: &Vector<N, D2, SB>,
y: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<R1, D2> + DimEq<C1, D3>,
pub fn ger_symm<D2: Dim, D3: Dim, SB, SC>(
&mut self,
alpha: N,
x: &Vector<N, D2, SB>,
y: &Vector<N, D3, SC>,
beta: N
)where
N: One,
SB: Storage<N, D2>,
SC: Storage<N, D3>,
ShapeConstraint: DimEq<R1, D2> + DimEq<C1, D3>,
Computes self = alpha * x * y.transpose() + beta * self
, where self
is a symmetric
matrix.
If beta
is zero, self
is never read. The result is symmetric. Only the lower-triangular
(including the diagonal) part of self
is read/written.
source§impl<N, D1: Dim, S: StorageMut<N, D1, D1>> Matrix<N, D, D, S>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
impl<N, D1: Dim, S: StorageMut<N, D1, D1>> Matrix<N, D, D, S>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
sourcepub fn quadform_tr_with_workspace<D2, S2, R3, C3, S3, D4, S4>(
&mut self,
work: &mut Vector<N, D2, S2>,
alpha: N,
lhs: &Matrix<N, R3, C3, S3>,
mid: &SquareMatrix<N, D4, S4>,
beta: N
)where
D2: Dim,
R3: Dim,
C3: Dim,
D4: Dim,
S2: StorageMut<N, D2>,
S3: Storage<N, R3, C3>,
S4: Storage<N, D4, D4>,
ShapeConstraint: DimEq<D1, D2> + DimEq<D1, R3> + DimEq<D2, R3> + DimEq<C3, D4>,
pub fn quadform_tr_with_workspace<D2, S2, R3, C3, S3, D4, S4>(
&mut self,
work: &mut Vector<N, D2, S2>,
alpha: N,
lhs: &Matrix<N, R3, C3, S3>,
mid: &SquareMatrix<N, D4, S4>,
beta: N
)where
D2: Dim,
R3: Dim,
C3: Dim,
D4: Dim,
S2: StorageMut<N, D2>,
S3: Storage<N, R3, C3>,
S4: Storage<N, D4, D4>,
ShapeConstraint: DimEq<D1, D2> + DimEq<D1, R3> + DimEq<D2, R3> + DimEq<C3, D4>,
Computes the quadratic form self = alpha * lhs * mid * lhs.transpose() + beta * self
.
This uses the provided workspace work
to avoid allocations for intermediate results.
sourcepub fn quadform_tr<R3, C3, S3, D4, S4>(
&mut self,
alpha: N,
lhs: &Matrix<N, R3, C3, S3>,
mid: &SquareMatrix<N, D4, S4>,
beta: N
)where
R3: Dim,
C3: Dim,
D4: Dim,
S3: Storage<N, R3, C3>,
S4: Storage<N, D4, D4>,
ShapeConstraint: DimEq<D1, D1> + DimEq<D1, R3> + DimEq<C3, D4>,
DefaultAllocator: Allocator<N, D1>,
pub fn quadform_tr<R3, C3, S3, D4, S4>(
&mut self,
alpha: N,
lhs: &Matrix<N, R3, C3, S3>,
mid: &SquareMatrix<N, D4, S4>,
beta: N
)where
R3: Dim,
C3: Dim,
D4: Dim,
S3: Storage<N, R3, C3>,
S4: Storage<N, D4, D4>,
ShapeConstraint: DimEq<D1, D1> + DimEq<D1, R3> + DimEq<C3, D4>,
DefaultAllocator: Allocator<N, D1>,
Computes the quadratic form self = alpha * lhs * mid * lhs.transpose() + beta * self
.
This allocates a workspace vector of dimension D1 for intermediate results.
Use .quadform_tr_with_workspace(...)
instead to avoid allocations.
sourcepub fn quadform_with_workspace<D2, S2, D3, S3, R4, C4, S4>(
&mut self,
work: &mut Vector<N, D2, S2>,
alpha: N,
mid: &SquareMatrix<N, D3, S3>,
rhs: &Matrix<N, R4, C4, S4>,
beta: N
)where
D2: Dim,
D3: Dim,
R4: Dim,
C4: Dim,
S2: StorageMut<N, D2>,
S3: Storage<N, D3, D3>,
S4: Storage<N, R4, C4>,
ShapeConstraint: DimEq<D3, R4> + DimEq<D1, C4> + DimEq<D2, D3> + AreMultipliable<C4, R4, D2, U1>,
pub fn quadform_with_workspace<D2, S2, D3, S3, R4, C4, S4>(
&mut self,
work: &mut Vector<N, D2, S2>,
alpha: N,
mid: &SquareMatrix<N, D3, S3>,
rhs: &Matrix<N, R4, C4, S4>,
beta: N
)where
D2: Dim,
D3: Dim,
R4: Dim,
C4: Dim,
S2: StorageMut<N, D2>,
S3: Storage<N, D3, D3>,
S4: Storage<N, R4, C4>,
ShapeConstraint: DimEq<D3, R4> + DimEq<D1, C4> + DimEq<D2, D3> + AreMultipliable<C4, R4, D2, U1>,
Computes the quadratic form self = alpha * rhs.transpose() * mid * rhs + beta * self
.
This uses the provided workspace work
to avoid allocations for intermediate results.
sourcepub fn quadform<D2, S2, R3, C3, S3>(
&mut self,
alpha: N,
mid: &SquareMatrix<N, D2, S2>,
rhs: &Matrix<N, R3, C3, S3>,
beta: N
)where
D2: Dim,
R3: Dim,
C3: Dim,
S2: Storage<N, D2, D2>,
S3: Storage<N, R3, C3>,
ShapeConstraint: DimEq<D2, R3> + DimEq<D1, C3> + AreMultipliable<C3, R3, D2, U1>,
DefaultAllocator: Allocator<N, D2>,
pub fn quadform<D2, S2, R3, C3, S3>(
&mut self,
alpha: N,
mid: &SquareMatrix<N, D2, S2>,
rhs: &Matrix<N, R3, C3, S3>,
beta: N
)where
D2: Dim,
R3: Dim,
C3: Dim,
S2: Storage<N, D2, D2>,
S3: Storage<N, R3, C3>,
ShapeConstraint: DimEq<D2, R3> + DimEq<D1, C3> + AreMultipliable<C3, R3, D2, U1>,
DefaultAllocator: Allocator<N, D2>,
Computes the quadratic form self = alpha * rhs.transpose() * mid * rhs + beta * self
.
This allocates a workspace vector of dimension D2 for intermediate results.
Use .quadform_with_workspace(...)
instead to avoid allocations.
source§impl<N, R: Dim, C: Dim, S> Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: StorageMut<N, R, C>,
impl<N, R: Dim, C: Dim, S> Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: StorageMut<N, R, C>,
source§impl<N, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>where
N: Scalar + ClosedAdd,
impl<N, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>where
N: Scalar + ClosedAdd,
sourcepub fn add_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
pub fn add_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
Equivalent to self + rhs
but stores the result into out
to avoid allocations.
source§impl<N, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>where
N: Scalar + ClosedSub,
impl<N, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>where
N: Scalar + ClosedSub,
sourcepub fn sub_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
pub fn sub_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
Equivalent to self + rhs
but stores the result into out
to avoid allocations.
source§impl<N, R1: Dim, C1: Dim, SA> Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SA: Storage<N, R1, C1>,
impl<N, R1: Dim, C1: Dim, SA> Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SA: Storage<N, R1, C1>,
sourcepub fn tr_mul<R2: Dim, C2: Dim, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixMN<N, C1, C2>where
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, C1, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
pub fn tr_mul<R2: Dim, C2: Dim, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixMN<N, C1, C2>where
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, C1, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
Equivalent to self.transpose() * rhs
.
sourcepub fn tr_mul_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + DimEq<C1, R3> + DimEq<C2, C3>,
pub fn tr_mul_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + DimEq<C1, R3> + DimEq<C2, C3>,
Equivalent to self.transpose() * rhs
but stores the result into out
to avoid
allocations.
sourcepub fn mul_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R3, R1> + SameNumberOfColumns<C3, C2> + AreMultipliable<R1, C1, R2, C2>,
pub fn mul_to<R2: Dim, C2: Dim, SB, R3: Dim, C3: Dim, SC>(
&self,
rhs: &Matrix<N, R2, C2, SB>,
out: &mut Matrix<N, R3, C3, SC>
)where
SB: Storage<N, R2, C2>,
SC: StorageMut<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R3, R1> + SameNumberOfColumns<C3, C2> + AreMultipliable<R1, C1, R2, C2>,
Equivalent to self * rhs
but stores the result into out
to avoid allocations.
sourcepub fn kronecker<R2: Dim, C2: Dim, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixMN<N, DimProd<R1, R2>, DimProd<C1, C2>>where
N: ClosedMul,
R1: DimMul<R2>,
C1: DimMul<C2>,
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, DimProd<R1, R2>, DimProd<C1, C2>>,
pub fn kronecker<R2: Dim, C2: Dim, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixMN<N, DimProd<R1, R2>, DimProd<C1, C2>>where
N: ClosedMul,
R1: DimMul<R2>,
C1: DimMul<C2>,
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, DimProd<R1, R2>, DimProd<C1, C2>>,
The kronecker product of two matrices (aka. tensor product of the corresponding linear maps).
source§impl<N: Scalar + ClosedAdd, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar + ClosedAdd, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn add_scalar(&self, rhs: N) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn add_scalar(&self, rhs: N) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Adds a scalar to self
.
sourcepub fn add_scalar_mut(&mut self, rhs: N)where
S: StorageMut<N, R, C>,
pub fn add_scalar_mut(&mut self, rhs: N)where
S: StorageMut<N, R, C>,
Adds a scalar to self
in-place.
source§impl<N: Scalar + PartialOrd + Signed, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar + PartialOrd + Signed, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
source§impl<N, D: DimName> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>where
N: Scalar + Ring,
DefaultAllocator: Allocator<N, D, D>,
impl<N, D: DimName> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>where
N: Scalar + Ring,
DefaultAllocator: Allocator<N, D, D>,
sourcepub fn new_scaling(scaling: N) -> Self
pub fn new_scaling(scaling: N) -> Self
Creates a new homogeneous matrix that applies the same scaling factor on each dimension.
sourcepub fn new_nonuniform_scaling<SB>(
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> Selfwhere
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
pub fn new_nonuniform_scaling<SB>(
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> Selfwhere
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
Creates a new homogeneous matrix that applies a distinct scaling factor for each dimension.
sourcepub fn new_translation<SB>(
translation: &Vector<N, DimNameDiff<D, U1>, SB>
) -> Selfwhere
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
pub fn new_translation<SB>(
translation: &Vector<N, DimNameDiff<D, U1>, SB>
) -> Selfwhere
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
Creates a new homogeneous matrix that applies a pure translation.
source§impl<N: Real> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
impl<N: Real> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
sourcepub fn new_rotation(angle: N) -> Self
pub fn new_rotation(angle: N) -> Self
Builds a 2 dimensional homogeneous rotation matrix from an angle in radian.
source§impl<N: Real> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
impl<N: Real> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
sourcepub fn new_rotation(axisangle: Vector3<N>) -> Self
pub fn new_rotation(axisangle: Vector3<N>) -> Self
Builds a 3D homogeneous rotation matrix from an axis and an angle (multiplied together).
Returns the identity matrix if the given argument is zero.
sourcepub fn new_rotation_wrt_point(axisangle: Vector3<N>, pt: Point3<N>) -> Self
pub fn new_rotation_wrt_point(axisangle: Vector3<N>, pt: Point3<N>) -> Self
Builds a 3D homogeneous rotation matrix from an axis and an angle (multiplied together).
Returns the identity matrix if the given argument is zero.
sourcepub fn from_scaled_axis(axisangle: Vector3<N>) -> Self
pub fn from_scaled_axis(axisangle: Vector3<N>) -> Self
Builds a 3D homogeneous rotation matrix from an axis and an angle (multiplied together).
Returns the identity matrix if the given argument is zero.
This is identical to Self::new_rotation
.
sourcepub fn from_euler_angles(roll: N, pitch: N, yaw: N) -> Self
pub fn from_euler_angles(roll: N, pitch: N, yaw: N) -> Self
Creates a new rotation from Euler angles.
The primitive rotations are applied in order: 1 roll − 2 pitch − 3 yaw.
sourcepub fn from_axis_angle(axis: &Unit<Vector3<N>>, angle: N) -> Self
pub fn from_axis_angle(axis: &Unit<Vector3<N>>, angle: N) -> Self
Builds a 3D homogeneous rotation matrix from an axis and a rotation angle.
sourcepub fn new_orthographic(
left: N,
right: N,
bottom: N,
top: N,
znear: N,
zfar: N
) -> Self
pub fn new_orthographic(
left: N,
right: N,
bottom: N,
top: N,
znear: N,
zfar: N
) -> Self
Creates a new homogeneous matrix for an orthographic projection.
sourcepub fn new_perspective(aspect: N, fovy: N, znear: N, zfar: N) -> Self
pub fn new_perspective(aspect: N, fovy: N, znear: N, zfar: N) -> Self
Creates a new homogeneous matrix for a perspective projection.
sourcepub fn new_observer_frame(
eye: &Point3<N>,
target: &Point3<N>,
up: &Vector3<N>
) -> Self
pub fn new_observer_frame(
eye: &Point3<N>,
target: &Point3<N>,
up: &Vector3<N>
) -> Self
Creates an isometry that corresponds to the local frame of an observer standing at the
point eye
and looking toward target
.
It maps the view direction target - eye
to the positive z
axis and the origin to the
eye
.
sourcepub fn look_at_rh(eye: &Point3<N>, target: &Point3<N>, up: &Vector3<N>) -> Self
pub fn look_at_rh(eye: &Point3<N>, target: &Point3<N>, up: &Vector3<N>) -> Self
Builds a right-handed look-at view matrix.
sourcepub fn look_at_lh(eye: &Point3<N>, target: &Point3<N>, up: &Vector3<N>) -> Self
pub fn look_at_lh(eye: &Point3<N>, target: &Point3<N>, up: &Vector3<N>) -> Self
Builds a left-handed look-at view matrix.
source§impl<N: Scalar + Ring, D: DimName, S: Storage<N, D, D>> Matrix<N, D, D, S>
impl<N: Scalar + Ring, D: DimName, S: Storage<N, D, D>> Matrix<N, D, D, S>
sourcepub fn append_scaling(&self, scaling: N) -> MatrixN<N, D>where
D: DimNameSub<U1>,
DefaultAllocator: Allocator<N, D, D>,
pub fn append_scaling(&self, scaling: N) -> MatrixN<N, D>where
D: DimNameSub<U1>,
DefaultAllocator: Allocator<N, D, D>,
Computes the transformation equal to self
followed by an uniform scaling factor.
sourcepub fn prepend_scaling(&self, scaling: N) -> MatrixN<N, D>where
D: DimNameSub<U1>,
DefaultAllocator: Allocator<N, D, D>,
pub fn prepend_scaling(&self, scaling: N) -> MatrixN<N, D>where
D: DimNameSub<U1>,
DefaultAllocator: Allocator<N, D, D>,
Computes the transformation equal to an uniform scaling factor followed by self
.
sourcepub fn append_nonuniform_scaling<SB>(
&self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
pub fn append_nonuniform_scaling<SB>(
&self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
Computes the transformation equal to self
followed by a non-uniform scaling factor.
sourcepub fn prepend_nonuniform_scaling<SB>(
&self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
pub fn prepend_nonuniform_scaling<SB>(
&self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
Computes the transformation equal to a non-uniform scaling factor followed by self
.
sourcepub fn append_translation<SB>(
&self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
pub fn append_translation<SB>(
&self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D>,
Computes the transformation equal to self
followed by a translation.
sourcepub fn prepend_translation<SB>(
&self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameDiff<D, U1>>,
pub fn prepend_translation<SB>(
&self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
) -> MatrixN<N, D>where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameDiff<D, U1>>,
Computes the transformation equal to a translation followed by self
.
source§impl<N: Scalar + Ring, D: DimName, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
impl<N: Scalar + Ring, D: DimName, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
sourcepub fn append_scaling_mut(&mut self, scaling: N)where
D: DimNameSub<U1>,
pub fn append_scaling_mut(&mut self, scaling: N)where
D: DimNameSub<U1>,
Computes in-place the transformation equal to self
followed by an uniform scaling factor.
sourcepub fn prepend_scaling_mut(&mut self, scaling: N)where
D: DimNameSub<U1>,
pub fn prepend_scaling_mut(&mut self, scaling: N)where
D: DimNameSub<U1>,
Computes in-place the transformation equal to an uniform scaling factor followed by self
.
sourcepub fn append_nonuniform_scaling_mut<SB>(
&mut self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
pub fn append_nonuniform_scaling_mut<SB>(
&mut self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
Computes in-place the transformation equal to self
followed by a non-uniform scaling factor.
sourcepub fn prepend_nonuniform_scaling_mut<SB>(
&mut self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
pub fn prepend_nonuniform_scaling_mut<SB>(
&mut self,
scaling: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
Computes in-place the transformation equal to a non-uniform scaling factor followed by self
.
sourcepub fn append_translation_mut<SB>(
&mut self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
pub fn append_translation_mut<SB>(
&mut self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
Computes the transformation equal to self
followed by a translation.
sourcepub fn prepend_translation_mut<SB>(
&mut self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, DimNameDiff<D, U1>>,
pub fn prepend_translation_mut<SB>(
&mut self,
shift: &Vector<N, DimNameDiff<D, U1>, SB>
)where
D: DimNameSub<U1>,
SB: Storage<N, DimNameDiff<D, U1>>,
DefaultAllocator: Allocator<N, DimNameDiff<D, U1>>,
Computes the transformation equal to a translation followed by self
.
source§impl<N: Scalar, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>
impl<N: Scalar, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>
sourcepub fn component_mul<R2, C2, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixSum<N, R1, C1, R2, C2>where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
pub fn component_mul<R2, C2, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixSum<N, R1, C1, R2, C2>where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
Componentwise matrix multiplication.
source§impl<N: Scalar, R1: Dim, C1: Dim, SA: StorageMut<N, R1, C1>> Matrix<N, R1, C1, SA>
impl<N: Scalar, R1: Dim, C1: Dim, SA: StorageMut<N, R1, C1>> Matrix<N, R1, C1, SA>
sourcepub fn cmpy<R2, C2, SB, R3, C3, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: ClosedMul + Zero + Mul<N, Output = N> + Add<N, Output = N>,
R2: Dim,
C2: Dim,
R3: Dim,
C3: Dim,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
pub fn cmpy<R2, C2, SB, R3, C3, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: ClosedMul + Zero + Mul<N, Output = N> + Add<N, Output = N>,
R2: Dim,
C2: Dim,
R3: Dim,
C3: Dim,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
Computes componentwise self[i] = alpha * a[i] * b[i] + beta * self[i]
.
sourcepub fn component_mul_assign<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
pub fn component_mul_assign<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
Inplace componentwise matrix multiplication.
sourcepub fn component_mul_mut<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
👎Deprecated: This is renamed using the _assign
sufix instead of the _mut
suffix.
pub fn component_mul_mut<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedMul,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
_assign
sufix instead of the _mut
suffix.Inplace componentwise matrix multiplication.
source§impl<N: Scalar, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>
impl<N: Scalar, R1: Dim, C1: Dim, SA: Storage<N, R1, C1>> Matrix<N, R1, C1, SA>
sourcepub fn component_div<R2, C2, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixSum<N, R1, C1, R2, C2>where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
pub fn component_div<R2, C2, SB>(
&self,
rhs: &Matrix<N, R2, C2, SB>
) -> MatrixSum<N, R1, C1, R2, C2>where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
Componentwise matrix division.
source§impl<N: Scalar, R1: Dim, C1: Dim, SA: StorageMut<N, R1, C1>> Matrix<N, R1, C1, SA>
impl<N: Scalar, R1: Dim, C1: Dim, SA: StorageMut<N, R1, C1>> Matrix<N, R1, C1, SA>
sourcepub fn cdpy<R2, C2, SB, R3, C3, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: ClosedDiv + Zero + Mul<N, Output = N> + Add<N, Output = N>,
R2: Dim,
C2: Dim,
R3: Dim,
C3: Dim,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
pub fn cdpy<R2, C2, SB, R3, C3, SC>(
&mut self,
alpha: N,
a: &Matrix<N, R2, C2, SB>,
b: &Matrix<N, R3, C3, SC>,
beta: N
)where
N: ClosedDiv + Zero + Mul<N, Output = N> + Add<N, Output = N>,
R2: Dim,
C2: Dim,
R3: Dim,
C3: Dim,
SB: Storage<N, R2, C2>,
SC: Storage<N, R3, C3>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2> + SameNumberOfRows<R1, R3> + SameNumberOfColumns<C1, C3>,
Computes componentwise self[i] = alpha * a[i] / b[i] + beta * self[i]
.
sourcepub fn component_div_assign<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
pub fn component_div_assign<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
Inplace componentwise matrix division.
sourcepub fn component_div_mut<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
👎Deprecated: This is renamed using the _assign
sufix instead of the _mut
suffix.
pub fn component_div_mut<R2, C2, SB>(&mut self, rhs: &Matrix<N, R2, C2, SB>)where
N: ClosedDiv,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
_assign
sufix instead of the _mut
suffix.Inplace componentwise matrix division.
source§impl<N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
impl<N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
sourcepub unsafe fn new_uninitialized_generic(nrows: R, ncols: C) -> Self
pub unsafe fn new_uninitialized_generic(nrows: R, ncols: C) -> Self
Creates a new uninitialized matrix. If the matrix has a compile-time dimension, this panics
if nrows != R::to_usize()
or ncols != C::to_usize()
.
sourcepub fn from_element_generic(nrows: R, ncols: C, elem: N) -> Self
pub fn from_element_generic(nrows: R, ncols: C, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
sourcepub fn repeat_generic(nrows: R, ncols: C, elem: N) -> Self
pub fn repeat_generic(nrows: R, ncols: C, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
Same as from_element_generic
.
sourcepub fn zeros_generic(nrows: R, ncols: C) -> Selfwhere
N: Zero,
pub fn zeros_generic(nrows: R, ncols: C) -> Selfwhere
N: Zero,
Creates a matrix with all its elements set to 0.
sourcepub fn from_iterator_generic<I>(nrows: R, ncols: C, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
pub fn from_iterator_generic<I>(nrows: R, ncols: C, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
Creates a matrix with all its elements filled by an iterator.
sourcepub fn from_row_slice_generic(nrows: R, ncols: C, slice: &[N]) -> Self
pub fn from_row_slice_generic(nrows: R, ncols: C, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in row-major order.
The order of elements in the slice must follow the usual mathematic writing, i.e., row-by-row.
sourcepub fn from_column_slice_generic(nrows: R, ncols: C, slice: &[N]) -> Self
pub fn from_column_slice_generic(nrows: R, ncols: C, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice. The components must have the same layout as the matrix data storage (i.e. column-major).
sourcepub fn from_fn_generic<F>(nrows: R, ncols: C, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
pub fn from_fn_generic<F>(nrows: R, ncols: C, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
Creates a matrix filled with the results of a function applied to each of its component coordinates.
sourcepub fn identity_generic(nrows: R, ncols: C) -> Selfwhere
N: Zero + One,
pub fn identity_generic(nrows: R, ncols: C) -> Selfwhere
N: Zero + One,
Creates a new identity matrix.
If the matrix is not square, the largest square submatrix starting at index (0, 0)
is set
to the identity matrix. All other entries are set to zero.
sourcepub fn from_diagonal_element_generic(nrows: R, ncols: C, elt: N) -> Selfwhere
N: Zero + One,
pub fn from_diagonal_element_generic(nrows: R, ncols: C, elt: N) -> Selfwhere
N: Zero + One,
Creates a new matrix with its diagonal filled with copies of elt
.
If the matrix is not square, the largest square submatrix starting at index (0, 0)
is set
to the identity matrix. All other entries are set to zero.
sourcepub fn from_partial_diagonal_generic(nrows: R, ncols: C, elts: &[N]) -> Selfwhere
N: Zero,
pub fn from_partial_diagonal_generic(nrows: R, ncols: C, elts: &[N]) -> Selfwhere
N: Zero,
Creates a new matrix that may be rectangular. The first elts.len()
diagonal elements are
filled with the content of elts
. Others are set to 0.
Panics if elts.len()
is larger than the minimum among nrows
and ncols
.
sourcepub fn from_rows<SB>(rows: &[Matrix<N, U1, C, SB>]) -> Selfwhere
SB: Storage<N, U1, C>,
pub fn from_rows<SB>(rows: &[Matrix<N, U1, C, SB>]) -> Selfwhere
SB: Storage<N, U1, C>,
Builds a new matrix from its rows.
Panics if not enough rows are provided (for statically-sized matrices), or if all rows do not have the same dimensions.
sourcepub fn from_columns<SB>(columns: &[Vector<N, R, SB>]) -> Selfwhere
SB: Storage<N, R>,
pub fn from_columns<SB>(columns: &[Vector<N, R, SB>]) -> Selfwhere
SB: Storage<N, R>,
Builds a new matrix from its columns.
Panics if not enough columns are provided (for statically-sized matrices), or if all columns do not have the same dimensions.
sourcepub fn new_random_generic(nrows: R, ncols: C) -> Selfwhere
Standard: Distribution<N>,
pub fn new_random_generic(nrows: R, ncols: C) -> Selfwhere
Standard: Distribution<N>,
Creates a matrix filled with random values.
sourcepub fn from_distribution_generic<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: R,
ncols: C,
distribution: &mut Distr,
rng: &mut G
) -> Self
pub fn from_distribution_generic<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: R,
ncols: C,
distribution: &mut Distr,
rng: &mut G
) -> Self
Creates a matrix filled with random values from the given distribution.
source§impl<N, D: Dim> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, D, D>,
impl<N, D: Dim> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, D, D>,
sourcepub fn from_diagonal<SB: Storage<N, D>>(diag: &Vector<N, D, SB>) -> Selfwhere
N: Zero,
pub fn from_diagonal<SB: Storage<N, D>>(diag: &Vector<N, D, SB>) -> Selfwhere
N: Zero,
Creates a square matrix with its diagonal set to diag
and all other entries set to 0.
source§impl<N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
impl<N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
sourcepub unsafe fn new_uninitialized() -> Self
pub unsafe fn new_uninitialized() -> Self
Creates a new uninitialized matrix.
sourcepub fn from_element(elem: N) -> Self
pub fn from_element(elem: N) -> Self
Creates a matrix with all its elements set to elem
.
sourcepub fn repeat(elem: N) -> Self
pub fn repeat(elem: N) -> Self
Creates a matrix with all its elements set to elem
.
Same as .from_element
.
sourcepub fn from_iterator<I>(iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
pub fn from_iterator<I>(iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
Creates a matrix with all its elements filled by an iterator.
sourcepub fn from_row_slice(slice: &[N]) -> Self
pub fn from_row_slice(slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in row-major order.
The order of elements in the slice must follow the usual mathematic writing, i.e., row-by-row.
sourcepub fn from_column_slice(slice: &[N]) -> Self
pub fn from_column_slice(slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in column-major order.
sourcepub fn from_fn<F>(f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
pub fn from_fn<F>(f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
Creates a matrix filled with the results of a function applied to each of its component coordinates.
sourcepub fn identity() -> Selfwhere
N: Zero + One,
pub fn identity() -> Selfwhere
N: Zero + One,
Creates an identity matrix. If the matrix is not square, the largest square submatrix (starting at the first row and column) is set to the identity while all other entries are set to zero.
sourcepub fn from_diagonal_element(elt: N) -> Selfwhere
N: Zero + One,
pub fn from_diagonal_element(elt: N) -> Selfwhere
N: Zero + One,
Creates a matrix filled with its diagonal filled with elt
and all other
components set to zero.
sourcepub fn from_partial_diagonal(elts: &[N]) -> Selfwhere
N: Zero,
pub fn from_partial_diagonal(elts: &[N]) -> Selfwhere
N: Zero,
Creates a new matrix that may be rectangular. The first elts.len()
diagonal
elements are filled with the content of elts
. Others are set to 0.
Panics if elts.len()
is larger than the minimum among nrows
and ncols
.
sourcepub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
distribution: &mut Distr,
rng: &mut G
) -> Self
pub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
distribution: &mut Distr,
rng: &mut G
) -> Self
Creates a matrix filled with random values from the given distribution.
source§impl<N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
Standard: Distribution<N>,
impl<N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, C>,
Standard: Distribution<N>,
sourcepub fn new_random() -> Self
pub fn new_random() -> Self
Creates a matrix filled with random values.
source§impl<N: Scalar, R: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, Dynamic>,
impl<N: Scalar, R: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, Dynamic>,
sourcepub unsafe fn new_uninitialized(ncols: usize) -> Self
pub unsafe fn new_uninitialized(ncols: usize) -> Self
Creates a new uninitialized matrix.
sourcepub fn from_element(ncols: usize, elem: N) -> Self
pub fn from_element(ncols: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
sourcepub fn repeat(ncols: usize, elem: N) -> Self
pub fn repeat(ncols: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
Same as .from_element
.
sourcepub fn zeros(ncols: usize) -> Selfwhere
N: Zero,
pub fn zeros(ncols: usize) -> Selfwhere
N: Zero,
Creates a matrix with all its elements set to 0
.
sourcepub fn from_iterator<I>(ncols: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
pub fn from_iterator<I>(ncols: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
Creates a matrix with all its elements filled by an iterator.
sourcepub fn from_row_slice(ncols: usize, slice: &[N]) -> Self
pub fn from_row_slice(ncols: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in row-major order.
The order of elements in the slice must follow the usual mathematic writing, i.e., row-by-row.
sourcepub fn from_column_slice(ncols: usize, slice: &[N]) -> Self
pub fn from_column_slice(ncols: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in column-major order.
sourcepub fn from_fn<F>(ncols: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
pub fn from_fn<F>(ncols: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
Creates a matrix filled with the results of a function applied to each of its component coordinates.
sourcepub fn identity(ncols: usize) -> Selfwhere
N: Zero + One,
pub fn identity(ncols: usize) -> Selfwhere
N: Zero + One,
Creates an identity matrix. If the matrix is not square, the largest square submatrix (starting at the first row and column) is set to the identity while all other entries are set to zero.
sourcepub fn from_diagonal_element(ncols: usize, elt: N) -> Selfwhere
N: Zero + One,
pub fn from_diagonal_element(ncols: usize, elt: N) -> Selfwhere
N: Zero + One,
Creates a matrix filled with its diagonal filled with elt
and all other
components set to zero.
sourcepub fn from_partial_diagonal(ncols: usize, elts: &[N]) -> Selfwhere
N: Zero,
pub fn from_partial_diagonal(ncols: usize, elts: &[N]) -> Selfwhere
N: Zero,
Creates a new matrix that may be rectangular. The first elts.len()
diagonal
elements are filled with the content of elts
. Others are set to 0.
Panics if elts.len()
is larger than the minimum among nrows
and ncols
.
sourcepub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
ncols: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
pub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
ncols: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
Creates a matrix filled with random values from the given distribution.
source§impl<N: Scalar, R: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, Dynamic>,
Standard: Distribution<N>,
impl<N: Scalar, R: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, R, Dynamic>,
Standard: Distribution<N>,
sourcepub fn new_random(ncols: usize) -> Self
pub fn new_random(ncols: usize) -> Self
Creates a matrix filled with random values.
source§impl<N: Scalar, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, C>,
impl<N: Scalar, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, C>,
sourcepub unsafe fn new_uninitialized(nrows: usize) -> Self
pub unsafe fn new_uninitialized(nrows: usize) -> Self
Creates a new uninitialized matrix.
sourcepub fn from_element(nrows: usize, elem: N) -> Self
pub fn from_element(nrows: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
sourcepub fn repeat(nrows: usize, elem: N) -> Self
pub fn repeat(nrows: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
Same as .from_element
.
sourcepub fn zeros(nrows: usize) -> Selfwhere
N: Zero,
pub fn zeros(nrows: usize) -> Selfwhere
N: Zero,
Creates a matrix with all its elements set to 0
.
sourcepub fn from_iterator<I>(nrows: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
pub fn from_iterator<I>(nrows: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
Creates a matrix with all its elements filled by an iterator.
sourcepub fn from_row_slice(nrows: usize, slice: &[N]) -> Self
pub fn from_row_slice(nrows: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in row-major order.
The order of elements in the slice must follow the usual mathematic writing, i.e., row-by-row.
sourcepub fn from_column_slice(nrows: usize, slice: &[N]) -> Self
pub fn from_column_slice(nrows: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in column-major order.
sourcepub fn from_fn<F>(nrows: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
pub fn from_fn<F>(nrows: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
Creates a matrix filled with the results of a function applied to each of its component coordinates.
sourcepub fn identity(nrows: usize) -> Selfwhere
N: Zero + One,
pub fn identity(nrows: usize) -> Selfwhere
N: Zero + One,
Creates an identity matrix. If the matrix is not square, the largest square submatrix (starting at the first row and column) is set to the identity while all other entries are set to zero.
sourcepub fn from_diagonal_element(nrows: usize, elt: N) -> Selfwhere
N: Zero + One,
pub fn from_diagonal_element(nrows: usize, elt: N) -> Selfwhere
N: Zero + One,
Creates a matrix filled with its diagonal filled with elt
and all other
components set to zero.
sourcepub fn from_partial_diagonal(nrows: usize, elts: &[N]) -> Selfwhere
N: Zero,
pub fn from_partial_diagonal(nrows: usize, elts: &[N]) -> Selfwhere
N: Zero,
Creates a new matrix that may be rectangular. The first elts.len()
diagonal
elements are filled with the content of elts
. Others are set to 0.
Panics if elts.len()
is larger than the minimum among nrows
and ncols
.
sourcepub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
pub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
Creates a matrix filled with random values from the given distribution.
source§impl<N: Scalar, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, C>,
Standard: Distribution<N>,
impl<N: Scalar, C: DimName> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, C>,
Standard: Distribution<N>,
sourcepub fn new_random(nrows: usize) -> Self
pub fn new_random(nrows: usize) -> Self
Creates a matrix filled with random values.
source§impl<N: Scalar> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, Dynamic>,
impl<N: Scalar> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, Dynamic>,
sourcepub unsafe fn new_uninitialized(nrows: usize, ncols: usize) -> Self
pub unsafe fn new_uninitialized(nrows: usize, ncols: usize) -> Self
Creates a new uninitialized matrix.
sourcepub fn from_element(nrows: usize, ncols: usize, elem: N) -> Self
pub fn from_element(nrows: usize, ncols: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
sourcepub fn repeat(nrows: usize, ncols: usize, elem: N) -> Self
pub fn repeat(nrows: usize, ncols: usize, elem: N) -> Self
Creates a matrix with all its elements set to elem
.
Same as .from_element
.
sourcepub fn zeros(nrows: usize, ncols: usize) -> Selfwhere
N: Zero,
pub fn zeros(nrows: usize, ncols: usize) -> Selfwhere
N: Zero,
Creates a matrix with all its elements set to 0
.
sourcepub fn from_iterator<I>(nrows: usize, ncols: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
pub fn from_iterator<I>(nrows: usize, ncols: usize, iter: I) -> Selfwhere
I: IntoIterator<Item = N>,
Creates a matrix with all its elements filled by an iterator.
sourcepub fn from_row_slice(nrows: usize, ncols: usize, slice: &[N]) -> Self
pub fn from_row_slice(nrows: usize, ncols: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in row-major order.
The order of elements in the slice must follow the usual mathematic writing, i.e., row-by-row.
sourcepub fn from_column_slice(nrows: usize, ncols: usize, slice: &[N]) -> Self
pub fn from_column_slice(nrows: usize, ncols: usize, slice: &[N]) -> Self
Creates a matrix with its elements filled with the components provided by a slice in column-major order.
sourcepub fn from_fn<F>(nrows: usize, ncols: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
pub fn from_fn<F>(nrows: usize, ncols: usize, f: F) -> Selfwhere
F: FnMut(usize, usize) -> N,
Creates a matrix filled with the results of a function applied to each of its component coordinates.
sourcepub fn identity(nrows: usize, ncols: usize) -> Selfwhere
N: Zero + One,
pub fn identity(nrows: usize, ncols: usize) -> Selfwhere
N: Zero + One,
Creates an identity matrix. If the matrix is not square, the largest square submatrix (starting at the first row and column) is set to the identity while all other entries are set to zero.
sourcepub fn from_diagonal_element(nrows: usize, ncols: usize, elt: N) -> Selfwhere
N: Zero + One,
pub fn from_diagonal_element(nrows: usize, ncols: usize, elt: N) -> Selfwhere
N: Zero + One,
Creates a matrix filled with its diagonal filled with elt
and all other
components set to zero.
sourcepub fn from_partial_diagonal(nrows: usize, ncols: usize, elts: &[N]) -> Selfwhere
N: Zero,
pub fn from_partial_diagonal(nrows: usize, ncols: usize, elts: &[N]) -> Selfwhere
N: Zero,
Creates a new matrix that may be rectangular. The first elts.len()
diagonal
elements are filled with the content of elts
. Others are set to 0.
Panics if elts.len()
is larger than the minimum among nrows
and ncols
.
sourcepub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: usize,
ncols: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
pub fn from_distribution<Distr: Distribution<N> + ?Sized, G: Rng + ?Sized>(
nrows: usize,
ncols: usize,
distribution: &mut Distr,
rng: &mut G
) -> Self
Creates a matrix filled with random values from the given distribution.
source§impl<N: Scalar> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, Dynamic>,
Standard: Distribution<N>,
impl<N: Scalar> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
DefaultAllocator: Allocator<N, Dynamic, Dynamic>,
Standard: Distribution<N>,
sourcepub fn new_random(nrows: usize, ncols: usize) -> Self
pub fn new_random(nrows: usize, ncols: usize) -> Self
Creates a matrix filled with random values.
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U5>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U6>,
sourcepub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m16: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m26: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m36: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m46: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m56: N,
m61: N,
m62: N,
m63: N,
m64: N,
m65: N,
m66: N
) -> Self
pub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m16: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m26: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m36: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m46: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m56: N,
m61: N,
m62: N,
m63: N,
m64: N,
m65: N,
m66: N
) -> Self
Initializes this matrix from its components.
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U5>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U6>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U5>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U6>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U5>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U6>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U6>,
sourcepub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m16: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m26: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m36: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m46: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m56: N
) -> Self
pub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m16: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m26: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m36: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m46: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m56: N
) -> Self
Initializes this matrix from its components.
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U5>,
sourcepub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m61: N,
m62: N,
m63: N,
m64: N,
m65: N
) -> Self
pub fn new(
m11: N,
m12: N,
m13: N,
m14: N,
m15: N,
m21: N,
m22: N,
m23: N,
m24: N,
m25: N,
m31: N,
m32: N,
m33: N,
m34: N,
m35: N,
m41: N,
m42: N,
m43: N,
m44: N,
m45: N,
m51: N,
m52: N,
m53: N,
m54: N,
m55: N,
m61: N,
m62: N,
m63: N,
m64: N,
m65: N
) -> Self
Initializes this matrix from its components.
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U1>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U2>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U2>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U3>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U3>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U4>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U4>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U5>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U5>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U6>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U1, U6>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U2, U1>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U3, U1>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U4, U1>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U5, U1>,
source§impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U1>,
impl<N> Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>where
N: Scalar,
DefaultAllocator: Allocator<N, U6, U1>,
source§impl<N, R: DimName> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>where
N: Scalar + Zero + One,
DefaultAllocator: Allocator<N, R>,
impl<N, R: DimName> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>where
N: Scalar + Zero + One,
DefaultAllocator: Allocator<N, R>,
sourcepub fn x() -> Selfwhere
R::Value: Cmp<U0, Output = Greater>,
pub fn x() -> Selfwhere
R::Value: Cmp<U0, Output = Greater>,
The column vector with a 1 as its first component, and zero elsewhere.
sourcepub fn y() -> Selfwhere
R::Value: Cmp<U1, Output = Greater>,
pub fn y() -> Selfwhere
R::Value: Cmp<U1, Output = Greater>,
The column vector with a 1 as its second component, and zero elsewhere.
sourcepub fn z() -> Selfwhere
R::Value: Cmp<U2, Output = Greater>,
pub fn z() -> Selfwhere
R::Value: Cmp<U2, Output = Greater>,
The column vector with a 1 as its third component, and zero elsewhere.
sourcepub fn w() -> Selfwhere
R::Value: Cmp<U3, Output = Greater>,
pub fn w() -> Selfwhere
R::Value: Cmp<U3, Output = Greater>,
The column vector with a 1 as its fourth component, and zero elsewhere.
sourcepub fn a() -> Selfwhere
R::Value: Cmp<U4, Output = Greater>,
pub fn a() -> Selfwhere
R::Value: Cmp<U4, Output = Greater>,
The column vector with a 1 as its fifth component, and zero elsewhere.
sourcepub fn b() -> Selfwhere
R::Value: Cmp<U5, Output = Greater>,
pub fn b() -> Selfwhere
R::Value: Cmp<U5, Output = Greater>,
The column vector with a 1 as its sixth component, and zero elsewhere.
sourcepub fn x_axis() -> Unit<Self>where
R::Value: Cmp<U0, Output = Greater>,
pub fn x_axis() -> Unit<Self>where
R::Value: Cmp<U0, Output = Greater>,
The unit column vector with a 1 as its first component, and zero elsewhere.
sourcepub fn y_axis() -> Unit<Self>where
R::Value: Cmp<U1, Output = Greater>,
pub fn y_axis() -> Unit<Self>where
R::Value: Cmp<U1, Output = Greater>,
The unit column vector with a 1 as its second component, and zero elsewhere.
sourcepub fn z_axis() -> Unit<Self>where
R::Value: Cmp<U2, Output = Greater>,
pub fn z_axis() -> Unit<Self>where
R::Value: Cmp<U2, Output = Greater>,
The unit column vector with a 1 as its third component, and zero elsewhere.
sourcepub fn w_axis() -> Unit<Self>where
R::Value: Cmp<U3, Output = Greater>,
pub fn w_axis() -> Unit<Self>where
R::Value: Cmp<U3, Output = Greater>,
The unit column vector with a 1 as its fourth component, and zero elsewhere.
source§impl<'a, N: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub unsafe fn from_slice_with_strides_generic_unchecked(
data: &'a [N],
start: usize,
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
pub unsafe fn from_slice_with_strides_generic_unchecked(
data: &'a [N],
start: usize,
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
Creates, without bound-checking, a matrix slice from an array and with dimensions and strides specified by generic types instances.
This method is unsafe because the input data array is not checked to contain enough elements.
The generic types R
, C
, RStride
, CStride
can either be type-level integers or integers wrapped with Dynamic::new()
.
sourcepub fn from_slice_with_strides_generic(
data: &'a [N],
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
pub fn from_slice_with_strides_generic(
data: &'a [N],
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
Creates a matrix slice from an array and with dimensions and strides specified by generic types instances.
Panics if the input data array dose not contain enough elements.
The generic types R
, C
, RStride
, CStride
can either be type-level integers or integers wrapped with Dynamic::new()
.
source§impl<'a, N: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: Dim, C: Dim, RStride: Dim, CStride: Dim> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub unsafe fn from_slice_with_strides_generic_unchecked(
data: &'a mut [N],
start: usize,
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
pub unsafe fn from_slice_with_strides_generic_unchecked(
data: &'a mut [N],
start: usize,
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
Creates, without bound-checking, a mutable matrix slice from an array and with dimensions and strides specified by generic types instances.
This method is unsafe because the input data array is not checked to contain enough elements.
The generic types R
, C
, RStride
, CStride
can either be type-level integers or integers wrapped with Dynamic::new()
.
sourcepub fn from_slice_with_strides_generic(
data: &'a mut [N],
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
pub fn from_slice_with_strides_generic(
data: &'a mut [N],
nrows: R,
ncols: C,
rstride: RStride,
cstride: CStride
) -> Self
Creates a mutable matrix slice from an array and with dimensions and strides specified by generic types instances.
Panics if the input data array dose not contain enough elements.
The generic types R
, C
, RStride
, CStride
can either be type-level integers or integers wrapped with Dynamic::new()
.
source§impl<'a, N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub unsafe fn from_slice_generic_unchecked(
data: &'a [N],
start: usize,
nrows: R,
ncols: C
) -> Self
pub unsafe fn from_slice_generic_unchecked(
data: &'a [N],
start: usize,
nrows: R,
ncols: C
) -> Self
Creates, without bound-checking, a matrix slice from an array and with dimensions specified by generic types instances.
This method is unsafe because the input data array is not checked to contain enough elements.
The generic types R
and C
can either be type-level integers or integers wrapped with Dynamic::new()
.
sourcepub fn from_slice_generic(data: &'a [N], nrows: R, ncols: C) -> Self
pub fn from_slice_generic(data: &'a [N], nrows: R, ncols: C) -> Self
Creates a matrix slice from an array and with dimensions and strides specified by generic types instances.
Panics if the input data array dose not contain enough elements.
The generic types R
and C
can either be type-level integers or integers wrapped with Dynamic::new()
.
source§impl<'a, N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: Dim, C: Dim> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub unsafe fn from_slice_generic_unchecked(
data: &'a mut [N],
start: usize,
nrows: R,
ncols: C
) -> Self
pub unsafe fn from_slice_generic_unchecked(
data: &'a mut [N],
start: usize,
nrows: R,
ncols: C
) -> Self
Creates, without bound-checking, a mutable matrix slice from an array and with dimensions specified by generic types instances.
This method is unsafe because the input data array is not checked to contain enough elements.
The generic types R
and C
can either be type-level integers or integers wrapped with Dynamic::new()
.
sourcepub fn from_slice_generic(data: &'a mut [N], nrows: R, ncols: C) -> Self
pub fn from_slice_generic(data: &'a mut [N], nrows: R, ncols: C) -> Self
Creates a mutable matrix slice from an array and with dimensions and strides specified by generic types instances.
Panics if the input data array dose not contain enough elements.
The generic types R
and C
can either be type-level integers or integers wrapped with Dynamic::new()
.
source§impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a [N]) -> Self
pub fn from_slice(data: &'a [N]) -> Self
Creates a new matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(data: &'a [N], start: usize) -> Self
pub unsafe fn from_slice_unchecked(data: &'a [N], start: usize) -> Self
Creates, without bound checking, a new matrix slice from the given data array.
source§impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice_with_strides(
data: &'a [N],
rstride: usize,
cstride: usize
) -> Self
pub fn from_slice_with_strides(
data: &'a [N],
rstride: usize,
cstride: usize
) -> Self
Creates a new matrix slice with the specified strides from the given data array.
Panics if data
does not contain enough elements.
source§impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a [N], ncols: usize) -> Self
pub fn from_slice(data: &'a [N], ncols: usize) -> Self
Creates a new matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(
data: &'a [N],
start: usize,
ncols: usize
) -> Self
pub unsafe fn from_slice_unchecked(
data: &'a [N],
start: usize,
ncols: usize
) -> Self
Creates, without bound checking, a new matrix slice from the given data array.
source§impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
source§impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a [N], nrows: usize) -> Self
pub fn from_slice(data: &'a [N], nrows: usize) -> Self
Creates a new matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(
data: &'a [N],
start: usize,
nrows: usize
) -> Self
pub unsafe fn from_slice_unchecked(
data: &'a [N],
start: usize,
nrows: usize
) -> Self
Creates, without bound checking, a new matrix slice from the given data array.
source§impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
source§impl<'a, N: Scalar> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a [N], nrows: usize, ncols: usize) -> Self
pub fn from_slice(data: &'a [N], nrows: usize, ncols: usize) -> Self
Creates a new matrix slice from the given data array.
Panics if data
does not contain enough elements.
source§impl<'a, N: Scalar> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar> Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>
source§impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a mut [N]) -> Self
pub fn from_slice(data: &'a mut [N]) -> Self
Creates a new mutable matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(data: &'a mut [N], start: usize) -> Self
pub unsafe fn from_slice_unchecked(data: &'a mut [N], start: usize) -> Self
Creates, without bound checking, a new mutable matrix slice from the given data array.
source§impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice_with_strides_mut(
data: &'a mut [N],
rstride: usize,
cstride: usize
) -> Self
pub fn from_slice_with_strides_mut(
data: &'a mut [N],
rstride: usize,
cstride: usize
) -> Self
Creates a new mutable matrix slice with the specified strides from the given data array.
Panics if data
does not contain enough elements.
source§impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a mut [N], ncols: usize) -> Self
pub fn from_slice(data: &'a mut [N], ncols: usize) -> Self
Creates a new mutable matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(
data: &'a mut [N],
start: usize,
ncols: usize
) -> Self
pub unsafe fn from_slice_unchecked(
data: &'a mut [N],
start: usize,
ncols: usize
) -> Self
Creates, without bound checking, a new mutable matrix slice from the given data array.
source§impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, R: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
source§impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a mut [N], nrows: usize) -> Self
pub fn from_slice(data: &'a mut [N], nrows: usize) -> Self
Creates a new mutable matrix slice from the given data array.
Panics if data
does not contain enough elements.
sourcepub unsafe fn from_slice_unchecked(
data: &'a mut [N],
start: usize,
nrows: usize
) -> Self
pub unsafe fn from_slice_unchecked(
data: &'a mut [N],
start: usize,
nrows: usize
) -> Self
Creates, without bound checking, a new mutable matrix slice from the given data array.
source§impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar, C: DimName> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
source§impl<'a, N: Scalar> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
sourcepub fn from_slice(data: &'a mut [N], nrows: usize, ncols: usize) -> Self
pub fn from_slice(data: &'a mut [N], nrows: usize, ncols: usize) -> Self
Creates a new mutable matrix slice from the given data array.
Panics if data
does not contain enough elements.
source§impl<'a, N: Scalar> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
impl<'a, N: Scalar> Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>
source§impl<N: Scalar + Zero, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar + Zero, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn upper_triangle(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn upper_triangle(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Extracts the upper triangular part of this matrix (including the diagonal).
sourcepub fn lower_triangle(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn lower_triangle(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Extracts the upper triangular part of this matrix (including the diagonal).
source§impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn fill_with_identity(&mut self)where
N: Zero + One,
pub fn fill_with_identity(&mut self)where
N: Zero + One,
Fills self
with the identity matrix.
sourcepub fn fill_diagonal(&mut self, val: N)
pub fn fill_diagonal(&mut self, val: N)
Sets all the diagonal elements of this matrix to val
.
sourcepub fn fill_column(&mut self, j: usize, val: N)
pub fn fill_column(&mut self, j: usize, val: N)
Sets all the elements of the selected column to val
.
sourcepub fn set_diagonal<R2: Dim, S2>(&mut self, diag: &Vector<N, R2, S2>)where
R: DimMin<C>,
S2: Storage<N, R2>,
ShapeConstraint: DimEq<DimMinimum<R, C>, R2>,
pub fn set_diagonal<R2: Dim, S2>(&mut self, diag: &Vector<N, R2, S2>)where
R: DimMin<C>,
S2: Storage<N, R2>,
ShapeConstraint: DimEq<DimMinimum<R, C>, R2>,
Fills the diagonal of this matrix with the content of the given vector.
sourcepub fn set_row<C2: Dim, S2>(&mut self, i: usize, row: &RowVector<N, C2, S2>)where
S2: Storage<N, U1, C2>,
ShapeConstraint: SameNumberOfColumns<C, C2>,
pub fn set_row<C2: Dim, S2>(&mut self, i: usize, row: &RowVector<N, C2, S2>)where
S2: Storage<N, U1, C2>,
ShapeConstraint: SameNumberOfColumns<C, C2>,
Fills the selected row of this matrix with the content of the given vector.
sourcepub fn set_column<R2: Dim, S2>(&mut self, i: usize, column: &Vector<N, R2, S2>)where
S2: Storage<N, R2, U1>,
ShapeConstraint: SameNumberOfRows<R, R2>,
pub fn set_column<R2: Dim, S2>(&mut self, i: usize, column: &Vector<N, R2, S2>)where
S2: Storage<N, R2, U1>,
ShapeConstraint: SameNumberOfRows<R, R2>,
Fills the selected column of this matrix with the content of the given vector.
sourcepub fn fill_lower_triangle(&mut self, val: N, shift: usize)
pub fn fill_lower_triangle(&mut self, val: N, shift: usize)
Sets all the elements of the lower-triangular part of this matrix to val
.
The parameter shift
allows some subdiagonals to be left untouched:
- If
shift = 0
then the diagonal is overwritten as well. - If
shift = 1
then the diagonal is left untouched. - If
shift > 1
, then the diagonal and the firstshift - 1
subdiagonals are left untouched.
sourcepub fn fill_upper_triangle(&mut self, val: N, shift: usize)
pub fn fill_upper_triangle(&mut self, val: N, shift: usize)
Sets all the elements of the lower-triangular part of this matrix to val
.
The parameter shift
allows some superdiagonals to be left untouched:
- If
shift = 0
then the diagonal is overwritten as well. - If
shift = 1
then the diagonal is left untouched. - If
shift > 1
, then the diagonal and the firstshift - 1
superdiagonals are left untouched.
sourcepub fn swap_columns(&mut self, icol1: usize, icol2: usize)
pub fn swap_columns(&mut self, icol1: usize, icol2: usize)
Swaps two columns in-place.
source§impl<N: Scalar, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
impl<N: Scalar, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
sourcepub fn fill_lower_triangle_with_upper_triangle(&mut self)
pub fn fill_lower_triangle_with_upper_triangle(&mut self)
Copies the upper-triangle of this matrix to its lower-triangular part.
This makes the matrix symmetric. Panics if the matrix is not square.
sourcepub fn fill_upper_triangle_with_lower_triangle(&mut self)
pub fn fill_upper_triangle_with_lower_triangle(&mut self)
Copies the upper-triangle of this matrix to its upper-triangular part.
This makes the matrix symmetric. Panics if the matrix is not square.
source§impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn remove_column(self, i: usize) -> MatrixMN<N, R, DimDiff<C, U1>>where
C: DimSub<U1>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, U1>>,
pub fn remove_column(self, i: usize) -> MatrixMN<N, R, DimDiff<C, U1>>where
C: DimSub<U1>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, U1>>,
Removes the i
-th column from this matrix.
sourcepub fn remove_fixed_columns<D>(self, i: usize) -> MatrixMN<N, R, DimDiff<C, D>>where
D: DimName,
C: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, D>>,
pub fn remove_fixed_columns<D>(self, i: usize) -> MatrixMN<N, R, DimDiff<C, D>>where
D: DimName,
C: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, D>>,
Removes D::dim()
consecutive columns from this matrix, starting with the i
-th
(included).
sourcepub fn remove_columns(self, i: usize, n: usize) -> MatrixMN<N, R, Dynamic>where
C: DimSub<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, R, Dynamic>,
pub fn remove_columns(self, i: usize, n: usize) -> MatrixMN<N, R, Dynamic>where
C: DimSub<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, R, Dynamic>,
Removes n
consecutive columns from this matrix, starting with the i
-th (included).
sourcepub fn remove_columns_generic<D>(
self,
i: usize,
nremove: D
) -> MatrixMN<N, R, DimDiff<C, D>>where
D: Dim,
C: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, D>>,
pub fn remove_columns_generic<D>(
self,
i: usize,
nremove: D
) -> MatrixMN<N, R, DimDiff<C, D>>where
D: Dim,
C: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimDiff<C, D>>,
Removes nremove.value()
columns from this matrix, starting with the i
-th (included).
This is the generic implementation of .remove_columns(...)
and
.remove_fixed_columns(...)
which have nicer API interfaces.
sourcepub fn remove_row(self, i: usize) -> MatrixMN<N, DimDiff<R, U1>, C>where
R: DimSub<U1>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, U1>, C>,
pub fn remove_row(self, i: usize) -> MatrixMN<N, DimDiff<R, U1>, C>where
R: DimSub<U1>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, U1>, C>,
Removes the i
-th row from this matrix.
sourcepub fn remove_fixed_rows<D>(self, i: usize) -> MatrixMN<N, DimDiff<R, D>, C>where
D: DimName,
R: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, D>, C>,
pub fn remove_fixed_rows<D>(self, i: usize) -> MatrixMN<N, DimDiff<R, D>, C>where
D: DimName,
R: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, D>, C>,
Removes D::dim()
consecutive rows from this matrix, starting with the i
-th (included).
sourcepub fn remove_rows(self, i: usize, n: usize) -> MatrixMN<N, Dynamic, C>where
R: DimSub<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, Dynamic, C>,
pub fn remove_rows(self, i: usize, n: usize) -> MatrixMN<N, Dynamic, C>where
R: DimSub<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, Dynamic, C>,
Removes n
consecutive rows from this matrix, starting with the i
-th (included).
sourcepub fn remove_rows_generic<D>(
self,
i: usize,
nremove: D
) -> MatrixMN<N, DimDiff<R, D>, C>where
D: Dim,
R: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, D>, C>,
pub fn remove_rows_generic<D>(
self,
i: usize,
nremove: D
) -> MatrixMN<N, DimDiff<R, D>, C>where
D: Dim,
R: DimSub<D>,
DefaultAllocator: Reallocator<N, R, C, DimDiff<R, D>, C>,
Removes nremove.value()
rows from this matrix, starting with the i
-th (included).
This is the generic implementation of .remove_rows(...)
and .remove_fixed_rows(...)
which have nicer API interfaces.
sourcepub fn insert_column(self, i: usize, val: N) -> MatrixMN<N, R, DimSum<C, U1>>where
C: DimAdd<U1>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, U1>>,
pub fn insert_column(self, i: usize, val: N) -> MatrixMN<N, R, DimSum<C, U1>>where
C: DimAdd<U1>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, U1>>,
Inserts a column filled with val
at the i-th
position.
sourcepub fn insert_fixed_columns<D>(
self,
i: usize,
val: N
) -> MatrixMN<N, R, DimSum<C, D>>where
D: DimName,
C: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, D>>,
pub fn insert_fixed_columns<D>(
self,
i: usize,
val: N
) -> MatrixMN<N, R, DimSum<C, D>>where
D: DimName,
C: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, D>>,
Inserts D::dim()
columns filled with val
starting at the i-th
position.
sourcepub fn insert_columns(self, i: usize, n: usize, val: N) -> MatrixMN<N, R, Dynamic>where
C: DimAdd<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, R, Dynamic>,
pub fn insert_columns(self, i: usize, n: usize, val: N) -> MatrixMN<N, R, Dynamic>where
C: DimAdd<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, R, Dynamic>,
Inserts n
columns filled with val
starting at the i-th
position.
sourcepub unsafe fn insert_columns_generic_uninitialized<D>(
self,
i: usize,
ninsert: D
) -> MatrixMN<N, R, DimSum<C, D>>where
D: Dim,
C: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, D>>,
pub unsafe fn insert_columns_generic_uninitialized<D>(
self,
i: usize,
ninsert: D
) -> MatrixMN<N, R, DimSum<C, D>>where
D: Dim,
C: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, R, DimSum<C, D>>,
Inserts ninsert.value()
columns starting at the i-th
place of this matrix.
The added column values are not initialized.
sourcepub fn insert_row(self, i: usize, val: N) -> MatrixMN<N, DimSum<R, U1>, C>where
R: DimAdd<U1>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, U1>, C>,
pub fn insert_row(self, i: usize, val: N) -> MatrixMN<N, DimSum<R, U1>, C>where
R: DimAdd<U1>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, U1>, C>,
Inserts a row filled with val
at the i-th
position.
sourcepub fn insert_fixed_rows<D>(
self,
i: usize,
val: N
) -> MatrixMN<N, DimSum<R, D>, C>where
D: DimName,
R: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, D>, C>,
pub fn insert_fixed_rows<D>(
self,
i: usize,
val: N
) -> MatrixMN<N, DimSum<R, D>, C>where
D: DimName,
R: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, D>, C>,
Inserts D::dim()
rows filled with val
starting at the i-th
position.
sourcepub fn insert_rows(self, i: usize, n: usize, val: N) -> MatrixMN<N, Dynamic, C>where
R: DimAdd<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, Dynamic, C>,
pub fn insert_rows(self, i: usize, n: usize, val: N) -> MatrixMN<N, Dynamic, C>where
R: DimAdd<Dynamic, Output = Dynamic>,
DefaultAllocator: Reallocator<N, R, C, Dynamic, C>,
Inserts n
rows filled with val
starting at the i-th
position.
sourcepub unsafe fn insert_rows_generic_uninitialized<D>(
self,
i: usize,
ninsert: D
) -> MatrixMN<N, DimSum<R, D>, C>where
D: Dim,
R: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, D>, C>,
pub unsafe fn insert_rows_generic_uninitialized<D>(
self,
i: usize,
ninsert: D
) -> MatrixMN<N, DimSum<R, D>, C>where
D: Dim,
R: DimAdd<D>,
DefaultAllocator: Reallocator<N, R, C, DimSum<R, D>, C>,
Inserts ninsert.value()
rows at the i-th
place of this matrix.
The added rows values are not initialized.
This is the generic implementation of .insert_rows(...)
and
.insert_fixed_rows(...)
which have nicer API interfaces.
sourcepub fn resize(self, new_nrows: usize, new_ncols: usize, val: N) -> DMatrix<N>where
DefaultAllocator: Reallocator<N, R, C, Dynamic, Dynamic>,
pub fn resize(self, new_nrows: usize, new_ncols: usize, val: N) -> DMatrix<N>where
DefaultAllocator: Reallocator<N, R, C, Dynamic, Dynamic>,
Resizes this matrix so that it contains new_nrows
rows and new_ncols
columns.
The values are copied such that self[(i, j)] == result[(i, j)]
. If the result has more
rows and/or columns than self
, then the extra rows or columns are filled with val
.
sourcepub fn fixed_resize<R2: DimName, C2: DimName>(
self,
val: N
) -> MatrixMN<N, R2, C2>where
DefaultAllocator: Reallocator<N, R, C, R2, C2>,
pub fn fixed_resize<R2: DimName, C2: DimName>(
self,
val: N
) -> MatrixMN<N, R2, C2>where
DefaultAllocator: Reallocator<N, R, C, R2, C2>,
Resizes this matrix so that it contains R2::value()
rows and C2::value()
columns.
The values are copied such that self[(i, j)] == result[(i, j)]
. If the result has more
rows and/or columns than self
, then the extra rows or columns are filled with val
.
sourcepub fn resize_generic<R2: Dim, C2: Dim>(
self,
new_nrows: R2,
new_ncols: C2,
val: N
) -> MatrixMN<N, R2, C2>where
DefaultAllocator: Reallocator<N, R, C, R2, C2>,
pub fn resize_generic<R2: Dim, C2: Dim>(
self,
new_nrows: R2,
new_ncols: C2,
val: N
) -> MatrixMN<N, R2, C2>where
DefaultAllocator: Reallocator<N, R, C, R2, C2>,
Resizes self
such that it has dimensions new_nrows × now_ncols
.
The values are copied such that self[(i, j)] == result[(i, j)]
. If the result has more
rows and/or columns than self
, then the extra rows or columns are filled with val
.
source§impl<N: Scalar, R: Dim, C: Dim, S> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S> Matrix<N, R, C, S>
sourcepub unsafe fn from_data_statically_unchecked(data: S) -> Matrix<N, R, C, S>
pub unsafe fn from_data_statically_unchecked(data: S) -> Matrix<N, R, C, S>
Creates a new matrix with the given data without statically checking that the matrix dimension matches the storage dimension.
source§impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn shape(&self) -> (usize, usize)
pub fn shape(&self) -> (usize, usize)
The shape of this matrix returned as the tuple (number of rows, number of columns).
sourcepub fn strides(&self) -> (usize, usize)
pub fn strides(&self) -> (usize, usize)
The strides (row stride, column stride) of this matrix.
sourcepub fn iter(&self) -> MatrixIter<'_, N, R, C, S> ⓘ
pub fn iter(&self) -> MatrixIter<'_, N, R, C, S> ⓘ
Iterates through this matrix coordinates.
sourcepub fn vector_to_matrix_index(&self, i: usize) -> (usize, usize)
pub fn vector_to_matrix_index(&self, i: usize) -> (usize, usize)
Computes the row and column coordinates of the i-th element of this matrix seen as a vector.
sourcepub unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &N
pub unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &N
Gets a reference to the element of this matrix at row irow
and column icol
without
bound-checking.
sourcepub fn relative_eq<R2, C2, SB>(
&self,
other: &Matrix<N, R2, C2, SB>,
eps: N::Epsilon,
max_relative: N::Epsilon
) -> boolwhere
N: RelativeEq,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
N::Epsilon: Copy,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn relative_eq<R2, C2, SB>(
&self,
other: &Matrix<N, R2, C2, SB>,
eps: N::Epsilon,
max_relative: N::Epsilon
) -> boolwhere
N: RelativeEq,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
N::Epsilon: Copy,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
Tests whether self
and rhs
are equal up to a given epsilon.
See relative_eq
from the RelativeEq
trait for more details.
sourcepub fn eq<R2, C2, SB>(&self, other: &Matrix<N, R2, C2, SB>) -> boolwhere
N: PartialEq,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn eq<R2, C2, SB>(&self, other: &Matrix<N, R2, C2, SB>) -> boolwhere
N: PartialEq,
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
Tests whether self
and rhs
are exactly equal.
sourcepub fn into_owned(self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn into_owned(self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Moves this matrix into one that owns its data.
sourcepub fn into_owned_sum<R2, C2>(self) -> MatrixSum<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn into_owned_sum<R2, C2>(self) -> MatrixSum<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
Moves this matrix into one that owns its data. The actual type of the result depends on matrix storage combination rules for addition.
sourcepub fn clone_owned(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn clone_owned(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Clones this matrix to one that owns its data.
sourcepub fn clone_owned_sum<R2, C2>(&self) -> MatrixSum<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn clone_owned_sum<R2, C2>(&self) -> MatrixSum<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
Clones this matrix into one that owns its data. The actual type of the result depends on matrix storage combination rules for addition.
sourcepub fn map<N2: Scalar, F: FnMut(N) -> N2>(&self, f: F) -> MatrixMN<N2, R, C>where
DefaultAllocator: Allocator<N2, R, C>,
pub fn map<N2: Scalar, F: FnMut(N) -> N2>(&self, f: F) -> MatrixMN<N2, R, C>where
DefaultAllocator: Allocator<N2, R, C>,
Returns a matrix containing the result of f
applied to each of its entries.
sourcepub fn map_with_location<N2: Scalar, F: FnMut(usize, usize, N) -> N2>(
&self,
f: F
) -> MatrixMN<N2, R, C>where
DefaultAllocator: Allocator<N2, R, C>,
pub fn map_with_location<N2: Scalar, F: FnMut(usize, usize, N) -> N2>(
&self,
f: F
) -> MatrixMN<N2, R, C>where
DefaultAllocator: Allocator<N2, R, C>,
Returns a matrix containing the result of f
applied to each of its entries. Unlike map
,
f
also gets passed the row and column index, i.e. f(value, row, col)
.
sourcepub fn zip_map<N2, N3, S2, F>(
&self,
rhs: &Matrix<N2, R, C, S2>,
f: F
) -> MatrixMN<N3, R, C>where
N2: Scalar,
N3: Scalar,
S2: Storage<N2, R, C>,
F: FnMut(N, N2) -> N3,
DefaultAllocator: Allocator<N3, R, C>,
pub fn zip_map<N2, N3, S2, F>(
&self,
rhs: &Matrix<N2, R, C, S2>,
f: F
) -> MatrixMN<N3, R, C>where
N2: Scalar,
N3: Scalar,
S2: Storage<N2, R, C>,
F: FnMut(N, N2) -> N3,
DefaultAllocator: Allocator<N3, R, C>,
Returns a matrix containing the result of f
applied to each entries of self
and
rhs
.
sourcepub fn zip_zip_map<N2, N3, N4, S2, S3, F>(
&self,
b: &Matrix<N2, R, C, S2>,
c: &Matrix<N3, R, C, S3>,
f: F
) -> MatrixMN<N4, R, C>where
N2: Scalar,
N3: Scalar,
N4: Scalar,
S2: Storage<N2, R, C>,
S3: Storage<N3, R, C>,
F: FnMut(N, N2, N3) -> N4,
DefaultAllocator: Allocator<N4, R, C>,
pub fn zip_zip_map<N2, N3, N4, S2, S3, F>(
&self,
b: &Matrix<N2, R, C, S2>,
c: &Matrix<N3, R, C, S3>,
f: F
) -> MatrixMN<N4, R, C>where
N2: Scalar,
N3: Scalar,
N4: Scalar,
S2: Storage<N2, R, C>,
S3: Storage<N3, R, C>,
F: FnMut(N, N2, N3) -> N4,
DefaultAllocator: Allocator<N4, R, C>,
Returns a matrix containing the result of f
applied to each entries of self
and
b
, and c
.
sourcepub fn transpose_to<R2, C2, SB>(&self, out: &mut Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, C2> + SameNumberOfColumns<C, R2>,
pub fn transpose_to<R2, C2, SB>(&self, out: &mut Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, C2> + SameNumberOfColumns<C, R2>,
Transposes self
and store the result into out
.
sourcepub fn transpose(&self) -> MatrixMN<N, C, R>where
DefaultAllocator: Allocator<N, C, R>,
pub fn transpose(&self) -> MatrixMN<N, C, R>where
DefaultAllocator: Allocator<N, C, R>,
Transposes self
.
source§impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn iter_mut(&mut self) -> MatrixIterMut<'_, N, R, C, S> ⓘ
pub fn iter_mut(&mut self) -> MatrixIterMut<'_, N, R, C, S> ⓘ
Mutably iterates through this matrix coordinates.
sourcepub unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut N
pub unsafe fn get_unchecked_mut(&mut self, irow: usize, icol: usize) -> &mut N
Gets a mutable reference to the i-th element of this matrix.
sourcepub unsafe fn swap_unchecked(
&mut self,
row_cols1: (usize, usize),
row_cols2: (usize, usize)
)
pub unsafe fn swap_unchecked(
&mut self,
row_cols1: (usize, usize),
row_cols2: (usize, usize)
)
Swaps two entries without bound-checking.
sourcepub fn swap(&mut self, row_cols1: (usize, usize), row_cols2: (usize, usize))
pub fn swap(&mut self, row_cols1: (usize, usize), row_cols2: (usize, usize))
Swaps two entries.
sourcepub fn copy_from_slice(&mut self, slice: &[N])
pub fn copy_from_slice(&mut self, slice: &[N])
Fills this matrix with the content of a slice. Both must hold the same number of elements.
The components of the slice are assumed to be ordered in column-major order.
sourcepub fn copy_from<R2, C2, SB>(&mut self, other: &Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn copy_from<R2, C2, SB>(&mut self, other: &Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
Fills this matrix with the content of another one. Both must have the same shape.
sourcepub fn tr_copy_from<R2, C2, SB>(&mut self, other: &Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: DimEq<R, C2> + SameNumberOfColumns<C, R2>,
pub fn tr_copy_from<R2, C2, SB>(&mut self, other: &Matrix<N, R2, C2, SB>)where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: DimEq<R, C2> + SameNumberOfColumns<C, R2>,
Fills this matrix with the content of the transpose another one.
sourcepub fn apply<F: FnMut(N) -> N>(&mut self, f: F)where
DefaultAllocator: Allocator<N, R, C>,
pub fn apply<F: FnMut(N) -> N>(&mut self, f: F)where
DefaultAllocator: Allocator<N, R, C>,
Replaces each component of self
by the result of a closure f
applied on it.
source§impl<N: Scalar, D: Dim, S: Storage<N, D>> Matrix<N, D, U1, S>
impl<N: Scalar, D: Dim, S: Storage<N, D>> Matrix<N, D, U1, S>
sourcepub unsafe fn vget_unchecked(&self, i: usize) -> &N
pub unsafe fn vget_unchecked(&self, i: usize) -> &N
Gets a reference to the i-th element of this column vector without bound checking.
source§impl<N: Scalar, D: Dim, S: StorageMut<N, D>> Matrix<N, D, U1, S>
impl<N: Scalar, D: Dim, S: StorageMut<N, D>> Matrix<N, D, U1, S>
sourcepub unsafe fn vget_unchecked_mut(&mut self, i: usize) -> &mut N
pub unsafe fn vget_unchecked_mut(&mut self, i: usize) -> &mut N
Gets a mutable reference to the i-th element of this column vector without bound checking.
source§impl<N: Scalar, R: Dim, C: Dim, S: ContiguousStorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: ContiguousStorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn as_mut_slice(&mut self) -> &mut [N] ⓘ
pub fn as_mut_slice(&mut self) -> &mut [N] ⓘ
Extracts a mutable slice containing the entire matrix entries ordered column-by-columns.
source§impl<N: Scalar, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
impl<N: Scalar, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
sourcepub fn transpose_mut(&mut self)
pub fn transpose_mut(&mut self)
Transposes the square matrix self
in-place.
source§impl<N: Real, R: Dim, C: Dim, S: Storage<Complex<N>, R, C>> Matrix<Complex<N>, R, C, S>
impl<N: Real, R: Dim, C: Dim, S: Storage<Complex<N>, R, C>> Matrix<Complex<N>, R, C, S>
sourcepub fn conjugate_transpose_to<R2, C2, SB>(
&self,
out: &mut Matrix<Complex<N>, R2, C2, SB>
)where
R2: Dim,
C2: Dim,
SB: StorageMut<Complex<N>, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, C2> + SameNumberOfColumns<C, R2>,
pub fn conjugate_transpose_to<R2, C2, SB>(
&self,
out: &mut Matrix<Complex<N>, R2, C2, SB>
)where
R2: Dim,
C2: Dim,
SB: StorageMut<Complex<N>, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, C2> + SameNumberOfColumns<C, R2>,
Takes the conjugate and transposes self
and store the result into out
.
sourcepub fn conjugate_transpose(&self) -> MatrixMN<Complex<N>, C, R>where
DefaultAllocator: Allocator<Complex<N>, C, R>,
pub fn conjugate_transpose(&self) -> MatrixMN<Complex<N>, C, R>where
DefaultAllocator: Allocator<Complex<N>, C, R>,
The conjugate transposition of self
.
source§impl<N: Real, D: Dim, S: StorageMut<Complex<N>, D, D>> Matrix<Complex<N>, D, D, S>
impl<N: Real, D: Dim, S: StorageMut<Complex<N>, D, D>> Matrix<Complex<N>, D, D, S>
sourcepub fn conjugate_transpose_mut(&mut self)
pub fn conjugate_transpose_mut(&mut self)
Sets self
to its conjugate transpose.
source§impl<N: Scalar + Zero, D: DimAdd<U1>, S: Storage<N, D>> Matrix<N, D, U1, S>
impl<N: Scalar + Zero, D: DimAdd<U1>, S: Storage<N, D>> Matrix<N, D, U1, S>
sourcepub fn to_homogeneous(&self) -> VectorN<N, DimSum<D, U1>>where
DefaultAllocator: Allocator<N, DimSum<D, U1>>,
pub fn to_homogeneous(&self) -> VectorN<N, DimSum<D, U1>>where
DefaultAllocator: Allocator<N, DimSum<D, U1>>,
Computes the coordinates in projective space of this vector, i.e., appends a 0
to its
coordinates.
sourcepub fn from_homogeneous<SB>(
v: Vector<N, DimSum<D, U1>, SB>
) -> Option<VectorN<N, D>>where
SB: Storage<N, DimSum<D, U1>>,
DefaultAllocator: Allocator<N, D>,
pub fn from_homogeneous<SB>(
v: Vector<N, DimSum<D, U1>, SB>
) -> Option<VectorN<N, D>>where
SB: Storage<N, DimSum<D, U1>>,
DefaultAllocator: Allocator<N, D>,
Constructs a vector from coordinates in projective space, i.e., removes a 0
at the end of
self
. Returns None
if this last component is not zero.
source§impl<N: Scalar + Ring, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar + Ring, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn perp<R2, C2, SB>(&self, b: &Matrix<N, R2, C2, SB>) -> Nwhere
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, U2> + SameNumberOfColumns<C, U1> + SameNumberOfRows<R2, U2> + SameNumberOfColumns<C2, U1>,
pub fn perp<R2, C2, SB>(&self, b: &Matrix<N, R2, C2, SB>) -> Nwhere
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, U2> + SameNumberOfColumns<C, U1> + SameNumberOfRows<R2, U2> + SameNumberOfColumns<C2, U1>,
The perpendicular product between two 2D column vectors, i.e. a.x * b.y - a.y * b.x
.
sourcepub fn cross<R2, C2, SB>(
&self,
b: &Matrix<N, R2, C2, SB>
) -> MatrixCross<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
pub fn cross<R2, C2, SB>(
&self,
b: &Matrix<N, R2, C2, SB>
) -> MatrixCross<N, R, C, R2, C2>where
R2: Dim,
C2: Dim,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R, C, R2, C2>,
ShapeConstraint: SameNumberOfRows<R, R2> + SameNumberOfColumns<C, C2>,
The 3D cross product between two vectors.
Panics if the shape is not 3D vector. In the future, this will be implemented only for dynamically-sized matrices and statically-sized 3D matrices.
source§impl<N: Real, S: Storage<N, U3>> Matrix<N, D, U1, S>where
DefaultAllocator: Allocator<N, U3>,
impl<N: Real, S: Storage<N, U3>> Matrix<N, D, U1, S>where
DefaultAllocator: Allocator<N, U3>,
sourcepub fn cross_matrix(&self) -> MatrixN<N, U3>
pub fn cross_matrix(&self) -> MatrixN<N, U3>
Computes the matrix M
such that for all vector v
we have M * v == self.cross(&v)
.
source§impl<N: Real, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Real, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn norm_squared(&self) -> N
pub fn norm_squared(&self) -> N
The squared L2 norm of this vector.
sourcepub fn magnitude(&self) -> N
pub fn magnitude(&self) -> N
A synonym for the norm of this matrix.
Aka the length.
This function is simply implemented as a call to norm()
sourcepub fn magnitude_squared(&self) -> N
pub fn magnitude_squared(&self) -> N
A synonym for the squared norm of this matrix.
Aka the squared length.
This function is simply implemented as a call to norm_squared()
sourcepub fn normalize(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
pub fn normalize(&self) -> MatrixMN<N, R, C>where
DefaultAllocator: Allocator<N, R, C>,
Returns a normalized version of this matrix.
sourcepub fn try_normalize(&self, min_norm: N) -> Option<MatrixMN<N, R, C>>where
DefaultAllocator: Allocator<N, R, C>,
pub fn try_normalize(&self, min_norm: N) -> Option<MatrixMN<N, R, C>>where
DefaultAllocator: Allocator<N, R, C>,
Returns a normalized version of this matrix unless its norm as smaller or equal to eps
.
source§impl<N: Real, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Real, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn normalize_mut(&mut self) -> N
pub fn normalize_mut(&mut self) -> N
Normalizes this matrix in-place and returns its norm.
sourcepub fn try_normalize_mut(&mut self, min_norm: N) -> Option<N>
pub fn try_normalize_mut(&mut self, min_norm: N) -> Option<N>
Normalizes this matrix in-place or does nothing if its norm is smaller or equal to eps
.
If the normalization succeeded, returns the old normal of this matrix.
source§impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn row(&self, i: usize) -> MatrixSlice<'_, N, U1, C, S::RStride, S::CStride>
pub fn row(&self, i: usize) -> MatrixSlice<'_, N, U1, C, S::RStride, S::CStride>
Returns a slice containing the i-th row of this matrix.
sourcepub fn row_part(
&self,
i: usize,
n: usize
) -> MatrixSlice<'_, N, U1, Dynamic, S::RStride, S::CStride>
pub fn row_part(
&self,
i: usize,
n: usize
) -> MatrixSlice<'_, N, U1, Dynamic, S::RStride, S::CStride>
Returns a slice containing the n
first elements of the i-th row of this matrix.
sourcepub fn rows(
&self,
first_row: usize,
nrows: usize
) -> MatrixSlice<'_, N, Dynamic, C, S::RStride, S::CStride>
pub fn rows(
&self,
first_row: usize,
nrows: usize
) -> MatrixSlice<'_, N, Dynamic, C, S::RStride, S::CStride>
Extracts from this matrix a set of consecutive rows.
sourcepub fn rows_with_step(
&self,
first_row: usize,
nrows: usize,
step: usize
) -> MatrixSlice<'_, N, Dynamic, C, Dynamic, S::CStride>
pub fn rows_with_step(
&self,
first_row: usize,
nrows: usize,
step: usize
) -> MatrixSlice<'_, N, Dynamic, C, Dynamic, S::CStride>
Extracts from this matrix a set of consecutive rows regularly skipping step
rows.
sourcepub fn fixed_rows<RSlice: DimName>(
&self,
first_row: usize
) -> MatrixSlice<'_, N, RSlice, C, S::RStride, S::CStride>
pub fn fixed_rows<RSlice: DimName>(
&self,
first_row: usize
) -> MatrixSlice<'_, N, RSlice, C, S::RStride, S::CStride>
Extracts a compile-time number of consecutive rows from this matrix.
sourcepub fn fixed_rows_with_step<RSlice: DimName>(
&self,
first_row: usize,
step: usize
) -> MatrixSlice<'_, N, RSlice, C, Dynamic, S::CStride>
pub fn fixed_rows_with_step<RSlice: DimName>(
&self,
first_row: usize,
step: usize
) -> MatrixSlice<'_, N, RSlice, C, Dynamic, S::CStride>
Extracts from this matrix a compile-time number of rows regularly skipping step
rows.
sourcepub fn rows_generic<RSlice: Dim>(
&self,
row_start: usize,
nrows: RSlice
) -> MatrixSlice<'_, N, RSlice, C, S::RStride, S::CStride>
pub fn rows_generic<RSlice: Dim>(
&self,
row_start: usize,
nrows: RSlice
) -> MatrixSlice<'_, N, RSlice, C, S::RStride, S::CStride>
Extracts from this matrix nrows
rows regularly skipping step
rows. Both
argument may or may not be values known at compile-time.
sourcepub fn rows_generic_with_step<RSlice>(
&self,
row_start: usize,
nrows: RSlice,
step: usize
) -> MatrixSlice<'_, N, RSlice, C, Dynamic, S::CStride>where
RSlice: Dim,
pub fn rows_generic_with_step<RSlice>(
&self,
row_start: usize,
nrows: RSlice,
step: usize
) -> MatrixSlice<'_, N, RSlice, C, Dynamic, S::CStride>where
RSlice: Dim,
Extracts from this matrix nrows
rows regularly skipping step
rows. Both
argument may or may not be values known at compile-time.
sourcepub fn column(
&self,
i: usize
) -> MatrixSlice<'_, N, R, U1, S::RStride, S::CStride>
pub fn column(
&self,
i: usize
) -> MatrixSlice<'_, N, R, U1, S::RStride, S::CStride>
Returns a slice containing the i-th column of this matrix.
sourcepub fn column_part(
&self,
i: usize,
n: usize
) -> MatrixSlice<'_, N, Dynamic, U1, S::RStride, S::CStride>
pub fn column_part(
&self,
i: usize,
n: usize
) -> MatrixSlice<'_, N, Dynamic, U1, S::RStride, S::CStride>
Returns a slice containing the n
first elements of the i-th column of this matrix.
sourcepub fn columns(
&self,
first_col: usize,
ncols: usize
) -> MatrixSlice<'_, N, R, Dynamic, S::RStride, S::CStride>
pub fn columns(
&self,
first_col: usize,
ncols: usize
) -> MatrixSlice<'_, N, R, Dynamic, S::RStride, S::CStride>
Extracts from this matrix a set of consecutive columns.
sourcepub fn columns_with_step(
&self,
first_col: usize,
ncols: usize,
step: usize
) -> MatrixSlice<'_, N, R, Dynamic, S::RStride, Dynamic>
pub fn columns_with_step(
&self,
first_col: usize,
ncols: usize,
step: usize
) -> MatrixSlice<'_, N, R, Dynamic, S::RStride, Dynamic>
Extracts from this matrix a set of consecutive columns regularly skipping step
columns.
sourcepub fn fixed_columns<CSlice: DimName>(
&self,
first_col: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, S::CStride>
pub fn fixed_columns<CSlice: DimName>(
&self,
first_col: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, S::CStride>
Extracts a compile-time number of consecutive columns from this matrix.
sourcepub fn fixed_columns_with_step<CSlice: DimName>(
&self,
first_col: usize,
step: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, Dynamic>
pub fn fixed_columns_with_step<CSlice: DimName>(
&self,
first_col: usize,
step: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, Dynamic>
Extracts from this matrix a compile-time number of columns regularly skipping
step
columns.
sourcepub fn columns_generic<CSlice: Dim>(
&self,
first_col: usize,
ncols: CSlice
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, S::CStride>
pub fn columns_generic<CSlice: Dim>(
&self,
first_col: usize,
ncols: CSlice
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, S::CStride>
Extracts from this matrix ncols
columns. The number of columns may or may not be
known at compile-time.
sourcepub fn columns_generic_with_step<CSlice: Dim>(
&self,
first_col: usize,
ncols: CSlice,
step: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, Dynamic>
pub fn columns_generic_with_step<CSlice: Dim>(
&self,
first_col: usize,
ncols: CSlice,
step: usize
) -> MatrixSlice<'_, N, R, CSlice, S::RStride, Dynamic>
Extracts from this matrix ncols
columns skipping step
columns. Both argument may
or may not be values known at compile-time.
sourcepub fn slice(
&self,
start: (usize, usize),
shape: (usize, usize)
) -> MatrixSlice<'_, N, Dynamic, Dynamic, S::RStride, S::CStride>
pub fn slice(
&self,
start: (usize, usize),
shape: (usize, usize)
) -> MatrixSlice<'_, N, Dynamic, Dynamic, S::RStride, S::CStride>
Slices this matrix starting at its component (irow, icol)
and with (nrows, ncols)
consecutive elements.
sourcepub fn slice_with_steps(
&self,
start: (usize, usize),
shape: (usize, usize),
steps: (usize, usize)
) -> MatrixSlice<'_, N, Dynamic, Dynamic, Dynamic, Dynamic>
pub fn slice_with_steps(
&self,
start: (usize, usize),
shape: (usize, usize),
steps: (usize, usize)
) -> MatrixSlice<'_, N, Dynamic, Dynamic, Dynamic, Dynamic>
Slices this matrix starting at its component (start.0, start.1)
and with
(shape.0, shape.1)
components. Each row (resp. column) of the sliced matrix is
separated by steps.0
(resp. steps.1
) ignored rows (resp. columns) of the
original matrix.
sourcepub fn fixed_slice<RSlice, CSlice>(
&self,
irow: usize,
icol: usize
) -> MatrixSlice<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: DimName,
CSlice: DimName,
pub fn fixed_slice<RSlice, CSlice>(
&self,
irow: usize,
icol: usize
) -> MatrixSlice<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: DimName,
CSlice: DimName,
Slices this matrix starting at its component (irow, icol)
and with (R::dim(), CSlice::dim())
consecutive components.
sourcepub fn fixed_slice_with_steps<RSlice, CSlice>(
&self,
start: (usize, usize),
steps: (usize, usize)
) -> MatrixSlice<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: DimName,
CSlice: DimName,
pub fn fixed_slice_with_steps<RSlice, CSlice>(
&self,
start: (usize, usize),
steps: (usize, usize)
) -> MatrixSlice<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: DimName,
CSlice: DimName,
Slices this matrix starting at its component (start.0, start.1)
and with
(R::dim(), CSlice::dim())
components. Each row (resp. column) of the sliced
matrix is separated by steps.0
(resp. steps.1
) ignored rows (resp. columns) of
the original matrix.
sourcepub fn generic_slice<RSlice, CSlice>(
&self,
start: (usize, usize),
shape: (RSlice, CSlice)
) -> MatrixSlice<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: Dim,
CSlice: Dim,
pub fn generic_slice<RSlice, CSlice>(
&self,
start: (usize, usize),
shape: (RSlice, CSlice)
) -> MatrixSlice<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: Dim,
CSlice: Dim,
Creates a slice that may or may not have a fixed size and stride.
sourcepub fn generic_slice_with_steps<RSlice, CSlice>(
&self,
start: (usize, usize),
shape: (RSlice, CSlice),
steps: (usize, usize)
) -> MatrixSlice<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: Dim,
CSlice: Dim,
pub fn generic_slice_with_steps<RSlice, CSlice>(
&self,
start: (usize, usize),
shape: (RSlice, CSlice),
steps: (usize, usize)
) -> MatrixSlice<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: Dim,
CSlice: Dim,
Creates a slice that may or may not have a fixed size and stride.
sourcepub fn rows_range_pair<Range1: SliceRange<R>, Range2: SliceRange<R>>(
&self,
r1: Range1,
r2: Range2
) -> (MatrixSlice<'_, N, Range1::Size, C, S::RStride, S::CStride>, MatrixSlice<'_, N, Range2::Size, C, S::RStride, S::CStride>)
pub fn rows_range_pair<Range1: SliceRange<R>, Range2: SliceRange<R>>(
&self,
r1: Range1,
r2: Range2
) -> (MatrixSlice<'_, N, Range1::Size, C, S::RStride, S::CStride>, MatrixSlice<'_, N, Range2::Size, C, S::RStride, S::CStride>)
Splits this NxM matrix into two parts delimited by two ranges.
Panics if the ranges overlap or if the first range is empty.
sourcepub fn columns_range_pair<Range1: SliceRange<C>, Range2: SliceRange<C>>(
&self,
r1: Range1,
r2: Range2
) -> (MatrixSlice<'_, N, R, Range1::Size, S::RStride, S::CStride>, MatrixSlice<'_, N, R, Range2::Size, S::RStride, S::CStride>)
pub fn columns_range_pair<Range1: SliceRange<C>, Range2: SliceRange<C>>(
&self,
r1: Range1,
r2: Range2
) -> (MatrixSlice<'_, N, R, Range1::Size, S::RStride, S::CStride>, MatrixSlice<'_, N, R, Range2::Size, S::RStride, S::CStride>)
Splits this NxM matrix into two parts delimited by two ranges.
Panics if the ranges overlap or if the first range is empty.
source§impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn row_mut(
&mut self,
i: usize
) -> MatrixSliceMut<'_, N, U1, C, S::RStride, S::CStride>
pub fn row_mut(
&mut self,
i: usize
) -> MatrixSliceMut<'_, N, U1, C, S::RStride, S::CStride>
Returns a slice containing the i-th row of this matrix.
sourcepub fn row_part_mut(
&mut self,
i: usize,
n: usize
) -> MatrixSliceMut<'_, N, U1, Dynamic, S::RStride, S::CStride>
pub fn row_part_mut(
&mut self,
i: usize,
n: usize
) -> MatrixSliceMut<'_, N, U1, Dynamic, S::RStride, S::CStride>
Returns a slice containing the n
first elements of the i-th row of this matrix.
sourcepub fn rows_mut(
&mut self,
first_row: usize,
nrows: usize
) -> MatrixSliceMut<'_, N, Dynamic, C, S::RStride, S::CStride>
pub fn rows_mut(
&mut self,
first_row: usize,
nrows: usize
) -> MatrixSliceMut<'_, N, Dynamic, C, S::RStride, S::CStride>
Extracts from this matrix a set of consecutive rows.
sourcepub fn rows_with_step_mut(
&mut self,
first_row: usize,
nrows: usize,
step: usize
) -> MatrixSliceMut<'_, N, Dynamic, C, Dynamic, S::CStride>
pub fn rows_with_step_mut(
&mut self,
first_row: usize,
nrows: usize,
step: usize
) -> MatrixSliceMut<'_, N, Dynamic, C, Dynamic, S::CStride>
Extracts from this matrix a set of consecutive rows regularly skipping step
rows.
sourcepub fn fixed_rows_mut<RSlice: DimName>(
&mut self,
first_row: usize
) -> MatrixSliceMut<'_, N, RSlice, C, S::RStride, S::CStride>
pub fn fixed_rows_mut<RSlice: DimName>(
&mut self,
first_row: usize
) -> MatrixSliceMut<'_, N, RSlice, C, S::RStride, S::CStride>
Extracts a compile-time number of consecutive rows from this matrix.
sourcepub fn fixed_rows_with_step_mut<RSlice: DimName>(
&mut self,
first_row: usize,
step: usize
) -> MatrixSliceMut<'_, N, RSlice, C, Dynamic, S::CStride>
pub fn fixed_rows_with_step_mut<RSlice: DimName>(
&mut self,
first_row: usize,
step: usize
) -> MatrixSliceMut<'_, N, RSlice, C, Dynamic, S::CStride>
Extracts from this matrix a compile-time number of rows regularly skipping step
rows.
sourcepub fn rows_generic_mut<RSlice: Dim>(
&mut self,
row_start: usize,
nrows: RSlice
) -> MatrixSliceMut<'_, N, RSlice, C, S::RStride, S::CStride>
pub fn rows_generic_mut<RSlice: Dim>(
&mut self,
row_start: usize,
nrows: RSlice
) -> MatrixSliceMut<'_, N, RSlice, C, S::RStride, S::CStride>
Extracts from this matrix nrows
rows regularly skipping step
rows. Both
argument may or may not be values known at compile-time.
sourcepub fn rows_generic_with_step_mut<RSlice>(
&mut self,
row_start: usize,
nrows: RSlice,
step: usize
) -> MatrixSliceMut<'_, N, RSlice, C, Dynamic, S::CStride>where
RSlice: Dim,
pub fn rows_generic_with_step_mut<RSlice>(
&mut self,
row_start: usize,
nrows: RSlice,
step: usize
) -> MatrixSliceMut<'_, N, RSlice, C, Dynamic, S::CStride>where
RSlice: Dim,
Extracts from this matrix nrows
rows regularly skipping step
rows. Both
argument may or may not be values known at compile-time.
sourcepub fn column_mut(
&mut self,
i: usize
) -> MatrixSliceMut<'_, N, R, U1, S::RStride, S::CStride>
pub fn column_mut(
&mut self,
i: usize
) -> MatrixSliceMut<'_, N, R, U1, S::RStride, S::CStride>
Returns a slice containing the i-th column of this matrix.
sourcepub fn column_part_mut(
&mut self,
i: usize,
n: usize
) -> MatrixSliceMut<'_, N, Dynamic, U1, S::RStride, S::CStride>
pub fn column_part_mut(
&mut self,
i: usize,
n: usize
) -> MatrixSliceMut<'_, N, Dynamic, U1, S::RStride, S::CStride>
Returns a slice containing the n
first elements of the i-th column of this matrix.
sourcepub fn columns_mut(
&mut self,
first_col: usize,
ncols: usize
) -> MatrixSliceMut<'_, N, R, Dynamic, S::RStride, S::CStride>
pub fn columns_mut(
&mut self,
first_col: usize,
ncols: usize
) -> MatrixSliceMut<'_, N, R, Dynamic, S::RStride, S::CStride>
Extracts from this matrix a set of consecutive columns.
sourcepub fn columns_with_step_mut(
&mut self,
first_col: usize,
ncols: usize,
step: usize
) -> MatrixSliceMut<'_, N, R, Dynamic, S::RStride, Dynamic>
pub fn columns_with_step_mut(
&mut self,
first_col: usize,
ncols: usize,
step: usize
) -> MatrixSliceMut<'_, N, R, Dynamic, S::RStride, Dynamic>
Extracts from this matrix a set of consecutive columns regularly skipping step
columns.
sourcepub fn fixed_columns_mut<CSlice: DimName>(
&mut self,
first_col: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, S::CStride>
pub fn fixed_columns_mut<CSlice: DimName>(
&mut self,
first_col: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, S::CStride>
Extracts a compile-time number of consecutive columns from this matrix.
sourcepub fn fixed_columns_with_step_mut<CSlice: DimName>(
&mut self,
first_col: usize,
step: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, Dynamic>
pub fn fixed_columns_with_step_mut<CSlice: DimName>(
&mut self,
first_col: usize,
step: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, Dynamic>
Extracts from this matrix a compile-time number of columns regularly skipping
step
columns.
sourcepub fn columns_generic_mut<CSlice: Dim>(
&mut self,
first_col: usize,
ncols: CSlice
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, S::CStride>
pub fn columns_generic_mut<CSlice: Dim>(
&mut self,
first_col: usize,
ncols: CSlice
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, S::CStride>
Extracts from this matrix ncols
columns. The number of columns may or may not be
known at compile-time.
sourcepub fn columns_generic_with_step_mut<CSlice: Dim>(
&mut self,
first_col: usize,
ncols: CSlice,
step: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, Dynamic>
pub fn columns_generic_with_step_mut<CSlice: Dim>(
&mut self,
first_col: usize,
ncols: CSlice,
step: usize
) -> MatrixSliceMut<'_, N, R, CSlice, S::RStride, Dynamic>
Extracts from this matrix ncols
columns skipping step
columns. Both argument may
or may not be values known at compile-time.
sourcepub fn slice_mut(
&mut self,
start: (usize, usize),
shape: (usize, usize)
) -> MatrixSliceMut<'_, N, Dynamic, Dynamic, S::RStride, S::CStride>
pub fn slice_mut(
&mut self,
start: (usize, usize),
shape: (usize, usize)
) -> MatrixSliceMut<'_, N, Dynamic, Dynamic, S::RStride, S::CStride>
Slices this matrix starting at its component (irow, icol)
and with (nrows, ncols)
consecutive elements.
sourcepub fn slice_with_steps_mut(
&mut self,
start: (usize, usize),
shape: (usize, usize),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, Dynamic, Dynamic, Dynamic, Dynamic>
pub fn slice_with_steps_mut(
&mut self,
start: (usize, usize),
shape: (usize, usize),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, Dynamic, Dynamic, Dynamic, Dynamic>
Slices this matrix starting at its component (start.0, start.1)
and with
(shape.0, shape.1)
components. Each row (resp. column) of the sliced matrix is
separated by steps.0
(resp. steps.1
) ignored rows (resp. columns) of the
original matrix.
sourcepub fn fixed_slice_mut<RSlice, CSlice>(
&mut self,
irow: usize,
icol: usize
) -> MatrixSliceMut<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: DimName,
CSlice: DimName,
pub fn fixed_slice_mut<RSlice, CSlice>(
&mut self,
irow: usize,
icol: usize
) -> MatrixSliceMut<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: DimName,
CSlice: DimName,
Slices this matrix starting at its component (irow, icol)
and with (R::dim(), CSlice::dim())
consecutive components.
sourcepub fn fixed_slice_with_steps_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: DimName,
CSlice: DimName,
pub fn fixed_slice_with_steps_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: DimName,
CSlice: DimName,
Slices this matrix starting at its component (start.0, start.1)
and with
(R::dim(), CSlice::dim())
components. Each row (resp. column) of the sliced
matrix is separated by steps.0
(resp. steps.1
) ignored rows (resp. columns) of
the original matrix.
sourcepub fn generic_slice_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
shape: (RSlice, CSlice)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: Dim,
CSlice: Dim,
pub fn generic_slice_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
shape: (RSlice, CSlice)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, S::RStride, S::CStride>where
RSlice: Dim,
CSlice: Dim,
Creates a slice that may or may not have a fixed size and stride.
sourcepub fn generic_slice_with_steps_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
shape: (RSlice, CSlice),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: Dim,
CSlice: Dim,
pub fn generic_slice_with_steps_mut<RSlice, CSlice>(
&mut self,
start: (usize, usize),
shape: (RSlice, CSlice),
steps: (usize, usize)
) -> MatrixSliceMut<'_, N, RSlice, CSlice, Dynamic, Dynamic>where
RSlice: Dim,
CSlice: Dim,
Creates a slice that may or may not have a fixed size and stride.
sourcepub fn rows_range_pair_mut<Range1: SliceRange<R>, Range2: SliceRange<R>>(
&mut self,
r1: Range1,
r2: Range2
) -> (MatrixSliceMut<'_, N, Range1::Size, C, S::RStride, S::CStride>, MatrixSliceMut<'_, N, Range2::Size, C, S::RStride, S::CStride>)
pub fn rows_range_pair_mut<Range1: SliceRange<R>, Range2: SliceRange<R>>(
&mut self,
r1: Range1,
r2: Range2
) -> (MatrixSliceMut<'_, N, Range1::Size, C, S::RStride, S::CStride>, MatrixSliceMut<'_, N, Range2::Size, C, S::RStride, S::CStride>)
Splits this NxM matrix into two parts delimited by two ranges.
Panics if the ranges overlap or if the first range is empty.
sourcepub fn columns_range_pair_mut<Range1: SliceRange<C>, Range2: SliceRange<C>>(
&mut self,
r1: Range1,
r2: Range2
) -> (MatrixSliceMut<'_, N, R, Range1::Size, S::RStride, S::CStride>, MatrixSliceMut<'_, N, R, Range2::Size, S::RStride, S::CStride>)
pub fn columns_range_pair_mut<Range1: SliceRange<C>, Range2: SliceRange<C>>(
&mut self,
r1: Range1,
r2: Range2
) -> (MatrixSliceMut<'_, N, R, Range1::Size, S::RStride, S::CStride>, MatrixSliceMut<'_, N, R, Range2::Size, S::RStride, S::CStride>)
Splits this NxM matrix into two parts delimited by two ranges.
Panics if the ranges overlap or if the first range is empty.
source§impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn slice_range<RowRange, ColRange>(
&self,
rows: RowRange,
cols: ColRange
) -> MatrixSlice<'_, N, RowRange::Size, ColRange::Size, S::RStride, S::CStride>where
RowRange: SliceRange<R>,
ColRange: SliceRange<C>,
pub fn slice_range<RowRange, ColRange>(
&self,
rows: RowRange,
cols: ColRange
) -> MatrixSlice<'_, N, RowRange::Size, ColRange::Size, S::RStride, S::CStride>where
RowRange: SliceRange<R>,
ColRange: SliceRange<C>,
Slices a sub-matrix containing the rows indexed by the range rows
and the columns indexed
by the range cols
.
sourcepub fn rows_range<RowRange: SliceRange<R>>(
&self,
rows: RowRange
) -> MatrixSlice<'_, N, RowRange::Size, C, S::RStride, S::CStride>
pub fn rows_range<RowRange: SliceRange<R>>(
&self,
rows: RowRange
) -> MatrixSlice<'_, N, RowRange::Size, C, S::RStride, S::CStride>
Slice containing all the rows indexed by the range rows
.
sourcepub fn columns_range<ColRange: SliceRange<C>>(
&self,
cols: ColRange
) -> MatrixSlice<'_, N, R, ColRange::Size, S::RStride, S::CStride>
pub fn columns_range<ColRange: SliceRange<C>>(
&self,
cols: ColRange
) -> MatrixSlice<'_, N, R, ColRange::Size, S::RStride, S::CStride>
Slice containing all the columns indexed by the range rows
.
source§impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> Matrix<N, R, C, S>
sourcepub fn slice_range_mut<RowRange, ColRange>(
&mut self,
rows: RowRange,
cols: ColRange
) -> MatrixSliceMut<'_, N, RowRange::Size, ColRange::Size, S::RStride, S::CStride>where
RowRange: SliceRange<R>,
ColRange: SliceRange<C>,
pub fn slice_range_mut<RowRange, ColRange>(
&mut self,
rows: RowRange,
cols: ColRange
) -> MatrixSliceMut<'_, N, RowRange::Size, ColRange::Size, S::RStride, S::CStride>where
RowRange: SliceRange<R>,
ColRange: SliceRange<C>,
Slices a mutable sub-matrix containing the rows indexed by the range rows
and the columns
indexed by the range cols
.
sourcepub fn rows_range_mut<RowRange: SliceRange<R>>(
&mut self,
rows: RowRange
) -> MatrixSliceMut<'_, N, RowRange::Size, C, S::RStride, S::CStride>
pub fn rows_range_mut<RowRange: SliceRange<R>>(
&mut self,
rows: RowRange
) -> MatrixSliceMut<'_, N, RowRange::Size, C, S::RStride, S::CStride>
Slice containing all the rows indexed by the range rows
.
sourcepub fn columns_range_mut<ColRange: SliceRange<C>>(
&mut self,
cols: ColRange
) -> MatrixSliceMut<'_, N, R, ColRange::Size, S::RStride, S::CStride>
pub fn columns_range_mut<ColRange: SliceRange<C>>(
&mut self,
cols: ColRange
) -> MatrixSliceMut<'_, N, R, ColRange::Size, S::RStride, S::CStride>
Slice containing all the columns indexed by the range cols
.
source§impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>
sourcepub fn is_identity(&self, eps: N::Epsilon) -> boolwhere
N: Zero + One + RelativeEq,
N::Epsilon: Copy,
pub fn is_identity(&self, eps: N::Epsilon) -> boolwhere
N: Zero + One + RelativeEq,
N::Epsilon: Copy,
Indicated if this is the identity matrix within a relative error of eps
.
If the matrix is diagonal, this checks that diagonal elements (i.e. at coordinates (i, i)
for i from 0
to min(R, C)
) are equal one; and that all other elements are zero.
sourcepub fn is_orthogonal(&self, eps: N::Epsilon) -> boolwhere
N: Zero + One + ClosedAdd + ClosedMul + RelativeEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
DefaultAllocator: Allocator<N, C, C>,
pub fn is_orthogonal(&self, eps: N::Epsilon) -> boolwhere
N: Zero + One + ClosedAdd + ClosedMul + RelativeEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
DefaultAllocator: Allocator<N, C, C>,
Checks that Mᵀ × M = Id
.
In this definition Id
is approximately equal to the identity matrix with a relative error
equal to eps
.
source§impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D>,
impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D>,
sourcepub fn is_special_orthogonal(&self, eps: N) -> boolwhere
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<(usize, usize), D>,
pub fn is_special_orthogonal(&self, eps: N) -> boolwhere
D: DimMin<D, Output = D>,
DefaultAllocator: Allocator<(usize, usize), D>,
Checks that this matrix is orthogonal and has a determinant equal to 1.
sourcepub fn is_invertible(&self) -> bool
pub fn is_invertible(&self) -> bool
Returns true
if this matrix is invertible.
source§impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>
impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>
sourcepub fn solve_lower_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_lower_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Computes the solution of the linear system self . x = b
where x
is the unknown and only
the lower-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn solve_upper_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_upper_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Computes the solution of the linear system self . x = b
where x
is the unknown and only
the upper-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn solve_lower_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_lower_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self . x = b
where x
is the unknown and only the
lower-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn solve_lower_triangular_with_diag_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>,
diag: N
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_lower_triangular_with_diag_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>,
diag: N
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self . x = b
where x
is the unknown and only the
lower-triangular part of self
is considered not-zero. The diagonal is never read as it is
assumed to be equal to diag
. Returns false
and does not modify its inputs if diag
is zero.
sourcepub fn solve_upper_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn solve_upper_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self . x = b
where x
is the unknown and only the
upper-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn tr_solve_lower_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn tr_solve_lower_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Computes the solution of the linear system self.transpose() . x = b
where x
is the unknown and only
the lower-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn tr_solve_upper_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn tr_solve_upper_triangular<R2: Dim, C2: Dim, S2>(
&self,
b: &Matrix<N, R2, C2, S2>
) -> Option<MatrixMN<N, R2, C2>>where
S2: StorageMut<N, R2, C2>,
DefaultAllocator: Allocator<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Computes the solution of the linear system self.transpose() . x = b
where x
is the unknown and only
the upper-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn tr_solve_lower_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn tr_solve_lower_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self.transpose() . x = b
where x
is the unknown and only the
lower-triangular part of self
(including the diagonal) is considered not-zero.
sourcepub fn tr_solve_upper_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn tr_solve_upper_triangular_mut<R2: Dim, C2: Dim, S2>(
&self,
b: &mut Matrix<N, R2, C2, S2>
) -> boolwhere
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Solves the linear system self.transpose() . x = b
where x
is the unknown and only the
upper-triangular part of self
(including the diagonal) is considered not-zero.
source§impl<N: Real, D: DimMin<D, Output = D>, S: Storage<N, D, D>> Matrix<N, D, D, S>
impl<N: Real, D: DimMin<D, Output = D>, S: Storage<N, D, D>> Matrix<N, D, D, S>
sourcepub fn determinant(&self) -> Nwhere
DefaultAllocator: Allocator<N, D, D> + Allocator<(usize, usize), D>,
pub fn determinant(&self) -> Nwhere
DefaultAllocator: Allocator<N, D, D> + Allocator<(usize, usize), D>,
Computes the matrix determinant.
If the matrix has a dimension larger than 3, an LU decomposition is used.
source§impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>
impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>
sourcepub fn try_inverse(self) -> Option<MatrixN<N, D>>where
DefaultAllocator: Allocator<N, D, D>,
pub fn try_inverse(self) -> Option<MatrixN<N, D>>where
DefaultAllocator: Allocator<N, D, D>,
Attempts to invert this matrix.
source§impl<N: Real, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
impl<N: Real, D: Dim, S: StorageMut<N, D, D>> Matrix<N, D, D, S>
sourcepub fn try_inverse_mut(&mut self) -> boolwhere
DefaultAllocator: Allocator<N, D, D>,
pub fn try_inverse_mut(&mut self) -> boolwhere
DefaultAllocator: Allocator<N, D, D>,
Attempts to invert this matrix in-place. Returns false
and leaves self
untouched if
inversion fails.
source§impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<N, R> + Allocator<N, DimMinimum<R, C>>,
impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<N, R> + Allocator<N, DimMinimum<R, C>>,
source§impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, DimDiff<D, U1>>,
impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, DimDiff<D, U1>>,
sourcepub fn hessenberg(self) -> Hessenberg<N, D>
pub fn hessenberg(self) -> Hessenberg<N, D>
Computes the Hessenberg decomposition of this matrix using householder reflections.
source§impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DimMinimum<R, C>: DimSub<U1>,
DefaultAllocator: Allocator<N, R, C> + Allocator<N, C> + Allocator<N, R> + Allocator<N, DimMinimum<R, C>> + Allocator<N, DimDiff<DimMinimum<R, C>, U1>>,
impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DimMinimum<R, C>: DimSub<U1>,
DefaultAllocator: Allocator<N, R, C> + Allocator<N, C> + Allocator<N, R> + Allocator<N, DimMinimum<R, C>> + Allocator<N, DimDiff<DimMinimum<R, C>, U1>>,
sourcepub fn bidiagonalize(self) -> Bidiagonal<N, R, C>
pub fn bidiagonalize(self) -> Bidiagonal<N, R, C>
Computes the bidiagonalization using householder reflections.
source§impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimDiff<D, U1>>,
impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimDiff<D, U1>>,
sourcepub fn symmetric_tridiagonalize(self) -> SymmetricTridiagonal<N, D>
pub fn symmetric_tridiagonalize(self) -> SymmetricTridiagonal<N, D>
Computes the tridiagonalization of this symmetric matrix.
Only the lower-triangular part (including the diagonal) of m
is read.
source§impl<N: Real, D: DimSub<Dynamic>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D>,
impl<N: Real, D: DimSub<Dynamic>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D>,
source§impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
source§impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DefaultAllocator: Allocator<N, R, C> + Allocator<(usize, usize), DimMinimum<R, C>>,
sourcepub fn full_piv_lu(self) -> FullPivLU<N, R, C>
pub fn full_piv_lu(self) -> FullPivLU<N, R, C>
Computes the LU decomposition with full pivoting of matrix
.
This effectively computes P, L, U, Q
such that P * matrix * Q = LU
.
source§impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>where
D: DimSub<U1>,
ShapeConstraint: DimEq<Dynamic, DimDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, DimDiff<D, U1>> + Allocator<N, DimDiff<D, U1>> + Allocator<N, D, D> + Allocator<N, D>,
impl<N: Real, D: Dim, S: Storage<N, D, D>> Matrix<N, D, D, S>where
D: DimSub<U1>,
ShapeConstraint: DimEq<Dynamic, DimDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, DimDiff<D, U1>> + Allocator<N, DimDiff<D, U1>> + Allocator<N, D, D> + Allocator<N, D>,
sourcepub fn real_schur(self) -> RealSchur<N, D>
pub fn real_schur(self) -> RealSchur<N, D>
Computes the Schur decomposition of a square matrix.
sourcepub fn try_real_schur(self, eps: N, max_niter: usize) -> Option<RealSchur<N, D>>
pub fn try_real_schur(self, eps: N, max_niter: usize) -> Option<RealSchur<N, D>>
Attempts to compute the Schur decomposition of a square matrix.
If only eigenvalues are needed, it is more efficient to call the matrix method
.eigenvalues()
instead.
Arguments
eps
− tolerance used to determine when a value converged to 0.max_niter
− maximum total number of iterations performed by the algorithm. If this number of iteration is exceeded,None
is returned. Ifniter == 0
, then the algorithm continues indefinitely until convergence.
sourcepub fn eigenvalues(&self) -> Option<VectorN<N, D>>
pub fn eigenvalues(&self) -> Option<VectorN<N, D>>
Computes the eigenvalues of this matrix.
sourcepub fn complex_eigenvalues(&self) -> VectorN<Complex<N>, D>where
DefaultAllocator: Allocator<Complex<N>, D>,
pub fn complex_eigenvalues(&self) -> VectorN<Complex<N>, D>where
DefaultAllocator: Allocator<Complex<N>, D>,
Computes the eigenvalues of this matrix.
source§impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DimMinimum<R, C>: DimSub<U1>,
DefaultAllocator: Allocator<N, R, C> + Allocator<N, C> + Allocator<N, R> + Allocator<N, DimDiff<DimMinimum<R, C>, U1>> + Allocator<N, DimMinimum<R, C>, C> + Allocator<N, R, DimMinimum<R, C>> + Allocator<N, DimMinimum<R, C>>,
impl<N: Real, R: DimMin<C>, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S>where
DimMinimum<R, C>: DimSub<U1>,
DefaultAllocator: Allocator<N, R, C> + Allocator<N, C> + Allocator<N, R> + Allocator<N, DimDiff<DimMinimum<R, C>, U1>> + Allocator<N, DimMinimum<R, C>, C> + Allocator<N, R, DimMinimum<R, C>> + Allocator<N, DimMinimum<R, C>>,
sourcepub fn svd(self, compute_u: bool, compute_v: bool) -> SVD<N, R, C>
pub fn svd(self, compute_u: bool, compute_v: bool) -> SVD<N, R, C>
Computes the Singular Value Decomposition using implicit shift.
sourcepub fn try_svd(
self,
compute_u: bool,
compute_v: bool,
eps: N,
max_niter: usize
) -> Option<SVD<N, R, C>>
pub fn try_svd(
self,
compute_u: bool,
compute_v: bool,
eps: N,
max_niter: usize
) -> Option<SVD<N, R, C>>
Attempts to compute the Singular Value Decomposition of matrix
using implicit shift.
Arguments
compute_u
− set this totrue
to enable the computation of left-singular vectors.compute_v
− set this totrue
to enable the computation of left-singular vectors.eps
− tolerance used to determine when a value converged to 0.max_niter
− maximum total number of iterations performed by the algorithm. If this number of iteration is exceeded,None
is returned. Ifniter == 0
, then the algorithm continues indefinitely until convergence.
sourcepub fn singular_values(&self) -> VectorN<N, DimMinimum<R, C>>
pub fn singular_values(&self) -> VectorN<N, DimMinimum<R, C>>
Computes the singular values of this matrix.
sourcepub fn rank(&self, eps: N) -> usize
pub fn rank(&self, eps: N) -> usize
Computes the rank of this matrix.
All singular values below eps
are considered equal to 0.
sourcepub fn pseudo_inverse(self, eps: N) -> MatrixMN<N, C, R>where
DefaultAllocator: Allocator<N, C, R>,
pub fn pseudo_inverse(self, eps: N) -> MatrixMN<N, C, R>where
DefaultAllocator: Allocator<N, C, R>,
Computes the pseudo-inverse of this matrix.
All singular values below eps
are considered equal to 0.
source§impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, DimDiff<D, U1>>,
impl<N: Real, D: DimSub<U1>, S: Storage<N, D, D>> Matrix<N, D, D, S>where
DefaultAllocator: Allocator<N, D, D> + Allocator<N, D> + Allocator<N, DimDiff<D, U1>>,
sourcepub fn symmetric_eigen(self) -> SymmetricEigen<N, D>
pub fn symmetric_eigen(self) -> SymmetricEigen<N, D>
Computes the eigendecomposition of this symmetric matrix.
Only the lower-triangular part (including the diagonal) of m
is read.
sourcepub fn try_symmetric_eigen(
self,
eps: N,
max_niter: usize
) -> Option<SymmetricEigen<N, D>>
pub fn try_symmetric_eigen(
self,
eps: N,
max_niter: usize
) -> Option<SymmetricEigen<N, D>>
Computes the eigendecomposition of the given symmetric matrix with user-specified convergence parameters.
Only the lower-triangular part (including the diagonal) of m
is read.
Arguments
eps
− tolerance used to determine when a value converged to 0.max_niter
− maximum total number of iterations performed by the algorithm. If this number of iteration is exceeded,None
is returned. Ifniter == 0
, then the algorithm continues indefinitely until convergence.
sourcepub fn symmetric_eigenvalues(&self) -> VectorN<N, D>
pub fn symmetric_eigenvalues(&self) -> VectorN<N, D>
Computes the eigenvalues of this symmetric matrix.
Only the lower-triangular part of the matrix is read.
Trait Implementations§
source§impl<N, R: Dim, C: Dim, S> AbsDiffEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + AbsDiffEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
impl<N, R: Dim, C: Dim, S> AbsDiffEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + AbsDiffEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
source§fn default_epsilon() -> Self::Epsilon
fn default_epsilon() -> Self::Epsilon
source§impl<'a, 'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<&'b Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'a, 'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<&'b Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'a, 'b, N, R1, C1, R2, C2, SA, SB> Add<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'a, 'b, N, R1, C1, R2, C2, SA, SB> Add<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
+
operator.source§impl<'b, N, R1, C1, R2, C2, SA, SB> Add<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'b, N, R1, C1, R2, C2, SA, SB> Add<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
+
operator.source§impl<'a, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'a, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Add<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'a, N, R1, C1, R2, C2, SA, SB> Add<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R2, C2, R1, C1>,
ShapeConstraint: SameNumberOfRows<R2, R1> + SameNumberOfColumns<C2, C1>,
impl<'a, N, R1, C1, R2, C2, SA, SB> Add<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R2, C2, R1, C1>,
ShapeConstraint: SameNumberOfRows<R2, R1> + SameNumberOfColumns<C2, C1>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative>>::Buffer>
+
operator.source§impl<N, R1, C1, R2, C2, SA, SB> Add<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<N, R1, C1, R2, C2, SA, SB> Add<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
+
operator.source§impl<'b, N, D1: DimName, D2: Dim, SB> AddAssign<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
impl<'b, N, D1: DimName, D2: Dim, SB> AddAssign<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
source§fn add_assign(&mut self, right: &'b Vector<N, D2, SB>)
fn add_assign(&mut self, right: &'b Vector<N, D2, SB>)
+=
operation. Read moresource§impl<'b, N, R1, C1, R2, C2, SA, SB> AddAssign<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'b, N, R1, C1, R2, C2, SA, SB> AddAssign<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
source§fn add_assign(&mut self, rhs: &'b Matrix<N, R2, C2, SB>)
fn add_assign(&mut self, rhs: &'b Matrix<N, R2, C2, SB>)
+=
operation. Read moresource§impl<N, D1: DimName, D2: Dim, SB> AddAssign<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
impl<N, D1: DimName, D2: Dim, SB> AddAssign<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedAdd,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
source§fn add_assign(&mut self, right: Vector<N, D2, SB>)
fn add_assign(&mut self, right: Vector<N, D2, SB>)
+=
operation. Read moresource§impl<N, R1, C1, R2, C2, SA, SB> AddAssign<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<N, R1, C1, R2, C2, SA, SB> AddAssign<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedAdd,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
source§fn add_assign(&mut self, rhs: Matrix<N, R2, C2, SB>)
fn add_assign(&mut self, rhs: Matrix<N, R2, C2, SB>)
+=
operation. Read moresource§impl<N: Scalar, S> AsMut<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorageMut<N, U2, U2>,
impl<N: Scalar, S> AsMut<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorageMut<N, U2, U2>,
source§impl<N: Scalar, S> AsMut<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorageMut<N, U2, U3>,
impl<N: Scalar, S> AsMut<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorageMut<N, U2, U3>,
source§impl<N: Scalar, S> AsMut<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorageMut<N, U2, U4>,
impl<N: Scalar, S> AsMut<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorageMut<N, U2, U4>,
source§impl<N: Scalar, S> AsMut<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorageMut<N, U2, U5>,
impl<N: Scalar, S> AsMut<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorageMut<N, U2, U5>,
source§impl<N: Scalar, S> AsMut<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorageMut<N, U2, U6>,
impl<N: Scalar, S> AsMut<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorageMut<N, U2, U6>,
source§impl<N: Scalar, S> AsMut<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorageMut<N, U3, U2>,
impl<N: Scalar, S> AsMut<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorageMut<N, U3, U2>,
source§impl<N: Scalar, S> AsMut<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorageMut<N, U3, U3>,
impl<N: Scalar, S> AsMut<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorageMut<N, U3, U3>,
source§impl<N: Scalar, S> AsMut<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorageMut<N, U3, U4>,
impl<N: Scalar, S> AsMut<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorageMut<N, U3, U4>,
source§impl<N: Scalar, S> AsMut<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorageMut<N, U3, U5>,
impl<N: Scalar, S> AsMut<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorageMut<N, U3, U5>,
source§impl<N: Scalar, S> AsMut<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorageMut<N, U3, U6>,
impl<N: Scalar, S> AsMut<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorageMut<N, U3, U6>,
source§impl<N: Scalar, S> AsMut<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorageMut<N, U4, U2>,
impl<N: Scalar, S> AsMut<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorageMut<N, U4, U2>,
source§impl<N: Scalar, S> AsMut<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorageMut<N, U4, U3>,
impl<N: Scalar, S> AsMut<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorageMut<N, U4, U3>,
source§impl<N: Scalar, S> AsMut<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorageMut<N, U4, U4>,
impl<N: Scalar, S> AsMut<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorageMut<N, U4, U4>,
source§impl<N: Scalar, S> AsMut<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorageMut<N, U4, U5>,
impl<N: Scalar, S> AsMut<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorageMut<N, U4, U5>,
source§impl<N: Scalar, S> AsMut<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorageMut<N, U4, U6>,
impl<N: Scalar, S> AsMut<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorageMut<N, U4, U6>,
source§impl<N: Scalar, S> AsMut<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorageMut<N, U5, U2>,
impl<N: Scalar, S> AsMut<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorageMut<N, U5, U2>,
source§impl<N: Scalar, S> AsMut<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorageMut<N, U5, U3>,
impl<N: Scalar, S> AsMut<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorageMut<N, U5, U3>,
source§impl<N: Scalar, S> AsMut<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorageMut<N, U5, U4>,
impl<N: Scalar, S> AsMut<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorageMut<N, U5, U4>,
source§impl<N: Scalar, S> AsMut<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorageMut<N, U5, U5>,
impl<N: Scalar, S> AsMut<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorageMut<N, U5, U5>,
source§impl<N: Scalar, S> AsMut<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorageMut<N, U5, U6>,
impl<N: Scalar, S> AsMut<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorageMut<N, U5, U6>,
source§impl<N: Scalar, S> AsMut<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorageMut<N, U6, U2>,
impl<N: Scalar, S> AsMut<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorageMut<N, U6, U2>,
source§impl<N: Scalar, S> AsMut<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorageMut<N, U6, U3>,
impl<N: Scalar, S> AsMut<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorageMut<N, U6, U3>,
source§impl<N: Scalar, S> AsMut<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorageMut<N, U6, U4>,
impl<N: Scalar, S> AsMut<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorageMut<N, U6, U4>,
source§impl<N: Scalar, S> AsMut<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorageMut<N, U6, U5>,
impl<N: Scalar, S> AsMut<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorageMut<N, U6, U5>,
source§impl<N: Scalar, S> AsMut<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorageMut<N, U6, U6>,
impl<N: Scalar, S> AsMut<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorageMut<N, U6, U6>,
source§impl<N, S> AsMut<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U1>,
impl<N, S> AsMut<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U1>,
source§impl<N, S> AsMut<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U10>,
impl<N, S> AsMut<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U10>,
source§impl<N, S> AsMut<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U10, U1>,
impl<N, S> AsMut<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U10, U1>,
source§impl<N, S> AsMut<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U11>,
impl<N, S> AsMut<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U11>,
source§impl<N, S> AsMut<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U11, U1>,
impl<N, S> AsMut<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U11, U1>,
source§impl<N, S> AsMut<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U12>,
impl<N, S> AsMut<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U12>,
source§impl<N, S> AsMut<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U12, U1>,
impl<N, S> AsMut<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U12, U1>,
source§impl<N, S> AsMut<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U13>,
impl<N, S> AsMut<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U13>,
source§impl<N, S> AsMut<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U13, U1>,
impl<N, S> AsMut<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U13, U1>,
source§impl<N, S> AsMut<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U14>,
impl<N, S> AsMut<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U14>,
source§impl<N, S> AsMut<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U14, U1>,
impl<N, S> AsMut<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U14, U1>,
source§impl<N, S> AsMut<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U15>,
impl<N, S> AsMut<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U15>,
source§impl<N, S> AsMut<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U15, U1>,
impl<N, S> AsMut<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U15, U1>,
source§impl<N, S> AsMut<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U16>,
impl<N, S> AsMut<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U16>,
source§impl<N, S> AsMut<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U16, U1>,
impl<N, S> AsMut<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U16, U1>,
source§impl<N, S> AsMut<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U2>,
impl<N, S> AsMut<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U2>,
source§impl<N, S> AsMut<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U2, U1>,
impl<N, S> AsMut<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U2, U1>,
source§impl<N, S> AsMut<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U3>,
impl<N, S> AsMut<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U3>,
source§impl<N, S> AsMut<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U3, U1>,
impl<N, S> AsMut<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U3, U1>,
source§impl<N, S> AsMut<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U4>,
impl<N, S> AsMut<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U4>,
source§impl<N, S> AsMut<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U4, U1>,
impl<N, S> AsMut<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U4, U1>,
source§impl<N, S> AsMut<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U5>,
impl<N, S> AsMut<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U5>,
source§impl<N, S> AsMut<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U5, U1>,
impl<N, S> AsMut<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U5, U1>,
source§impl<N, S> AsMut<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U6>,
impl<N, S> AsMut<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U6>,
source§impl<N, S> AsMut<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U6, U1>,
impl<N, S> AsMut<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U6, U1>,
source§impl<N, S> AsMut<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U7>,
impl<N, S> AsMut<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U7>,
source§impl<N, S> AsMut<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U7, U1>,
impl<N, S> AsMut<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U7, U1>,
source§impl<N, S> AsMut<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U8>,
impl<N, S> AsMut<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U8>,
source§impl<N, S> AsMut<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U8, U1>,
impl<N, S> AsMut<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U8, U1>,
source§impl<N, S> AsMut<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U9>,
impl<N, S> AsMut<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorageMut<N, U1, U9>,
source§impl<N, S> AsMut<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U9, U1>,
impl<N, S> AsMut<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorageMut<N, U9, U1>,
source§impl<N: Scalar, S> AsRef<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorage<N, U2, U2>,
impl<N: Scalar, S> AsRef<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorage<N, U2, U2>,
source§impl<N: Scalar, S> AsRef<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorage<N, U2, U3>,
impl<N: Scalar, S> AsRef<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorage<N, U2, U3>,
source§impl<N: Scalar, S> AsRef<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorage<N, U2, U4>,
impl<N: Scalar, S> AsRef<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorage<N, U2, U4>,
source§impl<N: Scalar, S> AsRef<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorage<N, U2, U5>,
impl<N: Scalar, S> AsRef<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorage<N, U2, U5>,
source§impl<N: Scalar, S> AsRef<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorage<N, U2, U6>,
impl<N: Scalar, S> AsRef<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorage<N, U2, U6>,
source§impl<N: Scalar, S> AsRef<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorage<N, U3, U2>,
impl<N: Scalar, S> AsRef<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorage<N, U3, U2>,
source§impl<N: Scalar, S> AsRef<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorage<N, U3, U3>,
impl<N: Scalar, S> AsRef<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorage<N, U3, U3>,
source§impl<N: Scalar, S> AsRef<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorage<N, U3, U4>,
impl<N: Scalar, S> AsRef<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorage<N, U3, U4>,
source§impl<N: Scalar, S> AsRef<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorage<N, U3, U5>,
impl<N: Scalar, S> AsRef<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorage<N, U3, U5>,
source§impl<N: Scalar, S> AsRef<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorage<N, U3, U6>,
impl<N: Scalar, S> AsRef<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorage<N, U3, U6>,
source§impl<N: Scalar, S> AsRef<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorage<N, U4, U2>,
impl<N: Scalar, S> AsRef<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorage<N, U4, U2>,
source§impl<N: Scalar, S> AsRef<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorage<N, U4, U3>,
impl<N: Scalar, S> AsRef<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorage<N, U4, U3>,
source§impl<N: Scalar, S> AsRef<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorage<N, U4, U4>,
impl<N: Scalar, S> AsRef<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorage<N, U4, U4>,
source§impl<N: Scalar, S> AsRef<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorage<N, U4, U5>,
impl<N: Scalar, S> AsRef<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorage<N, U4, U5>,
source§impl<N: Scalar, S> AsRef<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorage<N, U4, U6>,
impl<N: Scalar, S> AsRef<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorage<N, U4, U6>,
source§impl<N: Scalar, S> AsRef<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorage<N, U5, U2>,
impl<N: Scalar, S> AsRef<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorage<N, U5, U2>,
source§impl<N: Scalar, S> AsRef<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorage<N, U5, U3>,
impl<N: Scalar, S> AsRef<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorage<N, U5, U3>,
source§impl<N: Scalar, S> AsRef<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorage<N, U5, U4>,
impl<N: Scalar, S> AsRef<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorage<N, U5, U4>,
source§impl<N: Scalar, S> AsRef<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorage<N, U5, U5>,
impl<N: Scalar, S> AsRef<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorage<N, U5, U5>,
source§impl<N: Scalar, S> AsRef<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorage<N, U5, U6>,
impl<N: Scalar, S> AsRef<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorage<N, U5, U6>,
source§impl<N: Scalar, S> AsRef<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorage<N, U6, U2>,
impl<N: Scalar, S> AsRef<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorage<N, U6, U2>,
source§impl<N: Scalar, S> AsRef<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorage<N, U6, U3>,
impl<N: Scalar, S> AsRef<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorage<N, U6, U3>,
source§impl<N: Scalar, S> AsRef<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorage<N, U6, U4>,
impl<N: Scalar, S> AsRef<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorage<N, U6, U4>,
source§impl<N: Scalar, S> AsRef<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorage<N, U6, U5>,
impl<N: Scalar, S> AsRef<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorage<N, U6, U5>,
source§impl<N: Scalar, S> AsRef<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorage<N, U6, U6>,
impl<N: Scalar, S> AsRef<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorage<N, U6, U6>,
source§impl<N, S> AsRef<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U1>,
impl<N, S> AsRef<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U1>,
source§impl<N, S> AsRef<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U10>,
impl<N, S> AsRef<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U10>,
source§impl<N, S> AsRef<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U10, U1>,
impl<N, S> AsRef<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U10, U1>,
source§impl<N, S> AsRef<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U11>,
impl<N, S> AsRef<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U11>,
source§impl<N, S> AsRef<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U11, U1>,
impl<N, S> AsRef<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U11, U1>,
source§impl<N, S> AsRef<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U12>,
impl<N, S> AsRef<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U12>,
source§impl<N, S> AsRef<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U12, U1>,
impl<N, S> AsRef<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U12, U1>,
source§impl<N, S> AsRef<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U13>,
impl<N, S> AsRef<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U13>,
source§impl<N, S> AsRef<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U13, U1>,
impl<N, S> AsRef<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U13, U1>,
source§impl<N, S> AsRef<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U14>,
impl<N, S> AsRef<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U14>,
source§impl<N, S> AsRef<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U14, U1>,
impl<N, S> AsRef<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U14, U1>,
source§impl<N, S> AsRef<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U15>,
impl<N, S> AsRef<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U15>,
source§impl<N, S> AsRef<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U15, U1>,
impl<N, S> AsRef<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U15, U1>,
source§impl<N, S> AsRef<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U16>,
impl<N, S> AsRef<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U16>,
source§impl<N, S> AsRef<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U16, U1>,
impl<N, S> AsRef<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U16, U1>,
source§impl<N, S> AsRef<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U2>,
impl<N, S> AsRef<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U2>,
source§impl<N, S> AsRef<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U2, U1>,
impl<N, S> AsRef<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U2, U1>,
source§impl<N, S> AsRef<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U3>,
impl<N, S> AsRef<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U3>,
source§impl<N, S> AsRef<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U3, U1>,
impl<N, S> AsRef<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U3, U1>,
source§impl<N, S> AsRef<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U4>,
impl<N, S> AsRef<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U4>,
source§impl<N, S> AsRef<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U4, U1>,
impl<N, S> AsRef<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U4, U1>,
source§impl<N, S> AsRef<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U5>,
impl<N, S> AsRef<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U5>,
source§impl<N, S> AsRef<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U5, U1>,
impl<N, S> AsRef<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U5, U1>,
source§impl<N, S> AsRef<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U6>,
impl<N, S> AsRef<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U6>,
source§impl<N, S> AsRef<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U6, U1>,
impl<N, S> AsRef<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U6, U1>,
source§impl<N, S> AsRef<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U7>,
impl<N, S> AsRef<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U7>,
source§impl<N, S> AsRef<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U7, U1>,
impl<N, S> AsRef<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U7, U1>,
source§impl<N, S> AsRef<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U8>,
impl<N, S> AsRef<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U8>,
source§impl<N, S> AsRef<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U8, U1>,
impl<N, S> AsRef<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U8, U1>,
source§impl<N, S> AsRef<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U9>,
impl<N, S> AsRef<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U9>,
source§impl<N, S> AsRef<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U9, U1>,
impl<N, S> AsRef<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U9, U1>,
source§impl<N: Clone + Scalar, R: Clone + Dim, C: Clone + Dim, S: Clone> Clone for Matrix<N, R, C, S>
impl<N: Clone + Scalar, R: Clone + Dim, C: Clone + Dim, S: Clone> Clone for Matrix<N, R, C, S>
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U1, S>where
S: ContiguousStorageMut<N, U1, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U1, S>where
S: ContiguousStorageMut<N, U1, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U2, S>where
S: ContiguousStorageMut<N, U1, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U2, S>where
S: ContiguousStorageMut<N, U1, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U3, S>where
S: ContiguousStorageMut<N, U1, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U3, S>where
S: ContiguousStorageMut<N, U1, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U4, S>where
S: ContiguousStorageMut<N, U1, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U4, S>where
S: ContiguousStorageMut<N, U1, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U5, S>where
S: ContiguousStorageMut<N, U1, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U5, S>where
S: ContiguousStorageMut<N, U1, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U1, U6, S>where
S: ContiguousStorageMut<N, U1, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U1, U6, S>where
S: ContiguousStorageMut<N, U1, U6>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U1, S>where
S: ContiguousStorageMut<N, U2, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U1, S>where
S: ContiguousStorageMut<N, U2, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U2, S>where
S: ContiguousStorageMut<N, U2, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U2, S>where
S: ContiguousStorageMut<N, U2, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U3, S>where
S: ContiguousStorageMut<N, U2, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U3, S>where
S: ContiguousStorageMut<N, U2, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U4, S>where
S: ContiguousStorageMut<N, U2, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U4, S>where
S: ContiguousStorageMut<N, U2, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U5, S>where
S: ContiguousStorageMut<N, U2, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U5, S>where
S: ContiguousStorageMut<N, U2, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U2, U6, S>where
S: ContiguousStorageMut<N, U2, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U2, U6, S>where
S: ContiguousStorageMut<N, U2, U6>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U1, S>where
S: ContiguousStorageMut<N, U3, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U1, S>where
S: ContiguousStorageMut<N, U3, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U2, S>where
S: ContiguousStorageMut<N, U3, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U2, S>where
S: ContiguousStorageMut<N, U3, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U3, S>where
S: ContiguousStorageMut<N, U3, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U3, S>where
S: ContiguousStorageMut<N, U3, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U4, S>where
S: ContiguousStorageMut<N, U3, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U4, S>where
S: ContiguousStorageMut<N, U3, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U5, S>where
S: ContiguousStorageMut<N, U3, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U5, S>where
S: ContiguousStorageMut<N, U3, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U3, U6, S>where
S: ContiguousStorageMut<N, U3, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U3, U6, S>where
S: ContiguousStorageMut<N, U3, U6>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U1, S>where
S: ContiguousStorageMut<N, U4, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U1, S>where
S: ContiguousStorageMut<N, U4, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U2, S>where
S: ContiguousStorageMut<N, U4, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U2, S>where
S: ContiguousStorageMut<N, U4, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U3, S>where
S: ContiguousStorageMut<N, U4, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U3, S>where
S: ContiguousStorageMut<N, U4, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U4, S>where
S: ContiguousStorageMut<N, U4, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U4, S>where
S: ContiguousStorageMut<N, U4, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U5, S>where
S: ContiguousStorageMut<N, U4, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U5, S>where
S: ContiguousStorageMut<N, U4, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U4, U6, S>where
S: ContiguousStorageMut<N, U4, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U4, U6, S>where
S: ContiguousStorageMut<N, U4, U6>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U1, S>where
S: ContiguousStorageMut<N, U5, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U1, S>where
S: ContiguousStorageMut<N, U5, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U2, S>where
S: ContiguousStorageMut<N, U5, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U2, S>where
S: ContiguousStorageMut<N, U5, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U3, S>where
S: ContiguousStorageMut<N, U5, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U3, S>where
S: ContiguousStorageMut<N, U5, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U4, S>where
S: ContiguousStorageMut<N, U5, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U4, S>where
S: ContiguousStorageMut<N, U5, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U5, S>where
S: ContiguousStorageMut<N, U5, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U5, S>where
S: ContiguousStorageMut<N, U5, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U5, U6, S>where
S: ContiguousStorageMut<N, U5, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U5, U6, S>where
S: ContiguousStorageMut<N, U5, U6>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U1, S>where
S: ContiguousStorageMut<N, U6, U1>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U1, S>where
S: ContiguousStorageMut<N, U6, U1>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U2, S>where
S: ContiguousStorageMut<N, U6, U2>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U2, S>where
S: ContiguousStorageMut<N, U6, U2>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U3, S>where
S: ContiguousStorageMut<N, U6, U3>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U3, S>where
S: ContiguousStorageMut<N, U6, U3>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U4, S>where
S: ContiguousStorageMut<N, U6, U4>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U4, S>where
S: ContiguousStorageMut<N, U6, U4>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U5, S>where
S: ContiguousStorageMut<N, U6, U5>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U5, S>where
S: ContiguousStorageMut<N, U6, U5>,
source§impl<N: Scalar, S> DerefMut for Matrix<N, U6, U6, S>where
S: ContiguousStorageMut<N, U6, U6>,
impl<N: Scalar, S> DerefMut for Matrix<N, U6, U6, S>where
S: ContiguousStorageMut<N, U6, U6>,
source§impl<N, R: Dim, C: Dim, S> Display for Matrix<N, R, C, S>where
N: Scalar + Display,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<usize, R, C>,
impl<N, R: Dim, C: Dim, S> Display for Matrix<N, R, C, S>where
N: Scalar + Display,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<usize, R, C>,
source§impl<N: Scalar, R: Dim, C: Dim> Distribution<Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for Standardwhere
DefaultAllocator: Allocator<N, R, C>,
Standard: Distribution<N>,
impl<N: Scalar, R: Dim, C: Dim> Distribution<Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for Standardwhere
DefaultAllocator: Allocator<N, R, C>,
Standard: Distribution<N>,
source§impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<'a, N, R: Dim, C: Dim, S> Div<N> for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<'a, N, R: Dim, C: Dim, S> Div<N> for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> Div<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<N, R: Dim, C: Dim, S> Div<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<N, R: Dim, C: Dim, S> DivAssign<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: StorageMut<N, R, C>,
impl<N, R: Dim, C: Dim, S> DivAssign<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedDiv,
S: StorageMut<N, R, C>,
source§fn div_assign(&mut self, rhs: N)
fn div_assign(&mut self, rhs: N)
/=
operation. Read moresource§impl<'a, N, C, RStride, CStride> From<Matrix<N, Dynamic, C, SliceStorage<'a, N, Dynamic, C, RStride, CStride>>> for Matrix<N, Dynamic, C, MatrixVec<N, Dynamic, C>>where
N: Scalar,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, N, C, RStride, CStride> From<Matrix<N, Dynamic, C, SliceStorage<'a, N, Dynamic, C, RStride, CStride>>> for Matrix<N, Dynamic, C, MatrixVec<N, Dynamic, C>>where
N: Scalar,
C: Dim,
RStride: Dim,
CStride: Dim,
source§fn from(matrix_slice: MatrixSlice<'a, N, Dynamic, C, RStride, CStride>) -> Self
fn from(matrix_slice: MatrixSlice<'a, N, Dynamic, C, RStride, CStride>) -> Self
source§impl<'a, N, C, RStride, CStride> From<Matrix<N, Dynamic, C, SliceStorageMut<'a, N, Dynamic, C, RStride, CStride>>> for Matrix<N, Dynamic, C, MatrixVec<N, Dynamic, C>>where
N: Scalar,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, N, C, RStride, CStride> From<Matrix<N, Dynamic, C, SliceStorageMut<'a, N, Dynamic, C, RStride, CStride>>> for Matrix<N, Dynamic, C, MatrixVec<N, Dynamic, C>>where
N: Scalar,
C: Dim,
RStride: Dim,
CStride: Dim,
source§fn from(
matrix_slice: MatrixSliceMut<'a, N, Dynamic, C, RStride, CStride>
) -> Self
fn from(
matrix_slice: MatrixSliceMut<'a, N, Dynamic, C, RStride, CStride>
) -> Self
source§impl<'a, N, R, C, RStride, CStride> From<Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>> for Matrix<N, R, C, MatrixArray<N, R, C>>where
N: Scalar,
R: DimName,
C: DimName,
RStride: Dim,
CStride: Dim,
R::Value: Mul<C::Value>,
Prod<R::Value, C::Value>: ArrayLength<N>,
impl<'a, N, R, C, RStride, CStride> From<Matrix<N, R, C, SliceStorage<'a, N, R, C, RStride, CStride>>> for Matrix<N, R, C, MatrixArray<N, R, C>>where
N: Scalar,
R: DimName,
C: DimName,
RStride: Dim,
CStride: Dim,
R::Value: Mul<C::Value>,
Prod<R::Value, C::Value>: ArrayLength<N>,
source§fn from(matrix_slice: MatrixSlice<'a, N, R, C, RStride, CStride>) -> Self
fn from(matrix_slice: MatrixSlice<'a, N, R, C, RStride, CStride>) -> Self
source§impl<'a, N, R, C, RStride, CStride> From<Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>> for Matrix<N, R, C, MatrixArray<N, R, C>>where
N: Scalar,
R: DimName,
C: DimName,
RStride: Dim,
CStride: Dim,
R::Value: Mul<C::Value>,
Prod<R::Value, C::Value>: ArrayLength<N>,
impl<'a, N, R, C, RStride, CStride> From<Matrix<N, R, C, SliceStorageMut<'a, N, R, C, RStride, CStride>>> for Matrix<N, R, C, MatrixArray<N, R, C>>where
N: Scalar,
R: DimName,
C: DimName,
RStride: Dim,
CStride: Dim,
R::Value: Mul<C::Value>,
Prod<R::Value, C::Value>: ArrayLength<N>,
source§fn from(matrix_slice: MatrixSliceMut<'a, N, R, C, RStride, CStride>) -> Self
fn from(matrix_slice: MatrixSliceMut<'a, N, R, C, RStride, CStride>) -> Self
source§impl<'a, N, R, RStride, CStride> From<Matrix<N, R, Dynamic, SliceStorage<'a, N, R, Dynamic, RStride, CStride>>> for Matrix<N, R, Dynamic, MatrixVec<N, R, Dynamic>>where
N: Scalar,
R: DimName,
RStride: Dim,
CStride: Dim,
impl<'a, N, R, RStride, CStride> From<Matrix<N, R, Dynamic, SliceStorage<'a, N, R, Dynamic, RStride, CStride>>> for Matrix<N, R, Dynamic, MatrixVec<N, R, Dynamic>>where
N: Scalar,
R: DimName,
RStride: Dim,
CStride: Dim,
source§fn from(matrix_slice: MatrixSlice<'a, N, R, Dynamic, RStride, CStride>) -> Self
fn from(matrix_slice: MatrixSlice<'a, N, R, Dynamic, RStride, CStride>) -> Self
source§impl<'a, N, R, RStride, CStride> From<Matrix<N, R, Dynamic, SliceStorageMut<'a, N, R, Dynamic, RStride, CStride>>> for Matrix<N, R, Dynamic, MatrixVec<N, R, Dynamic>>where
N: Scalar,
R: DimName,
RStride: Dim,
CStride: Dim,
impl<'a, N, R, RStride, CStride> From<Matrix<N, R, Dynamic, SliceStorageMut<'a, N, R, Dynamic, RStride, CStride>>> for Matrix<N, R, Dynamic, MatrixVec<N, R, Dynamic>>where
N: Scalar,
R: DimName,
RStride: Dim,
CStride: Dim,
source§fn from(
matrix_slice: MatrixSliceMut<'a, N, R, Dynamic, RStride, CStride>
) -> Self
fn from(
matrix_slice: MatrixSliceMut<'a, N, R, Dynamic, RStride, CStride>
) -> Self
source§impl<N, R: Dim, C: Dim, S> Index<(usize, usize)> for Matrix<N, R, C, S>where
N: Scalar,
S: Storage<N, R, C>,
impl<N, R: Dim, C: Dim, S> Index<(usize, usize)> for Matrix<N, R, C, S>where
N: Scalar,
S: Storage<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> IndexMut<(usize, usize)> for Matrix<N, R, C, S>where
N: Scalar,
S: StorageMut<N, R, C>,
impl<N, R: Dim, C: Dim, S> IndexMut<(usize, usize)> for Matrix<N, R, C, S>where
N: Scalar,
S: StorageMut<N, R, C>,
source§impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> IndexMut<usize> for Matrix<N, R, C, S>
impl<N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> IndexMut<usize> for Matrix<N, R, C, S>
source§impl<N: Scalar, S> Into<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorage<N, U2, U2>,
impl<N: Scalar, S> Into<[[N; 2]; 2]> for Matrix<N, U2, U2, S>where
S: ContiguousStorage<N, U2, U2>,
source§impl<N: Scalar, S> Into<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorage<N, U2, U3>,
impl<N: Scalar, S> Into<[[N; 2]; 3]> for Matrix<N, U2, U3, S>where
S: ContiguousStorage<N, U2, U3>,
source§impl<N: Scalar, S> Into<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorage<N, U2, U4>,
impl<N: Scalar, S> Into<[[N; 2]; 4]> for Matrix<N, U2, U4, S>where
S: ContiguousStorage<N, U2, U4>,
source§impl<N: Scalar, S> Into<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorage<N, U2, U5>,
impl<N: Scalar, S> Into<[[N; 2]; 5]> for Matrix<N, U2, U5, S>where
S: ContiguousStorage<N, U2, U5>,
source§impl<N: Scalar, S> Into<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorage<N, U2, U6>,
impl<N: Scalar, S> Into<[[N; 2]; 6]> for Matrix<N, U2, U6, S>where
S: ContiguousStorage<N, U2, U6>,
source§impl<N: Scalar, S> Into<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorage<N, U3, U2>,
impl<N: Scalar, S> Into<[[N; 3]; 2]> for Matrix<N, U3, U2, S>where
S: ContiguousStorage<N, U3, U2>,
source§impl<N: Scalar, S> Into<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorage<N, U3, U3>,
impl<N: Scalar, S> Into<[[N; 3]; 3]> for Matrix<N, U3, U3, S>where
S: ContiguousStorage<N, U3, U3>,
source§impl<N: Scalar, S> Into<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorage<N, U3, U4>,
impl<N: Scalar, S> Into<[[N; 3]; 4]> for Matrix<N, U3, U4, S>where
S: ContiguousStorage<N, U3, U4>,
source§impl<N: Scalar, S> Into<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorage<N, U3, U5>,
impl<N: Scalar, S> Into<[[N; 3]; 5]> for Matrix<N, U3, U5, S>where
S: ContiguousStorage<N, U3, U5>,
source§impl<N: Scalar, S> Into<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorage<N, U3, U6>,
impl<N: Scalar, S> Into<[[N; 3]; 6]> for Matrix<N, U3, U6, S>where
S: ContiguousStorage<N, U3, U6>,
source§impl<N: Scalar, S> Into<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorage<N, U4, U2>,
impl<N: Scalar, S> Into<[[N; 4]; 2]> for Matrix<N, U4, U2, S>where
S: ContiguousStorage<N, U4, U2>,
source§impl<N: Scalar, S> Into<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorage<N, U4, U3>,
impl<N: Scalar, S> Into<[[N; 4]; 3]> for Matrix<N, U4, U3, S>where
S: ContiguousStorage<N, U4, U3>,
source§impl<N: Scalar, S> Into<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorage<N, U4, U4>,
impl<N: Scalar, S> Into<[[N; 4]; 4]> for Matrix<N, U4, U4, S>where
S: ContiguousStorage<N, U4, U4>,
source§impl<N: Scalar, S> Into<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorage<N, U4, U5>,
impl<N: Scalar, S> Into<[[N; 4]; 5]> for Matrix<N, U4, U5, S>where
S: ContiguousStorage<N, U4, U5>,
source§impl<N: Scalar, S> Into<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorage<N, U4, U6>,
impl<N: Scalar, S> Into<[[N; 4]; 6]> for Matrix<N, U4, U6, S>where
S: ContiguousStorage<N, U4, U6>,
source§impl<N: Scalar, S> Into<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorage<N, U5, U2>,
impl<N: Scalar, S> Into<[[N; 5]; 2]> for Matrix<N, U5, U2, S>where
S: ContiguousStorage<N, U5, U2>,
source§impl<N: Scalar, S> Into<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorage<N, U5, U3>,
impl<N: Scalar, S> Into<[[N; 5]; 3]> for Matrix<N, U5, U3, S>where
S: ContiguousStorage<N, U5, U3>,
source§impl<N: Scalar, S> Into<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorage<N, U5, U4>,
impl<N: Scalar, S> Into<[[N; 5]; 4]> for Matrix<N, U5, U4, S>where
S: ContiguousStorage<N, U5, U4>,
source§impl<N: Scalar, S> Into<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorage<N, U5, U5>,
impl<N: Scalar, S> Into<[[N; 5]; 5]> for Matrix<N, U5, U5, S>where
S: ContiguousStorage<N, U5, U5>,
source§impl<N: Scalar, S> Into<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorage<N, U5, U6>,
impl<N: Scalar, S> Into<[[N; 5]; 6]> for Matrix<N, U5, U6, S>where
S: ContiguousStorage<N, U5, U6>,
source§impl<N: Scalar, S> Into<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorage<N, U6, U2>,
impl<N: Scalar, S> Into<[[N; 6]; 2]> for Matrix<N, U6, U2, S>where
S: ContiguousStorage<N, U6, U2>,
source§impl<N: Scalar, S> Into<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorage<N, U6, U3>,
impl<N: Scalar, S> Into<[[N; 6]; 3]> for Matrix<N, U6, U3, S>where
S: ContiguousStorage<N, U6, U3>,
source§impl<N: Scalar, S> Into<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorage<N, U6, U4>,
impl<N: Scalar, S> Into<[[N; 6]; 4]> for Matrix<N, U6, U4, S>where
S: ContiguousStorage<N, U6, U4>,
source§impl<N: Scalar, S> Into<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorage<N, U6, U5>,
impl<N: Scalar, S> Into<[[N; 6]; 5]> for Matrix<N, U6, U5, S>where
S: ContiguousStorage<N, U6, U5>,
source§impl<N: Scalar, S> Into<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorage<N, U6, U6>,
impl<N: Scalar, S> Into<[[N; 6]; 6]> for Matrix<N, U6, U6, S>where
S: ContiguousStorage<N, U6, U6>,
source§impl<N, S> Into<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U1>,
impl<N, S> Into<[N; 1]> for Matrix<N, U1, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U1>,
source§impl<N, S> Into<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U10>,
impl<N, S> Into<[N; 10]> for Matrix<N, U1, U10, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U10>,
source§impl<N, S> Into<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U10, U1>,
impl<N, S> Into<[N; 10]> for Matrix<N, U10, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U10, U1>,
source§impl<N, S> Into<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U11>,
impl<N, S> Into<[N; 11]> for Matrix<N, U1, U11, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U11>,
source§impl<N, S> Into<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U11, U1>,
impl<N, S> Into<[N; 11]> for Matrix<N, U11, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U11, U1>,
source§impl<N, S> Into<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U12>,
impl<N, S> Into<[N; 12]> for Matrix<N, U1, U12, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U12>,
source§impl<N, S> Into<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U12, U1>,
impl<N, S> Into<[N; 12]> for Matrix<N, U12, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U12, U1>,
source§impl<N, S> Into<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U13>,
impl<N, S> Into<[N; 13]> for Matrix<N, U1, U13, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U13>,
source§impl<N, S> Into<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U13, U1>,
impl<N, S> Into<[N; 13]> for Matrix<N, U13, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U13, U1>,
source§impl<N, S> Into<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U14>,
impl<N, S> Into<[N; 14]> for Matrix<N, U1, U14, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U14>,
source§impl<N, S> Into<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U14, U1>,
impl<N, S> Into<[N; 14]> for Matrix<N, U14, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U14, U1>,
source§impl<N, S> Into<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U15>,
impl<N, S> Into<[N; 15]> for Matrix<N, U1, U15, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U15>,
source§impl<N, S> Into<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U15, U1>,
impl<N, S> Into<[N; 15]> for Matrix<N, U15, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U15, U1>,
source§impl<N, S> Into<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U16>,
impl<N, S> Into<[N; 16]> for Matrix<N, U1, U16, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U16>,
source§impl<N, S> Into<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U16, U1>,
impl<N, S> Into<[N; 16]> for Matrix<N, U16, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U16, U1>,
source§impl<N, S> Into<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U2>,
impl<N, S> Into<[N; 2]> for Matrix<N, U1, U2, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U2>,
source§impl<N, S> Into<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U2, U1>,
impl<N, S> Into<[N; 2]> for Matrix<N, U2, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U2, U1>,
source§impl<N, S> Into<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U3>,
impl<N, S> Into<[N; 3]> for Matrix<N, U1, U3, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U3>,
source§impl<N, S> Into<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U3, U1>,
impl<N, S> Into<[N; 3]> for Matrix<N, U3, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U3, U1>,
source§impl<N, S> Into<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U4>,
impl<N, S> Into<[N; 4]> for Matrix<N, U1, U4, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U4>,
source§impl<N, S> Into<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U4, U1>,
impl<N, S> Into<[N; 4]> for Matrix<N, U4, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U4, U1>,
source§impl<N, S> Into<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U5>,
impl<N, S> Into<[N; 5]> for Matrix<N, U1, U5, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U5>,
source§impl<N, S> Into<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U5, U1>,
impl<N, S> Into<[N; 5]> for Matrix<N, U5, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U5, U1>,
source§impl<N, S> Into<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U6>,
impl<N, S> Into<[N; 6]> for Matrix<N, U1, U6, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U6>,
source§impl<N, S> Into<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U6, U1>,
impl<N, S> Into<[N; 6]> for Matrix<N, U6, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U6, U1>,
source§impl<N, S> Into<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U7>,
impl<N, S> Into<[N; 7]> for Matrix<N, U1, U7, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U7>,
source§impl<N, S> Into<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U7, U1>,
impl<N, S> Into<[N; 7]> for Matrix<N, U7, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U7, U1>,
source§impl<N, S> Into<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U8>,
impl<N, S> Into<[N; 8]> for Matrix<N, U1, U8, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U8>,
source§impl<N, S> Into<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U8, U1>,
impl<N, S> Into<[N; 8]> for Matrix<N, U8, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U8, U1>,
source§impl<N, S> Into<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U9>,
impl<N, S> Into<[N; 9]> for Matrix<N, U1, U9, S>where
N: Scalar,
S: ContiguousStorage<N, U1, U9>,
source§impl<N, S> Into<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U9, U1>,
impl<N, S> Into<[N; 9]> for Matrix<N, U9, U1, S>where
N: Scalar,
S: ContiguousStorage<N, U9, U1>,
source§impl<'a, N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> IntoIterator for &'a Matrix<N, R, C, S>
impl<'a, N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> IntoIterator for &'a Matrix<N, R, C, S>
source§impl<'a, N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> IntoIterator for &'a mut Matrix<N, R, C, S>
impl<'a, N: Scalar, R: Dim, C: Dim, S: StorageMut<N, R, C>> IntoIterator for &'a mut Matrix<N, R, C, S>
source§impl<'a, 'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'a, 'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'a, 'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'a, 'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'a, 'b, N, D: DimNameAdd<U1>, C: TCategory> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
impl<'a, 'b, N, D: DimNameAdd<U1>, C: TCategory> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
source§impl<'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'b, N: Real, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'b, N, D: DimNameAdd<U1>, C: TCategory> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
impl<'b, N, D: DimNameAdd<U1>, C: TCategory> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
source§impl<'a, 'b, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
impl<'a, 'b, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
source§impl<'a, 'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
impl<'a, 'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
source§impl<'b, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
impl<'b, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
source§impl<'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
impl<'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
source§impl<'a, 'b, N: Real, S: Storage<N, U2>> Mul<&'b Matrix<N, U2, U1, S>> for &'a UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
impl<'a, 'b, N: Real, S: Storage<N, U2>> Mul<&'b Matrix<N, U2, U1, S>> for &'a UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
source§impl<'b, N: Real, S: Storage<N, U2>> Mul<&'b Matrix<N, U2, U1, S>> for UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
impl<'b, N: Real, S: Storage<N, U2>> Mul<&'b Matrix<N, U2, U1, S>> for UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
source§impl<'a, 'b, N: Real, SB: Storage<N, U3>> Mul<&'b Matrix<N, U3, U1, SB>> for &'a UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
impl<'a, 'b, N: Real, SB: Storage<N, U3>> Mul<&'b Matrix<N, U3, U1, SB>> for &'a UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
source§impl<'b, N: Real, SB: Storage<N, U3>> Mul<&'b Matrix<N, U3, U1, SB>> for UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
impl<'b, N: Real, SB: Storage<N, U3>> Mul<&'b Matrix<N, U3, U1, SB>> for UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
source§impl<'b, R: Dim, C: Dim, S: Storage<f32, R, C>> Mul<&'b Matrix<f32, R, C, S>> for f32where
DefaultAllocator: Allocator<f32, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<f32, R, C>> Mul<&'b Matrix<f32, R, C, S>> for f32where
DefaultAllocator: Allocator<f32, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<f64, R, C>> Mul<&'b Matrix<f64, R, C, S>> for f64where
DefaultAllocator: Allocator<f64, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<f64, R, C>> Mul<&'b Matrix<f64, R, C, S>> for f64where
DefaultAllocator: Allocator<f64, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<i16, R, C>> Mul<&'b Matrix<i16, R, C, S>> for i16where
DefaultAllocator: Allocator<i16, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<i16, R, C>> Mul<&'b Matrix<i16, R, C, S>> for i16where
DefaultAllocator: Allocator<i16, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<i32, R, C>> Mul<&'b Matrix<i32, R, C, S>> for i32where
DefaultAllocator: Allocator<i32, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<i32, R, C>> Mul<&'b Matrix<i32, R, C, S>> for i32where
DefaultAllocator: Allocator<i32, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<i64, R, C>> Mul<&'b Matrix<i64, R, C, S>> for i64where
DefaultAllocator: Allocator<i64, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<i64, R, C>> Mul<&'b Matrix<i64, R, C, S>> for i64where
DefaultAllocator: Allocator<i64, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<i8, R, C>> Mul<&'b Matrix<i8, R, C, S>> for i8where
DefaultAllocator: Allocator<i8, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<i8, R, C>> Mul<&'b Matrix<i8, R, C, S>> for i8where
DefaultAllocator: Allocator<i8, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<isize, R, C>> Mul<&'b Matrix<isize, R, C, S>> for isizewhere
DefaultAllocator: Allocator<isize, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<isize, R, C>> Mul<&'b Matrix<isize, R, C, S>> for isizewhere
DefaultAllocator: Allocator<isize, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<u16, R, C>> Mul<&'b Matrix<u16, R, C, S>> for u16where
DefaultAllocator: Allocator<u16, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<u16, R, C>> Mul<&'b Matrix<u16, R, C, S>> for u16where
DefaultAllocator: Allocator<u16, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<u32, R, C>> Mul<&'b Matrix<u32, R, C, S>> for u32where
DefaultAllocator: Allocator<u32, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<u32, R, C>> Mul<&'b Matrix<u32, R, C, S>> for u32where
DefaultAllocator: Allocator<u32, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<u64, R, C>> Mul<&'b Matrix<u64, R, C, S>> for u64where
DefaultAllocator: Allocator<u64, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<u64, R, C>> Mul<&'b Matrix<u64, R, C, S>> for u64where
DefaultAllocator: Allocator<u64, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<u8, R, C>> Mul<&'b Matrix<u8, R, C, S>> for u8where
DefaultAllocator: Allocator<u8, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<u8, R, C>> Mul<&'b Matrix<u8, R, C, S>> for u8where
DefaultAllocator: Allocator<u8, R, C>,
source§impl<'b, R: Dim, C: Dim, S: Storage<usize, R, C>> Mul<&'b Matrix<usize, R, C, S>> for usizewhere
DefaultAllocator: Allocator<usize, R, C>,
impl<'b, R: Dim, C: Dim, S: Storage<usize, R, C>> Mul<&'b Matrix<usize, R, C, S>> for usizewhere
DefaultAllocator: Allocator<usize, R, C>,
source§impl<'a, 'b, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Point<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
impl<'a, 'b, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Point<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
source§impl<'b, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Point<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
impl<'b, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Point<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
source§impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<'a, N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'a, N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'a, N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<'a, N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<'a, N, D: DimNameAdd<U1>, C: TCategory> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
impl<'a, N, D: DimNameAdd<U1>, C: TCategory> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
source§impl<N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Isometry<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
impl<N: Real, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R>where
R: AlgaRotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D>,
source§impl<N, D: DimNameAdd<U1>, C: TCategory> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
impl<N, D: DimNameAdd<U1>, C: TCategory> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul + Real,
DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, U1> + Allocator<N, DimNameSum<D, U1>, U1>,
source§impl<'a, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
impl<'a, N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
source§impl<'a, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
impl<'a, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
source§impl<N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
impl<N, R1: Dim, C1: Dim, R2: Dim, C2: Dim, SA, SB> Mul<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C2>,
SA: Storage<N, R1, C1>,
DefaultAllocator: Allocator<N, R1, C2>,
ShapeConstraint: AreMultipliable<R1, C1, R2, C2>,
source§impl<N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
impl<N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for Rotation<N, D1>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
DefaultAllocator: Allocator<N, D1, C2>,
ShapeConstraint: AreMultipliable<D1, D1, R2, C2>,
source§impl<'a, N: Real, S: Storage<N, U2>> Mul<Matrix<N, U2, U1, S>> for &'a UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
impl<'a, N: Real, S: Storage<N, U2>> Mul<Matrix<N, U2, U1, S>> for &'a UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
source§impl<N: Real, S: Storage<N, U2>> Mul<Matrix<N, U2, U1, S>> for UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
impl<N: Real, S: Storage<N, U2>> Mul<Matrix<N, U2, U1, S>> for UnitComplex<N>where
DefaultAllocator: Allocator<N, U2, U1>,
source§impl<'a, N: Real, SB: Storage<N, U3>> Mul<Matrix<N, U3, U1, SB>> for &'a UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
impl<'a, N: Real, SB: Storage<N, U3>> Mul<Matrix<N, U3, U1, SB>> for &'a UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
source§impl<N: Real, SB: Storage<N, U3>> Mul<Matrix<N, U3, U1, SB>> for UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
impl<N: Real, SB: Storage<N, U3>> Mul<Matrix<N, U3, U1, SB>> for UnitQuaternion<N>where
DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>,
source§impl<R: Dim, C: Dim, S: Storage<f32, R, C>> Mul<Matrix<f32, R, C, S>> for f32where
DefaultAllocator: Allocator<f32, R, C>,
impl<R: Dim, C: Dim, S: Storage<f32, R, C>> Mul<Matrix<f32, R, C, S>> for f32where
DefaultAllocator: Allocator<f32, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<f64, R, C>> Mul<Matrix<f64, R, C, S>> for f64where
DefaultAllocator: Allocator<f64, R, C>,
impl<R: Dim, C: Dim, S: Storage<f64, R, C>> Mul<Matrix<f64, R, C, S>> for f64where
DefaultAllocator: Allocator<f64, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<i16, R, C>> Mul<Matrix<i16, R, C, S>> for i16where
DefaultAllocator: Allocator<i16, R, C>,
impl<R: Dim, C: Dim, S: Storage<i16, R, C>> Mul<Matrix<i16, R, C, S>> for i16where
DefaultAllocator: Allocator<i16, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<i32, R, C>> Mul<Matrix<i32, R, C, S>> for i32where
DefaultAllocator: Allocator<i32, R, C>,
impl<R: Dim, C: Dim, S: Storage<i32, R, C>> Mul<Matrix<i32, R, C, S>> for i32where
DefaultAllocator: Allocator<i32, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<i64, R, C>> Mul<Matrix<i64, R, C, S>> for i64where
DefaultAllocator: Allocator<i64, R, C>,
impl<R: Dim, C: Dim, S: Storage<i64, R, C>> Mul<Matrix<i64, R, C, S>> for i64where
DefaultAllocator: Allocator<i64, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<i8, R, C>> Mul<Matrix<i8, R, C, S>> for i8where
DefaultAllocator: Allocator<i8, R, C>,
impl<R: Dim, C: Dim, S: Storage<i8, R, C>> Mul<Matrix<i8, R, C, S>> for i8where
DefaultAllocator: Allocator<i8, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<isize, R, C>> Mul<Matrix<isize, R, C, S>> for isizewhere
DefaultAllocator: Allocator<isize, R, C>,
impl<R: Dim, C: Dim, S: Storage<isize, R, C>> Mul<Matrix<isize, R, C, S>> for isizewhere
DefaultAllocator: Allocator<isize, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<u16, R, C>> Mul<Matrix<u16, R, C, S>> for u16where
DefaultAllocator: Allocator<u16, R, C>,
impl<R: Dim, C: Dim, S: Storage<u16, R, C>> Mul<Matrix<u16, R, C, S>> for u16where
DefaultAllocator: Allocator<u16, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<u32, R, C>> Mul<Matrix<u32, R, C, S>> for u32where
DefaultAllocator: Allocator<u32, R, C>,
impl<R: Dim, C: Dim, S: Storage<u32, R, C>> Mul<Matrix<u32, R, C, S>> for u32where
DefaultAllocator: Allocator<u32, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<u64, R, C>> Mul<Matrix<u64, R, C, S>> for u64where
DefaultAllocator: Allocator<u64, R, C>,
impl<R: Dim, C: Dim, S: Storage<u64, R, C>> Mul<Matrix<u64, R, C, S>> for u64where
DefaultAllocator: Allocator<u64, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<u8, R, C>> Mul<Matrix<u8, R, C, S>> for u8where
DefaultAllocator: Allocator<u8, R, C>,
impl<R: Dim, C: Dim, S: Storage<u8, R, C>> Mul<Matrix<u8, R, C, S>> for u8where
DefaultAllocator: Allocator<u8, R, C>,
source§impl<R: Dim, C: Dim, S: Storage<usize, R, C>> Mul<Matrix<usize, R, C, S>> for usizewhere
DefaultAllocator: Allocator<usize, R, C>,
impl<R: Dim, C: Dim, S: Storage<usize, R, C>> Mul<Matrix<usize, R, C, S>> for usizewhere
DefaultAllocator: Allocator<usize, R, C>,
source§impl<'a, N, R: Dim, C: Dim, S> Mul<N> for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<'a, N, R: Dim, C: Dim, S> Mul<N> for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> Mul<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<N, R: Dim, C: Dim, S> Mul<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<'a, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Point<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
impl<'a, N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Point<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
source§impl<N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Point<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
impl<N, R1: DimName, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Point<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, U1> + Allocator<N, R1, U1>,
ShapeConstraint: AreMultipliable<R1, C1, D2, U1>,
source§impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for Matrix<N, R1, C1, SA>where
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
DefaultAllocator: Allocator<N, R1, D2>,
ShapeConstraint: AreMultipliable<R1, C1, D2, D2>,
source§impl<'b, N, R1, C1, R2, SA, SB> MulAssign<&'b Matrix<N, R2, C1, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C1>,
SA: ContiguousStorageMut<N, R1, C1> + Clone,
ShapeConstraint: AreMultipliable<R1, C1, R2, C1>,
DefaultAllocator: Allocator<N, R1, C1, Buffer = SA>,
impl<'b, N, R1, C1, R2, SA, SB> MulAssign<&'b Matrix<N, R2, C1, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C1>,
SA: ContiguousStorageMut<N, R1, C1> + Clone,
ShapeConstraint: AreMultipliable<R1, C1, R2, C1>,
DefaultAllocator: Allocator<N, R1, C1, Buffer = SA>,
source§fn mul_assign(&mut self, rhs: &'b Matrix<N, R2, C1, SB>)
fn mul_assign(&mut self, rhs: &'b Matrix<N, R2, C1, SB>)
*=
operation. Read moresource§impl<N, R1, C1, R2, SA, SB> MulAssign<Matrix<N, R2, C1, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C1>,
SA: ContiguousStorageMut<N, R1, C1> + Clone,
ShapeConstraint: AreMultipliable<R1, C1, R2, C1>,
DefaultAllocator: Allocator<N, R1, C1, Buffer = SA>,
impl<N, R1, C1, R2, SA, SB> MulAssign<Matrix<N, R2, C1, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
N: Scalar + Zero + One + ClosedAdd + ClosedMul,
SB: Storage<N, R2, C1>,
SA: ContiguousStorageMut<N, R1, C1> + Clone,
ShapeConstraint: AreMultipliable<R1, C1, R2, C1>,
DefaultAllocator: Allocator<N, R1, C1, Buffer = SA>,
source§fn mul_assign(&mut self, rhs: Matrix<N, R2, C1, SB>)
fn mul_assign(&mut self, rhs: Matrix<N, R2, C1, SB>)
*=
operation. Read moresource§impl<N, R: Dim, C: Dim, S> MulAssign<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: StorageMut<N, R, C>,
impl<N, R: Dim, C: Dim, S> MulAssign<N> for Matrix<N, R, C, S>where
N: Scalar + ClosedMul,
S: StorageMut<N, R, C>,
source§fn mul_assign(&mut self, rhs: N)
fn mul_assign(&mut self, rhs: N)
*=
operation. Read moresource§impl<'a, N, R: Dim, C: Dim, S> Neg for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<'a, N, R: Dim, C: Dim, S> Neg for &'a Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> Neg for Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
impl<N, R: Dim, C: Dim, S> Neg for Matrix<N, R, C, S>where
N: Scalar + ClosedNeg,
S: Storage<N, R, C>,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> PartialEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar,
S: Storage<N, R, C>,
impl<N, R: Dim, C: Dim, S> PartialEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar,
S: Storage<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> PartialOrd<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + PartialOrd,
S: Storage<N, R, C>,
impl<N, R: Dim, C: Dim, S> PartialOrd<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + PartialOrd,
S: Storage<N, R, C>,
source§impl<'a, N, D: DimName> Product<&'a Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for MatrixN<N, D>where
N: Scalar + Zero + One + ClosedMul + ClosedAdd,
DefaultAllocator: Allocator<N, D, D>,
impl<'a, N, D: DimName> Product<&'a Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for MatrixN<N, D>where
N: Scalar + Zero + One + ClosedMul + ClosedAdd,
DefaultAllocator: Allocator<N, D, D>,
source§impl<N, D: DimName> Product<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for MatrixN<N, D>where
N: Scalar + Zero + One + ClosedMul + ClosedAdd,
DefaultAllocator: Allocator<N, D, D>,
impl<N, D: DimName> Product<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for MatrixN<N, D>where
N: Scalar + Zero + One + ClosedMul + ClosedAdd,
DefaultAllocator: Allocator<N, D, D>,
source§impl<N, R: Dim, C: Dim, S> RelativeEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + RelativeEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
impl<N, R: Dim, C: Dim, S> RelativeEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + RelativeEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
source§fn default_max_relative() -> Self::Epsilon
fn default_max_relative() -> Self::Epsilon
source§impl<'a, 'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<&'b Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'a, 'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<&'b Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'b, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'a, 'b, N, R1, C1, R2, C2, SA, SB> Sub<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'a, 'b, N, R1, C1, R2, C2, SA, SB> Sub<&'b Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
-
operator.source§impl<'b, N, R1, C1, R2, C2, SA, SB> Sub<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'b, N, R1, C1, R2, C2, SA, SB> Sub<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
-
operator.source§impl<'a, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<'a, N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<Matrix<N, D2, U1, SB>> for &'a Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
impl<N, D1: DimName, D2: Dim, SB: Storage<N, D2>> Sub<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
DefaultAllocator: Allocator<N, D1, U1> + Allocator<N, D2, U1> + SameShapeAllocator<N, D1, U1, D2, U1>,
ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1>,
source§impl<'a, N, R1, C1, R2, C2, SA, SB> Sub<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R2, C2, R1, C1>,
ShapeConstraint: SameNumberOfRows<R2, R1> + SameNumberOfColumns<C2, C1>,
impl<'a, N, R1, C1, R2, C2, SA, SB> Sub<Matrix<N, R2, C2, SB>> for &'a Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R2, C2, R1, C1>,
ShapeConstraint: SameNumberOfRows<R2, R1> + SameNumberOfColumns<C2, C1>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R2, R1>>::Representative, <ShapeConstraint as SameNumberOfColumns<C2, C1>>::Representative>>::Buffer>
-
operator.source§impl<N, R1, C1, R2, C2, SA, SB> Sub<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<N, R1, C1, R2, C2, SA, SB> Sub<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: Storage<N, R1, C1>,
SB: Storage<N, R2, C2>,
DefaultAllocator: SameShapeAllocator<N, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
§type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
type Output = Matrix<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative, <DefaultAllocator as Allocator<N, <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative, <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative>>::Buffer>
-
operator.source§impl<'b, N, D1: DimName, D2: Dim, SB> SubAssign<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
impl<'b, N, D1: DimName, D2: Dim, SB> SubAssign<&'b Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
source§fn sub_assign(&mut self, right: &'b Vector<N, D2, SB>)
fn sub_assign(&mut self, right: &'b Vector<N, D2, SB>)
-=
operation. Read moresource§impl<'b, N, R1, C1, R2, C2, SA, SB> SubAssign<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<'b, N, R1, C1, R2, C2, SA, SB> SubAssign<&'b Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
source§fn sub_assign(&mut self, rhs: &'b Matrix<N, R2, C2, SB>)
fn sub_assign(&mut self, rhs: &'b Matrix<N, R2, C2, SB>)
-=
operation. Read moresource§impl<N, D1: DimName, D2: Dim, SB> SubAssign<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
impl<N, D1: DimName, D2: Dim, SB> SubAssign<Matrix<N, D2, U1, SB>> for Point<N, D1>where
N: Scalar + ClosedSub,
SB: Storage<N, D2>,
DefaultAllocator: Allocator<N, D1>,
ShapeConstraint: SameNumberOfRows<D1, D2>,
source§fn sub_assign(&mut self, right: Vector<N, D2, SB>)
fn sub_assign(&mut self, right: Vector<N, D2, SB>)
-=
operation. Read moresource§impl<N, R1, C1, R2, C2, SA, SB> SubAssign<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<N, R1, C1, R2, C2, SA, SB> SubAssign<Matrix<N, R2, C2, SB>> for Matrix<N, R1, C1, SA>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N: Scalar + ClosedSub,
SA: StorageMut<N, R1, C1>,
SB: Storage<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
source§fn sub_assign(&mut self, rhs: Matrix<N, R2, C2, SB>)
fn sub_assign(&mut self, rhs: Matrix<N, R2, C2, SB>)
-=
operation. Read moresource§impl<N1, N2, D, R> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Isometry<N1, D, R>where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N1, D>> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>,
impl<N1, N2, D, R> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Isometry<N1, D, R>where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N1, D>> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>,
source§fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Rotation<N1, D>where
N1: Real,
N2: Real + SupersetOf<N1>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D>,
impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Rotation<N1, D>where
N1: Real,
N2: Real + SupersetOf<N1>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D>,
source§fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, D, R> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Similarity<N1, D, R>where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N1, D>> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>,
impl<N1, N2, D, R> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Similarity<N1, D, R>where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N1, D>> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
D: DimNameAdd<U1> + DimMin<D, Output = D>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>,
source§fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, D: DimName, C> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Transform<N1, D, C>where
N1: Real + SubsetOf<N2>,
N2: Real,
C: TCategory,
D: DimNameAdd<U1>,
DefaultAllocator: Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>,
N1::Epsilon: Copy,
N2::Epsilon: Copy,
impl<N1, N2, D: DimName, C> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Transform<N1, D, C>where
N1: Real + SubsetOf<N2>,
N2: Real,
C: TCategory,
D: DimNameAdd<U1>,
DefaultAllocator: Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>,
N1::Epsilon: Copy,
N2::Epsilon: Copy,
source§fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Translation<N1, D>where
N1: Real,
N2: Real + SupersetOf<N1>,
D: DimNameAdd<U1>,
DefaultAllocator: Allocator<N1, D> + Allocator<N2, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>,
impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Translation<N1, D>where
N1: Real,
N2: Real + SupersetOf<N1>,
D: DimNameAdd<U1>,
DefaultAllocator: Allocator<N1, D> + Allocator<N2, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>>,
source§fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, U1, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, U1>>::Buffer>> for Point<N1, D>where
D: DimNameAdd<U1>,
N1: Scalar,
N2: Scalar + Zero + One + ClosedDiv + SupersetOf<N1>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>> + Allocator<N2, D>,
impl<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, U1, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, U1>>::Buffer>> for Point<N1, D>where
D: DimNameAdd<U1>,
N1: Scalar,
N2: Scalar + Zero + One + ClosedDiv + SupersetOf<N1>,
DefaultAllocator: Allocator<N1, D> + Allocator<N1, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>> + Allocator<N2, D>,
source§fn to_superset(&self) -> VectorN<N2, DimNameSum<D, U1>>
fn to_superset(&self) -> VectorN<N2, DimNameSum<D, U1>>
self
to the equivalent element of its superset.source§fn is_in_subset(v: &VectorN<N2, DimNameSum<D, U1>>) -> bool
fn is_in_subset(v: &VectorN<N2, DimNameSum<D, U1>>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(v: &VectorN<N2, DimNameSum<D, U1>>) -> Self
unsafe fn from_superset_unchecked(v: &VectorN<N2, DimNameSum<D, U1>>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1, N2, R1, C1, R2, C2> SubsetOf<Matrix<N2, R2, C2, <DefaultAllocator as Allocator<N2, R2, C2>>::Buffer>> for MatrixMN<N1, R1, C1>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N1: Scalar,
N2: Scalar + SupersetOf<N1>,
DefaultAllocator: Allocator<N2, R2, C2> + Allocator<N1, R1, C1> + SameShapeAllocator<N1, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
impl<N1, N2, R1, C1, R2, C2> SubsetOf<Matrix<N2, R2, C2, <DefaultAllocator as Allocator<N2, R2, C2>>::Buffer>> for MatrixMN<N1, R1, C1>where
R1: Dim,
C1: Dim,
R2: Dim,
C2: Dim,
N1: Scalar,
N2: Scalar + SupersetOf<N1>,
DefaultAllocator: Allocator<N2, R2, C2> + Allocator<N1, R1, C1> + SameShapeAllocator<N1, R1, C1, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
source§fn to_superset(&self) -> MatrixMN<N2, R2, C2>
fn to_superset(&self) -> MatrixMN<N2, R2, C2>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &MatrixMN<N2, R2, C2>) -> bool
fn is_in_subset(m: &MatrixMN<N2, R2, C2>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &MatrixMN<N2, R2, C2>) -> Self
unsafe fn from_superset_unchecked(m: &MatrixMN<N2, R2, C2>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1: Real, N2: Real + SupersetOf<N1>> SubsetOf<Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>> for UnitComplex<N1>
impl<N1: Real, N2: Real + SupersetOf<N1>> SubsetOf<Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>> for UnitComplex<N1>
source§fn to_superset(&self) -> Matrix3<N2>
fn to_superset(&self) -> Matrix3<N2>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &Matrix3<N2>) -> bool
fn is_in_subset(m: &Matrix3<N2>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &Matrix3<N2>) -> Self
unsafe fn from_superset_unchecked(m: &Matrix3<N2>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<N1: Real, N2: Real + SupersetOf<N1>> SubsetOf<Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>> for UnitQuaternion<N1>
impl<N1: Real, N2: Real + SupersetOf<N1>> SubsetOf<Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>> for UnitQuaternion<N1>
source§fn to_superset(&self) -> Matrix4<N2>
fn to_superset(&self) -> Matrix4<N2>
self
to the equivalent element of its superset.source§fn is_in_subset(m: &Matrix4<N2>) -> bool
fn is_in_subset(m: &Matrix4<N2>) -> bool
element
is actually part of the subset Self
(and can be converted to it).source§unsafe fn from_superset_unchecked(m: &Matrix4<N2>) -> Self
unsafe fn from_superset_unchecked(m: &Matrix4<N2>) -> Self
self.to_superset
but without any property checks. Always succeeds.source§impl<'a, N, R: DimName, C: DimName> Sum<&'a Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for MatrixMN<N, R, C>where
N: Scalar + ClosedAdd + Zero,
DefaultAllocator: Allocator<N, R, C>,
impl<'a, N, R: DimName, C: DimName> Sum<&'a Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for MatrixMN<N, R, C>where
N: Scalar + ClosedAdd + Zero,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: DimName, C: DimName> Sum<Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for MatrixMN<N, R, C>where
N: Scalar + ClosedAdd + Zero,
DefaultAllocator: Allocator<N, R, C>,
impl<N, R: DimName, C: DimName> Sum<Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>> for MatrixMN<N, R, C>where
N: Scalar + ClosedAdd + Zero,
DefaultAllocator: Allocator<N, R, C>,
source§impl<N, R: Dim, C: Dim, S> UlpsEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + UlpsEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
impl<N, R: Dim, C: Dim, S> UlpsEq<Matrix<N, R, C, S>> for Matrix<N, R, C, S>where
N: Scalar + UlpsEq,
S: Storage<N, R, C>,
N::Epsilon: Copy,
impl<N: Copy + Scalar, R: Copy + Dim, C: Copy + Dim, S: Copy> Copy for Matrix<N, R, C, S>
impl<N, R: Dim, C: Dim, S> Eq for Matrix<N, R, C, S>where
N: Scalar + Eq,
S: Storage<N, R, C>,
Auto Trait Implementations§
impl<N, R, C, S> RefUnwindSafe for Matrix<N, R, C, S>where
C: RefUnwindSafe,
N: RefUnwindSafe,
R: RefUnwindSafe,
S: RefUnwindSafe,
impl<N, R, C, S> Send for Matrix<N, R, C, S>where
N: Send,
S: Send,
impl<N, R, C, S> Sync for Matrix<N, R, C, S>where
N: Sync,
S: Sync,
impl<N, R, C, S> Unpin for Matrix<N, R, C, S>where
C: Unpin,
N: Unpin,
R: Unpin,
S: Unpin,
impl<N, R, C, S> UnwindSafe for Matrix<N, R, C, S>where
C: UnwindSafe,
N: UnwindSafe,
R: UnwindSafe,
S: UnwindSafe,
Blanket Implementations§
source§impl<T> LowerBounded for Twhere
T: Bounded,
impl<T> LowerBounded for Twhere
T: Bounded,
source§impl<T> Rand for Twhere
Standard: Distribution<T>,
impl<T> Rand for Twhere
Standard: Distribution<T>,
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.