From 7b26df50d75f64216997c71a304c7b413fc65dda Mon Sep 17 00:00:00 2001 From: apense Date: Fri, 15 May 2015 23:52:55 -0400 Subject: [PATCH] Small sequence fix for algorithm.nim Since #853 was fixed, this should work fine. The `result = @[]` was swapped to the same syntax, too. --- lib/pure/algorithm.nim | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim index 6dfdff2750..352b177e23 100644 --- a/lib/pure/algorithm.nim +++ b/lib/pure/algorithm.nim @@ -232,7 +232,7 @@ template sortedByIt*(seq1, op: expr): expr = proc product*[T](x: openArray[seq[T]]): seq[seq[T]] = ## produces the Cartesian product of the array. Warning: complexity ## may explode. - result = @[] + result = newSeq[seq[T]]() if x.len == 0: return if x.len == 1: @@ -242,8 +242,7 @@ proc product*[T](x: openArray[seq[T]]): seq[seq[T]] = indexes = newSeq[int](x.len) initial = newSeq[int](x.len) index = 0 - # replace with newSeq as soon as #853 is fixed - var next: seq[T] = @[] + var next = newSeq[T]() next.setLen(x.len) for i in 0..(x.len-1): if len(x[i]) == 0: return