Struct static_math::matrix6x6::M66

pub struct M66<T>(_);

A static Matrix of 6x6 shape

Implementations

impl<T> M66<T>

pub fn new(data_input: [[T; 6]; 6]) -> Self

pub fn rows(&self) -> usize

pub fn cols(&self) -> usize

impl<T: Num + Copy + Sum> M66<T>

pub fn identity() -> M66<T>

contruct identity matrix

pub fn zeros() -> M66<T>

construct the matrix with all zeros

pub fn as_vec(&self) -> [T; 36]

transform the matrix to a flatten vector

pub fn get_diagonal(&self) -> V6<T>

get the diagonal of the matrix

pub fn new_from_vecs(cols: V6<V6<T>>) -> Self

pub fn get_rows(self) -> V6<V6<T>>

pub fn get_cols(self) -> V6<V6<T>>

pub fn get_upper_triangular(&self) -> [T; 15]

pub fn get_lower_triangular(&self) -> [T; 15]

Trait Implementations

impl<T: Num + Copy> Add<M66<T>> for M66<T>

type Output = Self

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self

Performs the + operation.

impl<T: Clone> Clone for M66<T>

fn clone(&self) -> M66<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Copy> Copy for M66<T>

impl<T: Debug> Debug for M66<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Deref for M66<T>

type Target = [[T; 6]; 6]

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> DerefMut for M66<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Num + Display> Display for M66<T>

fn fmt(&self, dest: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> From<[[T; 6]; 6]> for M66<T>

fn from(data: [[T; 6]; 6]) -> M66<T>

Performs the conversion.

impl<T> Index<(usize, usize)> for M66<T>

type Output = T

The returned type after indexing.

fn index(&self, index: (usize, usize)) -> &T

Performs the indexing (container[index]) operation.

impl<T> IndexMut<(usize, usize)> for M66<T>

fn index_mut(&mut self, index: (usize, usize)) -> &mut T

Performs the mutable indexing (container[index]) operation.

impl<T: Float + Sum> LinearAlgebra<T> for M66<T>

fn rows(&self) -> usize

get the rows of the matrix

fn cols(&self) -> usize

get the columns of the matrix

fn transpose(&self) -> Self

transpose dimentions of the matrix

fn trace(&self) -> T

get the trace of the matrix

fn norm2(&self) -> T

compute the euclidean norm of the matrix

fn det(&self) -> T

compute the determinant of the matrix

fn inverse(&self) -> Option<Self>

Calculate the inverse of the M66 via tha Adjoint Matrix:

A^(-1) = (1/det) * Adj

where: Adj = Cofactor.Transpose()

Cofactor = (-1)^(i+j) * M(i, j).det()

fn qr(&self) -> Option<(Self, Self)>

Calculate de QR factorization of the M66 via gram-schmidt orthogonalization process

fn shape(&self) -> (usize, usize)

get the overal shape of the matrix

impl<T: Num + Copy> Mul<M66<T>> for M66<T>

type Output = Self

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self

Performs the * operation.

impl<T: Num + Copy> Mul<M66<T>> for V6<T>

type Output = V6<T>

The resulting type after applying the * operator.

fn mul(self, rhs: M66<T>) -> V6<T>

Performs the * operation.

impl<T: Num + Copy> Mul<T> for M66<T>

type Output = M66<T>

The resulting type after applying the * operator.

fn mul(self, rhs: T) -> M66<T>

Performs the * operation.

impl<T: Num + Copy + Sum> Mul<V6<T>> for M66<T>

type Output = V6<T>

The resulting type after applying the * operator.

fn mul(self, rhs: V6<T>) -> V6<T>

Performs the * operation.

impl<T: Num + Copy> One for M66<T>

fn one() -> M66<T>

Create an identity matrix

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool where
    Self: PartialEq<Self>, 

Returns true if self is equal to the multiplicative identity.

impl<T: PartialEq> PartialEq<M66<T>> for M66<T>

fn eq(&self, other: &M66<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &M66<T>) -> bool

This method tests for !=.

impl<T> StructuralPartialEq for M66<T>

impl<T: Num + Copy> Sub<M66<T>> for M66<T>

type Output = Self

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl<T: Num + Copy> Zero for M66<T>

fn zero() -> M66<T>

Returns the additive identity element of Self, 0. # Purity

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.