Struct extendr_api::prelude::sparse::SymbolicSparseRowMat
pub struct SymbolicSparseRowMat<I>where
I: Index,{
pub(crate) nrows: usize,
pub(crate) ncols: usize,
pub(crate) row_ptr: Vec<I>,
pub(crate) row_nnz: Option<Vec<I>>,
pub(crate) col_ind: Vec<I>,
}
Expand description
Symbolic structure of sparse matrix in row format, either compressed or uncompressed.
Requires:
-
nrows <= I::Signed::MAX
(always checked) -
ncols <= I::Signed::MAX
(always checked) -
row_ptrs
has lengthnrows + 1
(always checked) -
row_ptrs
is non-decreasing -
row_ptrs[0]..row_ptrs[nrows]
is a valid range in row_indices (always checked, assuming non-decreasing) -
if
nnz_per_row
isNone
, elements ofcol_indices[row_ptrs[i]..row_ptrs[i + 1]]
are less thanncols
-
nnz_per_row[i] <= row_ptrs[i+1] - row_ptrs[i]
-
if
nnz_per_row
isSome(_)
, elements ofcol_indices[row_ptrs[i]..][..nnz_per_row[i]]
are less thanncols
-
Within each row, column indices are sorted in non-decreasing order.
§Note
Some algorithms allow working with matrices containing unsorted row indices per column.
Passing such a matrix to an algorithm that does not explicitly permit this is unspecified (though not undefined) behavior.
Fields§
§nrows: usize
§ncols: usize
§row_ptr: Vec<I>
§row_nnz: Option<Vec<I>>
§col_ind: Vec<I>
Implementations§
§impl<I> SymbolicSparseRowMat<I>where
I: Index,
impl<I> SymbolicSparseRowMat<I>where
I: Index,
pub fn new_checked(
nrows: usize,
ncols: usize,
row_ptrs: Vec<I>,
nnz_per_row: Option<Vec<I>>,
col_indices: Vec<I>,
) -> SymbolicSparseRowMat<I>
pub fn new_checked( nrows: usize, ncols: usize, row_ptrs: Vec<I>, nnz_per_row: Option<Vec<I>>, col_indices: Vec<I>, ) -> SymbolicSparseRowMat<I>
Creates a new symbolic matrix view after asserting its invariants.
§Panics
See type level documentation.
pub fn new_unsorted_checked(
nrows: usize,
ncols: usize,
row_ptrs: Vec<I>,
nnz_per_row: Option<Vec<I>>,
col_indices: Vec<I>,
) -> SymbolicSparseRowMat<I>
pub fn new_unsorted_checked( nrows: usize, ncols: usize, row_ptrs: Vec<I>, nnz_per_row: Option<Vec<I>>, col_indices: Vec<I>, ) -> SymbolicSparseRowMat<I>
Creates a new symbolic matrix view from data containing duplicate and/or unsorted column indices per row, after asserting its other invariants.
§Panics
See type level documentation.
pub unsafe fn new_unchecked(
nrows: usize,
ncols: usize,
row_ptrs: Vec<I>,
nnz_per_row: Option<Vec<I>>,
col_indices: Vec<I>,
) -> SymbolicSparseRowMat<I>
pub unsafe fn new_unchecked( nrows: usize, ncols: usize, row_ptrs: Vec<I>, nnz_per_row: Option<Vec<I>>, col_indices: Vec<I>, ) -> SymbolicSparseRowMat<I>
Creates a new symbolic matrix view without asserting its invariants.
§Safety
See type level documentation.
pub fn into_parts(self) -> (usize, usize, Vec<I>, Option<Vec<I>>, Vec<I>)
pub fn into_parts(self) -> (usize, usize, Vec<I>, Option<Vec<I>>, Vec<I>)
Returns the components of the matrix in the order:
- row count,
- column count,
- row pointers,
- nonzeros per row,
- column indices.
pub fn as_ref(&self) -> SymbolicSparseRowMatRef<'_, I>
pub fn as_ref(&self) -> SymbolicSparseRowMatRef<'_, I>
Returns a view over the symbolic structure of self
.
pub fn into_transpose(self) -> SymbolicSparseColMat<I>
pub fn into_transpose(self) -> SymbolicSparseColMat<I>
Consumes the matrix, and returns its transpose in column-major format without reallocating.
§Note
Allows unsorted matrices, producing an unsorted output.
pub fn to_owned(&self) -> Result<SymbolicSparseRowMat<I>, FaerError>
pub fn to_owned(&self) -> Result<SymbolicSparseRowMat<I>, FaerError>
Copies the current matrix into a newly allocated matrix.
§Note
Allows unsorted matrices, producing an unsorted output.
pub fn to_col_major(&self) -> Result<SymbolicSparseColMat<I>, FaerError>
pub fn to_col_major(&self) -> Result<SymbolicSparseColMat<I>, FaerError>
Copies the current matrix into a newly allocated matrix, with column-major order.
§Note
Allows unsorted matrices, producing a sorted output. Duplicate entries are kept, however.
pub fn compute_nnz(&self) -> usize
pub fn compute_nnz(&self) -> usize
Returns the number of symbolic non-zeros in the matrix.
The value is guaranteed to be less than I::Signed::MAX
.
§Note
Allows unsorted matrices, but the output is a count of all the entries, including the duplicate ones.
pub fn nnz_per_row(&self) -> Option<&[I]>
pub fn nnz_per_row(&self) -> Option<&[I]>
Returns the count of non-zeros per row of the matrix.
pub fn col_indices(&self) -> &[I]
pub fn col_indices(&self) -> &[I]
Returns the column indices.
pub fn col_indices_of_row_raw(&self, i: usize) -> &[I]
pub fn col_indices_of_row_raw(&self, i: usize) -> &[I]
pub fn col_indices_of_row(
&self,
i: usize,
) -> impl ExactSizeIterator + DoubleEndedIterator
pub fn col_indices_of_row( &self, i: usize, ) -> impl ExactSizeIterator + DoubleEndedIterator
pub fn row_range(&self, i: usize) -> Range<usize>
pub fn row_range(&self, i: usize) -> Range<usize>
Returns the range that the row i
occupies in self.col_indices()
.
§Panics
Panics if i >= self.nrows()
.
pub unsafe fn row_range_unchecked(&self, i: usize) -> Range<usize>
pub unsafe fn row_range_unchecked(&self, i: usize) -> Range<usize>
Returns the range that the row i
occupies in self.col_indices()
.
§Safety
The behavior is undefined if i >= self.nrows()
.
§impl<I> SymbolicSparseRowMat<I>where
I: Index,
impl<I> SymbolicSparseRowMat<I>where
I: Index,
pub fn try_new_from_indices(
nrows: usize,
ncols: usize,
indices: &[(I, I)],
) -> Result<(SymbolicSparseRowMat<I>, ValuesOrder<I>), CreationError>
pub fn try_new_from_indices( nrows: usize, ncols: usize, indices: &[(I, I)], ) -> Result<(SymbolicSparseRowMat<I>, ValuesOrder<I>), CreationError>
Create a new symbolic structure, and the corresponding order for the numerical values
from pairs of indices (row, col)
.
pub fn try_new_from_nonnegative_indices(
nrows: usize,
ncols: usize,
indices: &[(<I as Index>::Signed, <I as Index>::Signed)],
) -> Result<(SymbolicSparseRowMat<I>, ValuesOrder<I>), CreationError>
pub fn try_new_from_nonnegative_indices( nrows: usize, ncols: usize, indices: &[(<I as Index>::Signed, <I as Index>::Signed)], ) -> Result<(SymbolicSparseRowMat<I>, ValuesOrder<I>), CreationError>
Create a new symbolic structure, and the corresponding order for the numerical values
from pairs of indices (row, col)
.
Negative indices are ignored.
Trait Implementations§
§impl<I> Clone for SymbolicSparseRowMat<I>
impl<I> Clone for SymbolicSparseRowMat<I>
§fn clone(&self) -> SymbolicSparseRowMat<I>
fn clone(&self) -> SymbolicSparseRowMat<I>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreAuto Trait Implementations§
impl<I> Freeze for SymbolicSparseRowMat<I>
impl<I> RefUnwindSafe for SymbolicSparseRowMat<I>where
I: RefUnwindSafe,
impl<I> Send for SymbolicSparseRowMat<I>
impl<I> Sync for SymbolicSparseRowMat<I>
impl<I> Unpin for SymbolicSparseRowMat<I>where
I: Unpin,
impl<I> UnwindSafe for SymbolicSparseRowMat<I>where
I: 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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more