Struct crypto::ciphers::traits::consts::uint::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, 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, B0>where
    U: Unsigned,

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

type Output = UInt<U, B1>

The resulting type after applying the + operator.

fn add(self, _: B1) -> <UInt<U, B0> as Add<B1>>::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, B0>where
    Ul: Unsigned + Add<Ur>,
    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>) -> <UInt<Ul, B0> as Add<UInt<Ur, B0>>>::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, B0>where
    Ul: Unsigned + Add<Ur>,
    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>) -> <UInt<Ul, B0> as Add<UInt<Ur, B1>>>::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, B0>where
    N: ArrayLength<T>,

type ArrayType

Associated type representing the array type for the number

impl<T, N> ArrayLength<T> for UInt<N, B0>where
    N: ArrayLength<T>,

type ArrayType

Associated type representing the array type for the number

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<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, B0>where
    Ul: Unsigned + BitOr<Ur>,
    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>
) -> <UInt<Ul, B0> as BitOr<UInt<Ur, B0>>>::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, B0>where
    Ul: Unsigned + BitOr<Ur>,
    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>
) -> <UInt<Ul, B0> as BitOr<UInt<Ur, B1>>>::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 copy of the value.

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

Performs copy-assignment from source.

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

Zero < Nonzero

type Output = Less

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

impl<Ul, Ur> Cmp<UInt<Ur, B0>> for UInt<Ul, B0>where
    Ul: Unsigned + PrivateCmp<Ur, Equal>,
    Ur: 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.

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

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<Ur, Br> Div<UInt<Ur, Br>> for UTermwhere
    Ur: Unsigned,
    Br: Bit,

type Output = UTerm

The resulting type after applying the / operator.

fn div(self, _: UInt<Ur, Br>) -> <UTerm as Div<UInt<Ur, Br>>>::Output

Performs the / operation.

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>>,
    <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, B0>where
    Ul: Unsigned + Mul<UInt<Ur, B>>,
    B: Bit,
    Ur: 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>) -> <UInt<Ul, B0> as Mul<UInt<Ur, B>>>::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) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

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<Ur, Br> PartialDiv<UInt<Ur, Br>> for UTermwhere
    Ur: Unsigned,
    Br: Bit,

type Output = UTerm

The type of the result of the division

fn partial_div(
    self,
    _: UInt<Ur, Br>
) -> <UTerm as PartialDiv<UInt<Ur, Br>>>::Output

Method for performing the division

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

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

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

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

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

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

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

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

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

type Output = f32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <f32 as Pow<UInt<U, B>>>::Output

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

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

type Output = f64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <f64 as Pow<UInt<U, B>>>::Output

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

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

type Output = i16

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <i16 as Pow<UInt<U, B>>>::Output

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

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

type Output = i32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <i32 as Pow<UInt<U, B>>>::Output

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

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

type Output = i64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <i64 as Pow<UInt<U, B>>>::Output

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

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

type Output = i8

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <i8 as Pow<UInt<U, B>>>::Output

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

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

type Output = isize

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <isize as Pow<UInt<U, B>>>::Output

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

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

type Output = u16

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <u16 as Pow<UInt<U, B>>>::Output

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

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

type Output = u32

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <u32 as Pow<UInt<U, B>>>::Output

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

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

type Output = u64

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <u64 as Pow<UInt<U, B>>>::Output

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

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

type Output = u8

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <u8 as Pow<UInt<U, B>>>::Output

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

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

type Output = usize

The result of the exponentiation.

fn powi(self, _: UInt<U, B>) -> <usize as Pow<UInt<U, B>>>::Output

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

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<Ur, Br> Rem<UInt<Ur, Br>> for UTermwhere
    Ur: Unsigned,
    Br: Bit,

type Output = UTerm

The resulting type after applying the % operator.

fn rem(self, _: UInt<Ur, Br>) -> <UTerm 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> Sub<B1> for UInt<U, B0>where
    U: Unsigned + Sub<B1>,
    <U as Sub<B1>>::Output: 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) -> <UInt<U, B0> as Sub<B1>>::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 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) -> <UInt<UTerm, 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,

fn to_int() -> i16

Method returning the concrete value for the type.

const INT: i16 = Self::I16

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

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

fn to_int() -> i32

Method returning the concrete value for the type.

const INT: i32 = Self::I32

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

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

fn to_int() -> i64

Method returning the concrete value for the type.

const INT: i64 = Self::I64

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

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

fn to_int() -> i8

Method returning the concrete value for the type.

const INT: i8 = Self::I8

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

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

fn to_int() -> u16

Method returning the concrete value for the type.

const INT: u16 = Self::U16

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

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

fn to_int() -> u32

Method returning the concrete value for the type.

const INT: u32 = Self::U32

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

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

fn to_int() -> u64

Method returning the concrete value for the type.

const INT: u64 = Self::U64

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

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

fn to_int() -> u8

Method returning the concrete value for the type.

const INT: u8 = Self::U8

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

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

fn to_int() -> usize

Method returning the concrete value for the type.

const INT: usize = Self::USIZE

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

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

const U8: u8 = B::U8 | U::U8 << 1

const U16: u16 = B::U8 as u16 | U::U16 << 1

const U32: u32 = B::U8 as u32 | U::U32 << 1

const U64: u64 = B::U8 as u64 | U::U64 << 1

const USIZE: usize = B::U8 as usize | U::USIZE << 1

const I8: i8 = B::U8 as i8 | U::I8 << 1

const I16: i16 = B::U8 as i16 | U::I16 << 1

const I32: i32 = B::U8 as i32 | U::I32 << 1

const I64: i64 = B::U8 as i64 | U::I64 << 1

const ISIZE: isize = B::U8 as isize | U::ISIZE << 1

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> PowerOfTwo for UInt<U, B0>where
    U: Unsigned + PowerOfTwo,

impl PowerOfTwo for UInt<UTerm, B1>

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

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