pub struct CSRMatrix {
pub values: Vec<f32>,
pub col_indices: Vec<usize>,
pub row_ptrs: Vec<usize>,
pub shape: (usize, usize),
}
Expand description
Compressed Sparse Row (CSR) format for efficient batch operations
Fields§
§values: Vec<f32>
Non-zero values
col_indices: Vec<usize>
Column indices for each value
row_ptrs: Vec<usize>
Row pointers (start index of each row in values/col_indices)
shape: (usize, usize)
Shape of the matrix (rows, cols)
Implementations§
Source§impl CSRMatrix
impl CSRMatrix
Sourcepub fn from_sparse_vectors(
vectors: &[SparseVector],
) -> Result<Self, VectorError>
pub fn from_sparse_vectors( vectors: &[SparseVector], ) -> Result<Self, VectorError>
Create CSR matrix from sparse vectors
Sourcepub fn get_row(&self, row: usize) -> Option<SparseVector>
pub fn get_row(&self, row: usize) -> Option<SparseVector>
Get a specific row as sparse vector
Sourcepub fn multiply_vector(
&self,
vector: &SparseVector,
) -> Result<Vec<f32>, VectorError>
pub fn multiply_vector( &self, vector: &SparseVector, ) -> Result<Vec<f32>, VectorError>
Matrix-vector multiplication
Sourcepub fn memory_usage(&self) -> usize
pub fn memory_usage(&self) -> usize
Get memory usage in bytes
Trait Implementations§
impl StructuralPartialEq for CSRMatrix
Auto Trait Implementations§
impl Freeze for CSRMatrix
impl RefUnwindSafe for CSRMatrix
impl Send for CSRMatrix
impl Sync for CSRMatrix
impl Unpin for CSRMatrix
impl UnwindSafe for CSRMatrix
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
Converts
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>
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.