From: garcia_at_[hidden]
Date: 2008-08-30 11:53:12
Author: garcia
Date: 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
New Revision: 48475
URL: http://svn.boost.org/trac/boost/changeset/48475
Log:
Adding the original source for the wizard report html files to the Boost
repository (for archival purposes).
Added:
website/public_html/live/development/report-apr-2006.rst (contents, props changed)
website/public_html/live/development/report-apr-2008.rst (contents, props changed)
website/public_html/live/development/report-jan-2006.rst (contents, props changed)
website/public_html/live/development/report-may-2008.rst (contents, props changed)
website/public_html/live/development/report-nov-2007.rst (contents, props changed)
website/public_html/live/development/report-sep-2007.rst (contents, props changed)
Added: website/public_html/live/development/report-apr-2006.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-apr-2006.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,219 @@
+============================================
+Review Wizard Status Report for April 2006
+============================================
+
+News
+====
+
+April 1, 2006 -- The "Promotion Traits" Review Begins (Fast-Track)
+Proposal to add promote, integral_promotion and
+floating_point_promotion class templates to type_traits library.
+
+April 6, 2006 -- The "Function Types" Review Begins (Fast-Track)
+This library provides a metaprogramming facility
+to classify, decompose and synthesize function-, function pointer-,
+function reference- and member function pointer types.
+
+March 22, 2006 -- Asio Accepted
+Announcement: http://listarchives.boost.org/Archives/boost/2006/03/102287.php
+
+February 17, 2006 - Shared Memory Library Accepted
+Announcement: http://listarchives.boost.org/boost-announce/2006/02/0083.php
+
+February 5, 2006 - Fixed String Library Rejected
+Announcement: http://listarchives.boost.org/boost-announce/2006/02/0081.php
+
+We need experienced review managers. Please take a look at
+the list of libraries in need of managers and check out their
+descriptions. If you can serve as review manager for any of
+them, email Ron Garcia or Tom Brinkman "garcia at cs dot indiana dot edu"
+and "reportbase at gmail dot com" respectively.
+
+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 before we do that, please email Ron or Tom.
+
+If you're library author and plan on submitting a library for review
+in the next 3-6 months, send Ron or Tom a
+short description of your library and we'll add it to the
+Libraries Under Construction below. We know that there are many
+libaries that are near completion, but we have hard time keeping
+track all of them. Please keep us informed about your progress.
+
+Review Queue
+============
+
+ * Promotion Traits - April 1, 2006 (fast-track)
+ * Function Types - April 6, 2006 (fast-track)
+ * Fusion
+ * Pimpl Pointer
+ * Property Tree
+ * Physical Quantities System
+ * Intrusive Containers
+
+--------------------
+
+Function Types (mini-re-review)
+-------------------------------
+ :Author: Tobias Schwinger
+ :Review Manager: Tom Brinkman
+
+ :Download:
+ http://boost-sandbox.sourceforge.net/vault/
+
+ :Description:
+ This library provides a metaprogramming facility to classify,
+ decompose and synthesize function-, function pointer-, function
+ reference- and member function pointer types. For the purpose of
+ this documentation, these types are collectively referred to as
+ function types (this differs from the standard definition and
+ redefines the term from a programmer's perspective to refer to
+ the most common types that involve functions).
+
+ The classes introduced by this library shall conform to the
+ concepts of the Boost Metaprogramming library (MPL).
+
+ The Function Types library enables the user to:
+ * test an arbitrary type for being a function type of specified kind,
+ * inspect properties of function types,
+ * view and modify sub types of an encapsulated function type with
+ MPL Sequence operations, and
+ * synthesize function types.
+
+ This library supports variadic functions and can be configured
+ to support non-default calling conventions.
+
+
+Promotion Traits
+----------------
+ :Author: Alexander Nasonov
+ :Review Manager: Tobias Schwinger
+
+ :Download:
+ http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz
+
+ :Description:
+ Proposal to add promote, integral_promotion and
+ floating_point_promotion class templates to type_traits library.
+
+ Alexander tried it on different compilers with various success:
+ GNU/Linux (gentoo-hardened): gcc 3.3 and 3.4, Intel 7, 8 and 9
+ Windows: VC7 free compiler
+ Sparc Solaris: Sun C++ 5.3 and 5.7
+
+ See comments at the beginning of
+ promote_enum_test.cpp for what is broken.
+
+
+Intrusive Containers
+--------------------
+ :Author: Olaf Krzikalla
+ :Review Manager: Thorsten Ottosen
+
+ :Download:
+ http://people.freenet.de/turtle++/intrusive.zip
+
+ :Description:
+ While intrusive containers were and are widely used in C, they became
+ more and more forgotten in the C++-world due to the presence of the
+ standard containers, which don't support intrusive
+ techniques. Boost.Intrusive not only reintroduces this technique to
+ C++, but also encapsulates the implementation in STL-like
+ interfaces. Hence anyone familiar with standard containers can use
+ intrusive containers with ease.
+
+
+Fusion
+------
+ :Author: Joel de Guzman
+ :Review Manager: Ron Garcia
+
+ :Download:
+ http://spirit.sourceforge.net/dl_more/fusion_v2/
+ http://spirit.sourceforge.net/dl_more/fusion_v2.zip
+
+ :Description:
+ Fusion is a library of heterogenous containers and views and
+ algorithms. A set of heterogenous containers (vector, list, set and
+ map) is provided out of the box along with view classes that present
+ various composable views over the data. The containers and views
+ follow a common sequence concept with an underlying iterator concept
+ that binds it all together, suitably making the algorithms fully
+ generic over all sequence types.
+
+ The architecture is somewhat modeled after MPL which in turn is
+ modeled after STL. It is code-named "fusion" because the library is
+ the "fusion" of compile time metaprogramming with runtime programming.
+
+
+Pimpl Pointer
+-------------
+ :Author: Asger Mangaard
+ :Review Manager: Need Volunteer
+
+ :Download:
+ Boost Sandbox (http://boost-consulting.com/vault/) under pimpl_ptr.
+
+ :Description:
+ The pimpl idiom is widely used to reduce compile times and disable
+ code coupling. It does so by moving private parts of a class from the
+ .hpp file to the .cpp file.
+ However, it's implementation can be tricky, and with many pitfalls
+ (especially regarding memory management).
+ The pimpl_ptr library is a single header file, implementing a special
+ policy based smart pointer to greately ease the implementation of the
+ pimpl idiom.
+
+
+Property Tree
+-------------
+ :Author: Marcin Kalicinski
+ :Review Manager: Need Volunteer
+
+ :Download:
+ Boost Sandbox Vault - property_tree_rev4.zip
+ http://kaalus.atspace.com/ptree
+
+ :Description:
+ Property tree is a data structure - a tree of (key, value)
+ pairs. It differs from its cousin, "usual" property map, because
+ it is hierarchical, not linear. Thus, it is more like a
+ minimalistic Document Object Model, but not bound to any
+ specific file format. It can store contents of XML files,
+ windows registry, JSON files, INI files, even command line
+ parameters. The library contains parsers for all these formats,
+ and more.
+
+
+Physical Quantities System
+--------------------------
+ :Author: Andy Little
+ :Review Manager: Need Volunteer
+
+ :Download:
+ http://tinyurl.com/7m5l8
+
+ :Description:
+ PQS (Physical Quantities System) is used for modelling
+ physical-quantities in C++ programs. The advantages over using
+ built-in types in the role include: trapping errors in
+ dimensional analysis, detailed semantic specifications for
+ reliable and repeatable conversions between units and
+ self-documentation of source code. PQS is based around the
+ principles and guidelines of the International System of Units
+ (SI). The library predefines a large number of quantities,
+ physical and maths constants using a common syntax. The library
+ also includes (or will soon include) classes for manipulating
+ quantities algebraically, for example angles (radians,
+ steradians, degrees,minutes,seconds) and vectors, matrices and
+ quaternions for more advanced modelling of physical systems.
+
+Libraries under development
+===========================
+
+Geometry Library - Author - Andy Little (?)
+
+C2_functions Library - Author - Marcus Mendenhall
+
+Please let us know of any libraries you are currently
+developing that you intend to submit for review.
Added: website/public_html/live/development/report-apr-2008.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-apr-2008.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,296 @@
+==========================================
+Review Wizard Status Report for April 2008
+==========================================
+
+News
+====
+
+December 7 - Forward Library Accepted - Awaiting SVN
+
+December 16 - Unordered Containers Library Accepted - In SVN
+
+December 21 - Factory Library Accepted - Awaiting SVN
+
+January 13 - Switch Library Accepted Provisionally - Awaiting submission for
+mini review
+
+January 18 - Singleton Library Rejected - Awaiting resubmission, John Torjo
+has already volunteered to manage the next review
+
+January 30 - Flyweight Library Accepted - Awaiting SVN
+
+February 13 - Logging Library Rejected - Awaiting resubmission for new
+review, John Torjo has already resubmitted and Gennadiy Rozental has again
+volunteered to manage the review
+
+February 27 - Floating Point Utilities Library Accepted - Awaiting SVN
+
+March 14 - Proto Library Accepted - Exists as a component in xpressive, but
+not yet as a separate library
+
+April 20 - Egg review ongoing
+
+
+Older Issues
+============
+
+The Scope Exit review report has not been submitted. John Phillips will step
+in as substitute review manager and produce a report
+
+The binary_int library, accepted in October 2005 has not yet been submitted
+to SVN. The authors are strongly encouraged to contact the review wizards
+
+The Accumulators library, accepted in February 2007 has not yet been
+submitted to SVN
+
+The Quantitative Units library, accepted in April 2007 has not yet been
+submitted to SVN
+
+The Globally Unique Identifier library, accepted provisionally in May 2007
+has not yet been submitted for mini-review and full acceptance
+
+The Time Series Library, accepted in August 2007 has not yet been submitted
+to SVN
+
+The Exception library, accepted in October 2007 is in SVN
+
+For libraries that are still waiting to get into SVN, please get them
+ready and into the repository. The developers did some great work
+making the libraries, so don't miss the chance to share that work with
+others. Also notice that the review process page has been updated with
+a section on rights and responsibilities of library submitters.
+
+For the Scope Exit review, we would like to publicly apologize to Alexander
+Nasonov for how long this has languished without a report. The review
+wizards will work to make sure this doesn't happen any more.
+
+
+General Announcements
+=====================
+
+As always, we need experienced review managers. In the past few months there
+have been a large number of reviews, but the flow of high quality
+submissions is just as big, 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 or
+library contributors. If you can serve as review manager for any of them,
+email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu" and
+"phillips at mps dot ohio-state dot edu" respectively.
+
+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 before we do that,
+please email Ron or John.
+
+If you're a library author and plan on submitting a library for review in the
+next 3-6 months, send Ron or John a short description of your library and
+we'll add it to the Libraries Under Construction below. We know that there
+are many libraries that are near completion, but we have hard time keeping
+track all of them. Please keep us informed about your progress.
+
+Review Queue
+============
+
+* Finite State Machines
+* Property Map (fast-track)
+* Graph (fast-track)
+* Lexer
+* Thread-Safe Signals
+* Boost.Range (Update)
+* Shifted Pointer
+* DataFlow Signals
+* Logging
+* Futures
+
+--------------------
+
+
+Finite State Machines
+---------------------
+:Author: Andrey Semashev
+:Review Manager: Martin Vuille
+:Download: `Boost Sandbox Vault <http://tinyurl.com/yjozfn>`__
+
+:Description:
+
+ The Boost.FSM library is an implementation of FSM (stands for
+ Finite State Machine) programming concept. The main goals of the
+ library are:
+
+ * Simplicity. It should be very simple to create state machines using
+ this library.
+ * Performance. The state machine infrastructure should not be
+ very time and memory-consuming in order to be applicable in
+ more use cases.
+ * Extensibility. A developer may want to add more states to an
+ existing state machine. A developer should also be able to
+ specify additional transitions and events for the machine with
+ minimum modifications to the existing code.
+
+
+Property Map (fast-track)
+-------------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Property Map Library,
+ including:
+
+ * A constant-valued property map, useful for naturally unweighted
+ graphs.
+ * A noop-writing property map, useful when you have to provide an
+ argument, but just don't care about the output.
+ * See
+ `ChangeLog <http://svn.boost.org/trac/boost/browser/sandbox/graph-v2/libs/property_map/ChangeLog>`__
+ for details.
+
+
+Graph (fast-track)
+------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Graph Library,
+ including:
+
+ * Two new graph classes (undirected and directed) which are intended
+ to make the library more approachable for new developers
+ * A suite of graph measures including degree and closeness
+ centrality, mean geodesic distance, eccentricity, and clustering
+ coefficients.
+ * An algorithm for visiting all cycles in a directed graph (Tiernan's
+ from 1970ish). It works for undirected graphs too, but reports cycles
+ twice (one for each direction).
+ * An algorithm for visiting all the cliques a graph (Bron&Kerbosch).
+ Works for both directed and undirected.
+ * Derived graph measures radius and diameter (from eccentricity) and
+ girth and circumference (from Tiernan), and clique number (from
+ Bron&Kerbosch).
+ * An exterior_property class that helps hides some of the weirdness
+ with exterior properties.
+ * runtime and compile-time tests for the new algorithms.
+ * a substantial amount of documentation
+ * Graph cores, implemented by David Gleich (@Stanford University)
+ * Deterministic graph generators - capable of creating or inducing
+ specific types of graphs over a vertex set (e.g., star graph, wheel
+ graph, prism graph, etc). There are several other specific types that
+ could be added to this, but I haven't had the time just yet.
+
+
+Lexer
+-----
+:Author: Ben Hanson
+
+:Review Manager: Need Volunteer
+
+:Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing&>`__
+
+:Description:
+
+ A programmable lexical analyser generator inspired by 'flex'.
+ Like flex, it is programmed by the use of regular expressions
+ and outputs a state machine as a number of DFAs utilising
+ equivalence classes for compression.
+
+
+Thread-Safe Signals
+-------------------
+:Author: Frank Hess
+
+:Review Manager: Need Volunteer
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=thread_safe_signals>`__
+
+:Description: A thread-safe implementation of Boost.Signals that
+ has some interface changes to accommodate thread safety, mostly with
+ respect to automatic connection management.
+
+
+Boost.Range (Update)
+--------------------
+:Author: Neil Groves
+
+:Review Manager: Needed
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=range_ex.zip&directory=>`__
+
+:Description: A significant update of the range library, including
+ range adapters.
+
+Shifted Pointer
+---------------
+:Author: Phil Bouchard
+
+:Review Manager: Needed
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=Memory>`__
+
+:Description: Smart pointers are in general optimized for a specific
+ resource (memory usage, CPU cycles, user friendliness, ...) depending
+ on what the user need to make the most of. The purpose of this smart
+ pointer is mainly to allocate the reference counter (or owner) and
+ the object itself at the same time so that dynamic memory management
+ is simplified thus accelerated and cheaper on the memory map.
+
+
+DataFlow Signals
+----------------
+:Author: Stjepan Rajko
+
+:Review Manager: Needed
+
+:Download: http://dancinghacker.com/code/dataflow/
+
+:Description: Dataflow is a generic library for dataflow programming.
+ Dataflow programs can typically be expressed as a graph in which vertices
+ represent components that process data, and edges represent the flow of data
+ between the components. As such, dataflow programs can be easily
+ reconfigured by changing the components and/or the connections.
+
+
+Logging
+-------
+:Author: John Torjo
+
+:Review Manager: Gennadiy Rozental
+
+:Download: http://torjo.com/log2/
+
+:Description:
+ Used properly, logging is a very powerful tool. Besides aiding
+ debugging/testing, it can also show you how your application is
+ used. The Boost Logging Library allows just for that, supporting
+ a lot of scenarios, ranging from very simple (dumping all to one
+ destination), to very complex (multiple logs, some enabled/some
+ not, levels, etc). It features a very simple and flexible
+ interface, efficient filtering of messages, thread-safety,
+ formatters and destinations, easy manipulation of logs, finding
+ the best logger/filter classes based on your application's
+ needs, you can define your own macros and much more!
+
+
+Futures
+-------
+:Author: Braddock Gaskill
+
+:Review Manager: Needed
+
+:Download: http://braddock.com/~braddock/future/
+
+:Description: The goal of the boost.future library is to provide a definitive
+ future implementation with the best features of the numerous
+ implementations, proposals, and academic papers floating around, in the
+ hopes to avoid multiple incompatible future implementations in libraries of
+ related concepts (coroutines, active objects, asio, etc). This library hopes
+ to explore the combined implementation of the best future concepts.
+
+
+
+
+
+
+
+
+
Added: website/public_html/live/development/report-jan-2006.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-jan-2006.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,245 @@
+============================================
+Review Wizard Status Report for January 2006
+============================================
+
+
+News
+====
+
+Happy New Year! Here are some statistics regarding Boost Library
+reviews in 2005:
+
+ * 12 Libraries were reviewed
+ * 8 Libraries were accepted
+ * 1 Library (Function Types) was accepted pending a mini-review
+ * 2 Libraries were rejected
+ * 1 Library has yet to receive a final verdict (ASIO)
+
+
+Policy Pointer has been removed from the review queue because the author has
+stated that it is not quite ready.
+
+We need review managers. Please take a look at the list of libraries
+in need of managers and check out their descriptions. If you can
+serve as review manager for any of them, send one of us an email.
+
+
+Note:
+ If you have any suggestions about how we could improve
+ the Review Wizard's status report,
+ please email "reportbase at gmail dot com"
+ and "garcia at cs dot indiana dot edu".
+
+
+Review Managers Needed
+======================
+
+There are a few libraries in the review queue in need
+of review managers. If you would like to volunteer to be a review
+manager, please contact Ron or Tom.
+
+The following libraries still require review managers:
+
+ * Fusion
+ * Shmem
+ * Pimpl Pointer
+ * Type Traits (modification)
+ * Function Types
+
+
+
+Review Queue
+============
+
+ * Fixed Strings - January 19 2006 - January 28 2006
+
+ * Intrusive Containers
+ * Function Types (mini-re-review)
+ * Shmem
+ * Fusion
+ * Pimpl Pointer
+ * Type Traits (modification)
+
+--------------------
+
+Fixed Strings
+-------------
+ :Author: Reece Dunn
+ :Review Manager: Harmut Kaiser
+
+ :Download:
+ Boost Sandbox (http://boost-sandbox.sourceforge.net/) under fixed_string
+
+ :Description:
+ The fixed string library provides buffer overrun protection for static
+ sized strings (char s[ n ]). It provides a C-style string
+ interface for compatibility with C code (for
+ example, porting a C program to C++).
+ There is also a std::string-style interface using a class based on
+ flex_string by Andre Alexandrescu with a few limitations due to the
+ non-resizable nature of the class.
+
+
+Intrusive Containers
+--------------------
+ :Author: Olaf Krzikalla
+ :Review Manager: to be determined
+
+ :Download:
+ http://people.freenet.de/turtle++/intrusive.zip
+
+ :Description:
+ While intrusive containers were and are widely used in C, they became
+ more and more forgotten in the C++-world due to the presence of the
+ standard containers, which don't support intrusive
+ techniques. Boost.Intrusive not only reintroduces this technique to
+ C++, but also encapsulates the implementation in STL-like
+ interfaces. Hence anyone familiar with standard containers can use
+ intrusive containers with ease.
+
+
+Function Types (mini-re-review)
+-------------------------------
+ :Author: Tobias Schwinger
+ :Review Manager: to be determined
+
+ :Download:
+ http://boost-sandbox.sourceforge.net/vault/
+
+ :Description:
+ This library provides a metaprogramming facility
+ to classify, decompose and synthesize function-,
+ function pointer-, function reference- and
+ member function pointer types. For the purpose
+ of this documentation, these types are
+ collectively referred to as function
+ types (this differs from the standard
+ definition and redefines the term from
+ a programmer's perspective to refer to
+ the most common types that involve functions).
+
+ The classes introduced by this library
+ shall conform to the concepts of the
+ Boost Metaprogramming library (MPL).
+
+ The Function Types library enables the user to:
+ * test an arbitrary type for
+ being a function type of specified kind,
+ * inspect properties of function types,
+ * view and modify sub types of an
+ encapsulated function type with
+ MPL Sequence operations, and
+ * synthesize function types.
+
+ This library supports variadic functions and
+ can be configured to support
+ non-default calling conventions.
+
+
+Shmem
+-----
+ :Author: Ion Gaztanaga
+ :Review Manager: to be determined
+
+ :Download:
+ Boost Sandbox Vault -> Memory (http://boost-sandbox.sourceforge.net/vault/index.php?direction=0&order=&directory=Memory)
+
+ http://ice.prohosting.com/newfunk/boost/libs/shmem/doc/html/index.html
+
+ :Description:
+ Shmem offers tools to simplify shared memory usage in
+ applications. These include shared memory creation/destruction and
+ synchronization objects. It also implements dynamic allocation of
+ portions of a shared memory segment and an easy way to construct C++
+ objects in shared memory.
+
+ Apart from this, Shmem implements a wide range of STL-like containers
+ and allocators that can be safely placed in shared memory, helpful to
+ implement complex shared memory data-bases and other efficient
+ inter-process communications.
+
+
+Fusion
+------
+ :Author: Joel de Guzman
+ :Review Manager: to be determined
+
+ :Download:
+ http://spirit.sourceforge.net/dl_more/fusion_v2/
+ http://spirit.sourceforge.net/dl_more/fusion_v2.zip
+
+ :Description:
+ Fusion is a library of heterogenous containers and views and
+ algorithms. A set of heterogenous containers (vector, list, set and
+ map) is provided out of the box along with view classes that present
+ various composable views over the data. The containers and views
+ follow a common sequence concept with an underlying iterator concept
+ that binds it all together, suitably making the algorithms fully
+ generic over all sequence types.
+
+ The architecture is somewhat modeled after MPL which in turn is
+ modeled after STL. It is code-named "fusion" because the library is
+ the "fusion" of compile time metaprogramming with runtime programming.
+
+
+Pimpl Pointer
+-------------
+ :Author: Asger Mangaard
+ :Review Manager: to be determined
+
+ :Download:
+ Boost Sandbox (http://boost-consulting.com/vault/) under pimpl_ptr.
+
+ :Description:
+ The pimpl idiom is widely used to reduce compile times and disable
+ code coupling. It does so by moving private parts of a class from the
+ .hpp file to the .cpp file.
+ However, it's implementation can be tricky, and with many pitfalls
+ (especially regarding memory management).
+ The pimpl_ptr library is a single header file, implementing a special
+ policy based smart pointer to greately ease the implementation of the
+ pimpl idiom.
+
+
+Type_Traits (modification)
+--------------------------
+ :Author: Alexander Nasonov
+ :Review Manager: to be determined
+
+ :Download:
+ http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz
+ or http://cpp-experiment.sourceforge.net/promote-20050917/
+
+ :Description:
+ Proposal to add promote, integral_promotion and
+ floating_point_promotion class templates to type_traits library.
+
+ Alexander tried it on different compilers with various success:
+ GNU/Linux (gentoo-hardened): gcc 3.3 and 3.4, Intel 7, 8 and 9
+ Windows: VC7 free compiler
+ Sparc Solaris: Sun C++ 5.3 and 5.7
+
+ See comments at the beginning of promote_enum_test.cpp for what is broken.
+ http://cpp-experiment.sourceforge.net/promote-20050917/libs/type_traits/test/promote_enum_test.cpp
+
+ Alexander requests a fast-track review.
+
+
+
+
+Libraries under development
+===========================
+
+Property Tree
+-------------
+ :Author: Marcin Kalicinski
+
+ :Download:
+ Boost Sandbox Vault (http://boost-consulting.com/vault/)
+ property_tree_rev3.zip
+
+
+Please let us know of any libraries you are currently
+developing that you intend to submit for review.
+
+
Added: website/public_html/live/development/report-may-2008.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-may-2008.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,396 @@
+==========================================
+Review Wizard Status Report for May 2008
+==========================================
+
+News
+====
+
+December 7, 2007 - Forward Library Accepted - Awaiting SVN
+
+December 16 - Unordered Containers Library Accepted - In SVN
+
+December 21 - Factory Library Accepted - Awaiting SVN
+
+January 13, 2008 - Switch Library Accepted Provisionally - Awaiting submission for
+mini review
+
+January 18 - Singleton Library Rejected - Awaiting resubmission, John Torjo
+has already volunteered to manage the next review
+
+January 30 - Flyweight Library Accepted - Awaiting SVN
+
+February 13 - Logging Library Rejected - Awaiting resubmission for new
+review, John Torjo has already resubmitted and Gennadiy Rozental has again
+volunteered to manage the review
+
+February 27 - Floating Point Utilities Library Accepted - Awaiting SVN
+
+March 14 - Proto Library Accepted - Exists as a component in Xpressive, but
+not yet as a separate library
+
+April 20 - Egg review completed - Results pending
+
+May 7 - Scope Exit Library Accepted - Awaiting SVN
+
+
+Older Issues
+============
+
+The binary_int library, accepted in October 2005 has not yet been submitted
+to SVN. The authors are strongly encouraged to contact the review wizards
+
+The Quantitative Units library, accepted in April 2007 has not yet been
+submitted to SVN
+
+The Globally Unique Identifier library, accepted provisionally in May 2007
+has not yet been submitted for mini-review and full acceptance
+
+The Time Series Library, accepted in August 2007 has not yet been submitted
+to SVN
+
+The Accumulators library, accepted in February 2007 is in SVN
+
+The Exception library, accepted in October 2007 is in SVN
+
+The Scope Exit review report had not been submitted by the review
+manager. John Phillips stepped in as substitute review manager and
+produced a report
+
+
+
+For libraries that are still waiting to get into SVN, please get them
+ready and into the repository. The developers did some great work
+making the libraries, so don't miss the chance to share that work with
+others. Also notice that the review process page has been updated with
+a section on rights and responsibilities of library submitters.
+
+For the Scope Exit review, we would like to publicly apologize to Alexander
+Nasonov for how long this has languished without a report. The review
+wizards will work to make sure this doesn't happen any more.
+
+
+General Announcements
+=====================
+
+As always, we need experienced review managers. In the past few months there
+have been a large number of reviews, but the flow of high quality
+submissions is just as big, 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 or
+library contributors. If you can serve as review manager for any of them,
+email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu" and
+"phillips at mps dot ohio-state dot edu" respectively.
+
+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 before we do that,
+please email Ron or John.
+
+If you're a library author and plan on submitting a library for review in the
+next 3-6 months, send Ron or John a short description of your library and
+we'll add it to the Libraries Under Construction below. We know that there
+are many libraries that are near completion, but we have hard time keeping
+track all of them. Please keep us informed about your progress.
+
+Review Queue
+============
+
+* Finite State Machines
+* Property Map (fast-track)
+* Graph (fast-track)
+* Lexer
+* Thread-Safe Signals
+* Boost.Range (Update)
+* Shifted Pointer
+* DataFlow Signals
+* Logging
+* Futures (Braddock Gaskill)
+* Futures (Anthony Williams)
+* Join (Yigong Liu)
+* Pimpl (Vladimir Batov)
+
+--------------------
+
+
+Finite State Machines
+---------------------
+:Author: Andrey Semashev
+:Review Manager: Martin Vuille
+:Download: `Boost Sandbox Vault <http://tinyurl.com/yjozfn>`__
+
+:Description:
+
+ The Boost.FSM library is an implementation of FSM (stands for
+ Finite State Machine) programming concept. The main goals of the
+ library are:
+
+ * Simplicity. It should be very simple to create state machines using
+ this library.
+ * Performance. The state machine infrastructure should not be
+ very time and memory-consuming in order to be applicable in
+ more use cases.
+ * Extensibility. A developer may want to add more states to an
+ existing state machine. A developer should also be able to
+ specify additional transitions and events for the machine with
+ minimum modifications to the existing code.
+
+
+Property Map (fast-track)
+-------------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Property Map Library,
+ including:
+
+ * A constant-valued property map, useful for naturally unweighted
+ graphs.
+ * A noop-writing property map, useful when you have to provide an
+ argument, but just don't care about the output.
+ * See
+ `ChangeLog <http://svn.boost.org/trac/boost/browser/sandbox/graph-v2/libs/property_map/ChangeLog>`__
+ for details.
+
+
+Graph (fast-track)
+------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Graph Library,
+ including:
+
+ * Two new graph classes (undirected and directed) which are intended
+ to make the library more approachable for new developers
+ * A suite of graph measures including degree and closeness
+ centrality, mean geodesic distance, eccentricity, and clustering
+ coefficients.
+ * An algorithm for visiting all cycles in a directed graph (Tiernan's
+ from 1970ish). It works for undirected graphs too, but reports cycles
+ twice (one for each direction).
+ * An algorithm for visiting all the cliques a graph (Bron&Kerbosch).
+ Works for both directed and undirected.
+ * Derived graph measures radius and diameter (from eccentricity) and
+ girth and circumference (from Tiernan), and clique number (from
+ Bron&Kerbosch).
+ * An exterior_property class that helps hides some of the weirdness
+ with exterior properties.
+ * run-time and compile-time tests for the new algorithms.
+ * a substantial amount of documentation
+ * Graph cores, implemented by David Gleich (@Stanford University)
+ * Deterministic graph generators - capable of creating or inducing
+ specific types of graphs over a vertex set (e.g., star graph, wheel
+ graph, prism graph, etc). There are several other specific types that
+ could be added to this, but I haven't had the time just yet.
+
+
+Lexer
+-----
+:Author: Ben Hanson
+
+:Review Manager: Eric Neibler
+
+:Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing&>`__
+
+:Description:
+
+ A programmable lexical analyser generator inspired by 'flex'.
+ Like flex, it is programmed by the use of regular expressions
+ and outputs a state machine as a number of DFAs utilising
+ equivalence classes for compression.
+
+
+Thread-Safe Signals
+-------------------
+:Author: Frank Hess
+
+:Review Manager: Need Volunteer
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=thread_safe_signals>`__
+
+:Description: A thread-safe implementation of Boost.Signals that
+ has some interface changes to accommodate thread safety, mostly with
+ respect to automatic connection management.
+
+
+Boost.Range (Update)
+--------------------
+:Author: Neil Groves
+
+:Review Manager: Needed
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=range_ex.zip&directory=>`__
+
+:Description: A significant update of the range library, including
+ range adapters.
+
+Shifted Pointer
+---------------
+:Author: Phil Bouchard
+
+:Review Manager: Needed
+
+:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=Memory>`__
+
+:Description: Smart pointers are in general optimized for a specific
+ resource (memory usage, CPU cycles, user friendliness, ...) depending
+ on what the user need to make the most of. The purpose of this smart
+ pointer is mainly to allocate the reference counter (or owner) and
+ the object itself at the same time so that dynamic memory management
+ is simplified thus accelerated and cheaper on the memory map.
+
+
+DataFlow Signals
+----------------
+:Author: Stjepan Rajko
+
+:Review Manager: Needed
+
+:Download: http://dancinghacker.com/code/dataflow/
+
+:Description: Dataflow is a generic library for dataflow programming.
+ Dataflow programs can typically be expressed as a graph in which vertices
+ represent components that process data, and edges represent the flow of data
+ between the components. As such, dataflow programs can be easily
+ reconfigured by changing the components and/or the connections.
+
+
+Logging
+-------
+:Author: John Torjo
+
+:Review Manager: Gennadiy Rozental
+
+:Download: http://torjo.com/log2/
+
+:Description:
+ Used properly, logging is a very powerful tool. Besides aiding
+ debugging/testing, it can also show you how your application is
+ used. The Boost Logging Library allows just for that, supporting
+ a lot of scenarios, ranging from very simple (dumping all to one
+ destination), to very complex (multiple logs, some enabled/some
+ not, levels, etc). It features a very simple and flexible
+ interface, efficient filtering of messages, thread-safety,
+ formatters and destinations, easy manipulation of logs, finding
+ the best logger/filter classes based on your application's
+ needs, you can define your own macros and much more!
+
+
+Futures
+-------
+:Author: Braddock Gaskill
+
+:Review Manager: Needed
+
+:Download: http://braddock.com/~braddock/future/
+
+:Description: The goal of the boost.future library is to provide a definitive
+ future implementation with the best features of the numerous
+ implementations, proposals, and academic papers floating around, in the
+ hopes to avoid multiple incompatible future implementations in libraries of
+ related concepts (coroutines, active objects, asio, etc). This library hopes
+ to explore the combined implementation of the best future concepts.
+
+
+Futures
+-------
+:Author: Anthony Williams
+
+:Review Manager: Needed
+
+:Download: http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp (code)
+ http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2561.html (description)
+
+:Description:
+
+ This paper proposes a kind of return buffer that takes a
+ value (or an exception) in one (sub-)thread and provides the value in
+ another (controlling) thread. This buffer provides essentially two
+ interfaces:
+
+ * an interface to assign a value as class promise and
+
+ * an interface to wait for, query and retrieve the value (or exception)
+ from the buffer as classes unique_future and shared_future. While a
+ unique_future provides move semantics where the value (or exception)
+ can be retrieved only once, the shared_future provides copy semantics
+ where the value can be retrieved arbitrarily often.
+
+ A typical procedure for working with promises and futures looks like:
+
+ * control thread creates a promise,
+ * control thread gets associated future from promise,
+ * control thread starts sub-thread,
+ * sub-thread calls actual function and assigns the return value to the promise,
+ * control thread waits for future to become ready,
+ * control thread retrieves value from future.
+
+ Also proposed is a packaged_task that wraps one callable object and
+ provides another one that can be started in its own thread and assigns
+ the return value (or exception) to a return buffer that can be
+ accessed through one of the future classes.
+
+ With a packaged_task a typical procedure looks like:
+
+ * control thread creates a packaged_task with a callable object,
+ * control thread gets associated future from packaged_task,
+ * control thread starts sub-thread, which invokes the packaged_task,
+ * packaged_task calls the callable function and assigns the return value,
+ * control thread waits for future to become ready,
+ * control thread retrieves value from future.
+
+Notice that we are in the unusual position of having two very
+different libraries with the same goal in the queue at the same
+time. The Review Wizards would appreciate a discussion of the best way
+to hold these two reviews to produce the best possible addition to
+Boost.
+
+
+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: `Boost Sandbox Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=Pimpl.zip&directory=&>`__
+ http://www.ddj.com/cpp/205918714 (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.
+
+
+Libraries under development
+===========================
+
+
+Please let us know of any libraries you are currently
+developing that you intend to submit for review.
+
+
+
+
Added: website/public_html/live/development/report-nov-2007.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-nov-2007.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,319 @@
+==============================================
+Review Wizard Status Report for November 2007
+==============================================
+
+News
+====
+
+November 7, 2007 - Exception Library Accepted
+ Announcement: http://listarchives.boost.org/boost-users/2007/11/31912.php
+
+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 or library
+contributors. If you can serve as review manager for any of them,
+email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu"
+and "jphillip at capital dot edu" respectively.
+
+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 before we do that, please email Ron or John.
+
+If you're library author and plan on submitting a library for review
+in the next 3-6 months, send Ron or John a short description of your
+library and we'll add it to the Libraries Under Construction below.
+We know that there are many libraries that are near completion, but we
+have hard time keeping track all of them. Please keep us informed
+about your progress.
+
+Review Queue
+============
+
+* Finite State Machines
+* Floating Point Utilities
+* Switch
+* Property Map (fast-track)
+* Graph (fast-track)
+* Forward (fast-track)
+* Singleton (fast-track)
+* Factory (fast-track)
+* Lexer
+* Thread-Safe Signals
+* Logging
+* Flyweight
+* Unordered Containers
+
+--------------------
+
+
+Finite State Machines
+---------------------
+:Author: Andrey Semashev
+:Review Manager: Martin Vuille
+:Download: `Boost Sandbox Vault <http://tinyurl.com/yjozfn>`__
+
+:Description:
+
+ The Boost.FSM library is an implementation of FSM (stands for
+ Finite State Machine) programming concept. The main goals of the
+ library are:
+
+ * Simplicity. It should be very simple to create state machines using
+ this library.
+ * Performance. The state machine infrastructure should not be
+ very time and memory-consuming in order to be applicable in
+ more use cases.
+ * Extensibility. A developer may want to add more states to an
+ existing state machine. A developer should also be able to
+ specify additional transitions and events for the machine with
+ minimum modifications to the existing code.
+
+
+Floating Point Utilities
+------------------------
+:Author: Johan Råde
+:Review Manager: Need Volunteer
+:Download:
+ `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?directory=Math%20-%20Numerics>`__
+
+:Description: The Floating Point Utilities library contains the following:
+
+ * Floating point number classification functions: fpclassify, isfinite,
+ isinf, isnan, isnormal (Follows TR1)
+ * Sign bit functions: signbit, copysign, changesign (Follows TR1)
+ * Facets that format and parse infinity and NaN according to the C99
+ standard (These can be used for portable handling of infinity and NaN
+ in text streams).
+
+
+Switch
+------
+:Author: Steven Watanabe
+:Review Manager: Need Volunteer
+:Download:
+ `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=mcs_units_v0.7.1.zip&directory=Units>`__
+
+:Description:
+ The built in C/C++ switch statement is very efficient. Unfortunately,
+ unlike a chained if/else construct there is no easy way to use it when
+ the number of cases depends on a template parameter. The Switch library
+ addresses this issue.
+
+
+Property Map (fast-track)
+-------------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Property Map Library,
+ including:
+
+ * A constant-valued property map, useful for naturally unweighted
+ graphs.
+ * A noop-writing property map, useful when you have to provide an
+ argument, but just don't care about the output.
+ * See
+ `ChangeLog <http://svn.boost.org/trac/boost/browser/sandbox/graph-v2/libs/property_map/ChangeLog>`__
+ for details.
+
+
+Graph (fast-track)
+------------------
+:Author: Andrew Sutton
+:Review Manager: Jeremy Siek
+:Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+:Description:
+ A number of additions and modifications to the Graph Library,
+ including:
+
+ * Two new graph classes (undirected and directed) which are intended
+ to make the library more approachable for new developers
+ * A suite of graph measures including degree and closeness
+ centrality, mean geodesic distance, eccentricity, and clustering
+ coefficients.
+ * An algorithm for visiting all cycles in a directed graph (Tiernan's
+ from 1970ish). It works for undirected graphs too, but reports cycles
+ twice (one for each direction).
+ * An algorithm for visiting all the cliques a graph (Bron&Kerbosch).
+ Works for both directed and undirected.
+ * Derived graph measures radius and diameter (from eccentricity) and
+ girth and circumference (from Tiernan), and clique number (from
+ Bron&Kerbosch).
+ * An exterior_property class that helps hides some of the weirdness
+ with exterior properties.
+ * runtime and compile-time tests for the new algorithms.
+ * a substantial amount of documentation
+ * Graph cores, implemented by David Gleich (@Stanford University)
+ * Deterministic graph generators - capable of creating or inducing
+ specific types of graphs over a vertex set (e.g., star graph, wheel
+ graph, prism graph, etc). There are several other specific types that
+ could be added to this, but I haven't had the time just yet.
+
+
+Forward (fast-track)
+--------------------
+:Author: Tobias Schwinger
+
+:Review Manager: John Torjo
+
+:Download: http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files
+
+:Description: A brute-force solution to the forwarding problem.
+
+Singleton (fast-track)
+----------------------
+:Author: Tobias Schwinger
+
+:Review Manager: John Torjo
+
+:Download: http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files
+
+:Description: Three thread-safe Singleton templates with an
+ easy-to-use interface.
+
+
+Factory (fast-track)
+--------------------
+:Author: Tobias Schwinger
+
+:Review Manager: John Torjo
+
+:Download: http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files
+
+:Description: Generic factories.
+
+
+Lexer
+-----
+:Author: Ben Hanson
+
+:Review Manager: Need Volunteer
+
+:Download: http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing&
+
+:Description:
+
+ A programmable lexical analyser generator inspired by 'flex'.
+ Like flex, it is programmed by the use of regular expressions
+ and outputs a state machine as a number of DFAs utilising
+ equivalence classes for compression.
+
+
+Thread-Safe Signals
+-------------------
+:Author: Frank Hess
+
+:Review Manager: Need Volunteer
+
+:Download: http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=thread_safe_signals
+
+:Description: A thread-safe implementation of Boost.signals that
+ has some interface changes to accommodate thread safety, mostly with
+ respect to automatic connection management.
+
+
+Logging
+-------
+:Author: John Torjo
+
+:Review Manager: Need Volunteer
+
+:Download: http://torjo.com/log2/
+
+:Description:
+ Used properly, logging is a very powerful tool. Besides aiding
+ debugging/testing, it can also show you how your application is
+ used. The Boost Logging Library allows just for that, supporting
+ a lot of scenarios, ranging from very simple (dumping all to one
+ destination), to very complex (multiple logs, some enabled/some
+ not, levels, etc). It features a very simple and flexible
+ interface, efficient filtering of messages, thread-safety,
+ formatters and destinations, easy manipulation of logs, finding
+ the best logger/filter classes based on your application's
+ needs, you can define your own macros and much more!
+
+
+Flyweight
+---------
+:Author: Joaquín M López Muñoz
+
+:Review Manager: Need Volunteer
+
+:Download: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=flyweight.zip&directory=Patterns
+
+:Description: Flyweights are small-sized handle classes granting
+ constant access to shared common data, thus allowing for the
+ management of large amounts of entities within reasonable memory
+ limits. Boost.Flyweight makes it easy to use this common
+ programming idiom by providing the class template flyweight<T>,
+ which acts as a drop-in replacement for const T.
+
+
+Unordered Containers
+--------------------
+:Author: Daniel James
+
+:Review Manager: Need Volunteer
+
+:Download: http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=unordered.zip&directory=Containers
+
+:Description: An implementation of the unordered containers specified
+ in TR1, with most of the changes from the recent draft standards.
+
+
+
+Libraries under development
+===========================
+
+Dataflow
+--------
+:Author: Stjepan Rajko
+
+:Description:
+ The Dataflow library provides generic support for data
+ producers, consumers, and connections between the two. It also
+ provides layers for several specific dataflow mechanisms, namely
+ Boost.Signals, VTK data/display pipelines, and plain
+ pointers. The Dataflow library came out of the Signal Network
+ GSoC project, mentored by Doug Gregor.
+
+:Status:
+ I am polishing the Dataflow library for submission, and am expecting
+ to add it to the review queue in the next couple of months.
+ I am currently ironing out some faults in the design of the library,
+ filling in missing features, and testing it on / adapting it to
+ different dataflow mechanisms (currently VTK and soon
+ Boost.Iostreams). As soon as I'm pretty sure that things are going
+ the right way, I'll submit this to the review queue while I do the
+ finishing touches.
+
+
+Constrained Value
+-----------------
+:Author: Robert Kawulak
+
+:Download:
+ http://rk.go.pl/f/constrained_value.zip
+
+ http://rk.go.pl/r/constrained_value (Documentation)
+
+:Description:
+ The Constrained Value library contains class templates
+ useful for creating constrained objects. The simplest example
+ of a constrained object is hour. The only valid values for an hour
+ within a day are integers from the range [0, 23]. With this library,
+ you can create a variable which behaves exactly like int, but does
+ not allow for assignment of values which do not belong to the
+ allowed range. The library doesn't focus only on constrained
+ objects that hold a value belonging to a specified range (i.e.,
+ bounded objects). Virtually any constraint can be imposed using
+ appropriate predicate. You can specify what happens in case of
+ assignment of an invalid value, e.g. an exception may be thrown or
+ the value may be adjusted to meet the constraint criterions.
+
+:Status: I'm planning to finish it in 1-2 months.
+
+
+Please let us know of any libraries you are currently
+developing that you intend to submit for review.
Added: website/public_html/live/development/report-sep-2007.rst
==============================================================================
--- (empty file)
+++ website/public_html/live/development/report-sep-2007.rst 2008-08-30 11:53:11 EDT (Sat, 30 Aug 2008)
@@ -0,0 +1,227 @@
+==============================================
+Review Wizard Status Report for September 2007
+==============================================
+
+News
+====
+
+August 17, 2007 -- Time Series Accepted.
+ Announcement: http://listarchives.boost.org/boost-announce/2007/08/0142.php
+
+July 24, 2007 -- Boost Version 1.34.1 Released.
+ This is a bug fix release addressing many problems with the 1.34.0 release.
+ Announcement: http://svn.boost.org/trac/boost/query?status=closed&milestone=Boost+1.34.1
+
+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 or library
+contributors. If you can serve as review manager for any of them,
+email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu"
+and "jphillip at capital dot edu" respectively.
+
+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 before we do that, please email Ron or John.
+
+If you're library author and plan on submitting a library for review
+in the next 3-6 months, send Ron or John a short description of your
+library and we'll add it to the Libraries Under Construction below.
+We know that there are many libraries that are near completion, but we
+have hard time keeping track all of them. Please keep us informed
+about your progress.
+
+Review Queue
+============
+
+ * Exception
+ * Finite State Machines
+ * Floating Point Utilities
+ * Switch
+ * Property Map (fast-track)
+ * Graph (fast-track)
+
+--------------------
+
+
+Exception
+---------
+ :Author: Emil Dotchevski
+ :Review Manager: Need Volunteer
+
+ :Download:
+ http://www.revergestudios.com/boost-exception/boost-exception.zip
+
+ :Description:
+ The purpose of this library is to free designers of
+ exception classes from having to consider what data needs to be
+ stored in exception objects in order for the catch site to be
+ able to make sense of what went wrong.
+
+ When the exception class is used, arbitrary values can be stored
+ in any exception. This can be done directly in the
+ throw-expression, or at a later time as the exception object
+ propagates up the call stack. The ability to add data to any
+ exception object after it has been thrown is important, because
+ often some of the information needed to handle an exception is
+ unavailable at the time of the throw.
+
+
+Finite State Machines
+---------------------
+ :Author: Andrey Semashev
+ :Review Manager: Martin Vuille
+ :Download: `Boost Sandbox Vault <http://tinyurl.com/yjozfn>`__
+
+ :Description:
+
+ The Boost.FSM library is an implementation of FSM (stands for
+ Finite State Machine) programming concept. The main goals of the
+ library are:
+
+ * Simplicity. It should be very simple to create state machines using
+ this library.
+ * Performance. The state machine infrastructure should not be
+ very time and memory-consuming in order to be applicable in
+ more use cases.
+ * Extensibility. A developer may want to add more states to an
+ existing state machine. A developer should also be able to
+ specify additional transitions and events for the machine with
+ minimum modifications to the existing code.
+
+
+Floating Point Utilities
+------------------------
+ :Author: Johan Råde
+ :Review Manager: Need Volunteer
+ :Download:
+ `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?directory=Math%20-%20Numerics>`__
+
+ :Description: The Floating Point Utilities library contains the following:
+
+ * Floating point number classification functions: fpclassify, isfinite,
+ isinf, isnan, isnormal (Follows TR1)
+ * Sign bit functions: signbit, copysign, changesign (Follows TR1)
+ * Facets that format and parse infinity and NaN according to the C99
+ standard. (These can be used for portable handling of infinity and NaN
+ in text streams.)
+
+
+Switch
+------
+ :Author: Steven Watanabe
+ :Review Manager: Need Volunteer
+ :Download:
+ `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=mcs_units_v0.7.1.zip&directory=Units>`__
+
+ :Description:
+ The built in C/C++ switch statement is very efficient. Unfortunately,
+ unlike a chained if/else construct there is no easy way to use it when
+ the number of cases depends on a template parameter. The Switch library
+ addresses this issue.
+
+
+Property Map (fast-track)
+-------------------------
+ :Author: Andrew Sutton
+ :Review Manager: Jeremy Siek
+ :Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+ :Description:
+ A number of additions and modifications to the Property Map Library,
+ including:
+
+ * A constant-valued property map, useful for naturally unweighted
+ graphs.
+ * A noop-writing property map, useful when you have to provide an
+ argument, but just don't care about the output.
+ * See
+ `ChangeLog <http://svn.boost.org/trac/boost/browser/sandbox/graph-v2/libs/property_map/ChangeLog>`__
+ for details.
+
+
+Graph (fast-track)
+------------------
+ :Author: Andrew Sutton
+ :Review Manager: Jeremy Siek
+ :Download: http://svn.boost.org/svn/boost/sandbox/graph-v2
+ :Description:
+ A number of additions and modifications to the Graph Library,
+ including:
+
+ * Two new graph classes (undirected and directed) which are intended
+ to make the library more approachable for new developers
+ * A suite of graph measures including degree and closeness
+ centrality, mean geodesic distance, eccentricity, and clustering
+ coefficients.
+ * An algorithm for visiting all cycles in a directed graph (Tiernan's
+ from 1970ish). It works for undirected graphs too, but reports cycles
+ twice (one for each direction).
+ * An algorithm for visiting all the cliques a graph (Bron&Kerbosch).
+ Works for both directed and undirected.
+ * Derived graph measures radius and diameter (from eccentricity) and
+ girth and circumference (from Tiernan), and clique number (from
+ Bron&Kerbosch).
+ * An exterior_property class that helps hides some of the weirdness
+ with exterior properties.
+ * runtime and compile-time tests for the new algorithms.
+ * a substantial amount of documentation
+ * Graph cores, implemented by David Gleich (@Stanford University)
+ * Deterministic graph generators - capable of creating or inducing
+ specific types of graphs over a vertex set (e.g., star graph, wheel
+ graph, prism graph, etc). There are several other specific types that
+ could be added to this, but I haven't had the time just yet.
+
+
+Libraries under development
+===========================
+
+Dataflow
+--------
+ :Author: Stjepan Rajko
+
+ :Description:
+ The Dataflow library provides generic support for data
+ producers, consumers, and connections between the two. It also
+ provides layers for several specific dataflow mechanisms, namely
+ Boost.Signals, VTK data/display pipelines, and plain
+ pointers. The Dataflow library came out of the Signal Network
+ GSoC project, mentored by Doug Gregor.
+
+ :Status:
+ I am polishing the Dataflow library for submission, and am expecting
+ to add it to the review queue in the next couple of months.
+ I am currently ironing out some faults in the design of the library,
+ filling in missing features, and testing it on / adapting it to
+ different dataflow mechanisms (currently VTK and soon
+ Boost.Iostreams). As soon as I'm pretty sure that things are going
+ the right way, I'll submit this to the review queue while I do the
+ finishing touches.
+
+
+Constrained Value
+-----------------
+ :Author: Robert Kawulak
+
+ :Download:
+ http://rk.go.pl/f/constrained_value.zip
+
+ http://rk.go.pl/r/constrained_value (Documentation)
+
+ :Description:
+ The Constrained Value library contains class templates
+ useful for creating constrained objects. The simplest example
+ of a constrained object is hour. The only valid values for an hour
+ within a day are integers from the range [0, 23]. With this library,
+ you can create a variable which behaves exactly like int, but does
+ not allow for assignment of values which do not belong to the
+ allowed range. The library doesn't focus only on constrained
+ objects that hold a value belonging to a specified range (i.e.,
+ bounded objects). Virtually any constraint can be imposed using
+ appropriate predicate. You can specify what happens in case of
+ assignment of an invalid value, e.g. an exception may be thrown or
+ the value may be adjusted to meet the constraint criterions.
+
+ :Status: I'm planning to finish it in 1-2 months.
+
+
+Please let us know of any libraries you are currently
+developing that you intend to submit for review.