---

yaml
---
r: 2728
b: refs/heads/master
c: b4c9f78
h: refs/heads/master
v: v3

Author: brson

[refs]

@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 1e9aef828c057356badd464fcf7edb2f02d0b216
+refs/heads/master: b4c9f782e4ef8ec44e6de944023557df9a34c212

trunk/src/lib/list.rs

@@ -10,6 +10,17 @@ tag list[T] {
     nil;
 }
 
+fn from_vec[T](vec[T] v) -> list[T] {
+    auto l = nil[T];
+    // 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.
+    for (T item in vec::reversed(v)) {
+        l = cons[T](item, @l);
+    }
+    ret l;
+}
+
 fn foldl[T,U](&list[T] ls, &U u, fn(&T t, &U u) -> U f) -> U {
     alt(ls) {
         case (cons[T](?hd, ?tl)) {

trunk/src/test/run-pass/lib-list.rs

@@ -0,0 +1,16 @@
+use std;
+import std::list;
+import std::list::car;
+import std::list::cdr;
+import std::list::from_vec;
+
+fn test_from_vec() {
+  auto l = from_vec([0, 1, 2]);
+  assert (car(l) == 0);
+  assert (car(cdr(l)) == 1);
+  assert (car(cdr(cdr(l))) == 2);
+}
+
+fn main() {
+  test_from_vec();
+}