Safe, generic container for single values of different value types.

Bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key.

Empty member optimization.

Standard library containers and extensions.

Library for working with tuples, including various containers, algorithms, etc.

The Boost.Geometry library provides geometric algorithms, primitives and spatial index.

Priority queue data structures.

Interval Container Library, interval sets and maps and aggregation of associated values

The Boost Multi-index Containers Library provides a class template named multi_index_container which enables the construction of containers maintaining one or more indices with different sorting and access semantics.

A value-semantic, type-safe wrapper for representing 'optional' (or 'nullable') objects of a given type. An optional object may or may not contain a value of the underlying type.

Containers for storing heap-allocated polymorphic objects to ease OO-programming.

Voronoi diagram construction and booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.

A tree data structure especially suited to storing configuration data.

No description provide for this version.

Runtime polymorphism based on concepts.

A universally unique identifier.

Safe, generic, stack-based discriminated union container.