Struct Sparse 

pub struct Sparse {
    pub axes: Vec<usize>,
    pub indices: Vec<usize>,
    pub fill: Data,
    pub entries: usize,
}

What a sparse array holds besides its shape and its stored cells.

Fields

axes: Vec<usize>

The axes stored sparsely, ascending and distinct. Every other axis of the shape is dense and forms the stored cell.

indices: Vec<usize>

One row per stored entry, axes.len() columns, row-major: entry e’s position along sparse axis axes[j] is indices[e * k + j].

fill: Data

The element every position not named by indices holds. Exactly one element, of the array’s own dtype.

entries: usize

Stored entries. It is not derivable from the buffers when there are no sparse axes at all, or when a dense axis has length zero.

Implementations

impl Sparse

pub fn cell_shape(&self, shape: &[usize]) -> Vec<usize>

The shape of one stored cell: the lengths of the axes that are not sparse, in axis order.

pub fn cell_size(&self, shape: &[usize]) -> usize

Elements in one stored cell.

Trait Implementations

impl Clone for Sparse

fn clone(&self) -> Sparse

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Sparse

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

Formats the value using the given formatter.

impl PartialEq for Sparse

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Sparse