mirror of
https://github.com/boostorg/website.git
synced 2026-01-24 18:32:38 +00:00
1801 lines
64 KiB
XML
1801 lines
64 KiB
XML
<?xml version="1.0" encoding="US-ASCII"?>
|
|
<boost xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
|
|
<categories>
|
|
<category name="String">
|
|
<title>String and text processing</title>
|
|
</category>
|
|
<category name="Containers">
|
|
<title>Containers</title>
|
|
</category>
|
|
<category name="Iterators">
|
|
<title>Iterators</title>
|
|
</category>
|
|
<category name="Algorithms">
|
|
<title>Algorithms</title>
|
|
</category>
|
|
<category name="Function-objects">
|
|
<title>Function objects and higher-order programming</title>
|
|
</category>
|
|
<category name="Generic">
|
|
<title>Generic Programming</title>
|
|
</category>
|
|
<category name="Metaprogramming">
|
|
<title>Template Metaprogramming</title>
|
|
</category>
|
|
<category name="Preprocessor">
|
|
<title>Preprocessor Metaprogramming</title>
|
|
</category>
|
|
<category name="Concurrent">
|
|
<title>Concurrent Programming</title>
|
|
</category>
|
|
<category name="Math">
|
|
<title>Math and numerics</title>
|
|
</category>
|
|
<category name="Correctness">
|
|
<title>Correctness and testing</title>
|
|
</category>
|
|
<category name="Data">
|
|
<title>Data structures</title>
|
|
</category>
|
|
<category name="Domain">
|
|
<title>Domain Specific</title>
|
|
</category>
|
|
<category name="Image-processing">
|
|
<title>Image processing</title>
|
|
</category>
|
|
<category name="IO">
|
|
<title>Input/Output</title>
|
|
</category>
|
|
<category name="Inter-language">
|
|
<title>Inter-language support</title>
|
|
</category>
|
|
<category name="Emulation">
|
|
<title>Language Features Emulation</title>
|
|
</category>
|
|
<category name="Memory">
|
|
<title>Memory</title>
|
|
</category>
|
|
<category name="Parsing">
|
|
<title>Parsing</title>
|
|
</category>
|
|
<category name="Patterns">
|
|
<title>Patterns and Idioms</title>
|
|
</category>
|
|
<category name="Programming">
|
|
<title>Programming Interfaces</title>
|
|
</category>
|
|
<category name="State">
|
|
<title>State Machines</title>
|
|
</category>
|
|
<category name="System">
|
|
<title>System</title>
|
|
</category>
|
|
<category name="Miscellaneous">
|
|
<title>Miscellaneous</title>
|
|
</category>
|
|
<category name="workarounds">
|
|
<title>Broken compiler workarounds</title>
|
|
</category>
|
|
</categories>
|
|
<library>
|
|
<key>accumulators</key>
|
|
<boost-version>1.36.0</boost-version>
|
|
<name>Accumulators</name>
|
|
<authors>Eric Niebler</authors>
|
|
<description>Framework for incremental calculation, and collection of statistical accumulators.</description>
|
|
<documentation>libs/accumulators/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>algorithm</key>
|
|
<boost-version>1.50.0</boost-version>
|
|
<name>Algorithm</name>
|
|
<authors>Marshall Clow</authors>
|
|
<description>A collection of useful generic algorithms.</description>
|
|
<documentation>libs/algorithm/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
</library>
|
|
<library>
|
|
<key>algorithm/minmax</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Min-Max</name>
|
|
<authors>Hervé Brönnimann</authors>
|
|
<description>Standard library extensions for simultaneous
|
|
min/max and min/max element computations.</description>
|
|
<documentation>libs/algorithm/minmax/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
</library>
|
|
<library>
|
|
<key>algorithm/string</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>String Algo</name>
|
|
<authors>Pavol Droba</authors>
|
|
<description>String algorithms library.</description>
|
|
<documentation>libs/algorithm/string/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>Algorithms</category>
|
|
</library>
|
|
<library>
|
|
<key>any</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Any</name>
|
|
<authors>Kevlin Henney</authors>
|
|
<description>Safe, generic container for single values of
|
|
different value types.</description>
|
|
<documentation>libs/any/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>array</key>
|
|
<boost-version>1.17.0</boost-version>
|
|
<name>Array</name>
|
|
<authors>Nicolai Josuttis</authors>
|
|
<description>STL compliant container wrapper for arrays of
|
|
constant size.</description>
|
|
<documentation>libs/array/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Containers</category>
|
|
</library>
|
|
<library>
|
|
<key>asio</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Asio</name>
|
|
<authors>Chris Kohlhoff</authors>
|
|
<description>Portable networking, including sockets, timers,
|
|
hostname resolution and socket iostreams.</description>
|
|
<documentation>libs/asio/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>assign</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Assign</name>
|
|
<authors>Thorsten Ottosen</authors>
|
|
<description>Filling containers with constant or generated data
|
|
has never been easier.</description>
|
|
<documentation>libs/assign/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>atomic</key>
|
|
<boost-version>1.53.0</boost-version>
|
|
<name>Atomic</name>
|
|
<authors>Helge Bahmann, Tim Blechmann</authors>
|
|
<description>C++11-style atomic<>.</description>
|
|
<documentation>libs/atomic/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
</library>
|
|
<library>
|
|
<key>bimap</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Bimap</name>
|
|
<authors>Matias Capeletto</authors>
|
|
<description>Bidirectional maps library for C++. With Boost.Bimap you
|
|
can create associative containers in which both types can be used
|
|
as key.</description>
|
|
<documentation>libs/bimap/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>bind</key>
|
|
<boost-version>1.25.0</boost-version>
|
|
<name>Bind</name>
|
|
<authors>Peter Dimov</authors>
|
|
<description>boost::bind is a generalization of the standard
|
|
functions std::bind1st and std::bind2nd. It supports arbitrary
|
|
function objects, functions, function pointers, and member
|
|
function pointers, and is able to bind any argument to a
|
|
specific value or route input arguments into arbitrary
|
|
positions.</description>
|
|
<documentation>libs/bind/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>bind/mem_fn</key>
|
|
<boost-version>1.25.0</boost-version>
|
|
<name>Member Function</name>
|
|
<authors>Peter Dimov</authors>
|
|
<description>Generalized binders for function/object/pointers
|
|
and member functions.</description>
|
|
<documentation>libs/bind/mem_fn.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>bind/ref</key>
|
|
<boost-version>1.25.0</boost-version>
|
|
<name>Ref</name>
|
|
<authors>Jaako Järvi, Peter Dimov, Doug Gregor, and Dave
|
|
Abrahams</authors>
|
|
<description>A utility library for passing references to
|
|
generic functions.</description>
|
|
<documentation>libs/bind/ref.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>chrono</key>
|
|
<boost-version>1.47.0</boost-version>
|
|
<name>Chrono</name>
|
|
<authors>Vicente J. Botet Escribá</authors>
|
|
<description>Useful time utilities.</description>
|
|
<documentation>libs/chrono/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Domain</category>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>circular_buffer</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Circular Buffer</name>
|
|
<authors>Jan Gaspar</authors>
|
|
<description>A STL compliant container also known as ring or cyclic buffer.</description>
|
|
<documentation>libs/circular_buffer/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
</library>
|
|
<library>
|
|
<key>compatibility</key>
|
|
<boost-version>1.21.2</boost-version>
|
|
<name>Compatibility</name>
|
|
<authors>Ralf Grosse-Kunstleve and Jens Maurer</authors>
|
|
<description>Help for non-conforming standard
|
|
libraries.</description>
|
|
<documentation>libs/compatibility/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>workarounds</category>
|
|
</library>
|
|
<library>
|
|
<key>concept_check</key>
|
|
<boost-version>1.19.0</boost-version>
|
|
<name>Concept Check</name>
|
|
<authors>Jeremy Siek</authors>
|
|
<description>Tools for generic programming.</description>
|
|
<documentation>libs/concept_check/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
<category>Correctness</category>
|
|
</library>
|
|
<library>
|
|
<key>config</key>
|
|
<boost-version>1.9.0</boost-version>
|
|
<name>Config</name>
|
|
<authors></authors>
|
|
<description>Helps Boost library developers adapt to compiler
|
|
idiosyncrasies; not intended for library users.</description>
|
|
<documentation>libs/config/config.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>workarounds</category>
|
|
</library>
|
|
<library>
|
|
<key>container</key>
|
|
<boost-version>1.48.0</boost-version>
|
|
<name>Container</name>
|
|
<authors>Ion Gaztañaga</authors>
|
|
<description>Standard library containers and extensions.</description>
|
|
<documentation>libs/container/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>context</key>
|
|
<boost-version>1.51.0</boost-version>
|
|
<name>Context</name>
|
|
<authors>Oliver Kowalke</authors>
|
|
<description>Context switching library.</description>
|
|
<documentation>libs/context/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>conversion</key>
|
|
<boost-version>1.20.0</boost-version>
|
|
<name>Conversion</name>
|
|
<authors>Dave Abrahams and Kevlin Henney</authors>
|
|
<description>Polymorphic and lexical casts.</description>
|
|
<documentation>libs/conversion/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>coroutine</key>
|
|
<boost-version>1.53.0</boost-version>
|
|
<name>Coroutine</name>
|
|
<authors>Oliver Kowalke</authors>
|
|
<description>Coroutine library.</description>
|
|
<documentation>libs/coroutine/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
</library>
|
|
<library>
|
|
<key>crc</key>
|
|
<boost-version>1.22.0</boost-version>
|
|
<name>CRC</name>
|
|
<authors>Daryle Walker</authors>
|
|
<description>The Boost CRC Library provides two implementations
|
|
of CRC (cyclic redundancy code) computation objects and two
|
|
implementations of CRC computation functions. The
|
|
implementations are template-based.</description>
|
|
<documentation>libs/crc/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Domain</category>
|
|
</library>
|
|
<library>
|
|
<key>date_time</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>Date Time</name>
|
|
<authors>Jeff Garland</authors>
|
|
<description>A set of date-time libraries based on generic
|
|
programming concepts.</description>
|
|
<documentation>libs/date_time/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Domain</category>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>dynamic_bitset</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>Dynamic Bitset</name>
|
|
<authors>Jeremy Siek and Chuck Allison</authors>
|
|
<description>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.</description>
|
|
<documentation>libs/dynamic_bitset/dynamic_bitset.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
</library>
|
|
<library>
|
|
<key>exception</key>
|
|
<boost-version>1.36.0</boost-version>
|
|
<name>Exception</name>
|
|
<authors>Emil Dotchevski</authors>
|
|
<description>The Boost Exception library supports transporting
|
|
of arbitrary data in exception objects, and transporting of
|
|
exceptions between threads.</description>
|
|
<documentation>libs/exception/doc/boost-exception.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>filesystem</key>
|
|
<boost-version>1.30.0</boost-version>
|
|
<name>Filesystem</name>
|
|
<authors>Beman Dawes</authors>
|
|
<description>The Boost Filesystem Library provides portable
|
|
facilities to query and manipulate paths, files, and
|
|
directories.</description>
|
|
<documentation>libs/filesystem/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>flyweight</key>
|
|
<boost-version>1.38.0</boost-version>
|
|
<name>Flyweight</name>
|
|
<authors>Joaquín M López Muñoz</authors>
|
|
<description>Design pattern to manage large quantities of highly redundant
|
|
objects.</description>
|
|
<documentation>libs/flyweight/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Patterns</category>
|
|
</library>
|
|
<library>
|
|
<key>foreach</key>
|
|
<boost-version>1.34.0</boost-version>
|
|
<name>Foreach</name>
|
|
<authors>Eric Niebler</authors>
|
|
<description>In C++, writing a loop that iterates over a
|
|
sequence is tedious. We can either use iterators, which
|
|
requires a considerable amount of boiler-plate, or we can use
|
|
the std::for_each() algorithm and move our loop body into a
|
|
predicate, which requires no less boiler-plate and forces us to
|
|
move our logic far from where it will be used. In contrast,
|
|
some other languages, like Perl, provide a dedicated "foreach"
|
|
construct that automates this process. BOOST_FOREACH is just
|
|
such a construct for C++. It iterates over sequences for us,
|
|
freeing us from having to deal directly with iterators or write
|
|
predicates.</description>
|
|
<documentation>libs/foreach/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>format</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>Format</name>
|
|
<authors>Samuel Krempp</authors>
|
|
<description>The format library provides a class for formatting
|
|
arguments according to a format-string, as does printf, but
|
|
with two major differences: format sends the arguments to an
|
|
internal stream, and so is entirely type-safe and naturally
|
|
supports all user-defined types; the ellipsis (...) can not be
|
|
used correctly in the strongly typed context of format, and
|
|
thus the function call with arbitrary arguments is replaced by
|
|
successive calls to an argument feeding
|
|
operator%.</description>
|
|
<documentation>libs/format/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>function</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Function</name>
|
|
<authors>Doug Gregor</authors>
|
|
<description>Function object wrappers for deferred calls or
|
|
callbacks.</description>
|
|
<documentation>libs/function/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Function-objects</category>
|
|
<category>Programming</category>
|
|
</library>
|
|
<library>
|
|
<key>function_types</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Function Types</name>
|
|
<authors>Tobias Schwinger</authors>
|
|
<description>Boost.FunctionTypes provides functionality to classify,
|
|
decompose and synthesize function, function pointer, function reference and
|
|
pointer to member types.</description>
|
|
<documentation>libs/function_types/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
<category>Metaprogramming</category>
|
|
</library>
|
|
<library>
|
|
<key>functional</key>
|
|
<boost-version>1.16.0</boost-version>
|
|
<name>Functional</name>
|
|
<authors>Mark Rodgers</authors>
|
|
<description>The Boost.Function library contains a family of
|
|
class templates that are function object
|
|
wrappers.</description>
|
|
<documentation>libs/functional/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>functional/hash</key>
|
|
<boost-version>1.33.0</boost-version>
|
|
<name>Functional/Hash</name>
|
|
<authors>Daniel James</authors>
|
|
<description>A TR1 hash function object that can be extended to
|
|
hash user defined types.</description>
|
|
<documentation>libs/functional/hash/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>functional/factory</key>
|
|
<boost-version>1.43.0</boost-version>
|
|
<name>Functional/Factory</name>
|
|
<authors>Tobias Schwinger</authors>
|
|
<description>Function object templates for dynamic and static object creation</description>
|
|
<documentation>libs/functional/factory/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>functional/forward</key>
|
|
<boost-version>1.43.0</boost-version>
|
|
<name>Functional/Forward</name>
|
|
<authors>Tobias Schwinger</authors>
|
|
<description>Adapters to allow generic function objects to accept arbitrary arguments</description>
|
|
<documentation>libs/functional/forward/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>functional/overloaded_function</key>
|
|
<boost-version>1.50.0</boost-version>
|
|
<name>Functional/Overloaded Function</name>
|
|
<authors>Lorenzo Caminiti</authors>
|
|
<description>Overload different functions into a single function
|
|
object.</description>
|
|
<documentation>libs/functional/overloaded_function/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>fusion</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Fusion</name>
|
|
<authors>Joel de Guzman, Dan Marsden and Tobias Schwinger</authors>
|
|
<description>Library for working with tuples, including various containers,
|
|
algorithms, etc.</description>
|
|
<documentation>libs/fusion/doc/html/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Metaprogramming</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>geometry</key>
|
|
<boost-version>1.47.0</boost-version>
|
|
<name>Geometry</name>
|
|
<authors>Barend Gehrels, Bruno Lalande and Mateusz Loskot</authors>
|
|
<description>Geometry Library.</description>
|
|
<documentation>libs/geometry/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>geometry</key>
|
|
<boost-version>1.47.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Geometry</name>
|
|
<authors>Barend Gehrels, Bruno Lalande, Mateusz Loskot and Adam
|
|
Wulkiewicz</authors>
|
|
<description>Geometry Library.</description>
|
|
<documentation>libs/geometry/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>gil</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>GIL</name>
|
|
<authors>Lubomir Bourdev and Hailin Jin</authors>
|
|
<description>Generic Image Library</description>
|
|
<documentation>libs/gil/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Iterators</category>
|
|
<category>Algorithms</category>
|
|
<category>Generic</category>
|
|
<category>Image-processing</category>
|
|
</library>
|
|
<library>
|
|
<key>graph</key>
|
|
<boost-version>1.18.0</boost-version>
|
|
<name>Graph</name>
|
|
<authors>Jeremy Siek and a University of Notre Dame team;
|
|
now maintained by Andrew Sutton and Jeremiah Willcock.</authors>
|
|
<description>The BGL graph interface and graph components are
|
|
generic, in the same sense as the the Standard Template Library
|
|
(STL).</description>
|
|
<documentation>libs/graph/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Iterators</category>
|
|
<category>Algorithms</category>
|
|
</library>
|
|
<library>
|
|
<key>heap</key>
|
|
<boost-version>1.49.0</boost-version>
|
|
<name>Heap</name>
|
|
<authors>Tim Blechmann</authors>
|
|
<description>Priority queue data structures.</description>
|
|
<documentation>libs/heap/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>icl</key>
|
|
<boost-version>1.46.0</boost-version>
|
|
<name>ICL</name>
|
|
<authors>Joachim Faulhaber</authors>
|
|
<description>Interval Container Library, interval sets and maps and
|
|
aggregation of associated values</description>
|
|
<documentation>libs/icl/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>integer</key>
|
|
<boost-version>1.9.0</boost-version>
|
|
<name>Integer</name>
|
|
<authors></authors>
|
|
<description>The organization of boost integer headers and
|
|
classes is designed to take advantage of <stdint.h> types
|
|
from the 1999 C standard without resorting to undefined
|
|
behavior in terms of the 1998 C++ standard. The header
|
|
<boost/cstdint.hpp> makes the standard integer types
|
|
safely available in namespace boost without placing any names
|
|
in namespace std.</description>
|
|
<documentation>libs/integer/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>interprocess</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Interprocess</name>
|
|
<authors>Ion Gaztañaga</authors>
|
|
<description>Shared memory, memory mapped files, process-shared mutexes,
|
|
condition variables, containers and allocators.</description>
|
|
<documentation>libs/interprocess/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
</library>
|
|
<library>
|
|
<key>intrusive</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Intrusive</name>
|
|
<authors>Ion Gaztañaga</authors>
|
|
<description>Intrusive containers and algorithms.</description>
|
|
<documentation>libs/intrusive/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
</library>
|
|
<library>
|
|
<key>io</key>
|
|
<boost-version>1.28.0</boost-version>
|
|
<name>IO State Savers</name>
|
|
<authors>Daryle Walker</authors>
|
|
<description>The I/O sub-library of Boost helps segregate the
|
|
large number of Boost headers. This sub-library should contain
|
|
various items to use with/for the standard I/O
|
|
library.</description>
|
|
<documentation>libs/io/doc/ios_state.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>iostreams</key>
|
|
<boost-version>1.33.0</boost-version>
|
|
<name>Iostreams</name>
|
|
<authors>Jonathan Turkanis</authors>
|
|
<description>Boost.IOStreams provides a framework for defining
|
|
streams, stream buffers and i/o filters.</description>
|
|
<documentation>libs/iostreams/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>iterator</key>
|
|
<boost-version>1.21.0</boost-version>
|
|
<name>Iterator</name>
|
|
<authors>Dave Abrahams, Jeremy Siek, and Thomas Witt</authors>
|
|
<description>The Boost Iterator Library contains two parts. The
|
|
first is a system of concepts which extend the C++ standard
|
|
iterator requirements. The second is a framework of components
|
|
for building iterators based on these extended concepts and
|
|
includes several useful iterator adaptors.</description>
|
|
<documentation>libs/iterator/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Iterators</category>
|
|
</library>
|
|
<library>
|
|
<key>lambda</key>
|
|
<boost-version>1.28.0</boost-version>
|
|
<name>Lambda</name>
|
|
<authors>Jaakko Järvi and Gary Powell</authors>
|
|
<description>Define small unnamed function objects at the
|
|
actual call site, and more.</description>
|
|
<documentation>libs/lambda/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>lexical_cast</key>
|
|
<boost-version>1.20.0</boost-version>
|
|
<name>Lexical Cast</name>
|
|
<authors>Kevlin Henney</authors>
|
|
<description>General literal text conversions, such as an int
|
|
represented a string, or vice-versa, from Kevlin Henney.</description>
|
|
<documentation>libs/conversion/lexical_cast.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>local_function</key>
|
|
<boost-version>1.50.0</boost-version>
|
|
<name>Local Function</name>
|
|
<authors>Lorenzo Caminiti</authors>
|
|
<description>Program functions locally, within other functions, directly
|
|
within the scope where they are needed.</description>
|
|
<documentation>libs/local_function/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>locale</key>
|
|
<boost-version>1.48.0</boost-version>
|
|
<name>Locale</name>
|
|
<authors>Artyom Beilis</authors>
|
|
<description>Provide localization and Unicode handling tools for C++.</description>
|
|
<documentation>libs/locale/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
</library>
|
|
<library>
|
|
<key>lockfree</key>
|
|
<boost-version>1.53.0</boost-version>
|
|
<name>Lockfree</name>
|
|
<authors>Tim Blechmann</authors>
|
|
<description>Lockfree data structures.</description>
|
|
<documentation>libs/lockfree/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
</library>
|
|
<library>
|
|
<key>log</key>
|
|
<boost-version>1.54.0</boost-version>
|
|
<name>Log</name>
|
|
<authors>Andrey Semashev</authors>
|
|
<description>Logging library.</description>
|
|
<documentation>libs/log/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>logic/tribool</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Tribool</name>
|
|
<authors>Doug Gregor</authors>
|
|
<description>3-state boolean type library.</description>
|
|
<documentation>doc/html/tribool.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>math</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Math</name>
|
|
<authors>various</authors>
|
|
<description>Boost.Math includes several contributions in the
|
|
domain of mathematics: The Greatest Common Divisor and Least
|
|
Common Multiple library provides run-time and compile-time
|
|
evaluation of the greatest common divisor (GCD) or least common
|
|
multiple (LCM) of two integers. The Special Functions library
|
|
currently provides eight templated special functions, in
|
|
namespace boost. The Complex Number Inverse Trigonometric
|
|
Functions are the inverses of trigonometric functions currently
|
|
present in the C++ standard. Quaternions are a relative of
|
|
complex numbers often used to parameterise rotations in three
|
|
dimentional space. Octonions, like quaternions, are a relative
|
|
of complex numbers.</description>
|
|
<documentation>libs/math/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/common_factor</key>
|
|
<boost-version>1.26.0</boost-version>
|
|
<name>Math Common Factor</name>
|
|
<authors>Daryle Walker</authors>
|
|
<description>Greatest common divisor and least common
|
|
multiple.</description>
|
|
<documentation>libs/math/doc/common_factor.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/common_factor</key>
|
|
<boost-version>1.26.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Math Common Factor</name>
|
|
<authors>Daryle Walker</authors>
|
|
<description>Greatest common divisor and least common
|
|
multiple.</description>
|
|
<documentation>libs/math/doc/html/gcd_lcm.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/octonion</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Math Octonion</name>
|
|
<authors>Hubert Holin</authors>
|
|
<description>Octonions.</description>
|
|
<documentation>libs/math/doc/octonion/html/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/octonion</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Math Octonion</name>
|
|
<authors>Hubert Holin</authors>
|
|
<description>Octonions.</description>
|
|
<documentation>libs/math/doc/html/octonions.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/quaternion</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Math Quaternion</name>
|
|
<authors>Hubert Holin</authors>
|
|
<description>Quaternions.</description>
|
|
<documentation>libs/math/doc/quaternion/html/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/quaternion</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Math Quaternion</name>
|
|
<authors>Hubert Holin</authors>
|
|
<description>Quaternions.</description>
|
|
<documentation>libs/math/doc/html/quaternions.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/special_functions</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Math/Special Functions</name>
|
|
<authors>John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang</authors>
|
|
<description>A wide selection of mathematical special functions.</description>
|
|
<documentation>libs/math/doc/sf_and_dist/html/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/special_functions</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Math/Special Functions</name>
|
|
<authors>John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang</authors>
|
|
<description>A wide selection of mathematical special functions.</description>
|
|
<documentation>libs/math/doc/html/special.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/statistical_distributions</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>Math/Statistical Distributions</name>
|
|
<authors>John Maddock and Paul Bristow</authors>
|
|
<description>A wide selection of univariate statistical distributions and
|
|
functions that operate on them.</description>
|
|
<documentation>libs/math/doc/sf_and_dist/html/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>math/statistical_distributions</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Math/Statistical Distributions</name>
|
|
<authors>John Maddock and Paul Bristow</authors>
|
|
<description>A wide selection of univariate statistical distributions and
|
|
functions that operate on them.</description>
|
|
<documentation>libs/math/doc/html/dist.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>move</key>
|
|
<boost-version>1.48.0</boost-version>
|
|
<name>Move</name>
|
|
<authors>Ion Gaztañaga</authors>
|
|
<description>Portable move semantics for C++03 and C++11 compilers.</description>
|
|
<documentation>libs/move/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>mpi</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>MPI</name>
|
|
<authors>Douglas Gregor and Matthias Troyer</authors>
|
|
<description>Message Passing Interface library, for use in distributed-memory
|
|
parallel application programming.</description>
|
|
<documentation>libs/mpi/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
</library>
|
|
<library>
|
|
<key>mpl</key>
|
|
<boost-version>1.30.0</boost-version>
|
|
<name>MPL</name>
|
|
<authors>Aleksey Gurtovoy</authors>
|
|
<description>The Boost.MPL library is a general-purpose,
|
|
high-level C++ template metaprogramming framework of
|
|
compile-time algorithms, sequences and metafunctions. It
|
|
provides a conceptual foundation and an extensive set of
|
|
powerful and coherent tools that make doing explict
|
|
metaprogramming in C++ as easy and enjoyable as possible within
|
|
the current language.</description>
|
|
<documentation>libs/mpl/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Metaprogramming</category>
|
|
</library>
|
|
<library>
|
|
<key>msm</key>
|
|
<boost-version>1.44.0</boost-version>
|
|
<name>Meta State Machine</name>
|
|
<authors>Christophe Henry</authors>
|
|
<description>A very high-performance library for expressive UML2 finite state machines.</description>
|
|
<documentation>libs/msm/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>State</category>
|
|
</library>
|
|
<library>
|
|
<key>multi_array</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>Multi-Array</name>
|
|
<authors>Ron Garcia</authors>
|
|
<description>Boost.MultiArray provides a generic N-dimensional
|
|
array concept definition and common implementations of that
|
|
interface.</description>
|
|
<documentation>libs/multi_array/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>multi_index</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Multi-Index</name>
|
|
<authors>Joaquín M López Muñoz</authors>
|
|
<description>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.</description>
|
|
<documentation>libs/multi_index/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>multiprecision</key>
|
|
<boost-version>1.53.0</boost-version>
|
|
<name>Multiprecision</name>
|
|
<authors>John Maddock and Christopher Kormanyos</authors>
|
|
<description>Extended precision arithmetic types for floating point,
|
|
integer andrational arithmetic.</description>
|
|
<documentation>libs/multiprecision/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>numeric/conversion</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Numeric Conversion</name>
|
|
<authors>Fernando Cacciola</authors>
|
|
<description>Optimized Policy-based Numeric
|
|
Conversions.</description>
|
|
<documentation>libs/numeric/conversion/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>numeric/interval</key>
|
|
<boost-version>1.30.0</boost-version>
|
|
<name>Interval</name>
|
|
<authors>Guillaume Melquiond, Hervé Brönnimann and
|
|
Sylvain Pion</authors>
|
|
<description>Extends the usual arithmetic functions to
|
|
mathematical intervals.</description>
|
|
<documentation>libs/numeric/interval/doc/interval.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>numeric/odeint</key>
|
|
<boost-version>1.53.0</boost-version>
|
|
<name>Odeint</name>
|
|
<authors>Karsten Ahnert and Mario Mulansky</authors>
|
|
<description>Solving ordinary differential equations.</description>
|
|
<documentation>libs/numeric/odeint/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>numeric/ublas</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>uBLAS</name>
|
|
<authors>Joerg Walter and Mathias Koch</authors>
|
|
<description>uBLAS provides matrix and vector classes as well
|
|
as basic linear algebra routines. Several dense, packed and
|
|
sparse storage schemes are supported.</description>
|
|
<documentation>libs/numeric/ublas/doc/index.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>optional</key>
|
|
<boost-version>1.30.0</boost-version>
|
|
<name>Optional</name>
|
|
<authors>Fernando Cacciola</authors>
|
|
<description>Discriminated-union wrapper for optional
|
|
values.</description>
|
|
<documentation>libs/optional/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>parameter</key>
|
|
<boost-version>1.33.0</boost-version>
|
|
<name>Parameter</name>
|
|
<authors>David Abrahams and Daniel Wallin</authors>
|
|
<description>Boost.Parameter Library - Write functions that
|
|
accept arguments by name.</description>
|
|
<documentation>libs/parameter/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Programming</category>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>phoenix</key>
|
|
<boost-version>1.47.0</boost-version>
|
|
<name>Phoenix</name>
|
|
<authors>Joel de Guzman, Dan Marsden and Thomas Heller</authors>
|
|
<description>Define small unnamed function objects at the actual
|
|
call site, and more.</description>
|
|
<documentation>libs/phoenix/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>polygon</key>
|
|
<boost-version>1.44.0</boost-version>
|
|
<name>Polygon</name>
|
|
<authors>Lucanus Simonson</authors>
|
|
<description>Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.</description>
|
|
<documentation>libs/polygon/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>polygon</key>
|
|
<boost-version>1.44.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<name>Polygon</name>
|
|
<authors>Lucanus Simonson, Andrii Sydorchuk</authors>
|
|
<description>Voronoi diagram construction and booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.</description>
|
|
<documentation>libs/polygon/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
<category>Data</category>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>pool</key>
|
|
<boost-version>1.21.0</boost-version>
|
|
<name>Pool</name>
|
|
<authors>Steve Cleary</authors>
|
|
<description>Memory pool management.</description>
|
|
<documentation>libs/pool/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Memory</category>
|
|
</library>
|
|
<library>
|
|
<key>predef</key>
|
|
<boost-version>1.55.0</boost-version>
|
|
<name>Predef</name>
|
|
<authors>Rene Rivera</authors>
|
|
<description>This library defines a set of compiler, architecture,
|
|
operating system, library, and other version numbers from the
|
|
information it can gather of C, C++, Objective C, and Objective C++
|
|
predefined macros or those defined in generally available
|
|
headers.</description>
|
|
<documentation>libs/predef/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>preprocessor</key>
|
|
<boost-version>1.26.0</boost-version>
|
|
<name>Preprocessor</name>
|
|
<authors>Vesa Karvonen and Paul Mensonides</authors>
|
|
<description>Preprocessor metaprogramming tools including
|
|
repetition and recursion.</description>
|
|
<documentation>libs/preprocessor/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Preprocessor</category>
|
|
</library>
|
|
<library>
|
|
<key>program_options</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Program Options</name>
|
|
<authors>Vladimir Prus</authors>
|
|
<description>The program_options library allows program
|
|
developers to obtain program options, that is (name, value)
|
|
pairs from the user, via conventional methods such as command
|
|
line and config file.</description>
|
|
<documentation>libs/program_options/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>IO</category>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>property_map</key>
|
|
<boost-version>1.19.0</boost-version>
|
|
<name>Property Map</name>
|
|
<authors>Jeremy Siek</authors>
|
|
<description>Concepts defining interfaces which map key objects
|
|
to value objects.</description>
|
|
<documentation>libs/property_map/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Generic</category>
|
|
</library>
|
|
<library>
|
|
<key>property_tree</key>
|
|
<boost-version>1.41.0</boost-version>
|
|
<name>Property Tree</name>
|
|
<authors>Marcin Kalicinski and Sebastian Redl</authors>
|
|
<description>A tree data structure especially suited to storing configuration data.</description>
|
|
<documentation>libs/property_tree/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>proto</key>
|
|
<boost-version>1.37.0</boost-version>
|
|
<name>Proto</name>
|
|
<authors>Eric Niebler</authors>
|
|
<description>Expression template library and compiler construction toolkit for domain-specific embedded languages.</description>
|
|
<documentation>libs/proto/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Metaprogramming</category>
|
|
</library>
|
|
<library>
|
|
<key>ptr_container</key>
|
|
<boost-version>1.33.0</boost-version>
|
|
<name>Pointer Container</name>
|
|
<authors>Thorsten Ottosen</authors>
|
|
<description>Containers for storing heap-allocated polymorphic
|
|
objects to ease OO-programming.</description>
|
|
<documentation>libs/ptr_container/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>python</key>
|
|
<boost-version>1.19.0</boost-version>
|
|
<name>Python</name>
|
|
<authors>Dave Abrahams</authors>
|
|
<description>The Boost Python Library is a framework for
|
|
interfacing Python and C++. It allows you to quickly and
|
|
seamlessly expose C++ classes functions and objects to Python,
|
|
and vice-versa, using no special tools -- just your C++
|
|
compiler.</description>
|
|
<documentation>libs/python/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Inter-language</category>
|
|
</library>
|
|
<library>
|
|
<key>random</key>
|
|
<boost-version>1.15.0</boost-version>
|
|
<name>Random</name>
|
|
<authors>Jens Maurer</authors>
|
|
<description>A complete system for random number
|
|
generation.</description>
|
|
<documentation>libs/random/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>range</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Range</name>
|
|
<authors>Niel Groves, Thorsten Ottosen</authors>
|
|
<description>A new infrastructure for generic algorithms that
|
|
builds on top of the new iterator concepts.</description>
|
|
<documentation>libs/range/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
</library>
|
|
<library>
|
|
<key>ratio</key>
|
|
<boost-version>1.47.0</boost-version>
|
|
<name>Ratio</name>
|
|
<authors>Vicente J. Botet Escribá</authors>
|
|
<description>Compile time rational arithmetic.</description>
|
|
<documentation>libs/ratio/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>rational</key>
|
|
<boost-version>1.11.0</boost-version>
|
|
<name>Rational</name>
|
|
<authors>Paul Moore</authors>
|
|
<description>A rational number class.</description>
|
|
<documentation>libs/rational/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>regex</key>
|
|
<boost-version>1.18.0</boost-version>
|
|
<name>Regex</name>
|
|
<authors>John Maddock</authors>
|
|
<description>Regular expression library.</description>
|
|
<documentation>libs/regex/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>String</category>
|
|
</library>
|
|
<library>
|
|
<key>scope_exit</key>
|
|
<boost-version>1.38.0</boost-version>
|
|
<name>Scope Exit</name>
|
|
<authors>Alexander Nasonov</authors>
|
|
<description>Execute arbitrary code at scope exit.</description>
|
|
<documentation>libs/scope_exit/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>serialization</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Serialization</name>
|
|
<authors>Robert Ramey</authors>
|
|
<description>Serialization for persistence and
|
|
marshalling.</description>
|
|
<documentation>libs/serialization/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>IO</category>
|
|
</library>
|
|
<library>
|
|
<key>signals</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<name>Signals</name>
|
|
<authors>Doug Gregor</authors>
|
|
<description>Managed signals & slots callback
|
|
implementation.</description>
|
|
<documentation>libs/signals/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
<category>Patterns</category>
|
|
</library>
|
|
<library>
|
|
<key>signals</key>
|
|
<boost-version>1.29.0</boost-version>
|
|
<update-version>1.54.0</update-version>
|
|
<status>deprecated</status>
|
|
<name>Signals</name>
|
|
<authors>Doug Gregor</authors>
|
|
<description>Managed signals & slots callback
|
|
implementation.</description>
|
|
<documentation>libs/signals/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
<category>Patterns</category>
|
|
</library>
|
|
<library>
|
|
<key>signals2</key>
|
|
<boost-version>1.39.0</boost-version>
|
|
<name>Signals2</name>
|
|
<authors>Frank Mori Hess</authors>
|
|
<description>Managed signals & slots callback
|
|
implementation (thread-safe version 2).</description>
|
|
<documentation>libs/signals2/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
<category>Patterns</category>
|
|
</library>
|
|
<library>
|
|
<key>smart_ptr</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Smart Ptr</name>
|
|
<authors>Greg Colvin, Beman Dawes, Peter Dimov, Darin Adler
|
|
and Glen Fernandes</authors>
|
|
<description>Smart pointer class templates.</description>
|
|
<documentation>libs/smart_ptr/smart_ptr.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Memory</category>
|
|
</library>
|
|
<library>
|
|
<key>static_assert</key>
|
|
<boost-version>1.19.0</boost-version>
|
|
<name>Static Assert</name>
|
|
<authors>John Maddock</authors>
|
|
<description>Static assertions (compile time
|
|
assertions).</description>
|
|
<documentation>libs/static_assert/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
<category>Metaprogramming</category>
|
|
<category>Correctness</category>
|
|
</library>
|
|
<library>
|
|
<key>spirit</key>
|
|
<boost-version>1.30.0</boost-version>
|
|
<name>Spirit</name>
|
|
<authors>Joel de Guzman, Hartmut Kaiser, and Dan Nuffer</authors>
|
|
<description>LL parser framework represents parsers directly as
|
|
EBNF grammars in inlined C++.</description>
|
|
<documentation>libs/spirit/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>Parsing</category>
|
|
</library>
|
|
<library>
|
|
<key>statechart</key>
|
|
<boost-version>1.34.0</boost-version>
|
|
<name>Statechart</name>
|
|
<authors>Andreas Huber Dönni</authors>
|
|
<description>Boost.Statechart - Arbitrarily complex finite
|
|
state machines can be implemented in easily readable and
|
|
maintainable C++ code.</description>
|
|
<documentation>libs/statechart/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>State</category>
|
|
</library>
|
|
<library>
|
|
<key>system</key>
|
|
<boost-version>1.35.0</boost-version>
|
|
<name>System</name>
|
|
<authors>Beman Dawes</authors>
|
|
<description>Operating system support, including the diagnostics support
|
|
that will be part of the C++0x standard library.</description>
|
|
<documentation>libs/system/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>test</key>
|
|
<boost-version>1.21.0</boost-version>
|
|
<name>Test</name>
|
|
<authors>Gennadiy Rozental</authors>
|
|
<description>Support for simple program testing, full unit
|
|
testing, and for program execution monitoring.</description>
|
|
<documentation>libs/test/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Correctness</category>
|
|
</library>
|
|
<library>
|
|
<key>thread</key>
|
|
<boost-version>1.25.0</boost-version>
|
|
<name>Thread</name>
|
|
<authors>Anthony Williams (originally William Kempf)</authors>
|
|
<description>Portable C++ multi-threading.</description>
|
|
<documentation>libs/thread/</documentation>
|
|
<std-proposal>true</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>thread</key>
|
|
<boost-version>1.25.0</boost-version>
|
|
<update-version>1.49.0</update-version>
|
|
<name>Thread</name>
|
|
<authors>Vicente J. Botet Escribá, Anthony Williams (originally William Kempf)</authors>
|
|
<description>Portable C++ multi-threading.</description>
|
|
<documentation>libs/thread/</documentation>
|
|
<std-proposal>true</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Concurrent</category>
|
|
<category>System</category>
|
|
</library>
|
|
<library>
|
|
<key>timer</key>
|
|
<boost-version>1.9.0</boost-version>
|
|
<name>Timer</name>
|
|
<authors>Beman Dawes</authors>
|
|
<description>Event timer, progress timer, and progress display
|
|
classes.</description>
|
|
<documentation>libs/timer/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>tokenizer</key>
|
|
<boost-version>1.23.0</boost-version>
|
|
<name>Tokenizer</name>
|
|
<authors>John Bandela</authors>
|
|
<description>Break of a string or other character sequence into
|
|
a series of tokens.</description>
|
|
<documentation>libs/tokenizer/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
<category>Iterators</category>
|
|
</library>
|
|
<library>
|
|
<key>tr1</key>
|
|
<boost-version>1.34.0</boost-version>
|
|
<name>TR1</name>
|
|
<authors>John Maddock</authors>
|
|
<description>The TR1 library provides an implementation of the
|
|
C++ Technical Report on Standard Library Extensions. This
|
|
library does not itself implement the TR1 components, rather
|
|
it's a thin wrapper that will include your standard library's
|
|
TR1 implementation (if it has one), otherwise it will include
|
|
the Boost Library equivalents, and import them into namespace
|
|
std::tr1.</description>
|
|
<documentation>libs/tr1/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>tti</key>
|
|
<boost-version>1.54.0</boost-version>
|
|
<name>TTI</name>
|
|
<authors>Edward Diener</authors>
|
|
<description>Type Traits Introspection library.</description>
|
|
<documentation>libs/tti/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
<category>Metaprogramming</category>
|
|
</library>
|
|
<library>
|
|
<key>tuple</key>
|
|
<boost-version>1.24.0</boost-version>
|
|
<name>Tuple</name>
|
|
<authors>Jaakko Järvi</authors>
|
|
<description>Ease definition of functions returning multiple
|
|
values, and more.</description>
|
|
<documentation>libs/tuple/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>type_erasure</key>
|
|
<boost-version>1.54.0</boost-version>
|
|
<name>Type Erasure</name>
|
|
<authors>Steven Watanabe</authors>
|
|
<description>Runtime polymorphism based on concepts.</description>
|
|
<documentation>libs/type_erasure/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>type_traits</key>
|
|
<boost-version>1.13.0</boost-version>
|
|
<name>Type Traits</name>
|
|
<authors>John Maddock, Steve Cleary, et al</authors>
|
|
<description>Templates for fundamental properties of
|
|
types.</description>
|
|
<documentation>libs/type_traits/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Generic</category>
|
|
<category>Metaprogramming</category>
|
|
</library>
|
|
<library>
|
|
<key>typeof</key>
|
|
<boost-version>1.34.0</boost-version>
|
|
<name>Typeof</name>
|
|
<authors>Arkadiy Vertleyb, Peder Holt</authors>
|
|
<description>Typeof operator emulation.</description>
|
|
<documentation>libs/typeof/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Emulation</category>
|
|
</library>
|
|
<library>
|
|
<key>units</key>
|
|
<boost-version>1.36.0</boost-version>
|
|
<name>Units</name>
|
|
<authors>Matthias Schabel and Steven Watanabe</authors>
|
|
<description>Zero-overhead dimensional analysis and unit/quantity manipulation and conversion.</description>
|
|
<documentation>libs/units/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Domain</category>
|
|
</library>
|
|
<library>
|
|
<key>unordered</key>
|
|
<boost-version>1.36.0</boost-version>
|
|
<name>Unordered</name>
|
|
<authors>Daniel James</authors>
|
|
<description>Unordered associative containers.</description>
|
|
<documentation>libs/unordered/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>true</std-tr1>
|
|
<category>Containers</category>
|
|
</library>
|
|
<library>
|
|
<key>utility</key>
|
|
<boost-version>1.13.0</boost-version>
|
|
<name>Utility</name>
|
|
<authors>Dave Abrahams and others</authors>
|
|
<description>Class noncopyable plus checked_delete(),
|
|
checked_array_delete(), next(), prior() function templates,
|
|
plus base-from-member idiom.</description>
|
|
<documentation>libs/utility/utility.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Algorithms</category>
|
|
<category>Function-objects</category>
|
|
<category>Memory</category>
|
|
<category>Patterns</category>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/call_traits</key>
|
|
<boost-version>1.13.0</boost-version>
|
|
<name>Call Traits</name>
|
|
<authors>John Maddock, Howard Hinnant, et al</authors>
|
|
<description>Defines types for passing
|
|
parameters.</description>
|
|
<documentation>libs/utility/call_traits.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/compressed_pair</key>
|
|
<boost-version>1.13.0</boost-version>
|
|
<name>Compressed Pair</name>
|
|
<authors>John Maddock, Howard Hinnant, et al</authors>
|
|
<description>Empty member optimization.</description>
|
|
<documentation>libs/utility/compressed_pair.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Data</category>
|
|
<category>Patterns</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/enable_if</key>
|
|
<boost-version>1.31.0</boost-version>
|
|
<name>Enable If</name>
|
|
<authors>Jaakko Järvi, Jeremiah Willcock, and Andrew
|
|
Lumsdaine</authors>
|
|
<description>Selective inclusion of function template
|
|
overloads.</description>
|
|
<documentation>libs/utility/enable_if.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/identity_type</key>
|
|
<boost-version>1.50.0</boost-version>
|
|
<name>Identity Type</name>
|
|
<authors>Lorenzo Caminiti</authors>
|
|
<description>Wrap types within round parenthesis so they can always be
|
|
passed as macro parameters.</description>
|
|
<documentation>libs/utility/identity_type/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Preprocessor</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/in_place_factories</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>In Place Factory, Typed In Place Factory</name>
|
|
<authors>Fernando Cacciola</authors>
|
|
<description>Generic in-place construction of contained objects
|
|
with a variadic argument-list.</description>
|
|
<documentation>libs/utility/in_place_factories.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Generic</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/operators</key>
|
|
<boost-version>1.9.0</boost-version>
|
|
<name>Operators</name>
|
|
<authors>Dave Abrahams and Jeremy Siek</authors>
|
|
<description>Templates ease arithmetic classes and
|
|
iterators.</description>
|
|
<documentation>libs/utility/operators.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Iterators</category>
|
|
<category>Generic</category>
|
|
<category>Math</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/result_of</key>
|
|
<boost-version>1.32.0</boost-version>
|
|
<name>Result Of</name>
|
|
<authors></authors>
|
|
<description>Determines the type of a function call expression.</description>
|
|
<documentation>libs/utility/utility.htm#result_of</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Function-objects</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/swap</key>
|
|
<boost-version>1.38.0</boost-version>
|
|
<name>Swap</name>
|
|
<authors>Joseph Gauterin</authors>
|
|
<description>Enhanced generic swap function.</description>
|
|
<documentation>libs/utility/swap.html</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>utility/value_initialized</key>
|
|
<boost-version>1.9.0</boost-version>
|
|
<name>Value Initialized</name>
|
|
<authors>Fernando Cacciola</authors>
|
|
<description>Wrapper for uniform-syntax value initialization,
|
|
based on the original idea of David Abrahams.</description>
|
|
<documentation>libs/utility/value_init.htm</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Miscellaneous</category>
|
|
</library>
|
|
<library>
|
|
<key>uuid</key>
|
|
<boost-version>1.42.0</boost-version>
|
|
<name>Uuid</name>
|
|
<authors>Andy Tompkins</authors>
|
|
<description>A universally unique identifier.</description>
|
|
<documentation>libs/uuid/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Data</category>
|
|
<category>Domain</category>
|
|
</library>
|
|
<library>
|
|
<key>variant</key>
|
|
<boost-version>1.31.0</boost-version>
|
|
<name>Variant</name>
|
|
<authors>Eric Friedman and Itay Maman</authors>
|
|
<description>Safe, generic, stack-based discriminated union
|
|
container.</description>
|
|
<documentation>libs/variant/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>Containers</category>
|
|
<category>Data</category>
|
|
</library>
|
|
<library>
|
|
<key>wave</key>
|
|
<boost-version>1.33.0</boost-version>
|
|
<name>Wave</name>
|
|
<authors>Hartmut Kaiser</authors>
|
|
<description>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.</description>
|
|
<documentation>libs/wave/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
</library>
|
|
<library>
|
|
<key>xpressive</key>
|
|
<boost-version>1.34.0</boost-version>
|
|
<name>Xpressive</name>
|
|
<authors>Eric Niebler</authors>
|
|
<description>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.</description>
|
|
<documentation>libs/xpressive/</documentation>
|
|
<std-proposal>false</std-proposal>
|
|
<std-tr1>false</std-tr1>
|
|
<category>String</category>
|
|
</library>
|
|
</boost>
|