You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I expected TBQueue to be backed by an array, instead of a pair of lists. This would get rid of the amortization and should cause less allocations. Have there been any benchmarks showing that the current version is faster?
The text was updated successfully, but these errors were encountered:
dataTBQueuea=TBQueue
(TArraya) -- a ring buffer of entries
(TVarInt) -- Index of first queued entry
(TVarInt) -- Index of last queued entry
This sounds plausible to me.
The implementation is likely as it is since no one has tried improving it. Do try writing an array based implementation and benchmark it against the current list-based approach.
I expected
TBQueue
to be backed by an array, instead of a pair of lists. This would get rid of the amortization and should cause less allocations. Have there been any benchmarks showing that the current version is faster?The text was updated successfully, but these errors were encountered: