On Thu, May 23, 2019 at 8:12 AM Mutz, Marc via Development < development@qt-project.org> wrote:
> On 2019-05-22 22:38, Konstantin Shegunov wrote: > > What about a rather smart (in terms of storage) circular buffer; a > > vector. Then the push, pop, enqueue and dequeue would be amortized > > O(1)? > > You mean like QCircularBuffer? > Yes, exactly like, though it'd need to regrow automatically; and on regrow it may need to normalize the order of elements (hence the "amortized").
_______________________________________________ Development mailing list Development@qt-project.org https://lists.qt-project.org/listinfo/development
