# boost container — RSS Amplifier Recent posts from the 1 feeds in the RSS Amplifier directory that cover boost container. Page: Feed: --- ## [Neoclassical C++ (2): Exploring input-output segmented algorithms](https://boostedcpp.net/2026/08/06/neoclassical-c-2-exploring-input-output-segmented-algorithms/) _2026-08-06 · Ion Gaztañaga · template\_ From one segmented range to two In the first installment of this series we revisited Matt Austern s Segmented Iterators and Hierarchical Algorithms paper and measured what a modern compiler can do when a single-range, single-pass algorithm (find, fill, count, for\_each, ) is decomposed into per-segment flat loops. The results were encouraging: once the per-element block-boundary \[ \] ## [Neoclassical C++: segmented iterators revisited (1)](https://boostedcpp.net/2026/05/18/neoclassical-c-segmented-iterators-revisited-1/) _2026-05-18 · Ion Gaztañaga · template\_ Introduction to segmented iterators The legendary STL library has been an inspiration in the development of the C++ language and libraries. The understanding of the concepts and code developed by Stepanov, Lee, Musser, Austern, etc. is a treasure trove for any C++ programmer. Stepanov’s core claim was that abstraction should have near-zero overhead. He argued \[ \] ## [Inside Boost.Container: comparing different deque implementations](https://boostedcpp.net/2026/03/30/deque/) _2026-03-30 · Ion Gaztañaga · template\_ Many C++ developers have used std::deque, and most assume all implementations are roughly equivalent. In practice, they differ quite a bit. The three major standard library implementations — libc++ (Clang/LLVM), libstdc++ (GCC), and Microsoft STL (Visual Studio) — each make different design choices about block sizes, iterator layout, map management, and memory reclamation. Boost.Container 1.90 \[ \]