Enum nalgebra_sparse::SparseEntry [−][src]
pub enum SparseEntry<'a, T> {
NonZero(&'a T),
Zero,
}Expand description
An entry in a sparse matrix.
Sparse matrices do not store all their entries explicitly. Therefore, entry (i, j) in the matrix can either be a reference to an explicitly stored element, or it is implicitly zero.
Variants
The entry is a reference to an explicitly stored element.
Note that the naming here is a misnomer: The element can still be zero, even though it is explicitly stored (a so-called “explicit zero”).
Tuple Fields of NonZero
0: &'a TThe entry is implicitly zero, i.e. it is not explicitly stored.
Implementations
Returns the value represented by this entry.
Either clones the underlying reference or returns zero if the entry is not explicitly stored.
Trait Implementations
This method tests for self and other values to be equal, and is used
by ==. Read more
This method tests for !=.
Auto Trait Implementations
impl<'a, T> RefUnwindSafe for SparseEntry<'a, T> where
T: RefUnwindSafe,
impl<'a, T> Send for SparseEntry<'a, T> where
T: Sync,
impl<'a, T> Sync for SparseEntry<'a, T> where
T: Sync,
impl<'a, T> Unpin for SparseEntry<'a, T>
impl<'a, T> UnwindSafe for SparseEntry<'a, T> where
T: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.