Oliver Kowalke

Needed

Boost Vault

Formerly called Thread Pool The library provides: * thread creation policies:

• determines the management of worker threads:
• fixed set of threads in pool
• create workerthreads on demand (depending on context)
• let worker threads ime out after certain idle time

• channel policies: manages access to queued tasks:

  • bounded channel with high and low watermark for queuing tasks
  • unbounded channel with unlimited number of queued tasks
  • rendezvous syncron hand-over between producer and consumer threads

• queueing policy: determines how tasks will be removed from channel:

  • FIFO
  • LIFO
  • priority queue (attribute assigned to task)
  • smart insertions and extractions (for instance remove oldest task with certain attribute by newest one)

• tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library).

• returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> this_thread::interruption_point() ).

Vicente Botet

Needed

Boost Vault

Generic explicit conversion between unrelated types.

Boost.Conversion provides:

• a generic convert_to function which can be specialized by the user to make explicit conversion between unrelated types.
• a generic assign_to function which can be specialized by the user to make explicit assignation between unrelated types.
• conversion between std::complex of explicitly convertible types.
• conversion between std::pair of explicitly convertible types.
• conversion between boost::optional of explicitly convertible types.
• conversion between boost::rational of explicitly convertible types.
• conversion between boost::interval of explicitly convertible types.
• conversion between boost::chrono::time_point and boost::ptime.
• conversion between boost::chrono::duration and boost::time_duration.

Steven Ross

Needed

Boost Vault

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 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort.

Vladimir Batov

Needed

Boost Vault

The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide:

• throwing and non-throwing conversion-failure behavior;
• support for the default value to be returned when conversion fails;
• two types of the conversion-failure check -- basic and better/safe;
• formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.);
• locale support;
• support for boost::range-compliant char and wchar_t-based string containers;
• no DefaultConstructibility requirement for the Target type;
• consistent framework to uniformly incorporate any type-to-type conversions.

It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc.

Joachim Faulhaber

http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_2_0.zip&directory=Containers

http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html

Needed

The Interval Template Library (Itl) provides intervals and two kinds of interval containers: Interval_sets and interval_maps. Interval_sets and maps can be used just as sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks: intervals. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time.

Interval containers allow for intersection with interval_sets to work with segmentation. For instance you might want to intersect an interval container with a grid of months and then iterate over those months.

Finally interval_maps provide aggregation on associated values, if added intervals overlap with intervals that are stored in the interval_map. This feature is called aggregate on overlap. It is shown by example:

typedef set<string> guests;
interval_map<time, guests> party;
guests mary; mary.insert("Mary");
guests harry; harry.insert("Harry");
party += make_pair(interval<time>::rightopen(20:00, 22:00),mary);
party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry);
// party now contains
[20:00, 21:00)->{"Mary"}
[21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap
[22:00, 23:00)->{"Harry"}

As can be seen from the example an interval_map has both a decompositional behavior (on the time dimension) as well as a accumulative one (on the associated values).

Frederic Bron

Needed

http://svn.boost.org/trac/boost/browser/sandbox/type_traits

The purpose of the addition is to add type traits to detect if types T and U are comparable in the sense of <, <=, >, >=, == or != operators, i.e. if t<u has a sens when t is of type T and u of type U (same for <=, >, >=, ==, !=).

The following traits are added:

is_equal_to_comparable<T,U> is_greater_comparable<T,U> is_greater_equal_comparable<T,U> is_less_comparable<T,U> is_less_equal_comparable<T,U> is_not_equal_to_comparable<T,U>

The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard).

The code has the following properties: * returns true if t<u is meaningful and returns a value convertible to bool * returns false if t<u is meaningless. * fails with compile time error if t<u is meaningful and returns void (a possibility to avoid compile time error would be to return true with an operator, trick but this has little sens as returning false would be better)

Vicente J. Botet Escriba

Needed

Boost Vault

Boost.InterThreads extends Boost.Threads adding some features:

• thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit.
• thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one.
• thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program.
• thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time.
• set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that.
• thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer.
• thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer.

(thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz.

Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples.

Vicente J. Botet Escriba

Needed

http://svn.boost.org/svn/boost/sandbox/bitfield with documentation available at http://svn.boost.org/svn/boost/sandbox/bitfield/libs/integer/doc/index.html

Portable bitfields traits. Boost.Bitfield consists of:

• a generic bitfield traits class providing generic getter and setter methods.
• a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions.

Tim Blechmann

Needed

http://www.boostpro.com/vault/index.php?action=downloadfile&amp;filename=boost_lockfree-241109.zip&amp;directory=Concurrent%20Programming&amp;

http://tim.klingt.org/boost_lockfree/

boost.lockfree provides implementations of lock-free data structures. lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines.

boost.lockfree provides:

• boost::lockfree::fifo, a lock-free fifo queue
• boost::lockfree::stack, a lock-free stack

the code is available from from my personal git repository:

• git://tim.klingt.org/boost_lockfree.git
• http://tim.klingt.org/git?p=boost_lockfree.git

Tim Blechmann

A library, based on Boost.Serialization, that provides access to persistent objects with an interface as close as possible to accessing regular objects in memory.

• object ownership concepts equivalent to the ones used by Boost.SmartPtr: shared, weak, scoped (and raw)
• ACID transactions, including recovery after a crash and "Serializable" isolation level
• concurrent transactions, nested transactions, distributed transactions
• concurrent access containers: STL containers whose nodes are implemented as persistent objects and can be accessed without moving the container to memory. Concurrent transactions modifying the container are only repeated in the rare cases the same container node is changed simultanisouly by 2 threads.
• extensible by other transactional resources, e.g. an object relational mapper based on the upcoming Boost.Rdb library. Multiple resources can be combined to one database, with distributed transactions among them.

Please let us know of any libraries you are currently developing that you intend to submit for review.