Enum nalgebra_sparse::pattern::SparsityPatternFormatError [−][src]
#[non_exhaustive] pub enum SparsityPatternFormatError { InvalidOffsetArrayLength, InvalidOffsetFirstLast, NonmonotonicOffsets, MinorIndexOutOfBounds, DuplicateEntry, NonmonotonicMinorIndices, }
Expand description
Error type for SparsityPattern
format errors.
Variants (Non-exhaustive)
This enum is marked as non-exhaustive
Indicates an invalid number of offsets.
The number of offsets must be equal to (major_dim + 1).
Indicates that the first or last entry in the offset array did not conform to specifications.
The first entry must be 0, and the last entry must be exactly one greater than the major dimension.
Indicates that the major offsets are not monotonically increasing.
One or more minor indices are out of bounds.
One or more duplicate entries were detected.
Two entries are considered duplicates if they are part of the same major lane and have the same minor index.
Indicates that minor indices are not monotonically increasing within each lane.
Trait Implementations
Performs the conversion.
Auto Trait Implementations
impl RefUnwindSafe for SparsityPatternFormatError
impl Send for SparsityPatternFormatError
impl Sync for SparsityPatternFormatError
impl Unpin for SparsityPatternFormatError
impl UnwindSafe for SparsityPatternFormatError
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.
pub fn vzip(self) -> V