Nabble - Boost - Announce

[BoostCon 2010] Submission deadline extended

2009-12-11T05:50:49Z

In 2010 BoostCon celebrates its 4th anniversary in Aspen.

You are invited to submit a paper or a session
(see the original call for participation here:
http://www.boostcon.com/community/wiki/show/Start/) for
BoostCon 2010, Aspen on May 10 - May 14th, 2010.

Please, see http://www.boostcon.com for more information.

Important dates:
Proposal submissions Extended to January 3, 2010
Proposals decisions sent January 25, 2010
(tentative program available)
Fully scheduled program available February 10, 2010
Session materials due April 15, 2010

Hartmut Kaiser, email: hartmut.kaiser@... (Program Committee Chair)
David Abrahams, email: dave@... (Conference Chair)

On behalf of the conference organizers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] MSM Review period extended to Dec 13th

2009-12-05T21:10:25Z

Hi All,

We thought this might happen because of the Thanksgiving holiday, and
it did: we are extending the review period for the Meta State Machine
library until Dec 13th. However, please don't let that delay your
review; we'd like to see them all as soon as possible.

Msm was written by Christophe Henry, inspired
in part by the example in the book "C++ Template Metaprogramming"
(http://boostpro.com/mplbook)

About the library:

Msm (Meta State Machine) is a library allowing the user to easily define
high-performance, straightforward and readable UML2 finite state
machines, while respecting the principles of efficiency and
declarativeness of the original example. To that end, Msm offers
several Domain-Specific Embedded Languages that strive to closely
emulate a standard UML diagram.

Msm supports a broad range of UML features:
- state entry/exit
- transition actions/guards
- composite states
- history
- orthogonal regions
- terminate states
- deferred events
- explicit entry/fork
- entry/exit pseudostates
- anonymous transitions
- transition conflicts

And several non-standard features to make the developer's life easier
(interrupt states, query about the current state(s)).

Msm (in its current version, 2.0) can be found:

* in the sandbox (http://svn.boost.org/svn/boost/sandbox/msm/)
* or in the vault: (http://www.boostpro.com/vault/index.php?directory=Msm
)

Everybody on this list is invited to participate in this formal
review. I hope to see your review of Msm, including your vote on
acceptance, and I welcome your participation in the ensuing discussions
on the Boost developers' mailing list.

Please always include in your review a vote as to whether the library
should be accepted into Boost.

Additionally please consider giving feedback on the following general
topics:

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library?
- With what compiler?
- Did you have any problems?
- How much effort did you put into your evaluation? A glance? A quick
reading? In-depth study?
- Are you knowledgeable about the problem domain?

--
David Abrahams
BoostPro Computing
http://boostpro.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

GGL Review Results

2009-11-28T09:34:44Z

Hi all,

The review of the Generic Geometry Library is over now. We have had vibrant
discussions with regards to the library itself. In addition those stirred up
a lot of controversial discussion about the Boosts review process. In this
review results I will concentrate on the library at hands.

Formally this review ended with 12 YES and 2 NO votes. This result reflects
the overall discussion and the general consensus of this library being worth
to be included into Boost.

Based on this result and the discussions the Generic geometry Library has
been formally accepted into Boost.

It is worth highlighting that most of the reviewers emphasized the excellent
quality of the library design. Here are some quotes:
- "The design is very clear. I think it can serve as a standard example of
how to cover a big non trivial problem domain using meta-programming,
partial specialization and tag dispatch to make it uniformly accessible by a
set of generic algorithms."
- "The design looks clear enough so that I was able to understand about what
was being done. Adding concept checking is a good idea. It also surely is a
modern generic design."
- "I am quite pleased with the use of tag-dispatching and strategies. I was
happy to see this approach taken and by looking at the documentation and
source code it seems sound. I believe this approach offers the greatest
latitude for a generic library."

At the same time the 2 NO votes reflect a couple of shortcomings which still
need to be addressed before final inclusion into SVN. Here is a list of
contingencies noted by the reviewers:

- Robustness: algorithmic robustness and arithmetic stability have been
discussed widely. The consensus of the reviewers is that all algorithms need
to be robust and that the user should be able to make sure all calculations
are arithmetically stable. GGL addresses arithmetic stability by allowing to
instantiate all algorithms with arbitrary number types. But it turns out not
the entire library has been converted to use this scheme yet. Any design
issues that would prevent strong robustness guarantees (without drastic
refactoring) in the future should be identified and fixed prior to release.
The documentation needs to reflect the actual guarantees and complexities of
every algorithm.

- Concepts: more refinement needs to be done for the existing concepts. At
least 2 users claimed to not have been able to adapt their data structures
to the existing scheme. The library aims for defining the concepts and
interfaces for future geometry related work in Boost, so these use cases
need to be addressed. Users mentioned the missing concept inheritance. This
might be a good way to address the current problems of concepts being too
fine grained and too difficult to use. What needs to be done at minimum is
to enhance the flexibility of the concept mechanism enabling to adapt user
provided data structures more easily. The concepts need to be sound even in
the light of extensions.

- Boolean operations: while the library provides a set of Boolean operations
those seem to be not complete and/or robust in terms of
clockwise/counterclockwise geometries, closed/open polygons. Robust Boolean
operations are a strong requirement, so this should be fixed as reported by
at least one reviewer.

- Documentation: the documentation of the library is not complete and needs
additional effort. Using Doxygen alone as a documentation tool has its
(known) shortcomings when it comes to generic libraries. The authors already
mentioned to plan to switch to QuickBook after review allowing to have
better control over the generated docs.

- Testing: several reviewers mentioned the need for a thorough testing
framework allowing the verification of the correctness of the algorithms in
a wide range of use cases. Different test strategies need to be employed,
such as high volume and random tests, known border case tests, tests using
different numeric precision types, etc.

Minor (non-contingency) issues:

- Names of used concepts: currently the library is using mainly terms as
established by the OpenGIS Consortium (OGC). This is misleading for users
coming from different (non-GIS) domains. It has been suggested to introduce
different namespaces for the different geometry domains (GIS, graphics, 3D,
etc.) allowing to use the expected terminology established in that
particular domain.

- Name of the library: the name 'GGL - Generic Geometry Library' is
misleading as it is not a generic geometry library but a library using
generic programming techniques related to geometry. It has been suggested to
use the name Boost.Geometry instead. This is not a requirement imposed by
the review results, but I would like to suggest to the authors to consider
renaming.

- Integration with Boost.Units has been suggested. The library does not need
to be completetly integrated with Boost.Units, although it appears to be
reasonable to deal with types as exposed by Boost.Units especially for
distance and area calculations.

- Spatial data structures (such as spatial trees) have been mentioned to be
crucial for a geometry related library. While the library can't implement
all possible data structures in this field it can (and should) define
concepts and interfaces allowing future extensions while maintaining
interoperability.

- In addition to that the reviewers made a lot of remarks related to
different smaller inconsistencies part of which already have been addressed
during the review. Barend has a full list of the remaining ones and promised
to address all of them.

Last but not least I would like to encourage cooperation between the authors
of this library and the author of Boost.Polygon as both libraries have their
strength' worth combining. In an ideal world and at some point I would like
to see both libraries to be merged. But this is obviously not something to
expect really soon.

At this point I would like to thank all who participated in the review and,
certainly, the authors for submitting this excellent library to Boost.

Regards Hartmut
GGL Review Manager

-------------------
Meet me at BoostCon
http://boostcon.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

2nd Call for Participation - BoostCon 2010

2009-11-24T09:15:04Z

Please distribute!

--------------------------------
4th Annual Boost Conference 2010
--------------------------------
Aspen CO, USA, May 4-10, 2010, www.boostcon.com

2nd Call for participation
----------------------

We invite you to submit session proposals to the 4th Annual Boost
Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010).

Traditionally the main face-to-face event for all things Boost
(www.boost.org), BoostCon 2010 will present leading speakers from
the whole C++ community. From using the Boost libraries to writing
and maintaining them, from evangelizing to deploying Boost within
your organization, from infrastructure and process to vision and
mission, and the new C++ Standard, BoostCon brings together the
sessions, the colleagues, and the inspiration to support your work
with C++ and Boost in particular for the next year.

To reflect the breadth of the Boost community, the conference
includes sessions aimed at two constituencies: Boost end-users
and hard-core Boost library and tool developers. The program
fosters interaction and engagement within and across those two
groups, with an emphasis on hands-on, participatory sessions.

Session topics
--------------
Topics of interest include, but are not restricted to, the
following:

* General tutorial sessions introducing one or more Boost
libraries
* In-depth sessions on using specific Boost libraries
* Case studies on using Boost
* Experts panels
* Advanced sessions on implementation techniques used within
Boost libraries
* C++0x and how it will change life for users and library writers
* Development workshops to extend or enhance existing Boost
libraries
* Workshops on design process
* Infrastructure workshops such as Build tools, Website, Testing
* Concepts and Generic Programming
* Hardware and infrastructure presentations focused on how
libraries can make better use of the technology
* Other topics likely to be of great interest to Boost users and
developers

Interactive and collaborative sessions are encouraged, as this is
the nature of both the on-line Boost community and the style of
learning and participation that has proven most successful at
such events. Sessions can be tutorial based, with an emphasis on
interaction and participant involvement, or workshop based,
whether hands-on programming or paper-based, discussion-driven
collaborative work.

Session formats
---------------
Presentations
Presentations focus on a practitioner's ideas and experience with
anything relevant to Boost and Boost users.

Panels
Panels feature three or four people presenting their ideas and
experiences relating to Boost's relevant, controversial, emerging,
or unresolved issues. Panels may be conducted in several ways,
such as comparative, analytic, or historic.

Tutorials
Tutorials are sessions at which instructors teach conference
participants specific Boost-relevant skills.

Workshops
Workshops provide an active arena for advancements in Boost-
relevant topics. Workshops provide the opportunity for experienced
practitioners to develop new ideas about a topic of common interest
and experience.

Author's Corner Presentations
These were introduced at BoostCon 2008, and were a great success.
They are short (30 minute) sessions, focusing on tips on usage and
design. In addition, we're looking to uncover the hidden design gems
in Boost libraries.

Tool Vendors Presentations
We actively encourage tool vendors and ISP's to submit proposals
for a special Tool Vendors Session Track aimed at products related
to Boost and C++ (compilers, libraries, tools, etc.).

Other formats may also be of interest. Don't hold back a proposal
just because it doesn't fit into a pigeonhole.

Submitting a proposal
---------------------
Standard Sessions are 90 minutes. You may submit a proposal for
fractions or multiples of 90-minutes. Fractional proposals will be
grouped into 90 minute sessions covering related topics.
Longer sessions, such as tutorials and classes, will be assigned 90
minute, three hour (i.e. half day), or six hour (i.e. full day) time
slots.

Please include:

* The working title.
* Type of session: presentation, panel, tutorial, workshop, authors
corner, vendor track, other.
* A paragraph or two describing the topic covered, suitable for the
conference web site.
* Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes,
half day, full day.
* Alternate lengths, if you are willing to make adjustments: 10-20
minute short-talks, 45 minutes, 90 minutes, half-day, full day.
* Audience: users, developers, both.
* Level: basic, intermediate, advanced.
* A biography, suitable for the conference web site.
* Your contact information (will not be made public).

Submission details
------------------
All submissions have to be done through the EasyChair conference
management system: http://www.easychair.org/conferences/?conf=boostcon10.
If you have not already registered at EasyChair, you will need to
do so in order to submit your proposal.

All submissions will go through a peer review process.
Authors are invited (but are not required) to submit PDF versions of
full papers of up to 10 pages in ACM conference proceedings format
(see http://www.acm.org/sigs/publications/proceedings-templates). The
full papers are not required unless you want them published in the
proceedings.

All accepted proposals will be made available in the Association for
Computing Machinery (ACM) Digital Library (approval pending). Best
papers, after further reviews, will be considered to be book
chapters or journal articles in a renowned journal.

The session materials go on the BoostCon website and will be
available to attendees.

For general information on the BoostCon 2010 paper submission or
the scope of technical papers solicited, please refer to the
conference website at www.boostcon.com. For any other questions
about the submission process or paper format, please contact the
Program Committee at boostcon10@.... If you have any
technical problems with EasyChair, please contact EasyChair for
help.

Note: Presenters must agree to grant a non-exclusive perpetual
license to publish submitted materials, either electronically or
in print, in any media related to BoostCon.

Important dates
---------------
Proposal submissions due: Dec 10th, 2009.
Proposals decisions sent (tentative program available): Jan 15th,
2010.
Fully scheduled program available: Feb 5th, 2010.
Session materials due: Apr 15th, 2010.

Hartmut Kaiser, email: hartmut.kaiser@... (Program Committee
Chair)
David Abrahams, email: dave@... (Conference Chair)

On behalf of the conference organizers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review] GGL Review ends today, November 22nd

2009-11-22T07:59:13Z

Hi all,

The review of the Generic Geometry Library officially ends today, November
22nd. Please send in your reviews if you have not done so yet. If you need
more time for your review, please get in contact directly with me to work
out some individual schedule.

Regards Hartmut
GGL Review Manager

-------------------
Meet me at BoostCon
http://boostcon.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[1.41.0] PDF Build of documentation available.

2009-11-20T05:24:21Z

A PDF build of the documentation for Boost-1.41 (for those libraries that
support it) is now available from the usual sourceforge download site:
https://sourceforge.net/projects/boost/files/ in the boost-docs/1.41.0
folder.

Direct URL's are:

https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_41_0.tar.gz/download
(23Mb)
https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_41_0.zip/download
(22.5Mb)
https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_41_0.tar.bz2/download
(22.2Mb)
https://sourceforge.net/projects/boost/files/boost-docs/1.41.0/boost_pdf_1_41_0.7z/download
(21Mb)

Enjoy!

John.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Boost release 1.41.0 available

2009-11-18T10:26:25Z

Boost release 1.41.0 is now available.

This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_41_0

The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/

To install this release on your system, see http://www.boost.org/doc/libs/1_41_0/more/getting_started/index.html

Thanks,

--The Boost release team

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review] GGL review extended until November 22nd

2009-11-15T06:50:09Z

Hi all,

The discussions around GGL are just start ramping up and we received only 2
(voting) reviews so far. Additionally, several people have been asking me
off-list to extend the review period as they otherwise wouldn't be able to
write a review in time. For these reasons the review period for the GGL
library will be extended for another week.

The review period will now end November 22nd.

For everybody considering to vote: this would be a good time to write a
review!

Regards Hartmut
GGL Review Manager

-------------------
Meet me at BoostCon
http://boostcon.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] [Review Results] Boost.Polygon library accepted into boost

2009-11-05T07:21:32Z

Dear Boosters,

[first of all allow me to apology for not doing this before. My small
consulting bussines suddenly grew out of proportion and now is way
over my head, keeping me working/managing 16 hours a day]

I am pleased to announce that the Boost.Polygon library from Lucanus
Simonson
has been accepted into boost provided some of the most critical
concerns,
detailed below, are addressed first.

First of all I would like to thank Lucanus and Intel Corporation for
making this
work available to all C++ developers around the world.

I would also like to thank all the reviewers that participated (in no
particular
order nor degree of participation)

Thomas Klimpel
Frank Mori Hess
Barend Gehrels
Andreas Fabri
Jeffrey Hellrung
Tim Keitt
Markus Werle
Paul A. Bristow
Robert Stewart
Mathias Gaunard
Michael Fawcett
Steven Watanabe
Joachim Faulhaber
John Bytheway
Sebastian Redl
Mika Heiskanen
John Phillips
Kai Benndorf
Hartmut Kaiser
Arash Partow
Maurizio Vitale
Brandon Kohn
David Abrahams
Gordon Woodhull
Daniel James
John Maddock
Tom Brinkman
Bo Persson
Mateusz Loskot
Christian Henning
Jean-Sebastien Stoezel

The library had 6 yes votes and 4 no votes.

Those who voted no made the following major complains and remarks
(they are numbered as I will refer to them back later):

Barend Gehrels:

(1)
According to his benchmarks, intersection algorithms are
unnecesarily slow
as if something where fundamentally wrong in the design and/or
implementation.
AFAICT the implication has not been proved or disproved so far,
hence I
consider it a red herring and cannot take it as a reason for rejecting
the library, but it is important to look at it in detail.

(2)
As a major complain, the library is unusable in those domains where
floating point support is a requirement (like GIS).

(3)
The library should contain some basic polygon geometry algorithms
such as convex hull and centriod

Phil Endecott:

(4)
There is no concept checking in the code so it is difficult to adapt.

(5)
There where too many warnings and build errors (but Luke fixed these)

(6a)
The documentation needs a better overview of operations supported by
the concetps.

(6b)
It also needs the details on the algorithms complexities.

(6c)
It also misses the numerical requirements for the coordinate type.

(6d)
And tutorials.

(7)
Some operators are ambiguous and it would be better to keep just one
of each
"flavor".

(8)
The polygon_data template class is parameterized by a coordiante
type rather
than a point type. This makes it useless for integration with
existing
geometric data types

Michael Fawcett:

(5), (6a), (6d)

(9)
T9he API should provide versions using output iterators in addition
to output
container references.

(10)
Theoreticall the library would be usable with a user defined
coordinate
type (metting certain requirements now undocumented), for example a
fixed
point data type, but some details in the internal design and
implementation prevents this.

(11)
As a major complain, the library is unusable in those domains where
floating point support is a requirement (like GIS).

Hartmut Kaiser:

(11), (1)

Fernando Cacciola:

(12)
The name of the library should change to better indicate that is
restricted to Integral coordinates and two-dimensions.

(13)
The documentation must contain a "credits" section acknowledging all
the
people that participated in the review.

For the library to be effectively accepted, points (5),(6a-d),(10),
(12) and (13) should properly addressed ((5) is already done AFAICT)

It would be quite significant if point (1) where looked into.

Once again I thank Lucanus, Intel Corporation and all the reviwers.

Best regards

--
Fernando Cacciola
SciSoft Consulting, Founder
http://www.scisoft-consulting.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review] GGL review starts today, November 5th

2009-11-05T06:19:33Z

Hi all,

The formal review of the Generic Geometry Library (GGL) starts today,
November 5, 2009 and will finish November 15, 2009.
GGL is being developed by Barend Gehrels, Bruno Lalande and Mateusz Loskot,
with substantial input from this Boost mailing list.

------------------------------------------------

About the library:

GGL defines concepts for geometries and implements some algorithms on such
geometries.

GGL is header-only, and can be applied in all software where geometry plays
a small or a larger role. Users of the library can use just only one
function, such as distance:

int a[2] = {1,1};
int b[2] = {2,3};
double d = ggl::distance(a, b);

Library users can also use the library in combination with std::vector,
boost::tuple's and boost::ranges, such as:

std::vector<boost::tuple<double, double, double> > line;
line.push_back(boost::make_tuple(1, 2, 3));
line.push_back(boost::make_tuple(4, 5, 6));
line.push_back(boost::make_tuple(7, 8, 9));
double length = ggl::length(line);

GGL can also be used in combination with custom or legacy geometries,
adapting them to the library specializing traits classes or using
registration macro's.

Formally, GGL contains a dimension-agnostic, coordinate-system-agnostic and
scalable kernel, based on concepts, meta-functions and
tag-dispatching. On top of that kernel, algorithms are built: area, length,
perimeter, centroid, convex hull, intersection (clipping),
within (point in polygon), distance, envelope (bounding box), simplify,
transform, convert, and more. The library is also designed to support high
precision arithmetic numbers, such as GMP.

The GGL might be used in all domains where geometry plays a role: mapping
and GIS, gaming, computer graphics and widgets, robotics,
astronomy... The core is designed to be as generic as possible and support
those domains. However, for now the development has been mostly
GIS-oriented.

The GGL team proposes an extension model, very similar to what is used by
GIL.

The proposal as it is in the Boost Sandbox included three extensions:
- SVG because it is used in the samples and to generate the documentation
- WKT because it is used in the tests
- The geographic coordinate system because it is used in some of the
examples, also showing how other coordinate systems can be implemented

There are more extensions, not included now, a.o.:
- Spatial index
- Map projections

The proposed GGL has seen four previews, many discussions and many changes
in design and implementation, based on those discussions.
Previews were published on this list January '08, March'08, October'08 and
February'09.

GGL can be found in the sandbox
https://svn.boost.org/svn/boost/sandbox/ggl/formal_review, including source
code, examples, unit tests and documentation. Documentation can also be
found online: http://geometrylibrary.geodan.nl/formal_review

-------------------------------------------------------

Everybody on this list is invited to participate in this formal review. I
hope to see your review of this library, including your vote, and I welcome
your participation in the discussions on the Boost mailing list.

Please always state in your review, whether you think the library should be
accepted as a Boost library.

Additionally, please consider giving feedback on the following general
topics:

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library? With what compiler? Did you have any
problems?
- How much effort did you put into your evaluation? A glance? A quick
reading? In-depth study?
- Are you knowledgeable about the problem domain?

Regards Hartmut
Review Manager

-------------------
Meet me at BoostCon
http://boostcon.com

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[BoostCon 2010] Call for Participation

2009-10-01T20:10:03Z

Please distribute!

--------------------------------
4th Annual Boost Conference 2010
--------------------------------
Aspen CO, USA, May 4-10, 2010, www.boostcon.com

Call for participation
----------------------

We invite you to submit session proposals to the 4th Annual Boost
Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010).

Traditionally the main face-to-face event for all things Boost
(www.boost.org), BoostCon 2010 will present leading speakers from
the whole C++ community. From using the Boost libraries to writing
and maintaining them, from evangelizing to deploying Boost within
your organization, from infrastructure and process to vision and
mission, and the new C++ Standard, BoostCon brings together the
sessions, the colleagues, and the inspiration to support your work
with C++ and Boost in particular for the next year.

To reflect the breadth of the Boost community, the conference
includes sessions aimed at two constituencies: Boost end-users
and hard-core Boost library and tool developers. The program
fosters interaction and engagement within and across those two
groups, with an emphasis on hands-on, participatory sessions.

Session topics
--------------
Topics of interest include, but are not restricted to, the
following:

* General tutorial sessions introducing one or more Boost
libraries
* In-depth sessions on using specific Boost libraries
* Case studies on using Boost
* Experts panels
* Advanced sessions on implementation techniques used within
Boost libraries
* C++0x and how it will change life for users and library writers
* Development workshops to extend or enhance existing Boost
libraries
* Workshops on design process
* Infrastructure workshops such as Build tools, Website, Testing
* Concepts and Generic Programming
* Hardware and infrastructure presentations focused on how
libraries can make better use of the technology
* Other topics likely to be of great interest to Boost users and
developers

Interactive and collaborative sessions are encouraged, as this is
the nature of both the on-line Boost community and the style of
learning and participation that has proven most successful at
such events. Sessions can be tutorial based, with an emphasis on
interaction and participant involvement, or workshop based,
whether hands-on programming or paper-based, discussion-driven
collaborative work.

Session formats
---------------
Presentations
Presentations focus on a practitioner's ideas and experience with
anything relevant to Boost and Boost users.

Panels
Panels feature three or four people presenting their ideas and
experiences relating to Boost's relevant, controversial, emerging,
or unresolved issues. Panels may be conducted in several ways,
such as comparative, analytic, or historic.

Tutorials
Tutorials are sessions at which instructors teach conference
participants specific Boost-relevant skills.

Workshops
Workshops provide an active arena for advancements in Boost-
relevant topics. Workshops provide the opportunity for experienced
practitioners to develop new ideas about a topic of common interest
and experience.

Author's Corner Presentations
These were introduced at BoostCon 2008, and were a great success.
They are short (30 minute) sessions, focusing on tips on usage and
design. In addition, we're looking to uncover the hidden design gems
in Boost libraries.

Tool Vendors Presentations
We actively encourage tool vendors and ISP's to submit proposals
for a special Tool Vendors Session Track aimed at products related
to Boost and C++ (compilers, libraries, tools, etc.).

Other formats may also be of interest. Don't hold back a proposal
just because it doesn't fit into a pigeonhole.

Submitting a proposal
---------------------
Standard Sessions are 90 minutes. You may submit a proposal for
fractions or multiples of 90-minutes. Fractional proposals will be
grouped into 90 minute sessions covering related topics.
Longer sessions, such as tutorials and classes, will be assigned 90
minute, three hour (i.e. half day), or six hour (i.e. full day) time
slots.

Please include:

* The working title.
* Type of session: presentation, panel, tutorial, workshop, authors
corner, vendor track, other.
* A paragraph or two describing the topic covered, suitable for the
conference web site.
* Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes,
half day, full day.
* Alternate lengths, if you are willing to make adjustments: 10-20
minute short-talks, 45 minutes, 90 minutes, half-day, full day.
* Audience: users, developers, both.
* Level: basic, intermediate, advanced.
* A biography, suitable for the conference web site.
* Your contact information (will not be made public).

Submission details
------------------
All submissions have to be done through the EasyChair conference
management system: http://www.easychair.org/conferences/?conf=boostcon10.
If you have not already registered at EasyChair, you will need to
do so in order to submit your proposal.

All submissions will go through a peer review process.
Authors are invited (but are not required) to submit PDF versions of
full papers of up to 10 pages in ACM conference proceedings format
(see http://www.acm.org/sigs/publications/proceedings-templates). The
full papers are not required unless you want them published in the
proceedings.

All accepted proposals will be made available in the Association for
Computing Machinery (ACM) Digital Library (approval pending). Best
papers, after further reviews, will be considered to be book
chapters or journal articles in a renowned journal.

The session materials go on the BoostCon website and will be
available to attendees.

For general information on the BoostCon 2010 paper submission or
the scope of technical papers solicited, please refer to the
conference website at www.boostcon.com. For any other questions
about the submission process or paper format, please contact the
Program Committee at boostcon10@.... If you have any
technical problems with EasyChair, please contact EasyChair for
help.

Note: Presenters must agree to grant a non-exclusive perpetual
license to publish submitted materials, either electronically or
in print, in any media related to BoostCon.

Important dates
---------------
Proposal submissions due: Dec 10th, 2009.
Proposals decisions sent (tentative program available): Jan 15th, 2010.
Fully scheduled program available: Feb 5th, 2010.
Session materials due: Apr 15th, 2010.

Hartmut Kaiser, email: hartmut.kaiser@... (Program Committee Chair)
David Abrahams, email: dave@... (Conference Chair)

On behalf of the conference organizers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[1.40] Release of PDF docs for Boost-1.40 now available.

2009-08-29T05:12:22Z

For those who prefer printable docs, PDF builds of the docs from Boost-1.40
are now available from the usual sourceforge download site:
https://sourceforge.net/projects/boost/files/ (look under the boost-docs
subtree).

Direct links are as follows:

zip (19.2Mb):
https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_40_0.zip/download
tgz (19.7Mb):
https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_40_0.tar.gz/download
7z (17.9Mb):
https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_40_0.7z/download

Please note that not all libraries have documentation suitable for automatic
PDF generation yet, libraries covered are:

Accumulators
Any
Array
Asio
Bimap
Bjam
Boost.Build
Range
Boostbook
TR1-complex number algorithms
Concepts
Config
Conversion
Date_time
Foreach
Function
FunctionTypes
Fusion
Hash
Interprocess
Intrusive
Iterator
Lambda
Math (special functions and distributions)
Math-gcd
MPI
Octonion
Optional
Phoenix
ProgramOptions
Proto
Python tutorial
Quaternion
Quickbook
Ref
Regex
ScopeExit
Signals
Signals2
StaticAssert
StringAlgo
Thread
TR1
Tribool
TypeTraits
Typeof
Units
Unordered
Variant
Xpressive

Enjoy!

John Maddock.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Boost release 1.40.0 is available

2009-08-27T10:08:12Z

Boost release 1.40.0 is available from SourceForge:

    http://sourceforge.net/projects/boost/files/

As always, the .7z and .zip files have Windows line endings,
while the .bz2 and .gz files have POSIX line endings. Please
download a file that has line endings appropriate for your platform.

There are no new libraries in this release, but lots of libraries
have been updated and had bugs fixed, including:

    * Accumulators
    * Asio
    * Circular Buffer
    * Filesystem
    * Foreach
    * Function
    * Fusion
    * Hash
    * Interprocess
    * Intrusive
    * MPL
    * Program Options
    * Proto
    * Python
    * Serialization
    * Unordered
    * Xpressive

Enjoy!

-- The Boost Release Managers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] Formal Review: Boost.Polygon starts today August 24, 2009

2009-08-24T13:36:56Z

Dear Developers,

The formal review of the Boost.Polygon library by Lucanus Simonson
starts today, August 24, 2009 and will finish September 2, 2009.

I really hope to see your vote and your participation in the
discussions on
the Boost mailing lists!

---------------------------------------------------

About the library:

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. 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

The design philosophy behind the polygon library was to create an API
for
invoking the library algorithms it provides on user geometry data
types that is
maximally intuitive, minimally error-prone and easy to integrate into
pre-existing applications. C++-concepts based template meta-programming
combined with generic operator overloading meets these design goals
without
sacrificing the runtime or memory efficiency of the underlying
algorithms. This
API makes the following code snippet that operates on non-library
geometry types
possible:

void foo(list<CPolygon>& result, const list<CPolygon>& a,
const list<CPolygon>& b, int deflateValue) {
CBoundingBox domainExtent;
using namespace boost::polygon::operators;
boost::polygon::extents(domainExtent, a);
result += (b & domainExtent) ^ (a - deflateValue);
}

The source is available at

http://svn.boost.org/svn/boost/sandbox/gtl/boost/polygon/

And the documentation is at

http://svn.boost.org/svn/boost/sandbox/gtl/doc/index.htm

---------------------------------------------------

Please always state in your review, whether you think the library
should be
accepted as a Boost library!

Additionally please consider giving feedback on the following general
topics:

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library? With what compiler? Did you have any
problems?
- How much effort did you put into your evaluation? A glance? A quick
reading? In-depth study?
- Are you knowledgeable about the problem domain?

Best Regards

Fernando Cacciola
Review Manager

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Review Wizard Status Report for June 2009

2009-06-01T20:43:09Z

==============================================
Review Wizard Status Report for June 2009
==============================================

News
====

Futures: Williams variant Accepted; Gaskill variant Rejected

Boost 1.38 Released
New Libraries:
Revised Libraries:

Boost.Range Extension Accepted

Polynomial Library Rejected

Boost 1.39 Released

Constrained Value Review - Review Result Pending

Older Issues
============

The Time Series Library, accepted in August 2007, has not yet been
submitted to SVN. Eric Niebler and John Phillips are working on
making the changes suggested during the review.

The Floating Point Utilities Library, has not yet been submitted to
SVN. It is slated to be integrated with the Boost.Math library.

The Switch Library, accepted provisionally in January 2008,
has not yet been submitted for mini-review and full acceptance.

The Phoenix Library, accepted provisionally in September 2008, has not
yet been submitted for mini-review and full acceptance. A rewrite of
Phoenix, basing it on the Proto metaprogramming library, has just
begun.

General Announcements
=====================

As always, we need experienced review managers. The review queue has
been growing substantially but we have had few volunteers, so manage
reviews if possible and if not please make sure to watch the review
schedule and participate. Please take a look at the list of libraries
in need of managers and check out their descriptions. In general
review managers are active boost participants or library
contributors. If you can serve as review manager for any of them,
email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu"
and "phillips at mps dot ohio-state dot edu" respectively.

We are also suffering from a lack of reviewers. While we all
understand time pressures and the need to complete paying work, the
strength of Boost is based on the detailed and informed reviews
submitted by you. A recent effort is trying to secure at least five
people who promise to submit reviews as a precondition to starting
the review period. Consider volunteering for this and even taking the
time to create the review as early as possible. No rule says you can
only work on a review during the review period.

A link to this report will be posted to www.boost.org. If you would
like us to make any modifications or additions to this report before
we do that, please email Ron or John.

If you're a library author and plan on submitting a library for review
in the next 3-6 months, send Ron or John a short description of your
library and we'll add it to the Libraries Under Construction below. We
know that there are many libraries that are near completion, but we
have hard time keeping track all of them. Please keep us informed
about your progress.

Review Queue
============

* Lexer
* Shifted Pointer
* Logging
* Log
* Join
* Pimpl
* Thread Pool
* Endian
* Meta State Machine
* Conversion
* Sorting
* GIL.IO
* AutoBuffer
* String Convert

--------------------

Lexer
-----
:Author: Ben Hanson

:Review Manager: Eric Neibler

:Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing
>`__

:Description:
A programmable lexical analyser generator inspired by 'flex'.
Like flex, it is programmed by the use of regular expressions
and outputs a state machine as a number of DFAs utilising
equivalence classes for compression.

Shifted Pointer
---------------
:Author: Phil Bouchard

:Review Manager: Needed

:Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=Memory
>`__

: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.

Logging
-------
:Author: John Torjo

:Review Manager: Gennadiy Rozental

:Download: http://torjo.com/log2/

:Description: Used properly, logging is a very powerful tool. Besides
aiding
debugging/testing, it can also show you how your application is
used. The Boost Logging Library allows just for that, supporting
a lot of scenarios, ranging from very simple (dumping all to one
destination), to very complex (multiple logs, some enabled/some
not, levels, etc). It features a very simple and flexible
interface, efficient filtering of messages, thread-safety,
formatters and destinations, easy manipulation of logs, finding
the best logger/filter classes based on your application's
needs, you can define your own macros and much more!

Log
---
:Author: Andrey Semashev

:Review Manager: Needed

:Download: `Boost Vault <http://tinyurl.com/cm9lum>`__

:Description: The library is aimed to help adding logging features to
applications. It provides out-of-box support for many widely used
capabilities, such as formatting and filtering based on attributes,
sending logs to a syslog server or to Windows Event Log, or simply
storing logs into files. It also provides basic support for the
library initialization from a settings file. The library can also be
used for a wider range of tasks and implement gathering and
processing
statistical information or notifying user about application events.

Join
----
:Author: Yigong Liu

:Review Manager: Needed

:Download: http://channel.sourceforge.net/

:Description: Join is an asynchronous, message based C++ concurrency
library based on join calculus. It is applicable both to
multi-threaded applications and to the orchestration of asynchronous,
event-based applications. It follows Comega's design and
implementation and builds with Boost facilities. It provides a high
level concurrency API with asynchronous methods, synchronous methods,
and chords which are "join-patterns" defining the synchronization,
asynchrony, and concurrency.

Pimpl
-----
:Author: Vladimir Batov

:Review Manager: Needed

:Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=Pimpl.zip&directory=&
>`__
| http://www.ddj.com/cpp/205918714 (documentation)

: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.

Thread Pool
-----------

:Author: Oliver Kowalke

:Review Manager: Needed

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-threadpool.2.tar.gz&directory=Concurrent%20Programming
>`__

:Description:
The library provides:
- thread creation policies: determines the management of worker
threads:
- fixed set of threads in pool
- create workerthreads on demand (depending on context)
- let worker threads ime out after certain idle time
- channel policies: manages access to queued tasks:
- bounded channel with high and low watermark for queuing tasks
- unbounded channel with unlimited number of queued tasks
- rendezvous syncron hand-over between producer and consumer
threads
- queueing policy: determines how tasks will be removed from
channel:
- FIFO
- LIFO
- priority queue (attribute assigned to task)
- smart insertions and extractions (for instance remove oldest
task with certain attribute by newst one)
- tasks can be chained and lazy submit of taks is also supported
(thanks to
Braddocks future library).
- returns a task object from the submit function. The task it
self can
be interrupted if its is cooperative (means it has some
interruption points
in its code -> ``this_thread::interruption_point()`` ).

Endian
------
:Author: Beman Dawes

:Review Manager: Needed

:Download: http://mysite.verizon.net/beman/endian-0.10.zip

:Description:
Header boost/integer/endian.hpp 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.

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
data 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.

Meta State Machine
------------------
:Author: Christophe Henry

:Review Manager: Needed

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?direction=0&order=&directory=Msm
>`__

: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 and Exit Methods
* Guard Conditions
* Sub state machines (also called composite states in UML)
* History
* Terminate Pseudo-State
* Deferred Events
* Orthogonal zones
* Explicit entry into sub state machine states
* Fork
* Entry / Exit pseudo states
* Conflicting transitions

Conversion
----------
:Author: Vicente Botet

:Review Manager: Needed

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=conversion.zip&directory=Utilities&
>`__

:Description:
Generic explicit conversion between unrelated types.

Boost.Conversion provides:
* a generic ``convert_to`` function which can be specialized by
the user to
make explicit conversion between unrelated types.
* a generic ``assign_to`` function which can be specialized by the
user to
make explicit assignation between unrelated types.
* conversion between ``std::complex`` of explicitly convertible
types.
* conversion between ``std::pair`` of explicitly convertible types.
* conversion between ``boost::optional`` of explicitly convertible
types.
* conversion between ``boost::rational`` of explicitly convertible
types.
* conversion between ``boost::interval`` of explicitly convertible
types.
* conversion between ``boost::chrono::time_point`` and
``boost::ptime``.
* conversion between ``boost::chrono::duration`` and
``boost::time_duration``.

Sorting
-------
:Author: Steven Ross

:Review Manager: Needed

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=algorithm_sorting.zip
>`__

:Description:
A grouping of 3 templated hybrid radix/comparison-based sorting
algorithms that provide superior worst-case and average-case
performance to std::sort: integer_sort, which sorts fixed-size data
types that support a rightshift (default of >>) and a comparison
(default of <) operator. float_sort, which sorts standard
floating-point numbers by safely casting them to integers.
string_sort, which sorts variable-length data types, and is optimized
for 8-bit character strings.

All 3 algorithms have O(n(k/s + s)) runtime where k is the number of
bits in the data type and s is a constant, and limited memory
overhead
(in the kB for realistic inputs). In testing, integer_sort varies
from 35% faster to 8X as fast as std::sort, depending on processor,
compiler optimizations, and data distribution. float_sort is roughly
7X as fast as std::sort on x86 processors. string_sort is roughly 2X
as fast as std::sort.

GIL.IO
------
:Author: Christian Henning

:Review Manager: Needed

:Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip
>`__

:Description: I/O extension for ``boost::gil`` which allows reading and
writing of/in various image formats ( tiff, jpeg, png, etc ). This
review will also include the Toolbox extension which adds some common
functionality to gil, such as new color spaces, algorithms, etc.

AutoBuffer
----------
:Author: Thorsten Ottosen

:Review Manager: Needed

:Download: `Here <http://www.cs.aau.dk/~nesotto/boost/
auto_buffer.zip>`__

:Description:
Boost.AutoBuffer provides a container for efficient dynamic, local
buffers.
Furthermore, the container may be used as an alternative to
std::vector,
offering greater flexibility and sometimes better performance.

String Convert
--------------
:Author: Vladimir Batov

:Review Manager: Needed

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost-string-convert.zip
>`__

:Description:
The library takes the approach of boost::lexical_cast in the area of
string-to-type and type-to-string conversions, builds on the past
boost::lexical_cast experience and advances that conversion
functionality further to additionally provide:
* throwing and non-throwing conversion-failure behavior;
* support for the default value to be returned when conversion fails;
* two types of the conversion-failure check -- basic and better/safe;
* formatting support based on the standard I/O Streams and the
standard
(or user-defined) I/O Stream-based manipulators
(like std::hex, std::scientific, etc.);
* locale support;
* support for boost::range-compliant char and wchar_t-based string
containers;
* no DefaultConstructibility requirement for the Target type;
* consistent framework to uniformly incorporate any type-to-type
conversions.

It is an essential tool with applications making extensive use of
configuration files or having to process/prepare considerable amounts
of data in, say, XML, etc.

Libraries under development
===========================

Please let us know of any libraries you are currently
developing that you intend to submit for review.

Mirror
------
:Author: Matus Chochlik

:Download: | http://svn.boost.org/svn/boost/sandbox/mirror/doc/index.html
| `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mirror.zip
>`__

:Description:

The aim of the Mirror library is to provide useful meta-data at both
compile-time and run-time about common C++ constructs like namespaces,
types, typedef-ined types, classes and their base classes and member
attributes, instances, etc. and to provide generic interfaces for
their introspection.

Mirror is designed with the principle of stratification in mind and
tries to be as less intrusive as possible. New or existing classes do
not need to be designed to directly support Mirror and no Mirror
related code is necessary in the class' definition, as far as some
general guidelines are followed

Most important features of the Mirror library that are currently
implemented include:

* Namespace-name inspection.

* Inspection of the whole scope in which a namespace is defined

* Type-name querying, with the support for typedef-ined typenames
and typenames of derived types like pointers, references,
cv-qualified types, arrays, functions and template names. Names
with or without nested-name-specifiers can be queried.

* Inspection of the scope in which a type has been defined

* Uniform and generic inspection of class' base classes. One can
inspect traits of the base classes for example their types,
whether they are inherited virtually or not and the access
specifier (private, protected, public).

* Uniform and generic inspection of class' member attributes. At
compile-time the count of class' attributes and their types,
storage class specifiers (static, mutable) and some other traits
can be queried. At run-time one can uniformly query the names
and/or values (when given an instance of the reflected class) of
the member attributes and sequentially execute a custom functor
on every attribute of a class.

* Traversals of a class' (or generally type's) structure with user
defined visitors, which are optionally working on an provided
instance of the type or just on it's structure without any
run-time data. These visitors are guided by Mirror through the
structure of the class and optionally provided with contextual
information about the current position in the traversal.

I'm hoping to have it review ready in the next few months.

Interval Template Library
-------------------------
:Author: Joachim Faulhaber

: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 sets or maps of elements. Yet they are much more
space and time efficient when the elements occur in
contiguous chunks: intervals. This is obviously the case
in many problem domains, particularly in fields that deal
with problems related to date and time.

Interval containers allow for intersection with interval_sets
to work with segmentation. For instance you might want
to intersect an interval container with a grid of months
and then iterate over those months.

Finally interval_maps provide aggregation on
associated values, if added intervals overlap with
intervals that are stored in the interval_map. This
feature is called aggregate on overlap. It is shown by
example:

::

typedef set<string> guests;
interval_map<time, guests> party;
guests mary; mary.insert("Mary");
guests harry; harry.insert("Harry");
party += make_pair(interval<time>::rightopen(20:00, 22:00),mary);
party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry);
// party now contains
[20:00, 21:00)->{"Mary"}
[21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap
[22:00, 23:00)->{"Harry"}

As can be seen from the example an interval_map has both
a decompositional behavior (on the time dimension) as well as
a accumulative one (on the associated values).

StlConstantTimeSize
-------------------
:Author: Vicente J. Botet Escriba

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=constant_time_size.zip&directory=Containers&
>`__

:Description:

Boost.StlConstantTimeSize Defines a wrapper to the stl container list
giving the user the chioice for the complexity of the size function:
linear time, constant time or quasi-constant. In future versions the
library could include a similar wrapper to slist.

InterThreads
-------------------
:Author: Vicente J. Botet Escriba

:Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=interthreads.zip&directory=Concurrent%20Programming&
>`__

:Description:

Boost.InterThreads extends Boost.Threads adding some features:

* 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.
* 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.
* 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.
* thread tuple: defines a thread groupe where the number of
threads is know statically and the threads are created at
construction time.
* set_once: a synchonizer that allows to set a variable only once,
notifying to the variable value to whatever is waiting for that.
* 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.
* 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.

(thread_decorator and thread_specific_shared_ptr) are based on the
original implementation of threadalert written by Roland Schwarz.

Boost.InterThreads extends Boost.Threads adding thread setup/cleanup
decorator, thread specific shared pointer, thread keep alive
mechanism and thread tuples.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[ANN] Boost 1.39.0

2009-05-02T13:58:06Z

Boost 1.39.0 is available for download from SourceForge.

See http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&release_id=679861

New Libraries: Signals2.

Updated Libraries: Asio, Flyweight, Foreach, Hash, Interprocess,
Intrusive, Program.Options, Proto, PtrContainer, Range, Unordered,
Xpressive.

Updated Tools: Boostbook, Quickbook.

Plus the usual bug fixes to numerous libraries.

Please report any problems to the Boost users or developers mailing list.

Thanks,

--Beman Dawes, Daniel James, and all the other Boosters who help get
releases out
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review Results] Range.Ex library accepted into boost

2009-04-27T02:12:49Z

Dear all,

It is my pleasure that Neil Groves' RangeEx library has been accepted
into boost. Congratulations Neil! There are quite a number of minor
issues that need to be resolved before the library is release ready,
see below for a summary.

Review statistics
-----------------

Full Reviews: 8.
Discussion: extensive.

I had the clear impression that everybody that participated in the
discussion were in favor of this library, albeit they did not have time
to submit a full review.

I did not hear a single statement saying that this library should be
rejected.

Thanks to everybody that participated in the review and its discussions.

Issue Summary
-------------

Below is given a list of topics that must be adressed before the
library can be included into boost. In general, we should try
to discuss them one at a time in seperate threads. Many people
suggested various extensions, new algorithms (e.g. from adope), etc.
**In general
we should not require Neil to add all these if he does not have the time
currently: the basic infrastructure, the concepts, the naming
and organization of the library is much more important. Then we can
add all these things later.**

1: documentaion
===============
The documentation should clearly reflect if an algorithm delegates
to a standard algorithm. If the algorithm is new, then it should
state complety and exception-safety. More examples would be welcome.
Sometimes the rationale and explanations could be improved, e.g for
operator|().

2: return type specification for find() etc
===========================================
There where no major objection to the mechanism, but some found
the syntax ugly. I believe the suggested syntax (e.g.)

boost::find[_f,_e]( range, x )
boost::find[_f+1,_e]( range, x )

was considered good by most.

3: namespace organization
=========================

Currently the library uses the namspaces

boost
boost::adaptors

Some raised concern about putting the algorithms straight in
the boost namespace before we have a general agreement on where
to put algorithms (e.g. in boost::algorithm or boost::ranges or whatever).

I think it will make sense to put each algorithm in its own header,
since we might have to include additional standard library headers
for calling algorithms that are implemented as member functions
(but see 7 below).

Feedback is most welcome.

4: naming convention for adaptors
=================================

The following have been proposed throughout the review
(here examplified with "transform"):

| transformed( fun )
| transform( fun )
| transform_view( fun )
| view::transform( fun )

There where no consensus during the review. Other libraries
seem to use the _view suffix, which is a strong argument
for that candidate
(in that case, I suggest to drop the adaptors namespace).

5: naming convention for the adaptor generators
===============================================

Many people like to be able to say make_transform_range(r,fun)
instead of r | transformed( fun ). There was no concensus
on how to name these functions. Here are some candidates:

make_transform_range( r, fun )
transformed( r, fun )
transform( r, fun ) (*)
transform_view( r, fun )

(*) was dislike by some because it has exactly the same spelling as
the algorithm transform. Many felt that the confusion is
too big if view generators are not named different from the actual
algorithms.

6: reintroducing _if variants of algorithms
===========================================

An important problem with the suggested approach
was the the iterator returned by an algorithm
after applying | filtered( pref ) are now filtered
iterators and so one needs to manually unwrap the return
iterator. This provided enough justification for reintroducing
these algorithms. (One could imagine that this unwrapping
was done automatically by a conversion operator such that

iterator i = boost::find( r | boost::filtered( pred ), x );

"just worked". However, the syntax is still slightly worse
than just using the original algorithm).

Generic programming is concerned with the use of orthogonal
concepts which put together yields all possible combinations
of algorithms. If we reintroduce all _if algorithms, we have to aks
ourselves "when does it end?". Should all new algorithms then
simply add _if variants? This seems very much against the spirit
of generic programming.

The problem with the iterators being changed (as in the find example)
seems to suggest the following guideline:

"If the algorithm returns an iterator, it makes sense to provide
an _if overload. Otherwise it does not."

Under this guideline, find_if() should be there, but
count_if() should not be provided.

7: should algorithms call member function when possible?
========================================================

I heard one strong voice against this. The reason was that
the algorithm implemented as member function often has quite
different guarantees w.r.t. complexity, reference and iterator
stabililty. I think this is a very strong argument. Also, we
can add this later if good arguments appear, but it is much
harder to take away. We also have to remember Scott Meyers
item "Beware of container independent code" which also suggest
that this is a bad idea.

At the very menimum, the original algorithm and the member function
should have similar semantics. This seems to suggest that
we can call set::lower_bound() from boost::lower_bound(). In that
case, the best way would probably be to add these as overloads
in the boost namespace:

template< class T, class A >
typename std::set<T,A>::iterator
lower_bound( std::set<T,A>& s );
template< class T, class A >
typename std::set<T,A>::const_iterator
lower_bound( const std::set<T,A>& s );

8: making return values of algorithms consistent/intuitive
==========================================================

For example, sort(r) returns the sorted range, but
sort_heap(r) does not. Similar issues for partial_sort().
Please go through all algorithms to see if this done correctly.

9: output range concept?
=========================

It appears that the only use for an output iterator in the library
was for boost::copy(rng,iter), and the only use for that function
was for "sinks" like std::ostream_iterator<T>(...).

This seems to be the only safety hole left in the library.

Here's an idea to how we might remove that: create a new "copy sink"
concept:

struct array_copy_sink
{
...
template< class Iterator >
copy( Iterator begin, Iterator end )
{ ... }
};

Then we might imagine

boost::copy( rng, boost::ostream_sink(std::cout) );
boost::copy( rng, boost::array_sink(an_array) );
boost::copy( rng, boost::ptr_sink(begin,end) );
boost::copy( rng, boost::front_insert_sink(a_deque) );
...

For optimal performance, we also need a "nonoverlapping copy sink"
concept, and an algorithm that expects that sink
(or that boost::copy() determines the type of the sink automatically).

10: automatic projection
=======================

Adope has algorithms overloaded such that projection is very easy:

struct my_type {
int member;
double another_member;
};

//...

my_type a[] = { { 1, 2.5 }, ... };

// sort the array by the first member:

sort(a, less(), &my_type::member);

my_type* i = lower_bound(a, 5, less(), &my_type::member);

We should be able to express this well, albeit not as concise, with

my_type* i =
boost::lower_bound( a | project( &my_type::member ), 5, less() );

where project( ... ) could simply return a transform iterator
constructed with boost::bind().

There is another problem, however, because now the return value is a
tranform_iterator of some form. Appending .base() would solve it,
albeit it is somewhat ugly.

Again this might raise the question of an implicit conversion.

I just want to say this is not a critical issue as we can always
add these overloads.

--- End of Issues ----

Again, I would like to thank everybody that participated in the review.

best regards

Thorsten, review manager

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Boost 1.39.0 beta 1 is available for download

2009-04-26T06:13:11Z

Boost 1.39.0 beta 1 is available for download from SourceForge.

See
http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&release_id=678473

New Libraries: Signals2.

Updated Libraries: Asio, Flyweight, Foreach, Hash, Interprocess,
Intrusive, Program.Options, Proto, PtrContainer, Range, Unordered,
Xpressive.

Updated Tools: Boostbook, Quickbook.

Plus the usual bug fixes to numerous libraries.

Please report any problems to the Boost users or developers mailing list.

Thanks,

--Beman Dawes, Daniel James, and all the other Boosters who help get
releases out
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Review Conclusion - Futures Library

2009-04-20T21:30:31Z

Review Conclusion - Futures Library

Braddock Gaskill
http://braddock.com/~braddock/future

Anthony Williams
http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp

The lack of examples and documentation made them difficult to review.
Nevertheless, Anthony Williams futures library did receive almost unanimous
and enthusiastic support. Unfortunately, the depth of the support was
very shallow.

I just finished my first read of Anthony's book "C++ Concurrency in Action and
acknowledge his expertise in the areas of multi threaded and parallel
programming.
(http://www.manning.com/williams/)

Anthony is the maintainer of boost::threads.

Anthony's Future library has been approved for the next major release
of c++ standard.

Conclusion

Braddock Gaskill - Rejected
Anthony Williams - Approved

Anthony's Futures library is approved for inclusion into
boost::threads. As he is the
maintainer of that library, he should be given maximum latitude about
how that is to be done.

In the future, if Anthony wants to re-publish the library as a
top-level boost library, then
he needs to resubmit it again with samples and test cases, which are lacking.

Requirements

As per the usual boost library requirements, examples and test cases are needed.
Anthony should also improve the documentation, which should
not be a problem as he is a prolific author in the area of multi
threaded programming.

Review Manager
Tom Brinkman
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] [Polynomial] Review Result

2009-04-09T09:19:17Z

Apologies for the delay in putting this together...

First off I'd like to thank the author for submitting this for review
- I wish all our SOC students were similarly diligent! :-)

We received a number of reviews of this library, but none were in
favor of acceptance in its current form, and most thought that there
was still a fair bit of work to do to get the library into shape.
However, most thought that the library could be accepted into Boost
given sufficient changes/enhancements.

Therefore the library is not accepted into Boost at this time, but I
would like to encourage the author to continue to work on the library
and resubmit at a future time.

In no particular order the main review comments are summarized below:

Principal comments:

* Documentation, especially the background is inadequate and needs a
good proofreading
a) From the examples are nothing that a competent programmer couldn't
figure out from the declarations. Some more interesting or useful
examples would be nice, particularly for things like the special forms.
It's not exactly clear what I would do with those functions.
b) There is no documentation or references to the various algorithms
used. Those, too, would be nice.
c) Doc.html appear to have been created 'the Hard Way'. Would be much
more useful and look nicer if produced with the Quickbook, Doxygen...
toolchain. And make it maintainable by other people.

* Use of constructors and assignment operators that modify their
arguments isn't acceptable - best to find another interface for this.

* Several reviewers noted that the code didn't build for them, in
particular log2 isn't available on all platforms/compilers.

* evaluate_polynomial() and evaluate_polynomial_faithfully() take
their coefficient arguments in the opposite order of all the other
functions/constructors in the library, without providing any reason
for that choice. That's seems somewhat surprising. I'd suggest
fixing that, or at the very least providing an argument in the
documentation why this makes some sense.
* Rename evaluate() to horner() and provide evaluate() as an inline
call to horner().

* Rename evaluate_faithfully() to compensated_horner().

* Things that say "Be careful about this" generally need fixing.

* It would be nice to have operator* and operator/ as well as *= and /=.

* Considering they share the same core algorithm, it might be nice to
have a function that could do division and return the remainder at the
same time. Something like
poly::divide(P &divisor, P "ient, P &remainer)

* FFTs are good for multiplying polynomials above a certain size, but
they are rather heavy for small polynomials and can lead to unexpected
crosstalk between terms. There should be an option for * that doesn't
use the FFT, and it should be the default for small polynomials.

* operator/= has a hardcoded "std::vector<double> new_coefficients"
that later gets rounded?? This should be fixed to work with any type
that fulfills the necessary
conceptual requirements (and tested and documented what those
requirements are - it would be nice if they were the same as the rest
of Boost.Math).

* The name FieldType is mathematically misleading since the
instantiating type is very likely not to be a field (e.g. int or a
multiple precision integer type).

* the Polynomial class provides a fairly minimalist set of supported
functions. This may well be deliberate (if so, apologies), but I would
like to see a richer interface including such things as
- content (gcd of coefficients, where that makes sense)
- polynomial discriminant
- resultant of 2 polynomials
- evaluation of homogeneous polynomial ( f(x) = sum c_i
x^i,f(a,b) = sum c_i a^i b^(d-i) )
- evaluation at a polynomial (f(g(x)))
- Pseudo-division of polynomials
- finding roots over C
- finding roots over F_p
- factorisation over Z
- factorisation over F_p

* We had one feature request for extending support to finite fields.

* This constructor:
template<typename U> polynomial(const U& v);
had me a little confused at first - is there any advantage to making
this a
template rather than simply accepting a const FieldType& as the single
argument?

* It's not clear from the documentation what this constructor does:
polynomial(InputIterator first1, InputIterator last1,
InputIterator first2);
It needs to clearly state the degree of the resulting polynomial and
whether it passes through all/any of the points - in fact maybe the
constructor should have a final parameter for the degree of the
polynomial and use least-squares fitting when required? Likewise for
the member function template<typename InputIterator> void
interpolate(InputIterator first1, InputIterator last1, InputIterator
first2);

* Operators: the / and % operators need good descriptions of what
they do, given that no exact division is possible. As someone else
has already noted, a function to calculate divide and remainder in one
step would be useful too.

* GCD: presumably this is restricted to polynomials with integer
coefficients? If so it should say so.

* Evaluation: The docs should say what method is used for the
evaluate_faithfully method and give a reference. Renaming as someone
else suggested may be better too, but personally I'm easy either way
on that. I'm not sure whether there should be an
evaluate_by_preconditioning method, shouldn't the polynomial "know"
that it has been preconditioned and react accordingly. I haven't
looked/checked but do the usual arithmetic operators still work if the
polynomial has been preconditioned? I assume probably
not, but if that's the case there should be a stern warning to that
effect, *and* checks in code to prevent us from doing something
stupid :-) BTW, preconditioning can be applied to polynomials of any
degree I believe it's just that it gets hard to implement in the
generic case.

In addition I'd like to see the evaluation functions templated, so
that the type being evaluated can differ from FieldType - it would
surely be quite common for example to create and manipulate
polynomials with integer coefficients, but then want to evaluate on a
floating point type. There is machinery in Boost.Math BTW to handle
the mixed argument-promotion and calculation of the result type, let
me know if you need help in using this.

* Special Forms: the functions provided do *not* generate polynomials
in the alternative forms, but rather generate the named polynomial of
order N, which is rather less useful, but at the very least the docs
need updating to reflect this.

* test_arithmetics.cpp fails on cygwin: or at least it did once I
added a
using std::pow;
to start of operator*= to get things compiling.

* None of the code builds with msvc: there are a couple of issues here:
friend polynomial<FieldType>
boost::math::tools::gcd<>(polynomial<FieldType> u,
polynomial<FieldType> v);
Needs to be changed to:
friend polynomial<FieldType>
boost::math::tools::gcd<FieldType>(polynomial<FieldType> u,
polynomial<FieldType> v);
to get msvc to Grok the code.

After that there are a bunch of failures due to the use of log2 which
msvc doesn't support (and since it's not part of the std other
compilers are likely to complain too).

* I haven't looked too hard at the implementation, except to echo the
comments posted previously that the Conceptual requirements for
FieldType need documenting and *testing*. There are concept checking
classes and archetypes in Boost.Math which may be of use here. Again,
shout if you need help in figuring out how to use these. I did notice
that operator*= for example uses std::complex<double> internally which
effectively limits the precision that can be achieved - to be useful
to me - and to replace the
existing "implementation detail" polynomial class in Boost.Math - I
would need the polynomial class to be usable with arbitrary precision
types such as NTL::RR or mpfr_class. Also as previously noted,
multiplication of small polynomials may well be more efficient with
the "naive" algorithm, so some performance tests and experimenting is
required here. Related to this, use of "round" should be restricted
to types that are known to be integers?

Regards,
John Maddock
Review Manager for Polynomial Library.
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

BoostCon 2009 Schedule Now Live

2009-03-24T14:21:42Z

The official schedule is now live at http://www.boostcon.com/program! A
few highlights of the "mouth-watering content" (in the words of one
enrollee) are:

* A keynote address from Andrei Alexandrescu called "Iterators Must Go."
It's sure to be provocative!

* Troy Straszheim's presentations on how high-energy physicists are
using Boost to process massive datasets as they go "Icefishing for
Neutrinos" and on Kamasu, his library for offloading computation to
your machine's GPU.

* Two hands-on sessions where we'll start recoding parts of Boost for
C++0x, applying rvalue references, variadic templates, decltype, and
advanced SFINAE capabilities using the latest GCC.

* "Practical C++ Test-Driven Development with Boost.Test and Bmock," by
Asher Sterkin

* A session on compiler construction using Boost.Spirit v2, from Hartmut
Kaiser and Joel de Guzman

The complete list of sessions covers a wide range of other Boost and
C++-related topics. It is available at
http://www.boostcon.com/program/sessions. Please have a look, and
please, sign up for the conference! Remember, registration for the
whole week is just $599 before April 1st.

--
Dave Abrahams
BoostPro Computing
http://www.boostpro.com
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] [Review] Polynomial library review begins today

2009-03-10T05:23:07Z

The review of Pawel Kieliszczyk's Polynomial library begins today and
ends on Thurs 19th March.

Download of the zip file from the vault is here: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=polynomial.zip&directory=&PHPSESSID=bbc9a84b382be1fc412254cfe30b925b

Otherwise the library is present in the sandbox here: https://svn.boost.org/svn/boost/sandbox/SOC/2008/polynomial/

And the docs can be read online here: https://svn.boost.org/svn/boost/sandbox/SOC/2008/polynomial/libs/docs/index.html

The polynomial library contains a single class - polynomial<FieldType>
- used for the manipulation of polynomials, along with a selection of
algorithms which operate upon them. The library is an extension/
rewrite of the existing "implementation detail" polynomial class in
Boost.Math, and was written as part of last years Google Summer of
Code under the mentorship of Fernando Cacciola.

What to include in Review Comments
~~~~~~~~~~~~~~~~~~~~~~~~~

Your comments may be brief or lengthy, but basically the Review
Manager needs your evaluation of the library. If you identify problems
along the way, please note if they are minor, serious, or showstoppers.

The goal of a Boost library review is to improve the library through
constructive criticism, and at the end a decision must be made: is the
library good enough at this point to accept into Boost? If not, we
hope to have provided enough constructive criticism for it to be
improved and accepted at a later time. The Serialization library is a
good example of how constructive criticism resulted in revisions
resulting in an excellent library that was accepted in its second
review.

Here are some questions you might want to answer in your review:

* What is your evaluation of the design?
* What is your evaluation of the implementation?
* What is your evaluation of the documentation?
* What is your evaluation of the potential usefulness of the library?
* Did you try to use the library? With what compiler? Did you have
any problems?
* How much effort did you put into your evaluation? A glance? A
quick reading? In-depth study?
* Are you knowledgeable about the problem domain?

And finally, every review should answer this question:

* Do you think the library should be accepted as a Boost library?
Be sure to say this explicitly so that your other comments don't
obscure your overall opinion.

Many reviews include questions for library authors. Authors are
interested in defending their library against your criticisms;
otherwise they would not have brought their library up for review. If
you don't get a response to your question quickly, be patient; if it
takes too long or you don't get an answer you feel is sufficient, ask
again or try to rephrase the question. Do remember that English is not
the native language for many Boosters, and that can cause
misunderstandings.

E-mail is a poor communication medium, and even if messages rarely get
lost in transmission, they often get drowned in the deluge of other
messages. Don't assume that an unanswered message means you're being
ignored. Given constructively, criticism will be taken better and have
more positive effects, and you'll get the answers you want.

John Maddock.
Review Manager for Polynomial Library.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[1.38.0] PDF package of Boost documentation released.

2009-02-21T10:11:43Z

Folks,

A package containing PDF versions of Boost's documentation is now available
for Boost-1.38.0 from the usual sourceforge download site:
http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=159715&release_id=662905

Please note that due to the diverse range of tools in use within Boost it
has not been possible to produce PDF's for all of Boost's libraries, those
currently included as PDF's are:

accumulators
any
array
asio
bimap
range
complex-tr1
concepts
config
conversion
date_time
foreach
function
hash
interprocess
intrusive
iterator
math-gcd
math
mpi
octonion
optional
phoenix
program_options
proto
python_tutorial
quaternion
ref
regex
scope_exit
signals
static_assert
string_algo
thread
tr1
tribool
type_traits
typeof
units
unordered
variant
xpressive

Documentation for the following tools are also included in this package:

bjam
boost_build
boostbook
quickbook

Regards,
John Maddock.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] Formal Review: Boost.RangeEx

2009-02-20T04:28:36Z

Dear Developers and Users,

It's my pleasure to announce that the review of Neil Groves' RangeEx
library starts today and lasts until March 3, 2009.

What is it?
+++++++++++

The library provide two very useful extensions to the range library

1. Range-based algorithms. E.g.

boost::sort( rng );

which is a convenient wrapper of instead of

std::sort( boost::begin(rng), boost::end(rng) );

But the new interface also allows for more expressive code because
(on the fly) composition of algorithms suddenly is possible.

2. Range adaptors. E.g.

std::vector<int> vec = ...;
boost::copy( vec | boost::adaptors::reversed,
std::ostream_iterator<int>( std::cout ) );

where the expression "vec | boost::adaptors::reversed" wraps the
iterators of the range on the left in reverse iterators. The library
provides a wide range (no pun intended) of Range adaptors, and they
are a powerful way to create ranges on the fly and pass them to
algorithms.

Getting the library
+++++++++++++++++++

The library may be downloaded from

http://www.cs.aau.dk/~nesotto/boost/range_ex.zip

or from the Boost vault under "Algorithms". The docs may be browsed
online here

http://www.cs.aau.dk/~nesotto/boost/libs/range/

Please note that the documentation is integrated with the current
Range ilbrary. Therefore the relevant sections for the review is

http://www.cs.aau.dk/~nesotto/boost/libs/range/doc/adaptors.html

and

http://www.cs.aau.dk/~nesotto/boost/libs/range/doc/algorithms.html

The code may be browsed here:

http://www.cs.aau.dk/~nesotto/boost/boost/range/

Notice the library is header only
(exception: the adaptor tokenized() depends on Boost.Regex).

Writing a review
++++++++++++++++

If you feel this is an interesting library, then please submit your
review to the developer list (preferably), or to the review manager.

Here are some questions you might want to answer in your review:

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library? With what compiler? Did you have any
problems?
- How much effort did you put into your evaluation? A glance? A quick
- reading? In-depth study?
- Are you knowledgeable about the problem domain?

And finally, every review should answer this question:

- Do you think the library should be accepted as a Boost library?

Be sure to say this explicitly so that your other comments don't
obscure your overall opinion.

Special considerations
++++++++++++++++++++++

Various RangeEx like libraries have been implemented in the past. You
might want to compare with those libraries when you form your oppinion:

1. John Torjo's range lib

http://rangelib.synesis.com.au/libs/boost-rangelib-20040913.zip
http://torjo.com/rangelib/index.html

2. Adobe's ASL libraries include range-based algorithms:

http://stlab.adobe.com/group__algorithm.html

I'm looking forward to your review.

best regards

Thorsten, Review Manager

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Boost 1.38.0 released

2009-02-09T16:42:10Z

Boost 1.38.0 has been released and is available from SourceForge. See
http://sourceforge.net/projects/boost/

This release includes three new libraries: Flyweight, ScopeExit, and Swap.

Updated Libraries: Accumulators, Any, Asio, Config, Date_Time,
Exception, Filesystem, Graph, Hash, Interprocess, Intrusive, Lexical
Cast, Math, Multi-index Containers, Proto, Regex, Thread, TR1, Type
Traits, Unordered, and Xpressive.

Other Changes: Experimental CMake build system.

You can read the full release announcement here:
http://www.boost.org/users/news/version_1_38_0

The release managers were Beman Dawes, Daniel James, Eric Niebler, and
Rene Rivera.

--Beman Dawes
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Boost 1.38.0 beta 2 available

2009-01-30T06:36:59Z

Boost 1.38.0 beta 2 available is available from SourceForge.

http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&release_id=657345

Please report any problems or comments to the users or developers mailing lists.

-------------

Version 1.38.0

New Libraries

* Flyweight:
+ Design pattern to manage large quantities of highly
redundant objects, from Joaquín M López Muñoz.
* ScopeExit:
+ Execute arbitrary code at scope exit, from Alexander Nasonov.
* Swap:
+ Enhanced generic swap function, from Joseph Gauterin.

Updated Libraries

* Accumulators:
+ Add rolling_sum, rolling_count and rolling_mean accumulators.
* Date_Time:
+ Added support for formatting and reading time durations
longer than 24 hours with new formatter: %0.
+ Removed the testfrmwk.hpp file from the public include directory.
+ Fixed several bugs and compile errors.
+ For full details see the change history
* Exception:
+ Improved and more customizable diagnostic_information output.
* Hash:
+ boost/functional/detail/container_fwd.hpp has been moved
to boost/detail/container_fwd.hpp. The current location is deprecated.
+ For more detail, see the library changelog.
* Interprocess:
+ Updated documentation to show rvalue-references funcions
instead of emulation functions.
+ More non-copyable classes are now movable.
+ Move-constructor and assignments now leave moved object in
default-constructed state instead of just swapping contents.
+ Several bugfixes (#2391, #2431, #1390, #2570, #2528).
* Intrusive:
+ New treap-based containers: treap, treap_set, treap_multiset.
+ Corrected compilation bug for Windows-based 64 bit compilers.
+ Corrected exception-safety bugs in container constructors.
+ Updated documentation to show rvalue-references funcions
instead of emulation functions.
* Math:
+ Added Johan Råde's optimised floating point classification routines.
+ Fixed code so that it compiles in GCC's -pedantic mode
(bug report #1451).
* Multi-index Containers: Some redundant type definitions have
been deprecated. Consult the library release notes for further
information.
* Proto:
+ Fix problem with SFINAE of binary operators (Bug 2407).
+ Fix proto::call transform for callable transforms with >3 arguments.
+ result_of::value changed behavior for array-by-value terminals.
+ unpack_expr requires only Forward Sequences rather than
Random Access Sequences.
+ Deprecate legacy undocumented
BOOST_PROTO_DEFINE_(VARARG_)FUNCTION_TEMPLATE macros.
+ Add BOOST_PROTO_REPEAT and BOOST_PROTO_LOCAL_ITERATE
macros to help with repetitive code generation
+ Support for nullary expressions with tag types other than
proto::tag::terminal
+ Allow 0- and 1-argument variants of proto::or_ and proto::and_
* Regex:
+ Breaking change: empty expressions, and empty alternatives
are now allowed when using the Perl regular expression syntax. This
change has been added for Perl compatibility, when the new
syntax_option_type no_empty_expressions is set then the old behaviour
is preserved and empty expressions are prohibited. This is issue
#1081.
+ Added support for Perl style ${n} expressions in format
strings (issue #2556).
+ Added support for accessing the location of
sub-expressions within the regular expression string (issue #2269).
+ Fixed compiler compatibility issues #2244, #2514, and #2458.
* Unordered:
+ Use boost::swap.
+ Use a larger prime number list for selecting the number of buckets.
+ Use aligned storage to store the types.
+ Add support for C++0x initializer lists where they're available.
+ For more detail, see the library changelog.
* Xpressive:
+ basic_regex gets nested syntax_option_flags and value_type
typedef, for compatibility with std::basic_regex
+ Ported to Proto v4; Proto v2 at boost/xpressive/proto has
been removed.
+ regex_error inherits from boost::exception

Other Changes

Experimental support for building Boost with CMake has been
introduced in this version. For more details see the wiki, Discussion
is taking place on the Boost-cmake mailing list.

Compilers Tested

Boost's primary test compilers are:
* TODO
* GCC 4.0.1 on OS X 10.4.10 and 10.5.2 on Intel and 10.4.9 on Power PC.
* GCC 4.3.2 on Ubuntu Linux.
* GCC 4.3.3 on Unstable Debian.
* GCC 4.2.1 on HP-UX 64-bit.
* HP C/aC++ B3910B A.06.17 on HP-UX 64-bit.
* Visual C++ 7.1 SP1, 8.0 SP1 and 9.0 SP1 on Windows XP.

Boost's additional test compilers include:
* OS X:
+ GCC 4.0.1 on OS X 10.4.10 and 10.5.2 on Intel, OS X 10.4.9
on PowerPC
+ Intel 9.1, 10.0 on OS X 10.4.10
+ Intel 10.1, 11.0 on OS X 10.5.2
* On Linux:
+ GCC 4.1.1, 4.2.1 on 64-bit Red Hat Enterprise Linux
+ GCC 4.1.2 on 64-bit Redhat Server 5.1
+ GCC 3.4.3, GCC 4.0.1, GCC 4.2.4 and GCC 4.3.2 on Red Hat
Enterprise Linux
+ GCC 4.3.2 with C++0x extensions
+ GCC 4.2.1 on OpenSuSE Linux
+ pgCC 8.0-0a 64-bit target on Red Hat Enterprise Linux
+ QLogic PathScale(TM) Compiler Suite: Version 3.1 on Red
Hat Enterprise Linux
* IBM XL C/C++ Enterprise Edition for AIX, V10.1.0.0, on AIX
Version 5.3.0.40
* GCC 4.2.1 on FreeBSD 7.
* GCC 4.2.1 on HP-UX Integrity
* HP C/aC++ B3910B A.06.17 on HP-UX 64-bit.

Acknowledgements

TODO
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review] UUID review results

2009-01-12T06:28:35Z

Hi all,

Some while ago we have had a lively discussion during the review of Andy
Thompkin's UUID library. I counted 11 votes, 10 'yes' votes and one 'no'
vote. IMHO the 'no' vote has been superseded by the followup discussion and
all issues have been resolved.

Almost all reviewers stated the UUID library to be very useful. Given the
overwhelming number of 'yes' votes the UUID library is accepted for
inclusion into Boost. Before inclusion into the Boost SVN Andy will need to
fix a couple of minor issues as discussed during the review, some of which
are:

- POD-ness
- lexical_cast
- default construction

Congratulations to Andy for his effort related to pushing the UUID library
forward. I hope to see active development and maintenance of this library in
the future.

Regards Hartmut
Review Manager

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

BoostCon 2009: Submission deadline extended

2009-01-10T02:49:29Z

Hi all,

The deadline for the submission of session proposals has been extended to
January 20th, 2009.
No further extensions will be granted. Please find below the original call
for participation.

Conference registration will be available at
http://www.boostcon.com/registration.

Regards Hartmut

----------------------------------------------------------------------------
3rd annual Boost Conference 2009
Aspen CO, USA, May 3-9, 2009, www.boostcon.com
----------------------------------------------------------------------------

Call for participation
----------------------
Promising to be the main face-to-face event for all things Boost
(www.boost.org), BoostCon'09 opens the door to your C++ future. From using
the Boost libraries to writing and maintaining them, from evangelizing to
deploying Boost within your organization, from infrastructure and process
to vision and mission, and from TR1 to TR2 and the new C++0x Standard,
BoostCon brings together the sessions, the colleagues, and the inspiration
to support your work with C++ and Boost in particular for the next year.

To reflect the breadth of the Boost community, the conference includes
sessions aimed at two constituencies: Boost end-users and hard-core Boost
library and tool developers. The program fosters interaction and engagement
within and across those two groups, with an emphasis on hands-on,
participatory sessions.

Session topics
--------------

* Topics of interest include, but are not restricted to, the following:
* General tutorial sessions introducing one or more Boost libraries
* In-depth sessions on using specific libraries
* Case studies on using Boost
* Experts panels
* Advanced sessions on implementation techniques used within Boost
libraries
* C++0x and how it will change life for users and library writers
* TR1 and TR2
* Development workshops to extend or enhance existing Boost libraries
* Workshops on design process
* Infrastructure workshops such as Build tools, Website, Testing
* Concepts and Generic Programming
* Hardware and infrastructure presentations focused on how libraries can
make better use of the technology
* Other topics likely to be of great interest to Boost users and
Developers.

Interactive and collaborative sessions are encouraged, as this is the nature

of both the on-line Boost community and the style of learning and
participation that has proven most successful at such events. Sessions can
be tutorial based, with an emphasis on interaction and participant
involvement, or workshop based, whether hands-on programming or paper-based,

discussion-driven collaborative work.

Session formats
---------------

Presentations
.............
Presentations focus on a practitioner's ideas and experience with anything
relevant to Boost and Boost users.

Panels
......
Panels feature three or four people presenting their ideas and experiences
relating to Boost's relevant, controversial, emerging, or unresolved issues.

Panels may be conducted in several ways, such as comparative, analytic,
or historic.

Tutorials
.........
Tutorials are sessions at which instructors teach conference participants
specific Boost-relevant skills.

Workshops
.........
Workshops provide an active arena for advancements in Boost-relevant topics.

Workshops provide the opportunity for experienced practitioners to develop
new ideas about a topic of common interest and experience.

Author's Corner Presentations
.............................
These were introduced at BoostCon 2008, and were a great success. They are
short (30 minute) sessions, focusing on tips on usage and design. In
addition, we're looking to uncover the hidden design gems boost libraries.

Tool Vendors Presentations
..........................
We actively encourage tool vendors and ISP's to submit proposals for a
special Tool Vendors Session Track aimed at products related to Boost
and C++ (compilers, libraries, tools, etc.).

Other formats may also be of interest. Don't hold back a proposal just
because it doesn't fit into a pigeonhole.

Submitting a proposal
---------------------
Standard Sessions are 90 minutes. You may submit a proposal for fractions
or multiples of 90-minutes. Fractional proposals will be grouped into 90
minute sessions covering related topics. Longer sessions, such as
tutorials and classes, will be assigned 90 minute, three hour (i.e. half
day), or six hour (i.e. full day) time slots.

Please include:
* The working title.
* Type of session: presentation, panel, tutorial, workshop, authors corner,
vendor track, other
* A paragraph or two describing the topic covered, suitable for the
conference web site
* Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes,
half-day, full day
* Alternate lengths, if you are willing to make adjustments: 10-20 minute
lightning-talks, 45 minutes, 90 minutes, half-day, full day
* Audience: users, developers, both
* Level: basic, intermediate, advanced
* A biography, suitable for the conference web site
* Your contact information (will not be made public)

Submission details
------------------
All submissions have to be done through the EasyChair conference management
system: http://www.easychair.org/conferences/?conf=boostcon09. If you have
not already registered at EasyChair, you will need to do so in order to
submit your proposal.

All submissions will go through a peer review process.

Authors are invited to submit PDF versions of full papers of up to 10 pages
in ACM conference proceedings format (see
http://www.acm.org/sigs/publications/proceedings-templates). The full
papers are not required unless you want them published in the proceedings.

All accepted papers will be made available in the Association for Computing
Machinery (ACM) Digital Library (approval pending). Best papers, after
further reviews, will be considered to be book chapters or journal articles
in a renowned journal.

The session materials go on the BoostCon CD handed out to attendees.

For general information on the BoostCon 2009 paper submission or the scope
of technical papers solicited, please refer to the conference website at
www.boostcon.com. For any other questions about the submission process or
paper format, please contact the Program Committee at
boostcon09@.... If you have any technical problems with
EasyChair, please contact EasyChair for help.

Note: Presenters must agree to grant a non-exclusive perpetual license to
publish submitted materials, either electronically or in print, in any
media related to BoostCon.

Important dates
---------------
Proposals for submissions due: January 20th 2009.
Proposals acceptances sent (tentative program available): February 10th,
2009
Fully scheduled program available: March 1st, 2009
Session materials due: April 1st 2009.

Hartmut Kaiser, email: hartmut.kaiser@... (Program Committee Chair)
David Abrahams, email: dave@... (Conference Chair)

On behalf of the conference organizers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[boost] Futures Review Starts Today - January 5, 2009

2009-01-05T17:25:46Z

Futures Review Starts Today - January 5, 2009

Braddock Gaskill
http://braddock.com/~braddock/future

Anthony Williams
http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp

Please review one or both libraries for submission to boost.
Apparently, Anthony Williams' submission has also been
sumbitted the C++ standards committee. Status unknown.

As always, here are some questions you might want to answer in your
review(s):

What is your evaluation of the design(s)?
What is your evaluation of the implementation(s)?
What is your evaluation of the documentation?
What is your evaluation of the potential usefulness of the library(s)?
Did you try to use the library? With what compiler(s)? Did you have
any problems?
How much effort did you put into your evaluation(s)? A glance? A quick
reading? In-depth study?
Are you knowledgeable about the problem domain?
Do you think the libraries should be accepted into Boost as-is or
should they be merged?

Apparently, there has been various discussions about these two
libraries last six months.
The authors will need to bring us up to date as to why they want their
libraries
to be reviewed seperately.

Also, each author should evaluate each others library and point out
the differences
in their implentations. These will serve as useful discussion points.

The ideal outcome in my mind would be a resubmitted submission,
incorporating the best
ideas from each. Tell me if you share this view or what is your
preferred result.

As always, your reviews will certainly assist the authors in improving
their libraries even further.
Thank you in advance. Please feel free to participate in any
discussion even if your
not going to provide a full review.

Review Manager
Tom Brinkman
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

BoostCon 2009: Call for participation

2009-01-04T02:56:41Z

Hi all,

Please find below the call for participation for the 3rd annual Boost
Conference in Aspen. There are only a couple of days left to submit any
proposals. I'm sorry for any duplicates you might receive.

Please forward this mail to any related mailing list or any person you think
might be interested.

Regards Hartmut

----------------------------------------------------------------------------
3rd annual Boost Conference 2009
Aspen CO, USA, May 3-9, 2009, www.boostcon.com
----------------------------------------------------------------------------

Call for participation
----------------------
Promising to be the main face-to-face event for all things Boost
(www.boost.org), BoostCon'09 opens the door to your C++ future. From using
the Boost libraries to writing and maintaining them, from evangelizing to
deploying Boost within your organization, from infrastructure and process
to vision and mission, and from TR1 to TR2 and the new C++0x Standard,
BoostCon brings together the sessions, the colleagues, and the inspiration
to support your work with C++ and Boost in particular for the next year.

To reflect the breadth of the Boost community, the conference includes
sessions aimed at two constituencies: Boost end-users and hard-core Boost
library and tool developers. The program fosters interaction and engagement
within and across those two groups, with an emphasis on hands-on,
participatory sessions.

Session topics
--------------

* Topics of interest include, but are not restricted to, the following:
* General tutorial sessions introducing one or more Boost libraries
* In-depth sessions on using specific libraries
* Case studies on using Boost
* Experts panels
* Advanced sessions on implementation techniques used within Boost
libraries
* C++0x and how it will change life for users and library writers
* TR1 and TR2
* Development workshops to extend or enhance existing Boost libraries
* Workshops on design process
* Infrastructure workshops such as Build tools, Website, Testing
* Concepts and Generic Programming
* Hardware and infrastructure presentations focused on how libraries can
make better use of the technology
* Other topics likely to be of great interest to Boost users and
Developers.

Interactive and collaborative sessions are encouraged, as this is the nature

of both the on-line Boost community and the style of learning and
participation that has proven most successful at such events. Sessions can
be tutorial based, with an emphasis on interaction and participant
involvement, or workshop based, whether hands-on programming or paper-based,

discussion-driven collaborative work.

Session formats
---------------

Presentations
.............
Presentations focus on a practitioner's ideas and experience with anything
relevant to Boost and Boost users.

Panels
......
Panels feature three or four people presenting their ideas and experiences
relating to Boost's relevant, controversial, emerging, or unresolved issues.

Panels may be conducted in several ways, such as comparative, analytic,
or historic.

Tutorials
.........
Tutorials are sessions at which instructors teach conference participants
specific Boost-relevant skills.

Workshops
.........
Workshops provide an active arena for advancements in Boost-relevant topics.

Workshops provide the opportunity for experienced practitioners to develop
new ideas about a topic of common interest and experience.

Author's Corner Presentations
.............................
These were introduced at BoostCon 2008, and were a great success. They are
short (30 minute) sessions, focusing on tips on usage and design. In
addition, we're looking to uncover the hidden design gems boost libraries.

Tool Vendors Presentations
..........................
We actively encourage tool vendors and ISP's to submit proposals for a
special Tool Vendors Session Track aimed at products related to Boost
and C++ (compilers, libraries, tools, etc.).

Other formats may also be of interest. Don't hold back a proposal just
because it doesn't fit into a pigeonhole.

Submitting a proposal
---------------------
Standard Sessions are 90 minutes. You may submit a proposal for fractions
or multiples of 90-minutes. Fractional proposals will be grouped into 90
minute sessions covering related topics. Longer sessions, such as
tutorials and classes, will be assigned 90 minute, three hour (i.e. half
day), or six hour (i.e. full day) time slots.

Please include:
* The working title.
* Type of session: presentation, panel, tutorial, workshop, authors corner,
vendor track, other
* A paragraph or two describing the topic covered, suitable for the
conference web site
* Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes,
half-day, full day
* Alternate lengths, if you are willing to make adjustments: 10-20 minute
lightning-talks, 45 minutes, 90 minutes, half-day, full day
* Audience: users, developers, both
* Level: basic, intermediate, advanced
* A biography, suitable for the conference web site
* Your contact information (will not be made public)

Submission details
------------------
All submissions have to be done through the EasyChair conference management
system: http://www.easychair.org/conferences/?conf=boostcon09. If you have
not already registered at EasyChair, you will need to do so in order to
submit your proposal.

All submissions will go through a peer review process.

Authors are invited to submit PDF versions of full papers of up to 10 pages
in ACM conference proceedings format (see
http://www.acm.org/sigs/publications/proceedings-templates). The full
papers are not required unless you want them published in the proceedings.

All accepted papers will be made available in the Association for Computing
Machinery (ACM) Digital Library (approval pending). Best papers, after
further reviews, will be considered to be book chapters or journal articles
in a renowned journal.

The session materials go on the BoostCon CD handed out to attendees.

For general information on the BoostCon 2009 paper submission or the scope
of technical papers solicited, please refer to the conference website at
www.boostcon.com. For any other questions about the submission process or
paper format, please contact the Program Committee at
boostcon09@.... If you have any technical problems with
EasyChair, please contact EasyChair for help.

Note: Presenters must agree to grant a non-exclusive perpetual license to
publish submitted materials, either electronically or in print, in any
media related to BoostCon.

Important dates
---------------
Proposals for submissions due: January 10th 2009.
Proposals acceptances sent (tentative program available): February 10th,
2009
Fully scheduled program available: March 1st, 2009
Session materials due: April 1st 2009.

Hartmut Kaiser, email: hartmut.kaiser@... (Program Committee Chair)
David Abrahams, email: dave@... (Conference Chair)

On behalf of the conference organizers

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Futures - Reviews Needed (January 5, 2009)

2008-12-30T11:15:29Z

Futures

Join the review and discussion starting January 5, 2009.

I need commitments for reviews from threading experts on the two
Futures library candidates.

Braddock Gaskill - http://braddock.com/~braddock/future
Anthony Williams - http://www.justsoftwaresolutions.co.uk/files/n2561_future.hpp

Early comments are welcome.
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

BoostCon 2009: Call for Participation

2008-12-13T10:06:05Z

Hi all,

before we all relax into the holidays I wanted to remind you all about next
year's Boost Conference in Aspen, CO, USA, May 3-9. Even if all important
dates are listed in the attached Call for Participation, I'll list them here
once again:

Proposals for submissions due: January 10th 2009.
Proposals acceptances sent (tentative program available): February 10th,
2009
Fully scheduled program available: March 1st, 2009
Session materials due: April 1st 2009.

IOW, you might want to use some of your free time during the next weeks to
think about a possible contribution. It really doesn't take much time to
come up with a short abstract!

Let's make sure BoostCon 2009 will be a major C++ event!

Happy holidays!
Regards Hartmut

Program Committee Chair
BoostCon 2009

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

3rd annual Boost Conference 2009 - CFP.pdf (119K) Download Attachment

[boost] [review][constrained_value] Review of Constrained Value Library begins today

2008-12-01T04:59:57Z

Hi all,

The review of the Robert Kawulak's Constrained Value library begins
today December 1, 2008, and will end on December 10th -- I will be
the review manager. Please post reviews to the developer list.

Here's the library synopsis:

The Boost Constrained Value library contains class templates useful
for creating constrained objects. A simple example is an object
representing an hour of a day, for which only integers from the range
[0, 23] are valid values.

bounded_int<int, 0, 23>::type hour;
hour = 20; // OK
hour = 26; // exception!

Behavior in case of assignment of an invalid value can be customized.
The library has a policy-based design to allow for flexibility in
defining constraints and behavior in case of assignment of invalid
values. Policies may be configured at compile-time for maximum
efficiency or may be changeable at runtime if such dynamic
functionality is needed.

The library can be downloaded from the here:
http://rk.go.pl/f/constrained_value.zip

The documentation is also available online here:
http://rk.go.pl/r/constrained_value

---------------------------------------------------

Please state in your review, whether you think the library should be
accepted as a Boost library. Additionally, please consider the
following aspects in your review of the library:

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library? With what compiler? Did you have any
problems?
- How much effort did you put into your evaluation? A glance? A quick
reading? In-depth study?
- Are you knowledgeable about the problem domain?

Thanks,

Jeff
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/
listinfo.cgi/boost
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

[Review] UUID library (mini-)review ends today, November 30rd

2008-11-30T17:14:17Z

Hi all,

the review of Andy Tompkins' UUID library ends today, November 30th.
Nevertheless, it's still possible to submit a review for at least a week, as
I'm not going to have time for the analysis of the review before Christmas.

Thanks to all of you who submitted a review.

Regards Hartmut
Review Manager

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce

Review Wizard Report for November 2008

2008-11-25T13:44:25Z

==============================================
Review Wizard Status Report for November 2008
==============================================

News
====

May 7 - Scope Exit Library Accepted - Awaiting SVN

May 17 - Egg Library Rejected

August 14 - Boost 1.36 Released
New Libraries: Accumulators, Exception, Units, Unordered Containers

August 27 - Finite State Machines Rejected

September 10 - Data Flow Signals Rejected

September 30 - Phoenix Accepted Conditionally

November 3 - Boost 1.37 Released
New Library: Proto

November 10 - Thread-Safe Signals Accepted - Awaiting SVN

November 25 - Globally Unique Identifier Library mini-Review in progress

Older Issues
============

The Quantitative Units library, accepted in April 2007 is in SVN
(listed as units).

The Time Series Library, accepted in August 2007, has not yet been
submitted
to SVN.

The Switch Library, accepted provisionally in January 2008,
has not yet been submitted for mini-review and full acceptance.

Property Map (Fast-Track) and Graph (Fast-Track) have been removed
from the review queue. The author (Andrew Sutton) intends to submit a
new version of this work at a later time.

A few libraries have been reviewed and accepted into boost, but have
not yet appeared in SVN as far as I can tell. Could some light be
shed on the status of the following libraries? Apologies if I have
simply overlooked any of them:

* Flyweight (Joaquin Ma Lopez Munoz)
* Floating Point Utilities (Johan Rade)
* Factory (Tobias Schwinger)
* Forward (Tobias Schwinger)
* Scope Exit (Alexander Nasonov)
* Time Series (Eric Niebler)
* Property Tree (Marcin Kalicinski) -- No documentation in SVN

Any information on the whereabouts of these libraries would be greatly
appreciated.

For libraries that are still waiting to get into SVN, please get them
ready and into the repository. The developers did some great work
making the libraries, so don't miss the chance to share that work with
others. Also notice that the review process page has been updated with
a section on rights and responsibilities of library submitters.

General Announcements
=====================

As always, we need experienced review managers. The review queue has
been growing substantially but we have had few volunteers, so manage
reviews if possible and if not please make sure to watch the review
schedule and participate. Please take a look at the list of libraries
in need of managers and check out their descriptions. In general
review managers are active boost participants or library
contributors. If you can serve as review manager for any of them,
email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu"
and "phillips at mps dot ohio-state dot edu" respectively.

We are also suffering from a lack of reviewers. While we all
understand time pressures and the need to complete paying work, the
strength of Boost is based on the detailed and informed reviews
submitted by you. A recent effort is trying to secure at least five
people who promise to submit reviews as a precondition to starting
the review period. Consider volunteering for this and even taking the
time to create the review as early as possible. No rule says you can
only work on a review during the review period.

A link to this report will be posted to www.boost.org. If you would
like us to make any modifications or additions to this report before
we do that, please email Ron or John.

If you're a library author and plan on submitting a library for review
in the next 3-6 months, send Ron or John a short description of your
library and we'll add it to the Libraries Under Construction below. We
know that there are many libraries that are near completion, but we
have hard time keeping track all of them. Please keep us informed
about your progress.

Review Queue
============

* Lexer
* Boost.Range (Update)
* Shifted Pointer
* Logging
* Futures - Williams
* Futures - Gaskill
* Join
* Pimpl
* Constrained Value
* Thread Pool
* Polynomial

--------------------

Lexer
-----
:Author: Ben Hanson

:Review Manager: Eric Neibler

:Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/
index.php?
action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%
20Text%20Processing&>`__

:Description:

A programmable lexical analyser generator inspired by 'flex'.
Like flex, it is programmed by the use of regular expressions
and outputs a state machine as a number of DFAs utilising
equivalence classes for compression.

Boost.Range (Update)
--------------------
:Author: Neil Groves

:Review Manager: Needed

:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/
vault/index.php?action=downloadfile&filename=range_ex.zip&directory=>`__

:Description: A significant update of the range library, including
range adapters.

Shifted Pointer
---------------
:Author: Phil Bouchard

:Review Manager: Needed

:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/
vault/index.php?&direction=0&order=&directory=Memory>`__

: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.

Logging
-------
:Author: John Torjo

:Review Manager: Gennadiy Rozental

:Download: http://torjo.com/log2/

:Description:
Used properly, logging is a very powerful tool. Besides aiding
debugging/testing, it can also show you how your application is
used. The Boost Logging Library allows just for that, supporting
a lot of scenarios, ranging from very simple (dumping all to one
destination), to very complex (multiple logs, some enabled/some
not, levels, etc). It features a very simple and flexible
interface, efficient filtering of messages, thread-safety,
formatters and destinations, easy manipulation of logs, finding
the best logger/filter classes based on your application's
needs, you can define your own macros and much more!

Futures
-------
:Author: Braddock Gaskill

:Review Manager: Tom Brinkman

:Download: http://braddock.com/~braddock/future/

:Description:

Joint review of the Futures libraries scheduled for 1/5/09-1/20/09.

The goal of the boost.future library is to provide a definitive
future implementation with the best features of the numerous
implementations, proposals, and academic papers floating around, in
the
hopes to avoid multiple incompatible future implementations in
libraries of
related concepts (coroutines, active objects, asio, etc). This
library hopes
to explore the combined implementation of the best future concepts.

Futures
-------
:Author: Anthony Williams

:Review Manager: Tom Brinkman

:Download: http://www.justsoftwaresolutions.co.uk/files/
n2561_future.hpp (code)
http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/
n2561.html (description)

:Description:

Joint review of the Futures libraries scheduled for 1/5/09-1/20/09.

This paper proposes a kind of return buffer that takes a
value (or an exception) in one (sub-)thread and provides the value in
another (controlling) thread. This buffer provides essentially two
interfaces:

* an interface to assign a value as class promise and

* an interface to wait for, query and retrieve the value (or
exception)
from the buffer as classes unique_future and shared_future.
While a
unique_future provides move semantics where the value (or
exception)
can be retrieved only once, the shared_future provides copy
semantics
where the value can be retrieved arbitrarily often.

A typical procedure for working with promises and futures looks like:

* control thread creates a promise,
* control thread gets associated future from promise,
* control thread starts sub-thread,
* sub-thread calls actual function and assigns the return value to
the promise,
* control thread waits for future to become ready,
* control thread retrieves value from future.

Also proposed is a packaged_task that wraps one callable object and
provides another one that can be started in its own thread and
assigns
the return value (or exception) to a return buffer that can be
accessed through one of the future classes.

With a packaged_task a typical procedure looks like:

* control thread creates a packaged_task with a callable object,
* control thread gets associated future from packaged_task,
* control thread starts sub-thread, which invokes the packaged_task,
* packaged_task calls the callable function and assigns the return
value,
* control thread waits for future to become ready,
* control thread retrieves value from future.

Notice that we are in the unusual position of having two very
different libraries with the same goal in the queue at the same
time. The Review Wizards would appreciate a discussion of the best way
to hold these two reviews to produce the best possible addition to
Boost.

Join
----
:Author: Yigong Liu

:Review Manager: Needed

:Download: http://channel.sourceforge.net/

:Description: Join is an asynchronous, message based C++ concurrency
library based on join calculus. It is applicable both to
multi-threaded applications and to the orchestration of asynchronous,
event-based applications. It follows Comega's design and
implementation and builds with Boost facilities. It provides a high
level concurrency API with asynchronous methods, synchronous methods,
and chords which are "join-patterns" defining the synchronization,
asynchrony, and concurrency.

Pimpl
-----
:Author: Vladimir Batov

:Review Manager: Needed

:Download: `Boost Sandbox Vault <http://www.boost-consulting.com/
vault/index.php?action=downloadfile&filename=Pimpl.zip&directory=&>`__
http://www.ddj.com/cpp/205918714 (documentation)

: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.

Constrained Value
-----------------
:Author: Robert Kawulak

:Review Manager: Jeff Garland

:Download: http://rk.go.pl/f/constrained_value.zip

:Description:

Review scheduled for 12/1/08-12/10/08

The Boost Constrained Value library contains class templates useful
for creating constrained objects. A simple example is an object
representing an hour of a day, for which only integers from the range
[0, 23] are valid values:

::

bounded_int<int, 0, 23>::type hour;
hour = 20; // OK
hour = 26; // exception!

Behavior in case of assignment of an invalid value can be
customized. For
instance, instead of throwing an exception as in the example above,
the value
may be adjusted to meet the constraint:

::

wrapping_int<int, 0, 255>::type buffer_index;
buffer_index = 257; // OK: wraps the value to fit in the range
assert( buffer_index == 1 );

The library doesn't focus only on bounded objects as in the
examples above --
virtually any constraint can be imposed by using a predicate:

::

// constraint (a predicate)
struct is_odd {
bool operator () (int i) const
{ return (i % 2) != 0; }
};

::

// and the usage is as simple as:
constrained<int, is_odd> odd_int = 1;
odd_int += 2; // OK
++odd_int; // exception!

The library has a policy-based design to allow for flexibility in
defining
constraints and behavior in case of assignment of invalid values.
Policies may
be configured at compile-time for maximum efficiency or may be
changeable at
runtime if such dynamic functionality is needed.

Thread Pool
-----------
:Author: Oliver Kowalke

:Review Manager: Needed

:Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/
index.php?action=downloadfile&filename=boost-threadpool.
2.tar.gz&directory=Concurrent%20Programming>`__

:Description:

The library provides:

- thread creation policies: determines the managemnt of worker
threads
- fixed set of threads in pool
- create workerthreads on demand (depending on context)
- let worker threads ime out after certain idle time

- channel policies: manages access to queued tasks
- bounded channel with high and low watermark for queuing tasks
- unbounded channel with unlimited numer of queued tasks
- rendezvous syncron hand-over between producer and consumer
threads

- queueing policy: determines how tasks will be removed from channel
- FIFO
- LIFO
- priority queue (attribute assigned to task)
- smart insertions and extractions (for instance remove oldest
task with
certain attribute by newst one)

- tasks can be chained and lazy submit of taks is also supported
(thanks to
Braddocks future library).

- returns a task object from the submit function. The task it self
can
be interrupted if its is cooperative (means it has some
interruption points
in its code -> ``this_thread::interruption_point()`` ).

Polynomial
----------
:Author: Pawel Kieliszczyk

:Review Manager: Needed

:Download: `Boost Sandbox Vault <http://www.boostpro.com/vault/
index.php?
action=downloadfile&filename=polynomial.zip&directory=>`__

:Description:
The library was written to enable fast and faithful polynomial
manupulation.
It provides:
- main arithmetic operators (+, -, * using FFT, /, %),
- gcd,
- different methods of evaluation (Horner Scheme, Compensated Horner
Algorithm, by preconditioning),
- derivatives and integrals,
- interpolation,
- conversions between various polynomial forms (special functions
for
creating Chebyshev, Hermite, Laguerre and Legendre form).

Libraries under development
===========================

Please let us know of any libraries you are currently
developing that you intend to submit for review.

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce