2011-05-12 10:24:54 -05:00
|
|
|
import option::some;
|
|
|
|
import option::none;
|
2010-10-18 16:35:44 -05:00
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
tag list[T] { cons(T, @list[T]); nil; }
|
2010-10-16 00:09:09 -05:00
|
|
|
|
2011-08-12 01:11:15 -05:00
|
|
|
fn from_vec[@T](v: &[T]) -> list[T] {
|
2011-07-27 07:19:39 -05:00
|
|
|
let l = nil[T];
|
2011-05-21 23:11:28 -05:00
|
|
|
// FIXME: This would be faster and more space efficient if it looped over
|
|
|
|
// a reverse vector iterator. Unfortunately generic iterators seem not to
|
|
|
|
// work yet.
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2011-08-12 01:11:15 -05:00
|
|
|
for item: T in ivec::reversed(v) { l = cons[T](item, @l); }
|
2011-05-21 23:11:28 -05:00
|
|
|
ret l;
|
|
|
|
}
|
|
|
|
|
2011-08-12 13:47:44 -05:00
|
|
|
fn foldl[@T, @U](ls_: &list[T], u: &U, f: &block(&T, &U) -> U ) -> U {
|
2011-07-27 07:19:39 -05:00
|
|
|
let accum: U = u;
|
|
|
|
let ls = ls_;
|
|
|
|
while true {
|
|
|
|
alt ls {
|
|
|
|
cons(hd, tl) { accum = f(hd, accum); ls = *tl; }
|
|
|
|
nil. { break; }
|
2011-05-21 21:11:42 -05:00
|
|
|
}
|
2010-10-18 16:35:44 -05:00
|
|
|
}
|
2011-06-15 14:38:43 -05:00
|
|
|
ret accum;
|
2010-10-18 16:35:44 -05:00
|
|
|
}
|
|
|
|
|
2011-08-12 13:47:44 -05:00
|
|
|
fn find[@T, @U](ls_: &list[T], f: &block(&T) -> option::t[U])
|
|
|
|
-> option::t[U] {
|
2011-07-27 07:19:39 -05:00
|
|
|
let ls = ls_;
|
|
|
|
while true {
|
|
|
|
alt ls {
|
|
|
|
cons(hd, tl) {
|
|
|
|
alt f(hd) { none. { ls = *tl; } some(rs) { ret some(rs); } }
|
|
|
|
}
|
|
|
|
nil. { break; }
|
2010-10-18 16:35:44 -05:00
|
|
|
}
|
|
|
|
}
|
2011-06-15 14:38:43 -05:00
|
|
|
ret none;
|
2010-10-18 16:35:44 -05:00
|
|
|
}
|
|
|
|
|
2011-07-29 14:58:52 -05:00
|
|
|
fn has[@T](ls_: &list[T], elt: &T) -> bool {
|
2011-07-27 07:19:39 -05:00
|
|
|
let ls = ls_;
|
|
|
|
while true {
|
|
|
|
alt ls {
|
|
|
|
cons(hd, tl) { if elt == hd { ret true; } else { ls = *tl; } }
|
2011-08-09 19:36:07 -05:00
|
|
|
nil. { break; }
|
2011-05-25 11:54:43 -05:00
|
|
|
}
|
|
|
|
}
|
2011-08-09 19:36:07 -05:00
|
|
|
ret false;
|
2011-05-25 11:54:43 -05:00
|
|
|
}
|
|
|
|
|
2011-07-29 20:38:22 -05:00
|
|
|
fn length[@T](ls: &list[T]) -> uint {
|
2011-07-27 07:19:39 -05:00
|
|
|
fn count[T](t: &T, u: &uint) -> uint { ret u + 1u; }
|
2011-08-09 19:36:07 -05:00
|
|
|
ret foldl(ls, 0u, count);
|
2010-10-18 16:35:44 -05:00
|
|
|
}
|
2010-10-16 00:09:09 -05:00
|
|
|
|
2011-08-09 19:36:07 -05:00
|
|
|
fn cdr[@T](ls: &list[T]) -> list[T] {
|
|
|
|
alt ls {
|
|
|
|
cons(_, tl) { ret *tl; }
|
|
|
|
nil. { fail "list empty" }
|
|
|
|
}
|
|
|
|
}
|
2011-05-09 05:40:09 -05:00
|
|
|
|
2011-08-09 19:36:07 -05:00
|
|
|
fn car[@T](ls: &list[T]) -> T {
|
|
|
|
alt ls {
|
|
|
|
cons(hd, _) { ret hd; }
|
|
|
|
nil. { fail "list empty" }
|
|
|
|
}
|
|
|
|
}
|
2011-05-26 21:05:23 -05:00
|
|
|
|
2011-07-29 14:58:52 -05:00
|
|
|
fn append[@T](l: &list[T], m: &list[T]) -> list[T] {
|
2011-07-27 07:19:39 -05:00
|
|
|
alt l {
|
|
|
|
nil. { ret m; }
|
|
|
|
cons(x, xs) {
|
2011-08-09 19:36:07 -05:00
|
|
|
let rest = append(*xs, m);
|
|
|
|
ret cons(x, @rest);
|
2011-07-27 07:19:39 -05:00
|
|
|
}
|
2011-05-26 21:05:23 -05:00
|
|
|
}
|
|
|
|
}
|
2011-08-09 19:36:07 -05:00
|
|
|
|
2010-10-16 00:09:09 -05:00
|
|
|
// Local Variables:
|
|
|
|
// mode: rust;
|
|
|
|
// fill-column: 78;
|
|
|
|
// indent-tabs-mode: nil
|
|
|
|
// c-basic-offset: 4
|
|
|
|
// buffer-file-coding-system: utf-8-unix
|
2011-06-15 14:01:19 -05:00
|
|
|
// compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
|
2010-10-16 00:09:09 -05:00
|
|
|
// End:
|