headers
Beman Dawes | 10 Feb 01:42
Picon
Favicon
Gravatar

Boost 1.38.0 released

Boost 1.38.0 has been released and is available from SourceForge. See
http://sourceforge.net/projects/boost/

This release includes three new libraries: Flyweight, ScopeExit, and Swap.

Updated Libraries: Accumulators, Any, Asio, Config, Date_Time,
Exception, Filesystem, Graph, Hash, Interprocess, Intrusive, Lexical
Cast, Math, Multi-index Containers, Proto, Regex, Thread, TR1, Type
Traits, Unordered, and Xpressive.

Other Changes: Experimental CMake build system.

You can read the full release announcement here:
http://www.boost.org/users/news/version_1_38_0

The release managers were Beman Dawes, Daniel James, Eric Niebler, and
Rene Rivera.

--Beman Dawes
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce
Permalink | Reply | 0 comments |
headers
John Maddock | 21 Feb 19:11
Picon

[1.38.0] PDF package of Boost documentation released.

Folks,

A package containing PDF versions of Boost's documentation is now available 
for Boost-1.38.0 from the usual sourceforge download site: 
http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=159715&release_id=662905

Please note that due to the diverse range of tools in use within Boost it 
has not been possible to produce PDF's for all of Boost's libraries, those 
currently included as PDF's are:

accumulators
any
array
asio
bimap
range
complex-tr1
concepts
config
conversion
date_time
foreach
function
hash
interprocess
intrusive
iterator
math-gcd
math
mpi
(Continue reading)

Permalink | Reply | 0 comments |
headers
Thorsten Ottosen | 20 Feb 13:28
Picon
Picon
Favicon

[boost] Formal Review: Boost.RangeEx

Dear Developers and Users,

It's my pleasure to announce that the review of Neil Groves' RangeEx  
library starts today and lasts until March 3, 2009.

What is it?
+++++++++++

The library provide two very useful extensions to the range library

1. Range-based algorithms. E.g.

   boost::sort( rng );

which is a convenient wrapper of instead of

   std::sort( boost::begin(rng), boost::end(rng) );

But the new interface also allows for more expressive code because
(on the fly) composition of algorithms suddenly is possible.

2. Range adaptors. E.g.

        std::vector<int> vec = ...;
        boost::copy( vec | boost::adaptors::reversed,
                     std::ostream_iterator<int>( std::cout ) );

where the expression "vec | boost::adaptors::reversed" wraps the
iterators of the range on the left in reverse iterators. The library  
provides a wide range (no pun intended) of Range adaptors, and they
(Continue reading)

Permalink | Reply | 0 comments |

Gmane