Adapt the tester for permutations

Uses the bool return value now

1 files changed, 13 insertions, 11 deletions

diff --git a/tests/stdlib/tpermutations.nim b/tests/stdlib/tpermutations.nim
index 99bc424cd..a6e07ded6 100644
--- a/tests/stdlib/tpermutations.nim
+++ b/tests/stdlib/tpermutations.nim
@@ -1,17 +1,19 @@
 discard """
-  output: '''@[0, 1, 2, 3, 4, 5, 6, 7, 9, 8]
-@[0, 1, 2, 3, 4, 5, 6, 8, 7, 9]
-@[0, 1, 2, 3, 4, 5, 6, 8, 9, 7]
-@[0, 1, 2, 3, 4, 5, 6, 8, 7, 9]
-@[0, 1, 2, 3, 4, 5, 6, 7, 9, 8]
-@[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]'''
+  output: '''@[0, 2, 1]
+@[1, 0, 2]
+@[1, 2, 0]
+@[2, 0, 1]
+@[2, 1, 0]
+@[2, 0, 1]
+@[1, 2, 0]
+@[1, 0, 2]
+@[0, 2, 1]
+@[0, 1, 2]'''
 """
 import algorithm
 
-var v = @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
-for i in 1..3:
-  v.nextPermutation()
+var v = @[0, 1, 2]
+while v.nextPermutation():
   echo v
-for i in 1..3:
-  v.prevPermutation()
+while v.prevPermutation():
   echo v