[tr2]Add Combination against std::permutation. HELP!
Hi, all! I wrote a proposal for TR2 about add combination against std::permutation. It's here: http://www.bxmy.org/article/tr2/combi_tr2.txt And the source code: http://www.bxmy.org/article/tr2/combination.hpp http://www.bxmy.org/article/tr2/test.cpp I need HELP! Because my bad ability in English, can anybody edit this report? And can anybody commit this proposal to WG21? One year ago, I wrote a email to the libstdc++ group for the combination, and they said that I should commit this to the Boost. I wrote a email to this mailing list one month ago, but nobody replies me. Maybe I should write the proposal for TR2. Now I wrote a draft. Because the combination and the permutation are a pair in the Mathematics. So it's needed to provide combination against the std::permutation. I have implemented the combination for several years. Now, I think my implementation is very pithy and is parallel to the permutation's implementation. The difference between combination and permutation is that combination needs initialization functions and the elements are divided into two ranges, selected and unselected. The combination is several times slow than the permutation. Example: // select two number from {0, 1, 2, 3, 4} int a[5] = {0, 1, 2, 3, 4}; init_combination (a, a+2, a+5); do { cout << a[0] << " " << a[1] << endl; } while (next_combination (a, a+2, a+5)); The result is: 0 1 0 2 0 3 0 4 1 2 1 3 1 4 2 3 2 4 3 4 Thanks. Ben Bear in Guangzhou, China 2006/09/15
Ben Bear wrote:
Hi, all!
I wrote a proposal for TR2 about add combination against std::permutation. It's here: http://www.bxmy.org/article/tr2/combi_tr2.txt
And the source code: http://www.bxmy.org/article/tr2/combination.hpp http://www.bxmy.org/article/tr2/test.cpp
I need HELP! Because my bad ability in English, can anybody edit this report? And can anybody commit this proposal to WG21?
I'm not a member of the committee, but do know a little about how the process works. And I'm afraid you've missed the pre-meeting mailing for the Portland meeting in Oct. In all likelihood that means it might be very difficult to get your proposal on the agenda....which means it likely won't make it into tr2 given that Portland is the cutoff for new proposals. Still you shouldn't give up. This looks very useful to me and would be a nice contribution to Boost even if it doesn't make TR2...so read on.
One year ago, I wrote a email to the libstdc++ group for the combination, and they said that I should commit this to the Boost. I wrote a email to this mailing list one month ago, but nobody replies me. Maybe I should write the proposal for TR2. Now I wrote a draft.
Sorry to hear that. Sometimes there's alot of email and it takes a bit of persistence to get attention. I would hope that John Maddock and Paul Bristow could evaluate your proposal as they've been working on some math and statistical interfaces. Last I know the link is at: http://www.johnmaddock.co.uk/proposal/index.html Maybe there's enough synergy to work together on these? Jeff
| -----Original Message----- | From: boost-bounces@lists.boost.org | [mailto:boost-bounces@lists.boost.org] On Behalf Of Jeff Garland | Sent: 15 September 2006 15:29 | To: boost@lists.boost.org | Subject: Re: [boost] [tr2]Add Combination against | std::permutation. HELP! | | Ben Bear wrote: | > Hi, all! | > | > I wrote a proposal for TR2 about add combination against | > std::permutation. It's here: | > http://www.bxmy.org/article/tr2/combi_tr2.txt | > | > And the source code: | > http://www.bxmy.org/article/tr2/combination.hpp | > http://www.bxmy.org/article/tr2/test.cpp | > | > | > I need HELP! Because my bad ability in English, can anybody edit | > this report? And can anybody commit this proposal to WG21? | | I'm not a member of the committee, but do know a little | about how the process | works. And I'm afraid you've missed the pre-meeting mailing | for the Portland | meeting in Oct. In all likelihood that means it might be | very difficult to | get your proposal on the agenda....which means it likely | won't make it into | tr2 given that Portland is the cutoff for new proposals. | | Still you shouldn't give up. This looks very useful to me | and would be a nice | contribution to Boost even if it doesn't make TR2...so read on. | | > One year ago, I wrote a email to the libstdc++ group for the | > combination, and they said that I should commit this to | the Boost. I | > wrote a email to this mailing list one month ago, but | nobody replies me. | > Maybe I should write the proposal for TR2. Now I wrote a draft. | | Sorry to hear that. Sometimes there's alot of email and it | takes a bit of | persistence to get attention. I would hope that John | Maddock and Paul Bristow | could evaluate your proposal as they've been working on some | math and | statistical interfaces. I noted this item some time and thought it looked a useful addition, and still seems so (though not widely useful?). But I am not nearly well qualified enough to judge and review the document - especially in the version at http://www.bxmy.org/article/combination.pdf ;-) However, I sense it is 'orthogonal' to the maths and stats work (alpha release Real Soon Now!) that John Maddock has done (with some minor input from me) so I am doubtful about much synergy between the two. I fear that Jeff is correct that you have missed the time-limit for TR2, but you can still submit it as a WG21 paper - TR3 may eventually exist. And I would still encourage you to submit for Boost. The 1st step is to dump your files in the Boost files vault http://www.boost-consulting.com/vault/ . Paul --- Paul A Bristow Prizet Farmhouse, Kendal, Cumbria UK LA8 8AB +44 1539561830 & SMS, Mobile +44 7714 330204 & SMS pbristow@hetp.u-net.com
2006/9/16, Paul A Bristow <pbristow@hetp.u-net.com>:
| -----Original Message----- | From: boost-bounces@lists.boost.org | [mailto:boost-bounces@lists.boost.org] On Behalf Of Jeff Garland | Sent: 15 September 2006 15:29 | To: boost@lists.boost.org | Subject: Re: [boost] [tr2]Add Combination against | std::permutation. HELP! | | Ben Bear wrote: | > Hi, all! | > | > I wrote a proposal for TR2 about add combination against | > std::permutation. It's here: | > http://www.bxmy.org/article/tr2/combi_tr2.txt | > | > And the source code: | > http://www.bxmy.org/article/tr2/combination.hpp | > http://www.bxmy.org/article/tr2/test.cpp | > | > | > I need HELP! Because my bad ability in English, can anybody edit | > this report? And can anybody commit this proposal to WG21? | | I'm not a member of the committee, but do know a little | about how the process | works. And I'm afraid you've missed the pre-meeting mailing | for the Portland | meeting in Oct. In all likelihood that means it might be | very difficult to | get your proposal on the agenda....which means it likely | won't make it into | tr2 given that Portland is the cutoff for new proposals. | | Still you shouldn't give up. This looks very useful to me | and would be a nice | contribution to Boost even if it doesn't make TR2...so read on. | | > One year ago, I wrote a email to the libstdc++ group for the | > combination, and they said that I should commit this to | the Boost. I | > wrote a email to this mailing list one month ago, but | nobody replies me. | > Maybe I should write the proposal for TR2. Now I wrote a draft. | | Sorry to hear that. Sometimes there's alot of email and it | takes a bit of | persistence to get attention. I would hope that John | Maddock and Paul Bristow | could evaluate your proposal as they've been working on some | math and | statistical interfaces.
I noted this item some time and thought it looked a useful addition, and still seems so (though not widely useful?). But I am not nearly well qualified enough to judge and review the document - especially in the version at http://www.bxmy.org/article/combination.pdf ;-)
However, I sense it is 'orthogonal' to the maths and stats work (alpha release Real Soon Now!) that John Maddock has done (with some minor input from me) so I am doubtful about much synergy between the two.
I fear that Jeff is correct that you have missed the time-limit for TR2, but you can still submit it as a WG21 paper - TR3 may eventually exist. And I would still encourage you to submit for Boost. The 1st step is to dump your files in the Boost files vault http://www.boost-consulting.com/vault/ .
Thanks for showing me the way. I'll ready to submit for Boost. Eh, it will be a little slow for me. I don't know well about this community. It's pity that I'm late for TR2.
Ben Bear wrote:
2006/9/16, Paul A Bristow <pbristow@hetp.u-net.com>:
I noted this item some time and thought it looked a useful addition, and still seems so (though not widely useful?). But I am not nearly well qualified enough to judge and review the document - especially in the version at http://www.bxmy.org/article/combination.pdf ;-)
However, I sense it is 'orthogonal' to the maths and stats work (alpha release Real Soon Now!) that John Maddock has done (with some minor input from me) so I am doubtful about much synergy between the two.
I fear that Jeff is correct that you have missed the time-limit for TR2, but you can still submit it as a WG21 paper - TR3 may eventually exist. And I would still encourage you to submit for Boost. The 1st step is to dump your files in the Boost files vault http://www.boost-consulting.com/vault/ .
Thanks for showing me the way. I'll ready to submit for Boost. Eh, it will be a little slow for me. I don't know well about this community.
Well, welcome :-) As for Boost submission there are some fairly good submission guidelines: http://www.boost.org/more/submission_process.htm Your stuff fits probably fits into algorithms section of the Boost.
It's pity that I'm late for TR2.
Unfortunately, there's a number of important things that won't make TR2. But Boost shows no sign of slowing down and for most of us that's almost as good :-) Jeff
<snip long quote> "Ben Bear" <benbearchen@gmail.com> writes:
Thanks for showing me the way. I'll ready to submit for Boost. Eh, it will be a little slow for me. I don't know well about this community.
Welcome :) Please read the discussion policy, particularly http://www.boost.org/more/discussion_policy.htm#effective Thanks, -- Dave Abrahams Boost Consulting www.boost-consulting.com
participants (4)
-
Ben Bear -
David Abrahams -
Jeff Garland -
Paul A Bristow