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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
// 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.
// xfail-fast
use std::uint;
use std::vec;
pub trait plus {
fn plus(&self) -> int;
}
mod a {
use plus;
impl plus for uint { fn plus(&self) -> int { *self as int + 20 } }
}
mod b {
use plus;
impl plus for ~str { fn plus(&self) -> int { 200 } }
}
trait uint_utils {
fn str(&self) -> ~str;
fn multi(&self, f: &fn(uint));
}
impl uint_utils for uint {
fn str(&self) -> ~str { uint::to_str(*self) }
fn multi(&self, f: &fn(uint)) {
let mut c = 0u;
while c < *self { f(c); c += 1u; }
}
}
trait vec_utils<T> {
fn length_(&self, ) -> uint;
fn iter_(&self, f: &fn(&T));
fn map_<U:Copy>(&self, f: &fn(&T) -> U) -> ~[U];
}
impl<T> vec_utils<T> for ~[T] {
fn length_(&self) -> uint { self.len() }
fn iter_(&self, f: &fn(&T)) { for self.iter().advance |x| { f(x); } }
fn map_<U:Copy>(&self, f: &fn(&T) -> U) -> ~[U] {
let mut r = ~[];
for self.iter().advance |elt| {
r.push(f(elt));
}
r
}
}
pub fn main() {
assert_eq!(10u.plus(), 30);
assert_eq!((~"hi").plus(), 200);
assert_eq!((~[1]).length_().str(), ~"1");
assert_eq!((~[3, 4]).map_(|a| *a + 4 )[0], 7);
assert_eq!((~[3, 4]).map_::<uint>(|a| *a as uint + 4u )[0], 7u);
let mut x = 0u;
10u.multi(|_n| x += 2u );
assert_eq!(x, 20u);
}
|
