Struct NonZero 

pub struct NonZero<T: Zero>(pub T);

A newtype which certifies the value is non-zero

Tuple Fields

0: T

Implementations

impl<T: Zero> NonZero<T>

pub fn new(value: T) -> Option<Self>

Certifies that value is nonzero.

Returns None when value is zero.

pub fn new_unchecked(value: T) -> Self

Constructs a certified nonzero value without checking the invariant.

Callers must establish by construction that value is not zero. This is a logical unchecked constructor rather than an unsafe memory operation; violating the invariant can nevertheless invalidate the algebraic assumptions of DivRing and Field.

Trait Implementations

impl<T: Clone + Zero> Clone for NonZero<T>

fn clone(&self) -> NonZero<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy + Zero> Copy for NonZero<T>

impl<T: Debug + Zero> Debug for NonZero<T>

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

Formats the value using the given formatter.

impl<T: Eq + Zero> Eq for NonZero<T>

impl<T: Zero + One + Point> Group for NonZero<T>

where NonZero<T>: Inv<Output = Self>,

fn identity() -> Self

fn compose(&self, other: &Self) -> Self

fn inverse(&self) -> Self

fn check_left_identity(&self) -> bool

where Self: PartialEq,

fn check_right_identity(&self) -> bool

where Self: PartialEq,

fn check_associativity(a: Self, b: Self, c: Self) -> bool

where Self: PartialEq,

fn check_left_inverse(&self) -> bool

where Self: PartialEq + Debug,

fn check_right_inverse(&self) -> bool

where Self: PartialEq,

impl<R: Real> Interval for NonZero<Complex<R>>

type R = R

The ordered field the interval is valued in — the real field where magnitudes, distances, and convergence live. Distinct from a scalar field’s involution Fixed: analysis happens here regardless of the algebraic involution.

fn interval_squared(&self, other: &Self) -> R

The signed squared interval s²(a, b) — the primitive from which interval (its signed square root) and distance both derive.

fn interval(&self, other: &Self) -> Complex<Self::R>

Interval between self and other. Real or imaginary carries causal character.

fn check_interval_symmetry(a: Self, b: Self) -> bool

fn check_self_interval_zero(a: Self) -> bool

fn check_interval_squared_agrees_with_interval(a: &Self, b: &Self) -> bool

impl<R: Real> Inv for NonZero<Complex<R>>

type Output = NonZero<Complex<R>>

The result after applying the operator.

fn inv(self) -> Self::Output

Returns the multiplicative inverse of self.

impl Inv for NonZero<R64>

type Output = NonZero<R64>

The result after applying the operator.

fn inv(self) -> Self

Returns the multiplicative inverse of self.

impl Inv for NonZero<R32>

type Output = NonZero<R32>

The result after applying the operator.

fn inv(self) -> Self

Returns the multiplicative inverse of self.

impl<R: Real> Inv for NonZero<Quaternion<R>>

type Output = NonZero<Quaternion<R>>

The result after applying the operator.

fn inv(self) -> Self::Output

Returns the multiplicative inverse of self.

impl<T: Zero + One + Inv<Output = T>> Inv for NonZero<T>

type Output = NonZero<T>

The result after applying the operator.

fn inv(self) -> Self::Output

Returns the multiplicative inverse of self.

impl<F: CField> Inv for NonZero<Symmetrized<F>>

type Output = NonZero<Symmetrized<F>>

The result after applying the operator.

fn inv(self) -> Self::Output

Returns the multiplicative inverse of self.

impl<R: Real> LieGroup<Coords<R, 2>> for NonZero<Complex<R>>

fn identity_exp(v: Coords<R, 2>) -> Self

fn identity_log(p: &Self) -> Option<Coords<R, 2>>

impl<T: Zero + One> Mul for NonZero<T>

type Output = NonZero<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<T: Zero + One> One for NonZero<T>

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T: Ord + Zero> Ord for NonZero<T>

fn cmp(&self, other: &NonZero<T>) -> 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<T: PartialEq + Zero> PartialEq for NonZero<T>

fn eq(&self, other: &NonZero<T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T: PartialOrd + Zero> PartialOrd for NonZero<T>

fn partial_cmp(&self, other: &NonZero<T>) -> 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<T: PartialEq + Zero> StructuralPartialEq for NonZero<T>