headers
Tobias Schwinger | 1 Apr 2006 17:06

[review] promotion traits

The review of Alexander Nasonov's Promotion Traits start today. Since it's a small contribution it will be
fast-track reviewed and the end of the review period is scheduled for April 6.

Download URL
============

    http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz

About the submission
====================

The Promotion Traits extend Boost.TypeTraits with templates that compute the type after promotion has
been applied.

Example:

   // given
   template<typename T> struct some_algorithm;
   template<> struct some_algorithm<int> { [...] };
   // [...] more specializations

   // ,

   [...] some_algorithm< typename integral_promotion<T>::type > [...]
   // makes some_algorithm work for any type T that promotes to an integer
   // (that is enums and smaller integral types) without the need for 
   // additional specialization

Review questions
================
(Continue reading)

Permalink | Reply | 0 comments |
headers
Tobias Schwinger | 6 Apr 2006 19:27

[review] promotion traits - review period extended until April 9.

Dear users & members of Boost,

I decided to extend the review period of the fast-track review for 
Promotion Traits until April 9 because there were only three reviews 
until now. 
That is, you have another three days to submit your evaluation of the 
proposed Boost software. 

Cheer up, it's a small & fast-to-track submission! We're very much looking 
forward to your reviews.

Download URL
============

    http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz

About the submission
====================

The Promotion Traits extend Boost.TypeTraits with templates that compute the type after promotion has
been applied.

Example:

   // given
   template<typename T> struct some_algorithm;
   template<> struct some_algorithm<int> { [...] };
   // [...] more specializations

   // ,
(Continue reading)

Permalink | Reply | 0 comments |
headers
Tobias Schwinger | 12 Apr 2006 22:47

[review] promotion traits - result

Dear Boost community,

Alexander Nasonov's Promotion Traits have been accepted conditionally
into Boost with 4/4 positive votes.

The conditions are

  - an example must be added to the documentation (plus accompanying 
    source code for the example folder),
  - the reference should be clarified (cv-qualification, bit fields)

  - further conditions might arise from the merger with the extended 
    library (TypeTraits) and are subject to synchronization with the 
    library maintainer (John Maddock).

Thanks to Alexander for the submission and to our reviewers for their
work!

Regards,
Tobias

(Review Manager)

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce
Permalink | Reply | 0 comments |
headers
Thorsten Ottosen | 19 Apr 2006 12:48
Favicon

[Boost Review] Property Tree Library

Dear All,

I have the great pleasure to announce that the formal boost-review of 
Marcin Kalicinski Property Tree Library begins now (the 18th of April) 
and runs through the 27th of April.

Introduction
------------

This fairly high-level library consists of the following
facilities:

1. a generic recursive property-tree data-structure

2. generic conversions to/from this data-structure from/to

  a. xml-files

  b. ini-flies

  c. json-files

  d. windows registry files

As an example of how powerful the library is, consider this
tutorial:

- http://kaalus.atspace.com/ptree/doc/index.html#five_minute_tutorial

The library may be downloaded from
(Continue reading)

Permalink | Reply | 0 comments |
headers
Ronald Garcia | 1 May 2006 15:49
Picon
Picon
Favicon

[review] Fusion review begins

The review of Joel de Guzman's Fusion library begins today, May 1,  
2006,  and continues through May 10, 2006.

    :Download:
       http://spirit.sourceforge.net/dl_more/fusion_v2.zip

    :Description:
      Fusion is a library of heterogenous containers and views and
      algorithms. A set of heterogenous containers (vector, list, set  
and
      map) is provided out of the box along with view classes that  
present
      various composable views over the data. The containers and views
      follow a common sequence concept with an underlying iterator  
concept
      that binds it all together, suitably making the algorithms fully
      generic over all sequence types.

      The architecture is somewhat modeled after MPL which in turn is
      modeled after STL. It is code-named "fusion" because the  
library is
      the "fusion" of compile time metaprogramming with runtime  
programming.

Review questions
================

Please always explicitly state in your review, whether you think the  
library should be accepted into Boost.
(Continue reading)

Permalink | Reply | 0 comments |

Gmane