| | 537 | --------------------------------------------------------------------------------------------------- |
| | 538 | == Boost.Lexer == |
| | 539 | * '''Author(s):''' Ben Hanson |
| | 540 | * '''Version:''' v0.2 |
| | 541 | * '''State:''' Not ready. Seems Lexer is been rewritten. |
| | 542 | * '''Last upload:''' 2009 November 24 |
| | 543 | * '''Inclusion date:''' ??? |
| | 544 | * '''Depends on:''' |
| | 545 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 546 | * Missing criteria |
| | 547 | * C1 |
| | 548 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 549 | * '''Review Manager:''' Eric Niebler |
| | 550 | * '''Expected review date:''' ??? |
| | 551 | * '''Links:''' [http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing Boost Vault] |
| | 552 | * '''Categories:''' [#StringAndTextProcessing String And Text Processing] |
| | 553 | * '''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. |
| | 554 | |
| | 873 | |
| | 874 | --------------------------------------------------------------------------------------------------- |
| | 875 | == Boost.!ShiftedPointer == |
| | 876 | * '''Author(s):''' Phil Bouchard |
| | 877 | * '''Version:''' |
| | 878 | * '''State:''' |
| | 879 | * '''Last upload:''' |
| | 880 | * '''Inclusion date:''' ??? |
| | 881 | * '''Depends on:''' |
| | 882 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 883 | * Missing criteria |
| | 884 | * C1 |
| | 885 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 886 | * '''Review Manager:''' Needed |
| | 887 | * '''Expected review date:''' ??? |
| | 888 | * '''Links:''' [http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=Memory Boost Vault] |
| | 889 | * '''Categories:''' [#Memory Memory] |
| | 890 | * '''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. |
| | 891 | |
| | 892 | |
| | 893 | |
| | 1006 | == Boost.Task == |
| | 1007 | * '''Author(s):''' Oliver Kowalke |
| | 1008 | * '''Version:''' 0.2.1 |
| | 1009 | * '''State:''' Quite Stable |
| | 1010 | * '''Last upload:''' 2009 June 25 |
| | 1011 | * '''Inclusion date:''' ??? |
| | 1012 | * '''Depends on:''' Boost.Fiber, Boost.TaskLet, Boost.Atomic |
| | 1013 | * '''Fulfill review criteria checked by :''' ??? '''At:''' |
| | 1014 | * Missing criteria |
| | 1015 | * C1 |
| | 1016 | * '''Pre-reviewed by :''' ??? '''people''' |
| | 1017 | * '''Review Manager:''' Vicente Botet |
| | 1018 | * '''Expected review date:''' ??? |
| | 1019 | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.task-0.2.1.zip&directory=Concurrent%20Programming&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault] [http://svn.boost.org/svn/boost/sandbox/task Boost Sandbox] [http://gitorious.org/~k-oli/boost-dev/k-olis-boost GitHub Sandbox] |
| | 1020 | * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] |
| | 1021 | * '''Description:''' execute tasks in threadpool, in new thread or as sub-task and let the result be transfered via a future. support task interruption, work-stealing and fork/join semantics |
| | 1022 | |
| | 1023 | --------------------------------------------------------------------------------------------------- |
