Type Alias U389

pub type U389 = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B0>, B1>, B0>, B1>;

Aliased Type

pub struct U389 { /* private fields */ }

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 0 bytes

Implementations

impl<U, B> UInt<U, B>

where U: Unsigned, B: Bit,

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

Instantiates a singleton representing this unsigned integer.

Trait Implementations

impl<U, B> Add<B0> for UInt<U, B>

where U: Unsigned, B: Bit,

U + B0 = U

type Output = UInt<U, B>

The resulting type after applying the + operator.

fn add(self, _: B0) -> <UInt<U, B> as Add<B0>>::Output

Performs the + operation.

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

where U: Unsigned + Add<B1>, <U as Add<B1>>::Output: 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) -> <UInt<U, B1> as Add<B1>>::Output

Performs the + operation.

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

where Ul: Unsigned + Add<Ur>, 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>) -> <UInt<Ul, B1> as Add<UInt<Ur, B0>>>::Output

Performs the + operation.

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

where Ul: Unsigned + Add<Ur>, Ur: Unsigned, <Ul as Add<Ur>>::Output: 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>) -> <UInt<Ul, B1> as Add<UInt<Ur, B1>>>::Output

Performs the + operation.

impl<U, B> Add<UTerm> for UInt<U, B>

where U: Unsigned, B: Bit,

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

type Output = UInt<U, B>

The resulting type after applying the + operator.

fn add(self, _: UTerm) -> <UInt<U, B> as Add<UTerm>>::Output

Performs the + operation.

impl<T, N> ArrayLength<T> for UInt<N, B1>

where N: ArrayLength<T>,

type ArrayType

Associated type representing the array type for the number

impl<Ul, Bl, Ur> BitAnd<Ur> for UInt<Ul, Bl>

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, UInt<Ul, Bl>: PrivateAnd<Ur>, <UInt<Ul, Bl> as PrivateAnd<Ur>>::Output: 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) -> <UInt<Ul, Bl> as BitAnd<Ur>>::Output

Performs the & operation.

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

where Ul: Unsigned + BitOr<Ur>, 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>, ) -> <UInt<Ul, B1> as BitOr<UInt<Ur, B0>>>::Output

Performs the | operation.

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

where Ul: Unsigned + BitOr<Ur>, 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>, ) -> <UInt<Ul, B1> as BitOr<UInt<Ur, B1>>>::Output

Performs the | operation.

impl<B, U> BitOr<UTerm> for UInt<U, B>

where B: Bit, U: Unsigned,

X | UTerm = X

type Output = UInt<U, B>

The resulting type after applying the | operator.

fn bitor(self, _: UTerm) -> <UInt<U, B> as BitOr<UTerm>>::Output

Performs the | operation.

impl<Ul, Bl, Ur> BitXor<Ur> for UInt<Ul, Bl>

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, UInt<Ul, Bl>: PrivateXor<Ur>, <UInt<Ul, Bl> as PrivateXor<Ur>>::Output: 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) -> <UInt<Ul, Bl> as BitXor<Ur>>::Output

Performs the ^ operation.

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

where U: Clone, B: Clone,

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<Ul, Ur> Cmp<UInt<Ur, B0>> for UInt<Ul, B1>

where Ul: Unsigned + PrivateCmp<Ur, Greater>, Ur: 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.

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

where Ul: Unsigned + PrivateCmp<Ur, Equal>, Ur: 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.

impl<U, B> Cmp<UTerm> for UInt<U, B>

where U: Unsigned, B: Bit,

Nonzero > Zero

type Output = Greater

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

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

where U: Debug, B: Debug,

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

Formats the value using the given formatter.

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

where U: Default, B: Default,

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

Returns the “default value” for a type.

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

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit, UInt<Ul, Bl>: Len, <UInt<Ul, Bl> as Len>::Output: Sub<B1>, (): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>,

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>) -> <UInt<Ul, Bl> as Div<UInt<Ur, Br>>>::Output

Performs the / operation.

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, B1>

where UInt<Xp, B1>: Max<UInt<Yp, B1>> + Min<UInt<Yp, B1>>, UInt<Yp, B1>: Max<UInt<Xp, B1>> + Min<UInt<Xp, B1>>, <UInt<Xp, B1> as Max<UInt<Yp, B1>>>::Output: Sub<<UInt<Xp, B1> as Min<UInt<Yp, B1>>>::Output>, <<UInt<Xp, B1> as Max<UInt<Yp, B1>>>::Output as Sub<<UInt<Xp, B1> as Min<UInt<Yp, B1>>>::Output>>::Output: Gcd<<UInt<Xp, B1> as Min<UInt<Yp, B1>>>::Output>,

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<<UInt<Ui, Bi> as Sub<B1>>::Output>,

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

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

where Bn: Copy,

type Output = Bn

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

where U: Hash, B: Hash,

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<U, B> Len for UInt<U, B>

where U: Unsigned + Len, B: Bit, <U as Len>::Output: Add<B1>, <<U as Len>::Output as Add<B1>>::Output: 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) -> <UInt<U, B> as Len>::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, <UInt<U, B> as Cmp<Ur>>::Output>,

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) -> <UInt<U, B> as Max<Ur>>::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, <UInt<U, B> as Cmp<Ur>>::Output>,

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) -> <UInt<U, B> as Min<Ur>>::Output

Method returning the minimum

impl<U, B> Mul<B0> for UInt<U, B>

where U: Unsigned, B: Bit,

UInt * B0 = UTerm

type Output = UTerm

The resulting type after applying the * operator.

fn mul(self, _: B0) -> <UInt<U, B> as Mul<B0>>::Output

Performs the * operation.

impl<U, B> Mul<B1> for UInt<U, B>

where U: Unsigned, B: Bit,

UInt * B1 = UInt

type Output = UInt<U, B>

The resulting type after applying the * operator.

fn mul(self, _: B1) -> <UInt<U, B> as Mul<B1>>::Output

Performs the * operation.

impl<Ul, B, Ur> Mul<UInt<Ur, B>> for UInt<Ul, B1>

where Ul: Unsigned + Mul<UInt<Ur, B>>, B: Bit, Ur: Unsigned, UInt<<Ul as Mul<UInt<Ur, B>>>::Output, 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>) -> <UInt<Ul, B1> as Mul<UInt<Ur, B>>>::Output

Performs the * operation.

impl<U, B> Mul<UTerm> for UInt<U, B>

where U: Unsigned, B: Bit,

UInt<U, B> * UTerm = UTerm

type Output = UTerm

The resulting type after applying the * operator.

fn mul(self, _: UTerm) -> <UInt<U, B> as Mul<UTerm>>::Output

Performs the * operation.

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

where U: Ord, B: Ord,

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, Bl, Ur, Br> PartialDiv<UInt<Ur, Br>> for UInt<Ul, Bl>

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit, UInt<Ul, Bl>: Div<UInt<Ur, Br>> + Rem<UInt<Ur, Br>, Output = UTerm>,

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>, ) -> <UInt<Ul, Bl> as PartialDiv<UInt<Ur, Br>>>::Output

Method for performing the division

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

where U: PartialEq, B: PartialEq,

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, B> PartialOrd for UInt<U, B>

where U: PartialOrd, B: PartialOrd,

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.

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

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, Br: Bit, UInt<Ul, Bl>: Len, <UInt<Ul, Bl> as Len>::Output: Sub<B1>, (): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>,

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>) -> <UInt<Ul, Bl> as Rem<UInt<Ur, Br>>>::Output

Performs the % operation.

impl<U, B> Shl<B0> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shl<B0>>::Output

Performs the << operation.

impl<U, B> Shl<B1> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shl<B1>>::Output

Performs the << operation.

impl<U, B, Ur, Br> Shl<UInt<Ur, Br>> for UInt<U, B>

where U: Unsigned, B: Bit, Ur: Unsigned, Br: Bit, UInt<Ur, Br>: Sub<B1>, UInt<UInt<U, B>, B0>: Shl<<UInt<Ur, Br> as Sub<B1>>::Output>,

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>) -> <UInt<U, B> as Shl<UInt<Ur, Br>>>::Output

Performs the << operation.

impl<U, B> Shl<UTerm> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shl<UTerm>>::Output

Performs the << operation.

impl<U, B> Shr<B0> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shr<B0>>::Output

Performs the >> operation.

impl<U, B> Shr<B1> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shr<B1>>::Output

Performs the >> operation.

impl<U, B, Ur, Br> Shr<UInt<Ur, Br>> for UInt<U, B>

where U: Unsigned + Shr<<UInt<Ur, Br> as Sub<B1>>::Output>, B: Bit, Ur: Unsigned, Br: Bit, UInt<Ur, Br>: Sub<B1>,

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>) -> <UInt<U, B> as Shr<UInt<Ur, Br>>>::Output

Performs the >> operation.

impl<U, B> Shr<UTerm> for UInt<U, B>

where U: Unsigned, B: Bit,

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) -> <UInt<U, B> as Shr<UTerm>>::Output

Performs the >> operation.

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

where U: Unsigned, B: Bit,

UInt - B0 = UInt

type Output = UInt<U, B>

The resulting type after applying the - operator.

fn sub(self, _: B0) -> <UInt<U, B> as Sub<B0>>::Output

Performs the - operation.

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

where U: Unsigned, B: Bit,

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) -> <UInt<UInt<U, B>, B1> as Sub<B1>>::Output

Performs the - operation.

impl<Ul, Bl, Ur> Sub<Ur> for UInt<Ul, Bl>

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, UInt<Ul, Bl>: PrivateSub<Ur>, <UInt<Ul, Bl> as PrivateSub<Ur>>::Output: 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) -> <UInt<Ul, Bl> as Sub<Ur>>::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<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, B> Unsigned for UInt<U, B>

where U: Unsigned, B: Bit,

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, B> Copy for UInt<U, B>

where U: Copy, B: Copy,

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

where U: Eq, B: Eq,

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

where U: Unsigned, B: Bit,

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