| 32 | | |
| 33 | | --------------------------------------------------------------------------------------------------- |
| 34 | | == Boost.Algorithm.Sorting == |
| 35 | | * '''Author(s):''' Steven Ross |
| 36 | | * '''Version:''' |
| 37 | | * '''State:''' |
| 38 | | * '''Last upload:''' 2009 Jan 13 |
| 39 | | * '''Depends on:''' |
| 40 | | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 41 | | * Missing criteria |
| 42 | | * C1 |
| 43 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 44 | | * '''Review Manager:''' Needed |
| 45 | | * '''Expected review date:''' ??? |
| 46 | | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Bosst Vault] |
| 47 | | * '''Categories:''' [#Algorithm Algorithm] |
| 48 | | * '''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. |
| 49 | | |
| 50 | | These algorithms are hybrids using both radix and comparison-based sorting, specialized to sorting common data types, such as integers, floats, and strings. These algorithms are encoded in a generic fashion and accept functors, enabling them to sort any object that can be processed like these basic data types. |
| 51 | | |
| 52 | | Unlike many radix-based algorithms, the underlying Spreadsort algorithm is designed around worst-case performance, and performs better on chunky data (where it is not widely distributed), so that on real data it can perform substantially better than on random data. Conceptually, Spreadsort can sort any data for which an absolute ordering can be determined. |
| 53 | | |
| 141 | | |
| 142 | | |
| 143 | | |
| 144 | | --------------------------------------------------------------------------------------------------- |
| 145 | | == Boost.!VariadicMacrosData == |
| 146 | | * '''Author(s):''' Edward Diener |
| 147 | | * '''Version:''' 1.3 |
| 148 | | * '''State:''' |
| 149 | | * '''Last upload:''' Feb 6, 2011 |
| 150 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/variadic_macro_data Boost Sandbox] |
| 151 | | * '''Categories:''' [#PreprocessorMetaprogramming Preprocessor Metaprogramming] |
| 152 | | * '''Description:''' The variadic macro data library, or VMD for short, is a library of macros which provide important functionality for variadic macros as well as integrating variadic macros with the Boost preprocessor library ( Boost PP ). It integrates with Boost PP without changing the latter library in any way. |
| 153 | | |
| 154 | | The functionality of the library may be summed up as: |
| 155 | | |
| 156 | | 1. Providing the means to extract any single token from the comma-separated data which makes up variadic macro data, as well as to calculate the number of tokens. |
| 157 | | 2. Convert variadic macro data to and from Boost PP data types. |
| 158 | | 3. Enhance the tuple functionality of Boost PP by providing a means of calculating the size of a tuple as well as by providing equivalent macros to Boost PP tuple macros which do not require the size of the tuple to be explicitly passed. |
| 215 | | == Boost.Assign.V2 == |
| 216 | | * '''Author(s):''' Ottosen Thorsten, Erwann Rogard |
| 217 | | * '''Version:''' 2.0 |
| 218 | | * '''State:''' On going |
| 219 | | * '''Last upload:''' 2011 Jan 28 |
| 220 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/assign_v2 Boost Sandbox] |
| 221 | | * '''Categories:''' [#Containers Containers] |
| 222 | | * '''Review Manager:''' John Bytheway |
| 223 | | * '''Expected review date:''' June 15, 2011 - June 24, 2011 |
| 224 | | * '''Description:''' This library has grown out of Boost.Assign 1.0 but is functionally independent of it. It provides a small set of tools for carrying out operations that can be characterized as either putting a set of values in a container, in simple or complex ways, or manipulating references through a range-like interface. These are referred to as the put and ref frameworks, respectively. Each allows to code in one sweep, what would ordinarily require repetitive statements, and integrates nicely with range algorithms. Utilities bridging the above with other container or range functionality are provided. The library is open for extension with the help of macros. |
| | 175 | == Boost.Algorithm.Sorting == |
| | 176 | * '''Author(s):''' Steven Ross |
| | 177 | * '''Version:''' |
| | 178 | * '''State:''' |
| | 179 | * '''Last upload:''' 2009 Jan 13 |
| | 180 | * '''Depends on:''' |
| | 181 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 182 | * Missing criteria |
| | 183 | * C1 |
| | 184 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 185 | * '''Review Manager:''' Dave Abrahams |
| | 186 | * '''Expected review date:''' September 22, 2011 - October 1, 2011 |
| | 187 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Bosst Vault] |
| | 188 | * '''Categories:''' [#Algorithm Algorithm] |
| | 189 | * '''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. |
| | 190 | |
| | 191 | These algorithms are hybrids using both radix and comparison-based sorting, specialized to sorting common data types, such as integers, floats, and strings. These algorithms are encoded in a generic fashion and accept functors, enabling them to sort any object that can be processed like these basic data types. |
| | 192 | |
| | 193 | Unlike many radix-based algorithms, the underlying Spreadsort algorithm is designed around worst-case performance, and performs better on chunky data (where it is not widely distributed), so that on real data it can perform substantially better than on random data. Conceptually, Spreadsort can sort any data for which an absolute ordering can be determined. |
| | 194 | |
| | 195 | |
| | 215 | --------------------------------------------------------------------------------------------------- |
| | 216 | |
| | 217 | == Boost.Context == |
| | 218 | * '''Author(s):''' Oliver Kowalke |
| | 219 | * '''Version:''' 0.6.1 |
| | 220 | * '''State:''' Stable |
| | 221 | * '''Last upload:'''February 2, 2011 |
| | 222 | * '''Fulfill review criteria checked by :''' Vicente Botet '''At:''' February 2, 2011 |
| | 223 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 224 | * '''Review Manager:''' Giovanni Deretta |
| | 225 | * '''Expected review date:'''July 28, 2011 - August 2, 2011 |
| | 226 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.context-0.6.1.zip&directory=Concurrent%20Programming& Boost Vault] [http://gitorious.org/~k-oli/boost-dev/k-olis-boost GitHub Sandbox] |
| | 227 | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| | 228 | * '''Description:''' Boost.Context provides framework for user-context swapping/switching - has assembler for some platforms. |
| 306 | | == Boost.Heaps == |
| 307 | | * '''Author(s):''' Tim Blechmann |
| 308 | | * '''Version:''' |
| 309 | | * '''State:''' Ready |
| 310 | | * '''Last upload:''' |
| 311 | | * '''Inclusion date:''' ??? |
| 312 | | * '''Depends on:''' |
| 313 | | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 314 | | * Missing criteria |
| 315 | | * C1 |
| 316 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 317 | | * '''Review Manager:''' Andrew Sutton |
| 318 | | * '''Expected review date:''' May 30, 2011 - June 8, 2011 |
| 319 | | * '''Links:''' [http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz Download] |
| 320 | | * '''Categories:''' [#Containers Containers] |
| 321 | | * '''Description:''' |
| 322 | | |
| 323 | | |
| 324 | | --------------------------------------------------------------------------------------------------- |
| | 336 | == Boost.Assign.V2 == |
| | 337 | * '''Author(s):''' Ottosen Thorsten, Erwann Rogard |
| | 338 | * '''Version:''' 2.0 |
| | 339 | * '''State:''' On going |
| | 340 | * '''Last upload:''' 2011 Jan 28 |
| | 341 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/assign_v2 Boost Sandbox] |
| | 342 | * '''Categories:''' [#Containers Containers] |
| | 343 | * '''Review Manager:''' John Bytheway |
| | 344 | * '''Expected review date:''' June 15, 2011 - June 24, 2011 |
| | 345 | * '''Description:''' This library has grown out of Boost.Assign 1.0 but is functionally independent of it. It provides a small set of tools for carrying out operations that can be characterized as either putting a set of values in a container, in simple or complex ways, or manipulating references through a range-like interface. These are referred to as the put and ref frameworks, respectively. Each allows to code in one sweep, what would ordinarily require repetitive statements, and integrates nicely with range algorithms. Utilities bridging the above with other container or range functionality are provided. The library is open for extension with the help of macros. |
| | 346 | |
| | 347 | |
| | 348 | --------------------------------------------------------------------------------------------------- |
| 370 | | == Boost.Context == |
| 371 | | * '''Author(s):''' Oliver Kowalke |
| 372 | | * '''Version:''' 0.6.1 |
| 373 | | * '''State:''' Stable |
| 374 | | * '''Last upload:'''February 2, 2011 |
| 375 | | * '''Fulfill review criteria checked by :''' Vicente Botet '''At:''' February 2, 2011 |
| 376 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 377 | | * '''Review Manager:''' Vicente Botet |
| 378 | | * '''Expected review date:'''March 21, 2011 - March 30, 2011 |
| 379 | | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.context-0.6.1.zip&directory=Concurrent%20Programming& Boost Vault] [http://gitorious.org/~k-oli/boost-dev/k-olis-boost GitHub Sandbox] |
| 380 | | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| 381 | | * '''Description:''' Boost.Context provides framework for user-context swapping/switching - has assembler for some platforms. |
| | 351 | |
| | 374 | |
| | 375 | --------------------------------------------------------------------------------------------------- |
| | 376 | == Boost.Heaps == |
| | 377 | * '''Author(s):''' Tim Blechmann |
| | 378 | * '''Version:''' |
| | 379 | * '''State:''' Ready |
| | 380 | * '''Last upload:''' |
| | 381 | * '''Inclusion date:''' ??? |
| | 382 | * '''Depends on:''' |
| | 383 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 384 | * Missing criteria |
| | 385 | * C1 |
| | 386 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 387 | * '''Review Manager:''' Andrew Sutton |
| | 388 | * '''Expected review date:''' May 30, 2011 - June 8, 2011 |
| | 389 | * '''Links:''' [http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz Download] |
| | 390 | * '''Categories:''' [#Containers Containers] |
| | 391 | * '''Description:''' |
| | 504 | --------------------------------------------------------------------------------------------------- |
| | 505 | == Boost.!VariadicMacrosData == |
| | 506 | * '''Author(s):''' Edward Diener |
| | 507 | * '''Version:''' 1.3 |
| | 508 | * '''State:''' |
| | 509 | * '''Last upload:''' Feb 6, 2011 |
| | 510 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/variadic_macro_data Boost Sandbox] |
| | 511 | * '''Categories:''' [#PreprocessorMetaprogramming Preprocessor Metaprogramming] |
| | 512 | * '''Description:''' The variadic macro data library, or VMD for short, is a library of macros which provide important functionality for variadic macros as well as integrating variadic macros with the Boost preprocessor library ( Boost PP ). It integrates with Boost PP without changing the latter library in any way. |
| | 513 | |
| | 514 | The functionality of the library may be summed up as: |
| | 515 | |
| | 516 | 1. Providing the means to extract any single token from the comma-separated data which makes up variadic macro data, as well as to calculate the number of tokens. |
| | 517 | 2. Convert variadic macro data to and from Boost PP data types. |
| | 518 | 3. Enhance the tuple functionality of Boost PP by providing a means of calculating the size of a tuple as well as by providing equivalent macros to Boost PP tuple macros which do not require the size of the tuple to be explicitly passed. |
| | 519 | |
