Files
rust/src/libcore/num/mod.rs

1568 lines
52 KiB
Rust
Raw Normal View History

// Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
2014-11-10 16:00:13 +11:00
//! Numeric traits and functions for the built-in numeric types.
2015-01-23 21:48:20 -08:00
#![stable(feature = "rust1", since = "1.0.0")]
2014-10-27 15:37:07 -07:00
#![allow(missing_docs)]
use self::wrapping::OverflowingOps;
use char::CharExt;
use cmp::{Eq, PartialOrd};
use fmt;
2014-11-15 17:02:38 +11:00
use intrinsics;
2015-01-07 11:33:42 +13:00
use marker::Copy;
use mem::size_of;
use option::Option::{self, Some, None};
use result::Result::{self, Ok, Err};
use str::{FromStr, StrExt};
/// 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.
#[stable(feature = "rust1", since = "1.0.0")]
#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Debug)]
pub struct Wrapping<T>(#[stable(feature = "rust1", since = "1.0.0")] pub T);
Add `core::num::wrapping` and fix overflow errors. Many of the core rust libraries have places that rely on integer wrapping behaviour. These places have been altered to use the wrapping_* methods: * core::hash::sip - A number of macros * core::str - The `maximal_suffix` method in `TwoWaySearcher` * rustc::util::nodemap - Implementation of FnvHash * rustc_back::sha2 - A number of macros and other places * rand::isaac - Isaac64Rng, changed to use the Wrapping helper type Some places had "benign" underflow. This is when underflow or overflow occurs, but the unspecified value is not used due to other conditions. * collections::bit::Bitv - underflow when `self.nbits` is zero. * collections::hash::{map,table} - Underflow when searching an empty table. Did cause undefined behaviour in this case due to an out-of-bounds ptr::offset based on the underflowed index. However the resulting pointers would never be read from. * syntax::ext::deriving::encodable - Underflow when calculating the index of the last field in a variant with no fields. These cases were altered to avoid the underflow, often by moving the underflowing operation to a place where underflow could not happen. There was one case that relied on the fact that unsigned arithmetic and two's complement arithmetic are identical with wrapping semantics. This was changed to use the wrapping_* methods. Finally, the calculation of variant discriminants could overflow if the preceeding discriminant was `U64_MAX`. The logic in `rustc::middle::ty` for this was altered to avoid the overflow completely, while the remaining places were changed to use wrapping methods. This is because `rustc::middle::ty::enum_variants` now throws an error when the calculated discriminant value overflows a `u64`. This behaviour can be triggered by the following code: ``` enum Foo { A = U64_MAX, B } ``` This commit also implements the remaining integer operators for Wrapped<T>.
2015-01-09 16:10:57 +13:00
pub mod wrapping;
pub mod flt2dec;
/// Types that have a "zero" value.
///
/// This trait is intended for use in conjunction with `Add`, as an identity:
/// `x + T::zero() == x`.
#[unstable(feature = "zero_one",
reason = "unsure of placement, wants to use associated constants")]
pub trait Zero {
/// The "zero" (usually, additive identity) for this type.
fn zero() -> Self;
}
/// Types that have a "one" value.
///
/// This trait is intended for use in conjunction with `Mul`, as an identity:
/// `x * T::one() == x`.
#[unstable(feature = "zero_one",
reason = "unsure of placement, wants to use associated constants")]
pub trait One {
/// The "one" (usually, multiplicative identity) for this type.
fn one() -> Self;
}
macro_rules! zero_one_impl {
($($t:ty)*) => ($(
impl Zero for $t {
#[inline]
2015-05-21 14:01:44 -04:00
fn zero() -> Self { 0 }
}
impl One for $t {
#[inline]
2015-05-21 14:01:44 -04:00
fn one() -> Self { 1 }
}
)*)
}
zero_one_impl! { u8 u16 u32 u64 usize i8 i16 i32 i64 isize }
macro_rules! zero_one_impl_float {
($($t:ty)*) => ($(
impl Zero for $t {
#[inline]
2015-05-21 14:01:44 -04:00
fn zero() -> Self { 0.0 }
}
impl One for $t {
#[inline]
2015-05-21 14:01:44 -04:00
fn one() -> Self { 1.0 }
}
)*)
}
zero_one_impl_float! { f32 f64 }
macro_rules! checked_op {
2015-05-21 14:01:44 -04:00
($U:ty, $op:path, $x:expr, $y:expr) => {{
let (result, overflowed) = unsafe { $op($x as $U, $y as $U) };
2015-05-21 14:01:44 -04:00
if overflowed { None } else { Some(result as Self) }
}}
}
/// Swapping a single byte is a no-op. This is marked as `unsafe` for
/// consistency with the other `bswap` intrinsics.
unsafe fn bswap8(x: u8) -> u8 { x }
2015-03-18 09:36:18 -07:00
// `Int` + `SignedInt` implemented for signed integers
macro_rules! int_impl {
2015-05-21 14:01:44 -04:00
($ActualT:ty, $UnsignedT:ty, $BITS:expr,
2015-03-18 09:36:18 -07:00
$add_with_overflow:path,
$sub_with_overflow:path,
$mul_with_overflow:path) => {
/// Returns the smallest value that can be represented by this integer type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn min_value() -> Self {
(-1 as Self) << ($BITS - 1)
}
/// Returns the largest value that can be represented by this integer type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn max_value() -> Self {
let min = Self::min_value(); !min
}
/// Converts a string slice in a given base to an integer.
///
/// Leading and trailing whitespace represent an error.
///
/// # Examples
///
/// ```
/// assert_eq!(u32::from_str_radix("A", 16), Ok(10));
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[allow(deprecated)]
2015-05-21 14:01:44 -04:00
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
/// Returns the number of ones in the binary representation of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b01001100u8;
///
/// assert_eq!(n.count_ones(), 3);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn count_ones(self) -> u32 { (self as $UnsignedT).count_ones() }
/// Returns the number of zeros in the binary representation of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b01001100u8;
///
/// assert_eq!(n.count_zeros(), 5);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn count_zeros(self) -> u32 {
(!self).count_ones()
}
2015-03-18 09:36:18 -07:00
/// Returns the number of leading zeros in the binary representation
/// of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b0101000u16;
///
/// assert_eq!(n.leading_zeros(), 10);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn leading_zeros(self) -> u32 {
(self as $UnsignedT).leading_zeros()
}
2015-03-18 09:36:18 -07:00
/// Returns the number of trailing zeros in the binary representation
/// of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b0101000u16;
///
/// assert_eq!(n.trailing_zeros(), 3);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn trailing_zeros(self) -> u32 {
(self as $UnsignedT).trailing_zeros()
}
2015-03-10 23:13:40 -05:00
2015-04-10 20:32:38 +03:00
/// Shifts the bits to the left by a specified amount, `n`,
2015-03-18 09:36:18 -07:00
/// wrapping the truncated bits to the end of the resulting integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0x3456789ABCDEF012u64;
///
/// assert_eq!(n.rotate_left(12), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
2015-05-21 14:01:44 -04:00
pub fn rotate_left(self, n: u32) -> Self {
(self as $UnsignedT).rotate_left(n) as Self
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-04-10 20:32:38 +03:00
/// Shifts the bits to the right by a specified amount, `n`,
2015-03-18 09:36:18 -07:00
/// wrapping the truncated bits to the beginning of the resulting
/// integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0xDEF0123456789ABCu64;
///
/// assert_eq!(n.rotate_right(12), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
2015-05-21 14:01:44 -04:00
pub fn rotate_right(self, n: u32) -> Self {
(self as $UnsignedT).rotate_right(n) as Self
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Reverses the byte order of the integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0xEFCDAB8967452301u64;
///
/// assert_eq!(n.swap_bytes(), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub 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
/// Converts an integer from big endian to the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On big endian this is a no-op. On little endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "big") {
/// assert_eq!(u64::from_be(n), n)
2015-03-18 09:36:18 -07:00
/// } else {
/// assert_eq!(u64::from_be(n), n.swap_bytes())
2015-03-18 09:36:18 -07:00
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn from_be(x: Self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "big") { x } else { x.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts an integer from little endian to the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On little endian this is a no-op. On big endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "little") {
/// assert_eq!(u64::from_le(n), n)
2015-03-18 09:36:18 -07:00
/// } else {
/// assert_eq!(u64::from_le(n), n.swap_bytes())
2015-03-18 09:36:18 -07:00
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn from_le(x: Self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "little") { x } else { x.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts `self` to big endian from the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On big endian this is a no-op. On little endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "big") {
/// assert_eq!(n.to_be(), n)
/// } else {
/// assert_eq!(n.to_be(), n.swap_bytes())
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn to_be(self) -> Self { // or not to be?
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "big") { self } else { self.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts `self` to little endian from the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On little endian this is a no-op. On big endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "little") {
/// assert_eq!(n.to_le(), n)
/// } else {
/// assert_eq!(n.to_le(), n.swap_bytes())
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn to_le(self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "little") { self } else { self.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer addition. Computes `self + other`, returning `None`
/// if overflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!(5u16.checked_add(65530), Some(65535));
/// assert_eq!(6u16.checked_add(65530), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_add(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $add_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer subtraction. Computes `self - other`, returning
/// `None` if underflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!((-127i8).checked_sub(1), Some(-128));
/// assert_eq!((-128i8).checked_sub(1), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_sub(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $sub_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer multiplication. Computes `self * other`, returning
/// `None` if underflow or overflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!(5u8.checked_mul(51), Some(255));
/// assert_eq!(5u8.checked_mul(52), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_mul(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $mul_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer division. Computes `self / other`, returning `None`
/// if `other == 0` or the operation results in underflow or overflow.
///
/// # Examples
///
/// ```rust
/// assert_eq!((-127i8).checked_div(-1), Some(127));
/// assert_eq!((-128i8).checked_div(-1), None);
/// assert_eq!((1i8).checked_div(0), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_div(self, v: Self) -> Option<Self> {
2015-03-18 09:36:18 -07:00
match v {
0 => None,
2015-05-21 14:01:44 -04:00
-1 if self == Self::min_value()
2015-03-18 09:36:18 -07:00
=> None,
v => Some(self / v),
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
/// Saturating integer addition. Computes `self + other`, saturating at
/// the numeric bounds instead of overflowing.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn saturating_add(self, other: Self) -> Self {
2015-03-18 09:36:18 -07:00
match self.checked_add(other) {
Some(x) => x,
2015-05-21 14:01:44 -04:00
None if other >= Self::zero() => Self::max_value(),
None => 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
2015-03-18 09:36:18 -07:00
/// Saturating integer subtraction. Computes `self - other`, saturating
/// at the numeric bounds instead of overflowing.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn saturating_sub(self, other: Self) -> Self {
2015-03-18 09:36:18 -07:00
match self.checked_sub(other) {
Some(x) => x,
2015-05-21 14:01:44 -04:00
None if other >= Self::zero() => Self::min_value(),
None => Self::max_value(),
}
}
/// Wrapping (modular) addition. Computes `self + other`,
/// wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_add(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_add(self, rhs)
}
}
/// Wrapping (modular) subtraction. Computes `self - other`,
/// wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_sub(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_sub(self, rhs)
}
}
/// Wrapping (modular) multiplication. Computes `self *
/// other`, wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_mul(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_mul(self, rhs)
2015-03-10 23:13:40 -05:00
}
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
/// Wrapping (modular) division. Computes `floor(self / other)`,
/// 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..
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_div(self, rhs: Self) -> Self {
self.overflowing_div(rhs).0
}
/// Wrapping (modular) remainder. Computes `self % other`,
/// wrapping around at the boundary of the type.
///
/// Such wrap-around never actually occurs mathematically;
/// implementation artifacts make `x % y` illegal for `MIN /
/// -1` on a signed type illegal (where `MIN` is the negative
/// minimal value). In such a case, this function returns `0`.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_rem(self, rhs: Self) -> Self {
self.overflowing_rem(rhs).0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_neg(self) -> Self {
self.overflowing_neg().0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_shl(self, rhs: u32) -> Self {
self.overflowing_shl(rhs).0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_shr(self, rhs: u32) -> Self {
self.overflowing_shr(rhs).0
}
2015-03-18 09:36:18 -07:00
/// Raises self to the power of `exp`, using exponentiation by squaring.
///
/// # Examples
///
/// ```
/// let x: i32 = 2; // or any other integer type
2015-03-18 09:36:18 -07:00
///
/// assert_eq!(x.pow(4), 16);
2015-03-18 09:36:18 -07:00
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
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;
2015-05-21 14:01:44 -04:00
let mut acc = Self::one();
2015-03-18 09:36:18 -07:00
let mut prev_base = self;
let mut base_oflo = false;
while exp > 0 {
if (exp & 1) == 1 {
if base_oflo {
// ensure overflow occurs in the same manner it
// would have otherwise (i.e. signal any exception
// it would have otherwise).
acc = acc * (prev_base * prev_base);
} else {
acc = acc * base;
2015-03-10 23:13:40 -05:00
}
}
2015-03-18 09:36:18 -07:00
prev_base = base;
let (new_base, new_base_oflo) = base.overflowing_mul(base);
base = new_base;
base_oflo = new_base_oflo;
exp /= 2;
2015-03-10 23:13:40 -05:00
}
2015-03-18 09:36:18 -07:00
acc
}
2015-03-10 23:13:40 -05:00
/// Computes the absolute value of `self`.
///
/// # Overflow behavior
///
/// The absolute value of `i32::min_value()` cannot be represented as an
/// `i32`, 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 `i32::min_value()` without a panic.
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
2015-05-21 14:01:44 -04:00
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-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// 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
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn signum(self) -> Self {
2015-03-18 09:36:18 -07:00
match self {
n if n > 0 => 1,
0 => 0,
_ => -1,
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
/// Returns `true` if `self` is positive and `false` if the number
/// is zero or negative.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
pub fn is_positive(self) -> bool { self > 0 }
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns `true` if `self` is negative and `false` if the number
/// is zero or positive.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
pub fn is_negative(self) -> bool { self < 0 }
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"]
impl i8 {
2015-05-21 14:01:44 -04:00
int_impl! { i8, u8, 8,
2015-03-18 09:36:18 -07:00
intrinsics::i8_add_with_overflow,
intrinsics::i8_sub_with_overflow,
intrinsics::i8_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "i16"]
impl i16 {
2015-05-21 14:01:44 -04:00
int_impl! { i16, u16, 16,
2015-03-18 09:36:18 -07:00
intrinsics::i16_add_with_overflow,
intrinsics::i16_sub_with_overflow,
intrinsics::i16_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "i32"]
impl i32 {
2015-05-21 14:01:44 -04:00
int_impl! { i32, u32, 32,
2015-03-18 09:36:18 -07:00
intrinsics::i32_add_with_overflow,
intrinsics::i32_sub_with_overflow,
intrinsics::i32_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "i64"]
impl i64 {
2015-05-21 14:01:44 -04:00
int_impl! { i64, u64, 64,
2015-03-18 09:36:18 -07:00
intrinsics::i64_add_with_overflow,
intrinsics::i64_sub_with_overflow,
intrinsics::i64_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[cfg(target_pointer_width = "32")]
#[lang = "isize"]
impl isize {
2015-05-21 14:01:44 -04:00
int_impl! { i32, u32, 32,
2015-03-18 09:36:18 -07:00
intrinsics::i32_add_with_overflow,
intrinsics::i32_sub_with_overflow,
intrinsics::i32_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[cfg(target_pointer_width = "64")]
#[lang = "isize"]
impl isize {
2015-05-21 14:01:44 -04:00
int_impl! { i64, u64, 64,
2015-03-18 09:36:18 -07:00
intrinsics::i64_add_with_overflow,
intrinsics::i64_sub_with_overflow,
intrinsics::i64_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
// `Int` + `UnsignedInt` implemented for signed integers
macro_rules! uint_impl {
2015-05-21 14:01:44 -04:00
($ActualT:ty, $BITS:expr,
2015-03-18 09:36:18 -07:00
$ctpop:path,
$ctlz:path,
$cttz:path,
$bswap:path,
$add_with_overflow:path,
$sub_with_overflow:path,
$mul_with_overflow:path) => {
/// Returns the smallest value that can be represented by this integer type.
#[stable(feature = "rust1", since = "1.0.0")]
2015-05-21 14:01:44 -04:00
pub fn min_value() -> Self { 0 }
/// Returns the largest value that can be represented by this integer type.
#[stable(feature = "rust1", since = "1.0.0")]
2015-05-21 14:01:44 -04:00
pub fn max_value() -> Self { !0 }
/// Converts a string slice in a given base to an integer.
///
/// Leading and trailing whitespace represent an error.
///
/// # Arguments
///
/// * src - A string slice
/// * radix - The base to use. Must lie in the range [2 .. 36]
///
/// # Return value
///
/// `Err(ParseIntError)` if the string did not represent a valid number.
/// Otherwise, `Ok(n)` where `n` is the integer represented by `src`.
#[stable(feature = "rust1", since = "1.0.0")]
#[allow(deprecated)]
2015-05-21 14:01:44 -04:00
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
/// Returns the number of ones in the binary representation of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b01001100u8;
///
/// assert_eq!(n.count_ones(), 3);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn count_ones(self) -> u32 {
unsafe { $ctpop(self as $ActualT) as u32 }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns the number of zeros in the binary representation of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b01001100u8;
///
/// assert_eq!(n.count_zeros(), 5);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn count_zeros(self) -> u32 {
(!self).count_ones()
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns the number of leading zeros in the binary representation
/// of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b0101000u16;
///
/// assert_eq!(n.leading_zeros(), 10);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn leading_zeros(self) -> u32 {
unsafe { $ctlz(self as $ActualT) as u32 }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns the number of trailing zeros in the binary representation
/// of `self`.
///
/// # Examples
///
/// ```rust
/// let n = 0b0101000u16;
///
/// assert_eq!(n.trailing_zeros(), 3);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
pub fn trailing_zeros(self) -> u32 {
// As of LLVM 3.6 the codegen for the zero-safe cttz8 intrinsic
// emits two conditional moves on x86_64. By promoting the value to
// u16 and setting bit 8, we get better code without any conditional
// operations.
// FIXME: There's a LLVM patch (http://reviews.llvm.org/D9284)
// pending, remove this workaround once LLVM generates better code
// for cttz8.
unsafe {
if $BITS == 8 {
intrinsics::cttz16(self as u16 | 0x100) as u32
} else {
$cttz(self as $ActualT) as u32
}
}
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-04-10 20:32:38 +03:00
/// Shifts the bits to the left by a specified amount, `n`,
2015-03-18 09:36:18 -07:00
/// wrapping the truncated bits to the end of the resulting integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0x3456789ABCDEF012u64;
///
/// assert_eq!(n.rotate_left(12), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
2015-05-21 14:01:44 -04:00
pub fn rotate_left(self, n: u32) -> Self {
2015-03-18 09:36:18 -07:00
// Protect against undefined behaviour for over-long bit shifts
let n = n % $BITS;
(self << n) | (self >> (($BITS - n) % $BITS))
}
2015-03-10 23:13:40 -05:00
2015-04-10 20:32:38 +03:00
/// Shifts the bits to the right by a specified amount, `n`,
2015-03-18 09:36:18 -07:00
/// wrapping the truncated bits to the beginning of the resulting
/// integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0xDEF0123456789ABCu64;
///
/// assert_eq!(n.rotate_right(12), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
2015-05-21 14:01:44 -04:00
pub fn rotate_right(self, n: u32) -> Self {
2015-03-18 09:36:18 -07:00
// Protect against undefined behaviour for over-long bit shifts
let n = n % $BITS;
(self >> n) | (self << (($BITS - n) % $BITS))
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Reverses the byte order of the integer.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
/// let m = 0xEFCDAB8967452301u64;
///
/// assert_eq!(n.swap_bytes(), m);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn swap_bytes(self) -> Self {
unsafe { $bswap(self as $ActualT) as Self }
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
/// Converts an integer from big endian to the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On big endian this is a no-op. On little endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "big") {
/// assert_eq!(u64::from_be(n), n)
2015-03-18 09:36:18 -07:00
/// } else {
/// assert_eq!(u64::from_be(n), n.swap_bytes())
2015-03-18 09:36:18 -07:00
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn from_be(x: Self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "big") { x } else { x.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts an integer from little endian to the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On little endian this is a no-op. On big endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "little") {
/// assert_eq!(u64::from_le(n), n)
2015-03-18 09:36:18 -07:00
/// } else {
/// assert_eq!(u64::from_le(n), n.swap_bytes())
2015-03-18 09:36:18 -07:00
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn from_le(x: Self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "little") { x } else { x.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts `self` to big endian from the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On big endian this is a no-op. On little endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "big") {
/// assert_eq!(n.to_be(), n)
/// } else {
/// assert_eq!(n.to_be(), n.swap_bytes())
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn to_be(self) -> Self { // or not to be?
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "big") { self } else { self.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
/// Converts `self` to little endian from the target's endianness.
2015-03-18 09:36:18 -07:00
///
/// On little endian this is a no-op. On big endian the bytes are
/// swapped.
///
/// # Examples
///
/// ```rust
/// let n = 0x0123456789ABCDEFu64;
///
/// if cfg!(target_endian = "little") {
/// assert_eq!(n.to_le(), n)
/// } else {
/// assert_eq!(n.to_le(), n.swap_bytes())
/// }
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn to_le(self) -> Self {
2015-03-18 09:36:18 -07:00
if cfg!(target_endian = "little") { self } else { self.swap_bytes() }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer addition. Computes `self + other`, returning `None`
/// if overflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!(5u16.checked_add(65530), Some(65535));
/// assert_eq!(6u16.checked_add(65530), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_add(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $add_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer subtraction. Computes `self - other`, returning
/// `None` if underflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!((-127i8).checked_sub(1), Some(-128));
/// assert_eq!((-128i8).checked_sub(1), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_sub(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $sub_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Checked integer multiplication. Computes `self * other`, returning
/// `None` if underflow or overflow occurred.
///
/// # Examples
///
/// ```rust
/// assert_eq!(5u8.checked_mul(51), Some(255));
/// assert_eq!(5u8.checked_mul(52), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_mul(self, other: Self) -> Option<Self> {
checked_op!($ActualT, $mul_with_overflow, self, other)
2015-03-18 09:36:18 -07:00
}
/// Checked integer division. Computes `self / other`, returning `None`
/// if `other == 0` or the operation results in underflow or overflow.
///
/// # Examples
///
/// ```rust
/// assert_eq!((-127i8).checked_div(-1), Some(127));
/// assert_eq!((-128i8).checked_div(-1), None);
/// assert_eq!((1i8).checked_div(0), None);
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn checked_div(self, v: Self) -> Option<Self> {
2015-03-18 09:36:18 -07:00
match v {
0 => None,
v => Some(self / v),
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
/// Saturating integer addition. Computes `self + other`, saturating at
/// the numeric bounds instead of overflowing.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn saturating_add(self, other: Self) -> Self {
2015-03-18 09:36:18 -07:00
match self.checked_add(other) {
Some(x) => x,
2015-05-21 14:01:44 -04:00
None if other >= Self::zero() => Self::max_value(),
None => 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
2015-03-18 09:36:18 -07:00
/// Saturating integer subtraction. Computes `self - other`, saturating
/// at the numeric bounds instead of overflowing.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn saturating_sub(self, other: Self) -> Self {
2015-03-18 09:36:18 -07:00
match self.checked_sub(other) {
Some(x) => x,
2015-05-21 14:01:44 -04:00
None if other >= Self::zero() => Self::min_value(),
None => Self::max_value(),
}
}
/// Wrapping (modular) addition. Computes `self + other`,
/// wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_add(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_add(self, rhs)
}
}
/// Wrapping (modular) subtraction. Computes `self - other`,
/// wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_sub(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_sub(self, rhs)
}
}
/// Wrapping (modular) multiplication. Computes `self *
/// other`, wrapping around at the boundary of the type.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn wrapping_mul(self, rhs: Self) -> Self {
unsafe {
intrinsics::overflowing_mul(self, rhs)
2015-03-10 23:13:40 -05:00
}
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
/// Wrapping (modular) division. Computes `floor(self / other)`,
/// 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..
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_div(self, rhs: Self) -> Self {
self.overflowing_div(rhs).0
}
/// Wrapping (modular) remainder. Computes `self % other`,
/// wrapping around at the boundary of the type.
///
/// Such wrap-around never actually occurs mathematically;
/// implementation artifacts make `x % y` illegal for `MIN /
/// -1` on a signed type illegal (where `MIN` is the negative
/// minimal value). In such a case, this function returns `0`.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_rem(self, rhs: Self) -> Self {
self.overflowing_rem(rhs).0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_neg(self) -> Self {
self.overflowing_neg().0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_shl(self, rhs: u32) -> Self {
self.overflowing_shl(rhs).0
}
/// 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.
#[stable(feature = "num_wrapping", since = "1.2.0")]
#[inline(always)]
2015-05-21 14:01:44 -04:00
pub fn wrapping_shr(self, rhs: u32) -> Self {
self.overflowing_shr(rhs).0
}
2015-03-18 09:36:18 -07:00
/// Raises self to the power of `exp`, using exponentiation by squaring.
///
/// # Examples
///
/// ```rust
/// assert_eq!(2i32.pow(4), 16);
2015-03-18 09:36:18 -07:00
/// ```
#[stable(feature = "rust1", since = "1.0.0")]
2015-03-18 09:36:18 -07:00
#[inline]
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;
2015-05-21 14:01:44 -04:00
let mut acc = Self::one();
2015-03-18 09:36:18 -07:00
let mut prev_base = self;
let mut base_oflo = false;
while exp > 0 {
if (exp & 1) == 1 {
if base_oflo {
// ensure overflow occurs in the same manner it
// would have otherwise (i.e. signal any exception
// it would have otherwise).
acc = acc * (prev_base * prev_base);
} else {
acc = acc * base;
2015-03-10 23:13:40 -05:00
}
}
2015-03-18 09:36:18 -07:00
prev_base = base;
let (new_base, new_base_oflo) = base.overflowing_mul(base);
base = new_base;
base_oflo = new_base_oflo;
exp /= 2;
2015-03-10 23:13:40 -05:00
}
2015-03-18 09:36:18 -07:00
acc
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns `true` iff `self == 2^k` for some `k`.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
pub fn is_power_of_two(self) -> bool {
2015-05-21 14:01:44 -04:00
(self.wrapping_sub(Self::one())) & self == Self::zero() &&
!(self == Self::zero())
2015-03-18 09:36:18 -07:00
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// Returns the smallest power of two greater than or equal to `self`.
/// Unspecified behavior on overflow.
#[stable(feature = "rust1", since = "1.0.0")]
#[inline]
2015-05-21 14:01:44 -04:00
pub fn next_power_of_two(self) -> Self {
let bits = size_of::<Self>() * 8;
let one: Self = Self::one();
2015-03-18 09:36:18 -07:00
one << ((bits - self.wrapping_sub(one).leading_zeros() as usize) % bits)
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
/// 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`.
#[stable(feature = "rust1", since = "1.0.0")]
2015-05-21 14:01:44 -04:00
pub fn checked_next_power_of_two(self) -> Option<Self> {
2015-03-18 09:36:18 -07:00
let npot = self.next_power_of_two();
if npot >= self {
Some(npot)
} else {
None
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"]
impl u8 {
2015-05-21 14:01:44 -04:00
uint_impl! { u8, 8,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop8,
intrinsics::ctlz8,
intrinsics::cttz8,
bswap8,
intrinsics::u8_add_with_overflow,
intrinsics::u8_sub_with_overflow,
intrinsics::u8_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "u16"]
impl u16 {
2015-05-21 14:01:44 -04:00
uint_impl! { u16, 16,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop16,
intrinsics::ctlz16,
intrinsics::cttz16,
intrinsics::bswap16,
intrinsics::u16_add_with_overflow,
intrinsics::u16_sub_with_overflow,
intrinsics::u16_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "u32"]
impl u32 {
2015-05-21 14:01:44 -04:00
uint_impl! { u32, 32,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop32,
intrinsics::ctlz32,
intrinsics::cttz32,
intrinsics::bswap32,
intrinsics::u32_add_with_overflow,
intrinsics::u32_sub_with_overflow,
intrinsics::u32_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[lang = "u64"]
impl u64 {
2015-05-21 14:01:44 -04:00
uint_impl! { u64, 64,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop64,
intrinsics::ctlz64,
intrinsics::cttz64,
intrinsics::bswap64,
intrinsics::u64_add_with_overflow,
intrinsics::u64_sub_with_overflow,
intrinsics::u64_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[cfg(target_pointer_width = "32")]
#[lang = "usize"]
impl usize {
2015-05-21 14:01:44 -04:00
uint_impl! { u32, 32,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop32,
intrinsics::ctlz32,
intrinsics::cttz32,
intrinsics::bswap32,
intrinsics::u32_add_with_overflow,
intrinsics::u32_sub_with_overflow,
intrinsics::u32_mul_with_overflow }
}
2015-03-10 23:13:40 -05:00
2015-03-18 09:36:18 -07:00
#[cfg(target_pointer_width = "64")]
#[lang = "usize"]
impl usize {
2015-05-21 14:01:44 -04:00
uint_impl! { u64, 64,
2015-03-18 09:36:18 -07:00
intrinsics::ctpop64,
intrinsics::ctlz64,
intrinsics::cttz64,
intrinsics::bswap64,
intrinsics::u64_add_with_overflow,
intrinsics::u64_sub_with_overflow,
intrinsics::u64_mul_with_overflow }
2015-03-10 23:13:40 -05:00
}
/// Used for representing the classification of floating point numbers
#[derive(Copy, Clone, PartialEq, Debug)]
#[stable(feature = "rust1", since = "1.0.0")]
pub enum FpCategory {
/// "Not a Number", often obtained by dividing by zero
#[stable(feature = "rust1", since = "1.0.0")]
Nan,
/// Positive or negative infinity
#[stable(feature = "rust1", since = "1.0.0")]
Infinite ,
/// Positive or negative zero
#[stable(feature = "rust1", since = "1.0.0")]
Zero,
/// De-normalized floating point representation (less precise than `Normal`)
#[stable(feature = "rust1", since = "1.0.0")]
Subnormal,
/// A regular floating point number
#[stable(feature = "rust1", since = "1.0.0")]
Normal,
}
2014-11-10 16:00:13 +11:00
/// A built-in floating point number.
#[doc(hidden)]
#[unstable(feature = "core_float",
reason = "stable interface is via `impl f{32,64}` in later crates")]
pub trait Float {
/// Returns the NaN value.
fn nan() -> Self;
/// Returns the infinite value.
fn infinity() -> Self;
/// Returns the negative infinite value.
fn neg_infinity() -> Self;
/// Returns -0.0.
fn neg_zero() -> Self;
/// Returns 0.0.
fn zero() -> Self;
/// Returns 1.0.
2014-11-10 09:35:53 +11:00
fn one() -> Self;
/// Parses the string `s` with the radix `r` as a float.
fn from_str_radix(s: &str, r: u32) -> Result<Self, ParseFloatError>;
2015-01-02 22:33:07 +11:00
/// Returns true if this value is NaN and false otherwise.
fn is_nan(self) -> bool;
/// Returns true if this value is positive infinity or negative infinity and
/// false otherwise.
fn is_infinite(self) -> bool;
/// Returns true if this number is neither infinite nor NaN.
fn is_finite(self) -> bool;
/// Returns true if this number is neither zero, infinite, denormal, or NaN.
fn is_normal(self) -> bool;
/// Returns the category that this number falls into.
fn classify(self) -> FpCategory;
/// Returns the mantissa, exponent and sign as integers, respectively.
fn integer_decode(self) -> (u64, i16, i8);
/// Return the largest integer less than or equal to a number.
fn floor(self) -> Self;
/// Return the smallest integer greater than or equal to a number.
fn ceil(self) -> Self;
/// Return the nearest integer to a number. Round half-way cases away from
/// `0.0`.
fn round(self) -> Self;
/// Return the integer part of a number.
fn trunc(self) -> Self;
/// Return the fractional part of a number.
fn fract(self) -> Self;
/// Computes the absolute value of `self`. Returns `Float::nan()` if the
/// number is `Float::nan()`.
fn abs(self) -> Self;
/// Returns a number that represents the sign of `self`.
///
/// - `1.0` if the number is positive, `+0.0` or `Float::infinity()`
/// - `-1.0` if the number is negative, `-0.0` or `Float::neg_infinity()`
/// - `Float::nan()` if the number is `Float::nan()`
fn signum(self) -> Self;
/// Returns `true` if `self` is positive, including `+0.0` and
/// `Float::infinity()`.
fn is_positive(self) -> bool;
/// Returns `true` if `self` is negative, including `-0.0` and
/// `Float::neg_infinity()`.
fn is_negative(self) -> bool;
/// Fused multiply-add. Computes `(self * a) + b` with only one rounding
/// error. This produces a more accurate result with better performance than
/// a separate multiplication operation followed by an add.
fn mul_add(self, a: Self, b: Self) -> Self;
/// Take the reciprocal (inverse) of a number, `1/x`.
fn recip(self) -> Self;
/// Raise a number to an integer power.
///
/// Using this function is generally faster than using `powf`
fn powi(self, n: i32) -> Self;
/// Raise a number to a floating point power.
fn powf(self, n: Self) -> Self;
/// Take the square root of a number.
///
/// Returns NaN if `self` is a negative number.
fn sqrt(self) -> Self;
/// Take the reciprocal (inverse) square root of a number, `1/sqrt(x)`.
fn rsqrt(self) -> Self;
/// Returns `e^(self)`, (the exponential function).
fn exp(self) -> Self;
/// Returns 2 raised to the power of the number, `2^(self)`.
fn exp2(self) -> Self;
/// Returns the natural logarithm of the number.
fn ln(self) -> Self;
/// Returns the logarithm of the number with respect to an arbitrary base.
fn log(self, base: Self) -> Self;
/// Returns the base 2 logarithm of the number.
fn log2(self) -> Self;
/// Returns the base 10 logarithm of the number.
fn log10(self) -> Self;
/// Convert radians to degrees.
fn to_degrees(self) -> Self;
/// Convert degrees to radians.
fn to_radians(self) -> Self;
}
2014-11-09 16:59:28 +11:00
macro_rules! from_str_float_impl {
2015-05-21 14:04:13 -04:00
($t:ty) => {
#[stable(feature = "rust1", since = "1.0.0")]
2015-05-21 14:04:13 -04:00
impl FromStr for $t {
type Err = ParseFloatError;
/// Converts a string in base 10 to a float.
2014-11-15 17:02:38 +11:00
/// Accepts an optional decimal exponent.
///
/// This function accepts strings such as
///
/// * '3.14'
/// * '+3.14', equivalent to '3.14'
/// * '-3.14'
/// * '2.5E10', or equivalently, '2.5e10'
/// * '2.5E-10'
/// * '.' (understood as 0)
/// * '5.'
/// * '.5', or, equivalently, '0.5'
/// * '+inf', 'inf', '-inf', 'NaN'
///
/// Leading and trailing whitespace represent an error.
///
/// # Arguments
///
/// * src - A string
///
/// # Return value
///
/// `Err(ParseFloatError)` if the string did not represent a valid
/// number. Otherwise, `Ok(n)` where `n` is the floating-point
/// number represented by `src`.
2014-11-15 17:02:38 +11:00
#[inline]
#[allow(deprecated)]
2015-05-21 14:01:44 -04:00
fn from_str(src: &str) -> Result<Self, ParseFloatError> {
Self::from_str_radix(src, 10)
2014-11-15 17:02:38 +11:00
}
}
}
}
from_str_float_impl!(f32);
from_str_float_impl!(f64);
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)*) => {$(
#[stable(feature = "rust1", since = "1.0.0")]
#[allow(deprecated)]
2015-05-21 14:04:13 -04:00
impl FromStr for $t {
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)
}
}
)*}
}
from_str_radix_int_impl! { isize i8 i16 i32 i64 usize u8 u16 u32 u64 }
2014-11-15 17:02:38 +11:00
#[doc(hidden)]
trait FromStrRadixHelper: PartialOrd + Copy {
fn min_value() -> Self;
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 {
2015-05-21 14:01:44 -04:00
fn min_value() -> Self { Self::min_value() }
fn from_u32(u: u32) -> Self { u as Self }
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
}
fn checked_sub(&self, other: u32) -> Option<Self> {
2015-05-21 14:01:44 -04:00
Self::checked_sub(*self, other as Self)
}
fn checked_add(&self, other: u32) -> Option<Self> {
2015-05-21 14:01:44 -04:00
Self::checked_add(*self, other as Self)
}
})*)
}
doit! { i8 i16 i32 i64 isize u8 u16 u32 u64 usize }
fn from_str_radix<T: FromStrRadixHelper>(src: &str, radix: u32)
-> Result<T, ParseIntError> {
use self::IntErrorKind::*;
use self::ParseIntError as PIE;
assert!(radix >= 2 && radix <= 36,
"from_str_radix_int: must lie in the range `[2, 36]` - found {}",
radix);
let is_signed_ty = T::from_u32(0) > T::min_value();
match src.slice_shift_char() {
Some(('-', "")) => Err(PIE { kind: Empty }),
Some(('-', src)) if is_signed_ty => {
// The number is negative
let mut result = T::from_u32(0);
for c in src.chars() {
let x = match c.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 }),
};
}
Ok(result)
},
Some((_, _)) => {
// The number is signed
let mut result = T::from_u32(0);
for c in src.chars() {
let x = match c.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: Overflow }),
};
result = match result.checked_add(x) {
Some(result) => result,
None => return Err(PIE { kind: Overflow }),
};
}
Ok(result)
},
None => Err(ParseIntError { kind: Empty }),
2014-11-15 17:02:38 +11:00
}
}
/// An error which can be returned when parsing an integer.
#[derive(Debug, Clone, PartialEq)]
#[stable(feature = "rust1", since = "1.0.0")]
pub struct ParseIntError { kind: IntErrorKind }
#[derive(Debug, Clone, PartialEq)]
enum IntErrorKind {
Empty,
InvalidDigit,
Overflow,
Underflow,
}
impl ParseIntError {
#[unstable(feature = "int_error_internals",
reason = "available through Error trait and this method should \
not be exposed publicly")]
pub fn description(&self) -> &str {
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",
}
}
}
#[stable(feature = "rust1", since = "1.0.0")]
impl fmt::Display for ParseIntError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.description().fmt(f)
}
}
/// An error which can be returned when parsing a float.
#[derive(Debug, Clone, PartialEq)]
#[stable(feature = "rust1", since = "1.0.0")]
pub struct ParseFloatError {
#[doc(hidden)]
#[unstable(feature = "float_error_internals",
reason = "should not be exposed publicly")]
pub __kind: FloatErrorKind
}
#[derive(Debug, Clone, PartialEq)]
#[unstable(feature = "float_error_internals",
reason = "should not be exposed publicly")]
pub enum FloatErrorKind {
Empty,
Invalid,
}
impl ParseFloatError {
#[doc(hidden)]
pub fn __description(&self) -> &str {
match self.__kind {
FloatErrorKind::Empty => "cannot parse float from empty string",
FloatErrorKind::Invalid => "invalid float literal",
}
}
}
#[stable(feature = "rust1", since = "1.0.0")]
impl fmt::Display for ParseFloatError {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
self.__description().fmt(f)
}
}