Enum Determinism

pub enum Determinism {
    BestEffort,
    Topological,
    NumericallyBounded,
    Bitwise,
}

Reproducibility requirement.

These are three genuinely different contracts, not degrees of one. A backend that reduces in a deterministic order satisfies Self::Topological while still failing Self::Bitwise against a differently-scheduled backend, so collapsing them into one flag lets two backends both claim “deterministic” and still disagree. Ordered weakest to strongest.

Variants

BestEffort

No guarantee. The backend may reorder, re-associate, and reschedule.

Topological

Same connectivity and same output ordering for the same inputs.

Coordinates may differ within tolerance. This is what a clash result or a topology commit needs; it does not promise identical floats.

NumericallyBounded

Topological determinism plus values within the operation’s stated numerical error bound.

Bitwise

Bit-for-bit identical output for the same inputs and options.

The only contract that supports hashing a result or comparing artifacts across machines.

Implementations

impl Determinism

pub const fn satisfies(self, required: Determinism) -> bool

Whether this guarantee is at least as strong as required.

Strength is the declaration order, so a backend offering Self::Bitwise satisfies a Self::Topological request but never the reverse. Routing must use this instead of equality, or a stronger backend gets rejected for being too good.

Trait Implementations

impl Clone for Determinism

fn clone(&self) -> Determinism

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Determinism

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

Formats the value using the given formatter.

impl Hash for Determinism

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Determinism

fn cmp(&self, other: &Determinism) -> 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 Determinism

fn eq(&self, other: &Determinism) -> 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 Determinism

fn partial_cmp(&self, other: &Determinism) -> 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 Determinism

impl Eq for Determinism

impl StructuralPartialEq for Determinism