pub struct NonZero<T>(/* private fields */)
where
T: ZeroablePrimitive;
std
only.Expand description
A value that is known not to equal zero.
This enables some memory layout optimization.
For example, Option<NonZero<u32>>
is the same size as u32
:
use core::{mem::size_of, num::NonZero};
assert_eq!(size_of::<Option<NonZero<u32>>>(), size_of::<u32>());
Implementations§
Source§impl<T> NonZero<T>where
T: ZeroablePrimitive,
impl<T> NonZero<T>where
T: ZeroablePrimitive,
1.28.0 (const: 1.47.0) · Sourcepub const fn new(n: T) -> Option<NonZero<T>> ⓘ
pub const fn new(n: T) -> Option<NonZero<T>> ⓘ
Creates a non-zero if the given value is not zero.
1.28.0 (const: 1.28.0) · Sourcepub const unsafe fn new_unchecked(n: T) -> NonZero<T>
pub const unsafe fn new_unchecked(n: T) -> NonZero<T>
Creates a non-zero without checking whether the value is non-zero. This results in undefined behavior if the value is zero.
§Safety
The value must not be zero.
Sourcepub fn from_mut(n: &mut T) -> Option<&mut NonZero<T>> ⓘ
🔬This is a nightly-only experimental API. (nonzero_from_mut
)
pub fn from_mut(n: &mut T) -> Option<&mut NonZero<T>> ⓘ
nonzero_from_mut
)Converts a reference to a non-zero mutable reference if the referenced value is not zero.
Sourcepub unsafe fn from_mut_unchecked(n: &mut T) -> &mut NonZero<T>
🔬This is a nightly-only experimental API. (nonzero_from_mut
)
pub unsafe fn from_mut_unchecked(n: &mut T) -> &mut NonZero<T>
nonzero_from_mut
)Converts a mutable reference to a non-zero mutable reference without checking whether the referenced value is non-zero. This results in undefined behavior if the referenced value is zero.
§Safety
The referenced value must not be zero.
Source§impl NonZero<u8>
impl NonZero<u8>
1.70.0 · Sourcepub const MIN: NonZero<u8>
pub const MIN: NonZero<u8>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<u8>::MIN.get(), 1u8);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u8>::new(u8::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u8>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<u8>::new(0b100_0000)?;
let b = NonZero::<u8>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x82u8)?;
let m = NonZero::new(0xa)?;
assert_eq!(n.rotate_left(2), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xau8)?;
let m = NonZero::new(0x82)?;
assert_eq!(n.rotate_right(2), m);
Sourcepub const fn swap_bytes(self) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<u8>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12u8)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x12)?);
Sourcepub const fn reverse_bits(self) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12u8)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x48)?);
Sourcepub const fn from_be(x: NonZero<u8>) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<u8>) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU8;
let n = NonZero::new(0x1Au8)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroU8::from_be(n), n)
} else {
assert_eq!(NonZeroU8::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<u8>) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<u8>) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU8;
let n = NonZero::new(0x1Au8)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroU8::from_le(n), n)
} else {
assert_eq!(NonZeroU8::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au8)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<u8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au8)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: u8) -> Option<NonZero<u8>> ⓘ
pub const fn checked_add(self, other: u8) -> Option<NonZero<u8>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1u8)?;
let two = NonZero::new(2u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: u8) -> NonZero<u8>
pub const fn saturating_add(self, other: u8) -> NonZero<u8>
Adds an unsigned integer to a non-zero value.
Return NonZero::<u8>::MAX
on overflow.
§Examples
let one = NonZero::new(1u8)?;
let two = NonZero::new(2u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: u8) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: u8) -> NonZero<u8>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > u8::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1u8)?;
let two = NonZero::new(2u8)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<u8>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<u8>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u8)?;
let three = NonZero::new(3u8)?;
let four = NonZero::new(4u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
u8::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7u8)?.ilog2(), 2);
assert_eq!(NonZero::new(8u8)?.ilog2(), 3);
assert_eq!(NonZero::new(9u8)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
u8::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99u8)?.ilog10(), 1);
assert_eq!(NonZero::new(100u8)?.ilog10(), 2);
assert_eq!(NonZero::new(101u8)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<u8>) -> NonZero<u8>
pub const fn midpoint(self, rhs: NonZero<u8>) -> NonZero<u8>
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
let one = NonZero::new(1u8)?;
let two = NonZero::new(2u8)?;
let four = NonZero::new(4u8)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8u8)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10u8)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<u8>
pub const fn isqrt(self) -> NonZero<u8>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10u8)?;
let three = NonZero::new(3u8)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<u8>) -> Option<NonZero<u8>> ⓘ
pub const fn checked_mul(self, other: NonZero<u8>) -> Option<NonZero<u8>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u8)?;
let four = NonZero::new(4u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<u8>) -> NonZero<u8>
pub const fn saturating_mul(self, other: NonZero<u8>) -> NonZero<u8>
Multiplies two non-zero integers together.
Return NonZero::<u8>::MAX
on overflow.
§Examples
let two = NonZero::new(2u8)?;
let four = NonZero::new(4u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<u8>) -> NonZero<u8>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<u8>) -> NonZero<u8>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > u8::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2u8)?;
let four = NonZero::new(4u8)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<u8>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<u8>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3u8)?;
let twenty_seven = NonZero::new(27u8)?;
let half_max = NonZero::new(u8::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<u8>
pub const fn saturating_pow(self, other: u32) -> NonZero<u8>
Raise non-zero value to an integer power.
Return NonZero::<u8>::MAX
on overflow.
§Examples
let three = NonZero::new(3u8)?;
let twenty_seven = NonZero::new(27u8)?;
let max = NonZero::new(u8::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<u8>
impl NonZero<u8>
Sourcepub const fn div_ceil(self, rhs: NonZero<u8>) -> NonZero<u8>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<u8>) -> NonZero<u8>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1u8).unwrap();
let max = NonZero::new(u8::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2u8).unwrap();
let three = NonZero::new(3u8).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<u16>
impl NonZero<u16>
1.70.0 · Sourcepub const MIN: NonZero<u16>
pub const MIN: NonZero<u16>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<u16>::MIN.get(), 1u16);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u16>::new(u16::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u16>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<u16>::new(0b100_0000)?;
let b = NonZero::<u16>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xa003u16)?;
let m = NonZero::new(0x3a)?;
assert_eq!(n.rotate_left(4), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x3au16)?;
let m = NonZero::new(0xa003)?;
assert_eq!(n.rotate_right(4), m);
Sourcepub const fn swap_bytes(self) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<u16>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234u16)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x3412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234u16)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x2c48)?);
Sourcepub const fn from_be(x: NonZero<u16>) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<u16>) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU16;
let n = NonZero::new(0x1Au16)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroU16::from_be(n), n)
} else {
assert_eq!(NonZeroU16::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<u16>) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<u16>) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU16;
let n = NonZero::new(0x1Au16)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroU16::from_le(n), n)
} else {
assert_eq!(NonZeroU16::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au16)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<u16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au16)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: u16) -> Option<NonZero<u16>> ⓘ
pub const fn checked_add(self, other: u16) -> Option<NonZero<u16>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1u16)?;
let two = NonZero::new(2u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: u16) -> NonZero<u16>
pub const fn saturating_add(self, other: u16) -> NonZero<u16>
Adds an unsigned integer to a non-zero value.
Return NonZero::<u16>::MAX
on overflow.
§Examples
let one = NonZero::new(1u16)?;
let two = NonZero::new(2u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: u16) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: u16) -> NonZero<u16>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > u16::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1u16)?;
let two = NonZero::new(2u16)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<u16>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<u16>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u16)?;
let three = NonZero::new(3u16)?;
let four = NonZero::new(4u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
u16::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7u16)?.ilog2(), 2);
assert_eq!(NonZero::new(8u16)?.ilog2(), 3);
assert_eq!(NonZero::new(9u16)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
u16::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99u16)?.ilog10(), 1);
assert_eq!(NonZero::new(100u16)?.ilog10(), 2);
assert_eq!(NonZero::new(101u16)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<u16>) -> NonZero<u16>
pub const fn midpoint(self, rhs: NonZero<u16>) -> NonZero<u16>
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
let one = NonZero::new(1u16)?;
let two = NonZero::new(2u16)?;
let four = NonZero::new(4u16)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8u16)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10u16)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<u16>
pub const fn isqrt(self) -> NonZero<u16>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10u16)?;
let three = NonZero::new(3u16)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<u16>) -> Option<NonZero<u16>> ⓘ
pub const fn checked_mul(self, other: NonZero<u16>) -> Option<NonZero<u16>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u16)?;
let four = NonZero::new(4u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<u16>) -> NonZero<u16>
pub const fn saturating_mul(self, other: NonZero<u16>) -> NonZero<u16>
Multiplies two non-zero integers together.
Return NonZero::<u16>::MAX
on overflow.
§Examples
let two = NonZero::new(2u16)?;
let four = NonZero::new(4u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<u16>) -> NonZero<u16>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<u16>) -> NonZero<u16>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > u16::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2u16)?;
let four = NonZero::new(4u16)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<u16>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<u16>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3u16)?;
let twenty_seven = NonZero::new(27u16)?;
let half_max = NonZero::new(u16::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<u16>
pub const fn saturating_pow(self, other: u32) -> NonZero<u16>
Raise non-zero value to an integer power.
Return NonZero::<u16>::MAX
on overflow.
§Examples
let three = NonZero::new(3u16)?;
let twenty_seven = NonZero::new(27u16)?;
let max = NonZero::new(u16::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<u16>
impl NonZero<u16>
Sourcepub const fn div_ceil(self, rhs: NonZero<u16>) -> NonZero<u16>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<u16>) -> NonZero<u16>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1u16).unwrap();
let max = NonZero::new(u16::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2u16).unwrap();
let three = NonZero::new(3u16).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<u32>
impl NonZero<u32>
1.70.0 · Sourcepub const MIN: NonZero<u32>
pub const MIN: NonZero<u32>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<u32>::MIN.get(), 1u32);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u32>::new(u32::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u32>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<u32>::new(0b100_0000)?;
let b = NonZero::<u32>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x10000b3u32)?;
let m = NonZero::new(0xb301)?;
assert_eq!(n.rotate_left(8), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xb301u32)?;
let m = NonZero::new(0x10000b3)?;
assert_eq!(n.rotate_right(8), m);
Sourcepub const fn swap_bytes(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<u32>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678u32)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x78563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678u32)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x1e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<u32>) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<u32>) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU32;
let n = NonZero::new(0x1Au32)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroU32::from_be(n), n)
} else {
assert_eq!(NonZeroU32::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<u32>) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<u32>) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU32;
let n = NonZero::new(0x1Au32)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroU32::from_le(n), n)
} else {
assert_eq!(NonZeroU32::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au32)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<u32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au32)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: u32) -> Option<NonZero<u32>> ⓘ
pub const fn checked_add(self, other: u32) -> Option<NonZero<u32>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1u32)?;
let two = NonZero::new(2u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: u32) -> NonZero<u32>
pub const fn saturating_add(self, other: u32) -> NonZero<u32>
Adds an unsigned integer to a non-zero value.
Return NonZero::<u32>::MAX
on overflow.
§Examples
let one = NonZero::new(1u32)?;
let two = NonZero::new(2u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: u32) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: u32) -> NonZero<u32>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > u32::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1u32)?;
let two = NonZero::new(2u32)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<u32>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<u32>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u32)?;
let three = NonZero::new(3u32)?;
let four = NonZero::new(4u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
u32::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7u32)?.ilog2(), 2);
assert_eq!(NonZero::new(8u32)?.ilog2(), 3);
assert_eq!(NonZero::new(9u32)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
u32::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99u32)?.ilog10(), 1);
assert_eq!(NonZero::new(100u32)?.ilog10(), 2);
assert_eq!(NonZero::new(101u32)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<u32>) -> NonZero<u32>
pub const fn midpoint(self, rhs: NonZero<u32>) -> NonZero<u32>
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
let one = NonZero::new(1u32)?;
let two = NonZero::new(2u32)?;
let four = NonZero::new(4u32)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8u32)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10u32)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<u32>
pub const fn isqrt(self) -> NonZero<u32>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10u32)?;
let three = NonZero::new(3u32)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<u32>) -> Option<NonZero<u32>> ⓘ
pub const fn checked_mul(self, other: NonZero<u32>) -> Option<NonZero<u32>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u32)?;
let four = NonZero::new(4u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<u32>) -> NonZero<u32>
pub const fn saturating_mul(self, other: NonZero<u32>) -> NonZero<u32>
Multiplies two non-zero integers together.
Return NonZero::<u32>::MAX
on overflow.
§Examples
let two = NonZero::new(2u32)?;
let four = NonZero::new(4u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<u32>) -> NonZero<u32>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<u32>) -> NonZero<u32>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > u32::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2u32)?;
let four = NonZero::new(4u32)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<u32>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<u32>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3u32)?;
let twenty_seven = NonZero::new(27u32)?;
let half_max = NonZero::new(u32::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<u32>
pub const fn saturating_pow(self, other: u32) -> NonZero<u32>
Raise non-zero value to an integer power.
Return NonZero::<u32>::MAX
on overflow.
§Examples
let three = NonZero::new(3u32)?;
let twenty_seven = NonZero::new(27u32)?;
let max = NonZero::new(u32::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<u32>
impl NonZero<u32>
Sourcepub const fn div_ceil(self, rhs: NonZero<u32>) -> NonZero<u32>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<u32>) -> NonZero<u32>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1u32).unwrap();
let max = NonZero::new(u32::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2u32).unwrap();
let three = NonZero::new(3u32).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<u64>
impl NonZero<u64>
1.70.0 · Sourcepub const MIN: NonZero<u64>
pub const MIN: NonZero<u64>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<u64>::MIN.get(), 1u64);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u64>::new(u64::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u64>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<u64>::new(0b100_0000)?;
let b = NonZero::<u64>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xaa00000000006e1u64)?;
let m = NonZero::new(0x6e10aa)?;
assert_eq!(n.rotate_left(12), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x6e10aau64)?;
let m = NonZero::new(0xaa00000000006e1)?;
assert_eq!(n.rotate_right(12), m);
Sourcepub const fn swap_bytes(self) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<u64>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456u64)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x5634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456u64)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<u64>) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<u64>) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU64;
let n = NonZero::new(0x1Au64)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroU64::from_be(n), n)
} else {
assert_eq!(NonZeroU64::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<u64>) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<u64>) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU64;
let n = NonZero::new(0x1Au64)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroU64::from_le(n), n)
} else {
assert_eq!(NonZeroU64::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au64)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<u64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au64)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: u64) -> Option<NonZero<u64>> ⓘ
pub const fn checked_add(self, other: u64) -> Option<NonZero<u64>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1u64)?;
let two = NonZero::new(2u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: u64) -> NonZero<u64>
pub const fn saturating_add(self, other: u64) -> NonZero<u64>
Adds an unsigned integer to a non-zero value.
Return NonZero::<u64>::MAX
on overflow.
§Examples
let one = NonZero::new(1u64)?;
let two = NonZero::new(2u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: u64) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: u64) -> NonZero<u64>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > u64::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1u64)?;
let two = NonZero::new(2u64)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<u64>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<u64>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u64)?;
let three = NonZero::new(3u64)?;
let four = NonZero::new(4u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
u64::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7u64)?.ilog2(), 2);
assert_eq!(NonZero::new(8u64)?.ilog2(), 3);
assert_eq!(NonZero::new(9u64)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
u64::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99u64)?.ilog10(), 1);
assert_eq!(NonZero::new(100u64)?.ilog10(), 2);
assert_eq!(NonZero::new(101u64)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<u64>) -> NonZero<u64>
pub const fn midpoint(self, rhs: NonZero<u64>) -> NonZero<u64>
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
let one = NonZero::new(1u64)?;
let two = NonZero::new(2u64)?;
let four = NonZero::new(4u64)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8u64)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10u64)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<u64>
pub const fn isqrt(self) -> NonZero<u64>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10u64)?;
let three = NonZero::new(3u64)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<u64>) -> Option<NonZero<u64>> ⓘ
pub const fn checked_mul(self, other: NonZero<u64>) -> Option<NonZero<u64>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u64)?;
let four = NonZero::new(4u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<u64>) -> NonZero<u64>
pub const fn saturating_mul(self, other: NonZero<u64>) -> NonZero<u64>
Multiplies two non-zero integers together.
Return NonZero::<u64>::MAX
on overflow.
§Examples
let two = NonZero::new(2u64)?;
let four = NonZero::new(4u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<u64>) -> NonZero<u64>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<u64>) -> NonZero<u64>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > u64::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2u64)?;
let four = NonZero::new(4u64)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<u64>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<u64>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3u64)?;
let twenty_seven = NonZero::new(27u64)?;
let half_max = NonZero::new(u64::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<u64>
pub const fn saturating_pow(self, other: u32) -> NonZero<u64>
Raise non-zero value to an integer power.
Return NonZero::<u64>::MAX
on overflow.
§Examples
let three = NonZero::new(3u64)?;
let twenty_seven = NonZero::new(27u64)?;
let max = NonZero::new(u64::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<u64>
impl NonZero<u64>
Sourcepub const fn div_ceil(self, rhs: NonZero<u64>) -> NonZero<u64>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<u64>) -> NonZero<u64>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1u64).unwrap();
let max = NonZero::new(u64::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2u64).unwrap();
let three = NonZero::new(3u64).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<u128>
impl NonZero<u128>
1.67.0 · Sourcepub const BITS: u32 = 128u32
pub const BITS: u32 = 128u32
The size of this non-zero integer type in bits.
This value is equal to u128::BITS
.
§Examples
assert_eq!(NonZero::<u128>::BITS, u128::BITS);
1.70.0 · Sourcepub const MIN: NonZero<u128>
pub const MIN: NonZero<u128>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<u128>::MIN.get(), 1u128);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u128>::new(u128::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<u128>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<u128>::new(0b100_0000)?;
let b = NonZero::<u128>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x13f40000000000000000000000004f76u128)?;
let m = NonZero::new(0x4f7613f4)?;
assert_eq!(n.rotate_left(16), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x4f7613f4u128)?;
let m = NonZero::new(0x13f40000000000000000000000004f76)?;
assert_eq!(n.rotate_right(16), m);
Sourcepub const fn swap_bytes(self) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<u128>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678901234567890123456789012u128)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x12907856341290785634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678901234567890123456789012u128)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x48091e6a2c48091e6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<u128>) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<u128>) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU128;
let n = NonZero::new(0x1Au128)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroU128::from_be(n), n)
} else {
assert_eq!(NonZeroU128::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<u128>) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<u128>) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroU128;
let n = NonZero::new(0x1Au128)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroU128::from_le(n), n)
} else {
assert_eq!(NonZeroU128::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au128)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<u128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Au128)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: u128) -> Option<NonZero<u128>> ⓘ
pub const fn checked_add(self, other: u128) -> Option<NonZero<u128>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1u128)?;
let two = NonZero::new(2u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: u128) -> NonZero<u128>
pub const fn saturating_add(self, other: u128) -> NonZero<u128>
Adds an unsigned integer to a non-zero value.
Return NonZero::<u128>::MAX
on overflow.
§Examples
let one = NonZero::new(1u128)?;
let two = NonZero::new(2u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: u128) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: u128) -> NonZero<u128>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > u128::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1u128)?;
let two = NonZero::new(2u128)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<u128>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<u128>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u128)?;
let three = NonZero::new(3u128)?;
let four = NonZero::new(4u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
u128::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7u128)?.ilog2(), 2);
assert_eq!(NonZero::new(8u128)?.ilog2(), 3);
assert_eq!(NonZero::new(9u128)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
u128::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99u128)?.ilog10(), 1);
assert_eq!(NonZero::new(100u128)?.ilog10(), 2);
assert_eq!(NonZero::new(101u128)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<u128>) -> NonZero<u128>
pub const fn midpoint(self, rhs: NonZero<u128>) -> NonZero<u128>
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
let one = NonZero::new(1u128)?;
let two = NonZero::new(2u128)?;
let four = NonZero::new(4u128)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8u128)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10u128)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<u128>
pub const fn isqrt(self) -> NonZero<u128>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10u128)?;
let three = NonZero::new(3u128)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<u128>) -> Option<NonZero<u128>> ⓘ
pub const fn checked_mul(self, other: NonZero<u128>) -> Option<NonZero<u128>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2u128)?;
let four = NonZero::new(4u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<u128>) -> NonZero<u128>
pub const fn saturating_mul(self, other: NonZero<u128>) -> NonZero<u128>
Multiplies two non-zero integers together.
Return NonZero::<u128>::MAX
on overflow.
§Examples
let two = NonZero::new(2u128)?;
let four = NonZero::new(4u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<u128>) -> NonZero<u128>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<u128>) -> NonZero<u128>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > u128::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2u128)?;
let four = NonZero::new(4u128)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<u128>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<u128>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3u128)?;
let twenty_seven = NonZero::new(27u128)?;
let half_max = NonZero::new(u128::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<u128>
pub const fn saturating_pow(self, other: u32) -> NonZero<u128>
Raise non-zero value to an integer power.
Return NonZero::<u128>::MAX
on overflow.
§Examples
let three = NonZero::new(3u128)?;
let twenty_seven = NonZero::new(27u128)?;
let max = NonZero::new(u128::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<u128>
impl NonZero<u128>
Sourcepub const fn div_ceil(self, rhs: NonZero<u128>) -> NonZero<u128>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<u128>) -> NonZero<u128>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1u128).unwrap();
let max = NonZero::new(u128::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2u128).unwrap();
let three = NonZero::new(3u128).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<usize>
impl NonZero<usize>
1.67.0 · Sourcepub const BITS: u32 = 64u32
pub const BITS: u32 = 64u32
The size of this non-zero integer type in bits.
This value is equal to usize::BITS
.
§Examples
assert_eq!(NonZero::<usize>::BITS, usize::BITS);
1.70.0 · Sourcepub const MIN: NonZero<usize>
pub const MIN: NonZero<usize>
The smallest value that can be represented by this non-zero integer type, 1.
§Examples
assert_eq!(NonZero::<usize>::MIN.get(), 1usize);
1.70.0 · Sourcepub const MAX: NonZero<usize>
pub const MAX: NonZero<usize>
The largest value that can be represented by this non-zero
integer type,
equal to usize::MAX
.
§Examples
assert_eq!(NonZero::<usize>::MAX.get(), usize::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<usize>::new(usize::MAX)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<usize>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<usize>::new(0b100_0000)?;
let b = NonZero::<usize>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xaa00000000006e1usize)?;
let m = NonZero::new(0x6e10aa)?;
assert_eq!(n.rotate_left(12), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x6e10aausize)?;
let m = NonZero::new(0xaa00000000006e1)?;
assert_eq!(n.rotate_right(12), m);
Sourcepub const fn swap_bytes(self) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<usize>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456usize)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x5634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456usize)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<usize>) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<usize>) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroUsize;
let n = NonZero::new(0x1Ausize)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroUsize::from_be(n), n)
} else {
assert_eq!(NonZeroUsize::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<usize>) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<usize>) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroUsize;
let n = NonZero::new(0x1Ausize)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroUsize::from_le(n), n)
} else {
assert_eq!(NonZeroUsize::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ausize)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<usize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ausize)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_add(self, other: usize) -> Option<NonZero<usize>> ⓘ
pub const fn checked_add(self, other: usize) -> Option<NonZero<usize>> ⓘ
Adds an unsigned integer to a non-zero value.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let one = NonZero::new(1usize)?;
let two = NonZero::new(2usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(Some(two), one.checked_add(1));
assert_eq!(None, max.checked_add(1));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_add(self, other: usize) -> NonZero<usize>
pub const fn saturating_add(self, other: usize) -> NonZero<usize>
Adds an unsigned integer to a non-zero value.
Return NonZero::<usize>::MAX
on overflow.
§Examples
let one = NonZero::new(1usize)?;
let two = NonZero::new(2usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(two, one.saturating_add(1));
assert_eq!(max, max.saturating_add(1));
Sourcepub const unsafe fn unchecked_add(self, other: usize) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_add(self, other: usize) -> NonZero<usize>
nonzero_ops
)Adds an unsigned integer to a non-zero value,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self + rhs > usize::MAX
.
§Examples
#![feature(nonzero_ops)]
let one = NonZero::new(1usize)?;
let two = NonZero::new(2usize)?;
assert_eq!(two, unsafe { one.unchecked_add(1) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_next_power_of_two(self) -> Option<NonZero<usize>> ⓘ
pub const fn checked_next_power_of_two(self) -> Option<NonZero<usize>> ⓘ
Returns the smallest power of two greater than or equal to self
.
Checks for overflow and returns None
if the next power of two is greater than the type’s maximum value.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2usize)?;
let three = NonZero::new(3usize)?;
let four = NonZero::new(4usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(Some(two), two.checked_next_power_of_two() );
assert_eq!(Some(four), three.checked_next_power_of_two() );
assert_eq!(None, max.checked_next_power_of_two() );
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog2(self) -> u32 ⓘ
pub const fn ilog2(self) -> u32 ⓘ
Returns the base 2 logarithm of the number, rounded down.
This is the same operation as
usize::ilog2
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(7usize)?.ilog2(), 2);
assert_eq!(NonZero::new(8usize)?.ilog2(), 3);
assert_eq!(NonZero::new(9usize)?.ilog2(), 3);
1.67.0 (const: 1.67.0) · Sourcepub const fn ilog10(self) -> u32 ⓘ
pub const fn ilog10(self) -> u32 ⓘ
Returns the base 10 logarithm of the number, rounded down.
This is the same operation as
usize::ilog10
,
except that it has no failure cases to worry about
since this value can never be zero.
§Examples
assert_eq!(NonZero::new(99usize)?.ilog10(), 1);
assert_eq!(NonZero::new(100usize)?.ilog10(), 2);
assert_eq!(NonZero::new(101usize)?.ilog10(), 2);
1.85.0 (const: 1.85.0) · Sourcepub const fn midpoint(self, rhs: NonZero<usize>) -> NonZero<usize>
pub const fn midpoint(self, rhs: NonZero<usize>) -> NonZero<usize>
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
let one = NonZero::new(1usize)?;
let two = NonZero::new(2usize)?;
let four = NonZero::new(4usize)?;
assert_eq!(one.midpoint(four), two);
assert_eq!(four.midpoint(one), two);
1.59.0 (const: 1.59.0) · Sourcepub const fn is_power_of_two(self) -> bool
pub const fn is_power_of_two(self) -> bool
Returns true
if and only if self == (1 << k)
for some k
.
On many architectures, this function can perform better than is_power_of_two()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let eight = NonZero::new(8usize)?;
assert!(eight.is_power_of_two());
let ten = NonZero::new(10usize)?;
assert!(!ten.is_power_of_two());
1.84.0 (const: 1.84.0) · Sourcepub const fn isqrt(self) -> NonZero<usize>
pub const fn isqrt(self) -> NonZero<usize>
Returns the square root of the number, rounded down.
§Examples
Basic usage:
let ten = NonZero::new(10usize)?;
let three = NonZero::new(3usize)?;
assert_eq!(ten.isqrt(), three);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<usize>) -> Option<NonZero<usize>> ⓘ
pub const fn checked_mul(self, other: NonZero<usize>) -> Option<NonZero<usize>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2usize)?;
let four = NonZero::new(4usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<usize>) -> NonZero<usize>
pub const fn saturating_mul(self, other: NonZero<usize>) -> NonZero<usize>
Multiplies two non-zero integers together.
Return NonZero::<usize>::MAX
on overflow.
§Examples
let two = NonZero::new(2usize)?;
let four = NonZero::new(4usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<usize>) -> NonZero<usize>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<usize>) -> NonZero<usize>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > usize::MAX
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2usize)?;
let four = NonZero::new(4usize)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<usize>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<usize>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3usize)?;
let twenty_seven = NonZero::new(27usize)?;
let half_max = NonZero::new(usize::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<usize>
pub const fn saturating_pow(self, other: u32) -> NonZero<usize>
Raise non-zero value to an integer power.
Return NonZero::<usize>::MAX
on overflow.
§Examples
let three = NonZero::new(3usize)?;
let twenty_seven = NonZero::new(27usize)?;
let max = NonZero::new(usize::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<usize>
impl NonZero<usize>
Sourcepub const fn div_ceil(self, rhs: NonZero<usize>) -> NonZero<usize>
🔬This is a nightly-only experimental API. (unsigned_nonzero_div_ceil
)
pub const fn div_ceil(self, rhs: NonZero<usize>) -> NonZero<usize>
unsigned_nonzero_div_ceil
)Calculates the quotient of self
and rhs
, rounding the result towards positive infinity.
The result is guaranteed to be non-zero.
§Examples
let one = NonZero::new(1usize).unwrap();
let max = NonZero::new(usize::MAX).unwrap();
assert_eq!(one.div_ceil(max), one);
let two = NonZero::new(2usize).unwrap();
let three = NonZero::new(3usize).unwrap();
assert_eq!(three.div_ceil(two), two);
Source§impl NonZero<i8>
impl NonZero<i8>
1.70.0 · Sourcepub const MIN: NonZero<i8>
pub const MIN: NonZero<i8>
The smallest value that can be represented by this non-zero
integer type,
equal to i8::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i8>::MIN.get(), i8::MIN);
1.70.0 · Sourcepub const MAX: NonZero<i8>
pub const MAX: NonZero<i8>
The largest value that can be represented by this non-zero
integer type,
equal to i8::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i8>::MAX.get(), i8::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i8>::new(-1i8)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i8>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<i8>::new(0b100_0000)?;
let b = NonZero::<i8>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(-0x7ei8)?;
let m = NonZero::new(0xa)?;
assert_eq!(n.rotate_left(2), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xai8)?;
let m = NonZero::new(-0x7e)?;
assert_eq!(n.rotate_right(2), m);
Sourcepub const fn swap_bytes(self) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<i8>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12i8)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x12)?);
Sourcepub const fn reverse_bits(self) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12i8)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x48)?);
Sourcepub const fn from_be(x: NonZero<i8>) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<i8>) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI8;
let n = NonZero::new(0x1Ai8)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroI8::from_be(n), n)
} else {
assert_eq!(NonZeroI8::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<i8>) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<i8>) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI8;
let n = NonZero::new(0x1Ai8)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroI8::from_le(n), n)
} else {
assert_eq!(NonZeroI8::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai8)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<i8>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai8)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<i8>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<i8>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<i8>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1i8)?;
let neg = NonZero::new(-1i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<i8>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<i8>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
i8::overflowing_abs
.
§Example
let pos = NonZero::new(1i8)?;
let neg = NonZero::new(-1i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<i8>
pub const fn saturating_abs(self) -> NonZero<i8>
Saturating absolute value, see
i8::saturating_abs
.
§Example
let pos = NonZero::new(1i8)?;
let neg = NonZero::new(-1i8)?;
let min = NonZero::new(i8::MIN)?;
let min_plus = NonZero::new(i8::MIN + 1)?;
let max = NonZero::new(i8::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<i8>
pub const fn wrapping_abs(self) -> NonZero<i8>
Wrapping absolute value, see
i8::wrapping_abs
.
§Example
let pos = NonZero::new(1i8)?;
let neg = NonZero::new(-1i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<u8>
pub const fn unsigned_abs(self) -> NonZero<u8>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1u8)?;
let i_pos = NonZero::new(1i8)?;
let i_neg = NonZero::new(-1i8)?;
let i_min = NonZero::new(i8::MIN)?;
let u_max = NonZero::new(u8::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<i8>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<i8>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<i8>::MIN
.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<i8>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<i8>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See i8::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<i8>
pub const fn saturating_neg(self) -> NonZero<i8>
Saturating negation. Computes -self
,
returning NonZero::<i8>::MAX
if self == NonZero::<i8>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
let min = NonZero::new(i8::MIN)?;
let min_plus_one = NonZero::new(i8::MIN + 1)?;
let max = NonZero::new(i8::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<i8>
pub const fn wrapping_neg(self) -> NonZero<i8>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See i8::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i8)?;
let neg_five = NonZero::new(-5i8)?;
let min = NonZero::new(i8::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<i8>) -> Option<NonZero<i8>> ⓘ
pub const fn checked_mul(self, other: NonZero<i8>) -> Option<NonZero<i8>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2i8)?;
let four = NonZero::new(4i8)?;
let max = NonZero::new(i8::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<i8>) -> NonZero<i8>
pub const fn saturating_mul(self, other: NonZero<i8>) -> NonZero<i8>
Multiplies two non-zero integers together.
Return NonZero::<i8>::MAX
on overflow.
§Examples
let two = NonZero::new(2i8)?;
let four = NonZero::new(4i8)?;
let max = NonZero::new(i8::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<i8>) -> NonZero<i8>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<i8>) -> NonZero<i8>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > i8::MAX
, or self * rhs < i8::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2i8)?;
let four = NonZero::new(4i8)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<i8>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<i8>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3i8)?;
let twenty_seven = NonZero::new(27i8)?;
let half_max = NonZero::new(i8::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<i8>
pub const fn saturating_pow(self, other: u32) -> NonZero<i8>
Raise non-zero value to an integer power.
Return NonZero::<i8>::MIN
or NonZero::<i8>::MAX
on overflow.
§Examples
let three = NonZero::new(3i8)?;
let twenty_seven = NonZero::new(27i8)?;
let max = NonZero::new(i8::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<i16>
impl NonZero<i16>
1.70.0 · Sourcepub const MIN: NonZero<i16>
pub const MIN: NonZero<i16>
The smallest value that can be represented by this non-zero
integer type,
equal to i16::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i16>::MIN.get(), i16::MIN);
1.70.0 · Sourcepub const MAX: NonZero<i16>
pub const MAX: NonZero<i16>
The largest value that can be represented by this non-zero
integer type,
equal to i16::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i16>::MAX.get(), i16::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i16>::new(-1i16)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i16>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<i16>::new(0b100_0000)?;
let b = NonZero::<i16>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(-0x5ffdi16)?;
let m = NonZero::new(0x3a)?;
assert_eq!(n.rotate_left(4), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x3ai16)?;
let m = NonZero::new(-0x5ffd)?;
assert_eq!(n.rotate_right(4), m);
Sourcepub const fn swap_bytes(self) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<i16>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234i16)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x3412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234i16)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x2c48)?);
Sourcepub const fn from_be(x: NonZero<i16>) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<i16>) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI16;
let n = NonZero::new(0x1Ai16)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroI16::from_be(n), n)
} else {
assert_eq!(NonZeroI16::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<i16>) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<i16>) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI16;
let n = NonZero::new(0x1Ai16)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroI16::from_le(n), n)
} else {
assert_eq!(NonZeroI16::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai16)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<i16>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai16)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<i16>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<i16>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<i16>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1i16)?;
let neg = NonZero::new(-1i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<i16>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<i16>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
i16::overflowing_abs
.
§Example
let pos = NonZero::new(1i16)?;
let neg = NonZero::new(-1i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<i16>
pub const fn saturating_abs(self) -> NonZero<i16>
Saturating absolute value, see
i16::saturating_abs
.
§Example
let pos = NonZero::new(1i16)?;
let neg = NonZero::new(-1i16)?;
let min = NonZero::new(i16::MIN)?;
let min_plus = NonZero::new(i16::MIN + 1)?;
let max = NonZero::new(i16::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<i16>
pub const fn wrapping_abs(self) -> NonZero<i16>
Wrapping absolute value, see
i16::wrapping_abs
.
§Example
let pos = NonZero::new(1i16)?;
let neg = NonZero::new(-1i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<u16>
pub const fn unsigned_abs(self) -> NonZero<u16>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1u16)?;
let i_pos = NonZero::new(1i16)?;
let i_neg = NonZero::new(-1i16)?;
let i_min = NonZero::new(i16::MIN)?;
let u_max = NonZero::new(u16::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<i16>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<i16>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<i16>::MIN
.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<i16>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<i16>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See i16::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<i16>
pub const fn saturating_neg(self) -> NonZero<i16>
Saturating negation. Computes -self
,
returning NonZero::<i16>::MAX
if self == NonZero::<i16>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
let min = NonZero::new(i16::MIN)?;
let min_plus_one = NonZero::new(i16::MIN + 1)?;
let max = NonZero::new(i16::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<i16>
pub const fn wrapping_neg(self) -> NonZero<i16>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See i16::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i16)?;
let neg_five = NonZero::new(-5i16)?;
let min = NonZero::new(i16::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<i16>) -> Option<NonZero<i16>> ⓘ
pub const fn checked_mul(self, other: NonZero<i16>) -> Option<NonZero<i16>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2i16)?;
let four = NonZero::new(4i16)?;
let max = NonZero::new(i16::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<i16>) -> NonZero<i16>
pub const fn saturating_mul(self, other: NonZero<i16>) -> NonZero<i16>
Multiplies two non-zero integers together.
Return NonZero::<i16>::MAX
on overflow.
§Examples
let two = NonZero::new(2i16)?;
let four = NonZero::new(4i16)?;
let max = NonZero::new(i16::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<i16>) -> NonZero<i16>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<i16>) -> NonZero<i16>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > i16::MAX
, or self * rhs < i16::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2i16)?;
let four = NonZero::new(4i16)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<i16>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<i16>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3i16)?;
let twenty_seven = NonZero::new(27i16)?;
let half_max = NonZero::new(i16::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<i16>
pub const fn saturating_pow(self, other: u32) -> NonZero<i16>
Raise non-zero value to an integer power.
Return NonZero::<i16>::MIN
or NonZero::<i16>::MAX
on overflow.
§Examples
let three = NonZero::new(3i16)?;
let twenty_seven = NonZero::new(27i16)?;
let max = NonZero::new(i16::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<i32>
impl NonZero<i32>
1.70.0 · Sourcepub const MIN: NonZero<i32>
pub const MIN: NonZero<i32>
The smallest value that can be represented by this non-zero
integer type,
equal to i32::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i32>::MIN.get(), i32::MIN);
1.70.0 · Sourcepub const MAX: NonZero<i32>
pub const MAX: NonZero<i32>
The largest value that can be represented by this non-zero
integer type,
equal to i32::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i32>::MAX.get(), i32::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i32>::new(-1i32)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i32>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<i32>::new(0b100_0000)?;
let b = NonZero::<i32>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x10000b3i32)?;
let m = NonZero::new(0xb301)?;
assert_eq!(n.rotate_left(8), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xb301i32)?;
let m = NonZero::new(0x10000b3)?;
assert_eq!(n.rotate_right(8), m);
Sourcepub const fn swap_bytes(self) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<i32>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678i32)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x78563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678i32)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x1e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<i32>) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<i32>) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI32;
let n = NonZero::new(0x1Ai32)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroI32::from_be(n), n)
} else {
assert_eq!(NonZeroI32::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<i32>) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<i32>) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI32;
let n = NonZero::new(0x1Ai32)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroI32::from_le(n), n)
} else {
assert_eq!(NonZeroI32::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai32)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<i32>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai32)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<i32>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<i32>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<i32>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1i32)?;
let neg = NonZero::new(-1i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<i32>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<i32>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
i32::overflowing_abs
.
§Example
let pos = NonZero::new(1i32)?;
let neg = NonZero::new(-1i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<i32>
pub const fn saturating_abs(self) -> NonZero<i32>
Saturating absolute value, see
i32::saturating_abs
.
§Example
let pos = NonZero::new(1i32)?;
let neg = NonZero::new(-1i32)?;
let min = NonZero::new(i32::MIN)?;
let min_plus = NonZero::new(i32::MIN + 1)?;
let max = NonZero::new(i32::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<i32>
pub const fn wrapping_abs(self) -> NonZero<i32>
Wrapping absolute value, see
i32::wrapping_abs
.
§Example
let pos = NonZero::new(1i32)?;
let neg = NonZero::new(-1i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<u32>
pub const fn unsigned_abs(self) -> NonZero<u32>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1u32)?;
let i_pos = NonZero::new(1i32)?;
let i_neg = NonZero::new(-1i32)?;
let i_min = NonZero::new(i32::MIN)?;
let u_max = NonZero::new(u32::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<i32>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<i32>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<i32>::MIN
.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<i32>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<i32>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See i32::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<i32>
pub const fn saturating_neg(self) -> NonZero<i32>
Saturating negation. Computes -self
,
returning NonZero::<i32>::MAX
if self == NonZero::<i32>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
let min = NonZero::new(i32::MIN)?;
let min_plus_one = NonZero::new(i32::MIN + 1)?;
let max = NonZero::new(i32::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<i32>
pub const fn wrapping_neg(self) -> NonZero<i32>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See i32::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i32)?;
let neg_five = NonZero::new(-5i32)?;
let min = NonZero::new(i32::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<i32>) -> Option<NonZero<i32>> ⓘ
pub const fn checked_mul(self, other: NonZero<i32>) -> Option<NonZero<i32>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2i32)?;
let four = NonZero::new(4i32)?;
let max = NonZero::new(i32::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<i32>) -> NonZero<i32>
pub const fn saturating_mul(self, other: NonZero<i32>) -> NonZero<i32>
Multiplies two non-zero integers together.
Return NonZero::<i32>::MAX
on overflow.
§Examples
let two = NonZero::new(2i32)?;
let four = NonZero::new(4i32)?;
let max = NonZero::new(i32::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<i32>) -> NonZero<i32>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<i32>) -> NonZero<i32>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > i32::MAX
, or self * rhs < i32::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2i32)?;
let four = NonZero::new(4i32)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<i32>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<i32>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3i32)?;
let twenty_seven = NonZero::new(27i32)?;
let half_max = NonZero::new(i32::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<i32>
pub const fn saturating_pow(self, other: u32) -> NonZero<i32>
Raise non-zero value to an integer power.
Return NonZero::<i32>::MIN
or NonZero::<i32>::MAX
on overflow.
§Examples
let three = NonZero::new(3i32)?;
let twenty_seven = NonZero::new(27i32)?;
let max = NonZero::new(i32::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<i64>
impl NonZero<i64>
1.70.0 · Sourcepub const MIN: NonZero<i64>
pub const MIN: NonZero<i64>
The smallest value that can be represented by this non-zero
integer type,
equal to i64::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i64>::MIN.get(), i64::MIN);
1.70.0 · Sourcepub const MAX: NonZero<i64>
pub const MAX: NonZero<i64>
The largest value that can be represented by this non-zero
integer type,
equal to i64::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i64>::MAX.get(), i64::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i64>::new(-1i64)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i64>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<i64>::new(0b100_0000)?;
let b = NonZero::<i64>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xaa00000000006e1i64)?;
let m = NonZero::new(0x6e10aa)?;
assert_eq!(n.rotate_left(12), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x6e10aai64)?;
let m = NonZero::new(0xaa00000000006e1)?;
assert_eq!(n.rotate_right(12), m);
Sourcepub const fn swap_bytes(self) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<i64>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456i64)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x5634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456i64)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<i64>) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<i64>) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI64;
let n = NonZero::new(0x1Ai64)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroI64::from_be(n), n)
} else {
assert_eq!(NonZeroI64::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<i64>) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<i64>) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI64;
let n = NonZero::new(0x1Ai64)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroI64::from_le(n), n)
} else {
assert_eq!(NonZeroI64::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai64)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<i64>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai64)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<i64>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<i64>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<i64>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1i64)?;
let neg = NonZero::new(-1i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<i64>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<i64>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
i64::overflowing_abs
.
§Example
let pos = NonZero::new(1i64)?;
let neg = NonZero::new(-1i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<i64>
pub const fn saturating_abs(self) -> NonZero<i64>
Saturating absolute value, see
i64::saturating_abs
.
§Example
let pos = NonZero::new(1i64)?;
let neg = NonZero::new(-1i64)?;
let min = NonZero::new(i64::MIN)?;
let min_plus = NonZero::new(i64::MIN + 1)?;
let max = NonZero::new(i64::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<i64>
pub const fn wrapping_abs(self) -> NonZero<i64>
Wrapping absolute value, see
i64::wrapping_abs
.
§Example
let pos = NonZero::new(1i64)?;
let neg = NonZero::new(-1i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<u64>
pub const fn unsigned_abs(self) -> NonZero<u64>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1u64)?;
let i_pos = NonZero::new(1i64)?;
let i_neg = NonZero::new(-1i64)?;
let i_min = NonZero::new(i64::MIN)?;
let u_max = NonZero::new(u64::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<i64>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<i64>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<i64>::MIN
.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<i64>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<i64>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See i64::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<i64>
pub const fn saturating_neg(self) -> NonZero<i64>
Saturating negation. Computes -self
,
returning NonZero::<i64>::MAX
if self == NonZero::<i64>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
let min = NonZero::new(i64::MIN)?;
let min_plus_one = NonZero::new(i64::MIN + 1)?;
let max = NonZero::new(i64::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<i64>
pub const fn wrapping_neg(self) -> NonZero<i64>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See i64::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i64)?;
let neg_five = NonZero::new(-5i64)?;
let min = NonZero::new(i64::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<i64>) -> Option<NonZero<i64>> ⓘ
pub const fn checked_mul(self, other: NonZero<i64>) -> Option<NonZero<i64>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2i64)?;
let four = NonZero::new(4i64)?;
let max = NonZero::new(i64::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<i64>) -> NonZero<i64>
pub const fn saturating_mul(self, other: NonZero<i64>) -> NonZero<i64>
Multiplies two non-zero integers together.
Return NonZero::<i64>::MAX
on overflow.
§Examples
let two = NonZero::new(2i64)?;
let four = NonZero::new(4i64)?;
let max = NonZero::new(i64::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<i64>) -> NonZero<i64>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<i64>) -> NonZero<i64>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > i64::MAX
, or self * rhs < i64::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2i64)?;
let four = NonZero::new(4i64)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<i64>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<i64>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3i64)?;
let twenty_seven = NonZero::new(27i64)?;
let half_max = NonZero::new(i64::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<i64>
pub const fn saturating_pow(self, other: u32) -> NonZero<i64>
Raise non-zero value to an integer power.
Return NonZero::<i64>::MIN
or NonZero::<i64>::MAX
on overflow.
§Examples
let three = NonZero::new(3i64)?;
let twenty_seven = NonZero::new(27i64)?;
let max = NonZero::new(i64::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<i128>
impl NonZero<i128>
1.67.0 · Sourcepub const BITS: u32 = 128u32
pub const BITS: u32 = 128u32
The size of this non-zero integer type in bits.
This value is equal to i128::BITS
.
§Examples
assert_eq!(NonZero::<i128>::BITS, i128::BITS);
1.70.0 · Sourcepub const MIN: NonZero<i128>
pub const MIN: NonZero<i128>
The smallest value that can be represented by this non-zero
integer type,
equal to i128::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i128>::MIN.get(), i128::MIN);
1.70.0 · Sourcepub const MAX: NonZero<i128>
pub const MAX: NonZero<i128>
The largest value that can be represented by this non-zero
integer type,
equal to i128::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<i128>::MAX.get(), i128::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i128>::new(-1i128)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<i128>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<i128>::new(0b100_0000)?;
let b = NonZero::<i128>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x13f40000000000000000000000004f76i128)?;
let m = NonZero::new(0x4f7613f4)?;
assert_eq!(n.rotate_left(16), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x4f7613f4i128)?;
let m = NonZero::new(0x13f40000000000000000000000004f76)?;
assert_eq!(n.rotate_right(16), m);
Sourcepub const fn swap_bytes(self) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<i128>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678901234567890123456789012i128)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x12907856341290785634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x12345678901234567890123456789012i128)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x48091e6a2c48091e6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<i128>) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<i128>) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI128;
let n = NonZero::new(0x1Ai128)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroI128::from_be(n), n)
} else {
assert_eq!(NonZeroI128::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<i128>) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<i128>) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroI128;
let n = NonZero::new(0x1Ai128)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroI128::from_le(n), n)
} else {
assert_eq!(NonZeroI128::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai128)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<i128>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Ai128)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<i128>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<i128>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<i128>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1i128)?;
let neg = NonZero::new(-1i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<i128>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<i128>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
i128::overflowing_abs
.
§Example
let pos = NonZero::new(1i128)?;
let neg = NonZero::new(-1i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<i128>
pub const fn saturating_abs(self) -> NonZero<i128>
Saturating absolute value, see
i128::saturating_abs
.
§Example
let pos = NonZero::new(1i128)?;
let neg = NonZero::new(-1i128)?;
let min = NonZero::new(i128::MIN)?;
let min_plus = NonZero::new(i128::MIN + 1)?;
let max = NonZero::new(i128::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<i128>
pub const fn wrapping_abs(self) -> NonZero<i128>
Wrapping absolute value, see
i128::wrapping_abs
.
§Example
let pos = NonZero::new(1i128)?;
let neg = NonZero::new(-1i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<u128>
pub const fn unsigned_abs(self) -> NonZero<u128>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1u128)?;
let i_pos = NonZero::new(1i128)?;
let i_neg = NonZero::new(-1i128)?;
let i_min = NonZero::new(i128::MIN)?;
let u_max = NonZero::new(u128::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<i128>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<i128>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<i128>::MIN
.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<i128>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<i128>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See i128::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<i128>
pub const fn saturating_neg(self) -> NonZero<i128>
Saturating negation. Computes -self
,
returning NonZero::<i128>::MAX
if self == NonZero::<i128>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
let min = NonZero::new(i128::MIN)?;
let min_plus_one = NonZero::new(i128::MIN + 1)?;
let max = NonZero::new(i128::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<i128>
pub const fn wrapping_neg(self) -> NonZero<i128>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See i128::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5i128)?;
let neg_five = NonZero::new(-5i128)?;
let min = NonZero::new(i128::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<i128>) -> Option<NonZero<i128>> ⓘ
pub const fn checked_mul(self, other: NonZero<i128>) -> Option<NonZero<i128>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2i128)?;
let four = NonZero::new(4i128)?;
let max = NonZero::new(i128::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<i128>) -> NonZero<i128>
pub const fn saturating_mul(self, other: NonZero<i128>) -> NonZero<i128>
Multiplies two non-zero integers together.
Return NonZero::<i128>::MAX
on overflow.
§Examples
let two = NonZero::new(2i128)?;
let four = NonZero::new(4i128)?;
let max = NonZero::new(i128::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<i128>) -> NonZero<i128>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<i128>) -> NonZero<i128>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > i128::MAX
, or self * rhs < i128::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2i128)?;
let four = NonZero::new(4i128)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<i128>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<i128>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3i128)?;
let twenty_seven = NonZero::new(27i128)?;
let half_max = NonZero::new(i128::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<i128>
pub const fn saturating_pow(self, other: u32) -> NonZero<i128>
Raise non-zero value to an integer power.
Return NonZero::<i128>::MIN
or NonZero::<i128>::MAX
on overflow.
§Examples
let three = NonZero::new(3i128)?;
let twenty_seven = NonZero::new(27i128)?;
let max = NonZero::new(i128::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Source§impl NonZero<isize>
impl NonZero<isize>
1.67.0 · Sourcepub const BITS: u32 = 64u32
pub const BITS: u32 = 64u32
The size of this non-zero integer type in bits.
This value is equal to isize::BITS
.
§Examples
assert_eq!(NonZero::<isize>::BITS, isize::BITS);
1.70.0 · Sourcepub const MIN: NonZero<isize>
pub const MIN: NonZero<isize>
The smallest value that can be represented by this non-zero
integer type,
equal to isize::MIN
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<isize>::MIN.get(), isize::MIN);
1.70.0 · Sourcepub const MAX: NonZero<isize>
pub const MAX: NonZero<isize>
The largest value that can be represented by this non-zero
integer type,
equal to isize::MAX
.
Note: While most integer types are defined for every whole
number between MIN
and MAX
, signed non-zero integers are
a special case. They have a “gap” at 0.
§Examples
assert_eq!(NonZero::<isize>::MAX.get(), isize::MAX);
1.53.0 (const: 1.53.0) · Sourcepub const fn leading_zeros(self) -> u32 ⓘ
pub const fn leading_zeros(self) -> u32 ⓘ
Returns the number of leading zeros in the binary representation of self
.
On many architectures, this function can perform better than leading_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<isize>::new(-1isize)?;
assert_eq!(n.leading_zeros(), 0);
1.53.0 (const: 1.53.0) · Sourcepub const fn trailing_zeros(self) -> u32 ⓘ
pub const fn trailing_zeros(self) -> u32 ⓘ
Returns the number of trailing zeros in the binary representation
of self
.
On many architectures, this function can perform better than trailing_zeros()
on the underlying integer type, as special handling of zero can be avoided.
§Examples
Basic usage:
let n = NonZero::<isize>::new(0b0101000)?;
assert_eq!(n.trailing_zeros(), 3);
Sourcepub const fn count_ones(self) -> NonZero<u32>
🔬This is a nightly-only experimental API. (non_zero_count_ones
)
pub const fn count_ones(self) -> NonZero<u32>
non_zero_count_ones
)Returns the number of ones in the binary representation of self
.
§Examples
Basic usage:
#![feature(non_zero_count_ones)]
let a = NonZero::<isize>::new(0b100_0000)?;
let b = NonZero::<isize>::new(0b100_0011)?;
assert_eq!(a.count_ones(), NonZero::new(1)?);
assert_eq!(b.count_ones(), NonZero::new(3)?);
Sourcepub const fn rotate_left(self, n: u32) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_left(self, n: u32) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0xaa00000000006e1isize)?;
let m = NonZero::new(0x6e10aa)?;
assert_eq!(n.rotate_left(12), m);
Sourcepub const fn rotate_right(self, n: u32) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn rotate_right(self, n: u32) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x6e10aaisize)?;
let m = NonZero::new(0xaa00000000006e1)?;
assert_eq!(n.rotate_right(12), m);
Sourcepub const fn swap_bytes(self) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn swap_bytes(self) -> NonZero<isize>
nonzero_bitwise
)Reverses the byte order of the integer.
§Examples
Basic usage:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456isize)?;
let m = n.swap_bytes();
assert_eq!(m, NonZero::new(0x5634129078563412)?);
Sourcepub const fn reverse_bits(self) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn reverse_bits(self) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1234567890123456isize)?;
let m = n.reverse_bits();
assert_eq!(m, NonZero::new(0x6a2c48091e6a2c48)?);
Sourcepub const fn from_be(x: NonZero<isize>) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_be(x: NonZero<isize>) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroIsize;
let n = NonZero::new(0x1Aisize)?;
if cfg!(target_endian = "big") {
assert_eq!(NonZeroIsize::from_be(n), n)
} else {
assert_eq!(NonZeroIsize::from_be(n), n.swap_bytes())
}
Sourcepub const fn from_le(x: NonZero<isize>) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn from_le(x: NonZero<isize>) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
use std::num::NonZeroIsize;
let n = NonZero::new(0x1Aisize)?;
if cfg!(target_endian = "little") {
assert_eq!(NonZeroIsize::from_le(n), n)
} else {
assert_eq!(NonZeroIsize::from_le(n), n.swap_bytes())
}
Sourcepub const fn to_be(self) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_be(self) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Aisize)?;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}
Sourcepub const fn to_le(self) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_bitwise
)
pub const fn to_le(self) -> NonZero<isize>
nonzero_bitwise
)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:
#![feature(nonzero_bitwise)]
let n = NonZero::new(0x1Aisize)?;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}
1.64.0 (const: 1.64.0) · Sourcepub const fn abs(self) -> NonZero<isize>
pub const fn abs(self) -> NonZero<isize>
Computes the absolute value of self.
See isize::abs
for documentation on overflow behavior.
§Example
let pos = NonZero::new(1isize)?;
let neg = NonZero::new(-1isize)?;
assert_eq!(pos, pos.abs());
assert_eq!(pos, neg.abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_abs(self) -> Option<NonZero<isize>> ⓘ
pub const fn checked_abs(self) -> Option<NonZero<isize>> ⓘ
Checked absolute value.
Checks for overflow and returns None
if
self == NonZero::<isize>::MIN
.
The result cannot be zero.
§Example
let pos = NonZero::new(1isize)?;
let neg = NonZero::new(-1isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!(Some(pos), neg.checked_abs());
assert_eq!(None, min.checked_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn overflowing_abs(self) -> (NonZero<isize>, bool) ⓘ
pub const fn overflowing_abs(self) -> (NonZero<isize>, bool) ⓘ
Computes the absolute value of self,
with overflow information, see
isize::overflowing_abs
.
§Example
let pos = NonZero::new(1isize)?;
let neg = NonZero::new(-1isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!((pos, false), pos.overflowing_abs());
assert_eq!((pos, false), neg.overflowing_abs());
assert_eq!((min, true), min.overflowing_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_abs(self) -> NonZero<isize>
pub const fn saturating_abs(self) -> NonZero<isize>
Saturating absolute value, see
isize::saturating_abs
.
§Example
let pos = NonZero::new(1isize)?;
let neg = NonZero::new(-1isize)?;
let min = NonZero::new(isize::MIN)?;
let min_plus = NonZero::new(isize::MIN + 1)?;
let max = NonZero::new(isize::MAX)?;
assert_eq!(pos, pos.saturating_abs());
assert_eq!(pos, neg.saturating_abs());
assert_eq!(max, min.saturating_abs());
assert_eq!(max, min_plus.saturating_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn wrapping_abs(self) -> NonZero<isize>
pub const fn wrapping_abs(self) -> NonZero<isize>
Wrapping absolute value, see
isize::wrapping_abs
.
§Example
let pos = NonZero::new(1isize)?;
let neg = NonZero::new(-1isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!(pos, pos.wrapping_abs());
assert_eq!(pos, neg.wrapping_abs());
assert_eq!(min, min.wrapping_abs());
assert_eq!(max, (-max).wrapping_abs());
1.64.0 (const: 1.64.0) · Sourcepub const fn unsigned_abs(self) -> NonZero<usize>
pub const fn unsigned_abs(self) -> NonZero<usize>
Computes the absolute value of self without any wrapping or panicking.
§Example
let u_pos = NonZero::new(1usize)?;
let i_pos = NonZero::new(1isize)?;
let i_neg = NonZero::new(-1isize)?;
let i_min = NonZero::new(isize::MIN)?;
let u_max = NonZero::new(usize::MAX / 2 + 1)?;
assert_eq!(u_pos, i_pos.unsigned_abs());
assert_eq!(u_pos, i_neg.unsigned_abs());
assert_eq!(u_max, i_min.unsigned_abs());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_positive(self) -> bool
pub const fn is_positive(self) -> bool
Returns true
if self
is positive and false
if the
number is negative.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
assert!(pos_five.is_positive());
assert!(!neg_five.is_positive());
1.71.0 (const: 1.71.0) · Sourcepub const fn is_negative(self) -> bool
pub const fn is_negative(self) -> bool
Returns true
if self
is negative and false
if the
number is positive.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
assert!(neg_five.is_negative());
assert!(!pos_five.is_negative());
1.71.0 (const: 1.71.0) · Sourcepub const fn checked_neg(self) -> Option<NonZero<isize>> ⓘ
pub const fn checked_neg(self) -> Option<NonZero<isize>> ⓘ
Checked negation. Computes -self
,
returning None
if self == NonZero::<isize>::MIN
.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!(pos_five.checked_neg(), Some(neg_five));
assert_eq!(min.checked_neg(), None);
1.71.0 (const: 1.71.0) · Sourcepub const fn overflowing_neg(self) -> (NonZero<isize>, bool) ⓘ
pub const fn overflowing_neg(self) -> (NonZero<isize>, bool) ⓘ
Negates self, overflowing if this is equal to the minimum value.
See isize::overflowing_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!(pos_five.overflowing_neg(), (neg_five, false));
assert_eq!(min.overflowing_neg(), (min, true));
1.71.0 (const: 1.71.0) · Sourcepub const fn saturating_neg(self) -> NonZero<isize>
pub const fn saturating_neg(self) -> NonZero<isize>
Saturating negation. Computes -self
,
returning NonZero::<isize>::MAX
if self == NonZero::<isize>::MIN
instead of overflowing.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
let min = NonZero::new(isize::MIN)?;
let min_plus_one = NonZero::new(isize::MIN + 1)?;
let max = NonZero::new(isize::MAX)?;
assert_eq!(pos_five.saturating_neg(), neg_five);
assert_eq!(min.saturating_neg(), max);
assert_eq!(max.saturating_neg(), min_plus_one);
1.71.0 (const: 1.71.0) · Sourcepub const fn wrapping_neg(self) -> NonZero<isize>
pub const fn wrapping_neg(self) -> NonZero<isize>
Wrapping (modular) negation. Computes -self
, wrapping around at the boundary
of the type.
See isize::wrapping_neg
for documentation on overflow behavior.
§Example
let pos_five = NonZero::new(5isize)?;
let neg_five = NonZero::new(-5isize)?;
let min = NonZero::new(isize::MIN)?;
assert_eq!(pos_five.wrapping_neg(), neg_five);
assert_eq!(min.wrapping_neg(), min);
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_mul(self, other: NonZero<isize>) -> Option<NonZero<isize>> ⓘ
pub const fn checked_mul(self, other: NonZero<isize>) -> Option<NonZero<isize>> ⓘ
Multiplies two non-zero integers together.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let two = NonZero::new(2isize)?;
let four = NonZero::new(4isize)?;
let max = NonZero::new(isize::MAX)?;
assert_eq!(Some(four), two.checked_mul(two));
assert_eq!(None, max.checked_mul(two));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_mul(self, other: NonZero<isize>) -> NonZero<isize>
pub const fn saturating_mul(self, other: NonZero<isize>) -> NonZero<isize>
Multiplies two non-zero integers together.
Return NonZero::<isize>::MAX
on overflow.
§Examples
let two = NonZero::new(2isize)?;
let four = NonZero::new(4isize)?;
let max = NonZero::new(isize::MAX)?;
assert_eq!(four, two.saturating_mul(two));
assert_eq!(max, four.saturating_mul(max));
Sourcepub const unsafe fn unchecked_mul(self, other: NonZero<isize>) -> NonZero<isize>
🔬This is a nightly-only experimental API. (nonzero_ops
)
pub const unsafe fn unchecked_mul(self, other: NonZero<isize>) -> NonZero<isize>
nonzero_ops
)Multiplies two non-zero integers together,
assuming overflow cannot occur.
Overflow is unchecked, and it is undefined behavior to overflow
even if the result would wrap to a non-zero value.
The behavior is undefined as soon as
self * rhs > isize::MAX
, or self * rhs < isize::MIN
.
§Examples
#![feature(nonzero_ops)]
let two = NonZero::new(2isize)?;
let four = NonZero::new(4isize)?;
assert_eq!(four, unsafe { two.unchecked_mul(two) });
1.64.0 (const: 1.64.0) · Sourcepub const fn checked_pow(self, other: u32) -> Option<NonZero<isize>> ⓘ
pub const fn checked_pow(self, other: u32) -> Option<NonZero<isize>> ⓘ
Raises non-zero value to an integer power.
Checks for overflow and returns None
on overflow.
As a consequence, the result cannot wrap to zero.
§Examples
let three = NonZero::new(3isize)?;
let twenty_seven = NonZero::new(27isize)?;
let half_max = NonZero::new(isize::MAX / 2)?;
assert_eq!(Some(twenty_seven), three.checked_pow(3));
assert_eq!(None, half_max.checked_pow(3));
1.64.0 (const: 1.64.0) · Sourcepub const fn saturating_pow(self, other: u32) -> NonZero<isize>
pub const fn saturating_pow(self, other: u32) -> NonZero<isize>
Raise non-zero value to an integer power.
Return NonZero::<isize>::MIN
or NonZero::<isize>::MAX
on overflow.
§Examples
let three = NonZero::new(3isize)?;
let twenty_seven = NonZero::new(27isize)?;
let max = NonZero::new(isize::MAX)?;
assert_eq!(twenty_seven, three.saturating_pow(3));
assert_eq!(max, max.saturating_pow(3));
Trait Implementations§
§impl Archive for NonZero<i128>
impl Archive for NonZero<i128>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<i128>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<i128>>
serialize
. Read more§type Archived = NonZeroI128_le
type Archived = NonZeroI128_le
§impl Archive for NonZero<i16>
impl Archive for NonZero<i16>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<i16>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<i16>>
serialize
. Read more§type Archived = NonZeroI16_le
type Archived = NonZeroI16_le
§impl Archive for NonZero<i32>
impl Archive for NonZero<i32>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<i32>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<i32>>
serialize
. Read more§type Archived = NonZeroI32_le
type Archived = NonZeroI32_le
§impl Archive for NonZero<i64>
impl Archive for NonZero<i64>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<i64>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<i64>>
serialize
. Read more§type Archived = NonZeroI64_le
type Archived = NonZeroI64_le
§impl Archive for NonZero<i8>
impl Archive for NonZero<i8>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<i8>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<i8>>
serialize
. Read more§impl Archive for NonZero<isize>
impl Archive for NonZero<isize>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<isize>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<isize>>
serialize
. Read more§type Archived = NonZeroI32_le
type Archived = NonZeroI32_le
§impl Archive for NonZero<u128>
impl Archive for NonZero<u128>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<u128>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<u128>>
serialize
. Read more§type Archived = NonZeroU128_le
type Archived = NonZeroU128_le
§impl Archive for NonZero<u16>
impl Archive for NonZero<u16>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<u16>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<u16>>
serialize
. Read more§type Archived = NonZeroU16_le
type Archived = NonZeroU16_le
§impl Archive for NonZero<u32>
impl Archive for NonZero<u32>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<u32>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<u32>>
serialize
. Read more§type Archived = NonZeroU32_le
type Archived = NonZeroU32_le
§impl Archive for NonZero<u64>
impl Archive for NonZero<u64>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<u64>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<u64>>
serialize
. Read more§type Archived = NonZeroU64_le
type Archived = NonZeroU64_le
§impl Archive for NonZero<u8>
impl Archive for NonZero<u8>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<u8>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<u8>>
serialize
. Read more§impl Archive for NonZero<usize>
impl Archive for NonZero<usize>
§const COPY_OPTIMIZATION: CopyOptimization<NonZero<usize>>
const COPY_OPTIMIZATION: CopyOptimization<NonZero<usize>>
serialize
. Read more§type Archived = NonZeroU32_le
type Archived = NonZeroU32_le
§impl BitOr<&NonZeroI128_be> for NonZero<i128>
impl BitOr<&NonZeroI128_be> for NonZero<i128>
§impl BitOr<&NonZeroI128_le> for NonZero<i128>
impl BitOr<&NonZeroI128_le> for NonZero<i128>
§impl BitOr<&NonZeroI128_ube> for NonZero<i128>
impl BitOr<&NonZeroI128_ube> for NonZero<i128>
§impl BitOr<&NonZeroI128_ule> for NonZero<i128>
impl BitOr<&NonZeroI128_ule> for NonZero<i128>
§impl BitOr<&NonZeroI16_be> for NonZero<i16>
impl BitOr<&NonZeroI16_be> for NonZero<i16>
§impl BitOr<&NonZeroI16_le> for NonZero<i16>
impl BitOr<&NonZeroI16_le> for NonZero<i16>
§impl BitOr<&NonZeroI16_ube> for NonZero<i16>
impl BitOr<&NonZeroI16_ube> for NonZero<i16>
§impl BitOr<&NonZeroI16_ule> for NonZero<i16>
impl BitOr<&NonZeroI16_ule> for NonZero<i16>
§impl BitOr<&NonZeroI32_be> for NonZero<i32>
impl BitOr<&NonZeroI32_be> for NonZero<i32>
§impl BitOr<&NonZeroI32_le> for NonZero<i32>
impl BitOr<&NonZeroI32_le> for NonZero<i32>
§impl BitOr<&NonZeroI32_ube> for NonZero<i32>
impl BitOr<&NonZeroI32_ube> for NonZero<i32>
§impl BitOr<&NonZeroI32_ule> for NonZero<i32>
impl BitOr<&NonZeroI32_ule> for NonZero<i32>
§impl BitOr<&NonZeroI64_be> for NonZero<i64>
impl BitOr<&NonZeroI64_be> for NonZero<i64>
§impl BitOr<&NonZeroI64_le> for NonZero<i64>
impl BitOr<&NonZeroI64_le> for NonZero<i64>
§impl BitOr<&NonZeroI64_ube> for NonZero<i64>
impl BitOr<&NonZeroI64_ube> for NonZero<i64>
§impl BitOr<&NonZeroI64_ule> for NonZero<i64>
impl BitOr<&NonZeroI64_ule> for NonZero<i64>
§impl BitOr<&NonZeroU128_be> for NonZero<u128>
impl BitOr<&NonZeroU128_be> for NonZero<u128>
§impl BitOr<&NonZeroU128_le> for NonZero<u128>
impl BitOr<&NonZeroU128_le> for NonZero<u128>
§impl BitOr<&NonZeroU128_ube> for NonZero<u128>
impl BitOr<&NonZeroU128_ube> for NonZero<u128>
§impl BitOr<&NonZeroU128_ule> for NonZero<u128>
impl BitOr<&NonZeroU128_ule> for NonZero<u128>
§impl BitOr<&NonZeroU16_be> for NonZero<u16>
impl BitOr<&NonZeroU16_be> for NonZero<u16>
§impl BitOr<&NonZeroU16_le> for NonZero<u16>
impl BitOr<&NonZeroU16_le> for NonZero<u16>
§impl BitOr<&NonZeroU16_ube> for NonZero<u16>
impl BitOr<&NonZeroU16_ube> for NonZero<u16>
§impl BitOr<&NonZeroU16_ule> for NonZero<u16>
impl BitOr<&NonZeroU16_ule> for NonZero<u16>
§impl BitOr<&NonZeroU32_be> for NonZero<u32>
impl BitOr<&NonZeroU32_be> for NonZero<u32>
§impl BitOr<&NonZeroU32_le> for NonZero<u32>
impl BitOr<&NonZeroU32_le> for NonZero<u32>
§impl BitOr<&NonZeroU32_ube> for NonZero<u32>
impl BitOr<&NonZeroU32_ube> for NonZero<u32>
§impl BitOr<&NonZeroU32_ule> for NonZero<u32>
impl BitOr<&NonZeroU32_ule> for NonZero<u32>
§impl BitOr<&NonZeroU64_be> for NonZero<u64>
impl BitOr<&NonZeroU64_be> for NonZero<u64>
§impl BitOr<&NonZeroU64_le> for NonZero<u64>
impl BitOr<&NonZeroU64_le> for NonZero<u64>
§impl BitOr<&NonZeroU64_ube> for NonZero<u64>
impl BitOr<&NonZeroU64_ube> for NonZero<u64>
§impl BitOr<&NonZeroU64_ule> for NonZero<u64>
impl BitOr<&NonZeroU64_ule> for NonZero<u64>
§impl BitOr<NonZero<i128>> for &NonZeroI128_be
impl BitOr<NonZero<i128>> for &NonZeroI128_be
§impl BitOr<NonZero<i128>> for &NonZeroI128_le
impl BitOr<NonZero<i128>> for &NonZeroI128_le
§impl BitOr<NonZero<i128>> for &NonZeroI128_ube
impl BitOr<NonZero<i128>> for &NonZeroI128_ube
§impl BitOr<NonZero<i128>> for &NonZeroI128_ule
impl BitOr<NonZero<i128>> for &NonZeroI128_ule
§impl BitOr<NonZero<i128>> for NonZeroI128_be
impl BitOr<NonZero<i128>> for NonZeroI128_be
§impl BitOr<NonZero<i128>> for NonZeroI128_le
impl BitOr<NonZero<i128>> for NonZeroI128_le
§impl BitOr<NonZero<i128>> for NonZeroI128_ube
impl BitOr<NonZero<i128>> for NonZeroI128_ube
§impl BitOr<NonZero<i128>> for NonZeroI128_ule
impl BitOr<NonZero<i128>> for NonZeroI128_ule
§impl BitOr<NonZero<i16>> for &NonZeroI16_be
impl BitOr<NonZero<i16>> for &NonZeroI16_be
§impl BitOr<NonZero<i16>> for &NonZeroI16_le
impl BitOr<NonZero<i16>> for &NonZeroI16_le
§impl BitOr<NonZero<i16>> for &NonZeroI16_ube
impl BitOr<NonZero<i16>> for &NonZeroI16_ube
§impl BitOr<NonZero<i16>> for &NonZeroI16_ule
impl BitOr<NonZero<i16>> for &NonZeroI16_ule
§impl BitOr<NonZero<i16>> for NonZeroI16_be
impl BitOr<NonZero<i16>> for NonZeroI16_be
§impl BitOr<NonZero<i16>> for NonZeroI16_le
impl BitOr<NonZero<i16>> for NonZeroI16_le
§impl BitOr<NonZero<i16>> for NonZeroI16_ube
impl BitOr<NonZero<i16>> for NonZeroI16_ube
§impl BitOr<NonZero<i16>> for NonZeroI16_ule
impl BitOr<NonZero<i16>> for NonZeroI16_ule
§impl BitOr<NonZero<i32>> for &NonZeroI32_be
impl BitOr<NonZero<i32>> for &NonZeroI32_be
§impl BitOr<NonZero<i32>> for &NonZeroI32_le
impl BitOr<NonZero<i32>> for &NonZeroI32_le
§impl BitOr<NonZero<i32>> for &NonZeroI32_ube
impl BitOr<NonZero<i32>> for &NonZeroI32_ube
§impl BitOr<NonZero<i32>> for &NonZeroI32_ule
impl BitOr<NonZero<i32>> for &NonZeroI32_ule
§impl BitOr<NonZero<i32>> for NonZeroI32_be
impl BitOr<NonZero<i32>> for NonZeroI32_be
§impl BitOr<NonZero<i32>> for NonZeroI32_le
impl BitOr<NonZero<i32>> for NonZeroI32_le
§impl BitOr<NonZero<i32>> for NonZeroI32_ube
impl BitOr<NonZero<i32>> for NonZeroI32_ube
§impl BitOr<NonZero<i32>> for NonZeroI32_ule
impl BitOr<NonZero<i32>> for NonZeroI32_ule
§impl BitOr<NonZero<i64>> for &NonZeroI64_be
impl BitOr<NonZero<i64>> for &NonZeroI64_be
§impl BitOr<NonZero<i64>> for &NonZeroI64_le
impl BitOr<NonZero<i64>> for &NonZeroI64_le
§impl BitOr<NonZero<i64>> for &NonZeroI64_ube
impl BitOr<NonZero<i64>> for &NonZeroI64_ube
§impl BitOr<NonZero<i64>> for &NonZeroI64_ule
impl BitOr<NonZero<i64>> for &NonZeroI64_ule
§impl BitOr<NonZero<i64>> for NonZeroI64_be
impl BitOr<NonZero<i64>> for NonZeroI64_be
§impl BitOr<NonZero<i64>> for NonZeroI64_le
impl BitOr<NonZero<i64>> for NonZeroI64_le
§impl BitOr<NonZero<i64>> for NonZeroI64_ube
impl BitOr<NonZero<i64>> for NonZeroI64_ube
§impl BitOr<NonZero<i64>> for NonZeroI64_ule
impl BitOr<NonZero<i64>> for NonZeroI64_ule
§impl BitOr<NonZero<u128>> for &NonZeroU128_be
impl BitOr<NonZero<u128>> for &NonZeroU128_be
§impl BitOr<NonZero<u128>> for &NonZeroU128_le
impl BitOr<NonZero<u128>> for &NonZeroU128_le
§impl BitOr<NonZero<u128>> for &NonZeroU128_ube
impl BitOr<NonZero<u128>> for &NonZeroU128_ube
§impl BitOr<NonZero<u128>> for &NonZeroU128_ule
impl BitOr<NonZero<u128>> for &NonZeroU128_ule
§impl BitOr<NonZero<u128>> for NonZeroU128_be
impl BitOr<NonZero<u128>> for NonZeroU128_be
§impl BitOr<NonZero<u128>> for NonZeroU128_le
impl BitOr<NonZero<u128>> for NonZeroU128_le
§impl BitOr<NonZero<u128>> for NonZeroU128_ube
impl BitOr<NonZero<u128>> for NonZeroU128_ube
§impl BitOr<NonZero<u128>> for NonZeroU128_ule
impl BitOr<NonZero<u128>> for NonZeroU128_ule
§impl BitOr<NonZero<u16>> for &NonZeroU16_be
impl BitOr<NonZero<u16>> for &NonZeroU16_be
§impl BitOr<NonZero<u16>> for &NonZeroU16_le
impl BitOr<NonZero<u16>> for &NonZeroU16_le
§impl BitOr<NonZero<u16>> for &NonZeroU16_ube
impl BitOr<NonZero<u16>> for &NonZeroU16_ube
§impl BitOr<NonZero<u16>> for &NonZeroU16_ule
impl BitOr<NonZero<u16>> for &NonZeroU16_ule
§impl BitOr<NonZero<u16>> for NonZeroU16_be
impl BitOr<NonZero<u16>> for NonZeroU16_be
§impl BitOr<NonZero<u16>> for NonZeroU16_le
impl BitOr<NonZero<u16>> for NonZeroU16_le
§impl BitOr<NonZero<u16>> for NonZeroU16_ube
impl BitOr<NonZero<u16>> for NonZeroU16_ube
§impl BitOr<NonZero<u16>> for NonZeroU16_ule
impl BitOr<NonZero<u16>> for NonZeroU16_ule
§impl BitOr<NonZero<u32>> for &NonZeroU32_be
impl BitOr<NonZero<u32>> for &NonZeroU32_be
§impl BitOr<NonZero<u32>> for &NonZeroU32_le
impl BitOr<NonZero<u32>> for &NonZeroU32_le
§impl BitOr<NonZero<u32>> for &NonZeroU32_ube
impl BitOr<NonZero<u32>> for &NonZeroU32_ube
§impl BitOr<NonZero<u32>> for &NonZeroU32_ule
impl BitOr<NonZero<u32>> for &NonZeroU32_ule
§impl BitOr<NonZero<u32>> for NonZeroU32_be
impl BitOr<NonZero<u32>> for NonZeroU32_be
§impl BitOr<NonZero<u32>> for NonZeroU32_le
impl BitOr<NonZero<u32>> for NonZeroU32_le
§impl BitOr<NonZero<u32>> for NonZeroU32_ube
impl BitOr<NonZero<u32>> for NonZeroU32_ube
§impl BitOr<NonZero<u32>> for NonZeroU32_ule
impl BitOr<NonZero<u32>> for NonZeroU32_ule
§impl BitOr<NonZero<u64>> for &NonZeroU64_be
impl BitOr<NonZero<u64>> for &NonZeroU64_be
§impl BitOr<NonZero<u64>> for &NonZeroU64_le
impl BitOr<NonZero<u64>> for &NonZeroU64_le
§impl BitOr<NonZero<u64>> for &NonZeroU64_ube
impl BitOr<NonZero<u64>> for &NonZeroU64_ube
§impl BitOr<NonZero<u64>> for &NonZeroU64_ule
impl BitOr<NonZero<u64>> for &NonZeroU64_ule
§impl BitOr<NonZero<u64>> for NonZeroU64_be
impl BitOr<NonZero<u64>> for NonZeroU64_be
§impl BitOr<NonZero<u64>> for NonZeroU64_le
impl BitOr<NonZero<u64>> for NonZeroU64_le
§impl BitOr<NonZero<u64>> for NonZeroU64_ube
impl BitOr<NonZero<u64>> for NonZeroU64_ube
§impl BitOr<NonZero<u64>> for NonZeroU64_ule
impl BitOr<NonZero<u64>> for NonZeroU64_ule
§impl BitOr<NonZeroI128_be> for NonZero<i128>
impl BitOr<NonZeroI128_be> for NonZero<i128>
§impl BitOr<NonZeroI128_le> for NonZero<i128>
impl BitOr<NonZeroI128_le> for NonZero<i128>
§impl BitOr<NonZeroI128_ube> for NonZero<i128>
impl BitOr<NonZeroI128_ube> for NonZero<i128>
§impl BitOr<NonZeroI128_ule> for NonZero<i128>
impl BitOr<NonZeroI128_ule> for NonZero<i128>
§impl BitOr<NonZeroI16_be> for NonZero<i16>
impl BitOr<NonZeroI16_be> for NonZero<i16>
§impl BitOr<NonZeroI16_le> for NonZero<i16>
impl BitOr<NonZeroI16_le> for NonZero<i16>
§impl BitOr<NonZeroI16_ube> for NonZero<i16>
impl BitOr<NonZeroI16_ube> for NonZero<i16>
§impl BitOr<NonZeroI16_ule> for NonZero<i16>
impl BitOr<NonZeroI16_ule> for NonZero<i16>
§impl BitOr<NonZeroI32_be> for NonZero<i32>
impl BitOr<NonZeroI32_be> for NonZero<i32>
§impl BitOr<NonZeroI32_le> for NonZero<i32>
impl BitOr<NonZeroI32_le> for NonZero<i32>
§impl BitOr<NonZeroI32_ube> for NonZero<i32>
impl BitOr<NonZeroI32_ube> for NonZero<i32>
§impl BitOr<NonZeroI32_ule> for NonZero<i32>
impl BitOr<NonZeroI32_ule> for NonZero<i32>
§impl BitOr<NonZeroI64_be> for NonZero<i64>
impl BitOr<NonZeroI64_be> for NonZero<i64>
§impl BitOr<NonZeroI64_le> for NonZero<i64>
impl BitOr<NonZeroI64_le> for NonZero<i64>
§impl BitOr<NonZeroI64_ube> for NonZero<i64>
impl BitOr<NonZeroI64_ube> for NonZero<i64>
§impl BitOr<NonZeroI64_ule> for NonZero<i64>
impl BitOr<NonZeroI64_ule> for NonZero<i64>
§impl BitOr<NonZeroU128_be> for NonZero<u128>
impl BitOr<NonZeroU128_be> for NonZero<u128>
§impl BitOr<NonZeroU128_le> for NonZero<u128>
impl BitOr<NonZeroU128_le> for NonZero<u128>
§impl BitOr<NonZeroU128_ube> for NonZero<u128>
impl BitOr<NonZeroU128_ube> for NonZero<u128>
§impl BitOr<NonZeroU128_ule> for NonZero<u128>
impl BitOr<NonZeroU128_ule> for NonZero<u128>
§impl BitOr<NonZeroU16_be> for NonZero<u16>
impl BitOr<NonZeroU16_be> for NonZero<u16>
§impl BitOr<NonZeroU16_le> for NonZero<u16>
impl BitOr<NonZeroU16_le> for NonZero<u16>
§impl BitOr<NonZeroU16_ube> for NonZero<u16>
impl BitOr<NonZeroU16_ube> for NonZero<u16>
§impl BitOr<NonZeroU16_ule> for NonZero<u16>
impl BitOr<NonZeroU16_ule> for NonZero<u16>
§impl BitOr<NonZeroU32_be> for NonZero<u32>
impl BitOr<NonZeroU32_be> for NonZero<u32>
§impl BitOr<NonZeroU32_le> for NonZero<u32>
impl BitOr<NonZeroU32_le> for NonZero<u32>
§impl BitOr<NonZeroU32_ube> for NonZero<u32>
impl BitOr<NonZeroU32_ube> for NonZero<u32>
§impl BitOr<NonZeroU32_ule> for NonZero<u32>
impl BitOr<NonZeroU32_ule> for NonZero<u32>
§impl BitOr<NonZeroU64_be> for NonZero<u64>
impl BitOr<NonZeroU64_be> for NonZero<u64>
§impl BitOr<NonZeroU64_le> for NonZero<u64>
impl BitOr<NonZeroU64_le> for NonZero<u64>
§impl BitOr<NonZeroU64_ube> for NonZero<u64>
impl BitOr<NonZeroU64_ube> for NonZero<u64>
§impl BitOr<NonZeroU64_ule> for NonZero<u64>
impl BitOr<NonZeroU64_ule> for NonZero<u64>
§impl BitOrAssign<NonZero<i128>> for NonZeroI128_be
impl BitOrAssign<NonZero<i128>> for NonZeroI128_be
§fn bitor_assign(&mut self, other: NonZero<i128>)
fn bitor_assign(&mut self, other: NonZero<i128>)
|=
operation. Read more§impl BitOrAssign<NonZero<i128>> for NonZeroI128_le
impl BitOrAssign<NonZero<i128>> for NonZeroI128_le
§fn bitor_assign(&mut self, other: NonZero<i128>)
fn bitor_assign(&mut self, other: NonZero<i128>)
|=
operation. Read more§impl BitOrAssign<NonZero<i128>> for NonZeroI128_ube
impl BitOrAssign<NonZero<i128>> for NonZeroI128_ube
§fn bitor_assign(&mut self, other: NonZero<i128>)
fn bitor_assign(&mut self, other: NonZero<i128>)
|=
operation. Read more§impl BitOrAssign<NonZero<i128>> for NonZeroI128_ule
impl BitOrAssign<NonZero<i128>> for NonZeroI128_ule
§fn bitor_assign(&mut self, other: NonZero<i128>)
fn bitor_assign(&mut self, other: NonZero<i128>)
|=
operation. Read more§impl BitOrAssign<NonZero<i16>> for NonZeroI16_be
impl BitOrAssign<NonZero<i16>> for NonZeroI16_be
§fn bitor_assign(&mut self, other: NonZero<i16>)
fn bitor_assign(&mut self, other: NonZero<i16>)
|=
operation. Read more§impl BitOrAssign<NonZero<i16>> for NonZeroI16_le
impl BitOrAssign<NonZero<i16>> for NonZeroI16_le
§fn bitor_assign(&mut self, other: NonZero<i16>)
fn bitor_assign(&mut self, other: NonZero<i16>)
|=
operation. Read more§impl BitOrAssign<NonZero<i16>> for NonZeroI16_ube
impl BitOrAssign<NonZero<i16>> for NonZeroI16_ube
§fn bitor_assign(&mut self, other: NonZero<i16>)
fn bitor_assign(&mut self, other: NonZero<i16>)
|=
operation. Read more§impl BitOrAssign<NonZero<i16>> for NonZeroI16_ule
impl BitOrAssign<NonZero<i16>> for NonZeroI16_ule
§fn bitor_assign(&mut self, other: NonZero<i16>)
fn bitor_assign(&mut self, other: NonZero<i16>)
|=
operation. Read more§impl BitOrAssign<NonZero<i32>> for NonZeroI32_be
impl BitOrAssign<NonZero<i32>> for NonZeroI32_be
§fn bitor_assign(&mut self, other: NonZero<i32>)
fn bitor_assign(&mut self, other: NonZero<i32>)
|=
operation. Read more§impl BitOrAssign<NonZero<i32>> for NonZeroI32_le
impl BitOrAssign<NonZero<i32>> for NonZeroI32_le
§fn bitor_assign(&mut self, other: NonZero<i32>)
fn bitor_assign(&mut self, other: NonZero<i32>)
|=
operation. Read more§impl BitOrAssign<NonZero<i32>> for NonZeroI32_ube
impl BitOrAssign<NonZero<i32>> for NonZeroI32_ube
§fn bitor_assign(&mut self, other: NonZero<i32>)
fn bitor_assign(&mut self, other: NonZero<i32>)
|=
operation. Read more§impl BitOrAssign<NonZero<i32>> for NonZeroI32_ule
impl BitOrAssign<NonZero<i32>> for NonZeroI32_ule
§fn bitor_assign(&mut self, other: NonZero<i32>)
fn bitor_assign(&mut self, other: NonZero<i32>)
|=
operation. Read more§impl BitOrAssign<NonZero<i64>> for NonZeroI64_be
impl BitOrAssign<NonZero<i64>> for NonZeroI64_be
§fn bitor_assign(&mut self, other: NonZero<i64>)
fn bitor_assign(&mut self, other: NonZero<i64>)
|=
operation. Read more§impl BitOrAssign<NonZero<i64>> for NonZeroI64_le
impl BitOrAssign<NonZero<i64>> for NonZeroI64_le
§fn bitor_assign(&mut self, other: NonZero<i64>)
fn bitor_assign(&mut self, other: NonZero<i64>)
|=
operation. Read more§impl BitOrAssign<NonZero<i64>> for NonZeroI64_ube
impl BitOrAssign<NonZero<i64>> for NonZeroI64_ube
§fn bitor_assign(&mut self, other: NonZero<i64>)
fn bitor_assign(&mut self, other: NonZero<i64>)
|=
operation. Read more§impl BitOrAssign<NonZero<i64>> for NonZeroI64_ule
impl BitOrAssign<NonZero<i64>> for NonZeroI64_ule
§fn bitor_assign(&mut self, other: NonZero<i64>)
fn bitor_assign(&mut self, other: NonZero<i64>)
|=
operation. Read more§impl BitOrAssign<NonZero<u128>> for NonZeroU128_be
impl BitOrAssign<NonZero<u128>> for NonZeroU128_be
§fn bitor_assign(&mut self, other: NonZero<u128>)
fn bitor_assign(&mut self, other: NonZero<u128>)
|=
operation. Read more§impl BitOrAssign<NonZero<u128>> for NonZeroU128_le
impl BitOrAssign<NonZero<u128>> for NonZeroU128_le
§fn bitor_assign(&mut self, other: NonZero<u128>)
fn bitor_assign(&mut self, other: NonZero<u128>)
|=
operation. Read more§impl BitOrAssign<NonZero<u128>> for NonZeroU128_ube
impl BitOrAssign<NonZero<u128>> for NonZeroU128_ube
§fn bitor_assign(&mut self, other: NonZero<u128>)
fn bitor_assign(&mut self, other: NonZero<u128>)
|=
operation. Read more§impl BitOrAssign<NonZero<u128>> for NonZeroU128_ule
impl BitOrAssign<NonZero<u128>> for NonZeroU128_ule
§fn bitor_assign(&mut self, other: NonZero<u128>)
fn bitor_assign(&mut self, other: NonZero<u128>)
|=
operation. Read more§impl BitOrAssign<NonZero<u16>> for NonZeroU16_be
impl BitOrAssign<NonZero<u16>> for NonZeroU16_be
§fn bitor_assign(&mut self, other: NonZero<u16>)
fn bitor_assign(&mut self, other: NonZero<u16>)
|=
operation. Read more§impl BitOrAssign<NonZero<u16>> for NonZeroU16_le
impl BitOrAssign<NonZero<u16>> for NonZeroU16_le
§fn bitor_assign(&mut self, other: NonZero<u16>)
fn bitor_assign(&mut self, other: NonZero<u16>)
|=
operation. Read more§impl BitOrAssign<NonZero<u16>> for NonZeroU16_ube
impl BitOrAssign<NonZero<u16>> for NonZeroU16_ube
§fn bitor_assign(&mut self, other: NonZero<u16>)
fn bitor_assign(&mut self, other: NonZero<u16>)
|=
operation. Read more§impl BitOrAssign<NonZero<u16>> for NonZeroU16_ule
impl BitOrAssign<NonZero<u16>> for NonZeroU16_ule
§fn bitor_assign(&mut self, other: NonZero<u16>)
fn bitor_assign(&mut self, other: NonZero<u16>)
|=
operation. Read more§impl BitOrAssign<NonZero<u32>> for NonZeroU32_be
impl BitOrAssign<NonZero<u32>> for NonZeroU32_be
§fn bitor_assign(&mut self, other: NonZero<u32>)
fn bitor_assign(&mut self, other: NonZero<u32>)
|=
operation. Read more§impl BitOrAssign<NonZero<u32>> for NonZeroU32_le
impl BitOrAssign<NonZero<u32>> for NonZeroU32_le
§fn bitor_assign(&mut self, other: NonZero<u32>)
fn bitor_assign(&mut self, other: NonZero<u32>)
|=
operation. Read more§impl BitOrAssign<NonZero<u32>> for NonZeroU32_ube
impl BitOrAssign<NonZero<u32>> for NonZeroU32_ube
§fn bitor_assign(&mut self, other: NonZero<u32>)
fn bitor_assign(&mut self, other: NonZero<u32>)
|=
operation. Read more§impl BitOrAssign<NonZero<u32>> for NonZeroU32_ule
impl BitOrAssign<NonZero<u32>> for NonZeroU32_ule
§fn bitor_assign(&mut self, other: NonZero<u32>)
fn bitor_assign(&mut self, other: NonZero<u32>)
|=
operation. Read more§impl BitOrAssign<NonZero<u64>> for NonZeroU64_be
impl BitOrAssign<NonZero<u64>> for NonZeroU64_be
§fn bitor_assign(&mut self, other: NonZero<u64>)
fn bitor_assign(&mut self, other: NonZero<u64>)
|=
operation. Read more§impl BitOrAssign<NonZero<u64>> for NonZeroU64_le
impl BitOrAssign<NonZero<u64>> for NonZeroU64_le
§fn bitor_assign(&mut self, other: NonZero<u64>)
fn bitor_assign(&mut self, other: NonZero<u64>)
|=
operation. Read more§impl BitOrAssign<NonZero<u64>> for NonZeroU64_ube
impl BitOrAssign<NonZero<u64>> for NonZeroU64_ube
§fn bitor_assign(&mut self, other: NonZero<u64>)
fn bitor_assign(&mut self, other: NonZero<u64>)
|=
operation. Read more§impl BitOrAssign<NonZero<u64>> for NonZeroU64_ule
impl BitOrAssign<NonZero<u64>> for NonZeroU64_ule
§fn bitor_assign(&mut self, other: NonZero<u64>)
fn bitor_assign(&mut self, other: NonZero<u64>)
|=
operation. Read more1.45.0 · Source§impl<T> BitOrAssign<T> for NonZero<T>
impl<T> BitOrAssign<T> for NonZero<T>
Source§fn bitor_assign(&mut self, rhs: T)
fn bitor_assign(&mut self, rhs: T)
|=
operation. Read more1.45.0 · Source§impl<T> BitOrAssign for NonZero<T>
impl<T> BitOrAssign for NonZero<T>
Source§fn bitor_assign(&mut self, rhs: NonZero<T>)
fn bitor_assign(&mut self, rhs: NonZero<T>)
|=
operation. Read more§impl<C> CheckBytes<C> for NonZero<i128>
impl<C> CheckBytes<C> for NonZero<i128>
§impl<C> CheckBytes<C> for NonZero<i16>
impl<C> CheckBytes<C> for NonZero<i16>
§impl<C> CheckBytes<C> for NonZero<i32>
impl<C> CheckBytes<C> for NonZero<i32>
§impl<C> CheckBytes<C> for NonZero<i64>
impl<C> CheckBytes<C> for NonZero<i64>
§impl<C> CheckBytes<C> for NonZero<i8>
impl<C> CheckBytes<C> for NonZero<i8>
§impl<C> CheckBytes<C> for NonZero<u128>
impl<C> CheckBytes<C> for NonZero<u128>
§impl<C> CheckBytes<C> for NonZero<u16>
impl<C> CheckBytes<C> for NonZero<u16>
§impl<C> CheckBytes<C> for NonZero<u32>
impl<C> CheckBytes<C> for NonZero<u32>
§impl<C> CheckBytes<C> for NonZero<u64>
impl<C> CheckBytes<C> for NonZero<u64>
§impl<C> CheckBytes<C> for NonZero<u8>
impl<C> CheckBytes<C> for NonZero<u8>
§impl CheckedBitPattern for NonZero<i128>
impl CheckedBitPattern for NonZero<i128>
§type Bits = i128
type Bits = i128
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<i128> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<i128> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<i16>
impl CheckedBitPattern for NonZero<i16>
§type Bits = i16
type Bits = i16
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<i16> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<i16> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<i32>
impl CheckedBitPattern for NonZero<i32>
§type Bits = i32
type Bits = i32
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<i32> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<i32> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<i64>
impl CheckedBitPattern for NonZero<i64>
§type Bits = i64
type Bits = i64
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<i64> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<i64> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<i8>
impl CheckedBitPattern for NonZero<i8>
§type Bits = i8
type Bits = i8
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(bits: &<NonZero<i8> as CheckedBitPattern>::Bits) -> bool
fn is_valid_bit_pattern(bits: &<NonZero<i8> as CheckedBitPattern>::Bits) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<isize>
impl CheckedBitPattern for NonZero<isize>
§type Bits = isize
type Bits = isize
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<isize> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<isize> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<u128>
impl CheckedBitPattern for NonZero<u128>
§type Bits = u128
type Bits = u128
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<u128> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<u128> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<u16>
impl CheckedBitPattern for NonZero<u16>
§type Bits = u16
type Bits = u16
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<u16> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<u16> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<u32>
impl CheckedBitPattern for NonZero<u32>
§type Bits = u32
type Bits = u32
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<u32> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<u32> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<u64>
impl CheckedBitPattern for NonZero<u64>
§type Bits = u64
type Bits = u64
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<u64> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<u64> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<u8>
impl CheckedBitPattern for NonZero<u8>
§type Bits = u8
type Bits = u8
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(bits: &<NonZero<u8> as CheckedBitPattern>::Bits) -> bool
fn is_valid_bit_pattern(bits: &<NonZero<u8> as CheckedBitPattern>::Bits) -> bool
bits
as &Self
.§impl CheckedBitPattern for NonZero<usize>
impl CheckedBitPattern for NonZero<usize>
§type Bits = usize
type Bits = usize
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.§fn is_valid_bit_pattern(
bits: &<NonZero<usize> as CheckedBitPattern>::Bits,
) -> bool
fn is_valid_bit_pattern( bits: &<NonZero<usize> as CheckedBitPattern>::Bits, ) -> bool
bits
as &Self
.1.28.0 · Source§impl<T> Clone for NonZero<T>where
T: ZeroablePrimitive,
impl<T> Clone for NonZero<T>where
T: ZeroablePrimitive,
§impl Contiguous for NonZero<u128>
impl Contiguous for NonZero<u128>
§const MAX_VALUE: u128 = 340_282_366_920_938_463_463_374_607_431_768_211_455u128
const MAX_VALUE: u128 = 340_282_366_920_938_463_463_374_607_431_768_211_455u128
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Contiguous for NonZero<u16>
impl Contiguous for NonZero<u16>
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Contiguous for NonZero<u32>
impl Contiguous for NonZero<u32>
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Contiguous for NonZero<u64>
impl Contiguous for NonZero<u64>
§const MAX_VALUE: u64 = 18_446_744_073_709_551_615u64
const MAX_VALUE: u64 = 18_446_744_073_709_551_615u64
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Contiguous for NonZero<u8>
impl Contiguous for NonZero<u8>
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read more§impl Contiguous for NonZero<usize>
impl Contiguous for NonZero<usize>
§const MAX_VALUE: usize = 18_446_744_073_709_551_615usize
const MAX_VALUE: usize = 18_446_744_073_709_551_615usize
§type Int = usize
type Int = usize
§fn from_integer(value: Self::Int) -> Option<Self> ⓘ
fn from_integer(value: Self::Int) -> Option<Self> ⓘ
value
is within the range for valid instances of this type,
returns Some(converted_value)
, otherwise, returns None
. Read more§fn into_integer(self) -> Self::Int
fn into_integer(self) -> Self::Int
C
into the underlying integral type. This
mostly exists otherwise generic code would need unsafe for the value as integer
Read moreSource§impl<'de> Deserialize<'de> for NonZero<i128>
impl<'de> Deserialize<'de> for NonZero<i128>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i128>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i128>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<i16>
impl<'de> Deserialize<'de> for NonZero<i16>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i16>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i16>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<i32>
impl<'de> Deserialize<'de> for NonZero<i32>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i32>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i32>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<i64>
impl<'de> Deserialize<'de> for NonZero<i64>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i64>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i64>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<i8>
impl<'de> Deserialize<'de> for NonZero<i8>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i8>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<i8>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<isize>
impl<'de> Deserialize<'de> for NonZero<isize>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<isize>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<isize>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<u128>
impl<'de> Deserialize<'de> for NonZero<u128>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u128>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u128>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<u16>
impl<'de> Deserialize<'de> for NonZero<u16>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u16>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u16>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<u32>
impl<'de> Deserialize<'de> for NonZero<u32>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u32>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u32>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<u64>
impl<'de> Deserialize<'de> for NonZero<u64>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u64>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u64>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<u8>
impl<'de> Deserialize<'de> for NonZero<u8>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u8>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<u8>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
Source§impl<'de> Deserialize<'de> for NonZero<usize>
impl<'de> Deserialize<'de> for NonZero<usize>
Source§fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<usize>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<NonZero<usize>, <D as Deserializer<'de>>::Error> ⓘwhere
D: Deserializer<'de>,
§impl<D> Deserialize<NonZero<i128>, D> for NonZeroI128_le
impl<D> Deserialize<NonZero<i128>, D> for NonZeroI128_le
§impl<D> Deserialize<NonZero<i16>, D> for NonZeroI16_le
impl<D> Deserialize<NonZero<i16>, D> for NonZeroI16_le
§impl<D> Deserialize<NonZero<i32>, D> for NonZeroI32_le
impl<D> Deserialize<NonZero<i32>, D> for NonZeroI32_le
§impl<D> Deserialize<NonZero<i64>, D> for NonZeroI64_le
impl<D> Deserialize<NonZero<i64>, D> for NonZeroI64_le
§impl<D> Deserialize<NonZero<isize>, D> for NonZeroI32_le
impl<D> Deserialize<NonZero<isize>, D> for NonZeroI32_le
§impl<D> Deserialize<NonZero<u128>, D> for NonZeroU128_le
impl<D> Deserialize<NonZero<u128>, D> for NonZeroU128_le
§impl<D> Deserialize<NonZero<u16>, D> for NonZeroU16_le
impl<D> Deserialize<NonZero<u16>, D> for NonZeroU16_le
§impl<D> Deserialize<NonZero<u32>, D> for NonZeroU32_le
impl<D> Deserialize<NonZero<u32>, D> for NonZeroU32_le
§impl<D> Deserialize<NonZero<u64>, D> for NonZeroU64_le
impl<D> Deserialize<NonZero<u64>, D> for NonZeroU64_le
§impl<D> Deserialize<NonZero<usize>, D> for NonZeroU32_le
impl<D> Deserialize<NonZero<usize>, D> for NonZeroU32_le
1.79.0 · Source§impl DivAssign<NonZero<u128>> for u128
impl DivAssign<NonZero<u128>> for u128
Source§fn div_assign(&mut self, other: NonZero<u128>)
fn div_assign(&mut self, other: NonZero<u128>)
This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.
1.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.79.0 · Source§impl DivAssign<NonZero<u32>> for u32
impl DivAssign<NonZero<u32>> for u32
Source§fn div_assign(&mut self, other: NonZero<u32>)
fn div_assign(&mut self, other: NonZero<u32>)
This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.
1.79.0 · Source§impl DivAssign<NonZero<u64>> for u64
impl DivAssign<NonZero<u64>> for u64
Source§fn div_assign(&mut self, other: NonZero<u64>)
fn div_assign(&mut self, other: NonZero<u64>)
This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.
1.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.79.0 · Source§impl DivAssign<NonZero<usize>> for usize
impl DivAssign<NonZero<usize>> for usize
Source§fn div_assign(&mut self, other: NonZero<usize>)
fn div_assign(&mut self, other: NonZero<usize>)
This operation rounds towards zero, truncating any fractional part of the exact result, and cannot panic.
§impl<'a> From<&'a NonZero<i128>> for NonZeroI128_be
impl<'a> From<&'a NonZero<i128>> for NonZeroI128_be
§fn from(value: &'a NonZero<i128>) -> NonZeroI128_be
fn from(value: &'a NonZero<i128>) -> NonZeroI128_be
§impl<'a> From<&'a NonZero<i128>> for NonZeroI128_le
impl<'a> From<&'a NonZero<i128>> for NonZeroI128_le
§fn from(value: &'a NonZero<i128>) -> NonZeroI128_le
fn from(value: &'a NonZero<i128>) -> NonZeroI128_le
§impl<'a> From<&'a NonZero<i128>> for NonZeroI128_ube
impl<'a> From<&'a NonZero<i128>> for NonZeroI128_ube
§fn from(value: &'a NonZero<i128>) -> NonZeroI128_ube
fn from(value: &'a NonZero<i128>) -> NonZeroI128_ube
§impl<'a> From<&'a NonZero<i128>> for NonZeroI128_ule
impl<'a> From<&'a NonZero<i128>> for NonZeroI128_ule
§fn from(value: &'a NonZero<i128>) -> NonZeroI128_ule
fn from(value: &'a NonZero<i128>) -> NonZeroI128_ule
§impl<'a> From<&'a NonZero<i16>> for NonZeroI16_be
impl<'a> From<&'a NonZero<i16>> for NonZeroI16_be
§fn from(value: &'a NonZero<i16>) -> NonZeroI16_be
fn from(value: &'a NonZero<i16>) -> NonZeroI16_be
§impl<'a> From<&'a NonZero<i16>> for NonZeroI16_le
impl<'a> From<&'a NonZero<i16>> for NonZeroI16_le
§fn from(value: &'a NonZero<i16>) -> NonZeroI16_le
fn from(value: &'a NonZero<i16>) -> NonZeroI16_le
§impl<'a> From<&'a NonZero<i16>> for NonZeroI16_ube
impl<'a> From<&'a NonZero<i16>> for NonZeroI16_ube
§fn from(value: &'a NonZero<i16>) -> NonZeroI16_ube
fn from(value: &'a NonZero<i16>) -> NonZeroI16_ube
§impl<'a> From<&'a NonZero<i16>> for NonZeroI16_ule
impl<'a> From<&'a NonZero<i16>> for NonZeroI16_ule
§fn from(value: &'a NonZero<i16>) -> NonZeroI16_ule
fn from(value: &'a NonZero<i16>) -> NonZeroI16_ule
§impl<'a> From<&'a NonZero<i32>> for NonZeroI32_be
impl<'a> From<&'a NonZero<i32>> for NonZeroI32_be
§fn from(value: &'a NonZero<i32>) -> NonZeroI32_be
fn from(value: &'a NonZero<i32>) -> NonZeroI32_be
§impl<'a> From<&'a NonZero<i32>> for NonZeroI32_le
impl<'a> From<&'a NonZero<i32>> for NonZeroI32_le
§fn from(value: &'a NonZero<i32>) -> NonZeroI32_le
fn from(value: &'a NonZero<i32>) -> NonZeroI32_le
§impl<'a> From<&'a NonZero<i32>> for NonZeroI32_ube
impl<'a> From<&'a NonZero<i32>> for NonZeroI32_ube
§fn from(value: &'a NonZero<i32>) -> NonZeroI32_ube
fn from(value: &'a NonZero<i32>) -> NonZeroI32_ube
§impl<'a> From<&'a NonZero<i32>> for NonZeroI32_ule
impl<'a> From<&'a NonZero<i32>> for NonZeroI32_ule
§fn from(value: &'a NonZero<i32>) -> NonZeroI32_ule
fn from(value: &'a NonZero<i32>) -> NonZeroI32_ule
§impl<'a> From<&'a NonZero<i64>> for NonZeroI64_be
impl<'a> From<&'a NonZero<i64>> for NonZeroI64_be
§fn from(value: &'a NonZero<i64>) -> NonZeroI64_be
fn from(value: &'a NonZero<i64>) -> NonZeroI64_be
§impl<'a> From<&'a NonZero<i64>> for NonZeroI64_le
impl<'a> From<&'a NonZero<i64>> for NonZeroI64_le
§fn from(value: &'a NonZero<i64>) -> NonZeroI64_le
fn from(value: &'a NonZero<i64>) -> NonZeroI64_le
§impl<'a> From<&'a NonZero<i64>> for NonZeroI64_ube
impl<'a> From<&'a NonZero<i64>> for NonZeroI64_ube
§fn from(value: &'a NonZero<i64>) -> NonZeroI64_ube
fn from(value: &'a NonZero<i64>) -> NonZeroI64_ube
§impl<'a> From<&'a NonZero<i64>> for NonZeroI64_ule
impl<'a> From<&'a NonZero<i64>> for NonZeroI64_ule
§fn from(value: &'a NonZero<i64>) -> NonZeroI64_ule
fn from(value: &'a NonZero<i64>) -> NonZeroI64_ule
§impl<'a> From<&'a NonZero<u128>> for NonZeroU128_be
impl<'a> From<&'a NonZero<u128>> for NonZeroU128_be
§fn from(value: &'a NonZero<u128>) -> NonZeroU128_be
fn from(value: &'a NonZero<u128>) -> NonZeroU128_be
§impl<'a> From<&'a NonZero<u128>> for NonZeroU128_le
impl<'a> From<&'a NonZero<u128>> for NonZeroU128_le
§fn from(value: &'a NonZero<u128>) -> NonZeroU128_le
fn from(value: &'a NonZero<u128>) -> NonZeroU128_le
§impl<'a> From<&'a NonZero<u128>> for NonZeroU128_ube
impl<'a> From<&'a NonZero<u128>> for NonZeroU128_ube
§fn from(value: &'a NonZero<u128>) -> NonZeroU128_ube
fn from(value: &'a NonZero<u128>) -> NonZeroU128_ube
§impl<'a> From<&'a NonZero<u128>> for NonZeroU128_ule
impl<'a> From<&'a NonZero<u128>> for NonZeroU128_ule
§fn from(value: &'a NonZero<u128>) -> NonZeroU128_ule
fn from(value: &'a NonZero<u128>) -> NonZeroU128_ule
§impl<'a> From<&'a NonZero<u16>> for NonZeroU16_be
impl<'a> From<&'a NonZero<u16>> for NonZeroU16_be
§fn from(value: &'a NonZero<u16>) -> NonZeroU16_be
fn from(value: &'a NonZero<u16>) -> NonZeroU16_be
§impl<'a> From<&'a NonZero<u16>> for NonZeroU16_le
impl<'a> From<&'a NonZero<u16>> for NonZeroU16_le
§fn from(value: &'a NonZero<u16>) -> NonZeroU16_le
fn from(value: &'a NonZero<u16>) -> NonZeroU16_le
§impl<'a> From<&'a NonZero<u16>> for NonZeroU16_ube
impl<'a> From<&'a NonZero<u16>> for NonZeroU16_ube
§fn from(value: &'a NonZero<u16>) -> NonZeroU16_ube
fn from(value: &'a NonZero<u16>) -> NonZeroU16_ube
§impl<'a> From<&'a NonZero<u16>> for NonZeroU16_ule
impl<'a> From<&'a NonZero<u16>> for NonZeroU16_ule
§fn from(value: &'a NonZero<u16>) -> NonZeroU16_ule
fn from(value: &'a NonZero<u16>) -> NonZeroU16_ule
§impl<'a> From<&'a NonZero<u32>> for NonZeroU32_be
impl<'a> From<&'a NonZero<u32>> for NonZeroU32_be
§fn from(value: &'a NonZero<u32>) -> NonZeroU32_be
fn from(value: &'a NonZero<u32>) -> NonZeroU32_be
§impl<'a> From<&'a NonZero<u32>> for NonZeroU32_le
impl<'a> From<&'a NonZero<u32>> for NonZeroU32_le
§fn from(value: &'a NonZero<u32>) -> NonZeroU32_le
fn from(value: &'a NonZero<u32>) -> NonZeroU32_le
§impl<'a> From<&'a NonZero<u32>> for NonZeroU32_ube
impl<'a> From<&'a NonZero<u32>> for NonZeroU32_ube
§fn from(value: &'a NonZero<u32>) -> NonZeroU32_ube
fn from(value: &'a NonZero<u32>) -> NonZeroU32_ube
§impl<'a> From<&'a NonZero<u32>> for NonZeroU32_ule
impl<'a> From<&'a NonZero<u32>> for NonZeroU32_ule
§fn from(value: &'a NonZero<u32>) -> NonZeroU32_ule
fn from(value: &'a NonZero<u32>) -> NonZeroU32_ule
§impl<'a> From<&'a NonZero<u64>> for NonZeroU64_be
impl<'a> From<&'a NonZero<u64>> for NonZeroU64_be
§fn from(value: &'a NonZero<u64>) -> NonZeroU64_be
fn from(value: &'a NonZero<u64>) -> NonZeroU64_be
§impl<'a> From<&'a NonZero<u64>> for NonZeroU64_le
impl<'a> From<&'a NonZero<u64>> for NonZeroU64_le
§fn from(value: &'a NonZero<u64>) -> NonZeroU64_le
fn from(value: &'a NonZero<u64>) -> NonZeroU64_le
§impl<'a> From<&'a NonZero<u64>> for NonZeroU64_ube
impl<'a> From<&'a NonZero<u64>> for NonZeroU64_ube
§fn from(value: &'a NonZero<u64>) -> NonZeroU64_ube
fn from(value: &'a NonZero<u64>) -> NonZeroU64_ube
§impl<'a> From<&'a NonZero<u64>> for NonZeroU64_ule
impl<'a> From<&'a NonZero<u64>> for NonZeroU64_ule
§fn from(value: &'a NonZero<u64>) -> NonZeroU64_ule
fn from(value: &'a NonZero<u64>) -> NonZeroU64_ule
§impl<'a> From<&'a NonZeroI128_be> for NonZero<i128>
impl<'a> From<&'a NonZeroI128_be> for NonZero<i128>
§fn from(value: &'a NonZeroI128_be) -> NonZero<i128>
fn from(value: &'a NonZeroI128_be) -> NonZero<i128>
§impl<'a> From<&'a NonZeroI128_le> for NonZero<i128>
impl<'a> From<&'a NonZeroI128_le> for NonZero<i128>
§fn from(value: &'a NonZeroI128_le) -> NonZero<i128>
fn from(value: &'a NonZeroI128_le) -> NonZero<i128>
§impl<'a> From<&'a NonZeroI128_ube> for NonZero<i128>
impl<'a> From<&'a NonZeroI128_ube> for NonZero<i128>
§fn from(value: &'a NonZeroI128_ube) -> NonZero<i128>
fn from(value: &'a NonZeroI128_ube) -> NonZero<i128>
§impl<'a> From<&'a NonZeroI128_ule> for NonZero<i128>
impl<'a> From<&'a NonZeroI128_ule> for NonZero<i128>
§fn from(value: &'a NonZeroI128_ule) -> NonZero<i128>
fn from(value: &'a NonZeroI128_ule) -> NonZero<i128>
§impl<'a> From<&'a NonZeroI16_be> for NonZero<i16>
impl<'a> From<&'a NonZeroI16_be> for NonZero<i16>
§fn from(value: &'a NonZeroI16_be) -> NonZero<i16>
fn from(value: &'a NonZeroI16_be) -> NonZero<i16>
§impl<'a> From<&'a NonZeroI16_le> for NonZero<i16>
impl<'a> From<&'a NonZeroI16_le> for NonZero<i16>
§fn from(value: &'a NonZeroI16_le) -> NonZero<i16>
fn from(value: &'a NonZeroI16_le) -> NonZero<i16>
§impl<'a> From<&'a NonZeroI16_ube> for NonZero<i16>
impl<'a> From<&'a NonZeroI16_ube> for NonZero<i16>
§fn from(value: &'a NonZeroI16_ube) -> NonZero<i16>
fn from(value: &'a NonZeroI16_ube) -> NonZero<i16>
§impl<'a> From<&'a NonZeroI16_ule> for NonZero<i16>
impl<'a> From<&'a NonZeroI16_ule> for NonZero<i16>
§fn from(value: &'a NonZeroI16_ule) -> NonZero<i16>
fn from(value: &'a NonZeroI16_ule) -> NonZero<i16>
§impl<'a> From<&'a NonZeroI32_be> for NonZero<i32>
impl<'a> From<&'a NonZeroI32_be> for NonZero<i32>
§fn from(value: &'a NonZeroI32_be) -> NonZero<i32>
fn from(value: &'a NonZeroI32_be) -> NonZero<i32>
§impl<'a> From<&'a NonZeroI32_le> for NonZero<i32>
impl<'a> From<&'a NonZeroI32_le> for NonZero<i32>
§fn from(value: &'a NonZeroI32_le) -> NonZero<i32>
fn from(value: &'a NonZeroI32_le) -> NonZero<i32>
§impl<'a> From<&'a NonZeroI32_ube> for NonZero<i32>
impl<'a> From<&'a NonZeroI32_ube> for NonZero<i32>
§fn from(value: &'a NonZeroI32_ube) -> NonZero<i32>
fn from(value: &'a NonZeroI32_ube) -> NonZero<i32>
§impl<'a> From<&'a NonZeroI32_ule> for NonZero<i32>
impl<'a> From<&'a NonZeroI32_ule> for NonZero<i32>
§fn from(value: &'a NonZeroI32_ule) -> NonZero<i32>
fn from(value: &'a NonZeroI32_ule) -> NonZero<i32>
§impl<'a> From<&'a NonZeroI64_be> for NonZero<i64>
impl<'a> From<&'a NonZeroI64_be> for NonZero<i64>
§fn from(value: &'a NonZeroI64_be) -> NonZero<i64>
fn from(value: &'a NonZeroI64_be) -> NonZero<i64>
§impl<'a> From<&'a NonZeroI64_le> for NonZero<i64>
impl<'a> From<&'a NonZeroI64_le> for NonZero<i64>
§fn from(value: &'a NonZeroI64_le) -> NonZero<i64>
fn from(value: &'a NonZeroI64_le) -> NonZero<i64>
§impl<'a> From<&'a NonZeroI64_ube> for NonZero<i64>
impl<'a> From<&'a NonZeroI64_ube> for NonZero<i64>
§fn from(value: &'a NonZeroI64_ube) -> NonZero<i64>
fn from(value: &'a NonZeroI64_ube) -> NonZero<i64>
§impl<'a> From<&'a NonZeroI64_ule> for NonZero<i64>
impl<'a> From<&'a NonZeroI64_ule> for NonZero<i64>
§fn from(value: &'a NonZeroI64_ule) -> NonZero<i64>
fn from(value: &'a NonZeroI64_ule) -> NonZero<i64>
§impl<'a> From<&'a NonZeroU128_be> for NonZero<u128>
impl<'a> From<&'a NonZeroU128_be> for NonZero<u128>
§fn from(value: &'a NonZeroU128_be) -> NonZero<u128>
fn from(value: &'a NonZeroU128_be) -> NonZero<u128>
§impl<'a> From<&'a NonZeroU128_le> for NonZero<u128>
impl<'a> From<&'a NonZeroU128_le> for NonZero<u128>
§fn from(value: &'a NonZeroU128_le) -> NonZero<u128>
fn from(value: &'a NonZeroU128_le) -> NonZero<u128>
§impl<'a> From<&'a NonZeroU128_ube> for NonZero<u128>
impl<'a> From<&'a NonZeroU128_ube> for NonZero<u128>
§fn from(value: &'a NonZeroU128_ube) -> NonZero<u128>
fn from(value: &'a NonZeroU128_ube) -> NonZero<u128>
§impl<'a> From<&'a NonZeroU128_ule> for NonZero<u128>
impl<'a> From<&'a NonZeroU128_ule> for NonZero<u128>
§fn from(value: &'a NonZeroU128_ule) -> NonZero<u128>
fn from(value: &'a NonZeroU128_ule) -> NonZero<u128>
§impl<'a> From<&'a NonZeroU16_be> for NonZero<u16>
impl<'a> From<&'a NonZeroU16_be> for NonZero<u16>
§fn from(value: &'a NonZeroU16_be) -> NonZero<u16>
fn from(value: &'a NonZeroU16_be) -> NonZero<u16>
§impl<'a> From<&'a NonZeroU16_le> for NonZero<u16>
impl<'a> From<&'a NonZeroU16_le> for NonZero<u16>
§fn from(value: &'a NonZeroU16_le) -> NonZero<u16>
fn from(value: &'a NonZeroU16_le) -> NonZero<u16>
§impl<'a> From<&'a NonZeroU16_ube> for NonZero<u16>
impl<'a> From<&'a NonZeroU16_ube> for NonZero<u16>
§fn from(value: &'a NonZeroU16_ube) -> NonZero<u16>
fn from(value: &'a NonZeroU16_ube) -> NonZero<u16>
§impl<'a> From<&'a NonZeroU16_ule> for NonZero<u16>
impl<'a> From<&'a NonZeroU16_ule> for NonZero<u16>
§fn from(value: &'a NonZeroU16_ule) -> NonZero<u16>
fn from(value: &'a NonZeroU16_ule) -> NonZero<u16>
§impl<'a> From<&'a NonZeroU32_be> for NonZero<u32>
impl<'a> From<&'a NonZeroU32_be> for NonZero<u32>
§fn from(value: &'a NonZeroU32_be) -> NonZero<u32>
fn from(value: &'a NonZeroU32_be) -> NonZero<u32>
§impl<'a> From<&'a NonZeroU32_le> for NonZero<u32>
impl<'a> From<&'a NonZeroU32_le> for NonZero<u32>
§fn from(value: &'a NonZeroU32_le) -> NonZero<u32>
fn from(value: &'a NonZeroU32_le) -> NonZero<u32>
§impl<'a> From<&'a NonZeroU32_ube> for NonZero<u32>
impl<'a> From<&'a NonZeroU32_ube> for NonZero<u32>
§fn from(value: &'a NonZeroU32_ube) -> NonZero<u32>
fn from(value: &'a NonZeroU32_ube) -> NonZero<u32>
§impl<'a> From<&'a NonZeroU32_ule> for NonZero<u32>
impl<'a> From<&'a NonZeroU32_ule> for NonZero<u32>
§fn from(value: &'a NonZeroU32_ule) -> NonZero<u32>
fn from(value: &'a NonZeroU32_ule) -> NonZero<u32>
§impl<'a> From<&'a NonZeroU64_be> for NonZero<u64>
impl<'a> From<&'a NonZeroU64_be> for NonZero<u64>
§fn from(value: &'a NonZeroU64_be) -> NonZero<u64>
fn from(value: &'a NonZeroU64_be) -> NonZero<u64>
§impl<'a> From<&'a NonZeroU64_le> for NonZero<u64>
impl<'a> From<&'a NonZeroU64_le> for NonZero<u64>
§fn from(value: &'a NonZeroU64_le) -> NonZero<u64>
fn from(value: &'a NonZeroU64_le) -> NonZero<u64>
§impl<'a> From<&'a NonZeroU64_ube> for NonZero<u64>
impl<'a> From<&'a NonZeroU64_ube> for NonZero<u64>
§fn from(value: &'a NonZeroU64_ube) -> NonZero<u64>
fn from(value: &'a NonZeroU64_ube) -> NonZero<u64>
§impl<'a> From<&'a NonZeroU64_ule> for NonZero<u64>
impl<'a> From<&'a NonZeroU64_ule> for NonZero<u64>
§fn from(value: &'a NonZeroU64_ule) -> NonZero<u64>
fn from(value: &'a NonZeroU64_ule) -> NonZero<u64>
1.31.0 · Source§impl<T> From<NonZero<T>> for Twhere
T: ZeroablePrimitive,
impl<T> From<NonZero<T>> for Twhere
T: ZeroablePrimitive,
§impl From<NonZero<i128>> for NonZeroI128_be
impl From<NonZero<i128>> for NonZeroI128_be
§fn from(value: NonZero<i128>) -> NonZeroI128_be
fn from(value: NonZero<i128>) -> NonZeroI128_be
§impl From<NonZero<i128>> for NonZeroI128_le
impl From<NonZero<i128>> for NonZeroI128_le
§fn from(value: NonZero<i128>) -> NonZeroI128_le
fn from(value: NonZero<i128>) -> NonZeroI128_le
§impl From<NonZero<i128>> for NonZeroI128_ube
impl From<NonZero<i128>> for NonZeroI128_ube
§fn from(value: NonZero<i128>) -> NonZeroI128_ube
fn from(value: NonZero<i128>) -> NonZeroI128_ube
§impl From<NonZero<i128>> for NonZeroI128_ule
impl From<NonZero<i128>> for NonZeroI128_ule
§fn from(value: NonZero<i128>) -> NonZeroI128_ule
fn from(value: NonZero<i128>) -> NonZeroI128_ule
§impl From<NonZero<i16>> for NonZeroI16_be
impl From<NonZero<i16>> for NonZeroI16_be
§fn from(value: NonZero<i16>) -> NonZeroI16_be
fn from(value: NonZero<i16>) -> NonZeroI16_be
§impl From<NonZero<i16>> for NonZeroI16_le
impl From<NonZero<i16>> for NonZeroI16_le
§fn from(value: NonZero<i16>) -> NonZeroI16_le
fn from(value: NonZero<i16>) -> NonZeroI16_le
§impl From<NonZero<i16>> for NonZeroI16_ube
impl From<NonZero<i16>> for NonZeroI16_ube
§fn from(value: NonZero<i16>) -> NonZeroI16_ube
fn from(value: NonZero<i16>) -> NonZeroI16_ube
§impl From<NonZero<i16>> for NonZeroI16_ule
impl From<NonZero<i16>> for NonZeroI16_ule
§fn from(value: NonZero<i16>) -> NonZeroI16_ule
fn from(value: NonZero<i16>) -> NonZeroI16_ule
§impl From<NonZero<i32>> for NonZeroI32_be
impl From<NonZero<i32>> for NonZeroI32_be
§fn from(value: NonZero<i32>) -> NonZeroI32_be
fn from(value: NonZero<i32>) -> NonZeroI32_be
§impl From<NonZero<i32>> for NonZeroI32_le
impl From<NonZero<i32>> for NonZeroI32_le
§fn from(value: NonZero<i32>) -> NonZeroI32_le
fn from(value: NonZero<i32>) -> NonZeroI32_le
§impl From<NonZero<i32>> for NonZeroI32_ube
impl From<NonZero<i32>> for NonZeroI32_ube
§fn from(value: NonZero<i32>) -> NonZeroI32_ube
fn from(value: NonZero<i32>) -> NonZeroI32_ube
§impl From<NonZero<i32>> for NonZeroI32_ule
impl From<NonZero<i32>> for NonZeroI32_ule
§fn from(value: NonZero<i32>) -> NonZeroI32_ule
fn from(value: NonZero<i32>) -> NonZeroI32_ule
§impl From<NonZero<i64>> for NonZeroI64_be
impl From<NonZero<i64>> for NonZeroI64_be
§fn from(value: NonZero<i64>) -> NonZeroI64_be
fn from(value: NonZero<i64>) -> NonZeroI64_be
§impl From<NonZero<i64>> for NonZeroI64_le
impl From<NonZero<i64>> for NonZeroI64_le
§fn from(value: NonZero<i64>) -> NonZeroI64_le
fn from(value: NonZero<i64>) -> NonZeroI64_le
§impl From<NonZero<i64>> for NonZeroI64_ube
impl From<NonZero<i64>> for NonZeroI64_ube
§fn from(value: NonZero<i64>) -> NonZeroI64_ube
fn from(value: NonZero<i64>) -> NonZeroI64_ube
§impl From<NonZero<i64>> for NonZeroI64_ule
impl From<NonZero<i64>> for NonZeroI64_ule
§fn from(value: NonZero<i64>) -> NonZeroI64_ule
fn from(value: NonZero<i64>) -> NonZeroI64_ule
§impl From<NonZero<u128>> for NonZeroU128_be
impl From<NonZero<u128>> for NonZeroU128_be
§fn from(value: NonZero<u128>) -> NonZeroU128_be
fn from(value: NonZero<u128>) -> NonZeroU128_be
§impl From<NonZero<u128>> for NonZeroU128_le
impl From<NonZero<u128>> for NonZeroU128_le
§fn from(value: NonZero<u128>) -> NonZeroU128_le
fn from(value: NonZero<u128>) -> NonZeroU128_le
§impl From<NonZero<u128>> for NonZeroU128_ube
impl From<NonZero<u128>> for NonZeroU128_ube
§fn from(value: NonZero<u128>) -> NonZeroU128_ube
fn from(value: NonZero<u128>) -> NonZeroU128_ube
§impl From<NonZero<u128>> for NonZeroU128_ule
impl From<NonZero<u128>> for NonZeroU128_ule
§fn from(value: NonZero<u128>) -> NonZeroU128_ule
fn from(value: NonZero<u128>) -> NonZeroU128_ule
§impl From<NonZero<u16>> for NonZeroU16_be
impl From<NonZero<u16>> for NonZeroU16_be
§fn from(value: NonZero<u16>) -> NonZeroU16_be
fn from(value: NonZero<u16>) -> NonZeroU16_be
§impl From<NonZero<u16>> for NonZeroU16_le
impl From<NonZero<u16>> for NonZeroU16_le
§fn from(value: NonZero<u16>) -> NonZeroU16_le
fn from(value: NonZero<u16>) -> NonZeroU16_le
§impl From<NonZero<u16>> for NonZeroU16_ube
impl From<NonZero<u16>> for NonZeroU16_ube
§fn from(value: NonZero<u16>) -> NonZeroU16_ube
fn from(value: NonZero<u16>) -> NonZeroU16_ube
§impl From<NonZero<u16>> for NonZeroU16_ule
impl From<NonZero<u16>> for NonZeroU16_ule
§fn from(value: NonZero<u16>) -> NonZeroU16_ule
fn from(value: NonZero<u16>) -> NonZeroU16_ule
§impl From<NonZero<u32>> for NonZeroU32_be
impl From<NonZero<u32>> for NonZeroU32_be
§fn from(value: NonZero<u32>) -> NonZeroU32_be
fn from(value: NonZero<u32>) -> NonZeroU32_be
§impl From<NonZero<u32>> for NonZeroU32_le
impl From<NonZero<u32>> for NonZeroU32_le
§fn from(value: NonZero<u32>) -> NonZeroU32_le
fn from(value: NonZero<u32>) -> NonZeroU32_le
§impl From<NonZero<u32>> for NonZeroU32_ube
impl From<NonZero<u32>> for NonZeroU32_ube
§fn from(value: NonZero<u32>) -> NonZeroU32_ube
fn from(value: NonZero<u32>) -> NonZeroU32_ube
§impl From<NonZero<u32>> for NonZeroU32_ule
impl From<NonZero<u32>> for NonZeroU32_ule
§fn from(value: NonZero<u32>) -> NonZeroU32_ule
fn from(value: NonZero<u32>) -> NonZeroU32_ule
§impl From<NonZero<u64>> for NonZeroU64_be
impl From<NonZero<u64>> for NonZeroU64_be
§fn from(value: NonZero<u64>) -> NonZeroU64_be
fn from(value: NonZero<u64>) -> NonZeroU64_be
§impl From<NonZero<u64>> for NonZeroU64_le
impl From<NonZero<u64>> for NonZeroU64_le
§fn from(value: NonZero<u64>) -> NonZeroU64_le
fn from(value: NonZero<u64>) -> NonZeroU64_le
§impl From<NonZero<u64>> for NonZeroU64_ube
impl From<NonZero<u64>> for NonZeroU64_ube
§fn from(value: NonZero<u64>) -> NonZeroU64_ube
fn from(value: NonZero<u64>) -> NonZeroU64_ube
§impl From<NonZero<u64>> for NonZeroU64_ule
impl From<NonZero<u64>> for NonZeroU64_ule
§fn from(value: NonZero<u64>) -> NonZeroU64_ule
fn from(value: NonZero<u64>) -> NonZeroU64_ule
§impl From<NonZeroI128_be> for NonZero<i128>
impl From<NonZeroI128_be> for NonZero<i128>
§fn from(value: NonZeroI128_be) -> NonZero<i128>
fn from(value: NonZeroI128_be) -> NonZero<i128>
§impl From<NonZeroI128_le> for NonZero<i128>
impl From<NonZeroI128_le> for NonZero<i128>
§fn from(value: NonZeroI128_le) -> NonZero<i128>
fn from(value: NonZeroI128_le) -> NonZero<i128>
§impl From<NonZeroI128_ube> for NonZero<i128>
impl From<NonZeroI128_ube> for NonZero<i128>
§fn from(value: NonZeroI128_ube) -> NonZero<i128>
fn from(value: NonZeroI128_ube) -> NonZero<i128>
§impl From<NonZeroI128_ule> for NonZero<i128>
impl From<NonZeroI128_ule> for NonZero<i128>
§fn from(value: NonZeroI128_ule) -> NonZero<i128>
fn from(value: NonZeroI128_ule) -> NonZero<i128>
§impl From<NonZeroI16_be> for NonZero<i16>
impl From<NonZeroI16_be> for NonZero<i16>
§fn from(value: NonZeroI16_be) -> NonZero<i16>
fn from(value: NonZeroI16_be) -> NonZero<i16>
§impl From<NonZeroI16_le> for NonZero<i16>
impl From<NonZeroI16_le> for NonZero<i16>
§fn from(value: NonZeroI16_le) -> NonZero<i16>
fn from(value: NonZeroI16_le) -> NonZero<i16>
§impl From<NonZeroI16_ube> for NonZero<i16>
impl From<NonZeroI16_ube> for NonZero<i16>
§fn from(value: NonZeroI16_ube) -> NonZero<i16>
fn from(value: NonZeroI16_ube) -> NonZero<i16>
§impl From<NonZeroI16_ule> for NonZero<i16>
impl From<NonZeroI16_ule> for NonZero<i16>
§fn from(value: NonZeroI16_ule) -> NonZero<i16>
fn from(value: NonZeroI16_ule) -> NonZero<i16>
§impl From<NonZeroI32_be> for NonZero<i32>
impl From<NonZeroI32_be> for NonZero<i32>
§fn from(value: NonZeroI32_be) -> NonZero<i32>
fn from(value: NonZeroI32_be) -> NonZero<i32>
§impl From<NonZeroI32_le> for NonZero<i32>
impl From<NonZeroI32_le> for NonZero<i32>
§fn from(value: NonZeroI32_le) -> NonZero<i32>
fn from(value: NonZeroI32_le) -> NonZero<i32>
§impl From<NonZeroI32_ube> for NonZero<i32>
impl From<NonZeroI32_ube> for NonZero<i32>
§fn from(value: NonZeroI32_ube) -> NonZero<i32>
fn from(value: NonZeroI32_ube) -> NonZero<i32>
§impl From<NonZeroI32_ule> for NonZero<i32>
impl From<NonZeroI32_ule> for NonZero<i32>
§fn from(value: NonZeroI32_ule) -> NonZero<i32>
fn from(value: NonZeroI32_ule) -> NonZero<i32>
§impl From<NonZeroI64_be> for NonZero<i64>
impl From<NonZeroI64_be> for NonZero<i64>
§fn from(value: NonZeroI64_be) -> NonZero<i64>
fn from(value: NonZeroI64_be) -> NonZero<i64>
§impl From<NonZeroI64_le> for NonZero<i64>
impl From<NonZeroI64_le> for NonZero<i64>
§fn from(value: NonZeroI64_le) -> NonZero<i64>
fn from(value: NonZeroI64_le) -> NonZero<i64>
§impl From<NonZeroI64_ube> for NonZero<i64>
impl From<NonZeroI64_ube> for NonZero<i64>
§fn from(value: NonZeroI64_ube) -> NonZero<i64>
fn from(value: NonZeroI64_ube) -> NonZero<i64>
§impl From<NonZeroI64_ule> for NonZero<i64>
impl From<NonZeroI64_ule> for NonZero<i64>
§fn from(value: NonZeroI64_ule) -> NonZero<i64>
fn from(value: NonZeroI64_ule) -> NonZero<i64>
§impl From<NonZeroU128_be> for NonZero<u128>
impl From<NonZeroU128_be> for NonZero<u128>
§fn from(value: NonZeroU128_be) -> NonZero<u128>
fn from(value: NonZeroU128_be) -> NonZero<u128>
§impl From<NonZeroU128_le> for NonZero<u128>
impl From<NonZeroU128_le> for NonZero<u128>
§fn from(value: NonZeroU128_le) -> NonZero<u128>
fn from(value: NonZeroU128_le) -> NonZero<u128>
§impl From<NonZeroU128_ube> for NonZero<u128>
impl From<NonZeroU128_ube> for NonZero<u128>
§fn from(value: NonZeroU128_ube) -> NonZero<u128>
fn from(value: NonZeroU128_ube) -> NonZero<u128>
§impl From<NonZeroU128_ule> for NonZero<u128>
impl From<NonZeroU128_ule> for NonZero<u128>
§fn from(value: NonZeroU128_ule) -> NonZero<u128>
fn from(value: NonZeroU128_ule) -> NonZero<u128>
§impl From<NonZeroU16_be> for NonZero<u16>
impl From<NonZeroU16_be> for NonZero<u16>
§fn from(value: NonZeroU16_be) -> NonZero<u16>
fn from(value: NonZeroU16_be) -> NonZero<u16>
§impl From<NonZeroU16_le> for NonZero<u16>
impl From<NonZeroU16_le> for NonZero<u16>
§fn from(value: NonZeroU16_le) -> NonZero<u16>
fn from(value: NonZeroU16_le) -> NonZero<u16>
§impl From<NonZeroU16_ube> for NonZero<u16>
impl From<NonZeroU16_ube> for NonZero<u16>
§fn from(value: NonZeroU16_ube) -> NonZero<u16>
fn from(value: NonZeroU16_ube) -> NonZero<u16>
§impl From<NonZeroU16_ule> for NonZero<u16>
impl From<NonZeroU16_ule> for NonZero<u16>
§fn from(value: NonZeroU16_ule) -> NonZero<u16>
fn from(value: NonZeroU16_ule) -> NonZero<u16>
§impl From<NonZeroU32_be> for NonZero<u32>
impl From<NonZeroU32_be> for NonZero<u32>
§fn from(value: NonZeroU32_be) -> NonZero<u32>
fn from(value: NonZeroU32_be) -> NonZero<u32>
§impl From<NonZeroU32_le> for NonZero<u32>
impl From<NonZeroU32_le> for NonZero<u32>
§fn from(value: NonZeroU32_le) -> NonZero<u32>
fn from(value: NonZeroU32_le) -> NonZero<u32>
§impl From<NonZeroU32_ube> for NonZero<u32>
impl From<NonZeroU32_ube> for NonZero<u32>
§fn from(value: NonZeroU32_ube) -> NonZero<u32>
fn from(value: NonZeroU32_ube) -> NonZero<u32>
§impl From<NonZeroU32_ule> for NonZero<u32>
impl From<NonZeroU32_ule> for NonZero<u32>
§fn from(value: NonZeroU32_ule) -> NonZero<u32>
fn from(value: NonZeroU32_ule) -> NonZero<u32>
§impl From<NonZeroU64_be> for NonZero<u64>
impl From<NonZeroU64_be> for NonZero<u64>
§fn from(value: NonZeroU64_be) -> NonZero<u64>
fn from(value: NonZeroU64_be) -> NonZero<u64>
§impl From<NonZeroU64_le> for NonZero<u64>
impl From<NonZeroU64_le> for NonZero<u64>
§fn from(value: NonZeroU64_le) -> NonZero<u64>
fn from(value: NonZeroU64_le) -> NonZero<u64>
§impl From<NonZeroU64_ube> for NonZero<u64>
impl From<NonZeroU64_ube> for NonZero<u64>
§fn from(value: NonZeroU64_ube) -> NonZero<u64>
fn from(value: NonZeroU64_ube) -> NonZero<u64>
§impl From<NonZeroU64_ule> for NonZero<u64>
impl From<NonZeroU64_ule> for NonZero<u64>
§fn from(value: NonZeroU64_ule) -> NonZero<u64>
fn from(value: NonZeroU64_ule) -> NonZero<u64>
§impl FromPyObject<'_> for NonZero<i128>
impl FromPyObject<'_> for NonZero<i128>
§impl FromPyObject<'_> for NonZero<i16>
impl FromPyObject<'_> for NonZero<i16>
§impl FromPyObject<'_> for NonZero<i32>
impl FromPyObject<'_> for NonZero<i32>
§impl FromPyObject<'_> for NonZero<i64>
impl FromPyObject<'_> for NonZero<i64>
§impl FromPyObject<'_> for NonZero<i8>
impl FromPyObject<'_> for NonZero<i8>
§impl FromPyObject<'_> for NonZero<isize>
impl FromPyObject<'_> for NonZero<isize>
§impl FromPyObject<'_> for NonZero<u128>
impl FromPyObject<'_> for NonZero<u128>
§impl FromPyObject<'_> for NonZero<u16>
impl FromPyObject<'_> for NonZero<u16>
§impl FromPyObject<'_> for NonZero<u32>
impl FromPyObject<'_> for NonZero<u32>
§impl FromPyObject<'_> for NonZero<u64>
impl FromPyObject<'_> for NonZero<u64>
§impl FromPyObject<'_> for NonZero<u8>
impl FromPyObject<'_> for NonZero<u8>
§impl FromPyObject<'_> for NonZero<usize>
impl FromPyObject<'_> for NonZero<usize>
§impl<'py> IntoPyObject<'py> for &NonZero<i128>
impl<'py> IntoPyObject<'py> for &NonZero<i128>
§type Output = Bound<'py, <&NonZero<i128> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<i128> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<i128> as IntoPyObject<'py>>::Output, <&NonZero<i128> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<i128> as IntoPyObject<'py>>::Output, <&NonZero<i128> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<i16>
impl<'py> IntoPyObject<'py> for &NonZero<i16>
§type Output = Bound<'py, <&NonZero<i16> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<i16> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<i16> as IntoPyObject<'py>>::Output, <&NonZero<i16> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<i16> as IntoPyObject<'py>>::Output, <&NonZero<i16> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<i32>
impl<'py> IntoPyObject<'py> for &NonZero<i32>
§type Output = Bound<'py, <&NonZero<i32> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<i32> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<i32> as IntoPyObject<'py>>::Output, <&NonZero<i32> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<i32> as IntoPyObject<'py>>::Output, <&NonZero<i32> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<i64>
impl<'py> IntoPyObject<'py> for &NonZero<i64>
§type Output = Bound<'py, <&NonZero<i64> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<i64> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<i64> as IntoPyObject<'py>>::Output, <&NonZero<i64> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<i64> as IntoPyObject<'py>>::Output, <&NonZero<i64> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<i8>
impl<'py> IntoPyObject<'py> for &NonZero<i8>
§type Output = Bound<'py, <&NonZero<i8> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<i8> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<i8> as IntoPyObject<'py>>::Output, <&NonZero<i8> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<i8> as IntoPyObject<'py>>::Output, <&NonZero<i8> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<isize>
impl<'py> IntoPyObject<'py> for &NonZero<isize>
§type Output = Bound<'py, <&NonZero<isize> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<isize> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<isize> as IntoPyObject<'py>>::Output, <&NonZero<isize> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<isize> as IntoPyObject<'py>>::Output, <&NonZero<isize> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<u128>
impl<'py> IntoPyObject<'py> for &NonZero<u128>
§type Output = Bound<'py, <&NonZero<u128> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<u128> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<u128> as IntoPyObject<'py>>::Output, <&NonZero<u128> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<u128> as IntoPyObject<'py>>::Output, <&NonZero<u128> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<u16>
impl<'py> IntoPyObject<'py> for &NonZero<u16>
§type Output = Bound<'py, <&NonZero<u16> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<u16> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<u16> as IntoPyObject<'py>>::Output, <&NonZero<u16> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<u16> as IntoPyObject<'py>>::Output, <&NonZero<u16> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<u32>
impl<'py> IntoPyObject<'py> for &NonZero<u32>
§type Output = Bound<'py, <&NonZero<u32> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<u32> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<u32> as IntoPyObject<'py>>::Output, <&NonZero<u32> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<u32> as IntoPyObject<'py>>::Output, <&NonZero<u32> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<u64>
impl<'py> IntoPyObject<'py> for &NonZero<u64>
§type Output = Bound<'py, <&NonZero<u64> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<u64> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<u64> as IntoPyObject<'py>>::Output, <&NonZero<u64> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<u64> as IntoPyObject<'py>>::Output, <&NonZero<u64> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<u8>
impl<'py> IntoPyObject<'py> for &NonZero<u8>
§type Output = Bound<'py, <&NonZero<u8> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<u8> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<u8> as IntoPyObject<'py>>::Output, <&NonZero<u8> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<u8> as IntoPyObject<'py>>::Output, <&NonZero<u8> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for &NonZero<usize>
impl<'py> IntoPyObject<'py> for &NonZero<usize>
§type Output = Bound<'py, <&NonZero<usize> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <&NonZero<usize> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<&NonZero<usize> as IntoPyObject<'py>>::Output, <&NonZero<usize> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<&NonZero<usize> as IntoPyObject<'py>>::Output, <&NonZero<usize> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<i128>
impl<'py> IntoPyObject<'py> for NonZero<i128>
§type Output = Bound<'py, <NonZero<i128> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<i128> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<i128> as IntoPyObject<'py>>::Output, <NonZero<i128> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<i128> as IntoPyObject<'py>>::Output, <NonZero<i128> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<i16>
impl<'py> IntoPyObject<'py> for NonZero<i16>
§type Output = Bound<'py, <NonZero<i16> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<i16> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<i16> as IntoPyObject<'py>>::Output, <NonZero<i16> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<i16> as IntoPyObject<'py>>::Output, <NonZero<i16> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<i32>
impl<'py> IntoPyObject<'py> for NonZero<i32>
§type Output = Bound<'py, <NonZero<i32> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<i32> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<i32> as IntoPyObject<'py>>::Output, <NonZero<i32> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<i32> as IntoPyObject<'py>>::Output, <NonZero<i32> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<i64>
impl<'py> IntoPyObject<'py> for NonZero<i64>
§type Output = Bound<'py, <NonZero<i64> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<i64> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<i64> as IntoPyObject<'py>>::Output, <NonZero<i64> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<i64> as IntoPyObject<'py>>::Output, <NonZero<i64> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<i8>
impl<'py> IntoPyObject<'py> for NonZero<i8>
§type Output = Bound<'py, <NonZero<i8> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<i8> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<i8> as IntoPyObject<'py>>::Output, <NonZero<i8> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<i8> as IntoPyObject<'py>>::Output, <NonZero<i8> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<isize>
impl<'py> IntoPyObject<'py> for NonZero<isize>
§type Output = Bound<'py, <NonZero<isize> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<isize> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<isize> as IntoPyObject<'py>>::Output, <NonZero<isize> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<isize> as IntoPyObject<'py>>::Output, <NonZero<isize> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<u128>
impl<'py> IntoPyObject<'py> for NonZero<u128>
§type Output = Bound<'py, <NonZero<u128> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<u128> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<u128> as IntoPyObject<'py>>::Output, <NonZero<u128> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<u128> as IntoPyObject<'py>>::Output, <NonZero<u128> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<u16>
impl<'py> IntoPyObject<'py> for NonZero<u16>
§type Output = Bound<'py, <NonZero<u16> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<u16> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<u16> as IntoPyObject<'py>>::Output, <NonZero<u16> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<u16> as IntoPyObject<'py>>::Output, <NonZero<u16> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<u32>
impl<'py> IntoPyObject<'py> for NonZero<u32>
§type Output = Bound<'py, <NonZero<u32> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<u32> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<u32> as IntoPyObject<'py>>::Output, <NonZero<u32> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<u32> as IntoPyObject<'py>>::Output, <NonZero<u32> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<u64>
impl<'py> IntoPyObject<'py> for NonZero<u64>
§type Output = Bound<'py, <NonZero<u64> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<u64> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<u64> as IntoPyObject<'py>>::Output, <NonZero<u64> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<u64> as IntoPyObject<'py>>::Output, <NonZero<u64> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<u8>
impl<'py> IntoPyObject<'py> for NonZero<u8>
§type Output = Bound<'py, <NonZero<u8> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<u8> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<u8> as IntoPyObject<'py>>::Output, <NonZero<u8> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<u8> as IntoPyObject<'py>>::Output, <NonZero<u8> as IntoPyObject<'py>>::Error> ⓘ
§impl<'py> IntoPyObject<'py> for NonZero<usize>
impl<'py> IntoPyObject<'py> for NonZero<usize>
§type Output = Bound<'py, <NonZero<usize> as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <NonZero<usize> as IntoPyObject<'py>>::Target>
§type Error = Infallible
type Error = Infallible
§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<NonZero<usize> as IntoPyObject<'py>>::Output, <NonZero<usize> as IntoPyObject<'py>>::Error> ⓘ
fn into_pyobject( self, py: Python<'py>, ) -> Result<<NonZero<usize> as IntoPyObject<'py>>::Output, <NonZero<usize> as IntoPyObject<'py>>::Error> ⓘ
§impl Niching<NonZero<i8>> for DefaultNiche
impl Niching<NonZero<i8>> for DefaultNiche
§impl Niching<NonZero<u8>> for DefaultNiche
impl Niching<NonZero<u8>> for DefaultNiche
1.28.0 · Source§impl<T> Ord for NonZero<T>where
T: ZeroablePrimitive + Ord,
impl<T> Ord for NonZero<T>where
T: ZeroablePrimitive + Ord,
§impl PartialEq<NonZero<i128>> for NonZeroI128_be
impl PartialEq<NonZero<i128>> for NonZeroI128_be
§impl PartialEq<NonZero<i128>> for NonZeroI128_le
impl PartialEq<NonZero<i128>> for NonZeroI128_le
§impl PartialEq<NonZero<i128>> for NonZeroI128_ube
impl PartialEq<NonZero<i128>> for NonZeroI128_ube
§impl PartialEq<NonZero<i128>> for NonZeroI128_ule
impl PartialEq<NonZero<i128>> for NonZeroI128_ule
§impl PartialEq<NonZero<i16>> for NonZeroI16_be
impl PartialEq<NonZero<i16>> for NonZeroI16_be
§impl PartialEq<NonZero<i16>> for NonZeroI16_le
impl PartialEq<NonZero<i16>> for NonZeroI16_le
§impl PartialEq<NonZero<i16>> for NonZeroI16_ube
impl PartialEq<NonZero<i16>> for NonZeroI16_ube
§impl PartialEq<NonZero<i16>> for NonZeroI16_ule
impl PartialEq<NonZero<i16>> for NonZeroI16_ule
§impl PartialEq<NonZero<i32>> for NonZeroI32_be
impl PartialEq<NonZero<i32>> for NonZeroI32_be
§impl PartialEq<NonZero<i32>> for NonZeroI32_le
impl PartialEq<NonZero<i32>> for NonZeroI32_le
§impl PartialEq<NonZero<i32>> for NonZeroI32_ube
impl PartialEq<NonZero<i32>> for NonZeroI32_ube
§impl PartialEq<NonZero<i32>> for NonZeroI32_ule
impl PartialEq<NonZero<i32>> for NonZeroI32_ule
§impl PartialEq<NonZero<i64>> for NonZeroI64_be
impl PartialEq<NonZero<i64>> for NonZeroI64_be
§impl PartialEq<NonZero<i64>> for NonZeroI64_le
impl PartialEq<NonZero<i64>> for NonZeroI64_le
§impl PartialEq<NonZero<i64>> for NonZeroI64_ube
impl PartialEq<NonZero<i64>> for NonZeroI64_ube
§impl PartialEq<NonZero<i64>> for NonZeroI64_ule
impl PartialEq<NonZero<i64>> for NonZeroI64_ule
§impl PartialEq<NonZero<u128>> for NonZeroU128_be
impl PartialEq<NonZero<u128>> for NonZeroU128_be
§impl PartialEq<NonZero<u128>> for NonZeroU128_le
impl PartialEq<NonZero<u128>> for NonZeroU128_le
§impl PartialEq<NonZero<u128>> for NonZeroU128_ube
impl PartialEq<NonZero<u128>> for NonZeroU128_ube
§impl PartialEq<NonZero<u128>> for NonZeroU128_ule
impl PartialEq<NonZero<u128>> for NonZeroU128_ule
§impl PartialEq<NonZero<u16>> for NonZeroU16_be
impl PartialEq<NonZero<u16>> for NonZeroU16_be
§impl PartialEq<NonZero<u16>> for NonZeroU16_le
impl PartialEq<NonZero<u16>> for NonZeroU16_le
§impl PartialEq<NonZero<u16>> for NonZeroU16_ube
impl PartialEq<NonZero<u16>> for NonZeroU16_ube
§impl PartialEq<NonZero<u16>> for NonZeroU16_ule
impl PartialEq<NonZero<u16>> for NonZeroU16_ule
§impl PartialEq<NonZero<u32>> for NonZeroU32_be
impl PartialEq<NonZero<u32>> for NonZeroU32_be
§impl PartialEq<NonZero<u32>> for NonZeroU32_le
impl PartialEq<NonZero<u32>> for NonZeroU32_le
§impl PartialEq<NonZero<u32>> for NonZeroU32_ube
impl PartialEq<NonZero<u32>> for NonZeroU32_ube
§impl PartialEq<NonZero<u32>> for NonZeroU32_ule
impl PartialEq<NonZero<u32>> for NonZeroU32_ule
§impl PartialEq<NonZero<u64>> for NonZeroU64_be
impl PartialEq<NonZero<u64>> for NonZeroU64_be
§impl PartialEq<NonZero<u64>> for NonZeroU64_le
impl PartialEq<NonZero<u64>> for NonZeroU64_le
§impl PartialEq<NonZero<u64>> for NonZeroU64_ube
impl PartialEq<NonZero<u64>> for NonZeroU64_ube
§impl PartialEq<NonZero<u64>> for NonZeroU64_ule
impl PartialEq<NonZero<u64>> for NonZeroU64_ule
§impl PartialEq<NonZeroI128_be> for NonZero<i128>
impl PartialEq<NonZeroI128_be> for NonZero<i128>
§impl PartialEq<NonZeroI128_le> for NonZero<i128>
impl PartialEq<NonZeroI128_le> for NonZero<i128>
§impl PartialEq<NonZeroI128_ube> for NonZero<i128>
impl PartialEq<NonZeroI128_ube> for NonZero<i128>
§impl PartialEq<NonZeroI128_ule> for NonZero<i128>
impl PartialEq<NonZeroI128_ule> for NonZero<i128>
§impl PartialEq<NonZeroI16_be> for NonZero<i16>
impl PartialEq<NonZeroI16_be> for NonZero<i16>
§impl PartialEq<NonZeroI16_le> for NonZero<i16>
impl PartialEq<NonZeroI16_le> for NonZero<i16>
§impl PartialEq<NonZeroI16_ube> for NonZero<i16>
impl PartialEq<NonZeroI16_ube> for NonZero<i16>
§impl PartialEq<NonZeroI16_ule> for NonZero<i16>
impl PartialEq<NonZeroI16_ule> for NonZero<i16>
§impl PartialEq<NonZeroI32_be> for NonZero<i32>
impl PartialEq<NonZeroI32_be> for NonZero<i32>
§impl PartialEq<NonZeroI32_le> for NonZero<i32>
impl PartialEq<NonZeroI32_le> for NonZero<i32>
§impl PartialEq<NonZeroI32_ube> for NonZero<i32>
impl PartialEq<NonZeroI32_ube> for NonZero<i32>
§impl PartialEq<NonZeroI32_ule> for NonZero<i32>
impl PartialEq<NonZeroI32_ule> for NonZero<i32>
§impl PartialEq<NonZeroI64_be> for NonZero<i64>
impl PartialEq<NonZeroI64_be> for NonZero<i64>
§impl PartialEq<NonZeroI64_le> for NonZero<i64>
impl PartialEq<NonZeroI64_le> for NonZero<i64>
§impl PartialEq<NonZeroI64_ube> for NonZero<i64>
impl PartialEq<NonZeroI64_ube> for NonZero<i64>
§impl PartialEq<NonZeroI64_ule> for NonZero<i64>
impl PartialEq<NonZeroI64_ule> for NonZero<i64>
§impl PartialEq<NonZeroU128_be> for NonZero<u128>
impl PartialEq<NonZeroU128_be> for NonZero<u128>
§impl PartialEq<NonZeroU128_le> for NonZero<u128>
impl PartialEq<NonZeroU128_le> for NonZero<u128>
§impl PartialEq<NonZeroU128_ube> for NonZero<u128>
impl PartialEq<NonZeroU128_ube> for NonZero<u128>
§impl PartialEq<NonZeroU128_ule> for NonZero<u128>
impl PartialEq<NonZeroU128_ule> for NonZero<u128>
§impl PartialEq<NonZeroU16_be> for NonZero<u16>
impl PartialEq<NonZeroU16_be> for NonZero<u16>
§impl PartialEq<NonZeroU16_le> for NonZero<u16>
impl PartialEq<NonZeroU16_le> for NonZero<u16>
§impl PartialEq<NonZeroU16_ube> for NonZero<u16>
impl PartialEq<NonZeroU16_ube> for NonZero<u16>
§impl PartialEq<NonZeroU16_ule> for NonZero<u16>
impl PartialEq<NonZeroU16_ule> for NonZero<u16>
§impl PartialEq<NonZeroU32_be> for NonZero<u32>
impl PartialEq<NonZeroU32_be> for NonZero<u32>
§impl PartialEq<NonZeroU32_le> for NonZero<u32>
impl PartialEq<NonZeroU32_le> for NonZero<u32>
§impl PartialEq<NonZeroU32_ube> for NonZero<u32>
impl PartialEq<NonZeroU32_ube> for NonZero<u32>
§impl PartialEq<NonZeroU32_ule> for NonZero<u32>
impl PartialEq<NonZeroU32_ule> for NonZero<u32>
§impl PartialEq<NonZeroU64_be> for NonZero<u64>
impl PartialEq<NonZeroU64_be> for NonZero<u64>
§impl PartialEq<NonZeroU64_le> for NonZero<u64>
impl PartialEq<NonZeroU64_le> for NonZero<u64>
§impl PartialEq<NonZeroU64_ube> for NonZero<u64>
impl PartialEq<NonZeroU64_ube> for NonZero<u64>
§impl PartialEq<NonZeroU64_ule> for NonZero<u64>
impl PartialEq<NonZeroU64_ule> for NonZero<u64>
§impl PartialOrd<NonZero<i128>> for NonZeroI128_be
impl PartialOrd<NonZero<i128>> for NonZeroI128_be
§impl PartialOrd<NonZero<i128>> for NonZeroI128_le
impl PartialOrd<NonZero<i128>> for NonZeroI128_le
§impl PartialOrd<NonZero<i128>> for NonZeroI128_ube
impl PartialOrd<NonZero<i128>> for NonZeroI128_ube
§impl PartialOrd<NonZero<i128>> for NonZeroI128_ule
impl PartialOrd<NonZero<i128>> for NonZeroI128_ule
§impl PartialOrd<NonZero<i16>> for NonZeroI16_be
impl PartialOrd<NonZero<i16>> for NonZeroI16_be
§impl PartialOrd<NonZero<i16>> for NonZeroI16_le
impl PartialOrd<NonZero<i16>> for NonZeroI16_le
§impl PartialOrd<NonZero<i16>> for NonZeroI16_ube
impl PartialOrd<NonZero<i16>> for NonZeroI16_ube
§impl PartialOrd<NonZero<i16>> for NonZeroI16_ule
impl PartialOrd<NonZero<i16>> for NonZeroI16_ule
§impl PartialOrd<NonZero<i32>> for NonZeroI32_be
impl PartialOrd<NonZero<i32>> for NonZeroI32_be
§impl PartialOrd<NonZero<i32>> for NonZeroI32_le
impl PartialOrd<NonZero<i32>> for NonZeroI32_le
§impl PartialOrd<NonZero<i32>> for NonZeroI32_ube
impl PartialOrd<NonZero<i32>> for NonZeroI32_ube
§impl PartialOrd<NonZero<i32>> for NonZeroI32_ule
impl PartialOrd<NonZero<i32>> for NonZeroI32_ule
§impl PartialOrd<NonZero<i64>> for NonZeroI64_be
impl PartialOrd<NonZero<i64>> for NonZeroI64_be
§impl PartialOrd<NonZero<i64>> for NonZeroI64_le
impl PartialOrd<NonZero<i64>> for NonZeroI64_le
§impl PartialOrd<NonZero<i64>> for NonZeroI64_ube
impl PartialOrd<NonZero<i64>> for NonZeroI64_ube
§impl PartialOrd<NonZero<i64>> for NonZeroI64_ule
impl PartialOrd<NonZero<i64>> for NonZeroI64_ule
§impl PartialOrd<NonZero<u128>> for NonZeroU128_be
impl PartialOrd<NonZero<u128>> for NonZeroU128_be
§impl PartialOrd<NonZero<u128>> for NonZeroU128_le
impl PartialOrd<NonZero<u128>> for NonZeroU128_le
§impl PartialOrd<NonZero<u128>> for NonZeroU128_ube
impl PartialOrd<NonZero<u128>> for NonZeroU128_ube
§impl PartialOrd<NonZero<u128>> for NonZeroU128_ule
impl PartialOrd<NonZero<u128>> for NonZeroU128_ule
§impl PartialOrd<NonZero<u16>> for NonZeroU16_be
impl PartialOrd<NonZero<u16>> for NonZeroU16_be
§impl PartialOrd<NonZero<u16>> for NonZeroU16_le
impl PartialOrd<NonZero<u16>> for NonZeroU16_le
§impl PartialOrd<NonZero<u16>> for NonZeroU16_ube
impl PartialOrd<NonZero<u16>> for NonZeroU16_ube
§impl PartialOrd<NonZero<u16>> for NonZeroU16_ule
impl PartialOrd<NonZero<u16>> for NonZeroU16_ule
§impl PartialOrd<NonZero<u32>> for NonZeroU32_be
impl PartialOrd<NonZero<u32>> for NonZeroU32_be
§impl PartialOrd<NonZero<u32>> for NonZeroU32_le
impl PartialOrd<NonZero<u32>> for NonZeroU32_le
§impl PartialOrd<NonZero<u32>> for NonZeroU32_ube
impl PartialOrd<NonZero<u32>> for NonZeroU32_ube
§impl PartialOrd<NonZero<u32>> for NonZeroU32_ule
impl PartialOrd<NonZero<u32>> for NonZeroU32_ule
§impl PartialOrd<NonZero<u64>> for NonZeroU64_be
impl PartialOrd<NonZero<u64>> for NonZeroU64_be
§impl PartialOrd<NonZero<u64>> for NonZeroU64_le
impl PartialOrd<NonZero<u64>> for NonZeroU64_le
§impl PartialOrd<NonZero<u64>> for NonZeroU64_ube
impl PartialOrd<NonZero<u64>> for NonZeroU64_ube
§impl PartialOrd<NonZero<u64>> for NonZeroU64_ule
impl PartialOrd<NonZero<u64>> for NonZeroU64_ule
1.28.0 · Source§impl<T> PartialOrd for NonZero<T>where
T: ZeroablePrimitive + PartialOrd,
impl<T> PartialOrd for NonZero<T>where
T: ZeroablePrimitive + PartialOrd,
1.79.0 · Source§impl RemAssign<NonZero<u128>> for u128
impl RemAssign<NonZero<u128>> for u128
Source§fn rem_assign(&mut self, other: NonZero<u128>)
fn rem_assign(&mut self, other: NonZero<u128>)
This operation satisfies n % d == n - (n / d) * d
, and cannot panic.
1.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.79.0 · Source§impl RemAssign<NonZero<u32>> for u32
impl RemAssign<NonZero<u32>> for u32
Source§fn rem_assign(&mut self, other: NonZero<u32>)
fn rem_assign(&mut self, other: NonZero<u32>)
This operation satisfies n % d == n - (n / d) * d
, and cannot panic.
1.79.0 · Source§impl RemAssign<NonZero<u64>> for u64
impl RemAssign<NonZero<u64>> for u64
Source§fn rem_assign(&mut self, other: NonZero<u64>)
fn rem_assign(&mut self, other: NonZero<u64>)
This operation satisfies n % d == n - (n / d) * d
, and cannot panic.
1.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.79.0 · Source§impl RemAssign<NonZero<usize>> for usize
impl RemAssign<NonZero<usize>> for usize
Source§fn rem_assign(&mut self, other: NonZero<usize>)
fn rem_assign(&mut self, other: NonZero<usize>)
This operation satisfies n % d == n - (n / d) * d
, and cannot panic.
Source§impl Serialize for NonZero<i128>
impl Serialize for NonZero<i128>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<i16>
impl Serialize for NonZero<i16>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<i32>
impl Serialize for NonZero<i32>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<i64>
impl Serialize for NonZero<i64>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<i8>
impl Serialize for NonZero<i8>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<isize>
impl Serialize for NonZero<isize>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<u128>
impl Serialize for NonZero<u128>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<u16>
impl Serialize for NonZero<u16>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<u32>
impl Serialize for NonZero<u32>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<u64>
impl Serialize for NonZero<u64>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<u8>
impl Serialize for NonZero<u8>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
Source§impl Serialize for NonZero<usize>
impl Serialize for NonZero<usize>
Source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> ⓘwhere
S: Serializer,
§impl ToPyObject for NonZero<i128>
impl ToPyObject for NonZero<i128>
§impl ToPyObject for NonZero<i16>
impl ToPyObject for NonZero<i16>
§impl ToPyObject for NonZero<i32>
impl ToPyObject for NonZero<i32>
§impl ToPyObject for NonZero<i64>
impl ToPyObject for NonZero<i64>
§impl ToPyObject for NonZero<i8>
impl ToPyObject for NonZero<i8>
§impl ToPyObject for NonZero<isize>
impl ToPyObject for NonZero<isize>
§impl ToPyObject for NonZero<u128>
impl ToPyObject for NonZero<u128>
§impl ToPyObject for NonZero<u16>
impl ToPyObject for NonZero<u16>
§impl ToPyObject for NonZero<u32>
impl ToPyObject for NonZero<u32>
§impl ToPyObject for NonZero<u64>
impl ToPyObject for NonZero<u64>
§impl ToPyObject for NonZero<u8>
impl ToPyObject for NonZero<u8>
§impl ToPyObject for NonZero<usize>
impl ToPyObject for NonZero<usize>
impl<T> Copy for NonZero<T>where
T: ZeroablePrimitive,
impl<T> Eq for NonZero<T>where
T: ZeroablePrimitive + Eq,
impl<T> Freeze for NonZero<T>where
T: ZeroablePrimitive + Freeze,
impl NoUndef for NonZero<i8>
impl NoUndef for NonZero<u8>
impl NoUninit for NonZero<i128>
impl NoUninit for NonZero<i16>
impl NoUninit for NonZero<i32>
impl NoUninit for NonZero<i64>
impl NoUninit for NonZero<i8>
impl NoUninit for NonZero<isize>
impl NoUninit for NonZero<u128>
impl NoUninit for NonZero<u16>
impl NoUninit for NonZero<u32>
impl NoUninit for NonZero<u64>
impl NoUninit for NonZero<u8>
impl NoUninit for NonZero<usize>
impl PodInOption for NonZero<i128>
impl PodInOption for NonZero<i16>
impl PodInOption for NonZero<i32>
impl PodInOption for NonZero<i64>
impl PodInOption for NonZero<i8>
impl PodInOption for NonZero<isize>
impl PodInOption for NonZero<u128>
impl PodInOption for NonZero<u16>
impl PodInOption for NonZero<u32>
impl PodInOption for NonZero<u64>
impl PodInOption for NonZero<u8>
impl PodInOption for NonZero<usize>
impl Portable for NonZero<i8>
impl Portable for NonZero<u8>
impl<T> RefUnwindSafe for NonZero<T>where
T: ZeroablePrimitive + RefUnwindSafe,
impl<T> Send for NonZero<T>where
T: ZeroablePrimitive + Send,
impl<T> StructuralPartialEq for NonZero<T>where
T: ZeroablePrimitive + StructuralPartialEq,
impl<T> Sync for NonZero<T>where
T: ZeroablePrimitive + Sync,
impl<T> Unpin for NonZero<T>where
T: ZeroablePrimitive + Unpin,
impl<T> UnwindSafe for NonZero<T>where
T: ZeroablePrimitive + UnwindSafe,
impl ZeroableInOption for NonZero<i128>
impl ZeroableInOption for NonZero<i16>
impl ZeroableInOption for NonZero<i32>
impl ZeroableInOption for NonZero<i64>
impl ZeroableInOption for NonZero<i8>
impl ZeroableInOption for NonZero<isize>
impl ZeroableInOption for NonZero<u128>
impl ZeroableInOption for NonZero<u16>
impl ZeroableInOption for NonZero<u32>
impl ZeroableInOption for NonZero<u64>
impl ZeroableInOption for NonZero<u8>
impl ZeroableInOption for NonZero<usize>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive
, it may be
unsized. Read more§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<'py, T> FromPyObjectBound<'_, 'py> for Twhere
T: FromPyObject<'py>,
impl<'py, T> FromPyObjectBound<'_, 'py> for Twhere
T: FromPyObject<'py>,
§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<'py, T> IntoPyObjectExt<'py> for Twhere
T: IntoPyObject<'py>,
impl<'py, T> IntoPyObjectExt<'py> for Twhere
T: IntoPyObject<'py>,
§fn into_bound_py_any(self, py: Python<'py>) -> Result<Bound<'py, PyAny>, PyErr> ⓘ
fn into_bound_py_any(self, py: Python<'py>) -> Result<Bound<'py, PyAny>, PyErr> ⓘ
self
into an owned Python object, dropping type information.§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.