|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r77974 - in website/public_html/live: doc generated
From: dnljms_at_[hidden]
Date: 2012-04-14 13:35:50
Author: danieljames
Date: 2012-04-14 13:35:49 EDT (Sat, 14 Apr 2012)
New Revision: 77974
URL: http://svn.boost.org/trac/boost/changeset/77974
Log:
Website: New categories from main repo.
Text files modified:
website/public_html/live/doc/libraries.xml | 52 +++++++++++++++++++++++++++++----------
website/public_html/live/generated/libraries.txt | 42 ++++++++++++++++----------------
2 files changed, 59 insertions(+), 35 deletions(-)
Modified: website/public_html/live/doc/libraries.xml
==============================================================================
--- website/public_html/live/doc/libraries.xml (original)
+++ website/public_html/live/doc/libraries.xml 2012-04-14 13:35:49 EDT (Sat, 14 Apr 2012)
@@ -36,6 +36,9 @@
<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>
@@ -45,15 +48,27 @@
<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>
@@ -221,7 +236,8 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>autolink</build>
- <category>Miscellaneous</category>
+ <category>Domain</category>
+ <category>System</category>
</library>
<library>
<key>circular_buffer</key>
@@ -315,7 +331,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Domain</category>
</library>
<library>
<key>date_time</key>
@@ -328,7 +344,8 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>autolink</build>
- <category>Miscellaneous</category>
+ <category>Domain</category>
+ <category>System</category>
</library>
<library>
<key>disjoint_sets</key>
@@ -375,7 +392,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Emulation</category>
</library>
<library>
<key>filesystem</key>
@@ -389,7 +406,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>autolink</build>
- <category>Miscellaneous</category>
+ <category>System</category>
</library>
<library>
<key>flyweight</key>
@@ -402,7 +419,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Patterns</category>
</library>
<library>
<key>foreach</key>
@@ -425,6 +442,7 @@
<std-tr1>false</std-tr1>
<build>header-only</build>
<category>Algorithms</category>
+ <category>Emulation</category>
</library>
<library>
<key>format</key>
@@ -848,7 +866,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Emulation</category>
</library>
<library>
<key>mpi</key>
@@ -891,7 +909,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>State</category>
</library>
<library>
<key>multi_array</key>
@@ -994,6 +1012,7 @@
<std-tr1>false</std-tr1>
<build>header-only</build>
<category>Programming</category>
+ <category>Emulation</category>
</library>
<library>
<key>phoenix</key>
@@ -1204,7 +1223,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Emulation</category>
</library>
<library>
<key>serialization</key>
@@ -1232,6 +1251,7 @@
<std-tr1>false</std-tr1>
<build>autolink</build>
<category>Function-objects</category>
+ <category>Patterns</category>
</library>
<library>
<key>signals2</key>
@@ -1245,6 +1265,7 @@
<std-tr1>false</std-tr1>
<build>header-only</build>
<category>Function-objects</category>
+ <category>Patterns</category>
</library>
<library>
<key>smart_ptr</key>
@@ -1300,7 +1321,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>State</category>
</library>
<library>
<key>system</key>
@@ -1313,7 +1334,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>autolink</build>
- <category>Miscellaneous</category>
+ <category>System</category>
</library>
<library>
<key>test</key>
@@ -1339,6 +1360,7 @@
<std-tr1>false</std-tr1>
<build>autolink</build>
<category>Concurrent</category>
+ <category>System</category>
</library>
<library>
<key>timer</key>
@@ -1422,7 +1444,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Emulation</category>
</library>
<library>
<key>units</key>
@@ -1434,7 +1456,7 @@
<std-proposal>false</std-proposal>
<std-tr1>false</std-tr1>
<build>header-only</build>
- <category>Miscellaneous</category>
+ <category>Domain</category>
</library>
<library>
<key>unordered</key>
@@ -1463,6 +1485,7 @@
<category>Algorithms</category>
<category>Function-objects</category>
<category>Memory</category>
+ <category>Patterns</category>
<category>Miscellaneous</category>
</library>
<library>
@@ -1489,7 +1512,7 @@
<std-tr1>false</std-tr1>
<build>header-only</build>
<category>Data</category>
- <category>Miscellaneous</category>
+ <category>Patterns</category>
</library>
<library>
<key>utility/enable_if</key>
@@ -1583,6 +1606,7 @@
<std-tr1>false</std-tr1>
<build>header-only</build>
<category>Data</category>
+ <category>Domain</category>
</library>
<library>
<key>variant</key>
Modified: website/public_html/live/generated/libraries.txt
==============================================================================
--- website/public_html/live/generated/libraries.txt (original)
+++ website/public_html/live/generated/libraries.txt 2012-04-14 13:35:49 EDT (Sat, 14 Apr 2012)
@@ -1,4 +1,4 @@
-O:15:"boost_libraries":3:{s:10:"categories";a:20:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"libraries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"librarie
s";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:113:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statistical accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:11:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
+O:15:"boost_libraries":3:{s:10:"categories";a:25:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:6:"Domain";a:3:{s:4:"name";s:6:"Domain";s:5:"title";s:15:"Domain Specific";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:9:"Emulation";a:3:{s:4:"name";s:9:"Emulation";s:5:"title";s:27:"Language Features Emulation";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"li
braries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:8:"Patterns";a:3:{s:4:"name";s:8:"Patterns";s:5:"title";s:19:"Patterns and Idioms";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"libraries";a:0:{}}s:5:"State";a:3:{s:4:"name";s:5:"State";s:5:"title";s:14:"State Machines";s:9:"libraries";a:0:{}}s:6:"System";a:3:{s:4:"name";s:6:"System";s:5:"title";s:6:"System";s:9:"libraries";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:113:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statisti
cal accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:11:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
min/max and min/max element computations.";s:13:"documentation";s:22:"libs/algorithm/minmax/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:16:"algorithm/string";a:11:{s:3:"key";s:16:"algorithm/string";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:11:"String Algo";s:7:"authors";s:11:"Pavol Droba";s:11:"description";s:26:"String algorithms library.";s:13:"documentation";s:22:"libs/algorithm/string/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:10:"Algorithms";}}s:3:"any";a:11:{s:3:"key";s:3:"any";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:3:"Any";s:7:"authors";s:13:"Kevlin Henney";s:11:"description";s:71:"Safe, generic container for single values of
different value types.";s:13:"documentation";s:9:"libs/any/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Data";}}s:5:"array";a:11:{s:3:"key";s:5:"array";s:13:"boost-version";s:6:"1.17.0";s:4:"name";s:5:"Array";s:7:"authors";s:16:"Nicolai Josuttis";s:11:"description";s:64:"STL compliant container wrapper for arrays of
constant size.";s:13:"documentation";s:11:"libs/array/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:4:"asio";a:11:{s:3:"key";s:4:"asio";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:4:"Asio";s:7:"authors";s:14:"Chris Kohlhoff";s:11:"description";s:93:"Portable networking, including sockets, timers,
@@ -13,13 +13,13 @@
positions.";s:13:"documentation";s:10:"libs/bind/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:11:"bind/mem_fn";a:11:{s:3:"key";s:11:"bind/mem_fn";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:15:"Member Function";s:7:"authors";s:11:"Peter Dimov";s:11:"description";s:74:"Generalized binders for function/object/pointers
and member functions.";s:13:"documentation";s:21:"libs/bind/mem_fn.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:8:"bind/ref";a:11:{s:3:"key";s:8:"bind/ref";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:3:"Ref";s:7:"authors";s:61:"Jaako Järvi, Peter Dimov, Doug Gregor, and Dave
Abrahams";s:11:"description";s:66:"A utility library for passing references to
- generic functions.";s:13:"documentation";s:18:"libs/bind/ref.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:6:"chrono";a:11:{s:3:"key";s:6:"chrono";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:6:"Chrono";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:22:"Useful time utilities.";s:13:"documentation";s:12:"libs/chrono/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:15:"circular_buffer";a:11:{s:3:"key";s:15:"circular_buffer";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:15:"Circular Buffer";s:7:"authors";s:10:"Jan Gaspar";s:11:"description";s:62:"A STL compliant container also known as ring or cyclic buffer.";s:13:"documentation";s:21:"libs/circular_buffer/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Contai
ners";}}s:13:"compatibility";a:11:{s:3:"key";s:13:"compatibility";s:13:"boost-version";s:6:"1.21.2";s:4:"name";s:13:"Compatibility";s:7:"authors";s:37:"Ralf Grosse-Kunstleve and Jens Maurer";s:11:"description";s:47:"Help for non-conforming standard
+ generic functions.";s:13:"documentation";s:18:"libs/bind/ref.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:6:"chrono";a:11:{s:3:"key";s:6:"chrono";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:6:"Chrono";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:22:"Useful time utilities.";s:13:"documentation";s:12:"libs/chrono/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:6:"Domain";i:1;s:6:"System";}}s:15:"circular_buffer";a:11:{s:3:"key";s:15:"circular_buffer";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:15:"Circular Buffer";s:7:"authors";s:10:"Jan Gaspar";s:11:"description";s:62:"A STL compliant container also known as ring or cyclic buffer.";s:13:"documentation";s:21:"libs/circular_buffer/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:1
0:"Containers";}}s:13:"compatibility";a:11:{s:3:"key";s:13:"compatibility";s:13:"boost-version";s:6:"1.21.2";s:4:"name";s:13:"Compatibility";s:7:"authors";s:37:"Ralf Grosse-Kunstleve and Jens Maurer";s:11:"description";s:47:"Help for non-conforming standard
libraries.";s:13:"documentation";s:19:"libs/compatibility/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:11:"workarounds";}}s:13:"concept_check";a:11:{s:3:"key";s:13:"concept_check";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:13:"Concept Check";s:7:"authors";s:11:"Jeremy Siek";s:11:"description";s:30:"Tools for generic programming.";s:13:"documentation";s:19:"libs/concept_check/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:7:"Generic";i:1;s:11:"Correctness";}}s:6:"config";a:11:{s:3:"key";s:6:"config";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:6:"Config";s:7:"authors";s:0:"";s:11:"description";s:100:"Helps Boost library developers adapt to compiler
idiosyncrasies; not intended for library users.";s:13:"documentation";s:22:"libs/config/config.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:11:"workarounds";}}s:9:"container";a:11:{s:3:"key";s:9:"container";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:9:"Container";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:43:"Standard library containers and extensions.";s:13:"documentation";s:15:"libs/container/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:10:"conversion";a:11:{s:3:"key";s:10:"conversion";s:13:"boost-version";s:6:"1.20.0";s:4:"name";s:10:"Conversion";s:7:"authors";s:31:"Dave Abrahams and Kevlin Henney";s:11:"description";s:30:"Polymorphic and lexical casts.";s:13:"documentation";s:16:"libs/conversion/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b
:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:13:"Miscellaneous";}}s:3:"crc";a:11:{s:3:"key";s:3:"crc";s:13:"boost-version";s:6:"1.22.0";s:4:"name";s:3:"CRC";s:7:"authors";s:13:"Daryle Walker";s:11:"description";s:208:"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.";s:13:"documentation";s:9:"libs/crc/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"date_time";a:11:{s:3:"key";s:9:"date_time";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:9:"Date Time";s:7:"authors";s:12:"Jeff Garland";s:11:"description";s:71:"A set of date-time libraries based on generic
- programming concepts.";s:13:"documentation";s:15:"libs/date_time/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:13:"disjoint_sets";a:11:{s:3:"key";s:13:"disjoint_sets";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:13:"Disjoint Sets";s:7:"authors";s:43:"Jeremy Siek, Lie-Quan Lee, Andrew Lumsdaine";s:11:"description";s:101:"Boost.DisjointSets provides disjoint sets
+ implementations are template-based.";s:13:"documentation";s:9:"libs/crc/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:6:"Domain";}}s:9:"date_time";a:11:{s:3:"key";s:9:"date_time";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:9:"Date Time";s:7:"authors";s:12:"Jeff Garland";s:11:"description";s:71:"A set of date-time libraries based on generic
+ programming concepts.";s:13:"documentation";s:15:"libs/date_time/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:6:"Domain";i:1;s:6:"System";}}s:13:"disjoint_sets";a:11:{s:3:"key";s:13:"disjoint_sets";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:13:"Disjoint Sets";s:7:"authors";s:43:"Jeremy Siek, Lie-Quan Lee, Andrew Lumsdaine";s:11:"description";s:101:"Boost.DisjointSets provides disjoint sets
operations with union by rank and path
compression.";s:13:"documentation";s:37:"libs/disjoint_sets/disjoint_sets.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:14:"dynamic_bitset";a:11:{s:3:"key";s:14:"dynamic_bitset";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:14:"Dynamic Bitset";s:7:"authors";s:29:"Jeremy Siek and Chuck Allison";s:11:"description";s:373:"The dynamic_bitset class represents a set of bits.
It provides accesses to the value of individual bits via an
@@ -29,10 +29,10 @@
runtime via a parameter to the constructor of the
dynamic_bitset.";s:13:"documentation";s:39:"libs/dynamic_bitset/dynamic_bitset.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:9:"exception";a:11:{s:3:"key";s:9:"exception";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:9:"Exception";s:7:"authors";s:15:"Emil Dotchevski";s:11:"description";s:145:"The Boost Exception library supports transporting
of arbitrary data in exception objects, and transporting of
- exceptions between threads.";s:13:"documentation";s:39:"libs/exception/doc/boost-exception.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:10:"filesystem";a:11:{s:3:"key";s:10:"filesystem";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:10:"Filesystem";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:120:"The Boost Filesystem Library provides portable
+ exceptions between threads.";s:13:"documentation";s:39:"libs/exception/doc/boost-exception.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:9:"Emulation";}}s:10:"filesystem";a:11:{s:3:"key";s:10:"filesystem";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:10:"Filesystem";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:120:"The Boost Filesystem Library provides portable
facilities to query and manipulate paths, files, and
- directories.";s:13:"documentation";s:16:"libs/filesystem/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"flyweight";a:11:{s:3:"key";s:9:"flyweight";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:9:"Flyweight";s:7:"authors";s:24:"JoaquÃn M López Muñoz";s:11:"description";s:74:"Design pattern to manage large quantities of highly redundant
- objects.";s:13:"documentation";s:15:"libs/flyweight/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:7:"foreach";a:11:{s:3:"key";s:7:"foreach";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:7:"Foreach";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:646:"In C++, writing a loop that iterates over a
+ directories.";s:13:"documentation";s:16:"libs/filesystem/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:6:"System";}}s:9:"flyweight";a:11:{s:3:"key";s:9:"flyweight";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:9:"Flyweight";s:7:"authors";s:24:"JoaquÃn M López Muñoz";s:11:"description";s:74:"Design pattern to manage large quantities of highly redundant
+ objects.";s:13:"documentation";s:15:"libs/flyweight/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:8:"Patterns";}}s:7:"foreach";a:11:{s:3:"key";s:7:"foreach";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:7:"Foreach";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:646:"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
@@ -42,7 +42,7 @@
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.";s:13:"documentation";s:13:"libs/foreach/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:6:"format";a:11:{s:3:"key";s:6:"format";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:6:"Format";s:7:"authors";s:13:"Samuel Krempp";s:11:"description";s:500:"The format library provides a class for formatting
+ predicates.";s:13:"documentation";s:13:"libs/foreach/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:10:"Algorithms";i:1;s:9:"Emulation";}}s:6:"format";a:11:{s:3:"key";s:6:"format";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:6:"Format";s:7:"authors";s:13:"Samuel Krempp";s:11:"description";s:500:"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
@@ -91,14 +91,14 @@
dimentional space. Octonions, like quaternions, are a relative
of complex numbers.";s:13:"documentation";s:10:"libs/math/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:18:"math/common_factor";a:11:{s:3:"key";s:18:"math/common_factor";s:13:"boost-version";s:6:"1.26.0";s:4:"name";s:18:"Math Common Factor";s:7:"authors";s:13:"Daryle Walker";s:11:"description";s:54:"Greatest common divisor and least common
multiple.";s:13:"documentation";s:32:"libs/math/doc/common_factor.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:13:"math/octonion";a:11:{s:3:"key";s:13:"math/octonion";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:13:"Math Octonion";s:7:"authors";s:12:"Hubert Holin";s:11:"description";s:10:"Octonions.";s:13:"documentation";s:28:"libs/math/doc/octonion/html/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:15:"math/quaternion";a:11:{s:3:"key";s:15:"math/quaternion";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:15:"Math Quaternion";s:7:"authors";s:12:"Hubert Holin";s:11:"description";s:12:"Quaternions.";s:13:"documentation";s:30:"libs/math/doc/quaternion/html/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:22:"math/special_functions";a:1
1:{s:3:"key";s:22:"math/special_functions";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:22:"Math/Special Functions";s:7:"authors";s:59:"John Maddock, Paul Bristow, Hubert Holin and Xiaogang Zhang";s:11:"description";s:51:"A wide selection of mathematical special functions.";s:13:"documentation";s:31:"libs/math/doc/sf_and_dist/html/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:30:"math/statistical_distributions";a:11:{s:3:"key";s:30:"math/statistical_distributions";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:30:"Math/Statistical Distributions";s:7:"authors";s:29:"John Maddock and Paul Bristow";s:11:"description";s:96:"A wide selection of univariate statistical distributions and
- functions that operate on them.";s:13:"documentation";s:31:"libs/math/doc/sf_and_dist/html/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:4:"move";a:11:{s:3:"key";s:4:"move";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:4:"Move";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:54:"Portable move semantics for C++03 and C++11 compilers.";s:13:"documentation";s:10:"libs/move/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:3:"mpi";a:11:{s:3:"key";s:3:"mpi";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"MPI";s:7:"authors";s:34:"Douglas Gregor and Matthias Troyer";s:11:"description";s:102:"Message Passing Interface library, for use in distributed-memory
+ functions that operate on them.";s:13:"documentation";s:31:"libs/math/doc/sf_and_dist/html/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:4:"move";a:11:{s:3:"key";s:4:"move";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:4:"Move";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:54:"Portable move semantics for C++03 and C++11 compilers.";s:13:"documentation";s:10:"libs/move/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:9:"Emulation";}}s:3:"mpi";a:11:{s:3:"key";s:3:"mpi";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"MPI";s:7:"authors";s:34:"Douglas Gregor and Matthias Troyer";s:11:"description";s:102:"Message Passing Interface library, for use in distributed-memory
parallel application programming.";s:13:"documentation";s:9:"libs/mpi/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:10:"Concurrent";}}s:3:"mpl";a:11:{s:3:"key";s:3:"mpl";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:3:"MPL";s:7:"authors";s:16:"Aleksey Gurtovoy";s:11:"description";s:372:"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.";s:13:"documentation";s:9:"libs/mpl/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:15:"Metaprogramming";}}s:3:"msm";a:11:{s:3:"key";s:3:"msm";s:13:"boost-version";s:6:"1.44.0";s:4:"name";s:18:"Meta State Machine";s:7:"authors";s:16:"Christophe Henry";s:11:"description";s:74:"A very high-performance library for expressive UML2 finite state machines.";s:13:"documentation";s:9:"libs/msm/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:11:"multi_array";a:11:{s:3:"key";s:11:"multi_array";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:11:"Multi-Array";s:7:"authors";s:10:"Ron Garcia";s:11:"description";s:128:"Boost.MultiArray provides a generic N-dimensional
+ the current language.";s:13:"documentation";s:9:"libs/mpl/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:15:"Metaprogramming";}}s:3:"msm";a:11:{s:3:"key";s:3:"msm";s:13:"boost-version";s:6:"1.44.0";s:4:"name";s:18:"Meta State Machine";s:7:"authors";s:16:"Christophe Henry";s:11:"description";s:74:"A very high-performance library for expressive UML2 finite state machines.";s:13:"documentation";s:9:"libs/msm/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:5:"State";}}s:11:"multi_array";a:11:{s:3:"key";s:11:"multi_array";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:11:"Multi-Array";s:7:"authors";s:10:"Ron Garcia";s:11:"description";s:128:"Boost.MultiArray provides a generic N-dimensional
array concept definition and common implementations of that
interface.";s:13:"documentation";s:17:"libs/multi_array/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:10:"Containers";i:1;s:4:"Math";}}s:11:"multi_index";a:11:{s:3:"key";s:11:"multi_index";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:11:"Multi-Index";s:7:"authors";s:24:"JoaquÃn M López Muñoz";s:11:"description";s:228:"The Boost Multi-index Containers Library provides
a class template named multi_index_container which enables the
@@ -110,7 +110,7 @@
as basic linear algebra routines. Several dense, packed and
sparse storage schemes are supported.";s:13:"documentation";s:32:"libs/numeric/ublas/doc/index.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:8:"optional";a:11:{s:3:"key";s:8:"optional";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:8:"Optional";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:52:"Discriminated-union wrapper for optional
values.";s:13:"documentation";s:14:"libs/optional/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"parameter";a:11:{s:3:"key";s:9:"parameter";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:9:"Parameter";s:7:"authors";s:32:"David Abrahams and Daniel Wallin";s:11:"description";s:76:"Boost.Parameter Library - Write functions that
- accept arguments by name.";s:13:"documentation";s:15:"libs/parameter/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:11:"Programming";}}s:7:"phoenix";a:11:{s:3:"key";s:7:"phoenix";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:7:"Phoenix";s:7:"authors";s:45:"Joel de Guzman, Dan Marsden and Thomas Heller";s:11:"description";s:76:"Define small unnamed function objects at the actual
+ accept arguments by name.";s:13:"documentation";s:15:"libs/parameter/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:11:"Programming";i:1;s:9:"Emulation";}}s:7:"phoenix";a:11:{s:3:"key";s:7:"phoenix";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:7:"Phoenix";s:7:"authors";s:45:"Joel de Guzman, Dan Marsden and Thomas Heller";s:11:"description";s:76:"Define small unnamed function objects at the actual
call site, and more.";s:13:"documentation";s:13:"libs/phoenix/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:7:"polygon";a:11:{s:3:"key";s:7:"polygon";s:13:"boost-version";s:6:"1.44.0";s:4:"name";s:7:"Polygon";s:7:"authors";s:16:"Lucanus Simonson";s:11:"description";s:94:"Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.";s:13:"documentation";s:13:"libs/polygon/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"pool";a:11:{s:3:"key";s:4:"pool";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:4:"Pool";s:7:"authors";s:12:"Steve Cleary";s:11:"description";s:23:"Memory pool management.";s:13:"documentation";s:10:"libs/pool/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:6:"Memory";}}s:12:"pre
processor";a:11:{s:3:"key";s:12:"preprocessor";s:13:"boost-version";s:6:"1.26.0";s:4:"name";s:12:"Preprocessor";s:7:"authors";s:33:"Vesa Karvonen and Paul Mensonides";s:11:"description";s:74:"Preprocessor metaprogramming tools including
repetition and recursion.";s:13:"documentation";s:18:"libs/preprocessor/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:12:"Preprocessor";}}s:15:"program_options";a:11:{s:3:"key";s:15:"program_options";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:15:"Program Options";s:7:"authors";s:13:"Vladimir Prus";s:11:"description";s:198:"The program_options library allows program
developers to obtain program options, that is (name, value)
@@ -123,17 +123,17 @@
and vice-versa, using no special tools -- just your C++
compiler.";s:13:"documentation";s:12:"libs/python/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:8:"category";a:1:{i:0;s:14:"Inter-language";}}s:6:"random";a:11:{s:3:"key";s:6:"random";s:13:"boost-version";s:6:"1.15.0";s:4:"name";s:6:"Random";s:7:"authors";s:11:"Jens Maurer";s:11:"description";s:51:"A complete system for random number
generation.";s:13:"documentation";s:12:"libs/random/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"range";a:11:{s:3:"key";s:5:"range";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:5:"Range";s:7:"authors";s:29:"Niel Groves, Thorsten Ottosen";s:11:"description";s:96:"A new infrastructure for generic algorithms that
- builds on top of the new iterator concepts.";s:13:"documentation";s:11:"libs/range/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:5:"ratio";a:11:{s:3:"key";s:5:"ratio";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:5:"Ratio";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:33:"Compile time rational arithmetic.";s:13:"documentation";s:11:"libs/ratio/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:8:"rational";a:11:{s:3:"key";s:8:"rational";s:13:"boost-version";s:6:"1.11.0";s:4:"name";s:8:"Rational";s:7:"authors";s:10:"Paul Moore";s:11:"description";s:24:"A rational number class.";s:13:"documentation";s:14:"libs/rational/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"regex";a:11:{s:3:"key";s:5:"regex";s:13:"boost
-version";s:6:"1.18.0";s:4:"name";s:5:"Regex";s:7:"authors";s:12:"John Maddock";s:11:"description";s:27:"Regular expression library.";s:13:"documentation";s:11:"libs/regex/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:6:"String";}}s:10:"scope_exit";a:11:{s:3:"key";s:10:"scope_exit";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:10:"Scope Exit";s:7:"authors";s:17:"Alexander Nasonov";s:11:"description";s:37:"Execute arbitrary code at scope exit.";s:13:"documentation";s:16:"libs/scope_exit/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:13:"serialization";a:11:{s:3:"key";s:13:"serialization";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:13:"Serialization";s:7:"authors";s:12:"Robert Ramey";s:11:"description";s:50:"Serialization for persistence and
+ builds on top of the new iterator concepts.";s:13:"documentation";s:11:"libs/range/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:5:"ratio";a:11:{s:3:"key";s:5:"ratio";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:5:"Ratio";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:33:"Compile time rational arithmetic.";s:13:"documentation";s:11:"libs/ratio/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:8:"rational";a:11:{s:3:"key";s:8:"rational";s:13:"boost-version";s:6:"1.11.0";s:4:"name";s:8:"Rational";s:7:"authors";s:10:"Paul Moore";s:11:"description";s:24:"A rational number class.";s:13:"documentation";s:14:"libs/rational/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"regex";a:11:{s:3:"key";s:5:"regex";s:13:"boost
-version";s:6:"1.18.0";s:4:"name";s:5:"Regex";s:7:"authors";s:12:"John Maddock";s:11:"description";s:27:"Regular expression library.";s:13:"documentation";s:11:"libs/regex/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:6:"String";}}s:10:"scope_exit";a:11:{s:3:"key";s:10:"scope_exit";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:10:"Scope Exit";s:7:"authors";s:17:"Alexander Nasonov";s:11:"description";s:37:"Execute arbitrary code at scope exit.";s:13:"documentation";s:16:"libs/scope_exit/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:9:"Emulation";}}s:13:"serialization";a:11:{s:3:"key";s:13:"serialization";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:13:"Serialization";s:7:"authors";s:12:"Robert Ramey";s:11:"description";s:50:"Serialization for persistence and
marshalling.";s:13:"documentation";s:19:"libs/serialization/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:2:"IO";}}s:7:"signals";a:11:{s:3:"key";s:7:"signals";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:7:"Signals";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:52:"Managed signals & slots callback
- implementation.";s:13:"documentation";s:13:"libs/signals/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:8:"signals2";a:11:{s:3:"key";s:8:"signals2";s:13:"boost-version";s:6:"1.39.0";s:4:"name";s:8:"Signals2";s:7:"authors";s:15:"Frank Mori Hess";s:11:"description";s:76:"Managed signals & slots callback
- implementation (thread-safe version 2).";s:13:"documentation";s:14:"libs/signals2/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:9:"smart_ptr";a:11:{s:3:"key";s:9:"smart_ptr";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:9:"Smart Ptr";s:7:"authors";s:58:"Greg Colvin, Beman Dawes, Peter Dimov, and Darin
+ implementation.";s:13:"documentation";s:13:"libs/signals/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:16:"Function-objects";i:1;s:8:"Patterns";}}s:8:"signals2";a:11:{s:3:"key";s:8:"signals2";s:13:"boost-version";s:6:"1.39.0";s:4:"name";s:8:"Signals2";s:7:"authors";s:15:"Frank Mori Hess";s:11:"description";s:76:"Managed signals & slots callback
+ implementation (thread-safe version 2).";s:13:"documentation";s:14:"libs/signals2/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:16:"Function-objects";i:1;s:8:"Patterns";}}s:9:"smart_ptr";a:11:{s:3:"key";s:9:"smart_ptr";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:9:"Smart Ptr";s:7:"authors";s:58:"Greg Colvin, Beman Dawes, Peter Dimov, and Darin
Adler";s:11:"description";s:30:"Smart pointer class templates.";s:13:"documentation";s:28:"libs/smart_ptr/smart_ptr.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:6:"Memory";}}s:13:"static_assert";a:11:{s:3:"key";s:13:"static_assert";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:13:"Static Assert";s:7:"authors";s:12:"John Maddock";s:11:"description";s:48:"Static assertions (compile time
assertions).";s:13:"documentation";s:19:"libs/static_assert/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:3:{i:0;s:7:"Generic";i:1;s:15:"Metaprogramming";i:2;s:11:"Correctness";}}s:6:"spirit";a:11:{s:3:"key";s:6:"spirit";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:6:"Spirit";s:7:"authors";s:46:"Joel de Guzman, Hartmut Kaiser, and Dan Nuffer";s:11:"description";s:84:"LL parser framework represents parsers directly as
EBNF grammars in inlined C++.";s:13:"documentation";s:12:"libs/spirit/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:7:"Parsing";}}s:10:"statechart";a:11:{s:3:"key";s:10:"statechart";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:10:"Statechart";s:7:"authors";s:20:"Andreas Huber Dönni";s:11:"description";s:133:"Boost.Statechart - Arbitrarily complex finite
state machines can be implemented in easily readable and
- maintainable C++ code.";s:13:"documentation";s:16:"libs/statechart/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:6:"system";a:11:{s:3:"key";s:6:"system";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"System";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:112:"Operating system support, including the diagnostics support
- that will be part of the C++0x standard library.";s:13:"documentation";s:12:"libs/system/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"test";a:11:{s:3:"key";s:4:"test";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:4:"Test";s:7:"authors";s:17:"Gennadiy Rozental";s:11:"description";s:96:"Support for simple program testing, full unit
- testing, and for program execution monitoring.";s:13:"documentation";s:10:"libs/test/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:11:"Correctness";}}s:6:"thread";a:11:{s:3:"key";s:6:"thread";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:6:"Thread";s:7:"authors";s:43:"Anthony Williams (originally William Kempf)";s:11:"description";s:29:"Portable C++ multi-threading.";s:13:"documentation";s:12:"libs/thread/";s:12:"std-proposal";b:1;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:10:"Concurrent";}}s:5:"timer";a:11:{s:3:"key";s:5:"timer";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:5:"Timer";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:62:"Event timer, progress timer, and progress display
+ maintainable C++ code.";s:13:"documentation";s:16:"libs/statechart/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:5:"State";}}s:6:"system";a:11:{s:3:"key";s:6:"system";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"System";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:112:"Operating system support, including the diagnostics support
+ that will be part of the C++0x standard library.";s:13:"documentation";s:12:"libs/system/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:6:"System";}}s:4:"test";a:11:{s:3:"key";s:4:"test";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:4:"Test";s:7:"authors";s:17:"Gennadiy Rozental";s:11:"description";s:96:"Support for simple program testing, full unit
+ testing, and for program execution monitoring.";s:13:"documentation";s:10:"libs/test/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:11:"Correctness";}}s:6:"thread";a:11:{s:3:"key";s:6:"thread";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:6:"Thread";s:7:"authors";s:43:"Anthony Williams (originally William Kempf)";s:11:"description";s:29:"Portable C++ multi-threading.";s:13:"documentation";s:12:"libs/thread/";s:12:"std-proposal";b:1;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:10:"Concurrent";i:1;s:6:"System";}}s:5:"timer";a:11:{s:3:"key";s:5:"timer";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:5:"Timer";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:62:"Event timer, progress timer, and progress display
classes.";s:13:"documentation";s:11:"libs/timer/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"tokenizer";a:11:{s:3:"key";s:9:"tokenizer";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:9:"Tokenizer";s:7:"authors";s:12:"John Bandela";s:11:"description";s:74:"Break of a string or other character sequence into
a series of tokens.";s:13:"documentation";s:15:"libs/tokenizer/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:9:"Iterators";}}s:3:"tr1";a:11:{s:3:"key";s:3:"tr1";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:3:"TR1";s:7:"authors";s:12:"John Maddock";s:11:"description";s:388:"The TR1 library provides an implementation of the
C++ Technical Report on Standard Library Extensions. This
@@ -143,15 +143,15 @@
the Boost Library equivalents, and import them into namespace
std::tr1.";s:13:"documentation";s:9:"libs/tr1/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:5:"tuple";a:11:{s:3:"key";s:5:"tuple";s:13:"boost-version";s:6:"1.24.0";s:4:"name";s:5:"Tuple";s:7:"authors";s:13:"Jaakko Järvi";s:11:"description";s:69:"Ease definition of functions returning multiple
values, and more.";s:13:"documentation";s:11:"libs/tuple/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Data";}}s:11:"type_traits";a:11:{s:3:"key";s:11:"type_traits";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:11:"Type Traits";s:7:"authors";s:33:"John Maddock, Steve Cleary, et al";s:11:"description";s:50:"Templates for fundamental properties of
- types.";s:13:"documentation";s:17:"libs/type_traits/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:7:"Generic";i:1;s:15:"Metaprogramming";}}s:6:"typeof";a:11:{s:3:"key";s:6:"typeof";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:6:"Typeof";s:7:"authors";s:28:"Arkadiy Vertleyb, Peder Holt";s:11:"description";s:26:"Typeof operator emulation.";s:13:"documentation";s:12:"libs/typeof/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:5:"units";a:11:{s:3:"key";s:5:"units";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:5:"Units";s:7:"authors";s:36:"Matthias Schabel and Steven Watanabe";s:11:"description";s:81:"Zero-overhead dimensional analysis and unit/quantity manipulation and conversion.";s:13:"documentation";s:11:"libs/units/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";
a:1:{i:0;s:13:"Miscellaneous";}}s:9:"unordered";a:11:{s:3:"key";s:9:"unordered";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:9:"Unordered";s:7:"authors";s:12:"Daniel James";s:11:"description";s:33:"Unordered associative containers.";s:13:"documentation";s:15:"libs/unordered/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:7:"utility";a:11:{s:3:"key";s:7:"utility";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:7:"Utility";s:7:"authors";s:24:"Dave Abrahams and others";s:11:"description";s:137:"Class noncopyable plus checked_delete(),
+ types.";s:13:"documentation";s:17:"libs/type_traits/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:7:"Generic";i:1;s:15:"Metaprogramming";}}s:6:"typeof";a:11:{s:3:"key";s:6:"typeof";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:6:"Typeof";s:7:"authors";s:28:"Arkadiy Vertleyb, Peder Holt";s:11:"description";s:26:"Typeof operator emulation.";s:13:"documentation";s:12:"libs/typeof/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:9:"Emulation";}}s:5:"units";a:11:{s:3:"key";s:5:"units";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:5:"Units";s:7:"authors";s:36:"Matthias Schabel and Steven Watanabe";s:11:"description";s:81:"Zero-overhead dimensional analysis and unit/quantity manipulation and conversion.";s:13:"documentation";s:11:"libs/units/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{
i:0;s:6:"Domain";}}s:9:"unordered";a:11:{s:3:"key";s:9:"unordered";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:9:"Unordered";s:7:"authors";s:12:"Daniel James";s:11:"description";s:33:"Unordered associative containers.";s:13:"documentation";s:15:"libs/unordered/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:7:"utility";a:11:{s:3:"key";s:7:"utility";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:7:"Utility";s:7:"authors";s:24:"Dave Abrahams and others";s:11:"description";s:137:"Class noncopyable plus checked_delete(),
checked_array_delete(), next(), prior() function templates,
- plus base-from-member idiom.";s:13:"documentation";s:24:"libs/utility/utility.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:4:{i:0;s:10:"Algorithms";i:1;s:16:"Function-objects";i:2;s:6:"Memory";i:3;s:13:"Miscellaneous";}}s:19:"utility/call_traits";a:11:{s:3:"key";s:19:"utility/call_traits";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:11:"Call Traits";s:7:"authors";s:35:"John Maddock, Howard Hinnant, et al";s:11:"description";s:41:"Defines types for passing
- parameters.";s:13:"documentation";s:28:"libs/utility/call_traits.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:23:"utility/compressed_pair";a:11:{s:3:"key";s:23:"utility/compressed_pair";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:15:"Compressed Pair";s:7:"authors";s:35:"John Maddock, Howard Hinnant, et al";s:11:"description";s:26:"Empty member optimization.";s:13:"documentation";s:32:"libs/utility/compressed_pair.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:4:"Data";i:1;s:13:"Miscellaneous";}}s:17:"utility/enable_if";a:11:{s:3:"key";s:17:"utility/enable_if";s:13:"boost-version";s:6:"1.31.0";s:4:"name";s:9:"Enable If";s:7:"authors";s:58:"Jaakko Järvi, Jeremiah Willcock, and Andrew
+ plus base-from-member idiom.";s:13:"documentation";s:24:"libs/utility/utility.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:5:{i:0;s:10:"Algorithms";i:1;s:16:"Function-objects";i:2;s:6:"Memory";i:3;s:8:"Patterns";i:4;s:13:"Miscellaneous";}}s:19:"utility/call_traits";a:11:{s:3:"key";s:19:"utility/call_traits";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:11:"Call Traits";s:7:"authors";s:35:"John Maddock, Howard Hinnant, et al";s:11:"description";s:41:"Defines types for passing
+ parameters.";s:13:"documentation";s:28:"libs/utility/call_traits.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:23:"utility/compressed_pair";a:11:{s:3:"key";s:23:"utility/compressed_pair";s:13:"boost-version";s:6:"1.13.0";s:4:"name";s:15:"Compressed Pair";s:7:"authors";s:35:"John Maddock, Howard Hinnant, et al";s:11:"description";s:26:"Empty member optimization.";s:13:"documentation";s:32:"libs/utility/compressed_pair.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:4:"Data";i:1;s:8:"Patterns";}}s:17:"utility/enable_if";a:11:{s:3:"key";s:17:"utility/enable_if";s:13:"boost-version";s:6:"1.31.0";s:4:"name";s:9:"Enable If";s:7:"authors";s:58:"Jaakko Järvi, Jeremiah Willcock, and Andrew
Lumsdaine";s:11:"description";s:55:"Selective inclusion of function template
overloads.";s:13:"documentation";s:27:"libs/utility/enable_if.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:26:"utility/in_place_factories";a:11:{s:3:"key";s:26:"utility/in_place_factories";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:40:"In Place Factory, Typed In Place Factory";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:85:"Generic in-place construction of contained objects
with a variadic argument-list.";s:13:"documentation";s:36:"libs/utility/in_place_factories.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:17:"utility/operators";a:11:{s:3:"key";s:17:"utility/operators";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:9:"Operators";s:7:"authors";s:29:"Dave Abrahams and Jeremy Siek";s:11:"description";s:52:"Templates ease arithmetic classes and
iterators.";s:13:"documentation";s:26:"libs/utility/operators.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:3:{i:0;s:9:"Iterators";i:1;s:7:"Generic";i:2;s:4:"Math";}}s:17:"utility/result_of";a:11:{s:3:"key";s:17:"utility/result_of";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:9:"Result Of";s:7:"authors";s:0:"";s:11:"description";s:50:"Determines the type of a function call expression.";s:13:"documentation";s:34:"libs/utility/utility.htm#result_of";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:12:"utility/swap";a:11:{s:3:"key";s:12:"utility/swap";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:4:"Swap";s:7:"authors";s:15:"Joseph Gauterin";s:11:"description";s:31:"Enhanced generic swap function.";s:13:"documentation";s:22:"libs/utility/swap.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-on
ly";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:25:"utility/value_initialized";a:11:{s:3:"key";s:25:"utility/value_initialized";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:17:"Value Initialized";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:98:"Wrapper for uniform-syntax value initialization,
- based on the original idea of David Abrahams.";s:13:"documentation";s:27:"libs/utility/value_init.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"uuid";a:11:{s:3:"key";s:4:"uuid";s:13:"boost-version";s:6:"1.42.0";s:4:"name";s:4:"Uuid";s:7:"authors";s:13:"Andy Tompkins";s:11:"description";s:32:"A universally unique identifier.";s:13:"documentation";s:10:"libs/uuid/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Data";}}s:7:"variant";a:11:{s:3:"key";s:7:"variant";s:13:"boost-version";s:6:"1.31.0";s:4:"name";s:7:"Variant";s:7:"authors";s:28:"Eric Friedman and Itay Maman";s:11:"description";s:61:"Safe, generic, stack-based discriminated union
+ based on the original idea of David Abrahams.";s:13:"documentation";s:27:"libs/utility/value_init.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"uuid";a:11:{s:3:"key";s:4:"uuid";s:13:"boost-version";s:6:"1.42.0";s:4:"name";s:4:"Uuid";s:7:"authors";s:13:"Andy Tompkins";s:11:"description";s:32:"A universally unique identifier.";s:13:"documentation";s:10:"libs/uuid/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:4:"Data";i:1;s:6:"Domain";}}s:7:"variant";a:11:{s:3:"key";s:7:"variant";s:13:"boost-version";s:6:"1.31.0";s:4:"name";s:7:"Variant";s:7:"authors";s:28:"Eric Friedman and Itay Maman";s:11:"description";s:61:"Safe, generic, stack-based discriminated union
container.";s:13:"documentation";s:13:"libs/variant/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:4:"wave";a:11:{s:3:"key";s:4:"wave";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:4:"Wave";s:7:"authors";s:14:"Hartmut Kaiser";s:11:"description";s:200:"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
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk