pub struct SpVec<R> { /* private fields */ }Implementations§
Source§impl<R> SpVec<R>
impl<R> SpVec<R>
pub fn data(&self) -> (&[usize], &[R])
pub fn zero(dim: usize) -> Self
pub fn is_zero(&self) -> boolwhere
R: Zero,
pub fn unit(n: usize, i: usize) -> Selfwhere
R: One,
pub fn dim(&self) -> usize
pub fn iter(&self) -> impl Iterator<Item = (usize, &R)>
pub fn iter_nz(&self) -> impl Iterator<Item = (usize, &R)>where
R: Zero,
pub fn into_vec(self) -> Vec<R>
pub fn into_mat(self) -> SpMat<R>
Source§impl<R> SpVec<R>
impl<R> SpVec<R>
pub fn from_entries<T>(dim: usize, entries: T) -> Selfwhere
T: IntoIterator<Item = (usize, R)>,
pub fn from_sorted_entries<T>(dim: usize, entries: T) -> Selfwhere
T: IntoIterator<Item = (usize, R)>,
pub fn stack_vecs<I>(vecs: I) -> Selfwhere
I: IntoIterator<Item = SpVec<R>>,
pub fn extract<F>(&self, dim: usize, f: F) -> SpVec<R>
pub fn permute(&self, p: PermView<'_>) -> SpVec<R>
pub fn subvec(&self, range: Range<usize>) -> SpVec<R>
pub fn stack(&self, other: &SpVec<R>) -> SpVec<R>
pub fn split(&self, at: usize) -> (SpVec<R>, SpVec<R>)
pub fn to_dense(&self) -> Vec<R>
Trait Implementations§
Source§impl<'a, 'b, R> Add for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Add for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Add<&'b SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Add<&'b SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Add<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Add<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Add<SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Add<SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> AddAssign for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> AddAssign for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§fn add_assign(&mut self, rhs: SpVec<R>)
fn add_assign(&mut self, rhs: SpVec<R>)
Performs the
+= operation. Read moreSource§impl<'a, 'b, R> AddAssign<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> AddAssign<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§fn add_assign(&mut self, rhs: &'b SpVec<R>)
fn add_assign(&mut self, rhs: &'b SpVec<R>)
Performs the
+= operation. Read moreimpl<R: Eq> Eq for SpVec<R>
impl<R> StructuralPartialEq for SpVec<R>
Source§impl<'a, 'b, R> Sub for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Sub for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Sub<&'b SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Sub<&'b SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Sub<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Sub<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> Sub<SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> Sub<SpVec<R>> for &'a SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§impl<'a, 'b, R> SubAssign for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> SubAssign for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§fn sub_assign(&mut self, rhs: SpVec<R>)
fn sub_assign(&mut self, rhs: SpVec<R>)
Performs the
-= operation. Read moreSource§impl<'a, 'b, R> SubAssign<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
impl<'a, 'b, R> SubAssign<&'b SpVec<R>> for SpVec<R>where
R: Scalar + ClosedAddAssign + ClosedSubAssign + ClosedMulAssign + Zero + One + Neg<Output = R>,
Source§fn sub_assign(&mut self, rhs: &'b SpVec<R>)
fn sub_assign(&mut self, rhs: &'b SpVec<R>)
Performs the
-= operation. Read moreAuto Trait Implementations§
impl<R> Freeze for SpVec<R>
impl<R> RefUnwindSafe for SpVec<R>where
R: RefUnwindSafe,
impl<R> Send for SpVec<R>where
R: Send,
impl<R> Sync for SpVec<R>where
R: Sync,
impl<R> Unpin for SpVec<R>where
R: Unpin,
impl<R> UnsafeUnpin for SpVec<R>
impl<R> UnwindSafe for SpVec<R>where
R: UnwindSafe,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T, Right> ClosedAdd<Right> for T
impl<T, Right> ClosedAdd<Right> for T
impl<T, Right> ClosedAddAssign<Right> for T
impl<T> ClosedNeg for Twhere
T: Neg<Output = T>,
impl<T> ClosedNeg for Twhere
T: Neg<Output = T>,
impl<T, Right> ClosedSub<Right> for T
impl<T, Right> ClosedSub<Right> for T
impl<T, Right> ClosedSubAssign<Right> for T
impl<T> ElemBase for T
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
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.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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.