diff options
| author | Andreas Rumpf <rumpf_a@web.de> | 2015-08-21 17:06:30 +0200 |
|---|---|---|
| committer | Andreas Rumpf <rumpf_a@web.de> | 2015-08-21 17:06:30 +0200 |
| commit | e4c164144da79979d3df47caba3009d660541a33 (patch) | |
| tree | d15812eb7213f8ef8b29eb2e61a5713919697b4e | |
| parent | 979271f3188c04dd0922a29fa9329ad25a100adf (diff) | |
| parent | 4e222a15064846946b18d0aa3c5279924b6bad7f (diff) | |
| download | Nim-e4c164144da79979d3df47caba3009d660541a33.tar.gz | |
Merge pull request #3215 from rbehrends/fix-reversed-empty
Fixed algorithm.reversed to work for empty seq's.
| -rw-r--r-- | lib/pure/algorithm.nim | 3 |
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) |