Changes between Version 1 and Version 2 of LibrariesUnderConstruction


Ignore:
Timestamp:
Dec 3, 2008, 4:00:05 PM (14 years ago)
Author:
viboes
Comment:

minor formatting changes

Legend:

Unmodified
Added
Removed
Modified

  • LibrariesUnderConstruction

    v1 v2  
    3030 * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/chrono Boost Sandbox]
    3131 * '''Description:''' The Boost Chrono library provides:
    32 
    3332    *  The C++0x Standard Library's time utilities, including:
    3433          * Class template duration
    … …  
    3736                * system_clock
    3837                * monotonic_clock
    39                 * high_resolution_clock
    40                    
     38                * high_resolution_clock                 
    4139    * Class template timer, with typedefs:
    4240          * system_timer
    4341          * monotonic_timer
    4442          * high_resolution_timer
    45              
    4643    * Process clocks and timers:
    4744          * process_clock, capturing real, user-CPU, and system-CPU times.
    4845          * process_timer, capturing elapsed real, user-CPU, and system-CPU times.
    4946          * run_timer, convenient reporting of process_timer results.
    50              
    5147    *  The C++0x Standard Library's compile-time rational arithmetic.
    5248
    … …  
    5854 * '''Last upload:'''2008 Oct 14
    5955 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=constant_time_size.zip&directory=Containers& Boost Vault] [https://svn.boost.org/svn/boost/sandbox/constant_time_size Boost Sandbox]
    60  * '''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.
    61 
     56 * '''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.
    6257In future versions the library could include a similar wrapper to slist.
    63 
    6458
    6559
    … …  
    8175 * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox]
    8276 * '''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.
    83 
    8477These 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.
    8578
    … …  
    9992 * '''State:''' Not stable
    10093 * '''Last upload:''' 2008 Nov 26
    101  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=interthreads.zip&directory=Concurrent%20Programming& Boost Vault]
    102 [https://svn.boost.org/svn/boost/sandbox/interthreads Boost Sandbox]
     94 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=interthreads.zip&directory=Concurrent%20Programming& Boost Vault] [https://svn.boost.org/svn/boost/sandbox/interthreads Boost Sandbox]
    10395 * '''Description:'''  Boost.!InterThreads extends Boost.Threads adding some features:
    104  
    105     * 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.
     96     * 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.
    10697    * 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.
    10798    * 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.
    … …  
    132123 * '''Links:''' [http://boost-log.sourceforge.net Home Page]
    133124 * '''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:
    134 
    135125    * Simplicity. A small example code snippet should be enough to get the feel of the library and be ready to use its basic features.
    136126    * Extensibility. A user should be able to extend functionality of the library with regard to collecting and storing information into logs.
    137127    * Performance. The library should make as least performance impact on the user's application as possible.
    138 
    139128
    140129---------------------------------------------------------------------------------------------------
    … …  
    174163 * '''Links:''' [http://boost-extension.blogspot.com Blog] [http://redshoelace.googlepages.com/extension_reflection.zip Download] [http://svn.boost.org/svn/boost/sandbox/boost/reflection  Boost Sandbox Headers] [http://svn.boost.org/svn/boost/sandbox/libs/reflection  Boost Sandbox]
    175164 * '''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.
    176 
    177165Boost.Reflection does not provide automatic reflection of classes. Instead, the class data must be manually reflected. This does offer some benefits however:
    178 
    179166    * This can result in better performance, since only the necessary functions are reflected.
    180167    * Arbitrary classes can be reflected without modification.
    … …  
    236223 * '''Description:''' Adding sliding, dependable and cyclic accumulators to Boost.Accumulators.
    237224The accumulator library allows to determine dependency between accumulator, but not between accumulator_sets.
    238 
    239225I 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:
    240 
    241226{{{
    242227#!cpp
    … …  
    256241assert(sum(c)==4);
    257242}}}
    258 
    259243How 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?)
    260 
    261244{{{
    262245#!cpp
    … …  
    284267operator+()(dependable_accumulator_set<T,F,W>,dependable_accumulator_set<T,F,W>);
    285268}}}
    286 
    287269In 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:
    288 
    289270{{{
    290271#!cpp
    … …  
    298279assert(min(c)==2);
    299280}}}
    300 
    301281We can state the sliding window at compile (template parameter) or run time
    302282(constructor parameter).
    303 
    304283{{{
    305284#!cpp
    … …  
    310289class sliding_accumulator_set;
    311290}}}
    312 
    313291Of course the complexity of the sliding accumulators operations is increased.
    314 
    315292Another variant could be also to have a temporary accumulator that cyclically push its current value on another accumulator.
    316 
    317293It 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.
    318 
    319294{{{
    320295#!cpp