headers
Hartmut Kaiser | 4 Oct 15:00

[Review] Phoenix review results

Hi all,

the Phoenix review is over and I counted 15 votes, 11 of which vote for
acceptance and 4 vote for conditional acceptance. Let me explain.

All reviewers stated that the outstanding quality of the library and its
documentation fully merit immediate acceptance. There is no direct concern
with regard to the library itself. Phoenix V2 is already in the Boost
distribution as a Spirit sub-library and has matured for a long time,
proving its stability and usability.

On the other hand, Phoenix provides functionality already covered by
Boost.Bind and Boost.Lambda. It is the general intention to use Phoenix as
the development ground for a new unified Boost library in this area. The
review discussions revealed quite some details and certain problems which
have to be resolved for this merger to happen. Joel has a full list of these
details and promised to address all of them before adding Phoenix to the
Boost SVN.

The library authors made clear from the beginning that the review of the
current Version 2 of the library is just a stepping stone towards this goal.
At the same time Eric Niebler presented a first version of a Proto based
Phoenix rewrite (referenced as Phoenix V3). It is the general consensus to
use Phoenix V3 as the basis for further development. At the same time
Phoenix V3 exposes the same interface as Phoenix V2 and passes all related
tests. 

This review formally was about Phoenix V2, but largely turned out to be a
discussion of the future of Bind/Lambda and how Boost should go forward in
this direction. Again, the general consensus here is that a) we need a
(Continue reading)

Permalink | Reply | 5 comments |
headers
Hartmut Kaiser | 22 Sep 01:55

[Review] Phoenix review starts today, September 21st

Hi all,

The review of Joel de Guzmans and Dan Marsdens Phoenix V2 library starts
today, September 21st 2008, and will end on September 30th. 
I really hope to see your vote and your participation in the discussions on
the Boost mailing lists!

---------------------------------------------------

About the library:

The Phoenix library enables FP techniques such as higher order functions,
lambda (unnamed functions), currying (partial function
application) and lazy evaluation in C++. The focus is more on usefulness and
practicality than purity, elegance and strict adherence to FP principles.

History: Phoenix is a mature library from years of use as a sub-project
under Spirit where it serves its purpose for semantic action handling.
Phoenix predates Lambda's acceptance into Boost, but not Lambda itself. When
Lambda was reviewed, it was concluded that both libraries were to be merged,
and work on it began, culminating in Phoenix V2, what you are seeing now (an
interesting offshoot of this effort is Boost.Fusion. We needed a powerful
tuple facility with algorithms to get the design right). Recently, Eric
Niebler did a (fully compatible) port to proto making use of boost.typeof
for result type deduction. Eric's port, while significant, will not be the
subject of the review, but can be regarded as the future of Phoenix (Phoenix
V3).

Phoenix V2 is currently a utility library included with Spirit V2 and
therefore is already available from the latest Boost distributions (headers:
(Continue reading)

Permalink | Reply | 65 comments |
headers
Martin Vuille | 15 Sep 17:23

[review] FSM Library review result

This is a summary of the comments received during the
review of Andrey Semashev's Finite State Machines (FSM)
library. Apologies for the delay in getting these out.

DOCUMENTATION

* Relocate ToC to make it stand out.
* Several people used the Wikipedia article
  http://en.wikipedia.org/wiki/Finite_state_machine as
  a reference for FSM terminology and operation, and
  found discrepancies between Boost.FSM and that description.
  Perhaps Boost.FSM should explicitly describe its FSM
  metamodel, or refer to an existing metamodel (Wikipedia
  FSM or Harel or UML Statechart, for example). The latter
  was mentioned several times as being preferred since it
  is a standard.
* If possible, use standard terminology. For example,
  "transition map" vs. "state transition table". Or
  define the non-standard terms.
* Include a comprehensive rationale mapping the design
  choices to the design objectives.
* Compare/contrast Boost.FSM with the FSM implementation
  as described in "C++ Template Metaprogramming".
* Add an example of event deferral using boost::function.
* Clarify support for multithreading vs. asynchronous FSM,
  as some were confused by existing text.
* Clarify lifetime of objects.
* Add implementation of example using transition map/STT.
* Add more complex example(s).
(Continue reading)

Permalink | Reply | 0 comments |
headers
Martin Vuille | 5 Sep 16:32

[review] FSM Library review result

This is a brief report of the results of the review of
Andrey Semashev's Finite State Machines (FSM) library.
I want to do justice to the discussions that took place,
and will follow-up with a complete summary next week.

In spite of a good amount of discussion and an extension
of the review period, the number of reviews was smaller
than I had hoped for. Nonetheless, I believe that the library
received an adequate review and, based on the review comments
and other discussions, the FSM library cannot be accepted
into Boost at this time.

A total of four reviews were submitted, as follows:

   Andrea Carbone: YES
   Phil Endecott: NO
   Jeff Flinn: NO
   Chris Knight: NO

Darryl Green also submitted a mini-review, which did not
include an explicit yes or no vote, but expressed doubt
about whether the library should be accepted.

On the positive side, several people noted that the goals
of the library (simplicity and greater performance than
Boost.StateCharts) were valid and that such a library was
needed in some applications. I personally support this view.

I would like to thank Andrey for his efforts in developing
the library. I would like to encourage him to pursue the
(Continue reading)

Permalink | Reply | 3 comments |
headers
Jaakko Järvi | 1 Sep 07:26

[review] Dataflow Review starts today, September 1st

The review of Stjepan Rajko's Dataflow library starts today, September 1st, 
and will run until September 10th.

---------------------------------------------------------
Description of the library:

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.

This review focuses on the Dataflow.Signals layer of the library. For
its data transport mechanism, Dataflow.Signals uses Boost.Signals
which can be used to make lasting dataflow connections based on
function calls. Dataflow.Signals provides the following to facilitate
signals-based dataflow networks:

* A number of useful general-purpose components, and building blocks
  for implementing new components.
* Various free functions and operators for connecting and using components.

The library documentation provides some concrete examples of how
Dataflow.Signals layer can be used. Some examples are:

* Implementing distributed dataflow applications using
  Dataflow.Signals and Boost.Asio
* An image processing network using Dataflow.Signals and Boost.GIL
* A GUI dataflow editor (located in the Dataflow.Blueprint documentation)
(Continue reading)

Permalink | Reply | 0 comments |
headers
Beman Dawes | 29 Aug 18:21

[filesystem][xpressive] Hotfix patches available for 1.36.0

Hotfix patches are available to fix Boost.Filesystem and Boost.Xpressive 
[1.36.0] problems. See 
http://svn.boost.org/trac/boost/wiki/ReleasePractices/HotFixes

Providing hotfix patches is something new and experimental for Boost. 
Please let us know on the users or developers mailing list if you find 
the patches useful or have other comments.

Thanks,

--Beman
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce
Permalink | Reply | 0 comments |
headers
Martin Vuille | 27 Aug 16:21

[review] FSM Review ends today

The formal review for Andrey Semashev's Finite State Machines
(FSM) ends today.

If anyone is working on a review, please post it no later than
Friday. I will post the results of the review early next week.

Thanks to everyone who participated in the review.

MV

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce
Permalink | Reply | 0 comments |
headers
Martin Vuille | 20 Aug 17:49

[review] FSM Review extended until August 27th

By request, the formal review for Andrey Semashev's Finite
State Machines (FSM) library has been extended and will run
until August 27th.

This is your last chance to submit a review and cast your
vote for or against inclusion of this library into Boost.

The documentation (overview and reference) is available online:
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/state_machine.html
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/reference.html

The current submission is available from the sandbox vault at 
http://tinyurl.com/yjozfn (or 
http://www.boostpro.com/vault/index.php?action=downloadfile&filename=FSM.zip
&directory=&PHPSESSID=48493076c1ea60ae316f7b60f15b9ed1,
if you prefer.)

-----------
Description
-----------

"The main goals of the library are:

* Simplicity. It should be very simple to create state machine
  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 the
  existing state machine, and this addition should be relatively
(Continue reading)

Permalink | Reply | 1 comment |
headers
Martin Vuille | 19 Aug 02:21

[review] FSM Second Call for Reviews

The formal review for Andrey Semashev's Finite State Machines (FSM) 
library has been running for a week now and continues until the 20th.

There have been some lively discussions about the library, but no
one has yet entered an explicit yes or no vote. If there are no votes
either way, the FSM library submission will be rejected by default.

If you wish to review, but don't have time before the review period
ends on the 20th, please let me know as it may be possible to extend
the review period.

And, finally, a reminder to include an explicit "for" or "against"
vote in your review.

-----------

The documentation (overview and reference) is available online:
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/state_machine.html
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/reference.html

The current submission is available from the sandbox vault at 
http://tinyurl.com/yjozfn (or 
http://www.boostpro.com/vault/index.php?action=downloadfile&filename=FSM.zip
&directory=&PHPSESSID=48493076c1ea60ae316f7b60f15b9ed1,
if you prefer.)

There has already been some discussion of the library
since the rewiew was first announced:
http://www.nabble.com/FSM-Review-Announcement-to18820219.html
http://www.nabble.com/FSM-Review-Reminder-to18890305.html
(Continue reading)

Permalink | Reply | 26 comments |
headers
Beman Dawes | 15 Aug 03:04

Boost 1.36.0 release notice

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

This release include four new libraries:

* Accumulators: Framework for incremental calculation, and collection
  of statistical accumulators, from Eric Niebler.

* Exception: A library for transporting of arbitrary data in exception
  objects, and transporting of exceptions between threads, from
  Emil Dotchevski.

* Units: Zero-overhead dimensional analysis and unit/quantity
  manipulation and conversion, from Matthias Schabel and Steven Watanabe

* Unordered: Unordered associative containers, from Daniel James.

Updated libraries include Asio, Assign, Function, Hash, Interprocess, 
Intrusive, Math, MPI, Multi-index Containers, PtrContainer, Spirit, 
Thread, Wave, and Xpressive.

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

One note of caution: the initial SourceForge release files were missing 
some of the documentation. If you downloaded before 16:00 UTC, August 
14th, please download again to be sure to get the full distribution. 
Sorry for the inconvenience!

--Beman Dawes
(Continue reading)

Permalink | Reply | 29 comments |
headers
Martin Vuille | 11 Aug 13:56

[review] FSM Review Starts Today August 11th

The formal review for Andrey Semashev's Finite State Machines (FSM) 
library begins today and will run until the 20th.

The documentation (overview and reference) is available online:
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/state_machine.html
http://boost-extension.redshoelace.com/docs/boost/fsm/doc/reference.html

The current submission is available from the sandbox vault at 
http://tinyurl.com/yjozfn (or 
http://www.boostpro.com/vault/index.php?action=downloadfile&filename=FSM.zip
&directory=&PHPSESSID=48493076c1ea60ae316f7b60f15b9ed1,
if you prefer.)

There has already been some discussion of the library
since the rewiew was first announced:
http://www.nabble.com/FSM-Review-Announcement-to18820219.html
http://www.nabble.com/FSM-Review-Reminder-to18890305.html

-----------
Description
-----------

"The main goals of the library are:

* Simplicity. It should be very simple to create state machine
  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 the
(Continue reading)

Permalink | Reply | 2 comments |

Gmane