This is an older version and was released in 2019. The current version is 1.86.0.
Data
| Any | C++ 11 | Safe, generic container for single values of different value types. |
| Safe, generic container for single values of different value types. | ||
| Bimap | C++ 03 | Bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key. |
| Bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key. | ||
| Compressed Pair | C++ 03 | A pair class with empty member optimization. |
| A pair class with empty member optimization. | ||
| Container | C++ 03 | Standard library containers and extensions. |
| Standard library containers and extensions. | ||
| Fusion | C++ 03 | Library for working with tuples, including various containers, algorithms, etc. |
| Library for working with tuples, including various containers, algorithms, etc. | ||
| Geometry | C++ 14 | The Boost.Geometry library provides geometric algorithms, primitives and spatial index. |
| The Boost.Geometry library provides geometric algorithms, primitives and spatial index. | ||
| Heap | C++ 03 | Priority queue data structures. |
| Priority queue data structures. | ||
| Histogram | C++ 14 | Fast multi-dimensional histogram with convenient interface for C++14 |
| Fast multi-dimensional histogram with convenient interface for C++14 | ||
| ICL | C++ 03 | Interval Container Library, interval sets and maps and aggregation of associated values |
| Interval Container Library, interval sets and maps and aggregation of associated values | ||
| Multi-Index | C++ 03 | 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. |
| 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. | ||
| Optional | C++ 11 | 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. |
| 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. | ||
| Pointer Container | C++ 03 | Containers for storing heap-allocated polymorphic objects to ease OO-programming. |
| Containers for storing heap-allocated polymorphic objects to ease OO-programming. | ||
| Polygon | C++ 03 | Voronoi diagram construction and booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates. |
| Voronoi diagram construction and booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates. | ||
| Property Tree | C++ 11 | A tree data structure especially suited to storing configuration data. |
| A tree data structure especially suited to storing configuration data. | ||
| Tuple | C++ 03 | Ease definition of functions returning multiple values, and more. |
| Ease definition of functions returning multiple values, and more. | ||
| Type Erasure | C++ 03 | Runtime polymorphism based on concepts. |
| Runtime polymorphism based on concepts. | ||
| Uuid | C++ 11 | A universally unique identifier. |
| A universally unique identifier. | ||
| Variant | C++ 11 | Safe, generic, stack-based discriminated union container. |
| Safe, generic, stack-based discriminated union container. | ||
| Variant2 | C++ 11 | A never-valueless, strong guarantee implementation of std::variant. |
| A never-valueless, strong guarantee implementation of std::variant. |