2
0
mirror of https://github.com/boostorg/website.git synced 2026-01-19 04:42:17 +00:00

Website: Merge to live.

[SVN r76878]
This commit is contained in:
Daniel James
2012-02-04 14:26:41 +00:00
parent 45cfa71685
commit 04e58c21cd
31 changed files with 1525 additions and 1504 deletions

View File

@@ -9,6 +9,9 @@
<a href="/doc/libs">Libraries <span class="link">&gt;</span></a>
<ul>
<li><a href="/doc/libs/1_49_0_beta1/" rel="nofollow">1.49.0 - Beta
Release <span class="link">&gt;</span></a></li>
<li><a href="/doc/libs/1_48_0/" rel="nofollow">1.48.0 - Current
Release <span class="link">&gt;</span></a></li>

View File

@@ -28,8 +28,9 @@ RewriteRule ^libs/release/libs/([^./]+)$ libs/release/libs/$1/ [R=301]
RewriteRule ^libs/development/libs/([^./]+)$ libs/development/libs/$1/ [R=301]
# Redirect from symbolic names to current versions.
RewriteRule ^libs/release(/.*)?$ libs/1_48_0$1 [R=303]
RewriteRule ^libs/development(/.*)?$ libs/1_48_0$1 [R=303]
RewriteRule ^libs/release(/.*)?$ libs/1_49_0_beta1$1 [R=303]
RewriteRule ^libs/development(/.*)?$ libs/1_49_0_beta1$1 [R=303]
RewriteRule ^libs/1_49_0(/.*)?$ libs/1_49_0_beta1$1 [R=303]
# Rewrite specific versions to the dynamic handlers.
RewriteRule ^libs/([0-9_]+(?:beta[0-9]*|snapshot)?)/?$ libraries.php/$1 [L]

View File

@@ -45,7 +45,7 @@ function boost_version($v,$r,$p)
}
$libs = USE_SERIALIZED_INFO ?
unserialize(file_get_contents(dirname(__FILE__) . '/libraries.txt')) :
unserialize(file_get_contents(dirname(__FILE__) . '/../generated/libraries.txt')) :
new boost_libraries(dirname(__FILE__) . '/libraries.xml');
// Display types:

3
feed/.htaccess Normal file
View File

@@ -0,0 +1,3 @@
RewriteEngine On
RewriteRule ^(dev|downloads|history|news)\.rss$ /generated/$1.rss

View File

@@ -36,6 +36,7 @@
* [phrase library..[@/libs/container/ Container]:]
* Fixed bugs
[@https://svn.boost.org/trac/boost/ticket/6499 #6499],
[@https://svn.boost.org/trac/boost/ticket/6336 #6336],
[@https://svn.boost.org/trac/boost/ticket/6335 #6335],
[@https://svn.boost.org/trac/boost/ticket/6287 #6287],

View File

@@ -1,12 +1,12 @@
<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:boostbook="urn:boost.org:boostbook">
<channel>
<generator>BoostBook2RSS</generator>
<generator>Boost Website Site Tools</generator>
<title>Release notes for work in progress boost</title>
<link>http://www.boost.org/feed/dev.rss</link>
<link>http://www.boost.org/</link>
<description/>
<language>en-us</language>
<copyright>Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)</copyright>
<item><title>Version 1.49.0</title><link>http://www.boost.org/users/history/version_1_49_0.html</link><guid>http://www.boost.org/users/history/version_1_49_0.html</guid><pubDate>In Progress</pubDate><description>&lt;x&gt;
<item><title>Version 1.49.0</title><link>http://www.boost.org/users/history/version_1_49_0.html</link><guid>http://www.boost.org/users/history/version_1_49_0.html</guid><pubDate>In Progress</pubDate><description>
@@ -77,7 +77,8 @@
&lt;ul&gt;
&lt;li&gt;
&lt;div&gt;
Fixed bugs &lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6336&quot;&gt;#6336&lt;/a&gt;,
Fixed bugs &lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6499&quot;&gt;#6499&lt;/a&gt;,
&lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6336&quot;&gt;#6336&lt;/a&gt;,
&lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6335&quot;&gt;#6335&lt;/a&gt;,
&lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6287&quot;&gt;#6287&lt;/a&gt;,
&lt;a href=&quot;https://svn.boost.org/trac/boost/ticket/6205&quot;&gt;#6205&lt;/a&gt;,
@@ -907,7 +908,7 @@
and Vladimir Prus managed this release.
&lt;/p&gt;
&lt;/div&gt;
&lt;/x&gt;</description></item><item><title>Version 1.48.0</title><link>http://www.boost.org/users/history/version_1_48_0.html</link><guid>http://www.boost.org/users/history/version_1_48_0.html</guid><pubDate>Tue, 15 Nov 2011 10:47:30 -0500</pubDate><description>&lt;x&gt;
</description></item><item><title>Version 1.48.0</title><link>http://www.boost.org/users/history/version_1_48_0.html</link><guid>http://www.boost.org/users/history/version_1_48_0.html</guid><pubDate>Tue, 15 Nov 2011 10:47:30 -0500</pubDate><description>&lt;x&gt;

View File

@@ -0,0 +1,124 @@
<div class="section-body">
<ul class="toc">
<li><a href="#live">Current Release</a></li>
<li><a href="#beta">Beta Release</a></li>
<li><a href="#history">Old Boost Releases</a></li>
<li><a href="#repository">Subversion Repository</a></li>
</ul>
<h2 id="live">Current Release</h2>
<h3><span class=
"news-title">Version 1.48.0</span></h3>
<p class="news-date">November 15th, 2011 15:47 GMT</p>
<p class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Container, Locale, Move. Updated Libraries: Asio, Chrono, Config,
Fusion, Geometry, Graph, Interprocess, Intrusive, Lexical cast, Math, MSM,
Numeric Conversion, Proto, Regex, Spirit, TypeTraits, Unordered, Wave
</span></span></p>
<ul class="menu">
<li>
<a href="/users/history/version_1_48_0.html">Details</a></li>
<li>
<a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Download</a></li>
<li>
<a href="/doc/libs/1_48_0/">Documentation</a></li>
</ul><h2 id="beta">Beta Release</h2>
<h3><span class=
"news-title">Version 1.49.0 beta 1</span></h3>
<p class="news-date">In Progress</p>
<p class="news-description">
<span class="brief"><span class="purpose">
New Library: Heap. Updated Libraries: Chrono, Container, Filesystem, Geometry,
Graph, Icl, Interprocess, Intrusive, Lexical Cast, Locale, Move, Property Tree,
Spirit, Thread, Unordered, Uuid.
</span></span></p>
<ul class="menu">
<li>
<a href="/users/history/version_1_49_0.html">Details</a></li>
<li>
<a href="http://sourceforge.net/projects/boost/files/boost/1.49.0.beta.1/">Download</a></li>
<li>
<a href="/doc/libs/1_49_0_beta1/">Documentation</a></li>
</ul>
<h2><a name="history" id="history"></a>Old Boost Releases</h2>
<p>Old versions of boost can be found on the <a href=
"/users/history/">version history</a> page or from <a class=
"external" href=
"http://sourceforge.net/projects/boost/files/">the
sourceforge download page</a>.</p>
<h2><a name="repository" id="repository"></a>Subversion
Repository</h2>
<p>Boost uses <a class="external" href=
"http://subversion.tigris.org/">Subversion</a> to manage all of
the data associated with Boost's development, including the
source code to Boost, documentation for Boost libraries, and
the Boost web site.</p>
<h3>Accessing the Boost Subversion Repository</h3>
<p>The Subversion repository can be accessed in several
ways:</p>
<ul>
<li>Anonymous, read-only access to the Boost Subversion
repository is available at <a href=
"http://svn.boost.org/svn/boost">http://svn.boost.org/svn/boost</a>.
To access the current Boost development code, for instance,
one would check out from <a href=
"http://svn.boost.org/svn/boost/trunk">http://svn.boost.org/svn/boost/trunk</a>.
For example, using the command-line <tt>svn</tt>, one might
use:
<pre>
svn co <a href=
"http://svn.boost.org/svn/boost/trunk">http://svn.boost.org/svn/boost/trunk</a> boost-trunk
</pre>
</li>
<li>On Windows, <a href=
"http://tortoisesvn.tigris.org/">TortoiseSVN</a> provides an
easy-to-use, graphical interface to Subversion.</li>
</ul>
<h3>Organization of the Boost Subversion Repository</h3>
<p>The Boost Subversion repository is organized into several
top-level directories, reflecting various stages of Boost
library development and subtasks within the Boost community. We
have the following top-level directories:</p>
<ul>
<li><tt>trunk</tt>: Contains the latest "development" version
of Boost.</li>
<li><tt>sandbox</tt>: Contains libraries and tools that are
under active development and have not yet been reviewed or
accepted into Boost. See <a href=
"http://svn.boost.org/trac/boost/wiki/BoostSandbox">BoostSandbox</a>
for information about organization of the sandbox.</li>
<li><tt>website</tt>: Contains the upcoming Boost web site,
which is not yet live.</li>
<li><tt>branches</tt>: Contains various branches of Boost
libraries, typically for release branches and for non-trivial
changes to Boost libraries that need to be made separately
from the trunk.</li>
<li><tt>tags</tt>: Contains "tags" that mark certain points
in the source tree, such as particular Boost releases.</li>
</ul>
</div>

View File

@@ -1,8 +1,8 @@
<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:boostbook="urn:boost.org:boostbook">
<channel>
<generator>BoostBook2RSS</generator>
<generator>Boost Website Site Tools</generator>
<title>Boost Downloads</title>
<link>http://www.boost.org/feed/downloads.rss</link>
<link>http://www.boost.org/users/download/</link>
<description/>
<language>en-us</language>
<copyright>Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)</copyright>

1017
generated/history-items.html Normal file

File diff suppressed because it is too large Load Diff

View File

@@ -1,8 +1,8 @@
<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:boostbook="urn:boost.org:boostbook">
<channel>
<generator>BoostBook2RSS</generator>
<generator>Boost Website Site Tools</generator>
<title>Boost History</title>
<link>http://www.boost.org/feed/history.rss</link>
<link>http://www.boost.org/users/history/</link>
<description/>
<language>en-us</language>
<copyright>Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)</copyright>

View File

@@ -1,15 +1,16 @@
<div class="directory-item" id="important-downloads">
<h2>Downloads</h2>
<div id="downloads">
<h3>Current Release</h3>
<ul id="downloads">
<li><span class="news-title"><a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Version 1.48.0</a> (<a href="/users/history/version_1_48_0.html">release notes</a>)</span><span class="news-date">November 15th, 2011 15:47 GMT</span></li>
<ul>
<li><div class="news-title"><a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Version 1.48.0</a></div><div class="news-date"><a href="/users/history/version_1_48_0.html">Release Notes</a> | <a href="/doc/libs/1_48_0/">Documentation</a></div><div class="news-date">November 15th, 2011 15:47 GMT</div></li>
</ul><h3>Beta Release</h3>
<ul id="downloads">
<li><span class="news-title"><a href="http://sourceforge.net/projects/boost/files/boost/1.49.0.beta.1/">Version 1.49.0 beta 1</a> (<a href="/users/history/version_1_49_0.html">release notes</a>)</span><span class="news-date">In Progress</span></li>
<ul>
<li><div class="news-title"><a href="http://sourceforge.net/projects/boost/files/boost/1.49.0.beta.1/">Version 1.49.0 beta 1</a></div><div class="news-date"><a href="/users/history/version_1_49_0.html">Release Notes</a> | <a href="/doc/libs/1_49_0_beta1/">Documentation</a></div><div class="news-date">In Progress</div></li>
</ul>
</div>
<p><a href="/users/download/">More Downloads...</a>
(<a href="feed/downloads.rss">RSS</a>)</p>
</div>
@@ -55,4 +56,3 @@
</div>
<div class="clear"></div>
</div>

161
generated/libraries.txt Normal file
View File

@@ -0,0 +1,161 @@
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:10:"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:"libraries";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:113:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of 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: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:10:"libs/bind/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:11:"bind/mem_fn";a:11:{s:3:"key";s:11:"bind/mem_fn";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:15:"Member Function";s:7:"authors";s:11:"Peter Dimov";s:11:"description";s:74:"Generalized binders for function/object/pointers
and member functions.";s:13:"documentation";s:21:"libs/bind/mem_fn.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:8:"bind/ref";a:11:{s:3:"key";s:8:"bind/ref";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:3:"Ref";s:7:"authors";s:61:"Jaako Järvi, Peter Dimov, Doug Gregor, and Dave
Abrahams";s:11:"description";s:66:"A utility library for passing references to
generic functions.";s:13:"documentation";s:18:"libs/bind/ref.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:6:"chrono";a:11:{s:3:"key";s:6:"chrono";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:6:"Chrono";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:22:"Useful time utilities.";s:13:"documentation";s:12:"libs/chrono/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:15:"circular_buffer";a:11:{s:3:"key";s:15:"circular_buffer";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:15:"Circular Buffer";s:7:"authors";s:10:"Jan Gaspar";s:11:"description";s:62:"A STL compliant container also known as ring or cyclic buffer.";s:13:"documentation";s:21:"libs/circular_buffer/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:13:"compatibility";a:11:{s:3:"key";s:13:"compatibility";s:13:"boost-version";s:6:"1.21.2";s:4:"name";s:13:"Compatibility";s:7:"authors";s:37:"Ralf Grosse-Kunstleve and Jens Maurer";s:11:"description";s:47:"Help for non-conforming standard
libraries.";s:13:"documentation";s:19:"libs/compatibility/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:11:"workarounds";}}s:13:"concept_check";a:11:{s:3:"key";s:13:"concept_check";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:13:"Concept Check";s:7:"authors";s:11:"Jeremy Siek";s:11:"description";s:30:"Tools for generic programming.";s:13:"documentation";s:19:"libs/concept_check/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:7:"Generic";i:1;s:11:"Correctness";}}s:6:"config";a:11:{s:3:"key";s:6:"config";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:6:"Config";s:7:"authors";s:0:"";s:11:"description";s:100:"Helps Boost library developers adapt to compiler
idiosyncrasies; not intended for library users.";s:13:"documentation";s:22:"libs/config/config.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:11:"workarounds";}}s:9:"container";a:11:{s:3:"key";s:9:"container";s:13:"boost-version";s:6:"1.48.0";s:4:"name";s:9:"Container";s:7:"authors";s:14:"Ion Gaztañaga";s:11:"description";s:43:"Standard library containers and extensions.";s:13:"documentation";s:15:"libs/container/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:10:"Containers";i:1;s:4:"Data";}}s:10:"conversion";a:11:{s:3:"key";s:10:"conversion";s:13:"boost-version";s:6:"1.20.0";s:4:"name";s:10:"Conversion";s:7:"authors";s:31:"Dave Abrahams and Kevlin Henney";s:11:"description";s:30:"Polymorphic and lexical casts.";s:13:"documentation";s:16:"libs/conversion/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:13:"Miscellaneous";}}s:3:"crc";a:11:{s:3:"key";s:3:"crc";s:13:"boost-version";s:6:"1.22.0";s:4:"name";s:3:"CRC";s:7:"authors";s:13:"Daryle Walker";s:11:"description";s:208:"The Boost CRC Library provides two implementations
of CRC (cyclic redundancy code) computation objects and two
implementations of CRC computation functions. The
implementations are template-based.";s:13:"documentation";s:9:"libs/crc/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"date_time";a:11:{s:3:"key";s:9:"date_time";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:9:"Date Time";s:7:"authors";s:12:"Jeff Garland";s:11:"description";s:71:"A set of date-time libraries based on generic
programming concepts.";s:13:"documentation";s:15:"libs/date_time/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:13:"disjoint_sets";a:11:{s:3:"key";s:13:"disjoint_sets";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:13:"Disjoint Sets";s:7:"authors";s:43:"Jeremy Siek, Lie-Quan Lee, Andrew Lumsdaine";s:11:"description";s:101:"Boost.DisjointSets provides disjoint sets
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
operator[] and provides all of the bitwise operators that one
can apply to builtin integers, such as operator& and
operator<<. The number of bits in the set is specified at
runtime via a parameter to the constructor of the
dynamic_bitset.";s:13:"documentation";s:39:"libs/dynamic_bitset/dynamic_bitset.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:10:"Containers";}}s:9:"exception";a:11:{s:3:"key";s:9:"exception";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:9:"Exception";s:7:"authors";s:15:"Emil Dotchevski";s:11:"description";s:145:"The Boost Exception library supports transporting
of arbitrary data in exception objects, and transporting of
exceptions between threads.";s:13:"documentation";s:39:"libs/exception/doc/boost-exception.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:10:"filesystem";a:11:{s:3:"key";s:10:"filesystem";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:10:"Filesystem";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:120:"The Boost Filesystem Library provides portable
facilities to query and manipulate paths, files, and
directories.";s:13:"documentation";s:16:"libs/filesystem/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"flyweight";a:11:{s:3:"key";s:9:"flyweight";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:9:"Flyweight";s:7:"authors";s:24:"Joaquín M López Muñoz";s:11:"description";s:74:"Design pattern to manage large quantities of highly redundant
objects.";s:13:"documentation";s:15:"libs/flyweight/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:7:"foreach";a:11:{s:3:"key";s:7:"foreach";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:7:"Foreach";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:646:"In C++, writing a loop that iterates over a
sequence is tedious. We can either use iterators, which
requires a considerable amount of boiler-plate, or we can use
the std::for_each() algorithm and move our loop body into a
predicate, which requires no less boiler-plate and forces us to
move our logic far from where it will be used. In contrast,
some other languages, like Perl, provide a dedicated "foreach"
construct that automates this process. BOOST_FOREACH is just
such a construct for C++. It iterates over sequences for us,
freeing us from having to deal directly with iterators or write
predicates.";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
supports all user-defined types; the ellipsis (...) can not be
used correctly in the strongly typed context of format, and
thus the function call with arbitrary arguments is replaced by
successive calls to an argument feeding
operator%.";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: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: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: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:4:"heap";a:11:{s:3:"key";s:4:"heap";s:13:"boost-version";s:6:"1.49.0";s:4:"name";s:4:"Heap";s:7:"authors";s:13:"Tim Blechmann";s:11:"description";s:31:"Priority queue data structures.";s:13:"documentation";s:10:"libs/heap/";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: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: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: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: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
multiple (LCM) of two integers. The Special Functions library
currently provides eight templated special functions, in
namespace boost. The Complex Number Inverse Trigonometric
Functions are the inverses of trigonometric functions currently
present in the C++ standard. Quaternions are a relative of
complex numbers often used to parameterise rotations in three
dimentional space. Octonions, like quaternions, are a relative
of complex numbers.";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: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: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: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: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: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: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:"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: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: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-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: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: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:19:"libs/static_assert/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:3:{i:0;s:7:"Generic";i:1;s:15:"Metaprogramming";i:2;s:11:"Correctness";}}s:6:"spirit";a:11:{s:3:"key";s:6:"spirit";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:6:"Spirit";s:7:"authors";s:46:"Joel de Guzman, Hartmut Kaiser, and Dan Nuffer";s:11:"description";s:84:"LL parser framework represents parsers directly as
EBNF grammars in inlined C++.";s:13:"documentation";s:12:"libs/spirit/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:2:{i:0;s:6:"String";i:1;s:7:"Parsing";}}s:10:"statechart";a:11:{s:3:"key";s:10:"statechart";s:13:"boost-version";s:6:"1.34.0";s:4:"name";s:10:"Statechart";s:7:"authors";s:20:"Andreas Huber Dönni";s:11:"description";s:133:"Boost.Statechart - Arbitrarily complex finite
state machines can be implemented in easily readable and
maintainable C++ code.";s:13:"documentation";s:16:"libs/statechart/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:6:"system";a:11:{s:3:"key";s:6:"system";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"System";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:112:"Operating system support, including the diagnostics support
that will be part of the C++0x standard library.";s:13:"documentation";s:12:"libs/system/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"test";a:11:{s:3:"key";s:4:"test";s:13:"boost-version";s:6:"1.21.0";s:4:"name";s:4:"Test";s:7:"authors";s:17:"Gennadiy Rozental";s:11:"description";s:96:"Support for simple program testing, full unit
testing, and for program execution monitoring.";s:13:"documentation";s:10:"libs/test/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:11:"Correctness";}}s:6:"thread";a:11:{s:3:"key";s:6:"thread";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:6:"Thread";s:7:"authors";s:43:"Anthony Williams (originally William Kempf)";s:11:"description";s:29:"Portable C++ multi-threading.";s:13:"documentation";s:12:"libs/thread/";s:12:"std-proposal";b:1;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"autolink";b:1;s:8:"category";a:1:{i:0;s:10:"Concurrent";}}s:5:"timer";a:11:{s:3:"key";s:5:"timer";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:5:"Timer";s:7:"authors";s:11:"Beman Dawes";s:11:"description";s:62:"Event timer, progress timer, and progress display
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: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
Lumsdaine";s:11:"description";s:55:"Selective inclusion of function template
overloads.";s:13:"documentation";s:27:"libs/utility/enable_if.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:26:"utility/in_place_factories";a:11:{s:3:"key";s:26:"utility/in_place_factories";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:40:"In Place Factory, Typed In Place Factory";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:85:"Generic in-place construction of contained objects
with a variadic argument-list.";s:13:"documentation";s:36:"libs/utility/in_place_factories.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:7:"Generic";}}s:17:"utility/operators";a:11:{s:3:"key";s:17:"utility/operators";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:9:"Operators";s:7:"authors";s:29:"Dave Abrahams and Jeremy Siek";s:11:"description";s:52:"Templates ease arithmetic classes and
iterators.";s:13:"documentation";s:26:"libs/utility/operators.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:3:{i:0;s:9:"Iterators";i:1;s:7:"Generic";i:2;s:4:"Math";}}s:17:"utility/result_of";a:11:{s:3:"key";s:17:"utility/result_of";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:9:"Result Of";s:7:"authors";s:0:"";s:11:"description";s:50:"Determines the type of a function call expression.";s:13:"documentation";s:34:"libs/utility/utility.htm#result_of";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:12:"utility/swap";a:11:{s:3:"key";s:12:"utility/swap";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:4:"Swap";s:7:"authors";s:15:"Joseph Gauterin";s:11:"description";s:31:"Enhanced generic swap function.";s:13:"documentation";s:22:"libs/utility/swap.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:25:"utility/value_initialized";a:11:{s:3:"key";s:25:"utility/value_initialized";s:13:"boost-version";s:5:"1.9.0";s:4:"name";s:17:"Value Initialized";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:98:"Wrapper for uniform-syntax value initialization,
based on the original idea of David Abrahams.";s:13:"documentation";s:27:"libs/utility/value_init.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"uuid";a:11:{s:3:"key";s:4:"uuid";s:13:"boost-version";s:6:"1.42.0";s:4:"name";s:4:"Uuid";s:7:"authors";s:13:"Andy Tompkins";s:11:"description";s:32:"A universally unique identifier.";s:13:"documentation";s:10:"libs/uuid/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Data";}}s:7:"variant";a:11:{s:3:"key";s:7:"variant";s:13:"boost-version";s:6:"1.31.0";s:4:"name";s:7:"Variant";s:7:"authors";s:28:"Eric Friedman and Itay Maman";s:11:"description";s:61:"Safe, generic, stack-based discriminated union
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: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: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";}}

104
generated/news-items.html Normal file
View File

@@ -0,0 +1,104 @@
<div class="section-body">
<ul class="toc">
<li><span class=
"news-title"><a href="#iversion_1_48_0">Version 1.48.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_47_0">Version 1.47.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_46_1">Version 1.46.1</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_46_0">Version 1.46.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_45_0">Version 1.45.0</a></span></li> </ul>
<h2 class="news-title">
<a name="iversion_1_48_0" id="iversion_1_48_0"></a><a href="/users/history/version_1_48_0.html">Version 1.48.0</a></h2>
<p class="news-date">November 15th, 2011 15:47 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Container, Locale, Move. Updated Libraries: Asio, Chrono, Config,
Fusion, Geometry, Graph, Interprocess, Intrusive, Lexical cast, Math, MSM,
Numeric Conversion, Proto, Regex, Spirit, TypeTraits, Unordered, Wave
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_48_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_47_0" id="iversion_1_47_0"></a><a href="/users/history/version_1_47_0.html">Version 1.47.0</a></h2>
<p class="news-date">July 11th, 2011 22:19 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Chrono, Geometry, Phoenix and Ratio. Updated Libraries: Accumulators,
Asio, Config, DateTime, Dynamic Bitset, Foreach, Function, Function Types,
Graph, Iostreams, Iterator, Lexical Cast, Logic, Math, Meta State Machine,
MultiIndex, Proto, Random, Range, Spirit, Tokenizer, Utility, Uuid, Wave
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_47_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.47.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_46_1" id="iversion_1_46_1"></a><a href="/users/history/version_1_46_1.html">Version 1.46.1</a></h2>
<p class="news-date">March 12th, 2011 15:45 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
Bug fixes: Asio, Fusion, Graph, Icl, Math, Polygon, Proto, Property Tree, Signals2,
TR1, Unordered.
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_46_1.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.46.1/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_46_0" id="iversion_1_46_0"></a><a href="/users/history/version_1_46_0.html">Version 1.46.0</a></h2>
<p class="news-date">February 21st, 2011 20:36 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Icl. Updated Libraries: Array, Asio, Bind, Concept Check, Filesystem,
Fusion, Hash, Iostreams, Iterator, Math, Meta State Machine, Optional, Pool,
Program Options, Proto, Signals, Spirit, Tokenizer, Unordered, Wave. Updated
Tools: Boostbook, Inspect, Quickbook.
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_46_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.46.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_45_0" id="iversion_1_45_0"></a><a href="/users/history/version_1_45_0.html">Version 1.45.0</a></h2>
<p class="news-date">November 19th, 2010 16:00 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
Updated Libraries: Asio, Config, Flyweight, Foreach, Fusion, Graph, Interprocess,
Math, Meta State Machine, MultiArray, Proto, Spirit, TypeTraits, uBLAS, Unordered,
Wave, Xpressive. Updated tools: Boostbook, Quickbook
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_45_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.45.0/">Download</a></li>
</ul> </div>

View File

@@ -1,8 +1,8 @@
<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:boostbook="urn:boost.org:boostbook">
<channel>
<generator>BoostBook2RSS</generator>
<generator>Boost Website Site Tools</generator>
<title>Boost News</title>
<link>http://www.boost.org/feed/news.rss</link>
<link>http://www.boost.org/users/news/</link>
<description/>
<language>en-us</language>
<copyright>Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)</copyright>

View File

@@ -1838,7 +1838,7 @@
-id
"version_1_49_0
-last_modified
.1328324180.18
.1328365386.82
-location
"users/history/version_1_49_0.html
-page_state
@@ -1851,11 +1851,11 @@
" Spirit, Thread, Unordered, Uuid.
"
-qbk_hash
"61078156022b32b4156ed9556a2a590a80777be2c6c6501121bacf8e14ded2da
"822f5522b36320e9e83305f6af7707a33bb96c66f3de18d5abed28cb8e685d16
-release_status
"beta 1
-rss_hash
"a14b70fef667decf6699f4e223015b66a8dbe296118d350b1c78d91fdcffccbf
"29ee2139019f8f23e2f9e7b913d379fa56d767b060ea8311308001ca953860bf
-title
"Version 1.49.0
-type

View File

@@ -230,16 +230,9 @@ class Page:
if 'released' not in self.flags and self.documentation:
doc_matcher = re.compile('^/(?:libs/|doc/html/)')
doc_prefix = self.documentation.rstrip('/')
for child in values['description_fragment'].childNodes:
if child.__class__.__name__ == 'Element':
for anchor in child.getElementsByTagName('a'):
if anchor.hasAttribute('href') and doc_matcher.match(
anchor.getAttribute('href')):
anchor.setAttribute('href', doc_prefix +
anchor.getAttribute('href'))
boost_site.util.transform_links(values['description_fragment'],
lambda x: doc_matcher.match(x) and \
doc_prefix + x or x)
self.description_xml = boost_site.util.fragment_to_string(values['description_fragment'])

View File

@@ -35,30 +35,34 @@ settings = {
}
},
'index-pages' : {
'users/download/index.html' : 'site-tools/templates/download-template.html',
'users/history/index.html' : 'site-tools/templates/history-template.html',
'users/news/index.html' : 'site-tools/templates/news-template.html',
'generated/download-items.html' : 'site-tools/templates/download-template.html',
'generated/history-items.html' : 'site-tools/templates/history-template.html',
'generated/news-items.html' : 'site-tools/templates/news-template.html',
'generated/home-items.html' : 'site-tools/templates/index-src.html'
},
# See boost_site.pages for matches pattern syntax.
#
# glob [ '|' flag ]
'feeds' : {
'feed/downloads.rss' : {
'generated/downloads.rss' : {
'link' : 'users/download/',
'title': 'Boost Downloads',
'matches': ['feed/history/*.qbk|released', 'feed/downloads/*.qbk'],
'count': 3
},
'feed/history.rss' : {
'generated/history.rss' : {
'link' : 'users/history/',
'title': 'Boost History',
'matches': ['feed/history/*.qbk|released']
},
'feed/news.rss' : {
'generated/news.rss' : {
'link' : 'users/news/',
'title': 'Boost News',
'matches': ['feed/news/*.qbk', 'feed/history/*.qbk|released'],
'count': 5
},
'feed/dev.rss' : {
'generated/dev.rss' : {
'link' : '',
'title': 'Release notes for work in progress boost',
'matches': ['feed/history/*.qbk'],
'count': 5

View File

@@ -3,7 +3,7 @@
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
import os, sys, subprocess, glob, re, time, xml.dom.minidom, codecs, urlparse
import os, sys, subprocess, glob, re, time, xml.dom.minidom, codecs
import boost_site.templite, boost_site.pages, boost_site.boostbook_parser, boost_site.util
from boost_site.settings import settings
@@ -112,7 +112,7 @@ def generate_rss_feed(feed_file, details):
rss = xml.dom.minidom.parseString('''<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:boostbook="urn:boost.org:boostbook">
<channel>
<generator>BoostBook2RSS</generator>
<generator>Boost Website Site Tools</generator>
<title>%(title)s</title>
<link>%(link)s</link>
<description>%(description)s</description>
@@ -122,7 +122,7 @@ def generate_rss_feed(feed_file, details):
</rss>
''' % {
'title' : details['title'].encode('utf-8'),
'link' : "http://www.boost.org/" + feed_file,
'link' : "http://www.boost.org/" + details['link'],
'description' : '',
'language' : 'en-us',
'copyright' : 'Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)'
@@ -158,9 +158,9 @@ def generate_rss_item(rss_feed, qbk_file, page):
# Placing the description in a root element to make it well formed xml.
description = xml.dom.minidom.parseString(
'<x>%s</x>' % page.description_xml.encode('utf-8'))
base_links(description, page_link)
boost_site.util.base_links(description, page_link)
node.appendChild(rss_feed.createTextNode(
boost_site.util.fragment_to_string(description)))
boost_site.util.fragment_to_string(description.firstChild)))
item.appendChild(node)
return({
@@ -168,19 +168,5 @@ def generate_rss_item(rss_feed, qbk_file, page):
'quickbook': qbk_file,
'last_modified': page.last_modified
})
def base_links(node, base_link):
base_element_links(node, base_link, 'a', 'href')
base_element_links(node, base_link, 'img', 'src')
def base_element_links(node, base_link, tag_name, attribute):
if node.nodeType == node.ELEMENT_NODE or \
node.nodeType == node.DOCUMENT_NODE:
for x in node.getElementsByTagName(tag_name):
x.setAttribute(attribute,
urlparse.urljoin(base_link, x.getAttribute(attribute)))
elif node.nodeType == node.DOCUMENT_FRAGMENT_NODE:
for x in node.childNodes:
base_element_links(x, base_link, tag_name, attribute)
################################################################################

View File

@@ -3,6 +3,8 @@
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
import urlparse
def htmlencode(text):
return text.replace('&', '&amp;').replace('<', '&lt;').replace('>', '&rt;')
@@ -14,3 +16,19 @@ def fragment_to_string(fragment):
http://bugs.python.org/issue9883
"""
return ''.join(x.toxml('utf-8').decode('utf-8') for x in fragment.childNodes)
def base_links(node, base_link):
transform_links(node, lambda x: urlparse.urljoin(base_link,x))
def transform_links(node, func):
transform_links_impl(node, 'a', 'href', func)
transform_links_impl(node, 'img', 'src', func)
def transform_links_impl(node, tag_name, attribute, func):
if node.nodeType == node.ELEMENT_NODE or \
node.nodeType == node.DOCUMENT_NODE:
for x in node.getElementsByTagName(tag_name):
x.setAttribute(attribute, func(x.getAttribute(attribute)))
elif node.nodeType == node.DOCUMENT_FRAGMENT_NODE:
for x in node.childNodes:
transform_links_impl(x, tag_name, attribute, func)

View File

@@ -1,39 +1,10 @@
${
title = 'Boost Downloads'
}$<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
<head>
<title>${ emit(title) }$</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<link rel="icon" href="/favicon.ico" type="image/ico" />
<link rel="stylesheet" type="text/css" href="/style-v2/section-boost.css" />
<!--[if IE 7]> <style type="text/css"> body { behavior: url(/style-v2/csshover3.htc); } </style> <![endif]-->
</head>
${
# Obviously doesn't apply here.
emit("<!-- Don't edit this page! It's generated by site-tools/site-tools.py -->\n");
}$
<body>
<div id="heading">
<!--#include virtual="/common/heading.html" --> </div>
<div id="body">
<div id="body-inner">
<div id="content">
<div class="section" id="intro">
<div class="section-0">
<div class="section-title">
<h1>${ emit(title) }$</h1>
</div>
<div class="section-body">
from boost_site.util import htmlencode
}$ <div class="section-body">
<ul class="toc">
${
for x in downloads:
emit('<li><a href="#%s">%s</li>\n' % (x['anchor'], x['label']))
emit('<li><a href="#%s">%s</a></li>\n' % (x['anchor'], x['label']))
}$
<li><a href="#history">Old Boost Releases</a></li>
@@ -50,16 +21,16 @@ for x in downloads:
emit(' <span class="brief"><span class="purpose">%s</span></span></p>\n\n' % entry.purpose_xml)
emit(' <ul class="menu">\n')
emit(' <li>\n')
emit(' <a href="/%s">Details</a>' % entry.location)
emit(' <a href="/%s">Details</a>' % htmlencode(entry.location))
emit('</li>\n')
if(entry.download_item):
emit('\n')
emit(' <li>\n')
emit(' <a href="%s">Download</a></li>' % entry.download_item)
emit(' <a href="%s">Download</a></li>' % htmlencode(entry.download_item))
if(entry.documentation):
emit('\n')
emit(' <li>\n')
emit(' <a href="%s">Documentation</a></li>' % entry.documentation)
emit(' <a href="%s">Documentation</a></li>' % htmlencode(entry.documentation))
emit('\n')
emit(' </ul>')
}$
@@ -135,27 +106,3 @@ svn co <a href=
in the source tree, such as particular Boost releases.</li>
</ul>
</div>
</div>
</div>
</div>
<div id="sidebar">
<!--#include virtual="/common/sidebar-common.html" --><!--#include virtual="/common/sidebar-boost.html" --> </div>
<div class="clear"></div>
</div>
</div>
<div id="footer">
<div id="footer-left">
<div id="copyright">
<p>Copyright Rene Rivera 2006-2007.</p>
</div><!--#include virtual="/common/footer-license.html" --> </div>
<div id="footer-right">
<!--#include virtual="/common/footer-banners.html" --> </div>
<div class="clear"></div>
</div>
</body>
</html>

View File

@@ -1,4 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
${
from boost_site.util import htmlencode
}$<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
@@ -50,8 +52,7 @@ if page.type == 'release' and 'released' not in page.flags:
<p><span class=
"news-date">${ emit(page.web_date()) }$</span></p>
${
# TODO: Should encode this link. Although not a real problem.
if (page.documentation): emit('<p><a href="' + page.documentation + '">Documentation</a>')
if (page.documentation): emit('<p><a href="' + htmlencode(page.documentation) + '">Documentation</a>')
}$
${ emit(page.download_table()) }$
<div class="news-description">

View File

@@ -1,72 +1,21 @@
${
from boost_site.util import htmlencode
title = 'Boost Version History'
entries = pages.match_pages(['feed/history/*.qbk|released'])
}$<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
<head>
<title>${ emit(title) }$</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<link rel="icon" href="/favicon.ico" type="image/ico" />
<link rel="stylesheet" type="text/css" href="/style-v2/section-boost.css" />
<!--[if IE 7]> <style type="text/css"> body { behavior: url(/style-v2/csshover3.htc); } </style> <![endif]-->
</head>
${
# Obviously doesn't apply here.
emit("<!-- Don't edit this page! It's generated by site-tools/site-tools.py -->\n");
}$
<body>
<div id="heading">
<!--#include virtual="/common/heading.html" --> </div>
<div id="body">
<div id="body-inner">
<div id="content">
<div class="section" id="intro">
<div class="section-0">
<div class="section-title">
<h1>${ emit(title) }$</h1>
</div>
<div class="section-body">
}$ <div class="section-body">
${
for entry in entries:
emit('\n')
emit(' <h2 class="news-title">\n <a name="i%s" id="i%s"></a><a href="/%s">%s</a></h2>\n\n' % (entry.id, entry.id, entry.location, entry.title_xml))
emit(' <h2 class="news-title">\n <a name="i%s" id="i%s"></a><a href="/%s">%s</a></h2>\n\n' % (entry.id, entry.id, htmlencode(entry.location), entry.title_xml))
emit(' <p class="news-date">%s</p>\n\n' % (entry.web_date()))
emit(' <div class="news-description">\n')
emit(' <span class="brief"><span class="purpose">%s</span></span>' % (entry.purpose_xml))
emit(' </div>\n\n')
emit(' <ul class="menu">\n')
emit(' <li>\n')
emit(' <a href="/%s">Details</a></li>\n\n' % (entry.location))
emit(' <a href="/%s">Details</a></li>\n\n' % (htmlencode(entry.location)))
if(entry.download_item):
emit(' <li><a href="%s">Download</a></li>\n' % (entry.download_item))
emit(' <li><a href="%s">Download</a></li>\n' % (htmlencode(entry.download_item)))
emit(' </ul>')
}$ </div>
</div>
</div>
</div>
<div id="sidebar">
<!--#include virtual="/common/sidebar-common.html" --><!--#include virtual="/common/sidebar-boost.html" --> </div>
<div class="clear"></div>
</div>
</div>
<div id="footer">
<div id="footer-left">
<div id="copyright">
<p>Copyright Rene Rivera 2006-2007.</p>
</div><!--#include virtual="/common/footer-license.html" --> </div>
<div id="footer-right">
<!--#include virtual="/common/footer-banners.html" --> </div>
<div class="clear"></div>
</div>
</body>
</html>

View File

@@ -1,28 +1,38 @@
${
from boost_site.util import htmlencode
# TODO: This is duplicated from other places, should only be set once?
news = pages.match_pages(['feed/news/*.qbk', 'feed/history/*.qbk|released'], 3)
}$
<div class="directory-item" id="important-downloads">
<h2>Downloads</h2>
<div id="downloads">
${
for x in downloads:
label = x['label']
entries = x['entries']
emit('<h3>%s</h3>\n' % label)
emit('<ul id="downloads">\n')
emit('<ul>\n')
for entry in entries:
emit('<li><span class="news-title">')
emit('<li>')
emit('<div class="news-title">')
if entry.download_item:
emit('<a href="%s">' % entry.download_item)
emit('<a href="%s">' % htmlencode(entry.download_item))
emit(entry.full_title_xml)
if entry.download_item:
emit('</a>')
emit(' (<a href="/%s">release notes</a>)</span>' % (entry.location))
emit('<span class="news-date">%s</span></li>\n' % (entry.web_date()))
emit('</div>')
emit('<div class="news-date">')
emit('<a href="/%s">Release Notes</a>' % (htmlencode(entry.location)))
emit(' | ')
emit('<a href="%s">Documentation</a>' % (htmlencode(entry.documentation)))
emit('</div>')
emit('<div class="news-date">%s</div>' % (entry.web_date()))
emit('</li>\n')
emit('</ul>')
}$
</div>
<p><a href="/users/download/">More Downloads...</a>
(<a href="feed/downloads.rss">RSS</a>)</p>
</div>
@@ -34,7 +44,7 @@ for x in downloads:
${
for entry in news:
emit('\n')
emit(' <li><span class=\n "news-title"><a href="/%s">%s</a></span>\n' % (entry.location, entry.full_title_xml))
emit(' <li><span class=\n "news-title"><a href="/%s">%s</a></span>\n' % (htmlencode(entry.location), entry.full_title_xml))
emit(' <span class=\n "news-description"><span class="brief"><span class="purpose">%s</span></span></span>\n' % entry.purpose_xml)
emit(' <span class=\n "news-date">%s</span></li>' % (entry.web_date()))
}$ </ul>
@@ -44,4 +54,3 @@ for entry in news:
</div>
<div class="clear"></div>
</div>

View File

@@ -1,47 +1,19 @@
${
title = 'Boost News'
from boost_site.util import htmlencode
entries = pages.match_pages(['feed/news/*.qbk', 'feed/history/*.qbk|released'], 5)
}$<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
<head>
<title>${ emit(title) }$</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<link rel="icon" href="/favicon.ico" type="image/ico" />
<link rel="stylesheet" type="text/css" href="/style-v2/section-boost.css" />
<!--[if IE 7]> <style type="text/css"> body { behavior: url(/style-v2/csshover3.htc); } </style> <![endif]-->
</head>
${
# Obviously doesn't apply here.
emit("<!-- Don't edit this page! It's generated by site-tools/site-tools.py -->\n");
}$
<body>
<div id="heading">
<!--#include virtual="/common/heading.html" --> </div>
<div id="body">
<div id="body-inner">
<div id="content">
<div class="section" id="intro">
<div class="section-0">
<div class="section-title">
<h1>${ emit(title) }$</h1>
</div>
<div class="section-body">
}$ <div class="section-body">
${
emit('<ul class="toc">\n')
emit(' ')
for entry in entries:
emit('\n')
emit(' <li><span class=\n "news-title"><a href="#i%s">%s</a></span></li>' % (entry.id, entry.title_xml))
emit(' <li><span class=\n "news-title"><a href="#i%s">%s</a></span></li>' % (htmlencode(entry.id), entry.title_xml))
emit(' </ul>')
for entry in entries:
emit('\n')
emit(' <h2 class="news-title">\n')
emit(' <a name="i%s" id="i%s"></a><a href="/%s">%s</a>' % (entry.id, entry.id, entry.location, entry.title_xml))
emit(' <a name="i%s" id="i%s"></a><a href="/%s">%s</a>' % (entry.id, entry.id, htmlencode(entry.location), entry.title_xml))
emit('</h2>\n\n')
emit(' <p class="news-date">%s</p>\n\n' % (entry.web_date()))
emit(' <div class="news-description">\n')
@@ -49,33 +21,9 @@ for entry in entries:
emit(' </div>\n\n')
emit(' <ul class="menu">\n')
emit(' <li>\n')
emit(' <a href="/%s">Details</a></li>' % entry.location)
emit(' <a href="/%s">Details</a></li>' % htmlencode(entry.location))
if(entry.download_item):
emit('\n\n')
emit(' <li><a href="%s">Download</a></li>' % entry.download_item)
emit(' <li><a href="%s">Download</a></li>' % htmlencode(entry.download_item))
emit('\n </ul>')
}$ </div>
</div>
</div>
</div>
<div id="sidebar">
<!--#include virtual="/common/sidebar-common.html" --><!--#include virtual="/common/sidebar-boost.html" --> </div>
<div class="clear"></div>
</div>
</div>
<div id="footer">
<div id="footer-left">
<div id="copyright">
<p>Copyright Rene Rivera 2006.</p>
</div><!--#include virtual="/common/footer-license.html" --> </div>
<div id="footer-right">
<!--#include virtual="/common/footer-banners.html" --> </div>
<div class="clear"></div>
</div>
</body>
</html>

View File

@@ -5,4 +5,4 @@ echo "Serializing library info\n";
require_once(dirname(__FILE__) . '/../common/code/boost_libraries.php');
$libs = new boost_libraries(dirname(__FILE__) . '/../doc/libraries.xml');
file_put_contents(dirname(__FILE__) . '/../doc/libraries.txt', serialize($libs));
file_put_contents(dirname(__FILE__) . '/../generated/libraries.txt', serialize($libs));

View File

@@ -35,7 +35,7 @@ echo_sitemap_url("doc/libs/", '1.0', 'daily');
// Library 'home pages'
$libs = USE_SERIALIZED_INFO ?
unserialize(file_get_contents(dirname(__FILE__) . '/doc/libraries.txt')) :
unserialize(file_get_contents(dirname(__FILE__) . '/generated/libraries.txt')) :
new boost_libraries(dirname(__FILE__) . '/doc/libraries.xml');
foreach ($libs->get() as $lib) {
@@ -43,4 +43,4 @@ foreach ($libs->get() as $lib) {
}
?>
</urlset>
</urlset>

View File

@@ -36,12 +36,13 @@ li#welcome-section-tab {
}
#news .news-title {
display: block;
margin-bottom: 0.2em;
}
#news .news-description {
display: block;
padding: 0.25em 0em 0.25em 0em;
}
#news .news-date {
#news.news-links, #news .news-date {
display: block;
padding: 0em 0em 0.5em 0em;
color: #777;

View File

@@ -10,8 +10,6 @@
<!--[if IE 7]> <style type="text/css"> body { behavior: url(/style-v2/csshover3.htc); } </style> <![endif]-->
</head>
<!-- Don't edit this page! It's generated by site-tools/site-tools.py -->
<body>
<div id="heading">
<!--#include virtual="/common/heading.html" --> </div>
@@ -24,131 +22,7 @@
<div class="section-title">
<h1>Boost Downloads</h1>
</div>
<div class="section-body">
<ul class="toc">
<li><a href="#live">Current Release</li>
<li><a href="#beta">Beta Release</li>
<li><a href="#history">Old Boost Releases</a></li>
<li><a href="#repository">Subversion Repository</a></li>
</ul>
<h2 id="live">Current Release</h2>
<h3><span class=
"news-title">Version 1.48.0</span></h3>
<p class="news-date">November 15th, 2011 15:47 GMT</p>
<p class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Container, Locale, Move. Updated Libraries: Asio, Chrono, Config,
Fusion, Geometry, Graph, Interprocess, Intrusive, Lexical cast, Math, MSM,
Numeric Conversion, Proto, Regex, Spirit, TypeTraits, Unordered, Wave
</span></span></p>
<ul class="menu">
<li>
<a href="/users/history/version_1_48_0.html">Details</a></li>
<li>
<a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Download</a></li>
<li>
<a href="/doc/libs/1_48_0/">Documentation</a></li>
</ul><h2 id="beta">Beta Release</h2>
<h3><span class=
"news-title">Version 1.49.0 beta 1</span></h3>
<p class="news-date">In Progress</p>
<p class="news-description">
<span class="brief"><span class="purpose">
New Library: Heap. Updated Libraries: Chrono, Container, Filesystem, Geometry,
Graph, Icl, Interprocess, Intrusive, Lexical Cast, Locale, Move, Property Tree,
Spirit, Thread, Unordered, Uuid.
</span></span></p>
<ul class="menu">
<li>
<a href="/users/history/version_1_49_0.html">Details</a></li>
<li>
<a href="http://sourceforge.net/projects/boost/files/boost/1.49.0.beta.1/">Download</a></li>
<li>
<a href="/doc/libs/1_49_0_beta1/">Documentation</a></li>
</ul>
<h2><a name="history" id="history"></a>Old Boost Releases</h2>
<p>Old versions of boost can be found on the <a href=
"/users/history/">version history</a> page or from <a class=
"external" href=
"http://sourceforge.net/projects/boost/files/">the
sourceforge download page</a>.</p>
<h2><a name="repository" id="repository"></a>Subversion
Repository</h2>
<p>Boost uses <a class="external" href=
"http://subversion.tigris.org/">Subversion</a> to manage all of
the data associated with Boost's development, including the
source code to Boost, documentation for Boost libraries, and
the Boost web site.</p>
<h3>Accessing the Boost Subversion Repository</h3>
<p>The Subversion repository can be accessed in several
ways:</p>
<ul>
<li>Anonymous, read-only access to the Boost Subversion
repository is available at <a href=
"http://svn.boost.org/svn/boost">http://svn.boost.org/svn/boost</a>.
To access the current Boost development code, for instance,
one would check out from <a href=
"http://svn.boost.org/svn/boost/trunk">http://svn.boost.org/svn/boost/trunk</a>.
For example, using the command-line <tt>svn</tt>, one might
use:
<pre>
svn co <a href=
"http://svn.boost.org/svn/boost/trunk">http://svn.boost.org/svn/boost/trunk</a> boost-trunk
</pre>
</li>
<li>On Windows, <a href=
"http://tortoisesvn.tigris.org/">TortoiseSVN</a> provides an
easy-to-use, graphical interface to Subversion.</li>
</ul>
<h3>Organization of the Boost Subversion Repository</h3>
<p>The Boost Subversion repository is organized into several
top-level directories, reflecting various stages of Boost
library development and subtasks within the Boost community. We
have the following top-level directories:</p>
<ul>
<li><tt>trunk</tt>: Contains the latest "development" version
of Boost.</li>
<li><tt>sandbox</tt>: Contains libraries and tools that are
under active development and have not yet been reviewed or
accepted into Boost. See <a href=
"http://svn.boost.org/trac/boost/wiki/BoostSandbox">BoostSandbox</a>
for information about organization of the sandbox.</li>
<li><tt>website</tt>: Contains the upcoming Boost web site,
which is not yet live.</li>
<li><tt>branches</tt>: Contains various branches of Boost
libraries, typically for release branches and for non-trivial
changes to Boost libraries that need to be made separately
from the trunk.</li>
<li><tt>tags</tt>: Contains "tags" that mark certain points
in the source tree, such as particular Boost releases.</li>
</ul>
</div>
<!--#include virtual="/generated/download-items.html" -->
</div>
</div>
</div>

File diff suppressed because it is too large Load Diff

View File

@@ -116,7 +116,8 @@
<ul>
<li>
<div>
Fixed bugs <a href="https://svn.boost.org/trac/boost/ticket/6336">#6336</a>,
Fixed bugs <a href="https://svn.boost.org/trac/boost/ticket/6499">#6499</a>,
<a href="https://svn.boost.org/trac/boost/ticket/6336">#6336</a>,
<a href="https://svn.boost.org/trac/boost/ticket/6335">#6335</a>,
<a href="https://svn.boost.org/trac/boost/ticket/6287">#6287</a>,
<a href="https://svn.boost.org/trac/boost/ticket/6205">#6205</a>,

View File

@@ -10,8 +10,6 @@
<!--[if IE 7]> <style type="text/css"> body { behavior: url(/style-v2/csshover3.htc); } </style> <![endif]-->
</head>
<!-- Don't edit this page! It's generated by site-tools/site-tools.py -->
<body>
<div id="heading">
<!--#include virtual="/common/heading.html" --> </div>
@@ -24,111 +22,7 @@
<div class="section-title">
<h1>Boost News</h1>
</div>
<div class="section-body">
<ul class="toc">
<li><span class=
"news-title"><a href="#iversion_1_48_0">Version 1.48.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_47_0">Version 1.47.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_46_1">Version 1.46.1</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_46_0">Version 1.46.0</a></span></li>
<li><span class=
"news-title"><a href="#iversion_1_45_0">Version 1.45.0</a></span></li> </ul>
<h2 class="news-title">
<a name="iversion_1_48_0" id="iversion_1_48_0"></a><a href="/users/history/version_1_48_0.html">Version 1.48.0</a></h2>
<p class="news-date">November 15th, 2011 15:47 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Container, Locale, Move. Updated Libraries: Asio, Chrono, Config,
Fusion, Geometry, Graph, Interprocess, Intrusive, Lexical cast, Math, MSM,
Numeric Conversion, Proto, Regex, Spirit, TypeTraits, Unordered, Wave
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_48_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.48.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_47_0" id="iversion_1_47_0"></a><a href="/users/history/version_1_47_0.html">Version 1.47.0</a></h2>
<p class="news-date">July 11th, 2011 22:19 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Chrono, Geometry, Phoenix and Ratio. Updated Libraries: Accumulators,
Asio, Config, DateTime, Dynamic Bitset, Foreach, Function, Function Types,
Graph, Iostreams, Iterator, Lexical Cast, Logic, Math, Meta State Machine,
MultiIndex, Proto, Random, Range, Spirit, Tokenizer, Utility, Uuid, Wave
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_47_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.47.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_46_1" id="iversion_1_46_1"></a><a href="/users/history/version_1_46_1.html">Version 1.46.1</a></h2>
<p class="news-date">March 12th, 2011 15:45 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
Bug fixes: Asio, Fusion, Graph, Icl, Math, Polygon, Proto, Property Tree, Signals2,
TR1, Unordered.
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_46_1.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.46.1/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_46_0" id="iversion_1_46_0"></a><a href="/users/history/version_1_46_0.html">Version 1.46.0</a></h2>
<p class="news-date">February 21st, 2011 20:36 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
New Libraries: Icl. Updated Libraries: Array, Asio, Bind, Concept Check, Filesystem,
Fusion, Hash, Iostreams, Iterator, Math, Meta State Machine, Optional, Pool,
Program Options, Proto, Signals, Spirit, Tokenizer, Unordered, Wave. Updated
Tools: Boostbook, Inspect, Quickbook.
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_46_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.46.0/">Download</a></li>
</ul>
<h2 class="news-title">
<a name="iversion_1_45_0" id="iversion_1_45_0"></a><a href="/users/history/version_1_45_0.html">Version 1.45.0</a></h2>
<p class="news-date">November 19th, 2010 16:00 GMT</p>
<div class="news-description">
<span class="brief"><span class="purpose">
Updated Libraries: Asio, Config, Flyweight, Foreach, Fusion, Graph, Interprocess,
Math, Meta State Machine, MultiArray, Proto, Spirit, TypeTraits, uBLAS, Unordered,
Wave, Xpressive. Updated tools: Boostbook, Quickbook
</span></span> </div>
<ul class="menu">
<li>
<a href="/users/history/version_1_45_0.html">Details</a></li>
<li><a href="http://sourceforge.net/projects/boost/files/boost/1.45.0/">Download</a></li>
</ul> </div>
<!--#include virtual="/generated/news-items.html" -->
</div>
</div>
</div>