summary refs log tree commit diff
path: root/src/libcore/int-template/int.rs
blob: c281185c75e2632e7b706afcdaea3a7361008ba8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// 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.

//! Operations and constants for `int`

pub use self::inst::pow;

mod inst {
    pub type T = int;
    pub const bits: uint = uint::bits;

    /// Returns `base` raised to the power of `exponent`
    pub fn pow(base: int, exponent: uint) -> int {
        if exponent == 0u {
            //Not mathemtically true if ~[base == 0]
            return 1;
        }
        if base     == 0  { return 0; }
        let mut my_pow  = exponent;
        let mut acc     = 1;
        let mut multiplier = base;
        while(my_pow > 0u) {
            if my_pow % 2u == 1u {
                acc *= multiplier;
            }
            my_pow     /= 2u;
            multiplier *= multiplier;
        }
        return acc;
    }

    #[test]
    fn test_pow() {
        assert (pow(0, 0u) == 1);
        assert (pow(0, 1u) == 0);
        assert (pow(0, 2u) == 0);
        assert (pow(-1, 0u) == 1);
        assert (pow(1, 0u) == 1);
        assert (pow(-3, 2u) == 9);
        assert (pow(-3, 3u) == -27);
        assert (pow(4, 9u) == 262144);
    }

    #[test]
    fn test_overflows() {
        assert (max_value > 0);
        assert (min_value <= 0);
        assert (min_value + max_value + 1 == 0);
    }
}