Struct ggez::graphics::na::QR

pub struct QR<N, R, C> where
    C: Dim,
    N: Real,
    R: DimMin<C>,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>,  { /* fields omitted */ }

The QR decomposition of a general matrix.

Methods

impl<N, R, C> QR<N, R, C> where
    C: Dim,
    N: Real,
    R: DimMin<C>,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, R, U1>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, 

fn new(
    matrix: Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>
) -> QR<N, R, C>

Computes the QR decomposition using householder reflections.

fn r(
    &self
) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,
    <R as DimMin<C>>::Output: DimMin<C>,
    <<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output, 

Retrieves the upper trapezoidal submatrix R of this decomposition.

fn unpack_r(
    self
) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where
    DefaultAllocator: Reallocator<N, R, C, <R as DimMin<C>>::Output, C>,
    <R as DimMin<C>>::Output: DimMin<C>,
    <<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output, 

Retrieves the upper trapezoidal submatrix R of this decomposition.

This is usually faster than r but consumes self.

fn q(
    &self
) -> Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer> where
    DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>, 

Computes the orthogonal matrix Q of this decomposition.

fn unpack(
    self
) -> (Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer>) where
    <R as DimMin<C>>::Output: DimMin<C>,
    DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,
    DefaultAllocator: Reallocator<N, R, C, <R as DimMin<C>>::Output, C>,
    <<R as DimMin<C>>::Output as DimMin<C>>::Output == <R as DimMin<C>>::Output, 

Unpacks this decomposition into its two matrix factors.

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

Multiplies the provided matrix by the transpose of the Q matrix of this decomposition.

impl<N, D> QR<N, D, D> where
    D: DimMin<D, Output = D>,
    N: Real,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn solve<R2, C2, S2>(
    &self,
    b: &Matrix<N, R2, C2, S2>
) -> Option<Matrix<N, R2, C2, <DefaultAllocator as Allocator<N, R2, C2>>::Buffer>> where
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>,
    ShapeConstraint: SameNumberOfRows<R2, D>,
    DefaultAllocator: Allocator<N, R2, C2>, 

Solves the linear system self * x = b, where x is the unknown to be determined.

Returns None if self is not invertible.

fn solve_mut<R2, C2, S2>(&self, b: &mut Matrix<N, R2, C2, S2>) -> bool where
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>,
    ShapeConstraint: SameNumberOfRows<R2, D>, 

Solves the linear system self * x = b, where x is the unknown to be determined.

If the decomposed matrix is not invertible, this returns false and its input b is overwritten with garbage.

fn try_inverse(
    &self
) -> Option<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>>

Computes the inverse of the decomposed matrix.

Returns None if the decomposed matrix is not invertible.

fn is_invertible(&self) -> bool

Indicates if the decomposed matrix is invertible.

Trait Implementations

impl<N, R, C> Copy for QR<N, R, C> where
    C: Dim,
    N: Real,
    R: DimMin<C>,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>,
    Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Copy,
    Matrix<N, <R as DimMin<C>>::Output, U1, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, U1>>::Buffer>: Copy, 

impl<N, R, C> Clone for QR<N, R, C> where
    C: Dim + Clone,
    N: Clone + Real,
    R: DimMin<C> + Clone,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, 

fn clone(&self) -> QR<N, R, C>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N, R, C> Debug for QR<N, R, C> where
    C: Dim + Debug,
    N: Debug + Real,
    R: DimMin<C> + Debug,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, 

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.