This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Combination algorithm opposite to std::permutation
- From: "Aaron W. LaFramboise" <aaronavay62 at aaronwl dot com>
- To: BenBear <cxj26424 at 163 dot com>
- Cc: chris jefferson <caj at cs dot york dot ac dot uk>, libstdc++ <libstdc++ at gcc dot gnu dot org>
- Date: Thu, 23 Jun 2005 23:56:19 -0500
- Subject: Re: Combination algorithm opposite to std::permutation
- References: <1119577982.7207.20.camel@btb.csu.edu.cn>
BenBear wrote:
> Excuse me. I want to submit my code of combination algorithm. My
> combination algorithm is compatible with std::permutation. I'm sorry i
> can't say more particular. But, I'm sure the Combination is as `GOOD' as
> the std::permutation.
Hi BenBear.
Since you haven't mentioned it anywhere, I'm assuming this combination
implementation is not yet part of any standard or standard proposal.
libstdc++ is primarily aimed at implementing the C++ standard and
related standards-track extensions. Generally speaking, the maintainers
will want the proposed addition to have already been fully discussed and
reviewed by a wide audience of peers, as well as documented in a
standards-esque form. They will probably also want the addition to be
proven in actual use. As such, it is very difficult for completely new
proposals to be accepted into libstdc++.
I would suggest you instead submit this for inclusion into Boost
<www.boost.org>. Read some of the material on the Boost website to get
a feel for how it works, and take a look at the mailing list archives,
then post your implementation to the main Boost developers list.
Hope this helps,
Aaron W. LaFramboise