[Boost-commit] svn:boost r75652 - website/public_html/beta/doc

Subject: [Boost-commit] svn:boost r75652 - website/public_html/beta/doc
From: dnljms_at_[hidden]
Date: 2011-11-24 18:55:54

Author: danieljames
Date: 2011-11-24 18:55:54 EST (Thu, 24 Nov 2011)
New Revision: 75652
URL: http://svn.boost.org/trac/boost/changeset/75652

Log:
Website: More consistent library links from documentation page.

I haven't checked that these work for old versions yet.
Text files modified: 
   website/public_html/beta/doc/libraries.txt |   128 ++++++++++++++--------------            
   website/public_html/beta/doc/libraries.xml |   182 +++++++++++++++++++-------------------- 
   2 files changed, 154 insertions(+), 156 deletions(-)

Modified: website/public_html/beta/doc/libraries.txt
==============================================================================
--- website/public_html/beta/doc/libraries.txt	(original)
+++ website/public_html/beta/doc/libraries.txt	2011-11-24 18:55:54 EST (Thu, 24 Nov 2011)
@@ -1,25 +1,25 @@
-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:112:{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:28:"libs/accumulators/index.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: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:32:"libs/algorithm/minmax/index.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:"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:25:"doc/html/string_algo.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: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:17:"doc/html/any.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:"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:19:"doc/html/array.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: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,
-    hostname resolution and socket iostreams.";s:13:"documentation";s:24:"doc/html/boost_asio.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:19:"autolink-dependency";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:10:"Concurrent";i:1;s:2:"IO";}}s:6:"assign";a:11:{s:3:"key";s:6:"assign";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:6:"Assign";s:7:"authors";s:16:"Thorsten Ottosen";s:11:"description";s:77:"Filling containers with constant or generated data
-    has never been easier.";s:13:"documentation";s:26:"libs/assign/doc/index.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:2:"IO";}}s:5:"bimap";a:11:{s:3:"key";s:5:"bimap";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:5:"Bimap";s:7:"authors";s:16:"Matias Capeletto";s:11:"description";s:138:"Bidirectional maps library for C++. With Boost.Bimap you
+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:112:{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
+    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,
+    hostname resolution and socket iostreams.";s:13:"documentation";s:10:"libs/asio/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:19:"autolink-dependency";s:8:"autolink";b:1;s:8:"category";a:2:{i:0;s:10:"Concurrent";i:1;s:2:"IO";}}s:6:"assign";a:11:{s:3:"key";s:6:"assign";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:6:"Assign";s:7:"authors";s:16:"Thorsten Ottosen";s:11:"description";s:77:"Filling containers with constant or generated data
+    has never been easier.";s:13:"documentation";s:12:"libs/assign/";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:2:"IO";}}s:5:"bimap";a:11:{s:3:"key";s:5:"bimap";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:5:"Bimap";s:7:"authors";s:16:"Matias Capeletto";s:11:"description";s:138:"Bidirectional maps library for C++. With Boost.Bimap you
     can create associative containers in which both types can be used
-    as key.";s:13:"documentation";s:30:"libs/bimap/doc/html/index.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:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:4:"bind";a:11:{s:3:"key";s:4:"bind";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:4:"Bind";s:7:"authors";s:11:"Peter Dimov";s:11:"description";s:312:"boost::bind is a generalization of the standard
+    as key.";s:13:"documentation";s:11:"libs/bimap/";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:"bind";a:11:{s:3:"key";s:4:"bind";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:4:"Bind";s:7:"authors";s:11:"Peter Dimov";s:11:"description";s:312:"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.";s:13:"documentation";s:19:"libs/bind/bind.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: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
+    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:17:"doc/html/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:22:"libs/chrono/index.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: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:31:"libs/circular_buffer/index.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: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:29:"libs/compatibility/index.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: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:36:"libs/concept_check/concept_check.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: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:25:"libs/container/index.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: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:26:"libs/conversion/index.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: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
+    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
+    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:19:"libs/crc/index.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: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:23:"doc/html/date_time.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: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: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
     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
@@ -31,8 +31,8 @@
     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
     facilities to query and manipulate paths, files, and
-    directories.";s:13:"documentation";s:26:"libs/filesystem/index.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: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:29:"libs/flyweight/doc/index.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: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: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:19:"libs/flyweight/doc/";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
     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:21:"doc/html/foreach.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:"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: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
     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
@@ -50,35 +50,35 @@
     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%.";s:13:"documentation";s:22:"libs/format/index.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:2:{i:0;s:6:"String";i:1;s:2:"IO";}}s:8:"function";a:11:{s:3:"key";s:8:"function";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:8:"Function";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:61:"Function object wrappers for deferred calls or
-    callbacks.";s:13:"documentation";s:22:"doc/html/function.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:2:{i:0;s:16:"Function-objects";i:1;s:11:"Programming";}}s:14:"function_types";a:11:{s:3:"key";s:14:"function_types";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:14:"Function Types";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:164:"Boost.FunctionTypes provides functionality to classify,
+    operator%.";s:13:"documentation";s:12:"libs/format/";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:2:"IO";}}s:8:"function";a:11:{s:3:"key";s:8:"function";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:8:"Function";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:61:"Function object wrappers for deferred calls or
+    callbacks.";s:13:"documentation";s:14:"libs/function/";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:16:"Function-objects";i:1;s:11:"Programming";}}s:14:"function_types";a:11:{s:3:"key";s:14:"function_types";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:14:"Function Types";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:164:"Boost.FunctionTypes provides functionality to classify,
     decompose and synthesize function, function pointer, function reference and
-    pointer to member types.";s:13:"documentation";s:39:"libs/function_types/doc/html/index.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:2:{i:0;s:7:"Generic";i:1;s:15:"Metaprogramming";}}s:10:"functional";a:11:{s:3:"key";s:10:"functional";s:13:"boost-version";s:6:"1.16.0";s:4:"name";s:10:"Functional";s:7:"authors";s:12:"Mark Rodgers";s:11:"description";s:106:"The Boost.Function library contains a family of
+    pointer to member types.";s:13:"documentation";s:20:"libs/function_types/";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:15:"Metaprogramming";}}s:10:"functional";a:11:{s:3:"key";s:10:"functional";s:13:"boost-version";s:6:"1.16.0";s:4:"name";s:10:"Functional";s:7:"authors";s:12:"Mark Rodgers";s:11:"description";s:106:"The Boost.Function library contains a family of
     class templates that are function object
-    wrappers.";s:13:"documentation";s:26:"libs/functional/index.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:16:"Function-objects";}}s:15:"functional/hash";a:11:{s:3:"key";s:15:"functional/hash";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:15:"Functional/Hash";s:7:"authors";s:12:"Daniel James";s:11:"description";s:79:"A TR1 hash function object that can be extended to
-    hash user defined types.";s:13:"documentation";s:18:"doc/html/hash.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:18:"functional/factory";a:11:{s:3:"key";s:18:"functional/factory";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Factory";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:64:"Function object templates for dynamic and static object creation";s:13:"documentation";s:34:"libs/functional/factory/index.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:16:"Function-objects";}}s:18:"functional/forward";a:11:{s:3:"key";s:18:"functional/forward";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Forward";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:72:"Adapters to allow generic function objects to accept arbitrary arguments";s:13:"documentation";s:34:"libs/functional/for
ward/index.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:16:"Function-objects";}}s:6:"fusion";a:11:{s:3:"key";s:6:"fusion";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"Fusion";s:7:"authors";s:48:"Joel de Guzman, Dan Marsden and Tobias Schwinger";s:11:"description";s:80:"Library for working with tuples, including various containers,
-	algorithms, etc.";s:13:"documentation";s:31:"libs/fusion/doc/html/index.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:2:{i:0;s:15:"Metaprogramming";i:1;s:4:"Data";}}s:8:"geometry";a:11:{s:3:"key";s:8:"geometry";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:8:"Geometry";s:7:"authors";s:48:"Barend Gehrels, Bruno Lalande and Mateusz Loskot";s:11:"description";s:17:"Geometry Library.";s:13:"documentation";s:24:"libs/geometry/index.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:2:{i:0;s:10:"Algorithms";i:1;s:4:"Math";}}s:3:"gil";a:11:{s:3:"key";s:3:"gil";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"GIL";s:7:"authors";s:30:"Lubomir Bourdev and Hailin Jin";s:11:"description";s:21:"Generic Image Library";s:13:"documentation";s:23:"libs/gil/doc/index.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
:5:{i:0;s:10:"Containers";i:1;s:9:"Iterators";i:2;s:10:"Algorithms";i:3;s:7:"Generic";i:4;s:16:"Image-processing";}}s:5:"graph";a:11:{s:3:"key";s:5:"graph";s:13:"boost-version";s:6:"1.18.0";s:4:"name";s:5:"Graph";s:7:"authors";s:107:"Jeremy Siek and a University of Notre Dame team;
+    wrappers.";s:13:"documentation";s:16:"libs/functional/";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:15:"functional/hash";a:11:{s:3:"key";s:15:"functional/hash";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:15:"Functional/Hash";s:7:"authors";s:12:"Daniel James";s:11:"description";s:79:"A TR1 hash function object that can be extended to
+    hash user defined types.";s:13:"documentation";s:21:"libs/functional/hash/";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:18:"functional/factory";a:11:{s:3:"key";s:18:"functional/factory";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Factory";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:64:"Function object templates for dynamic and static object creation";s:13:"documentation";s:24:"libs/functional/factory/";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:18:"functional/forward";a:11:{s:3:"key";s:18:"functional/forward";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Forward";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:72:"Adapters to allow generic function objects to accept arbitrary arguments";s:13:"documentation";s:24:"libs/functional/forward/";
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:6:"fusion";a:11:{s:3:"key";s:6:"fusion";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"Fusion";s:7:"authors";s:48:"Joel de Guzman, Dan Marsden and Tobias Schwinger";s:11:"description";s:80:"Library for working with tuples, including various containers,
+	algorithms, etc.";s:13:"documentation";s:21:"libs/fusion/doc/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:2:{i:0;s:15:"Metaprogramming";i:1;s:4:"Data";}}s:8:"geometry";a:11:{s:3:"key";s:8:"geometry";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:8:"Geometry";s:7:"authors";s:48:"Barend Gehrels, Bruno Lalande and Mateusz Loskot";s:11:"description";s:17:"Geometry Library.";s:13:"documentation";s:14:"libs/geometry/";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:4:"Math";}}s:3:"gil";a:11:{s:3:"key";s:3:"gil";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"GIL";s:7:"authors";s:30:"Lubomir Bourdev and Hailin Jin";s:11:"description";s:21:"Generic Image Library";s:13:"documentation";s:9:"libs/gil/";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:"Containers";i:1;s:9:"
Iterators";i:2;s:10:"Algorithms";i:3;s:7:"Generic";i:4;s:16:"Image-processing";}}s:5:"graph";a:11:{s:3:"key";s:5:"graph";s:13:"boost-version";s:6:"1.18.0";s:4:"name";s:5:"Graph";s:7:"authors";s:107:"Jeremy Siek and a University of Notre Dame team;
     now maintained by Andrew Sutton and Jeremiah Willcock.";s:11:"description";s:127:"The BGL graph interface and graph components are
     generic, in the same sense as the the Standard Template Library
-    (STL).";s:13:"documentation";s:37:"libs/graph/doc/table_of_contents.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:3:{i:0;s:10:"Containers";i:1;s:9:"Iterators";i:2;s:10:"Algorithms";}}s:3:"icl";a:11:{s:3:"key";s:3:"icl";s:13:"boost-version";s:6:"1.46.0";s:4:"name";s:3:"ICL";s:7:"authors";s:17:"Joachim Faulhaber";s:11:"description";s:91:"Interval Container Library, interval sets and maps and
-    aggregation of associated values";s:13:"documentation";s:19:"libs/icl/index.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:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:7:"integer";a:11:{s:3:"key";s:7:"integer";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:7:"Integer";s:7:"authors";s:0:"";s:11:"description";s:371:"The organization of boost integer headers and
+    (STL).";s:13:"documentation";s:11:"libs/graph/";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:3:{i:0;s:10:"Containers";i:1;s:9:"Iterators";i:2;s:10:"Algorithms";}}s:3:"icl";a:11:{s:3:"key";s:3:"icl";s:13:"boost-version";s:6:"1.46.0";s:4:"name";s:3:"ICL";s:7:"authors";s:17:"Joachim Faulhaber";s:11:"description";s:91:"Interval Container Library, interval sets and maps and
+    aggregation of associated values";s:13:"documentation";s:9:"libs/icl/";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:7:"integer";a:11:{s:3:"key";s:7:"integer";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:7:"Integer";s:7:"authors";s:0:"";s:11:"description";s:371:"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.";s:13:"documentation";s:23:"libs/integer/index.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:12:"interprocess";a:11:{s:3:"key";s:12:"interprocess";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:12:"Interprocess";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:111:"Shared memory, memory mapped files, process-shared mutexes,
-    condition variables, containers and allocators.";s:13:"documentation";s:26:"doc/html/interprocess.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:"Concurrent";}}s:9:"intrusive";a:11:{s:3:"key";s:9:"intrusive";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:9:"Intrusive";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:36:"Intrusive containers and algorithms.";s:13:"documentation";s:23:"doc/html/intrusive.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:2:"io";a:11:{s:3:"key";s:2:"io";s:13:"boost-version";s:6:"1.28.0";s:4:"name";s:15:"IO State Savers";s:7:"authors";s:13:"Daryle Walker";s:11:"description";s:179:"The I/O sub-library of Boost helps segregate the
+    in namespace std.";s:13:"documentation";s:13:"libs/integer/";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:12:"interprocess";a:11:{s:3:"key";s:12:"interprocess";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:12:"Interprocess";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:111:"Shared memory, memory mapped files, process-shared mutexes,
+    condition variables, containers and allocators.";s:13:"documentation";s:18:"libs/interprocess/";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:"Concurrent";}}s:9:"intrusive";a:11:{s:3:"key";s:9:"intrusive";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:9:"Intrusive";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:36:"Intrusive containers and algorithms.";s:13:"documentation";s:15:"libs/intrusive/";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:2:"io";a:11:{s:3:"key";s:2:"io";s:13:"boost-version";s:6:"1.28.0";s:4:"name";s:15:"IO State Savers";s:7:"authors";s:13:"Daryle Walker";s:11:"description";s:179:"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.";s:13:"documentation";s:26:"libs/io/doc/ios_state.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:2:"IO";}}s:9:"iostreams";a:11:{s:3:"key";s:9:"iostreams";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:9:"Iostreams";s:7:"authors";s:17:"Jonathan Turkanis";s:11:"description";s:94:"Boost.IOStreams provides a framework for defining
-    streams, stream buffers and i/o filters.";s:13:"documentation";s:29:"libs/iostreams/doc/index.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:2:{i:0;s:6:"String";i:1;s:2:"IO";}}s:8:"iterator";a:11:{s:3:"key";s:8:"iterator";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:9:"Iterators";s:7:"authors";s:43:"Dave Abrahams, Jeremy Siek, and Thomas Witt";s:11:"description";s:292:"The Boost Iterator Library contains two parts. The
+    streams, stream buffers and i/o filters.";s:13:"documentation";s:15:"libs/iostreams/";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:"String";i:1;s:2:"IO";}}s:8:"iterator";a:11:{s:3:"key";s:8:"iterator";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:9:"Iterators";s:7:"authors";s:43:"Dave Abrahams, Jeremy Siek, and Thomas Witt";s:11:"description";s:292:"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.";s:13:"documentation";s:28:"libs/iterator/doc/index.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:"Iterators";}}s:6:"lambda";a:11:{s:3:"key";s:6:"lambda";s:13:"boost-version";s:6:"1.28.0";s:4:"name";s:6:"Lambda";s:7:"authors";s:29:"Jaakko Järvi and Gary Powell";s:11:"description";s:76:"Define small unnamed function objects at the
-    actual call site, and more.";s:13:"documentation";s:20:"doc/html/lambda.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:16:"Function-objects";}}s:12:"lexical_cast";a:11:{s:3:"key";s:12:"lexical_cast";s:13:"boost-version";s:6:"1.20.0";s:4:"name";s:12:"Lexical Cast";s:7:"authors";s:13:"Kevlin Henney";s:11:"description";s:109:"General literal text conversions, such as an int
-    represented a string, or vice-versa, from Kevlin Henney.";s:13:"documentation";s:32:"libs/conversion/lexical_cast.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:6:"String";i:1;s:13:"Miscellaneous";}}s:6:"locale";a:10:{s:3:"key";s:6:"locale";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:6:"Locale";s:7:"authors";s:13:"Artyom Beilis";s:11:"description";s:56:"Provide localization and Unicode handling tools for C++.";s:13:"documentation";s:22:"libs/locale/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:5:"build";s:8:"category";a:1:{i:0;s:6:"String";}}s:13:"logic/tribool";a:11:{s:3:"key";s:13:"logic/tribool";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Tribool";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:29:"3-state boolean type library.";s:13:"documentation";s:21:"doc/html/tribool.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:4:"math";a:11:{s:3:"key";s:4:"math";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:4:"Math";s:7:"authors";s:7:"various";s:11:"description";s:721:"Boost.Math includes several contributions in the
+    includes several useful iterator adaptors.";s:13:"documentation";s:14:"libs/iterator/";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:"Iterators";}}s:6:"lambda";a:11:{s:3:"key";s:6:"lambda";s:13:"boost-version";s:6:"1.28.0";s:4:"name";s:6:"Lambda";s:7:"authors";s:29:"Jaakko Järvi and Gary Powell";s:11:"description";s:76:"Define small unnamed function objects at the
+    actual call site, and more.";s:13:"documentation";s:12:"libs/lambda/";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:"lexical_cast";a:11:{s:3:"key";s:12:"lexical_cast";s:13:"boost-version";s:6:"1.20.0";s:4:"name";s:12:"Lexical Cast";s:7:"authors";s:13:"Kevlin Henney";s:11:"description";s:109:"General literal text conversions, such as an int
+    represented a string, or vice-versa, from Kevlin Henney.";s:13:"documentation";s:32:"libs/conversion/lexical_cast.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:6:"String";i:1;s:13:"Miscellaneous";}}s:6:"locale";a:10:{s:3:"key";s:6:"locale";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:6:"Locale";s:7:"authors";s:13:"Artyom Beilis";s:11:"description";s:56:"Provide localization and Unicode handling tools for C++.";s:13:"documentation";s:12:"libs/locale/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:5:"build";s:8:"category";a:1:{i:0;s:6:"String";}}s:13:"logic/tribool";a:11:{s:3:"key";s:13:"logic/tribool";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Tribool";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:29:"3-state boolean type library.";s:13:"documentation";s:21:"doc/html/tribool.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:4:"math";a:11:{s:3:"key";s:4:"math";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:4:"Math";s:7:"authors";s:7:"various";s:11:"description";s:721:"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
@@ -89,61 +89,61 @@
     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.";s:13:"documentation";s:20:"libs/math/index.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: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:38:"libs/math/doc/octonion/html/index.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:40:"libs/math/doc/quaternion/html/index.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/sp
ecial_functions";a:11:{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:41:"libs/math/doc/sf_and_dist/html/index.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:41:"libs/math/doc/sf_and_dist/html/index.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:20:"libs/move/index.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: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:17:"doc/html/mpi.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: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,
+    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
+    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:23:"libs/mpl/doc/index.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: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:19:"libs/msm/index.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: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: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
     array concept definition and common implementations of that
-    interface.";s:13:"documentation";s:31:"libs/multi_array/doc/index.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: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
+    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
     construction of containers maintaining one or more indices with
-    different sorting and access semantics.";s:13:"documentation";s:31:"libs/multi_index/doc/index.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:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:18:"numeric/conversion";a:11:{s:3:"key";s:18:"numeric/conversion";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:18:"Numeric Conversion";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:47:"Optimized Policy-based Numeric
-    Conversions.";s:13:"documentation";s:34:"libs/numeric/conversion/index.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:2:{i:0;s:4:"Math";i:1;s:13:"Miscellaneous";}}s:16:"numeric/interval";a:11:{s:3:"key";s:16:"numeric/interval";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:8:"Interval";s:7:"authors";s:60:"Guillaume Melquiond, Hervé Brönnimann and
+    different sorting and access semantics.";s:13:"documentation";s:17:"libs/multi_index/";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:18:"numeric/conversion";a:11:{s:3:"key";s:18:"numeric/conversion";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:18:"Numeric Conversion";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:47:"Optimized Policy-based Numeric
+    Conversions.";s:13:"documentation";s:24:"libs/numeric/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:4:"Math";i:1;s:13:"Miscellaneous";}}s:16:"numeric/interval";a:11:{s:3:"key";s:16:"numeric/interval";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:8:"Interval";s:7:"authors";s:60:"Guillaume Melquiond, Hervé Brönnimann and
     Sylvain Pion";s:11:"description";s:69:"Extends the usual arithmetic functions to
     mathematical intervals.";s:13:"documentation";s:38:"libs/numeric/interval/doc/interval.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:13:"numeric/ublas";a:11:{s:3:"key";s:13:"numeric/ublas";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:5:"uBLAS";s:7:"authors";s:29:"Joerg Walter and Mathias Koch";s:11:"description";s:154:"uBLAS provides matrix and vector classes as well
     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:24:"libs/optional/index.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: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:34:"libs/parameter/doc/html/index.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: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
-    call site, and more.";s:13:"documentation";s:23:"libs/phoenix/index.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: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:23:"libs/polygon/index.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: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:20:"libs/pool/index.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:6:"Memory";}}s:12:"preprocessor";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:32:"libs/preprocessor/doc/index.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: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
+    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
+    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)
     pairs from the user, via conventional methods such as command
-    line and config file.";s:13:"documentation";s:29:"doc/html/program_options.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:2:{i:0;s:2:"IO";i:1;s:13:"Miscellaneous";}}s:12:"property_map";a:11:{s:3:"key";s:12:"property_map";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:12:"Property Map";s:7:"authors";s:11:"Jeremy Siek";s:11:"description";s:72:"Concepts defining interfaces which map key objects
-    to value objects.";s:13:"documentation";s:28:"libs/property_map/index.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:2:{i:0;s:10:"Containers";i:1;s:7:"Generic";}}s:13:"property_tree";a:11:{s:3:"key";s:13:"property_tree";s:13:"boost-version";s:6:"1.41.0";s:4:"name";s:13:"Property Tree";s:7:"authors";s:14:"Sebastian Redl";s:11:"description";s:70:"A tree data structure especially suited to storing configuration data.";s:13:"documentation";s:29:"libs/property_tree/index.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:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:5:"proto";a:11:{s:3:"key";s:5:"proto";s:13:"boost-version";s:6:"1.37.0";s:4:"name";s:5:"Proto";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:101:"Expression template library and compiler construction toolkit for domain-specific embedded languages.";s:13:"documentation";s:21:"libs/proto/index.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:15:"Metaprogramming";}}s:13:"ptr_container";a:11:{s:3:"key";s:13:"ptr_container";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:17:"Pointer Container";s:7:"authors";s:16:"Thorsten Ottosen";s:11:"description";s:85:"Containers for storing heap-allocated polymorphic
-    objects to ease OO-programming.";s:13:"documentation";s:41:"libs/ptr_container/doc/ptr_container.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:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:6:"python";a:9:{s:3:"key";s:6:"python";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:6:"Python";s:7:"authors";s:13:"Dave Abrahams";s:11:"description";s:245:"The Boost Python Library is a framework for
+    line and config file.";s:13:"documentation";s:21:"libs/program_options/";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:2:"IO";i:1;s:13:"Miscellaneous";}}s:12:"property_map";a:11:{s:3:"key";s:12:"property_map";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:12:"Property Map";s:7:"authors";s:11:"Jeremy Siek";s:11:"description";s:72:"Concepts defining interfaces which map key objects
+    to value objects.";s:13:"documentation";s:18:"libs/property_map/";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:7:"Generic";}}s:13:"property_tree";a:11:{s:3:"key";s:13:"property_tree";s:13:"boost-version";s:6:"1.41.0";s:4:"name";s:13:"Property Tree";s:7:"authors";s:14:"Sebastian Redl";s:11:"description";s:70:"A tree data structure especially suited to storing configuration data.";s:13:"documentation";s:19:"libs/property_tree/";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:5:"proto";a:11:{s:3:"key";s:5:"proto";s:13:"boost-version";s:6:"1.37.0";s:4:"name";s:5:"Proto";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:101:"Expression template library and compiler construction toolkit for domain-specific embedded languages.";s:13:"documentation";s:11:"libs/proto/";s:12:"std-proposal";b:0;s:7:"std-t
r1";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:13:"ptr_container";a:11:{s:3:"key";s:13:"ptr_container";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:17:"Pointer Container";s:7:"authors";s:16:"Thorsten Ottosen";s:11:"description";s:85:"Containers for storing heap-allocated polymorphic
+    objects to ease OO-programming.";s:13:"documentation";s:19:"libs/ptr_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:6:"python";a:9:{s:3:"key";s:6:"python";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:6:"Python";s:7:"authors";s:13:"Dave Abrahams";s:11:"description";s:245:"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.";s:13:"documentation";s:26:"libs/python/doc/index.html";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:22:"libs/random/index.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: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:21:"libs/range/index.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:"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:21:"libs/ratio/index.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: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:24:"libs/rational/index.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: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:21:"libs/regex/index.html";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:35:"libs/scope_exit/doc/html/index.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: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:33:"libs/serialization/doc/index.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: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:21:"doc/html/signals.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: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
+    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
+    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
     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:32:"doc/html/boost_staticassert.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: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:22:"libs/spirit/index.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: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
+    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:30:"libs/statechart/doc/index.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: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:26:"libs/system/doc/index.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: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:20:"libs/test/index.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: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:20:"doc/html/thread.html";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
-    classes.";s:13:"documentation";s:21:"libs/timer/index.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: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:25:"libs/tokenizer/index.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: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
+    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
+    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
     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.";s:13:"documentation";s:23:"doc/html/boost_tr1.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: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:37:"libs/tuple/doc/tuple_users_guide.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: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:27:"libs/type_traits/index.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: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:20:"doc/html/typeof.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: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:21:"libs/units/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"head
er-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:25:"libs/unordered/index.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: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(),
+    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(),
     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
@@ -151,11 +151,11 @@
     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:5:"1.9.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:20:"libs/uuid/index.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:"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
-    container.";s:13:"documentation";s:21:"doc/html/variant.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: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,
+    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
+    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
-    iterator interface.";s:13:"documentation";s:20:"libs/wave/index.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:6:"String";}}s:9:"xpressive";a:11:{s:3:"key";s:9:"xpressive";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:9:"Xpressive";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:192:"Regular expressions that can be written as strings
+    iterator interface.";s:13:"documentation";s:10:"libs/wave/";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:"String";}}s:9:"xpressive";a:11:{s:3:"key";s:9:"xpressive";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:9:"Xpressive";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:192:"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.";s:13:"documentation";s:23:"doc/html/xpressive.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:6:"String";}}}s:12:"build_values";a:4:{s:11:"header-only";s:11:"Header only";s:8:"autolink";s:17:"Automatic linking";s:19:"autolink-dependency";s:35:"Automatic linking due to dependency";s:5:"build";s:16:"Separately built";}}
\ No newline at end of file
+    grammars.";s:13:"documentation";s:15:"libs/xpressive/";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:"String";}}}s:12:"build_values";a:4:{s:11:"header-only";s:11:"Header only";s:8:"autolink";s:17:"Automatic linking";s:19:"autolink-dependency";s:35:"Automatic linking due to dependency";s:5:"build";s:16:"Separately built";}}
\ No newline at end of file

Modified: website/public_html/beta/doc/libraries.xml
==============================================================================
--- website/public_html/beta/doc/libraries.xml	(original)
+++ website/public_html/beta/doc/libraries.xml	2011-11-24 18:55:54 EST (Thu, 24 Nov 2011)
@@ -67,7 +67,7 @@
     <name>Accumulators</name>
     <authors>Eric Niebler</authors>
     <description>Framework for incremental calculation, and collection of statistical accumulators.</description>
-    <documentation>libs/accumulators/index.html</documentation>
+    <documentation>libs/accumulators/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -80,7 +80,7 @@
     <authors>Herv&#233; Br&#246;nnimann</authors>
     <description>Standard library extensions for simultaneous
     min/max and min/max element computations.</description>
-    <documentation>libs/algorithm/minmax/index.html</documentation>
+    <documentation>libs/algorithm/minmax/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -92,7 +92,7 @@
     <name>String Algo</name>
     <authors>Pavol Droba</authors>
     <description>String algorithms library.</description>
-    <documentation>doc/html/string_algo.html</documentation>
+    <documentation>libs/algorithm/string/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -106,7 +106,7 @@
     <authors>Kevlin Henney</authors>
     <description>Safe, generic container for single values of
     different value types.</description>
-    <documentation>doc/html/any.html</documentation>
+    <documentation>libs/any/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -119,7 +119,7 @@
     <authors>Nicolai Josuttis</authors>
     <description>STL compliant container wrapper for arrays of
     constant size.</description>
-    <documentation>doc/html/array.html</documentation>
+    <documentation>libs/array/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -132,7 +132,7 @@
     <authors>Chris Kohlhoff</authors>
     <description>Portable networking, including sockets, timers,
     hostname resolution and socket iostreams.</description>
-    <documentation>doc/html/boost_asio.html</documentation>
+    <documentation>libs/asio/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink-dependency</build>
@@ -146,7 +146,7 @@
     <authors>Thorsten Ottosen</authors>
     <description>Filling containers with constant or generated data
     has never been easier.</description>
-    <documentation>libs/assign/doc/index.html</documentation>
+    <documentation>libs/assign/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -160,7 +160,7 @@
     <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/doc/html/index.html</documentation>
+    <documentation>libs/bimap/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -178,7 +178,7 @@
     function pointers, and is able to bind any argument to a
     specific value or route input arguments into arbitrary
     positions.</description>
-    <documentation>libs/bind/bind.html</documentation>
+    <documentation>libs/bind/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -205,7 +205,7 @@
     Abrahams</authors>
     <description>A utility library for passing references to
     generic functions.</description>
-    <documentation>doc/html/ref.html</documentation>
+    <documentation>libs/bind/ref.html</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -217,7 +217,7 @@
     <name>Chrono</name>
     <authors>Vicente J. Botet Escrib&#225;</authors>
     <description>Useful time utilities.</description>
-    <documentation>libs/chrono/index.html</documentation>
+    <documentation>libs/chrono/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -230,7 +230,7 @@
     <authors>Jan Gaspar</authors>
     <description>A STL compliant container also known as ring or cyclic buffer.
     </description>
-    <documentation>libs/circular_buffer/index.html</documentation>
+    <documentation>libs/circular_buffer/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -243,7 +243,7 @@
     <authors>Ralf Grosse-Kunstleve and Jens Maurer</authors>
     <description>Help for non-conforming standard
     libraries.</description>
-    <documentation>libs/compatibility/index.html</documentation>
+    <documentation>libs/compatibility/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -256,7 +256,7 @@
     <authors>Jeremy Siek</authors>
     <description>Tools for generic programming.</description>
     <documentation>
-    libs/concept_check/concept_check.htm</documentation>
+    libs/concept_check/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -282,7 +282,7 @@
     <name>Container</name>
     <authors>Ion Gazta&#241;aga</authors>
     <description>Standard library containers and extensions.</description>
-    <documentation>libs/container/index.html</documentation>
+    <documentation>libs/container/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -295,7 +295,7 @@
     <name>Conversion</name>
     <authors>Dave Abrahams and Kevlin Henney</authors>
     <description>Polymorphic and lexical casts.</description>
-    <documentation>libs/conversion/index.html</documentation>
+    <documentation>libs/conversion/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -311,7 +311,7 @@
     of CRC (cyclic redundancy code) computation objects and two
     implementations of CRC computation functions. The
     implementations are template-based.</description>
-    <documentation>libs/crc/index.html</documentation>
+    <documentation>libs/crc/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -324,7 +324,7 @@
     <authors>Jeff Garland</authors>
     <description>A set of date-time libraries based on generic
     programming concepts.</description>
-    <documentation>doc/html/date_time.html</documentation>
+    <documentation>libs/date_time/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -385,7 +385,7 @@
     <description>The Boost Filesystem Library provides portable
     facilities to query and manipulate paths, files, and
     directories.</description>
-    <documentation>libs/filesystem/index.html</documentation>
+    <documentation>libs/filesystem/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -398,7 +398,7 @@
     <authors>Joaqu&#237;n M L&#243;pez Mu&#241;oz</authors>
     <description>Design pattern to manage large quantities of highly redundant
     objects.</description>
-    <documentation>libs/flyweight/doc/index.html</documentation>
+    <documentation>libs/flyweight/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -420,7 +420,7 @@
     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>doc/html/foreach.html</documentation>
+    <documentation>libs/foreach/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -440,7 +440,7 @@
     thus the function call with arbitrary arguments is replaced by
     successive calls to an argument feeding
     operator%.</description>
-    <documentation>libs/format/index.html</documentation>
+    <documentation>libs/format/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -454,7 +454,7 @@
     <authors>Doug Gregor</authors>
     <description>Function object wrappers for deferred calls or
     callbacks.</description>
-    <documentation>doc/html/function.html</documentation>
+    <documentation>libs/function/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -469,7 +469,7 @@
     <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/doc/html/index.html</documentation>
+    <documentation>libs/function_types/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -484,7 +484,7 @@
     <description>The Boost.Function library contains a family of
     class templates that are function object
     wrappers.</description>
-    <documentation>libs/functional/index.html</documentation>
+    <documentation>libs/functional/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -497,7 +497,7 @@
     <authors>Daniel James</authors>
     <description>A TR1 hash function object that can be extended to
     hash user defined types.</description>
-    <documentation>doc/html/hash.html</documentation>
+    <documentation>libs/functional/hash/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -509,7 +509,7 @@
     <name>Functional/Factory</name>
     <authors>Tobias Schwinger</authors>
     <description>Function object templates for dynamic and static object creation</description>
-    <documentation>libs/functional/factory/index.html</documentation>
+    <documentation>libs/functional/factory/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -521,7 +521,7 @@
     <name>Functional/Forward</name>
     <authors>Tobias Schwinger</authors>
     <description>Adapters to allow generic function objects to accept arbitrary arguments</description>
-    <documentation>libs/functional/forward/index.html</documentation>
+    <documentation>libs/functional/forward/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -534,7 +534,7 @@
     <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/index.html</documentation>
+    <documentation>libs/fusion/doc/html/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -547,7 +547,7 @@
     <name>Geometry</name>
     <authors>Barend Gehrels, Bruno Lalande and Mateusz Loskot</authors>
     <description>Geometry Library.</description>
-    <documentation>libs/geometry/index.html</documentation>
+    <documentation>libs/geometry/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -560,7 +560,7 @@
     <name>GIL</name>
     <authors>Lubomir Bourdev and Hailin Jin</authors>
     <description>Generic Image Library</description>
-    <documentation>libs/gil/doc/index.html</documentation>
+    <documentation>libs/gil/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -579,8 +579,7 @@
     <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/doc/table_of_contents.html</documentation>
+    <documentation>libs/graph/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -595,7 +594,7 @@
     <authors>Joachim Faulhaber</authors>
     <description>Interval Container Library, interval sets and maps and
     aggregation of associated values</description>
-    <documentation>libs/icl/index.html</documentation>
+    <documentation>libs/icl/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -614,7 +613,7 @@
     &lt;boost/cstdint.hpp&gt; makes the standard integer types
     safely available in namespace boost without placing any names
     in namespace std.</description>
-    <documentation>libs/integer/index.html</documentation>
+    <documentation>libs/integer/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -627,7 +626,7 @@
     <authors>Ion Gazta&#241;aga</authors>
     <description>Shared memory, memory mapped files, process-shared mutexes,
     condition variables, containers and allocators.</description>
-    <documentation>doc/html/interprocess.html</documentation>
+    <documentation>libs/interprocess/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -639,7 +638,7 @@
     <name>Intrusive</name>
     <authors>Ion Gazta&#241;aga</authors>
     <description>Intrusive containers and algorithms.</description>
-    <documentation>doc/html/intrusive.html</documentation>
+    <documentation>libs/intrusive/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -667,7 +666,7 @@
     <authors>Jonathan Turkanis</authors>
     <description>Boost.IOStreams provides a framework for defining
     streams, stream buffers and i/o filters.</description>
-    <documentation>libs/iostreams/doc/index.html</documentation>
+    <documentation>libs/iostreams/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -684,7 +683,7 @@
     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/doc/index.html</documentation>
+    <documentation>libs/iterator/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -697,7 +696,7 @@
     <authors>Jaakko J&#228;rvi and Gary Powell</authors>
     <description>Define small unnamed function objects at the
     actual call site, and more.</description>
-    <documentation>doc/html/lambda.html</documentation>
+    <documentation>libs/lambda/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -724,7 +723,7 @@
     <name>Locale</name>
     <authors>Artyom Beilis</authors>
     <description>Provide localization and Unicode handling tools for C++.</description>
-    <documentation>libs/locale/index.html</documentation>
+    <documentation>libs/locale/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>build</build>
@@ -759,7 +758,7 @@
     complex numbers often used to parameterise rotations in three
     dimentional space. Octonions, like quaternions, are a relative
     of complex numbers.</description>
-    <documentation>libs/math/index.html</documentation>
+    <documentation>libs/math/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -784,7 +783,7 @@
     <name>Math Octonion</name>
     <authors>Hubert Holin</authors>
     <description>Octonions.</description>
-    <documentation>libs/math/doc/octonion/html/index.html</documentation>
+    <documentation>libs/math/doc/octonion/html/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -796,7 +795,7 @@
     <name>Math Quaternion</name>
     <authors>Hubert Holin</authors>
     <description>Quaternions.</description>
-    <documentation>libs/math/doc/quaternion/html/index.html</documentation>
+    <documentation>libs/math/doc/quaternion/html/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -808,7 +807,7 @@
     <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/index.html</documentation>
+    <documentation>libs/math/doc/sf_and_dist/html/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -821,7 +820,7 @@
     <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/index.html</documentation>
+    <documentation>libs/math/doc/sf_and_dist/html/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -833,7 +832,7 @@
     <name>Move</name>
     <authors>Ion Gazta&#241;aga</authors>
     <description>Portable move semantics for C++03 and C++11 compilers.</description>
-    <documentation>libs/move/index.html</documentation>
+    <documentation>libs/move/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -846,7 +845,7 @@
     <authors>Douglas Gregor and Matthias Troyer</authors>
     <description>Message Passing Interface library, for use in distributed-memory
     parallel application programming.</description>
-    <documentation>doc/html/mpi.html</documentation>
+    <documentation>libs/mpi/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -864,7 +863,7 @@
     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/doc/index.html</documentation>
+    <documentation>libs/mpl/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -876,7 +875,7 @@
     <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/index.html</documentation>
+    <documentation>libs/msm/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -890,7 +889,7 @@
     <description>Boost.MultiArray provides a generic N-dimensional
     array concept definition and common implementations of that
     interface.</description>
-    <documentation>libs/multi_array/doc/index.html</documentation>
+    <documentation>libs/multi_array/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -906,7 +905,7 @@
     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/doc/index.html</documentation>
+    <documentation>libs/multi_index/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -921,7 +920,7 @@
     <description>Optimized Policy-based Numeric
     Conversions.</description>
     <documentation>
-    libs/numeric/conversion/index.html</documentation>
+    libs/numeric/conversion/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -964,7 +963,7 @@
     <authors>Fernando Cacciola</authors>
     <description>Discriminated-union wrapper for optional
     values.</description>
-    <documentation>libs/optional/index.html</documentation>
+    <documentation>libs/optional/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -978,7 +977,7 @@
     <description>Boost.Parameter Library - Write functions that
     accept arguments by name.</description>
     <documentation>
-    libs/parameter/doc/html/index.html</documentation>
+    libs/parameter/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -991,7 +990,7 @@
     <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/index.html</documentation>
+    <documentation>libs/phoenix/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1003,7 +1002,7 @@
     <name>Polygon</name>
     <authors>Lucanus Simonson</authors>
     <description>Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.</description>
-    <documentation>libs/polygon/index.html</documentation>
+    <documentation>libs/polygon/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1015,7 +1014,7 @@
     <name>Pool</name>
     <authors>Steve Cleary</authors>
     <description>Memory pool management.</description>
-    <documentation>libs/pool/index.html</documentation>
+    <documentation>libs/pool/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1028,7 +1027,7 @@
     <authors>Vesa Karvonen and Paul Mensonides</authors>
     <description>Preprocessor metaprogramming tools including
     repetition and recursion.</description>
-    <documentation>libs/preprocessor/doc/index.html</documentation>
+    <documentation>libs/preprocessor/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1043,7 +1042,7 @@
     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>doc/html/program_options.html</documentation>
+    <documentation>libs/program_options/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1057,7 +1056,7 @@
     <authors>Jeremy Siek</authors>
     <description>Concepts defining interfaces which map key objects
     to value objects.</description>
-    <documentation>libs/property_map/index.html</documentation>
+    <documentation>libs/property_map/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1071,7 +1070,7 @@
     <authors>Marcin Kalicinski</authors>
     <authors>Sebastian Redl</authors>
     <description>A tree data structure especially suited to storing configuration data.</description>
-    <documentation>libs/property_tree/index.html</documentation>
+    <documentation>libs/property_tree/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1084,7 +1083,7 @@
     <name>Proto</name>
     <authors>Eric Niebler</authors>
     <description>Expression template library and compiler construction toolkit for domain-specific embedded languages.</description>
-    <documentation>libs/proto/index.html</documentation>
+    <documentation>libs/proto/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1098,7 +1097,7 @@
     <description>Containers for storing heap-allocated polymorphic
     objects to ease OO-programming.</description>
     <documentation>
-    libs/ptr_container/doc/ptr_container.html</documentation>
+    libs/ptr_container/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1115,7 +1114,7 @@
     seamlessly expose C++ classes functions and objects to Python,
     and vice-versa, using no special tools -- just your C++
     compiler.</description>
-    <documentation>libs/python/doc/index.html</documentation>
+    <documentation>libs/python/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <!-- <build></build> -->
@@ -1128,7 +1127,7 @@
     <authors>Jens Maurer</authors>
     <description>A complete system for random number
     generation.</description>
-    <documentation>libs/random/index.html</documentation>
+    <documentation>libs/random/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -1141,7 +1140,7 @@
     <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/index.html</documentation>
+    <documentation>libs/range/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1153,7 +1152,7 @@
     <name>Ratio</name>
     <authors>Vicente J. Botet Escrib&#225;</authors>
     <description>Compile time rational arithmetic.</description>
-    <documentation>libs/ratio/index.html</documentation>
+    <documentation>libs/ratio/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1165,7 +1164,7 @@
     <name>Rational</name>
     <authors>Paul Moore</authors>
     <description>A rational number class.</description>
-    <documentation>libs/rational/index.html</documentation>
+    <documentation>libs/rational/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1177,7 +1176,7 @@
     <name>Regex</name>
     <authors>John Maddock</authors>
     <description>Regular expression library.</description>
-    <documentation>libs/regex/index.html</documentation>
+    <documentation>libs/regex/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>autolink</build>
@@ -1189,7 +1188,7 @@
     <name>Scope Exit</name>
     <authors>Alexander Nasonov</authors>
     <description>Execute arbitrary code at scope exit.</description>
-    <documentation>libs/scope_exit/doc/html/index.html</documentation>
+    <documentation>libs/scope_exit/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1203,7 +1202,7 @@
     <description>Serialization for persistence and
     marshalling.</description>
     <documentation>
-    libs/serialization/doc/index.html</documentation>
+    libs/serialization/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1216,7 +1215,7 @@
     <authors>Doug Gregor</authors>
     <description>Managed signals &amp; slots callback
     implementation.</description>
-    <documentation>doc/html/signals.html</documentation>
+    <documentation>libs/signals/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1255,7 +1254,7 @@
     <authors>John Maddock</authors>
     <description>Static assertions (compile time
     assertions).</description>
-    <documentation>doc/html/boost_staticassert.html</documentation>
+    <documentation>libs/static_assert/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1270,7 +1269,7 @@
     <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/index.html</documentation>
+    <documentation>libs/spirit/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1285,7 +1284,7 @@
     <description>Boost.Statechart - Arbitrarily complex finite
     state machines can be implemented in easily readable and
     maintainable C++ code.</description>
-    <documentation>libs/statechart/doc/index.html</documentation>
+    <documentation>libs/statechart/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1298,7 +1297,7 @@
     <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/doc/index.html</documentation>
+    <documentation>libs/system/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1311,7 +1310,7 @@
     <authors>Gennadiy Rozental</authors>
     <description>Support for simple program testing, full unit
     testing, and for program execution monitoring.</description>
-    <documentation>libs/test/index.html</documentation>
+    <documentation>libs/test/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1323,7 +1322,7 @@
     <name>Thread</name>
     <authors>Anthony Williams (originally William Kempf)</authors>
     <description>Portable C++ multi-threading.</description>
-    <documentation>doc/html/thread.html</documentation>
+    <documentation>libs/thread/</documentation>
     <std-proposal>true</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1336,7 +1335,7 @@
     <authors>Beman Dawes</authors>
     <description>Event timer, progress timer, and progress display
     classes.</description>
-    <documentation>libs/timer/index.html</documentation>
+    <documentation>libs/timer/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1349,7 +1348,7 @@
     <authors>John Bandela</authors>
     <description>Break of a string or other character sequence into
     a series of tokens.</description>
-    <documentation>libs/tokenizer/index.html</documentation>
+    <documentation>libs/tokenizer/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1368,7 +1367,7 @@
     TR1 implementation (if it has one), otherwise it will include
     the Boost Library equivalents, and import them into namespace
     std::tr1.</description>
-    <documentation>doc/html/boost_tr1.html</documentation>
+    <documentation>libs/tr1/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -1381,8 +1380,7 @@
     <authors>Jaakko J&#228;rvi</authors>
     <description>Ease definition of functions returning multiple
     values, and more.</description>
-    <documentation>
-    libs/tuple/doc/tuple_users_guide.html</documentation>
+    <documentation>libs/tuple/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -1395,7 +1393,7 @@
     <authors>John Maddock, Steve Cleary, et al</authors>
     <description>Templates for fundamental properties of
     types.</description>
-    <documentation>libs/type_traits/index.html</documentation>
+    <documentation>libs/type_traits/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -1408,7 +1406,7 @@
     <name>Typeof</name>
     <authors>Arkadiy Vertleyb, Peder Holt</authors>
     <description>Typeof operator emulation.</description>
-    <documentation>doc/html/typeof.html</documentation>
+    <documentation>libs/typeof/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1420,7 +1418,7 @@
     <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/index.html</documentation>
+    <documentation>libs/units/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1432,7 +1430,7 @@
     <name>Unordered</name>
     <authors>Daniel James</authors>
     <description>Unordered associative containers.</description>
-    <documentation>libs/unordered/index.html</documentation>
+    <documentation>libs/unordered/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>true</std-tr1>
     <build>header-only</build>
@@ -1568,7 +1566,7 @@
     <name>Uuid</name>
     <authors>Andy Tompkins</authors>
     <description>A universally unique identifier.</description>
-    <documentation>libs/uuid/index.html</documentation>
+    <documentation>libs/uuid/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1581,7 +1579,7 @@
     <authors>Eric Friedman and Itay Maman</authors>
     <description>Safe, generic, stack-based discriminated union
     container.</description>
-    <documentation>doc/html/variant.html</documentation>
+    <documentation>libs/variant/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>
@@ -1597,7 +1595,7 @@
     and highly configurable implementation of the mandated C99/C++
     preprocessor functionality packed behind an easy to use
     iterator interface.</description>
-    <documentation>libs/wave/index.html</documentation>
+    <documentation>libs/wave/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>autolink</build>
@@ -1612,7 +1610,7 @@
     or as expression templates, and which can refer to each other
     and themselves recursively with the power of context-free
     grammars.</description>
-    <documentation>doc/html/xpressive.html</documentation>
+    <documentation>libs/xpressive/</documentation>
     <std-proposal>false</std-proposal>
     <std-tr1>false</std-tr1>
     <build>header-only</build>