The review period for the proposed Boost.Algorithms library, by Marshall
Clow, begins today (September 22) and runs through Oct 1. I'm pleased
to act as review manager.
,----[ Important Notes ]
| - Please do not post your review or discussion as a reply to this
| message.
| - Please begin your review's subject line with "[Review:Algorithms]"
| - Please feel free to note any individual issues in the GitHub issue
| tracker and make reference to them from your review.
| - Please see below for *further* important notes
`----
You can find the library at https://github.com/mclow/Boost.Algorithm.
If you don't want to use Git, you can get a .zip or tarball snapshot at
https://github.com/mclow/Boost.Algorithm/archives/master
Description
===========
The Boost Algorithms library is a work in progress; it is not meant to
be a complete set of general purpose algorithms for C++ programming;
but rather a small collection of useful algorithms, and a structure
for adding more over time.
The algorithms here fall into three basic categories:
1. Searching
- Boyer-Moore Search
- Boyer-Moore-Horspool Search
- Knuth-Morris-Pratt search
2. Sequence properties
- Tests to see if a sequence is ordered
- Tests for the elements of a sequence
3. Miscellaneous
- Constrain a value between two 'boundaries' (minmax)
Potential Interactions with Existing Boost Libraries
====================================================
This submission potentially interacts with all of the following existing
Boost libraries:
* foreach - http://boost.org/libs/foreach
* minmax - http://boost.org/libs/algorithm/minmax
* range - http://boost.org/libs/range
* string_algo - http://boost.org/libs/algorithm/string_algo
Reviewers should consider these potential interactions.
What to include in Review Comments
==================================
- Keep your criticism constructive. Constructive criticism usually
comes with specific suggestions for improvement.
- If you identify problems along the way, please note if they are minor,
serious, or showstoppers.
- Please *do* vote on whether the library should be accepted. Everyone
who takes the time to look at the library is qualified to vote, and
every vote is valuable.
- Other 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?
--
Dave Abrahams
BoostPro Computing
http://www.boostpro.com
According to the schedule, the review of the Boost.Endian library by Beman Dawes starts today.
===========
What is it?
===========
Boost.Endian provides facilities to manipulate the byte ordering of integers.
* The primary use case is binary I/O of integers for portable exchange
with other systems, via either file or network transmission.
* A secondary use case is to minimizing storage size via integers of
sizes and/or alignments not supported by the built-in types. Integers
1, 2, 3, 4, 5, 6, 7, and 8 bytes in length are supported.
* Two distinct approaches to byte ordering are provided. Each approach
has a long history of successful use, and each approach has use cases
where it is superior to the other approach.
* The explicit approach provides explicit functions to reorder bytes.
All four combinations of non-modifying or modifying, and unconditional
or conditional, functions are provided.
* The implicit approach provides integer classes that mimic the
built-in integers, implicitly handling all byte reordering.
===================
Getting the Library
===================
Docs are available at http://boost.cowic.de/rc/endian/doc/index.html
A zip file is available at http://boost.cowic.de/rc/endian/endian-rc1.zip
INSTALL instructions at http://boost.cowic.de/rc/endian/INSTALL
Alternately, the whole library can be checked out of the sandbox:
svn co http://svn.boost.org/svn/boost/sandbox/endian endian
================
Writing a Review
================
The reviews and all comments should be submitted to the developers list,
and the email should have "[Endian] Review" at the beginning of the subject line to make sure it's not missed.
Please explicitly state in your review whether the library should be
accepted.
The general review checklist:
- 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.
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
