Type Alias SparseRowMatRef 

pub type SparseRowMatRef<'a, I, T, Rows = usize, Cols = usize> = SparseRowMat<Ref<'a, I, T, Rows, Cols>>;

view over sparse row major matrix

see SymbolicSparseRowMatRef

Aliased Type

#[repr(transparent)]
pub struct SparseRowMatRef<'a, I, T, Rows = usize, Cols = usize>(/* private fields */);

Implementations

impl<'a, Rows: Shape, Cols: Shape, I: Index, T> SparseRowMatRef<'a, I, T, Rows, Cols>

pub fn new( symbolic: SymbolicSparseRowMatRef<'a, I, Rows, Cols>, val: &'a [T], ) -> Self

creates a new sparse matrix view.

panics

panics if the length of values is not equal to the length of symbolic.col_idx()

pub fn parts(self) -> (SymbolicSparseRowMatRef<'a, I, Rows, Cols>, &'a [T])

returns the symbolic and numeric components of the sparse matrix

pub fn symbolic(&self) -> SymbolicSparseRowMatRef<'a, I, Rows, Cols>

returns the symbolic component of the sparse matrix

pub fn val(self) -> &'a [T]

returns the numeric component of the sparse matrix

pub fn val_of_row(self, i: Idx<Rows>) -> &'a [T]

returns a view over the values of row i

pub fn as_shape<V: Shape, H: Shape>( self, nrows: V, ncols: H, ) -> SparseRowMatRef<'a, I, T, V, H>

returns the input matrix with the given shape after checking that it matches the current shape

pub fn get(self, row: Idx<Rows>, col: Idx<Cols>) -> Option<&'a T>

returns a reference to the value at the given index, or None if the symbolic structure doesn’t contain it, or contains multiple indices with the given index

panics

• panics if row >= self.nrows()
• panics if col >= self.ncols()

pub fn as_dyn(self) -> SparseRowMatRef<'a, I, T>

returns the input matrix with dynamic shape

pub fn as_ref(self) -> SparseRowMatRef<'a, I, T, Rows, Cols>

returns a view over self

pub fn transpose(self) -> SparseColMatRef<'a, I, T, Cols, Rows>

returns a view over the transpose of self

pub fn conjugate(self) -> SparseRowMatRef<'a, I, T::Conj, Rows, Cols>

where T: Conjugate,

returns a view over the conjugate of self

pub fn adjoint(self) -> SparseColMatRef<'a, I, T::Conj, Cols, Rows>

where T: Conjugate,

returns a view over the adjoint of self

pub fn canonical(self) -> SparseRowMatRef<'a, I, T::Canonical, Rows, Cols>

where T: Conjugate,

returns an unconjugated view over self

pub fn to_col_major( &self, ) -> Result<SparseColMat<I, T::Canonical, Rows, Cols>, FaerError>

where T: Conjugate,

returns a newly allocated matrix holding the (possibly conjugated) values of self in column major format

pub fn to_dense(&self) -> Mat<T::Canonical, Rows, Cols>

where T: Conjugate,

returns a newly allocated dense matrix holding the (possibly conjugated) values of self

pub fn triplet_iter( self, ) -> impl 'a + Iterator<Item = Triplet<Idx<Rows>, Idx<Cols>, &'a T>>

where Rows: 'a, Cols: 'a,

returns an iterator over the entries of the matrix.

Trait Implementations

impl<T: ComplexField, I: Index, ViewT: Conjugate<Canonical = T>> BiLinOp<T> for SparseRowMatRef<'_, I, ViewT>

fn transpose_apply_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq

computes the workspace layout required to apply the transpose or adjoint o self to a matrix with rhs_ncols columns

fn transpose_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, stack: &mut MemStack, )

applies the transpose of self to rhs, and stores the result in out

fn adjoint_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, stack: &mut MemStack, )

applies the adjoint of self to rhs, and stores the result in out

impl<T: ComplexField, I: Index, ViewT: Conjugate<Canonical = T>> BiPrecond<T> for SparseRowMatRef<'_, I, ViewT>

fn transpose_apply_in_place_scratch( &self, rhs_ncols: usize, par: Par, ) -> StackReq

computes the workspace layout required to apply the transpose or adjoint of self to a matrix with rhs_ncols columns in place

fn transpose_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack, )

applies the transpose of self to rhs, and stores the result in rhs

fn adjoint_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack, )

applies the adjoint of self to rhs, and stores the result in rhs

impl<Rows: Shape, Cols: Shape, I: Index, T: Debug> Debug for SparseRowMatRef<'_, I, T, Rows, Cols>

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

Formats the value using the given formatter.

impl<'a, Rows: Shape, Cols: Shape, I: Index, T> Deref for SparseRowMatRef<'a, I, T, Rows, Cols>

type Target = SymbolicSparseRowMat<Ref<'a, I, Rows, Cols>>

The resulting type after dereferencing.

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

Dereferences the value.

impl<I: Index, T> Index<(usize, usize)> for SparseRowMatRef<'_, I, T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T: ComplexField, I: Index, ViewT: Conjugate<Canonical = T>> LinOp<T> for SparseRowMatRef<'_, I, ViewT>

fn nrows(&self) -> usize

output dimension of the operator

fn ncols(&self) -> usize

input dimension of the operator

fn apply_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq

computes the workspace layout required to apply self or the conjugate o self to a matrix with rhs_ncols columns

fn apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, stack: &mut MemStack, )

applies self to rhs, and stores the result in out

fn conj_apply( &self, out: MatMut<'_, T>, rhs: MatRef<'_, T>, par: Par, stack: &mut MemStack, )

applies the conjugate of self to rhs, and stores the result in out

impl<T: ComplexField, I: Index, ViewT: Conjugate<Canonical = T>> Precond<T> for SparseRowMatRef<'_, I, ViewT>

fn apply_in_place_scratch(&self, rhs_ncols: usize, par: Par) -> StackReq

computes the workspace layout required to apply self or the conjugate of self to a matrix with rhs_ncols columns in place

fn apply_in_place(&self, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack)

applies self to rhs, and stores the result in rhs

fn conj_apply_in_place( &self, rhs: MatMut<'_, T>, par: Par, stack: &mut MemStack, )

applies the conjugate of self to rhs, and stores the result in rhs