Expand description
The 8-bit signed integer type.
Source§
1.43.0 · Source
The smallest value that can be represented by this integer type (−27).
§Examples
assert_eq!(i8::MIN, -128);1.43.0 · Source
The largest value that can be represented by this integer type (27 − 1).
§Examples
assert_eq!(i8::MAX, 127);1.0.0 (const: 1.32.0) · Source
Returns the number of ones in the binary representation of self.
§Examples
let n = 0b100_0000i8;
assert_eq!(n.count_ones(), 1);1.0.0 (const: 1.32.0) · Source
Returns the number of zeros in the binary representation of self.
§Examples
assert_eq!(i8::MAX.count_zeros(), 1);1.0.0 (const: 1.32.0) · Source
1.0.0 (const: 1.32.0) · Source
Returns the number of trailing zeros in the binary representation of self.
§Examples
let n = -4i8;
assert_eq!(n.trailing_zeros(), 2);1.46.0 (const: 1.46.0) · Source
Returns the number of leading ones in the binary representation of self.
§Examples
let n = -1i8;
assert_eq!(n.leading_ones(), 8);1.46.0 (const: 1.46.0) · Source
Returns the number of trailing ones in the binary representation of self.
§Examples
let n = 3i8;
assert_eq!(n.trailing_ones(), 2);Source 🔬This is a nightly-only experimental API. (isolate_most_least_significant_one #136909)
isolate_most_least_significant_one #136909)Returns self with only the most significant bit set, or 0 if
the input is 0.
§Examples
#![feature(isolate_most_least_significant_one)]
let n: i8 = 0b_01100100;
assert_eq!(n.isolate_highest_one(), 0b_01000000);
assert_eq!(0_i8.isolate_highest_one(), 0);Source 🔬This is a nightly-only experimental API. (isolate_most_least_significant_one #136909)
isolate_most_least_significant_one #136909)Returns self with only the least significant bit set, or 0 if
the input is 0.
§Examples
#![feature(isolate_most_least_significant_one)]
let n: i8 = 0b_01100100;
assert_eq!(n.isolate_lowest_one(), 0b_00000100);
assert_eq!(0_i8.isolate_lowest_one(), 0);Source 🔬This is a nightly-only experimental API. (int_lowest_highest_one #145203)
int_lowest_highest_one #145203)Returns the index of the highest bit set to one in self, or None
if self is 0.
§Examples
#![feature(int_lowest_highest_one)]
assert_eq!(0b0_i8.highest_one(), None);
assert_eq!(0b1_i8.highest_one(), Some(0));
assert_eq!(0b1_0000_i8.highest_one(), Some(4));
assert_eq!(0b1_1111_i8.highest_one(), Some(4));Source 🔬This is a nightly-only experimental API. (int_lowest_highest_one #145203)
int_lowest_highest_one #145203)Returns the index of the lowest bit set to one in self, or None
if self is 0.
§Examples
#![feature(int_lowest_highest_one)]
assert_eq!(0b0_i8.lowest_one(), None);
assert_eq!(0b1_i8.lowest_one(), Some(0));
assert_eq!(0b1_0000_i8.lowest_one(), Some(4));
assert_eq!(0b1_1111_i8.lowest_one(), Some(0));1.87.0 (const: 1.87.0) · Source
Returns the bit pattern of self reinterpreted as an unsigned integer of the same size.
This produces the same result as an as cast, but ensures that the bit-width remains
the same.
§Examples
let n = -1i8;
assert_eq!(n.cast_unsigned(), u8::MAX);1.0.0 (const: 1.32.0) · Source
Shifts the bits to the left by a specified amount, n,
wrapping the truncated bits to the end of the resulting integer.
rotate_left(n) is equivalent to applying rotate_left(1) a total of n times. In
particular, a rotation by the number of bits in self returns the input value
unchanged.
Please note this isn’t the same operation as the << shifting operator!
§Examples
let n = -0x7ei8;
let m = 0xa;
assert_eq!(n.rotate_left(2), m);
assert_eq!(n.rotate_left(1024), n);1.0.0 (const: 1.32.0) · Source
Shifts the bits to the right by a specified amount, n,
wrapping the truncated bits to the beginning of the resulting
integer.
rotate_right(n) is equivalent to applying rotate_right(1) a total of n times. In
particular, a rotation by the number of bits in self returns the input value
unchanged.
Please note this isn’t the same operation as the >> shifting operator!
§Examples
let n = 0xai8;
let m = -0x7e;
assert_eq!(n.rotate_right(2), m);
assert_eq!(n.rotate_right(1024), n);1.0.0 (const: 1.32.0) · Source
Reverses the byte order of the integer.
§Examples
let n = 0x12i8;
let m = n.swap_bytes();
assert_eq!(m, 0x12);1.37.0 (const: 1.37.0) · Source
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
let n = 0x12i8;
let m = n.reverse_bits();
assert_eq!(m, 0x48);
assert_eq!(0, 0i8.reverse_bits());1.0.0 (const: 1.32.0) · Source
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.
See also from_be_bytes().
§Examples
let n = 0x1Ai8;
if cfg!(target_endian = "big") {
assert_eq!(i8::from_be(n), n)
} else {
assert_eq!(i8::from_be(n), n.swap_bytes())
}1.0.0 (const: 1.32.0) · Source
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.
See also from_le_bytes().
§Examples
let n = 0x1Ai8;
if cfg!(target_endian = "little") {
assert_eq!(i8::from_le(n), n)
} else {
assert_eq!(i8::from_le(n), n.swap_bytes())
}1.0.0 (const: 1.32.0) · Source
Swaps bytes of self on little endian targets.
On big endian this is a no-op.
The returned value has the same type as self, and will be interpreted
as (a potentially different) value of a native-endian
i8.
See to_be_bytes() for a type-safe alternative.
§Examples
let n = 0x1Ai8;
if cfg!(target_endian = "big") {
assert_eq!(n.to_be(), n)
} else {
assert_eq!(n.to_be(), n.swap_bytes())
}1.0.0 (const: 1.32.0) · Source
Swaps bytes of self on big endian targets.
On little endian this is a no-op.
The returned value has the same type as self, and will be interpreted
as (a potentially different) value of a native-endian
i8.
See to_le_bytes() for a type-safe alternative.
§Examples
let n = 0x1Ai8;
if cfg!(target_endian = "little") {
assert_eq!(n.to_le(), n)
} else {
assert_eq!(n.to_le(), n.swap_bytes())
}1.0.0 (const: 1.47.0) · Source
Checked integer addition. Computes self + rhs, returning None
if overflow occurred.
§Examples
assert_eq!((i8::MAX - 2).checked_add(1), Some(i8::MAX - 1));
assert_eq!((i8::MAX - 2).checked_add(3), None);1.91.0 (const: 1.91.0) · Source
Strict integer addition. Computes self + rhs, panicking
if overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!((i8::MAX - 2).strict_add(1), i8::MAX - 1);The following panics because of overflow:
let _ = (i8::MAX - 2).strict_add(3);1.79.0 (const: 1.79.0) · Source
Unchecked integer addition. Computes self + rhs, assuming overflow
cannot occur.
Calling x.unchecked_add(y) is semantically equivalent to calling
x.checked_add(y).unwrap_unchecked().
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_add.
§Safety
This results in undefined behavior when
self + rhs > i8::MAX or self + rhs < i8::MIN,
i.e. when checked_add would return None.
1.66.0 (const: 1.66.0) · Source
Checked addition with an unsigned integer. Computes self + rhs,
returning None if overflow occurred.
§Examples
assert_eq!(1i8.checked_add_unsigned(2), Some(3));
assert_eq!((i8::MAX - 2).checked_add_unsigned(3), None);1.91.0 (const: 1.91.0) · Source
Strict addition with an unsigned integer. Computes self + rhs,
panicking if overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(1i8.strict_add_unsigned(2), 3);The following panics because of overflow:
let _ = (i8::MAX - 2).strict_add_unsigned(3);1.0.0 (const: 1.47.0) · Source
Checked integer subtraction. Computes self - rhs, returning None if
overflow occurred.
§Examples
assert_eq!((i8::MIN + 2).checked_sub(1), Some(i8::MIN + 1));
assert_eq!((i8::MIN + 2).checked_sub(3), None);1.91.0 (const: 1.91.0) · Source
Strict integer subtraction. Computes self - rhs, panicking if
overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!((i8::MIN + 2).strict_sub(1), i8::MIN + 1);The following panics because of overflow:
let _ = (i8::MIN + 2).strict_sub(3);1.79.0 (const: 1.79.0) · Source
Unchecked integer subtraction. Computes self - rhs, assuming overflow
cannot occur.
Calling x.unchecked_sub(y) is semantically equivalent to calling
x.checked_sub(y).unwrap_unchecked().
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_sub.
§Safety
This results in undefined behavior when
self - rhs > i8::MAX or self - rhs < i8::MIN,
i.e. when checked_sub would return None.
1.66.0 (const: 1.66.0) · Source
Checked subtraction with an unsigned integer. Computes self - rhs,
returning None if overflow occurred.
§Examples
assert_eq!(1i8.checked_sub_unsigned(2), Some(-1));
assert_eq!((i8::MIN + 2).checked_sub_unsigned(3), None);1.91.0 (const: 1.91.0) · Source
Strict subtraction with an unsigned integer. Computes self - rhs,
panicking if overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(1i8.strict_sub_unsigned(2), -1);The following panics because of overflow:
let _ = (i8::MIN + 2).strict_sub_unsigned(3);1.0.0 (const: 1.47.0) · Source
Checked integer multiplication. Computes self * rhs, returning None if
overflow occurred.
§Examples
assert_eq!(i8::MAX.checked_mul(1), Some(i8::MAX));
assert_eq!(i8::MAX.checked_mul(2), None);1.91.0 (const: 1.91.0) · Source
Strict integer multiplication. Computes self * rhs, panicking if
overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(i8::MAX.strict_mul(1), i8::MAX);The following panics because of overflow:
let _ = i8::MAX.strict_mul(2);1.79.0 (const: 1.79.0) · Source
Unchecked integer multiplication. Computes self * rhs, assuming overflow
cannot occur.
Calling x.unchecked_mul(y) is semantically equivalent to calling
x.checked_mul(y).unwrap_unchecked().
If you’re just trying to avoid the panic in debug mode, then do not
use this. Instead, you’re looking for wrapping_mul.
§Safety
This results in undefined behavior when
self * rhs > i8::MAX or self * rhs < i8::MIN,
i.e. when checked_mul would return None.
1.0.0 (const: 1.52.0) · Source
Checked integer division. Computes self / rhs, returning None if rhs == 0
or the division results in overflow.
§Examples
assert_eq!((i8::MIN + 1).checked_div(-1), Some(127));
assert_eq!(i8::MIN.checked_div(-1), None);
assert_eq!((1i8).checked_div(0), None);1.91.0 (const: 1.91.0) · Source
Strict integer division. Computes self / rhs, panicking
if overflow occurred.
§Panics
This function will panic if rhs is zero.
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
The only case where such an overflow can occur is when one divides MIN / -1 on a signed type (where
MIN is the negative minimal value for the type); this is equivalent to -MIN, a positive value
that is too large to represent in the type.
§Examples
assert_eq!((i8::MIN + 1).strict_div(-1), 127);The following panics because of overflow:
let _ = i8::MIN.strict_div(-1);The following panics because of division by zero:
let _ = (1i8).strict_div(0);1.38.0 (const: 1.52.0) · Source
Checked Euclidean division. Computes self.div_euclid(rhs),
returning None if rhs == 0 or the division results in overflow.
§Examples
assert_eq!((i8::MIN + 1).checked_div_euclid(-1), Some(127));
assert_eq!(i8::MIN.checked_div_euclid(-1), None);
assert_eq!((1i8).checked_div_euclid(0), None);1.91.0 (const: 1.91.0) · Source
Strict Euclidean division. Computes self.div_euclid(rhs), panicking
if overflow occurred.
§Panics
This function will panic if rhs is zero.
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
The only case where such an overflow can occur is when one divides MIN / -1 on a signed type (where
MIN is the negative minimal value for the type); this is equivalent to -MIN, a positive value
that is too large to represent in the type.
§Examples
assert_eq!((i8::MIN + 1).strict_div_euclid(-1), 127);The following panics because of overflow:
let _ = i8::MIN.strict_div_euclid(-1);The following panics because of division by zero:
let _ = (1i8).strict_div_euclid(0);Source 🔬This is a nightly-only experimental API. (exact_div #139911)
exact_div #139911)Checked integer division without remainder. Computes self / rhs,
returning None if rhs == 0, the division results in overflow,
or self % rhs != 0.
§Examples
#![feature(exact_div)]
assert_eq!((i8::MIN + 1).checked_div_exact(-1), Some(127));
assert_eq!((-5i8).checked_div_exact(2), None);
assert_eq!(i8::MIN.checked_div_exact(-1), None);
assert_eq!((1i8).checked_div_exact(0), None);Source 🔬This is a nightly-only experimental API. (exact_div #139911)
exact_div #139911)Integer division without remainder. Computes self / rhs, returning None if self % rhs != 0.
§Panics
This function will panic if rhs == 0.
§Overflow behavior
On overflow, this function will panic if overflow checks are enabled (default in debug mode) and wrap if overflow checks are disabled (default in release mode).
§Examples
#![feature(exact_div)]
assert_eq!(64i8.div_exact(2), Some(32));
assert_eq!(64i8.div_exact(32), Some(2));
assert_eq!((i8::MIN + 1).div_exact(-1), Some(127));
assert_eq!(65i8.div_exact(2), None);#![feature(exact_div)]
let _ = 64i8.div_exact(0);#![feature(exact_div)]
let _ = i8::MIN.div_exact(-1);Source 🔬This is a nightly-only experimental API. (exact_div #139911)
exact_div #139911)Unchecked integer division without remainder. Computes self / rhs.
§Safety
This results in undefined behavior when rhs == 0, self % rhs != 0, or
self == i8::MIN && rhs == -1,
i.e. when checked_div_exact would return None.
1.7.0 (const: 1.52.0) · Source
Checked integer remainder. Computes self % rhs, returning None if
rhs == 0 or the division results in overflow.
§Examples
assert_eq!(5i8.checked_rem(2), Some(1));
assert_eq!(5i8.checked_rem(0), None);
assert_eq!(i8::MIN.checked_rem(-1), None);1.91.0 (const: 1.91.0) · Source
Strict integer remainder. Computes self % rhs, panicking if
the division results in overflow.
§Panics
This function will panic if rhs is zero.
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
The only case where such an overflow can occur is x % y for MIN / -1 on a
signed type (where MIN is the negative minimal value), which is invalid due to implementation artifacts.
§Examples
assert_eq!(5i8.strict_rem(2), 1);The following panics because of division by zero:
let _ = 5i8.strict_rem(0);The following panics because of overflow:
let _ = i8::MIN.strict_rem(-1);1.38.0 (const: 1.52.0) · Source
Checked Euclidean remainder. Computes self.rem_euclid(rhs), returning None
if rhs == 0 or the division results in overflow.
§Examples
assert_eq!(5i8.checked_rem_euclid(2), Some(1));
assert_eq!(5i8.checked_rem_euclid(0), None);
assert_eq!(i8::MIN.checked_rem_euclid(-1), None);1.91.0 (const: 1.91.0) · Source
Strict Euclidean remainder. Computes self.rem_euclid(rhs), panicking if
the division results in overflow.
§Panics
This function will panic if rhs is zero.
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
The only case where such an overflow can occur is x % y for MIN / -1 on a
signed type (where MIN is the negative minimal value), which is invalid due to implementation artifacts.
§Examples
assert_eq!(5i8.strict_rem_euclid(2), 1);The following panics because of division by zero:
let _ = 5i8.strict_rem_euclid(0);The following panics because of overflow:
let _ = i8::MIN.strict_rem_euclid(-1);1.7.0 (const: 1.47.0) · Source
Checked negation. Computes -self, returning None if self == MIN.
§Examples
assert_eq!(5i8.checked_neg(), Some(-5));
assert_eq!(i8::MIN.checked_neg(), None);1.93.0 (const: 1.93.0) · Source
Unchecked negation. Computes -self, assuming overflow cannot occur.
§Safety
This results in undefined behavior when
self == i8::MIN,
i.e. when checked_neg would return None.
1.91.0 (const: 1.91.0) · Source
1.7.0 (const: 1.47.0) · Source
Checked shift left. Computes self << rhs, returning None if rhs is larger
than or equal to the number of bits in self.
§Examples
assert_eq!(0x1i8.checked_shl(4), Some(0x10));
assert_eq!(0x1i8.checked_shl(129), None);
assert_eq!(0x10i8.checked_shl(7), Some(0));1.91.0 (const: 1.91.0) · Source
Strict shift left. Computes self << rhs, panicking if rhs is larger
than or equal to the number of bits in self.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(0x1i8.strict_shl(4), 0x10);The following panics because of overflow:
let _ = 0x1i8.strict_shl(129);1.93.0 (const: 1.93.0) · Source
Unchecked shift left. Computes self << rhs, assuming that
rhs is less than the number of bits in self.
§Safety
This results in undefined behavior if rhs is larger than
or equal to the number of bits in self,
i.e. when checked_shl would return None.
1.87.0 (const: 1.87.0) · Source
Unbounded shift left. Computes self << rhs, without bounding the value of rhs.
If rhs is larger or equal to the number of bits in self,
the entire value is shifted out, and 0 is returned.
§Examples
assert_eq!(0x1i8.unbounded_shl(4), 0x10);
assert_eq!(0x1i8.unbounded_shl(129), 0);Source 🔬This is a nightly-only experimental API. (exact_bitshifts #144336)
exact_bitshifts #144336)Exact shift left. Computes self << rhs as long as it can be reversed losslessly.
Returns None if any bits that would be shifted out differ from the resulting sign bit
or if rhs >=
i8::BITS.
Otherwise, returns Some(self << rhs).
§Examples
#![feature(exact_bitshifts)]
assert_eq!(0x1i8.shl_exact(4), Some(0x10));
assert_eq!(0x1i8.shl_exact(i8::BITS - 2), Some(1 << i8::BITS - 2));
assert_eq!(0x1i8.shl_exact(i8::BITS - 1), None);
assert_eq!((-0x2i8).shl_exact(i8::BITS - 2), Some(-0x2 << i8::BITS - 2));
assert_eq!((-0x2i8).shl_exact(i8::BITS - 1), None);Source 🔬This is a nightly-only experimental API. (exact_bitshifts #144336)
exact_bitshifts #144336)Unchecked exact shift left. Computes self << rhs, assuming the operation can be
losslessly reversed and rhs cannot be larger than
i8::BITS.
§Safety
This results in undefined behavior when rhs >= self.leading_zeros() && rhs >= self.leading_ones() i.e. when
i8::shl_exact
would return None.
1.7.0 (const: 1.47.0) · Source
Checked shift right. Computes self >> rhs, returning None if rhs is
larger than or equal to the number of bits in self.
§Examples
assert_eq!(0x10i8.checked_shr(4), Some(0x1));
assert_eq!(0x10i8.checked_shr(128), None);1.91.0 (const: 1.91.0) · Source
Strict shift right. Computes self >> rhs, panicking if rhs is
larger than or equal to the number of bits in self.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(0x10i8.strict_shr(4), 0x1);The following panics because of overflow:
let _ = 0x10i8.strict_shr(128);1.93.0 (const: 1.93.0) · Source
Unchecked shift right. Computes self >> rhs, assuming that
rhs is less than the number of bits in self.
§Safety
This results in undefined behavior if rhs is larger than
or equal to the number of bits in self,
i.e. when checked_shr would return None.
1.87.0 (const: 1.87.0) · Source
Unbounded shift right. Computes self >> rhs, without bounding the value of rhs.
If rhs is larger or equal to the number of bits in self,
the entire value is shifted out, which yields 0 for a positive number,
and -1 for a negative number.
§Examples
assert_eq!(0x10i8.unbounded_shr(4), 0x1);
assert_eq!(0x10i8.unbounded_shr(129), 0);
assert_eq!(i8::MIN.unbounded_shr(129), -1);Source 🔬This is a nightly-only experimental API. (exact_bitshifts #144336)
exact_bitshifts #144336)Exact shift right. Computes self >> rhs as long as it can be reversed losslessly.
Returns None if any non-zero bits would be shifted out or if rhs >=
i8::BITS.
Otherwise, returns Some(self >> rhs).
§Examples
#![feature(exact_bitshifts)]
assert_eq!(0x10i8.shr_exact(4), Some(0x1));
assert_eq!(0x10i8.shr_exact(5), None);Source 🔬This is a nightly-only experimental API. (exact_bitshifts #144336)
exact_bitshifts #144336)Unchecked exact shift right. Computes self >> rhs, assuming the operation can be
losslessly reversed and rhs cannot be larger than
i8::BITS.
§Safety
This results in undefined behavior when rhs > self.trailing_zeros() || rhs >= i8::BITS
i.e. when
i8::shr_exact
would return None.
1.13.0 (const: 1.47.0) · Source
Checked absolute value. Computes self.abs(), returning None if
self == MIN.
§Examples
assert_eq!((-5i8).checked_abs(), Some(5));
assert_eq!(i8::MIN.checked_abs(), None);1.91.0 (const: 1.91.0) · Source
Strict absolute value. Computes self.abs(), panicking if
self == MIN.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!((-5i8).strict_abs(), 5);The following panics because of overflow:
let _ = i8::MIN.strict_abs();1.34.0 (const: 1.50.0) · Source
Checked exponentiation. Computes self.pow(exp), returning None if
overflow occurred.
§Examples
assert_eq!(8i8.checked_pow(2), Some(64));
assert_eq!(0_i8.checked_pow(0), Some(1));
assert_eq!(i8::MAX.checked_pow(2), None);1.91.0 (const: 1.91.0) · Source
Strict exponentiation. Computes self.pow(exp), panicking if
overflow occurred.
§Panics
§Overflow behavior
This function will always panic on overflow, regardless of whether overflow checks are enabled.
§Examples
assert_eq!(8i8.strict_pow(2), 64);
assert_eq!(0_i8.strict_pow(0), 1);The following panics because of overflow:
let _ = i8::MAX.strict_pow(2);1.84.0 (const: 1.84.0) · Source
Returns the square root of the number, rounded down.
Returns None if self is negative.
§Examples
assert_eq!(10i8.checked_isqrt(), Some(3));1.0.0 (const: 1.47.0) · Source
Saturating integer addition. Computes self + rhs, saturating at the numeric
bounds instead of overflowing.
§Examples
assert_eq!(100i8.saturating_add(1), 101);
assert_eq!(i8::MAX.saturating_add(100), i8::MAX);
assert_eq!(i8::MIN.saturating_add(-1), i8::MIN);1.66.0 (const: 1.66.0) · Source
Saturating addition with an unsigned integer. Computes self + rhs,
saturating at the numeric bounds instead of overflowing.
§Examples
assert_eq!(1i8.saturating_add_unsigned(2), 3);
assert_eq!(i8::MAX.saturating_add_unsigned(100), i8::MAX);1.0.0 (const: 1.47.0) · Source
Saturating integer subtraction. Computes self - rhs, saturating at the
numeric bounds instead of overflowing.
§Examples
assert_eq!(100i8.saturating_sub(127), -27);
assert_eq!(i8::MIN.saturating_sub(100), i8::MIN);
assert_eq!(i8::MAX.saturating_sub(-1), i8::MAX);1.66.0 (const: 1.66.0) · Source
Saturating subtraction with an unsigned integer. Computes self - rhs,
saturating at the numeric bounds instead of overflowing.
§Examples
assert_eq!(100i8.saturating_sub_unsigned(127), -27);
assert_eq!(i8::MIN.saturating_sub_unsigned(100), i8::MIN);1.45.0 (const: 1.47.0) · Source
Saturating integer negation. Computes -self, returning MAX if self == MIN
instead of overflowing.
§Examples
assert_eq!(100i8.saturating_neg(), -100);
assert_eq!((-100i8).saturating_neg(), 100);
assert_eq!(i8::MIN.saturating_neg(), i8::MAX);
assert_eq!(i8::MAX.saturating_neg(), i8::MIN + 1);1.45.0 (const: 1.47.0) · Source
Saturating absolute value. Computes self.abs(), returning MAX if self == MIN instead of overflowing.
§Examples
assert_eq!(100i8.saturating_abs(), 100);
assert_eq!((-100i8).saturating_abs(), 100);
assert_eq!(i8::MIN.saturating_abs(), i8::MAX);
assert_eq!((i8::MIN + 1).saturating_abs(), i8::MAX);1.7.0 (const: 1.47.0) · Source
Saturating integer multiplication. Computes self * rhs, saturating at the
numeric bounds instead of overflowing.
§Examples
assert_eq!(10i8.saturating_mul(12), 120);
assert_eq!(i8::MAX.saturating_mul(10), i8::MAX);
assert_eq!(i8::MIN.saturating_mul(10), i8::MIN);1.58.0 (const: 1.58.0) · Source
Saturating integer division. Computes self / rhs, saturating at the
numeric bounds instead of overflowing.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(5i8.saturating_div(2), 2);
assert_eq!(i8::MAX.saturating_div(-1), i8::MIN + 1);
assert_eq!(i8::MIN.saturating_div(-1), i8::MAX);
1.34.0 (const: 1.50.0) · Source
Saturating integer exponentiation. Computes self.pow(exp),
saturating at the numeric bounds instead of overflowing.
§Examples
assert_eq!((-4i8).saturating_pow(3), -64);
assert_eq!(0_i8.saturating_pow(0), 1);
assert_eq!(i8::MIN.saturating_pow(2), i8::MAX);
assert_eq!(i8::MIN.saturating_pow(3), i8::MIN);1.0.0 (const: 1.32.0) · Source
Wrapping (modular) addition. Computes self + rhs, wrapping around at the
boundary of the type.
§Examples
assert_eq!(100i8.wrapping_add(27), 127);
assert_eq!(i8::MAX.wrapping_add(2), i8::MIN + 1);1.66.0 (const: 1.66.0) · Source
Wrapping (modular) addition with an unsigned integer. Computes
self + rhs, wrapping around at the boundary of the type.
§Examples
assert_eq!(100i8.wrapping_add_unsigned(27), 127);
assert_eq!(i8::MAX.wrapping_add_unsigned(2), i8::MIN + 1);1.0.0 (const: 1.32.0) · Source
Wrapping (modular) subtraction. Computes self - rhs, wrapping around at the
boundary of the type.
§Examples
assert_eq!(0i8.wrapping_sub(127), -127);
assert_eq!((-2i8).wrapping_sub(i8::MAX), i8::MAX);1.66.0 (const: 1.66.0) · Source
Wrapping (modular) subtraction with an unsigned integer. Computes
self - rhs, wrapping around at the boundary of the type.
§Examples
assert_eq!(0i8.wrapping_sub_unsigned(127), -127);
assert_eq!((-2i8).wrapping_sub_unsigned(u8::MAX), -1);1.0.0 (const: 1.32.0) · Source
Wrapping (modular) multiplication. Computes self * rhs, wrapping around at
the boundary of the type.
§Examples
assert_eq!(10i8.wrapping_mul(12), 120);
assert_eq!(11i8.wrapping_mul(12), -124);1.2.0 (const: 1.52.0) · Source
Wrapping (modular) division. Computes self / rhs, wrapping around at the
boundary of the type.
The only case where such wrapping can occur is when one divides MIN / -1 on a signed type (where
MIN is the negative minimal value for the type); this is equivalent to -MIN, a positive value
that is too large to represent in the type. In such a case, this function returns MIN itself.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(100i8.wrapping_div(10), 10);
assert_eq!((-128i8).wrapping_div(-1), -128);1.38.0 (const: 1.52.0) · Source
Wrapping Euclidean division. Computes self.div_euclid(rhs),
wrapping around at the boundary of the type.
Wrapping will only occur in MIN / -1 on a signed type (where MIN is the negative minimal value
for the type). This is equivalent to -MIN, a positive value that is too large to represent in the
type. In this case, this method returns MIN itself.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(100i8.wrapping_div_euclid(10), 10);
assert_eq!((-128i8).wrapping_div_euclid(-1), -128);1.2.0 (const: 1.52.0) · Source
Wrapping (modular) remainder. Computes self % rhs, wrapping around at the
boundary of the type.
Such wrap-around never actually occurs mathematically; implementation artifacts make x % y
invalid for MIN / -1 on a signed type (where MIN is the negative minimal value). In such a case,
this function returns 0.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(100i8.wrapping_rem(10), 0);
assert_eq!((-128i8).wrapping_rem(-1), 0);1.38.0 (const: 1.52.0) · Source
Wrapping Euclidean remainder. Computes self.rem_euclid(rhs), wrapping around
at the boundary of the type.
Wrapping will only occur in MIN % -1 on a signed type (where MIN is the negative minimal value
for the type). In this case, this method returns 0.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(100i8.wrapping_rem_euclid(10), 0);
assert_eq!((-128i8).wrapping_rem_euclid(-1), 0);1.2.0 (const: 1.32.0) · Source
Wrapping (modular) negation. Computes -self, wrapping around at the boundary
of the type.
The only case where such wrapping can occur is when one negates MIN on a signed type (where MIN
is the negative minimal value for the type); this is a positive value that is too large to represent
in the type. In such a case, this function returns MIN itself.
§Examples
assert_eq!(100i8.wrapping_neg(), -100);
assert_eq!((-100i8).wrapping_neg(), 100);
assert_eq!(i8::MIN.wrapping_neg(), i8::MIN);1.2.0 (const: 1.32.0) · Source
Panic-free bitwise shift-left; yields self << mask(rhs), where mask removes
any high-order bits of rhs that would cause the shift to exceed the bitwidth of the type.
Note that this is not the same as a rotate-left; the RHS of a wrapping shift-left is restricted to
the range of the type, rather than the bits shifted out of the LHS being returned to the other end.
The primitive integer types all implement a rotate_left function,
which may be what you want instead.
§Examples
assert_eq!((-1i8).wrapping_shl(7), -128);
assert_eq!((-1i8).wrapping_shl(128), -1);1.2.0 (const: 1.32.0) · Source
Panic-free bitwise shift-right; yields self >> mask(rhs), where mask
removes any high-order bits of rhs that would cause the shift to exceed the bitwidth of the type.
Note that this is not the same as a rotate-right; the RHS of a wrapping shift-right is restricted
to the range of the type, rather than the bits shifted out of the LHS being returned to the other
end. The primitive integer types all implement a rotate_right function,
which may be what you want instead.
§Examples
assert_eq!((-128i8).wrapping_shr(7), -1);
assert_eq!((-128i16).wrapping_shr(64), -128);1.13.0 (const: 1.32.0) · Source
Wrapping (modular) absolute value. Computes self.abs(), wrapping around at
the boundary of the type.
The only case where such wrapping can occur is when one takes the absolute value of the negative
minimal value for the type; this is a positive value that is too large to represent in the type. In
such a case, this function returns MIN itself.
§Examples
assert_eq!(100i8.wrapping_abs(), 100);
assert_eq!((-100i8).wrapping_abs(), 100);
assert_eq!(i8::MIN.wrapping_abs(), i8::MIN);
assert_eq!((-128i8).wrapping_abs() as u8, 128);1.51.0 (const: 1.51.0) · Source
Computes the absolute value of self without any wrapping
or panicking.
§Examples
assert_eq!(100i8.unsigned_abs(), 100u8);
assert_eq!((-100i8).unsigned_abs(), 100u8);
assert_eq!((-128i8).unsigned_abs(), 128u8);1.34.0 (const: 1.50.0) · Source
Wrapping (modular) exponentiation. Computes self.pow(exp),
wrapping around at the boundary of the type.
§Examples
assert_eq!(3i8.wrapping_pow(4), 81);
assert_eq!(3i8.wrapping_pow(5), -13);
assert_eq!(3i8.wrapping_pow(6), -39);
assert_eq!(0_i8.wrapping_pow(0), 1);1.7.0 (const: 1.32.0) · Source
Calculates self + rhs.
Returns a tuple of the addition along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
§Examples
assert_eq!(5i8.overflowing_add(2), (7, false));
assert_eq!(i8::MAX.overflowing_add(1), (i8::MIN, true));Source 🔬This is a nightly-only experimental API. (bigint_helper_methods #85532)
bigint_helper_methods #85532)Calculates self + rhs + carry and checks for overflow.
Performs “ternary addition” of two integer operands and a carry-in bit, and returns a tuple of the sum along with a boolean indicating whether an arithmetic overflow would occur. On overflow, the wrapped value is returned.
This allows chaining together multiple additions to create a wider
addition, and can be useful for bignum addition. This method should
only be used for the most significant word; for the less significant
words the unsigned method
u8::carrying_add
should be used.
The output boolean returned by this method is not a carry flag, and should not be added to a more significant word.
If the input carry is false, this method is equivalent to
overflowing_add.
§Examples
#![feature(bigint_helper_methods)]
// Only the most significant word is signed.
//
// 10 MAX (a = 10 × 2^8 + 2^8 - 1)
// + -5 9 (b = -5 × 2^8 + 9)
// ---------
// 6 8 (sum = 6 × 2^8 + 8)
let (a1, a0): (i8, u8) = (10, u8::MAX);
let (b1, b0): (i8, u8) = (-5, 9);
let carry0 = false;
// u8::carrying_add for the less significant words
let (sum0, carry1) = a0.carrying_add(b0, carry0);
assert_eq!(carry1, true);
// i8::carrying_add for the most significant word
let (sum1, overflow) = a1.carrying_add(b1, carry1);
assert_eq!(overflow, false);
assert_eq!((sum1, sum0), (6, 8));1.66.0 (const: 1.66.0) · Source
Calculates self + rhs with an unsigned rhs.
Returns a tuple of the addition along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
§Examples
assert_eq!(1i8.overflowing_add_unsigned(2), (3, false));
assert_eq!((i8::MIN).overflowing_add_unsigned(u8::MAX), (i8::MAX, false));
assert_eq!((i8::MAX - 2).overflowing_add_unsigned(3), (i8::MIN, true));1.7.0 (const: 1.32.0) · Source
Calculates self - rhs.
Returns a tuple of the subtraction along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
§Examples
assert_eq!(5i8.overflowing_sub(2), (3, false));
assert_eq!(i8::MIN.overflowing_sub(1), (i8::MAX, true));Source 🔬This is a nightly-only experimental API. (bigint_helper_methods #85532)
bigint_helper_methods #85532)Calculates self − rhs − borrow and checks for
overflow.
Performs “ternary subtraction” by subtracting both an integer
operand and a borrow-in bit from self, and returns a tuple of the
difference along with a boolean indicating whether an arithmetic
overflow would occur. On overflow, the wrapped value is returned.
This allows chaining together multiple subtractions to create a
wider subtraction, and can be useful for bignum subtraction. This
method should only be used for the most significant word; for the
less significant words the unsigned method
u8::borrowing_sub
should be used.
The output boolean returned by this method is not a borrow flag, and should not be subtracted from a more significant word.
If the input borrow is false, this method is equivalent to
overflowing_sub.
§Examples
#![feature(bigint_helper_methods)]
// Only the most significant word is signed.
//
// 6 8 (a = 6 × 2^8 + 8)
// - -5 9 (b = -5 × 2^8 + 9)
// ---------
// 10 MAX (diff = 10 × 2^8 + 2^8 - 1)
let (a1, a0): (i8, u8) = (6, 8);
let (b1, b0): (i8, u8) = (-5, 9);
let borrow0 = false;
// u8::borrowing_sub for the less significant words
let (diff0, borrow1) = a0.borrowing_sub(b0, borrow0);
assert_eq!(borrow1, true);
// i8::borrowing_sub for the most significant word
let (diff1, overflow) = a1.borrowing_sub(b1, borrow1);
assert_eq!(overflow, false);
assert_eq!((diff1, diff0), (10, u8::MAX));1.66.0 (const: 1.66.0) · Source
Calculates self - rhs with an unsigned rhs.
Returns a tuple of the subtraction along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
§Examples
assert_eq!(1i8.overflowing_sub_unsigned(2), (-1, false));
assert_eq!((i8::MAX).overflowing_sub_unsigned(u8::MAX), (i8::MIN, false));
assert_eq!((i8::MIN + 2).overflowing_sub_unsigned(3), (i8::MAX, true));1.7.0 (const: 1.32.0) · Source
Calculates the multiplication of self and rhs.
Returns a tuple of the multiplication along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.
§Examples
assert_eq!(5i8.overflowing_mul(2), (10, false));
assert_eq!(1_000_000_000i32.overflowing_mul(10), (1410065408, true));Source 🔬This is a nightly-only experimental API. (bigint_helper_methods #85532)
bigint_helper_methods #85532)Calculates the complete product self * rhs without the possibility to overflow.
This returns the low-order (wrapping) bits and the high-order (overflow) bits of the result as two separate values, in that order.
If you also need to add a carry to the wide result, then you want
Self::carrying_mul instead.
§Examples
Please note that this example is shared among integer types, which is why i32 is used.
#![feature(bigint_helper_methods)]
assert_eq!(5i32.widening_mul(-2), (4294967286, -1));
assert_eq!(1_000_000_000i32.widening_mul(-10), (2884901888, -3));Source 🔬This is a nightly-only experimental API. (bigint_helper_methods #85532)
bigint_helper_methods #85532)Calculates the “full multiplication” self * rhs + carry
without the possibility to overflow.
This returns the low-order (wrapping) bits and the high-order (overflow) bits of the result as two separate values, in that order.
Performs “long multiplication” which takes in an extra amount to add, and may return an additional amount of overflow. This allows for chaining together multiple multiplications to create “big integers” which represent larger values.
If you don’t need the carry, then you can use Self::widening_mul instead.
§Examples
Please note that this example is shared among integer types, which is why i32 is used.
#![feature(bigint_helper_methods)]
assert_eq!(5i32.carrying_mul(-2, 0), (4294967286, -1));
assert_eq!(5i32.carrying_mul(-2, 10), (0, 0));
assert_eq!(1_000_000_000i32.carrying_mul(-10, 0), (2884901888, -3));
assert_eq!(1_000_000_000i32.carrying_mul(-10, 10), (2884901898, -3));
assert_eq!(i8::MAX.carrying_mul(i8::MAX, i8::MAX), (i8::MAX.unsigned_abs() + 1, i8::MAX / 2));Source 🔬This is a nightly-only experimental API. (bigint_helper_methods #85532)
bigint_helper_methods #85532)Calculates the “full multiplication” self * rhs + carry + add
without the possibility to overflow.
This returns the low-order (wrapping) bits and the high-order (overflow) bits of the result as two separate values, in that order.
Performs “long multiplication” which takes in an extra amount to add, and may return an additional amount of overflow. This allows for chaining together multiple multiplications to create “big integers” which represent larger values.
If you don’t need either carry, then you can use Self::widening_mul instead,
and if you only need one carry, then you can use Self::carrying_mul instead.
§Examples
Please note that this example is shared among integer types, which is why i32 is used.
#![feature(bigint_helper_methods)]
assert_eq!(5i32.carrying_mul_add(-2, 0, 0), (4294967286, -1));
assert_eq!(5i32.carrying_mul_add(-2, 10, 10), (10, 0));
assert_eq!(1_000_000_000i32.carrying_mul_add(-10, 0, 0), (2884901888, -3));
assert_eq!(1_000_000_000i32.carrying_mul_add(-10, 10, 10), (2884901908, -3));
assert_eq!(i8::MAX.carrying_mul_add(i8::MAX, i8::MAX, i8::MAX), (u8::MAX, i8::MAX / 2));1.7.0 (const: 1.52.0) · Source
Calculates the divisor when self is divided by rhs.
Returns a tuple of the divisor along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would occur then self is returned.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(5i8.overflowing_div(2), (2, false));
assert_eq!(i8::MIN.overflowing_div(-1), (i8::MIN, true));1.38.0 (const: 1.52.0) · Source
Calculates the quotient of Euclidean division self.div_euclid(rhs).
Returns a tuple of the divisor along with a boolean indicating whether an arithmetic overflow would
occur. If an overflow would occur then self is returned.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(5i8.overflowing_div_euclid(2), (2, false));
assert_eq!(i8::MIN.overflowing_div_euclid(-1), (i8::MIN, true));1.7.0 (const: 1.52.0) · Source
Calculates the remainder when self is divided by rhs.
Returns a tuple of the remainder after dividing along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would occur then 0 is returned.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(5i8.overflowing_rem(2), (1, false));
assert_eq!(i8::MIN.overflowing_rem(-1), (0, true));1.38.0 (const: 1.52.0) · Source
Overflowing Euclidean remainder. Calculates self.rem_euclid(rhs).
Returns a tuple of the remainder after dividing along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would occur then 0 is returned.
§Panics
This function will panic if rhs is zero.
§Examples
assert_eq!(5i8.overflowing_rem_euclid(2), (1, false));
assert_eq!(i8::MIN.overflowing_rem_euclid(-1), (0, true));1.7.0 (const: 1.32.0) · Source
Negates self, overflowing if this is equal to the minimum value.
Returns a tuple of the negated version of self along with a boolean indicating whether an overflow
happened. If self is the minimum value (e.g., i32::MIN for values of type i32), then the
minimum value will be returned again and true will be returned for an overflow happening.
§Examples
assert_eq!(2i8.overflowing_neg(), (-2, false));
assert_eq!(i8::MIN.overflowing_neg(), (i8::MIN, true));1.7.0 (const: 1.32.0) · Source
Shifts self left by rhs bits.
Returns a tuple of the shifted version of self along with a boolean indicating whether the shift value was larger than or equal to the number of bits. If the shift value is too large, then value is masked (N-1) where N is the number of bits, and this value is then used to perform the shift.
§Examples
assert_eq!(0x1i8.overflowing_shl(4), (0x10, false));
assert_eq!(0x1i32.overflowing_shl(36), (0x10, true));
assert_eq!(0x10i8.overflowing_shl(7), (0, false));1.7.0 (const: 1.32.0) · Source
Shifts self right by rhs bits.
Returns a tuple of the shifted version of self along with a boolean indicating whether the shift value was larger than or equal to the number of bits. If the shift value is too large, then value is masked (N-1) where N is the number of bits, and this value is then used to perform the shift.
§Examples
assert_eq!(0x10i8.overflowing_shr(4), (0x1, false));
assert_eq!(0x10i32.overflowing_shr(36), (0x1, true));1.13.0 (const: 1.32.0) · Source
Computes the absolute value of self.
Returns a tuple of the absolute version of self along with a boolean indicating whether an overflow happened. If self is the minimum value (e.g., i8::MIN for values of type i8), then the minimum value will be returned again and true will be returned for an overflow happening.
§Examples
assert_eq!(10i8.overflowing_abs(), (10, false));
assert_eq!((-10i8).overflowing_abs(), (10, false));
assert_eq!((i8::MIN).overflowing_abs(), (i8::MIN, true));1.34.0 (const: 1.50.0) · Source
Raises self to the power of exp, using exponentiation by squaring.
Returns a tuple of the exponentiation along with a bool indicating whether an overflow happened.
§Examples
assert_eq!(3i8.overflowing_pow(4), (81, false));
assert_eq!(0_i8.overflowing_pow(0), (1, false));
assert_eq!(3i8.overflowing_pow(5), (-13, true));1.0.0 (const: 1.50.0) · Source
Raises self to the power of exp, using exponentiation by squaring.
§Examples
let x: i8 = 2; // or any other integer type
assert_eq!(x.pow(5), 32);
assert_eq!(0_i8.pow(0), 1);1.84.0 (const: 1.84.0) · Source
1.38.0 (const: 1.52.0) · Source
Calculates the quotient of Euclidean division of self by rhs.
This computes the integer q such that self = q * rhs + r, with
r = self.rem_euclid(rhs) and 0 <= r < abs(rhs).
In other words, the result is self / rhs rounded to the integer q
such that self >= q * rhs.
If self > 0, this is equal to rounding towards zero (the default in Rust);
if self < 0, this is equal to rounding away from zero (towards +/- infinity).
If rhs > 0, this is equal to rounding towards -infinity;
if rhs < 0, this is equal to rounding towards +infinity.
§Panics
This function will panic if rhs is zero or if self is Self::MIN
and rhs is -1. This behavior is not affected by the overflow-checks flag.
§Examples
let a: i8 = 7; // or any other integer type
let b = 4;
assert_eq!(a.div_euclid(b), 1); // 7 >= 4 * 1
assert_eq!(a.div_euclid(-b), -1); // 7 >= -4 * -1
assert_eq!((-a).div_euclid(b), -2); // -7 >= 4 * -2
assert_eq!((-a).div_euclid(-b), 2); // -7 >= -4 * 21.38.0 (const: 1.52.0) · Source
Calculates the least nonnegative remainder of self (mod rhs).
This is done as if by the Euclidean division algorithm – given
r = self.rem_euclid(rhs), the result satisfies
self = rhs * self.div_euclid(rhs) + r and 0 <= r < abs(rhs).
§Panics
This function will panic if rhs is zero or if self is Self::MIN and
rhs is -1. This behavior is not affected by the overflow-checks flag.
§Examples
let a: i8 = 7; // or any other integer type
let b = 4;
assert_eq!(a.rem_euclid(b), 3);
assert_eq!((-a).rem_euclid(b), 1);
assert_eq!(a.rem_euclid(-b), 3);
assert_eq!((-a).rem_euclid(-b), 1);This will panic:
let _ = i8::MIN.rem_euclid(-1);Source 🔬This is a nightly-only experimental API. (int_roundings #88581)
int_roundings #88581)Calculates the quotient of self and rhs, rounding the result towards negative infinity.
§Panics
This function will panic if rhs is zero or if self is Self::MIN
and rhs is -1. This behavior is not affected by the overflow-checks flag.
§Examples
#![feature(int_roundings)]
let a: i8 = 8;
let b = 3;
assert_eq!(a.div_floor(b), 2);
assert_eq!(a.div_floor(-b), -3);
assert_eq!((-a).div_floor(b), -3);
assert_eq!((-a).div_floor(-b), 2);Source 🔬This is a nightly-only experimental API. (int_roundings #88581)
int_roundings #88581)Calculates the quotient of self and rhs, rounding the result towards positive infinity.
§Panics
This function will panic if rhs is zero or if self is Self::MIN
and rhs is -1. This behavior is not affected by the overflow-checks flag.
§Examples
#![feature(int_roundings)]
let a: i8 = 8;
let b = 3;
assert_eq!(a.div_ceil(b), 3);
assert_eq!(a.div_ceil(-b), -2);
assert_eq!((-a).div_ceil(b), -2);
assert_eq!((-a).div_ceil(-b), 3);Source 🔬This is a nightly-only experimental API. (int_roundings #88581)
int_roundings #88581)If rhs is positive, calculates the smallest value greater than or
equal to self that is a multiple of rhs. If rhs is negative,
calculates the largest value less than or equal to self that is a
multiple of rhs.
§Panics
This function will panic if rhs is zero.
§Overflow behavior
On overflow, this function will panic if overflow checks are enabled (default in debug mode) and wrap if overflow checks are disabled (default in release mode).
§Examples
#![feature(int_roundings)]
assert_eq!(16_i8.next_multiple_of(8), 16);
assert_eq!(23_i8.next_multiple_of(8), 24);
assert_eq!(16_i8.next_multiple_of(-8), 16);
assert_eq!(23_i8.next_multiple_of(-8), 16);
assert_eq!((-16_i8).next_multiple_of(8), -16);
assert_eq!((-23_i8).next_multiple_of(8), -16);
assert_eq!((-16_i8).next_multiple_of(-8), -16);
assert_eq!((-23_i8).next_multiple_of(-8), -24);Source 🔬This is a nightly-only experimental API. (int_roundings #88581)
int_roundings #88581)If rhs is positive, calculates the smallest value greater than or
equal to self that is a multiple of rhs. If rhs is negative,
calculates the largest value less than or equal to self that is a
multiple of rhs. Returns None if rhs is zero or the operation
would result in overflow.
§Examples
#![feature(int_roundings)]
assert_eq!(16_i8.checked_next_multiple_of(8), Some(16));
assert_eq!(23_i8.checked_next_multiple_of(8), Some(24));
assert_eq!(16_i8.checked_next_multiple_of(-8), Some(16));
assert_eq!(23_i8.checked_next_multiple_of(-8), Some(16));
assert_eq!((-16_i8).checked_next_multiple_of(8), Some(-16));
assert_eq!((-23_i8).checked_next_multiple_of(8), Some(-16));
assert_eq!((-16_i8).checked_next_multiple_of(-8), Some(-16));
assert_eq!((-23_i8).checked_next_multiple_of(-8), Some(-24));
assert_eq!(1_i8.checked_next_multiple_of(0), None);
assert_eq!(i8::MAX.checked_next_multiple_of(2), None);1.67.0 (const: 1.67.0) · Source
Returns the logarithm of the number with respect to an arbitrary base, rounded down.
This method might not be optimized owing to implementation details;
ilog2 can produce results more efficiently for base 2, and ilog10
can produce results more efficiently for base 10.
§Panics
This function will panic if self is less than or equal to zero,
or if base is less than 2.
§Examples
assert_eq!(5i8.ilog(5), 1);1.67.0 (const: 1.67.0) · Source
1.67.0 (const: 1.67.0) · Source
1.67.0 (const: 1.67.0) · Source
Returns the logarithm of the number with respect to an arbitrary base, rounded down.
Returns None if the number is negative or zero, or if the base is not at least 2.
This method might not be optimized owing to implementation details;
checked_ilog2 can produce results more efficiently for base 2, and
checked_ilog10 can produce results more efficiently for base 10.
§Examples
assert_eq!(5i8.checked_ilog(5), Some(1));1.67.0 (const: 1.67.0) · Source
Returns the base 2 logarithm of the number, rounded down.
Returns None if the number is negative or zero.
§Examples
assert_eq!(2i8.checked_ilog2(), Some(1));1.67.0 (const: 1.67.0) · Source
Returns the base 10 logarithm of the number, rounded down.
Returns None if the number is negative or zero.
§Example
assert_eq!(10i8.checked_ilog10(), Some(1));1.0.0 (const: 1.32.0) · Source
Computes the absolute value of self.
§Overflow behavior
The absolute value of
i8::MIN
cannot be represented as an
i8,
and attempting to calculate it will cause an overflow. This means
that code in debug mode will trigger a panic on this case and
optimized code will return
i8::MIN
without a panic. If you do not want this behavior, consider
using unsigned_abs instead.
§Examples
assert_eq!(10i8.abs(), 10);
assert_eq!((-10i8).abs(), 10);1.60.0 (const: 1.60.0) · Source
Computes the absolute difference between self and other.
This function always returns the correct answer without overflow or panics by returning an unsigned integer.
§Examples
assert_eq!(100i8.abs_diff(80), 20u8);
assert_eq!(100i8.abs_diff(110), 10u8);
assert_eq!((-100i8).abs_diff(80), 180u8);
assert_eq!((-100i8).abs_diff(-120), 20u8);
assert_eq!(i8::MIN.abs_diff(i8::MAX), u8::MAX);1.0.0 (const: 1.47.0) · Source
Returns a number representing sign of self.
0if the number is zero1if the number is positive-1if the number is negative
§Examples
assert_eq!(10i8.signum(), 1);
assert_eq!(0i8.signum(), 0);
assert_eq!((-10i8).signum(), -1);1.0.0 (const: 1.32.0) · Source
Returns true if self is positive and false if the number is zero or
negative.
§Examples
assert!(10i8.is_positive());
assert!(!(-10i8).is_positive());1.0.0 (const: 1.32.0) · Source
Returns true if self is negative and false if the number is zero or
positive.
§Examples
assert!((-10i8).is_negative());
assert!(!10i8.is_negative());1.32.0 (const: 1.44.0) · Source
Returns the memory representation of this integer as a byte array in big-endian (network) byte order.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let bytes = 0x12i8.to_be_bytes();
assert_eq!(bytes, [0x12]);1.32.0 (const: 1.44.0) · Source
Returns the memory representation of this integer as a byte array in little-endian byte order.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let bytes = 0x12i8.to_le_bytes();
assert_eq!(bytes, [0x12]);1.32.0 (const: 1.44.0) · Source
Returns the memory representation of this integer as a byte array in native byte order.
As the target platform’s native endianness is used, portable code
should use to_be_bytes or to_le_bytes, as appropriate,
instead.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let bytes = 0x12i8.to_ne_bytes();
assert_eq!(
bytes,
if cfg!(target_endian = "big") {
[0x12]
} else {
[0x12]
}
);1.32.0 (const: 1.44.0) · Source
Creates an integer value from its representation as a byte array in big endian.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let value = i8::from_be_bytes([0x12]);
assert_eq!(value, 0x12);When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_be_i8(input: &mut &[u8]) -> i8 {
let (int_bytes, rest) = input.split_at(size_of::<i8>());
*input = rest;
i8::from_be_bytes(int_bytes.try_into().unwrap())
}1.32.0 (const: 1.44.0) · Source
Creates an integer value from its representation as a byte array in little endian.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let value = i8::from_le_bytes([0x12]);
assert_eq!(value, 0x12);When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_le_i8(input: &mut &[u8]) -> i8 {
let (int_bytes, rest) = input.split_at(size_of::<i8>());
*input = rest;
i8::from_le_bytes(int_bytes.try_into().unwrap())
}1.32.0 (const: 1.44.0) · Source
Creates an integer value from its memory representation as a byte array in native endianness.
As the target platform’s native endianness is used, portable code
likely wants to use from_be_bytes or from_le_bytes, as
appropriate instead.
Note: This function is meaningless on i8. Byte order does not exist as a
concept for byte-sized integers. This function is only provided in symmetry
with larger integer types. You can cast from and to u8 using
cast_signed and cast_unsigned.
§Examples
let value = i8::from_ne_bytes(if cfg!(target_endian = "big") {
[0x12]
} else {
[0x12]
});
assert_eq!(value, 0x12);When starting from a slice rather than an array, fallible conversion APIs can be used:
fn read_ne_i8(input: &mut &[u8]) -> i8 {
let (int_bytes, rest) = input.split_at(size_of::<i8>());
*input = rest;
i8::from_ne_bytes(int_bytes.try_into().unwrap())
}1.0.0 (const: 1.32.0) · Source 👎Deprecating in a future version: replaced by the MIN associated constant on this type
MIN associated constant on this typeNew code should prefer to use
i8::MIN instead.
Returns the smallest value that can be represented by this integer type.
1.0.0 (const: 1.32.0) · Source 👎Deprecating in a future version: replaced by the MAX associated constant on this type
MAX associated constant on this typeNew code should prefer to use
i8::MAX instead.
Returns the largest value that can be represented by this integer type.
Source 🔬This is a nightly-only experimental API. (clamp_magnitude #148519)
clamp_magnitude #148519)Clamps this number to a symmetric range centred around zero.
The method clamps the number’s magnitude (absolute value) to be at most limit.
This is functionally equivalent to self.clamp(-limit, limit), but is more
explicit about the intent.
§Examples
#![feature(clamp_magnitude)]
assert_eq!(120i8.clamp_magnitude(100), 100);
assert_eq!(-120i8.clamp_magnitude(100), -100);
assert_eq!(80i8.clamp_magnitude(100), 80);
assert_eq!(-80i8.clamp_magnitude(100), -80);1.87.0 (const: 1.87.0) · Source
Calculates the midpoint (average) between self and rhs.
midpoint(a, b) is (a + b) / 2 as if it were performed in a
sufficiently-large signed integral type. This implies that the result is
always rounded towards zero and that no overflow will ever occur.
§Examples
assert_eq!(0i8.midpoint(4), 2);
assert_eq!((-1i8).midpoint(2), 0);
assert_eq!((-7i8).midpoint(0), -3);
assert_eq!(0i8.midpoint(-7), -3);
assert_eq!(0i8.midpoint(7), 3);Source§
1.0.0 (const: 1.82.0) · Source
Parses an integer from a string slice with digits in a given base.
The string is expected to be an optional
+ or -
sign followed by only digits. Leading and trailing non-digit characters (including
whitespace) represent an error. Underscores (which are accepted in Rust literals)
also represent an error.
Digits are a subset of these characters, depending on radix:
0-9a-zA-Z
§Panics
This function panics if radix is not in the range from 2 to 36.
§See also
If the string to be parsed is in base 10 (decimal),
from_str or str::parse can also be used.
§Examples
assert_eq!(i8::from_str_radix("A", 16), Ok(10));Trailing space returns error:
assert!(i8::from_str_radix("1 ", 10).is_err());Source 🔬This is a nightly-only experimental API. (int_from_ascii #134821)
int_from_ascii #134821)Parses an integer from an ASCII-byte slice with decimal digits.
The characters are expected to be an optional
+ or -
sign followed by only digits. Leading and trailing non-digit characters (including
whitespace) represent an error. Underscores (which are accepted in Rust literals)
also represent an error.
§Examples
#![feature(int_from_ascii)]
assert_eq!(i8::from_ascii(b"+10"), Ok(10));Trailing space returns error:
assert!(i8::from_ascii(b"1 ").is_err());Source 🔬This is a nightly-only experimental API. (int_from_ascii #134821)
int_from_ascii #134821)Parses an integer from an ASCII-byte slice with digits in a given base.
The characters are expected to be an optional
+ or -
sign followed by only digits. Leading and trailing non-digit characters (including
whitespace) represent an error. Underscores (which are accepted in Rust literals)
also represent an error.
Digits are a subset of these characters, depending on radix:
0-9a-zA-Z
§Panics
This function panics if radix is not in the range from 2 to 36.
§Examples
#![feature(int_from_ascii)]
assert_eq!(i8::from_ascii_radix(b"A", 16), Ok(10));Trailing space returns error:
assert!(i8::from_ascii_radix(b"1 ", 10).is_err());Source§
Source 🔬This is a nightly-only experimental API. (int_format_into #138215)
int_format_into #138215)Allows users to write an integer (in signed decimal format) into a variable buf of
type NumBuffer that is passed by the caller by mutable reference.
§Examples
#![feature(int_format_into)]
use core::fmt::NumBuffer;
let n = 0i8;
let mut buf = NumBuffer::new();
assert_eq!(n.format_into(&mut buf), "0");
let n1 = 32i8;
assert_eq!(n1.format_into(&mut buf), "32");
let n2 = i8 :: MAX;
assert_eq!(n2.format_into(&mut buf), i8 :: MAX.to_string());