pub enum ScatterReject {
NoLoop,
NoRowLoop,
NoRowStore,
UnsupportedTerm,
NotInt,
NonAffineIndex,
NotScatterLayout,
NoRank1Update,
NotCounted,
ExtraWork,
NotFromZero,
}Expand description
Why a program is not a recognizable scatter accumulation, least to most advanced.
Variants§
NoLoop
No While counter is less than BOUND loop.
NoRowLoop
A loop with no elementwise loop over the row inside it.
NoRowStore
The row loop does not write one array at its counter (Set item (c + k) of sub to …, or an If whose two
arms each write it).
UnsupportedTerm
The row term reads something other than array elements and constants, uses an operator or calls a function a term does not have, or is ill-typed.
NotInt
A well-typed row term, but not an Int over Int arrays — the integer covariance the app computes.
NonAffineIndex
An index is not affine in the counters.
NotScatterLayout
A read that is not at the row, the column, or the row-major element of both.
NoRank1Update
The row’s vector is not added to a C × C matrix as a rank-1 update of itself (S[i·C + j] += sub[i]·sub[j]).
NotCounted
A counter not set to a constant right before its loop, or not stepped by exactly one.
ExtraWork
A loop body does more than the scatter accumulation.
NotFromZero
The matrix is not filled with zeros before the rows are added.
Trait Implementations§
Source§impl Clone for ScatterReject
impl Clone for ScatterReject
Source§fn clone(&self) -> ScatterReject
fn clone(&self) -> ScatterReject
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ScatterReject
impl Debug for ScatterReject
Source§impl Ord for ScatterReject
impl Ord for ScatterReject
Source§fn cmp(&self, other: &ScatterReject) -> Ordering
fn cmp(&self, other: &ScatterReject) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for ScatterReject
impl PartialEq for ScatterReject
Source§impl PartialOrd for ScatterReject
impl PartialOrd for ScatterReject
impl Copy for ScatterReject
impl Eq for ScatterReject
impl StructuralPartialEq for ScatterReject
Auto Trait Implementations§
impl Freeze for ScatterReject
impl RefUnwindSafe for ScatterReject
impl Send for ScatterReject
impl Sync for ScatterReject
impl Unpin for ScatterReject
impl UnsafeUnpin for ScatterReject
impl UnwindSafe for ScatterReject
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.