This is an older version and was released in 2016. The current version is 1.86.0.
String
| Convert | C++ 11 | An extendible and configurable type-conversion framework. |
| An extendible and configurable type-conversion framework. | ||
| Format | C++ 11 | The format library provides a type-safe mechanism for formatting arguments according to a printf-like format-string. |
| The format library provides a type-safe mechanism for formatting arguments according to a printf-like format-string. | ||
| Iostreams | C++ 03 | Boost.IOStreams provides a framework for defining streams, stream buffers and i/o filters. |
| Boost.IOStreams provides a framework for defining streams, stream buffers and i/o filters. | ||
| Lexical Cast | C++ 11 | General literal text conversions, such as an int represented a string, or vice-versa. |
| General literal text conversions, such as an int represented a string, or vice-versa. | ||
| Locale | C++ 11 | Provide localization and Unicode handling tools for C++. |
| Provide localization and Unicode handling tools for C++. | ||
| Regex | C++ 11 | Regular expression library. |
| Regular expression library. | ||
| Spirit | C++ 03 | LL parser framework represents parsers directly as EBNF grammars in inlined C++. |
| LL parser framework represents parsers directly as EBNF grammars in inlined C++. | ||
| String Algo | C++ 03 | String algorithms library. |
| String algorithms library. | ||
| Tokenizer | C++ 03 | Break of a string or other character sequence into a series of tokens. |
| Break of a string or other character sequence into a series of tokens. | ||
| Wave | C++ 11 | The Boost.Wave library is a Standards conformant, and highly configurable implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface. |
| The Boost.Wave library is a Standards conformant, and highly configurable implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface. | ||
| Xpressive | C++ 03 | Regular expressions that can be written as strings or as expression templates, and which can refer to each other and themselves recursively with the power of context-free grammars. |
| Regular expressions that can be written as strings or as expression templates, and which can refer to each other and themselves recursively with the power of context-free grammars. |