Struct Matrix 

pub struct Matrix<T> { /* private fields */ }

Implementations

impl<T: Copy> Matrix<T>

pub fn get_mut_data<'a>(&'a mut self) -> &'a mut Vec<T>

pub fn get_mref<'lt>(&'lt mut self, row: usize, col: usize) -> &'lt mut T

pub fn mmap<'a>(&'a mut self, f: &dyn Fn(&T) -> T) -> &'a mut Matrix<T>

impl<T: Num + Neg<Output = T> + Copy> Matrix<T>

pub fn mneg<'a>(&'a mut self) -> &'a mut Matrix<T>

pub fn mscale<'a>(&'a mut self, factor: T) -> &'a mut Matrix<T>

pub fn madd<'a>(&'a mut self, m: &Matrix<T>) -> &'a mut Matrix<T>

pub fn msub<'a>(&'a mut self, m: &Matrix<T>) -> &'a mut Matrix<T>

pub fn melem_mul<'a>(&'a mut self, m: &Matrix<T>) -> &'a mut Matrix<T>

pub fn melem_div<'a>(&'a mut self, m: &Matrix<T>) -> &'a mut Matrix<T>

pub fn mmul<'a>( &self, m: &Matrix<T>, dst: &'a mut Matrix<T>, ) -> &'a mut Matrix<T>

impl<T: Copy> Matrix<T>

pub fn set<'a>( &'a mut self, row: usize, col: usize, val: T, ) -> &'a mut Matrix<T>

pub fn mt<'a>(&'a mut self) -> &'a mut Matrix<T>

impl<T: Copy> Matrix<T>

pub fn new(no_rows: usize, no_cols: usize, data: Vec<T>) -> Matrix<T>

pub fn dirty(no_rows: usize, no_cols: usize) -> Matrix<T>

pub fn vector(data: Vec<T>) -> Matrix<T>

pub fn row_vector(data: Vec<T>) -> Matrix<T>

pub fn rows(&self) -> usize

pub fn cols(&self) -> usize

pub fn get_data<'a>(&'a self) -> &'a Vec<T>

pub fn get_ref<'lt>(&'lt self, row: usize, col: usize) -> &'lt T

pub fn map<S: Copy>(&self, f: &dyn Fn(&T) -> S) -> Matrix<S>

pub fn reduce<S: Copy>( &self, init: &Vec<S>, f: &dyn Fn(&S, &T) -> S, ) -> Matrix<S>

pub fn is_square(&self) -> bool

pub fn is_not_square(&self) -> bool

impl<T: Num + Copy> Matrix<T>

pub fn id(m: usize, n: usize) -> Matrix<T>

pub fn zero(no_rows: usize, no_cols: usize) -> Matrix<T>

pub fn diag(data: Vec<T>) -> Matrix<T>

pub fn block_diag(m: usize, n: usize, data: Vec<T>) -> Matrix<T>

pub fn zero_vector(no_rows: usize) -> Matrix<T>

pub fn one_vector(no_rows: usize) -> Matrix<T>

impl<T: Num + Neg<Output = T> + Copy> Matrix<T>

pub fn scale(&self, factor: T) -> Matrix<T>

pub fn elem_mul(&self, m: &Matrix<T>) -> Matrix<T>

pub fn elem_div(&self, m: &Matrix<T>) -> Matrix<T>

pub fn dot(&self, m: &Matrix<T>) -> T

impl<T: Copy> Matrix<T>

pub fn get(&self, row: usize, col: usize) -> T

pub fn cr(&self, m: &Matrix<T>) -> Matrix<T>

pub fn cb(&self, m: &Matrix<T>) -> Matrix<T>

pub fn t(&self) -> Matrix<T>

pub fn minor(&self, row: usize, col: usize) -> Matrix<T>

pub fn sub_matrix<RRI, RCI, RR, RC>(&self, rows: RR, cols: RC) -> Matrix<T>

where RRI: MatrixRangeIterator, RCI: MatrixRangeIterator, RR: MatrixRange<RRI>, RC: MatrixRange<RCI>,

pub fn get_columns<RCI: MatrixRangeIterator, RC: MatrixRange<RCI>>( &self, columns: RC, ) -> Matrix<T>

pub fn get_rows<RCI: MatrixRangeIterator, RC: MatrixRange<RCI>>( &self, row: RC, ) -> Matrix<T>

pub fn permute(&self, rows: &[usize], columns: &[usize]) -> Matrix<T>

pub fn permute_rows(&self, rows: &[usize]) -> Matrix<T>

pub fn permute_columns(&self, columns: &[usize]) -> Matrix<T>

pub fn filter_rows(&self, f: &dyn Fn(&Matrix<T>, usize) -> bool) -> Matrix<T>

pub fn filter_columns(&self, f: &dyn Fn(&Matrix<T>, usize) -> bool) -> Matrix<T>

pub fn select_rows(&self, selector: &[bool]) -> Matrix<T>

pub fn select_columns(&self, selector: &[bool]) -> Matrix<T>

impl<T: Debug + Copy> Matrix<T>

pub fn print(&self)

impl<T: Rand + Copy> Matrix<T>

pub fn random(no_rows: usize, no_cols: usize) -> Matrix<T>

impl<T: Float + ApproxEq<T> + Signed + Copy> Matrix<T>

pub fn trace(&self) -> T

pub fn det(&self) -> T

pub fn solve(&self, b: &Matrix<T>) -> Option<Matrix<T>>

pub fn inverse(&self) -> Option<Matrix<T>>

pub fn is_singular(&self) -> bool

pub fn is_non_singular(&self) -> bool

pub fn pinverse(&self) -> Matrix<T>

pub fn vector_euclidean_norm(&self) -> T

pub fn length(&self) -> T

pub fn vector_1_norm(&self) -> T

pub fn vector_2_norm(&self) -> T

pub fn vector_p_norm(&self, p: T) -> T

pub fn frobenius_norm(&self) -> T

pub fn vector_inf_norm(&self) -> T

pub fn is_symmetric(&self) -> bool

pub fn is_non_symmetric(&self) -> bool

pub fn approx_eq(&self, m: &Matrix<T>) -> bool

Trait Implementations

impl<'a, 'b, T: Add<T, Output = T> + Copy> Add<&'a Matrix<T>> for &'b Matrix<T>

type Output = Matrix<T>

The resulting type after applying the + operator.

fn add(self, m: &Matrix<T>) -> Matrix<T>

Performs the + operation.

impl<'a, T: Add<T, Output = T> + Copy> Add<&'a Matrix<T>> for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the + operator.

fn add(self, m: &Matrix<T>) -> Matrix<T>

Performs the + operation.

impl<'a, T: Add<T, Output = T> + Copy> Add<Matrix<T>> for &'a Matrix<T>

type Output = Matrix<T>

The resulting type after applying the + operator.

fn add(self, m: Matrix<T>) -> Matrix<T>

Performs the + operation.

impl<T: Add<T, Output = T> + Copy> Add for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the + operator.

fn add(self, m: Matrix<T>) -> Matrix<T>

Performs the + operation.

impl<'a, T: Copy> BitOr<&'a Matrix<T>> for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &Matrix<T>) -> Matrix<T>

Performs the | operation.

impl<T: Clone> Clone for Matrix<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Copy> Debug for Matrix<T>

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

Formats the value using the given formatter.

impl<T: Copy> Index<(usize, usize)> for Matrix<T>

type Output = T

The returned type after indexing.

fn index<'a>(&'a self, (y, x): (usize, usize)) -> &'a T

Performs the indexing (container[index]) operation.

impl<'a, 'b, T: Add<T, Output = T> + Mul<T, Output = T> + Zero + Copy> Mul<&'a Matrix<T>> for &'b Matrix<T>

type Output = Matrix<T>

The resulting type after applying the * operator.

fn mul(self, m: &'a Matrix<T>) -> Matrix<T>

Performs the * operation.

impl<'a, T: Add<T, Output = T> + Mul<T, Output = T> + Zero + Copy> Mul<&'a Matrix<T>> for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the * operator.

fn mul(self, m: &'a Matrix<T>) -> Matrix<T>

Performs the * operation.

impl<'a, T: Add<T, Output = T> + Mul<T, Output = T> + Zero + Copy> Mul<Matrix<T>> for &'a Matrix<T>

type Output = Matrix<T>

The resulting type after applying the * operator.

fn mul(self, m: Matrix<T>) -> Matrix<T>

Performs the * operation.

impl<T: Add<T, Output = T> + Mul<T, Output = T> + Zero + Copy> Mul for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the * operator.

fn mul(self, m: Matrix<T>) -> Matrix<T>

Performs the * operation.

impl<'a, T: Neg<Output = T> + Copy> Neg for &'a Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn neg(self) -> Matrix<T>

Performs the unary - operation.

impl<T: Neg<Output = T> + Copy> Neg for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn neg(self) -> Matrix<T>

Performs the unary - operation.

impl<T: PartialEq> PartialEq for Matrix<T>

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, 'b, T: Sub<T, Output = T> + Copy> Sub<&'a Matrix<T>> for &'b Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn sub(self, m: &Matrix<T>) -> Matrix<T>

Performs the - operation.

impl<'a, T: Sub<T, Output = T> + Copy> Sub<&'a Matrix<T>> for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn sub(self, m: &Matrix<T>) -> Matrix<T>

Performs the - operation.

impl<'a, T: Sub<T, Output = T> + Copy> Sub<Matrix<T>> for &'a Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn sub(self, m: Matrix<T>) -> Matrix<T>

Performs the - operation.

impl<T: Sub<T, Output = T> + Copy> Sub for Matrix<T>

type Output = Matrix<T>

The resulting type after applying the - operator.

fn sub(self, m: Matrix<T>) -> Matrix<T>

Performs the - operation.

impl<T> StructuralPartialEq for Matrix<T>