From: Beman Dawes (beman_at_[hidden])
Date: 2001-01-10 10:54:03
I've been thinking about sequence algorithms because of several recent
boost postings, and string algorithms because I've seen several nice onces
recently. See below for a string algorithm example (by Jens Maurer).
The Boost Formal Review procedure works pretty well for whole libraries,
and would presumably work well if someone submitted a whole library of
But what happens if someone just has one or two neat algorithms to
submit? Neither the submitter nor the boost membership is going to want to
go through a whole Formal Review just for one or two algorithms,
particularly if they are only five or ten lines of code each.
One way to smooth the process would be to have a Boost Algorithms Policy
which defines what algorithms are acceptable and what aren't. Appoint a
couple of people as moderators of the Boost Algorithms Library (with CVS
write access). They will act as permanent Review Managers + library
maintainers. They would check that submissions meet the Algorithms Policy,
and then (?) to ensure sufficient peer-review. Once the algorithms
moderators agree the algorithm is accepted, they can move it into the
library with a minimum of fuss.
(?) might be something like stick the algorithm in a queue to give people
time to look at it and comment.
// replace the first instance of name in s with value
void replace(std::string & s,
const std::string & name, const std::string & value)
std::string::size_type p = s.find(name);
if(p != std::string::npos)
s.replace(p, name.length(), value);
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk