Changes between Version 20 and Version 21 of ReviewScheduleLibraries


Ignore:
Timestamp:
May 8, 2011, 5:24:27 PM (11 years ago)
Author:
viboes
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ReviewScheduleLibraries

    v20 v21  
    5252Unlike 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.
    5353
     54
     55---------------------------------------------------------------------------------------------------
     56== Boost.BlockPtr ==
     57 * '''Author(s):''' Phil Bouchard
     58 * '''Version:'''
     59 * '''State:'''
     60 * '''Last upload:'''
     61 * '''Inclusion date:''' ???
     62 * '''Depends on:'''
     63 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     64     * Missing criteria
     65         * C1
     66 * '''Pre-reviewed by :''' ??? '''people'''
     67 * '''Review Manager:''' Needed
     68 * '''Expected review date:''' ???
     69 * '''Links:''' [https://svn.boost.org/svn/boost/sandbox/block_ptr/ Sandbox]
     70 * '''Categories:''' [#Memory Memory]
     71 * '''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.
    5472
    5573
     
    114132
    115133---------------------------------------------------------------------------------------------------
    116 == Boost.Endian ==
    117  * '''Author(s):''' Beman Dawes
    118  * '''Version:'''
    119  * '''State:'''
    120  * '''Last upload:'''2008 Nov 26
    121  * '''Inclusion date:''' ???
    122  * '''Depends on:'''
    123  * '''Fulfill review criteria checked by :''' ??? '''At:'''
    124      * Missing criteria
    125          * C1
    126  * '''Pre-reviewed by :''' ??? '''people'''
    127  * '''Review Manager:''' Needed
    128  * '''Expected review date:''' ???
    129  * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox]
    130  * '''Categories:''' [#Portability Portability]
    131  * '''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.
    132 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.
    133 
    134 ---------------------------------------------------------------------------------------------------
    135134== Boost.QVM ==
    136135 * '''Author(s):''' Emil Dotchevski
     
    167166 * '''Categories:''' [#Memory Memory]
    168167 * '''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.
     168
     169---------------------------------------------------------------------------------------------------
     170== Boost.TTI==
     171 * '''Author(s):'''  Edward Diener
     172 * '''Version:''' 1.0
     173 * '''State:'''
     174 * '''Last upload:''' 2011 Feb 6
     175 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/tti Boost Sandbox]
     176 * '''Categories:''' [#GenericProgramming Generic Programming]
     177 * '''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.
    169178
    170179---------------------------------------------------------------------------------------------------
     
    223232 * '''Categories:''' [#Container Container]
    224233 * '''Description:''' Containers of Movable objects emulation using [#Boost.Move Boost.Move] 
     234
     235---------------------------------------------------------------------------------------------------
     236== Boost.Endian ==
     237 * '''Author(s):''' Beman Dawes
     238 * '''Version:'''
     239 * '''State:'''
     240 * '''Last upload:'''2008 Nov 26
     241 * '''Inclusion date:''' ???
     242 * '''Depends on:'''
     243 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     244     * Missing criteria
     245         * C1
     246 * '''Pre-reviewed by :''' ??? '''people'''
     247 * '''Review Manager:''' Joel Falcou
     248 * '''Expected review date:''' ???
     249 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox]
     250 * '''Categories:''' [#Portability Portability]
     251 * '''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.
     252These 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.
    225253
    226254---------------------------------------------------------------------------------------------------
     
    485513    * 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.
    486514
    487 ---------------------------------------------------------------------------------------------------
    488 = Rejected or withdraw =
    489 
    490 ---------------------------------------------------------------------------------------------------
    491 == Boost.Convert ==
    492  * '''Author(s):'''  Vladimir Batov
    493  * '''Version:''' 0.36
    494  * '''State:''' Ready
    495  * '''Last upload:''' 2009, Mars 02
    496  * '''Inclusion date:''' ???
    497  * '''Depends on:'''
    498  * '''Fulfill review criteria checked by :''' ??? '''At:'''
    499      * Missing criteria
    500          * C1
    501  * '''Pre-reviewed by :''' ??? '''people'''
    502  * '''Review Manager:''' Edward Diener
    503  * '''Expected review date:''' April 23, 2011 - May 2, 2011-
    504  * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-string-convert.zip&directory=& Boost Vault]
    505  * '''Categories:''' [#StringAndTextProcessing String And Text Processing]
    506  * '''Description:''' Extensible framework for a uniform approach to type-to-type conversions in general. It builds on the lexical_cast past experience, offers the already familiar conversion functionality and more:
    507 
    508    * simple and better/safe conversion-failure check;
    509    * throwing and non throwing conversion-failure behavior;
    510    * support for the default value to be returned when conversion fails;
    511    * formatting support based on the standard I/O Streams and the standard (or user-defined) manipulators (like std::hex, std::scientific, etc.);
    512    * locale support;
    513    * support for boost::range-compliant char and wchar_t-based string containers (std::string, std::wstring, char const*, wchar_t const*, char array[], std::vector<char>, etc.);
    514    * no DefaultConstructibility requirement for the Target type;
    515    * room to grow.
    516 
    517 
    518 
    519 ---------------------------------------------------------------------------------------------------
    520 == Boost.Process ==
    521  * '''Author(s):'''   Boris Schaeling, Ilya Sokolov, Felipe Tanus, Julio M. Merino Vidal
    522  * '''Version:''' v0.4
    523  * '''State:''' On going
    524  * '''Last upload:''' October 08, 2010
    525  * '''Review Manager:''' Marshall Clow
    526  * '''Expected review date:''' February 7. 2011 - February 16, 2011
    527  * '''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]
    528  * '''Categories:''' [#System System]
    529  * '''Description:''' Boost.Process is a library to manage system processes. It can be used to:
    530 
    531         * create child processes
    532         * run shell commands
    533         * setup environment variables for child processes
    534         * setup standard streams for child processes (and other streams on POSIX platforms)
    535         * communicate with child processes through standard streams (synchronously or asynchronously)
    536         * wait for processes to exit (synchronously or asynchronously)
    537         * terminate processes
    538 
    539 ---------------------------------------------------------------------------------------------------
    540 == Boost.XInt ==
    541  * '''Author(s):'''  Chad Nelson
    542  * '''Version:''' 0.6
    543  * '''State:'''
    544  * '''Last upload:''' 2010, Jun 19
    545  * '''Review Manager:''' Vladimir Prus
    546  * '''Expected review date:''' March 2, 2011 - March 12, 2011
    547  * '''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]
    548  * '''Categories:''' [#MathAndNumerics Math And Numerics]
    549  * '''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.
    550 
    551 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.
    552 
    553 
     515
     516