Enum AllNumbers 

#[non_exhaustive]
pub enum AllNumbers<N: Number> {
    Integer(AllIntegers),
    Rational(AllRationals),
    Any(N),
}

The family of any kind of number, also known as AllN.

Notes

Note that it wont have several specific traits implemented, like for example Zero or NonZero, since they are mutually exclusive, and don’t apply to all cases.

The Numbers alias is more convenient to use unless you need to refer to custom numbers via the Any variant.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Integer(AllIntegers)

Rational(AllRationals)

Any(N)

Any other kind of number.

Trait Implementations

impl<N: Number> Bound for AllNumbers<N>

This implementation defers to the actual number variant.

fn is_lower_bounded(&self) -> bool

Returns true if the number is lower bounded.

fn is_upper_bounded(&self) -> bool

Returns true if the number is upper bounded.

fn lower_bound(&self) -> Option<Self>

Returns the lower bound, if any.

fn upper_bound(&self) -> Option<Self>

Returns the upper bound, if any.

impl<N: Clone + Number> Clone for AllNumbers<N>

fn clone(&self) -> AllNumbers<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Number> Count for AllNumbers<N>

This implementation defers to the actual number variant.

fn is_countable(&self) -> bool

Returns true if the number is countable.

fn is_uncountable(&self) -> bool

Returns false if the number is countable.

impl<N: Debug + Number> Debug for AllNumbers<N>

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

Formats the value using the given formatter.

impl<N: Number> From<AllIntegers> for AllNumbers<N>

fn from(n: AllIntegers) -> AllNumbers<N>

Converts to this type from the input type.

impl<N: Number> From<AllRationals> for AllNumbers<N>

fn from(n: AllRationals) -> AllNumbers<N>

Converts to this type from the input type.

impl<N: Number> Ident for AllNumbers<N>

This implementation defers to the actual number variant.

fn can_zero(&self) -> bool

Returns true if the number can represent 0, the additive identity.

fn can_one(&self) -> bool

Returns true if the number can represent 1, the multiplicative identity.

fn can_neg_one(&self) -> bool

Returns true if the number can represent -1, the additive inverse of the multiplicative identity.

fn is_zero(&self) -> bool

Returns true if the current value is 0. the additive identity.

fn is_one(&self) -> bool

Returns true if the current value is 1, the multiplicative identity.

fn is_neg_one(&self) -> bool

Returns true if the current value is -1, the additive inverse of the multiplicative identity.

impl<N: Number> Number for AllNumbers<N>

This implementation is no-op.

fn from_inner_repr(value: Self) -> NumeraResult<Self>

Returns value unchanged.

unsafe fn from_inner_repr_unchecked(value: AllNumbers<N>) -> Self

Available on crate feature not(safe) only.

Returns value unchanged.

fn from_innermost_repr(value: Self) -> NumeraResult<Self>

Returns value unchanged.

unsafe fn from_innermost_repr_unchecked(value: Self) -> Self

Available on crate feature not(safe) only.

Returns value unchanged.

Safety

This is safe

fn into_inner_repr(self) -> Self::InnerRepr

Returns self.

fn into_innermost_repr(self) -> Self::InnermostRepr

Returns self.

type InnerRepr = AllNumbers<N>

The inner primitive representation of the number.

type InnermostRepr = AllNumbers<N>

The innermost primitive representation of the number.

fn try_from_inner_repr(inner: impl Into<Self::InnerRepr>) -> NumeraResult<Self>

where Self: Sized,

Forms a new number from its converted given inner representation.

impl<N: PartialEq + Number> PartialEq for AllNumbers<N>

fn eq(&self, other: &AllNumbers<N>) -> 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<N: Number> Sign for AllNumbers<N>

This implementation defers to the actual number variant.

fn can_positive(&self) -> bool

Returns true if the type can represent positive numbers.

fn can_negative(&self) -> bool

Returns true if the type can represent negative numbers.

fn is_positive(&self) -> bool

Returns true if the value is positive (> 0).

fn is_negative(&self) -> bool

Returns true if the value is negative (< 0).

impl<N: Number> TryFrom<AllNumbers<N>> for AllIntegers

type Error = NumeraErrors

The type returned in the event of a conversion error.

fn try_from(n: AllNumbers<N>) -> Result<AllIntegers, Self::Error>

Performs the conversion.

impl<N: Number> TryFrom<AllNumbers<N>> for AllRationals

type Error = NumeraErrors

The type returned in the event of a conversion error.

fn try_from(n: AllNumbers<N>) -> Result<AllRationals, Self::Error>

Performs the conversion.

impl<N: Number> StructuralPartialEq for AllNumbers<N>