Struct cv::knn::hnsw::typenum::uint::UInt

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

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, B> UInt<U, B> where
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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, 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
    Bl: Bit,
    Ul: Unsigned,
    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, 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<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<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
    Bl: Bit,
    Ul: Unsigned,
    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
    B: Clone,
    U: 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 UTerm where
    B: Bit,
    U: Unsigned, 

Zero < Nonzero

type Output = Less

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

fn compare<IM>(&self, &UInt<U, B>) -> <UTerm as Cmp<UInt<U, B>>>::Output where
    IM: InternalMarker, 

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.

fn compare<IM>(
    &self,
    rhs: &UInt<Ur, B0>
) -> <UInt<Ul, B1> as Cmp<UInt<Ur, B0>>>::Output where
    IM: InternalMarker, 

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.

fn compare<IM>(
    &self,
    rhs: &UInt<Ur, B0>
) -> <UInt<Ul, B0> as Cmp<UInt<Ur, B0>>>::Output where
    IM: InternalMarker, 

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.

fn compare<IM>(
    &self,
    rhs: &UInt<Ur, B1>
) -> <UInt<Ul, B0> as Cmp<UInt<Ur, B1>>>::Output where
    IM: InternalMarker, 

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.

fn compare<IM>(
    &self,
    rhs: &UInt<Ur, B1>
) -> <UInt<Ul, B1> as Cmp<UInt<Ur, B1>>>::Output where
    IM: InternalMarker, 

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

Nonzero > Zero

type Output = Greater

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

fn compare<IM>(&self, &UTerm) -> <UInt<U, B> as Cmp<UTerm>>::Output where
    IM: InternalMarker, 

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

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

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

Returns the "default value" for a type.

impl<U, B> Dim for UInt<U, B> where
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    U: DimName + Unsigned, 

fn try_to_usize() -> Option<usize>

Gets the compile-time value of Self. Returns None if it is not known, i.e., if Self = Dynamic.

fn from_usize(dim: usize) -> UInt<U, B>

Builds an instance of Self from a run-time value. Panics if Self is a type-level integer and dim != Self::try_to_usize().unwrap().

fn value(&self) -> usize

Gets the run-time value of self. For type-level integers, this is the same as Self::try_to_usize().unwrap().

fn is<D>() -> bool where
    D: Dim, 

impl<A, B, C, D, E, F, G> Dim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G> where
    A: PartialEq<A> + Send + Copy + Sync + Any + Debug + Bit,
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    C: PartialEq<C> + Send + Copy + Sync + Any + Debug + Bit,
    D: PartialEq<D> + Send + Copy + Sync + Any + Debug + Bit,
    E: PartialEq<E> + Send + Copy + Sync + Any + Debug + Bit,
    F: PartialEq<F> + Send + Copy + Sync + Any + Debug + Bit,
    G: PartialEq<G> + Send + Copy + Sync + Any + Debug + Bit, 

fn try_to_usize() -> Option<usize>

Gets the compile-time value of Self. Returns None if it is not known, i.e., if Self = Dynamic.

fn from_usize(
    dim: usize
) -> UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G>

Builds an instance of Self from a run-time value. Panics if Self is a type-level integer and dim != Self::try_to_usize().unwrap().

fn value(&self) -> usize

Gets the run-time value of self. For type-level integers, this is the same as Self::try_to_usize().unwrap().

fn is<D>() -> bool where
    D: Dim, 

impl<U, B> DimName for UInt<U, B> where
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    U: DimName + Unsigned, 

type Value = UInt<U, B>

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

The name of this dimension, i.e., the singleton Self.

fn dim() -> usize

The value of this dimension.

impl<A, B, C, D, E, F, G> DimName for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G> where
    A: PartialEq<A> + Send + Copy + Sync + Any + Debug + Bit,
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    C: PartialEq<C> + Send + Copy + Sync + Any + Debug + Bit,
    D: PartialEq<D> + Send + Copy + Sync + Any + Debug + Bit,
    E: PartialEq<E> + Send + Copy + Sync + Any + Debug + Bit,
    F: PartialEq<F> + Send + Copy + Sync + Any + Debug + Bit,
    G: PartialEq<G> + Send + Copy + Sync + Any + Debug + Bit, 

type Value = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G>

fn name(
) -> UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G>

The name of this dimension, i.e., the singleton Self.

fn dim() -> usize

The value of this dimension.

impl<Ul, Bl, Ur, Br> Div<UInt<Ur, Br>> for UInt<Ul, Bl> where
    Bl: Bit,
    Br: Bit,
    Ul: Unsigned,
    Ur: Unsigned,
    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 UTerm where
    Br: Bit,
    Ur: Unsigned, 

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

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>>,
    UInt<Xp, B1>: Min<UInt<Yp, B1>>,
    UInt<Yp, B1>: Max<UInt<Xp, B1>>,
    UInt<Yp, 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
    Un: GetBit<<UInt<Ui, Bi> as Sub<B1>>::Output>,
    UInt<Ui, Bi>: Copy,
    UInt<Ui, Bi>: Sub<B1>, 

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

fn get_bit<IM>(
    &self,
    i: &UInt<Ui, Bi>
) -> <UInt<Un, Bn> as GetBit<UInt<Ui, Bi>>>::Output where
    IM: InternalMarker, 

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

type Output = Bn

fn get_bit<IM>(&self, &UTerm) -> <UInt<Un, Bn> as GetBit<UTerm>>::Output where
    IM: InternalMarker, 

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

Feeds a slice of this type into the given [Hasher].

impl<U, B> IsNotStaticOne for UInt<U, B> where
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    U: DimName + Unsigned, 

impl<A, B, C, D, E, F, G> IsNotStaticOne for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G> where
    A: PartialEq<A> + Send + Copy + Sync + Any + Debug + Bit,
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    C: PartialEq<C> + Send + Copy + Sync + Any + Debug + Bit,
    D: PartialEq<D> + Send + Copy + Sync + Any + Debug + Bit,
    E: PartialEq<E> + Send + Copy + Sync + Any + Debug + Bit,
    F: PartialEq<F> + Send + Copy + Sync + Any + Debug + Bit,
    G: PartialEq<G> + Send + Copy + Sync + Any + Debug + Bit, 

impl<U, B> Len for UInt<U, B> where
    B: Bit,
    U: Unsigned + Len,
    <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
    B: Bit,
    U: Unsigned,
    Ur: Unsigned,
    UInt<U, B>: Cmp<Ur>,
    UInt<U, B>: 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
    B: Bit,
    U: Unsigned,
    Ur: Unsigned,
    UInt<U, B>: Cmp<Ur>,
    UInt<U, B>: 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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    Ul: Unsigned + Mul<UInt<Ur, B>>,
    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
    B: Bit,
    Ul: Unsigned + Mul<UInt<Ur, B>>,
    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
    B: Bit,
    U: Unsigned, 

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 NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>

type Name = U17

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B1>

type Name = U35

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>

type Name = U19

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>

type Name = U26

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B0>

type Name = U60

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B0>, B0>

type Name = U88

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B0>, B1>

type Name = U121

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B1>, B0>

type Name = U62

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B1>, B0>

type Name = U118

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B1>, B0>

type Name = U106

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B1>

type Name = U43

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B0>, B1>

type Name = U69

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B1>, B1>

type Name = U111

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B0>, B0>

type Name = U100

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B1>

type Name = U39

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B0>

type Name = U40

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B1>, B0>

type Name = U70

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>

type Name = U64

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B0>, B0>

type Name = U76

impl NamedDim for UInt<UInt<UInt<UTerm, B1>, B1>, B0>

type Name = U6

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B0>

type Name = U34

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>

type Name = U16

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>

type Name = U13

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>

type Name = U23

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B1>, B1>

type Name = U87

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B0>, B1>

type Name = U109

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B0>

type Name = U44

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B0>, B1>

type Name = U73

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>

type Name = U11

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>

type Name = U30

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B1>, B0>

type Name = U110

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B1>

type Name = U37

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>

type Name = U18

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B1>, B1>

type Name = U115

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B1>, B1>

type Name = U83

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

type Name = U127

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B1>, B0>

type Name = U90

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B0>, B0>

type Name = U112

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B0>, B0>

type Name = U96

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>

type Name = U27

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B1>, B0>

type Name = U86

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B0>, B1>

type Name = U101

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B1>

type Name = U55

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B1>, B0>, B1>

type Name = U125

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>, B0>

type Name = U122

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B0>, B1>

type Name = U77

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B0>, B1>

type Name = U113

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B1>, B1>

type Name = U107

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B0>, B1>

type Name = U105

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B1>

type Name = U59

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B1>

type Name = U51

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>

type Name = U21

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B1>, B1>

type Name = U91

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B0>, B0>

type Name = U120

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B0>

type Name = U54

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

type Name = U31

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>, B1>

type Name = U123

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

type Name = U63

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>

type Name = U29

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

type Name = U3

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B1>, B1>

type Name = U75

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

type Name = U7

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>

type Name = U24

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B0>

type Name = U52

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B1>, B0>

type Name = U74

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B1>, B0>

type Name = U66

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>

type Name = U25

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B1>

type Name = U49

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B1>, B0>

type Name = U98

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B0>

type Name = U38

impl NamedDim for UInt<UInt<UInt<UTerm, B1>, B0>, B0>

type Name = U4

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B1>, B1>, B0>

type Name = U126

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B0>, B1>

type Name = U81

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>

type Name = U14

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>

type Name = U22

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B1>, B0>

type Name = U94

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B1>

type Name = U65

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B0>

type Name = U50

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B0>, B0>

type Name = U80

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B1>, B1>

type Name = U95

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B1>, B1>

type Name = U67

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B0>, B0>

type Name = U104

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>

type Name = U10

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B0>, B0>

type Name = U84

impl<U, B> NamedDim for UInt<U, B> where
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    U: DimName + Unsigned, 

type Name = UInt<U, B>

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B1>

type Name = U57

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B1>, B0>

type Name = U78

impl NamedDim for UInt<UInt<UInt<UTerm, B1>, B0>, B1>

type Name = U5

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>

type Name = U32

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B0>, B1>

type Name = U85

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B1>

type Name = U45

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B0>, B0>

type Name = U92

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B1>

type Name = U33

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B0>, B1>

type Name = U117

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B0>, B1>

type Name = U97

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B1>, B0>

type Name = U114

impl NamedDim for UInt<UInt<UTerm, B1>, B0>

type Name = U2

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B0>

type Name = U36

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B0>

type Name = U58

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B1>, B1>

type Name = U71

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B0>, B0>, B1>

type Name = U89

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B0>, B0>, B0>

type Name = U72

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>

type Name = U28

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B1>

type Name = U47

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

type Name = U15

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>

type Name = U61

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B0>

type Name = U46

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B1>, B0>

type Name = U82

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>, B1>

type Name = U41

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B1>, B0>

type Name = U42

impl<A, B, C, D, E, F, G> NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G> where
    A: PartialEq<A> + Send + Copy + Sync + Any + Debug + Bit,
    B: PartialEq<B> + Send + Copy + Sync + Any + Debug + Bit,
    C: PartialEq<C> + Send + Copy + Sync + Any + Debug + Bit,
    D: PartialEq<D> + Send + Copy + Sync + Any + Debug + Bit,
    E: PartialEq<E> + Send + Copy + Sync + Any + Debug + Bit,
    F: PartialEq<F> + Send + Copy + Sync + Any + Debug + Bit,
    G: PartialEq<G> + Send + Copy + Sync + Any + Debug + Bit, 

type Name = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, A>, B>, C>, D>, E>, F>, G>

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>

type Name = U9

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B0>

type Name = U48

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B1>, B0>

type Name = U102

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B0>, B1>, B1>

type Name = U99

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>, B1>, B1>, B1>

type Name = U103

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B1>, B0>, B0>

type Name = U124

impl NamedDim for UInt<UTerm, B1>

type Name = U1

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B0>, B1>

type Name = U53

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B0>, B0>

type Name = U56

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>

type Name = U8

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B0>, B0>

type Name = U20

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B1>, B1>

type Name = U119

impl NamedDim for UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B0>

type Name = U12

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>, B1>, B1>, B1>

type Name = U79

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B1>, B0>, B0>

type Name = U68

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B0>, B1>, B1>, B0>, B0>

type Name = U108

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B0>, B1>, B0>, B0>

type Name = U116

impl NamedDim for UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B1>, B1>, B1>, B0>, B1>

type Name = U93

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

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

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

This method returns an [Ordering] between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

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

Restrict a value to a certain interval.

impl<Ul, Bl, Ur, Br> PartialDiv<UInt<Ur, Br>> for UInt<Ul, Bl> where
    Bl: Bit,
    Br: Bit,
    Ul: Unsigned,
    Ur: Unsigned,
    UInt<Ul, Bl>: Div<UInt<Ur, Br>>,
    UInt<Ul, Bl>: Rem<UInt<Ur, Br>>,
    <UInt<Ul, Bl> as 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 UTerm where
    Br: Bit,
    Ur: Unsigned, 

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
    B: PartialEq<B>,
    U: PartialEq<U>, 

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: &UInt<U, B>) -> bool

This method tests for !=.

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

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: &UInt<U, B>) -> bool

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

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.

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

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

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, B> Pow<UInt<U, B>> for isize where
    B: Bit,
    U: Unsigned, 

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 i16 where
    B: Bit,
    U: Unsigned, 

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 f32 where
    B: Bit,
    U: Unsigned, 

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 i8 where
    B: Bit,
    U: Unsigned, 

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 u64 where
    B: Bit,
    U: Unsigned, 

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 u8 where
    B: Bit,
    U: Unsigned, 

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 i64 where
    B: Bit,
    U: Unsigned, 

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 usize where
    B: Bit,
    U: Unsigned, 

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<U, B> Pow<UInt<U, B>> for u16 where
    B: Bit,
    U: Unsigned, 

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 f64 where
    B: Bit,
    U: Unsigned, 

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 u32 where
    B: Bit,
    U: Unsigned, 

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 i32 where
    B: Bit,
    U: Unsigned, 

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

impl PowerOfTwo for UInt<UTerm, B1>

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

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<Ul, Bl, Ur, Br> Rem<UInt<Ur, Br>> for UInt<Ul, Bl> where
    Bl: Bit,
    Br: Bit,
    Ul: Unsigned,
    Ur: Unsigned,
    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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    Br: Bit,
    U: Unsigned,
    Ur: Unsigned,
    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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    U: Unsigned, 

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
    B: Bit,
    Br: Bit,
    U: Unsigned + Shr<<UInt<Ur, Br> as Sub<B1>>::Output>,
    Ur: Unsigned,
    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
    B: Bit,
    U: Unsigned, 

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

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

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

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
    B: Bit,
    U: Unsigned, 

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
    Bl: Bit,
    Ul: Unsigned,
    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> Unsigned for UInt<U, B> where
    B: Bit,
    U: Unsigned, 

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