[Home]STLAlgorithmExtensions/MakePermutation

BOOST WIKI | STLAlgorithmExtensions | RecentChanges | Preferences | Page List | Links List

No diff available--this is the first major revision. (minor diff, author diff)
I'm not set on the name, but in the spirit of the other permutation algorithms, it would be good to have an algorithm that extracts the permutation array for a given sort. The prototype would look something like this:

 template < class RandomAccessIterator?, class Comparison >
 std::vector<size_t> make_permutation(RandomAccessIterator? begin,
                                      RandomAccessIterator? end,
                                      Comparison comp);

I haven't written the implementation yet, but I will soon. ;)


BOOST WIKI | STLAlgorithmExtensions | RecentChanges | Preferences | Page List | Links List
Edit text of this page | View other revisions
Last edited July 28, 2004 10:22 am (diff)
Search:
Disclaimer: This site not officially maintained by Boost Developers