mirrors/Nim
1
0
Fork 0
mirror of https://github.com/nim-lang/Nim.git synced 2026-02-13 06:43:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix algorithm.fill for empty input

Browse Source
This commit is contained in:
Oscar Nihlgård
2018-04-04 13:02:14 +02:00
parent da077eea7c
commit 34df046d37
1 changed files with 11 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
lib/pure/algorithm.nim
View File

@@ -24,16 +24,20 @@ proc `*`*(x: int, order: SortOrder): int {.inline.} =
var y = order.ord - 1
result = (x xor y) - y
proc fill*[T](a: var openArray[T], first, last: Natural, value: T) =
## fills the array ``a[first..last]`` with `value`.
template fillImpl[T](a: var openArray[T], first, last: int, value: T) =
var x = first
while x <= last:
a[x] = value
inc(x)
proc fill*[T](a: var openArray[T], first, last: Natural, value: T) =
## fills the array ``a[first..last]`` with `value`.
fillImpl(a, first, last, value)
proc fill*[T](a: var openArray[T], value: T) =
## fills the array `a` with `value`.
fill(a, 0, a.high, value)
fillImpl(a, 0, a.high, value)
proc reverse*[T](a: var openArray[T], first, last: Natural) =
## reverses the array ``a[first..last]``.
@@ -507,3 +511,7 @@ when isMainModule:
doAssert lowerBound([1,2,4], 3, system.cmp[int]) == 2
doAssert lowerBound([1,2,2,3], 4, system.cmp[int]) == 4
doAssert lowerBound([1,2,3,10], 11) == 4
block fillEmptySeq:
var s = newSeq[int]()
s.fill(0)