Re: [boost] Review Wizard Report for December 2013

Subject: Re: [boost] Review Wizard Report for December 2013
From: Edward Diener (eldiener_at_[hidden])
Date: 2013-12-19 10:13:09

On 12/19/2013 7:52 AM, Ron Garcia wrote:
>
> ==============================================
> Review Wizard Status Report for December 2013
> ==============================================
>
> News
> ====
>
> 1. Boost 1.54.0 Released. New Libraries: Log, TTI, Type Erasure.
> 2. Boost 1.55.0 Released. New Libraries: Predef.
> 3. Type Index Accepted Provisionally. November 2013.
> 4. Boost repository moves to Git and GitHub. December 2013.
>
> Open Issues
> ===========
>
> The following libraries have review managers, but have not yet been
> scheduled for review:
>
> * Range Extensions - added May 2012; review manager: Neil Groves.
>
> The following libraries have been accepted to Boost, but have not yet
> been submitted to SVN:
>
> * Constrained Value - accepted September 2010; author: Robert Kawulak.
> * Contract - accepted September 2012; author: Lorenzo Caminiti.
>
> The following libraries have been accepted and submitted to SVN, but
> have not yet appeared in a release:
>
> * none
>
> The following libraries have been accepted provisionally to Boost, but
> have not been submitted for mini-review and full acceptance:
>
> * Endian - accepted provisionally November 2011; author: Beman Dawes.
> * Type Index - accepted provisionally November 2013; author: Antony Polukhin
>
>
> General Announcements
> =====================
>
> As always, we need experienced review managers.  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 ubc dot ca" and "johnphillipsithica at gmail dot com" 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 www.boost.org. If you would
> like us to make any modifications or additions to this report, 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)
> * Sorting (M)
> * Quaternions, Vectors, Matrices (M)
> * Variadic Macro Data (M)
> * Block Pointer (M)
> * Singularity (M)
> * Extended Complex Numbers (M)
> * Metaparse (M)
> * Range Extensions
> * Nowide (M)
> * Array (M)
> * STL Extensions (M)
> * Countertree (M)
> * Process (M)
> * Asynchronous File I/O (M)
> * Application (M)
> * Fiber
>
> ``(M)`` marks libraries that need review managers.
>
> --------------------
>
>
>
>
> Join
> ----
> :Author: Yigong Liu
>
> :Review Manager: Needed
>
> :Download: http://channel.sourceforge.net/
>
> :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.
>
>
> Pimpl
> -----
> :Author: Vladimir Batov
>
> :Review Manager: Needed
>
> :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip
>
> :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.
>
>
> Sorting
> -------
> :Author: Steven Ross
>
> :Review Manager: Needed
>
> :Download: https://github.com/boost-vault/Sorting
>
> :Description:
>   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.
>
>
> Quaternions, Vectors, Matrices
> ------------------------------
> :Author: Emil Dotchevski
>
> :Review Manager: Needed
>
> :Download: http://www.revergestudios.com/boost-qvm/
>
> :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.
>
>
> Variadic Macro Data
> -------------------
> :Author: Edward Diener
>
> :Review Manager: Needed
>
> :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__
>
> :Description:
>   This 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.

The Download and Description for VMD are both incorrect.