Skip to main content

Repr

Struct Repr 

Source
pub struct Repr<const BASE: u64> { /* private fields */ }
Expand description

Underlying representation of an arbitrary precision floating number.

The floating point number is represented as significand * base^exponent, where the type of the significand is IBig, and the type of exponent is isize. The representation is always normalized (nonzero signficand is not divisible by the base, or zero signficand with zero exponent).

When it’s used together with a Context, its precision will be limited so that |significand| < base^precision. As an intentional exception, the result of an inexact addition or subtraction may carry one extra guard digit, so |significand| can be up to base^(precision+1); the guard digit is what lets a much-smaller operand be reduced to a sign-only sticky bit during alignment without mis-rounding.

§Infinity and signed zero

Special values are encoded with a zero significand and a sentinel exponent:

  • value zero (+0): exponent = 0
  • negative zero (-0): exponent = -1
  • positive infinity (+inf): exponent = isize::MAX
  • negative infinity (-inf): exponent = isize::MIN

The infinities are only supposed to be consumed as sentinels: only equality test and comparison are implemented for them, and any arithmetic operation that takes an infinity as input will lead to panic (at the FBig layer) or return an error (at the Context layer). If an operation result is too large or too small, the operation will return an infinity (as a value) at the Context layer, or panic at the FBig layer.

Implementations§

Source§

impl<const B: u64> Repr<B>

Source

pub fn to_f32(&self) -> Approximation<f32, Rounding>

Convert the float number representation to a f32 with the default IEEE 754 rounding mode.

The default IEEE 754 rounding mode is HalfEven (rounding to nearest, ties to even). To convert the float number with a specific rounding mode, please use FBig::to_f32.

§Examples
assert_eq!(Repr::<2>::one().to_f32(), Exact(1.0));
assert_eq!(Repr::<10>::infinity().to_f32(), Inexact(f32::INFINITY, NoOp));
Source

pub fn to_f64(&self) -> Approximation<f64, Rounding>

Convert the float number representation to a f64 with the default IEEE 754 rounding mode.

The default IEEE 754 rounding mode is HalfEven (rounding to nearest, ties to even). To convert the float number with a specific rounding mode, please use FBig::to_f64.

§Examples
assert_eq!(Repr::<2>::one().to_f64(), Exact(1.0));
assert_eq!(Repr::<10>::infinity().to_f64(), Inexact(f64::INFINITY, NoOp));
Source

pub fn to_int(&self) -> Approximation<IBig, Rounding>

Convert the float number representation to a IBig.

The fractional part is always rounded to zero. To convert with other rounding modes, please use FBig::to_int().

§Warning

If the float number has a very large exponent, it will be evaluated and result in allocating an huge integer and it might eat up all your memory.

To get a rough idea of how big the number is, it’s recommended to use EstimatedLog2.

§Examples
assert_eq!(Repr::<2>::neg_one().to_int(), Exact(IBig::NEG_ONE));
§Panics

Panics if the number is infinte.

Source§

impl<const B: u64> Repr<B>

Source

pub const BASE: UBig

The base of the representation. It’s exposed as an IBig constant.

Source

pub const fn zero() -> Repr<B>

Create a Repr instance representing value zero

Source

pub const fn one() -> Repr<B>

Create a Repr instance representing value one

Source

pub const fn neg_one() -> Repr<B>

Create a Repr instance representing value negative one

Source

pub const fn infinity() -> Repr<B>

Create a Repr instance representing the (positive) infinity

Source

pub const fn neg_infinity() -> Repr<B>

Create a Repr instance representing the negative infinity

Source

pub const fn neg_zero() -> Repr<B>

Create a Repr instance representing the negative zero (-0)

Negative zero is produced by operations (e.g. 1 / -inf, ceil(-0), cancellation under round-toward-negative) and is distinct from +0 only in operations that are sensitive to the sign of zero (e.g. 1 / -0 = -inf). It compares equal to +0.

Source

pub const fn is_pos_zero(&self) -> bool

Determine if the Repr represents positive zero (+0)

This returns true only for +0; use Self::is_neg_zero to detect -0, or check self.significand().is_zero() to detect either signed zero.

§Examples
assert!(Repr::<2>::zero().is_pos_zero());
assert!(!Repr::<10>::neg_zero().is_pos_zero());
assert!(!Repr::<10>::one().is_pos_zero());
Source

pub const fn is_neg_zero(&self) -> bool

Determine if the Repr represents the negative zero (-0)

§Examples
assert!(Repr::<2>::neg_zero().is_neg_zero());
assert!(!Repr::<10>::zero().is_neg_zero());
assert!(!Repr::<10>::one().is_neg_zero());
Source

pub const fn is_one(&self) -> bool

Determine if the Repr represents one

§Examples
assert!(Repr::<2>::zero().is_pos_zero());
assert!(!Repr::<10>::one().is_pos_zero());
Source

pub const fn is_infinite(&self) -> bool

Determine if the Repr represents the (±)infinity

§Examples
assert!(Repr::<2>::infinity().is_infinite());
assert!(Repr::<10>::neg_infinity().is_infinite());
assert!(!Repr::<10>::one().is_infinite());
assert!(!Repr::<10>::neg_zero().is_infinite());
Source

pub const fn is_finite(&self) -> bool

Determine if the Repr represents a finite number

§Examples
assert!(Repr::<2>::zero().is_finite());
assert!(Repr::<10>::one().is_finite());
assert!(!Repr::<16>::infinity().is_finite());
Source

pub fn is_int(&self) -> bool

Determine if the number can be regarded as an integer.

Note that this function returns false when the number is infinite.

§Examples
assert!(Repr::<2>::zero().is_int());
assert!(Repr::<10>::one().is_int());
assert!(!Repr::<16>::new(123.into(), -1).is_int());
Source

pub const fn sign(&self) -> Sign

Get the sign of the number

Note that -0 has a negative sign (so 1 / -0 = -inf), while +0 has a positive sign.

§Examples
assert_eq!(Repr::<2>::zero().sign(), Sign::Positive);
assert_eq!(Repr::<2>::neg_zero().sign(), Sign::Negative);
assert_eq!(Repr::<2>::neg_one().sign(), Sign::Negative);
assert_eq!(Repr::<10>::neg_infinity().sign(), Sign::Negative);
Source

pub fn digits(&self) -> usize

Get the number of digits (under base B) in the significand.

If the number is 0, then 0 is returned (instead of 1).

§Examples
assert_eq!(Repr::<2>::zero().digits(), 0);
assert_eq!(Repr::<2>::one().digits(), 1);
assert_eq!(Repr::<10>::one().digits(), 1);

assert_eq!(Repr::<10>::new(100.into(), 0).digits(), 1); // 1e2
assert_eq!(Repr::<10>::new(101.into(), 0).digits(), 3);
Source

pub fn digits_ub(&self) -> usize

Fast over-estimation of digits

§Examples
assert_eq!(Repr::<2>::zero().digits_ub(), 0);
assert_eq!(Repr::<2>::one().digits_ub(), 1);
assert_eq!(Repr::<10>::one().digits_ub(), 1);
assert_eq!(Repr::<2>::new(31.into(), 0).digits_ub(), 5);
assert_eq!(Repr::<10>::new(99.into(), 0).digits_ub(), 2);
Source

pub fn digits_lb(&self) -> usize

Fast under-estimation of digits

§Examples
assert_eq!(Repr::<2>::zero().digits_lb(), 0);
assert_eq!(Repr::<2>::one().digits_lb(), 0);
assert_eq!(Repr::<10>::one().digits_lb(), 0);
assert!(Repr::<10>::new(1001.into(), 0).digits_lb() <= 3);
Source

pub fn new(significand: IBig, exponent: isize) -> Repr<B>

Create a Repr from the significand and exponent. This constructor will normalize the representation.

§Examples
let a = Repr::<2>::new(400.into(), -2);
assert_eq!(a.significand(), &IBig::from(25));
assert_eq!(a.exponent(), 2);

let b = Repr::<10>::new(400.into(), -2);
assert_eq!(b.significand(), &IBig::from(4));
assert_eq!(b.exponent(), 0);
Source

pub fn significand(&self) -> &IBig

Get the significand of the representation

Source

pub fn exponent(&self) -> isize

Get the exponent of the representation

Source

pub fn into_parts(self) -> (IBig, isize)

Convert the float number into raw (signficand, exponent) parts

§Examples
use dashu_int::IBig;

let a = Repr::<2>::new(400.into(), -2);
assert_eq!(a.into_parts(), (IBig::from(25), 2));

let b = Repr::<10>::new(400.into(), -2);
assert_eq!(b.into_parts(), (IBig::from(4), 0));
Source§

impl<const B: u64> Repr<B>

Source

pub fn num_hash_residue(&self) -> i128

The numeric-hash residue (mod 2¹²⁷−1) used by NumHash: sgn(significand) · (|significand| mod M127) · (B^exponent mod M127).

Special values: +00, -00, +∞HASH_INF (= M127), -∞HASH_NEGINF (= -M127), matching num-order’s f64::fhash. The subsequent i128::num_hash maps both HASH_INF and HASH_NEGINF back to 0, so the final hash of ±∞ is 0 — but the residue distinguishes them so that composite types (e.g. CBig) combine them algebraically the same way num-order’s Complex<f64> does.

Trait Implementations§

Source§

impl<const B: u64> AbsOrd<IBig> for Repr<B>

Source§

fn abs_cmp(&self, other: &IBig) -> Ordering

Compare the magnitude of self against the magnitude of rhs.
Source§

impl<const B: u64> AbsOrd<UBig> for Repr<B>

Source§

fn abs_cmp(&self, other: &UBig) -> Ordering

Compare the magnitude of self against the magnitude of rhs.
Source§

impl Binary for Repr<2>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const B: u64> Clone for Repr<B>

Source§

fn clone(&self) -> Repr<B>

Returns a duplicate of the value. Read more
Source§

fn clone_from(&mut self, source: &Repr<B>)

Performs copy-assignment from source. Read more
Source§

impl<const B: u64> Debug for Repr<B>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de, const B: u64> Deserialize<'de> for Repr<B>

Source§

fn deserialize<D>( deserializer: D, ) -> Result<Repr<B>, <D as Deserializer<'de>>::Error>
where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl<const B: u64> Display for Repr<B>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const B: u64> Eq for Repr<B>

Source§

impl<const B: u64> EstimatedLog2 for Repr<B>

Source§

fn log2_bounds(&self) -> (f32, f32)

Estimate the bounds of the binary logarithm. Read more
Source§

fn log2_est(&self) -> f32

Estimate the value of the binary logarithm. It’s calculated as the average of log2_bounds by default.
Source§

impl<const B: u64> From<IBig> for Repr<B>

Source§

fn from(n: IBig) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<UBig> for Repr<B>

Source§

fn from(n: UBig) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<u8> for Repr<B>

Source§

fn from(value: u8) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<u16> for Repr<B>

Source§

fn from(value: u16) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<u32> for Repr<B>

Source§

fn from(value: u32) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<u64> for Repr<B>

Source§

fn from(value: u64) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<u128> for Repr<B>

Source§

fn from(value: u128) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> From<usize> for Repr<B>

Source§

fn from(value: usize) -> Repr<B>

Converts to this type from the input type.
Source§

impl<const B: u64> LowerExp for Repr<B>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl LowerHex for Repr<2>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl LowerHex for Repr<16>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const B: u64> Neg for Repr<B>

Source§

type Output = Repr<B>

The resulting type after applying the - operator.
Source§

fn neg(self) -> <Repr<B> as Neg>::Output

Performs the unary - operation. Read more
Source§

impl<const B: u64> NumHash for Repr<B>

Source§

fn num_hash<H>(&self, state: &mut H)
where H: Hasher,

Consistent Hash::hash on different numeric types. Read more
Source§

impl<const B: u64> NumOrd<IBig> for Repr<B>

Source§

fn num_cmp(&self, other: &IBig) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

fn num_partial_cmp(&self, other: &IBig) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

impl<const B1: u64, const B2: u64> NumOrd<Repr<B2>> for Repr<B1>

Source§

fn num_cmp(&self, other: &Repr<B2>) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

fn num_partial_cmp(&self, other: &Repr<B2>) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

impl<const B: u64> NumOrd<UBig> for Repr<B>

Source§

fn num_cmp(&self, other: &UBig) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

fn num_partial_cmp(&self, other: &UBig) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

impl<const B: u64> NumOrd<f32> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &f32) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<f64> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &f64) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<i8> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &i8) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<i16> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &i16) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<i32> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &i32) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<i64> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &i64) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<i128> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &i128) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<isize> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &isize) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<u8> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &u8) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<u16> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &u16) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<u32> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &u32) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<u64> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &u64) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<u128> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &u128) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl<const B: u64> NumOrd<usize> for Repr<B>

Source§

fn num_partial_cmp(&self, other: &usize) -> Option<Ordering>

PartialOrd::partial_cmp on different numeric types
Source§

fn num_eq(&self, other: &Other) -> bool

PartialEq::eq on different numeric types
Source§

fn num_ne(&self, other: &Other) -> bool

PartialEq::ne on different numeric types
Source§

fn num_lt(&self, other: &Other) -> bool

PartialOrd::lt on different numeric types
Source§

fn num_le(&self, other: &Other) -> bool

PartialOrd::le on different numeric types
Source§

fn num_gt(&self, other: &Other) -> bool

PartialOrd::gt on different numeric types
Source§

fn num_ge(&self, other: &Other) -> bool

PartialOrd::ge on different numeric types
Source§

fn num_cmp(&self, other: &Other) -> Ordering

Ord::cmp on different numeric types. It panics if either of the numeric values contains NaN.
Source§

impl Octal for Repr<8>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const B: u64> Ord for Repr<B>

Source§

fn cmp(&self, other: &Repr<B>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 (const: unstable) · Source§

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

Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§

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

Compares and returns the minimum of two values. Read more
1.50.0 (const: unstable) · Source§

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

Restrict a value to a certain interval. Read more
Source§

impl<const B: u64> PartialEq for Repr<B>

Source§

fn eq(&self, other: &Repr<B>) -> bool

Two representations are equal when they denote the same value. In particular +0 and -0 compare equal, as do two infinities of the same sign.

1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl<const B: u64> PartialOrd for Repr<B>

Source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than (for self and other) and is used by the < operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 (const: unstable) · Source§

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

Tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 (const: unstable) · Source§

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

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

impl<const B: u64> Serialize for Repr<B>

Source§

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl TryFrom<f32> for Repr<2>

Source§

type Error = ConversionError

The type returned in the event of a conversion error.
Source§

fn try_from(f: f32) -> Result<Repr<2>, <Repr<2> as TryFrom<f32>>::Error>

Performs the conversion.
Source§

impl TryFrom<f64> for Repr<2>

Source§

type Error = ConversionError

The type returned in the event of a conversion error.
Source§

fn try_from(f: f64) -> Result<Repr<2>, <Repr<2> as TryFrom<f64>>::Error>

Performs the conversion.
Source§

impl<const B: u64> UpperExp for Repr<B>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl UpperHex for Repr<2>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl UpperHex for Repr<16>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const B: u64> Zeroize for Repr<B>

Source§

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.

Auto Trait Implementations§

§

impl<const BASE: u64> Freeze for Repr<BASE>

§

impl<const BASE: u64> RefUnwindSafe for Repr<BASE>

§

impl<const BASE: u64> Send for Repr<BASE>

§

impl<const BASE: u64> Sync for Repr<BASE>

§

impl<const BASE: u64> Unpin for Repr<BASE>

§

impl<const BASE: u64> UnsafeUnpin for Repr<BASE>

§

impl<const BASE: u64> UnwindSafe for Repr<BASE>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.