Changes between Version 15 and Version 16 of ReviewScheduleLibraries


Ignore:
Timestamp:
Feb 8, 2011, 6:03:49 AM (12 years ago)
Author:
viboes
Comment:

Update githup for Context,Fiber,Task

Legend:

Unmodified
Added
Removed
Modified
  • ReviewScheduleLibraries

    v15 v16  
    2222 * '''Review Manager:''' Needed
    2323 * '''Expected review date:''' ???
    24  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-fiber.v2.tar.gz&directory=Concurrent%20Programming& Boost Vault]
     24 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-fiber.v2.tar.gz&directory=Concurrent%20Programming& Boost Vault] [http://gitorious.org/~k-oli/boost-dev/k-olis-boost GitHub Sandbox]
    2525 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
    2626 * '''Description:''' Boost.Fiber implements lightweight threads of execution - so called fibers
     
    6464 * '''Review Manager:''' Vicente Botet
    6565 * '''Expected review date:''' ???
    66  * '''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]
     66 * '''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]
    6767 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
    6868 * '''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
     
    463463 * '''Review Manager:''' Vicente Botet
    464464 * '''Expected review date:'''March 21, 2011 - March 30, 2011
    465  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.context-0.6.1.zip&directory=Concurrent%20Programming& Boost Vault]
     465 * '''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]
    466466 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
    467467 * '''Description:''' Boost.Context provides framework for user-context swapping/switching - has assembler for some platforms.
    468468 
     469---------------------------------------------------------------------------------------------------
     470== Boost.XInt ==
     471 * '''Author(s):'''  Chad Nelson
     472 * '''Version:''' 0.6
     473 * '''State:'''
     474 * '''Last upload:''' 2010, Jun 19
     475 * '''Review Manager:''' Vladimir Prus
     476 * '''Expected review date:''' March 2, 2011 - March 12, 2011
     477 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/xint Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/xint/libs/xint/index.html Boost Documentation]
     478 * '''Categories:''' [#MathAndNumerics Math And Numerics]
     479 * '''Description:''' It's a C++ library that lets your program handle much, much larger integer numbers than the built-in int, long, or even long long types, and handle them using the same syntax that C and C++ use for the built-in integer types.
     480
     481The maximum size of the integer is limited only by the memory available to store it. In practice that's millions of hexadecimal digits, so it's effectively infinite.
     482
     483       
     484---------------------------------------------------------------------------------------------------
     485= Review on going =
    469486
    470487---------------------------------------------------------------------------------------------------
     
    478495 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/SOC/2010/process Boost Sandbox] [http://www.highscore.de/boost/gsoc2010/process.zip Download] [http://www.highscore.de/boost/gsoc2010/ Documentation]
    479496 * '''Categories:''' [#System System]
    480  *
    481 
    482 ---------------------------------------------------------------------------------------------------
    483 == Boost.XInt ==
    484  * '''Author(s):'''  Chad Nelson
    485  * '''Version:''' 0.6
    486  * '''State:'''
    487  * '''Last upload:''' 2010, Jun 19
    488  * '''Review Manager:''' Vladimir Prus
    489  * '''Expected review date:''' March 2, 2011 - March 12, 2011
    490  * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/xint Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/xint/libs/xint/index.html Boost Documentation]
    491  * '''Categories:''' [#MathAndNumerics Math And Numerics]
    492  * '''Description:''' It's a C++ library that lets your program handle much, much larger integer numbers than the built-in int, long, or even long long types, and handle them using the same syntax that C and C++ use for the built-in integer types.
    493 
    494 The maximum size of the integer is limited only by the memory available to store it. In practice that's millions of hexadecimal digits, so it's effectively infinite.
    495 
    496        
    497 ---------------------------------------------------------------------------------------------------
    498 = Review on going =
     497 * '''Description:''' Boost.Process is a library to manage system processes. It can be used to:
     498
     499        * create child processes
     500        * run shell commands
     501        * setup environment variables for child processes
     502        * setup standard streams for child processes (and other streams on POSIX platforms)
     503        * communicate with child processes through standard streams (synchronously or asynchronously)
     504        * wait for processes to exit (synchronously or asynchronously)
     505        * terminate processes
    499506
    500507---------------------------------------------------------------------------------------------------