mirror of
https://github.com/boostorg/boost.git
synced 2025-04-12 16:12:57 +00:00
Add I/O state saver library
[SVN r13772]
This commit is contained in:
Beman Dawes
parent
0427c42840
commit
4d24acba41
2 changed files with 23 additions and 20 deletions
24
index.htm
24
index.htm
|
|
@ -109,13 +109,18 @@ formal reviews of proposed libraries. There is also a users mailing list.</p>
|
|||
<p>May 15, 2002 - Version 1.28.0</p>
|
||||
<ul>
|
||||
<li>The Boost mailing lists are now also accessible as
|
||||
<a href="more/mailing_lists.htm#newsgroup">newsgroups</a>.<li>
|
||||
<a href="more/mailing_lists.htm#newsgroup">newsgroups</a>.<li>A powerful
|
||||
<a href="http://aspn.activestate.com/ASPN/Mail/Archives/boost/">mailing list
|
||||
archive</a> has been contributed by the
|
||||
<a href="http://aspn.activestate.com/ASPN/Mail/Archives/boost/">ActiveState
|
||||
Programmer Network</a>.<li>
|
||||
<a href="libs/lambda/doc/index.html">Lambda Library</a> added, from Jaakko
|
||||
Järvi and Gary Powell. Define small unnamed function objects at the actual
|
||||
call site:<br>
|
||||
<br>
|
||||
<code> for_each(a.begin(), a.end(), std::cout << _1 << ' ');</code><br>
|
||||
<li><a href="libs/config/config.htm">Configuration Library</a>:
|
||||
<li><a href="libs/io/doc/ios_state.html">I/O State Saver Library added</a>
|
||||
- Save I/O state to prevent jumbled data, from Daryle Walker.<li><a href="libs/config/config.htm">Configuration Library</a>:
|
||||
User code should not use BOOST_NO_LIMITS.
|
||||
<li><a href="libs/random/index.html">Random Number Library</a>:
|
||||
Avoid compiler warnings</li>
|
||||
|
|
@ -125,6 +130,7 @@ formal reviews of proposed libraries. There is also a users mailing list.</p>
|
|||
<a href="libs/smart_ptr/shared_ptr.htm#shared_polymorphic_downcast">shared_polymorphic_downcast</a>.</li>
|
||||
<li><a href="libs/function/index.html">Function Library</a>: Now supports function objects with the unary <code>&</code> operator overloaded.</li>
|
||||
<li><a href="libs/utility/utility.htm">Utility Library</a>: Added <code>addressof()</code> function.</li>
|
||||
<li>The usual small fixes and tweaks.</li>
|
||||
</ul>
|
||||
<p>February 5, 2002 - Version 1.27.0</p>
|
||||
<ul>
|
||||
|
|
@ -216,18 +222,6 @@ formal reviews of proposed libraries. There is also a users mailing list.</p>
|
|||
tokens comments from Johan Nillson and Jens Maurer.</li>
|
||||
<li>Coming Soon - A mailing list for Boost users!</li>
|
||||
</ul>
|
||||
<p>August 19, 2001 - Version 1.24.0
|
||||
<ul>
|
||||
<li><a href="libs/tuple/doc/tuple_users_guide.html">Tuple Library</a> added.
|
||||
Tuples ease definition of functions returning multiple values, and more,
|
||||
from Jaakko Järvi.</li>
|
||||
<li>Minor fixes to some other libraries.</li>
|
||||
<li><a href="tools/build/index.html">Boost Build System</a> added. Preliminary
|
||||
release of an innovative build system for Boost libraries, from Dave
|
||||
Abrahams and others.</li>
|
||||
<li><a href="more/formal_review_schedule.html">
|
||||
Formal Review Schedule</a> added. Shows current, future, and recent past review dates.</li>
|
||||
</ul>
|
||||
</td>
|
||||
</tr>
|
||||
</table>
|
||||
|
|
@ -237,7 +231,7 @@ Formal Review Schedule</a> added. Shows current, future, and recent past review
|
|||
|
||||
<hr>
|
||||
<p>Revised
|
||||
<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->06 May, 2002<!--webbot bot="Timestamp" endspan i-checksum="13974" --></p>
|
||||
<!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->09 May, 2002<!--webbot bot="Timestamp" endspan i-checksum="13980" --></p>
|
||||
|
||||
</body>
|
||||
|
||||
|
|
|
|||
|
|
@ -46,11 +46,12 @@ Metaprogramming</a><br>
|
|||
<a href="#Preprocessor">Preprocessor Metaprogramming</a><a href="#Generic"><br>
|
||||
</a> <a href="#Concurrent">Concurrent Programming</a><br>
|
||||
<a href="#Math">Math and numerics<br>
|
||||
</a> <a href="#Inter-language">Inter-language support</a><br>
|
||||
<a href="#Correctness">Correctness and testing<br>
|
||||
</a> <a href="#Correctness">Correctness and testing<br>
|
||||
</a> <a href="#Data">Data structures<br>
|
||||
</a> <a href="#Memory">Memory<br>
|
||||
</a> <a href="#Miscellaneous">Miscellaneous</a><br>
|
||||
</a> <a href="#IO">Input/Output</a><a href="#Memory"><br>
|
||||
</a> <a href="#Inter-language">Inter-language support</a><br>
|
||||
<a href="#Memory">Memory</a><br>
|
||||
<a href="#Miscellaneous">Miscellaneous</a><br>
|
||||
<a href="#workarounds">Broken compiler workarounds</a><br>
|
||||
<a href="#Obsolete">Obsolete Libraries</a><br>
|
||||
<a href="#Beta">Beta Libraries</a></p>
|
||||
|
|
@ -106,6 +107,8 @@ out how to build object libraries, when needed.</p>
|
|||
and a University of Notre Dame team.</li>
|
||||
<li><a href="integer/index.htm">integer</a> - Headers to ease
|
||||
dealing with integral types.</li>
|
||||
<li><a href="io/doc/ios_state.html">io state savers</a> - Save I/O state to
|
||||
prevent jumbled data, from Daryle Walker.</li>
|
||||
<li><a href="utility/iterator_adaptors.htm">iterator adaptors</a>
|
||||
- Adapt a base type into a standard conforming iterator,
|
||||
and more, from Dave Abrahams, Jeremy Siek, and John
|
||||
|
|
@ -350,6 +353,12 @@ out how to build object libraries, when needed.</p>
|
|||
from Jaakko Järvi.</li>
|
||||
</ul>
|
||||
|
||||
<h3><a name="IO">Input/Output</a></h3>
|
||||
<ul>
|
||||
<li><a href="io/doc/ios_state.html">io state savers</a> - Save I/O state to
|
||||
prevent jumbled data, from Daryle Walker.</li>
|
||||
</ul>
|
||||
|
||||
<h3><a name="Inter-language">Inter-language</a> support</h3>
|
||||
|
||||
<ul>
|
||||
|
|
@ -438,6 +447,6 @@ libraries will soon be either submitted for formal review or removed.</p>
|
|||
<hr>
|
||||
|
||||
<p>Revised <!--webbot bot="Timestamp" s-type="EDITED"
|
||||
s-format="%d %b %Y" startspan -->06 May 2002<!--webbot bot="Timestamp" i-checksum="15116" endspan --></p>
|
||||
s-format="%d %b %Y" startspan -->09 May 2002<!--webbot bot="Timestamp" i-checksum="15122" endspan --></p>
|
||||
</body>
|
||||
</html>
|
||||
Loading…
Add table
Reference in a new issue