pub struct i51(_);
Expand description
The 51-bit signed integer type.
Implementations
sourceimpl i51
impl i51
sourcepub const fn min_value() -> Self
pub const fn min_value() -> Self
Returns the smallest value that can be represented by this integer type.
sourcepub const fn max_value() -> Self
pub const fn max_value() -> Self
Returns the largest value that can be represented by this integer type.
pub fn new(value: i64) -> Self
sourcepub const fn wrapping_sub(self, rhs: Self) -> Self
pub const 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 num_x::*;
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 const fn wrapping_add(self, rhs: Self) -> Self
pub const 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 num_x::*;
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));
pub const fn capacity(self) -> u32
pub const fn rotate_left(self, n: u32) -> Self
pub const fn rotate_right(self, n: u32) -> Self
pub const fn count_ones(self) -> u32
pub const fn count_zeros(self) -> u32
pub const fn leading_zeros(self) -> u32
pub const fn trailing_zeros(self) -> u32
pub const fn reverse_bits(self) -> Self
pub const fn is_power_of_two(self) -> bool
Trait Implementations
sourceimpl BitAndAssign<i51> for i51
impl BitAndAssign<i51> for i51
sourcefn bitand_assign(&mut self, other: Self)
fn bitand_assign(&mut self, other: Self)
Performs the &=
operation. Read more
sourceimpl BitOrAssign<i51> for i51
impl BitOrAssign<i51> for i51
sourcefn bitor_assign(&mut self, other: Self)
fn bitor_assign(&mut self, other: Self)
Performs the |=
operation. Read more
sourceimpl BitXorAssign<i51> for i51
impl BitXorAssign<i51> for i51
sourcefn bitxor_assign(&mut self, other: Self)
fn bitxor_assign(&mut self, other: Self)
Performs the ^=
operation. Read more
sourceimpl Ord for i51
impl Ord for i51
sourceimpl PartialOrd<i51> for i51
impl PartialOrd<i51> for i51
sourcefn partial_cmp(&self, other: &Self) -> Option<Ordering>
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
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 more
sourceimpl<T> ShlAssign<T> for i51 where
i64: ShlAssign<T>,
impl<T> ShlAssign<T> for i51 where
i64: ShlAssign<T>,
sourcefn shl_assign(&mut self, rhs: T)
fn shl_assign(&mut self, rhs: T)
Performs the <<=
operation. Read more
sourceimpl<T> ShrAssign<T> for i51 where
i64: ShrAssign<T>,
impl<T> ShrAssign<T> for i51 where
i64: ShrAssign<T>,
sourcefn shr_assign(&mut self, rhs: T)
fn shr_assign(&mut self, rhs: T)
Performs the >>=
operation. Read more
impl Copy for i51
impl Eq for i51
Auto Trait Implementations
impl RefUnwindSafe for i51
impl Send for i51
impl Sync for i51
impl Unpin for i51
impl UnwindSafe for i51
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
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
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more