Struct SparseTensor 

pub struct SparseTensor {
    pub rows: usize,
    pub cols: usize,
    pub col_ptrs: Vec<usize>,
    pub row_indices: Vec<usize>,
    pub values: Vec<f64>,
}

Fields

rows: usize

cols: usize

col_ptrs: Vec<usize>

Column pointers into row_indices/values; length is cols + 1.

row_indices: Vec<usize>

Zero-based row indices, sorted within each column.

values: Vec<f64>

Implementations

impl SparseTensor

pub fn new( rows: usize, cols: usize, col_ptrs: Vec<usize>, row_indices: Vec<usize>, values: Vec<f64>, ) -> Result<Self, String>

pub fn zeros(rows: usize, cols: usize) -> Self

pub fn nnz(&self) -> usize

pub fn shape(&self) -> Vec<usize>

pub fn to_dense(&self) -> Result<Tensor, String>

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

Trait Implementations

impl Clone for SparseTensor

fn clone(&self) -> SparseTensor

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseTensor

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

Formats the value using the given formatter.

impl Display for SparseTensor

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

Formats the value using the given formatter.

impl PartialEq for SparseTensor

fn eq(&self, other: &SparseTensor) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for SparseTensor