Boost logo

Boost :

Subject: Re: [boost] combinations and permutations
From: Anthony Williams (anthony.ajw_at_[hidden])
Date: 2011-01-04 11:05:26

Howard Hinnant <howard.hinnant_at_[hidden]> writes:

> On Jan 4, 2011, at 6:22 AM, Christopher Jefferson wrote:
>> On 4 Jan 2011, at 03:40, Howard Hinnant wrote:
>>> Warming this up for tr2:
>>> Comments welcome. Real world use welcome.
>> For TR2, it would be nice to produce a range object, so we could write:
>> for(perm: reversible_permutation(first, mid, last) )
>> f(perm);
> Not positive, but I believe (if one could figure out how to code it)
> would suffer the exponential cost of incrementation demonstrated for
> next_partial_permutation and next_combination in "Performance
> Considerations" shown in:

Couldn't the range adaptor object --- or the iterators generated from it
--- store the intermediate information about where in the series of
swaps it was? Sort of a continuation in your for_each_permutation()


Author of C++ Concurrency in Action
just::thread C++0x thread library   
Just Software Solutions Ltd
15 Carrallack Mews, St Just, Cornwall, TR19 7UL, UK. Company No. 5478976

Boost list run by bdawes at, gregod at, cpdaniel at, john at