|
Boost : |
From: Hervé Brönnimann (hervebronnimann_at_[hidden])
Date: 2007-11-11 11:56:53
Ben: I'm shocked to discover such a "natural" extension of prev_ and
next_permutation, and that one year later it still isn't in the
standard. I have a commitment to algorithms and to C++. This should
definitely make it in a TR, but IMHO it's simple enough and useful
enough that it should even definitely be in C++0x if there's still time.
I've had success in getting the boost.minmax library into C++0x
(http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1990.htm),
I'm proud to say it took all of ten minutes of the committee's time
in Mont-Tremblant for the making the decision. I'll see if I can
work on your proposal. Get in touch later.
-- HB On Nov 11, 2007, at 11:25 AM, Ben Bear wrote: > Hi, all > > `gacap' is template library of "Generating All Combinations and > Permutations". It's supper of std::next_permutation() and > std::prev_permutation(). > > There's a old discussion: > "[boost] [tr2]Add Combination against std::permutation. HELP!" > http://lists.boost.org/Archives/boost/2006/09/110176.php > > I register a project in sf.net, http://gacap.wiki.sourceforge.net/. > Some introductions are here. > > I put a .zip file in the vault, vault/Algorithms/gacap-0.0.4.zip. > http://boost-consulting.com/vault/ > > It can also be downloaded from > http://sourceforge.net/project/showfiles.php?group_id=209093 > > The package contains: > gacap's header files > doc/ > example/ > test/ > > doc/gacap.txt and doc/classes.txt are important introductions. > > I test it under three compilers, see doc/compile.txt. > > It's one year later. > > Thanks. > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/ > listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk