diff options
| author | Dominik Picheta <dominikpicheta@gmail.com> | 2017-02-10 00:05:42 +0100 |
|---|---|---|
| committer | Dominik Picheta <dominikpicheta@gmail.com> | 2017-02-10 00:05:42 +0100 |
| commit | c4d5cc652f9207d3c30f0746babaa5186e845ebb (patch) | |
| tree | b3611fd79dcb23aa5a380209124daacff522ec39 /lib/pure | |
| parent | 32864809856352ad9b537fdb7bc8e936cfdc99ee (diff) | |
| download | Nim-c4d5cc652f9207d3c30f0746babaa5186e845ebb.tar.gz | |
Work around issue with queues. Refs #4773.
Diffstat (limited to 'lib/pure')
| -rw-r--r-- | lib/pure/collections/queues.nim | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/pure/collections/queues.nim b/lib/pure/collections/queues.nim index 0490ae494..401422162 100644 --- a/lib/pure/collections/queues.nim +++ b/lib/pure/collections/queues.nim @@ -144,7 +144,7 @@ proc add*[T](q: var Queue[T], item: T) = var cap = q.mask+1 if unlikely(q.count >= cap): var n = newSeq[T](cap*2) - for i, x in q: # don't use copyMem because the GC and because it's slower. + for i, x in pairs(q): # don't use copyMem because the GC and because it's slower. shallowCopy(n[i], x) shallowCopy(q.data, n) q.mask = cap*2 - 1 |