Struct DenseMatrix 

pub struct DenseMatrix<T, I>
where
    I: Coordinate,
{ /* private fields */ }

DenseMatrix pre-allocates storage for every storage cell.

Trait Implementations

impl<T, I> Clone for DenseMatrix<T, I>

where T: Clone, I: Coordinate,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, I> Debug for DenseMatrix<T, I>

where I: Coordinate + Debug,

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

Formats the value using the given formatter.

impl<'a, T, I> Index<MatrixAddress<I>> for DenseMatrix<T, I>

where I: Coordinate,

type Output = T

The returned type after indexing.

fn index(&self, index: MatrixAddress<I>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T, I> IndexMut<MatrixAddress<I>> for DenseMatrix<T, I>

where I: Coordinate,

fn index_mut(&mut self, index: MatrixAddress<I>) -> &mut T

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

impl<'a, T, I> Matrix<'a, T, I> for DenseMatrix<T, I>

where T: 'static + 'a, I: Coordinate,

fn row_count(&self) -> I

row_count returns the number of horizontal rows stored in the Matrix.

fn column_count(&self) -> I

column_count returns the number of vertical columns stored in the Matrix.

fn addresses(&self) -> MatrixForwardIterator<I>

addresses iterates over the addresses in a Matrix in row-major order.

fn iter(&'a self) -> MatrixValueIterator<'a, T, I>

iter iterates over the values in a matrix in row-major order.

fn indexed_iter(&self) -> MatrixForwardIndexedIterator<'_, T, I>

indexed_iter returns addresses and their cell’s contents as an iterator.

fn row(&'a self, row_num: I) -> Option<Row<'a, T, I>>

row retrieves a row by index. None is returned for out of bounds row numbers.

fn column(&'a self, column_num: I) -> Option<Column<'a, T, I>>

column retrieves a column by index. None is returned for out of bounds column numbers.

fn rows(&'a self) -> MatrixRowsIterator<'a, T, I>

rows returns an iterator over the rows of the matrix.

fn columns(&'a self) -> MatrixColumnsIterator<'a, T, I>

columns returns an iterator over the columns of the matrix.

impl<'a, 'b, T, V, I> MatrixMap<'a, 'b, T, V, I> for DenseMatrix<T, I>

where T: 'static, V: 'static, I: 'static + Coordinate,

fn map_matrix(&'a self, f: &'a dyn Fn(&T) -> V) -> DenseMatrix<V, I>

map creates a Matrix<V, I> from a Matrix<T, I> using a helper function to transform each element.

fn map_indexed_matrix( &'a self, f: &mut dyn FnMut(MatrixAddress<I>, &T) -> V, ) -> DenseMatrix<V, I>

map_indexed_matrix creates a Matrix<V, I> from a Matrix<T, I> using a helper function that takes the address and value of each element.

impl<T, I> PartialEq for DenseMatrix<T, I>

where T: PartialEq, I: Coordinate,

fn eq(&self, other: &Self) -> 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, T: 'a, I> Tensor<T, I, MatrixAddress<I>, 2> for DenseMatrix<T, I>

where I: Coordinate,

fn range(&self) -> Range<MatrixAddress<I>>

range provides the bounds of the address space for the Tensor. The lower (inclusive bound) is the origin, conceptually placed at the left of a vector, the upper left of a matrix, and so on. That lower bound is conventionally zero-based, but does not have to be. The upper bound (exclusive) is the right side of the vector, the lower right of the matrix, etc. Be aware that while Range provides iterator functionality, once you move beyond single-dimension Tensors, that iterator does not provide the correct iteration of available addresses.

fn get(&self, address: MatrixAddress<I>) -> Option<&T>

An out-of-range-safe version of the Index trait.

fn get_mut(&mut self, address: MatrixAddress<I>) -> Option<&mut T>

An out-of-range-safe version of the IndexMut trait.

fn contains(&self, address: A) -> bool

contains is true if the given address is within the Tensor’s bounds for all dimensions.

impl<T, I> Eq for DenseMatrix<T, I>

where T: Eq, I: Coordinate,