jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Added documentation

Browse source 
Now `isSorted` is documented.
This commit is contained in:
apense 2015-06-18 18:53:42 -04:00
commit dc41beed5a
1 changed files with 3 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

3
lib/pure/algorithm.nim
View file

@ -240,6 +240,9 @@ template sortedByIt*(seq1, op: expr): expr =
proc isSorted*[T](a: openarray[T], proc isSorted*[T](a: openarray[T],
cmp: proc(x, y: T): int {.closure.}, cmp: proc(x, y: T): int {.closure.},
order = SortOrder.Ascending): bool = order = SortOrder.Ascending): bool =
## Checks to see whether `a` is already sorted in `order`
## using `cmp` for the comparison. Parameters identical
## to `sort`
result = true result = true
for i in 0..<len(a)-1: for i in 0..<len(a)-1:
if cmp(a[i],a[i+1]) * order > 0: if cmp(a[i],a[i+1]) * order > 0: