Struct UInt 

pub struct UInt<U, B> { /* private fields */ }

UInt is defined recursively, where B is the least significant bit and U is the rest of the number. Conceptually, U should be bound by the trait Unsigned and B should be bound by the trait Bit, but enforcing these bounds causes linear instead of logrithmic scaling in some places, so they are left off for now. They may be enforced in future.

In order to keep numbers unique, leading zeros are not allowed, so UInt<UTerm, B0> is forbidden.

Example

use typenum::{UInt, UTerm, B0, B1};

type U6 = UInt<UInt<UInt<UTerm, B1>, B1>, B0>;

Implementations

impl<U: Unsigned, B: Bit> UInt<U, B>

pub fn new() -> UInt<U, B>

Instantiates a singleton representing this unsigned integer.

Trait Implementations

impl<U: Unsigned, B: Bit> Add<B0> for UInt<U, B>

U + B0 = U

type Output = UInt<U, B>

The resulting type after applying the + operator.

fn add(self, _: B0) -> Self::Output

Performs the + operation.

impl<U: Unsigned> Add<B1> for UInt<U, B0>

UInt<U, B0> + B1 = UInt<U + B1>

type Output = UInt<U, B1>

The resulting type after applying the + operator.

fn add(self, _: B1) -> Self::Output

Performs the + operation.

impl<U> Add<B1> for UInt<U, B1>

where U: Add<B1> + Unsigned, Add1<U>: Unsigned,

UInt<U, B1> + B1 = UInt<U + B1, B0>

type Output = UInt<<U as Add<B1>>::Output, B0>

The resulting type after applying the + operator.

fn add(self, _: B1) -> Self::Output

Performs the + operation.

impl<Ul, Ur: Unsigned> Add<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: Add<Ur> + Unsigned,

UInt<Ul, B0> + UInt<Ur, B0> = UInt<Ul + Ur, B0>

type Output = UInt<<Ul as Add<Ur>>::Output, B0>

The resulting type after applying the + operator.

fn add(self, rhs: UInt<Ur, B0>) -> Self::Output

Performs the + operation.

impl<Ul, Ur: Unsigned> Add<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: Add<Ur> + Unsigned,

UInt<Ul, B1> + UInt<Ur, B0> = UInt<Ul + Ur, B1>

type Output = UInt<<Ul as Add<Ur>>::Output, B1>

The resulting type after applying the + operator.

fn add(self, rhs: UInt<Ur, B0>) -> Self::Output

Performs the + operation.

impl<Ul, Ur: Unsigned> Add<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: Add<Ur> + Unsigned,

UInt<Ul, B0> + UInt<Ur, B1> = UInt<Ul + Ur, B1>

type Output = UInt<<Ul as Add<Ur>>::Output, B1>

The resulting type after applying the + operator.

fn add(self, rhs: UInt<Ur, B1>) -> Self::Output

Performs the + operation.

impl<Ul, Ur: Unsigned> Add<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: Add<Ur> + Unsigned, Sum<Ul, Ur>: Add<B1>,

UInt<Ul, B1> + UInt<Ur, B1> = UInt<(Ul + Ur) + B1, B0>

type Output = UInt<<<Ul as Add<Ur>>::Output as Add<B1>>::Output, B0>

The resulting type after applying the + operator.

fn add(self, rhs: UInt<Ur, B1>) -> Self::Output

Performs the + operation.

impl<U: Unsigned, B: Bit> Add<UTerm> for UInt<U, B>

UInt<U, B> + UTerm = UInt<U, B>

type Output = UInt<U, B>

The resulting type after applying the + operator.

fn add(self, _: UTerm) -> Self::Output

Performs the + operation.

impl<U: Unsigned, B: Bit> Binary for UInt<UInt<U, B>, B0>

where UInt<U, B>: Binary,

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

Formats the value using the given formatter.

impl<U: Unsigned, B: Bit> Binary for UInt<UInt<U, B>, B1>

where UInt<U, B>: Binary,

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

Formats the value using the given formatter.

impl Binary for UInt<UTerm, B0>

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

Formats the value using the given formatter.

impl Binary for UInt<UTerm, B1>

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

Formats the value using the given formatter.

impl<Ul: Unsigned, Bl: Bit, Ur: Unsigned> BitAnd<Ur> for UInt<Ul, Bl>

where UInt<Ul, Bl>: PrivateAnd<Ur>, PrivateAndOut<UInt<Ul, Bl>, Ur>: Trim,

Anding unsigned integers. We use our PrivateAnd operator and then Trim the output.

type Output = <<UInt<Ul, Bl> as PrivateAnd<Ur>>::Output as Trim>::Output

The resulting type after applying the & operator.

fn bitand(self, rhs: Ur) -> Self::Output

Performs the & operation.

impl<Ul, Bl, Ur, Br> BitDiff<UInt<Ur, Br>> for UInt<Ul, Bl>

where Ul: Unsigned + BitDiff<Ur>, Bl: Bit, Ur: Unsigned, Br: Bit,

type Output = <Ul as BitDiff<Ur>>::Output

impl<Ul, Ur: Unsigned> BitOr<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: BitOr<Ur> + Unsigned,

UInt<Ul, B0> | UInt<Ur, B0> = UInt<Ul | Ur, B0>

type Output = UInt<<Ul as BitOr<Ur>>::Output, B0>

The resulting type after applying the | operator.

fn bitor(self, rhs: UInt<Ur, B0>) -> Self::Output

Performs the | operation.

impl<Ul, Ur: Unsigned> BitOr<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: BitOr<Ur> + Unsigned,

UInt<Ul, B1> | UInt<Ur, B0> = UInt<Ul | Ur, B1>

type Output = UInt<<Ul as BitOr<Ur>>::Output, B1>

The resulting type after applying the | operator.

fn bitor(self, rhs: UInt<Ur, B0>) -> Self::Output

Performs the | operation.

impl<Ul, Ur: Unsigned> BitOr<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: BitOr<Ur> + Unsigned,

UInt<Ul, B0> | UInt<Ur, B1> = UInt<Ul | Ur, B1>

type Output = UInt<<Ul as BitOr<Ur>>::Output, B1>

The resulting type after applying the | operator.

fn bitor(self, rhs: UInt<Ur, B1>) -> Self::Output

Performs the | operation.

impl<Ul, Ur: Unsigned> BitOr<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: BitOr<Ur> + Unsigned,

UInt<Ul, B1> | UInt<Ur, B1> = UInt<Ul | Ur, B1>

type Output = UInt<<Ul as BitOr<Ur>>::Output, B1>

The resulting type after applying the | operator.

fn bitor(self, rhs: UInt<Ur, B1>) -> Self::Output

Performs the | operation.

impl<B: Bit, U: Unsigned> BitOr<UTerm> for UInt<U, B>

X | UTerm = X

type Output = UInt<U, B>

The resulting type after applying the | operator.

fn bitor(self, _: UTerm) -> Self::Output

Performs the | operation.

impl<Ul: Unsigned, Bl: Bit, Ur: Unsigned> BitXor<Ur> for UInt<Ul, Bl>

where UInt<Ul, Bl>: PrivateXor<Ur>, PrivateXorOut<UInt<Ul, Bl>, Ur>: Trim,

Xoring unsigned integers. We use our PrivateXor operator and then Trim the output.

type Output = <<UInt<Ul, Bl> as PrivateXor<Ur>>::Output as Trim>::Output

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: Ur) -> Self::Output

Performs the ^ operation.

impl<U: Clone, B: Clone> Clone for UInt<U, B>

fn clone(&self) -> UInt<U, B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<U: Unsigned, B: Bit> Cmp<UInt<U, B>> for UTerm

Zero < Nonzero

type Output = Less

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, _: &UInt<U, B>) -> Self::Output

impl<Ul, Ur: Unsigned> Cmp<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: PrivateCmp<Ur, Equal> + Unsigned,

UInt<Ul, B0> cmp with UInt<Ur, B0>: SoFar is Equal

type Output = <Ul as PrivateCmp<Ur, Equal>>::Output

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, rhs: &UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> Cmp<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: PrivateCmp<Ur, Greater> + Unsigned,

UInt<Ul, B1> cmp with UInt<Ur, B0>: SoFar is Greater

type Output = <Ul as PrivateCmp<Ur, Greater>>::Output

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, rhs: &UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> Cmp<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: PrivateCmp<Ur, Less> + Unsigned,

UInt<Ul, B0> cmp with UInt<Ur, B1>: SoFar is Less

type Output = <Ul as PrivateCmp<Ur, Less>>::Output

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, rhs: &UInt<Ur, B1>) -> Self::Output

impl<Ul, Ur: Unsigned> Cmp<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: PrivateCmp<Ur, Equal> + Unsigned,

UInt<Ul, B1> cmp with UInt<Ur, B1>: SoFar is Equal

type Output = <Ul as PrivateCmp<Ur, Equal>>::Output

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, rhs: &UInt<Ur, B1>) -> Self::Output

impl<U: Unsigned, B: Bit> Cmp<UTerm> for UInt<U, B>

Nonzero > Zero

type Output = Greater

The result of the comparison. It should only ever be one of Greater, Less, or Equal.

fn compare<IM: InternalMarker>(&self, _: &UTerm) -> Self::Output

impl<U: Debug, B: Debug> Debug for UInt<U, B>

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

Formats the value using the given formatter.

impl<U: Default, B: Default> Default for UInt<U, B>

fn default() -> UInt<U, B>

Returns the “default value” for a type.

impl<Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit> Div<UInt<Ur, Br>> for UInt<Ul, Bl>

where UInt<Ul, Bl>: Len, Length<UInt<Ul, Bl>>: Sub<B1>, (): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, U0, U0, Sub1<Length<UInt<Ul, Bl>>>>,

type Output = <() as PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>>::Quotient

The resulting type after applying the / operator.

fn div(self, rhs: UInt<Ur, Br>) -> Self::Output

Performs the / operation.

impl<Ur: Unsigned, Br: Bit> Div<UInt<Ur, Br>> for UTerm

type Output = UTerm

The resulting type after applying the / operator.

fn div(self, _: UInt<Ur, Br>) -> Self::Output

Performs the / operation.

impl<U: Eq, B: Eq> Eq for UInt<U, B>

#[doc(hidden)] fn assert_receiver_is_total_eq(&self)

impl<Xp, Yp> Gcd<UInt<Yp, B0>> for UInt<Xp, B0>

where Xp: Gcd<Yp>, UInt<Xp, B0>: NonZero, UInt<Yp, B0>: NonZero,

gcd(x, y) = 2*gcd(x/2, y/2) if both x and y even

type Output = UInt<<Xp as Gcd<Yp>>::Output, B0>

The greatest common divisor.

impl<Xp, Yp> Gcd<UInt<Yp, B0>> for UInt<Xp, B1>

where UInt<Xp, B1>: Gcd<Yp>, UInt<Yp, B0>: NonZero,

gcd(x, y) = gcd(x, y/2) if x odd and y even

type Output = <UInt<Xp, B1> as Gcd<Yp>>::Output

The greatest common divisor.

impl<Xp, Yp> Gcd<UInt<Yp, B1>> for UInt<Xp, B0>

where Xp: Gcd<UInt<Yp, B1>>, UInt<Xp, B0>: NonZero,

gcd(x, y) = gcd(x/2, y) if x even and y odd

type Output = <Xp as Gcd<UInt<Yp, B1>>>::Output

The greatest common divisor.

impl<Xp, Yp> Gcd<UInt<Yp, B1>> for UInt<Xp, B1>

where UInt<Xp, B1>: Max<UInt<Yp, B1>> + Min<UInt<Yp, B1>>, UInt<Yp, B1>: Max<UInt<Xp, B1>> + Min<UInt<Xp, B1>>, Maximum<UInt<Xp, B1>, UInt<Yp, B1>>: Sub<Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>, Diff<Maximum<UInt<Xp, B1>, UInt<Yp, B1>>, Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>: Gcd<Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>,

gcd(x, y) = gcd([max(x, y) - min(x, y)], min(x, y)) if both x and y odd

This will immediately invoke the case for x even and y odd because the difference of two odd numbers is an even number.

type Output = <<<UInt<Xp, B1> as Max<UInt<Yp, B1>>>::Output as Sub<<UInt<Xp, B1> as Min<UInt<Yp, B1>>>::Output>>::Output as Gcd<<UInt<Xp, B1> as Min<UInt<Yp, B1>>>::Output>>::Output

The greatest common divisor.

impl<Un, Bn, Ui, Bi> GetBit<UInt<Ui, Bi>> for UInt<Un, Bn>

where UInt<Ui, Bi>: Copy + Sub<B1>, Un: GetBit<Sub1<UInt<Ui, Bi>>>,

type Output = <Un as GetBit<<UInt<Ui, Bi> as Sub<B1>>::Output>>::Output

fn get_bit<IM: InternalMarker>(&self, i: &UInt<Ui, Bi>) -> Self::Output

impl<Un, Bn> GetBit<UTerm> for UInt<Un, Bn>

where Bn: Copy,

type Output = Bn

fn get_bit<IM: InternalMarker>(&self, _: &U0) -> Self::Output

impl<U: Hash, B: Hash> Hash for UInt<U, B>

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

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<U, B: Bit> Invert for UInt<U, B>

where U: PrivateInvert<InvertedUInt<InvertedUTerm, B>> + Unsigned,

type Output = <U as PrivateInvert<InvertedUInt<InvertedUTerm, B>>>::Output

fn invert(self) -> Self::Output

impl<U, B: Bit> Len for UInt<U, B>

where U: Len + Unsigned, Length<U>: Add<B1>, Add1<Length<U>>: Unsigned,

Length of a bit is 1

type Output = <<U as Len>::Output as Add<B1>>::Output

The length as a type-level unsigned integer.

fn len(&self) -> Self::Output

This function isn’t used in this crate, but may be useful for others.

impl<U, B, Ur> Max<Ur> for UInt<U, B>

where U: Unsigned, B: Bit, Ur: Unsigned, UInt<U, B>: Cmp<Ur> + PrivateMax<Ur, Compare<UInt<U, B>, Ur>>,

type Output = <UInt<U, B> as PrivateMax<Ur, <UInt<U, B> as Cmp<Ur>>::Output>>::Output

The type of the maximum of Self and Rhs

fn max(self, rhs: Ur) -> Self::Output

Method returning the maximum

impl<U, B, Ur> Min<Ur> for UInt<U, B>

where U: Unsigned, B: Bit, Ur: Unsigned, UInt<U, B>: Cmp<Ur> + PrivateMin<Ur, Compare<UInt<U, B>, Ur>>,

type Output = <UInt<U, B> as PrivateMin<Ur, <UInt<U, B> as Cmp<Ur>>::Output>>::Output

The type of the minimum of Self and Rhs

fn min(self, rhs: Ur) -> Self::Output

Method returning the minimum

impl<U: Unsigned, B: Bit> Mul<B0> for UInt<U, B>

UInt * B0 = UTerm

type Output = UTerm

The resulting type after applying the * operator.

fn mul(self, _: B0) -> Self::Output

Performs the * operation.

impl<U: Unsigned, B: Bit> Mul<B1> for UInt<U, B>

UInt * B1 = UInt

type Output = UInt<U, B>

The resulting type after applying the * operator.

fn mul(self, _: B1) -> Self::Output

Performs the * operation.

impl<Ul, B: Bit, Ur: Unsigned> Mul<UInt<Ur, B>> for UInt<Ul, B0>

where Ul: Mul<UInt<Ur, B>> + Unsigned,

UInt<Ul, B0> * UInt<Ur, B> = UInt<(Ul * UInt<Ur, B>), B0>

type Output = UInt<<Ul as Mul<UInt<Ur, B>>>::Output, B0>

The resulting type after applying the * operator.

fn mul(self, rhs: UInt<Ur, B>) -> Self::Output

Performs the * operation.

impl<Ul, B: Bit, Ur: Unsigned> Mul<UInt<Ur, B>> for UInt<Ul, B1>

where Ul: Mul<UInt<Ur, B>> + Unsigned, UInt<Prod<Ul, UInt<Ur, B>>, B0>: Add<UInt<Ur, B>>,

UInt<Ul, B1> * UInt<Ur, B> = UInt<(Ul * UInt<Ur, B>), B0> + UInt<Ur, B>

type Output = <UInt<<Ul as Mul<UInt<Ur, B>>>::Output, B0> as Add<UInt<Ur, B>>>::Output

The resulting type after applying the * operator.

fn mul(self, rhs: UInt<Ur, B>) -> Self::Output

Performs the * operation.

impl<U: Unsigned, B: Bit> Mul<UTerm> for UInt<U, B>

UInt<U, B> * UTerm = UTerm

type Output = UTerm

The resulting type after applying the * operator.

fn mul(self, _: UTerm) -> Self::Output

Performs the * operation.

impl<U: Ord, B: Ord> Ord for UInt<U, B>

fn cmp(&self, other: &UInt<U, B>) -> 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<Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit> PartialDiv<UInt<Ur, Br>> for UInt<Ul, Bl>

where UInt<Ul, Bl>: Div<UInt<Ur, Br>> + Rem<UInt<Ur, Br>, Output = U0>,

type Output = <UInt<Ul, Bl> as Div<UInt<Ur, Br>>>::Output

The type of the result of the division

fn partial_div(self, rhs: UInt<Ur, Br>) -> Self::Output

Method for performing the division

impl<Ur: Unsigned, Br: Bit> PartialDiv<UInt<Ur, Br>> for UTerm

type Output = UTerm

The type of the result of the division

fn partial_div(self, _: UInt<Ur, Br>) -> Self::Output

Method for performing the division

impl<U: PartialEq, B: PartialEq> PartialEq for UInt<U, B>

fn eq(&self, other: &UInt<U, B>) -> 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<U: PartialOrd, B: PartialOrd> PartialOrd for UInt<U, B>

fn partial_cmp(&self, other: &UInt<U, B>) -> 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.

#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

If self == other, returns ControlFlow::Continue(()). Otherwise, returns ControlFlow::Break(self < other).

#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for <= instead of <.

#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for > instead of <.

#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for >= instead of <.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for f32

type Output = f32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for f64

type Output = f64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for i16

type Output = i16

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for i32

type Output = i32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for i64

type Output = i64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for i8

type Output = i8

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for isize

type Output = isize

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for u16

type Output = u16

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for u32

type Output = u32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for u64

type Output = u64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for u8

type Output = u8

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<U: Unsigned, B: Bit> Pow<UInt<U, B>> for usize

type Output = usize

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> Self::Output

This function isn’t used in this crate, but may be useful for others. It is implemented for primitives.

impl<Ul, Ur: Unsigned> PrivateAnd<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: PrivateAnd<Ur> + Unsigned,

UInt<Ul, B0> & UInt<Ur, B0> = UInt<Ul & Ur, B0>

type Output = UInt<<Ul as PrivateAnd<Ur>>::Output, B0>

fn private_and(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateAnd<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: PrivateAnd<Ur> + Unsigned,

UInt<Ul, B1> & UInt<Ur, B0> = UInt<Ul & Ur, B0>

type Output = UInt<<Ul as PrivateAnd<Ur>>::Output, B0>

fn private_and(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateAnd<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: PrivateAnd<Ur> + Unsigned,

UInt<Ul, B0> & UInt<Ur, B1> = UInt<Ul & Ur, B0>

type Output = UInt<<Ul as PrivateAnd<Ur>>::Output, B0>

fn private_and(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateAnd<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: PrivateAnd<Ur> + Unsigned,

UInt<Ul, B1> & UInt<Ur, B1> = UInt<Ul & Ur, B1>

type Output = UInt<<Ul as PrivateAnd<Ur>>::Output, B1>

fn private_and(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<B: Bit, U: Unsigned> PrivateAnd<UTerm> for UInt<U, B>

X & UTerm = UTerm

type Output = UTerm

fn private_and(self, _: UTerm) -> Self::Output

impl<U: Unsigned, B: Bit, SoFar: Ord> PrivateCmp<UInt<U, B>, SoFar> for UTerm

Got to the end of just the Lhs. It’s Less.

type Output = Less

fn private_cmp(&self, _: &UInt<U, B>, _: SoFar) -> Self::Output

impl<Ul, Ur, SoFar> PrivateCmp<UInt<Ur, B0>, SoFar> for UInt<Ul, B0>

where Ul: Unsigned + PrivateCmp<Ur, SoFar>, Ur: Unsigned, SoFar: Ord,

Comparing non-terimal bits, with both having bit B0. These are Equal, so we propagate SoFar.

type Output = <Ul as PrivateCmp<Ur, SoFar>>::Output

fn private_cmp(&self, rhs: &UInt<Ur, B0>, so_far: SoFar) -> Self::Output

impl<Ul, Ur, SoFar> PrivateCmp<UInt<Ur, B0>, SoFar> for UInt<Ul, B1>

where Ul: Unsigned + PrivateCmp<Ur, Greater>, Ur: Unsigned, SoFar: Ord,

Comparing non-terimal bits, with Lhs having bit B1 and Rhs having bit B0. SoFar, Lhs is Greater.

type Output = <Ul as PrivateCmp<Ur, Greater>>::Output

fn private_cmp(&self, rhs: &UInt<Ur, B0>, _: SoFar) -> Self::Output

impl<Ul, Ur, SoFar> PrivateCmp<UInt<Ur, B1>, SoFar> for UInt<Ul, B0>

where Ul: Unsigned + PrivateCmp<Ur, Less>, Ur: Unsigned, SoFar: Ord,

Comparing non-terimal bits, with Lhs having bit B0 and Rhs having bit B1. SoFar, Lhs is Less.

type Output = <Ul as PrivateCmp<Ur, Less>>::Output

fn private_cmp(&self, rhs: &UInt<Ur, B1>, _: SoFar) -> Self::Output

impl<Ul, Ur, SoFar> PrivateCmp<UInt<Ur, B1>, SoFar> for UInt<Ul, B1>

where Ul: Unsigned + PrivateCmp<Ur, SoFar>, Ur: Unsigned, SoFar: Ord,

Comparing non-terimal bits, with both having bit B1. These are Equal, so we propagate SoFar.

type Output = <Ul as PrivateCmp<Ur, SoFar>>::Output

fn private_cmp(&self, rhs: &UInt<Ur, B1>, so_far: SoFar) -> Self::Output

impl<U: Unsigned, B: Bit, SoFar: Ord> PrivateCmp<UTerm, SoFar> for UInt<U, B>

Got to the end of just the Rhs. Lhs is Greater.

type Output = Greater

fn private_cmp(&self, _: &UTerm, _: SoFar) -> Self::Output

impl<N, D, Q, Ur, Br, I> PrivateDiv<N, D, Q, UInt<Ur, Br>, I> for ()

where N: GetBit<I>, UInt<UInt<Ur, Br>, GetBitOut<N, I>>: Cmp<D>, (): PrivateDivIf<N, D, Q, UInt<UInt<Ur, Br>, GetBitOut<N, I>>, I, Compare<UInt<UInt<Ur, Br>, GetBitOut<N, I>>, D>>,

type Quotient = <() as PrivateDivIf<N, D, Q, UInt<UInt<Ur, Br>, <N as GetBit<I>>::Output>, I, <UInt<UInt<Ur, Br>, <N as GetBit<I>>::Output> as Cmp<D>>::Output>>::Quotient

type Remainder = <() as PrivateDivIf<N, D, Q, UInt<UInt<Ur, Br>, <N as GetBit<I>>::Output>, I, <UInt<UInt<Ur, Br>, <N as GetBit<I>>::Output> as Cmp<D>>::Output>>::Remainder

fn private_div_quotient( self, n: N, d: D, q: Q, r: UInt<Ur, Br>, i: I, ) -> Self::Quotient

fn private_div_remainder( self, n: N, d: D, q: Q, r: UInt<Ur, Br>, i: I, ) -> Self::Remainder

impl<N, D, Q, R, Ui, Bi> PrivateDivIf<N, D, Q, R, UInt<Ui, Bi>, Equal> for ()

where UInt<Ui, Bi>: Copy + Sub<B1>, Q: SetBit<UInt<Ui, Bi>, B1>, (): PrivateDiv<N, D, SetBitOut<Q, UInt<Ui, Bi>, B1>, U0, Sub1<UInt<Ui, Bi>>>,

type Quotient = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, UTerm, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Quotient

type Remainder = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, UTerm, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Remainder

fn private_div_if_quotient( self, n: N, d: D, q: Q, _: R, i: UInt<Ui, Bi>, _: Equal, ) -> Self::Quotient

fn private_div_if_remainder( self, n: N, d: D, q: Q, _: R, i: UInt<Ui, Bi>, _: Equal, ) -> Self::Remainder

impl<N, D, Q, R, Ui, Bi> PrivateDivIf<N, D, Q, R, UInt<Ui, Bi>, Greater> for ()

where D: Copy, UInt<Ui, Bi>: Copy + Sub<B1>, R: Sub<D>, Q: SetBit<UInt<Ui, Bi>, B1>, (): PrivateDiv<N, D, SetBitOut<Q, UInt<Ui, Bi>, B1>, Diff<R, D>, Sub1<UInt<Ui, Bi>>>,

type Quotient = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, <R as Sub<D>>::Output, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Quotient

type Remainder = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, <R as Sub<D>>::Output, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Remainder

fn private_div_if_quotient( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Greater, ) -> Self::Quotient

fn private_div_if_remainder( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Greater, ) -> Self::Remainder

impl<N, D, Q, R, Ui, Bi> PrivateDivIf<N, D, Q, R, UInt<Ui, Bi>, Less> for ()

where UInt<Ui, Bi>: Sub<B1>, (): PrivateDiv<N, D, Q, R, Sub1<UInt<Ui, Bi>>>,

type Quotient = <() as PrivateDiv<N, D, Q, R, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Quotient

type Remainder = <() as PrivateDiv<N, D, Q, R, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Remainder

fn private_div_if_quotient( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Less, ) -> Self::Quotient

fn private_div_if_remainder( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Less, ) -> Self::Remainder

impl<IU: InvertedUnsigned, U, B: Bit> PrivateInvert<IU> for UInt<U, B>

where U: PrivateInvert<InvertedUInt<IU, B>> + Unsigned,

type Output = <U as PrivateInvert<InvertedUInt<IU, B>>>::Output

fn private_invert(self, rhs: IU) -> Self::Output

impl<U, B> PrivateLogarithm2 for UInt<U, B>

where U: Unsigned + Logarithm2, B: Bit, Log2<U>: Add<B1>,

type Output = <<U as Logarithm2>::Output as Add<B1>>::Output

impl PrivateLogarithm2 for UInt<UTerm, B1>

type Output = UTerm

impl<U, B, Ur> PrivateMax<Ur, Equal> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = UInt<U, B>

fn private_max(self, _: Ur) -> Self::Output

impl<U, B, Ur> PrivateMax<Ur, Greater> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = UInt<U, B>

fn private_max(self, _: Ur) -> Self::Output

impl<U, B, Ur> PrivateMax<Ur, Less> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = Ur

fn private_max(self, rhs: Ur) -> Self::Output

impl<U, B, Ur> PrivateMin<Ur, Equal> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = UInt<U, B>

fn private_min(self, _: Ur) -> Self::Output

impl<U, B, Ur> PrivateMin<Ur, Greater> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = Ur

fn private_min(self, rhs: Ur) -> Self::Output

impl<U, B, Ur> PrivateMin<Ur, Less> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = UInt<U, B>

fn private_min(self, _: Ur) -> Self::Output

impl<Ul, Ur, U, B> PrivateRem<UInt<U, B>, NInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero, U: Unsigned, B: Bit,

type Output = NInt<UInt<U, B>>

fn private_rem(self, urem: UInt<U, B>, _: NInt<Ur>) -> Self::Output

impl<Ul, Ur, U, B> PrivateRem<UInt<U, B>, NInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero, U: Unsigned, B: Bit,

type Output = PInt<UInt<U, B>>

fn private_rem(self, urem: UInt<U, B>, _: NInt<Ur>) -> Self::Output

impl<Ul, Ur, U, B> PrivateRem<UInt<U, B>, PInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero, U: Unsigned, B: Bit,

type Output = NInt<UInt<U, B>>

fn private_rem(self, urem: UInt<U, B>, _: PInt<Ur>) -> Self::Output

impl<Ul, Ur, U, B> PrivateRem<UInt<U, B>, PInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero, U: Unsigned, B: Bit,

type Output = PInt<UInt<U, B>>

fn private_rem(self, urem: UInt<U, B>, _: PInt<Ur>) -> Self::Output

impl<Un, Bn, Ui, Bi, B> PrivateSetBit<UInt<Ui, Bi>, B> for UInt<Un, Bn>

where UInt<Ui, Bi>: Sub<B1>, Un: PrivateSetBit<Sub1<UInt<Ui, Bi>>, B>,

type Output = UInt<<Un as PrivateSetBit<<UInt<Ui, Bi> as Sub<B1>>::Output, B>>::Output, Bn>

fn private_set_bit(self, i: UInt<Ui, Bi>, b: B) -> Self::Output

impl<Un, Bn, B> PrivateSetBit<UTerm, B> for UInt<Un, Bn>

type Output = UInt<Un, B>

fn private_set_bit(self, _: U0, b: B) -> Self::Output

impl<U, Ba, Bb> PrivateSquareRoot for UInt<UInt<U, Ba>, Bb>

where U: Unsigned + SquareRoot, Ba: Bit, Bb: Bit, Sqrt<U>: Shl<B1>, Double<Sqrt<U>>: Add<B1> + Add<GrEq<Self, Square<Add1<Double<Sqrt<U>>>>>>, Add1<Double<Sqrt<U>>>: Mul, Self: IsGreaterOrEqual<Square<Add1<Double<Sqrt<U>>>>>,

type Output = <<<U as SquareRoot>::Output as Shl<B1>>::Output as Add<<UInt<UInt<U, Ba>, Bb> as IsGreaterOrEqual<<<<<U as SquareRoot>::Output as Shl<B1>>::Output as Add<B1>>::Output as Mul>::Output>>::Output>>::Output

impl PrivateSquareRoot for UInt<UTerm, B1>

type Output = UInt<UTerm, B1>

impl<Ul, Ur: Unsigned> PrivateSub<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: PrivateSub<Ur> + Unsigned,

UInt<Ul, B0> - UInt<Ur, B0> = UInt<Ul - Ur, B0>

type Output = UInt<<Ul as PrivateSub<Ur>>::Output, B0>

fn private_sub(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateSub<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: PrivateSub<Ur> + Unsigned,

UInt<Ul, B1> - UInt<Ur, B0> = UInt<Ul - Ur, B1>

type Output = UInt<<Ul as PrivateSub<Ur>>::Output, B1>

fn private_sub(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateSub<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: PrivateSub<Ur> + Unsigned, PrivateSubOut<Ul, Ur>: Sub<B1>,

UInt<Ul, B0> - UInt<Ur, B1> = UInt<(Ul - Ur) - B1, B1>

type Output = UInt<<<Ul as PrivateSub<Ur>>::Output as Sub<B1>>::Output, B1>

fn private_sub(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateSub<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: PrivateSub<Ur> + Unsigned,

UInt<Ul, B1> - UInt<Ur, B1> = UInt<Ul - Ur, B0>

type Output = UInt<<Ul as PrivateSub<Ur>>::Output, B0>

fn private_sub(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateXor<UInt<Ur, B0>> for UInt<Ul, B0>

where Ul: PrivateXor<Ur> + Unsigned,

UInt<Ul, B0> ^ UInt<Ur, B0> = UInt<Ul ^ Ur, B0>

type Output = UInt<<Ul as PrivateXor<Ur>>::Output, B0>

fn private_xor(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateXor<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: PrivateXor<Ur> + Unsigned,

UInt<Ul, B1> ^ UInt<Ur, B0> = UInt<Ul ^ Ur, B1>

type Output = UInt<<Ul as PrivateXor<Ur>>::Output, B1>

fn private_xor(self, rhs: UInt<Ur, B0>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateXor<UInt<Ur, B1>> for UInt<Ul, B0>

where Ul: PrivateXor<Ur> + Unsigned,

UInt<Ul, B0> ^ UInt<Ur, B1> = UInt<Ul ^ Ur, B1>

type Output = UInt<<Ul as PrivateXor<Ur>>::Output, B1>

fn private_xor(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<Ul, Ur: Unsigned> PrivateXor<UInt<Ur, B1>> for UInt<Ul, B1>

where Ul: PrivateXor<Ur> + Unsigned,

UInt<Ul, B1> ^ UInt<Ur, B1> = UInt<Ul ^ Ur, B0>

type Output = UInt<<Ul as PrivateXor<Ur>>::Output, B0>

fn private_xor(self, rhs: UInt<Ur, B1>) -> Self::Output

impl<B: Bit, U: Unsigned> PrivateXor<UTerm> for UInt<U, B>

X ^ UTerm = X

type Output = UInt<U, B>

fn private_xor(self, _: UTerm) -> Self::Output

impl<Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit> Rem<UInt<Ur, Br>> for UInt<Ul, Bl>

where UInt<Ul, Bl>: Len, Length<UInt<Ul, Bl>>: Sub<B1>, (): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, U0, U0, Sub1<Length<UInt<Ul, Bl>>>>,

type Output = <() as PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>>::Remainder

The resulting type after applying the % operator.

fn rem(self, rhs: UInt<Ur, Br>) -> Self::Output

Performs the % operation.

impl<Ur: Unsigned, Br: Bit> Rem<UInt<Ur, Br>> for UTerm

type Output = UTerm

The resulting type after applying the % operator.

fn rem(self, _: UInt<Ur, Br>) -> Self::Output

Performs the % operation.

impl<U: Unsigned, B: Bit> Shl<B0> for UInt<U, B>

Shifting left any unsigned by a zero bit: U << B0 = U

type Output = UInt<U, B>

The resulting type after applying the << operator.

fn shl(self, _: B0) -> Self::Output

Performs the << operation.

impl<U: Unsigned, B: Bit> Shl<B1> for UInt<U, B>

Shifting left a UInt by a one bit: UInt<U, B> << B1 = UInt<UInt<U, B>, B0>

type Output = UInt<UInt<U, B>, B0>

The resulting type after applying the << operator.

fn shl(self, _: B1) -> Self::Output

Performs the << operation.

impl<U: Unsigned, B: Bit, Ur: Unsigned, Br: Bit> Shl<UInt<Ur, Br>> for UInt<U, B>

where UInt<Ur, Br>: Sub<B1>, UInt<UInt<U, B>, B0>: Shl<Sub1<UInt<Ur, Br>>>,

Shifting left UInt by UInt: X << Y = UInt(X, B0) << (Y - 1)

type Output = <UInt<UInt<U, B>, B0> as Shl<<UInt<Ur, Br> as Sub<B1>>::Output>>::Output

The resulting type after applying the << operator.

fn shl(self, rhs: UInt<Ur, Br>) -> Self::Output

Performs the << operation.

impl<U: Unsigned, B: Bit> Shl<UTerm> for UInt<U, B>

Shifting left UInt by UTerm: UInt<U, B> << UTerm = UInt<U, B>

type Output = UInt<U, B>

The resulting type after applying the << operator.

fn shl(self, _: UTerm) -> Self::Output

Performs the << operation.

impl<U: Unsigned, B: Bit> Shr<B0> for UInt<U, B>

Shifting right any unsigned by a zero bit: U >> B0 = U

type Output = UInt<U, B>

The resulting type after applying the >> operator.

fn shr(self, _: B0) -> Self::Output

Performs the >> operation.

impl<U: Unsigned, B: Bit> Shr<B1> for UInt<U, B>

Shifting right a UInt by a 1 bit: UInt<U, B> >> B1 = U

type Output = U

The resulting type after applying the >> operator.

fn shr(self, _: B1) -> Self::Output

Performs the >> operation.

impl<U, B: Bit, Ur: Unsigned, Br: Bit> Shr<UInt<Ur, Br>> for UInt<U, B>

where UInt<Ur, Br>: Sub<B1>, U: Shr<Sub1<UInt<Ur, Br>>> + Unsigned,

Shifting right UInt by UInt: UInt(U, B) >> Y = U >> (Y - 1)

type Output = <U as Shr<<UInt<Ur, Br> as Sub<B1>>::Output>>::Output

The resulting type after applying the >> operator.

fn shr(self, rhs: UInt<Ur, Br>) -> Self::Output

Performs the >> operation.

impl<U: Unsigned, B: Bit> Shr<UTerm> for UInt<U, B>

Shifting right UInt by UTerm: UInt<U, B> >> UTerm = UInt<U, B>

type Output = UInt<U, B>

The resulting type after applying the >> operator.

fn shr(self, _: UTerm) -> Self::Output

Performs the >> operation.

impl<U: Unsigned, B: Bit> Sub<B0> for UInt<U, B>

UInt - B0 = UInt

type Output = UInt<U, B>

The resulting type after applying the - operator.

fn sub(self, _: B0) -> Self::Output

Performs the - operation.

impl<U> Sub<B1> for UInt<U, B0>

where U: Sub<B1> + Unsigned, Sub1<U>: Unsigned,

UInt<U, B0> - B1 = UInt<U - B1, B1>

type Output = UInt<<U as Sub<B1>>::Output, B1>

The resulting type after applying the - operator.

fn sub(self, _: B1) -> Self::Output

Performs the - operation.

impl<U: Unsigned, B: Bit> Sub<B1> for UInt<UInt<U, B>, B1>

UInt<U, B1> - B1 = UInt<U, B0>

type Output = UInt<UInt<U, B>, B0>

The resulting type after applying the - operator.

fn sub(self, _: B1) -> Self::Output

Performs the - operation.

impl Sub<B1> for UInt<UTerm, B1>

UInt<UTerm, B1> - B1 = UTerm

type Output = UTerm

The resulting type after applying the - operator.

fn sub(self, _: B1) -> Self::Output

Performs the - operation.

impl<Ul: Unsigned, Bl: Bit, Ur: Unsigned> Sub<Ur> for UInt<Ul, Bl>

where UInt<Ul, Bl>: PrivateSub<Ur>, PrivateSubOut<UInt<Ul, Bl>, Ur>: Trim,

Subtracting unsigned integers. We just do our PrivateSub and then Trim the output.

type Output = <<UInt<Ul, Bl> as PrivateSub<Ur>>::Output as Trim>::Output

The resulting type after applying the - operator.

fn sub(self, rhs: Ur) -> Self::Output

Performs the - operation.

impl<U, B> ToInt<i16> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: i16 = Self::I16

The concrete value for the type. Can be used in const contexts.

fn to_int() -> i16

Method returning the concrete value for the type.

impl<U, B> ToInt<i32> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: i32 = Self::I32

The concrete value for the type. Can be used in const contexts.

fn to_int() -> i32

Method returning the concrete value for the type.

impl<U, B> ToInt<i64> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: i64 = Self::I64

The concrete value for the type. Can be used in const contexts.

fn to_int() -> i64

Method returning the concrete value for the type.

impl<U, B> ToInt<i8> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: i8 = Self::I8

The concrete value for the type. Can be used in const contexts.

fn to_int() -> i8

Method returning the concrete value for the type.

impl<U, B> ToInt<isize> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: isize = Self::ISIZE

The concrete value for the type. Can be used in const contexts.

fn to_int() -> isize

Method returning the concrete value for the type.

impl<U, B> ToInt<u16> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: u16 = Self::U16

The concrete value for the type. Can be used in const contexts.

fn to_int() -> u16

Method returning the concrete value for the type.

impl<U, B> ToInt<u32> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: u32 = Self::U32

The concrete value for the type. Can be used in const contexts.

fn to_int() -> u32

Method returning the concrete value for the type.

impl<U, B> ToInt<u64> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: u64 = Self::U64

The concrete value for the type. Can be used in const contexts.

fn to_int() -> u64

Method returning the concrete value for the type.

impl<U, B> ToInt<u8> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: u8 = Self::U8

The concrete value for the type. Can be used in const contexts.

fn to_int() -> u8

Method returning the concrete value for the type.

impl<U, B> ToInt<usize> for UInt<U, B>

where U: Unsigned, B: Bit,

const INT: usize = Self::USIZE

The concrete value for the type. Can be used in const contexts.

fn to_int() -> usize

Method returning the concrete value for the type.

impl<U: Unsigned, B: Bit> Unsigned for UInt<U, B>

const U8: u8

const U16: u16

const U32: u32

const U64: u64

const USIZE: usize

const I8: i8

const I16: i16

const I32: i32

const I64: i64

const ISIZE: isize

fn to_u8() -> u8

fn to_u16() -> u16

fn to_u32() -> u32

fn to_u64() -> u64

fn to_usize() -> usize

fn to_i8() -> i8

fn to_i16() -> i16

fn to_i32() -> i32

fn to_i64() -> i64

fn to_isize() -> isize

impl<U: Copy, B: Copy> Copy for UInt<U, B>

impl<U: Unsigned, B: Bit> NonZero for UInt<U, B>

impl<U: Unsigned + PowerOfTwo> PowerOfTwo for UInt<U, B0>

impl PowerOfTwo for UInt<UTerm, B1>

impl<U, B> StructuralPartialEq for UInt<U, B>