Changes between Version 1 and Version 2 of ReviewScheduleLibraries


Ignore:
Timestamp:
May 16, 2010, 6:50:40 PM (12 years ago)
Author:
viboes
Comment:

Added some libraries from the review schedule

Legend:

Unmodified
Added
Removed
Modified

  • ReviewScheduleLibraries

    v1 v2  
    1 Page under construction ...
     1[[PageOutline]]
     2
     3WARNING: The contents of this page could be incomplete and outdated. Please help us to improve this page by modifying it directly or posting on the Boost mailing lists [mailto:boost-AT-lists.boost.org] or [mailto:boost-users-AT-lists.boost.org] with the prefix `[ReviewScheduleLibraries].
     4
     5---------------------------------------------------------------------------------------------------
     6= Review Schedule =
     7
     8This section contains an index for libraries on the review schedule.
     9
     10---------------------------------------------------------------------------------------------------
     11== Boost.Bitfield ==
     12 * '''Author(s):''' Emile Cormier, Vicente J. Botet Escribá
     13 * '''Version:''' 0.2
     14 * '''State:''' Stable
     15 * '''Inclusion date:''' 2009 May 4
     16 * '''Last upload:''' 2009 October 15
     17 * '''Depends on:''' [#Boost.Endian Endian]
     18 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     19     * Missing criteria
     20         * C1
     21 * '''Pre-reviewed by :''' ??? '''people'''
     22 * '''Review Manager:''' Needed
     23 * '''Expected review date:''' ???
     24 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bitfield.zip&directory=Portability&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault][http://svn.boost.org/svn/boost/sandbox/bitfield Boost Sandbox][http://svn.boost.org/svn/boost/sandbox/bitfield/libs/integer/doc/index.html Documentation]
     25 * '''Categories:''' Endian Portability, Integers
     26 * '''Description:'''Portable bitfields traits
     27     * a generic bitfield traits class providing generic getter and setter methods.
     28     * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions.
     29
     30{{{
     31#!cpp
     32    struct X {
     33        typedef boost::ubig_32 storage_type;
     34        storage_type d0;
     35        typedef unsigned int value_type;
     36        BOOST_BITFIELD_DCL(storage_type, d0, unsigned int, d00, 0, 10);
     37        BOOST_BITFIELD_DCL(storage_type, d0, unsigned int, d01, 11, 31);
     38    };
     39}}}
     40
     41 * '''Pre-reviews'''
     42   * '''Reviewer''' ???
     43       * '''Date''' ???
     44       * '''Description''' ???
     45
     46---------------------------------------------------------------------------------------------------
     47== Boost.Chrono ==
     48 * '''Author(s):''' Howard Hinnant, Beman Dawes and Vicente J. Botet Escribá
     49 * '''Version:''' 0.3.1
     50 * '''State:''' Stable
     51 * '''Inclusion date:''' 2009 Dec 14
     52 * '''Last upload:'''2010 January 17
     53 * '''Depends on:''' None
     54 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     55     * Missing criteria
     56         * C1
     57 * '''Pre-reviewed by :''' ??? '''people'''
     58 * '''Review Manager:''' Needed
     59 * '''Expected review date:''' ???
     60 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html Documentation] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono.zip&directory=System& Download]  [http://svn.boost.org/svn/boost/sandbox/chrono Boost Sandbox]
     61 * '''Categories:''' [#System System]
     62 * '''Description:''' The Boost Chrono library provides:
     63    *  The C++0x Standard Library's common_type.
     64    *  The C++0x Standard Library's compile-time rational arithmetic.
     65    *  The C++0x Standard Library's time utilities, including:
     66          * Class template duration
     67          * Class template time_point
     68          * Clocks:
     69                * system_clock
     70                * monotonic_clock
     71                * high_resolution_clock   
     72          * typeof registration for classes duration  and time_point
     73    *  Process clocks:
     74        * process_real_CPU_clocks, capturing real-CPU times.
     75        * process_user_CPU_clocks, capturing user-CPU times.
     76        * process_system_CPU_clocks, capturing system-CPU times.
     77        * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times.
     78    * Stopwatches:
     79        * stopwatch, capturing elapsed Clock times.
     80        * stopwatch_accumulator, capturing cumulated elapsed Clock times.
     81        * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch.
     82    * Stopclocks or Stopwatch reporters:
     83        * stopwatch_reporter, convenient reporting of models of Stopwatch results.
     84        * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>>.
     85        * Support for wide characters (strings and ostreams).
     86
     87---------------------------------------------------------------------------------------------------
     88== Boost.Containers ==
     89 * '''Author(s):'''  Ion Gaztañaga
     90 * '''Version:'''
     91 * '''State:''' stable
     92 * '''Last upload:'''
     93 * '''Inclusion date:''' 2009 Dec 14
     94 * '''Depends on:''' Boost.Move
     95 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     96     * Missing criteria
     97         * C1
     98 * '''Pre-reviewed by :''' ??? '''people'''
     99 * '''Review Manager:''' Needed
     100 * '''Expected review date:''' ???
     101 * '''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]
     102 * '''Categories:''' [#Container Container]
     103 * '''Description:''' Containers of Movable objects emulation using [#Boost.Move Boost.Move] 
     104
     105---------------------------------------------------------------------------------------------------
     106== Boost.Conversion ==
     107
     108 * '''Author(s):''' Vicente J. Botet Escribá
     109 * '''Version:''' 0.4
     110 * '''State:''' Stable - Formal review requested - Looking for a review manager
     111 * '''Last upload:'''2009 October 27
     112 * '''Inclusion date:''' ???
     113 * '''Depends on:'''
     114 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     115     * Missing criteria
     116         * C1
     117 * '''Pre-reviewed by :''' ??? '''people'''
     118 * '''Review Manager:''' Needed
     119 * '''Expected review date:''' ???
     120 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=conversion.zip&directory=Utilities& Boost Vault] [http://svn.boost.org/svn/boost/sandbox/conversion Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/conversion/libs/conversion/doc/index.html Documentation]
     121 * '''Categories:''' [#Utilities Utilities]
     122 * '''Description:'''  Generic explicit conversion between unrelated types.
     123
     124The template function convert_to  allows to convert a source type to a target type, using argument dependent lookup to select a specialized convert_to function if available. If no specialized convert_to function is available, boost::conversion::convert_to is used.
     125
     126The generic convert_to function requires that the elements to be converted are assignable and copy constructible. It is implemented using the Target copy construction from a Source or the Source conversion operator Target - this is sometimes unavailable.
     127
     128For standard types, we can not add a specialized convert_to function on the namespace std. The alternative to using argument dependent lookup in this situation is to provide a template specialization of boost::conversion::convert_to for every pair of standard types that requires a specialized convert_to.
     129
     130Boost.Conversion provides:
     131
     132 * a generic convert_to function which can be specialized by the user to make explicit conversion between unrelated types.
     133 * a generic assign_to function which can be specialized by the user to make explicit assignation between unrelated types.
     134 * a generic mca/tie function returning a wrapper which replace assignments by a call to assign_to  and conversion operators by a call convert_to.
     135 * a generic convert_to_via function which convert a type From to another To using a temporary one Via.
     136 * conversion between std::complex of explicitly convertible types.
     137 * conversion between std::pair of explicitly convertible types.
     138 * conversion between boost::optional of explicitly convertible types.
     139 * conversion between boost::rational of explicitly convertible types.
     140 * conversion between boost::interval of explicitly convertible types.
     141 * conversion between boost::chrono::time_point and boost::ptime.
     142 * conversion between boost::chrono::duration and boost::time_duration.
     143 * conversion between boost::array of explicitly convertible types.
     144 * conversion between Boost.Fusion sequences of explicitly convertible types.
     145
     146---------------------------------------------------------------------------------------------------
     147== Boost.Convert ==
     148 * '''Author(s):'''  Vladimir Batov
     149 * '''Version:''' 0.36
     150 * '''State:''' Review Requested
     151 * '''Last upload:''' 2009, Mars 02
     152 * '''Inclusion date:''' ???
     153 * '''Depends on:'''
     154 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     155     * Missing criteria
     156         * C1
     157 * '''Pre-reviewed by :''' ??? '''people'''
     158 * '''Review Manager:''' Needed
     159 * '''Expected review date:''' ???
     160 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-string-convert.zip&directory=& Boost Vault]
     161 * '''Categories:''' [#StringAndTextProcessing String And Text Processing]
     162 * '''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:
     163
     164   * simple and better/safe conversion-failure check;
     165   * throwing and non throwing conversion-failure behavior;
     166   * support for the default value to be returned when conversion fails;
     167   * formatting support based on the standard I/O Streams and the standard (or user-defined) manipulators (like std::hex, std::scientific, etc.);
     168   * locale support;
     169   * 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.);
     170   * no DefaultConstructibility requirement for the Target type;
     171   * room to grow.
     172
     173---------------------------------------------------------------------------------------------------
     174== Boost.Endian ==
     175 * '''Author(s):''' Beman Dawes
     176 * '''Version:'''
     177 * '''State:'''
     178 * '''Last upload:'''2008 Nov 26
     179 * '''Inclusion date:''' ???
     180 * '''Depends on:'''
     181 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     182     * Missing criteria
     183         * C1
     184 * '''Pre-reviewed by :''' ??? '''people'''
     185 * '''Review Manager:''' Needed
     186 * '''Expected review date:''' ???
     187 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/endian Boost Sandbox]
     188 * '''Categories:''' [#Portability Portability]
     189 * '''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.
     190These 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.
     191
     192---------------------------------------------------------------------------------------------------
     193== Boost.Fiber ==
     194 * '''Author(s):'''  Oliver Kowalke
     195 * '''Version:'''
     196 * '''State:'''
     197 * '''Last upload:'''2009
     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:''' Needed
     205 * '''Expected review date:''' ???
     206 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-fiber.v2.tar.gz&directory=Concurrent%20Programming& Boost Vault]
     207 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
     208 * '''Description:''' Boost.Fiber implements lightweight threads of execution - so called fibers
     209
     210---------------------------------------------------------------------------------------------------
     211== Boost.!InterThreads ==
     212 * '''Author(s):''' Vicente J. Botet Escribá
     213 * '''Version:''' 0.1.3
     214 * '''State:''' Stable - Formal review requested - Looking for a review manager
     215 * '''Last upload:''' 2009 April 02
     216 * '''Inclusion date:''' ???
     217 * '''Depends on:'''
     218 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     219     * Missing criteria
     220         * C1
     221 * '''Pre-reviewed by :''' ??? '''people'''
     222 * '''Review Manager:''' Needed
     223 * '''Expected review date:''' ???
     224 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=interthreads.zip&directory=Concurrent%20Programming& Boost Vault] [http://svn.boost.org/svn/boost/sandbox/interthreads Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/interthreads/libs/interthreads/doc/index.html Documentation]
     225 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
     226 * '''Description:'''  Boost.!InterThreads extends Boost.Threads adding some features:
     227     * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit.
     228     * thread_decorator can now decorate a nullary function in addition to a callable function
     229     * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one.
     230     * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program.
     231     * thread tuple: defines a thread group where the number of threads is know statically and the threads are created at construction time.
     232     * set_once: a synchronizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that.
     233     * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer.
     234     * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer.
     235 
     236thread_decorator and thread_specific_shared_ptr are based on the original implementation of threadalert written by Roland Schwarz.
     237
     238---------------------------------------------------------------------------------------------------
     239== Boost.!LockFree ==
     240 * '''Author(s):''' Tim Blechmann 
     241 * '''Version:''' v0.2
     242 * '''State:'''
     243 * '''Last upload:''' 2009 November 24
     244 * '''Inclusion date:''' ???
     245 * '''Depends on:'''
     246 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     247     * Missing criteria
     248         * C1
     249 * '''Pre-reviewed by :''' ??? '''people'''
     250 * '''Review Manager:''' Needed
     251 * '''Expected review date:''' ???
     252 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost_lockfree-170809.zip&directory=Concurrent%20Programming& Boost Vault] [http://tim.klingt.org/git?p=boost_lockfree.git Git] [http://tim.klingt.org/boost_lockfree Documentation]
     253 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] [#Containers Containers]
     254 * '''Description:'''  Provides implementations of lock-free data structures. Lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. Lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines.
     255
     256The following data structures are provided:
     257
     258* boost::lockfree::fifo, a lock-free fifo queue
     259* boost::lockfree::stack, a lock-free stack
     260* boost::lockfree::atomic_int, an atomic integer class
     261
     262---------------------------------------------------------------------------------------------------
     263== Boost.Move ==
     264 * '''Author(s):'''  Ion Gaztañaga
     265 * '''Version:'''
     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
     275 * '''Expected review date:''' ???
     276 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/move Boost Sandbox] [http://www.drivehq.com/web/igaztanaga/libs/move_semantics/
     277 Documentation] [http://www.drivehq.com/web/igaztanaga/move_semantics.zip Download]
     278 * '''Categories:''' [#GenericProgramming Generic Programming] [#LanguageFeaturesEmulation Language Features Emulation]
     279 * '''Description:''' Move semantics emulation library 
     280
     281---------------------------------------------------------------------------------------------------
     282== Boost.Task  ==
     283 * '''Author(s):''' Oliver Kowalke
     284 * '''Version:''' 0.2.1
     285 * '''State:''' Quite Stable
     286 * '''Last upload:''' 2009 June 25
     287 * '''Inclusion date:''' ???
     288 * '''Depends on:''' Boost.Fiber, Boost.Atomic
     289 * '''Fulfill review criteria checked by :''' ??? '''At:'''
     290     * Missing criteria
     291         * C1
     292 * '''Pre-reviewed by :''' ??? '''people'''
     293 * '''Review Manager:''' Needed
     294 * '''Expected review date:''' ???
     295 * '''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]
     296 * '''Categories:''' [#ConcurrentProgramming Concurrent Programming]
     297 * '''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
     298
     299---------------------------------------------------------------------------------------------------
     300---------------------------------------------------------------------------------------------------
     301= Accepted Libraries =
     302
     303---------------------------------------------------------------------------------------------------
     304== Boost.Geometry (aka GGL) ==
     305 * '''Author(s):''' Barend Gehrels, Bruno Lalande, Mateusz Loskot
     306 * '''Version:'''
     307 * '''State:''' [http://lists.boost.org/boost-announce/2009/11/0245.php Accepted]
     308 * '''Review Manager:''' Hartmut Kaiser
     309 * '''Review dates:''' November 5, 2009 - November 22, 2009
     310 * '''Accepted date:''' ???
     311 * '''Expected completion date:''' ???
     312 * '''Included in trunk date:''' ???
     313 * '''Expected release date:''' ???
     314 * '''Last upload:''' 2010 February
     315 * '''Description:''' Generic Geometry Library (GGL), this was the name before acceptance into Boost
     316 * '''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]
     317 * '''Categories:''' [#MathAndNumerics Math And Numerics]
     318
     319
     320== Boost.Log ==
     321 * '''Author(s):''' Andrey Semashev `[mailto:andrey.semashev__AT__gmail.com]
     322 * '''Version:''' RC3
     323 * '''State:''' [http://lists.boost.org/boost-announce/2010/03/0256.php Accepted Provisionally]
     324 * '''Review Manager:''' Vladimir Prus
     325 * '''Review dates:''' March 8, 2010 - March 17, 2010
     326 * '''Accepted date:''' ???
     327 * '''Expected completion date:''' ???
     328 * '''Included in trunk date:''' ???
     329 * '''Expected release date:''' ???
     330 * '''Last upload:''' ???
     331[http://boost-log.sourceforge.net Home Page] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=BoostLog.zip&directory=& Review Version]
     332 * '''Categories:''' [#InputOutput Input/Output]
     333 * '''Description:'''  This library aims to make logging significantly easier for the application developer. It provides a wide range of out-of-box tools, along with public interfaces ready to be used to extend the library. The main goals of the library are:
     334    * Simplicity. A small example code snippet should be enough to get the feel of the library and be ready to use its basic features.
     335    * Extensibility. A user should be able to extend functionality of the library with regard to collecting and storing information into logs.
     336    * Performance. The library should make as least performance impact on the user's application as possible.
     337
     338== Boost.ITL ==
     339 * '''Author(s):''' Joachim Faulhaber
     340 * '''Version:''' ???
     341 * '''State:''' [http://lists.boost.org/boost-announce/2010/04/0257.php Accepted]
     342 * '''Review Manager:''' Hartmut Kaiser
     343 * '''Review dates:''' February 18, 2010 - February 27, 2010
     344 * '''Accepted date:''' ???
     345 * '''Expected completion date:''' ???
     346 * '''Included in trunk date:''' ???
     347 * '''Expected release date:''' ???
     348 * '''Last upload:''' ???
     349 * '''Links:''' [http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Documentation] [http://svn.boost.org/svn/boost/sandbox/itl/ Boost Sandbox] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=itl_3_1_0.zip&directory=Containers Boost Vault]
     350 * '''Categories:''' Containers
     351 * '''Description:''' The Interval Template Library (ITL) provides '''intervals''' and two kinds of interval containers: '''interval_sets''' and '''interval_maps'''. Interval_sets and maps can be used just as the sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. In addition to common set and map semantics, interval containers are capable to compute with segmentation. A segmentation, e.g. a grid of months, can be intersected into other interval containers and then be iterated over. Finally interval_maps allow for aggregations on associated values, if added intervals overlap with intervals, that are stored in the interval_map. This feature is called '''aggregate on overlap'''.
     352
     353---------------------------------------------------------------------------------------------------
     354== Boost.Msm ==
     355 * '''Author(s):'''  Christophe Henry
     356 * '''Version:''' 1.10
     357 * '''State:''' [http://lists.boost.org/Archives/boost/2010/01/160812.php Accepted]
     358 * '''Review Manager:''' Dave Abrahams
     359 * '''Review dates:''' November 23, 2009 - December 13, 2009
     360 * '''Accepted date:''' ???
     361 * '''Expected completion date:''' ???
     362 * '''Included in trunk date:''' ???
     363 * '''Expected release date:''' ???
     364 * '''Last upload:'''
     365 * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Msm1.10.zip&directory=Msm&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault][http://svn.boost.org/svn/boost/sandbox/msm Boost Sandbox]
     366 * '''Categories:''' [#DataStructures Data Structures]
     367 * '''Description:''' Msm is a framework which enables you to build a Finite State Machine in a straightforward, descriptive and easy-to-use manner . It requires minimal effort to generate a working program from an UML state machine diagram. This work was inspired by the state machine described in the book of David Abrahams and Aleksey Gurtovoy “C++ Template Metaprogramming” and adds most of what UML Designers are expecting from an UML State Machine framework(entry/exit actions, guards, composite states, orthogonal zones, history...).
     368
     369---------------------------------------------------------------------------------------------------
     370== Boost.Polygon ==
     371 * '''Author(s):''' Simonson, Lucanus J
     372 * '''Version:''' v0.1
     373 * '''State:''' [http://lists.boost.org/boost-announce/2009/11/0239.php Accepted]
     374 * '''Review Manager:''' Fernando Cacciola
     375 * '''Review dates:''' August 24, 2009 - September 2, 2009
     376 * '''Accepted date:''' ???
     377 * '''Expected completion date:''' ???
     378 * '''Included in trunk date:''' ???
     379 * '''Expected release date:''' ???
     380 * '''Last upload:'''
     381 * '''Last upload:''' 2009 February 17
     382 * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/gtl Boost Sanbox]
     383 * '''Categories:''' [#MathAndNumerics Math And Numerics]
     384 * '''Description:''' The boost polygon library provides algorithms focused on manipulating planar polygon geometry data.  Specific algorithms provided are the polygon set operations (intersection, union, difference, disjoint-union) and related algorithms such as polygon connectivity graph extraction, offsetting and map-overlay.  An example of the disjoint-union (XOR) of figure a and figure b is shown below in figure c.  These so-called Boolean algorithms are of significant interest in GIS (Geospatial Information Systems), VLSI CAD as well al other fields of CAD, and many more application areas, and providing them is the primary focus of this library.  The polygon library is not intended to cover all of computational geometry in its scope, and provides a set of capabilities for working with coordinates, points, intervals and rectangles that are needed to support implementing and interacting with polygon data structures and algorithms.  Specifically, 3d and non-Cartesian/non-planar geometry is outside of the scope of the polygon library.
     385