2012-08-29 18:11:06 -05:00
|
|
|
// NB: transitionary, de-mode-ing.
|
|
|
|
#[forbid(deprecated_mode)];
|
|
|
|
#[forbid(deprecated_pattern)];
|
|
|
|
|
2012-09-04 13:12:17 -05:00
|
|
|
use T = inst::T;
|
|
|
|
use cmp::{Eq, Ord};
|
|
|
|
use from_str::FromStr;
|
2012-04-15 00:07:45 -05:00
|
|
|
|
|
|
|
export min_value, max_value;
|
|
|
|
export min, max;
|
|
|
|
export add, sub, mul, div, rem;
|
|
|
|
export lt, le, eq, ne, ge, gt;
|
|
|
|
export is_positive, is_negative;
|
|
|
|
export is_nonpositive, is_nonnegative;
|
|
|
|
export range;
|
|
|
|
export compl;
|
2012-06-04 20:05:34 -05:00
|
|
|
export to_str, to_str_bytes;
|
2012-09-14 11:55:33 -05:00
|
|
|
export from_str, from_str_radix, str, parse_bytes;
|
2012-07-20 17:33:18 -05:00
|
|
|
export num, ord, eq, times, timesi;
|
2012-08-02 19:14:26 -05:00
|
|
|
export bits, bytes;
|
|
|
|
|
|
|
|
const bits : uint = inst::bits;
|
|
|
|
const bytes : uint = (inst::bits / 8);
|
2012-04-15 00:07:45 -05:00
|
|
|
|
|
|
|
const min_value: T = 0 as T;
|
|
|
|
const max_value: T = 0 as T - 1 as T;
|
|
|
|
|
2012-08-30 14:54:50 -05:00
|
|
|
pure fn min(x: T, y: T) -> T { if x < y { x } else { y } }
|
|
|
|
pure fn max(x: T, y: T) -> T { if x > y { x } else { y } }
|
|
|
|
|
|
|
|
pure fn add(x: T, y: T) -> T { x + y }
|
|
|
|
pure fn sub(x: T, y: T) -> T { x - y }
|
|
|
|
pure fn mul(x: T, y: T) -> T { x * y }
|
|
|
|
pure fn div(x: T, y: T) -> T { x / y }
|
|
|
|
pure fn rem(x: T, y: T) -> T { x % y }
|
|
|
|
|
|
|
|
pure fn lt(x: T, y: T) -> bool { x < y }
|
|
|
|
pure fn le(x: T, y: T) -> bool { x <= y }
|
|
|
|
pure fn eq(x: T, y: T) -> bool { x == y }
|
|
|
|
pure fn ne(x: T, y: T) -> bool { x != y }
|
|
|
|
pure fn ge(x: T, y: T) -> bool { x >= y }
|
|
|
|
pure fn gt(x: T, y: T) -> bool { x > y }
|
2012-04-15 00:07:45 -05:00
|
|
|
|
|
|
|
pure fn is_positive(x: T) -> bool { x > 0 as T }
|
|
|
|
pure fn is_negative(x: T) -> bool { x < 0 as T }
|
|
|
|
pure fn is_nonpositive(x: T) -> bool { x <= 0 as T }
|
|
|
|
pure fn is_nonnegative(x: T) -> bool { x >= 0 as T }
|
|
|
|
|
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-07-20 18:36:42 -05:00
|
|
|
pure fn range(lo: T, hi: T, it: fn(T) -> bool) {
|
2012-04-15 00:07:45 -05:00
|
|
|
let mut i = lo;
|
2012-05-26 02:32:08 -05:00
|
|
|
while i < hi {
|
|
|
|
if !it(i) { break }
|
|
|
|
i += 1 as T;
|
|
|
|
}
|
2012-04-15 00:07:45 -05:00
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Computes the bitwise complement
|
2012-04-15 00:07:45 -05:00
|
|
|
pure fn compl(i: T) -> T {
|
|
|
|
max_value ^ i
|
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2012-08-27 17:44:12 -05:00
|
|
|
impl T: Ord {
|
2012-08-29 21:23:15 -05:00
|
|
|
pure fn lt(&&other: T) -> bool { self < other }
|
|
|
|
pure fn le(&&other: T) -> bool { self <= other }
|
|
|
|
pure fn ge(&&other: T) -> bool { self >= other }
|
|
|
|
pure fn gt(&&other: T) -> bool { self > other }
|
2012-08-27 17:44:12 -05:00
|
|
|
}
|
2012-06-06 16:19:52 -05:00
|
|
|
|
2012-08-27 17:44:12 -05:00
|
|
|
impl T: Eq {
|
2012-09-07 14:06:02 -05:00
|
|
|
pure fn eq(&&other: T) -> bool { return self == other; }
|
|
|
|
pure fn ne(&&other: T) -> bool { return self != other; }
|
2012-06-06 16:19:52 -05:00
|
|
|
}
|
|
|
|
|
2012-08-13 18:20:27 -05:00
|
|
|
impl T: num::Num {
|
2012-08-01 19:30:05 -05:00
|
|
|
pure fn add(&&other: T) -> T { return self + other; }
|
|
|
|
pure fn sub(&&other: T) -> T { return self - other; }
|
|
|
|
pure fn mul(&&other: T) -> T { return self * other; }
|
|
|
|
pure fn div(&&other: T) -> T { return self / other; }
|
|
|
|
pure fn modulo(&&other: T) -> T { return self % other; }
|
|
|
|
pure fn neg() -> T { return -self; }
|
|
|
|
|
|
|
|
pure fn to_int() -> int { return self as int; }
|
2012-08-14 22:03:31 -05:00
|
|
|
static pure fn from_int(n: int) -> T { return n as T; }
|
2012-06-07 18:08:38 -05:00
|
|
|
}
|
|
|
|
|
2012-08-14 18:54:13 -05:00
|
|
|
impl T: iter::Times {
|
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
|
|
|
#[inline(always)]
|
|
|
|
#[doc = "A convenience form for basic iteration. Given a variable `x` \
|
|
|
|
of any numeric type, the expression `for x.times { /* anything */ }` \
|
|
|
|
will execute the given function exactly x times. If we assume that \
|
|
|
|
`x` is an int, this is functionally equivalent to \
|
|
|
|
`for int::range(0, x) |_i| { /* anything */ }`."]
|
2012-08-23 12:22:14 -05:00
|
|
|
pure fn times(it: fn() -> bool) {
|
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
|
|
|
let mut i = self;
|
|
|
|
while i > 0 {
|
|
|
|
if !it() { break }
|
|
|
|
i -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-14 18:54:13 -05:00
|
|
|
impl T: iter::TimesIx {
|
2012-07-20 17:33:18 -05:00
|
|
|
#[inline(always)]
|
|
|
|
/// Like `times`, but with an index, `eachi`-style.
|
2012-08-23 12:22:14 -05:00
|
|
|
pure fn timesi(it: fn(uint) -> bool) {
|
2012-07-20 17:33:18 -05:00
|
|
|
let slf = self as uint;
|
|
|
|
let mut i = 0u;
|
|
|
|
while i < slf {
|
|
|
|
if !it(i) { break }
|
|
|
|
i += 1u;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-02 19:14:26 -05:00
|
|
|
/**
|
|
|
|
* Parse a buffer of bytes
|
|
|
|
*
|
|
|
|
* # Arguments
|
|
|
|
*
|
|
|
|
* * buf - A byte buffer
|
|
|
|
* * radix - The base of the number
|
|
|
|
*
|
|
|
|
* # Failure
|
|
|
|
*
|
|
|
|
* `buf` must not be empty
|
|
|
|
*/
|
2012-09-14 11:55:33 -05:00
|
|
|
fn parse_bytes(buf: &[const u8], radix: uint) -> Option<T> {
|
2012-08-20 14:23:37 -05:00
|
|
|
if vec::len(buf) == 0u { return None; }
|
2012-08-02 19:14:26 -05:00
|
|
|
let mut i = vec::len(buf) - 1u;
|
|
|
|
let mut power = 1u as T;
|
|
|
|
let mut n = 0u as T;
|
|
|
|
loop {
|
2012-08-06 14:34:08 -05:00
|
|
|
match char::to_digit(buf[i] as char, radix) {
|
2012-08-20 14:23:37 -05:00
|
|
|
Some(d) => n += d as T * power,
|
|
|
|
None => return None
|
2012-08-02 19:14:26 -05:00
|
|
|
}
|
|
|
|
power *= radix as T;
|
2012-08-20 14:23:37 -05:00
|
|
|
if i == 0u { return Some(n); }
|
2012-08-02 19:14:26 -05:00
|
|
|
i -= 1u;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Parse a string to an int
|
2012-09-14 11:55:33 -05:00
|
|
|
fn from_str(s: &str) -> Option<T> { parse_bytes(str::to_bytes(s), 10u) }
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2012-09-03 15:09:24 -05:00
|
|
|
impl T : FromStr {
|
|
|
|
static fn from_str(s: &str) -> Option<T> { from_str(s) }
|
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Parse a string as an unsigned integer.
|
2012-08-29 18:11:06 -05:00
|
|
|
fn from_str_radix(buf: &str, radix: u64) -> Option<u64> {
|
2012-08-20 14:23:37 -05:00
|
|
|
if str::len(buf) == 0u { return None; }
|
2012-05-16 00:50:29 -05:00
|
|
|
let mut i = str::len(buf) - 1u;
|
|
|
|
let mut power = 1u64, n = 0u64;
|
|
|
|
loop {
|
2012-08-06 14:34:08 -05:00
|
|
|
match char::to_digit(buf[i] as char, radix as uint) {
|
2012-08-20 14:23:37 -05:00
|
|
|
Some(d) => n += d as u64 * power,
|
|
|
|
None => return None
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
|
|
|
power *= radix;
|
2012-08-20 14:23:37 -05:00
|
|
|
if i == 0u { return Some(n); }
|
2012-05-16 00:50:29 -05:00
|
|
|
i -= 1u;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/**
|
|
|
|
* Convert to a string in a given base
|
|
|
|
*
|
|
|
|
* # Failure
|
|
|
|
*
|
|
|
|
* Fails if `radix` < 2 or `radix` > 16
|
|
|
|
*/
|
2012-07-27 16:54:34 -05:00
|
|
|
pure fn to_str(num: T, radix: uint) -> ~str {
|
2012-06-30 18:19:07 -05:00
|
|
|
do to_str_bytes(false, num, radix) |slice| {
|
2012-09-13 13:46:10 -05:00
|
|
|
do vec::as_imm_buf(slice) |p, len| {
|
2012-09-12 21:55:05 -05:00
|
|
|
unsafe { str::raw::from_buf_len(p, len) }
|
2012-06-04 20:05:34 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Low-level helper routine for string conversion.
|
2012-07-27 16:54:34 -05:00
|
|
|
pure fn to_str_bytes<U>(neg: bool, num: T, radix: uint,
|
2012-06-29 18:26:56 -05:00
|
|
|
f: fn(v: &[u8]) -> U) -> U {
|
2012-06-04 20:05:34 -05:00
|
|
|
|
|
|
|
#[inline(always)]
|
2012-06-04 16:20:57 -05:00
|
|
|
fn digit(n: T) -> u8 {
|
|
|
|
if n <= 9u as T {
|
|
|
|
n as u8 + '0' as u8
|
|
|
|
} else if n <= 15u as T {
|
|
|
|
(n - 10 as T) as u8 + 'a' as u8
|
|
|
|
} else {
|
|
|
|
fail;
|
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
2012-06-04 16:20:57 -05:00
|
|
|
|
2012-06-04 20:05:34 -05:00
|
|
|
assert (1u < radix && radix <= 16u);
|
2012-06-04 16:20:57 -05:00
|
|
|
|
2012-06-04 20:05:34 -05:00
|
|
|
// Enough room to hold any number in any radix.
|
|
|
|
// Worst case: 64-bit number, binary-radix, with
|
|
|
|
// a leading negative sign = 65 bytes.
|
|
|
|
let buf : [mut u8]/65 =
|
|
|
|
[mut
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
0u8,0u8,0u8,0u8,0u8, 0u8,0u8,0u8,0u8,0u8,
|
|
|
|
|
|
|
|
0u8,0u8,0u8,0u8,0u8
|
|
|
|
]/65;
|
|
|
|
|
2012-06-21 18:44:10 -05:00
|
|
|
// FIXME (#2649): post-snapshot, you can do this without the raw
|
|
|
|
// pointers and unsafe bits, and the codegen will prove it's all
|
|
|
|
// in-bounds, no extra cost.
|
2012-06-04 20:05:34 -05:00
|
|
|
|
2012-06-24 22:18:18 -05:00
|
|
|
unsafe {
|
2012-09-13 13:46:10 -05:00
|
|
|
do vec::as_imm_buf(buf) |p, len| {
|
2012-06-24 22:18:18 -05:00
|
|
|
let mp = p as *mut u8;
|
|
|
|
let mut i = len;
|
|
|
|
let mut n = num;
|
|
|
|
let radix = radix as T;
|
|
|
|
loop {
|
|
|
|
i -= 1u;
|
|
|
|
assert 0u < i && i < len;
|
|
|
|
*ptr::mut_offset(mp, i) = digit(n % radix);
|
|
|
|
n /= radix;
|
|
|
|
if n == 0 as T { break; }
|
|
|
|
}
|
|
|
|
|
2012-06-04 20:05:34 -05:00
|
|
|
assert 0u < i && i < len;
|
2012-06-04 16:20:57 -05:00
|
|
|
|
2012-06-24 22:18:18 -05:00
|
|
|
if neg {
|
|
|
|
i -= 1u;
|
|
|
|
*ptr::mut_offset(mp, i) = '-' as u8;
|
|
|
|
}
|
2012-06-04 16:20:57 -05:00
|
|
|
|
2012-09-12 19:45:23 -05:00
|
|
|
vec::raw::form_slice(ptr::offset(p, i),
|
2012-06-24 22:18:18 -05:00
|
|
|
len - i, f)
|
2012-06-04 20:05:34 -05:00
|
|
|
}
|
2012-06-04 16:20:57 -05:00
|
|
|
}
|
2012-05-16 00:50:29 -05:00
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/// Convert to a string
|
2012-08-01 19:30:05 -05:00
|
|
|
fn str(i: T) -> ~str { return to_str(i, 10u); }
|
2012-05-16 00:50:29 -05:00
|
|
|
|
2012-06-04 20:05:34 -05:00
|
|
|
#[test]
|
|
|
|
fn test_to_str() {
|
2012-07-14 00:57:48 -05:00
|
|
|
assert to_str(0 as T, 10u) == ~"0";
|
|
|
|
assert to_str(1 as T, 10u) == ~"1";
|
|
|
|
assert to_str(2 as T, 10u) == ~"2";
|
|
|
|
assert to_str(11 as T, 10u) == ~"11";
|
|
|
|
assert to_str(11 as T, 16u) == ~"b";
|
|
|
|
assert to_str(255 as T, 16u) == ~"ff";
|
|
|
|
assert to_str(0xff as T, 10u) == ~"255";
|
2012-06-04 20:05:34 -05:00
|
|
|
}
|
|
|
|
|
2012-05-16 00:50:29 -05:00
|
|
|
#[test]
|
2012-05-16 18:58:02 -05:00
|
|
|
#[ignore]
|
2012-05-16 00:50:29 -05:00
|
|
|
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);
|
|
|
|
assert from_str(~"123456789") == Some(123456789u as T);
|
|
|
|
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-05-16 18:58:02 -05:00
|
|
|
#[ignore]
|
2012-09-14 11:55:33 -05:00
|
|
|
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);
|
|
|
|
assert parse_bytes(to_bytes(~"123"), 16u) == Some(291u as T);
|
|
|
|
assert parse_bytes(to_bytes(~"ffff"), 16u) == Some(65535u as T);
|
|
|
|
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
|
|
|
|
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2012-06-07 23:38:25 -05:00
|
|
|
#[ignore(cfg(windows))]
|
2012-06-04 17:22:40 -05:00
|
|
|
fn to_str_radix1() {
|
|
|
|
uint::to_str(100u, 1u);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
#[should_fail]
|
2012-06-07 23:38:25 -05:00
|
|
|
#[ignore(cfg(windows))]
|
2012-06-04 17:22:40 -05:00
|
|
|
fn to_str_radix17() {
|
|
|
|
uint::to_str(100u, 17u);
|
|
|
|
}
|
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
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_times() {
|
2012-09-07 20:08:21 -05:00
|
|
|
use iter::Times;
|
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
|
|
|
let ten = 10 as T;
|
|
|
|
let mut accum = 0;
|
|
|
|
for ten.times { accum += 1; }
|
|
|
|
assert (accum == 10);
|
|
|
|
}
|