1.21.0 run up

[SVN r9502]
This commit is contained in:
Beman Dawes 2001-03-08 20:35:52 +00:00
parent 350e01f307
commit b63f02b98d
6 changed files with 34 additions and 26 deletions

View file

@ -52,40 +52,39 @@ section</a> (formerly called the &quot;vault&quot;).</p>
<p>Beman Dawes is the Boost <a name="webmaster">webmaster</a>; email him at <a href="mailto:beman@boost.org">beman@esva.net</a>
with any concerns you don't want to just post to the mailing list.</p>
<h2>Latest News</h2>
<p>March ?, 2001 - Version 1.21.0</p>
<p>March 9, 2001 - Version 1.21.0</p>
<ul>
<li><a href="libs/utility/iterator_adaptors.htm">Iterator Adaptor Library</a>
added. Adapt a base type into a standard conforming iterator, and more, from
Dave Abrahams, Jeremy Siek, and John Potter.</li>
<li><a href="libs/pool/doc/index.html">Pool Library</a> added. Memory pool
management from Steve Cleary.</li>
<li><a href="libs/test/doc/index.htm">Test Library</a> added.&nbsp; Support
for program testing and execution from Beman Dawes.</li>
<li><a href="more/generic_programming.html">Generic Programming Techniques</a>
page added, contributed by Dave Abrahams.</li>
<li><a href="libs/python/doc/index.html">Python Library</a> upgrade.&nbsp; Better compatibility with Python 2.0, NULL pointers and smart-pointers get converted to/from python None,
massive documentation review/revision.</li>
<li> <a href="libs/regex/index.htm">Regular Expression Library</a>:&nbsp;
Minor
fixes for Unicode platforms.</li>
<LI> <a href="libs/graph/doc/table_of_contents.html">Graph Library</a>:&nbsp;
Updated use of iterator adaptors. Changed <tt>operator==</tt> for
<tt>adjacency_list::edge_descriptor</tt> to improve semantics for
multigraphs. Moved <tt>adjacency_iterator_generator</tt> from
namespace <tt>detail</tt> to <tt>boost</tt> and added <a
href="libs/graph/doc/adjacency_iterator.html">documentation</a>.
Changed name of <tt>dynamic_components()</tt> to <a
href="libs/graph/doc/incremental_components.html"><tt>incremental_components()</tt></a>
to better match graph literature terminology. Cleaned up
href="libs/graph/doc/adjacency_iterator.html">documentation</a>. Renamed <tt>dynamic_components()</tt> to <a
href="libs/graph/doc/incremental_components.html"><tt>incremental_components()</tt></a><tt>,</tt> better matching graph literature terminology. Cleaned up
interface of <a href="libs/graph/doc/connected_components.html">
<tt>connected_components()</tt></a> and created a separate <a
<tt>connected_components()</tt></a> and created separate <a
href="libs/graph/doc/strong_components.html">
<tt>strong_components()</tt></a> function which now uses the more
efficient algorithm by Tarjan. Fixed figures in documentation for
<tt>strong_components()</tt></a> function using Tarjan's more
efficient algorithm. Fixed documentation figures for
<a href="libs/graph/doc/adjacency_list.html">
<tt>adjacency_list</tt></a> and <a
href="libs/graph/doc/adjacency_matrix.html">
<tt>adjacency_matrix</tt></a>. Added documentation for the <a
href="libs/graph/doc/cuthill_mckee_ordering.html">
<tt>cuthill_mckee_ordering()</tt></a> algorithm.
<tt>adjacency_matrix</tt></a>. Added docs for <a
href="libs/graph/doc/cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering()</tt></a> algorithm.
<li><a href="libs/python/doc/index.html">Python Library</a> upgraded.&nbsp; Better compatibility with Python 2.0, NULL pointers and smart-pointers get converted to/from python None,
massive documentation review/revision.</li>
<li> <a href="libs/regex/index.htm">Regular Expression Library</a>:&nbsp;
Minor
fixes for Unicode platforms.</li>
</ul>
<p>February 10, 2001 - Version 1.20.2</p>
<ul>

View file

@ -66,6 +66,8 @@ content="text/html; charset=iso-8859-1">
<li><a href="utility/operators.htm">operators</a> - Templates
ease arithmetic classes and iterators from Dave Abrahams
and Jeremy Siek.</li>
<li><a href="pool/doc/index.html">pool</a> - Memory pool management from
Steve Cleary.</li>
<li><a href="property_map/property_map.html">property map</a>
- Concepts defining interfaces which map key objects to
value objects from Jeremy Siek.</li>
@ -184,6 +186,6 @@ compilers.</p>
<hr>
<p>Revised <!--webbot bot="Timestamp" s-type="EDITED"
s-format="%d %b %Y" startspan -->28 Feb 2001<!--webbot bot="Timestamp" endspan i-checksum="14390" --></p>
s-format="%d %b %Y" startspan -->08 Mar 2001<!--webbot bot="Timestamp" endspan i-checksum="14892" --></p>
</body>
</html>

@ -1 +1 @@
Subproject commit f8543d79eb7535f500e1f00aea08bd9e431c147c
Subproject commit a1a68f0970100e3b59b38631502ed75af204fca9

View file

@ -23,6 +23,18 @@
<h1>Boost Frequently Asked Questions</h1>
<p><strong>How do I download the libraries?</strong>
&nbsp; See <a href="../libs/libraries.htm#Download">Download</a> instructions.</p>
<p><b>What support is available for the libraries?</b>&nbsp; Try the <a
href="mailto:boost@egroups.com">boost@egroups.com</a> mailing list. </p>
<p><b>What do the Boost version numbers mean?&nbsp; </b>The scheme is x.y.z, where x is incremented only for massive changes, such as a reorganization of many libraries, y is incremented whenever a new library is added, and z is incremented for maintenance releases. y and z are reset to 0 if
the value to the left changes.&nbsp;<br>
<br>
<b>How can the Boost libraries be used successfully for important projects?&nbsp;
</b>Many of the Boost libraries are actively maintained and improved, so backward compatibility with prior version isn't always possible. Deal with this by freezing the version of the Boost libraries used by your project. Only upgrade at points in your project's life cycle where a bit of change will not cause problems. Individual bug fixes can always be obtained from the CVS repository. </p>
<p><b>How is a library accepted for posting on the site?</b>
See <a href="submission_process.htm">Library Submission Process</a></p>
@ -77,9 +89,6 @@ policy is to only accept libraries with a clear copyright notice.&nbsp; It is up
potential users to decide if they find the copyright terms acceptable, and to not use
libraries with unacceptable copyrights.</p>
<p><b>What support is available for the libraries?</b>&nbsp; Try the <a
href="mailto:boost@egroups.com">boost@egroups.com</a> mailing list. </p>
<p><b>Is there a formal relationship between Boost.org and the C++ Standards Committee?</b>
&nbsp; No. The people who started Boost.org were all on the committee, but that was just
happenstance.</p>
@ -102,9 +111,6 @@ the standards committees, you don&#146;t have to pay to volunteer!</p>
but if people contribute occasional articles or other material to make the site more
interesting, that could be a nice fit.</p>
<p><strong>How do I download the libraries?</strong>
&nbsp; See <a href="../libs/libraries.htm#Download">Download</a> instructions.</p>
<p><b>Why isn't there a separate boost mailing list for my favorite
library?&nbsp;</b> One of the reasons for boost's success has been the cross-pollination of ideas between diverse library
projects and the occasional look into other threads by otherwise uninterested parties. The more people participate, the less they tend to be annoyed by
@ -125,7 +131,7 @@ encouraged to include keywords in the subject like &quot;thread&quot;,
<hr>
<p>Revised <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->06 February, 2001<!--webbot bot="Timestamp" endspan i-checksum="40406" -->
<p>Revised <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->08 March, 2001<!--webbot bot="Timestamp" endspan i-checksum="28780" -->
</p>
</body>
</html>

View file

@ -424,7 +424,7 @@ void tweak_all_widgets2(int arg)
<hr>
<p>Revised
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->18 Feb 2001<!--webbot bot="Timestamp" endspan i-checksum="14389" -->
<!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->28 Feb 2001<!--webbot bot="Timestamp" endspan i-checksum="14390" -->
<p>&copy; Copyright David Abrahams 2001. Permission to copy, use, modify,

View file

@ -22,6 +22,7 @@ run libs/graph/test/graph.cpp
run libs/integer/cstdint_test.cpp
run libs/integer/integer_test.cpp
run libs/integer/integer_traits_test.cpp
run libs/pool/test/test_pool_alloc.cpp
run libs/rational/rational_example.cpp
run libs/rational/rational_test.cpp
run libs/random/random_test.cpp