Subject: Re: [boost] Proposed Library Boost.Algorithm
From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2011-03-30 18:55:24
On 03/30/2011 03:03 PM, Marshall Clow wrote:
> (Finally) I have uploaded to the vault<http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Boost.Algorithm-008.zip&directory=Algorithms&> a proposal for the Boost.Algorithm library.
> This has been a matter of interest and discussion for a long, long time.
> Some of this code was written during the "Library in a week" session at BoostCon 2008. More was written last summer after this year's BoostCon.
> There is no way that I can write and submit all the algorithms that people want/need/are interested in, so I am proposing to set up a system by which people can submit algorithms to be included in the library, and have them reviewed, much like how new libraries are reviewed for acceptance into boost. The difference will be that a new algorithm is generally a much smaller piece of code than a new library, so hopefully we can lower the barrier to getting small pieces of code into Boost.
> So, what's in this proposal?
> 1) Three search algorithms: Boyer-Moore, Boyer-Moore-Horspool and Knuth-Morris-Pratt. (search.hpp)
> 2) A set of predicates for determining if a sequence is ordered (by some criteria) (ordered.hpp)
> Originally written by Grant Erickson during the "Library in a week" session at Boostcon 2008, and reworked somewhat by myself.
The range library has some extra magic to
control the return type of find etc. Maybe
it should be used here too?
> 3) A set of predicates for determining other properties of a sequence, based on some suggestions for C++0x. (all.hpp)
The range overload of one_of_if should
take a const R& argument.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk