From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2020-05-22 14:31:19
On Fri, 22 May 2020 at 15:08, Andrey Semashev via Boost
> However, std::deque continues to dynamically allocate chunks as you push
> and pop elements, even if the average number of enqueued elements stays
> the same. This is avoided by ring queues.
Nothing prevents you from using a pool allocator with a deque.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk