2012-06-29 18:26:56 -05:00
|
|
|
fn iter<T>(v: ~[T], it: fn(T) -> bool) {
|
2012-03-27 05:33:13 -05:00
|
|
|
let mut i = 0u, l = v.len();
|
|
|
|
while i < l {
|
|
|
|
if !it(v[i]) { break; }
|
|
|
|
i += 1u;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-29 18:26:56 -05:00
|
|
|
fn find_pos<T>(n: T, h: ~[T]) -> option<uint> {
|
2012-03-27 05:33:13 -05:00
|
|
|
let mut i = 0u;
|
|
|
|
for iter(h) {|e|
|
|
|
|
if e == n { ret some(i); }
|
|
|
|
i += 1u;
|
|
|
|
}
|
|
|
|
none
|
|
|
|
}
|
|
|
|
|
2012-06-29 18:26:56 -05:00
|
|
|
fn bail_deep(x: ~[~[bool]]) {
|
2012-03-27 05:33:13 -05:00
|
|
|
let mut seen = false;
|
|
|
|
for iter(x) {|x|
|
|
|
|
for iter(x) {|x|
|
|
|
|
assert !seen;
|
|
|
|
if x { seen = true; ret; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
assert !seen;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn ret_deep() -> str {
|
2012-06-29 18:26:56 -05:00
|
|
|
for iter(~[1, 2]) {|e|
|
|
|
|
for iter(~[3, 4]) {|x|
|
2012-03-27 05:33:13 -05:00
|
|
|
if e + x > 4 { ret "hi"; }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ret "bye";
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
let mut last = 0;
|
2012-06-29 18:26:56 -05:00
|
|
|
for vec::all(~[1, 2, 3, 4, 5, 6, 7]) {|e|
|
2012-03-27 05:33:13 -05:00
|
|
|
last = e;
|
|
|
|
if e == 5 { break; }
|
|
|
|
if e % 2 == 1 { cont; }
|
|
|
|
assert e % 2 == 0;
|
|
|
|
};
|
|
|
|
assert last == 5;
|
|
|
|
|
2012-06-29 18:26:56 -05:00
|
|
|
assert find_pos(1, ~[0, 1, 2, 3]) == some(1u);
|
|
|
|
assert find_pos(1, ~[0, 4, 2, 3]) == none;
|
|
|
|
assert find_pos("hi", ~["foo", "bar", "baz", "hi"]) == some(3u);
|
2012-03-27 05:33:13 -05:00
|
|
|
|
2012-06-29 18:26:56 -05:00
|
|
|
bail_deep(~[~[false, false], ~[true, true], ~[false, true]]);
|
|
|
|
bail_deep(~[~[true]]);
|
|
|
|
bail_deep(~[~[false, false, false]]);
|
2012-03-27 05:33:13 -05:00
|
|
|
|
|
|
|
assert ret_deep() == "hi";
|
|
|
|
}
|