Changes between Version 5 and Version 6 of ReviewScheduleLibraries

Timestamp:

Dec 2, 2010, 10:07:49 PM (12 years ago)

Author:

viboes

Comment:

--

ReviewScheduleLibraries

@@ -144 +144 @@
 
 ---------------------------------------------------------------------------------------------------
+== Boost.Context ==
+ * '''Author(s):'''  Oliver Kowalke 
+ * '''Version:''' 0.2 
+ * '''State:''' 
+ * '''Last upload:'''2010 August 23
+ * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.context-0.2.0.zip&directory=Concurrent%20Programming& Boost Vault] 
+ * '''Categories:''' [#ConcurrentProgramming Concurrent Programming] 
+ * '''Description:''' Boost.Context provides framework for user-context swapping/switching - has assembler for some platforms
+ 
+
+---------------------------------------------------------------------------------------------------
 == Boost.Conversion ==
 
@@ -376 +387 @@
 
 ---------------------------------------------------------------------------------------------------
+== Boost.Process ==
+ * '''Author(s):'''   Boris Schaeling, Ilya Sokolov, Felipe Tanus, Julio M. Merino Vidal
+ * '''Version:''' v0.4
+ * '''State:''' On going
+ * '''Last upload:''' October 08, 2010 
+ * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/SOC/2010/process Boost Sandbox] [http://www.highscore.de/boost/gsoc2010/process.zip Download]
+ * '''Categories:''' [#System System] 
+ * 
+---------------------------------------------------------------------------------------------------
 == Boost.!ShiftedPointer ==
  * '''Author(s):''' Phil Bouchard
@@ -393 +413 @@
  * '''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.
 
+---------------------------------------------------------------------------------------------------
+== Boost.Stopwatches ==
+ * '''Author(s):''' Vicente J. Botet Escribá 
+ * '''Version:''' 0.1.0
+ * '''State:''' Stable
+ * '''Last upload:'''2010 September 7
+ * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/chrono/libs/stopwatches/doc/html Documentation] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=stopwatches.zip&directory=System& Download]  [http://svn.boost.org/svn/boost/sandbox/chrono Boost Sandbox] 
+ * '''Categories:''' [#System System] 
+ * '''Description:''' The Boost Ratio library provides:
+    * Stopwatches:
+        * stopwatch, capturing elapsed Clock times.
+        * stopwatch_accumulator, capturing cumulated elapsed Clock times.
+        * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch.
+    * Stopwatch reporters:
+        * stopwatch_reporter, convenient reporting of models of Stopwatch results.
+        * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>>.
+        * Support for wide characters (strings and ostreams).
 ---------------------------------------------------------------------------------------------------
 == Boost.Task  ==
@@ -413 +450 @@
 
 ---------------------------------------------------------------------------------------------------
-== Boost.TypeTraits.Extensions  ==
+== Boost.!TypeTraits.Extensions  ==
  * '''Author(s):''' Frédéric Bron
  * '''Version:''' ???
@@ -491 +528 @@
  * '''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'''.
 
+---------------------------------------------------------------------------------------------------
+== Boost.Ratio==
+ * '''Author(s):''' Howard Hinnant, Beman Dawes and Vicente J. Botet Escribá 
+ * '''Version:''' 0.2.0
+ * '''State:''' Stable
+ * '''Last upload:'''2010 September 22
+ * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/chrono/libs/ratio/doc/html/index.html Documentation] [http://svn.boost.org/svn/boost/sandbox/chrono/libs/ratio/doc/ratio.pdf PDF] [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=ratio.zip&directory=Math%20-%20Numerics& Download]  [http://svn.boost.org/svn/boost/sandbox/chrono Boost Sandbox] 
+ * '''Categories:''' [#MathAndNumerics Math And Numerics] 
+ * '''Description:''' The Boost Ratio library provides:
+    * The C++0x Standard Library's compile-time rational arithmetic.
+
+ The Boost.Ratio library provides:
+
+    * A class template, ratio, for specifying compile time rational constants such as 1/3 of a nanosecond or the number of inches per meter. ratio represents a compile time ratio of compile time constants with support for compile time arithmetic with overflow and division by zero protection
+    * 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.
+
+