Changes between Version 33 and Version 34 of LibrariesUnderConstruction

Timestamp:

Feb 14, 2009, 6:04:47 PM (14 years ago)

Author:

viboes

Comment:

Adding cross reference

LibrariesUnderConstruction

@@ -20 +20 @@
  * '''Last upload:''' 2009 Jan 13
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Bosst Vault]
+ * '''Categories:''' [#Algorithm Algorithm] 
  * '''Description:''' The Sorting Algorithm Library provides a generic implementation of high-speed sorting algorithms that outperform those in the C++ standard in both average and worst case performance. These algorithms only work on random access iterators.
 
@@ -33 +34 @@
  * '''Last upload:'''
  * '''Links:''' [http://www.drivehq.com/web/igaztanaga/allocplus/ Documentation] [http://www.drivehq.com/web/igaztanaga/allocplus.zip Download]
+ * '''Categories:''' [#Memory Memory] 
  * '''Description:'''Allocators optimizations
 
@@ -42 +44 @@
  * '''Last upload:'''
  * '''Links:''' [http://www.drivehq.com/web/igaztanaga/allocplus/ Documentation] [http://www.drivehq.com/web/igaztanaga/allocplus.zip Download]
- * '''Description:'''Allocators optimizations
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
+ * '''Description:'''portable archive
 
 ---------------------------------------------------------------------------------------------------
@@ -51 +54 @@
  * '''Last upload:''' 2009 Fev 08
  * '''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]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] [#Containers Containers] 
  * '''Description:''' Asynchronous Executors (AE) and Asynchronous Completion Tokens (ACT) in a generic way (or at least this was my intention). The library can be considered as a front-end for several Asynchronous Execution models making it possible to share common algorithms and making easier to switch from an Asynchronous Executors to another.
 
@@ -123 +127 @@
  * '''Last upload:''' 2006 Mars 15
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Bitfield3.zip&directory=bitfield&  Boost Vault]
+ * '''Categories:''' [#Portability Portability] 
  * '''Description:'''Portable bitfields
  
@@ -132 +137 @@
  * '''Last upload:'''2008 Nov 26
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/chrono Boost Sandbox]
+ * '''Categories:''' [#System System] 
  * '''Description:''' The Boost Chrono library provides:
     *  The C++0x Standard Library's time utilities, including:
@@ -159 +165 @@
  * '''Last upload:'''2009 Jan 20
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost_crypto.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent] 
  * '''Description:''' A library which provides larger number of secure and cryptographical services to the system. 
 
@@ -169 +176 @@
  * '''Last upload:'''2008 Oct 14
  * '''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]
+ * '''Categories:''' [#Containers Containers] 
  * '''Description:''' Boost.!ConstantTimeSize defines a wrapper to the STL container list giving the user the choice 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.
@@ -179 +187 @@
  * '''Last upload:'''2008 Mars 05
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/SOC/2006/corutines Boost Sandbox] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-coroutine.tar.gz&directory=Concurrent%20Programming& Boost Vault]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' The Boost.Coroutine library contains a family of class templates that wrap function objects in coroutines. Coroutines are a generalization of subroutines that can return and be reentered more than once without causing the destruction of automatic objects.
 Coroutines are useful whenever it is necessary to keep state across a function call, a job usually reserved to stateful function objects.
@@ -189 +198 @@
  * '''Last upload:''' 
  * '''Links:''' [http://dancinghacker.com/code/dataflow/ Documentation] [https://svn.boost.org/svn/boost/sandbox/dataflow-rewrite Boost Sandbox]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent] 
  * '''Description:''' 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. 
 
@@ -199 +209 @@
  * '''Links:''' [http://p-stade.sourceforge.net/boost/libs/egg/doc/html/index.html Documentation] 
  [https://p-stade.svn.sourceforge.net/svnroot/p-stade/trunk/boost SVN repository] [http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=egg.zip&directory=Function%20Objects& Boost Vault]
+ * '''Categories:''' [#FunctionObjectsAndHigher-orderProgramming Function Objects And Higher-order Programming] 
  * '''Description:''' Egg is a header-only library for building Polymorphic Function Object which can be used with Boost.Lambda. Such a function object is called a Major Function Object.
  Egg mainly provides three components:
@@ -212 +223 @@
  * '''Last upload:'''2008 Nov 26
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox]
+ * '''Categories:''' [#Portability Portability] 
  * '''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.
@@ -222 +234 @@
  * '''Last upload:'''2008 Nov 26
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=euclid.zip&directory=& Boost Vault]
+ * '''Categories:''' [#MathAndNumerics Math And Numerics] 
  * '''Description:''' Euclidean vector class templates providing Orientational analysis on geometrical dimensions.
 
@@ -231 +244 @@
  * '''Last upload:'''2008 Nov 26
  * '''Links:''' [http://boost-extension.blogspot.com Blog] [http://redshoelace.googlepages.com/extension_reflection.zip Download] [http://svn.boost.org/svn/boost/sandbox/boost/extension Headers Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/libs/extension Libs Boost Sandbox]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent] 
  * '''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. 
 
@@ -240 +254 @@
  * '''Last upload:'''2008 Oct 30
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-fiber.v2.tar.gz&directory=Concurrent%20Programming& Boost Vault] 
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' Boost.Fiber implements lightweight threads of execution - so called fibers 
 
@@ -249 +264 @@
  * '''Last upload:''' 
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=FSM.zip&directory=& Boost Vault]
+ * '''Categories:''' [#DataStructures Data Structures] 
  * '''Description:'''The Boost.FSM library is an implementation of FSM (stands for Finite State Machine) programming concept.
 There are many cases when a developer would like to distinguish behavior of a given object depending on some conditions or its internal state. For example, while developing software to control an charging turnstile a programmer would like to separate states in which the turnstile may persist: an idle state, when the device awaits for another passenger that would like to pass; a processing state, when the passenger have come and put his ticket into the device; and the passing state, when the turnstile lets the passenger pass through. In fact, each state describes a different reaction of the machine at the same events. That's why a passenger may only pass after paying for ticket. Obviously, the turnstile have to be able to change its internal state in order to function properly, this is called state switching or transitions between states (or just transitions for short).
@@ -263 +279 @@
  * '''Last upload:''' 2009 Jan 14
  * '''Links:''' [http://gil-contributions.googlecode.com/svn/trunk/gil_2 svn repository ]
+ * '''Categories:''' [#ImageProcessing Image Processing] 
  * '''Description:'''IO extension for boost::gil which allows reading and writing of/in image formats ( tiff, jpeg, ... ).
 
@@ -272 +289 @@
  * '''Last upload:''' 2009 Fev 08
  * '''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]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''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.
@@ -293 +311 @@
  * '''Last upload:''' 2008 Nov 26
  * '''Links:''' [http://www.sourceforge.net/projects/itl Home Page] [http://www.herold-faulhaber.de/itl Online Documentation] [https://svn.boost.org/svn/boost/sandbox/itl Boost Sandbox]
+ * '''Categories:''' [#Containers Containers] 
  * '''Description:''' The Interval Template Library (ITL) offers '''intervals''' and two kinds of interval containers: '''interval_sets''' and '''interval_maps'''.
 
@@ -302 +321 @@
  * '''Last upload:''' 2009 Fev 8
  * '''Links:''' [http://boost-log.sourceforge.net Home Page] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=BoostLog.zip&directory=& Review Version]
+ * '''Categories:''' [#InputOutput Input/Output] 
  * '''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.
@@ -313 +333 @@
  * '''Last upload:''' February 9, 2009
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mirror.zip&directory=& Boost Vault] [https://svn.boost.org/svn/boost/sandbox/mirror Boost Sandbox]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' The aim of the Mirror 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 typedef-ined types), classes and their base classes and member attributes, instances, etc. and to provide uniform and generic interfaces for their introspection.
 
@@ -322 +343 @@
  * '''Last upload:''' 
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/move Boost Sandbox]
+ * '''Categories:''' [#GenericProgramming Generic Programming] [#LanguageFeaturesEmulation Language Features Emulation]
  * '''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.
 
@@ -331 +353 @@
  * '''Last upload:'''February 12, 2009  
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=while.zip&directory=variadic_templates& while_ in Boost Vault] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=and_seq_profile.zip&directory=Template%20Metaprogramming& and_seq in Boost Vault]
+ * '''Categories:''' [#TemplateMetaprogramming Template Metaprogramming] 
  * '''Description:''' Some MPL extensions
 
@@ -340 +363 @@
  * '''Last upload:''' 
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Msm1.10.zip&directory=Msm&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault][https://svn.boost.org/svn/boost/sandbox/msm Boost Sandbox]
+ * '''Categories:''' [#DataStructures Data Structures] 
  * '''Description:''' Msm is a framework which enables you to build a Finite State Machine in a straightforward, descriptive and easy-to-use manner . It requires minimal effort to generate a working program from an UML state machine diagram. This work was inspired by the state machine described in the book of David Abrahams and Aleksey Gurtovoy “C++ Template Metaprogramming” and adds most of what UML Designers are expecting from an UML State Machine framework(entry/exit actions, guards, composite states, orthogonal zones, history...). 
 
@@ -349 +373 @@
  * '''Last upload:''' 
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/SOC/2006/process Boost Sandbox]
+ * '''Categories:''' [#System System] 
  * '''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.
 
@@ -358 +383 @@
  * '''Last upload:''' Jan 2009
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization Boost Plot]
+ * '''Categories:''' [#ImageProcessing Image Processing] 
  * '''Description:''' Provides a way of plotting simple 1 and 2D graphs in Scalable Vector Graphic (svg) format directly from C++ code.  The graphs are high quality when displayed on a wide variety of display sizes, from mobile phone to big screen, or when printed, but the graph files are tiny and fast enough to be done in near real-time.  Fine control of appearance is provided in C++ (but with defaults and optional scaling of axes) so graphs can be produced in a very few lines of code. Current documentation is a mess but Very much improved documentation is nearly complete using Doxygen:  meanwhile there are lots of examples.
 
@@ -367 +393 @@
  * '''Last upload:'''2008 Aug 08
  * '''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]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''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:
@@ -380 +407 @@
  * '''Last upload:''' 2009 Fev 10
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/synchro Boost Sandbox]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:'''  Concurrent components may interact in different ways: they may access the same objects by, for example, executing functions of these objects; or they may communicate directly by executing functions of each other.  These library will provide the so-called rendezvous mechanism for handling direct communication between active objects. 
 
@@ -389 +417 @@
  * '''Last upload:''' 2009 Jan 3
  * '''Links:''' [http://home.roadrunner.com/~hinnant/unique_ptr03.html Documentation & Download]
+ * '''Categories:''' [#GenericProgramming Generic Programming] 
  * '''Description:''' unique_ptr is a class template smart pointer currently in the [http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf C++0X CD1 draft]. It is intended to be a safer and more flexible replacement for auto_ptr. It represents sole (unique) ownership of a resource such as memory (like auto_ptr).
 The actual C++0X unique_ptr makes use of a new C++ language feature called rvalue reference which is similar to our current reference (&), but spelled &&. This emulation is intended to capture most of the behavior of the C++0X unique_ptr but work with C++03 compilers. Furthermore this emulation makes use of boost library facilities and has been placed in the boost namespace. Though at the time of this writing, this library is not part of the official boost library release.
@@ -399 +428 @@
  * '''Last upload:''' 2009 Fev 10
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/synchro Boost Sandbox]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' 
     * Lock traits: very specific traits classes, some of them encapsulate a single trait for a Lockable type; for example, is a lock recursive (is_recursive), is useful in a multi threaded context (is_multi_threaded). 
@@ -415 +445 @@
  * '''Last upload:''' 2009 Fev 08
  * '''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]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' Threader/Joiner as proposed by Kevlin Henney `[http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1883.pdf Preliminary Threading Library Proposal for TR2]
 
@@ -426 +457 @@
  * '''Last upload:''' 2008 Nov 30
  * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/SOC/2006/tree Boost Sandbox]
+ * '''Categories:''' [#Containers Containers] 
  * '''Description:''' TR2 Proposal text: [http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2101.html Tree Structures and Related Concepts for the C++ Standard Library (TR2)]
 
@@ -435 +467 @@
  * '''Last upload:''' February 12, 2009
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=unicode_lib.zip&directory=&PHPSESSID=02527d51a836e06dadae8907366e594d Boost Vault]
+ * '''Categories:''' [#StringAndTextProcessing String And Text Processing] 
  * '''Description:''' The Boost Unicode library aims to bring Unicode to C++ without requiring intricate knowledge of the Unicode standard, while allowing Unicode experts to do advanced things.
 
@@ -457 +490 @@
  * '''Last upload:''' June 25, 2008
  * '''Links:''' [http://www.comedi.org/projects/libpoet/index.html Home Page]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:'''  libpoet is a C++ parallel programing library. It provides support for easily creating active objects, creating monitor objects, and automatically validating mutex locking order.
 
@@ -472 +506 @@
  * '''Last upload:''' June 7, 2008
  * '''Links:''' [http://www.threadingbuildingblocks.org/ Home page]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''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.
 
@@ -485 +520 @@
  * '''Participants:'''  
  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=gtl.tar.gz&directory=Math%20-%20Geometry& GTL Boost Vault] [http://geometrylibrary.geodan.nl/index.html Geodan Web site]
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
 
 ---------------------------------------------------------------------------------------------------
@@ -494 +530 @@
 == Accumulators.Ext ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#MathAndNumerics Math And Numerics] 
  * '''Description:''' Adding sliding, dependable and cyclic accumulators to Boost.Accumulators.
 The accumulator library allows to determine dependency between accumulator, but not between accumulator_sets.
@@ -556 +593 @@
 == !ConstraintsProgramming ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' Constraints programming is a programming paradigm where relations between variables are stated in the form of constraints. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. This makes Constraint Programming a form of declarative programming.
  
@@ -572 +610 @@
 ---------------------------------------------------------------------------------------------------
 == !DenseSet ==
-
-
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#Containers Containers] 
  * '''Description:''' Implementation of dense set of integers using intervals.
 
@@ -580 +617 @@
 == Frames  ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#InputOutput Input/Output] 
  * '''Description:''' Library based on an extension of the Archive concept making it bidirectional. 
  
@@ -699 +737 @@
 == LUID ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#DataStructures Data Structures] 
  * '''Description:''' Locally Unique Identifier or LUID is a special type of identifier used in software applications in order to provide a reference number which is unique in a given context (hence, "Locally" in opposition to "Globally" or "Universally"). Each generated LUID is guaranteed to be unique in its context. 
 
@@ -706 +745 @@
 == Quartets  ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#Containers Containers] [#DataStructures Data Structures]
  * '''Description:''' Quartet are half an octet, i.e. 4 bits taking values from 0..15, and usually represented by chars '0'-'9' 'A'-'F'. 
  There are some container specializations as std::string, std::vector and boost::array that could be of interest to some applications. 
@@ -714 +754 @@
 == !SpreadSheet ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' Allows to manage with the underlying concepts of a Spreadsheet but without displaying them. 
  
@@ -752 +793 @@
 == !StableVector ==
  * '''Suggested by:'''  Joaquín M López Muñoz
+ * '''Categories:''' [#Containers Containers] 
  * '''Links:''' [http://bannalia.blogspot.com/2008/08/stable-vectors.html 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.
@@ -758 +800 @@
 == STM  ==
  * '''Suggested by:''' Vicente J. Botet Escriba  
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
  * '''Description:''' Transactional memory (TM) is a recent parallel programming concept which reduces challenges found in parallel programming. TM offers numerous advantages over other synchronization mechanisms. 
 
@@ -770 +813 @@
  * '''State:''' 
  * '''Last upload:''' 2004 September 12
+ * '''Categories:''' [#CorrectnessAndTesting Correctness And Testing] [#LanguageFeaturesEmulation Language Features Emulation]
  * '''Links:''' [http://neoscientists.org/~tschwinger/boostdev/concept_traits/libs/concept_traits/doc/ Documentation] [http://home.broadpark.no/~terjesl/files/concept_traits_original.zip Original Download]
 [http://home.broadpark.no/~terjesl/files/concept_traits.zip Last Download]
@@ -803 +847 @@
 ---------------------------------------------------------------------------------------------------
 == Containers ==
+ * [#Boost.AsynchronousExecutors Boost.AsynchronousExecutors]
  * [#Boost.ConstantTimeSize Boost.ConstantTimeSize]
  * [#DenseSet DenseSet]
@@ -812 +857 @@
 
 ---------------------------------------------------------------------------------------------------
-== Correctness and testing ==
+== Correctness And Testing ==
  * [#Boost.ConceptTraits Boost.ConceptTraits]
 
 ---------------------------------------------------------------------------------------------------
-== Data structures ==
+== Data Structures ==
  * [#Boost.Fsm Boost.Fsm]
  * [#LUID LUID]
@@ -823 +868 @@
 
 ---------------------------------------------------------------------------------------------------
-== Function Objects and higher-order programming ==
+== Function Objects And Higher-order Programming ==
  * [#Boost.Egg Boost.Egg]
 
@@ -832 +877 @@
 
 ---------------------------------------------------------------------------------------------------
-== Image processing ==
+== Image Processing ==
  * [#Boost.GIL.IO Boost.GIL.IO]
  * [#Boost.Plot Boost.Plot]
@@ -848 +893 @@
 
 ---------------------------------------------------------------------------------------------------
-== Language features emulation ==
+== Language Features Emulation ==
  * [#Boost.Move Boost.Move]
  * [#Boost.ConceptTraits Boost.ConceptTraits]
 
 ---------------------------------------------------------------------------------------------------
-== Math and numerics ==
+== Math And Numerics ==
  * [#Accumulators.Ext Boost.Accumulators.Ext]
  * [#Boost.Euclid Boost.Euclid]
@@ -876 +921 @@
 
 ---------------------------------------------------------------------------------------------------
-== String and text processing ==
+== String And Text Processing ==
  * [#Boost.Unicode Unicode]