Work around issue with queues. Refs #4773.
This commit is contained in:
parent
3286480985
commit
c4d5cc652f
1 changed files with 1 additions and 1 deletions
|
|
@ -144,7 +144,7 @@ proc add*[T](q: var Queue[T], item: T) =
|
||||||
var cap = q.mask+1
|
var cap = q.mask+1
|
||||||
if unlikely(q.count >= cap):
|
if unlikely(q.count >= cap):
|
||||||
var n = newSeq[T](cap*2)
|
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(n[i], x)
|
||||||
shallowCopy(q.data, n)
|
shallowCopy(q.data, n)
|
||||||
q.mask = cap*2 - 1
|
q.mask = cap*2 - 1
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue