| | 9 | |
| | 10 | --------------------------------------------------------------------------------------------------- |
| | 11 | == Boost.Algorithm.Sorting == |
| | 12 | * '''Author(s):''' Steven Ross |
| | 13 | * '''Version:''' |
| | 14 | * '''State:''' |
| | 15 | * '''Last upload:''' 2009 Jan 13 |
| | 16 | * '''Depends on:''' |
| | 17 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 18 | * Missing criteria |
| | 19 | * C1 |
| | 20 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 21 | * '''Review Manager:''' Needed |
| | 22 | * '''Expected review date:''' ??? |
| | 23 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip&directory=&PHPSESSID=96307fee8086c06036af42fae790b449 Bosst Vault] |
| | 24 | * '''Categories:''' [#Algorithm Algorithm] |
| | 25 | * '''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. |
| | 26 | |
| | 27 | 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. |
| | 28 | |
| | 29 | 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. |
| | 260 | == Boost.Lexer == |
| | 261 | * '''Author(s):''' Ben Hanson |
| | 262 | * '''Version:''' v0.2 |
| | 263 | * '''State:''' |
| | 264 | * '''Last upload:''' 2009 November 24 |
| | 265 | * '''Inclusion date:''' ??? |
| | 266 | * '''Depends on:''' |
| | 267 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 268 | * Missing criteria |
| | 269 | * C1 |
| | 270 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 271 | * '''Review Manager:''' Eric Niebler |
| | 272 | * '''Expected review date:''' ??? |
| | 273 | * '''Links:''' [http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing Boost Vault] |
| | 274 | * '''Categories:''' [#StringAndTextProcessing String And Text Processing] |
| | 275 | * '''Description:''' A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. |
| | 276 | |
| | 277 | |
| | 278 | --------------------------------------------------------------------------------------------------- |
| 266 | | * '''State:''' stable |
| 267 | | * '''Last upload:''' |
| 268 | | * '''Inclusion date:''' ??? |
| 269 | | * '''Depends on:''' |
| 270 | | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| 271 | | * Missing criteria |
| 272 | | * C1 |
| 273 | | * '''Pre-reviewed by :''' ??? '''people''' |
| 274 | | * '''Review Manager:''' Needed |
| | 306 | * '''State:''' Review Ongoing |
| | 307 | * '''Last upload:''' |
| | 308 | * '''Inclusion date:''' ??? |
| | 309 | * '''Depends on:''' |
| | 310 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 311 | * Missing criteria |
| | 312 | * C1 |
| | 313 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 314 | * '''Review Manager:''' OvermindDL1 |
| | 320 | |
| | 321 | |
| | 322 | --------------------------------------------------------------------------------------------------- |
| | 323 | == Boost.Pimpl == |
| | 324 | * '''Author(s):''' Vladimir Batov |
| | 325 | * '''Version:''' |
| | 326 | * '''State:''' |
| | 327 | * '''Last upload:''' |
| | 328 | * '''Inclusion date:''' ??? |
| | 329 | * '''Depends on:''' |
| | 330 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 331 | * Missing criteria |
| | 332 | * C1 |
| | 333 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 334 | * '''Review Manager:''' Needed |
| | 335 | * '''Expected review date:''' ??? |
| | 336 | * '''Links:''' [http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=Pimpl.zip&directory=& Boost Vault] [http://www.ddj.com/cpp/205918714 Documentation] |
| | 337 | * '''Categories:''' [#Memory Memory] |
| | 338 | * '''Description:''' The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. |
| | 339 | |
| | 340 | --------------------------------------------------------------------------------------------------- |
| | 341 | == Boost.!ShiftedPointer == |
| | 342 | * '''Author(s):''' Phil Bouchard |
| | 343 | * '''Version:''' |
| | 344 | * '''State:''' |
| | 345 | * '''Last upload:''' |
| | 346 | * '''Inclusion date:''' ??? |
| | 347 | * '''Depends on:''' |
| | 348 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 349 | * Missing criteria |
| | 350 | * C1 |
| | 351 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 352 | * '''Review Manager:''' Needed |
| | 353 | * '''Expected review date:''' ??? |
| | 354 | * '''Links:''' [http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=Memory Boost Vault] |
| | 355 | * '''Categories:''' [#Memory Memory] |
| | 356 | * '''Description:''' Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. |
