Emil Dotchevski

Need Volunteer

http://www.revergestudios.com/boost-exception/boost-exception.zip

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.

Andrey Semashev

Martin Vuille

Boost Sandbox Vault

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.

Need Volunteer

Boost Sandbox Vault

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.)

Andrew Sutton

Jeremy Siek

http://svn.boost.org/svn/boost/sandbox/graph-v2

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 for details.

Andrew Sutton

Jeremy Siek

http://svn.boost.org/svn/boost/sandbox/graph-v2

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.

Robert Kawulak

http://rk.go.pl/f/constrained_value.zip

http://rk.go.pl/r/constrained_value (Documentation)

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.

I'm planning to finish it in 1-2 months.