# Primitive Type u16

## Expand description

The 16-bit unsigned integer type.

## Implementations§

source§### impl u16

### impl u16

1.43.0 · source#### pub const MIN: Self = 0u16

#### pub const MIN: Self = 0u16

1.43.0 · source#### pub const MAX: Self = 65_535u16

#### pub const MAX: Self = 65_535u16

1.0.0 (const: 1.32.0) · source#### pub const fn count_ones(self) -> u32

#### pub const fn count_ones(self) -> u32

1.0.0 (const: 1.32.0) · source#### pub const fn count_zeros(self) -> u32

#### pub const fn count_zeros(self) -> u32

1.0.0 (const: 1.32.0) · source#### pub const fn leading_zeros(self) -> u32

#### pub const fn leading_zeros(self) -> u32

1.0.0 (const: 1.32.0) · source#### pub const fn trailing_zeros(self) -> u32

#### pub const fn trailing_zeros(self) -> u32

1.46.0 (const: 1.46.0) · source#### pub const fn leading_ones(self) -> u32

#### pub const fn leading_ones(self) -> u32

1.46.0 (const: 1.46.0) · source#### pub const fn trailing_ones(self) -> u32

#### pub const fn trailing_ones(self) -> u32

source#### pub const fn cast_signed(self) -> i16

🔬This is a nightly-only experimental API. (`integer_sign_cast`

#125882)

#### pub const fn cast_signed(self) -> i16

`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) · source#### pub const fn rotate_left(self, n: u32) -> Self

#### pub const fn rotate_left(self, n: u32) -> Self

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) · source#### pub const fn rotate_right(self, n: u32) -> Self

#### pub const fn rotate_right(self, n: u32) -> Self

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) · source#### pub const fn swap_bytes(self) -> Self

#### pub const fn swap_bytes(self) -> Self

1.37.0 (const: 1.37.0) · source#### pub const fn reverse_bits(self) -> Self

#### pub const fn reverse_bits(self) -> Self

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) · source#### pub const fn from_be(x: Self) -> Self

#### pub const fn from_be(x: Self) -> Self

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) · source#### pub const fn from_le(x: Self) -> Self

#### pub const fn from_le(x: Self) -> Self

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) · source#### pub const fn to_be(self) -> Self

#### pub const fn to_be(self) -> Self

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) · source#### pub const fn to_le(self) -> Self

#### pub const fn to_le(self) -> Self

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) · source#### pub const fn checked_add(self, rhs: Self) -> Option<Self>

#### pub const fn checked_add(self, rhs: Self) -> Option<Self>

Checked integer addition. Computes `self + rhs`

, returning `None`

if overflow occurred.

##### §Examples

Basic usage:

source#### pub const fn strict_add(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_add(self, rhs: Self) -> Self

`strict_overflow_ops`

#118260)1.79.0 (const: 1.79.0) · source#### pub const unsafe fn unchecked_add(self, rhs: Self) -> Self

#### pub const unsafe fn unchecked_add(self, rhs: Self) -> Self

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 > u16::MAX`

or `self + rhs < u16::MIN`

,
i.e. when `checked_add`

would return `None`

.

1.66.0 (const: 1.66.0) · source#### pub const fn checked_add_signed(self, rhs: i16) -> Option<Self>

#### pub const fn checked_add_signed(self, rhs: i16) -> Option<Self>

Checked addition with a signed integer. Computes `self + rhs`

,
returning `None`

if overflow occurred.

##### §Examples

Basic usage:

source#### pub const fn strict_add_signed(self, rhs: i16) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_add_signed(self, rhs: i16) -> Self

`strict_overflow_ops`

#118260)1.0.0 (const: 1.47.0) · source#### pub const fn checked_sub(self, rhs: Self) -> Option<Self>

#### pub const fn checked_sub(self, rhs: Self) -> Option<Self>

Checked integer subtraction. Computes `self - rhs`

, returning
`None`

if overflow occurred.

##### §Examples

Basic usage:

source#### pub const fn strict_sub(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_sub(self, rhs: Self) -> Self

`strict_overflow_ops`

#118260)1.79.0 (const: 1.79.0) · source#### pub const unsafe fn unchecked_sub(self, rhs: Self) -> Self

#### pub const unsafe fn unchecked_sub(self, rhs: Self) -> Self

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 > u16::MAX`

or `self - rhs < u16::MIN`

,
i.e. when `checked_sub`

would return `None`

.

source#### pub const fn checked_signed_diff(self, rhs: Self) -> Option<i16>

🔬This is a nightly-only experimental API. (`unsigned_signed_diff`

#126041)

#### pub const fn checked_signed_diff(self, rhs: Self) -> Option<i16>

`unsigned_signed_diff`

#126041)Checked integer subtraction. Computes `self - rhs`

and checks if the result fits into an `i16`

, returning `None`

if overflow occurred.

##### §Examples

Basic usage:

```
#![feature(unsigned_signed_diff)]
assert_eq!(10u16.checked_signed_diff(2), Some(8));
assert_eq!(2u16.checked_signed_diff(10), Some(-8));
assert_eq!(u16::MAX.checked_signed_diff(i16::MAX as u16), None);
assert_eq!((i16::MAX as u16).checked_signed_diff(u16::MAX), Some(i16::MIN));
assert_eq!((i16::MAX as u16 + 1).checked_signed_diff(0), None);
assert_eq!(u16::MAX.checked_signed_diff(u16::MAX), Some(0));
```

1.0.0 (const: 1.47.0) · source#### pub const fn checked_mul(self, rhs: Self) -> Option<Self>

#### pub const fn checked_mul(self, rhs: Self) -> Option<Self>

Checked integer multiplication. Computes `self * rhs`

, returning
`None`

if overflow occurred.

##### §Examples

Basic usage:

source#### pub const fn strict_mul(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_mul(self, rhs: Self) -> Self

`strict_overflow_ops`

#118260)1.79.0 (const: 1.79.0) · source#### pub const unsafe fn unchecked_mul(self, rhs: Self) -> Self

#### pub const unsafe fn unchecked_mul(self, rhs: Self) -> Self

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 > u16::MAX`

or `self * rhs < u16::MIN`

,
i.e. when `checked_mul`

would return `None`

.

1.0.0 (const: 1.52.0) · source#### pub const fn checked_div(self, rhs: Self) -> Option<Self>

#### pub const fn checked_div(self, rhs: Self) -> Option<Self>

source#### pub const fn strict_div(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_div(self, rhs: Self) -> Self

`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) · source#### pub const fn checked_div_euclid(self, rhs: Self) -> Option<Self>

#### pub const fn checked_div_euclid(self, rhs: Self) -> Option<Self>

Checked Euclidean division. Computes `self.div_euclid(rhs)`

, returning `None`

if `rhs == 0`

.

##### §Examples

Basic usage:

source#### pub const fn strict_div_euclid(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_div_euclid(self, rhs: Self) -> Self

`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) · source#### pub const fn checked_rem(self, rhs: Self) -> Option<Self>

#### pub const fn checked_rem(self, rhs: Self) -> Option<Self>

source#### pub const fn strict_rem(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_rem(self, rhs: Self) -> Self

`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) · source#### pub const fn checked_rem_euclid(self, rhs: Self) -> Option<Self>

#### pub const fn checked_rem_euclid(self, rhs: Self) -> Option<Self>

Checked Euclidean modulo. Computes `self.rem_euclid(rhs)`

, returning `None`

if `rhs == 0`

.

##### §Examples

Basic usage:

source#### pub const fn strict_rem_euclid(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_rem_euclid(self, rhs: Self) -> Self

`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) · source#### pub const fn ilog(self, base: Self) -> u32

#### pub const fn ilog(self, base: Self) -> 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) · source#### pub const fn checked_ilog(self, base: Self) -> Option<u32>

#### pub const fn checked_ilog(self, base: Self) -> 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) · source#### pub 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) · source#### pub 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) · source#### pub const fn checked_neg(self) -> Option<Self>

#### pub const fn checked_neg(self) -> Option<Self>

Checked negation. Computes `-self`

, returning `None`

unless `self == 0`

.

Note that negating any positive integer will overflow.

##### §Examples

Basic usage:

source#### pub const fn strict_neg(self) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_neg(self) -> Self

`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) · source#### pub const fn checked_shl(self, rhs: u32) -> Option<Self>

#### pub const fn checked_shl(self, rhs: u32) -> Option<Self>

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:

source#### pub const fn strict_shl(self, rhs: u32) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_shl(self, rhs: u32) -> Self

`strict_overflow_ops`

#118260)source#### pub const unsafe fn unchecked_shl(self, rhs: u32) -> Self

🔬This is a nightly-only experimental API. (`unchecked_shifts`

#85122)

#### pub const unsafe fn unchecked_shl(self, rhs: u32) -> Self

`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`

.

source#### pub const fn unbounded_shl(self, rhs: u32) -> u16

🔬This is a nightly-only experimental API. (`unbounded_shifts`

#129375)

#### pub const fn unbounded_shl(self, rhs: u32) -> u16

`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) · source#### pub const fn checked_shr(self, rhs: u32) -> Option<Self>

#### pub const fn checked_shr(self, rhs: u32) -> Option<Self>

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:

source#### pub const fn strict_shr(self, rhs: u32) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_shr(self, rhs: u32) -> Self

`strict_overflow_ops`

#118260)source#### pub const unsafe fn unchecked_shr(self, rhs: u32) -> Self

🔬This is a nightly-only experimental API. (`unchecked_shifts`

#85122)

#### pub const unsafe fn unchecked_shr(self, rhs: u32) -> Self

`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`

.

source#### pub const fn unbounded_shr(self, rhs: u32) -> u16

🔬This is a nightly-only experimental API. (`unbounded_shifts`

#129375)

#### pub const fn unbounded_shr(self, rhs: u32) -> u16

`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) · source#### pub const fn checked_pow(self, exp: u32) -> Option<Self>

#### pub const fn checked_pow(self, exp: u32) -> Option<Self>

Checked exponentiation. Computes `self.pow(exp)`

, returning `None`

if
overflow occurred.

##### §Examples

Basic usage:

source#### pub const fn strict_pow(self, exp: u32) -> Self

🔬This is a nightly-only experimental API. (`strict_overflow_ops`

#118260)

#### pub const fn strict_pow(self, exp: u32) -> Self

`strict_overflow_ops`

#118260)1.0.0 (const: 1.47.0) · source#### pub const fn saturating_add(self, rhs: Self) -> Self

#### pub const fn saturating_add(self, rhs: Self) -> Self

Saturating integer addition. Computes `self + rhs`

, saturating at
the numeric bounds instead of overflowing.

##### §Examples

Basic usage:

1.66.0 (const: 1.66.0) · source#### pub const fn saturating_add_signed(self, rhs: i16) -> Self

#### pub const fn saturating_add_signed(self, rhs: i16) -> Self

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) · source#### pub const fn saturating_sub(self, rhs: Self) -> Self

#### pub const fn saturating_sub(self, rhs: Self) -> Self

Saturating integer subtraction. Computes `self - rhs`

, saturating
at the numeric bounds instead of overflowing.

##### §Examples

Basic usage:

1.7.0 (const: 1.47.0) · source#### pub const fn saturating_mul(self, rhs: Self) -> Self

#### pub const fn saturating_mul(self, rhs: Self) -> Self

Saturating integer multiplication. Computes `self * rhs`

,
saturating at the numeric bounds instead of overflowing.

##### §Examples

Basic usage:

1.58.0 (const: 1.58.0) · source#### pub const fn saturating_div(self, rhs: Self) -> Self

#### pub const fn saturating_div(self, rhs: Self) -> Self

1.34.0 (const: 1.50.0) · source#### pub const fn saturating_pow(self, exp: u32) -> Self

#### pub const fn saturating_pow(self, exp: u32) -> Self

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) · source#### pub const fn wrapping_add(self, rhs: Self) -> Self

#### pub const fn wrapping_add(self, rhs: Self) -> Self

Wrapping (modular) addition. Computes `self + rhs`

,
wrapping around at the boundary of the type.

##### §Examples

Basic usage:

1.66.0 (const: 1.66.0) · source#### pub const fn wrapping_add_signed(self, rhs: i16) -> Self

#### pub const fn wrapping_add_signed(self, rhs: i16) -> Self

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) · source#### pub const fn wrapping_sub(self, rhs: Self) -> Self

#### pub const fn wrapping_sub(self, rhs: Self) -> Self

Wrapping (modular) subtraction. Computes `self - rhs`

,
wrapping around at the boundary of the type.

##### §Examples

Basic usage:

1.0.0 (const: 1.32.0) · source#### pub const fn wrapping_mul(self, rhs: Self) -> Self

#### pub const fn wrapping_mul(self, rhs: Self) -> Self

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) · source#### pub const fn wrapping_div(self, rhs: Self) -> Self

#### pub const fn wrapping_div(self, rhs: Self) -> Self

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) · source#### pub const fn wrapping_div_euclid(self, rhs: Self) -> Self

#### pub const fn wrapping_div_euclid(self, rhs: Self) -> Self

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) · source#### pub const fn wrapping_rem(self, rhs: Self) -> Self

#### pub const fn wrapping_rem(self, rhs: Self) -> Self

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) · source#### pub const fn wrapping_rem_euclid(self, rhs: Self) -> Self

#### pub const fn wrapping_rem_euclid(self, rhs: Self) -> Self

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) · source#### pub const fn wrapping_neg(self) -> Self

#### pub const fn wrapping_neg(self) -> Self

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) · source#### pub const fn wrapping_shl(self, rhs: u32) -> Self

#### pub const fn wrapping_shl(self, rhs: u32) -> Self

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) · source#### pub const fn wrapping_shr(self, rhs: u32) -> Self

#### pub const fn wrapping_shr(self, rhs: u32) -> Self

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) · source#### pub const fn wrapping_pow(self, exp: u32) -> Self

#### pub const fn wrapping_pow(self, exp: u32) -> Self

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) · source#### pub const fn overflowing_add(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_add(self, rhs: Self) -> (Self, 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

source#### pub const fn carrying_add(self, rhs: Self, carry: bool) -> (Self, bool)

🔬This is a nightly-only experimental API. (`bigint_helper_methods`

#85532)

#### pub const fn carrying_add(self, rhs: Self, carry: bool) -> (Self, 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 16-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^16 + 2^16 - 1)
// + 5 7 (b = 5 × 2^16 + 7)
// ---------
// 9 6 (sum = 9 × 2^16 + 6)
let (a1, a0): (u16, u16) = (3, u16::MAX);
let (b1, b0): (u16, u16) = (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) · source#### pub const fn overflowing_add_signed(self, rhs: i16) -> (Self, bool)

#### pub const fn overflowing_add_signed(self, rhs: i16) -> (Self, 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) · source#### pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_sub(self, rhs: Self) -> (Self, 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

source#### pub const fn borrowing_sub(self, rhs: Self, borrow: bool) -> (Self, bool)

🔬This is a nightly-only experimental API. (`bigint_helper_methods`

#85532)

#### pub const fn borrowing_sub(self, rhs: Self, borrow: bool) -> (Self, 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^16 + 6)
// - 5 7 (b = 5 × 2^16 + 7)
// ---------
// 3 MAX (diff = 3 × 2^16 + 2^16 - 1)
let (a1, a0): (u16, u16) = (9, 6);
let (b1, b0): (u16, u16) = (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, u16::MAX));
```

1.60.0 (const: 1.60.0) · source#### pub const fn abs_diff(self, other: Self) -> Self

#### pub const fn abs_diff(self, other: Self) -> Self

1.7.0 (const: 1.32.0) · source#### pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_mul(self, rhs: Self) -> (Self, 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) · source#### pub const fn overflowing_div(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_div(self, rhs: Self) -> (Self, 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) · source#### pub const fn overflowing_div_euclid(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_div_euclid(self, rhs: Self) -> (Self, 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) · source#### pub const fn overflowing_rem(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_rem(self, rhs: Self) -> (Self, 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) · source#### pub const fn overflowing_rem_euclid(self, rhs: Self) -> (Self, bool)

#### pub const fn overflowing_rem_euclid(self, rhs: Self) -> (Self, 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) · source#### pub const fn overflowing_neg(self) -> (Self, bool)

#### pub const fn overflowing_neg(self) -> (Self, 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) · source#### pub const fn overflowing_shl(self, rhs: u32) -> (Self, bool)

#### pub const fn overflowing_shl(self, rhs: u32) -> (Self, 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) · source#### pub const fn overflowing_shr(self, rhs: u32) -> (Self, bool)

#### pub const fn overflowing_shr(self, rhs: u32) -> (Self, 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) · source#### pub const fn overflowing_pow(self, exp: u32) -> (Self, bool)

#### pub const fn overflowing_pow(self, exp: u32) -> (Self, 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) · source#### pub const fn pow(self, exp: u32) -> Self

#### pub const fn pow(self, exp: u32) -> Self

source#### pub const fn isqrt(self) -> Self

🔬This is a nightly-only experimental API. (`isqrt`

#116226)

#### pub const fn isqrt(self) -> Self

`isqrt`

#116226)1.38.0 (const: 1.52.0) · source#### pub const fn div_euclid(self, rhs: Self) -> Self

#### pub const fn div_euclid(self, rhs: Self) -> Self

1.38.0 (const: 1.52.0) · source#### pub const fn rem_euclid(self, rhs: Self) -> Self

#### pub const fn rem_euclid(self, rhs: Self) -> Self

source#### pub const fn div_floor(self, rhs: Self) -> Self

🔬This is a nightly-only experimental API. (`int_roundings`

#88581)

#### pub const fn div_floor(self, rhs: Self) -> Self

`int_roundings`

#88581)1.73.0 (const: 1.73.0) · source#### pub const fn next_multiple_of(self, rhs: Self) -> Self

#### pub const fn next_multiple_of(self, rhs: Self) -> Self

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) · source#### pub const fn checked_next_multiple_of(self, rhs: Self) -> Option<Self>

#### pub const fn checked_next_multiple_of(self, rhs: Self) -> Option<Self>

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:

source#### pub const fn is_multiple_of(self, rhs: Self) -> bool

🔬This is a nightly-only experimental API. (`unsigned_is_multiple_of`

#128101)

#### pub const fn is_multiple_of(self, rhs: Self) -> 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) · source#### pub const fn is_power_of_two(self) -> bool

#### pub const fn is_power_of_two(self) -> bool

1.0.0 (const: 1.50.0) · source#### pub const fn next_power_of_two(self) -> Self

#### pub const fn next_power_of_two(self) -> Self

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) · source#### pub const fn checked_next_power_of_two(self) -> Option<Self>

#### pub const fn checked_next_power_of_two(self) -> Option<Self>

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:

source#### pub const fn wrapping_next_power_of_two(self) -> Self

🔬This is a nightly-only experimental API. (`wrapping_next_power_of_two`

#32463)

#### pub const fn wrapping_next_power_of_two(self) -> Self

`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) · source#### pub const fn to_be_bytes(self) -> [u8; 2]

#### pub const fn to_be_bytes(self) -> [u8; 2]

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) · source#### pub const fn to_le_bytes(self) -> [u8; 2]

#### pub const fn to_le_bytes(self) -> [u8; 2]

Returns the memory representation of this integer as a byte array in little-endian byte order.

##### §Examples

1.32.0 (const: 1.44.0) · source#### pub const fn to_ne_bytes(self) -> [u8; 2]

#### pub const fn to_ne_bytes(self) -> [u8; 2]

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) · source#### pub const fn from_be_bytes(bytes: [u8; 2]) -> Self

#### pub const fn from_be_bytes(bytes: [u8; 2]) -> Self

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) · source#### pub const fn from_le_bytes(bytes: [u8; 2]) -> Self

#### pub const fn from_le_bytes(bytes: [u8; 2]) -> Self

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) · source#### pub const fn from_ne_bytes(bytes: [u8; 2]) -> Self

#### pub const fn from_ne_bytes(bytes: [u8; 2]) -> Self

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 = u16::from_ne_bytes(if cfg!(target_endian = "big") {
[0x12, 0x34]
} else {
[0x34, 0x12]
});
assert_eq!(value, 0x1234);
```

When starting from a slice rather than an array, fallible conversion APIs can be used:

1.0.0 (const: 1.32.0) · source#### pub const fn min_value() -> Self

👎Deprecating in a future version: replaced by the `MIN`

associated constant on this type

#### pub const fn min_value() -> Self

`MIN`

associated constant on this typeNew code should prefer to use
`u16::MIN`

instead.

Returns the smallest value that can be represented by this integer type.

1.0.0 (const: 1.32.0) · source#### pub const fn max_value() -> Self

👎Deprecating in a future version: replaced by the `MAX`

associated constant on this type

#### pub const fn max_value() -> Self

`MAX`

associated constant on this typeNew code should prefer to use
`u16::MAX`

instead.

Returns the largest value that can be represented by this integer type.

source#### pub const fn widening_mul(self, rhs: Self) -> (Self, Self)

🔬This is a nightly-only experimental API. (`bigint_helper_methods`

#85532)

#### pub const fn widening_mul(self, rhs: Self) -> (Self, Self)

`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.

source#### pub const fn carrying_mul(self, rhs: Self, carry: Self) -> (Self, Self)

🔬This is a nightly-only experimental API. (`bigint_helper_methods`

#85532)

#### pub const fn carrying_mul(self, rhs: Self, carry: Self) -> (Self, Self)

`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!(u16::MAX.carrying_mul(u16::MAX, u16::MAX), (0, u16::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:

source#### pub const fn midpoint(self, rhs: u16) -> u16

🔬This is a nightly-only experimental API. (`num_midpoint`

#110840)

#### pub const fn midpoint(self, rhs: u16) -> u16

`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

source#### pub const fn is_utf16_surrogate(self) -> bool

🔬This is a nightly-only experimental API. (`utf16_extra`

#94919)

#### pub const fn is_utf16_surrogate(self) -> bool

`utf16_extra`

#94919)Checks if the value is a Unicode surrogate code point, which are disallowed values for `char`

.

##### §Examples

```
#![feature(utf16_extra)]
let low_non_surrogate = 0xA000u16;
let low_surrogate = 0xD800u16;
let high_surrogate = 0xDC00u16;
let high_non_surrogate = 0xE000u16;
assert!(!low_non_surrogate.is_utf16_surrogate());
assert!(low_surrogate.is_utf16_surrogate());
assert!(high_surrogate.is_utf16_surrogate());
assert!(!high_non_surrogate.is_utf16_surrogate());
```

source§### impl u16

### impl u16

1.0.0 (const: 1.82.0) · source#### pub const fn from_str_radix(src: &str, radix: u32) -> Result<u16, ParseIntError>

#### pub const fn from_str_radix(src: &str, radix: u32) -> Result<u16, 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<&u16> for Saturating<u16>

### impl AddAssign<&u16> for Saturating<u16>

source§#### fn add_assign(&mut self, other: &u16)

#### fn add_assign(&mut self, other: &u16)

`+=`

operation. Read more1.22.0 · source§### impl AddAssign<&u16> for Wrapping<u16>

### impl AddAssign<&u16> for Wrapping<u16>

source§#### fn add_assign(&mut self, other: &u16)

#### fn add_assign(&mut self, other: &u16)

`+=`

operation. Read more1.22.0 · source§### impl AddAssign<&u16> for u16

### impl AddAssign<&u16> for u16

source§#### fn add_assign(&mut self, other: &u16)

#### fn add_assign(&mut self, other: &u16)

`+=`

operation. Read more1.74.0 · source§### impl AddAssign<u16> for Saturating<u16>

### impl AddAssign<u16> for Saturating<u16>

source§#### fn add_assign(&mut self, other: u16)

#### fn add_assign(&mut self, other: u16)

`+=`

operation. Read more1.60.0 · source§### impl AddAssign<u16> for Wrapping<u16>

### impl AddAssign<u16> for Wrapping<u16>

source§#### fn add_assign(&mut self, other: u16)

#### fn add_assign(&mut self, other: u16)

`+=`

operation. Read more1.8.0 · source§### impl AddAssign for u16

### impl AddAssign for u16

source§#### fn add_assign(&mut self, other: u16)

#### fn add_assign(&mut self, other: u16)

`+=`

operation. Read more1.22.0 · source§### impl BitAndAssign<&u16> for Saturating<u16>

### impl BitAndAssign<&u16> for Saturating<u16>

source§#### fn bitand_assign(&mut self, other: &u16)

#### fn bitand_assign(&mut self, other: &u16)

`&=`

operation. Read more1.22.0 · source§### impl BitAndAssign<&u16> for Wrapping<u16>

### impl BitAndAssign<&u16> for Wrapping<u16>

source§#### fn bitand_assign(&mut self, other: &u16)

#### fn bitand_assign(&mut self, other: &u16)

`&=`

operation. Read more1.22.0 · source§### impl BitAndAssign<&u16> for u16

### impl BitAndAssign<&u16> for u16

source§#### fn bitand_assign(&mut self, other: &u16)

#### fn bitand_assign(&mut self, other: &u16)

`&=`

operation. Read more1.74.0 · source§### impl BitAndAssign<u16> for Saturating<u16>

### impl BitAndAssign<u16> for Saturating<u16>

source§#### fn bitand_assign(&mut self, other: u16)

#### fn bitand_assign(&mut self, other: u16)

`&=`

operation. Read more1.60.0 · source§### impl BitAndAssign<u16> for Wrapping<u16>

### impl BitAndAssign<u16> for Wrapping<u16>

source§#### fn bitand_assign(&mut self, other: u16)

#### fn bitand_assign(&mut self, other: u16)

`&=`

operation. Read more1.8.0 · source§### impl BitAndAssign for u16

### impl BitAndAssign for u16

source§#### fn bitand_assign(&mut self, other: u16)

#### fn bitand_assign(&mut self, other: u16)

`&=`

operation. Read more1.22.0 · source§### impl BitOrAssign<&u16> for Saturating<u16>

### impl BitOrAssign<&u16> for Saturating<u16>

source§#### fn bitor_assign(&mut self, other: &u16)

#### fn bitor_assign(&mut self, other: &u16)

`|=`

operation. Read more1.22.0 · source§### impl BitOrAssign<&u16> for Wrapping<u16>

### impl BitOrAssign<&u16> for Wrapping<u16>

source§#### fn bitor_assign(&mut self, other: &u16)

#### fn bitor_assign(&mut self, other: &u16)

`|=`

operation. Read more1.22.0 · source§### impl BitOrAssign<&u16> for u16

### impl BitOrAssign<&u16> for u16

source§#### fn bitor_assign(&mut self, other: &u16)

#### fn bitor_assign(&mut self, other: &u16)

`|=`

operation. Read more1.74.0 · source§### impl BitOrAssign<u16> for Saturating<u16>

### impl BitOrAssign<u16> for Saturating<u16>

source§#### fn bitor_assign(&mut self, other: u16)

#### fn bitor_assign(&mut self, other: u16)

`|=`

operation. Read more1.60.0 · source§### impl BitOrAssign<u16> for Wrapping<u16>

### impl BitOrAssign<u16> for Wrapping<u16>

source§#### fn bitor_assign(&mut self, other: u16)

#### fn bitor_assign(&mut self, other: u16)

`|=`

operation. Read more1.8.0 · source§### impl BitOrAssign for u16

### impl BitOrAssign for u16

source§#### fn bitor_assign(&mut self, other: u16)

#### fn bitor_assign(&mut self, other: u16)

`|=`

operation. Read more1.22.0 · source§### impl BitXorAssign<&u16> for Saturating<u16>

### impl BitXorAssign<&u16> for Saturating<u16>

source§#### fn bitxor_assign(&mut self, other: &u16)

#### fn bitxor_assign(&mut self, other: &u16)

`^=`

operation. Read more1.22.0 · source§### impl BitXorAssign<&u16> for Wrapping<u16>

### impl BitXorAssign<&u16> for Wrapping<u16>

source§#### fn bitxor_assign(&mut self, other: &u16)

#### fn bitxor_assign(&mut self, other: &u16)

`^=`

operation. Read more1.22.0 · source§### impl BitXorAssign<&u16> for u16

### impl BitXorAssign<&u16> for u16

source§#### fn bitxor_assign(&mut self, other: &u16)

#### fn bitxor_assign(&mut self, other: &u16)

`^=`

operation. Read more1.74.0 · source§### impl BitXorAssign<u16> for Saturating<u16>

### impl BitXorAssign<u16> for Saturating<u16>

source§#### fn bitxor_assign(&mut self, other: u16)

#### fn bitxor_assign(&mut self, other: u16)

`^=`

operation. Read more1.60.0 · source§### impl BitXorAssign<u16> for Wrapping<u16>

### impl BitXorAssign<u16> for Wrapping<u16>

source§#### fn bitxor_assign(&mut self, other: u16)

#### fn bitxor_assign(&mut self, other: u16)

`^=`

operation. Read more1.8.0 · source§### impl BitXorAssign for u16

### impl BitXorAssign for u16

source§#### fn bitxor_assign(&mut self, other: u16)

#### fn bitxor_assign(&mut self, other: u16)

`^=`

operation. Read more1.6.0 · source§### impl Div for u16

### impl Div for u16

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<&u16> for Saturating<u16>

### impl DivAssign<&u16> for Saturating<u16>

source§#### fn div_assign(&mut self, other: &u16)

#### fn div_assign(&mut self, other: &u16)

`/=`

operation. Read more1.22.0 · source§### impl DivAssign<&u16> for Wrapping<u16>

### impl DivAssign<&u16> for Wrapping<u16>

source§#### fn div_assign(&mut self, other: &u16)

#### fn div_assign(&mut self, other: &u16)

`/=`

operation. Read more1.22.0 · source§### impl DivAssign<&u16> for u16

### impl DivAssign<&u16> for u16

source§#### fn div_assign(&mut self, other: &u16)

#### fn div_assign(&mut self, other: &u16)

`/=`

operation. Read more1.79.0 · source§### impl DivAssign<NonZero<u16>> for u16

### impl DivAssign<NonZero<u16>> for u16

source§#### fn div_assign(&mut self, other: NonZero<u16>)

#### fn div_assign(&mut self, other: NonZero<u16>)

This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.

1.74.0 · source§### impl DivAssign<u16> for Saturating<u16>

### impl DivAssign<u16> for Saturating<u16>

source§#### fn div_assign(&mut self, other: u16)

#### fn div_assign(&mut self, other: u16)

`/=`

operation. Read more1.60.0 · source§### impl DivAssign<u16> for Wrapping<u16>

### impl DivAssign<u16> for Wrapping<u16>

source§#### fn div_assign(&mut self, other: u16)

#### fn div_assign(&mut self, other: u16)

`/=`

operation. Read more1.8.0 · source§### impl DivAssign for u16

### impl DivAssign for u16

source§#### fn div_assign(&mut self, other: u16)

#### fn div_assign(&mut self, other: u16)

`/=`

operation. Read more1.22.0 · source§### impl MulAssign<&u16> for Saturating<u16>

### impl MulAssign<&u16> for Saturating<u16>

source§#### fn mul_assign(&mut self, other: &u16)

#### fn mul_assign(&mut self, other: &u16)

`*=`

operation. Read more1.22.0 · source§### impl MulAssign<&u16> for Wrapping<u16>

### impl MulAssign<&u16> for Wrapping<u16>

source§#### fn mul_assign(&mut self, other: &u16)

#### fn mul_assign(&mut self, other: &u16)

`*=`

operation. Read more1.22.0 · source§### impl MulAssign<&u16> for u16

### impl MulAssign<&u16> for u16

source§#### fn mul_assign(&mut self, other: &u16)

#### fn mul_assign(&mut self, other: &u16)

`*=`

operation. Read more1.74.0 · source§### impl MulAssign<u16> for Saturating<u16>

### impl MulAssign<u16> for Saturating<u16>

source§#### fn mul_assign(&mut self, other: u16)

#### fn mul_assign(&mut self, other: u16)

`*=`

operation. Read more1.60.0 · source§### impl MulAssign<u16> for Wrapping<u16>

### impl MulAssign<u16> for Wrapping<u16>

source§#### fn mul_assign(&mut self, other: u16)

#### fn mul_assign(&mut self, other: u16)

`*=`

operation. Read more1.8.0 · source§### impl MulAssign for u16

### impl MulAssign for u16

source§#### fn mul_assign(&mut self, other: u16)

#### fn mul_assign(&mut self, other: u16)

`*=`

operation. Read more1.6.0 · source§### impl Ord for u16

### impl Ord for u16

1.6.0 · source§### impl PartialOrd for u16

### impl PartialOrd for u16

source§### impl Random for u16

### impl Random for u16

source§#### fn random(source: &mut (impl RandomSource + ?Sized)) -> Self

🔬This is a nightly-only experimental API. (`random`

#130703)

#### fn random(source: &mut (impl RandomSource + ?Sized)) -> Self

`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.6.0 · source§### impl Rem for u16

### impl Rem for u16

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<&u16> for Saturating<u16>

### impl RemAssign<&u16> for Saturating<u16>

source§#### fn rem_assign(&mut self, other: &u16)

#### fn rem_assign(&mut self, other: &u16)

`%=`

operation. Read more1.22.0 · source§### impl RemAssign<&u16> for Wrapping<u16>

### impl RemAssign<&u16> for Wrapping<u16>

source§#### fn rem_assign(&mut self, other: &u16)

#### fn rem_assign(&mut self, other: &u16)

`%=`

operation. Read more1.22.0 · source§### impl RemAssign<&u16> for u16

### impl RemAssign<&u16> for u16

source§#### fn rem_assign(&mut self, other: &u16)

#### fn rem_assign(&mut self, other: &u16)

`%=`

operation. Read more1.79.0 · source§### impl RemAssign<NonZero<u16>> for u16

### impl RemAssign<NonZero<u16>> for u16

source§#### fn rem_assign(&mut self, other: NonZero<u16>)

#### fn rem_assign(&mut self, other: NonZero<u16>)

This operation satisfies `n % d == n - (n / d) * d`

, and cannot panic.

1.74.0 · source§### impl RemAssign<u16> for Saturating<u16>

### impl RemAssign<u16> for Saturating<u16>

source§#### fn rem_assign(&mut self, other: u16)

#### fn rem_assign(&mut self, other: u16)

`%=`

operation. Read more1.60.0 · source§### impl RemAssign<u16> for Wrapping<u16>

### impl RemAssign<u16> for Wrapping<u16>

source§#### fn rem_assign(&mut self, other: u16)

#### fn rem_assign(&mut self, other: u16)

`%=`

operation. Read more1.8.0 · source§### impl RemAssign for u16

### impl RemAssign for u16

source§#### fn rem_assign(&mut self, other: u16)

#### fn rem_assign(&mut self, other: u16)

`%=`

operation. Read moresource§### impl<'lhs, const N: usize> Shl<&u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

### impl<'lhs, const N: usize> Shl<&u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

source§### impl<'lhs, const N: usize> Shl<u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

### impl<'lhs, const N: usize> Shl<u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

1.22.0 · source§### impl ShlAssign<&i128> for u16

### impl ShlAssign<&i128> for u16

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 u16

### impl ShlAssign<&i16> for u16

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 u16

### impl ShlAssign<&i32> for u16

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 u16

### impl ShlAssign<&i64> for u16

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 u16

### impl ShlAssign<&i8> for u16

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 u16

### impl ShlAssign<&isize> for u16

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 u16

### impl ShlAssign<&u128> for u16

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 i128

### impl ShlAssign<&u16> for i128

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for i16

### impl ShlAssign<&u16> for i16

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for i32

### impl ShlAssign<&u16> for i32

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for i64

### impl ShlAssign<&u16> for i64

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for i8

### impl ShlAssign<&u16> for i8

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for isize

### impl ShlAssign<&u16> for isize

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for u128

### impl ShlAssign<&u16> for u128

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for u16

### impl ShlAssign<&u16> for u16

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

operation. Read more1.22.0 · source§### impl ShlAssign<&u16> for u32

### impl ShlAssign<&u16> for u32

source§#### fn shl_assign(&mut self, other: &u16)

#### fn shl_assign(&mut self, other: &u16)

`<<=`

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<&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<&u16> for usize

### impl ShlAssign<&u16> for usize

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 u16

### impl ShlAssign<&u32> for u16

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 u16

### impl ShlAssign<&u64> for u16

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 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<&usize> for u16

### impl ShlAssign<&usize> for u16

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 u16

### impl ShlAssign<i128> for u16

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 u16

### impl ShlAssign<i16> for u16

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 u16

### impl ShlAssign<i32> for u16

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 u16

### impl ShlAssign<i64> for u16

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 u16

### impl ShlAssign<i8> for u16

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 u16

### impl ShlAssign<isize> for u16

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 u16

### impl ShlAssign<u128> for u16

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 i128

### impl ShlAssign<u16> for i128

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for i16

### impl ShlAssign<u16> for i16

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for i32

### impl ShlAssign<u16> for i32

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for i64

### impl ShlAssign<u16> for i64

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for i8

### impl ShlAssign<u16> for i8

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for isize

### impl ShlAssign<u16> for isize

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for u128

### impl ShlAssign<u16> for u128

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign<u16> for u32

### impl ShlAssign<u16> for u32

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

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<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<u16> for usize

### impl ShlAssign<u16> for usize

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 u16

### impl ShlAssign<u32> for u16

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 u16

### impl ShlAssign<u64> for u16

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 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<usize> for u16

### impl ShlAssign<usize> for u16

source§#### fn shl_assign(&mut self, other: usize)

#### fn shl_assign(&mut self, other: usize)

`<<=`

operation. Read more1.8.0 · source§### impl ShlAssign for u16

### impl ShlAssign for u16

source§#### fn shl_assign(&mut self, other: u16)

#### fn shl_assign(&mut self, other: u16)

`<<=`

operation. Read moresource§### impl<'lhs, const N: usize> Shr<&u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

### impl<'lhs, const N: usize> Shr<&u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

source§### impl<'lhs, const N: usize> Shr<u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

### impl<'lhs, const N: usize> Shr<u16> for &'lhs Simd<u16, N>where
LaneCount<N>: SupportedLaneCount,

1.22.0 · source§### impl ShrAssign<&i128> for u16

### impl ShrAssign<&i128> for u16

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 u16

### impl ShrAssign<&i16> for u16

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 u16

### impl ShrAssign<&i32> for u16

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 u16

### impl ShrAssign<&i64> for u16

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 u16

### impl ShrAssign<&i8> for u16

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 u16

### impl ShrAssign<&isize> for u16

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 u16

### impl ShrAssign<&u128> for u16

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 i128

### impl ShrAssign<&u16> for i128

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for i16

### impl ShrAssign<&u16> for i16

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for i32

### impl ShrAssign<&u16> for i32

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for i64

### impl ShrAssign<&u16> for i64

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for i8

### impl ShrAssign<&u16> for i8

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for isize

### impl ShrAssign<&u16> for isize

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for u128

### impl ShrAssign<&u16> for u128

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for u16

### impl ShrAssign<&u16> for u16

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

operation. Read more1.22.0 · source§### impl ShrAssign<&u16> for u32

### impl ShrAssign<&u16> for u32

source§#### fn shr_assign(&mut self, other: &u16)

#### fn shr_assign(&mut self, other: &u16)

`>>=`

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<&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<&u16> for usize

### impl ShrAssign<&u16> for usize

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 u16

### impl ShrAssign<&u32> for u16

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 u16

### impl ShrAssign<&u64> for u16

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 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<&usize> for u16

### impl ShrAssign<&usize> for u16

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 u16

### impl ShrAssign<i128> for u16

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 u16

### impl ShrAssign<i16> for u16

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 u16

### impl ShrAssign<i32> for u16

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 u16

### impl ShrAssign<i64> for u16

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 u16

### impl ShrAssign<i8> for u16

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 u16

### impl ShrAssign<isize> for u16

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 u16

### impl ShrAssign<u128> for u16

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 i128

### impl ShrAssign<u16> for i128

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for i16

### impl ShrAssign<u16> for i16

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for i32

### impl ShrAssign<u16> for i32

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for i64

### impl ShrAssign<u16> for i64

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for i8

### impl ShrAssign<u16> for i8

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for isize

### impl ShrAssign<u16> for isize

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for u128

### impl ShrAssign<u16> for u128

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign<u16> for u32

### impl ShrAssign<u16> for u32

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

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<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<u16> for usize

### impl ShrAssign<u16> for usize

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 u16

### impl ShrAssign<u32> for u16

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 u16

### impl ShrAssign<u64> for u16

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 u16

### impl ShrAssign<u8> for u16

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 u16

### impl ShrAssign<usize> for u16

source§#### fn shr_assign(&mut self, other: usize)

#### fn shr_assign(&mut self, other: usize)

`>>=`

operation. Read more1.8.0 · source§### impl ShrAssign for u16

### impl ShrAssign for u16

source§#### fn shr_assign(&mut self, other: u16)

#### fn shr_assign(&mut self, other: u16)

`>>=`

operation. Read moresource§### impl SimdElement for u16

### impl SimdElement for u16

source§### impl Step for u16

### impl Step for u16

source§#### fn forward(start: Self, n: usize) -> Self

#### fn forward(start: Self, n: usize) -> Self

`step_trait`

#42168)source§#### fn backward(start: Self, n: usize) -> Self

#### fn backward(start: Self, n: usize) -> Self

`step_trait`

#42168)source§#### unsafe fn forward_unchecked(start: Self, n: usize) -> Self

#### unsafe fn forward_unchecked(start: Self, n: usize) -> Self

`step_trait`

#42168)source§#### unsafe fn backward_unchecked(start: Self, n: usize) -> Self

#### unsafe fn backward_unchecked(start: Self, n: usize) -> Self

`step_trait`

#42168)source§#### fn steps_between(start: &Self, end: &Self) -> Option<usize>

#### fn steps_between(start: &Self, end: &Self) -> Option<usize>

`step_trait`

#42168)1.22.0 · source§### impl SubAssign<&u16> for Saturating<u16>

### impl SubAssign<&u16> for Saturating<u16>

source§#### fn sub_assign(&mut self, other: &u16)

#### fn sub_assign(&mut self, other: &u16)

`-=`

operation. Read more1.22.0 · source§### impl SubAssign<&u16> for Wrapping<u16>

### impl SubAssign<&u16> for Wrapping<u16>

source§#### fn sub_assign(&mut self, other: &u16)

#### fn sub_assign(&mut self, other: &u16)

`-=`

operation. Read more1.22.0 · source§### impl SubAssign<&u16> for u16

### impl SubAssign<&u16> for u16

source§#### fn sub_assign(&mut self, other: &u16)

#### fn sub_assign(&mut self, other: &u16)

`-=`

operation. Read more1.74.0 · source§### impl SubAssign<u16> for Saturating<u16>

### impl SubAssign<u16> for Saturating<u16>

source§#### fn sub_assign(&mut self, other: u16)

#### fn sub_assign(&mut self, other: u16)

`-=`

operation. Read more1.60.0 · source§### impl SubAssign<u16> for Wrapping<u16>

### impl SubAssign<u16> for Wrapping<u16>

source§#### fn sub_assign(&mut self, other: u16)

#### fn sub_assign(&mut self, other: u16)

`-=`

operation. Read more1.8.0 · source§### impl SubAssign for u16

### impl SubAssign for u16

source§#### fn sub_assign(&mut self, other: u16)

#### fn sub_assign(&mut self, other: u16)

`-=`

operation. Read more1.74.0 · source§### impl TryFrom<char> for u16

### impl TryFrom<char> for u16

Maps a `char`

with code point in U+0000..=U+FFFF to a `u16`

in 0x0000..=0xFFFF with same value,
failing if the code point is greater than U+FFFF.

This corresponds to the UCS-2 encoding, as specified in ISO/IEC 10646:2003.