Comments on: Understand ranges better with the new Cartesian Product adaptor https://www.fluentcpp.com/2017/04/14/understand-ranges-better-with-the-new-cartesian-product-adaptor/ Jonathan Boccara's blog Thu, 11 May 2017 14:10:00 +0000 hourly 1 https://wordpress.org/?v=6.5.4 By: Jonathan Boccara https://www.fluentcpp.com/2017/04/14/understand-ranges-better-with-the-new-cartesian-product-adaptor/#comment-262 Thu, 11 May 2017 14:10:00 +0000 https://www.fluentcpp.com/?p=959#comment-262 In reply to Malcolm Parsons.

Can’t see how right now. But that’s a good point 🙂

]]> By: Malcolm Parsons https://www.fluentcpp.com/2017/04/14/understand-ranges-better-with-the-new-cartesian-product-adaptor/#comment-260 Wed, 10 May 2017 17:00:00 +0000 https://www.fluentcpp.com/?p=959#comment-260 In a proprietary product, I filter the results of a cartesian product so that each element in the output is different.

Performance is better if the filtering is done while producting:
for (auto& element1 : collection1) {
for (auto& element2 : collection2) {
if (element1 == element2) continue;
for (auto& element3 : collection3) {
if (element1 == element3) continue;
if (element2 == element3) continue;
func(element1, element2, element3);
}
}
}

So I use a decomposed cartesian product that lets me insert filter steps between product steps in a pipeline.

Is this possible with ranges?

]]> By: Vladislav Kaplan https://www.fluentcpp.com/2017/04/14/understand-ranges-better-with-the-new-cartesian-product-adaptor/#comment-212 Wed, 19 Apr 2017 07:33:00 +0000 https://www.fluentcpp.com/?p=959#comment-212 Thank you

]]>