2012-12-03 18:48:01 -06:00
|
|
|
// Copyright 2012 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.
|
|
|
|
|
2012-12-13 15:05:22 -06:00
|
|
|
use T = self::inst::T;
|
2013-01-23 17:08:47 -06:00
|
|
|
use T_SIGNED = self::inst::T_SIGNED;
|
2012-12-13 15:05:22 -06:00
|
|
|
|
2012-12-23 16:41:37 -06:00
|
|
|
use char;
|
2012-09-04 13:12:17 -05:00
|
|
|
use cmp::{Eq, Ord};
|
2013-01-24 14:47:57 -06:00
|
|
|
use cmp;
|
|
|
|
use to_str::ToStr;
|
2012-09-04 13:12:17 -05:00
|
|
|
use from_str::FromStr;
|
2013-01-24 14:47:57 -06:00
|
|
|
use num::{ToStrRadix, FromStrRadix};
|
2013-02-14 20:29:36 -06:00
|
|
|
use num::strconv;
|
2012-12-23 16:41:37 -06:00
|
|
|
use num;
|
2013-01-08 21:37:25 -06:00
|
|
|
use option::{None, Option, Some};
|
2013-01-24 14:47:57 -06:00
|
|
|
use prelude::*;
|
2012-12-23 16:41:37 -06:00
|
|
|
use str;
|
2012-12-27 19:53:04 -06:00
|
|
|
use uint;
|
2012-12-23 16:41:37 -06:00
|
|
|
use vec;
|
2013-01-26 20:21:37 -06:00
|
|
|
use u8;
|
|
|
|
use u16;
|
|
|
|
use u32;
|
2012-04-15 00:07:45 -05:00
|
|
|
|
2013-01-15 19:30:01 -06:00
|
|
|
pub use cmp::{min, max};
|
|
|
|
|
2012-09-26 20:46:12 -05:00
|
|
|
pub const bits : uint = inst::bits;
|
|
|
|
pub const bytes : uint = (inst::bits / 8);
|
2012-04-15 00:07:45 -05:00
|
|
|
|
2012-09-26 20:46:12 -05:00
|
|
|
pub const min_value: T = 0 as T;
|
|
|
|
pub const max_value: T = 0 as T - 1 as T;
|
2012-04-15 00:07:45 -05:00
|
|
|
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn add(x: T, y: T) -> T { x + y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn sub(x: T, y: T) -> T { x - y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn mul(x: T, y: T) -> T { x * y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn div(x: T, y: T) -> T { x / y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn rem(x: T, y: T) -> T { x % y }
|
2012-08-30 14:54:50 -05:00
|
|
|
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn lt(x: T, y: T) -> bool { x < y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn le(x: T, y: T) -> bool { x <= y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn eq(x: T, y: T) -> bool { x == y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn ne(x: T, y: T) -> bool { x != y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn ge(x: T, y: T) -> bool { x >= y }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn gt(x: T, y: T) -> bool { x > y }
|
2012-04-15 00:07:45 -05:00
|
|
|
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn is_positive(x: T) -> bool { x > 0 as T }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn is_negative(x: T) -> bool { x < 0 as T }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn is_nonpositive(x: T) -> bool { x <= 0 as T }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn is_nonnegative(x: T) -> bool { x >= 0 as T }
|
2012-04-15 00:07:45 -05:00
|
|
|
|
2012-12-09 20:57:41 -06:00
|
|
|
#[inline(always)]
|
2013-01-10 14:18:01 -06:00
|
|
|
/**
|
|
|
|
* Iterate over the range [`start`,`start`+`step`..`stop`)
|
|
|
|
*
|
|
|
|
*/
|
2013-01-23 17:08:47 -06:00
|
|
|
pub pure fn range_step(start: T, stop: T, step: T_SIGNED, it: fn(T) -> bool) {
|
2012-12-09 20:57:41 -06:00
|
|
|
let mut i = start;
|
|
|
|
if step == 0 {
|
2013-02-11 21:26:38 -06:00
|
|
|
fail!(~"range_step called with step == 0");
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
if step >= 0 {
|
|
|
|
while i < stop {
|
|
|
|
if !it(i) { break }
|
|
|
|
i += step as T;
|
|
|
|
}
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
else {
|
|
|
|
while i > stop {
|
|
|
|
if !it(i) { break }
|
|
|
|
i -= -step as T;
|
|
|
|
}
|
2012-12-09 20:57:41 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-08 20:49:50 -05:00
|
|
|
#[inline(always)]
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Iterate over the range [`lo`..`hi`)
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn range(lo: T, hi: T, it: fn(T) -> bool) {
|
2013-01-23 17:08:47 -06:00
|
|
|
range_step(lo, hi, 1 as T_SIGNED, it);
|
2012-12-09 20:57:41 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
/// Iterate over the range [`hi`..`lo`)
|
|
|
|
pub pure fn range_rev(hi: T, lo: T, it: fn(T) -> bool) {
|
2013-01-23 17:08:47 -06:00
|
|
|
range_step(hi, lo, -1 as T_SIGNED, it);
|
2012-04-15 00:07:45 -05:00
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Computes the bitwise complement
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub pure fn compl(i: T) -> T {
|
2012-04-15 00:07:45 -05:00
|
|
|
max_value ^ i
|
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2012-11-30 02:47:45 -06:00
|
|
|
#[cfg(notest)]
|
2013-02-14 13:47:00 -06:00
|
|
|
impl Ord for T {
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn lt(&self, other: &T) -> bool { (*self) < (*other) }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn le(&self, other: &T) -> bool { (*self) <= (*other) }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn ge(&self, other: &T) -> bool { (*self) >= (*other) }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn gt(&self, other: &T) -> bool { (*self) > (*other) }
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
2012-06-06 16:19:52 -05:00
|
|
|
|
2012-11-30 02:47:45 -06:00
|
|
|
#[cfg(notest)]
|
2013-02-14 13:47:00 -06:00
|
|
|
impl Eq for T {
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn eq(&self, other: &T) -> bool { return (*self) == (*other); }
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-11-14 20:59:30 -06:00
|
|
|
pure fn ne(&self, other: &T) -> bool { return (*self) != (*other); }
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
2012-06-06 16:19:52 -05:00
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl num::Zero for T {
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-12-20 09:14:38 -06:00
|
|
|
static pure fn zero() -> T { 0 }
|
|
|
|
}
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl num::One for T {
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2012-12-20 09:14:38 -06:00
|
|
|
static pure fn one() -> T { 1 }
|
|
|
|
}
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl num::Round for T {
|
2013-01-26 20:05:20 -06:00
|
|
|
#[inline(always)]
|
|
|
|
pure fn round(&self, _: num::RoundMode) -> T { *self }
|
|
|
|
|
|
|
|
#[inline(always)]
|
|
|
|
pure fn floor(&self) -> T { *self }
|
|
|
|
#[inline(always)]
|
|
|
|
pure fn ceil(&self) -> T { *self }
|
|
|
|
#[inline(always)]
|
|
|
|
pure fn fract(&self) -> T { 0 }
|
|
|
|
}
|
|
|
|
|
2013-02-12 19:07:26 -06:00
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Add<T,T> for T {
|
|
|
|
pure fn add(&self, other: &T) -> T { *self + *other }
|
|
|
|
}
|
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Sub<T,T> for T {
|
|
|
|
pure fn sub(&self, other: &T) -> T { *self - *other }
|
|
|
|
}
|
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Mul<T,T> for T {
|
|
|
|
pure fn mul(&self, other: &T) -> T { *self * *other }
|
|
|
|
}
|
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Div<T,T> for T {
|
|
|
|
pure fn div(&self, other: &T) -> T { *self / *other }
|
|
|
|
}
|
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Modulo<T,T> for T {
|
|
|
|
pure fn modulo(&self, other: &T) -> T { *self % *other }
|
|
|
|
}
|
|
|
|
#[cfg(notest)]
|
|
|
|
impl ops::Neg<T> for T {
|
|
|
|
pure fn neg(&self) -> T { -*self }
|
|
|
|
}
|
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
// String conversion functions and impl str -> num
|
2012-08-02 19:14:26 -05:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Parse a string as a number in base 10.
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2013-01-24 14:47:57 -06:00
|
|
|
pub pure fn from_str(s: &str) -> Option<T> {
|
2013-02-14 20:29:36 -06:00
|
|
|
strconv::from_str_common(s, 10u, false, false, false,
|
|
|
|
strconv::ExpNone, false)
|
2012-11-17 13:01:08 -06:00
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Parse a string as a number in the given base.
|
|
|
|
#[inline(always)]
|
|
|
|
pub pure fn from_str_radix(s: &str, radix: uint) -> Option<T> {
|
2013-02-14 20:29:36 -06:00
|
|
|
strconv::from_str_common(s, radix, false, false, false,
|
|
|
|
strconv::ExpNone, false)
|
2012-09-03 15:09:24 -05:00
|
|
|
}
|
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Parse a byte slice as a number in the given base.
|
|
|
|
#[inline(always)]
|
|
|
|
pub pure fn parse_bytes(buf: &[u8], radix: uint) -> Option<T> {
|
2013-02-14 20:29:36 -06:00
|
|
|
strconv::from_str_bytes_common(buf, radix, false, false, false,
|
|
|
|
strconv::ExpNone, false)
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl FromStr for T {
|
2013-01-24 14:47:57 -06:00
|
|
|
#[inline(always)]
|
|
|
|
static pure fn from_str(s: &str) -> Option<T> {
|
|
|
|
from_str(s)
|
2012-06-04 20:05:34 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl FromStrRadix for T {
|
2012-06-04 20:05:34 -05:00
|
|
|
#[inline(always)]
|
2013-01-24 14:47:57 -06:00
|
|
|
static pure fn from_str_radix(&self, s: &str, radix: uint) -> Option<T> {
|
|
|
|
from_str_radix(s, radix)
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
2013-01-24 14:47:57 -06:00
|
|
|
}
|
2012-06-04 16:20:57 -05:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
// String conversion functions and impl num -> str
|
2012-12-14 19:03:35 -06:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Convert to a string as a byte slice in a given base.
|
|
|
|
#[inline(always)]
|
|
|
|
pub pure fn to_str_bytes<U>(n: T, radix: uint, f: fn(v: &[u8]) -> U) -> U {
|
2013-02-14 20:29:36 -06:00
|
|
|
let (buf, _) = strconv::to_str_bytes_common(&n, radix, false, false,
|
|
|
|
strconv::SignNeg, strconv::DigAll);
|
2013-01-24 14:47:57 -06:00
|
|
|
f(buf)
|
|
|
|
}
|
2012-12-14 19:03:35 -06:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Convert to a string in base 10.
|
|
|
|
#[inline(always)]
|
|
|
|
pub pure fn to_str(num: T) -> ~str {
|
2013-02-14 20:29:36 -06:00
|
|
|
let (buf, _) = strconv::to_str_common(&num, 10u, false, false,
|
|
|
|
strconv::SignNeg, strconv::DigAll);
|
2013-01-24 14:47:57 -06:00
|
|
|
buf
|
|
|
|
}
|
2012-12-14 19:03:35 -06:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Convert to a string in a given base.
|
|
|
|
#[inline(always)]
|
|
|
|
pub pure fn to_str_radix(num: T, radix: uint) -> ~str {
|
2013-02-14 20:29:36 -06:00
|
|
|
let (buf, _) = strconv::to_str_common(&num, radix, false, false,
|
|
|
|
strconv::SignNeg, strconv::DigAll);
|
2013-01-24 14:47:57 -06:00
|
|
|
buf
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
/// Convert to a string.
|
|
|
|
/// *Deprecated*, use to_str() instead.
|
2013-01-13 08:37:30 -06:00
|
|
|
#[inline(always)]
|
2013-01-24 14:47:57 -06:00
|
|
|
pub pure fn str(i: T) -> ~str { to_str(i) }
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl ToStr for T {
|
2013-01-24 14:47:57 -06:00
|
|
|
#[inline(always)]
|
2013-02-03 22:47:26 -06:00
|
|
|
pure fn to_str(&self) -> ~str {
|
|
|
|
to_str(*self)
|
2013-01-24 14:47:57 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-14 13:47:00 -06:00
|
|
|
impl ToStrRadix for T {
|
2013-01-24 14:47:57 -06:00
|
|
|
#[inline(always)]
|
|
|
|
pure fn to_str_radix(&self, radix: uint) -> ~str {
|
|
|
|
to_str_radix(*self, radix)
|
|
|
|
}
|
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2012-06-04 20:05:34 -05:00
|
|
|
#[test]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub fn test_to_str() {
|
2013-01-24 14:47:57 -06:00
|
|
|
assert to_str_radix(0 as T, 10u) == ~"0";
|
|
|
|
assert to_str_radix(1 as T, 10u) == ~"1";
|
|
|
|
assert to_str_radix(2 as T, 10u) == ~"2";
|
|
|
|
assert to_str_radix(11 as T, 10u) == ~"11";
|
|
|
|
assert to_str_radix(11 as T, 16u) == ~"b";
|
|
|
|
assert to_str_radix(255 as T, 16u) == ~"ff";
|
|
|
|
assert to_str_radix(0xff as T, 10u) == ~"255";
|
2012-06-04 20:05:34 -05:00
|
|
|
}
|
|
|
|
|
2012-05-16 00:50:29 -05:00
|
|
|
#[test]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub fn test_from_str() {
|
2012-08-20 14:23:37 -05:00
|
|
|
assert from_str(~"0") == Some(0u as T);
|
|
|
|
assert from_str(~"3") == Some(3u as T);
|
|
|
|
assert from_str(~"10") == Some(10u as T);
|
2013-01-26 20:21:37 -06:00
|
|
|
assert u32::from_str(~"123456789") == Some(123456789 as u32);
|
2012-08-20 14:23:37 -05:00
|
|
|
assert from_str(~"00100") == Some(100u as T);
|
|
|
|
|
2012-08-27 19:49:35 -05:00
|
|
|
assert from_str(~"").is_none();
|
|
|
|
assert from_str(~" ").is_none();
|
|
|
|
assert from_str(~"x").is_none();
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub fn test_parse_bytes() {
|
2012-09-07 20:08:21 -05:00
|
|
|
use str::to_bytes;
|
2012-09-14 11:55:33 -05:00
|
|
|
assert parse_bytes(to_bytes(~"123"), 10u) == Some(123u as T);
|
|
|
|
assert parse_bytes(to_bytes(~"1001"), 2u) == Some(9u as T);
|
|
|
|
assert parse_bytes(to_bytes(~"123"), 8u) == Some(83u as T);
|
2013-01-26 20:21:37 -06:00
|
|
|
assert u16::parse_bytes(to_bytes(~"123"), 16u) == Some(291u as u16);
|
|
|
|
assert u16::parse_bytes(to_bytes(~"ffff"), 16u) == Some(65535u as u16);
|
2012-09-14 11:55:33 -05:00
|
|
|
assert parse_bytes(to_bytes(~"z"), 36u) == Some(35u as T);
|
|
|
|
|
|
|
|
assert parse_bytes(to_bytes(~"Z"), 10u).is_none();
|
|
|
|
assert parse_bytes(to_bytes(~"_"), 2u).is_none();
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
2012-06-04 17:22:40 -05:00
|
|
|
|
2013-01-24 14:47:57 -06:00
|
|
|
#[test]
|
|
|
|
fn test_uint_to_str_overflow() {
|
|
|
|
let mut u8_val: u8 = 255_u8;
|
|
|
|
assert (u8::to_str(u8_val) == ~"255");
|
|
|
|
|
|
|
|
u8_val += 1 as u8;
|
|
|
|
assert (u8::to_str(u8_val) == ~"0");
|
|
|
|
|
|
|
|
let mut u16_val: u16 = 65_535_u16;
|
|
|
|
assert (u16::to_str(u16_val) == ~"65535");
|
|
|
|
|
|
|
|
u16_val += 1 as u16;
|
|
|
|
assert (u16::to_str(u16_val) == ~"0");
|
|
|
|
|
|
|
|
let mut u32_val: u32 = 4_294_967_295_u32;
|
|
|
|
assert (u32::to_str(u32_val) == ~"4294967295");
|
|
|
|
|
|
|
|
u32_val += 1 as u32;
|
|
|
|
assert (u32::to_str(u32_val) == ~"0");
|
|
|
|
|
|
|
|
let mut u64_val: u64 = 18_446_744_073_709_551_615_u64;
|
|
|
|
assert (u64::to_str(u64_val) == ~"18446744073709551615");
|
|
|
|
|
|
|
|
u64_val += 1 as u64;
|
|
|
|
assert (u64::to_str(u64_val) == ~"0");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_uint_from_str_overflow() {
|
|
|
|
let mut u8_val: u8 = 255_u8;
|
|
|
|
assert (u8::from_str(~"255") == Some(u8_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u8::from_str(~"256").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
u8_val += 1 as u8;
|
|
|
|
assert (u8::from_str(~"0") == Some(u8_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u8::from_str(~"-1").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
let mut u16_val: u16 = 65_535_u16;
|
|
|
|
assert (u16::from_str(~"65535") == Some(u16_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u16::from_str(~"65536").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
u16_val += 1 as u16;
|
|
|
|
assert (u16::from_str(~"0") == Some(u16_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u16::from_str(~"-1").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
let mut u32_val: u32 = 4_294_967_295_u32;
|
|
|
|
assert (u32::from_str(~"4294967295") == Some(u32_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u32::from_str(~"4294967296").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
u32_val += 1 as u32;
|
|
|
|
assert (u32::from_str(~"0") == Some(u32_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u32::from_str(~"-1").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
let mut u64_val: u64 = 18_446_744_073_709_551_615_u64;
|
|
|
|
assert (u64::from_str(~"18446744073709551615") == Some(u64_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u64::from_str(~"18446744073709551616").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
|
|
|
|
u64_val += 1 as u64;
|
|
|
|
assert (u64::from_str(~"0") == Some(u64_val));
|
2013-01-26 20:21:37 -06:00
|
|
|
assert (u64::from_str(~"-1").is_none());
|
2013-01-24 14:47:57 -06:00
|
|
|
}
|
|
|
|
|
2012-06-04 17:22:40 -05:00
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2012-06-07 23:38:25 -05:00
|
|
|
#[ignore(cfg(windows))]
|
2012-09-26 20:46:12 -05:00
|
|
|
pub fn to_str_radix1() {
|
2013-01-24 14:47:57 -06:00
|
|
|
uint::to_str_radix(100u, 1u);
|
2012-06-04 17:22:40 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2012-06-07 23:38:25 -05:00
|
|
|
#[ignore(cfg(windows))]
|
2013-01-24 14:47:57 -06:00
|
|
|
pub fn to_str_radix37() {
|
|
|
|
uint::to_str_radix(100u, 37u);
|
2012-06-04 17:22:40 -05:00
|
|
|
}
|
A new `times` method on numeric types
This method is intended to elegantly subsume two common iteration functions.
The first is `iter::range`, which is used identically to the method introduced
in this commit, but currently works only on uints. The second is a common case
of `{int, i8, uint, etc.}::range`, in the case where the inductive variable is
ignored. Compare the usage of the three:
```
for iter::range(100u) {
// do whatever
}
for int::range(0, 100) |_i| {
// do whatever
}
for 100.times {
// do whatever
}
```
I feel that the latter reads much more nicely than the first two approaches,
and unlike the first two the new method allows the user to ignore the specific
type of the number (ineed, if we're throwing away the inductive variable, who
cares what type it is?). A minor benefit is that this new method will be
somewhat familiar to users of Ruby, from which we borrow the name "times".
2012-07-05 21:12:26 -05:00
|
|
|
|
2013-01-10 14:18:01 -06:00
|
|
|
use io;
|
|
|
|
#[test]
|
|
|
|
pub fn test_ranges() {
|
|
|
|
let mut l = ~[];
|
|
|
|
|
|
|
|
for range(0,3) |i| {
|
|
|
|
l.push(i);
|
|
|
|
}
|
|
|
|
for range_rev(13,10) |i| {
|
|
|
|
l.push(i);
|
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
for range_step(20,26,2) |i| {
|
2013-01-10 14:18:01 -06:00
|
|
|
l.push(i);
|
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
for range_step(36,30,-2) |i| {
|
2013-01-10 14:18:01 -06:00
|
|
|
l.push(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
assert l == ~[0,1,2,
|
|
|
|
13,12,11,
|
|
|
|
20,22,24,
|
|
|
|
36,34,32];
|
|
|
|
|
|
|
|
// None of the `fail`s should execute.
|
|
|
|
for range(0,0) |_i| {
|
2013-02-11 21:26:38 -06:00
|
|
|
fail!(~"unreachable");
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
|
|
|
for range_rev(0,0) |_i| {
|
2013-02-11 21:26:38 -06:00
|
|
|
fail!(~"unreachable");
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
for range_step(10,0,1) |_i| {
|
2013-02-11 21:26:38 -06:00
|
|
|
fail!(~"unreachable");
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
2013-01-23 17:08:47 -06:00
|
|
|
for range_step(0,1,-10) |_i| {
|
2013-02-11 21:26:38 -06:00
|
|
|
fail!(~"unreachable");
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-10 19:33:05 -06:00
|
|
|
#[test]
|
|
|
|
pub fn test_num() {
|
|
|
|
let ten: T = num::cast(10);
|
|
|
|
let two: T = num::cast(2);
|
|
|
|
|
|
|
|
assert (ten.add(&two) == num::cast(12));
|
|
|
|
assert (ten.sub(&two) == num::cast(8));
|
|
|
|
assert (ten.mul(&two) == num::cast(20));
|
|
|
|
assert (ten.div(&two) == num::cast(5));
|
|
|
|
assert (ten.modulo(&two) == num::cast(0));
|
|
|
|
}
|
|
|
|
|
2013-01-10 14:18:01 -06:00
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2013-01-23 23:57:05 -06:00
|
|
|
#[ignore(cfg(windows))]
|
2013-01-23 17:08:47 -06:00
|
|
|
fn test_range_step_zero_step_up() {
|
|
|
|
for range_step(0,10,0) |_i| {}
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2013-01-23 23:57:05 -06:00
|
|
|
#[ignore(cfg(windows))]
|
2013-01-23 17:08:47 -06:00
|
|
|
fn test_range_step_zero_step_down() {
|
|
|
|
for range_step(0,-10,0) |_i| {}
|
2013-01-10 14:18:01 -06:00
|
|
|
}
|