| | 34 | == Boost.Algorithm.Sorting == |
| | 35 | * '''Author(s):''' Steven Ross |
| | 36 | * '''Last upload:''' 2009 Jan 13 |
| | 37 | * '''Review Manager:''' |
| | 38 | * '''Expected review date:''' September 22, 2011 - October 1, 2011 |
| | 39 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Bosst Vault] |
| | 40 | * '''Categories:''' [#Algorithm Algorithm] |
| | 41 | * '''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. |
| | 42 | |
| | 43 | 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. |
| | 44 | |
| | 45 | 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. |
| | 46 | |
| | 47 | --------------------------------------------------------------------------------------------------- |
| 51 | | --------------------------------------------------------------------------------------------------- |
| 52 | | == Boost.Local == |
| 53 | | * '''Author(s):''' Lorenzo Caminiti |
| 54 | | * '''Version:''' 0.1.0 |
| 55 | | * '''State:''' Review Ready |
| 56 | | * '''Last upload:''' January 03, 2011 |
| 57 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/local Boost Sandbox] [http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Function%20Objects Boost Vault] [http://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/index.html Documentation] |
| 58 | | * '''Categories:''' [#FunctionObjectsAndHigher-orderProgramming Function Objects And Higher-order Programming] |
| 59 | | * '''Description:''' Local functions, local blocks, and local exits. |
| 60 | | |
| 61 | | Local functions are a form of information hiding and are useful for dividing procedural tasks into subtasks which are only meaningful locally, avoiding cluttering other parts of the program with functions, variables, etc unrelated to those parts. Local functions therefore complement other structuring possibilities such as namespaces and classes. |
| 62 | | |
| 63 | | * Local functions can access, or better bind, any of the variables from the enclosing scope. Furthermore, local functions defined within a member function can bind the enclosing object this. |
| 64 | | * The local function body is programmed using the usual C++ syntax. |
| 65 | | * Local functions can be passed as template parameters (so they can be conveniently passed to STL algorithms, etc). |
| 66 | | * However, local functions must be defined within a declarative context (e.g., at a point in the code where local variables can be declared) thus they cannot be defined within an expression. |
| 67 | | |
| 68 | | In addition to local functions, this library also supports the following features: |
| 69 | | |
| 70 | | * Local blocks which define blocks of code that bind variables from the enclosing scope. Local blocks allow programmers to bind variables as constants (constant binding) so to prevent local chunks of code from modifying selected variables. |
| 71 | | * Local exits which define blocks of code that are executed when the enclosing scope is exited (again with support for constant binding and binding of the object this). |
| 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 | | |
| 196 | | |
| 197 | | --------------------------------------------------------------------------------------------------- |
| 198 | | == Boost.Containers == |
| 199 | | * '''Author(s):''' Ion Gaztañaga |
| 200 | | * '''Version:''' |
| 201 | | * '''State:''' stable. Ready for review. |
| 202 | | * '''Last upload:''' |
| 203 | | * '''Inclusion date:''' 2009 Dec 14 |
| 204 | | * '''Depends on:''' [#Boost.Move Boost.Move] |
| 205 | | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 206 | | * Missing criteria |
| 207 | | * C1 |
| 208 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 209 | | * '''Review Manager:''' John Maddock |
| 210 | | * '''Expected review date:''' August 3, 2011 - August 12, 2011 |
| 211 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/move Boost Sandbox] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.move.container.zip&directory=Containers& Download] [http://svn.boost.org/svn/boost/sandbox/move/libs/move/doc/html/index.html Documentation] |
| 212 | | * '''Categories:''' [#Container Container] |
| 213 | | * '''Description:''' Containers of Movable objects emulation using [#Boost.Move Boost.Move] |
| 214 | | |
| 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. |
| | 190 | * '''Description:''' |
| | 191 | |
| | 192 | --------------------------------------------------------------------------------------------------- |
| | 193 | == Boost.Integer.Endian == |
| | 194 | * '''Author(s):''' Beman Dawes |
| | 195 | * '''Version:''' |
| | 196 | * '''State:''' |
| | 197 | * '''Last upload:'''2008 Nov 26 |
| | 198 | * '''Inclusion date:''' ??? |
| | 199 | * '''Depends on:''' |
| | 200 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 201 | * Missing criteria |
| | 202 | * C1 |
| | 203 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 204 | * '''Review Manager:''' Joel Falcou |
| | 205 | * '''Expected review date:''' September 5, 2011 - September 14, 2011 |
| | 206 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox] |
| | 207 | * '''Categories:''' [#Portability Portability] |
| | 208 | * '''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. |
| | 209 | 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. |
| | 210 | |
| | 211 | --------------------------------------------------------------------------------------------------- |
| | 212 | == Boost.Local == |
| | 213 | * '''Author(s):''' Lorenzo Caminiti |
| | 214 | * '''Version:''' 0.1.0 |
| | 215 | * '''State:''' Review Ready |
| | 216 | * '''Last upload:''' January 03, 2011 |
| | 217 | * '''Review Manager:''' Jeffrey Hellrung |
| | 218 | * '''Expected review date:''' October 24, 2011 - November 2, 2011 |
| | 219 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/local Boost Sandbox] [http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Function%20Objects Boost Vault] [http://svn.boost.org/svn/boost/sandbox/local/libs/local/doc/html/index.html Documentation] |
| | 220 | * '''Categories:''' [#FunctionObjectsAndHigher-orderProgramming Function Objects And Higher-order Programming] |
| | 221 | * '''Description:''' Local functions, local blocks, and local exits. |
| | 222 | |
| | 223 | Local functions are a form of information hiding and are useful for dividing procedural tasks into subtasks which are only meaningful locally, avoiding cluttering other parts of the program with functions, variables, etc unrelated to those parts. Local functions therefore complement other structuring possibilities such as namespaces and classes. |
| | 224 | |
| | 225 | * Local functions can access, or better bind, any of the variables from the enclosing scope. Furthermore, local functions defined within a member function can bind the enclosing object this. |
| | 226 | * The local function body is programmed using the usual C++ syntax. |
| | 227 | * Local functions can be passed as template parameters (so they can be conveniently passed to STL algorithms, etc). |
| | 228 | * However, local functions must be defined within a declarative context (e.g., at a point in the code where local variables can be declared) thus they cannot be defined within an expression. |
| | 229 | |
| | 230 | In addition to local functions, this library also supports the following features: |
| | 231 | |
| | 232 | * Local blocks which define blocks of code that bind variables from the enclosing scope. Local blocks allow programmers to bind variables as constants (constant binding) so to prevent local chunks of code from modifying selected variables. |
| | 233 | * Local exits which define blocks of code that are executed when the enclosing scope is exited (again with support for constant binding and binding of the object this). |
| | 234 | |
| | 235 | --------------------------------------------------------------------------------------------------- |
| | 236 | = Review on going = |
| 271 | | --------------------------------------------------------------------------------------------------- |
| 272 | | == Boost.Integer.Endian == |
| 273 | | * '''Author(s):''' Beman Dawes |
| 274 | | * '''Version:''' |
| 275 | | * '''State:''' |
| 276 | | * '''Last upload:'''2008 Nov 26 |
| 277 | | * '''Inclusion date:''' ??? |
| 278 | | * '''Depends on:''' |
| 279 | | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 280 | | * Missing criteria |
| 281 | | * C1 |
| 282 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 283 | | * '''Review Manager:''' Joel Falcou |
| 284 | | * '''Expected review date:''' September 5, 2011 - September 14, 2011 |
| 285 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox] |
| 286 | | * '''Categories:''' [#Portability Portability] |
| 287 | | * '''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. |
| 288 | | 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. |
| | 279 | |
| | 280 | |
| | 281 | |
| | 282 | --------------------------------------------------------------------------------------------------- |
| | 283 | = Review results pending = |
| | 284 | |
| | 285 | |
| | 286 | --------------------------------------------------------------------------------------------------- |
| | 287 | == Boost.Containers == |
| | 288 | * '''Author(s):''' Ion Gaztañaga |
| | 289 | * '''Version:''' |
| | 290 | * '''State:''' stable. Ready for review. |
| | 291 | * '''Last upload:''' |
| | 292 | * '''Inclusion date:''' 2009 Dec 14 |
| | 293 | * '''Depends on:''' [#Boost.Move Boost.Move] |
| | 294 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 295 | * Missing criteria |
| | 296 | * C1 |
| | 297 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 298 | * '''Review Manager:''' John Maddock |
| | 299 | * '''Expected review date:''' August 3, 2011 - August 12, 2011 |
| | 300 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/move Boost Sandbox] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.move.container.zip&directory=Containers& Download] [http://svn.boost.org/svn/boost/sandbox/move/libs/move/doc/html/index.html Documentation] |
| | 301 | * '''Categories:''' [#Container Container] |
| | 302 | * '''Description:''' Containers of Movable objects emulation using [#Boost.Move Boost.Move] |
| | 303 | |
| 316 | | = Review on going = |
| 317 | | |
| 318 | | |
| 319 | | --------------------------------------------------------------------------------------------------- |
| 320 | | == Boost.TTI== |
| 321 | | * '''Author(s):''' Edward Diener |
| 322 | | * '''Version:''' 1.0 |
| 323 | | * '''State:''' |
| 324 | | * '''Last upload:''' 2011 Feb 6 |
| 325 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/tti Boost Sandbox] |
| 326 | | * '''Categories:''' [#GenericProgramming Generic Programming] |
| 327 | | * '''Review Manager:''' Joel Falcou |
| 328 | | * '''Expected review date:''' July 1, 2011 - July 10, 2011 |
| 329 | | * '''Description:''' The Type Traits Introspection library, or TTI for short, is a library of macros generating metafunctions, and a set of parallel nullary type metafunctions, which provide the ability to introspect by name the elements of a type at compile time. |
| 330 | | |
| 331 | | |
| 332 | | --------------------------------------------------------------------------------------------------- |
| 333 | | = Review results pending = |
| 334 | | |
| 335 | | --------------------------------------------------------------------------------------------------- |
| 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 | | --------------------------------------------------------------------------------------------------- |
| 442 | | * '''State:''' Stable |
| 443 | | * '''Review Manager:''' Anthony Williams |
| 444 | | * '''Categories:''' [#System System] |
| 445 | | * '''Description:''' The Boost Chrono library provides: |
| 446 | | * The C++0x Standard Library's common_type. |
| 447 | | * The C++0x Standard Library's compile-time rational arithmetic. |
| 448 | | * The C++0x Standard Library's time utilities, including: |
| 449 | | * Class template duration |
| 450 | | * Class template time_point |
| 451 | | * Clocks: |
| 452 | | * system_clock |
| 453 | | * monotonic_clock |
| 454 | | * high_resolution_clock |
| 455 | | * typeof registration for classes duration and time_point |
| 456 | | * Process clocks: |
| 457 | | * process_real_CPU_clocks, capturing real-CPU times. |
| 458 | | * process_user_CPU_clocks, capturing user-CPU times. |
| 459 | | * process_system_CPU_clocks, capturing system-CPU times. |
| 460 | | * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. |
| 461 | | * Thread clocks |
| 462 | | |
| 463 | | --------------------------------------------------------------------------------------------------- |
| 464 | | == Boost.Geometry (aka GGL) == |
| 465 | | * '''Author(s):''' Barend Gehrels, Bruno Lalande, Mateusz Loskot |
| 466 | | * '''Version:''' |
| 467 | | * '''Review Manager:''' Hartmut Kaiser |
| 468 | | * '''Review dates:''' November 5, 2009 - November 22, 2009 |
| 469 | | * '''Description:''' Generic Geometry Library (GGL), this was the name before acceptance into Boost |
| 470 | | * '''Links:''' [http://geometrylibrary.geodan.nl/index.html Web site] [http://trac.osgeo.org/ggl Web site and Wiki] [http://svn.boost.org/svn/boost/sandbox/ggl Boost Sandbox] [http://geometrylibrary.geodan.nl/index.html Download] |
| 471 | | * '''Categories:''' [#MathAndNumerics Math And Numerics] |
| | 441 | * '''State:''' |
| | 442 | * '''Last upload:''' 2011 Feb 6 |
| | 443 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/tti Boost Sandbox] |
| | 444 | * '''Categories:''' [#GenericProgramming Generic Programming] |
| | 445 | * '''Review Manager:''' Joel Falcou |
| | 446 | * '''Expected review date:''' July 1, 2011 - July 10, 2011 |
| | 447 | * '''Description:''' The Type Traits Introspection library, or TTI for short, is a library of macros generating metafunctions, and a set of parallel nullary type metafunctions, which provide the ability to introspect by name the elements of a type at compile time. |
| 483 | | == Boost.Phoenix == |
| 484 | | * '''Author(s):''' Joel de Guzman, Dan Marsden, Thomas Heller |
| 485 | | * '''Version:''' 3.0 |
| 486 | | * '''State:''' Stable |
| 487 | | * '''Categories:''' [#FunctionObjectsAndHigher-orderProgramming Function Objects And Higher-order Programming] |
| 488 | | * '''Description:''' Phoenix enables Functional Programming (FP) in C++. |
| 489 | | |
| 490 | | --------------------------------------------------------------------------------------------------- |
| 491 | | == Boost.Ratio == |
| 492 | | * '''Author(s):''' Howard Hinnant, Beman Dawes and Vicente J. Botet Escribá |
| 493 | | * '''Version:''' 0.2.0 |
| 494 | | * '''State:''' Stable |
| 495 | | * '''Categories:''' [#MathAndNumerics Math And Numerics] |
| 496 | | * '''Description:''' The Boost Ratio library provides: |
| 497 | | * The C++0x Standard Library's compile-time rational arithmetic. |
| 498 | | |
| 499 | | The Boost.Ratio library provides: |
| 500 | | |
| 501 | | * A class template, ratio, for specifying compile time rational constants such as 1/3 of a nanosecond or the number of inches per meter. ratio represents a compile time ratio of compile time constants with support for compile time arithmetic with overflow and division by zero protection |
| 502 | | * It provides a textual representation of boost::ratio<N, D> in the form of a std::basic_string. Other types such as boost::duration can use these strings to aid in their I/O. |
| 503 | | |
| 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 | | |
| | 459 | = Rejected = |
| | 460 | |
| | 461 | --------------------------------------------------------------------------------------------------- |
| | 462 | == Boost.Assign.V2 == |
| | 463 | * '''Author(s):''' Ottosen Thorsten, Erwann Rogard |
| | 464 | * '''Version:''' 2.0 |
| | 465 | * '''State:''' On going |
| | 466 | * '''Last upload:''' 2011 Jan 28 |
| | 467 | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/assign_v2 Boost Sandbox] |
| | 468 | * '''Categories:''' [#Containers Containers] |
| | 469 | * '''Review Manager:''' John Bytheway |
| | 470 | * '''Expected review date:''' June 15, 2011 - June 24, 2011 |
| | 471 | * '''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. |
| | 472 | |
