Il 22/05/19 20:14, Konstantin Tokarev ha scritto:
FWIW, std::deque is implemented as a peculiar data strucutre which is not really contiguous, and it may perform worse than QList in certain cases[citation needed], as usual.https://en.cppreference.com/w/cpp/container/deque"As opposed to std::vector, the elements of a deque are not stored contiguously: typical implementations use a sequence of individually allocated fixed-size arrays, with additional bookkeeping, which means indexed access to deque must perform two pointer dereferences, compared to vector's indexed access which performs only one."
Sure, but the question was about usage of a std::deque vs QList for fast prepending behavior, not for indexed access. Sticking to the same reference, it _also_ points out that appending at either extremity of std::deque is O(1) (vs. O(n) for QList). So, again, [citation needed].
Thanks, -- Giuseppe D'Angelo | giuseppe.dang...@kdab.com | Senior Software Engineer KDAB (France) S.A.S., a KDAB Group company Tel. France +33 (0)4 90 84 08 53, http://www.kdab.com KDAB - The Qt, C++ and OpenGL Experts
smime.p7s
Description: Firma crittografica S/MIME
_______________________________________________ Development mailing list Development@qt-project.org https://lists.qt-project.org/listinfo/development
