3 fn add(int x, int y) -> int { ret x + y; }
5 fn sub(int x, int y) -> int { ret x - y; }
7 fn mul(int x, int y) -> int { ret x * y; }
9 fn div(int x, int y) -> int { ret x / y; }
11 fn rem(int x, int y) -> int { ret x % y; }
13 fn lt(int x, int y) -> bool { ret x < y; }
15 fn le(int x, int y) -> bool { ret x <= y; }
17 fn eq(int x, int y) -> bool { ret x == y; }
19 fn ne(int x, int y) -> bool { ret x != y; }
21 fn ge(int x, int y) -> bool { ret x >= y; }
23 fn gt(int x, int y) -> bool { ret x > y; }
25 fn positive(int x) -> bool { ret x > 0; }
27 fn negative(int x) -> bool { ret x < 0; }
29 fn nonpositive(int x) -> bool { ret x <= 0; }
31 fn nonnegative(int x) -> bool { ret x >= 0; }
34 // FIXME: Make sure this works with negative integers.
35 fn hash(&int x) -> uint { ret x as uint; }
37 fn eq_alias(&int x, &int y) -> bool { ret x == y; }
39 iter range(int lo, int hi) -> int {
41 while (lo_ < hi) { put lo_; lo_ += 1; }
44 fn to_str(int n, uint radix) -> str {
45 assert (0u < radix && radix <= 16u);
47 "-" + uint::to_str(-n as uint, radix)
48 } else { uint::to_str(n as uint, radix) };
50 fn str(int i) -> str { ret to_str(i, 10u); }
52 fn pow(int base, uint exponent) -> int {
53 ret if (exponent == 0u) {
55 } else if (base == 0) {
59 auto count = exponent;
60 while (count > 1u) { accum *= base; count -= 1u; }
67 // indent-tabs-mode: nil
69 // buffer-file-coding-system: utf-8-unix
70 // compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'";