pub struct Mat<T> { /* private fields */ }Expand description
Column-major dense matrix with infallible indexing.
Implementations§
Source§impl<T> Mat<T>
impl<T> Mat<T>
Sourcepub fn from_vec_col_major(shape: [usize; 2], data: Vec<T>) -> Self
pub fn from_vec_col_major(shape: [usize; 2], data: Vec<T>) -> Self
Wrap a column-major buffer.
§Panics
Panics if data.len() != nrows * ncols; callers construct the buffer
with the matching size.
Sourcepub fn from_fn<F: FnMut(&[usize]) -> T>(shape: [usize; 2], f: F) -> Self
pub fn from_fn<F: FnMut(&[usize]) -> T>(shape: [usize; 2], f: F) -> Self
Build a matrix by evaluating f(&[i, j]) for every element.
Sourcepub fn dims(&self) -> [usize; 2]
pub fn dims(&self) -> [usize; 2]
Shape as [nrows, ncols], the form Mat::from_fn takes.
pub fn nrows(&self) -> usize
pub fn ncols(&self) -> usize
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
Sourcepub fn as_mut_slice(&mut self) -> &mut [T]
pub fn as_mut_slice(&mut self) -> &mut [T]
Mutable column-major storage.
Trait Implementations§
impl<T: PartialEq> StructuralPartialEq for Mat<T>
Auto Trait Implementations§
impl<T> Freeze for Mat<T>
impl<T> RefUnwindSafe for Mat<T>where
T: RefUnwindSafe,
impl<T> Send for Mat<T>where
T: Send,
impl<T> Sync for Mat<T>where
T: Sync,
impl<T> Unpin for Mat<T>where
T: Unpin,
impl<T> UnsafeUnpin for Mat<T>
impl<T> UnwindSafe for Mat<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.