CsVecRef

Struct CsVecRef 

Source
#[non_exhaustive]
pub struct CsVecRef<'a, T> { /* private fields */ }
Expand description

An immutable view of a sparse vector.

This provides efficient read-only access to sparse vector data without allocation. Sparse vectors store only non-zero elements and their indices, making them memory-efficient for vectors with few non-zero elements.

§Format

The sparse vector uses two parallel arrays:

  • indices: Indices of non-zero elements
  • values: Non-zero values corresponding to each index

§Examples

use algebra_sparse::CsVecRef;

let indices = [0, 2, 4];
let values = [1.0, 3.0, 5.0];
let sparse_vec = CsVecRef::from_parts_unchecked(&indices, &values, 6);

// Iterate over non-zero elements
for (index, value) in sparse_vec.iter() {
    println!("vec[{}] = {}", index, value);
}

Implementations§

Source§

impl<'a, T> CsVecRef<'a, T>

Source

pub fn from_parts_unchecked( indices: &'a [usize], values: &'a [T], len: usize, ) -> Self

Creates a CsVecRef from raw parts without checking validity.

§Safety

This function does not validate that the provided parts form a valid sparse vector. The indices and values arrays should have the same length, and indices should be in ascending order and within bounds [0, len).

§Arguments
  • indices - Indices of non-zero elements
  • values - Non-zero values corresponding to each index
  • len - Total length of the vector
Source

pub fn iter(&self) -> impl Iterator<Item = (usize, T)>
where T: Copy,

Returns an iterator over the non-zero elements of the vector.

The iterator yields tuples of (index, value) for each non-zero element.

§Returns

An iterator over (index, value) pairs

Source

pub fn len(&self) -> usize

Returns the total length of the vector.

This is the full length of the vector, not the number of non-zero elements.

§Returns

The total length including zero elements

Source

pub fn is_empty(&self) -> bool

Returns true if the vector is empty (has length 0).

Source

pub fn indices(&self) -> &'a [usize]

Returns the indices of the non-zero elements.

§Returns

A slice of indices for non-zero elements

Source

pub fn values(&self) -> &'a [T]

Returns all non-zero values in the vector.

§Returns

A slice of non-zero values

Trait Implementations§

Source§

impl<'a, T: Real> Add<Matrix<T, Dyn, Const<1>, ViewStorage<'a, T, Dyn, Const<1>, Const<1>, Dyn>>> for CsVecRef<'a, T>

Source§

type Output = Matrix<T, Dyn, Const<1>, VecStorage<T, Dyn, Const<1>>>

The resulting type after applying the + operator.
Source§

fn add(self, rhs: DVectorView<'a, T>) -> Self::Output

Performs the + operation. Read more
Source§

impl<'a, T: Clone> Clone for CsVecRef<'a, T>

Source§

fn clone(&self) -> CsVecRef<'a, T>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<'a, T: Copy> Copy for CsVecRef<'a, T>

Auto Trait Implementations§

§

impl<'a, T> Freeze for CsVecRef<'a, T>

§

impl<'a, T> RefUnwindSafe for CsVecRef<'a, T>
where T: RefUnwindSafe,

§

impl<'a, T> Send for CsVecRef<'a, T>
where T: Sync,

§

impl<'a, T> Sync for CsVecRef<'a, T>
where T: Sync,

§

impl<'a, T> Unpin for CsVecRef<'a, T>

§

impl<'a, T> UnwindSafe for CsVecRef<'a, T>
where T: RefUnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.