Re: [boost] [gacap]Is any interesting to "Generating All Combinations and Permutations"？

From: Herve Bronnimann (hervebronnimann_at_[hidden])
Date: 2007-12-04 10:21:17

Ben:  Sorry for the radio silence, but time was well used.  I have a full Boost library proposal articulated around your code with my modifications.  I'll upload to the vault tonight...  It has extensive example and full testing.

I also am working on a proposal for C++0x, or the TR2 if it can't be made to squeeze in.  I'm hoping Howard Hinnant will sponsor the proposal given that he's more or less proposed such a library in the past (see his web site).  Howard, if you read this, I'll contact you soon.

TTYS,
--
Herve Bronnimann
hervebronnimann_at_[hidden]
 
On Tuesday, December 04, 2007, at 09:10AM, "Ben Bear" <benbearchen_at_[hidden]> wrote:
>HB:
>  Hi.  I saw that you were back.  Shall we continue with the proposal?
> I wonder if you have time...
>
>  I update the gacap to 0.0.9.1.  It contains functions discussed in
>the proposal.  A example exam_hbr.cpp show those functions.  There's
>no test for those functions yet.  Well, I'll write some tests that are
>different from your,  I like to wrap them.
>
>
>  gacap-0.0.9.1 also contains a extended version of "Generating All
>Combinations and Permutations".  Those gacap-ex algorithms are really
>generating ALL combinations and permutations, the length of selected
>subset from 0 to N.
>
>  For example all combinations for {1, 2, 3}:
>{}
>{1}
>{1 2}
>{1 2 3}
>{2}
>{2 3}
>{3}
>
>
>2007/11/15, Ben Bear <benbearchen_at_[hidden]>:
>> next_combination:
>> Effects: ..., ... "both [first,last) and [first, middle)" are sorted
>> is not satisfied, ...
>> ----
>_______________________________________________
>Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
>
>