Array
|
C++
03
|
STL compliant container wrapper for arrays of constant size. |
STL compliant container wrapper for arrays of constant size. |
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. |
Circular Buffer
|
C++
03
|
A STL compliant container also known as ring or cyclic buffer. |
A STL compliant container also known as ring or cyclic buffer. |
Container
|
C++
03
|
Standard library containers and extensions. |
Standard library containers and extensions. |
Dynamic Bitset
|
C++
03
|
The dynamic_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dynamic_bitset. |
The dynamic_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dynamic_bitset. |
GIL
|
C++
14
|
(C++14) Generic Image Library |
(C++14) Generic Image Library |
Graph
|
C++
14
|
The BGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). |
The BGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). |
GraphParallel
|
C++
03
|
The PBGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). |
The PBGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). |
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 |
Intrusive
|
C++
03
|
Intrusive containers and algorithms. |
Intrusive containers and algorithms. |
Multi-Array
|
C++
03
|
Boost.MultiArray provides a generic N-dimensional array concept definition and common implementations of that interface. |
Boost.MultiArray provides a generic N-dimensional array concept definition and common implementations of that interface. |
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. |
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. |
PolyCollection
|
C++
11
|
Fast containers of polymorphic objects. |
Fast containers of polymorphic objects. |
Property Map
|
C++
03
|
Concepts defining interfaces which map key objects to value objects. |
Concepts defining interfaces which map key objects to value objects. |
Property Tree
|
C++
11
|
A tree data structure especially suited to storing configuration data. |
A tree data structure especially suited to storing configuration data. |
Unordered
|
C++
11
|
Unordered associative containers. |
Unordered associative containers. |
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. |