Struct Matrix2D 

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

Flat row-major 2D matrix.

Storage is a single Vec<T> of length rows * cols, indexed row * cols + col. Per-row access via Matrix2D::row is a contiguous slice; column access requires a strided walk.

Implementations

impl<T> Matrix2D<T>

pub fn empty() -> Self

Construct an empty matrix (0 × 0).

pub fn from_flat(data: Vec<T>, rows: usize, cols: usize) -> Result<Self>

Construct from a row-major flat buffer.

Errors

WaveletError::InvalidLength when data.len() != rows * cols.

pub fn from_rows(rows_in: Vec<Vec<T>>) -> Result<Self>

Construct from a Vec<Vec<T>>. All inner rows must have equal length.

An empty outer vector yields an empty matrix.

Errors

WaveletError::InvalidLength when row lengths are not uniform.

pub fn rows(&self) -> usize

Number of rows.

pub fn cols(&self) -> usize

Number of columns.

pub fn as_flat_slice(&self) -> &[T]

Flat backing buffer (row-major).

pub fn as_mut_flat_slice(&mut self) -> &mut [T]

Mutable flat backing buffer (row-major).

pub fn len(&self) -> usize

Number of elements (rows * cols).

pub fn is_empty(&self) -> bool

True when the backing buffer is empty.

pub fn iter(&self) -> Iter<'_, T>

Iterate the flat backing buffer.

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Iterate the flat backing buffer mutably.

pub fn iter_rows(&self) -> impl ExactSizeIterator<Item = &[T]> + '_

Iterate rows as contiguous slices. Yields exactly Matrix2D::rows items — including rows empty slices when cols == 0.

Each yielded slice goes through a bounds-checked &data[start..end], which costs ~1 ns per row vs Vec<Vec>::iter walking pointers (measurable on bench cwt/energy_by_scale/256 as +4 %). For any consumer doing real work per row the cost vanishes; only worth revisiting (e.g. via an unsafe { get_unchecked } path) if a SIMD kernel ever loops this iterator with nanosecond-scale per-row work.

pub fn iter_rows_mut(&mut self) -> impl Iterator<Item = &mut [T]> + '_

Iterate rows mutably. Yields exactly Matrix2D::rows items — including rows empty slices when cols == 0. Not ExactSizeIterator (the underlying std::iter::from_fn adapter can’t carry the length); use Matrix2D::rows for the count.

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

Element at (row, col) if in bounds.

pub fn get_mut(&mut self, row: usize, col: usize) -> Option<&mut T>

Mutable element at (row, col) if in bounds.

pub fn row(&self, row: usize) -> Option<&[T]>

Contiguous row slice.

pub fn row_mut(&mut self, row: usize) -> Option<&mut [T]>

Contiguous mutable row slice.

impl<T: Clone> Matrix2D<T>

pub fn to_rows(&self) -> Vec<Vec<T>>

Materialize as Vec<Vec<T>> for callers that expect the nested form.

pub fn resize(&mut self, rows: usize, cols: usize, value: T)

Reset shape and fill every cell with value.

Trait Implementations

impl<T: Clone> Clone for Matrix2D<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Matrix2D<T>

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

Formats the value using the given formatter.

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

type Output = T

The returned type after indexing.

fn index(&self, index: (usize, usize)) -> &Self::Output

Performs the indexing (container[index]) operation.

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

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

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