pub struct u101(_);
Expand description
The 101-bit unsigned integer type.
Implementations
sourceimpl u101
impl u101
sourcepub fn min_value() -> u101
pub fn min_value() -> u101
Returns the smallest value that can be represented by this integer type.
sourcepub fn max_value() -> u101
pub fn max_value() -> u101
Returns the largest value that can be represented by this integer type.
sourcepub fn new(value: u128) -> u101
pub fn new(value: u128) -> u101
Crates a new variable
This function mainly exists as there is currently not a better way to construct these types. May be deprecated or removed if a better way to construct these types becomes available.
Examples
Basic usage:
use ux::*;
assert_eq!(u31::new(64), u31::from(64u8));
Panic
This function will panic if value
is not representable by this type
sourcepub fn wrapping_sub(self, rhs: Self) -> Self
pub fn wrapping_sub(self, rhs: Self) -> Self
Wrapping (modular) subtraction. Computes self - other
,
wrapping around at the boundary of the type.
Examples
Basic usage:
use ux::*;
assert_eq!(i5::MIN.wrapping_sub(i5::new(1)), i5::MAX);
assert_eq!(i5::new(-10).wrapping_sub(i5::new(5)), i5::new(-15));
assert_eq!(i5::new(-15).wrapping_sub(i5::new(5)), i5::new(12));
sourcepub fn wrapping_add(self, rhs: Self) -> Self
pub fn wrapping_add(self, rhs: Self) -> Self
Wrapping (modular) addition. Computes self + other
,
wrapping around at the boundary of the type.
Examples
Basic usage:
use ux::*;
assert_eq!(i5::MAX.wrapping_add(i5::new(1)), i5::MIN);
assert_eq!(i5::new(10).wrapping_add(i5::new(5)), i5::new(15));
assert_eq!(i5::new(15).wrapping_add(i5::new(5)), i5::new(-12));
Trait Implementations
sourceimpl BitAndAssign<u101> for u101
impl BitAndAssign<u101> for u101
sourcefn bitand_assign(&mut self, other: u101)
fn bitand_assign(&mut self, other: u101)
Performs the
&=
operation. Read moresourceimpl BitOrAssign<u101> for u101
impl BitOrAssign<u101> for u101
sourcefn bitor_assign(&mut self, other: u101)
fn bitor_assign(&mut self, other: u101)
Performs the
|=
operation. Read moresourceimpl BitXorAssign<u101> for u101
impl BitXorAssign<u101> for u101
sourcefn bitxor_assign(&mut self, other: u101)
fn bitxor_assign(&mut self, other: u101)
Performs the
^=
operation. Read moresourceimpl Ord for u101
impl Ord for u101
1.21.0 · sourcefn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl PartialOrd<u101> for u101
impl PartialOrd<u101> for u101
sourcefn partial_cmp(&self, other: &u101) -> Option<Ordering>
fn partial_cmp(&self, other: &u101) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresourceimpl<T> ShlAssign<T> for u101where
u128: ShlAssign<T>,
impl<T> ShlAssign<T> for u101where
u128: ShlAssign<T>,
sourcefn shl_assign(&mut self, rhs: T)
fn shl_assign(&mut self, rhs: T)
Performs the
<<=
operation. Read moresourceimpl<T> ShrAssign<T> for u101where
u128: ShrAssign<T>,
impl<T> ShrAssign<T> for u101where
u128: ShrAssign<T>,
sourcefn shr_assign(&mut self, rhs: T)
fn shr_assign(&mut self, rhs: T)
Performs the
>>=
operation. Read moreimpl Copy for u101
impl Eq for u101
Auto Trait Implementations
impl RefUnwindSafe for u101
impl Send for u101
impl Sync for u101
impl Unpin for u101
impl UnwindSafe for u101
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more