Boost logo

Boost Announcement :

Subject: [Boost-announce] Review Wizard Report for May 2011
From: Ronald Garcia (rxg_at_[hidden])
Date: 2011-05-23 10:26:03

Review Wizard Status Report for May 2011


1. Process Library Rejected

2. Phoenix Library Accepted

3. XInt Library Rejected

4. Type Traits Extensions Accepted

5. Locale Library Accepted

6. Convert Library Withdrawn

7. Conversion Library Accepted Provisionally

8. Context Library Accepted Provisionally

9. Boost 1.46.1 Released
     Revised Libraries: Asio, Filesystem, Fusion, Graph,
     ICL, Math, Polygon, Proto, Property Tree, Signals2, TR1, Unordered
     Revised Tools: Quickbook

Open Issues

The following libraries have been reviewed and await reports from their
review managers:

* AutoIndex(Tool) - reviewed May 2011; review manager: Daniel James.

The following libraries have been accepted to Boost, but have not yet
been submitted to SVN:

* GIL.IO - accepted January 2011; author: Christian Henning.
* Type Traits Extensions - accepted March 2011; author: Frederic Bron.

The following libraries have been accepted and submitted to SVN, but
have not yet appeared in a release:

* Phoenix - accepted March 2011; author: Joel de Guzmann.
* Move - accepted February 2011; author: Ion Gaztanaga.
* Geometry Library - accepted November 2009; author: Barend Gehreis et al.
* Ratio - accepted October 2010; author: Vicente Botet.
* Chrono - accepted January 2011; author: Vicente Botet.

The following libraries have been accepted provisionally to Boost, but
have not been submitted for mini-review and full acceptance:

* Switch - accepted provisionally January 2008; author: Steven Watanabe.
* Log - accepted provisionally March 2010; author: Andrey Semashev.
* Context - accepted provisionally May 2011; author: Oliver Kowalke.

General Announcements

As always, we need experienced review managers. The review schedule has
grown substantially but we have few volunteers, so manage reviews if
possible and if not please make sure to watch the review schedule and
participate. Please take a look at the list of libraries in need of
managers and check out their descriptions. In general review managers
are active boost participants, including library contributors,
infrastructure contributors, and other mailing list participants with
a substantial track record of constructive participation. If you can
serve as review manager for any of them, email Ron Garcia or John
Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot
ohio-state dot edu" respectively.

We are also suffering from a lack of reviewers. While we all
understand time pressures and the need to complete paying work, the
strength of Boost is based on the detailed and informed reviews
submitted by you. If you are interested in reviewing a library but
won't have time during the review period, you can always prepare your
review ahead of time. No rule says you can only work on a review
during the review period.

A link to this report will be posted to If you would
like us to make any modifications or additions to this report before
we do that, please email Ron or John.

The review schedule is an unordered list of the libraries awaiting
review. As such, any library on the schedule can be reviewed once the
developer is ready, a review manager has been secured, and
the manager, developer, and wizards agree on a date
to schedule the review.

Review Schedule

* Join (M)
* Pimpl (M)
* Endian
* Conversion
* Sorting (M)
* AutoBuffer
* Containers
* Lockfree
* Fiber (M)
* Quaternions, Vectors, Matrices (M)
* Stopwatches
* Variadic Macro Data (M)

* Type Traits Introspection
* Block Pointer (M)
* Heaps
* Assign v2
* Network (M)
* Algorithm
* Local (M)

``(M)`` marks libraries that need review managers.



:Author: Yigong Liu
:Review Manager: Needed
:Description: Join is an asynchronous, message based C++ concurrency
  library based on join calculus. It is applicable both to
  multi-threaded applications and to the orchestration of asynchronous,
  event-based applications. It follows Comega's design and
  implementation and builds with Boost facilities. It provides a high
  level concurrency API with asynchronous methods, synchronous methods,
  and chords which are "join-patterns" defining the synchronization,
  asynchrony, and concurrency.
:Author: Vladimir Batov
:Review Manager: Needed
:Download: | `Boost Vault <;;directory=&amp;>`__
           | (documentation)
:Description: The Pimpl idiom is a simple yet robust technique to
  minimize coupling via the separation of interface and implementation
  and then implementation hiding.   This library provides a convenient
  yet flexible and generic deployment technique for the Pimpl idiom.
  It's seemingly complete and broadly applicable, yet minimal, simple
  and pleasant to use.
:Author: Beman Dawes
:Review Manager: Joel Falcou
:Author: Vicente Botet
:Review Manager: Gordon Woodhull
:Download: `Boost Vault <;;directory=Utilities&amp;>`__
:Description: Generic explicit conversion between unrelated types.
 Boost.Conversion provides:
     * a generic ``convert_to`` function which can be specialized by the user to
       make explicit conversion between unrelated types.
     * a generic ``assign_to`` function which can be specialized by the user to
       make explicit assignation between unrelated types.
     * conversion between ``std::complex`` of explicitly convertible types.
     * conversion between ``std::pair`` of explicitly convertible types.
     * conversion between ``boost::optional`` of explicitly convertible types.
     * conversion between ``boost::rational`` of explicitly convertible types.
     * conversion between ``boost::interval`` of explicitly convertible types.
     * conversion between ``boost::chrono::time_point`` and ``boost::ptime``.
     * conversion between ``boost::chrono::duration`` and 
:Author: Steven Ross
:Review Manager: Needed
:Download: `Boost Vault <;>`__
 A grouping of 3 templated hybrid radix/comparison-based sorting
 algorithms that provide superior worst-case and average-case
 performance to std::sort: integer_sort, which sorts fixed-size data
 types that support a rightshift (default of >>) and a comparison
 (default of <) operator.   float_sort, which sorts standard
 floating-point numbers by safely casting them to integers.
 string_sort, which sorts variable-length data types, and is optimized
 for 8-bit character strings.
 All 3 algorithms have O(n(k/s + s)) runtime where k is the number of
 bits in the data type and s is a constant, and limited memory overhead
 (in the kB for realistic inputs).   In testing, integer_sort varies
 from 35% faster to 2X as fast as std::sort, depending on processor,
 compiler optimizations, and data distribution.   float_sort is roughly
 70% faster than std::sort.   string_sort is roughly 2X
 as fast as std::sort.
:Author: Thorsten Ottosen
:Review Manager: Robert Stewart
  Boost.AutoBuffer provides a container for efficient dynamic, local buffers.
  Furthermore, the container may be used as an alternative to std::vector,
  offering greater flexibility and sometimes better performance.
:Author: Ion Gaztanaga
:Review Manager: John Maddock
:Download: `Boost Vault <;;directory=Containers&amp;>`__
:Documentation: `Boost Sandbox <>`__
 Boost.Container library implements several well-known containers,
 including STL containers. The aim of the library is to offers advanced
 features not present in standard containers or to offer the latest
 standard draft features for compilers that comply with C++03.
:Author: Tim Blechmann
:Review Manager: Hartmut Kaiser
:Download: `Boost Vault <;;directory=Concurrent%20Programming&amp;>`__
 Lockfree provides implementations of lock-free data structures.
 Lock-free data structures can be accessed by multiple threads without
 the necessity of blocking synchronization primitives such as guards.
 Lock-free data structures can be used in real-time systems, where
 blocking algorithms may lead to high worst-case execution times, to
 avoid priority inversion, or to increase the scalability for
 multi-processor machines.
 Lockfree provides:
  * boost::lockfree::fifo, a lock-free fifo queue
  * boost::lockfree::stack, a lock-free stack
:Author: Oliver Kowalke
:Review Manager: Needed
:Download: `Boost Vault <;;directory=Concurrent%20Programming&amp;>`__
:Description: C++ Library for launching fibers (micro-threads) and
 synchronizing data between the fibers.
Quaternions, Vectors, Matrices
:Author: Emil Dotchevski
:Review Manager: Needed
:Description: QVM defines a set of generic functions and
    operator overloads for working with quaternions, vectors and matrices
    of static size. The library also defines vector and matrix data types,
    however it allows users to introduce their own types by specializing
    the q_traits, v_traits and m_traits templates.
:Author: Vicente Botet
:Review Manager: Anthony Williams
:Download: `Boost Vault <;;directory=System>`__
   On top of the standard facilities of Boost.Chrono, Stopwatches provides:
   * Stopwatches: A facility to measure elapsed time with the ability to
     start, stop, suspend, or resume measurement.
     * Stopwatch concept
     * Scoped helper classes allowing to pairwise start/stop operations,
       suspend/resume and resume/suspend a Stopwatch.
     * stopwatch, model of Stopwatch capturing elapsed Clock times.
     * stopwatch_accumulator, model of Stopwatch capturing accumulated
       elapsed Clock times.
   * Stopclocks: a complete time reporting package that can be invoked in
     a single line of code.
     * stopwatch_reporter, convenient reporting to an output stream
       (including wide char streams) of the elapsed time of models of
       Stopwatch results.
     * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>>
Variadic Macro Data
:Author: Edward Diener
:Review Manager: Needed
:Download: `Boost Sandbox <>`__
  The variadic_macro_data library adds support and functionality for
  variadic macros to Boost as well as integrating variadic macros with
  the Boost PP library without changing the latter library in any way.
Type Traits Introspection
:Author: Edward Diener
:Review Manager: Joel Falcou
:Download: `Boost Sandbox <>`__
:Description: The TTI library, which is an abbreviation for the 'Type
  Traits Introspection' library, allows a programmer to introspect at
  compile time the inner elements of a C++ type. The introspection
  process depends on specifying the name of the inner element by
  different macros for different types of elements, and then using a
  generated metafunction to determine whether that element exists within
  the enclosing type. The inner elements which can be introspected are
  type, class template, member data, member function, static member
  data, and static member function.
Block Pointer
:Author: Phil Bouchard
:Review Manager: Needed
:Download: `Boost Sandbox <>`__
:Description: Deterministic memory manager of constant complexity capable of
  handling cyclic collections.
:Author: Tim Blechmann
:Review Manager: Andrew Sutton
  The Heap library is an implementation of priority queues, data
  structures that order their elements priority. They are useful in a
  number of different applications especially graph search algorithms
  and queuing systems. Whereas the STL provides a class template
  std::priority_queue, Boost.Heap implements data structures with
  different features and performance characteristics. One key feature is
  the inclusion of "mutable" heaps, which allow the priorities of
  enqueued objects to modified and their position in the queue updated.
  The heaps in the library also support merging, stable sorting, and
  equality and less-than comparison.
Assign v2
:Author: Erwann Rogard
:Review Manager: John Bytheway
:Download: `Boost Sandbox <>`__
:Description: This library is an upgrade of Boost.Assign 1.0 that
  redefines its functionality, with optional C++0x support and new
  features. It expresses repetitive statements for assigning or
  inserting elements via a basic grammar.
:Author: Dean Michael Berris
:Review Manager: Needed
:Description: This is a library that provides application layer
  protocol support using modern C++ techniques. It is light-weight,
  fast, cross-platform and is intended to be as easy to configure as
:Author: Marshall Clow
:Review Manager: Dave Abrahams
:Download: `Boost Sandbox Vault <>`__
   Boost.Algorithm is a collection of general purpose algorithms. While
   Boost contains many libraries of data structures, there is no single
   library for general purpose algorithms. Even though the algorithms are
   generally useful, many tend to be thought of as "too small" for Boost.
   An implementation of Boyer-Moore searching, for example, might take a
   developer a week or so to implement, including test cases and
   documentation. However, scheduling a review to include that code into
   Boost might take several months, and run into resistance because "it
   is too small". Nevertheless, a library of tested, reviewed, documented
   algorithms can make the developer's life much easier, and that is the
   purpose of this library.
:Author: Lorenzo Caminiti
:Review Manager: Needed
:Download: `Boost Sandbox <>`__
:Description: This library supports local functions, local blocks, and
   local exits
Libraries under development
for a current listing of libraries under development.

Boost-announce list run by bdawes at, david.abrahams at, gregod at, cpdaniel at, john at