|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r77975 - in website/public_html/live: doc feed/history generated generated/state users/history
From: dnljms_at_[hidden]
Date: 2012-04-14 13:36:08
Author: danieljames
Date: 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
New Revision: 77975
URL: http://svn.boost.org/trac/boost/changeset/77975
Log:
Website: Add algorithm.
Text files modified:
website/public_html/live/doc/libraries.xml | 12 ++++++++++++
website/public_html/live/feed/history/boost_1_50_0.qbk | 7 ++++---
website/public_html/live/generated/dev.rss | 7 +++++--
website/public_html/live/generated/libraries.txt | 2 +-
website/public_html/live/generated/state/feed-pages.txt | 8 ++++----
website/public_html/live/users/history/version_1_50_0.html | 7 +++++--
6 files changed, 31 insertions(+), 12 deletions(-)
Modified: website/public_html/live/doc/libraries.xml
==============================================================================
--- website/public_html/live/doc/libraries.xml (original)
+++ website/public_html/live/doc/libraries.xml 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -89,6 +89,18 @@
<category>Math</category>
</library>
<library>
+ <key>algorithm</key>
+ <boost-version>1.50.0</boost-version>
+ <name>Algorithm</name>
+ <authors>Marshall Clow</authors>
+ <description>A collection of useful generic algorithms.</description>
+ <documentation>libs/algorithm/</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>header-only</build>
+ <category>Algorithms</category>
+ </library>
+ <library>
<key>algorithm/minmax</key>
<boost-version>1.32.0</boost-version>
<name>Min-Max</name>
Modified: website/public_html/live/feed/history/boost_1_50_0.qbk
==============================================================================
--- website/public_html/live/feed/history/boost_1_50_0.qbk (original)
+++ website/public_html/live/feed/history/boost_1_50_0.qbk 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -1,7 +1,7 @@
[article Version 1.50.0
[quickbook 1.5]
[source-mode c++]
- [purpose New Libraries: Updated Libraries: Program Options]
+ [purpose New Libraries: Algorithm. Updated Libraries: Program Options]
[authors [Dawes, Beman]]
[last-revision ]
]
@@ -47,13 +47,14 @@
[section New Libraries]
-* /TODO/
+* [phrase library..[@/libs/algorithm/ Algorithm]:]
+ A collection of useful generic algorithms, from Marshall Clow.
[endsect]
[section Updated Libraries]
-* [phrase library..[@/libs/program_options/index.html Program Options]:]
+* [phrase library..[@/libs/program_options/index.html Program Options]:]
* Improved error reporting
([@ https://svn.boost.org/trac/boost/changeset/77827 Patch from Leo Goodstadt])
Modified: website/public_html/live/generated/dev.rss
==============================================================================
--- website/public_html/live/generated/dev.rss (original)
+++ website/public_html/live/generated/dev.rss 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -14,7 +14,9 @@
<ul>
<li>
<div>
- <em>TODO</em>
+ <span class="library"><a href="http://www.boost.org/libs/algorithm/">Algorithm</a>:</span>
+ A collection of
+ useful generic algorithms, from Marshall Clow.
</div>
</li>
</ul>
@@ -24,7 +26,8 @@
<ul>
<li>
<div>
- <span class="library"><a href="http://www.boost.org/libs/program_options/index.html">Program Options</a>:</span> <ul>
+ <span class="library"><a href="http://www.boost.org/libs/program_options/index.html">Program Options</a>:</span>
+ <ul>
<li>
<div>
Improved error reporting (<a href="https://svn.boost.org/trac/boost/changeset/77827">Patch
Modified: website/public_html/live/generated/libraries.txt
==============================================================================
--- website/public_html/live/generated/libraries.txt (original)
+++ website/public_html/live/generated/libraries.txt 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -1,4 +1,4 @@
-O:15:"boost_libraries":3:{s:10:"categories";a:25:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:6:"Domain";a:3:{s:4:"name";s:6:"Domain";s:5:"title";s:15:"Domain Specific";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:9:"Emulation";a:3:{s:4:"name";s:9:"Emulation";s:5:"title";s:27:"Language Features Emulation";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"li
braries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:8:"Patterns";a:3:{s:4:"name";s:8:"Patterns";s:5:"title";s:19:"Patterns and Idioms";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"libraries";a:0:{}}s:5:"State";a:3:{s:4:"name";s:5:"State";s:5:"title";s:14:"State Machines";s:9:"libraries";a:0:{}}s:6:"System";a:3:{s:4:"name";s:6:"System";s:5:"title";s:6:"System";s:9:"libraries";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:113:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statisti
cal accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:11:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
+O:15:"boost_libraries":3:{s:10:"categories";a:25:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:6:"Domain";a:3:{s:4:"name";s:6:"Domain";s:5:"title";s:15:"Domain Specific";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:9:"Emulation";a:3:{s:4:"name";s:9:"Emulation";s:5:"title";s:27:"Language Features Emulation";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"li
braries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:8:"Patterns";a:3:{s:4:"name";s:8:"Patterns";s:5:"title";s:19:"Patterns and Idioms";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"libraries";a:0:{}}s:5:"State";a:3:{s:4:"name";s:5:"State";s:5:"title";s:14:"State Machines";s:9:"libraries";a:0:{}}s:6:"System";a:3:{s:4:"name";s:6:"System";s:5:"title";s:6:"System";s:9:"libraries";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:114:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statisti
cal accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:9:"algorithm";a:11:{s:3:"key";s:9:"algorithm";s:13:"boost-version";s:6:"1.50.0";s:4:"name";s:9:"Algorithm";s:7:"authors";s:13:"Marshall Clow";s:11:"description";s:42:"A collection of useful generic algorithms.";s:13:"documentation";s:15:"libs/algorithm/";s:12:"std-proposal";b: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/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,
Modified: website/public_html/live/generated/state/feed-pages.txt
==============================================================================
--- website/public_html/live/generated/state/feed-pages.txt (original)
+++ website/public_html/live/generated/state/feed-pages.txt 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -1868,7 +1868,7 @@
-id
"version_1_50_0
-last_modified
-.1334355346.27
+.1334357456.2
-location
"users/history/version_1_50_0.html
-page_state
@@ -1876,14 +1876,14 @@
"In Progress
-purpose
"
-" New Libraries: Updated Libraries: Program Options
+" New Libraries: Algorithm. Updated Libraries: Program Options
"
-qbk_hash
-"a64ba7f68da08f18d2b75587a33f5f371834a9239e2478e8c9665f526ddb3efc
+"9c31fa948fb4b67f0f75df741d95de9ebec21626f3a3ab1c47a3a0d1fdb020d3
-release_status
"dev
-rss_hash
-"f2eaac5d1fb8907fb10879d73a6e781bdb701d007b36b0c04efa72edc21fab5b
+"23a0bf852fa93488f7dc8af8d1b5695369001a238e2eb474fcbebd458294ba0d
-title
"Version 1.50.0
-type
Modified: website/public_html/live/users/history/version_1_50_0.html
==============================================================================
--- website/public_html/live/users/history/version_1_50_0.html (original)
+++ website/public_html/live/users/history/version_1_50_0.html 2012-04-14 13:36:07 EDT (Sat, 14 Apr 2012)
@@ -53,7 +53,9 @@
<ul>
<li>
<div>
- <em>TODO</em>
+ <span class="library">Algorithm:</span>
+ A collection of
+ useful generic algorithms, from Marshall Clow.
</div>
</li>
</ul>
@@ -63,7 +65,8 @@
<ul>
<li>
<div>
- <span class="library">Program Options:</span> <ul>
+ <span class="library">Program Options:</span>
+ <ul>
<li>
<div>
Improved error reporting (<a href="https://svn.boost.org/trac/boost/changeset/77827">Patch
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