sort: missing vector coverage in tests.

* tests/012/sort.tl: The larger input tests are
testing only vectors, thus covering neither
quicksort nor array binary merge. Cases
added.

1 files changed, 18 insertions, 4 deletions

diff --git a/tests/012/sort.tl b/tests/012/sort.tl
index 1fcc0c2d..241b0c45 100644
--- a/tests/012/sort.tl
+++ b/tests/012/sort.tl
@@ -15,12 +15,19 @@
           (car sp) vec))
 
 (let* ((list (range* 0 1000))
-       (slist (shuffle list)))
+       (slist (shuffle list))
+       (vec (vec-list list))
+       (svec (vec-list slist)))
   (mvtest
     (sort list) list
     (sort slist) list
     (sort list (fun greater)) (reverse list)
-    (sort slist (fun greater)) (reverse list)))
+    (sort slist (fun greater)) (reverse list))
+  (mvtest
+    (sort vec) vec
+    (sort svec) vec
+    (sort vec (fun greater)) (reverse vec)
+    (sort svec (fun greater)) (reverse vec)))
 
 (test (ssort ()) nil)
 
@@ -37,9 +44,16 @@
           (car sp) vec))
 
 (let* ((list (range* 0 1000))
-       (slist (shuffle list)))
+       (slist (shuffle list))
+       (vec (vec-list list))
+       (svec (vec-list slist)))
   (mvtest
     (ssort list) list
     (ssort slist) list
     (ssort list (fun greater)) (reverse list)
-    (ssort slist (fun greater)) (reverse list)))
+    (ssort slist (fun greater)) (reverse list))
+  (mvtest
+    (ssort vec) vec
+    (ssort svec) vec
+    (ssort vec (fun greater)) (reverse vec)
+    (ssort svec (fun greater)) (reverse vec)))