What's the fastest way of calculating a set-union of two or more SortedRanges (all containing unique values)?

Any typical branchings of the algorithm depending on the lengths of the SortedRanges?

On Monday, 5 December 2016 at 20:18:24 UTC, Nordlöw wrote:
> What's the fastest way of calculating a set-union of two or more SortedRanges (all containing unique values)?

Doh, I meant intersection, not union:

http://forum.dlang.org/post/jthiwaxkyykalwfykprf@forum.dlang.org