Query::for_each_combinations(_mut)

[james7132]

What problem does this solve or what need does it fill?

Query::for_each_combinations(_mut), the for_each equivalent of iter_combinations(_mut).

What solution would you like?

The bug that is cited in the docs for Query::iter_combinations (rust-lang/rust#62529), has been resolved. Another attempt at implementing it should be taken.

What alternative(s) have you considered?

Don't implement it. Remove the comment about the bug.

[campbellcole]

I second this, especially since it seems iter_combinations is essentially O(n^2) and could probably benefit the most from par_for_each(_mut)

[tim-blackbird]

@campbellcole This issue is about for_each not par_for_each.
Not familiar enough to know how hard par_for_each would be to implement, but par_for_each_mut is not possible for combinations.