SymbolicSparseRowMat

Type Alias SymbolicSparseRowMat 

Source
pub type SymbolicSparseRowMat<I, Rows = usize, Cols = usize> = SymbolicSparseRowMat<Own<I, Rows, Cols>>;
Expand description

owning symbolic structure of sparse matrix in row format, either compressed or uncompressed

see SymbolicSparseRowMatRef

Aliased Type§

#[repr(transparent)]
pub struct SymbolicSparseRowMat<I, Rows = usize, Cols = usize>(pub Own<I, Rows, Cols>);

Tuple Fields§

§0: Own<I, Rows, Cols>

Implementations§

Source§

impl<Rows: Shape, Cols: Shape, I: Index> SymbolicSparseRowMat<I, Rows, Cols>

Source

pub unsafe fn new_unchecked( nrows: Rows, ncols: Cols, row_ptr: Vec<I>, row_nnz: Option<Vec<I>>, col_idx: Vec<I>, ) -> Self

Source

pub fn new_checked( nrows: Rows, ncols: Cols, row_ptr: Vec<I>, row_nnz: Option<Vec<I>>, col_idx: Vec<I>, ) -> Self

Source

pub fn new_unsorted_checked( nrows: Rows, ncols: Cols, row_ptr: Vec<I>, row_nnz: Option<Vec<I>>, col_idx: Vec<I>, ) -> Self

Source

pub fn parts(&self) -> (Rows, Cols, &[I], Option<&[I]>, &[I])

Source

pub fn into_parts(self) -> (Rows, Cols, Vec<I>, Option<Vec<I>>, Vec<I>)

Source

pub fn nrows(&self) -> Rows

Source

pub fn ncols(&self) -> Cols

Source

pub fn shape(&self) -> (Rows, Cols)

Source

pub fn transpose(&self) -> SymbolicSparseColMatRef<'_, I, Cols, Rows>

Source

pub fn into_transpose(self) -> SymbolicSparseColMat<I, Cols, Rows>

Source

pub fn to_owned(&self) -> Result<SymbolicSparseRowMat<I, Rows, Cols>, FaerError>

Source

pub fn to_col_major( &self, ) -> Result<SymbolicSparseColMat<I, Rows, Cols>, FaerError>

Source

pub fn compute_nnz(&self) -> usize

Source

pub fn row_ptr(&self) -> &[I]

Source

pub fn row_nnz(&self) -> Option<&[I]>

Source

pub fn col_idx(&self) -> &[I]

Source

pub fn row_range(&self, i: Idx<Rows>) -> Range<usize>

Source

pub unsafe fn row_range_unchecked(&self, i: Idx<Rows>) -> Range<usize>

Source

pub fn col_idx_of_row_raw(&self, i: Idx<Rows>) -> &[Idx<Cols, I>]

Source

pub fn col_idx_of_row( &self, i: Idx<Rows>, ) -> impl '_ + Clone + ExactSizeIterator + DoubleEndedIterator<Item = Idx<Cols>>

Source

pub fn as_shape<V: Shape, H: Shape>( &self, nrows: V, ncols: H, ) -> SymbolicSparseRowMatRef<'_, I, V, H>

Source

pub fn into_shape<V: Shape, H: Shape>( self, nrows: V, ncols: H, ) -> SymbolicSparseRowMat<I, V, H>

Source

pub fn as_dyn(&self) -> SymbolicSparseRowMatRef<'_, I>

Source

pub fn into_dyn(self) -> SymbolicSparseRowMat<I>

Source

pub fn as_ref(&self) -> SymbolicSparseRowMatRef<'_, I, Rows, Cols>

Returns a view over the symbolic structure of self.

Source

pub fn try_new_from_indices( nrows: Rows, ncols: Cols, idx: &[Pair<Idx<Rows, I>, Idx<Cols, I>>], ) -> Result<(Self, Argsort<I>), CreationError>

create a new symbolic structure, and the corresponding order for the numerical values from pairs of indices

Source

pub fn try_new_from_nonnegative_indices( nrows: Rows, ncols: Cols, idx: &[Pair<MaybeIdx<Rows, I>, MaybeIdx<Cols, I>>], ) -> Result<(Self, Argsort<I>), CreationError>

create a new symbolic structure, and the corresponding order for the numerical values from pairs of indices

negative indices are ignored