2019-04-22 15:29:04 +01:00
|
|
|
// ignore-tidy-filelength
|
|
|
|
|
|
2014-11-10 16:00:13 +11:00
|
|
|
//! Numeric traits and functions for the built-in numeric types.
|
2014-04-30 22:14:22 -07:00
|
|
|
|
2015-01-23 21:48:20 -08:00
|
|
|
#![stable(feature = "rust1", since = "1.0.0")]
|
2014-04-30 22:14:22 -07:00
|
|
|
|
2019-04-15 11:23:21 +09:00
|
|
|
use crate::convert::{TryFrom, Infallible};
|
|
|
|
|
use crate::fmt;
|
|
|
|
|
use crate::intrinsics;
|
|
|
|
|
use crate::mem;
|
|
|
|
|
use crate::ops;
|
|
|
|
|
use crate::str::FromStr;
|
2014-04-30 22:14:22 -07:00
|
|
|
|
2018-02-16 10:39:24 +01:00
|
|
|
macro_rules! impl_nonzero_fmt {
|
2019-01-09 19:37:38 +01:00
|
|
|
( #[$stability: meta] ( $( $Trait: ident ),+ ) for $Ty: ident ) => {
|
2018-02-16 10:39:24 +01:00
|
|
|
$(
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability]
|
2018-02-16 10:39:24 +01:00
|
|
|
impl fmt::$Trait for $Ty {
|
|
|
|
|
#[inline]
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2018-02-16 10:39:24 +01:00
|
|
|
self.get().fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
)+
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-08-14 22:18:18 +02:00
|
|
|
macro_rules! doc_comment {
|
|
|
|
|
($x:expr, $($tt:tt)*) => {
|
|
|
|
|
#[doc = $x]
|
|
|
|
|
$($tt)*
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-16 10:39:24 +01:00
|
|
|
macro_rules! nonzero_integers {
|
2019-01-09 19:37:38 +01:00
|
|
|
( $( #[$stability: meta] $Ty: ident($Int: ty); )+ ) => {
|
2018-02-16 10:39:24 +01:00
|
|
|
$(
|
2018-08-14 22:18:18 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("An integer that is known not to equal zero.
|
|
|
|
|
|
|
|
|
|
This enables some memory layout optimization.
|
|
|
|
|
For example, `Option<", stringify!($Ty), ">` is the same size as `", stringify!($Int), "`:
|
|
|
|
|
|
|
|
|
|
```rust
|
|
|
|
|
use std::mem::size_of;
|
2019-01-09 19:37:38 +01:00
|
|
|
assert_eq!(size_of::<Option<core::num::", stringify!($Ty), ">>(), size_of::<", stringify!($Int),
|
2018-08-14 22:18:18 +02:00
|
|
|
">());
|
|
|
|
|
```"),
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability]
|
2018-08-14 22:18:18 +02:00
|
|
|
#[derive(Copy, Clone, Eq, PartialEq, Ord, PartialOrd, Hash)]
|
|
|
|
|
#[repr(transparent)]
|
2018-12-26 18:27:30 +01:00
|
|
|
#[rustc_layout_scalar_valid_range_start(1)]
|
2019-06-03 11:14:45 -06:00
|
|
|
#[cfg_attr(not(bootstrap), rustc_nonnull_optimization_guaranteed)]
|
2018-12-26 18:27:30 +01:00
|
|
|
pub struct $Ty($Int);
|
2018-08-14 22:18:18 +02:00
|
|
|
}
|
2018-02-16 10:39:24 +01:00
|
|
|
|
|
|
|
|
impl $Ty {
|
2019-02-09 22:16:58 +00:00
|
|
|
/// Creates a non-zero without checking the value.
|
2018-02-16 10:39:24 +01:00
|
|
|
///
|
|
|
|
|
/// # Safety
|
|
|
|
|
///
|
|
|
|
|
/// The value must not be zero.
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability]
|
2018-02-16 10:39:24 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub const unsafe fn new_unchecked(n: $Int) -> Self {
|
2018-12-26 18:27:30 +01:00
|
|
|
$Ty(n)
|
2018-02-16 10:39:24 +01:00
|
|
|
}
|
|
|
|
|
|
2019-02-09 22:16:58 +00:00
|
|
|
/// Creates a non-zero if the given value is not zero.
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability]
|
2018-02-16 10:39:24 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn new(n: $Int) -> Option<Self> {
|
|
|
|
|
if n != 0 {
|
2018-12-26 18:27:30 +01:00
|
|
|
Some(unsafe { $Ty(n) })
|
2018-02-16 10:39:24 +01:00
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Returns the value as a primitive type.
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability]
|
2018-02-16 10:39:24 +01:00
|
|
|
#[inline]
|
2018-12-28 16:58:55 +05:30
|
|
|
pub const fn get(self) -> $Int {
|
2018-12-26 18:27:30 +01:00
|
|
|
self.0
|
2018-02-16 10:39:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
2018-09-17 16:34:24 +08:00
|
|
|
#[stable(feature = "from_nonzero", since = "1.31.0")]
|
2018-09-15 09:34:36 +08:00
|
|
|
impl From<$Ty> for $Int {
|
|
|
|
|
fn from(nonzero: $Ty) -> Self {
|
2018-12-26 18:27:30 +01:00
|
|
|
nonzero.0
|
2018-09-15 09:34:36 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-16 10:39:24 +01:00
|
|
|
impl_nonzero_fmt! {
|
2019-01-09 19:37:38 +01:00
|
|
|
#[$stability] (Debug, Display, Binary, Octal, LowerHex, UpperHex) for $Ty
|
2018-02-16 10:39:24 +01:00
|
|
|
}
|
|
|
|
|
)+
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
nonzero_integers! {
|
2019-01-09 19:37:38 +01:00
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroU8(u8);
|
|
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroU16(u16);
|
|
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroU32(u32);
|
|
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroU64(u64);
|
|
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroU128(u128);
|
|
|
|
|
#[stable(feature = "nonzero", since = "1.28.0")] NonZeroUsize(usize);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroI8(i8);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroI16(i16);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroI32(i32);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroI64(i64);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroI128(i128);
|
|
|
|
|
#[stable(feature = "signed_nonzero", since = "1.34.0")] NonZeroIsize(isize);
|
2018-03-24 11:15:10 +01:00
|
|
|
}
|
|
|
|
|
|
2019-02-25 07:09:16 +01:00
|
|
|
macro_rules! from_str_radix_nzint_impl {
|
|
|
|
|
($($t:ty)*) => {$(
|
2019-02-27 18:37:35 +01:00
|
|
|
#[stable(feature = "nonzero_parse", since = "1.35.0")]
|
2019-02-25 07:09:16 +01:00
|
|
|
impl FromStr for $t {
|
2019-02-27 18:37:35 +01:00
|
|
|
type Err = ParseIntError;
|
2019-02-25 07:09:16 +01:00
|
|
|
fn from_str(src: &str) -> Result<Self, Self::Err> {
|
|
|
|
|
Self::new(from_str_radix(src, 10)?)
|
2019-02-27 18:37:35 +01:00
|
|
|
.ok_or(ParseIntError {
|
|
|
|
|
kind: IntErrorKind::Zero
|
2019-02-25 07:09:16 +01:00
|
|
|
})
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
)*}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
from_str_radix_nzint_impl! { NonZeroU8 NonZeroU16 NonZeroU32 NonZeroU64 NonZeroU128 NonZeroUsize
|
|
|
|
|
NonZeroI8 NonZeroI16 NonZeroI32 NonZeroI64 NonZeroI128 NonZeroIsize }
|
|
|
|
|
|
2015-03-19 23:42:18 -07:00
|
|
|
/// Provides intentionally-wrapped arithmetic on `T`.
|
|
|
|
|
///
|
|
|
|
|
/// Operations like `+` on `u32` values is intended to never overflow,
|
|
|
|
|
/// and in some debug configurations overflow is detected and results
|
|
|
|
|
/// in a panic. While most arithmetic falls into this category, some
|
|
|
|
|
/// code explicitly expects and relies upon modular arithmetic (e.g.,
|
|
|
|
|
/// hashing).
|
|
|
|
|
///
|
|
|
|
|
/// Wrapping arithmetic can be achieved either through methods like
|
|
|
|
|
/// `wrapping_add`, or through the `Wrapping<T>` type, which says that
|
|
|
|
|
/// all standard arithmetic operations on the underlying value are
|
|
|
|
|
/// intended to have wrapping semantics.
|
2016-05-05 08:23:24 +02:00
|
|
|
///
|
2018-09-08 11:35:02 -07:00
|
|
|
/// The underlying value can be retrieved through the `.0` index of the
|
|
|
|
|
/// `Wrapping` tuple.
|
|
|
|
|
///
|
2016-05-05 08:23:24 +02:00
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// use std::num::Wrapping;
|
|
|
|
|
///
|
|
|
|
|
/// let zero = Wrapping(0u32);
|
|
|
|
|
/// let one = Wrapping(1u32);
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(std::u32::MAX, (zero - one).0);
|
|
|
|
|
/// ```
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2016-04-16 09:51:21 +02:00
|
|
|
#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Default, Hash)]
|
2018-06-06 13:30:35 +02:00
|
|
|
#[repr(transparent)]
|
2016-10-12 23:57:46 +05:30
|
|
|
pub struct Wrapping<T>(#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
pub T);
|
2015-03-19 23:42:18 -07:00
|
|
|
|
2016-04-16 09:51:21 +02:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
impl<T: fmt::Debug> fmt::Debug for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-04-16 09:51:21 +02:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "wrapping_display", since = "1.10.0")]
|
|
|
|
|
impl<T: fmt::Display> fmt::Display for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-04-16 09:51:21 +02:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-06-09 23:03:14 +01:00
|
|
|
#[stable(feature = "wrapping_fmt", since = "1.11.0")]
|
|
|
|
|
impl<T: fmt::Binary> fmt::Binary for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-06-09 23:03:14 +01:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "wrapping_fmt", since = "1.11.0")]
|
|
|
|
|
impl<T: fmt::Octal> fmt::Octal for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-06-09 23:03:14 +01:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "wrapping_fmt", since = "1.11.0")]
|
|
|
|
|
impl<T: fmt::LowerHex> fmt::LowerHex for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-06-09 23:03:14 +01:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "wrapping_fmt", since = "1.11.0")]
|
|
|
|
|
impl<T: fmt::UpperHex> fmt::UpperHex for Wrapping<T> {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-06-09 23:03:14 +01:00
|
|
|
self.0.fmt(f)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2017-04-03 16:53:04 +02:00
|
|
|
// All these modules are technically private and only exposed for coretests:
|
2015-04-19 14:19:54 +09:00
|
|
|
pub mod flt2dec;
|
2015-07-26 17:50:29 +02:00
|
|
|
pub mod dec2flt;
|
2015-09-20 18:34:33 +02:00
|
|
|
pub mod bignum;
|
|
|
|
|
pub mod diy_float;
|
2015-04-19 14:19:54 +09:00
|
|
|
|
2018-03-26 16:46:04 -04:00
|
|
|
mod wrapping;
|
|
|
|
|
|
2019-04-15 00:00:50 +01:00
|
|
|
macro_rules! usize_isize_to_xe_bytes_doc {
|
|
|
|
|
() => {"
|
|
|
|
|
|
|
|
|
|
**Note**: This function returns an array of length 2, 4 or 8 bytes
|
|
|
|
|
depending on the target pointer size.
|
|
|
|
|
|
|
|
|
|
"}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
macro_rules! usize_isize_from_xe_bytes_doc {
|
|
|
|
|
() => {"
|
|
|
|
|
|
|
|
|
|
**Note**: This function takes an array of length 2, 4 or 8 bytes
|
|
|
|
|
depending on the target pointer size.
|
|
|
|
|
|
|
|
|
|
"}
|
|
|
|
|
}
|
|
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
// `Int` + `SignedInt` implemented for signed integers
|
|
|
|
|
macro_rules! int_impl {
|
2018-02-12 21:27:40 +01:00
|
|
|
($SelfT:ty, $ActualT:ident, $UnsignedT:ty, $BITS:expr, $Min:expr, $Max:expr, $Feature:expr,
|
2018-08-10 06:53:07 +02:00
|
|
|
$EndFeature:expr, $rot:expr, $rot_op:expr, $rot_result:expr, $swap_op:expr, $swapped:expr,
|
2019-04-15 00:00:50 +01:00
|
|
|
$reversed:expr, $le_bytes:expr, $be_bytes:expr,
|
|
|
|
|
$to_xe_bytes_doc:expr, $from_xe_bytes_doc:expr) => {
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the smallest value that can be represented by this integer type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::min_value(), ", stringify!($Min), ");",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-10-31 11:53:17 -07:00
|
|
|
#[rustc_promotable]
|
2018-02-11 22:08:32 +01:00
|
|
|
pub const fn min_value() -> Self {
|
|
|
|
|
!0 ^ ((!0 as $UnsignedT) >> 1) as Self
|
|
|
|
|
}
|
2015-04-01 11:34:27 -07:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the largest value that can be represented by this integer type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::max_value(), ", stringify!($Max), ");",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-10-31 11:53:17 -07:00
|
|
|
#[rustc_promotable]
|
2018-02-11 22:08:32 +01:00
|
|
|
pub const fn max_value() -> Self {
|
|
|
|
|
!Self::min_value()
|
|
|
|
|
}
|
2015-04-01 11:34:27 -07:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Converts a string slice in a given base to an integer.
|
|
|
|
|
|
|
|
|
|
The string is expected to be an optional `+` or `-` sign followed by digits.
|
|
|
|
|
Leading and trailing whitespace represent an error. Digits are a subset of these characters,
|
|
|
|
|
depending on `radix`:
|
|
|
|
|
|
|
|
|
|
* `0-9`
|
|
|
|
|
* `a-z`
|
2018-05-16 14:18:53 +08:00
|
|
|
* `A-Z`
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function panics if `radix` is not in the range from 2 to 36.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::from_str_radix(\"A\", 16), Ok(10));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
pub fn from_str_radix(src: &str, radix: u32) -> Result<Self, ParseIntError> {
|
|
|
|
|
from_str_radix(src, radix)
|
|
|
|
|
}
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of ones in the binary representation of `self`.
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0b100_0000", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(n.count_ones(), 1);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```
|
|
|
|
|
"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn count_ones(self) -> u32 { (self as $UnsignedT).count_ones() }
|
2014-11-09 17:15:45 +11:00
|
|
|
}
|
2014-11-15 22:03:34 -08:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of zeros in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::max_value().count_zeros(), 1);", $EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn count_zeros(self) -> u32 {
|
2018-02-11 22:08:32 +01:00
|
|
|
(!self).count_ones()
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2014-11-15 22:03:34 -08:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of leading zeros in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = -1", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(n.leading_zeros(), 0);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn leading_zeros(self) -> u32 {
|
2018-02-11 22:08:32 +01:00
|
|
|
(self as $UnsignedT).leading_zeros()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of trailing zeros in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = -4", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(n.trailing_zeros(), 2);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn trailing_zeros(self) -> u32 {
|
2018-02-11 22:08:32 +01:00
|
|
|
(self as $UnsignedT).trailing_zeros()
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-08 23:42:33 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts the bits to the left by a specified amount, `n`,
|
|
|
|
|
wrapping the truncated bits to the end of the resulting integer.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2019-02-26 16:10:28 +01:00
|
|
|
Please note this isn't the same operation as the `<<` shifting operator!
|
2018-08-08 23:42:33 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $rot_op, stringify!($SelfT), ";
|
|
|
|
|
let m = ", $rot_result, ";
|
|
|
|
|
|
|
|
|
|
assert_eq!(n.rotate_left(", $rot, "), m);
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-08-08 23:42:33 +02:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn rotate_left(self, n: u32) -> Self {
|
2018-08-08 23:42:33 +02:00
|
|
|
(self as $UnsignedT).rotate_left(n) as Self
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-08 23:42:33 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts the bits to the right by a specified amount, `n`,
|
|
|
|
|
wrapping the truncated bits to the beginning of the resulting
|
|
|
|
|
integer.
|
|
|
|
|
|
2019-02-26 16:10:28 +01:00
|
|
|
Please note this isn't the same operation as the `>>` shifting operator!
|
2018-08-08 23:42:33 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $rot_result, stringify!($SelfT), ";
|
|
|
|
|
let m = ", $rot_op, ";
|
|
|
|
|
|
|
|
|
|
assert_eq!(n.rotate_right(", $rot, "), m);
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-08-08 23:42:33 +02:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn rotate_right(self, n: u32) -> Self {
|
2018-08-08 23:42:33 +02:00
|
|
|
(self as $UnsignedT).rotate_right(n) as Self
|
|
|
|
|
}
|
|
|
|
|
}
|
2018-09-01 15:05:55 +02:00
|
|
|
|
2018-08-10 06:53:07 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Reverses the byte order of the integer.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $swap_op, stringify!($SelfT), ";
|
|
|
|
|
|
|
|
|
|
let m = n.swap_bytes();
|
|
|
|
|
|
|
|
|
|
assert_eq!(m, ", $swapped, ");
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn swap_bytes(self) -> Self {
|
|
|
|
|
(self as $UnsignedT).swap_bytes() as Self
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-10 06:53:07 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Reverses the bit pattern of the integer.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $swap_op, stringify!($SelfT), ";
|
|
|
|
|
let m = n.reverse_bits();
|
|
|
|
|
|
|
|
|
|
assert_eq!(m, ", $reversed, ");
|
|
|
|
|
```"),
|
2019-05-30 18:51:47 +00:00
|
|
|
#[stable(feature = "reverse_bits", since = "1.37.0")]
|
2018-08-10 06:53:07 +02:00
|
|
|
#[inline]
|
2019-05-24 22:26:34 +02:00
|
|
|
#[must_use]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn reverse_bits(self) -> Self {
|
2018-08-10 06:53:07 +02:00
|
|
|
(self as $UnsignedT).reverse_bits() as Self
|
|
|
|
|
}
|
2018-02-27 04:34:55 +00:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Converts an integer from big endian to the target's endianness.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
On big endian this is a no-op. On little endian the bytes are swapped.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
Basic usage:
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"big\") {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_be(n), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_be(n), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn from_be(x: Self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "big")]
|
|
|
|
|
{
|
|
|
|
|
x
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "big"))]
|
|
|
|
|
{
|
|
|
|
|
x.swap_bytes()
|
|
|
|
|
}
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"little\") {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_le(n), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_le(n), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn from_le(x: Self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "little")]
|
|
|
|
|
{
|
|
|
|
|
x
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "little"))]
|
|
|
|
|
{
|
|
|
|
|
x.swap_bytes()
|
|
|
|
|
}
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"big\") {
|
|
|
|
|
assert_eq!(n.to_be(), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(n.to_be(), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn to_be(self) -> Self { // or not to be?
|
|
|
|
|
#[cfg(target_endian = "big")]
|
|
|
|
|
{
|
|
|
|
|
self
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "big"))]
|
|
|
|
|
{
|
|
|
|
|
self.swap_bytes()
|
|
|
|
|
}
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"little\") {
|
|
|
|
|
assert_eq!(n.to_le(), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(n.to_le(), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn to_le(self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "little")]
|
|
|
|
|
{
|
|
|
|
|
self
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "little"))]
|
|
|
|
|
{
|
|
|
|
|
self.swap_bytes()
|
|
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer addition. Computes `self + rhs`, returning `None`
|
|
|
|
|
if overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((", stringify!($SelfT),
|
|
|
|
|
"::max_value() - 2).checked_add(1), Some(", stringify!($SelfT), "::max_value() - 1));
|
|
|
|
|
assert_eq!((", stringify!($SelfT), "::max_value() - 2).checked_add(3), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_add(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_add(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer subtraction. Computes `self - rhs`, returning `None` if
|
|
|
|
|
overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((", stringify!($SelfT),
|
|
|
|
|
"::min_value() + 2).checked_sub(1), Some(", stringify!($SelfT), "::min_value() + 1));
|
|
|
|
|
assert_eq!((", stringify!($SelfT), "::min_value() + 2).checked_sub(3), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_sub(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_sub(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer multiplication. Computes `self * rhs`, returning `None` if
|
|
|
|
|
overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT),
|
|
|
|
|
"::max_value().checked_mul(1), Some(", stringify!($SelfT), "::max_value()));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().checked_mul(2), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_mul(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_mul(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer division. Computes `self / rhs`, returning `None` if `rhs == 0`
|
|
|
|
|
or the division results in overflow.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((", stringify!($SelfT),
|
|
|
|
|
"::min_value() + 1).checked_div(-1), Some(", stringify!($Max), "));
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().checked_div(-1), None);
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!((1", stringify!($SelfT), ").checked_div(0), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_div(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
if rhs == 0 || (self == Self::min_value() && rhs == -1) {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
|
|
|
|
Some(unsafe { intrinsics::unchecked_div(self, rhs) })
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Checked Euclidean division. Computes `self.div_euclid(rhs)`,
|
2018-03-28 01:41:40 +02:00
|
|
|
returning `None` if `rhs == 0` or the division results in overflow.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
assert_eq!((", stringify!($SelfT),
|
2018-12-17 16:41:48 -08:00
|
|
|
"::min_value() + 1).checked_div_euclid(-1), Some(", stringify!($Max), "));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().checked_div_euclid(-1), None);
|
|
|
|
|
assert_eq!((1", stringify!($SelfT), ").checked_div_euclid(0), None);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn checked_div_euclid(self, rhs: Self) -> Option<Self> {
|
2018-03-26 20:15:19 +02:00
|
|
|
if rhs == 0 || (self == Self::min_value() && rhs == -1) {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
Some(self.div_euclid(rhs))
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer remainder. Computes `self % rhs`, returning `None` if
|
|
|
|
|
`rhs == 0` or the division results in overflow.
|
2015-12-18 10:24:06 -08:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem(2), Some(1));
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem(0), None);
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.checked_rem(-1), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_rem(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
if rhs == 0 || (self == Self::min_value() && rhs == -1) {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
|
|
|
|
Some(unsafe { intrinsics::unchecked_rem(self, rhs) })
|
|
|
|
|
}
|
2016-07-26 16:31:39 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Checked Euclidean remainder. Computes `self.rem_euclid(rhs)`, returning `None`
|
|
|
|
|
if `rhs == 0` or the division results in overflow.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
use std::", stringify!($SelfT), ";
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem_euclid(2), Some(1));
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem_euclid(0), None);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.checked_rem_euclid(-1), None);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn checked_rem_euclid(self, rhs: Self) -> Option<Self> {
|
2018-03-26 20:15:19 +02:00
|
|
|
if rhs == 0 || (self == Self::min_value() && rhs == -1) {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
Some(self.rem_euclid(rhs))
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked negation. Computes `-self`, returning `None` if `self == MIN`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_neg(), Some(-5));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.checked_neg(), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_neg(self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_neg();
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked shift left. Computes `self << rhs`, returning `None` if `rhs` is larger
|
|
|
|
|
than or equal to the number of bits in `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x1", stringify!($SelfT), ".checked_shl(4), Some(0x10));
|
|
|
|
|
assert_eq!(0x1", stringify!($SelfT), ".checked_shl(129), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_shl(self, rhs: u32) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_shl(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked shift right. Computes `self >> rhs`, returning `None` if `rhs` is
|
|
|
|
|
larger than or equal to the number of bits in `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x10", stringify!($SelfT), ".checked_shr(4), Some(0x1));
|
|
|
|
|
assert_eq!(0x10", stringify!($SelfT), ".checked_shr(128), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_shr(self, rhs: u32) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_shr(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked absolute value. Computes `self.abs()`, returning `None` if
|
|
|
|
|
`self == MIN`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!((-5", stringify!($SelfT), ").checked_abs(), Some(5));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.checked_abs(), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "no_panic_abs", since = "1.13.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_abs(self) -> Option<Self> {
|
|
|
|
|
if self.is_negative() {
|
|
|
|
|
self.checked_neg()
|
2015-12-18 10:24:06 -08:00
|
|
|
} else {
|
2018-02-11 22:08:32 +01:00
|
|
|
Some(self)
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked exponentiation. Computes `self.pow(exp)`, returning `None` if
|
|
|
|
|
overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(8", stringify!($SelfT), ".checked_pow(2), Some(64));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().checked_pow(2), None);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_pow(self, mut exp: u32) -> Option<Self> {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
acc = acc.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
base = base.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
acc = acc.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Some(acc)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer addition. Computes `self + rhs`, saturating at the numeric
|
|
|
|
|
bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
2019-02-05 15:36:31 -05:00
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".saturating_add(1), 101);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().saturating_add(100), ", stringify!($SelfT),
|
|
|
|
|
"::max_value());",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-02-07 13:12:17 -05:00
|
|
|
#[rustc_const_unstable(feature = "const_saturating_int_methods")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2019-02-05 15:36:31 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn saturating_add(self, rhs: Self) -> Self {
|
|
|
|
|
intrinsics::saturating_add(self, rhs)
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-06 16:15:17 -05:00
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer subtraction. Computes `self - rhs`, saturating at the
|
|
|
|
|
numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".saturating_sub(127), -27);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().saturating_sub(100), ", stringify!($SelfT),
|
|
|
|
|
"::min_value());",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-02-07 13:12:17 -05:00
|
|
|
#[rustc_const_unstable(feature = "const_saturating_int_methods")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2019-02-06 16:15:17 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn saturating_sub(self, rhs: Self) -> Self {
|
|
|
|
|
intrinsics::saturating_sub(self, rhs)
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-04-17 15:28:57 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer negation. Computes `-self`, returning `MAX` if `self == MIN`
|
|
|
|
|
instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "#![feature(saturating_neg)]
|
|
|
|
|
assert_eq!(100", stringify!($SelfT), ".saturating_neg(), -100);
|
|
|
|
|
assert_eq!((-100", stringify!($SelfT), ").saturating_neg(), 100);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().saturating_neg(), ", stringify!($SelfT),
|
|
|
|
|
"::max_value());
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().saturating_neg(), ", stringify!($SelfT),
|
|
|
|
|
"::min_value() + 1);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
|
|
|
|
|
#[unstable(feature = "saturating_neg", issue = "59983")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_neg(self) -> Self {
|
|
|
|
|
intrinsics::saturating_sub(0, self)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating absolute value. Computes `self.abs()`, returning `MAX` if `self ==
|
|
|
|
|
MIN` instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "#![feature(saturating_neg)]
|
|
|
|
|
assert_eq!(100", stringify!($SelfT), ".saturating_abs(), 100);
|
|
|
|
|
assert_eq!((-100", stringify!($SelfT), ").saturating_abs(), 100);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().saturating_abs(), ", stringify!($SelfT),
|
|
|
|
|
"::max_value());
|
|
|
|
|
assert_eq!((", stringify!($SelfT), "::min_value() + 1).saturating_abs(), ", stringify!($SelfT),
|
|
|
|
|
"::max_value());",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
|
|
|
|
|
#[unstable(feature = "saturating_neg", issue = "59983")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_abs(self) -> Self {
|
|
|
|
|
if self.is_negative() {
|
|
|
|
|
self.saturating_neg()
|
|
|
|
|
} else {
|
|
|
|
|
self
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer multiplication. Computes `self * rhs`, saturating at the
|
|
|
|
|
numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(10", stringify!($SelfT), ".saturating_mul(12), 120);
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MAX.saturating_mul(10), ", stringify!($SelfT), "::MAX);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.saturating_mul(10), ", stringify!($SelfT), "::MIN);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_mul(self, rhs: Self) -> Self {
|
|
|
|
|
self.checked_mul(rhs).unwrap_or_else(|| {
|
|
|
|
|
if (self < 0 && rhs < 0) || (self > 0 && rhs > 0) {
|
|
|
|
|
Self::max_value()
|
|
|
|
|
} else {
|
|
|
|
|
Self::min_value()
|
|
|
|
|
}
|
|
|
|
|
})
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer exponentiation. Computes `self.pow(exp)`,
|
|
|
|
|
saturating at the numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
|
|
|
|
|
|
|
|
|
assert_eq!((-4", stringify!($SelfT), ").saturating_pow(3), -64);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.saturating_pow(2), ", stringify!($SelfT), "::MAX);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.saturating_pow(3), ", stringify!($SelfT), "::MIN);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_pow(self, exp: u32) -> Self {
|
|
|
|
|
match self.checked_pow(exp) {
|
|
|
|
|
Some(x) => x,
|
|
|
|
|
None if self < 0 && exp % 2 == 1 => Self::min_value(),
|
|
|
|
|
None => Self::max_value(),
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) addition. Computes `self + rhs`, wrapping around at the
|
|
|
|
|
boundary of the type.
|
2015-04-13 21:55:15 +02:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_add(27), 127);
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().wrapping_add(2), ", stringify!($SelfT),
|
2018-02-12 21:27:40 +01:00
|
|
|
"::min_value() + 1);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_add(self, rhs: Self) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::overflowing_add(self, rhs)
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-04-13 21:55:15 +02:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) subtraction. Computes `self - rhs`, wrapping around at the
|
|
|
|
|
boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0", stringify!($SelfT), ".wrapping_sub(127), -127);
|
|
|
|
|
assert_eq!((-2", stringify!($SelfT), ").wrapping_sub(", stringify!($SelfT), "::max_value()), ",
|
|
|
|
|
stringify!($SelfT), "::max_value());",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_sub(self, rhs: Self) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::overflowing_sub(self, rhs)
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
2015-04-13 21:55:15 +02:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) multiplication. Computes `self * rhs`, wrapping around at
|
|
|
|
|
the boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(10", stringify!($SelfT), ".wrapping_mul(12), 120);
|
|
|
|
|
assert_eq!(11i8.wrapping_mul(12), -124);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_mul(self, rhs: Self) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::overflowing_mul(self, rhs)
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
2015-04-13 21:55:15 +02:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_div(10), 10);
|
|
|
|
|
assert_eq!((-128i8).wrapping_div(-1), -128);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_div(self, rhs: Self) -> Self {
|
|
|
|
|
self.overflowing_div(rhs).0
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Wrapping Euclidean division. Computes `self.div_euclid(rhs)`,
|
2018-03-28 01:41:40 +02:00
|
|
|
wrapping around at the boundary of the type.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-04-12 23:12:11 +02:00
|
|
|
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.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(100", stringify!($SelfT), ".wrapping_div_euclid(10), 10);
|
|
|
|
|
assert_eq!((-128i8).wrapping_div_euclid(-1), -128);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn wrapping_div_euclid(self, rhs: Self) -> Self {
|
|
|
|
|
self.overflowing_div_euclid(rhs).0
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_rem(10), 0);
|
|
|
|
|
assert_eq!((-128i8).wrapping_rem(-1), 0);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_rem(self, rhs: Self) -> Self {
|
|
|
|
|
self.overflowing_rem(rhs).0
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Wrapping Euclidean remainder. Computes `self.rem_euclid(rhs)`, wrapping around
|
|
|
|
|
at the boundary of the type.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-04-12 23:12:11 +02:00
|
|
|
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.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(100", stringify!($SelfT), ".wrapping_rem_euclid(10), 0);
|
|
|
|
|
assert_eq!((-128i8).wrapping_rem_euclid(-1), 0);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn wrapping_rem_euclid(self, rhs: Self) -> Self {
|
|
|
|
|
self.overflowing_rem_euclid(rhs).0
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_neg(), -100);
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().wrapping_neg(), ", stringify!($SelfT),
|
2018-02-12 21:27:40 +01:00
|
|
|
"::min_value());",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
|
|
|
|
#[inline]
|
2019-02-01 01:31:52 -07:00
|
|
|
pub const fn wrapping_neg(self) -> Self {
|
2018-02-11 22:08:32 +01:00
|
|
|
self.overflowing_neg().0
|
2016-07-26 16:31:39 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Panic-free bitwise shift-left; yields `self << mask(rhs)`, where `mask` removes
|
|
|
|
|
any high-order bits of `rhs` that would cause the shift to exceed the bitwidth of the type.
|
|
|
|
|
|
|
|
|
|
Note that this is *not* the same as a rotate-left; the RHS of a wrapping shift-left is restricted to
|
|
|
|
|
the range of the type, rather than the bits shifted out of the LHS being returned to the other end.
|
|
|
|
|
The primitive integer types all implement a `rotate_left` function, which may be what you want
|
|
|
|
|
instead.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((-1", stringify!($SelfT), ").wrapping_shl(7), -128);
|
|
|
|
|
assert_eq!((-1", stringify!($SelfT), ").wrapping_shl(128), -1);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_shl(self, rhs: u32) -> Self {
|
2018-02-11 22:08:32 +01:00
|
|
|
unsafe {
|
|
|
|
|
intrinsics::unchecked_shl(self, (rhs & ($BITS - 1)) as $SelfT)
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Panic-free bitwise shift-right; yields `self >> mask(rhs)`, where `mask`
|
|
|
|
|
removes any high-order bits of `rhs` that would cause the shift to exceed the bitwidth of the type.
|
|
|
|
|
|
|
|
|
|
Note that this is *not* the same as a rotate-right; the RHS of a wrapping shift-right is restricted
|
|
|
|
|
to the range of the type, rather than the bits shifted out of the LHS being returned to the other
|
|
|
|
|
end. The primitive integer types all implement a `rotate_right` function, which may be what you want
|
|
|
|
|
instead.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((-128", stringify!($SelfT), ").wrapping_shr(7), -1);
|
|
|
|
|
assert_eq!((-128i16).wrapping_shr(64), -128);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_shr(self, rhs: u32) -> Self {
|
2018-02-11 22:08:32 +01:00
|
|
|
unsafe {
|
|
|
|
|
intrinsics::unchecked_shr(self, (rhs & ($BITS - 1)) as $SelfT)
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_abs(), 100);
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!((-100", stringify!($SelfT), ").wrapping_abs(), 100);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::min_value().wrapping_abs(), ", stringify!($SelfT),
|
|
|
|
|
"::min_value());
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!((-128i8).wrapping_abs() as u8, 128);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "no_panic_abs", since = "1.13.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_abs(self) -> Self {
|
|
|
|
|
if self.is_negative() {
|
|
|
|
|
self.wrapping_neg()
|
|
|
|
|
} else {
|
|
|
|
|
self
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) exponentiation. Computes `self.pow(exp)`,
|
|
|
|
|
wrapping around at the boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(3", stringify!($SelfT), ".wrapping_pow(4), 81);
|
|
|
|
|
assert_eq!(3i8.wrapping_pow(5), -13);
|
|
|
|
|
assert_eq!(3i8.wrapping_pow(6), -39);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_pow(self, mut exp: u32) -> Self {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
acc = acc.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
base = base.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
acc = acc.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
acc
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates `self` + `rhs`
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the addition along with a boolean indicating whether an arithmetic overflow would
|
|
|
|
|
occur. If an overflow would have occurred then the wrapped value is returned.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_add(2), (7, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MAX.overflowing_add(1), (", stringify!($SelfT),
|
|
|
|
|
"::MIN, true));", $EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_add(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::add_with_overflow(self as $ActualT, rhs as $ActualT);
|
2018-02-11 22:08:32 +01:00
|
|
|
(a as Self, b)
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates `self` - `rhs`
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the subtraction along with a boolean indicating whether an arithmetic overflow
|
|
|
|
|
would occur. If an overflow would have occurred then the wrapped value is returned.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_sub(2), (3, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_sub(1), (", stringify!($SelfT),
|
|
|
|
|
"::MAX, true));", $EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT);
|
2018-02-11 22:08:32 +01:00
|
|
|
(a as Self, b)
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates the multiplication of `self` and `rhs`.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the multiplication along with a boolean indicating whether an arithmetic overflow
|
|
|
|
|
would occur. If an overflow would have occurred then the wrapped value is returned.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(5", stringify!($SelfT), ".overflowing_mul(2), (10, false));
|
|
|
|
|
assert_eq!(1_000_000_000i32.overflowing_mul(10), (1410065408, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::mul_with_overflow(self as $ActualT, rhs as $ActualT);
|
2018-02-11 22:08:32 +01:00
|
|
|
(a as Self, b)
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_div(2), (2, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_div(-1), (", stringify!($SelfT),
|
|
|
|
|
"::MIN, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
pub fn overflowing_div(self, rhs: Self) -> (Self, bool) {
|
|
|
|
|
if self == Self::min_value() && rhs == -1 {
|
|
|
|
|
(self, true)
|
|
|
|
|
} else {
|
|
|
|
|
(self / rhs, false)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Calculates the quotient of Euclidean division `self.div_euclid(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
Returns a tuple of the divisor along with a boolean indicating whether an arithmetic overflow would
|
2018-04-12 23:12:11 +02:00
|
|
|
occur. If an overflow would occur then `self` is returned.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
use std::", stringify!($SelfT), ";
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_div_euclid(2), (2, false));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_div_euclid(-1), (", stringify!($SelfT),
|
2018-03-28 16:22:37 +02:00
|
|
|
"::MIN, true));
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn overflowing_div_euclid(self, rhs: Self) -> (Self, bool) {
|
2018-03-26 20:15:19 +02:00
|
|
|
if self == Self::min_value() && rhs == -1 {
|
|
|
|
|
(self, true)
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
(self.div_euclid(rhs), false)
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_rem(2), (1, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_rem(-1), (0, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
pub fn overflowing_rem(self, rhs: Self) -> (Self, bool) {
|
|
|
|
|
if self == Self::min_value() && rhs == -1 {
|
|
|
|
|
(0, true)
|
|
|
|
|
} else {
|
|
|
|
|
(self % rhs, false)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Overflowing Euclidean remainder. Calculates `self.rem_euclid(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
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 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
use std::", stringify!($SelfT), ";
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_rem_euclid(2), (1, false));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_rem_euclid(-1), (0, true));
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn overflowing_rem_euclid(self, rhs: Self) -> (Self, bool) {
|
2018-03-26 20:15:19 +02:00
|
|
|
if self == Self::min_value() && rhs == -1 {
|
|
|
|
|
(0, true)
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
(self.rem_euclid(rhs), false)
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Negates self, overflowing if this is equal to the minimum value.
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
Returns a tuple of the negated version of self along with a boolean indicating whether an overflow
|
2018-11-27 02:59:49 +00:00
|
|
|
happened. If `self` is the minimum value (e.g., `i32::MIN` for values of type `i32`), then the
|
2018-02-11 22:08:32 +01:00
|
|
|
minimum value will be returned again and `true` will be returned for an overflow happening.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 22:08:32 +01:00
|
|
|
|
|
|
|
|
assert_eq!(2", stringify!($SelfT), ".overflowing_neg(), (-2, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MIN.overflowing_neg(), (", stringify!($SelfT),
|
|
|
|
|
"::MIN, true));", $EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-02-01 01:31:52 -07:00
|
|
|
pub const fn overflowing_neg(self) -> (Self, bool) {
|
2019-02-01 18:43:32 -07:00
|
|
|
((!self).wrapping_add(1), self == Self::min_value())
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts self left by `rhs` bits.
|
2015-09-04 22:10:39 -04:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
Returns a tuple of the shifted version of self along with a boolean indicating whether the shift
|
|
|
|
|
value was larger than or equal to the number of bits. If the shift value is too large, then value is
|
|
|
|
|
masked (N-1) where N is the number of bits, and this value is then used to perform the shift.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x1", stringify!($SelfT),".overflowing_shl(4), (0x10, false));
|
|
|
|
|
assert_eq!(0x1i32.overflowing_shl(36), (0x10, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_shl(self, rhs: u32) -> (Self, bool) {
|
2018-02-11 22:08:32 +01:00
|
|
|
(self.wrapping_shl(rhs), (rhs > ($BITS - 1)))
|
2015-09-04 22:10:39 -04:00
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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
|
2015-09-04 22:10:39 -04:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x10", stringify!($SelfT), ".overflowing_shr(4), (0x1, false));
|
|
|
|
|
assert_eq!(0x10i32.overflowing_shr(36), (0x1, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_shr(self, rhs: u32) -> (Self, bool) {
|
2018-02-11 22:08:32 +01:00
|
|
|
(self.wrapping_shr(rhs), (rhs > ($BITS - 1)))
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Computes the absolute value of `self`.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the absolute version of self along with a boolean indicating whether an overflow
|
2018-11-27 02:59:49 +00:00
|
|
|
happened. If self is the minimum value (e.g., ", stringify!($SelfT), "::MIN for values of type
|
2018-02-12 08:07:10 -05:00
|
|
|
", stringify!($SelfT), "), then the minimum value will be returned again and true will be returned
|
2018-02-11 22:08:32 +01:00
|
|
|
for an overflow happening.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(10", stringify!($SelfT), ".overflowing_abs(), (10, false));
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!((-10", stringify!($SelfT), ").overflowing_abs(), (10, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!((", stringify!($SelfT), "::min_value()).overflowing_abs(), (", stringify!($SelfT),
|
|
|
|
|
"::min_value(), true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "no_panic_abs", since = "1.13.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn overflowing_abs(self) -> (Self, bool) {
|
|
|
|
|
if self.is_negative() {
|
|
|
|
|
self.overflowing_neg()
|
|
|
|
|
} else {
|
|
|
|
|
(self, false)
|
|
|
|
|
}
|
2016-07-26 16:31:39 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Raises self to the power of `exp`, using exponentiation by squaring.
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
Returns a tuple of the exponentiation along with a bool indicating
|
|
|
|
|
whether an overflow happened.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(3", stringify!($SelfT), ".overflowing_pow(4), (81, false));
|
|
|
|
|
assert_eq!(3i8.overflowing_pow(5), (-13, true));",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn overflowing_pow(self, mut exp: u32) -> (Self, bool) {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
let mut overflown = false;
|
|
|
|
|
// Scratch space for storing results of overflowing_mul.
|
|
|
|
|
let mut r;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
r = acc.overflowing_mul(base);
|
|
|
|
|
acc = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
r = base.overflowing_mul(base);
|
|
|
|
|
base = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
r = acc.overflowing_mul(base);
|
|
|
|
|
acc = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
(acc, overflown)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Raises self to the power of `exp`, using exponentiation by squaring.
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let x: ", stringify!($SelfT), " = 2; // or any other integer type
|
2018-02-11 22:08:32 +01:00
|
|
|
|
2018-02-21 22:30:40 +09:00
|
|
|
assert_eq!(x.pow(5), 32);",
|
2018-02-12 21:27:40 +01:00
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
|
|
|
|
pub fn pow(self, mut exp: u32) -> Self {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc = 1;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
acc = acc * base;
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
base = base * base;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
2015-09-04 22:10:39 -04:00
|
|
|
acc = acc * base;
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-09-04 22:10:39 -04:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
acc
|
2015-09-04 22:10:39 -04:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates the quotient of Euclidean division of `self` by `rhs`.
|
|
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
This computes the integer `n` such that `self = n * rhs + self.rem_euclid(rhs)`,
|
2018-12-20 01:37:20 -08:00
|
|
|
with `0 <= self.rem_euclid(rhs) < rhs`.
|
2018-12-17 16:41:48 -08:00
|
|
|
|
2018-03-28 01:41:40 +02:00
|
|
|
In other words, the result is `self / rhs` rounded to the integer `n`
|
2018-03-26 20:15:19 +02:00
|
|
|
such that `self >= n * rhs`.
|
2018-12-17 16:41:48 -08:00
|
|
|
If `self > 0`, this is equal to round towards zero (the default in Rust);
|
|
|
|
|
if `self < 0`, this is equal to round towards +/- infinity.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
let a: ", stringify!($SelfT), " = 7; // or any other integer type
|
2018-03-26 20:15:19 +02:00
|
|
|
let b = 4;
|
|
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
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 * 2
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn div_euclid(self, rhs: Self) -> Self {
|
2018-03-26 20:15:19 +02:00
|
|
|
let q = self / rhs;
|
|
|
|
|
if self % rhs < 0 {
|
|
|
|
|
return if rhs > 0 { q - 1 } else { q + 1 }
|
|
|
|
|
}
|
|
|
|
|
q
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Calculates the least nonnegative remainder of `self (mod rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-12-20 01:37:20 -08:00
|
|
|
This is done as if by the Euclidean division algorithm -- given
|
|
|
|
|
`r = self.rem_euclid(rhs)`, `self = rhs * self.div_euclid(rhs) + r`, and
|
|
|
|
|
`0 <= r < abs(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
|
|
|
|
let a: ", stringify!($SelfT), " = 7; // or any other integer type
|
2018-03-26 20:15:19 +02:00
|
|
|
let b = 4;
|
|
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
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);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn rem_euclid(self, rhs: Self) -> Self {
|
2018-03-26 20:15:19 +02:00
|
|
|
let r = self % rhs;
|
|
|
|
|
if r < 0 {
|
2018-04-24 03:32:40 +09:00
|
|
|
if rhs < 0 {
|
2018-04-24 01:45:44 +09:00
|
|
|
r - rhs
|
|
|
|
|
} else {
|
|
|
|
|
r + rhs
|
|
|
|
|
}
|
2018-03-26 20:15:19 +02:00
|
|
|
} else {
|
|
|
|
|
r
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Computes the absolute value of `self`.
|
|
|
|
|
|
|
|
|
|
# Overflow behavior
|
|
|
|
|
|
|
|
|
|
The absolute value of `", stringify!($SelfT), "::min_value()` cannot be represented as an
|
|
|
|
|
`", stringify!($SelfT), "`, 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 `",
|
|
|
|
|
stringify!($SelfT), "::min_value()` without a panic.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(10", stringify!($SelfT), ".abs(), 10);
|
|
|
|
|
assert_eq!((-10", stringify!($SelfT), ").abs(), 10);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
|
|
|
|
pub fn abs(self) -> Self {
|
|
|
|
|
if self.is_negative() {
|
|
|
|
|
// Note that the #[inline] above means that the overflow
|
|
|
|
|
// semantics of this negation depend on the crate we're being
|
|
|
|
|
// inlined into.
|
|
|
|
|
-self
|
|
|
|
|
} else {
|
|
|
|
|
self
|
|
|
|
|
}
|
2015-04-15 12:27:23 +02:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns a number representing sign of `self`.
|
|
|
|
|
|
|
|
|
|
- `0` if the number is zero
|
|
|
|
|
- `1` if the number is positive
|
|
|
|
|
- `-1` if the number is negative
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(10", stringify!($SelfT), ".signum(), 1);
|
2018-02-11 22:08:32 +01:00
|
|
|
assert_eq!(0", stringify!($SelfT), ".signum(), 0);
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!((-10", stringify!($SelfT), ").signum(), -1);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-06-07 14:12:54 -07:00
|
|
|
#[rustc_const_unstable(feature = "const_int_sign")]
|
2018-02-11 22:08:32 +01:00
|
|
|
#[inline]
|
2019-06-07 14:12:54 -07:00
|
|
|
pub const fn signum(self) -> Self {
|
|
|
|
|
(self > 0) as Self - (self < 0) as Self
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns `true` if `self` is positive and `false` if the number is zero or
|
|
|
|
|
negative.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 22:08:32 +01:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert!(10", stringify!($SelfT), ".is_positive());
|
|
|
|
|
assert!(!(-10", stringify!($SelfT), ").is_positive());",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn is_positive(self) -> bool { self > 0 }
|
2018-02-11 22:08:32 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns `true` if `self` is negative and `false` if the number is zero or
|
|
|
|
|
positive.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert!((-10", stringify!($SelfT), ").is_negative());
|
|
|
|
|
assert!(!10", stringify!($SelfT), ".is_negative());",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 22:08:32 +01:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn is_negative(self) -> bool { self < 0 }
|
|
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Return the memory representation of this integer as a byte array in
|
|
|
|
|
big-endian (network) byte order.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_be_bytes();
|
|
|
|
|
assert_eq!(bytes, ", $be_bytes, ");
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_be_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
self.to_be().to_ne_bytes()
|
|
|
|
|
}
|
2018-06-29 22:46:20 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Return the memory representation of this integer as a byte array in
|
|
|
|
|
little-endian byte order.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_le_bytes();
|
|
|
|
|
assert_eq!(bytes, ", $le_bytes, ");
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_le_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
self.to_le().to_ne_bytes()
|
|
|
|
|
}
|
2018-06-29 22:46:20 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("
|
|
|
|
|
Return the memory representation of this integer as a byte array in
|
|
|
|
|
native byte order.
|
|
|
|
|
|
|
|
|
|
As the target platform's native endianness is used, portable code
|
|
|
|
|
should use [`to_be_bytes`] or [`to_le_bytes`], as appropriate,
|
|
|
|
|
instead.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
[`to_be_bytes`]: #method.to_be_bytes
|
|
|
|
|
[`to_le_bytes`]: #method.to_le_bytes
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_ne_bytes();
|
|
|
|
|
assert_eq!(bytes, if cfg!(target_endian = \"big\") {
|
|
|
|
|
", $be_bytes, "
|
|
|
|
|
} else {
|
|
|
|
|
", $le_bytes, "
|
|
|
|
|
});
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_ne_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
unsafe { mem::transmute(self) }
|
|
|
|
|
}
|
2018-04-11 00:04:32 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Create an integer value from its representation as a byte array in
|
|
|
|
|
big endian.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_be_bytes(", $be_bytes, ");
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
|
|
|
|
fn read_be_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
|
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
|
|
|
|
", stringify!($SelfT), "::from_be_bytes(int_bytes.try_into().unwrap())
|
|
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_be_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
Self::from_be(Self::from_ne_bytes(bytes))
|
|
|
|
|
}
|
2018-06-29 22:46:20 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("
|
|
|
|
|
Create an integer value from its representation as a byte array in
|
|
|
|
|
little endian.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_le_bytes(", $le_bytes, ");
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
2019-03-07 21:24:46 +01:00
|
|
|
fn read_le_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
2018-11-25 17:33:16 +01:00
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
2019-03-07 21:24:46 +01:00
|
|
|
", stringify!($SelfT), "::from_le_bytes(int_bytes.try_into().unwrap())
|
2018-11-25 17:33:16 +01:00
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_le_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
Self::from_le(Self::from_ne_bytes(bytes))
|
|
|
|
|
}
|
2018-06-29 22:46:20 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Create 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.
|
|
|
|
|
|
|
|
|
|
[`from_be_bytes`]: #method.from_be_bytes
|
|
|
|
|
[`from_le_bytes`]: #method.from_le_bytes
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_ne_bytes(if cfg!(target_endian = \"big\") {
|
|
|
|
|
", $be_bytes, "
|
|
|
|
|
} else {
|
|
|
|
|
", $le_bytes, "
|
|
|
|
|
});
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
2019-03-07 21:24:46 +01:00
|
|
|
fn read_ne_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
2018-11-25 17:33:16 +01:00
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
2019-03-07 21:24:46 +01:00
|
|
|
", stringify!($SelfT), "::from_ne_bytes(int_bytes.try_into().unwrap())
|
2018-11-25 17:33:16 +01:00
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_ne_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
unsafe { mem::transmute(bytes) }
|
|
|
|
|
}
|
2018-04-11 00:04:32 +02:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "i8"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl i8 {
|
2018-08-17 22:20:09 +02:00
|
|
|
int_impl! { i8, i8, u8, 8, -128, 127, "", "", 2, "-0x7e", "0xa", "0x12", "0x12", "0x48",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12]", "[0x12]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "i16"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl i16 {
|
2018-08-10 06:53:07 +02:00
|
|
|
int_impl! { i16, i16, u16, 16, -32768, 32767, "", "", 4, "-0x5ffd", "0x3a", "0x1234", "0x3412",
|
2019-04-15 00:00:50 +01:00
|
|
|
"0x2c48", "[0x34, 0x12]", "[0x12, 0x34]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "i32"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl i32 {
|
2018-08-10 06:53:07 +02:00
|
|
|
int_impl! { i32, i32, u32, 32, -2147483648, 2147483647, "", "", 8, "0x10000b3", "0xb301",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x12345678", "0x78563412", "0x1e6a2c48", "[0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "i64"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl i64 {
|
2018-08-08 23:42:33 +02:00
|
|
|
int_impl! { i64, i64, u64, 64, -9223372036854775808, 9223372036854775807, "", "", 12,
|
2018-08-10 06:53:07 +02:00
|
|
|
"0xaa00000000006e1", "0x6e10aa", "0x1234567890123456", "0x5634129078563412",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x6a2c48091e6a2c48", "[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2016-08-23 03:56:52 +03:00
|
|
|
#[lang = "i128"]
|
|
|
|
|
impl i128 {
|
2018-02-12 08:07:10 -05:00
|
|
|
int_impl! { i128, i128, u128, 128, -170141183460469231731687303715884105728,
|
2018-08-08 23:42:33 +02:00
|
|
|
170141183460469231731687303715884105727, "", "", 16,
|
2018-08-10 06:53:07 +02:00
|
|
|
"0x13f40000000000000000000000004f76", "0x4f7613f4", "0x12345678901234567890123456789012",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x12907856341290785634129078563412", "0x48091e6a2c48091e6a2c48091e6a2c48",
|
|
|
|
|
"[0x12, 0x90, 0x78, 0x56, 0x34, 0x12, 0x90, 0x78, \
|
|
|
|
|
0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
|
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56, \
|
2019-04-15 00:00:50 +01:00
|
|
|
0x78, 0x90, 0x12, 0x34, 0x56, 0x78, 0x90, 0x12]", "", "" }
|
2016-08-23 03:56:52 +03:00
|
|
|
}
|
|
|
|
|
|
2016-05-06 09:31:11 -04:00
|
|
|
#[cfg(target_pointer_width = "16")]
|
|
|
|
|
#[lang = "isize"]
|
|
|
|
|
impl isize {
|
2018-08-10 06:53:07 +02:00
|
|
|
int_impl! { isize, i16, u16, 16, -32768, 32767, "", "", 4, "-0x5ffd", "0x3a", "0x1234",
|
2019-04-15 00:00:50 +01:00
|
|
|
"0x3412", "0x2c48", "[0x34, 0x12]", "[0x12, 0x34]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2016-05-06 09:31:11 -04:00
|
|
|
}
|
|
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[cfg(target_pointer_width = "32")]
|
|
|
|
|
#[lang = "isize"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl isize {
|
2018-08-10 06:53:07 +02:00
|
|
|
int_impl! { isize, i32, u32, 32, -2147483648, 2147483647, "", "", 8, "0x10000b3", "0xb301",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x12345678", "0x78563412", "0x1e6a2c48", "[0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[cfg(target_pointer_width = "64")]
|
|
|
|
|
#[lang = "isize"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl isize {
|
2018-08-08 23:42:33 +02:00
|
|
|
int_impl! { isize, i64, u64, 64, -9223372036854775808, 9223372036854775807, "", "",
|
2018-08-10 06:53:07 +02:00
|
|
|
12, "0xaa00000000006e1", "0x6e10aa", "0x1234567890123456", "0x5634129078563412",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x6a2c48091e6a2c48", "[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2016-01-19 10:47:27 +01:00
|
|
|
// `Int` + `UnsignedInt` implemented for unsigned integers
|
2015-03-18 09:36:18 -07:00
|
|
|
macro_rules! uint_impl {
|
2018-08-08 23:42:33 +02:00
|
|
|
($SelfT:ty, $ActualT:ty, $BITS:expr, $MaxV:expr, $Feature:expr, $EndFeature:expr,
|
2018-08-10 06:53:07 +02:00
|
|
|
$rot:expr, $rot_op:expr, $rot_result:expr, $swap_op:expr, $swapped:expr,
|
2019-04-15 00:00:50 +01:00
|
|
|
$reversed:expr, $le_bytes:expr, $be_bytes:expr,
|
|
|
|
|
$to_xe_bytes_doc:expr, $from_xe_bytes_doc:expr) => {
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the smallest value that can be represented by this integer type.
|
2015-04-01 11:34:27 -07:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
# Examples
|
2015-04-01 11:34:27 -07:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::min_value(), 0);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2018-11-09 17:55:24 +01:00
|
|
|
#[rustc_promotable]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn min_value() -> Self { 0 }
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the largest value that can be represented by this integer type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::max_value(), ",
|
|
|
|
|
stringify!($MaxV), ");", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2018-11-09 17:55:24 +01:00
|
|
|
#[rustc_promotable]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn max_value() -> Self { !0 }
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Converts a string slice in a given base to an integer.
|
|
|
|
|
|
|
|
|
|
The string is expected to be an optional `+` sign
|
|
|
|
|
followed by digits.
|
|
|
|
|
Leading and trailing whitespace represent an error.
|
|
|
|
|
Digits are a subset of these characters, depending on `radix`:
|
|
|
|
|
|
|
|
|
|
* `0-9`
|
|
|
|
|
* `a-z`
|
|
|
|
|
* `A-Z`
|
|
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function panics if `radix` is not in the range from 2 to 36.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::from_str_radix(\"A\", 16), Ok(10));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
pub fn from_str_radix(src: &str, radix: u32) -> Result<Self, ParseIntError> {
|
|
|
|
|
from_str_radix(src, radix)
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of ones in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0b01001100", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(n.count_ones(), 3);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn count_ones(self) -> u32 {
|
2019-01-19 16:25:06 -07:00
|
|
|
intrinsics::ctpop(self as $ActualT) as u32
|
2018-02-11 18:13:12 -05:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of zeros in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(", stringify!($SelfT), "::max_value().count_zeros(), 0);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn count_zeros(self) -> u32 {
|
2018-02-11 18:13:12 -05:00
|
|
|
(!self).count_ones()
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-14 19:44:07 +01:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of leading zeros in the binary representation of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "let n = ", stringify!($SelfT), "::max_value() >> 2;
|
|
|
|
|
|
|
|
|
|
assert_eq!(n.leading_zeros(), 2);", $EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn leading_zeros(self) -> u32 {
|
2019-01-19 16:25:06 -07:00
|
|
|
intrinsics::ctlz(self as $ActualT) as u32
|
2018-02-14 19:44:07 +01:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the number of trailing zeros in the binary representation
|
|
|
|
|
of `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0b0101000", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(n.trailing_zeros(), 3);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn trailing_zeros(self) -> u32 {
|
2019-01-19 16:25:06 -07:00
|
|
|
intrinsics::cttz(self) as u32
|
Currently, LLVM lowers a cttz8 on x86_64 to these instructions:
```asm
movzbl %dil, %eax
bsfl %eax, %eax
movl $32, %ecx
cmovnel %eax, %ecx
cmpl $32, %ecx
movl $8, %eax
cmovnel %ecx, %eax
```
which has some unnecessary overhead, having two conditional moves.
To improve the codegen, we can zero extend the 8 bit integer, then set
bit 8 and perform a cttz operation on the extended value. That way
there's no conditional operation involved at all.
2015-04-27 00:18:02 +02:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-08 23:42:33 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts the bits to the left by a specified amount, `n`,
|
|
|
|
|
wrapping the truncated bits to the end of the resulting integer.
|
|
|
|
|
|
2019-02-26 16:10:28 +01:00
|
|
|
Please note this isn't the same operation as the `<<` shifting operator!
|
2018-08-08 23:42:33 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $rot_op, stringify!($SelfT), ";
|
|
|
|
|
let m = ", $rot_result, ";
|
|
|
|
|
|
|
|
|
|
assert_eq!(n.rotate_left(", $rot, "), m);
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-08-08 23:42:33 +02:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn rotate_left(self, n: u32) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::rotate_left(self, n as $SelfT)
|
2018-08-08 23:42:33 +02:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-08 23:42:33 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts the bits to the right by a specified amount, `n`,
|
|
|
|
|
wrapping the truncated bits to the beginning of the resulting
|
|
|
|
|
integer.
|
|
|
|
|
|
2019-02-26 16:10:28 +01:00
|
|
|
Please note this isn't the same operation as the `>>` shifting operator!
|
2018-08-08 23:42:33 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $rot_result, stringify!($SelfT), ";
|
|
|
|
|
let m = ", $rot_op, ";
|
|
|
|
|
|
|
|
|
|
assert_eq!(n.rotate_right(", $rot, "), m);
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-08-08 23:42:33 +02:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn rotate_right(self, n: u32) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::rotate_right(self, n as $SelfT)
|
2018-08-08 23:42:33 +02:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-10 06:53:07 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("
|
|
|
|
|
Reverses the byte order of the integer.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $swap_op, stringify!($SelfT), ";
|
|
|
|
|
let m = n.swap_bytes();
|
|
|
|
|
|
|
|
|
|
assert_eq!(m, ", $swapped, ");
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn swap_bytes(self) -> Self {
|
2019-01-19 16:25:06 -07:00
|
|
|
intrinsics::bswap(self as $ActualT) as Self
|
2018-08-10 06:53:07 +02:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-08-10 06:53:07 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Reverses the bit pattern of the integer.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let n = ", $swap_op, stringify!($SelfT), ";
|
|
|
|
|
let m = n.reverse_bits();
|
|
|
|
|
|
|
|
|
|
assert_eq!(m, ", $reversed, ");
|
|
|
|
|
```"),
|
2019-05-30 18:51:47 +00:00
|
|
|
#[stable(feature = "reverse_bits", since = "1.37.0")]
|
2018-08-10 06:53:07 +02:00
|
|
|
#[inline]
|
2019-05-24 22:26:34 +02:00
|
|
|
#[must_use]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn reverse_bits(self) -> Self {
|
2019-01-19 16:25:06 -07:00
|
|
|
intrinsics::bitreverse(self as $ActualT) as Self
|
2018-08-10 06:53:07 +02:00
|
|
|
}
|
2018-02-27 04:34:55 +00:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Converts an integer from big endian to the target's endianness.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
On big endian this is a no-op. On little endian the bytes are
|
|
|
|
|
swapped.
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
# Examples
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
Basic usage:
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
if cfg!(target_endian = \"big\") {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_be(n), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::from_be(n), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn from_be(x: Self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "big")]
|
|
|
|
|
{
|
|
|
|
|
x
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "big"))]
|
|
|
|
|
{
|
|
|
|
|
x.swap_bytes()
|
|
|
|
|
}
|
2018-02-11 18:13:12 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Converts an integer from little endian to the target's endianness.
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
On little endian this is a no-op. On big endian the bytes are
|
|
|
|
|
swapped.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"little\") {
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::from_le(n), n)
|
2018-02-11 18:13:12 -05:00
|
|
|
} else {
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::from_le(n), n.swap_bytes())
|
|
|
|
|
}", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn from_le(x: Self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "little")]
|
|
|
|
|
{
|
|
|
|
|
x
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "little"))]
|
|
|
|
|
{
|
|
|
|
|
x.swap_bytes()
|
|
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"big\") {
|
|
|
|
|
assert_eq!(n.to_be(), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(n.to_be(), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn to_be(self) -> Self { // or not to be?
|
|
|
|
|
#[cfg(target_endian = "big")]
|
|
|
|
|
{
|
|
|
|
|
self
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "big"))]
|
|
|
|
|
{
|
|
|
|
|
self.swap_bytes()
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("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:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "let n = 0x1A", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
|
|
|
|
if cfg!(target_endian = \"little\") {
|
|
|
|
|
assert_eq!(n.to_le(), n)
|
|
|
|
|
} else {
|
|
|
|
|
assert_eq!(n.to_le(), n.swap_bytes())
|
2018-02-12 21:27:40 +01:00
|
|
|
}", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
2018-05-29 11:42:13 +02:00
|
|
|
pub const fn to_le(self) -> Self {
|
|
|
|
|
#[cfg(target_endian = "little")]
|
|
|
|
|
{
|
|
|
|
|
self
|
|
|
|
|
}
|
|
|
|
|
#[cfg(not(target_endian = "little"))]
|
|
|
|
|
{
|
|
|
|
|
self.swap_bytes()
|
|
|
|
|
}
|
2018-06-02 11:24:32 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer addition. Computes `self + rhs`, returning `None`
|
|
|
|
|
if overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!((", stringify!($SelfT), "::max_value() - 2).checked_add(1), ",
|
2018-02-11 18:13:12 -05:00
|
|
|
"Some(", stringify!($SelfT), "::max_value() - 1));
|
2018-06-01 01:29:22 +02:00
|
|
|
assert_eq!((", stringify!($SelfT), "::max_value() - 2).checked_add(3), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_add(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_add(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer subtraction. Computes `self - rhs`, returning
|
|
|
|
|
`None` if overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(1", stringify!($SelfT), ".checked_sub(1), Some(0));
|
|
|
|
|
assert_eq!(0", stringify!($SelfT), ".checked_sub(1), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_sub(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_sub(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer multiplication. Computes `self * rhs`, returning
|
|
|
|
|
`None` if overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(5", stringify!($SelfT), ".checked_mul(1), Some(5));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().checked_mul(2), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_mul(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_mul(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer division. Computes `self / rhs`, returning `None`
|
|
|
|
|
if `rhs == 0`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(128", stringify!($SelfT), ".checked_div(2), Some(64));
|
|
|
|
|
assert_eq!(1", stringify!($SelfT), ".checked_div(0), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_div(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
match rhs {
|
|
|
|
|
0 => None,
|
|
|
|
|
rhs => Some(unsafe { intrinsics::unchecked_div(self, rhs) }),
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Checked Euclidean division. Computes `self.div_euclid(rhs)`, returning `None`
|
2018-03-26 20:15:19 +02:00
|
|
|
if `rhs == 0`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(128", stringify!($SelfT), ".checked_div_euclid(2), Some(64));
|
|
|
|
|
assert_eq!(1", stringify!($SelfT), ".checked_div_euclid(0), None);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn checked_div_euclid(self, rhs: Self) -> Option<Self> {
|
2018-03-26 20:15:19 +02:00
|
|
|
if rhs == 0 {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
Some(self.div_euclid(rhs))
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked integer remainder. Computes `self % rhs`, returning `None`
|
|
|
|
|
if `rhs == 0`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(5", stringify!($SelfT), ".checked_rem(2), Some(1));
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem(0), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_rem(self, rhs: Self) -> Option<Self> {
|
|
|
|
|
if rhs == 0 {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
|
|
|
|
Some(unsafe { intrinsics::unchecked_rem(self, rhs) })
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-01-15 10:07:52 -08:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Checked Euclidean modulo. Computes `self.rem_euclid(rhs)`, returning `None`
|
2018-03-26 20:15:19 +02:00
|
|
|
if `rhs == 0`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem_euclid(2), Some(1));
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".checked_rem_euclid(0), None);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn checked_rem_euclid(self, rhs: Self) -> Option<Self> {
|
2018-03-26 20:15:19 +02:00
|
|
|
if rhs == 0 {
|
|
|
|
|
None
|
|
|
|
|
} else {
|
2018-12-17 16:41:48 -08:00
|
|
|
Some(self.rem_euclid(rhs))
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked negation. Computes `-self`, returning `None` unless `self ==
|
|
|
|
|
0`.
|
|
|
|
|
|
|
|
|
|
Note that negating any positive integer will overflow.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0", stringify!($SelfT), ".checked_neg(), Some(0));
|
|
|
|
|
assert_eq!(1", stringify!($SelfT), ".checked_neg(), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_neg(self) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_neg();
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked shift left. Computes `self << rhs`, returning `None`
|
|
|
|
|
if `rhs` is larger than or equal to the number of bits in `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x1", stringify!($SelfT), ".checked_shl(4), Some(0x10));
|
|
|
|
|
assert_eq!(0x10", stringify!($SelfT), ".checked_shl(129), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_shl(self, rhs: u32) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_shl(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked shift right. Computes `self >> rhs`, returning `None`
|
|
|
|
|
if `rhs` is larger than or equal to the number of bits in `self`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x10", stringify!($SelfT), ".checked_shr(4), Some(0x1));
|
|
|
|
|
assert_eq!(0x10", stringify!($SelfT), ".checked_shr(129), None);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_shr(self, rhs: u32) -> Option<Self> {
|
|
|
|
|
let (a, b) = self.overflowing_shr(rhs);
|
|
|
|
|
if b {None} else {Some(a)}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Checked exponentiation. Computes `self.pow(exp)`, returning `None` if
|
|
|
|
|
overflow occurred.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(2", stringify!($SelfT), ".checked_pow(5), Some(32));
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().checked_pow(2), None);", $EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn checked_pow(self, mut exp: u32) -> Option<Self> {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
acc = acc.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
base = base.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
acc = acc.checked_mul(base)?;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Some(acc)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer addition. Computes `self + rhs`, saturating at
|
|
|
|
|
the numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
2019-02-05 15:36:31 -05:00
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".saturating_add(1), 101);
|
|
|
|
|
assert_eq!(200u8.saturating_add(127), 255);", $EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2019-02-07 13:46:20 -05:00
|
|
|
#[rustc_const_unstable(feature = "const_saturating_int_methods")]
|
2019-02-05 15:36:31 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn saturating_add(self, rhs: Self) -> Self {
|
|
|
|
|
intrinsics::saturating_add(self, rhs)
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer subtraction. Computes `self - rhs`, saturating
|
|
|
|
|
at the numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
2019-02-06 16:15:17 -05:00
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".saturating_sub(27), 73);
|
|
|
|
|
assert_eq!(13", stringify!($SelfT), ".saturating_sub(127), 0);", $EndFeature, "
|
|
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2019-02-07 13:46:20 -05:00
|
|
|
#[rustc_const_unstable(feature = "const_saturating_int_methods")]
|
2019-02-06 16:15:17 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn saturating_sub(self, rhs: Self) -> Self {
|
|
|
|
|
intrinsics::saturating_sub(self, rhs)
|
2018-02-11 18:13:12 -05:00
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer multiplication. Computes `self * rhs`,
|
|
|
|
|
saturating at the numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(2", stringify!($SelfT), ".saturating_mul(10), 20);
|
|
|
|
|
assert_eq!((", stringify!($SelfT), "::MAX).saturating_mul(10), ", stringify!($SelfT),
|
|
|
|
|
"::MAX);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_mul(self, rhs: Self) -> Self {
|
|
|
|
|
self.checked_mul(rhs).unwrap_or(Self::max_value())
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Saturating integer exponentiation. Computes `self.pow(exp)`,
|
|
|
|
|
saturating at the numeric bounds instead of overflowing.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
|
|
|
|
|
|
|
|
|
assert_eq!(4", stringify!($SelfT), ".saturating_pow(3), 64);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::MAX.saturating_pow(2), ", stringify!($SelfT), "::MAX);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn saturating_pow(self, exp: u32) -> Self {
|
|
|
|
|
match self.checked_pow(exp) {
|
|
|
|
|
Some(x) => x,
|
|
|
|
|
None => Self::max_value(),
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) addition. Computes `self + rhs`,
|
|
|
|
|
wrapping around at the boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(200", stringify!($SelfT), ".wrapping_add(55), 255);
|
|
|
|
|
assert_eq!(200", stringify!($SelfT), ".wrapping_add(", stringify!($SelfT), "::max_value()), 199);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_add(self, rhs: Self) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::overflowing_add(self, rhs)
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) subtraction. Computes `self - rhs`,
|
|
|
|
|
wrapping around at the boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_sub(100), 0);
|
|
|
|
|
assert_eq!(100", stringify!($SelfT), ".wrapping_sub(", stringify!($SelfT), "::max_value()), 101);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_sub(self, rhs: Self) -> Self {
|
2018-12-31 04:11:46 +01:00
|
|
|
intrinsics::overflowing_sub(self, rhs)
|
2015-03-19 23:42:18 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Wrapping (modular) multiplication. Computes `self *
|
2017-12-03 11:24:00 -05:00
|
|
|
/// rhs`, wrapping around at the boundary of the type.
|
2015-11-09 09:15:39 +00:00
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// Basic usage:
|
|
|
|
|
///
|
2018-02-14 19:44:07 +01:00
|
|
|
/// Please note that this example is shared between integer types.
|
|
|
|
|
/// Which explains why `u8` is used here.
|
|
|
|
|
///
|
2015-11-09 09:15:39 +00:00
|
|
|
/// ```
|
2016-01-19 10:47:27 +01:00
|
|
|
/// assert_eq!(10u8.wrapping_mul(12), 120);
|
|
|
|
|
/// assert_eq!(25u8.wrapping_mul(12), 44);
|
2015-11-09 09:15:39 +00:00
|
|
|
/// ```
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2015-03-19 23:42:18 -07:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_mul(self, rhs: Self) -> Self {
|
2018-12-31 16:11:03 +01:00
|
|
|
intrinsics::overflowing_mul(self, rhs)
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) division. Computes `self / rhs`.
|
|
|
|
|
Wrapped division on unsigned types is just normal division.
|
|
|
|
|
There's no way wrapping could ever happen.
|
|
|
|
|
This function exists, so that all operations
|
|
|
|
|
are accounted for in the wrapping operations.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_div(10), 10);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_div(self, rhs: Self) -> Self {
|
|
|
|
|
self / rhs
|
|
|
|
|
}
|
2015-04-13 21:55:15 +02:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Wrapping Euclidean division. Computes `self.div_euclid(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
Wrapped division on unsigned types is just normal division.
|
|
|
|
|
There's no way wrapping could ever happen.
|
|
|
|
|
This function exists, so that all operations
|
|
|
|
|
are accounted for in the wrapping operations.
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this
|
|
|
|
|
is exactly equal to `self.wrapping_div(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(100", stringify!($SelfT), ".wrapping_div_euclid(10), 10);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn wrapping_div_euclid(self, rhs: Self) -> Self {
|
2018-03-28 01:41:40 +02:00
|
|
|
self / rhs
|
2018-03-26 20:15:19 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) remainder. Computes `self % rhs`.
|
|
|
|
|
Wrapped remainder calculation on unsigned types is
|
|
|
|
|
just the regular remainder calculation.
|
|
|
|
|
There's no way wrapping could ever happen.
|
|
|
|
|
This function exists, so that all operations
|
|
|
|
|
are accounted for in the wrapping operations.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(100", stringify!($SelfT), ".wrapping_rem(10), 0);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_rem(self, rhs: Self) -> Self {
|
|
|
|
|
self % rhs
|
|
|
|
|
}
|
2015-04-13 21:55:15 +02:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Wrapping Euclidean modulo. Computes `self.rem_euclid(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
Wrapped modulo calculation on unsigned types is
|
|
|
|
|
just the regular remainder calculation.
|
|
|
|
|
There's no way wrapping could ever happen.
|
|
|
|
|
This function exists, so that all operations
|
|
|
|
|
are accounted for in the wrapping operations.
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this
|
|
|
|
|
is exactly equal to `self.wrapping_rem(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(100", stringify!($SelfT), ".wrapping_rem_euclid(10), 0);
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn wrapping_rem_euclid(self, rhs: Self) -> Self {
|
2018-03-26 20:15:19 +02:00
|
|
|
self % rhs
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-04-13 21:55:15 +02:00
|
|
|
/// Wrapping (modular) negation. Computes `-self`,
|
|
|
|
|
/// wrapping around at the boundary of the type.
|
|
|
|
|
///
|
2016-01-19 10:47:27 +01:00
|
|
|
/// Since unsigned types do not have negative equivalents
|
|
|
|
|
/// all applications of this function will wrap (except for `-0`).
|
|
|
|
|
/// For values smaller than the corresponding signed type's maximum
|
|
|
|
|
/// the result is the same as casting the corresponding signed value.
|
|
|
|
|
/// Any larger values are equivalent to `MAX + 1 - (val - MAX - 1)` where
|
|
|
|
|
/// `MAX` is the corresponding signed type's maximum.
|
2015-11-09 09:15:39 +00:00
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// Basic usage:
|
|
|
|
|
///
|
2018-02-14 19:44:07 +01:00
|
|
|
/// Please note that this example is shared between integer types.
|
|
|
|
|
/// Which explains why `i8` is used here.
|
|
|
|
|
///
|
2015-11-09 09:15:39 +00:00
|
|
|
/// ```
|
2018-02-12 21:27:40 +01:00
|
|
|
/// assert_eq!(100i8.wrapping_neg(), -100);
|
|
|
|
|
/// assert_eq!((-128i8).wrapping_neg(), -128);
|
2015-11-09 09:15:39 +00:00
|
|
|
/// ```
|
2015-06-10 18:31:15 -07:00
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2017-07-20 11:14:13 -07:00
|
|
|
#[inline]
|
2019-02-01 01:31:52 -07:00
|
|
|
pub const fn wrapping_neg(self) -> Self {
|
2015-04-13 21:55:15 +02:00
|
|
|
self.overflowing_neg().0
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Panic-free bitwise shift-left; yields `self << mask(rhs)`,
|
|
|
|
|
where `mask` removes any high-order bits of `rhs` that
|
|
|
|
|
would cause the shift to exceed the bitwidth of the type.
|
|
|
|
|
|
|
|
|
|
Note that this is *not* the same as a rotate-left; the
|
|
|
|
|
RHS of a wrapping shift-left is restricted to the range
|
|
|
|
|
of the type, rather than the bits shifted out of the LHS
|
|
|
|
|
being returned to the other end. The primitive integer
|
|
|
|
|
types all implement a `rotate_left` function, which may
|
|
|
|
|
be what you want instead.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(1", stringify!($SelfT), ".wrapping_shl(7), 128);
|
|
|
|
|
assert_eq!(1", stringify!($SelfT), ".wrapping_shl(128), 1);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_shl(self, rhs: u32) -> Self {
|
2018-02-11 18:13:12 -05:00
|
|
|
unsafe {
|
|
|
|
|
intrinsics::unchecked_shl(self, (rhs & ($BITS - 1)) as $SelfT)
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Panic-free bitwise shift-right; yields `self >> mask(rhs)`,
|
|
|
|
|
where `mask` removes any high-order bits of `rhs` that
|
|
|
|
|
would cause the shift to exceed the bitwidth of the type.
|
|
|
|
|
|
|
|
|
|
Note that this is *not* the same as a rotate-right; the
|
|
|
|
|
RHS of a wrapping shift-right is restricted to the range
|
|
|
|
|
of the type, rather than the bits shifted out of the LHS
|
|
|
|
|
being returned to the other end. The primitive integer
|
|
|
|
|
types all implement a `rotate_right` function, which may
|
|
|
|
|
be what you want instead.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(128", stringify!($SelfT), ".wrapping_shr(7), 1);
|
|
|
|
|
assert_eq!(128", stringify!($SelfT), ".wrapping_shr(128), 128);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "num_wrapping", since = "1.2.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[inline]
|
2018-09-01 15:05:55 +02:00
|
|
|
pub const fn wrapping_shr(self, rhs: u32) -> Self {
|
2018-02-11 18:13:12 -05:00
|
|
|
unsafe {
|
|
|
|
|
intrinsics::unchecked_shr(self, (rhs & ($BITS - 1)) as $SelfT)
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Wrapping (modular) exponentiation. Computes `self.pow(exp)`,
|
|
|
|
|
wrapping around at the boundary of the type.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(3", stringify!($SelfT), ".wrapping_pow(5), 243);
|
|
|
|
|
assert_eq!(3u8.wrapping_pow(6), 217);", $EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn wrapping_pow(self, mut exp: u32) -> Self {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
acc = acc.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
base = base.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
acc = acc.wrapping_mul(base);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
acc
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates `self` + `rhs`
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the addition along with a boolean indicating
|
|
|
|
|
whether an arithmetic overflow would occur. If an overflow would
|
|
|
|
|
have occurred then the wrapped value is returned.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_add(2), (7, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::MAX.overflowing_add(1), (0, true));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_add(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::add_with_overflow(self as $ActualT, rhs as $ActualT);
|
2018-02-11 18:13:12 -05:00
|
|
|
(a as Self, b)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates `self` - `rhs`
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the subtraction along with a boolean indicating
|
|
|
|
|
whether an arithmetic overflow would occur. If an overflow would
|
|
|
|
|
have occurred then the wrapped value is returned.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "use std::", stringify!($SelfT), ";
|
2018-02-11 18:13:12 -05:00
|
|
|
|
|
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_sub(2), (3, false));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(0", stringify!($SelfT), ".overflowing_sub(1), (", stringify!($SelfT), "::MAX, true));",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_sub(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::sub_with_overflow(self as $ActualT, rhs as $ActualT);
|
2018-02-11 18:13:12 -05:00
|
|
|
(a as Self, b)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// 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
|
|
|
|
|
///
|
2018-02-14 19:44:07 +01:00
|
|
|
/// Basic usage:
|
|
|
|
|
///
|
|
|
|
|
/// Please note that this example is shared between integer types.
|
|
|
|
|
/// Which explains why `u32` is used here.
|
2015-12-18 10:24:06 -08:00
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// assert_eq!(5u32.overflowing_mul(2), (10, false));
|
|
|
|
|
/// assert_eq!(1_000_000_000u32.overflowing_mul(10), (1410065408, true));
|
|
|
|
|
/// ```
|
2016-01-15 10:07:52 -08:00
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_mul(self, rhs: Self) -> (Self, bool) {
|
2019-01-13 04:00:03 +01:00
|
|
|
let (a, b) = intrinsics::mul_with_overflow(self as $ActualT, rhs as $ActualT);
|
2017-12-17 18:19:43 +08:00
|
|
|
(a as Self, b)
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates the divisor when `self` is divided by `rhs`.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the divisor along with a boolean indicating
|
|
|
|
|
whether an arithmetic overflow would occur. Note that for unsigned
|
|
|
|
|
integers overflow never occurs, so the second value is always
|
|
|
|
|
`false`.
|
|
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(5", stringify!($SelfT), ".overflowing_div(2), (2, false));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
pub fn overflowing_div(self, rhs: Self) -> (Self, bool) {
|
|
|
|
|
(self / rhs, false)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Calculates the quotient of Euclidean division `self.div_euclid(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
Returns a tuple of the divisor along with a boolean indicating
|
|
|
|
|
whether an arithmetic overflow would occur. Note that for unsigned
|
|
|
|
|
integers overflow never occurs, so the second value is always
|
|
|
|
|
`false`.
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this
|
|
|
|
|
is exactly equal to `self.overflowing_div(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_div_euclid(2), (2, false));
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn overflowing_div_euclid(self, rhs: Self) -> (Self, bool) {
|
2018-03-26 20:15:19 +02:00
|
|
|
(self / rhs, false)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Calculates the remainder when `self` is divided by `rhs`.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the remainder after dividing along with a boolean
|
|
|
|
|
indicating whether an arithmetic overflow would occur. Note that for
|
|
|
|
|
unsigned integers overflow never occurs, so the second value is
|
|
|
|
|
always `false`.
|
|
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(5", stringify!($SelfT), ".overflowing_rem(2), (1, false));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-11 18:13:12 -05:00
|
|
|
pub fn overflowing_rem(self, rhs: Self) -> (Self, bool) {
|
|
|
|
|
(self % rhs, false)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Calculates the remainder `self.rem_euclid(rhs)` as if by Euclidean division.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
Returns a tuple of the modulo after dividing along with a boolean
|
|
|
|
|
indicating whether an arithmetic overflow would occur. Note that for
|
|
|
|
|
unsigned integers overflow never occurs, so the second value is
|
|
|
|
|
always `false`.
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this operation
|
|
|
|
|
is exactly equal to `self.overflowing_rem(rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Panics
|
|
|
|
|
|
|
|
|
|
This function will panic if `rhs` is 0.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(5", stringify!($SelfT), ".overflowing_rem_euclid(2), (1, false));
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn overflowing_rem_euclid(self, rhs: Self) -> (Self, bool) {
|
2018-03-26 20:15:19 +02:00
|
|
|
(self % rhs, false)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Negates self in an overflowing fashion.
|
|
|
|
|
|
|
|
|
|
Returns `!self + 1` using wrapping operations to return the value
|
|
|
|
|
that represents the negation of this unsigned value. Note that for
|
|
|
|
|
positive unsigned values overflow always occurs, but negating 0 does
|
|
|
|
|
not overflow.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0", stringify!($SelfT), ".overflowing_neg(), (0, false));
|
|
|
|
|
assert_eq!(2", stringify!($SelfT), ".overflowing_neg(), (-2i32 as ", stringify!($SelfT),
|
|
|
|
|
", true));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[inline]
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-02-01 01:31:52 -07:00
|
|
|
pub const fn overflowing_neg(self) -> (Self, bool) {
|
2018-02-11 18:13:12 -05:00
|
|
|
((!self).wrapping_add(1), self != 0)
|
|
|
|
|
}
|
2015-12-18 10:24:06 -08:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts self left by `rhs` bits.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the shifted version of self along with a boolean
|
|
|
|
|
indicating whether the shift value was larger than or equal to the
|
|
|
|
|
number of bits. If the shift value is too large, then value is
|
|
|
|
|
masked (N-1) where N is the number of bits, and this value is then
|
|
|
|
|
used to perform the shift.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x1", stringify!($SelfT), ".overflowing_shl(4), (0x10, false));
|
|
|
|
|
assert_eq!(0x1", stringify!($SelfT), ".overflowing_shl(132), (0x10, true));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_shl(self, rhs: u32) -> (Self, bool) {
|
2018-02-11 18:13:12 -05:00
|
|
|
(self.wrapping_shl(rhs), (rhs > ($BITS - 1)))
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Shifts self right by `rhs` bits.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the shifted version of self along with a boolean
|
|
|
|
|
indicating whether the shift value was larger than or equal to the
|
|
|
|
|
number of bits. If the shift value is too large, then value is
|
|
|
|
|
masked (N-1) where N is the number of bits, and this value is then
|
|
|
|
|
used to perform the shift.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(0x10", stringify!($SelfT), ".overflowing_shr(4), (0x1, false));
|
|
|
|
|
assert_eq!(0x10", stringify!($SelfT), ".overflowing_shr(132), (0x1, true));", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "wrapping", since = "1.7.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-09-01 15:05:55 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub const fn overflowing_shr(self, rhs: u32) -> (Self, bool) {
|
2018-02-11 18:13:12 -05:00
|
|
|
(self.wrapping_shr(rhs), (rhs > ($BITS - 1)))
|
|
|
|
|
}
|
2018-02-18 20:14:21 +09:00
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
|
2018-02-18 20:14:21 +09:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Raises self to the power of `exp`, using exponentiation by squaring.
|
|
|
|
|
|
|
|
|
|
Returns a tuple of the exponentiation along with a bool indicating
|
|
|
|
|
whether an overflow happened.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
", $Feature, "assert_eq!(3", stringify!($SelfT), ".overflowing_pow(5), (243, false));
|
|
|
|
|
assert_eq!(3u8.overflowing_pow(6), (217, true));", $EndFeature, "
|
|
|
|
|
```"),
|
2019-01-24 13:38:46 +09:00
|
|
|
#[stable(feature = "no_panic_pow", since = "1.34.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-02-18 20:14:21 +09:00
|
|
|
#[inline]
|
|
|
|
|
pub fn overflowing_pow(self, mut exp: u32) -> (Self, bool) {
|
|
|
|
|
let mut base = self;
|
|
|
|
|
let mut acc: Self = 1;
|
|
|
|
|
let mut overflown = false;
|
|
|
|
|
// Scratch space for storing results of overflowing_mul.
|
|
|
|
|
let mut r;
|
|
|
|
|
|
|
|
|
|
while exp > 1 {
|
|
|
|
|
if (exp & 1) == 1 {
|
|
|
|
|
r = acc.overflowing_mul(base);
|
|
|
|
|
acc = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
exp /= 2;
|
|
|
|
|
r = base.overflowing_mul(base);
|
|
|
|
|
base = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
r = acc.overflowing_mul(base);
|
|
|
|
|
acc = r.0;
|
|
|
|
|
overflown |= r.1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
(acc, overflown)
|
|
|
|
|
}
|
2017-03-14 16:35:11 +01:00
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Raises self to the power of `exp`, using exponentiation by squaring.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-21 22:30:40 +09:00
|
|
|
", $Feature, "assert_eq!(2", stringify!($SelfT), ".pow(5), 32);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2015-03-18 09:36:18 -07:00
|
|
|
#[inline]
|
2016-05-26 19:02:26 +03:00
|
|
|
#[rustc_inherit_overflow_checks]
|
2015-05-21 14:01:44 -04:00
|
|
|
pub fn pow(self, mut exp: u32) -> Self {
|
2015-03-18 09:36:18 -07:00
|
|
|
let mut base = self;
|
2016-06-28 08:56:56 -07:00
|
|
|
let mut acc = 1;
|
2015-03-18 09:36:18 -07:00
|
|
|
|
2016-07-20 18:23:52 -04:00
|
|
|
while exp > 1 {
|
2015-03-18 09:36:18 -07:00
|
|
|
if (exp & 1) == 1 {
|
2016-07-20 18:23:52 -04:00
|
|
|
acc = acc * base;
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
exp /= 2;
|
2016-07-20 18:23:52 -04:00
|
|
|
base = base * base;
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2016-07-20 18:23:52 -04:00
|
|
|
|
|
|
|
|
// Deal with the final bit of the exponent separately, since
|
|
|
|
|
// squaring the base afterwards is not necessary and may cause a
|
|
|
|
|
// needless overflow.
|
|
|
|
|
if exp == 1 {
|
|
|
|
|
acc = acc * base;
|
|
|
|
|
}
|
|
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
acc
|
|
|
|
|
}
|
2018-02-11 18:13:12 -05:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-03-26 20:15:19 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Performs Euclidean division.
|
|
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this
|
|
|
|
|
is exactly equal to `self / rhs`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(7", stringify!($SelfT), ".div_euclid(4), 1); // or any other integer type
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn div_euclid(self, rhs: Self) -> Self {
|
2018-03-26 20:15:19 +02:00
|
|
|
self / rhs
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
doc_comment! {
|
2018-12-17 16:41:48 -08:00
|
|
|
concat!("Calculates the least remainder of `self (mod rhs)`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
2018-12-17 16:41:48 -08:00
|
|
|
Since, for the positive integers, all common
|
|
|
|
|
definitions of division are equal, this
|
|
|
|
|
is exactly equal to `self % rhs`.
|
2018-03-26 20:15:19 +02:00
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-03-28 16:22:37 +02:00
|
|
|
#![feature(euclidean_division)]
|
2018-12-17 16:41:48 -08:00
|
|
|
assert_eq!(7", stringify!($SelfT), ".rem_euclid(4), 3); // or any other integer type
|
2018-03-26 20:15:19 +02:00
|
|
|
```"),
|
|
|
|
|
#[unstable(feature = "euclidean_division", issue = "49048")]
|
2019-04-10 20:26:24 +10:00
|
|
|
#[must_use = "this returns the result of the operation, \
|
|
|
|
|
without modifying the original"]
|
2018-03-26 20:15:19 +02:00
|
|
|
#[inline]
|
|
|
|
|
#[rustc_inherit_overflow_checks]
|
2018-12-17 16:41:48 -08:00
|
|
|
pub fn rem_euclid(self, rhs: Self) -> Self {
|
2018-03-26 20:15:19 +02:00
|
|
|
self % rhs
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns `true` if and only if `self == 2^k` for some `k`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert!(16", stringify!($SelfT), ".is_power_of_two());
|
|
|
|
|
assert!(!10", stringify!($SelfT), ".is_power_of_two());", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn is_power_of_two(self) -> bool {
|
|
|
|
|
(self.wrapping_sub(1)) & self == 0 && !(self == 0)
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2017-05-23 23:04:23 +05:30
|
|
|
// Returns one less than next power of two.
|
|
|
|
|
// (For 8u8 next power of two is 8u8 and for 6u8 it is 8u8)
|
|
|
|
|
//
|
|
|
|
|
// 8u8.one_less_than_next_power_of_two() == 7
|
|
|
|
|
// 6u8.one_less_than_next_power_of_two() == 7
|
2017-05-31 22:25:15 +05:30
|
|
|
//
|
|
|
|
|
// This method cannot overflow, as in the `next_power_of_two`
|
|
|
|
|
// overflow cases it instead ends up returning the maximum value
|
|
|
|
|
// of the type, and can return 0 for 0.
|
2017-06-08 21:29:45 -07:00
|
|
|
#[inline]
|
2017-04-28 21:50:02 +05:30
|
|
|
fn one_less_than_next_power_of_two(self) -> Self {
|
2017-05-31 22:25:15 +05:30
|
|
|
if self <= 1 { return 0; }
|
|
|
|
|
|
|
|
|
|
// Because `p > 0`, it cannot consist entirely of leading zeros.
|
|
|
|
|
// That means the shift is always in-bounds, and some processors
|
|
|
|
|
// (such as intel pre-haswell) have more efficient ctlz
|
|
|
|
|
// intrinsics when the argument is non-zero.
|
|
|
|
|
let p = self - 1;
|
2017-12-17 18:19:43 +08:00
|
|
|
let z = unsafe { intrinsics::ctlz_nonzero(p) };
|
2017-05-31 22:25:15 +05:30
|
|
|
<$SelfT>::max_value() >> z
|
2017-04-28 21:50:02 +05:30
|
|
|
}
|
|
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the smallest power of two greater than or equal to `self`.
|
|
|
|
|
|
2018-11-27 02:59:49 +00:00
|
|
|
When return value overflows (i.e., `self > (1 << (N-1))` for type
|
2018-02-11 18:13:12 -05:00
|
|
|
`uN`), it panics in debug mode and return value is wrapped to 0 in
|
|
|
|
|
release mode (the only situation in which method can return 0).
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(2", stringify!($SelfT), ".next_power_of_two(), 2);
|
|
|
|
|
assert_eq!(3", stringify!($SelfT), ".next_power_of_two(), 4);", $EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub fn next_power_of_two(self) -> Self {
|
|
|
|
|
// Call the trait to get overflow checks
|
|
|
|
|
ops::Add::add(self.one_less_than_next_power_of_two(), 1)
|
|
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2018-02-11 18:13:12 -05:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the smallest power of two greater than or equal to `n`. If
|
|
|
|
|
the next power of two is greater than the type's maximum value,
|
|
|
|
|
`None` is returned, otherwise the power of two is wrapped in `Some`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-02-12 21:27:40 +01:00
|
|
|
", $Feature, "assert_eq!(2", stringify!($SelfT),
|
|
|
|
|
".checked_next_power_of_two(), Some(2));
|
2018-02-11 18:13:12 -05:00
|
|
|
assert_eq!(3", stringify!($SelfT), ".checked_next_power_of_two(), Some(4));
|
2018-02-12 21:27:40 +01:00
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().checked_next_power_of_two(), None);",
|
|
|
|
|
$EndFeature, "
|
2018-02-11 18:13:12 -05:00
|
|
|
```"),
|
2018-11-29 21:13:04 +01:00
|
|
|
#[inline]
|
2018-02-11 18:13:12 -05:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
pub fn checked_next_power_of_two(self) -> Option<Self> {
|
|
|
|
|
self.one_less_than_next_power_of_two().checked_add(1)
|
|
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2018-04-11 00:04:32 +02:00
|
|
|
|
2018-03-26 16:46:04 -04:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Returns the smallest power of two greater than or equal to `n`. If
|
|
|
|
|
the next power of two is greater than the type's maximum value,
|
|
|
|
|
the return value is wrapped to `0`.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
Basic usage:
|
|
|
|
|
|
|
|
|
|
```
|
2018-05-15 12:52:16 -04:00
|
|
|
#![feature(wrapping_next_power_of_two)]
|
2018-03-26 16:46:04 -04:00
|
|
|
", $Feature, "
|
|
|
|
|
assert_eq!(2", stringify!($SelfT), ".wrapping_next_power_of_two(), 2);
|
|
|
|
|
assert_eq!(3", stringify!($SelfT), ".wrapping_next_power_of_two(), 4);
|
|
|
|
|
assert_eq!(", stringify!($SelfT), "::max_value().wrapping_next_power_of_two(), 0);",
|
|
|
|
|
$EndFeature, "
|
|
|
|
|
```"),
|
2018-05-15 12:52:16 -04:00
|
|
|
#[unstable(feature = "wrapping_next_power_of_two", issue = "32463",
|
|
|
|
|
reason = "needs decision on wrapping behaviour")]
|
2018-03-26 16:46:04 -04:00
|
|
|
pub fn wrapping_next_power_of_two(self) -> Self {
|
|
|
|
|
self.one_less_than_next_power_of_two().wrapping_add(1)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-09-26 14:26:46 -07:00
|
|
|
doc_comment! {
|
2018-08-17 22:20:09 +02:00
|
|
|
concat!("Return the memory representation of this integer as a byte array in
|
|
|
|
|
big-endian (network) byte order.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_be_bytes();
|
|
|
|
|
assert_eq!(bytes, ", $be_bytes, ");
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_be_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
self.to_be().to_ne_bytes()
|
|
|
|
|
}
|
2018-08-14 18:46:04 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Return the memory representation of this integer as a byte array in
|
|
|
|
|
little-endian byte order.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_le_bytes();
|
|
|
|
|
assert_eq!(bytes, ", $le_bytes, ");
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_le_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
self.to_le().to_ne_bytes()
|
|
|
|
|
}
|
2018-08-14 18:46:04 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("
|
|
|
|
|
Return the memory representation of this integer as a byte array in
|
|
|
|
|
native byte order.
|
|
|
|
|
|
|
|
|
|
As the target platform's native endianness is used, portable code
|
|
|
|
|
should use [`to_be_bytes`] or [`to_le_bytes`], as appropriate,
|
|
|
|
|
instead.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$to_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
[`to_be_bytes`]: #method.to_be_bytes
|
|
|
|
|
[`to_le_bytes`]: #method.to_le_bytes
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let bytes = ", $swap_op, stringify!($SelfT), ".to_ne_bytes();
|
|
|
|
|
assert_eq!(bytes, if cfg!(target_endian = \"big\") {
|
|
|
|
|
", $be_bytes, "
|
|
|
|
|
} else {
|
|
|
|
|
", $le_bytes, "
|
|
|
|
|
});
|
|
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn to_ne_bytes(self) -> [u8; mem::size_of::<Self>()] {
|
|
|
|
|
unsafe { mem::transmute(self) }
|
|
|
|
|
}
|
2018-04-11 00:04:32 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Create an integer value from its representation as a byte array in
|
|
|
|
|
big endian.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_be_bytes(", $be_bytes, ");
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
|
|
|
|
fn read_be_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
|
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
|
|
|
|
", stringify!($SelfT), "::from_be_bytes(int_bytes.try_into().unwrap())
|
|
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_be_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
Self::from_be(Self::from_ne_bytes(bytes))
|
|
|
|
|
}
|
2018-08-14 18:46:04 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("
|
|
|
|
|
Create an integer value from its representation as a byte array in
|
|
|
|
|
little endian.
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_le_bytes(", $le_bytes, ");
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
2019-03-07 21:24:46 +01:00
|
|
|
fn read_le_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
2018-11-25 17:33:16 +01:00
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
2019-03-07 21:24:46 +01:00
|
|
|
", stringify!($SelfT), "::from_le_bytes(int_bytes.try_into().unwrap())
|
2018-11-25 17:33:16 +01:00
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_le_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
Self::from_le(Self::from_ne_bytes(bytes))
|
|
|
|
|
}
|
2018-08-14 18:46:04 +02:00
|
|
|
}
|
|
|
|
|
|
2018-08-17 22:20:09 +02:00
|
|
|
doc_comment! {
|
|
|
|
|
concat!("Create 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.
|
|
|
|
|
|
|
|
|
|
[`from_be_bytes`]: #method.from_be_bytes
|
|
|
|
|
[`from_le_bytes`]: #method.from_le_bytes
|
2019-04-15 00:00:50 +01:00
|
|
|
",
|
|
|
|
|
$from_xe_bytes_doc,
|
|
|
|
|
"
|
2018-08-17 22:20:09 +02:00
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
let value = ", stringify!($SelfT), "::from_ne_bytes(if cfg!(target_endian = \"big\") {
|
|
|
|
|
", $be_bytes, "
|
|
|
|
|
} else {
|
|
|
|
|
", $le_bytes, "
|
|
|
|
|
});
|
|
|
|
|
assert_eq!(value, ", $swap_op, ");
|
2018-11-25 17:33:16 +01:00
|
|
|
```
|
|
|
|
|
|
|
|
|
|
When starting from a slice rather than an array, fallible conversion APIs can be used:
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
use std::convert::TryInto;
|
|
|
|
|
|
2019-03-07 21:24:46 +01:00
|
|
|
fn read_ne_", stringify!($SelfT), "(input: &mut &[u8]) -> ", stringify!($SelfT), " {
|
2018-11-25 17:33:16 +01:00
|
|
|
let (int_bytes, rest) = input.split_at(std::mem::size_of::<", stringify!($SelfT), ">());
|
|
|
|
|
*input = rest;
|
2019-03-07 21:24:46 +01:00
|
|
|
", stringify!($SelfT), "::from_ne_bytes(int_bytes.try_into().unwrap())
|
2018-11-25 17:33:16 +01:00
|
|
|
}
|
2018-08-17 22:20:09 +02:00
|
|
|
```"),
|
2018-11-25 08:26:22 +01:00
|
|
|
#[stable(feature = "int_to_from_bytes", since = "1.32.0")]
|
2018-08-17 22:20:09 +02:00
|
|
|
#[rustc_const_unstable(feature = "const_int_conversion")]
|
|
|
|
|
#[inline]
|
|
|
|
|
pub const fn from_ne_bytes(bytes: [u8; mem::size_of::<Self>()]) -> Self {
|
|
|
|
|
unsafe { mem::transmute(bytes) }
|
|
|
|
|
}
|
2018-04-11 00:04:32 +02:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "u8"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl u8 {
|
2018-08-17 22:20:09 +02:00
|
|
|
uint_impl! { u8, u8, 8, 255, "", "", 2, "0x82", "0xa", "0x12", "0x12", "0x48", "[0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12]", "", "" }
|
2017-08-22 19:45:36 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is within the ASCII range.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let ascii = 97u8;
|
|
|
|
|
/// let non_ascii = 150u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(ascii.is_ascii());
|
|
|
|
|
/// assert!(!non_ascii.is_ascii());
|
|
|
|
|
/// ```
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii(&self) -> bool {
|
|
|
|
|
*self & 128 == 0
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Makes a copy of the value in its ASCII upper case equivalent.
|
|
|
|
|
///
|
|
|
|
|
/// ASCII letters 'a' to 'z' are mapped to 'A' to 'Z',
|
|
|
|
|
/// but non-ASCII letters are unchanged.
|
|
|
|
|
///
|
|
|
|
|
/// To uppercase the value in-place, use [`make_ascii_uppercase`].
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let lowercase_a = 97u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(65, lowercase_a.to_ascii_uppercase());
|
|
|
|
|
/// ```
|
|
|
|
|
///
|
|
|
|
|
/// [`make_ascii_uppercase`]: #method.make_ascii_uppercase
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn to_ascii_uppercase(&self) -> u8 {
|
2019-03-19 00:50:26 +01:00
|
|
|
// Unset the fith bit if this is a lowercase letter
|
|
|
|
|
*self & !((self.is_ascii_lowercase() as u8) << 5)
|
2017-08-22 19:45:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Makes a copy of the value in its ASCII lower case equivalent.
|
|
|
|
|
///
|
|
|
|
|
/// ASCII letters 'A' to 'Z' are mapped to 'a' to 'z',
|
|
|
|
|
/// but non-ASCII letters are unchanged.
|
|
|
|
|
///
|
|
|
|
|
/// To lowercase the value in-place, use [`make_ascii_lowercase`].
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = 65u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(97, uppercase_a.to_ascii_lowercase());
|
|
|
|
|
/// ```
|
|
|
|
|
///
|
|
|
|
|
/// [`make_ascii_lowercase`]: #method.make_ascii_lowercase
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn to_ascii_lowercase(&self) -> u8 {
|
2019-03-19 00:50:26 +01:00
|
|
|
// Set the fith bit if this is an uppercase letter
|
|
|
|
|
*self | ((self.is_ascii_uppercase() as u8) << 5)
|
2017-08-22 19:45:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks that two values are an ASCII case-insensitive match.
|
|
|
|
|
///
|
2017-09-29 16:54:24 +02:00
|
|
|
/// This is equivalent to `to_ascii_lowercase(a) == to_ascii_lowercase(b)`.
|
2017-08-22 19:45:36 +02:00
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let lowercase_a = 97u8;
|
|
|
|
|
/// let uppercase_a = 65u8;
|
|
|
|
|
///
|
2017-09-28 16:41:21 +02:00
|
|
|
/// assert!(lowercase_a.eq_ignore_ascii_case(&uppercase_a));
|
2017-08-22 19:45:36 +02:00
|
|
|
/// ```
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
2017-09-28 16:41:21 +02:00
|
|
|
pub fn eq_ignore_ascii_case(&self, other: &u8) -> bool {
|
2017-08-22 19:45:36 +02:00
|
|
|
self.to_ascii_lowercase() == other.to_ascii_lowercase()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Converts this value to its ASCII upper case equivalent in-place.
|
|
|
|
|
///
|
|
|
|
|
/// ASCII letters 'a' to 'z' are mapped to 'A' to 'Z',
|
|
|
|
|
/// but non-ASCII letters are unchanged.
|
|
|
|
|
///
|
|
|
|
|
/// To return a new uppercased value without modifying the existing one, use
|
|
|
|
|
/// [`to_ascii_uppercase`].
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let mut byte = b'a';
|
|
|
|
|
///
|
|
|
|
|
/// byte.make_ascii_uppercase();
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(b'A', byte);
|
|
|
|
|
/// ```
|
|
|
|
|
///
|
|
|
|
|
/// [`to_ascii_uppercase`]: #method.to_ascii_uppercase
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn make_ascii_uppercase(&mut self) {
|
|
|
|
|
*self = self.to_ascii_uppercase();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Converts this value to its ASCII lower case equivalent in-place.
|
|
|
|
|
///
|
|
|
|
|
/// ASCII letters 'A' to 'Z' are mapped to 'a' to 'z',
|
|
|
|
|
/// but non-ASCII letters are unchanged.
|
|
|
|
|
///
|
|
|
|
|
/// To return a new lowercased value without modifying the existing one, use
|
|
|
|
|
/// [`to_ascii_lowercase`].
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let mut byte = b'A';
|
|
|
|
|
///
|
|
|
|
|
/// byte.make_ascii_lowercase();
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(b'a', byte);
|
|
|
|
|
/// ```
|
|
|
|
|
///
|
|
|
|
|
/// [`to_ascii_lowercase`]: #method.to_ascii_lowercase
|
2017-11-30 11:20:11 -08:00
|
|
|
#[stable(feature = "ascii_methods_on_intrinsics", since = "1.23.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn make_ascii_lowercase(&mut self) {
|
|
|
|
|
*self = self.to_ascii_lowercase();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII alphabetic character:
|
|
|
|
|
///
|
|
|
|
|
/// - U+0041 'A' ... U+005A 'Z', or
|
|
|
|
|
/// - U+0061 'a' ... U+007A 'z'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(uppercase_a.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(uppercase_g.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(a.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(g.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(!zero.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(!percent.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(!space.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(!lf.is_ascii_alphabetic());
|
|
|
|
|
/// assert!(!esc.is_ascii_alphabetic());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_alphabetic(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'A'..=b'Z' | b'a'..=b'z' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII uppercase character:
|
|
|
|
|
/// U+0041 'A' ... U+005A 'Z'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(uppercase_a.is_ascii_uppercase());
|
|
|
|
|
/// assert!(uppercase_g.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!a.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!g.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!zero.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!percent.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!space.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!lf.is_ascii_uppercase());
|
|
|
|
|
/// assert!(!esc.is_ascii_uppercase());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_uppercase(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'A'..=b'Z' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII lowercase character:
|
|
|
|
|
/// U+0061 'a' ... U+007A 'z'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(!uppercase_a.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_lowercase());
|
|
|
|
|
/// assert!(a.is_ascii_lowercase());
|
|
|
|
|
/// assert!(g.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!zero.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!percent.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!space.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!lf.is_ascii_lowercase());
|
|
|
|
|
/// assert!(!esc.is_ascii_lowercase());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_lowercase(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'a'..=b'z' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII alphanumeric character:
|
|
|
|
|
///
|
2017-09-29 18:34:39 +02:00
|
|
|
/// - U+0041 'A' ... U+005A 'Z', or
|
|
|
|
|
/// - U+0061 'a' ... U+007A 'z', or
|
2017-08-22 19:45:36 +02:00
|
|
|
/// - U+0030 '0' ... U+0039 '9'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(uppercase_a.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(uppercase_g.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(a.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(g.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(zero.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(!percent.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(!space.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(!lf.is_ascii_alphanumeric());
|
|
|
|
|
/// assert!(!esc.is_ascii_alphanumeric());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_alphanumeric(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'0'..=b'9' | b'A'..=b'Z' | b'a'..=b'z' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII decimal digit:
|
|
|
|
|
/// U+0030 '0' ... U+0039 '9'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(!uppercase_a.is_ascii_digit());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_digit());
|
|
|
|
|
/// assert!(!a.is_ascii_digit());
|
|
|
|
|
/// assert!(!g.is_ascii_digit());
|
|
|
|
|
/// assert!(zero.is_ascii_digit());
|
|
|
|
|
/// assert!(!percent.is_ascii_digit());
|
|
|
|
|
/// assert!(!space.is_ascii_digit());
|
|
|
|
|
/// assert!(!lf.is_ascii_digit());
|
|
|
|
|
/// assert!(!esc.is_ascii_digit());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_digit(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'0'..=b'9' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII hexadecimal digit:
|
|
|
|
|
///
|
2017-09-29 18:34:39 +02:00
|
|
|
/// - U+0030 '0' ... U+0039 '9', or
|
|
|
|
|
/// - U+0041 'A' ... U+0046 'F', or
|
2017-08-22 19:45:36 +02:00
|
|
|
/// - U+0061 'a' ... U+0066 'f'.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(uppercase_a.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(a.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!g.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(zero.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!percent.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!space.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!lf.is_ascii_hexdigit());
|
|
|
|
|
/// assert!(!esc.is_ascii_hexdigit());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_hexdigit(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'0'..=b'9' | b'A'..=b'F' | b'a'..=b'f' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII punctuation character:
|
|
|
|
|
///
|
|
|
|
|
/// - U+0021 ... U+002F `! " # $ % & ' ( ) * + , - . /`, or
|
|
|
|
|
/// - U+003A ... U+0040 `: ; < = > ? @`, or
|
2017-11-14 17:22:57 +08:00
|
|
|
/// - U+005B ... U+0060 ``[ \ ] ^ _ ` ``, or
|
2017-08-22 19:45:36 +02:00
|
|
|
/// - U+007B ... U+007E `{ | } ~`
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(!uppercase_a.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!a.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!g.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!zero.is_ascii_punctuation());
|
|
|
|
|
/// assert!(percent.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!space.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!lf.is_ascii_punctuation());
|
|
|
|
|
/// assert!(!esc.is_ascii_punctuation());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_punctuation(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'!'..=b'/' | b':'..=b'@' | b'['..=b'`' | b'{'..=b'~' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII graphic character:
|
2018-02-24 23:48:51 -06:00
|
|
|
/// U+0021 '!' ... U+007E '~'.
|
2017-08-22 19:45:36 +02:00
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(uppercase_a.is_ascii_graphic());
|
|
|
|
|
/// assert!(uppercase_g.is_ascii_graphic());
|
|
|
|
|
/// assert!(a.is_ascii_graphic());
|
|
|
|
|
/// assert!(g.is_ascii_graphic());
|
|
|
|
|
/// assert!(zero.is_ascii_graphic());
|
|
|
|
|
/// assert!(percent.is_ascii_graphic());
|
|
|
|
|
/// assert!(!space.is_ascii_graphic());
|
|
|
|
|
/// assert!(!lf.is_ascii_graphic());
|
|
|
|
|
/// assert!(!esc.is_ascii_graphic());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_graphic(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'!'..=b'~' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII whitespace character:
|
|
|
|
|
/// U+0020 SPACE, U+0009 HORIZONTAL TAB, U+000A LINE FEED,
|
|
|
|
|
/// U+000C FORM FEED, or U+000D CARRIAGE RETURN.
|
|
|
|
|
///
|
|
|
|
|
/// Rust uses the WhatWG Infra Standard's [definition of ASCII
|
|
|
|
|
/// whitespace][infra-aw]. There are several other definitions in
|
|
|
|
|
/// wide use. For instance, [the POSIX locale][pct] includes
|
|
|
|
|
/// U+000B VERTICAL TAB as well as all the above characters,
|
|
|
|
|
/// but—from the very same specification—[the default rule for
|
|
|
|
|
/// "field splitting" in the Bourne shell][bfs] considers *only*
|
|
|
|
|
/// SPACE, HORIZONTAL TAB, and LINE FEED as whitespace.
|
|
|
|
|
///
|
|
|
|
|
/// If you are writing a program that will process an existing
|
|
|
|
|
/// file format, check what that format's definition of whitespace is
|
|
|
|
|
/// before using this function.
|
|
|
|
|
///
|
|
|
|
|
/// [infra-aw]: https://infra.spec.whatwg.org/#ascii-whitespace
|
|
|
|
|
/// [pct]: http://pubs.opengroup.org/onlinepubs/9699919799/basedefs/V1_chap07.html#tag_07_03_01
|
|
|
|
|
/// [bfs]: http://pubs.opengroup.org/onlinepubs/9699919799/utilities/V3_chap02.html#tag_18_06_05
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(!uppercase_a.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!a.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!g.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!zero.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!percent.is_ascii_whitespace());
|
|
|
|
|
/// assert!(space.is_ascii_whitespace());
|
|
|
|
|
/// assert!(lf.is_ascii_whitespace());
|
|
|
|
|
/// assert!(!esc.is_ascii_whitespace());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_whitespace(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
|
|
|
|
b'\t' | b'\n' | b'\x0C' | b'\r' | b' ' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Checks if the value is an ASCII control character:
|
|
|
|
|
/// U+0000 NUL ... U+001F UNIT SEPARATOR, or U+007F DELETE.
|
|
|
|
|
/// Note that most ASCII whitespace characters are control
|
|
|
|
|
/// characters, but SPACE is not.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let uppercase_a = b'A';
|
|
|
|
|
/// let uppercase_g = b'G';
|
|
|
|
|
/// let a = b'a';
|
|
|
|
|
/// let g = b'g';
|
|
|
|
|
/// let zero = b'0';
|
|
|
|
|
/// let percent = b'%';
|
|
|
|
|
/// let space = b' ';
|
|
|
|
|
/// let lf = b'\n';
|
|
|
|
|
/// let esc = 0x1b_u8;
|
|
|
|
|
///
|
|
|
|
|
/// assert!(!uppercase_a.is_ascii_control());
|
|
|
|
|
/// assert!(!uppercase_g.is_ascii_control());
|
|
|
|
|
/// assert!(!a.is_ascii_control());
|
|
|
|
|
/// assert!(!g.is_ascii_control());
|
|
|
|
|
/// assert!(!zero.is_ascii_control());
|
|
|
|
|
/// assert!(!percent.is_ascii_control());
|
|
|
|
|
/// assert!(!space.is_ascii_control());
|
|
|
|
|
/// assert!(lf.is_ascii_control());
|
|
|
|
|
/// assert!(esc.is_ascii_control());
|
|
|
|
|
/// ```
|
2017-11-28 08:50:40 +01:00
|
|
|
#[stable(feature = "ascii_ctype_on_intrinsics", since = "1.24.0")]
|
2017-08-22 19:45:36 +02:00
|
|
|
#[inline]
|
|
|
|
|
pub fn is_ascii_control(&self) -> bool {
|
2019-03-18 23:57:09 +01:00
|
|
|
match *self {
|
2019-04-15 11:23:21 +09:00
|
|
|
b'\0'..=b'\x1F' | b'\x7F' => true,
|
2017-08-22 19:45:36 +02:00
|
|
|
_ => false
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "u16"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl u16 {
|
2018-08-17 22:20:09 +02:00
|
|
|
uint_impl! { u16, u16, 16, 65535, "", "", 4, "0xa003", "0x3a", "0x1234", "0x3412", "0x2c48",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x34, 0x12]", "[0x12, 0x34]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "u32"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl u32 {
|
2018-08-10 06:53:07 +02:00
|
|
|
uint_impl! { u32, u32, 32, 4294967295, "", "", 8, "0x10000b3", "0xb301", "0x12345678",
|
2019-04-15 00:00:50 +01:00
|
|
|
"0x78563412", "0x1e6a2c48", "[0x78, 0x56, 0x34, 0x12]", "[0x12, 0x34, 0x56, 0x78]", "", "" }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[lang = "u64"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl u64 {
|
2018-08-10 06:53:07 +02:00
|
|
|
uint_impl! { u64, u64, 64, 18446744073709551615, "", "", 12, "0xaa00000000006e1", "0x6e10aa",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x1234567890123456", "0x5634129078563412", "0x6a2c48091e6a2c48",
|
|
|
|
|
"[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]",
|
|
|
|
|
"", ""}
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2016-08-23 03:56:52 +03:00
|
|
|
#[lang = "u128"]
|
|
|
|
|
impl u128 {
|
2018-08-08 23:42:33 +02:00
|
|
|
uint_impl! { u128, u128, 128, 340282366920938463463374607431768211455, "", "", 16,
|
2018-08-10 06:53:07 +02:00
|
|
|
"0x13f40000000000000000000000004f76", "0x4f7613f4", "0x12345678901234567890123456789012",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x12907856341290785634129078563412", "0x48091e6a2c48091e6a2c48091e6a2c48",
|
|
|
|
|
"[0x12, 0x90, 0x78, 0x56, 0x34, 0x12, 0x90, 0x78, \
|
|
|
|
|
0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
|
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56, \
|
2019-04-15 00:00:50 +01:00
|
|
|
0x78, 0x90, 0x12, 0x34, 0x56, 0x78, 0x90, 0x12]",
|
|
|
|
|
"", ""}
|
2016-08-23 03:56:52 +03:00
|
|
|
}
|
|
|
|
|
|
2016-05-06 09:31:11 -04:00
|
|
|
#[cfg(target_pointer_width = "16")]
|
|
|
|
|
#[lang = "usize"]
|
|
|
|
|
impl usize {
|
2019-04-16 18:55:58 +02:00
|
|
|
uint_impl! { usize, u16, 16, 65535, "", "", 4, "0xa003", "0x3a", "0x1234", "0x3412", "0x2c48",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x34, 0x12]", "[0x12, 0x34]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2016-05-06 09:31:11 -04:00
|
|
|
}
|
2015-03-18 09:36:18 -07:00
|
|
|
#[cfg(target_pointer_width = "32")]
|
|
|
|
|
#[lang = "usize"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl usize {
|
2018-08-10 06:53:07 +02:00
|
|
|
uint_impl! { usize, u32, 32, 4294967295, "", "", 8, "0x10000b3", "0xb301", "0x12345678",
|
2019-04-15 00:00:50 +01:00
|
|
|
"0x78563412", "0x1e6a2c48", "[0x78, 0x56, 0x34, 0x12]", "[0x12, 0x34, 0x56, 0x78]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2015-03-18 09:36:18 -07:00
|
|
|
#[cfg(target_pointer_width = "64")]
|
|
|
|
|
#[lang = "usize"]
|
2015-10-25 20:51:51 -07:00
|
|
|
impl usize {
|
2018-08-10 06:53:07 +02:00
|
|
|
uint_impl! { usize, u64, 64, 18446744073709551615, "", "", 12, "0xaa00000000006e1", "0x6e10aa",
|
2018-08-17 22:20:09 +02:00
|
|
|
"0x1234567890123456", "0x5634129078563412", "0x6a2c48091e6a2c48",
|
|
|
|
|
"[0x56, 0x34, 0x12, 0x90, 0x78, 0x56, 0x34, 0x12]",
|
2019-04-15 00:00:50 +01:00
|
|
|
"[0x12, 0x34, 0x56, 0x78, 0x90, 0x12, 0x34, 0x56]",
|
|
|
|
|
usize_isize_to_xe_bytes_doc!(), usize_isize_from_xe_bytes_doc!() }
|
2015-10-25 20:51:51 -07:00
|
|
|
}
|
2015-03-10 23:13:40 -05:00
|
|
|
|
2016-02-09 14:06:24 -05:00
|
|
|
/// A classification of floating point numbers.
|
|
|
|
|
///
|
2017-03-12 14:04:52 -04:00
|
|
|
/// This `enum` is used as the return type for [`f32::classify`] and [`f64::classify`]. See
|
2016-02-09 14:06:24 -05:00
|
|
|
/// their documentation for more.
|
|
|
|
|
///
|
2017-03-12 14:04:52 -04:00
|
|
|
/// [`f32::classify`]: ../../std/primitive.f32.html#method.classify
|
|
|
|
|
/// [`f64::classify`]: ../../std/primitive.f64.html#method.classify
|
2016-07-13 17:32:23 +02:00
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// use std::num::FpCategory;
|
|
|
|
|
/// use std::f32;
|
|
|
|
|
///
|
|
|
|
|
/// let num = 12.4_f32;
|
|
|
|
|
/// let inf = f32::INFINITY;
|
|
|
|
|
/// let zero = 0f32;
|
2016-07-15 17:51:27 +02:00
|
|
|
/// let sub: f32 = 1.1754942e-38;
|
2016-07-13 17:32:23 +02:00
|
|
|
/// let nan = f32::NAN;
|
|
|
|
|
///
|
|
|
|
|
/// assert_eq!(num.classify(), FpCategory::Normal);
|
|
|
|
|
/// assert_eq!(inf.classify(), FpCategory::Infinite);
|
|
|
|
|
/// assert_eq!(zero.classify(), FpCategory::Zero);
|
|
|
|
|
/// assert_eq!(nan.classify(), FpCategory::Nan);
|
|
|
|
|
/// assert_eq!(sub.classify(), FpCategory::Subnormal);
|
|
|
|
|
/// ```
|
2016-09-12 21:37:41 +02:00
|
|
|
#[derive(Copy, Clone, PartialEq, Eq, Debug)]
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2014-12-22 22:50:57 +01:00
|
|
|
pub enum FpCategory {
|
2016-07-13 17:32:23 +02:00
|
|
|
/// "Not a Number", often obtained by dividing by zero.
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2014-12-22 22:50:57 +01:00
|
|
|
Nan,
|
2015-03-19 23:42:18 -07:00
|
|
|
|
2016-07-13 17:32:23 +02:00
|
|
|
/// Positive or negative infinity.
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2016-10-12 23:57:46 +05:30
|
|
|
Infinite,
|
2015-03-19 23:42:18 -07:00
|
|
|
|
2016-07-13 17:32:23 +02:00
|
|
|
/// Positive or negative zero.
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2014-12-22 22:50:57 +01:00
|
|
|
Zero,
|
2015-03-19 23:42:18 -07:00
|
|
|
|
2016-07-13 17:32:23 +02:00
|
|
|
/// De-normalized floating point representation (less precise than `Normal`).
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2014-12-22 22:50:57 +01:00
|
|
|
Subnormal,
|
2015-03-19 23:42:18 -07:00
|
|
|
|
2016-07-13 17:32:23 +02:00
|
|
|
/// A regular floating point number.
|
2015-03-19 23:42:18 -07:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2014-12-22 22:50:57 +01:00
|
|
|
Normal,
|
2014-05-10 13:25:49 -07:00
|
|
|
}
|
|
|
|
|
|
2014-11-15 17:02:38 +11:00
|
|
|
macro_rules! from_str_radix_int_impl {
|
2015-05-21 14:04:13 -04:00
|
|
|
($($t:ty)*) => {$(
|
2015-01-27 22:52:32 -08:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2015-05-21 14:04:13 -04:00
|
|
|
impl FromStr for $t {
|
2015-01-27 22:52:32 -08:00
|
|
|
type Err = ParseIntError;
|
2015-05-21 14:01:44 -04:00
|
|
|
fn from_str(src: &str) -> Result<Self, ParseIntError> {
|
2014-11-15 17:02:38 +11:00
|
|
|
from_str_radix(src, 10)
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-04-17 15:32:42 -07:00
|
|
|
)*}
|
|
|
|
|
}
|
2017-02-01 15:57:50 -08:00
|
|
|
from_str_radix_int_impl! { isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 }
|
2014-11-15 17:02:38 +11:00
|
|
|
|
2016-05-04 22:42:14 -07:00
|
|
|
/// The error type returned when a checked integral type conversion fails.
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2018-08-18 23:24:25 +02:00
|
|
|
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
|
2016-05-04 22:42:14 -07:00
|
|
|
pub struct TryFromIntError(());
|
|
|
|
|
|
|
|
|
|
impl TryFromIntError {
|
|
|
|
|
#[unstable(feature = "int_error_internals",
|
|
|
|
|
reason = "available through Error trait and this method should \
|
|
|
|
|
not be exposed publicly",
|
|
|
|
|
issue = "0")]
|
|
|
|
|
#[doc(hidden)]
|
|
|
|
|
pub fn __description(&self) -> &str {
|
|
|
|
|
"out of range integral type conversion attempted"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2016-05-04 22:42:14 -07:00
|
|
|
impl fmt::Display for TryFromIntError {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2016-05-04 22:42:14 -07:00
|
|
|
self.__description().fmt(fmt)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2019-02-08 14:55:44 +01:00
|
|
|
impl From<Infallible> for TryFromIntError {
|
|
|
|
|
fn from(x: Infallible) -> TryFromIntError {
|
|
|
|
|
match x {}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[unstable(feature = "never_type", issue = "35121")]
|
2018-03-15 14:14:48 +08:00
|
|
|
impl From<!> for TryFromIntError {
|
|
|
|
|
fn from(never: !) -> TryFromIntError {
|
2019-02-08 14:55:44 +01:00
|
|
|
// Match rather than coerce to make sure that code like
|
|
|
|
|
// `From<Infallible> for TryFromIntError` above will keep working
|
|
|
|
|
// when `Infallible` becomes an alias to `!`.
|
|
|
|
|
match never {}
|
2018-03-15 14:14:48 +08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-06-06 12:54:25 +02:00
|
|
|
// no possible bounds violation
|
|
|
|
|
macro_rules! try_from_unbounded {
|
|
|
|
|
($source:ty, $($target:ty),*) => {$(
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2018-06-06 12:54:25 +02:00
|
|
|
impl TryFrom<$source> for $target {
|
|
|
|
|
type Error = TryFromIntError;
|
|
|
|
|
|
2019-02-26 23:47:55 -05:00
|
|
|
/// Try to create the target number type from a source
|
2019-02-27 09:54:37 -05:00
|
|
|
/// number type. This returns an error if the source value
|
|
|
|
|
/// is outside of the range of the target type.
|
2018-06-06 12:54:25 +02:00
|
|
|
#[inline]
|
|
|
|
|
fn try_from(value: $source) -> Result<Self, Self::Error> {
|
|
|
|
|
Ok(value as $target)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
)*}
|
|
|
|
|
}
|
|
|
|
|
|
2017-07-15 08:35:25 +02:00
|
|
|
// only negative bounds
|
|
|
|
|
macro_rules! try_from_lower_bounded {
|
|
|
|
|
($source:ty, $($target:ty),*) => {$(
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2017-07-15 08:35:25 +02:00
|
|
|
impl TryFrom<$source> for $target {
|
|
|
|
|
type Error = TryFromIntError;
|
|
|
|
|
|
2019-02-26 23:47:55 -05:00
|
|
|
/// Try to create the target number type from a source
|
2019-02-27 09:54:37 -05:00
|
|
|
/// number type. This returns an error if the source value
|
|
|
|
|
/// is outside of the range of the target type.
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
|
|
|
|
fn try_from(u: $source) -> Result<$target, TryFromIntError> {
|
|
|
|
|
if u >= 0 {
|
2016-05-04 22:42:14 -07:00
|
|
|
Ok(u as $target)
|
2017-07-15 08:35:25 +02:00
|
|
|
} else {
|
|
|
|
|
Err(TryFromIntError(()))
|
2016-05-04 22:42:14 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
)*}
|
|
|
|
|
}
|
|
|
|
|
|
2017-07-15 08:35:25 +02:00
|
|
|
// unsigned to signed (only positive bound)
|
|
|
|
|
macro_rules! try_from_upper_bounded {
|
|
|
|
|
($source:ty, $($target:ty),*) => {$(
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2017-07-15 08:35:25 +02:00
|
|
|
impl TryFrom<$source> for $target {
|
2017-03-05 13:00:32 -08:00
|
|
|
type Error = TryFromIntError;
|
2016-05-04 22:42:14 -07:00
|
|
|
|
2019-02-26 23:47:55 -05:00
|
|
|
/// Try to create the target number type from a source
|
2019-02-27 09:54:37 -05:00
|
|
|
/// number type. This returns an error if the source value
|
|
|
|
|
/// is outside of the range of the target type.
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
|
|
|
|
fn try_from(u: $source) -> Result<$target, TryFromIntError> {
|
|
|
|
|
if u > (<$target>::max_value() as $source) {
|
2016-05-04 22:42:14 -07:00
|
|
|
Err(TryFromIntError(()))
|
|
|
|
|
} else {
|
2017-07-15 08:35:25 +02:00
|
|
|
Ok(u as $target)
|
2016-05-04 22:42:14 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2017-07-15 08:35:25 +02:00
|
|
|
)*}
|
|
|
|
|
}
|
2016-05-04 22:42:14 -07:00
|
|
|
|
2017-07-15 08:35:25 +02:00
|
|
|
// all other cases
|
|
|
|
|
macro_rules! try_from_both_bounded {
|
|
|
|
|
($source:ty, $($target:ty),*) => {$(
|
2019-02-08 15:00:47 +01:00
|
|
|
#[stable(feature = "try_from", since = "1.34.0")]
|
2017-07-15 08:35:25 +02:00
|
|
|
impl TryFrom<$source> for $target {
|
2017-03-05 13:00:32 -08:00
|
|
|
type Error = TryFromIntError;
|
2016-05-04 22:42:14 -07:00
|
|
|
|
2019-02-26 23:47:55 -05:00
|
|
|
/// Try to create the target number type from a source
|
2019-02-27 09:54:37 -05:00
|
|
|
/// number type. This returns an error if the source value
|
|
|
|
|
/// is outside of the range of the target type.
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
|
|
|
|
fn try_from(u: $source) -> Result<$target, TryFromIntError> {
|
|
|
|
|
let min = <$target>::min_value() as $source;
|
|
|
|
|
let max = <$target>::max_value() as $source;
|
|
|
|
|
if u < min || u > max {
|
2016-05-04 22:42:14 -07:00
|
|
|
Err(TryFromIntError(()))
|
|
|
|
|
} else {
|
2017-07-15 08:35:25 +02:00
|
|
|
Ok(u as $target)
|
2016-05-04 22:42:14 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
)*}
|
|
|
|
|
}
|
|
|
|
|
|
2017-07-15 08:35:25 +02:00
|
|
|
macro_rules! rev {
|
|
|
|
|
($mac:ident, $source:ty, $($target:ty),*) => {$(
|
|
|
|
|
$mac!($target, $source);
|
|
|
|
|
)*}
|
|
|
|
|
}
|
|
|
|
|
|
2019-01-24 15:49:03 -05:00
|
|
|
// intra-sign conversions
|
2017-07-15 08:35:25 +02:00
|
|
|
try_from_upper_bounded!(u16, u8);
|
|
|
|
|
try_from_upper_bounded!(u32, u16, u8);
|
|
|
|
|
try_from_upper_bounded!(u64, u32, u16, u8);
|
|
|
|
|
try_from_upper_bounded!(u128, u64, u32, u16, u8);
|
|
|
|
|
|
|
|
|
|
try_from_both_bounded!(i16, i8);
|
|
|
|
|
try_from_both_bounded!(i32, i16, i8);
|
|
|
|
|
try_from_both_bounded!(i64, i32, i16, i8);
|
|
|
|
|
try_from_both_bounded!(i128, i64, i32, i16, i8);
|
|
|
|
|
|
|
|
|
|
// unsigned-to-signed
|
|
|
|
|
try_from_upper_bounded!(u8, i8);
|
|
|
|
|
try_from_upper_bounded!(u16, i8, i16);
|
|
|
|
|
try_from_upper_bounded!(u32, i8, i16, i32);
|
|
|
|
|
try_from_upper_bounded!(u64, i8, i16, i32, i64);
|
|
|
|
|
try_from_upper_bounded!(u128, i8, i16, i32, i64, i128);
|
|
|
|
|
|
|
|
|
|
// signed-to-unsigned
|
|
|
|
|
try_from_lower_bounded!(i8, u8, u16, u32, u64, u128);
|
|
|
|
|
try_from_lower_bounded!(i16, u16, u32, u64, u128);
|
|
|
|
|
try_from_lower_bounded!(i32, u32, u64, u128);
|
|
|
|
|
try_from_lower_bounded!(i64, u64, u128);
|
|
|
|
|
try_from_lower_bounded!(i128, u128);
|
|
|
|
|
try_from_both_bounded!(i16, u8);
|
|
|
|
|
try_from_both_bounded!(i32, u16, u8);
|
|
|
|
|
try_from_both_bounded!(i64, u32, u16, u8);
|
|
|
|
|
try_from_both_bounded!(i128, u64, u32, u16, u8);
|
|
|
|
|
|
2017-07-25 06:19:30 +01:00
|
|
|
// usize/isize
|
|
|
|
|
try_from_upper_bounded!(usize, isize);
|
|
|
|
|
try_from_lower_bounded!(isize, usize);
|
2017-07-15 08:35:25 +02:00
|
|
|
|
|
|
|
|
#[cfg(target_pointer_width = "16")]
|
|
|
|
|
mod ptr_try_from_impls {
|
|
|
|
|
use super::TryFromIntError;
|
2019-04-15 11:23:21 +09:00
|
|
|
use crate::convert::TryFrom;
|
2017-07-15 08:35:25 +02:00
|
|
|
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_upper_bounded!(usize, u8);
|
|
|
|
|
try_from_unbounded!(usize, u16, u32, u64, u128);
|
|
|
|
|
try_from_upper_bounded!(usize, i8, i16);
|
|
|
|
|
try_from_unbounded!(usize, i32, i64, i128);
|
|
|
|
|
|
|
|
|
|
try_from_both_bounded!(isize, u8);
|
2017-07-25 06:19:30 +01:00
|
|
|
try_from_lower_bounded!(isize, u16, u32, u64, u128);
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_both_bounded!(isize, i8);
|
|
|
|
|
try_from_unbounded!(isize, i16, i32, i64, i128);
|
|
|
|
|
|
|
|
|
|
rev!(try_from_upper_bounded, usize, u32, u64, u128);
|
2017-07-15 08:35:25 +02:00
|
|
|
rev!(try_from_lower_bounded, usize, i8, i16);
|
|
|
|
|
rev!(try_from_both_bounded, usize, i32, i64, i128);
|
2018-06-06 12:54:25 +02:00
|
|
|
|
|
|
|
|
rev!(try_from_upper_bounded, isize, u16, u32, u64, u128);
|
|
|
|
|
rev!(try_from_both_bounded, isize, i32, i64, i128);
|
2017-07-15 08:35:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[cfg(target_pointer_width = "32")]
|
|
|
|
|
mod ptr_try_from_impls {
|
|
|
|
|
use super::TryFromIntError;
|
2019-04-15 11:23:21 +09:00
|
|
|
use crate::convert::TryFrom;
|
2017-07-15 08:35:25 +02:00
|
|
|
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_upper_bounded!(usize, u8, u16);
|
|
|
|
|
try_from_unbounded!(usize, u32, u64, u128);
|
|
|
|
|
try_from_upper_bounded!(usize, i8, i16, i32);
|
|
|
|
|
try_from_unbounded!(usize, i64, i128);
|
|
|
|
|
|
|
|
|
|
try_from_both_bounded!(isize, u8, u16);
|
2017-07-25 06:19:30 +01:00
|
|
|
try_from_lower_bounded!(isize, u32, u64, u128);
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_both_bounded!(isize, i8, i16);
|
|
|
|
|
try_from_unbounded!(isize, i32, i64, i128);
|
|
|
|
|
|
|
|
|
|
rev!(try_from_unbounded, usize, u32);
|
|
|
|
|
rev!(try_from_upper_bounded, usize, u64, u128);
|
2017-07-15 08:35:25 +02:00
|
|
|
rev!(try_from_lower_bounded, usize, i8, i16, i32);
|
|
|
|
|
rev!(try_from_both_bounded, usize, i64, i128);
|
2018-06-06 12:54:25 +02:00
|
|
|
|
|
|
|
|
rev!(try_from_unbounded, isize, u16);
|
|
|
|
|
rev!(try_from_upper_bounded, isize, u32, u64, u128);
|
|
|
|
|
rev!(try_from_unbounded, isize, i32);
|
|
|
|
|
rev!(try_from_both_bounded, isize, i64, i128);
|
2017-07-15 08:35:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[cfg(target_pointer_width = "64")]
|
|
|
|
|
mod ptr_try_from_impls {
|
|
|
|
|
use super::TryFromIntError;
|
2019-04-15 11:23:21 +09:00
|
|
|
use crate::convert::TryFrom;
|
2017-07-15 08:35:25 +02:00
|
|
|
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_upper_bounded!(usize, u8, u16, u32);
|
|
|
|
|
try_from_unbounded!(usize, u64, u128);
|
|
|
|
|
try_from_upper_bounded!(usize, i8, i16, i32, i64);
|
|
|
|
|
try_from_unbounded!(usize, i128);
|
|
|
|
|
|
|
|
|
|
try_from_both_bounded!(isize, u8, u16, u32);
|
2017-07-25 06:19:30 +01:00
|
|
|
try_from_lower_bounded!(isize, u64, u128);
|
2018-06-06 12:54:25 +02:00
|
|
|
try_from_both_bounded!(isize, i8, i16, i32);
|
|
|
|
|
try_from_unbounded!(isize, i64, i128);
|
|
|
|
|
|
|
|
|
|
rev!(try_from_unbounded, usize, u32, u64);
|
|
|
|
|
rev!(try_from_upper_bounded, usize, u128);
|
2017-07-15 08:35:25 +02:00
|
|
|
rev!(try_from_lower_bounded, usize, i8, i16, i32, i64);
|
|
|
|
|
rev!(try_from_both_bounded, usize, i128);
|
2018-06-06 12:54:25 +02:00
|
|
|
|
|
|
|
|
rev!(try_from_unbounded, isize, u16, u32);
|
|
|
|
|
rev!(try_from_upper_bounded, isize, u64, u128);
|
|
|
|
|
rev!(try_from_unbounded, isize, i32, i64);
|
|
|
|
|
rev!(try_from_both_bounded, isize, i128);
|
2017-07-15 08:35:25 +02:00
|
|
|
}
|
2016-08-23 03:56:52 +03:00
|
|
|
|
2015-04-17 15:32:42 -07:00
|
|
|
#[doc(hidden)]
|
|
|
|
|
trait FromStrRadixHelper: PartialOrd + Copy {
|
|
|
|
|
fn min_value() -> Self;
|
2016-05-04 22:42:14 -07:00
|
|
|
fn max_value() -> Self;
|
2015-04-17 15:32:42 -07:00
|
|
|
fn from_u32(u: u32) -> Self;
|
|
|
|
|
fn checked_mul(&self, other: u32) -> Option<Self>;
|
|
|
|
|
fn checked_sub(&self, other: u32) -> Option<Self>;
|
|
|
|
|
fn checked_add(&self, other: u32) -> Option<Self>;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
macro_rules! doit {
|
2015-05-21 14:04:13 -04:00
|
|
|
($($t:ty)*) => ($(impl FromStrRadixHelper for $t {
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2015-05-21 14:01:44 -04:00
|
|
|
fn min_value() -> Self { Self::min_value() }
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2016-05-04 22:42:14 -07:00
|
|
|
fn max_value() -> Self { Self::max_value() }
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2015-05-21 14:01:44 -04:00
|
|
|
fn from_u32(u: u32) -> Self { u as Self }
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2015-04-17 15:32:42 -07:00
|
|
|
fn checked_mul(&self, other: u32) -> Option<Self> {
|
2015-05-21 14:01:44 -04:00
|
|
|
Self::checked_mul(*self, other as Self)
|
2014-11-15 17:02:38 +11:00
|
|
|
}
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2015-04-17 15:32:42 -07:00
|
|
|
fn checked_sub(&self, other: u32) -> Option<Self> {
|
2015-05-21 14:01:44 -04:00
|
|
|
Self::checked_sub(*self, other as Self)
|
2015-04-17 15:32:42 -07:00
|
|
|
}
|
2017-07-15 08:35:25 +02:00
|
|
|
#[inline]
|
2015-04-17 15:32:42 -07:00
|
|
|
fn checked_add(&self, other: u32) -> Option<Self> {
|
2015-05-21 14:01:44 -04:00
|
|
|
Self::checked_add(*self, other as Self)
|
2015-04-17 15:32:42 -07:00
|
|
|
}
|
|
|
|
|
})*)
|
|
|
|
|
}
|
2017-02-01 15:57:50 -08:00
|
|
|
doit! { i8 i16 i32 i64 i128 isize u8 u16 u32 u64 u128 usize }
|
2015-04-17 15:32:42 -07:00
|
|
|
|
2016-10-12 23:57:46 +05:30
|
|
|
fn from_str_radix<T: FromStrRadixHelper>(src: &str, radix: u32) -> Result<T, ParseIntError> {
|
2015-04-17 15:32:42 -07:00
|
|
|
use self::IntErrorKind::*;
|
|
|
|
|
use self::ParseIntError as PIE;
|
2015-07-18 18:59:38 -03:00
|
|
|
|
2015-04-17 15:32:42 -07:00
|
|
|
assert!(radix >= 2 && radix <= 36,
|
|
|
|
|
"from_str_radix_int: must lie in the range `[2, 36]` - found {}",
|
|
|
|
|
radix);
|
|
|
|
|
|
2015-07-18 18:59:38 -03:00
|
|
|
if src.is_empty() {
|
|
|
|
|
return Err(PIE { kind: Empty });
|
|
|
|
|
}
|
|
|
|
|
|
2015-04-17 15:32:42 -07:00
|
|
|
let is_signed_ty = T::from_u32(0) > T::min_value();
|
|
|
|
|
|
2015-07-18 18:59:38 -03:00
|
|
|
// all valid digits are ascii, so we will just iterate over the utf8 bytes
|
|
|
|
|
// and cast them to chars. .to_digit() will safely return None for anything
|
2015-10-07 23:11:25 +01:00
|
|
|
// other than a valid ascii digit for the given radix, including the first-byte
|
2015-07-18 18:59:38 -03:00
|
|
|
// of multi-byte sequences
|
|
|
|
|
let src = src.as_bytes();
|
|
|
|
|
|
2015-10-03 12:35:35 -03:00
|
|
|
let (is_positive, digits) = match src[0] {
|
|
|
|
|
b'+' => (true, &src[1..]),
|
|
|
|
|
b'-' if is_signed_ty => (false, &src[1..]),
|
2016-10-12 23:57:46 +05:30
|
|
|
_ => (true, src),
|
2015-10-03 12:35:35 -03:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
if digits.is_empty() {
|
|
|
|
|
return Err(PIE { kind: Empty });
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
let mut result = T::from_u32(0);
|
|
|
|
|
if is_positive {
|
|
|
|
|
// The number is positive
|
|
|
|
|
for &c in digits {
|
|
|
|
|
let x = match (c as char).to_digit(radix) {
|
|
|
|
|
Some(x) => x,
|
2015-07-18 18:59:38 -03:00
|
|
|
None => return Err(PIE { kind: InvalidDigit }),
|
|
|
|
|
};
|
2015-10-03 12:35:35 -03:00
|
|
|
result = match result.checked_mul(radix) {
|
|
|
|
|
Some(result) => result,
|
|
|
|
|
None => return Err(PIE { kind: Overflow }),
|
|
|
|
|
};
|
|
|
|
|
result = match result.checked_add(x) {
|
|
|
|
|
Some(result) => result,
|
|
|
|
|
None => return Err(PIE { kind: Overflow }),
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
// The number is negative
|
|
|
|
|
for &c in digits {
|
|
|
|
|
let x = match (c as char).to_digit(radix) {
|
|
|
|
|
Some(x) => x,
|
|
|
|
|
None => return Err(PIE { kind: InvalidDigit }),
|
|
|
|
|
};
|
|
|
|
|
result = match result.checked_mul(radix) {
|
|
|
|
|
Some(result) => result,
|
|
|
|
|
None => return Err(PIE { kind: Underflow }),
|
|
|
|
|
};
|
|
|
|
|
result = match result.checked_sub(x) {
|
|
|
|
|
Some(result) => result,
|
|
|
|
|
None => return Err(PIE { kind: Underflow }),
|
|
|
|
|
};
|
2015-07-18 18:59:38 -03:00
|
|
|
}
|
2014-11-15 17:02:38 +11:00
|
|
|
}
|
2015-10-03 12:35:35 -03:00
|
|
|
Ok(result)
|
2014-11-15 17:02:38 +11:00
|
|
|
}
|
2015-01-27 22:52:32 -08:00
|
|
|
|
|
|
|
|
/// An error which can be returned when parsing an integer.
|
2016-02-09 14:06:24 -05:00
|
|
|
///
|
|
|
|
|
/// This error is used as the error type for the `from_str_radix()` functions
|
2017-03-12 14:04:52 -04:00
|
|
|
/// on the primitive integer types, such as [`i8::from_str_radix`].
|
2016-02-09 14:06:24 -05:00
|
|
|
///
|
2018-03-04 21:59:53 +01:00
|
|
|
/// # Potential causes
|
2016-02-09 14:06:24 -05:00
|
|
|
///
|
2018-03-05 14:33:37 +01:00
|
|
|
/// Among other causes, `ParseIntError` can be thrown because of leading or trailing whitespace
|
2018-11-27 02:59:49 +00:00
|
|
|
/// in the string e.g., when it is obtained from the standard input.
|
2018-03-04 21:59:53 +01:00
|
|
|
/// Using the [`str.trim()`] method ensures that no whitespace remains before parsing.
|
|
|
|
|
///
|
|
|
|
|
/// [`str.trim()`]: ../../std/primitive.str.html#method.trim
|
2017-03-12 14:04:52 -04:00
|
|
|
/// [`i8::from_str_radix`]: ../../std/primitive.i8.html#method.from_str_radix
|
2016-09-12 21:37:41 +02:00
|
|
|
#[derive(Debug, Clone, PartialEq, Eq)]
|
2015-01-27 22:52:32 -08:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2016-10-12 23:57:46 +05:30
|
|
|
pub struct ParseIntError {
|
|
|
|
|
kind: IntErrorKind,
|
|
|
|
|
}
|
2015-01-27 22:52:32 -08:00
|
|
|
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Enum to store the various types of errors that can cause parsing an integer to fail.
|
2018-11-05 21:22:45 +00:00
|
|
|
#[unstable(feature = "int_error_matching",
|
2018-11-05 21:37:10 +00:00
|
|
|
reason = "it can be useful to match errors when making error messages \
|
2018-11-05 21:57:19 +00:00
|
|
|
for integer parsing",
|
|
|
|
|
issue = "22639")]
|
2016-09-12 21:37:41 +02:00
|
|
|
#[derive(Debug, Clone, PartialEq, Eq)]
|
2018-11-05 21:22:45 +00:00
|
|
|
#[non_exhaustive]
|
2018-11-05 17:23:34 +00:00
|
|
|
pub enum IntErrorKind {
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Value being parsed is empty.
|
2018-11-06 08:37:25 +00:00
|
|
|
///
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Among other causes, this variant will be constructed when parsing an empty string.
|
2015-01-27 22:52:32 -08:00
|
|
|
Empty,
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Contains an invalid digit.
|
2018-11-06 08:37:25 +00:00
|
|
|
///
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Among other causes, this variant will be constructed when parsing a string that
|
|
|
|
|
/// contains a letter.
|
2015-01-27 22:52:32 -08:00
|
|
|
InvalidDigit,
|
2018-11-06 08:34:30 +00:00
|
|
|
/// Integer is too large to store in target integer type.
|
2015-01-27 22:52:32 -08:00
|
|
|
Overflow,
|
2018-11-07 08:38:34 +00:00
|
|
|
/// Integer is too small to store in target integer type.
|
2015-01-27 22:52:32 -08:00
|
|
|
Underflow,
|
2019-02-27 18:37:35 +01:00
|
|
|
/// Value was Zero
|
|
|
|
|
///
|
|
|
|
|
/// This variant will be emitted when the parsing string has a value of zero, which
|
|
|
|
|
/// would be illegal for non-zero types.
|
|
|
|
|
Zero,
|
2015-01-27 22:52:32 -08:00
|
|
|
}
|
|
|
|
|
|
2015-04-01 15:25:47 -04:00
|
|
|
impl ParseIntError {
|
2018-11-07 08:35:28 +00:00
|
|
|
/// Outputs the detailed cause of parsing an integer failing.
|
2018-11-07 08:48:37 +00:00
|
|
|
#[unstable(feature = "int_error_matching",
|
|
|
|
|
reason = "it can be useful to match errors when making error messages \
|
|
|
|
|
for integer parsing",
|
|
|
|
|
issue = "22639")]
|
2018-11-25 19:31:35 +00:00
|
|
|
pub fn kind(&self) -> &IntErrorKind {
|
2018-11-25 19:44:09 +00:00
|
|
|
&self.kind
|
2018-11-07 08:35:28 +00:00
|
|
|
}
|
2015-06-09 11:18:03 -07:00
|
|
|
#[unstable(feature = "int_error_internals",
|
|
|
|
|
reason = "available through Error trait and this method should \
|
2015-08-12 17:23:48 -07:00
|
|
|
not be exposed publicly",
|
|
|
|
|
issue = "0")]
|
2015-06-11 09:56:13 -07:00
|
|
|
#[doc(hidden)]
|
|
|
|
|
pub fn __description(&self) -> &str {
|
2015-01-27 22:52:32 -08:00
|
|
|
match self.kind {
|
|
|
|
|
IntErrorKind::Empty => "cannot parse integer from empty string",
|
|
|
|
|
IntErrorKind::InvalidDigit => "invalid digit found in string",
|
|
|
|
|
IntErrorKind::Overflow => "number too large to fit in target type",
|
|
|
|
|
IntErrorKind::Underflow => "number too small to fit in target type",
|
2019-02-27 18:37:35 +01:00
|
|
|
IntErrorKind::Zero => "number would be zero for non-zero type",
|
2015-01-27 22:52:32 -08:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-04-01 15:25:47 -04:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
|
impl fmt::Display for ParseIntError {
|
2019-04-19 01:37:12 +02:00
|
|
|
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
2015-06-11 09:56:13 -07:00
|
|
|
self.__description().fmt(f)
|
2015-04-01 15:25:47 -04:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-11-16 19:54:28 +03:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
2019-04-15 11:23:21 +09:00
|
|
|
pub use crate::num::dec2flt::ParseFloatError;
|
2015-10-15 05:23:44 +03:00
|
|
|
|
2015-10-17 16:27:31 -07:00
|
|
|
// Conversion traits for primitive integer and float types
|
2015-10-15 05:23:44 +03:00
|
|
|
// Conversions T -> T are covered by a blanket impl and therefore excluded
|
|
|
|
|
// Some conversions from and to usize/isize are not implemented due to portability concerns
|
|
|
|
|
macro_rules! impl_from {
|
2018-06-10 13:16:34 +02:00
|
|
|
($Small: ty, $Large: ty, #[$attr:meta], $doc: expr) => {
|
2017-05-20 08:38:39 +01:00
|
|
|
#[$attr]
|
2018-06-10 13:16:34 +02:00
|
|
|
#[doc = $doc]
|
2015-10-15 05:23:44 +03:00
|
|
|
impl From<$Small> for $Large {
|
|
|
|
|
#[inline]
|
|
|
|
|
fn from(small: $Small) -> $Large {
|
|
|
|
|
small as $Large
|
|
|
|
|
}
|
|
|
|
|
}
|
2018-06-10 13:16:34 +02:00
|
|
|
};
|
|
|
|
|
($Small: ty, $Large: ty, #[$attr:meta]) => {
|
|
|
|
|
impl_from!($Small,
|
|
|
|
|
$Large,
|
|
|
|
|
#[$attr],
|
|
|
|
|
concat!("Converts `",
|
|
|
|
|
stringify!($Small),
|
|
|
|
|
"` to `",
|
|
|
|
|
stringify!($Large),
|
|
|
|
|
"` losslessly."));
|
2015-10-15 05:23:44 +03:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-06-10 13:16:34 +02:00
|
|
|
macro_rules! impl_from_bool {
|
|
|
|
|
($target: ty, #[$attr:meta]) => {
|
|
|
|
|
impl_from!(bool, $target, #[$attr], concat!("Converts a `bool` to a `",
|
|
|
|
|
stringify!($target), "`. The resulting value is `0` for `false` and `1` for `true`
|
|
|
|
|
values.
|
|
|
|
|
|
|
|
|
|
# Examples
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
assert_eq!(", stringify!($target), "::from(true), 1);
|
|
|
|
|
assert_eq!(", stringify!($target), "::from(false), 0);
|
|
|
|
|
```"));
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
2018-05-08 21:38:22 -04:00
|
|
|
// Bool -> Any
|
2018-06-10 13:16:34 +02:00
|
|
|
impl_from_bool! { u8, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { u16, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { u32, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { u64, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { u128, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { usize, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { i8, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { i16, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { i32, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { i64, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { i128, #[stable(feature = "from_bool", since = "1.28.0")] }
|
|
|
|
|
impl_from_bool! { isize, #[stable(feature = "from_bool", since = "1.28.0")] }
|
2018-05-08 21:38:22 -04:00
|
|
|
|
2015-10-15 05:23:44 +03:00
|
|
|
// Unsigned -> Unsigned
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u8, u16, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u8, u32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u8, u64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u8, u128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u8, usize, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u16, u32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u16, u64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u16, u128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u32, u64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u32, u128, #[stable(feature = "i128", since = "1.26.0")] }
|
|
|
|
|
impl_from! { u64, u128, #[stable(feature = "i128", since = "1.26.0")] }
|
2015-10-15 05:23:44 +03:00
|
|
|
|
|
|
|
|
// Signed -> Signed
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { i8, i16, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { i8, i32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { i8, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { i8, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { i8, isize, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { i16, i32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { i16, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { i16, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { i32, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { i32, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
|
|
|
|
impl_from! { i64, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2015-10-15 05:23:44 +03:00
|
|
|
|
|
|
|
|
// Unsigned -> Signed
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u8, i16, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u8, i32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u8, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u8, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u16, i32, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
|
|
|
|
impl_from! { u16, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u16, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u32, i64, #[stable(feature = "lossless_int_conv", since = "1.5.0")] }
|
2018-03-17 11:46:31 -05:00
|
|
|
impl_from! { u32, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
|
|
|
|
impl_from! { u64, i128, #[stable(feature = "i128", since = "1.26.0")] }
|
2015-10-17 16:27:31 -07:00
|
|
|
|
2018-03-23 13:36:08 +01:00
|
|
|
// The C99 standard defines bounds on INTPTR_MIN, INTPTR_MAX, and UINTPTR_MAX
|
|
|
|
|
// which imply that pointer-sized integers must be at least 16 bits:
|
|
|
|
|
// https://port70.net/~nsz/c/c99/n1256.html#7.18.2.4
|
|
|
|
|
impl_from! { u16, usize, #[stable(feature = "lossless_iusize_conv", since = "1.26.0")] }
|
|
|
|
|
impl_from! { u8, isize, #[stable(feature = "lossless_iusize_conv", since = "1.26.0")] }
|
|
|
|
|
impl_from! { i16, isize, #[stable(feature = "lossless_iusize_conv", since = "1.26.0")] }
|
|
|
|
|
|
|
|
|
|
// RISC-V defines the possibility of a 128-bit address space (RV128).
|
|
|
|
|
|
|
|
|
|
// CHERI proposes 256-bit “capabilities”. Unclear if this would be relevant to usize/isize.
|
|
|
|
|
// https://www.cl.cam.ac.uk/research/security/ctsrd/pdfs/20171017a-cheri-poster.pdf
|
|
|
|
|
// http://www.csl.sri.com/users/neumann/2012resolve-cheri.pdf
|
|
|
|
|
|
|
|
|
|
|
2015-10-28 16:05:51 -07:00
|
|
|
// Note: integers can only be represented with full precision in a float if
|
|
|
|
|
// they fit in the significand, which is 24 bits in f32 and 53 bits in f64.
|
|
|
|
|
// Lossy float conversions are not implemented at this time.
|
|
|
|
|
|
2015-10-17 16:27:31 -07:00
|
|
|
// Signed -> Float
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { i8, f32, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { i8, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { i16, f32, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { i16, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { i32, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
2015-10-17 16:27:31 -07:00
|
|
|
|
|
|
|
|
// Unsigned -> Float
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { u8, f32, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { u8, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { u16, f32, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { u16, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
|
|
|
|
impl_from! { u32, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|
2015-10-17 16:27:31 -07:00
|
|
|
|
|
|
|
|
// Float -> Float
|
2017-05-20 08:38:39 +01:00
|
|
|
impl_from! { f32, f64, #[stable(feature = "lossless_float_conv", since = "1.6.0")] }
|