Struct libp2p::multihash::typenum::uint::UTerm [−][src]
pub struct UTerm;
The terminating type for UInt; it always comes after the most significant
bit. UTerm by itself represents zero, which is aliased to U0.
Implementations
impl UTerm[src]
impl UTerm[src]Trait Implementations
impl<U, B> Add<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]
impl<U, B> Add<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]UInt<U, B> + UTerm = UInt<U, B>
impl<T> ArrayLength<T> for UTerm[src]
impl<T> ArrayLength<T> for UTerm[src]type ArrayType
impl<T> ArrayLength<T> for UTerm[src]
impl<T> ArrayLength<T> for UTerm[src]type ArrayType
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero, [src]
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero, [src]gcd(x, 0) = x
type Output = X
The greatest common divisor.
impl<Y> Gcd<Y> for UTerm where
Y: Unsigned + NonZero, [src]
impl<Y> Gcd<Y> for UTerm where
Y: Unsigned + NonZero, [src]gcd(0, y) = y
type Output = Y
The greatest common divisor.
impl<Ur, Br> PartialDiv<UInt<Ur, Br>> for UTerm where
Ur: Unsigned,
Br: Bit, [src]
impl<Ur, Br> PartialDiv<UInt<Ur, Br>> for UTerm where
Ur: Unsigned,
Br: Bit, [src]type Output = UTerm
The type of the result of the division
pub fn partial_div(
self,
UInt<Ur, Br>
) -> <UTerm as PartialDiv<UInt<Ur, Br>>>::Output[src]
self,
UInt<Ur, Br>
) -> <UTerm as PartialDiv<UInt<Ur, Br>>>::Output
impl PartialOrd<UTerm> for UTerm[src]
impl PartialOrd<UTerm> for UTerm[src]impl<U> Shl<U> for UTerm where
U: Unsigned, [src]
impl<U> Shl<U> for UTerm where
U: Unsigned, [src]Shifting left UTerm by an unsigned integer: UTerm << U = UTerm
impl<U, B> Shl<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]
impl<U, B> Shl<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]Shifting left UInt by UTerm: UInt<U, B> << UTerm = UInt<U, B>
impl<U> Shr<U> for UTerm where
U: Unsigned, [src]
impl<U> Shr<U> for UTerm where
U: Unsigned, [src]Shifting right a UTerm by an unsigned integer: UTerm >> U = UTerm
impl<U, B> Shr<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]
impl<U, B> Shr<UTerm> for UInt<U, B> where
B: Bit,
U: Unsigned, [src]Shifting right UInt by UTerm: UInt<U, B> >> UTerm = UInt<U, B>
impl Unsigned for UTerm[src]
impl Unsigned for UTerm[src]pub const U8: u8[src]
pub const U16: u16[src]
pub const U32: u32[src]
pub const U64: u64[src]
pub const USIZE: usize[src]
pub const I8: i8[src]
pub const I16: i16[src]
pub const I32: i32[src]
pub const I64: i64[src]
pub const ISIZE: isize[src]
pub fn to_u8() -> u8[src]
pub fn to_u16() -> u16[src]
pub fn to_u32() -> u32[src]
pub fn to_u64() -> u64[src]
pub fn to_usize() -> usize[src]
pub fn to_i8() -> i8[src]
pub fn to_i16() -> i16[src]
pub fn to_i32() -> i32[src]
pub fn to_i64() -> i64[src]
pub fn to_isize() -> isize[src]
impl Copy for UTerm[src]
impl Eq for UTerm[src]
impl StructuralEq for UTerm[src]
impl StructuralPartialEq for UTerm[src]
impl Zero for UTerm[src]
Auto Trait Implementations
impl RefUnwindSafe for UTerm
impl Send for UTerm
impl Sync for UTerm
impl Unpin for UTerm
impl UnwindSafe for UTerm
Blanket Implementations
impl<T> CallHasher for T where
T: Hash, [src]
impl<T> CallHasher for T where
T: Hash, [src]impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero, [src]
impl<X> Gcd<UTerm> for X where
X: Unsigned + NonZero, [src]type Output = X
The greatest common divisor.
impl<N, I, B> SetBit<I, B> for N where
N: PrivateSetBit<I, B>,
<N as PrivateSetBit<I, B>>::Output: Trim, [src]
impl<N, I, B> SetBit<I, B> for N where
N: PrivateSetBit<I, B>,
<N as PrivateSetBit<I, B>>::Output: Trim, [src]impl<N> SquareRoot for N where
N: PrivateSquareRoot, [src]
impl<N> SquareRoot for N where
N: PrivateSquareRoot, [src]type Output = <N as PrivateSquareRoot>::Output
The result of the integer square root.
impl<T> Size for T where
T: 'static + ArrayLength<u8> + Debug + Default + Eq + Hash + Send + Sync, [src]
T: 'static + ArrayLength<u8> + Debug + Default + Eq + Hash + Send + Sync,