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:
http://home.roadrunner.com/~hinnant/combinations.html
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: http://home.roadrunner.com/~hinnant/combinations.html -Howard
Of course, before doing this, it would be nice to propose boost::range, or something similar to it, for TR2. Is anyone working on anything like that?
Chris _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost