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

Removed redundant check

Browse source 
Loop takes care of it already
This commit is contained in:
apense 2015-06-18 14:43:38 -04:00
commit 138cf777da
1 changed files with 0 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

2
lib/pure/algorithm.nim
View file

@ -240,8 +240,6 @@ 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 =
if len(a) <= 1: return true
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: