diff options
| author | Oscar Campbell <oscar@campbell.nu> | 2015-05-25 19:51:58 +0200 |
|---|---|---|
| committer | Oscar Campbell <oscar@campbell.nu> | 2015-05-25 19:51:58 +0200 |
| commit | f6c12853ea996ef6307d0e5fd6738d0aaa2bd1e7 (patch) | |
| tree | 1d9e468089a169fc9fd44678c19194eaa2c8a3c8 /lib/pure/algorithm.nim | |
| parent | 625299e861173266d0393ffdd76e66be9cb0c34d (diff) | |
| parent | 71561bef5846fbbfea1f77ecba1f9d6d7426ca43 (diff) | |
| download | Nim-f6c12853ea996ef6307d0e5fd6738d0aaa2bd1e7.tar.gz | |
Merge remote-tracking branch 'upstream/devel' into devel
Diffstat (limited to 'lib/pure/algorithm.nim')
| -rw-r--r-- | lib/pure/algorithm.nim | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim index 46d049f14..0eafb316a 100644 --- a/lib/pure/algorithm.nim +++ b/lib/pure/algorithm.nim @@ -243,7 +243,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: @@ -253,8 +253,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 |