Add std.sort, with a simple mergesort.

1 files changed, 50 insertions, 0 deletions

diff --git a/src/test/run-pass/lib-sort.rs b/src/test/run-pass/lib-sort.rs
new file mode 100644
index 00000000..e2c3465c
--- /dev/null
+++ b/src/test/run-pass/lib-sort.rs
@@ -0,0 +1,50 @@
+use std;
+
+fn check_sort(vec[int] v1, vec[int] v2) {
+  auto len = std._vec.len[int](v1);
+  fn lteq(&int a, &int b) -> bool {
+    ret a <= b;
+  }
+  auto f = lteq;
+  auto v3 = std.sort.merge_sort[int](f, v1);
+  auto i = 0u;
+  while (i < len) {
+    log v3.(i);
+    check (v3.(i) == v2.(i));
+    i += 1u;
+  }
+}
+
+fn main() {
+  {
+    auto v1 = vec(3,7,4,5,2,9,5,8);
+    auto v2 = vec(2,3,4,5,5,7,8,9);
+    check_sort(v1, v2);
+  }
+
+  {
+    auto v1 = vec(1,1,1);
+    auto v2 = vec(1,1,1);
+    check_sort(v1, v2);
+  }
+
+  {
+    let vec[int] v1 = vec();
+    let vec[int] v2 = vec();
+    check_sort(v1, v2);
+  }
+
+  {
+    auto v1 = vec(9);
+    auto v2 = vec(9);
+    check_sort(v1, v2);
+  }
+
+  {
+    auto v1 = vec(9,3,3,3,9);
+    auto v2 = vec(3,3,3,9,9);
+    check_sort(v1, v2);
+  }
+
+}
+