summary refs log tree commit diff stats
diff options
context:
space:
mode:
authorReimer Behrends <behrends@gmail.com>2015-08-14 15:14:56 +0200
committerReimer Behrends <behrends@gmail.com>2015-08-14 15:14:56 +0200
commit4e222a15064846946b18d0aa3c5279924b6bad7f (patch)
tree7e6a660d2d08e3e0dc33129dfdef10be8a7ba5e1
parent134c44f3be373a94fd5ee144d98cd296ee967107 (diff)
downloadNim-4e222a15064846946b18d0aa3c5279924b6bad7f.tar.gz
Fixed algorithm.reversed to work for empty seq's.
-rw-r--r--lib/pure/algorithm.nim3
1 files changed, 2 insertions, 1 deletions
diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim
index 3671a9e09..c0acae138 100644
--- a/lib/pure/algorithm.nim
+++ b/lib/pure/algorithm.nim
@@ -48,8 +48,9 @@ proc reverse*[T](a: var openArray[T]) =
   ## reverses the array `a`.
   reverse(a, 0, a.high)
 
-proc reversed*[T](a: openArray[T], first, last: Natural): seq[T] =
+proc reversed*[T](a: openArray[T], first: Natural, last: int): seq[T] =
   ## returns the reverse of the array `a[first..last]`.
+  assert last >= first-1
   var i = last - first
   var x = first.int
   result = newSeq[T](i + 1)