Struct SparseIndex 

pub struct SparseIndex {
    pub rows: usize,
    pub cols: usize,
    pub values: Vec<i8>,
    pub col_idx: Vec<u32>,
    pub row_ptr: Vec<u64>,
    pub nnz: usize,
    pub sparsity: f64,
}

Compressed Sparse Row index for one weight matrix.

Fields

rows: usize

cols: usize

values: Vec<i8>

Non-zero trit values, stored as i8 (+1 or -1).

col_idx: Vec<u32>

Column of each non-zero value. Same length as values.

row_ptr: Vec<u64>

row_ptr[r] = index into values where row r starts. Length = rows + 1. row_ptr[rows] = values.len().

nnz: usize

Number of non-zero elements.

sparsity: f64

Sparsity = 1 - nnz / (rows * cols).

Implementations

impl SparseIndex

pub fn from_trits(rows: usize, cols: usize, data: &[Trit]) -> Self

Build a CSR index from a flat row-major slice of trits.

pub fn to_dense(&self) -> Vec<Trit>

Reconstruct the dense trit slice (for testing / correctness checks).

pub fn memory_bytes(&self) -> usize

Memory footprint in bytes.

pub fn is_efficient(&self) -> bool

Whether CSR is more memory-efficient than a 2-bit packed dense matrix.

Trait Implementations

impl Clone for SparseIndex

fn clone(&self) -> SparseIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseIndex

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SparseIndex

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for SparseIndex

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.