Primitive Type u8
Expand description
The 8-bit unsigned integer type.
Implementations§
Source§impl u8
impl u8
1.43.0 · Sourcepub const MIN: u8 = 0u8
pub const MIN: u8 = 0u8
1.43.0 · Sourcepub const MAX: u8 = 255u8
pub const MAX: u8 = 255u8
1.0.0 (const: 1.32.0) · Sourcepub const fn count_ones(self) -> u32
pub const fn count_ones(self) -> u32
1.0.0 (const: 1.32.0) · Sourcepub const fn count_zeros(self) -> u32
pub const fn count_zeros(self) -> u32
1.0.0 (const: 1.32.0) · Sourcepub const fn leading_zeros(self) -> u32
pub const fn leading_zeros(self) -> u32
1.0.0 (const: 1.32.0) · Sourcepub const fn trailing_zeros(self) -> u32
pub const fn trailing_zeros(self) -> u32
1.46.0 (const: 1.46.0) · Sourcepub const fn leading_ones(self) -> u32
pub const fn leading_ones(self) -> u32
1.46.0 (const: 1.46.0) · Sourcepub const fn trailing_ones(self) -> u32
pub const fn trailing_ones(self) -> u32
Sourcepub const fn cast_signed(self) -> i8
🔬This is a nightly-only experimental API. (integer_sign_cast
#125882)
pub const fn cast_signed(self) -> i8
integer_sign_cast
#125882)Returns the bit pattern of self
reinterpreted as a signed integer of the same size.
This produces the same result as an as
cast, but ensures that the bit-width remains
the same.
§Examples
Basic usage:
1.0.0 (const: 1.32.0) · Sourcepub const fn rotate_left(self, n: u32) -> u8
pub const fn rotate_left(self, n: u32) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn rotate_right(self, n: u32) -> u8
pub const fn rotate_right(self, n: u32) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn swap_bytes(self) -> u8
pub const fn swap_bytes(self) -> u8
1.37.0 (const: 1.37.0) · Sourcepub const fn reverse_bits(self) -> u8
pub const fn reverse_bits(self) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn from_be(x: u8) -> u8
pub const fn from_be(x: u8) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn from_le(x: u8) -> u8
pub const fn from_le(x: u8) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn to_be(self) -> u8
pub const fn to_be(self) -> u8
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:
1.0.0 (const: 1.32.0) · Sourcepub const fn to_le(self) -> u8
pub const fn to_le(self) -> u8
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:
1.0.0 (const: 1.47.0) · Sourcepub const fn checked_add(self, rhs: u8) -> Option<u8>
pub const fn checked_add(self, rhs: u8) -> Option<u8>
Checked integer addition. Computes self + rhs
, returning None
if overflow occurred.
§Examples
Basic usage:
Sourcepub const fn strict_add(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_add(self, rhs: u8) -> u8
strict_overflow_ops
#118260)1.79.0 (const: 1.79.0) · Sourcepub const unsafe fn unchecked_add(self, rhs: u8) -> u8
pub const unsafe fn unchecked_add(self, rhs: u8) -> u8
Unchecked integer addition. Computes self + rhs
, assuming overflow
cannot occur.
Calling x.unchecked_add(y)
is semantically equivalent to calling
x.
checked_add
(y).
unwrap_unchecked
()
.
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_add
.
§Safety
This results in undefined behavior when
self + rhs > u8::MAX
or self + rhs < u8::MIN
,
i.e. when checked_add
would return None
.
1.66.0 (const: 1.66.0) · Sourcepub const fn checked_add_signed(self, rhs: i8) -> Option<u8>
pub const fn checked_add_signed(self, rhs: i8) -> Option<u8>
Checked addition with a signed integer. Computes self + rhs
,
returning None
if overflow occurred.
§Examples
Basic usage:
Sourcepub const fn strict_add_signed(self, rhs: i8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_add_signed(self, rhs: i8) -> u8
strict_overflow_ops
#118260)1.0.0 (const: 1.47.0) · Sourcepub const fn checked_sub(self, rhs: u8) -> Option<u8>
pub const fn checked_sub(self, rhs: u8) -> Option<u8>
Checked integer subtraction. Computes self - rhs
, returning
None
if overflow occurred.
§Examples
Basic usage:
Sourcepub const fn strict_sub(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_sub(self, rhs: u8) -> u8
strict_overflow_ops
#118260)1.79.0 (const: 1.79.0) · Sourcepub const unsafe fn unchecked_sub(self, rhs: u8) -> u8
pub const unsafe fn unchecked_sub(self, rhs: u8) -> u8
Unchecked integer subtraction. Computes self - rhs
, assuming overflow
cannot occur.
Calling x.unchecked_sub(y)
is semantically equivalent to calling
x.
checked_sub
(y).
unwrap_unchecked
()
.
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_sub
.
If you find yourself writing code like this:
if foo >= bar {
// SAFETY: just checked it will not overflow
let diff = unsafe { foo.unchecked_sub(bar) };
// ... use diff ...
}
Consider changing it to
As that does exactly the same thing – including telling the optimizer
that the subtraction cannot overflow – but avoids needing unsafe
.
§Safety
This results in undefined behavior when
self - rhs > u8::MAX
or self - rhs < u8::MIN
,
i.e. when checked_sub
would return None
.
Sourcepub const fn checked_sub_signed(self, rhs: i8) -> Option<u8>
🔬This is a nightly-only experimental API. (mixed_integer_ops_unsigned_sub
#126043)
pub const fn checked_sub_signed(self, rhs: i8) -> Option<u8>
mixed_integer_ops_unsigned_sub
#126043)Checked subtraction with a signed integer. Computes self - rhs
,
returning None
if overflow occurred.
§Examples
Basic usage:
Sourcepub const fn checked_signed_diff(self, rhs: u8) -> Option<i8>
🔬This is a nightly-only experimental API. (unsigned_signed_diff
#126041)
pub const fn checked_signed_diff(self, rhs: u8) -> Option<i8>
unsigned_signed_diff
#126041)Checked integer subtraction. Computes self - rhs
and checks if the result fits into an i8
, returning None
if overflow occurred.
§Examples
Basic usage:
#![feature(unsigned_signed_diff)]
assert_eq!(10u8.checked_signed_diff(2), Some(8));
assert_eq!(2u8.checked_signed_diff(10), Some(-8));
assert_eq!(u8::MAX.checked_signed_diff(i8::MAX as u8), None);
assert_eq!((i8::MAX as u8).checked_signed_diff(u8::MAX), Some(i8::MIN));
assert_eq!((i8::MAX as u8 + 1).checked_signed_diff(0), None);
assert_eq!(u8::MAX.checked_signed_diff(u8::MAX), Some(0));
1.0.0 (const: 1.47.0) · Sourcepub const fn checked_mul(self, rhs: u8) -> Option<u8>
pub const fn checked_mul(self, rhs: u8) -> Option<u8>
Checked integer multiplication. Computes self * rhs
, returning
None
if overflow occurred.
§Examples
Basic usage:
Sourcepub const fn strict_mul(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_mul(self, rhs: u8) -> u8
strict_overflow_ops
#118260)1.79.0 (const: 1.79.0) · Sourcepub const unsafe fn unchecked_mul(self, rhs: u8) -> u8
pub const unsafe fn unchecked_mul(self, rhs: u8) -> u8
Unchecked integer multiplication. Computes self * rhs
, assuming overflow
cannot occur.
Calling x.unchecked_mul(y)
is semantically equivalent to calling
x.
checked_mul
(y).
unwrap_unchecked
()
.
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_mul
.
§Safety
This results in undefined behavior when
self * rhs > u8::MAX
or self * rhs < u8::MIN
,
i.e. when checked_mul
would return None
.
1.0.0 (const: 1.52.0) · Sourcepub const fn checked_div(self, rhs: u8) -> Option<u8>
pub const fn checked_div(self, rhs: u8) -> Option<u8>
Sourcepub const fn strict_div(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_div(self, rhs: u8) -> u8
strict_overflow_ops
#118260)Strict integer division. Computes self / rhs
.
Strict division on unsigned types is just normal division. There’s no way overflow could ever happen. This function exists so that all operations are accounted for in the strict operations.
§Panics
This function will panic if rhs
is zero.
§Examples
Basic usage:
The following panics because of division by zero:
1.38.0 (const: 1.52.0) · Sourcepub const fn checked_div_euclid(self, rhs: u8) -> Option<u8>
pub const fn checked_div_euclid(self, rhs: u8) -> Option<u8>
Checked Euclidean division. Computes self.div_euclid(rhs)
, returning None
if rhs == 0
.
§Examples
Basic usage:
Sourcepub const fn strict_div_euclid(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_div_euclid(self, rhs: u8) -> u8
strict_overflow_ops
#118260)Strict Euclidean division. Computes self.div_euclid(rhs)
.
Strict division on unsigned types is just normal division. There’s no
way overflow could ever happen. This function exists so that all
operations are accounted for in the strict operations. Since, for the
positive integers, all common definitions of division are equal, this
is exactly equal to self.strict_div(rhs)
.
§Panics
This function will panic if rhs
is zero.
§Examples
Basic usage:
The following panics because of division by zero:
1.7.0 (const: 1.52.0) · Sourcepub const fn checked_rem(self, rhs: u8) -> Option<u8>
pub const fn checked_rem(self, rhs: u8) -> Option<u8>
Sourcepub const fn strict_rem(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_rem(self, rhs: u8) -> u8
strict_overflow_ops
#118260)Strict integer remainder. Computes self % rhs
.
Strict remainder calculation on unsigned types is just the regular remainder calculation. There’s no way overflow could ever happen. This function exists so that all operations are accounted for in the strict operations.
§Panics
This function will panic if rhs
is zero.
§Examples
Basic usage:
The following panics because of division by zero:
1.38.0 (const: 1.52.0) · Sourcepub const fn checked_rem_euclid(self, rhs: u8) -> Option<u8>
pub const fn checked_rem_euclid(self, rhs: u8) -> Option<u8>
Checked Euclidean modulo. Computes self.rem_euclid(rhs)
, returning None
if rhs == 0
.
§Examples
Basic usage:
Sourcepub const fn strict_rem_euclid(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_rem_euclid(self, rhs: u8) -> u8
strict_overflow_ops
#118260)Strict Euclidean modulo. Computes self.rem_euclid(rhs)
.
Strict modulo calculation on unsigned types is just the regular
remainder calculation. There’s no way overflow could ever happen.
This function exists so that all operations are accounted for in the
strict operations. Since, for the positive integers, all common
definitions of division are equal, this is exactly equal to
self.strict_rem(rhs)
.
§Panics
This function will panic if rhs
is zero.
§Examples
Basic usage:
The following panics because of division by zero:
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog(self, base: u8) -> u32
pub const fn ilog(self, base: u8) -> 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
1.67.0 (const: 1.67.0) · Sourcepub const fn checked_ilog(self, base: u8) -> Option<u32>
pub const fn checked_ilog(self, base: u8) -> 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
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
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
1.7.0 (const: 1.47.0) · Sourcepub const fn checked_neg(self) -> Option<u8>
pub const fn checked_neg(self) -> Option<u8>
Checked negation. Computes -self
, returning None
unless self == 0
.
Note that negating any positive integer will overflow.
§Examples
Basic usage:
Sourcepub const fn strict_neg(self) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_neg(self) -> u8
strict_overflow_ops
#118260)Strict negation. Computes -self
, panicking unless self == 0
.
Note that negating any positive integer will overflow.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
Basic usage:
The following panics because of overflow:
1.7.0 (const: 1.47.0) · Sourcepub const fn checked_shl(self, rhs: u32) -> Option<u8>
pub const fn checked_shl(self, rhs: u32) -> Option<u8>
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:
Sourcepub const fn strict_shl(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_shl(self, rhs: u32) -> u8
strict_overflow_ops
#118260)Sourcepub const unsafe fn unchecked_shl(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (unchecked_shifts
#85122)
pub const unsafe fn unchecked_shl(self, rhs: u32) -> u8
unchecked_shifts
#85122)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
.
Sourcepub const fn unbounded_shl(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (unbounded_shifts
#129375)
pub const fn unbounded_shl(self, rhs: u32) -> u8
unbounded_shifts
#129375)Unbounded shift left. Computes self << rhs
, without bounding the value of rhs
.
If rhs
is larger or equal to the number of bits in self
,
the entire value is shifted out, and 0
is returned.
§Examples
Basic usage:
1.7.0 (const: 1.47.0) · Sourcepub const fn checked_shr(self, rhs: u32) -> Option<u8>
pub const fn checked_shr(self, rhs: u32) -> Option<u8>
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:
Sourcepub const fn strict_shr(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_shr(self, rhs: u32) -> u8
strict_overflow_ops
#118260)Sourcepub const unsafe fn unchecked_shr(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (unchecked_shifts
#85122)
pub const unsafe fn unchecked_shr(self, rhs: u32) -> u8
unchecked_shifts
#85122)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
.
Sourcepub const fn unbounded_shr(self, rhs: u32) -> u8
🔬This is a nightly-only experimental API. (unbounded_shifts
#129375)
pub const fn unbounded_shr(self, rhs: u32) -> u8
unbounded_shifts
#129375)Unbounded shift right. Computes self >> rhs
, without bounding the value of rhs
.
If rhs
is larger or equal to the number of bits in self
,
the entire value is shifted out, and 0
is returned.
§Examples
Basic usage:
1.34.0 (const: 1.50.0) · Sourcepub const fn checked_pow(self, exp: u32) -> Option<u8>
pub const fn checked_pow(self, exp: u32) -> Option<u8>
Checked exponentiation. Computes self.pow(exp)
, returning None
if
overflow occurred.
§Examples
Basic usage:
Sourcepub const fn strict_pow(self, exp: u32) -> u8
🔬This is a nightly-only experimental API. (strict_overflow_ops
#118260)
pub const fn strict_pow(self, exp: u32) -> u8
strict_overflow_ops
#118260)1.0.0 (const: 1.47.0) · Sourcepub const fn saturating_add(self, rhs: u8) -> u8
pub const fn saturating_add(self, rhs: u8) -> u8
Saturating integer addition. Computes self + rhs
, saturating at
the numeric bounds instead of overflowing.
§Examples
Basic usage:
1.66.0 (const: 1.66.0) · Sourcepub const fn saturating_add_signed(self, rhs: i8) -> u8
pub const fn saturating_add_signed(self, rhs: i8) -> u8
Saturating addition with a signed integer. Computes self + rhs
,
saturating at the numeric bounds instead of overflowing.
§Examples
Basic usage:
1.0.0 (const: 1.47.0) · Sourcepub const fn saturating_sub(self, rhs: u8) -> u8
pub const fn saturating_sub(self, rhs: u8) -> u8
Saturating integer subtraction. Computes self - rhs
, saturating
at the numeric bounds instead of overflowing.
§Examples
Basic usage:
Sourcepub const fn saturating_sub_signed(self, rhs: i8) -> u8
🔬This is a nightly-only experimental API. (mixed_integer_ops_unsigned_sub
#126043)
pub const fn saturating_sub_signed(self, rhs: i8) -> u8
mixed_integer_ops_unsigned_sub
#126043)Saturating integer subtraction. Computes self
- rhs
, saturating at
the numeric bounds instead of overflowing.
§Examples
Basic usage:
1.7.0 (const: 1.47.0) · Sourcepub const fn saturating_mul(self, rhs: u8) -> u8
pub const fn saturating_mul(self, rhs: u8) -> u8
Saturating integer multiplication. Computes self * rhs
,
saturating at the numeric bounds instead of overflowing.
§Examples
Basic usage:
1.58.0 (const: 1.58.0) · Sourcepub const fn saturating_div(self, rhs: u8) -> u8
pub const fn saturating_div(self, rhs: u8) -> u8
1.34.0 (const: 1.50.0) · Sourcepub const fn saturating_pow(self, exp: u32) -> u8
pub const fn saturating_pow(self, exp: u32) -> u8
Saturating integer exponentiation. Computes self.pow(exp)
,
saturating at the numeric bounds instead of overflowing.
§Examples
Basic usage:
1.0.0 (const: 1.32.0) · Sourcepub const fn wrapping_add(self, rhs: u8) -> u8
pub const fn wrapping_add(self, rhs: u8) -> u8
Wrapping (modular) addition. Computes self + rhs
,
wrapping around at the boundary of the type.
§Examples
Basic usage:
1.66.0 (const: 1.66.0) · Sourcepub const fn wrapping_add_signed(self, rhs: i8) -> u8
pub const fn wrapping_add_signed(self, rhs: i8) -> u8
Wrapping (modular) addition with a signed integer. Computes
self + rhs
, wrapping around at the boundary of the type.
§Examples
Basic usage:
1.0.0 (const: 1.32.0) · Sourcepub const fn wrapping_sub(self, rhs: u8) -> u8
pub const fn wrapping_sub(self, rhs: u8) -> u8
Wrapping (modular) subtraction. Computes self - rhs
,
wrapping around at the boundary of the type.
§Examples
Basic usage:
Sourcepub const fn wrapping_sub_signed(self, rhs: i8) -> u8
🔬This is a nightly-only experimental API. (mixed_integer_ops_unsigned_sub
#126043)
pub const fn wrapping_sub_signed(self, rhs: i8) -> u8
mixed_integer_ops_unsigned_sub
#126043)Wrapping (modular) subtraction with a signed integer. Computes
self - rhs
, wrapping around at the boundary of the type.
§Examples
Basic usage:
1.0.0 (const: 1.32.0) · Sourcepub const fn wrapping_mul(self, rhs: u8) -> u8
pub const fn wrapping_mul(self, rhs: u8) -> u8
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.
1.2.0 (const: 1.52.0) · Sourcepub const fn wrapping_div(self, rhs: u8) -> u8
pub const fn wrapping_div(self, rhs: u8) -> u8
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:
1.38.0 (const: 1.52.0) · Sourcepub const fn wrapping_div_euclid(self, rhs: u8) -> u8
pub const fn wrapping_div_euclid(self, rhs: u8) -> u8
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:
1.2.0 (const: 1.52.0) · Sourcepub const fn wrapping_rem(self, rhs: u8) -> u8
pub const fn wrapping_rem(self, rhs: u8) -> u8
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:
1.38.0 (const: 1.52.0) · Sourcepub const fn wrapping_rem_euclid(self, rhs: u8) -> u8
pub const fn wrapping_rem_euclid(self, rhs: u8) -> u8
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:
1.2.0 (const: 1.32.0) · Sourcepub const fn wrapping_neg(self) -> u8
pub const fn wrapping_neg(self) -> u8
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:
1.2.0 (const: 1.32.0) · Sourcepub const fn wrapping_shl(self, rhs: u32) -> u8
pub const fn wrapping_shl(self, rhs: u32) -> u8
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:
1.2.0 (const: 1.32.0) · Sourcepub const fn wrapping_shr(self, rhs: u32) -> u8
pub const fn wrapping_shr(self, rhs: u32) -> u8
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:
1.34.0 (const: 1.50.0) · Sourcepub const fn wrapping_pow(self, exp: u32) -> u8
pub const fn wrapping_pow(self, exp: u32) -> u8
Wrapping (modular) exponentiation. Computes self.pow(exp)
,
wrapping around at the boundary of the type.
§Examples
Basic usage:
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_add(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_add(self, rhs: u8) -> (u8, 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:
Sourcepub const fn carrying_add(self, rhs: u8, carry: bool) -> (u8, bool)
🔬This is a nightly-only experimental API. (bigint_helper_methods
#85532)
pub const fn carrying_add(self, rhs: u8, carry: bool) -> (u8, bool)
bigint_helper_methods
#85532)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 8-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^8 + 2^8 - 1)
// + 5 7 (b = 5 × 2^8 + 7)
// ---------
// 9 6 (sum = 9 × 2^8 + 6)
let (a1, a0): (u8, u8) = (3, u8::MAX);
let (b1, b0): (u8, u8) = (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: i8) -> (u8, bool)
pub const fn overflowing_add_signed(self, rhs: i8) -> (u8, 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:
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_sub(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_sub(self, rhs: u8) -> (u8, 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:
Sourcepub const fn borrowing_sub(self, rhs: u8, borrow: bool) -> (u8, bool)
🔬This is a nightly-only experimental API. (bigint_helper_methods
#85532)
pub const fn borrowing_sub(self, rhs: u8, borrow: bool) -> (u8, bool)
bigint_helper_methods
#85532)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^8 + 6)
// - 5 7 (b = 5 × 2^8 + 7)
// ---------
// 3 MAX (diff = 3 × 2^8 + 2^8 - 1)
let (a1, a0): (u8, u8) = (9, 6);
let (b1, b0): (u8, u8) = (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, u8::MAX));
Sourcepub const fn overflowing_sub_signed(self, rhs: i8) -> (u8, bool)
🔬This is a nightly-only experimental API. (mixed_integer_ops_unsigned_sub
#126043)
pub const fn overflowing_sub_signed(self, rhs: i8) -> (u8, bool)
mixed_integer_ops_unsigned_sub
#126043)Calculates self
- rhs
with a signed 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:
1.60.0 (const: 1.60.0) · Sourcepub const fn abs_diff(self, other: u8) -> u8
pub const fn abs_diff(self, other: u8) -> u8
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_mul(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_mul(self, rhs: u8) -> (u8, 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.
1.7.0 (const: 1.52.0) · Sourcepub const fn overflowing_div(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_div(self, rhs: u8) -> (u8, 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:
1.38.0 (const: 1.52.0) · Sourcepub const fn overflowing_div_euclid(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_div_euclid(self, rhs: u8) -> (u8, 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:
1.7.0 (const: 1.52.0) · Sourcepub const fn overflowing_rem(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_rem(self, rhs: u8) -> (u8, 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:
1.38.0 (const: 1.52.0) · Sourcepub const fn overflowing_rem_euclid(self, rhs: u8) -> (u8, bool)
pub const fn overflowing_rem_euclid(self, rhs: u8) -> (u8, 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:
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_neg(self) -> (u8, bool)
pub const fn overflowing_neg(self) -> (u8, 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:
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_shl(self, rhs: u32) -> (u8, bool)
pub const fn overflowing_shl(self, rhs: u32) -> (u8, 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:
1.7.0 (const: 1.32.0) · Sourcepub const fn overflowing_shr(self, rhs: u32) -> (u8, bool)
pub const fn overflowing_shr(self, rhs: u32) -> (u8, 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:
1.34.0 (const: 1.50.0) · Sourcepub const fn overflowing_pow(self, exp: u32) -> (u8, bool)
pub const fn overflowing_pow(self, exp: u32) -> (u8, 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:
1.0.0 (const: 1.50.0) · Sourcepub const fn pow(self, exp: u32) -> u8
pub const fn pow(self, exp: u32) -> u8
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> u8
pub const fn isqrt(self) -> u8
1.38.0 (const: 1.52.0) · Sourcepub const fn div_euclid(self, rhs: u8) -> u8
pub const fn div_euclid(self, rhs: u8) -> u8
1.38.0 (const: 1.52.0) · Sourcepub const fn rem_euclid(self, rhs: u8) -> u8
pub const fn rem_euclid(self, rhs: u8) -> u8
Sourcepub const fn div_floor(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (int_roundings
#88581)
pub const fn div_floor(self, rhs: u8) -> u8
int_roundings
#88581)1.73.0 (const: 1.73.0) · Sourcepub const fn next_multiple_of(self, rhs: u8) -> u8
pub const fn next_multiple_of(self, rhs: u8) -> u8
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:
1.73.0 (const: 1.73.0) · Sourcepub const fn checked_next_multiple_of(self, rhs: u8) -> Option<u8>
pub const fn checked_next_multiple_of(self, rhs: u8) -> Option<u8>
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:
Sourcepub const fn is_multiple_of(self, rhs: u8) -> bool
🔬This is a nightly-only experimental API. (unsigned_is_multiple_of
#128101)
pub const fn is_multiple_of(self, rhs: u8) -> bool
unsigned_is_multiple_of
#128101)Returns true
if self
is an integer multiple of rhs
, and false otherwise.
This function is equivalent to self % rhs == 0
, except that it will not panic
for rhs == 0
. Instead, 0.is_multiple_of(0) == true
, and for any non-zero n
,
n.is_multiple_of(0) == false
.
§Examples
Basic usage:
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
1.0.0 (const: 1.50.0) · Sourcepub const fn next_power_of_two(self) -> u8
pub const fn next_power_of_two(self) -> u8
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 this method can return 0).
§Examples
Basic usage:
1.0.0 (const: 1.50.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<u8>
pub const fn checked_next_power_of_two(self) -> Option<u8>
Returns the smallest power of two greater than or equal to self
. 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:
Sourcepub const fn wrapping_next_power_of_two(self) -> u8
🔬This is a nightly-only experimental API. (wrapping_next_power_of_two
#32463)
pub const fn wrapping_next_power_of_two(self) -> u8
wrapping_next_power_of_two
#32463)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:
1.32.0 (const: 1.44.0) · Sourcepub const fn to_be_bytes(self) -> [u8; 1]
pub const fn to_be_bytes(self) -> [u8; 1]
Returns the memory representation of this integer as a byte array in big-endian (network) byte order.
§Examples
1.32.0 (const: 1.44.0) · Sourcepub const fn to_le_bytes(self) -> [u8; 1]
pub const fn to_le_bytes(self) -> [u8; 1]
Returns the memory representation of this integer as a byte array in little-endian byte order.
§Examples
1.32.0 (const: 1.44.0) · Sourcepub const fn to_ne_bytes(self) -> [u8; 1]
pub const fn to_ne_bytes(self) -> [u8; 1]
Returns 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
1.32.0 (const: 1.44.0) · Sourcepub const fn from_be_bytes(bytes: [u8; 1]) -> u8
pub const fn from_be_bytes(bytes: [u8; 1]) -> u8
Creates a native endian integer value from its representation as a byte array in big endian.
§Examples
When starting from a slice rather than an array, fallible conversion APIs can be used:
1.32.0 (const: 1.44.0) · Sourcepub const fn from_le_bytes(bytes: [u8; 1]) -> u8
pub const fn from_le_bytes(bytes: [u8; 1]) -> u8
Creates a native endian integer value from its representation as a byte array in little endian.
§Examples
When starting from a slice rather than an array, fallible conversion APIs can be used:
1.32.0 (const: 1.44.0) · Sourcepub const fn from_ne_bytes(bytes: [u8; 1]) -> u8
pub const fn from_ne_bytes(bytes: [u8; 1]) -> u8
Creates 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 = u8::from_ne_bytes(if cfg!(target_endian = "big") {
[0x12]
} else {
[0x12]
});
assert_eq!(value, 0x12);
When starting from a slice rather than an array, fallible conversion APIs can be used:
1.0.0 (const: 1.32.0) · Sourcepub const fn min_value() -> u8
👎Deprecating in a future version: replaced by the MIN
associated constant on this type
pub const fn min_value() -> u8
MIN
associated constant on this typeNew code should prefer to use
u8::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() -> u8
👎Deprecating in a future version: replaced by the MAX
associated constant on this type
pub const fn max_value() -> u8
MAX
associated constant on this typeNew code should prefer to use
u8::MAX
instead.
Returns the largest value that can be represented by this integer type.
Sourcepub const fn widening_mul(self, rhs: u8) -> (u8, u8)
🔬This is a nightly-only experimental API. (bigint_helper_methods
#85532)
pub const fn widening_mul(self, rhs: u8) -> (u8, u8)
bigint_helper_methods
#85532)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.
Sourcepub const fn carrying_mul(self, rhs: u8, carry: u8) -> (u8, u8)
🔬This is a nightly-only experimental API. (bigint_helper_methods
#85532)
pub const fn carrying_mul(self, rhs: u8, carry: u8) -> (u8, u8)
bigint_helper_methods
#85532)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!(u8::MAX.carrying_mul(u8::MAX, u8::MAX), (0, u8::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:
Sourcepub const fn midpoint(self, rhs: u8) -> u8
🔬This is a nightly-only experimental API. (num_midpoint
#110840)
pub const fn midpoint(self, rhs: u8) -> u8
num_midpoint
#110840)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
1.23.0 (const: 1.43.0) · Sourcepub const fn is_ascii(&self) -> bool
pub const fn is_ascii(&self) -> bool
Checks if the value is within the ASCII range.
§Examples
Sourcepub const fn as_ascii(&self) -> Option<AsciiChar>
🔬This is a nightly-only experimental API. (ascii_char
#110998)
pub const fn as_ascii(&self) -> Option<AsciiChar>
ascii_char
#110998)If the value of this byte is within the ASCII range, returns it as an
ASCII character. Otherwise, returns None
.
1.23.0 (const: 1.52.0) · Sourcepub const fn to_ascii_uppercase(&self) -> u8
pub const fn to_ascii_uppercase(&self) -> u8
Makes a copy of the value in its ASCII upper case equivalent.
ASCII letters ‘a’ to ‘z’ are mapped to ‘A’ to ‘Z’, but non-ASCII letters are unchanged.
To uppercase the value in-place, use make_ascii_uppercase
.
§Examples
1.23.0 (const: 1.52.0) · Sourcepub const fn to_ascii_lowercase(&self) -> u8
pub const fn to_ascii_lowercase(&self) -> u8
Makes a copy of the value in its ASCII lower case equivalent.
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’, but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase
.
§Examples
1.23.0 (const: 1.52.0) · Sourcepub const fn eq_ignore_ascii_case(&self, other: &u8) -> bool
pub const fn eq_ignore_ascii_case(&self, other: &u8) -> bool
Checks that two values are an ASCII case-insensitive match.
This is equivalent to to_ascii_lowercase(a) == to_ascii_lowercase(b)
.
§Examples
1.23.0 (const: 1.84.0) · Sourcepub const fn make_ascii_uppercase(&mut self)
pub const fn make_ascii_uppercase(&mut self)
Converts this value to its ASCII upper case equivalent in-place.
ASCII letters ‘a’ to ‘z’ are mapped to ‘A’ to ‘Z’, but non-ASCII letters are unchanged.
To return a new uppercased value without modifying the existing one, use
to_ascii_uppercase
.
§Examples
1.23.0 (const: 1.84.0) · Sourcepub const fn make_ascii_lowercase(&mut self)
pub const fn make_ascii_lowercase(&mut self)
Converts this value to its ASCII lower case equivalent in-place.
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’, but non-ASCII letters are unchanged.
To return a new lowercased value without modifying the existing one, use
to_ascii_lowercase
.
§Examples
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_alphabetic(&self) -> bool
pub const fn is_ascii_alphabetic(&self) -> bool
Checks if the value is an ASCII alphabetic character:
- U+0041 ‘A’ ..= U+005A ‘Z’, or
- U+0061 ‘a’ ..= U+007A ‘z’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(uppercase_a.is_ascii_alphabetic());
assert!(uppercase_g.is_ascii_alphabetic());
assert!(a.is_ascii_alphabetic());
assert!(g.is_ascii_alphabetic());
assert!(!zero.is_ascii_alphabetic());
assert!(!percent.is_ascii_alphabetic());
assert!(!space.is_ascii_alphabetic());
assert!(!lf.is_ascii_alphabetic());
assert!(!esc.is_ascii_alphabetic());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_uppercase(&self) -> bool
pub const fn is_ascii_uppercase(&self) -> bool
Checks if the value is an ASCII uppercase character: U+0041 ‘A’ ..= U+005A ‘Z’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(uppercase_a.is_ascii_uppercase());
assert!(uppercase_g.is_ascii_uppercase());
assert!(!a.is_ascii_uppercase());
assert!(!g.is_ascii_uppercase());
assert!(!zero.is_ascii_uppercase());
assert!(!percent.is_ascii_uppercase());
assert!(!space.is_ascii_uppercase());
assert!(!lf.is_ascii_uppercase());
assert!(!esc.is_ascii_uppercase());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_lowercase(&self) -> bool
pub const fn is_ascii_lowercase(&self) -> bool
Checks if the value is an ASCII lowercase character: U+0061 ‘a’ ..= U+007A ‘z’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(!uppercase_a.is_ascii_lowercase());
assert!(!uppercase_g.is_ascii_lowercase());
assert!(a.is_ascii_lowercase());
assert!(g.is_ascii_lowercase());
assert!(!zero.is_ascii_lowercase());
assert!(!percent.is_ascii_lowercase());
assert!(!space.is_ascii_lowercase());
assert!(!lf.is_ascii_lowercase());
assert!(!esc.is_ascii_lowercase());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_alphanumeric(&self) -> bool
pub const fn is_ascii_alphanumeric(&self) -> bool
Checks if the value is an ASCII alphanumeric character:
- U+0041 ‘A’ ..= U+005A ‘Z’, or
- U+0061 ‘a’ ..= U+007A ‘z’, or
- U+0030 ‘0’ ..= U+0039 ‘9’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(uppercase_a.is_ascii_alphanumeric());
assert!(uppercase_g.is_ascii_alphanumeric());
assert!(a.is_ascii_alphanumeric());
assert!(g.is_ascii_alphanumeric());
assert!(zero.is_ascii_alphanumeric());
assert!(!percent.is_ascii_alphanumeric());
assert!(!space.is_ascii_alphanumeric());
assert!(!lf.is_ascii_alphanumeric());
assert!(!esc.is_ascii_alphanumeric());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_digit(&self) -> bool
pub const fn is_ascii_digit(&self) -> bool
Checks if the value is an ASCII decimal digit: U+0030 ‘0’ ..= U+0039 ‘9’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(!uppercase_a.is_ascii_digit());
assert!(!uppercase_g.is_ascii_digit());
assert!(!a.is_ascii_digit());
assert!(!g.is_ascii_digit());
assert!(zero.is_ascii_digit());
assert!(!percent.is_ascii_digit());
assert!(!space.is_ascii_digit());
assert!(!lf.is_ascii_digit());
assert!(!esc.is_ascii_digit());
Sourcepub const fn is_ascii_octdigit(&self) -> bool
🔬This is a nightly-only experimental API. (is_ascii_octdigit
#101288)
pub const fn is_ascii_octdigit(&self) -> bool
is_ascii_octdigit
#101288)Checks if the value is an ASCII octal digit: U+0030 ‘0’ ..= U+0037 ‘7’.
§Examples
#![feature(is_ascii_octdigit)]
let uppercase_a = b'A';
let a = b'a';
let zero = b'0';
let seven = b'7';
let nine = b'9';
let percent = b'%';
let lf = b'\n';
assert!(!uppercase_a.is_ascii_octdigit());
assert!(!a.is_ascii_octdigit());
assert!(zero.is_ascii_octdigit());
assert!(seven.is_ascii_octdigit());
assert!(!nine.is_ascii_octdigit());
assert!(!percent.is_ascii_octdigit());
assert!(!lf.is_ascii_octdigit());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_hexdigit(&self) -> bool
pub const fn is_ascii_hexdigit(&self) -> bool
Checks if the value is an ASCII hexadecimal digit:
- U+0030 ‘0’ ..= U+0039 ‘9’, or
- U+0041 ‘A’ ..= U+0046 ‘F’, or
- U+0061 ‘a’ ..= U+0066 ‘f’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(uppercase_a.is_ascii_hexdigit());
assert!(!uppercase_g.is_ascii_hexdigit());
assert!(a.is_ascii_hexdigit());
assert!(!g.is_ascii_hexdigit());
assert!(zero.is_ascii_hexdigit());
assert!(!percent.is_ascii_hexdigit());
assert!(!space.is_ascii_hexdigit());
assert!(!lf.is_ascii_hexdigit());
assert!(!esc.is_ascii_hexdigit());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_punctuation(&self) -> bool
pub const fn is_ascii_punctuation(&self) -> bool
Checks if the value is an ASCII punctuation character:
- U+0021 ..= U+002F
! " # $ % & ' ( ) * + , - . /
, or - U+003A ..= U+0040
: ; < = > ? @
, or - U+005B ..= U+0060
[ \ ] ^ _ `
, or - U+007B ..= U+007E
{ | } ~
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(!uppercase_a.is_ascii_punctuation());
assert!(!uppercase_g.is_ascii_punctuation());
assert!(!a.is_ascii_punctuation());
assert!(!g.is_ascii_punctuation());
assert!(!zero.is_ascii_punctuation());
assert!(percent.is_ascii_punctuation());
assert!(!space.is_ascii_punctuation());
assert!(!lf.is_ascii_punctuation());
assert!(!esc.is_ascii_punctuation());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_graphic(&self) -> bool
pub const fn is_ascii_graphic(&self) -> bool
Checks if the value is an ASCII graphic character: U+0021 ‘!’ ..= U+007E ‘~’.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(uppercase_a.is_ascii_graphic());
assert!(uppercase_g.is_ascii_graphic());
assert!(a.is_ascii_graphic());
assert!(g.is_ascii_graphic());
assert!(zero.is_ascii_graphic());
assert!(percent.is_ascii_graphic());
assert!(!space.is_ascii_graphic());
assert!(!lf.is_ascii_graphic());
assert!(!esc.is_ascii_graphic());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_whitespace(&self) -> bool
pub const fn is_ascii_whitespace(&self) -> bool
Checks if the value is an ASCII whitespace character: U+0020 SPACE, U+0009 HORIZONTAL TAB, U+000A LINE FEED, U+000C FORM FEED, or U+000D CARRIAGE RETURN.
Rust uses the WhatWG Infra Standard’s definition of ASCII whitespace. There are several other definitions in wide use. For instance, the POSIX locale includes U+000B VERTICAL TAB as well as all the above characters, but—from the very same specification—the default rule for “field splitting” in the Bourne shell considers only SPACE, HORIZONTAL TAB, and LINE FEED as whitespace.
If you are writing a program that will process an existing file format, check what that format’s definition of whitespace is before using this function.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(!uppercase_a.is_ascii_whitespace());
assert!(!uppercase_g.is_ascii_whitespace());
assert!(!a.is_ascii_whitespace());
assert!(!g.is_ascii_whitespace());
assert!(!zero.is_ascii_whitespace());
assert!(!percent.is_ascii_whitespace());
assert!(space.is_ascii_whitespace());
assert!(lf.is_ascii_whitespace());
assert!(!esc.is_ascii_whitespace());
1.24.0 (const: 1.47.0) · Sourcepub const fn is_ascii_control(&self) -> bool
pub const fn is_ascii_control(&self) -> bool
Checks if the value is an ASCII control character: U+0000 NUL ..= U+001F UNIT SEPARATOR, or U+007F DELETE. Note that most ASCII whitespace characters are control characters, but SPACE is not.
§Examples
let uppercase_a = b'A';
let uppercase_g = b'G';
let a = b'a';
let g = b'g';
let zero = b'0';
let percent = b'%';
let space = b' ';
let lf = b'\n';
let esc = b'\x1b';
assert!(!uppercase_a.is_ascii_control());
assert!(!uppercase_g.is_ascii_control());
assert!(!a.is_ascii_control());
assert!(!g.is_ascii_control());
assert!(!zero.is_ascii_control());
assert!(!percent.is_ascii_control());
assert!(!space.is_ascii_control());
assert!(lf.is_ascii_control());
assert!(esc.is_ascii_control());
1.60.0 · Sourcepub fn escape_ascii(self) -> EscapeDefault ⓘ
pub fn escape_ascii(self) -> EscapeDefault ⓘ
Returns an iterator that produces an escaped version of a u8
,
treating it as an ASCII character.
The behavior is identical to ascii::escape_default
.
§Examples
assert_eq!("0", b'0'.escape_ascii().to_string());
assert_eq!("\\t", b'\t'.escape_ascii().to_string());
assert_eq!("\\r", b'\r'.escape_ascii().to_string());
assert_eq!("\\n", b'\n'.escape_ascii().to_string());
assert_eq!("\\'", b'\''.escape_ascii().to_string());
assert_eq!("\\\"", b'"'.escape_ascii().to_string());
assert_eq!("\\\\", b'\\'.escape_ascii().to_string());
assert_eq!("\\x9d", b'\x9d'.escape_ascii().to_string());
Source§impl u8
impl u8
1.0.0 (const: 1.82.0) · Sourcepub const fn from_str_radix(src: &str, radix: u32) -> Result<u8, ParseIntError>
pub const fn from_str_radix(src: &str, radix: u32) -> Result<u8, ParseIntError>
Converts a string slice in a given base to an integer.
The string is expected to be an optional
+
sign followed by only digits. Leading and trailing non-digit characters (including
whitespace) represent an error. Underscores (which are accepted in rust literals)
also 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:
Trailing space returns error:
Trait Implementations§
1.22.0 · Source§impl AddAssign<&u8> for Saturating<u8>
impl AddAssign<&u8> for Saturating<u8>
Source§fn add_assign(&mut self, other: &u8)
fn add_assign(&mut self, other: &u8)
+=
operation. Read more1.22.0 · Source§impl AddAssign<&u8> for Wrapping<u8>
impl AddAssign<&u8> for Wrapping<u8>
Source§fn add_assign(&mut self, other: &u8)
fn add_assign(&mut self, other: &u8)
+=
operation. Read more1.22.0 · Source§impl AddAssign<&u8> for u8
impl AddAssign<&u8> for u8
Source§fn add_assign(&mut self, other: &u8)
fn add_assign(&mut self, other: &u8)
+=
operation. Read more1.74.0 · Source§impl AddAssign<u8> for Saturating<u8>
impl AddAssign<u8> for Saturating<u8>
Source§fn add_assign(&mut self, other: u8)
fn add_assign(&mut self, other: u8)
+=
operation. Read more1.60.0 · Source§impl AddAssign<u8> for Wrapping<u8>
impl AddAssign<u8> for Wrapping<u8>
Source§fn add_assign(&mut self, other: u8)
fn add_assign(&mut self, other: u8)
+=
operation. Read more1.8.0 · Source§impl AddAssign for u8
impl AddAssign for u8
Source§fn add_assign(&mut self, other: u8)
fn add_assign(&mut self, other: u8)
+=
operation. Read more1.0.0 · Source§impl AsciiExt for u8
impl AsciiExt for u8
Source§type Owned = u8
type Owned = u8
Source§fn is_ascii(&self) -> bool
fn is_ascii(&self) -> bool
Source§fn to_ascii_uppercase(&self) -> Self::Owned
fn to_ascii_uppercase(&self) -> Self::Owned
Source§fn to_ascii_lowercase(&self) -> Self::Owned
fn to_ascii_lowercase(&self) -> Self::Owned
Source§fn eq_ignore_ascii_case(&self, o: &Self) -> bool
fn eq_ignore_ascii_case(&self, o: &Self) -> bool
Source§fn make_ascii_uppercase(&mut self)
fn make_ascii_uppercase(&mut self)
Source§fn make_ascii_lowercase(&mut self)
fn make_ascii_lowercase(&mut self)
1.22.0 · Source§impl BitAndAssign<&u8> for Saturating<u8>
impl BitAndAssign<&u8> for Saturating<u8>
Source§fn bitand_assign(&mut self, other: &u8)
fn bitand_assign(&mut self, other: &u8)
&=
operation. Read more1.22.0 · Source§impl BitAndAssign<&u8> for Wrapping<u8>
impl BitAndAssign<&u8> for Wrapping<u8>
Source§fn bitand_assign(&mut self, other: &u8)
fn bitand_assign(&mut self, other: &u8)
&=
operation. Read more1.22.0 · Source§impl BitAndAssign<&u8> for u8
impl BitAndAssign<&u8> for u8
Source§fn bitand_assign(&mut self, other: &u8)
fn bitand_assign(&mut self, other: &u8)
&=
operation. Read more1.74.0 · Source§impl BitAndAssign<u8> for Saturating<u8>
impl BitAndAssign<u8> for Saturating<u8>
Source§fn bitand_assign(&mut self, other: u8)
fn bitand_assign(&mut self, other: u8)
&=
operation. Read more1.60.0 · Source§impl BitAndAssign<u8> for Wrapping<u8>
impl BitAndAssign<u8> for Wrapping<u8>
Source§fn bitand_assign(&mut self, other: u8)
fn bitand_assign(&mut self, other: u8)
&=
operation. Read more1.8.0 · Source§impl BitAndAssign for u8
impl BitAndAssign for u8
Source§fn bitand_assign(&mut self, other: u8)
fn bitand_assign(&mut self, other: u8)
&=
operation. Read more1.22.0 · Source§impl BitOrAssign<&u8> for Saturating<u8>
impl BitOrAssign<&u8> for Saturating<u8>
Source§fn bitor_assign(&mut self, other: &u8)
fn bitor_assign(&mut self, other: &u8)
|=
operation. Read more1.22.0 · Source§impl BitOrAssign<&u8> for Wrapping<u8>
impl BitOrAssign<&u8> for Wrapping<u8>
Source§fn bitor_assign(&mut self, other: &u8)
fn bitor_assign(&mut self, other: &u8)
|=
operation. Read more1.22.0 · Source§impl BitOrAssign<&u8> for u8
impl BitOrAssign<&u8> for u8
Source§fn bitor_assign(&mut self, other: &u8)
fn bitor_assign(&mut self, other: &u8)
|=
operation. Read more1.74.0 · Source§impl BitOrAssign<u8> for Saturating<u8>
impl BitOrAssign<u8> for Saturating<u8>
Source§fn bitor_assign(&mut self, other: u8)
fn bitor_assign(&mut self, other: u8)
|=
operation. Read more1.60.0 · Source§impl BitOrAssign<u8> for Wrapping<u8>
impl BitOrAssign<u8> for Wrapping<u8>
Source§fn bitor_assign(&mut self, other: u8)
fn bitor_assign(&mut self, other: u8)
|=
operation. Read more1.8.0 · Source§impl BitOrAssign for u8
impl BitOrAssign for u8
Source§fn bitor_assign(&mut self, other: u8)
fn bitor_assign(&mut self, other: u8)
|=
operation. Read more1.22.0 · Source§impl BitXorAssign<&u8> for Saturating<u8>
impl BitXorAssign<&u8> for Saturating<u8>
Source§fn bitxor_assign(&mut self, other: &u8)
fn bitxor_assign(&mut self, other: &u8)
^=
operation. Read more1.22.0 · Source§impl BitXorAssign<&u8> for Wrapping<u8>
impl BitXorAssign<&u8> for Wrapping<u8>
Source§fn bitxor_assign(&mut self, other: &u8)
fn bitxor_assign(&mut self, other: &u8)
^=
operation. Read more1.22.0 · Source§impl BitXorAssign<&u8> for u8
impl BitXorAssign<&u8> for u8
Source§fn bitxor_assign(&mut self, other: &u8)
fn bitxor_assign(&mut self, other: &u8)
^=
operation. Read more1.74.0 · Source§impl BitXorAssign<u8> for Saturating<u8>
impl BitXorAssign<u8> for Saturating<u8>
Source§fn bitxor_assign(&mut self, other: u8)
fn bitxor_assign(&mut self, other: u8)
^=
operation. Read more1.60.0 · Source§impl BitXorAssign<u8> for Wrapping<u8>
impl BitXorAssign<u8> for Wrapping<u8>
Source§fn bitxor_assign(&mut self, other: u8)
fn bitxor_assign(&mut self, other: u8)
^=
operation. Read more1.8.0 · Source§impl BitXorAssign for u8
impl BitXorAssign for u8
Source§fn bitxor_assign(&mut self, other: u8)
fn bitxor_assign(&mut self, other: u8)
^=
operation. Read more1.0.0 · Source§impl Div for u8
impl Div for u8
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<&u8> for Saturating<u8>
impl DivAssign<&u8> for Saturating<u8>
Source§fn div_assign(&mut self, other: &u8)
fn div_assign(&mut self, other: &u8)
/=
operation. Read more1.22.0 · Source§impl DivAssign<&u8> for Wrapping<u8>
impl DivAssign<&u8> for Wrapping<u8>
Source§fn div_assign(&mut self, other: &u8)
fn div_assign(&mut self, other: &u8)
/=
operation. Read more1.22.0 · Source§impl DivAssign<&u8> for u8
impl DivAssign<&u8> for u8
Source§fn div_assign(&mut self, other: &u8)
fn div_assign(&mut self, other: &u8)
/=
operation. Read more1.79.0 · Source§impl DivAssign<NonZero<u8>> for u8
impl DivAssign<NonZero<u8>> for u8
Source§fn div_assign(&mut self, other: NonZero<u8>)
fn div_assign(&mut self, other: NonZero<u8>)
This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.
1.74.0 · Source§impl DivAssign<u8> for Saturating<u8>
impl DivAssign<u8> for Saturating<u8>
Source§fn div_assign(&mut self, other: u8)
fn div_assign(&mut self, other: u8)
/=
operation. Read more1.60.0 · Source§impl DivAssign<u8> for Wrapping<u8>
impl DivAssign<u8> for Wrapping<u8>
Source§fn div_assign(&mut self, other: u8)
fn div_assign(&mut self, other: u8)
/=
operation. Read more1.8.0 · Source§impl DivAssign for u8
impl DivAssign for u8
Source§fn div_assign(&mut self, other: u8)
fn div_assign(&mut self, other: u8)
/=
operation. Read more1.13.0 · Source§impl From<u8> for char
impl From<u8> for char
Maps a byte in 0x00..=0xFF to a char
whose code point has the same value, in U+0000..=U+00FF.
Unicode is designed such that this effectively decodes bytes with the character encoding that IANA calls ISO-8859-1. This encoding is compatible with ASCII.
Note that this is different from ISO/IEC 8859-1 a.k.a. ISO 8859-1 (with one less hyphen), which leaves some “blanks”, byte values that are not assigned to any character. ISO-8859-1 (the IANA one) assigns them to the C0 and C1 control codes.
Note that this is also different from Windows-1252 a.k.a. code page 1252, which is a superset ISO/IEC 8859-1 that assigns some (not all!) blanks to punctuation and various Latin characters.
To confuse things further, on the Web
ascii
, iso-8859-1
, and windows-1252
are all aliases
for a superset of Windows-1252 that fills the remaining blanks with corresponding
C0 and C1 control codes.
1.22.0 · Source§impl MulAssign<&u8> for Saturating<u8>
impl MulAssign<&u8> for Saturating<u8>
Source§fn mul_assign(&mut self, other: &u8)
fn mul_assign(&mut self, other: &u8)
*=
operation. Read more1.22.0 · Source§impl MulAssign<&u8> for Wrapping<u8>
impl MulAssign<&u8> for Wrapping<u8>
Source§fn mul_assign(&mut self, other: &u8)
fn mul_assign(&mut self, other: &u8)
*=
operation. Read more1.22.0 · Source§impl MulAssign<&u8> for u8
impl MulAssign<&u8> for u8
Source§fn mul_assign(&mut self, other: &u8)
fn mul_assign(&mut self, other: &u8)
*=
operation. Read more1.74.0 · Source§impl MulAssign<u8> for Saturating<u8>
impl MulAssign<u8> for Saturating<u8>
Source§fn mul_assign(&mut self, other: u8)
fn mul_assign(&mut self, other: u8)
*=
operation. Read more1.60.0 · Source§impl MulAssign<u8> for Wrapping<u8>
impl MulAssign<u8> for Wrapping<u8>
Source§fn mul_assign(&mut self, other: u8)
fn mul_assign(&mut self, other: u8)
*=
operation. Read more1.8.0 · Source§impl MulAssign for u8
impl MulAssign for u8
Source§fn mul_assign(&mut self, other: u8)
fn mul_assign(&mut self, other: u8)
*=
operation. Read more1.0.0 · Source§impl Ord for u8
impl Ord for u8
1.0.0 · Source§impl PartialOrd for u8
impl PartialOrd for u8
Source§impl Random for u8
impl Random for u8
Source§fn random(source: &mut (impl RandomSource + ?Sized)) -> u8
🔬This is a nightly-only experimental API. (random
#130703)
fn random(source: &mut (impl RandomSource + ?Sized)) -> u8
random
#130703)Generates a random value.
Warning: Be careful when manipulating the resulting value! This
method samples according to a uniform distribution, so a value of 1 is
just as likely as MAX
. By using modulo operations, some
values can become more likely than others. Use audited crates when in
doubt.
1.0.0 · Source§impl Rem for u8
impl Rem for u8
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
.
1.22.0 · Source§impl RemAssign<&u8> for Saturating<u8>
impl RemAssign<&u8> for Saturating<u8>
Source§fn rem_assign(&mut self, other: &u8)
fn rem_assign(&mut self, other: &u8)
%=
operation. Read more1.22.0 · Source§impl RemAssign<&u8> for Wrapping<u8>
impl RemAssign<&u8> for Wrapping<u8>
Source§fn rem_assign(&mut self, other: &u8)
fn rem_assign(&mut self, other: &u8)
%=
operation. Read more1.22.0 · Source§impl RemAssign<&u8> for u8
impl RemAssign<&u8> for u8
Source§fn rem_assign(&mut self, other: &u8)
fn rem_assign(&mut self, other: &u8)
%=
operation. Read more1.79.0 · Source§impl RemAssign<NonZero<u8>> for u8
impl RemAssign<NonZero<u8>> for u8
Source§fn rem_assign(&mut self, other: NonZero<u8>)
fn rem_assign(&mut self, other: NonZero<u8>)
This operation satisfies n % d == n - (n / d) * d
, and cannot panic.
1.74.0 · Source§impl RemAssign<u8> for Saturating<u8>
impl RemAssign<u8> for Saturating<u8>
Source§fn rem_assign(&mut self, other: u8)
fn rem_assign(&mut self, other: u8)
%=
operation. Read more1.60.0 · Source§impl RemAssign<u8> for Wrapping<u8>
impl RemAssign<u8> for Wrapping<u8>
Source§fn rem_assign(&mut self, other: u8)
fn rem_assign(&mut self, other: u8)
%=
operation. Read more1.8.0 · Source§impl RemAssign for u8
impl RemAssign for u8
Source§fn rem_assign(&mut self, other: u8)
fn rem_assign(&mut self, other: u8)
%=
operation. Read moreSource§impl<'lhs, const N: usize> Shl<&u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
impl<'lhs, const N: usize> Shl<&u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
Source§impl<'lhs, const N: usize> Shl<u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
impl<'lhs, const N: usize> Shl<u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
1.22.0 · Source§impl ShlAssign<&i128> for u8
impl ShlAssign<&i128> for u8
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 u8
impl ShlAssign<&i16> for u8
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 u8
impl ShlAssign<&i32> for u8
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 u8
impl ShlAssign<&i64> for u8
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 u8
impl ShlAssign<&i8> for u8
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 u8
impl ShlAssign<&isize> for u8
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 u8
impl ShlAssign<&u128> for u8
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 u8
impl ShlAssign<&u16> for u8
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 u8
impl ShlAssign<&u32> for u8
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 u8
impl ShlAssign<&u64> for u8
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 i128
impl ShlAssign<&u8> for i128
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for i16
impl ShlAssign<&u8> for i16
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for i32
impl ShlAssign<&u8> for i32
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for i64
impl ShlAssign<&u8> for i64
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for i8
impl ShlAssign<&u8> for i8
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for isize
impl ShlAssign<&u8> for isize
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for u128
impl ShlAssign<&u8> for u128
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for u16
impl ShlAssign<&u8> for u16
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for u32
impl ShlAssign<&u8> for u32
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
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<&u8> for u8
impl ShlAssign<&u8> for u8
Source§fn shl_assign(&mut self, other: &u8)
fn shl_assign(&mut self, other: &u8)
<<=
operation. Read more1.22.0 · Source§impl ShlAssign<&u8> for usize
impl ShlAssign<&u8> for usize
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 u8
impl ShlAssign<&usize> for u8
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 u8
impl ShlAssign<i128> for u8
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 u8
impl ShlAssign<i16> for u8
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 u8
impl ShlAssign<i32> for u8
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 u8
impl ShlAssign<i64> for u8
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 u8
impl ShlAssign<i8> for u8
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 u8
impl ShlAssign<isize> for u8
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 u8
impl ShlAssign<u128> for u8
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 u8
impl ShlAssign<u16> for u8
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 u8
impl ShlAssign<u32> for u8
Source§fn shl_assign(&mut self, other: u32)
fn shl_assign(&mut self, other: u32)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u64> for u8
impl ShlAssign<u64> for u8
Source§fn shl_assign(&mut self, other: u64)
fn shl_assign(&mut self, other: u64)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for i128
impl ShlAssign<u8> for i128
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for i16
impl ShlAssign<u8> for i16
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for i32
impl ShlAssign<u8> for i32
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for i64
impl ShlAssign<u8> for i64
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for i8
impl ShlAssign<u8> for i8
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for isize
impl ShlAssign<u8> for isize
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for u128
impl ShlAssign<u8> for u128
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for u16
impl ShlAssign<u8> for u16
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign<u8> for u32
impl ShlAssign<u8> for u32
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
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<u8> for usize
impl ShlAssign<u8> for usize
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 u8
impl ShlAssign<usize> for u8
Source§fn shl_assign(&mut self, other: usize)
fn shl_assign(&mut self, other: usize)
<<=
operation. Read more1.8.0 · Source§impl ShlAssign for u8
impl ShlAssign for u8
Source§fn shl_assign(&mut self, other: u8)
fn shl_assign(&mut self, other: u8)
<<=
operation. Read moreSource§impl<'lhs, const N: usize> Shr<&u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
impl<'lhs, const N: usize> Shr<&u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
Source§impl<'lhs, const N: usize> Shr<u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
impl<'lhs, const N: usize> Shr<u8> for &'lhs Simd<u8, N>where
LaneCount<N>: SupportedLaneCount,
1.22.0 · Source§impl ShrAssign<&i128> for u8
impl ShrAssign<&i128> for u8
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 u8
impl ShrAssign<&i16> for u8
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 u8
impl ShrAssign<&i32> for u8
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 u8
impl ShrAssign<&i64> for u8
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 u8
impl ShrAssign<&i8> for u8
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 u8
impl ShrAssign<&isize> for u8
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 u8
impl ShrAssign<&u128> for u8
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 u8
impl ShrAssign<&u16> for u8
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 u8
impl ShrAssign<&u32> for u8
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 u8
impl ShrAssign<&u64> for u8
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 i128
impl ShrAssign<&u8> for i128
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for i16
impl ShrAssign<&u8> for i16
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for i32
impl ShrAssign<&u8> for i32
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for i64
impl ShrAssign<&u8> for i64
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for i8
impl ShrAssign<&u8> for i8
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for isize
impl ShrAssign<&u8> for isize
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for u128
impl ShrAssign<&u8> for u128
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for u16
impl ShrAssign<&u8> for u16
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for u32
impl ShrAssign<&u8> for u32
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
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<&u8> for u8
impl ShrAssign<&u8> for u8
Source§fn shr_assign(&mut self, other: &u8)
fn shr_assign(&mut self, other: &u8)
>>=
operation. Read more1.22.0 · Source§impl ShrAssign<&u8> for usize
impl ShrAssign<&u8> for usize
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 u8
impl ShrAssign<&usize> for u8
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 u8
impl ShrAssign<i128> for u8
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 u8
impl ShrAssign<i16> for u8
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 u8
impl ShrAssign<i32> for u8
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 u8
impl ShrAssign<i64> for u8
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 u8
impl ShrAssign<i8> for u8
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 u8
impl ShrAssign<isize> for u8
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 u8
impl ShrAssign<u128> for u8
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 u8
impl ShrAssign<u16> for u8
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 u8
impl ShrAssign<u32> for u8
Source§fn shr_assign(&mut self, other: u32)
fn shr_assign(&mut self, other: u32)
>>=
operation. Read more1.8.0 · Source§impl ShrAssign<u64> for u8
impl ShrAssign<u64> for u8
Source§fn shr_assign(&mut self, other: u64)
fn shr_assign(&mut self, other: u64)
>>=
operation. Read more1.8.0 · Source§impl ShrAssign<u8> for i128
impl ShrAssign<u8> for i128
Source§fn shr_assign(&mut self, other: u8)
fn shr_assign(&mut self, other: u8)
>>=
operation. Read more1.8.0 · Source§impl ShrAssign<u8> for i16
impl ShrAssign<u8> for i16
Source§fn shr_assign(&mut self, other: u8)
fn shr_assign(&mut self, other: u8)
>>=
operation. Read more1.8.0 · Source§impl ShrAssign<u8> for i32
impl ShrAssign<u8> for i32
Source§fn shr_assign(&mut self, other: u8)
fn shr_assign(&mut self, other: u8)
>>=
operation. Read more