Struct typenum::uint::UInt

[+] Show declaration

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

[−] Expand description

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::{B0, B1, UInt, UTerm};

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

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the + operator.

pub 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>

[+] Show hidden undocumented items

type Output = UInt<U, B1>

The resulting type after applying the + operator.

pub fn add(self, _: B1) -> Self::Output[−]

Performs the + operation.

impl<U: Unsigned> Add<B1> for UInt<U, B1> where
    U: Add<B1>,
    Add1<U>: Unsigned, [+]

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

[+] Show hidden undocumented items

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

The resulting type after applying the + operator.

pub fn add(self, _: B1) -> Self::Output[−]

Performs the + operation.

impl<Ul: Unsigned, Ur: Unsigned> Add<UInt<Ur, B0>> for UInt<Ul, B0> where
    Ul: Add<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Sum<Ul, Ur>, B0>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<Ul: Unsigned, Ur: Unsigned> Add<UInt<Ur, B0>> for UInt<Ul, B1> where
    Ul: Add<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Sum<Ul, Ur>, B1>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<Ul: Unsigned, Ur: Unsigned> Add<UInt<Ur, B1>> for UInt<Ul, B0> where
    Ul: Add<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Sum<Ul, Ur>, B1>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<Ul: Unsigned, Ur: Unsigned> Add<UInt<Ur, B1>> for UInt<Ul, B1> where
    Ul: Add<Ur>,
    Sum<Ul, Ur>: Add<B1>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Add1<Sum<Ul, Ur>>, B0>

The resulting type after applying the + operator.

pub 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>

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the + operator.

pub fn add(self, _: UTerm) -> Self::Output[−]

Performs the + operation.

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.

[+] Show hidden undocumented items

type Output = TrimOut<PrivateAndOut<UInt<Ul, Bl>, Ur>>

The resulting type after applying the & operator.

pub fn bitand(self, rhs: Ur) -> Self::Output[−]

Performs the & operation.

impl<Ul: Unsigned, Ur: Unsigned> BitOr<UInt<Ur, B0>> for UInt<Ul, B0> where
    Ul: BitOr<Ur>, [+]

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

[+] Show hidden undocumented items

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

The resulting type after applying the | operator.

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

Performs the | operation.

impl<Ul: Unsigned, Ur: Unsigned> BitOr<UInt<Ur, B0>> for UInt<Ul, B1> where
    Ul: BitOr<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Or<Ul, Ur>, B1>

The resulting type after applying the | operator.

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

Performs the | operation.

impl<Ul: Unsigned, Ur: Unsigned> BitOr<UInt<Ur, B1>> for UInt<Ul, B0> where
    Ul: BitOr<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Or<Ul, Ur>, B1>

The resulting type after applying the | operator.

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

Performs the | operation.

impl<Ul: Unsigned, Ur: Unsigned> BitOr<UInt<Ur, B1>> for UInt<Ul, B1> where
    Ul: BitOr<Ur>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Or<Ul, Ur>, B1>

The resulting type after applying the | operator.

pub 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

[+] Show hidden undocumented items

type Output = Self

The resulting type after applying the | operator.

pub 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.

[+] Show hidden undocumented items

type Output = TrimOut<PrivateXorOut<UInt<Ul, Bl>, Ur>>

The resulting type after applying the ^ operator.

pub fn bitxor(self, rhs: Ur) -> Self::Output[−]

Performs the ^ operation.

impl<U: Clone, B: Clone> Clone for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn clone(&self) -> UInt<U, B>[−]

Returns a copy of the value.

pub 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

[+] Show hidden undocumented items

type Output = Less

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

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

impl<Ul: Unsigned, Ur: Unsigned> Cmp<UInt<Ur, B0>> for UInt<Ul, B0> where
    Ul: PrivateCmp<Ur, Equal>, [+]

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

[+] Show hidden undocumented items

type Output = PrivateCmpOut<Ul, Ur, Equal>

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

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

impl<Ul: Unsigned, Ur: Unsigned> Cmp<UInt<Ur, B0>> for UInt<Ul, B1> where
    Ul: PrivateCmp<Ur, Greater>, [+]

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

[+] Show hidden undocumented items

type Output = PrivateCmpOut<Ul, Ur, Greater>

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

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

impl<Ul: Unsigned, Ur: Unsigned> Cmp<UInt<Ur, B1>> for UInt<Ul, B1> where
    Ul: PrivateCmp<Ur, Equal>, [+]

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

[+] Show hidden undocumented items

type Output = PrivateCmpOut<Ul, Ur, Equal>

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

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

impl<Ul: Unsigned, Ur: Unsigned> Cmp<UInt<Ur, B1>> for UInt<Ul, B0> where
    Ul: PrivateCmp<Ur, Less>, [+]

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

[+] Show hidden undocumented items

type Output = PrivateCmpOut<Ul, Ur, Less>

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

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

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

Nonzero > Zero

[+] Show hidden undocumented items

type Output = Greater

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

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

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

impl<U: Debug, B: Debug> Debug for UInt<U, B>[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl<U: Default, B: Default> Default for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn default() -> UInt<U, B>[−]

Returns the "default value" for a type.

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

[+] Show hidden undocumented items

type Output = UTerm

The resulting type after applying the / operator.

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

Performs the / operation.

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>>>>, [+]

[+] Show hidden undocumented items

type Output = PrivateDivQuot<UInt<Ul, Bl>, UInt<Ur, Br>, U0, U0, Sub1<Length<UInt<Ul, Bl>>>>

The resulting type after applying the / operator.

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

Performs the / operation.

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

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<Gcf<Xp, Yp>, 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 = Gcf<UInt<Xp, B1>, Yp>

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 = Gcf<Xp, UInt<Yp, B1>>

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 = Gcf<Diff<Maximum<UInt<Xp, B1>, UInt<Yp, B1>>, Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>, Minimum<UInt<Xp, B1>, UInt<Yp, B1>>>

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>>>, [+]

[+] Show hidden undocumented items

type Output = GetBitOut<Un, Sub1<UInt<Ui, Bi>>>

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

impl<Un, Bn> GetBit<UTerm> for UInt<Un, Bn> where
    Bn: Copy, [+]

[+] Show hidden undocumented items

type Output = Bn

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

impl<U: Hash, B: Hash> Hash for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn hash<__H: Hasher>(&self, state: &mut __H)[−]

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, [−]

Feeds a slice of this type into the given Hasher.

impl<U: Unsigned, B: Bit> Len for UInt<U, B> where
    U: Len,
    Length<U>: Add<B1>,
    Add1<Length<U>>: Unsigned, [+]

Length of a bit is 1

[+] Show hidden undocumented items

type Output = Add1<Length<U>>

The length as a type-level unsigned integer.

pub 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>>, [+]

[+] Show hidden undocumented items

type Output = PrivateMaxOut<UInt<U, B>, Ur, Compare<UInt<U, B>, Ur>>

The type of the maximum of Self and Rhs

pub 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>>, [+]

[+] Show hidden undocumented items

type Output = PrivateMinOut<UInt<U, B>, Ur, Compare<UInt<U, B>, Ur>>

The type of the minimum of Self and Rhs

pub 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

[+] Show hidden undocumented items

type Output = UTerm

The resulting type after applying the * operator.

pub fn mul(self, _: B0) -> Self::Output[−]

Performs the * operation.

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

UInt * B1 = UInt

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the * operator.

pub fn mul(self, _: B1) -> Self::Output[−]

Performs the * operation.

impl<Ul: Unsigned, B: Bit, Ur: Unsigned> Mul<UInt<Ur, B>> for UInt<Ul, B0> where
    Ul: Mul<UInt<Ur, B>>, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Prod<Ul, UInt<Ur, B>>, B0>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<Ul: Unsigned, B: Bit, Ur: Unsigned> Mul<UInt<Ur, B>> for UInt<Ul, B1> where
    Ul: Mul<UInt<Ur, B>>,
    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>

[+] Show hidden undocumented items

type Output = Sum<UInt<Prod<Ul, UInt<Ur, B>>, B0>, UInt<Ur, B>>

The resulting type after applying the * operator.

pub 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

[+] Show hidden undocumented items

type Output = UTerm

The resulting type after applying the * operator.

pub fn mul(self, _: UTerm) -> Self::Output[−]

Performs the * operation.

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

impl<U: Ord, B: Ord> Ord for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn cmp(&self, other: &UInt<U, B>) -> Ordering[−]

This method returns an Ordering between self and other.

[+] Expand attributes

#[must_use]pub fn max(self, other: Self) -> Self[−]

Compares and returns the maximum of two values.

[+] Expand attributes

#[must_use]pub fn min(self, other: Self) -> Self[−]

Compares and returns the minimum of two values.

[+] Expand attributes

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self[−]

Restrict a value to a certain interval.

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

[+] Show hidden undocumented items

type Output = UTerm

The type of the result of the division

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

Method for performing the division

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>, [+]

[+] Show hidden undocumented items

type Output = Quot<UInt<Ul, Bl>, UInt<Ur, Br>>

The type of the result of the division

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

Method for performing the division

impl<U: PartialEq, B: PartialEq> PartialEq<UInt<U, B>> for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn eq(&self, other: &UInt<U, B>) -> bool[−]

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &UInt<U, B>) -> bool[−]

This method tests for !=.

impl<U: PartialOrd, B: PartialOrd> PartialOrd<UInt<U, B>> for UInt<U, B>[+]

[+] Show hidden undocumented items

pub fn partial_cmp(&self, other: &UInt<U, B>) -> Option<Ordering>[−]

This method returns an ordering between self and other values if one exists.

pub fn lt(&self, other: &UInt<U, B>) -> bool[−]

This method tests less than (for self and other) and is used by the < operator.

pub fn le(&self, other: &UInt<U, B>) -> bool[−]

This method tests less than or equal to (for self and other) and is used by the <= operator.

pub fn gt(&self, other: &UInt<U, B>) -> bool[−]

This method tests greater than (for self and other) and is used by the > operator.

pub fn ge(&self, other: &UInt<U, B>) -> bool[−]

This method tests greater than or equal to (for self and other) and is used by the >= operator.

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

[+] Show hidden undocumented items

type Output = f32

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = f64

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = i64

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = isize

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = u8

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = u16

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = u32

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = u64

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = usize

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = i8

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = i16

The result of the exponentiation.

pub 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[+]

[+] Show hidden undocumented items

type Output = i32

The result of the exponentiation.

pub 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 PowerOfTwo for UInt<UTerm, B1>

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

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

[+] Show hidden undocumented items

type Output = UTerm

The resulting type after applying the % operator.

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

Performs the % operation.

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>>>>, [+]

[+] Show hidden undocumented items

type Output = PrivateDivRem<UInt<Ul, Bl>, UInt<Ur, Br>, U0, U0, Sub1<Length<UInt<Ul, Bl>>>>

The resulting type after applying the % operator.

pub fn rem(self, rhs: 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

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the << operator.

pub 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>

[+] Show hidden undocumented items

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

The resulting type after applying the << operator.

pub 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)

[+] Show hidden undocumented items

type Output = Shleft<UInt<UInt<U, B>, B0>, Sub1<UInt<Ur, Br>>>

The resulting type after applying the << operator.

pub 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>

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the << operator.

pub 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

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the >> operator.

pub 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

[+] Show hidden undocumented items

type Output = U

The resulting type after applying the >> operator.

pub fn shr(self, _: B1) -> Self::Output[−]

Performs the >> operation.

impl<U: Unsigned, 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>>>, [+]

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

[+] Show hidden undocumented items

type Output = Shright<U, Sub1<UInt<Ur, Br>>>

The resulting type after applying the >> operator.

pub 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>

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the >> operator.

pub fn shr(self, _: UTerm) -> Self::Output[−]

Performs the >> operation.

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

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

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

UInt - B0 = UInt

[+] Show hidden undocumented items

type Output = UInt<U, B>

The resulting type after applying the - operator.

pub fn sub(self, _: B0) -> 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>

[+] Show hidden undocumented items

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

The resulting type after applying the - operator.

pub fn sub(self, _: B1) -> Self::Output[−]

Performs the - operation.

impl Sub<B1> for UInt<UTerm, B1>[+]

UInt<UTerm, B1> - B1 = UTerm

[+] Show hidden undocumented items

type Output = UTerm

The resulting type after applying the - operator.

pub fn sub(self, _: B1) -> Self::Output[−]

Performs the - operation.

impl<U: Unsigned> Sub<B1> for UInt<U, B0> where
    U: Sub<B1>,
    Sub1<U>: Unsigned, [+]

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

[+] Show hidden undocumented items

type Output = UInt<Sub1<U>, B1>

The resulting type after applying the - operator.

pub 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.

[+] Show hidden undocumented items

type Output = TrimOut<PrivateSubOut<UInt<Ul, Bl>, Ur>>

The resulting type after applying the - operator.

pub fn sub(self, rhs: Ur) -> Self::Output[−]

Performs the - operation.

impl<U: Unsigned, B: Bit> Unsigned for UInt<U, B>[+]

[+] Show hidden undocumented items

pub const U8: u8

pub const U16: u16

pub const U32: u32

pub const U64: u64

pub const USIZE: usize

pub const I8: i8

pub const I16: i16

pub const I32: i32

pub const I64: i64

pub const ISIZE: isize

pub fn to_u8() -> u8

pub fn to_u16() -> u16

pub fn to_u32() -> u32

pub fn to_u64() -> u64

pub fn to_usize() -> usize

pub fn to_i8() -> i8

pub fn to_i16() -> i16

pub fn to_i32() -> i32

pub fn to_i64() -> i64

pub fn to_isize() -> isize