On: C++: The most important complexities

[foma-roje]

An often missed c++ Container is std::deque, which has constant O(1) complexities in adding and removing from front and back, and accessing random elements. This is missing in the article.

[mike_hock → foma-roje]

Which only has a reasonable implementation in one of the three major stdlibs (libc++).

[nly → mike_hock]

Boosts implementation has a configurable block size.

[mgaunard → mike_hock]

The libstdc++ one is also pretty good.