Type Alias centrifuge_chain::rpc::evm::FeeHistoryCacheLimit
pub type FeeHistoryCacheLimit = u64;
Expand description
Maximum fee history cache size.
Implementations§
source§impl u64
impl u64
1.43.0 · sourcepub const MIN: u64 = 0u64
pub const MIN: u64 = 0u64
The smallest value that can be represented by this integer type.
Examples
Basic usage:
assert_eq!(u64::MIN, 0);
1.43.0 · sourcepub const MAX: u64 = 18_446_744_073_709_551_615u64
pub const MAX: u64 = 18_446_744_073_709_551_615u64
The largest value that can be represented by this integer type (264 − 1).
Examples
Basic usage:
assert_eq!(u64::MAX, 18446744073709551615);
1.0.0 · sourcepub fn from_str_radix(src: &str, radix: u32) -> Result<u64, ParseIntError>
pub fn from_str_radix(src: &str, radix: u32) -> Result<u64, ParseIntError>
Converts a string slice in a given base to an integer.
The string is expected to be an optional +
sign
followed by digits.
Leading and trailing whitespace represent an error.
Digits are a subset of these characters, depending on radix
:
0-9
a-z
A-Z
Panics
This function panics if radix
is not in the range from 2 to 36.
Examples
Basic usage:
assert_eq!(u64::from_str_radix("A", 16), Ok(10));
1.0.0 (const: 1.32.0) · sourcepub const fn count_ones(self) -> u32
pub const fn count_ones(self) -> u32
Returns the number of ones in the binary representation of self
.
Examples
Basic usage:
let n = 0b01001100u64;
assert_eq!(n.count_ones(), 3);
1.0.0 (const: 1.32.0) · sourcepub const fn count_zeros(self) -> u32
pub const fn count_zeros(self) -> u32
Returns the number of zeros in the binary representation of self
.
Examples
Basic usage:
assert_eq!(u64::MAX.count_zeros(), 0);
1.0.0 (const: 1.32.0) · sourcepub const fn leading_zeros(self) -> u32
pub const fn leading_zeros(self) -> u32
Returns the number of leading zeros in the binary representation of self
.
Depending on what you’re doing with the value, you might also be interested in the
ilog2
function which returns a consistent number, even if the type widens.
Examples
Basic usage:
let n = u64::MAX >> 2;
assert_eq!(n.leading_zeros(), 2);
1.0.0 (const: 1.32.0) · sourcepub const fn trailing_zeros(self) -> u32
pub const fn trailing_zeros(self) -> u32
Returns the number of trailing zeros in the binary representation
of self
.
Examples
Basic usage:
let n = 0b0101000u64;
assert_eq!(n.trailing_zeros(), 3);
1.46.0 (const: 1.46.0) · sourcepub const fn leading_ones(self) -> u32
pub const fn leading_ones(self) -> u32
Returns the number of leading ones in the binary representation of self
.
Examples
Basic usage:
let n = !(u64::MAX >> 2);
assert_eq!(n.leading_ones(), 2);
1.46.0 (const: 1.46.0) · sourcepub const fn trailing_ones(self) -> u32
pub const fn trailing_ones(self) -> u32
Returns the number of trailing ones in the binary representation
of self
.
Examples
Basic usage:
let n = 0b1010111u64;
assert_eq!(n.trailing_ones(), 3);
1.0.0 (const: 1.32.0) · sourcepub const fn rotate_left(self, n: u32) -> u64
pub const fn rotate_left(self, n: u32) -> u64
Shifts the bits to the left by a specified amount, n
,
wrapping the truncated bits to the end of the resulting integer.
Please note this isn’t the same operation as the <<
shifting operator!
Examples
Basic usage:
let n = 0xaa00000000006e1u64;
let m = 0x6e10aa;
assert_eq!(n.rotate_left(12), m);
1.0.0 (const: 1.32.0) · sourcepub const fn rotate_right(self, n: u32) -> u64
pub const fn rotate_right(self, n: u32) -> u64
Shifts the bits to the right by a specified amount, n
,
wrapping the truncated bits to the beginning of the resulting
integer.
Please note this isn’t the same operation as the >>
shifting operator!
Examples
Basic usage:
let n = 0x6e10aau64;
let m = 0xaa00000000006e1;
assert_eq!(n.rotate_right(12), m);
1.0.0 (const: 1.32.0) · sourcepub const fn swap_bytes(self) -> u64
pub const fn swap_bytes(self) -> u64
Reverses the byte order of the integer.
Examples
Basic usage:
let n = 0x1234567890123456u64;
let m = n.swap_bytes();
assert_eq!(m, 0x5634129078563412);
1.37.0 (const: 1.37.0) · sourcepub const fn reverse_bits(self) -> u64
pub const fn reverse_bits(self) -> u64
Reverses the order of bits in the integer. The least significant bit becomes the most significant bit, second least-significant bit becomes second most-significant bit, etc.
Examples
Basic usage:
let n = 0x1234567890123456u64;
let m = n.reverse_bits();
assert_eq!(m, 0x6a2c48091e6a2c48);
assert_eq!(0, 0u64.reverse_bits());
1.0.0 (const: 1.32.0) · sourcepub const fn from_be(x: u64) -> u64
pub const fn from_be(x: u64) -> u64
Converts an integer from big endian to the target’s endianness.
On big endian this is a no-op. On little endian the bytes are swapped.
Examples
Basic usage:
let n = 0x1Au64;
if cfg!(target_endian = "big") {
assert_eq!(u64::from_be(n), n)
} else {
assert_eq!(u64::from_be(n), n.swap_bytes())
}
1.0.0 (const: 1.32.0) · sourcepub const fn from_le(x: u64) -> u64
pub const fn from_le(x: u64) -> u64
Converts an integer from little endian to the target’s endianness.
On little endian this is a no-op. On big endian the bytes are swapped.
Examples
Basic usage:
let n = 0x1Au64;
if cfg!(target_endian = "little") {
assert_eq!(u64::from_le(n), n)
} else {
assert_eq!(u64::from_le(n), n.swap_bytes())
}
1.0.0 (const: 1.32.0) · sourcepub const fn to_be(self) -> u64
pub const fn to_be(self) -> u64
Converts self
to big endian from the target’s endianness.
On big endian this is a no-op. On little endian the bytes are swapped.
Examples
Basic usage:
let n = 0x1Au64;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
1.0.0 (const: 1.32.0) · sourcepub const fn to_le(self) -> u64
pub const fn to_le(self) -> u64
Converts self
to little endian from the target’s endianness.
On little endian this is a no-op. On big endian the bytes are swapped.
Examples
Basic usage:
let n = 0x1Au64;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.0.0 (const: 1.47.0) · sourcepub const fn checked_add(self, rhs: u64) -> Option<u64>
pub const fn checked_add(self, rhs: u64) -> Option<u64>
Checked integer addition. Computes self + rhs
, returning None
if overflow occurred.
Examples
Basic usage:
assert_eq!((u64::MAX - 2).checked_add(1), Some(u64::MAX - 1));
assert_eq!((u64::MAX - 2).checked_add(3), None);
const: unstable · sourcepub unsafe fn unchecked_add(self, rhs: u64) -> u64
🔬This is a nightly-only experimental API. (unchecked_math
)
pub unsafe fn unchecked_add(self, rhs: u64) -> u64
unchecked_math
)Unchecked integer addition. Computes self + rhs
, assuming overflow
cannot occur.
Safety
This results in undefined behavior when
self + rhs > u64::MAX
or self + rhs < u64::MIN
,
i.e. when checked_add
would return None
.
1.66.0 (const: 1.66.0) · sourcepub const fn checked_add_signed(self, rhs: i64) -> Option<u64>
pub const fn checked_add_signed(self, rhs: i64) -> Option<u64>
Checked addition with a signed integer. Computes self + rhs
,
returning None
if overflow occurred.
Examples
Basic usage:
assert_eq!(1u64.checked_add_signed(2), Some(3));
assert_eq!(1u64.checked_add_signed(-2), None);
assert_eq!((u64::MAX - 2).checked_add_signed(3), None);
1.0.0 (const: 1.47.0) · sourcepub const fn checked_sub(self, rhs: u64) -> Option<u64>
pub const fn checked_sub(self, rhs: u64) -> Option<u64>
Checked integer subtraction. Computes self - rhs
, returning
None
if overflow occurred.
Examples
Basic usage:
assert_eq!(1u64.checked_sub(1), Some(0));
assert_eq!(0u64.checked_sub(1), None);
const: unstable · sourcepub unsafe fn unchecked_sub(self, rhs: u64) -> u64
🔬This is a nightly-only experimental API. (unchecked_math
)
pub unsafe fn unchecked_sub(self, rhs: u64) -> u64
unchecked_math
)Unchecked integer subtraction. Computes self - rhs
, assuming overflow
cannot occur.
Safety
This results in undefined behavior when
self - rhs > u64::MAX
or self - rhs < u64::MIN
,
i.e. when checked_sub
would return None
.
1.0.0 (const: 1.47.0) · sourcepub const fn checked_mul(self, rhs: u64) -> Option<u64>
pub const fn checked_mul(self, rhs: u64) -> Option<u64>
Checked integer multiplication. Computes self * rhs
, returning
None
if overflow occurred.
Examples
Basic usage:
assert_eq!(5u64.checked_mul(1), Some(5));
assert_eq!(u64::MAX.checked_mul(2), None);
const: unstable · sourcepub unsafe fn unchecked_mul(self, rhs: u64) -> u64
🔬This is a nightly-only experimental API. (unchecked_math
)
pub unsafe fn unchecked_mul(self, rhs: u64) -> u64
unchecked_math
)Unchecked integer multiplication. Computes self * rhs
, assuming overflow
cannot occur.
Safety
This results in undefined behavior when
self * rhs > u64::MAX
or self * rhs < u64::MIN
,
i.e. when checked_mul
would return None
.
1.0.0 (const: 1.52.0) · sourcepub const fn checked_div(self, rhs: u64) -> Option<u64>
pub const fn checked_div(self, rhs: u64) -> Option<u64>
Checked integer division. Computes self / rhs
, returning None
if rhs == 0
.
Examples
Basic usage:
assert_eq!(128u64.checked_div(2), Some(64));
assert_eq!(1u64.checked_div(0), None);
1.38.0 (const: 1.52.0) · sourcepub const fn checked_div_euclid(self, rhs: u64) -> Option<u64>
pub const fn checked_div_euclid(self, rhs: u64) -> Option<u64>
Checked Euclidean division. Computes self.div_euclid(rhs)
, returning None
if rhs == 0
.
Examples
Basic usage:
assert_eq!(128u64.checked_div_euclid(2), Some(64));
assert_eq!(1u64.checked_div_euclid(0), None);
1.7.0 (const: 1.52.0) · sourcepub const fn checked_rem(self, rhs: u64) -> Option<u64>
pub const fn checked_rem(self, rhs: u64) -> Option<u64>
Checked integer remainder. Computes self % rhs
, returning None
if rhs == 0
.
Examples
Basic usage:
assert_eq!(5u64.checked_rem(2), Some(1));
assert_eq!(5u64.checked_rem(0), None);
1.38.0 (const: 1.52.0) · sourcepub const fn checked_rem_euclid(self, rhs: u64) -> Option<u64>
pub const fn checked_rem_euclid(self, rhs: u64) -> Option<u64>
Checked Euclidean modulo. Computes self.rem_euclid(rhs)
, returning None
if rhs == 0
.
Examples
Basic usage:
assert_eq!(5u64.checked_rem_euclid(2), Some(1));
assert_eq!(5u64.checked_rem_euclid(0), None);
1.67.0 (const: 1.67.0) · sourcepub const fn ilog(self, base: u64) -> u32
pub const fn ilog(self, base: u64) -> u32
Returns the logarithm of the number with respect to an arbitrary base, rounded down.
This method might not be optimized owing to implementation details;
ilog2
can produce results more efficiently for base 2, and ilog10
can produce results more efficiently for base 10.
Panics
This function will panic if self
is zero, or if base
is less than 2.
Examples
assert_eq!(5u64.ilog(5), 1);
1.67.0 (const: 1.67.0) · sourcepub const fn checked_ilog(self, base: u64) -> Option<u32>
pub const fn checked_ilog(self, base: u64) -> Option<u32>
Returns the logarithm of the number with respect to an arbitrary base, rounded down.
Returns None
if the number is zero, or if the base is not at least 2.
This method might not be optimized owing to implementation details;
checked_ilog2
can produce results more efficiently for base 2, and
checked_ilog10
can produce results more efficiently for base 10.
Examples
assert_eq!(5u64.checked_ilog(5), Some(1));
1.67.0 (const: 1.67.0) · sourcepub const fn checked_ilog2(self) -> Option<u32>
pub const fn checked_ilog2(self) -> Option<u32>
Returns the base 2 logarithm of the number, rounded down.
Returns None
if the number is zero.
Examples
assert_eq!(2u64.checked_ilog2(), Some(1));
1.67.0 (const: 1.67.0) · sourcepub const fn checked_ilog10(self) -> Option<u32>
pub const fn checked_ilog10(self) -> Option<u32>
Returns the base 10 logarithm of the number, rounded down.
Returns None
if the number is zero.
Examples
assert_eq!(10u64.checked_ilog10(), Some(1));
1.7.0 (const: 1.47.0) · sourcepub const fn checked_neg(self) -> Option<u64>
pub const fn checked_neg(self) -> Option<u64>
Checked negation. Computes -self
, returning None
unless self == 0
.
Note that negating any positive integer will overflow.
Examples
Basic usage:
assert_eq!(0u64.checked_neg(), Some(0));
assert_eq!(1u64.checked_neg(), None);
1.7.0 (const: 1.47.0) · sourcepub const fn checked_shl(self, rhs: u32) -> Option<u64>
pub const fn checked_shl(self, rhs: u32) -> Option<u64>
Checked shift left. Computes self << rhs
, returning None
if rhs
is larger than or equal to the number of bits in self
.
Examples
Basic usage:
assert_eq!(0x1u64.checked_shl(4), Some(0x10));
assert_eq!(0x10u64.checked_shl(129), None);
const: unstable · sourcepub unsafe fn unchecked_shl(self, rhs: u32) -> u64
🔬This is a nightly-only experimental API. (unchecked_math
)
pub unsafe fn unchecked_shl(self, rhs: u32) -> u64
unchecked_math
)Unchecked shift left. Computes self << rhs
, assuming that
rhs
is less than the number of bits in self
.
Safety
This results in undefined behavior if rhs
is larger than
or equal to the number of bits in self
,
i.e. when checked_shl
would return None
.
1.7.0 (const: 1.47.0) · sourcepub const fn checked_shr(self, rhs: u32) -> Option<u64>
pub const fn checked_shr(self, rhs: u32) -> Option<u64>
Checked shift right. Computes self >> rhs
, returning None
if rhs
is larger than or equal to the number of bits in self
.
Examples
Basic usage:
assert_eq!(0x10u64.checked_shr(4), Some(0x1));
assert_eq!(0x10u64.checked_shr(129), None);
const: unstable · sourcepub unsafe fn unchecked_shr(self, rhs: u32) -> u64
🔬This is a nightly-only experimental API. (unchecked_math
)
pub unsafe fn unchecked_shr(self, rhs: u32) -> u64
unchecked_math
)Unchecked shift right. Computes self >> rhs
, assuming that
rhs
is less than the number of bits in self
.
Safety
This results in undefined behavior if rhs
is larger than
or equal to the number of bits in self
,
i.e. when checked_shr
would return None
.
1.34.0 (const: 1.50.0) · sourcepub const fn checked_pow(self, exp: u32) -> Option<u64>
pub const fn checked_pow(self, exp: u32) -> Option<u64>
Checked exponentiation. Computes self.pow(exp)
, returning None
if
overflow occurred.
Examples
Basic usage:
assert_eq!(2u64.checked_pow(5), Some(32));
assert_eq!(u64::MAX.checked_pow(2), None);
1.0.0 (const: 1.47.0) · sourcepub const fn saturating_add(self, rhs: u64) -> u64
pub const fn saturating_add(self, rhs: u64) -> u64
Saturating integer addition. Computes self + rhs
, saturating at
the numeric bounds instead of overflowing.
Examples
Basic usage:
assert_eq!(100u64.saturating_add(1), 101);
assert_eq!(u64::MAX.saturating_add(127), u64::MAX);
1.66.0 (const: 1.66.0) · sourcepub const fn saturating_add_signed(self, rhs: i64) -> u64
pub const fn saturating_add_signed(self, rhs: i64) -> u64
Saturating addition with a signed integer. Computes self + rhs
,
saturating at the numeric bounds instead of overflowing.
Examples
Basic usage:
assert_eq!(1u64.saturating_add_signed(2), 3);
assert_eq!(1u64.saturating_add_signed(-2), 0);
assert_eq!((u64::MAX - 2).saturating_add_signed(4), u64::MAX);
1.0.0 (const: 1.47.0) · sourcepub const fn saturating_sub(self, rhs: u64) -> u64
pub const fn saturating_sub(self, rhs: u64) -> u64
Saturating integer subtraction. Computes self - rhs
, saturating
at the numeric bounds instead of overflowing.
Examples
Basic usage:
assert_eq!(100u64.saturating_sub(27), 73);
assert_eq!(13u64.saturating_sub(127), 0);
1.7.0 (const: 1.47.0) · sourcepub const fn saturating_mul(self, rhs: u64) -> u64
pub const fn saturating_mul(self, rhs: u64) -> u64
Saturating integer multiplication. Computes self * rhs
,
saturating at the numeric bounds instead of overflowing.
Examples
Basic usage:
assert_eq!(2u64.saturating_mul(10), 20);
assert_eq!((u64::MAX).saturating_mul(10), u64::MAX);
1.58.0 (const: 1.58.0) · sourcepub const fn saturating_div(self, rhs: u64) -> u64
pub const fn saturating_div(self, rhs: u64) -> u64
1.34.0 (const: 1.50.0) · sourcepub const fn saturating_pow(self, exp: u32) -> u64
pub const fn saturating_pow(self, exp: u32) -> u64
Saturating integer exponentiation. Computes self.pow(exp)
,
saturating at the numeric bounds instead of overflowing.
Examples
Basic usage:
assert_eq!(4u64.saturating_pow(3), 64);
assert_eq!(u64::MAX.saturating_pow(2), u64::MAX);
1.0.0 (const: 1.32.0) · sourcepub const fn wrapping_add(self, rhs: u64) -> u64
pub const fn wrapping_add(self, rhs: u64) -> u64
Wrapping (modular) addition. Computes self + rhs
,
wrapping around at the boundary of the type.
Examples
Basic usage:
assert_eq!(200u64.wrapping_add(55), 255);
assert_eq!(200u64.wrapping_add(u64::MAX), 199);
1.66.0 (const: 1.66.0) · sourcepub const fn wrapping_add_signed(self, rhs: i64) -> u64
pub const fn wrapping_add_signed(self, rhs: i64) -> u64
Wrapping (modular) addition with a signed integer. Computes
self + rhs
, wrapping around at the boundary of the type.
Examples
Basic usage:
assert_eq!(1u64.wrapping_add_signed(2), 3);
assert_eq!(1u64.wrapping_add_signed(-2), u64::MAX);
assert_eq!((u64::MAX - 2).wrapping_add_signed(4), 1);
1.0.0 (const: 1.32.0) · sourcepub const fn wrapping_sub(self, rhs: u64) -> u64
pub const fn wrapping_sub(self, rhs: u64) -> u64
Wrapping (modular) subtraction. Computes self - rhs
,
wrapping around at the boundary of the type.
Examples
Basic usage:
assert_eq!(100u64.wrapping_sub(100), 0);
assert_eq!(100u64.wrapping_sub(u64::MAX), 101);
1.0.0 (const: 1.32.0) · sourcepub const fn wrapping_mul(self, rhs: u64) -> u64
pub const fn wrapping_mul(self, rhs: u64) -> u64
Wrapping (modular) multiplication. Computes self * rhs
, wrapping around at the boundary of the type.
Examples
Basic usage:
Please note that this example is shared between integer types.
Which explains why u8
is used here.
assert_eq!(10u8.wrapping_mul(12), 120);
assert_eq!(25u8.wrapping_mul(12), 44);
1.2.0 (const: 1.52.0) · sourcepub const fn wrapping_div(self, rhs: u64) -> u64
pub const fn wrapping_div(self, rhs: u64) -> u64
Wrapping (modular) division. Computes self / rhs
.
Wrapped division on unsigned types is just normal division.
There’s no way wrapping could ever happen.
This function exists, so that all operations
are accounted for in the wrapping operations.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage:
assert_eq!(100u64.wrapping_div(10), 10);
1.38.0 (const: 1.52.0) · sourcepub const fn wrapping_div_euclid(self, rhs: u64) -> u64
pub const fn wrapping_div_euclid(self, rhs: u64) -> u64
Wrapping Euclidean division. Computes self.div_euclid(rhs)
.
Wrapped division on unsigned types is just normal division.
There’s no way wrapping could ever happen.
This function exists, so that all operations
are accounted for in the wrapping operations.
Since, for the positive integers, all common
definitions of division are equal, this
is exactly equal to self.wrapping_div(rhs)
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage:
assert_eq!(100u64.wrapping_div_euclid(10), 10);
1.2.0 (const: 1.52.0) · sourcepub const fn wrapping_rem(self, rhs: u64) -> u64
pub const fn wrapping_rem(self, rhs: u64) -> u64
Wrapping (modular) remainder. Computes self % rhs
.
Wrapped remainder calculation on unsigned types is
just the regular remainder calculation.
There’s no way wrapping could ever happen.
This function exists, so that all operations
are accounted for in the wrapping operations.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage:
assert_eq!(100u64.wrapping_rem(10), 0);
1.38.0 (const: 1.52.0) · sourcepub const fn wrapping_rem_euclid(self, rhs: u64) -> u64
pub const fn wrapping_rem_euclid(self, rhs: u64) -> u64
Wrapping Euclidean modulo. Computes self.rem_euclid(rhs)
.
Wrapped modulo calculation on unsigned types is
just the regular remainder calculation.
There’s no way wrapping could ever happen.
This function exists, so that all operations
are accounted for in the wrapping operations.
Since, for the positive integers, all common
definitions of division are equal, this
is exactly equal to self.wrapping_rem(rhs)
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage:
assert_eq!(100u64.wrapping_rem_euclid(10), 0);
1.2.0 (const: 1.32.0) · sourcepub const fn wrapping_neg(self) -> u64
pub const fn wrapping_neg(self) -> u64
Wrapping (modular) negation. Computes -self
,
wrapping around at the boundary of the type.
Since unsigned types do not have negative equivalents
all applications of this function will wrap (except for -0
).
For values smaller than the corresponding signed type’s maximum
the result is the same as casting the corresponding signed value.
Any larger values are equivalent to MAX + 1 - (val - MAX - 1)
where
MAX
is the corresponding signed type’s maximum.
Examples
Basic usage:
assert_eq!(0_u64.wrapping_neg(), 0);
assert_eq!(u64::MAX.wrapping_neg(), 1);
assert_eq!(13_u64.wrapping_neg(), (!13) + 1);
assert_eq!(42_u64.wrapping_neg(), !(42 - 1));
1.2.0 (const: 1.32.0) · sourcepub const fn wrapping_shl(self, rhs: u32) -> u64
pub const fn wrapping_shl(self, rhs: u32) -> u64
Panic-free bitwise shift-left; yields self << mask(rhs)
,
where mask
removes any high-order bits of rhs
that
would cause the shift to exceed the bitwidth of the type.
Note that this is not the same as a rotate-left; the
RHS of a wrapping shift-left is restricted to the range
of the type, rather than the bits shifted out of the LHS
being returned to the other end. The primitive integer
types all implement a rotate_left
function,
which may be what you want instead.
Examples
Basic usage:
assert_eq!(1u64.wrapping_shl(7), 128);
assert_eq!(1u64.wrapping_shl(128), 1);
1.2.0 (const: 1.32.0) · sourcepub const fn wrapping_shr(self, rhs: u32) -> u64
pub const fn wrapping_shr(self, rhs: u32) -> u64
Panic-free bitwise shift-right; yields self >> mask(rhs)
,
where mask
removes any high-order bits of rhs
that
would cause the shift to exceed the bitwidth of the type.
Note that this is not the same as a rotate-right; the
RHS of a wrapping shift-right is restricted to the range
of the type, rather than the bits shifted out of the LHS
being returned to the other end. The primitive integer
types all implement a rotate_right
function,
which may be what you want instead.
Examples
Basic usage:
assert_eq!(128u64.wrapping_shr(7), 1);
assert_eq!(128u64.wrapping_shr(128), 128);
1.34.0 (const: 1.50.0) · sourcepub const fn wrapping_pow(self, exp: u32) -> u64
pub const fn wrapping_pow(self, exp: u32) -> u64
Wrapping (modular) exponentiation. Computes self.pow(exp)
,
wrapping around at the boundary of the type.
Examples
Basic usage:
assert_eq!(3u64.wrapping_pow(5), 243);
assert_eq!(3u8.wrapping_pow(6), 217);
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_add(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_add(self, rhs: u64) -> (u64, bool)
Calculates self
+ rhs
Returns a tuple of the addition along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
Examples
Basic usage
assert_eq!(5u64.overflowing_add(2), (7, false));
assert_eq!(u64::MAX.overflowing_add(1), (0, true));
const: unstable · sourcepub fn carrying_add(self, rhs: u64, carry: bool) -> (u64, bool)
🔬This is a nightly-only experimental API. (bigint_helper_methods
)
pub fn carrying_add(self, rhs: u64, carry: bool) -> (u64, bool)
bigint_helper_methods
)Calculates self
+ rhs
+ carry
and returns a tuple containing
the sum and the output carry.
Performs “ternary addition” of two integer operands and a carry-in bit, and returns an output integer and a carry-out bit. This allows chaining together multiple additions to create a wider addition, and can be useful for bignum addition.
This can be thought of as a 64-bit “full adder”, in the electronics sense.
If the input carry is false, this method is equivalent to
overflowing_add
, and the output carry is
equal to the overflow flag. Note that although carry and overflow
flags are similar for unsigned integers, they are different for
signed integers.
Examples
#![feature(bigint_helper_methods)]
// 3 MAX (a = 3 × 2^64 + 2^64 - 1)
// + 5 7 (b = 5 × 2^64 + 7)
// ---------
// 9 6 (sum = 9 × 2^64 + 6)
let (a1, a0): (u64, u64) = (3, u64::MAX);
let (b1, b0): (u64, u64) = (5, 7);
let carry0 = false;
let (sum0, carry1) = a0.carrying_add(b0, carry0);
assert_eq!(carry1, true);
let (sum1, carry2) = a1.carrying_add(b1, carry1);
assert_eq!(carry2, false);
assert_eq!((sum1, sum0), (9, 6));
1.66.0 (const: 1.66.0) · sourcepub const fn overflowing_add_signed(self, rhs: i64) -> (u64, bool)
pub const fn overflowing_add_signed(self, rhs: i64) -> (u64, bool)
Calculates self
+ rhs
with a signed rhs
Returns a tuple of the addition along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
Examples
Basic usage:
assert_eq!(1u64.overflowing_add_signed(2), (3, false));
assert_eq!(1u64.overflowing_add_signed(-2), (u64::MAX, true));
assert_eq!((u64::MAX - 2).overflowing_add_signed(4), (1, true));
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_sub(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_sub(self, rhs: u64) -> (u64, bool)
Calculates self
- rhs
Returns a tuple of the subtraction along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
Examples
Basic usage
assert_eq!(5u64.overflowing_sub(2), (3, false));
assert_eq!(0u64.overflowing_sub(1), (u64::MAX, true));
const: unstable · sourcepub fn borrowing_sub(self, rhs: u64, borrow: bool) -> (u64, bool)
🔬This is a nightly-only experimental API. (bigint_helper_methods
)
pub fn borrowing_sub(self, rhs: u64, borrow: bool) -> (u64, bool)
bigint_helper_methods
)Calculates self
− rhs
− borrow
and returns a tuple
containing the difference and the output borrow.
Performs “ternary subtraction” by subtracting both an integer
operand and a borrow-in bit from self
, and returns an output
integer and a borrow-out bit. This allows chaining together multiple
subtractions to create a wider subtraction, and can be useful for
bignum subtraction.
Examples
#![feature(bigint_helper_methods)]
// 9 6 (a = 9 × 2^64 + 6)
// - 5 7 (b = 5 × 2^64 + 7)
// ---------
// 3 MAX (diff = 3 × 2^64 + 2^64 - 1)
let (a1, a0): (u64, u64) = (9, 6);
let (b1, b0): (u64, u64) = (5, 7);
let borrow0 = false;
let (diff0, borrow1) = a0.borrowing_sub(b0, borrow0);
assert_eq!(borrow1, true);
let (diff1, borrow2) = a1.borrowing_sub(b1, borrow1);
assert_eq!(borrow2, false);
assert_eq!((diff1, diff0), (3, u64::MAX));
1.60.0 (const: 1.60.0) · sourcepub const fn abs_diff(self, other: u64) -> u64
pub const fn abs_diff(self, other: u64) -> u64
Computes the absolute difference between self
and other
.
Examples
Basic usage:
assert_eq!(100u64.abs_diff(80), 20u64);
assert_eq!(100u64.abs_diff(110), 10u64);
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_mul(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_mul(self, rhs: u64) -> (u64, bool)
Calculates the multiplication of self
and rhs
.
Returns a tuple of the multiplication along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
Examples
Basic usage:
Please note that this example is shared between integer types.
Which explains why u32
is used here.
assert_eq!(5u32.overflowing_mul(2), (10, false));
assert_eq!(1_000_000_000u32.overflowing_mul(10), (1410065408, true));
1.7.0 (const: 1.52.0) · sourcepub const fn overflowing_div(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_div(self, rhs: u64) -> (u64, bool)
Calculates the divisor when self
is divided by rhs
.
Returns a tuple of the divisor along with a boolean indicating
whether an arithmetic overflow would occur. Note that for unsigned
integers overflow never occurs, so the second value is always
false
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage
assert_eq!(5u64.overflowing_div(2), (2, false));
1.38.0 (const: 1.52.0) · sourcepub const fn overflowing_div_euclid(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_div_euclid(self, rhs: u64) -> (u64, bool)
Calculates the quotient of Euclidean division self.div_euclid(rhs)
.
Returns a tuple of the divisor along with a boolean indicating
whether an arithmetic overflow would occur. Note that for unsigned
integers overflow never occurs, so the second value is always
false
.
Since, for the positive integers, all common
definitions of division are equal, this
is exactly equal to self.overflowing_div(rhs)
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage
assert_eq!(5u64.overflowing_div_euclid(2), (2, false));
1.7.0 (const: 1.52.0) · sourcepub const fn overflowing_rem(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_rem(self, rhs: u64) -> (u64, bool)
Calculates the remainder when self
is divided by rhs
.
Returns a tuple of the remainder after dividing along with a boolean
indicating whether an arithmetic overflow would occur. Note that for
unsigned integers overflow never occurs, so the second value is
always false
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage
assert_eq!(5u64.overflowing_rem(2), (1, false));
1.38.0 (const: 1.52.0) · sourcepub const fn overflowing_rem_euclid(self, rhs: u64) -> (u64, bool)
pub const fn overflowing_rem_euclid(self, rhs: u64) -> (u64, bool)
Calculates the remainder self.rem_euclid(rhs)
as if by Euclidean division.
Returns a tuple of the modulo after dividing along with a boolean
indicating whether an arithmetic overflow would occur. Note that for
unsigned integers overflow never occurs, so the second value is
always false
.
Since, for the positive integers, all common
definitions of division are equal, this operation
is exactly equal to self.overflowing_rem(rhs)
.
Panics
This function will panic if rhs
is 0.
Examples
Basic usage
assert_eq!(5u64.overflowing_rem_euclid(2), (1, false));
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_neg(self) -> (u64, bool)
pub const fn overflowing_neg(self) -> (u64, bool)
Negates self in an overflowing fashion.
Returns !self + 1
using wrapping operations to return the value
that represents the negation of this unsigned value. Note that for
positive unsigned values overflow always occurs, but negating 0 does
not overflow.
Examples
Basic usage
assert_eq!(0u64.overflowing_neg(), (0, false));
assert_eq!(2u64.overflowing_neg(), (-2i32 as u64, true));
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_shl(self, rhs: u32) -> (u64, bool)
pub const fn overflowing_shl(self, rhs: u32) -> (u64, bool)
Shifts self left by rhs
bits.
Returns a tuple of the shifted version of self along with a boolean indicating whether the shift value was larger than or equal to the number of bits. If the shift value is too large, then value is masked (N-1) where N is the number of bits, and this value is then used to perform the shift.
Examples
Basic usage
assert_eq!(0x1u64.overflowing_shl(4), (0x10, false));
assert_eq!(0x1u64.overflowing_shl(132), (0x10, true));
1.7.0 (const: 1.32.0) · sourcepub const fn overflowing_shr(self, rhs: u32) -> (u64, bool)
pub const fn overflowing_shr(self, rhs: u32) -> (u64, bool)
Shifts self right by rhs
bits.
Returns a tuple of the shifted version of self along with a boolean indicating whether the shift value was larger than or equal to the number of bits. If the shift value is too large, then value is masked (N-1) where N is the number of bits, and this value is then used to perform the shift.
Examples
Basic usage
assert_eq!(0x10u64.overflowing_shr(4), (0x1, false));
assert_eq!(0x10u64.overflowing_shr(132), (0x1, true));
1.34.0 (const: 1.50.0) · sourcepub const fn overflowing_pow(self, exp: u32) -> (u64, bool)
pub const fn overflowing_pow(self, exp: u32) -> (u64, bool)
Raises self to the power of exp
, using exponentiation by squaring.
Returns a tuple of the exponentiation along with a bool indicating whether an overflow happened.
Examples
Basic usage:
assert_eq!(3u64.overflowing_pow(5), (243, false));
assert_eq!(3u8.overflowing_pow(6), (217, true));
1.0.0 (const: 1.50.0) · sourcepub const fn pow(self, exp: u32) -> u64
pub const fn pow(self, exp: u32) -> u64
Raises self to the power of exp
, using exponentiation by squaring.
Examples
Basic usage:
assert_eq!(2u64.pow(5), 32);
const: unstable · sourcepub fn isqrt(self) -> u64
🔬This is a nightly-only experimental API. (isqrt
)
pub fn isqrt(self) -> u64
isqrt
)Returns the square root of the number, rounded down.
Examples
Basic usage:
#![feature(isqrt)]
assert_eq!(10u64.isqrt(), 3);
1.38.0 (const: 1.52.0) · sourcepub const fn div_euclid(self, rhs: u64) -> u64
pub const fn div_euclid(self, rhs: u64) -> u64
1.38.0 (const: 1.52.0) · sourcepub const fn rem_euclid(self, rhs: u64) -> u64
pub const fn rem_euclid(self, rhs: u64) -> u64
sourcepub const fn div_floor(self, rhs: u64) -> u64
🔬This is a nightly-only experimental API. (int_roundings
)
pub const fn div_floor(self, rhs: u64) -> u64
int_roundings
)1.73.0 (const: 1.73.0) · sourcepub const fn div_ceil(self, rhs: u64) -> u64
pub const fn div_ceil(self, rhs: u64) -> u64
Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
Panics
This function will panic if rhs
is zero.
Overflow behavior
On overflow, this function will panic if overflow checks are enabled (default in debug mode) and wrap if overflow checks are disabled (default in release mode).
Examples
Basic usage:
assert_eq!(7_u64.div_ceil(4), 2);
1.73.0 (const: 1.73.0) · sourcepub const fn next_multiple_of(self, rhs: u64) -> u64
pub const fn next_multiple_of(self, rhs: u64) -> u64
Calculates the smallest value greater than or equal to self
that
is a multiple of rhs
.
Panics
This function will panic if rhs
is zero.
Overflow behavior
On overflow, this function will panic if overflow checks are enabled (default in debug mode) and wrap if overflow checks are disabled (default in release mode).
Examples
Basic usage:
assert_eq!(16_u64.next_multiple_of(8), 16);
assert_eq!(23_u64.next_multiple_of(8), 24);
1.73.0 (const: 1.73.0) · sourcepub const fn checked_next_multiple_of(self, rhs: u64) -> Option<u64>
pub const fn checked_next_multiple_of(self, rhs: u64) -> Option<u64>
Calculates the smallest value greater than or equal to self
that
is a multiple of rhs
. Returns None
if rhs
is zero or the
operation would result in overflow.
Examples
Basic usage:
assert_eq!(16_u64.checked_next_multiple_of(8), Some(16));
assert_eq!(23_u64.checked_next_multiple_of(8), Some(24));
assert_eq!(1_u64.checked_next_multiple_of(0), None);
assert_eq!(u64::MAX.checked_next_multiple_of(2), None);
1.0.0 (const: 1.32.0) · sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == 2^k
for some k
.
Examples
Basic usage:
assert!(16u64.is_power_of_two());
assert!(!10u64.is_power_of_two());
1.0.0 (const: 1.50.0) · sourcepub const fn next_power_of_two(self) -> u64
pub const fn next_power_of_two(self) -> u64
Returns the smallest power of two greater than or equal to self
.
When return value overflows (i.e., self > (1 << (N-1))
for type
uN
), it panics in debug mode and the return value is wrapped to 0 in
release mode (the only situation in which method can return 0).
Examples
Basic usage:
assert_eq!(2u64.next_power_of_two(), 2);
assert_eq!(3u64.next_power_of_two(), 4);
1.0.0 (const: 1.50.0) · sourcepub const fn checked_next_power_of_two(self) -> Option<u64>
pub const fn checked_next_power_of_two(self) -> Option<u64>
Returns the smallest power of two greater than or equal to n
. If
the next power of two is greater than the type’s maximum value,
None
is returned, otherwise the power of two is wrapped in Some
.
Examples
Basic usage:
assert_eq!(2u64.checked_next_power_of_two(), Some(2));
assert_eq!(3u64.checked_next_power_of_two(), Some(4));
assert_eq!(u64::MAX.checked_next_power_of_two(), None);
const: unstable · sourcepub fn wrapping_next_power_of_two(self) -> u64
🔬This is a nightly-only experimental API. (wrapping_next_power_of_two
)
pub fn wrapping_next_power_of_two(self) -> u64
wrapping_next_power_of_two
)Returns the smallest power of two greater than or equal to n
. If
the next power of two is greater than the type’s maximum value,
the return value is wrapped to 0
.
Examples
Basic usage:
#![feature(wrapping_next_power_of_two)]
assert_eq!(2u64.wrapping_next_power_of_two(), 2);
assert_eq!(3u64.wrapping_next_power_of_two(), 4);
assert_eq!(u64::MAX.wrapping_next_power_of_two(), 0);
1.32.0 (const: 1.44.0) · sourcepub const fn to_be_bytes(self) -> [u8; 8]
pub const fn to_be_bytes(self) -> [u8; 8]
Return the memory representation of this integer as a byte array in big-endian (network) byte order.
Examples
let bytes = 0x1234567890123456u64.to_be_bytes();
assert_eq!(bytes, [0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]);
1.32.0 (const: 1.44.0) · sourcepub const fn to_le_bytes(self) -> [u8; 8]
pub const fn to_le_bytes(self) -> [u8; 8]
Return the memory representation of this integer as a byte array in little-endian byte order.
Examples
let bytes = 0x1234567890123456u64.to_le_bytes();
assert_eq!(bytes, [0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]);
1.32.0 (const: 1.44.0) · sourcepub const fn to_ne_bytes(self) -> [u8; 8]
pub const fn to_ne_bytes(self) -> [u8; 8]
Return the memory representation of this integer as a byte array in native byte order.
As the target platform’s native endianness is used, portable code
should use to_be_bytes
or to_le_bytes
, as appropriate,
instead.
Examples
let bytes = 0x1234567890123456u64.to_ne_bytes();
assert_eq!(
bytes,
if cfg!(target_endian = "big") {
[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]
} else {
[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]
}
);
1.32.0 (const: 1.44.0) · sourcepub const fn from_be_bytes(bytes: [u8; 8]) -> u64
pub const fn from_be_bytes(bytes: [u8; 8]) -> u64
Create a native endian integer value from its representation as a byte array in big endian.
Examples
let value = u64::from_be_bytes([0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]);
assert_eq!(value, 0x1234567890123456);
When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_be_u64(input: &mut &[u8]) -> u64 {
let (int_bytes, rest) = input.split_at(std::mem::size_of::<u64>());
*input = rest;
u64::from_be_bytes(int_bytes.try_into().unwrap())
}
1.32.0 (const: 1.44.0) · sourcepub const fn from_le_bytes(bytes: [u8; 8]) -> u64
pub const fn from_le_bytes(bytes: [u8; 8]) -> u64
Create a native endian integer value from its representation as a byte array in little endian.
Examples
let value = u64::from_le_bytes([0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]);
assert_eq!(value, 0x1234567890123456);
When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_le_u64(input: &mut &[u8]) -> u64 {
let (int_bytes, rest) = input.split_at(std::mem::size_of::<u64>());
*input = rest;
u64::from_le_bytes(int_bytes.try_into().unwrap())
}
1.32.0 (const: 1.44.0) · sourcepub const fn from_ne_bytes(bytes: [u8; 8]) -> u64
pub const fn from_ne_bytes(bytes: [u8; 8]) -> u64
Create a native endian integer value from its memory representation as a byte array in native endianness.
As the target platform’s native endianness is used, portable code
likely wants to use from_be_bytes
or from_le_bytes
, as
appropriate instead.
Examples
let value = u64::from_ne_bytes(if cfg!(target_endian = "big") {
[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]
} else {
[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]
});
assert_eq!(value, 0x1234567890123456);
When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_ne_u64(input: &mut &[u8]) -> u64 {
let (int_bytes, rest) = input.split_at(std::mem::size_of::<u64>());
*input = rest;
u64::from_ne_bytes(int_bytes.try_into().unwrap())
}
1.0.0 (const: 1.32.0) · sourcepub const fn min_value() -> u64
👎Deprecating in a future Rust version: replaced by the MIN
associated constant on this type
pub const fn min_value() -> u64
MIN
associated constant on this typeNew code should prefer to use
u64::MIN
instead.
Returns the smallest value that can be represented by this integer type.
1.0.0 (const: 1.32.0) · sourcepub const fn max_value() -> u64
👎Deprecating in a future Rust version: replaced by the MAX
associated constant on this type
pub const fn max_value() -> u64
MAX
associated constant on this typeNew code should prefer to use
u64::MAX
instead.
Returns the largest value that can be represented by this integer type.
const: unstable · sourcepub fn widening_mul(self, rhs: u64) -> (u64, u64)
🔬This is a nightly-only experimental API. (bigint_helper_methods
)
pub fn widening_mul(self, rhs: u64) -> (u64, u64)
bigint_helper_methods
)Calculates the complete product self * rhs
without the possibility to overflow.
This returns the low-order (wrapping) bits and the high-order (overflow) bits of the result as two separate values, in that order.
If you also need to add a carry to the wide result, then you want
Self::carrying_mul
instead.
Examples
Basic usage:
Please note that this example is shared between integer types.
Which explains why u32
is used here.
#![feature(bigint_helper_methods)]
assert_eq!(5u32.widening_mul(2), (10, 0));
assert_eq!(1_000_000_000u32.widening_mul(10), (1410065408, 2));
const: unstable · sourcepub fn carrying_mul(self, rhs: u64, carry: u64) -> (u64, u64)
🔬This is a nightly-only experimental API. (bigint_helper_methods
)
pub fn carrying_mul(self, rhs: u64, carry: u64) -> (u64, u64)
bigint_helper_methods
)Calculates the “full multiplication” self * rhs + carry
without the possibility to overflow.
This returns the low-order (wrapping) bits and the high-order (overflow) bits of the result as two separate values, in that order.
Performs “long multiplication” which takes in an extra amount to add, and may return an additional amount of overflow. This allows for chaining together multiple multiplications to create “big integers” which represent larger values.
If you don’t need the carry
, then you can use Self::widening_mul
instead.
Examples
Basic usage:
Please note that this example is shared between integer types.
Which explains why u32
is used here.
#![feature(bigint_helper_methods)]
assert_eq!(5u32.carrying_mul(2, 0), (10, 0));
assert_eq!(5u32.carrying_mul(2, 10), (20, 0));
assert_eq!(1_000_000_000u32.carrying_mul(10, 0), (1410065408, 2));
assert_eq!(1_000_000_000u32.carrying_mul(10, 10), (1410065418, 2));
assert_eq!(u64::MAX.carrying_mul(u64::MAX, u64::MAX), (0, u64::MAX));
This is the core operation needed for scalar multiplication when implementing it for wider-than-native types.
#![feature(bigint_helper_methods)]
fn scalar_mul_eq(little_endian_digits: &mut Vec<u16>, multiplicand: u16) {
let mut carry = 0;
for d in little_endian_digits.iter_mut() {
(*d, carry) = d.carrying_mul(multiplicand, carry);
}
if carry != 0 {
little_endian_digits.push(carry);
}
}
let mut v = vec![10, 20];
scalar_mul_eq(&mut v, 3);
assert_eq!(v, [30, 60]);
assert_eq!(0x87654321_u64 * 0xFEED, 0x86D3D159E38D);
let mut v = vec![0x4321, 0x8765];
scalar_mul_eq(&mut v, 0xFEED);
assert_eq!(v, [0xE38D, 0xD159, 0x86D3]);
If carry
is zero, this is similar to overflowing_mul
,
except that it gives the value of the overflow instead of just whether one happened:
#![feature(bigint_helper_methods)]
let r = u8::carrying_mul(7, 13, 0);
assert_eq!((r.0, r.1 != 0), u8::overflowing_mul(7, 13));
let r = u8::carrying_mul(13, 42, 0);
assert_eq!((r.0, r.1 != 0), u8::overflowing_mul(13, 42));
The value of the first field in the returned tuple matches what you’d get
by combining the wrapping_mul
and
wrapping_add
methods:
#![feature(bigint_helper_methods)]
assert_eq!(
789_u16.carrying_mul(456, 123).0,
789_u16.wrapping_mul(456).wrapping_add(123),
);
const: unstable · sourcepub fn midpoint(self, rhs: u64) -> u64
🔬This is a nightly-only experimental API. (num_midpoint
)
pub fn midpoint(self, rhs: u64) -> u64
num_midpoint
)Calculates the middle point of self
and rhs
.
midpoint(a, b)
is (a + b) >> 1
as if it were performed in a
sufficiently-large signed integral type. This implies that the result is
always rounded towards negative infinity and that no overflow will ever occur.
Examples
#![feature(num_midpoint)]
assert_eq!(0u64.midpoint(4), 2);
assert_eq!(1u64.midpoint(4), 2);
Trait Implementations§
§impl AbsDiffEq<u64> for u64
impl AbsDiffEq<u64> for u64
§fn default_epsilon() -> u64
fn default_epsilon() -> u64
§fn abs_diff_eq(&self, other: &u64, epsilon: u64) -> bool
fn abs_diff_eq(&self, other: &u64, epsilon: u64) -> bool
§fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool
fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool
AbsDiffEq::abs_diff_eq
].1.22.0 · source§impl AddAssign<&u64> for u64
impl AddAssign<&u64> for u64
source§fn add_assign(&mut self, other: &u64)
fn add_assign(&mut self, other: &u64)
+=
operation. Read more1.8.0 · source§impl AddAssign<u64> for u64
impl AddAssign<u64> for u64
source§fn add_assign(&mut self, other: u64)
fn add_assign(&mut self, other: u64)
+=
operation. Read more§impl AsBytes for u64
impl AsBytes for u64
§fn as_bytes_mut(&mut self) -> &mut [u8] ⓘwhere
Self: FromBytes,
fn as_bytes_mut(&mut self) -> &mut [u8] ⓘwhere Self: FromBytes,
§fn write_to_prefix(&self, bytes: &mut [u8]) -> Option<()>
fn write_to_prefix(&self, bytes: &mut [u8]) -> Option<()>
source§impl AsPrimitive<f32> for u64
impl AsPrimitive<f32> for u64
source§impl AsPrimitive<f64> for u64
impl AsPrimitive<f64> for u64
source§impl AsPrimitive<i128> for u64
impl AsPrimitive<i128> for u64
source§impl AsPrimitive<i16> for u64
impl AsPrimitive<i16> for u64
source§impl AsPrimitive<i32> for u64
impl AsPrimitive<i32> for u64
source§impl AsPrimitive<i64> for u64
impl AsPrimitive<i64> for u64
source§impl AsPrimitive<i8> for u64
impl AsPrimitive<i8> for u64
source§impl AsPrimitive<isize> for u64
impl AsPrimitive<isize> for u64
source§impl AsPrimitive<u128> for u64
impl AsPrimitive<u128> for u64
source§impl AsPrimitive<u16> for u64
impl AsPrimitive<u16> for u64
source§impl AsPrimitive<u32> for u64
impl AsPrimitive<u32> for u64
source§impl AsPrimitive<u64> for u64
impl AsPrimitive<u64> for u64
source§impl AsPrimitive<u8> for u64
impl AsPrimitive<u8> for u64
source§impl AsPrimitive<usize> for u64
impl AsPrimitive<usize> for u64
1.22.0 · source§impl BitAndAssign<&u64> for u64
impl BitAndAssign<&u64> for u64
source§fn bitand_assign(&mut self, other: &u64)
fn bitand_assign(&mut self, other: &u64)
&=
operation. Read more1.8.0 · source§impl BitAndAssign<u64> for u64
impl BitAndAssign<u64> for u64
source§fn bitand_assign(&mut self, other: u64)
fn bitand_assign(&mut self, other: u64)
&=
operation. Read more1.45.0 · source§impl BitOr<NonZeroU64> for u64
impl BitOr<NonZeroU64> for u64
§type Output = NonZeroU64
type Output = NonZeroU64
|
operator.source§fn bitor(self, rhs: NonZeroU64) -> <u64 as BitOr<NonZeroU64>>::Output
fn bitor(self, rhs: NonZeroU64) -> <u64 as BitOr<NonZeroU64>>::Output
|
operation. Read more1.22.0 · source§impl BitOrAssign<&u64> for u64
impl BitOrAssign<&u64> for u64
source§fn bitor_assign(&mut self, other: &u64)
fn bitor_assign(&mut self, other: &u64)
|=
operation. Read more1.8.0 · source§impl BitOrAssign<u64> for u64
impl BitOrAssign<u64> for u64
source§fn bitor_assign(&mut self, other: u64)
fn bitor_assign(&mut self, other: u64)
|=
operation. Read more§impl BitRegister for u64
impl BitRegister for u64
u64
can only be used as a register on processors whose word size is at
least 64 bits.
This implementation is not present on targets with 32-bit processor words.
§impl BitStore for u64
impl BitStore for u64
§type Access = Cell<u64>
type Access = Cell<u64>
The unsigned integers will only be BitStore
type parameters
for handles to unaliased memory, following the normal Rust
reference rules.
§type Mem = u64
type Mem = u64
BitSlice
. It
is always one of the unsigned integer fundamentals.§type Alias = BitSafeU64
type Alias = BitSafeU64
BitStore
implementor that is known to be alias-safe. It is
used when a BitSlice
introduces multiple handles that view the same
memory location, and at least one of them has write capabilities to it.
It must have the same underlying memory type, and can only change access
patterns or public-facing usage.§type Unalias = u64
type Unalias = u64
::Alias
. It is used when a BitSlice
removes the
conditions that required a T -> T::Alias
transition.§fn load_value(&self) -> <u64 as BitStore>::Mem
fn load_value(&self) -> <u64 as BitStore>::Mem
::Access
rules. This may be called when the value is aliased by a write-capable
reference.§fn store_value(&mut self, value: <u64 as BitStore>::Mem)
fn store_value(&mut self, value: <u64 as BitStore>::Mem)
::Access
constraints.§const ALIGNED_TO_SIZE: [(); 1] = _
const ALIGNED_TO_SIZE: [(); 1] = _
§const ALIAS_WIDTH: [(); 1] = _
const ALIAS_WIDTH: [(); 1] = _
Self
and Self::Alias
be equal
in representation. This is true by fiat for all types except the
unsigned integers. Read more1.22.0 · source§impl BitXorAssign<&u64> for u64
impl BitXorAssign<&u64> for u64
source§fn bitxor_assign(&mut self, other: &u64)
fn bitxor_assign(&mut self, other: &u64)
^=
operation. Read more1.8.0 · source§impl BitXorAssign<u64> for u64
impl BitXorAssign<u64> for u64
source§fn bitxor_assign(&mut self, other: u64)
fn bitxor_assign(&mut self, other: u64)
^=
operation. Read moresource§impl CheckedAdd for u64
impl CheckedAdd for u64
source§impl CheckedDiv for u64
impl CheckedDiv for u64
source§impl CheckedEuclid for u64
impl CheckedEuclid for u64
source§impl CheckedMul for u64
impl CheckedMul for u64
source§impl CheckedNeg for u64
impl CheckedNeg for u64
source§impl CheckedRem for u64
impl CheckedRem for u64
source§impl CheckedShl for u64
impl CheckedShl for u64
source§impl CheckedShr for u64
impl CheckedShr for u64
source§impl CheckedSub for u64
impl CheckedSub for u64
§impl<T> ClassifyDispatch<T> for u64
impl<T> ClassifyDispatch<T> for u64
§fn classify_dispatch(&self, _: T) -> DispatchClass
fn classify_dispatch(&self, _: T) -> DispatchClass
target
of type T
. When implementing
this for a dispatchable, T
will be a tuple of all arguments given to the function (except
origin).§impl Codec for u64
impl Codec for u64
§fn encode(&self, bytes: &mut Vec<u8, Global>)
fn encode(&self, bytes: &mut Vec<u8, Global>)
§fn read(r: &mut Reader<'_>) -> Option<u64>
fn read(r: &mut Reader<'_>) -> Option<u64>
§fn get_encoding(&self) -> Vec<u8, Global> ⓘ
fn get_encoding(&self) -> Vec<u8, Global> ⓘ
§fn read_bytes(bytes: &[u8]) -> Option<Self>
fn read_bytes(bytes: &[u8]) -> Option<Self>
§impl Codec for u64
impl Codec for u64
§fn encode(&self, bytes: &mut Vec<u8, Global>)
fn encode(&self, bytes: &mut Vec<u8, Global>)
§fn read(r: &mut Reader<'_>) -> Result<u64, InvalidMessage>
fn read(r: &mut Reader<'_>) -> Result<u64, InvalidMessage>
§fn get_encoding(&self) -> Vec<u8, Global> ⓘ
fn get_encoding(&self) -> Vec<u8, Global> ⓘ
§fn read_bytes(bytes: &[u8]) -> Result<Self, InvalidMessage>
fn read_bytes(bytes: &[u8]) -> Result<Self, InvalidMessage>
source§impl ConditionallySelectable for u64
impl ConditionallySelectable for u64
source§impl ConstantTimeEq for u64
impl ConstantTimeEq for u64
source§impl ConstantTimeGreater for u64
impl ConstantTimeGreater for u64
source§impl ConstantTimeLess for u64
impl ConstantTimeLess for u64
§impl Contiguous for u64
impl Contiguous for u64
§const MAX_VALUE: u64 = 18_446_744_073_709_551_615u64
const MAX_VALUE: u64 = 18_446_744_073_709_551_615u64
§fn from_integer(value: Self::Int) -> Option<Self>
fn from_integer(value: Self::Int) -> Option<Self>
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Decode for u64
impl Decode for u64
§fn decode<I>(input: &mut I) -> Result<u64, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<u64, Error>where I: Input,
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
§fn decode_into<I>(
input: &mut I,
dst: &mut MaybeUninit<Self>
) -> Result<DecodeFinished, Error>where
I: Input,
fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>where I: Input,
§impl Decode for u64
impl Decode for u64
§fn decode<I>(input: &mut I) -> Result<u64, Error>where
I: Input,
fn decode<I>(input: &mut I) -> Result<u64, Error>where I: Input,
§fn skip<I>(input: &mut I) -> Result<(), Error>where
I: Input,
fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,
§fn encoded_fixed_size() -> Option<usize>
fn encoded_fixed_size() -> Option<usize>
§impl<'a> DecodeValue<'a> for u64
impl<'a> DecodeValue<'a> for u64
§fn decode_value<R>(reader: &mut R, header: Header) -> Result<u64, Error>where
R: Reader<'a>,
fn decode_value<R>(reader: &mut R, header: Header) -> Result<u64, Error>where R: Reader<'a>,
Reader
].source§impl<'de> Deserialize<'de> for u64
impl<'de> Deserialize<'de> for u64
source§fn deserialize<D>(
deserializer: D
) -> Result<u64, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
fn deserialize<D>( deserializer: D ) -> Result<u64, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,
1.51.0 · source§impl Div<NonZeroU64> for u64
impl Div<NonZeroU64> for u64
1.0.0 · source§impl Div<u64> for u64
impl Div<u64> for u64
This operation rounds towards zero, truncating any fractional part of the exact result.
Panics
This operation will panic if other == 0
.
1.22.0 · source§impl DivAssign<&u64> for u64
impl DivAssign<&u64> for u64
source§fn div_assign(&mut self, other: &u64)
fn div_assign(&mut self, other: &u64)
/=
operation. Read more1.8.0 · source§impl DivAssign<u64> for u64
impl DivAssign<u64> for u64
source§fn div_assign(&mut self, other: u64)
fn div_assign(&mut self, other: u64)
/=
operation. Read more§impl Encodable for u64
impl Encodable for u64
§fn rlp_append(&self, s: &mut RlpStream)
fn rlp_append(&self, s: &mut RlpStream)
§impl Encode for u64
impl Encode for u64
§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
§fn encode_to<T>(&self, dest: &mut T)where
T: Output + ?Sized,
fn encode_to<T>(&self, dest: &mut T)where T: Output + ?Sized,
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
§impl Encode for u64
impl Encode for u64
§fn using_encoded<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&[u8]) -> R,
fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,
§fn encode_to<T>(&self, dest: &mut T)where
T: Output + ?Sized,
fn encode_to<T>(&self, dest: &mut T)where T: Output + ?Sized,
§fn encoded_size(&self) -> usize
fn encoded_size(&self) -> usize
§impl EncodeValue for u64
impl EncodeValue for u64
§impl ExtendInto<F64> for u64
impl ExtendInto<F64> for u64
§fn extend_into(self) -> F64
fn extend_into(self) -> F64
§impl ExtendInto<f64> for u64
impl ExtendInto<f64> for u64
§fn extend_into(self) -> f64
fn extend_into(self) -> f64
§impl FixedInt for u64
impl FixedInt for u64
const REQUIRED_SPACE: usize = 8usize
§fn required_space() -> usize
fn required_space() -> usize
§fn encode_fixed_light<'a>(&'a self) -> &'a [u8] ⓘ
fn encode_fixed_light<'a>(&'a self) -> &'a [u8] ⓘ
§fn encode_fixed(self, dst: &mut [u8])
fn encode_fixed(self, dst: &mut [u8])
dst
must be exactly REQUIRED_SPACE
bytes.§fn decode_fixed(src: &[u8]) -> u64
fn decode_fixed(src: &[u8]) -> u64
src
must be exactly REQUIRED_SPACE
bytes.§fn decode_fixed_vec(v: &Vec<u8, Global>) -> Self
fn decode_fixed_vec(v: &Vec<u8, Global>) -> Self
1.31.0 · source§impl From<NonZeroU64> for u64
impl From<NonZeroU64> for u64
source§fn from(nonzero: NonZeroU64) -> u64
fn from(nonzero: NonZeroU64) -> u64
Converts a NonZeroU64
into an u64
§impl FromByteSlice for u64
impl FromByteSlice for u64
source§impl FromBytes for u64
impl FromBytes for u64
type Bytes = [u8; 8]
source§fn from_be_bytes(bytes: &<u64 as FromBytes>::Bytes) -> u64
fn from_be_bytes(bytes: &<u64 as FromBytes>::Bytes) -> u64
§impl FromBytes for u64
impl FromBytes for u64
§fn read_from_prefix(bytes: &[u8]) -> Option<Self>where
Self: Sized,
fn read_from_prefix(bytes: &[u8]) -> Option<Self>where Self: Sized,
§impl FromFFIValue for u64
impl FromFFIValue for u64
§type SelfInstance = u64
type SelfInstance = u64
Self
can be an unsized type, it needs to be represented by a sized type at the host.
This SelfInstance
is the sized type.source§impl FromFormattedStr for u64
impl FromFormattedStr for u64
source§impl FromPrimitive for u64
impl FromPrimitive for u64
source§fn from_isize(n: isize) -> Option<u64>
fn from_isize(n: isize) -> Option<u64>
isize
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_i8(n: i8) -> Option<u64>
fn from_i8(n: i8) -> Option<u64>
i8
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_i16(n: i16) -> Option<u64>
fn from_i16(n: i16) -> Option<u64>
i16
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_i32(n: i32) -> Option<u64>
fn from_i32(n: i32) -> Option<u64>
i32
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_i64(n: i64) -> Option<u64>
fn from_i64(n: i64) -> Option<u64>
i64
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_i128(n: i128) -> Option<u64>
fn from_i128(n: i128) -> Option<u64>
i128
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned. Read moresource§fn from_usize(n: usize) -> Option<u64>
fn from_usize(n: usize) -> Option<u64>
usize
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_u8(n: u8) -> Option<u64>
fn from_u8(n: u8) -> Option<u64>
u8
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_u16(n: u16) -> Option<u64>
fn from_u16(n: u16) -> Option<u64>
u16
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_u32(n: u32) -> Option<u64>
fn from_u32(n: u32) -> Option<u64>
u32
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_u64(n: u64) -> Option<u64>
fn from_u64(n: u64) -> Option<u64>
u64
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned.source§fn from_u128(n: u128) -> Option<u64>
fn from_u128(n: u128) -> Option<u64>
u128
to return an optional value of this type. If the
value cannot be represented by this type, then None
is returned. Read moresource§impl FromWasmAbi for u64
impl FromWasmAbi for u64
§impl InflectorNumbers for u64
impl InflectorNumbers for u64
fn ordinalize(&self) -> String
§impl Integer<u64> for u64
impl Integer<u64> for u64
§fn leading_zeros(self) -> u64
fn leading_zeros(self) -> u64
§fn trailing_zeros(self) -> u64
fn trailing_zeros(self) -> u64
§fn count_ones(self) -> u64
fn count_ones(self) -> u64
source§impl Integer for u64
impl Integer for u64
source§fn div_floor(&self, other: &u64) -> u64
fn div_floor(&self, other: &u64) -> u64
Unsigned integer division. Returns the same result as div
(/
).
source§fn mod_floor(&self, other: &u64) -> u64
fn mod_floor(&self, other: &u64) -> u64
Unsigned integer modulo operation. Returns the same result as rem
(%
).
source§fn gcd(&self, other: &u64) -> u64
fn gcd(&self, other: &u64) -> u64
Calculates the Greatest Common Divisor (GCD) of the number and other
source§fn lcm(&self, other: &u64) -> u64
fn lcm(&self, other: &u64) -> u64
Calculates the Lowest Common Multiple (LCM) of the number and other
.
source§fn gcd_lcm(&self, other: &u64) -> (u64, u64)
fn gcd_lcm(&self, other: &u64) -> (u64, u64)
Calculates the Greatest Common Divisor (GCD) and
Lowest Common Multiple (LCM) of the number and other
.
source§fn is_multiple_of(&self, other: &u64) -> bool
fn is_multiple_of(&self, other: &u64) -> bool
Returns true
if the number is a multiple of other
.
source§fn div_rem(&self, other: &u64) -> (u64, u64)
fn div_rem(&self, other: &u64) -> (u64, u64)
Simultaneous truncated integer division and modulus.
source§fn extended_gcd_lcm(&self, other: &u64) -> (ExtendedGcd<u64>, u64)
fn extended_gcd_lcm(&self, other: &u64) -> (ExtendedGcd<u64>, u64)
source§fn extended_gcd(&self, other: &Self) -> ExtendedGcd<Self>where
Self: Clone,
fn extended_gcd(&self, other: &Self) -> ExtendedGcd<Self>where Self: Clone,
source§fn div_mod_floor(&self, other: &Self) -> (Self, Self)
fn div_mod_floor(&self, other: &Self) -> (Self, Self)
(quotient, remainder)
. Read more§impl Integral for u64
impl Integral for u64
§fn from_str_radix(src: &str, radix: u32) -> Result<u64, ParseIntError>
fn from_str_radix(src: &str, radix: u32) -> Result<u64, ParseIntError>
§fn count_ones(self) -> u32
fn count_ones(self) -> u32
self
.§fn count_zeros(self) -> u32
fn count_zeros(self) -> u32
self
.§fn leading_zeros(self) -> u32
fn leading_zeros(self) -> u32
self
.§fn trailing_zeros(self) -> u32
fn trailing_zeros(self) -> u32
self
.§fn leading_ones(self) -> u32
fn leading_ones(self) -> u32
self
.§fn trailing_ones(self) -> u32
fn trailing_ones(self) -> u32
self
.§fn rotate_left(self, n: u32) -> u64
fn rotate_left(self, n: u32) -> u64
n
, wrapping the
truncated bits to the end of the resulting integer. Read more§fn rotate_right(self, n: u32) -> u64
fn rotate_right(self, n: u32) -> u64
n
, wrapping the
truncated bits to the beginning of the resulting integer. Read more§fn swap_bytes(self) -> u64
fn swap_bytes(self) -> u64
§fn reverse_bits(self) -> u64
fn reverse_bits(self) -> u64
§fn checked_add(self, rhs: u64) -> Option<u64>
fn checked_add(self, rhs: u64) -> Option<u64>
self + rhs
, returning None
if
overflow occurred.§fn checked_sub(self, rhs: u64) -> Option<u64>
fn checked_sub(self, rhs: u64) -> Option<u64>
self - rhs
, returning None
if
overflow occurred.§fn checked_mul(self, rhs: u64) -> Option<u64>
fn checked_mul(self, rhs: u64) -> Option<u64>
self * rhs
, returning None
if overflow occurred.§fn checked_div(self, rhs: u64) -> Option<u64>
fn checked_div(self, rhs: u64) -> Option<u64>
self / rhs
, returning None
if
rhs == 0
or the division results in overflow.§fn checked_div_euclid(self, rhs: u64) -> Option<u64>
fn checked_div_euclid(self, rhs: u64) -> Option<u64>
self.div_euclid(rhs)
, returning
None
if rhs == 0
or the division results in overflow.§fn checked_rem(self, rhs: u64) -> Option<u64>
fn checked_rem(self, rhs: u64) -> Option<u64>
self % rhs
, returning None
if
rhs == 0
or the division results in overflow.§fn checked_rem_euclid(self, rhs: u64) -> Option<u64>
fn checked_rem_euclid(self, rhs: u64) -> Option<u64>
self.rem_euclid(rhs)
, returning
None
if rhs == 0
or the division results in overflow.§fn checked_neg(self) -> Option<u64>
fn checked_neg(self) -> Option<u64>
§fn checked_shl(self, rhs: u32) -> Option<u64>
fn checked_shl(self, rhs: u32) -> Option<u64>
self << rhs
, returning None
if rhs
is
larger than or equal to the number of bits in self
.§fn checked_shr(self, rhs: u32) -> Option<u64>
fn checked_shr(self, rhs: u32) -> Option<u64>
self >> rhs
, returning None
if rhs
is larger than or equal to the number of bits in self
.§fn checked_pow(self, rhs: u32) -> Option<u64>
fn checked_pow(self, rhs: u32) -> Option<u64>
self.pow(exp)
, returning None
if
overflow occurred.§fn saturating_add(self, rhs: u64) -> u64
fn saturating_add(self, rhs: u64) -> u64
self + rhs
, saturating at the
numeric bounds instead of overflowing.§fn saturating_sub(self, rhs: u64) -> u64
fn saturating_sub(self, rhs: u64) -> u64
self - rhs
, saturating at the
numeric bounds instead of overflowing.§fn saturating_mul(self, rhs: u64) -> u64
fn saturating_mul(self, rhs: u64) -> u64
self * rhs
, saturating at
the numeric bounds instead of overflowing.§fn saturating_pow(self, rhs: u32) -> u64
fn saturating_pow(self, rhs: u32) -> u64
self.pow(exp)
, saturating
at the numeric bounds instead of overflowing.§fn wrapping_add(self, rhs: u64) -> u64
fn wrapping_add(self, rhs: u64) -> u64
self + rhs
, wrapping around at
the boundary of the type.§fn wrapping_sub(self, rhs: u64) -> u64
fn wrapping_sub(self, rhs: u64) -> u64
self - rhs
, wrapping around
at the boundary of the type.§fn wrapping_mul(self, rhs: u64) -> u64
fn wrapping_mul(self, rhs: u64) -> u64
self * rhs
, wrapping
around at the boundary of the type.§fn wrapping_div(self, rhs: u64) -> u64
fn wrapping_div(self, rhs: u64) -> u64
self / rhs
, wrapping around at
the boundary of the type. Read more§fn wrapping_div_euclid(self, rhs: u64) -> u64
fn wrapping_div_euclid(self, rhs: u64) -> u64
self.div_euclid(rhs)
, wrapping
around at the boundary of the type. Read more§fn wrapping_rem(self, rhs: u64) -> u64
fn wrapping_rem(self, rhs: u64) -> u64
self % rhs
, wrapping around at
the boundary of the type. Read more§fn wrapping_rem_euclid(self, rhs: u64) -> u64
fn wrapping_rem_euclid(self, rhs: u64) -> u64
self.rem_euclid(rhs)
, wrapping
around at the boundary of the type. Read more§fn wrapping_neg(self) -> u64
fn wrapping_neg(self) -> u64
-self
, wrapping around at the
boundary of the type. Read more§fn wrapping_shl(self, rhs: u32) -> u64
fn wrapping_shl(self, rhs: u32) -> u64
self << mask(rhs)
, where mask
removes any high-order bits of rhs
that would cause the shift to
exceed the bit-width of the type. Read more§fn wrapping_shr(self, rhs: u32) -> u64
fn wrapping_shr(self, rhs: u32) -> u64
self >> mask(rhs)
, where mask
removes any high-order bits of rhs
that would cause the shift to
exceed the bit-width of the type. Read more§fn wrapping_pow(self, rhs: u32) -> u64
fn wrapping_pow(self, rhs: u32) -> u64
self.pow(exp)
, wrapping
around at the boundary of the type.§fn overflowing_mul(self, rhs: u64) -> (u64, bool)
fn overflowing_mul(self, rhs: u64) -> (u64, bool)
§fn overflowing_div(self, rhs: u64) -> (u64, bool)
fn overflowing_div(self, rhs: u64) -> (u64, bool)
§fn overflowing_div_euclid(self, rhs: u64) -> (u64, bool)
fn overflowing_div_euclid(self, rhs: u64) -> (u64, bool)
self.div_euclid(rhs)
. Read more§fn overflowing_rem(self, rhs: u64) -> (u64, bool)
fn overflowing_rem(self, rhs: u64) -> (u64, bool)
§fn overflowing_rem_euclid(self, rhs: u64) -> (u64, bool)
fn overflowing_rem_euclid(self, rhs: u64) -> (u64, bool)
self.rem_euclid(rhs)
. Read more§fn overflowing_neg(self) -> (u64, bool)
fn overflowing_neg(self) -> (u64, bool)
§fn overflowing_pow(self, rhs: u32) -> (u64, bool)
fn overflowing_pow(self, rhs: u32) -> (u64, bool)
exp
, using exponentiation by squaring. Read more§fn div_euclid(self, rhs: u64) -> u64
fn div_euclid(self, rhs: u64) -> u64
§fn rem_euclid(self, rhs: u64) -> u64
fn rem_euclid(self, rhs: u64) -> u64
self (mod rhs)
. Read moresource§impl<'de, E> IntoDeserializer<'de, E> for u64where
E: Error,
impl<'de, E> IntoDeserializer<'de, E> for u64where E: Error,
§type Deserializer = U64Deserializer<E>
type Deserializer = U64Deserializer<E>
source§fn into_deserializer(self) -> U64Deserializer<E>
fn into_deserializer(self) -> U64Deserializer<E>
§impl IntoFFIValue for u64
impl IntoFFIValue for u64
§fn into_ffi_value(self, _: &mut dyn FunctionContext) -> Result<u64, String>
fn into_ffi_value(self, _: &mut dyn FunctionContext) -> Result<u64, String>
self
into a ffi value.source§impl IntoSeconds for u64
impl IntoSeconds for u64
fn into_seconds(self) -> u64
§impl IntoValue for u64
impl IntoValue for u64
§const VALUE_TYPE: ValueType = ValueType::I64
const VALUE_TYPE: ValueType = ValueType::I64
§fn into_value(self) -> Value
fn into_value(self) -> Value
self
into a wasm Value
.source§impl IntoWasmAbi for u64
impl IntoWasmAbi for u64
§impl IntoWeight for u64
impl IntoWeight for u64
fn into_weight(self) -> Weight
§impl LaneSize for u64
impl LaneSize for u64
§const KECCAK_F_ROUND_COUNT: usize = 24usize
const KECCAK_F_ROUND_COUNT: usize = 24usize
§fn truncate_rc(rc: u64) -> u64
fn truncate_rc(rc: u64) -> u64
§fn rotate_left(self, n: u32) -> u64
fn rotate_left(self, n: u32) -> u64
§impl MaxEncodedLen for u64
impl MaxEncodedLen for u64
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
§impl MaxEncodedLen for u64
impl MaxEncodedLen for u64
§fn max_encoded_len() -> usize
fn max_encoded_len() -> usize
source§impl Message for u64
impl Message for u64
google.protobuf.UInt64Value
source§fn encoded_len(&self) -> usize
fn encoded_len(&self) -> usize
source§fn encode<B>(&self, buf: &mut B) -> Result<(), EncodeError>where
B: BufMut,
Self: Sized,
fn encode<B>(&self, buf: &mut B) -> Result<(), EncodeError>where B: BufMut, Self: Sized,
source§fn encode_to_vec(&self) -> Vec<u8, Global> ⓘwhere
Self: Sized,
fn encode_to_vec(&self) -> Vec<u8, Global> ⓘwhere Self: Sized,
source§fn encode_length_delimited<B>(&self, buf: &mut B) -> Result<(), EncodeError>where
B: BufMut,
Self: Sized,
fn encode_length_delimited<B>(&self, buf: &mut B) -> Result<(), EncodeError>where B: BufMut, Self: Sized,
source§fn encode_length_delimited_to_vec(&self) -> Vec<u8, Global> ⓘwhere
Self: Sized,
fn encode_length_delimited_to_vec(&self) -> Vec<u8, Global> ⓘwhere Self: Sized,
source§fn decode<B>(buf: B) -> Result<Self, DecodeError>where
B: Buf,
Self: Default,
fn decode<B>(buf: B) -> Result<Self, DecodeError>where B: Buf, Self: Default,
source§fn decode_length_delimited<B>(buf: B) -> Result<Self, DecodeError>where
B: Buf,
Self: Default,
fn decode_length_delimited<B>(buf: B) -> Result<Self, DecodeError>where B: Buf, Self: Default,
source§fn merge<B>(&mut self, buf: B) -> Result<(), DecodeError>where
B: Buf,
Self: Sized,
fn merge<B>(&mut self, buf: B) -> Result<(), DecodeError>where B: Buf, Self: Sized,
self
. Read moresource§fn merge_length_delimited<B>(&mut self, buf: B) -> Result<(), DecodeError>where
B: Buf,
Self: Sized,
fn merge_length_delimited<B>(&mut self, buf: B) -> Result<(), DecodeError>where B: Buf, Self: Sized,
self
.source§impl<'b, R, C, S> Mul<&'b Matrix<u64, R, C, S>> for u64where
R: Dim,
C: Dim,
S: Storage<u64, R, C>,
DefaultAllocator: Allocator<u64, R, C>,
impl<'b, R, C, S> Mul<&'b Matrix<u64, R, C, S>> for u64where R: Dim, C: Dim, S: Storage<u64, R, C>, DefaultAllocator: Allocator<u64, R, C>,
source§impl<'b, D> Mul<&'b OPoint<u64, D>> for u64where
D: DimName,
DefaultAllocator: Allocator<u64, D, Const<1>>,
impl<'b, D> Mul<&'b OPoint<u64, D>> for u64where D: DimName, DefaultAllocator: Allocator<u64, D, Const<1>>,
source§impl<R, C, S> Mul<Matrix<u64, R, C, S>> for u64where
R: Dim,
C: Dim,
S: Storage<u64, R, C>,
DefaultAllocator: Allocator<u64, R, C>,
impl<R, C, S> Mul<Matrix<u64, R, C, S>> for u64where R: Dim, C: Dim, S: Storage<u64, R, C>, DefaultAllocator: Allocator<u64, R, C>,
source§impl<D> Mul<OPoint<u64, D>> for u64where
D: DimName,
DefaultAllocator: Allocator<u64, D, Const<1>>,
impl<D> Mul<OPoint<u64, D>> for u64where D: DimName, DefaultAllocator: Allocator<u64, D, Const<1>>,
source§impl MulAddAssign<u64, u64> for u64
impl MulAddAssign<u64, u64> for u64
source§fn mul_add_assign(&mut self, a: u64, b: u64)
fn mul_add_assign(&mut self, a: u64, b: u64)
*self = (*self * a) + b
1.22.0 · source§impl MulAssign<&u64> for u64
impl MulAssign<&u64> for u64
source§fn mul_assign(&mut self, other: &u64)
fn mul_assign(&mut self, other: &u64)
*=
operation. Read more1.8.0 · source§impl MulAssign<u64> for u64
impl MulAssign<u64> for u64
source§fn mul_assign(&mut self, other: u64)
fn mul_assign(&mut self, other: u64)
*=
operation. Read moresource§impl Num for u64
impl Num for u64
type FromStrRadixErr = ParseIntError
source§fn from_str_radix(s: &str, radix: u32) -> Result<u64, ParseIntError>
fn from_str_radix(s: &str, radix: u32) -> Result<u64, ParseIntError>
2..=36
). Read more§impl Numeric for u64
impl Numeric for u64
§fn to_be_bytes(self) -> <u64 as Numeric>::Bytes
fn to_be_bytes(self) -> <u64 as Numeric>::Bytes
§fn to_le_bytes(self) -> <u64 as Numeric>::Bytes
fn to_le_bytes(self) -> <u64 as Numeric>::Bytes
§fn to_ne_bytes(self) -> <u64 as Numeric>::Bytes
fn to_ne_bytes(self) -> <u64 as Numeric>::Bytes
§fn from_be_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
fn from_be_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
§fn from_le_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
fn from_le_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
§fn from_ne_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
fn from_ne_bytes(bytes: <u64 as Numeric>::Bytes) -> u64
1.0.0 · source§impl Ord for u64
impl Ord for u64
source§impl OverflowingAdd for u64
impl OverflowingAdd for u64
source§impl OverflowingMul for u64
impl OverflowingMul for u64
source§impl OverflowingSub for u64
impl OverflowingSub for u64
§impl PalletError for u64
impl PalletError for u64
§const MAX_ENCODED_SIZE: usize = 8usize
const MAX_ENCODED_SIZE: usize = 8usize
source§impl PartialEq<Value> for u64
impl PartialEq<Value> for u64
1.0.0 · source§impl PartialOrd<u64> for u64
impl PartialOrd<u64> for u64
source§fn le(&self, other: &u64) -> bool
fn le(&self, other: &u64) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl PrimInt for u64
impl PrimInt for u64
source§fn count_ones(self) -> u32
fn count_ones(self) -> u32
self
. Read moresource§fn count_zeros(self) -> u32
fn count_zeros(self) -> u32
self
. Read moresource§fn leading_ones(self) -> u32
fn leading_ones(self) -> u32
self
. Read moresource§fn leading_zeros(self) -> u32
fn leading_zeros(self) -> u32
self
. Read moresource§fn trailing_ones(self) -> u32
fn trailing_ones(self) -> u32
self
. Read moresource§fn trailing_zeros(self) -> u32
fn trailing_zeros(self) -> u32
self
. Read moresource§fn rotate_left(self, n: u32) -> u64
fn rotate_left(self, n: u32) -> u64
n
, wrapping
the truncated bits to the end of the resulting integer. Read moresource§fn rotate_right(self, n: u32) -> u64
fn rotate_right(self, n: u32) -> u64
n
, wrapping
the truncated bits to the beginning of the resulting integer. Read moresource§fn signed_shl(self, n: u32) -> u64
fn signed_shl(self, n: u32) -> u64
n
, filling
zeros in the least significant bits. Read moresource§fn signed_shr(self, n: u32) -> u64
fn signed_shr(self, n: u32) -> u64
n
, copying
the “sign bit” in the most significant bits even for unsigned types. Read moresource§fn unsigned_shl(self, n: u32) -> u64
fn unsigned_shl(self, n: u32) -> u64
n
, filling
zeros in the least significant bits. Read moresource§fn unsigned_shr(self, n: u32) -> u64
fn unsigned_shr(self, n: u32) -> u64
n
, filling
zeros in the most significant bits. Read moresource§fn swap_bytes(self) -> u64
fn swap_bytes(self) -> u64
source§fn reverse_bits(self) -> u64
fn reverse_bits(self) -> u64
source§fn from_be(x: u64) -> u64
fn from_be(x: u64) -> u64
§impl<Generator, const OUTPUT: usize> RandomGen<Generator, OUTPUT> for u64where
Generator: Rng<OUTPUT>,
impl<Generator, const OUTPUT: usize> RandomGen<Generator, OUTPUT> for u64where Generator: Rng<OUTPUT>,
§fn random(rng: &mut Generator) -> u64
fn random(rng: &mut Generator) -> u64
§impl<Generator, const OUTPUT: usize> RandomRange<Generator, OUTPUT> for u64where
Generator: Rng<OUTPUT>,
impl<Generator, const OUTPUT: usize> RandomRange<Generator, OUTPUT> for u64where Generator: Rng<OUTPUT>,
§fn random_range<Bounds>(rng: &mut Generator, bounds: Bounds) -> u64where
Bounds: RangeBounds<u64>,
fn random_range<Bounds>(rng: &mut Generator, bounds: Bounds) -> u64where Bounds: RangeBounds<u64>,
§impl ReaderOffset for u64
impl ReaderOffset for u64
§fn wrapping_add(self, other: u64) -> u64
fn wrapping_add(self, other: u64) -> u64
self + other
.§fn checked_sub(self, other: u64) -> Option<u64>
fn checked_sub(self, other: u64) -> Option<u64>
self - other
.§impl ReaderOffset for u64
impl ReaderOffset for u64
§fn wrapping_add(self, other: u64) -> u64
fn wrapping_add(self, other: u64) -> u64
self + other
.§fn checked_sub(self, other: u64) -> Option<u64>
fn checked_sub(self, other: u64) -> Option<u64>
self - other
.1.51.0 · source§impl Rem<NonZeroU64> for u64
impl Rem<NonZeroU64> for u64
1.0.0 · source§impl Rem<u64> for u64
impl Rem<u64> for u64
This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
source§impl RemAssign<&BigUint> for u64
impl RemAssign<&BigUint> for u64
source§fn rem_assign(&mut self, other: &BigUint)
fn rem_assign(&mut self, other: &BigUint)
%=
operation. Read more1.22.0 · source§impl RemAssign<&u64> for u64
impl RemAssign<&u64> for u64
source§fn rem_assign(&mut self, other: &u64)
fn rem_assign(&mut self, other: &u64)
%=
operation. Read moresource§impl RemAssign<BigUint> for u64
impl RemAssign<BigUint> for u64
source§fn rem_assign(&mut self, other: BigUint)
fn rem_assign(&mut self, other: BigUint)
%=
operation. Read more1.8.0 · source§impl RemAssign<u64> for u64
impl RemAssign<u64> for u64
source§fn rem_assign(&mut self, other: u64)
fn rem_assign(&mut self, other: u64)
%=
operation. Read moresource§impl Roots for u64
impl Roots for u64
source§impl SampleUniform for u64
impl SampleUniform for u64
§type Sampler = UniformInt<u64>
type Sampler = UniformInt<u64>
UniformSampler
implementation supporting type X
.source§impl SampleUniform for u64
impl SampleUniform for u64
§type Sampler = UniformInt<u64>
type Sampler = UniformInt<u64>
UniformSampler
implementation supporting type X
.source§impl Saturating for u64
impl Saturating for u64
source§fn saturating_add(self, v: u64) -> u64
fn saturating_add(self, v: u64) -> u64
source§fn saturating_sub(self, v: u64) -> u64
fn saturating_sub(self, v: u64) -> u64
source§impl SaturatingAdd for u64
impl SaturatingAdd for u64
source§fn saturating_add(&self, v: &u64) -> u64
fn saturating_add(&self, v: &u64) -> u64
self + other
, saturating at the relevant high or low boundary of
the type.source§impl SaturatingMul for u64
impl SaturatingMul for u64
source§fn saturating_mul(&self, v: &u64) -> u64
fn saturating_mul(&self, v: &u64) -> u64
self * other
, saturating at the relevant high or low boundary of
the type.source§impl SaturatingSub for u64
impl SaturatingSub for u64
source§fn saturating_sub(&self, v: &u64) -> u64
fn saturating_sub(&self, v: &u64) -> u64
self - other
, saturating at the relevant high or low boundary of
the type.§impl Scale<u16> for u64
impl Scale<u16> for u64
§impl Scale<u32> for u64
impl Scale<u32> for u64
§impl Scale<u64> for u64
impl Scale<u64> for u64
§impl Scale<u8> for u64
impl Scale<u8> for u64
§impl SeekNum for u64
impl SeekNum for u64
source§impl Serialize for u64
impl Serialize for u64
source§fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where S: Serializer,
1.22.0 · source§impl ShlAssign<&i128> for u64
impl ShlAssign<&i128> for u64
source§fn shl_assign(&mut self, other: &i128)
fn shl_assign(&mut self, other: &i128)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&i16> for u64
impl ShlAssign<&i16> for u64
source§fn shl_assign(&mut self, other: &i16)
fn shl_assign(&mut self, other: &i16)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&i32> for u64
impl ShlAssign<&i32> for u64
source§fn shl_assign(&mut self, other: &i32)
fn shl_assign(&mut self, other: &i32)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&i64> for u64
impl ShlAssign<&i64> for u64
source§fn shl_assign(&mut self, other: &i64)
fn shl_assign(&mut self, other: &i64)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&i8> for u64
impl ShlAssign<&i8> for u64
source§fn shl_assign(&mut self, other: &i8)
fn shl_assign(&mut self, other: &i8)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&isize> for u64
impl ShlAssign<&isize> for u64
source§fn shl_assign(&mut self, other: &isize)
fn shl_assign(&mut self, other: &isize)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&u128> for u64
impl ShlAssign<&u128> for u64
source§fn shl_assign(&mut self, other: &u128)
fn shl_assign(&mut self, other: &u128)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&u16> for u64
impl ShlAssign<&u16> for u64
source§fn shl_assign(&mut self, other: &u16)
fn shl_assign(&mut self, other: &u16)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&u32> for u64
impl ShlAssign<&u32> for u64
source§fn shl_assign(&mut self, other: &u32)
fn shl_assign(&mut self, other: &u32)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&u64> for u64
impl ShlAssign<&u64> for u64
source§fn shl_assign(&mut self, other: &u64)
fn shl_assign(&mut self, other: &u64)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&u8> for u64
impl ShlAssign<&u8> for u64
source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · source§impl ShlAssign<&usize> for u64
impl ShlAssign<&usize> for u64
source§fn shl_assign(&mut self, other: &usize)
fn shl_assign(&mut self, other: &usize)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<i128> for u64
impl ShlAssign<i128> for u64
source§fn shl_assign(&mut self, other: i128)
fn shl_assign(&mut self, other: i128)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<i16> for u64
impl ShlAssign<i16> for u64
source§fn shl_assign(&mut self, other: i16)
fn shl_assign(&mut self, other: i16)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<i32> for u64
impl ShlAssign<i32> for u64
source§fn shl_assign(&mut self, other: i32)
fn shl_assign(&mut self, other: i32)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<i64> for u64
impl ShlAssign<i64> for u64
source§fn shl_assign(&mut self, other: i64)
fn shl_assign(&mut self, other: i64)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<i8> for u64
impl ShlAssign<i8> for u64
source§fn shl_assign(&mut self, other: i8)
fn shl_assign(&mut self, other: i8)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<isize> for u64
impl ShlAssign<isize> for u64
source§fn shl_assign(&mut self, other: isize)
fn shl_assign(&mut self, other: isize)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<u128> for u64
impl ShlAssign<u128> for u64
source§fn shl_assign(&mut self, other: u128)
fn shl_assign(&mut self, other: u128)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<u16> for u64
impl ShlAssign<u16> for u64
source§fn shl_assign(&mut self, other: u16)
fn shl_assign(&mut self, other: u16)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<u32> for u64
impl ShlAssign<u32> for u64
source§fn shl_assign(&mut self, other: u32)
fn shl_assign(&mut self, other: u32)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<u8> for u64
impl ShlAssign<u8> for u64
source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<usize> for u64
impl ShlAssign<usize> for u64
source§fn shl_assign(&mut self, other: usize)
fn shl_assign(&mut self, other: usize)
<<=
operation. Read more1.8.0 · source§impl ShlAssign<u64> for u64
impl ShlAssign<u64> for u64
source§fn shl_assign(&mut self, other: u64)
fn shl_assign(&mut self, other: u64)
<<=
operation. Read more1.22.0 · source§impl ShrAssign<&i128> for u64
impl ShrAssign<&i128> for u64
source§fn shr_assign(&mut self, other: &i128)
fn shr_assign(&mut self, other: &i128)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&i16> for u64
impl ShrAssign<&i16> for u64
source§fn shr_assign(&mut self, other: &i16)
fn shr_assign(&mut self, other: &i16)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&i32> for u64
impl ShrAssign<&i32> for u64
source§fn shr_assign(&mut self, other: &i32)
fn shr_assign(&mut self, other: &i32)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&i64> for u64
impl ShrAssign<&i64> for u64
source§fn shr_assign(&mut self, other: &i64)
fn shr_assign(&mut self, other: &i64)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&i8> for u64
impl ShrAssign<&i8> for u64
source§fn shr_assign(&mut self, other: &i8)
fn shr_assign(&mut self, other: &i8)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&isize> for u64
impl ShrAssign<&isize> for u64
source§fn shr_assign(&mut self, other: &isize)
fn shr_assign(&mut self, other: &isize)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&u128> for u64
impl ShrAssign<&u128> for u64
source§fn shr_assign(&mut self, other: &u128)
fn shr_assign(&mut self, other: &u128)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&u16> for u64
impl ShrAssign<&u16> for u64
source§fn shr_assign(&mut self, other: &u16)
fn shr_assign(&mut self, other: &u16)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&u32> for u64
impl ShrAssign<&u32> for u64
source§fn shr_assign(&mut self, other: &u32)
fn shr_assign(&mut self, other: &u32)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&u64> for u64
impl ShrAssign<&u64> for u64
source§fn shr_assign(&mut self, other: &u64)
fn shr_assign(&mut self, other: &u64)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&u8> for u64
impl ShrAssign<&u8> for u64
source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · source§impl ShrAssign<&usize> for u64
impl ShrAssign<&usize> for u64
source§fn shr_assign(&mut self, other: &usize)
fn shr_assign(&mut self, other: &usize)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<i128> for u64
impl ShrAssign<i128> for u64
source§fn shr_assign(&mut self, other: i128)
fn shr_assign(&mut self, other: i128)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<i16> for u64
impl ShrAssign<i16> for u64
source§fn shr_assign(&mut self, other: i16)
fn shr_assign(&mut self, other: i16)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<i32> for u64
impl ShrAssign<i32> for u64
source§fn shr_assign(&mut self, other: i32)
fn shr_assign(&mut self, other: i32)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<i64> for u64
impl ShrAssign<i64> for u64
source§fn shr_assign(&mut self, other: i64)
fn shr_assign(&mut self, other: i64)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<i8> for u64
impl ShrAssign<i8> for u64
source§fn shr_assign(&mut self, other: i8)
fn shr_assign(&mut self, other: i8)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<isize> for u64
impl ShrAssign<isize> for u64
source§fn shr_assign(&mut self, other: isize)
fn shr_assign(&mut self, other: isize)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<u128> for u64
impl ShrAssign<u128> for u64
source§fn shr_assign(&mut self, other: u128)
fn shr_assign(&mut self, other: u128)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<u16> for u64
impl ShrAssign<u16> for u64
source§fn shr_assign(&mut self, other: u16)
fn shr_assign(&mut self, other: u16)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<u32> for u64
impl ShrAssign<u32> for u64
source§fn shr_assign(&mut self, other: u32)
fn shr_assign(&mut self, other: u32)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<u8> for u64
impl ShrAssign<u8> for u64
source§fn shr_assign(&mut self, other: u8)
fn shr_assign(&mut self, other: u8)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<usize> for u64
impl ShrAssign<usize> for u64
source§fn shr_assign(&mut self, other: usize)
fn shr_assign(&mut self, other: usize)
>>=
operation. Read more1.8.0 · source§impl ShrAssign<u64> for u64
impl ShrAssign<u64> for u64
source§fn shr_assign(&mut self, other: u64)
fn shr_assign(&mut self, other: u64)
>>=
operation. Read moresource§impl SimdElement for u64
impl SimdElement for u64
§impl SimdValue for u64
impl SimdValue for u64
§fn splat(val: <u64 as SimdValue>::Element) -> u64
fn splat(val: <u64 as SimdValue>::Element) -> u64
val
.§fn extract(&self, _: usize) -> <u64 as SimdValue>::Element
fn extract(&self, _: usize) -> <u64 as SimdValue>::Element
self
. Read more§unsafe fn extract_unchecked(&self, _: usize) -> <u64 as SimdValue>::Element
unsafe fn extract_unchecked(&self, _: usize) -> <u64 as SimdValue>::Element
self
without bound-checking.§unsafe fn replace_unchecked(
&mut self,
_: usize,
val: <u64 as SimdValue>::Element
)
unsafe fn replace_unchecked( &mut self, _: usize, val: <u64 as SimdValue>::Element )
self
by val
without bound-checking.§fn map_lanes(self, f: impl Fn(Self::Element) -> Self::Element) -> Selfwhere
Self: Clone,
fn map_lanes(self, f: impl Fn(Self::Element) -> Self::Element) -> Selfwhere Self: Clone,
self
. Read more§fn zip_map_lanes(
self,
b: Self,
f: impl Fn(Self::Element, Self::Element) -> Self::Element
) -> Selfwhere
Self: Clone,
fn zip_map_lanes( self, b: Self, f: impl Fn(Self::Element, Self::Element) -> Self::Element ) -> Selfwhere Self: Clone,
§impl StateID for u64
impl StateID for u64
§fn from_usize(n: usize) -> u64
fn from_usize(n: usize) -> u64
usize
to this implementation’s representation. Read more§fn max_id() -> usize
fn max_id() -> usize
§fn read_bytes(slice: &[u8]) -> u64
fn read_bytes(slice: &[u8]) -> u64
§fn write_bytes(self, slice: &mut [u8])
fn write_bytes(self, slice: &mut [u8])
source§impl Step for u64
impl Step for u64
source§unsafe fn forward_unchecked(start: u64, n: usize) -> u64
unsafe fn forward_unchecked(start: u64, n: usize) -> u64
step_trait
)source§unsafe fn backward_unchecked(start: u64, n: usize) -> u64
unsafe fn backward_unchecked(start: u64, n: usize) -> u64
step_trait
)source§fn forward(start: u64, n: usize) -> u64
fn forward(start: u64, n: usize) -> u64
step_trait
)source§fn backward(start: u64, n: usize) -> u64
fn backward(start: u64, n: usize) -> u64
step_trait
)source§fn steps_between(start: &u64, end: &u64) -> Option<usize>
fn steps_between(start: &u64, end: &u64) -> Option<usize>
step_trait
)1.22.0 · source§impl SubAssign<&u64> for u64
impl SubAssign<&u64> for u64
source§fn sub_assign(&mut self, other: &u64)
fn sub_assign(&mut self, other: &u64)
-=
operation. Read more1.8.0 · source§impl SubAssign<u64> for u64
impl SubAssign<u64> for u64
source§fn sub_assign(&mut self, other: u64)
fn sub_assign(&mut self, other: u64)
-=
operation. Read more§impl<N2> SubsetOf<AutoSimd<N2>> for u64where
AutoSimd<N2>: SimdValue + Copy,
<AutoSimd<N2> as SimdValue>::Element: SupersetOf<u64> + PartialEq<<AutoSimd<N2> as SimdValue>::Element>,
impl<N2> SubsetOf<AutoSimd<N2>> for u64where AutoSimd<N2>: SimdValue + Copy, <AutoSimd<N2> as SimdValue>::Element: SupersetOf<u64> + PartialEq<<AutoSimd<N2> as SimdValue>::Element>,
§fn to_superset(&self) -> AutoSimd<N2>
fn to_superset(&self) -> AutoSimd<N2>
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &AutoSimd<N2>) -> u64
fn from_superset_unchecked(element: &AutoSimd<N2>) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(c: &AutoSimd<N2>) -> bool
fn is_in_subset(c: &AutoSimd<N2>) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl<N2> SubsetOf<Complex<N2>> for u64where
N2: Zero + SupersetOf<u64>,
impl<N2> SubsetOf<Complex<N2>> for u64where N2: Zero + SupersetOf<u64>,
§fn to_superset(&self) -> Complex<N2>
fn to_superset(&self) -> Complex<N2>
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &Complex<N2>) -> u64
fn from_superset_unchecked(element: &Complex<N2>) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(c: &Complex<N2>) -> bool
fn is_in_subset(c: &Complex<N2>) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<WideF32x4> for u64
impl SubsetOf<WideF32x4> for u64
§fn to_superset(&self) -> WideF32x4
fn to_superset(&self) -> WideF32x4
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &WideF32x4) -> u64
fn from_superset_unchecked(element: &WideF32x4) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(c: &WideF32x4) -> bool
fn is_in_subset(c: &WideF32x4) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<WideF32x8> for u64
impl SubsetOf<WideF32x8> for u64
§fn to_superset(&self) -> WideF32x8
fn to_superset(&self) -> WideF32x8
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &WideF32x8) -> u64
fn from_superset_unchecked(element: &WideF32x8) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(c: &WideF32x8) -> bool
fn is_in_subset(c: &WideF32x8) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<WideF64x4> for u64
impl SubsetOf<WideF64x4> for u64
§fn to_superset(&self) -> WideF64x4
fn to_superset(&self) -> WideF64x4
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &WideF64x4) -> u64
fn from_superset_unchecked(element: &WideF64x4) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(c: &WideF64x4) -> bool
fn is_in_subset(c: &WideF64x4) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<f32> for u64
impl SubsetOf<f32> for u64
§fn to_superset(&self) -> f32
fn to_superset(&self) -> f32
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &f32) -> u64
fn from_superset_unchecked(element: &f32) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(_: &f32) -> bool
fn is_in_subset(_: &f32) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<f64> for u64
impl SubsetOf<f64> for u64
§fn to_superset(&self) -> f64
fn to_superset(&self) -> f64
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &f64) -> u64
fn from_superset_unchecked(element: &f64) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(_: &f64) -> bool
fn is_in_subset(_: &f64) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<i128> for u64
impl SubsetOf<i128> for u64
§fn to_superset(&self) -> i128
fn to_superset(&self) -> i128
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &i128) -> u64
fn from_superset_unchecked(element: &i128) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(_: &i128) -> bool
fn is_in_subset(_: &i128) -> bool
element
is actually part of the subset Self
(and can be converted to it).§fn from_superset(element: &T) -> Option<Self>
fn from_superset(element: &T) -> Option<Self>
self
from the equivalent element of its
superset. Read more§impl SubsetOf<i16> for u64
impl SubsetOf<i16> for u64
§fn to_superset(&self) -> i16
fn to_superset(&self) -> i16
self
to the equivalent element of its superset.§fn from_superset_unchecked(element: &i16) -> u64
fn from_superset_unchecked(element: &i16) -> u64
self.to_superset
but without any property checks. Always succeeds.§fn is_in_subset(_: &i16) -> bool
fn is_in_subset(_: &i16) -> bool
element
is actually part of the subset Self
(and can be