headers
Jaakko Järvi | 1 Sep 07:29
Picon

[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
Martin Vuille | 5 Sep 16:36

[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 | 0 comments |
headers
Martin Vuille | 15 Sep 17:24

[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
Hartmut Kaiser | 22 Sep 01:58
Picon
Gravatar

[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 | 0 comments |

Gmane