Subject: Re: [boost] [MPL] new run-time algorithm: for_all
From: Larry Evans (cppljevans_at_[hidden])
Date: 2008-11-24 11:54:17
On 11/24/08 09:46, George van Venrooij wrote:
> James Philbin wrote:
>> I think it's technically an n-ary Cartesian Product:
>> http://en.wikipedia.org/wiki/Cartesian_product, though I think other
>> languages just call it a Cartesian Product:
> Thanks James, this is exactly what I was looking for. I will rename it
> to cartesian_product.
> By the way, is it possible to submit new algorithms for possible
> inclusion into the MPL? Or is the library considered to be "finished"?
George, earlier this year, there was yet another person who had
a proposed solution:
The OP in that thread benchmarked the solution:
I'd guess that before anything is adopted when there are several
alternatives, the pros/cons and a benchmark comparing the alternatives
would be desirable.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk