Hacker News new | ask | show | jobs
by foma-roje 950 days ago
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.
1 comments

Which only has a reasonable implementation in one of the three major stdlibs (libc++).
Boosts implementation has a configurable block size.
The libstdc++ one is also pretty good.