|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r71959 - in website/public_html/beta: common/code doc
From: dnljms_at_[hidden]
Date: 2011-05-15 11:47:57
Author: danieljames
Date: 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
New Revision: 71959
URL: http://svn.boost.org/trac/boost/changeset/71959
Log:
Website: add new libraries to beta site.
Text files modified:
website/public_html/beta/common/code/boost_libraries.php | 8 +++---
website/public_html/beta/doc/.htaccess | 6 ++--
website/public_html/beta/doc/display_libs.php | 7 ++++-
website/public_html/beta/doc/libraries.txt | 11 ++++----
website/public_html/beta/doc/libraries.xml | 50 ++++++++++++++++++++++++++++++++++++++++
5 files changed, 68 insertions(+), 14 deletions(-)
Modified: website/public_html/beta/common/code/boost_libraries.php
==============================================================================
--- website/public_html/beta/common/code/boost_libraries.php (original)
+++ website/public_html/beta/common/code/boost_libraries.php 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
@@ -70,7 +70,7 @@
$value = isset($val['value']) ? trim($val['value']) : false;
if($value && $value != 'true' && $value != 'false') {
echo 'Invalid value for ',htmlentities($val['tag']),
- ': ', $value;
+ ': ', $value, "\n";
exit(0);
}
$lib[$val['tag']] = ($value == 'true');
@@ -80,7 +80,7 @@
{
$value = isset($val['value']) ? trim($val['value']) : '';
if(!isset($this->build_values[$value])) {
- echo 'Invalid value for build: ', htmlentities($value);
+ echo 'Invalid value for build: ', htmlentities($value), "\n";
exit(0);
}
$lib['build'] = $value;
@@ -95,7 +95,7 @@
}
break;
default:
- echo 'Invalid tag: ', htmlentities($val['tag']);
+ echo 'Invalid tag: ', htmlentities($val['tag']), "\n";
exit(0);
}
}
@@ -129,7 +129,7 @@
foreach($libs as $key => &$library) {
foreach($library['category'] as $category) {
if(!isset($this->categories[$category])) {
- echo 'Unknown category: '.$category;
+ echo 'Unknown category: ', htmlentities($category), "\n";
exit(0);
}
$categories[$category]['libraries'][] = &$library;
Modified: website/public_html/beta/doc/.htaccess
==============================================================================
--- website/public_html/beta/doc/.htaccess (original)
+++ website/public_html/beta/doc/.htaccess 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
@@ -16,7 +16,7 @@
# Requires an appropriate soft link.
# RewriteCond %{DOCUMENT_ROOT}/doc/archives -l
RewriteCond %{DOCUMENT_ROOT}/doc/archives/boost_$1 -f
-RewriteRule ^libs/([0-9_]+(?:beta[0-9]*)?/.*\.(?:png|gif|jpg|jpeg|jpe|css|js|pdf|dtd))$ archives/boost_$1 [L,NC]
+RewriteRule ^libs/([0-9_]+(?:beta[0-9]*|snapshot)?/.*\.(?:png|gif|jpg|jpeg|jpe|css|js|pdf|dtd))$ archives/boost_$1 [L,NC]
RewriteCond %{DOCUMENT_ROOT}/doc/archives/boost-build/$1 -f
RewriteRule ^tools/build/(.*\.(?:png|gif|jpg|jpeg|jpe|css|js|pdf|dtd))$ archives/boost-build/$1 [L,NC]
@@ -26,10 +26,10 @@
RewriteRule ^libs/development(/.*)?$ libs/1_46_1$1 [R]
# Rewrite specific versions to the dynamic handlers.
-RewriteRule ^libs/([0-9_]+(?:beta[0-9]*)?)/?$ libraries.php/$1 [L]
+RewriteRule ^libs/([0-9_]+(?:beta[0-9]*|snapshot)?)/?$ libraries.php/$1 [L]
RewriteCond %{REQUEST_FILENAME} !-f
-RewriteRule ^libs/([0-9_]+(?:beta[0-9]*)?)/(.+)$ display_libs.php/boost_$1/$2 [L]
+RewriteRule ^libs/([0-9_]+(?:beta[0-9]*|snapshot)?)/(.+)$ display_libs.php/boost_$1/$2 [L]
RewriteCond %{REQUEST_FILENAME} !-f
RewriteRule ^libs/?(.*)$ libraries.php$1 [L]
Modified: website/public_html/beta/doc/display_libs.php
==============================================================================
--- website/public_html/beta/doc/display_libs.php (original)
+++ website/public_html/beta/doc/display_libs.php 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
@@ -61,8 +61,11 @@
}
$location = get_archive_location('@^[/]([^/]+)[/](.*)$@',$_SERVER["PATH_INFO"],true,false);
-$beta_site = strpos($_SERVER['HTTP_HOST'], 'beta') !== FALSE;
-$beta_docs = strpos($location['version'], 'beta') !== FALSE;
+$beta_site = strpos($_SERVER['HTTP_HOST'], 'beta') !== FALSE ||
+ strpos($_SERVER['HTTP_HOST'], 'localhost') !== FALSE;
+$beta_docs = strpos($location['version'], 'beta') !== FALSE ||
+ strpos($location['version'], 'snapshot') !== FALSE;
+
if (!$beta_site && $beta_docs) {
file_not_found($location['file']);
return;
Modified: website/public_html/beta/doc/libraries.txt
==============================================================================
--- website/public_html/beta/doc/libraries.txt (original)
+++ website/public_html/beta/doc/libraries.txt 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
@@ -1,4 +1,4 @@
-O:15:"boost_libraries":3:{s:10:"categories";a:20:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"libraries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"librarie
s";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:105:{s:12:"accumulators";a:10:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statistical accumulators.";s:13:"documentation";s:28:"libs/accumulators/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:10:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
+O:15:"boost_libraries":3:{s:10:"categories";a:20:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"libraries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"librarie
s";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:109:{s:12:"accumulators";a:10:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statistical accumulators.";s:13:"documentation";s:28:"libs/accumulators/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:10:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
min/max and min/max element computations.";s:13:"documentation";s:32:"libs/algorithm/minmax/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:16:"algorithm/string";a:10:{s:3:"key";s:16:"algorithm/string";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:11:"String Algo";s:7:"authors";s:11:"Pavol Droba";s:11:"description";s:26:"String algorithms library.";s:13:"documentation";s:25:"doc/html/string_algo.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:6:"String";i:1;s:10:"Algorithms";}}s:3:"any";a:10:{s:3:"key";s:3:"any";s:13:"boost-version";s:6:"1.23.0";s:4:"name";s:3:"Any";s:7:"authors";s:13:"Kevlin Henney";s:11:"description";s:71:"Safe, generic container for single values of
different value types.";s:13:"documentation";s:17:"doc/html/any.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Data";}}s:5:"array";a:10:{s:3:"key";s:5:"array";s:13:"boost-version";s:6:"1.17.0";s:4:"name";s:5:"Array";s:7:"authors";s:16:"Nicolai Josuttis";s:11:"description";s:64:"STL compliant container wrapper for arrays of
constant size.";s:13:"documentation";s:19:"doc/html/array.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Containers";}}s:4:"asio";a:10:{s:3:"key";s:4:"asio";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:4:"Asio";s:7:"authors";s:14:"Chris Kohlhoff";s:11:"description";s:93:"Portable networking, including sockets, timers,
@@ -13,7 +13,7 @@
positions.";s:13:"documentation";s:19:"libs/bind/bind.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:11:"bind/mem_fn";a:10:{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:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:8:"bind/ref";a:10:{s:3:"key";s:8:"bind/ref";s:13:"boost-version";s:6:"1.25.0";s:4:"name";s:3:"Ref";s:7:"authors";s:61:"Jaako Järvi, Peter Dimov, Doug Gregor, and Dave
Abrahams";s:11:"description";s:66:"A utility library for passing references to
- generic functions.";s:13:"documentation";s:17:"doc/html/ref.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:15:"circular_buffer";a:10:{s:3:"key";s:15:"circular_buffer";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:15:"Circular Buffer";s:7:"authors";s:10:"Jan Gaspar";s:11:"description";s:62:"A STL compliant container also known as ring or cyclic buffer.";s:13:"documentation";s:31:"libs/circular_buffer/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Containers";}}s:13:"compatibility";a:10:{s:3:"key";s:13:"compatibility";s:13:"boost-version";s:6:"1.21.2";s:4:"name";s:13:"Compatibility";s:7:"authors";s:37:"Ralf Grosse-Kunstleve and Jens Maurer";s:11:"description";s:47:"Help for non-conforming standard
+ generic functions.";s:13:"documentation";s:17:"doc/html/ref.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:6:"chrono";a:10:{s:3:"key";s:6:"chrono";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:6:"Chrono";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:22:"Useful time utilities.";s:13:"documentation";s:22:"libs/chrono/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:15:"circular_buffer";a:10:{s:3:"key";s:15:"circular_buffer";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:15:"Circular Buffer";s:7:"authors";s:10:"Jan Gaspar";s:11:"description";s:62:"A STL compliant container also known as ring or cyclic buffer.";s:13:"documentation";s:31:"libs/circular_buffer/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Containers";}}s:13:"compatibility";a:10:{s:3:"key";s
:13:"compatibility";s:13:"boost-version";s:6:"1.21.2";s:4:"name";s:13:"Compatibility";s:7:"authors";s:37:"Ralf Grosse-Kunstleve and Jens Maurer";s:11:"description";s:47:"Help for non-conforming standard
libraries.";s:13:"documentation";s:29:"libs/compatibility/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:11:"workarounds";}}s:13:"concept_check";a:10:{s:3:"key";s:13:"concept_check";s:13:"boost-version";s:6:"1.19.0";s:4:"name";s:13:"Concept Check";s:7:"authors";s:11:"Jeremy Siek";s:11:"description";s:30:"Tools for generic programming.";s:13:"documentation";s:36:"libs/concept_check/concept_check.htm";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:7:"Generic";i:1;s:11:"Correctness";}}s:6:"config";a:10:{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:8:"category";a:1:{i:0;s:11:"workarounds";}}s:10:"conversion";a:10:{s:3:"key";s:10:"conversion";s:13:"boost-version";s:6:"1.20.0";s:4:"name";s:10:"Conversion";s:7:"authors";s:31:"Dave Abrahams and Kevlin Henney";s:11:"description";s:30:"Polymorphic and lexical casts.";s:13:"documentation";s:26:"libs/conversion/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:6:"String";i:1;s:13:"Miscellaneous";}}s:3:"crc";a:10:{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
@@ -57,7 +57,7 @@
class templates that are function object
wrappers.";s:13:"documentation";s:26:"libs/functional/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:15:"functional/hash";a:10:{s:3:"key";s:15:"functional/hash";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:15:"Functional/Hash";s:7:"authors";s:12:"Daniel James";s:11:"description";s:79:"A TR1 hash function object that can be extended to
hash user defined types.";s:13:"documentation";s:18:"doc/html/hash.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:18:"functional/factory";a:10:{s:3:"key";s:18:"functional/factory";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Factory";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:64:"Function object templates for dynamic and static object creation";s:13:"documentation";s:34:"libs/functional/factory/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:18:"functional/forward";a:10:{s:3:"key";s:18:"functional/forward";s:13:"boost-version";s:6:"1.43.0";s:4:"name";s:18:"Functional/Forward";s:7:"authors";s:16:"Tobias Schwinger";s:11:"description";s:72:"Adapters to allow generic function objects to accept arbitrary arguments";s:13:"documentation";s:34:"libs/functional/forward/index.html";s:12:"std-proposal";b:0;s:7:"
std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:6:"fusion";a:10:{s:3:"key";s:6:"fusion";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:6:"Fusion";s:7:"authors";s:48:"Joel de Guzman, Dan Marsden and Tobias Schwinger";s:11:"description";s:80:"Library for working with tuples, including various containers,
- algorithms, etc.";s:13:"documentation";s:31:"libs/fusion/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:15:"Metaprogramming";i:1;s:4:"Data";}}s:3:"gil";a:10:{s:3:"key";s:3:"gil";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"GIL";s:7:"authors";s:30:"Lubomir Bourdev and Hailin Jin";s:11:"description";s:21:"Generic Image Library";s:13:"documentation";s:23:"libs/gil/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s: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:10:{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;
+ algorithms, etc.";s:13:"documentation";s:31:"libs/fusion/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:15:"Metaprogramming";i:1;s:4:"Data";}}s:8:"geometry";a:10:{s:3:"key";s:8:"geometry";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:8:"Geometry";s:7:"authors";s:48:"Barend Gehrels, Bruno Lalande and Mateusz Loskot";s:11:"description";s:17:"Geometry Library.";s:13:"documentation";s:24:"libs/geometry/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:2:{i:0;s:10:"Algorithms";i:1;s:4:"Math";}}s:3:"gil";a:10:{s:3:"key";s:3:"gil";s:13:"boost-version";s:6:"1.35.0";s:4:"name";s:3:"GIL";s:7:"authors";s:30:"Lubomir Bourdev and Hailin Jin";s:11:"description";s:21:"Generic Image Library";s:13:"documentation";s:23:"libs/gil/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s: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:10:{s:3:"key";s:5:"graph";s:13:"boost-version";s:6:"1.18.0";s:4:"name";s:5:"Graph";s:7:"authors";s:107:"Jeremy Siek and a University of Notre Dame team;
now maintained by Andrew Sutton and Jeremiah Willcock.";s:11:"description";s:127:"The BGL graph interface and graph components are
generic, in the same sense as the the Standard Template Library
(STL).";s:13:"documentation";s:37:"libs/graph/doc/table_of_contents.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"category";a:3:{i:0;s:10:"Containers";i:1;s:9:"Iterators";i:2;s:10:"Algorithms";}}s:3:"icl";a:10:{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
@@ -110,7 +110,8 @@
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:8:"category";a:1:{i:0;s:4:"Math";}}s:8:"optional";a:10:{s:3:"key";s:8:"optional";s:13:"boost-version";s:6:"1.30.0";s:4:"name";s:8:"Optional";s:7:"authors";s:17:"Fernando Cacciola";s:11:"description";s:52:"Discriminated-union wrapper for optional
values.";s:13:"documentation";s:24:"libs/optional/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:9:"parameter";a:10:{s:3:"key";s:9:"parameter";s:13:"boost-version";s:6:"1.33.0";s:4:"name";s:9:"Parameter";s:7:"authors";s:32:"David Abrahams and Daniel Wallin";s:11:"description";s:76:"Boost.Parameter Library - Write functions that
- accept arguments by name.";s:13:"documentation";s:34:"libs/parameter/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:11:"Programming";}}s:7:"polygon";a:10:{s:3:"key";s:7:"polygon";s:13:"boost-version";s:6:"1.44.0";s:4:"name";s:7:"Polygon";s:7:"authors";s:16:"Lucanus Simonson";s:11:"description";s:94:"Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.";s:13:"documentation";s:23:"libs/polygon/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"pool";a:10:{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:24:"libs/pool/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:6:"Memory";}}s:12:"preprocessor";a:10:{s:3:"ke
y";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
+ accept arguments by name.";s:13:"documentation";s:34:"libs/parameter/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:11:"Programming";}}s:7:"phoenix";a:10:{s:3:"key";s:7:"phoenix";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:7:"Phoenix";s:7:"authors";s:45:"Joel de Guzman, Dan Marsden and Thomas Heller";s:11:"description";s:76:"Define small unnamed function objects at the actual
+ call site, and more.";s:13:"documentation";s:23:"libs/phoenix/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:7:"polygon";a:10:{s:3:"key";s:7:"polygon";s:13:"boost-version";s:6:"1.44.0";s:4:"name";s:7:"Polygon";s:7:"authors";s:16:"Lucanus Simonson";s:11:"description";s:94:"Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates.";s:13:"documentation";s:23:"libs/polygon/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:4:"pool";a:10:{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:24:"libs/pool/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:6:"Memory";}}s:12:"preprocessor";a:10:{s:3:"key";s:12:"pr
eprocessor";s:13:"boost-version";s:6:"1.26.0";s:4:"name";s:12:"Preprocessor";s:7:"authors";s:33:"Vesa Karvonen and Paul Mensonides";s:11:"description";s:74:"Preprocessor metaprogramming tools including
repetition and recursion.";s:13:"documentation";s:32:"libs/preprocessor/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:12:"Preprocessor";}}s:15:"program_options";a:10:{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
@@ -122,7 +123,7 @@
and vice-versa, using no special tools -- just your C++
compiler.";s:13:"documentation";s:26:"libs/python/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:8:"category";a:1:{i:0;s:14:"Inter-language";}}s:6:"random";a:10:{s:3:"key";s:6:"random";s:13:"boost-version";s:6:"1.15.0";s:4:"name";s:6:"Random";s:7:"authors";s:11:"Jens Maurer";s:11:"description";s:51:"A complete system for random number
generation.";s:13:"documentation";s:22:"libs/random/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"range";a:10:{s:3:"key";s:5:"range";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:5:"Range";s:7:"authors";s:29:"Niel Groves, Thorsten Ottosen";s:11:"description";s:96:"A new infrastructure for generic algorithms that
- builds on top of the new iterator concepts.";s:13:"documentation";s:21:"libs/range/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:8:"rational";a:10:{s:3:"key";s:8:"rational";s:13:"boost-version";s:6:"1.11.0";s:4:"name";s:8:"Rational";s:7:"authors";s:10:"Paul Moore";s:11:"description";s:24:"A rational number class.";s:13:"documentation";s:24:"libs/rational/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"regex";a:10:{s:3:"key";s:5:"regex";s:13:"boost-version";s:6:"1.18.0";s:4:"name";s:5:"Regex";s:7:"authors";s:12:"John Maddock";s:11:"description";s:27:"Regular expression library.";s:13:"documentation";s:21:"libs/regex/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:8:"autolink";s:8:"category";a:1:{i:0;s:6:"String";}}s:10:"scope_exit";a:10:{s:3:"key";s:10:"scope_exit";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:10:"Scope Ex
it";s:7:"authors";s:17:"Alexander Nasonov";s:11:"description";s:37:"Execute arbitrary code at scope exit.";s:13:"documentation";s:35:"libs/scope_exit/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:13:"serialization";a:10:{s:3:"key";s:13:"serialization";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:13:"Serialization";s:7:"authors";s:12:"Robert Ramey";s:11:"description";s:50:"Serialization for persistence and
+ builds on top of the new iterator concepts.";s:13:"documentation";s:21:"libs/range/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:10:"Algorithms";}}s:5:"ratio";a:10:{s:3:"key";s:5:"ratio";s:13:"boost-version";s:6:"1.47.0";s:4:"name";s:5:"Ratio";s:7:"authors";s:25:"Vicente J. Botet Escribá";s:11:"description";s:33:"Compile time rational arithmetic.";s:13:"documentation";s:21:"libs/ratio/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:8:"rational";a:10:{s:3:"key";s:8:"rational";s:13:"boost-version";s:6:"1.11.0";s:4:"name";s:8:"Rational";s:7:"authors";s:10:"Paul Moore";s:11:"description";s:24:"A rational number class.";s:13:"documentation";s:24:"libs/rational/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:4:"Math";}}s:5:"regex";a:10:{s:3:"key";s:5:"regex";s:13:"boost-version";s:6:"1.18.0";s:4:"name";s:5:"
Regex";s:7:"authors";s:12:"John Maddock";s:11:"description";s:27:"Regular expression library.";s:13:"documentation";s:21:"libs/regex/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:1;s:5:"build";s:8:"autolink";s:8:"category";a:1:{i:0;s:6:"String";}}s:10:"scope_exit";a:10:{s:3:"key";s:10:"scope_exit";s:13:"boost-version";s:6:"1.38.0";s:4:"name";s:10:"Scope Exit";s:7:"authors";s:17:"Alexander Nasonov";s:11:"description";s:37:"Execute arbitrary code at scope exit.";s:13:"documentation";s:35:"libs/scope_exit/doc/html/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:8:"category";a:1:{i:0;s:13:"Miscellaneous";}}s:13:"serialization";a:10:{s:3:"key";s:13:"serialization";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:13:"Serialization";s:7:"authors";s:12:"Robert Ramey";s:11:"description";s:50:"Serialization for persistence and
marshalling.";s:13:"documentation";s:33:"libs/serialization/doc/index.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"category";a:1:{i:0;s:2:"IO";}}s:7:"signals";a:10:{s:3:"key";s:7:"signals";s:13:"boost-version";s:6:"1.29.0";s:4:"name";s:7:"Signals";s:7:"authors";s:11:"Doug Gregor";s:11:"description";s:52:"Managed signals & slots callback
implementation.";s:13:"documentation";s:21:"doc/html/signals.html";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:8:"autolink";s:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:8:"signals2";a:10:{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:8:"category";a:1:{i:0;s:16:"Function-objects";}}s:9:"smart_ptr";a:10:{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
Modified: website/public_html/beta/doc/libraries.xml
==============================================================================
--- website/public_html/beta/doc/libraries.xml (original)
+++ website/public_html/beta/doc/libraries.xml 2011-05-15 11:47:56 EDT (Sun, 15 May 2011)
@@ -212,6 +212,18 @@
<category>Function-objects</category>
</library>
<library>
+ <key>chrono</key>
+ <boost-version>1.47.0</boost-version>
+ <name>Chrono</name>
+ <authors>Vicente J. Botet Escribá</authors>
+ <description>Useful time utilities.</description>
+ <documentation>libs/chrono/index.html</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>autolink</build>
+ <category>Miscellaneous</category>
+ </library>
+ <library>
<key>circular_buffer</key>
<boost-version>1.35.0</boost-version>
<name>Circular Buffer</name>
@@ -517,6 +529,19 @@
<category>Data</category>
</library>
<library>
+ <key>geometry</key>
+ <boost-version>1.47.0</boost-version>
+ <name>Geometry</name>
+ <authors>Barend Gehrels, Bruno Lalande and Mateusz Loskot</authors>
+ <description>Geometry Library.</description>
+ <documentation>libs/geometry/index.html</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>header-only</build>
+ <category>Algorithms</category>
+ <category>Math</category>
+ </library>
+ <library>
<key>gil</key>
<boost-version>1.35.0</boost-version>
<name>GIL</name>
@@ -923,6 +948,19 @@
<category>Programming</category>
</library>
<library>
+ <key>phoenix</key>
+ <boost-version>1.47.0</boost-version>
+ <name>Phoenix</name>
+ <authors>Joel de Guzman, Dan Marsden and Thomas Heller</authors>
+ <description>Define small unnamed function objects at the actual
+ call site, and more.</description>
+ <documentation>libs/phoenix/index.html</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>header-only</build>
+ <category>Function-objects</category>
+ </library>
+ <library>
<key>polygon</key>
<boost-version>1.44.0</boost-version>
<name>Polygon</name>
@@ -1073,6 +1111,18 @@
<category>Algorithms</category>
</library>
<library>
+ <key>ratio</key>
+ <boost-version>1.47.0</boost-version>
+ <name>Ratio</name>
+ <authors>Vicente J. Botet Escribá</authors>
+ <description>Compile time rational arithmetic.</description>
+ <documentation>libs/ratio/index.html</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>header-only</build>
+ <category>Math</category>
+ </library>
+ <library>
<key>rational</key>
<boost-version>1.11.0</boost-version>
<name>Rational</name>
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk