|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r76841 - in website/public_html/live: doc doc/libs/1_49_0_beta1 doc/libs/1_49_0_beta1/libs doc/libs/1_49_0_beta1/libs/heap feed feed/history generated/state users/download users/history
From: dnljms_at_[hidden]
Date: 2012-02-02 16:38:36
Author: danieljames
Date: 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
New Revision: 76841
URL: http://svn.boost.org/trac/boost/changeset/76841
Log:
Website: Add heap.
Added:
website/public_html/live/doc/libs/1_49_0_beta1/
website/public_html/live/doc/libs/1_49_0_beta1/libs/
website/public_html/live/doc/libs/1_49_0_beta1/libs/heap/
website/public_html/live/doc/libs/1_49_0_beta1/libs/heap/index.html (contents, props changed)
Text files modified:
website/public_html/live/doc/libraries.txt | 4 ++--
website/public_html/live/doc/libraries.xml | 12 ++++++++++++
website/public_html/live/feed/dev.rss | 12 ++++++++++++
website/public_html/live/feed/history/boost_1_49_0.qbk | 11 ++++++++++-
website/public_html/live/generated/state/feed-pages.txt | 11 ++++++-----
website/public_html/live/users/download/index.html | 5 +++--
website/public_html/live/users/history/version_1_49_0.html | 12 ++++++++++++
7 files changed, 57 insertions(+), 10 deletions(-)
Modified: website/public_html/live/doc/libraries.txt
==============================================================================
--- website/public_html/live/doc/libraries.txt (original)
+++ website/public_html/live/doc/libraries.txt 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -1,4 +1,4 @@
-O:15:"boost_libraries":3:{s:10:"categories";a:20:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"libraries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"librarie
s";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:112:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statistical accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:11:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
+O:15:"boost_libraries":3:{s:10:"categories";a:20:{s:6:"String";a:3:{s:4:"name";s:6:"String";s:5:"title";s:26:"String and text processing";s:9:"libraries";a:0:{}}s:10:"Containers";a:3:{s:4:"name";s:10:"Containers";s:5:"title";s:10:"Containers";s:9:"libraries";a:0:{}}s:9:"Iterators";a:3:{s:4:"name";s:9:"Iterators";s:5:"title";s:9:"Iterators";s:9:"libraries";a:0:{}}s:10:"Algorithms";a:3:{s:4:"name";s:10:"Algorithms";s:5:"title";s:10:"Algorithms";s:9:"libraries";a:0:{}}s:16:"Function-objects";a:3:{s:4:"name";s:16:"Function-objects";s:5:"title";s:45:"Function objects and higher-order programming";s:9:"libraries";a:0:{}}s:7:"Generic";a:3:{s:4:"name";s:7:"Generic";s:5:"title";s:19:"Generic Programming";s:9:"libraries";a:0:{}}s:15:"Metaprogramming";a:3:{s:4:"name";s:15:"Metaprogramming";s:5:"title";s:25:"Template Metaprogramming";s:9:"libraries";a:0:{}}s:12:"Preprocessor";a:3:{s:4:"name";s:12:"Preprocessor";s:5:"title";s:28:"Preprocessor Metaprogramming";s:9:"libraries";a:0:{}}s:10:"Concurrent";a:3:{s:4:"name";s:1
0:"Concurrent";s:5:"title";s:22:"Concurrent Programming";s:9:"libraries";a:0:{}}s:4:"Math";a:3:{s:4:"name";s:4:"Math";s:5:"title";s:17:"Math and numerics";s:9:"libraries";a:0:{}}s:11:"Correctness";a:3:{s:4:"name";s:11:"Correctness";s:5:"title";s:23:"Correctness and testing";s:9:"libraries";a:0:{}}s:4:"Data";a:3:{s:4:"name";s:4:"Data";s:5:"title";s:15:"Data structures";s:9:"libraries";a:0:{}}s:16:"Image-processing";a:3:{s:4:"name";s:16:"Image-processing";s:5:"title";s:16:"Image processing";s:9:"libraries";a:0:{}}s:2:"IO";a:3:{s:4:"name";s:2:"IO";s:5:"title";s:12:"Input/Output";s:9:"libraries";a:0:{}}s:14:"Inter-language";a:3:{s:4:"name";s:14:"Inter-language";s:5:"title";s:22:"Inter-language support";s:9:"libraries";a:0:{}}s:6:"Memory";a:3:{s:4:"name";s:6:"Memory";s:5:"title";s:6:"Memory";s:9:"libraries";a:0:{}}s:7:"Parsing";a:3:{s:4:"name";s:7:"Parsing";s:5:"title";s:7:"Parsing";s:9:"libraries";a:0:{}}s:11:"Programming";a:3:{s:4:"name";s:11:"Programming";s:5:"title";s:22:"Programming Interfaces";s:9:"librarie
s";a:0:{}}s:13:"Miscellaneous";a:3:{s:4:"name";s:13:"Miscellaneous";s:5:"title";s:13:"Miscellaneous";s:9:"libraries";a:0:{}}s:11:"workarounds";a:3:{s:4:"name";s:11:"workarounds";s:5:"title";s:27:"Broken compiler workarounds";s:9:"libraries";a:0:{}}}s:2:"db";a:113:{s:12:"accumulators";a:11:{s:3:"key";s:12:"accumulators";s:13:"boost-version";s:6:"1.36.0";s:4:"name";s:12:"Accumulators";s:7:"authors";s:12:"Eric Niebler";s:11:"description";s:82:"Framework for incremental calculation, and collection of statistical accumulators.";s:13:"documentation";s:18:"libs/accumulators/";s:12:"std-proposal";b:0;s:7:"std-tr1";b:0;s:5:"build";s:11:"header-only";s:11:"header-only";b:1;s:8:"category";a:1:{i:0;s:4:"Math";}}s:16:"algorithm/minmax";a:11:{s:3:"key";s:16:"algorithm/minmax";s:13:"boost-version";s:6:"1.32.0";s:4:"name";s:7:"Min-Max";s:7:"authors";s:18:"Hervé Brönnimann";s:11:"description";s:90:"Standard library extensions for simultaneous
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,
@@ -60,7 +60,7 @@
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: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
+ (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
Modified: website/public_html/live/doc/libraries.xml
==============================================================================
--- website/public_html/live/doc/libraries.xml (original)
+++ website/public_html/live/doc/libraries.xml 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -588,6 +588,18 @@
<category>Algorithms</category>
</library>
<library>
+ <key>heap</key>
+ <boost-version>1.49.0</boost-version>
+ <name>Heap</name>
+ <authors>Tim Blechmann</authors>
+ <description>Priority queue data structures.</description>
+ <documentation>libs/heap/</documentation>
+ <std-proposal>false</std-proposal>
+ <std-tr1>false</std-tr1>
+ <build>header-only</build>
+ <category>Data</category>
+ </library>
+ <library>
<key>icl</key>
<boost-version>1.46.0</boost-version>
<name>ICL</name>
Added: website/public_html/live/doc/libs/1_49_0_beta1/libs/heap/index.html
==============================================================================
--- (empty file)
+++ website/public_html/live/doc/libs/1_49_0_beta1/libs/heap/index.html 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -0,0 +1,13 @@
+<html>
+<head>
+<meta http-equiv="refresh" content="0; URL=../../doc/html/heap.html">
+</head>
+<body>
+Automatic redirection failed, please go to
+../../doc/html/heap.html <hr>
+<p>© Copyright Beman Dawes, 2001</p>
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying
+file LICENSE_1_0.txt or copy
+at www.boost.org/LICENSE_1_0.txt)</p>
+</body>
+</html>
Modified: website/public_html/live/feed/dev.rss
==============================================================================
--- website/public_html/live/feed/dev.rss (original)
+++ website/public_html/live/feed/dev.rss 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -10,6 +10,18 @@
+ <div id="version_1_49_0.new_libraries">
+ <h3><span class="link">New Libraries</span></h3>
+ <ul>
+ <li>
+ <div>
+ <span class="library"><a href="http://www.boost.org/doc/libs/1_49_0_beta1/libs/heap/index.html">Heap</a>:</span>
+ Priority queue data
+ structures, from Tim Blechmann.
+ </div>
+ </li>
+ </ul>
+ </div>
<div id="version_1_49_0.updated_libraries">
<h3><span class="link">Updated Libraries</span></h3>
<ul>
Modified: website/public_html/live/feed/history/boost_1_49_0.qbk
==============================================================================
--- website/public_html/live/feed/history/boost_1_49_0.qbk (original)
+++ website/public_html/live/feed/history/boost_1_49_0.qbk 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -1,7 +1,9 @@
[article Version 1.49.0
[quickbook 1.5]
[source-mode c++]
- [purpose Updated Libraries: Chrono, Container, Geometry, Graph,
+ [purpose
+ New Library: Heap.
+ Updated Libraries: Chrono, Container, Geometry, Graph,
Icl, Interprocess, Intrusive, Lexical Cast, Locale, Move,
Property Tree, Spirit, Thread, Unordered, Uuid.
]
@@ -15,6 +17,13 @@
[download http://sourceforge.net/projects/boost/files/boost/1.49.0.beta.1/]
[documentation /doc/libs/1_49_0_beta1/]
+[section New Libraries]
+
+* [phrase library..[@/libs/heap/index.html Heap]:]
+ Priority queue data structures, from Tim Blechmann.
+
+[endsect]
+
[section Updated Libraries]
* [phrase library..[@/libs/chrono Chrono]:]
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-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -1838,7 +1838,7 @@
-id
"version_1_49_0
-last_modified
-.1328138443.74
+.1328218626.19
-location
"users/history/version_1_49_0.html
-page_state
@@ -1846,15 +1846,16 @@
"In Progress
-purpose
"
-" Updated Libraries: Chrono, Container, Geometry, Graph, Icl, Interprocess, Intrusive,
-" Lexical Cast, Locale, Move, Property Tree, Spirit, Thread, Unordered, Uuid.
+" New Library: Heap. Updated Libraries: Chrono, Container, Geometry, Graph, Icl,
+" Interprocess, Intrusive, Lexical Cast, Locale, Move, Property Tree, Spirit,
+" Thread, Unordered, Uuid.
"
-qbk_hash
-"bcf9f1337e22773968d34df199e1faca785fb875dde3fe51f7e450c15320c1b2
+"c7ffb2abf1346bc4b2724c429b405220f9a1fb3f620f736d43422aece766b483
-release_status
"beta 1
-rss_hash
-"f0b141db0e02f0fad45f1c606cd413bc05fad060fc7a30b894e85f75bacddf49
+"f7e470c33017a077318f7e13f3e9ce7900af363c988df331c4b3f1abfd60dbed
-title
"Version 1.49.0
-type
Modified: website/public_html/live/users/download/index.html
==============================================================================
--- website/public_html/live/users/download/index.html (original)
+++ website/public_html/live/users/download/index.html 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -63,8 +63,9 @@
<p class="news-description">
<span class="brief"><span class="purpose">
- Updated Libraries: Chrono, Container, Geometry, Graph, Icl, Interprocess, Intrusive,
- Lexical Cast, Locale, Move, Property Tree, Spirit, Thread, Unordered, Uuid.
+ New Library: Heap. Updated Libraries: Chrono, Container, Geometry, Graph, Icl,
+ Interprocess, Intrusive, Lexical Cast, Locale, Move, Property Tree, Spirit,
+ Thread, Unordered, Uuid.
</span></span></p>
<ul class="menu">
Modified: website/public_html/live/users/history/version_1_49_0.html
==============================================================================
--- website/public_html/live/users/history/version_1_49_0.html (original)
+++ website/public_html/live/users/history/version_1_49_0.html 2012-02-02 16:38:35 EST (Thu, 02 Feb 2012)
@@ -49,6 +49,18 @@
+ <div id="version_1_49_0.new_libraries">
+ <h3><span class="link">New Libraries</span></h3>
+ <ul>
+ <li>
+ <div>
+ <span class="library">Heap:</span>
+ Priority queue data
+ structures, from Tim Blechmann.
+ </div>
+ </li>
+ </ul>
+ </div>
<div id="version_1_49_0.updated_libraries">
<h3><span class="link">Updated Libraries</span></h3>
<ul>
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