...one of the most highly
regarded and expertly designed C++ library projects in the
world. — Herb Sutter and Andrei
Copyright © 2009-2018 Ion Gaztanaga
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Table of Contents
Boost.Container library implements several well-known containers, including STL containers. The aim of the library is to offer advanced features not present in standard containers or to offer the latest standard draft features for compilers that don't comply with the latest C++ standard.
In short, what does Boost.Container offer?
flat_multiset: drop-in replacements for standard associative containers but more memory friendly and with faster searches.
stable_vector: a std::list and std::vector hybrid container: vector-like random-access iterators and list-like iterator stability in insertions and erasures.
static_vector: a vector-like container that internally embeds (statically allocates) all needed memory up to the maximum capacity. Maximum capacity can't be increased and it's specified at compile time.
small_vector: a vector-like container that internally embeds (statically allocates) a minimum amount of memory, but dynamically allocates elements when capacity has to be increased. This minimum capacity is specified at compile time.
slist: the classic pre-standard singly linked list implementation offering constant-time
size(). Note that C++11
There is no need to compile Boost.Container, since it's a header-only library, just include your Boost header directory in your compiler include path except if you use:
Those exceptions are are implemented as a separately compiled library, so in those cases you must install binaries in a location that can be found by your linker. If you followed the Boost Getting Started instructions, that's already been done for you.
Boost.Container requires a decent C++03 compatibility. Some compilers known to work are:
Last revised: August 11, 2020 at 15:03:12 GMT