wiki:LibrariesUnderConstruction

Version 1 (modified by viboes, 14 years ago) ( diff )

Libraries Under Construction creation

  1. Libraries Under Construction
    1. Boost.AllocPlus
    2. Boost.Chono
    3. Boost.ConstantTimeSize
    4. Boost.!Dataflow
    5. Boost.Endian
    6. Boost.Extension
    7. Boost.InterThreads
    8. Boost.!ITL
    9. Boost.Log
    10. Boost.Mirror
    11. Boost.Move
    12. Boost.Process
    13. Boost.Reflection
    14. Boost.Tree
  2. Other Open Source libraries
    1. ASL
    2. TBB
  3. Libraries Under Discussion
    1. Geometry
  4. Libraries Wish list
    1. AccummulatorsExt
    2. DenseSet
    3. Frames
    4. StableVector
    5. ThreaderJoiner
  5. Abandoned

WARNING: The contents of this page could be incomplete and outdated. Please help us to improve this page by modifying it directly or posting on the Boost mailing list ​boost-AT-lists.boost.org and ​boost-users-AT-lists.boost.org.

See Boost Releases documentation for the list of libraries Boost by release. See Boost Review Schedule for Boost ongoing details.

Most of the ongoing libraries are stored on the ​SVN Sandbox, the ​Boost Vault or on specific sites.

Libraries Under Construction

This page is an index page for libraries under construction.

Boost.AllocPlus

Boost.Chono

  • Author(s): Beman Dawes
  • Version:
  • State:
  • Last upload:2008 Nov 26
  • Links: ​Boost Sandbox
  • Description: The Boost Chrono library provides:
  • The C++0x Standard Library's time utilities, including:
    • Class template duration
    • Class template time_point
    • Clocks:
      • system_clock
      • monotonic_clock
      • high_resolution_clock

  • Class template timer, with typedefs:
    • system_timer
    • monotonic_timer
    • high_resolution_timer

  • Process clocks and timers:
    • process_clock, capturing real, user-CPU, and system-CPU times.
    • process_timer, capturing elapsed real, user-CPU, and system-CPU times.
    • run_timer, convenient reporting of process_timer results.

  • The C++0x Standard Library's compile-time rational arithmetic.

Boost.ConstantTimeSize

  • Author(s): Vicente J. Botet Escriba
  • Version: 0.1
  • State: Stable
  • Last upload:2008 Oct 14
  • Links: ​Boost Vault ​Boost Sandbox
  • Description: Boost.ConstantTimeSize defines a wrapper to the stl container list giving the user the chioice for the complexity of the size function: linear time, constant time or quasi-constant.

In future versions the library could include a similar wrapper to slist.

Boost.!Dataflow

  • Author(s): Stjepan Rajko
  • State: Rewriting ongoing
  • Version:
  • Last upload:
  • Links: ​Boost Sandbox
  • Description:

Boost.Endian

  • Author(s): Beman Dawes
  • Version:
  • State:
  • Last upload:2008 Nov 26
  • Links: ​Boost Sandbox
  • Description: Provides integer-like byte-holder binary types with explicit control over byte order, value type, size, and alignment. Typedefs provide easy-to-use names for common configurations.

These types provide portable byte-holders for integer data, independent of particular computer architectures. Use cases almost always involve I/O, either via files or network connections. Although portability is the primary motivation, these integer byte-holders may also be used to reduce memory use, file size, or network activity since they provide binary integer sizes not otherwise available.

Boost.Extension

  • Author(s): Jeremy Pack
  • Version:
  • State:
  • Last upload:2008 Nov 26
  • Links: ​Blog ​Download ​Headers Boost Sandbox ​Libs Boost Sandbox
  • Description: The Boost.Extension library has been developed to ease the development of plugins and similar extensions to software using shared libraries. Classes, functions and data can be made available from shared libraries and loaded by the application.

Boost.InterThreads

  • Author(s): Vicente J. Botet Escriba
  • Version: 0.1
  • State: Not stable
  • Last upload: 2008 Nov 26
  • Links: ​Boost Vault

​Boost Sandbox

  • Description: 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 group where the number of threads is know statically and the threads are created at construction time.
  • set_once: a synchronizer 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.!ITL

  • Author(s): Joachim Faulhaber
  • Version:
  • State:
  • Last upload: 2008 Nov 26
  • Links: ​Home Page ​Online Documentation ​Boost Sandbox
  • Description: The Interval Template Library (ITL) offers intervals and two kinds of interval containers: interval_sets and interval_maps.

Boost.Log

  • Author(s): Andrey Semashev `​andrey.semashev__AT__gmail.com
  • Version:
  • State:
  • Last upload: 2008 Nov 28
  • Links: ​Home Page
  • Description: This library aims to make logging significantly easier for the application developer. It provides a wide range of out-of-box tools, along with public interfaces ready to be used to extend the library. The main goals of the library are:
  • Simplicity. A small example code snippet should be enough to get the feel of the library and be ready to use its basic features.
  • Extensibility. A user should be able to extend functionality of the library with regard to collecting and storing information into logs.
  • Performance. The library should make as least performance impact on the user's application as possible.

Boost.Mirror

  • Author(s): Matus Chochlik
  • Version:
  • Last upload:
  • Links: ​Boost Sandbox
  • Description: The aim of the <libraryname>Mirror</libraryname> library is to provide useful meta-data at both compile-time and run-time about common C++ constructs like namespaces, types (and as an important special case <code>typedef</code>-ined types), classes and their base classes and member attributes, instances, etc. and to provide uniform and generic interfaces for their introspection.

Boost.Move

  • Author(s): Adobe
  • Version:
  • State: stable
  • Last upload:
  • Links: ​Boost Sandbox
  • Description: User defined types often have remote parts either because they are implemented using a pointer-to-implementation or are variable sized. Such objects can be expensive to copy and are often copied unnecessarily when they are returned from functions or stored in other objects or containers. Boost.Move is a collection of utilities to implement types which can be moved to elide copying in such situations as well as utilities to assist in moving value.

Boost.Process

  • Author(s): Julio M. Merino Vidal
  • Version: v0.1
  • State:
  • Last upload:
  • Links: ​Boost Sandbox
  • Description: Provides a flexible framework for the C++ programming language to manage running programs, also known as processes. Among other functionality, this includes the ability to manage the execution context of the currently running process, the ability to spawn new child processes, and a way to communicate with them them using standard C++ streams.

Boost.Reflection

  • Author(s): Jeremy Pack
  • Version:
  • State:
  • Last upload:2008 Aug 08
  • Links: ​Blog ​Download ​Boost Sandbox Headers ​Boost Sandbox
  • Description: The goal of this library is to provide runtime reflection for C++ classes, and to allow the same across shared library boundaries. It is an offshoot of the Extension library, which provides dynamic class loading across shared libraries.

Boost.Reflection does not provide automatic reflection of classes. Instead, the class data must be manually reflected. This does offer some benefits however:

  • This can result in better performance, since only the necessary functions are reflected.
  • Arbitrary classes can be reflected without modification.
  • It is possible to make a reflected interface that is quite different from the original interface.

Boost.Tree

Other Open Source libraries

This page contains other libraries that work well with Boost.

ASL

  • Author(s): Sean Parent and Mat Marcus - Adobe
  • Version: 1.0.39
  • State: Released
  • Last upload: November 6, 2008
  • Links: ​Home page
  • Description: Adobe Source Libraries (ASL) provides peer-reviewed and portable C++ source libraries. The libraries are intended to be widely useful, leveraging and extending both the C++ Standard Library and the Boost Libraries.

TBB

  • Author(s): Intel
  • Version: 2.1
  • State: stable release
  • Last upload: June 7, 2008
  • Links: ​Home page
  • Description: Intel® Threading Building Blocks (TBB) offers a rich and complete approach to expressing parallelism in a C++ program. It is a library that helps you take advantage of multi-core processor performance without having to be a threading expert. Threading Building Blocks is not just a threads-replacement library. It represents a higher-level, task-based parallelism that abstracts platform details and threading mechanism for performance and scalability and performance.

Libraries Under Discussion

This page is an index page for discussion of possible libraries as people get their ideas together.

Geometry

  • Description:
  • Discussion:
  • Participants:

Libraries Wish list

This page contains libraries that people have requested of Boost (mostly on the developer's mailing list). If you're looking for a project, this is a good place to start.

AccummulatorsExt

  • Suggested by: Vicente J. Botet Escriba
  • Description: Adding sliding, dependable and cyclic accumulators to Boost.Accumulators.

The accumulator library allows to determine dependency between accumulator, but not between accumulator_sets.

I would like to define an accumulator_set c so when we cumulate in two others c1 and c2 accumulator_set we cumulate also in c, some thing like: 

typedef dependable_accumulator_set <double, ...> dependable_acc_type;

dependable_acc_type c1, c2;
dependable_acc_type c=c1+c2

dependable_acc_type c3;

c+=c3;

c1(1);
c2(1);
c3(2);
assert(count(c)==3);
assert(sum(c)==4);

How dependable_accumulator_set can be defined? Here follows the interfaces of such a class and the pseudo code, I've named the class dependable_accumulator_set, sorry but I have not found a shorter and better name (may be observed/listened?) 

template <typename T, typename F, typename W>
class dependable_accumulator_set : public acumulator_set<T,F,W>
{
public:
    dependable_accumulator_set();
    void add_dependent(dependable_acumulator_set&);
    void remove_dependent(dependable_acumulator_set&);

    template<typename A1>
    void operator ()(A1 const &a1) {
        for (acc in dependents) {
            acc(a1);
        }
        this->accumulator_set_type::operator()(a1);
    }
    dependable_accumulator_set<T,F,W>& operator+=(dependable_accumulator_set<T,F,W>);
    dependable_accumulator_set<T,F,W>& operator-=(dependable_accumulator_set<T,F,W>);
};

template <typename T, typename F, typename W>
dependable_accumulator_set<T,F,W> 
operator+()(dependable_accumulator_set<T,F,W>,dependable_accumulator_set<T,F,W>);

In addition another variant could allow to cumulate on a sliding window, e.g. on the last N cumulated values. There is already a tail accumulator, but I don't know how to define a min_tail accumulator with the current framework. This class could behaves like: 

typedef sliding_accumulator_set <double, ...> sliding_acc_type;
sliding_acc_type c(window=2);
c(1);
c(5);
c(2);
assert(count(c)==3);
assert(sum(c)==7);
assert(min(c)==2);

We can state the sliding window at compile (template parameter) or run time (constructor parameter). 

template <std::size Window, typename T, typename F, typename W>
class static_sliding_accumulator_set;

template <typename T, typename F, typename W>
class sliding_accumulator_set;

Of course the complexity of the sliding accumulators operations is increased.

Another variant could be also to have a temporary accumulator that cyclically push its current value on another accumulator.

It will also interesting to have a sliding, dependable and cyclic accumulator set. It would be great to integrate these features on a unique class (accumulator_set?) in a clean way. 

template <typename T, typename F, typename W, typename DependablePolicy, typename SlicingPolicy, typename CyclicPolicy>
class accumulator_set;

DenseSet

  • Suggested by: Vicente J. Botet Escriba
  • Description: Implementation of dense set of integers using intervals.

Frames

  • Suggested by: Vicente J. Botet Escriba
  • Description: in a frame library which will be based on an extension of the archive concept. The saving archive concept allows to save serializable data at the end of the archive, and the loading archive concept allows to read serializable data from the beginning of the archive. The saving frame concept will allows to save serializable data either at the end or the begin of the frame, and the loading frame concept allows to read serializable data from the beginning or the end of the archive.

StableVector

  • Suggested by: Joaquín M López Muñoz
  • Links: ​Stable Vectors
  • Description: a container mimicking the interface of std::vector except that it provides iterator and reference stability at the expense of losing memory contiguity.

ThreaderJoiner

Abandoned

Note: See TracWiki for help on using the wiki.