Enum ZipReject 

pub enum ZipReject {
    NoLoop,
    NoAccumulation,
    UnsupportedTerm,
    NotInt,
    NonAffineIndex,
    NotAligned,
    NotCounted,
    ExtraWork,
    NotFromZero,
}

Why a program is not a recognizable zip sum, least to most advanced (what a loop’s body computes ranks before whether its counter is provable).

Variants

NoLoop

No While counter is less than BOUND loop.

NoAccumulation

No Set s to s + …, plain or under an If, in the loop body.

UnsupportedTerm

The accumulated term reads something other than array elements and constants (the counter, the accumulator, a variable the loop does not fix), uses an operator or calls a function a term does not have, or is ill-typed.

NotInt

A well-typed term, but not an Int over Int arrays — the integer sum the zip-sum app computes.

NonAffineIndex

An index is not affine in the counter.

NotAligned

The arrays are not all read at one unit-stride index of the counter.

NotCounted

The counter is not set to a constant right before the loop, or is not stepped by exactly one.

ExtraWork

The loop body does more than the zip sum.

NotFromZero

The accumulator is not set to zero right before the loop.

Trait Implementations

impl Clone for ZipReject

fn clone(&self) -> ZipReject

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ZipReject

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<ZipReject> for DotReject

fn from(z: ZipReject) -> DotReject

Converts to this type from the input type.

impl Ord for ZipReject

fn cmp(&self, other: &ZipReject) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for ZipReject

fn eq(&self, other: &ZipReject) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for ZipReject

fn partial_cmp(&self, other: &ZipReject) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for ZipReject

impl Eq for ZipReject

impl StructuralPartialEq for ZipReject