summary refs log tree commit diff stats
path: root/lib/pure/algorithm.nim
diff options
context:
space:
mode:
authorSimon Hafner <hafnersimon@gmail.com>2015-04-01 06:33:24 +0500
committerSimon Hafner <hafnersimon@gmail.com>2015-04-01 06:33:24 +0500
commita339cb5ed5e2389ad77ee05d2e553cbf43f279b2 (patch)
tree91182bc92f2421f95e618fdc2d0375022f3839eb /lib/pure/algorithm.nim
parent06b7892ed0878f06c54fa178a07d9844b4fa760f (diff)
parent165619552a7ad0fa4f594963ee0441dd711edfd4 (diff)
downloadNim-a339cb5ed5e2389ad77ee05d2e553cbf43f279b2.tar.gz
Merge branch 'devel' into jpoirier-realtimeGCTest
Diffstat (limited to 'lib/pure/algorithm.nim')
-rw-r--r--lib/pure/algorithm.nim6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim
index 08d224dfd..a1ab7be13 100644
--- a/lib/pure/algorithm.nim
+++ b/lib/pure/algorithm.nim
@@ -253,16 +253,16 @@ proc product*[T](x: openArray[seq[T]]): seq[seq[T]] =
   while true:
     while indexes[index] == -1:
       indexes[index] = initial[index]
-      index +=1
+      index += 1
       if index == x.len: return
-      indexes[index] -=1
+      indexes[index] -= 1
     for ni, i in indexes:
       next[ni] = x[ni][i]
     var res: seq[T]
     shallowCopy(res, next)
     result.add(res)
     index = 0
-    indexes[index] -=1
+    indexes[index] -= 1
 
 proc nextPermutation*[T](x: var openarray[T]): bool {.discardable.} =
   ## Calculates the next lexicographic permutation, directly modifying ``x``.