On Monday, 5 December 2016 at 21:34:39 UTC, Nordlöw wrote:
What's the fastest way of calculating a set-intersection of two or more SortedRanges (all containing unique values)?
Ahh, setops has intersection aswell: https://dlang.org/phobos/std_algorithm_setops.html#setIntersection I should have a guessed that.
