• =?UTF-8?B?Tm9yZGzDtnc=?= (4/4) Dec 05 2016 What's the fastest way of calculating a set-union of two or more
• =?UTF-8?B?Tm9yZGzDtnc=?= (3/5) Dec 05 2016 Doh, I meant intersection, not union:

=?UTF-8?B?Tm9yZGzDtnc=?= <per.nordlow gmail.com> writes:

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?

=?UTF-8?B?Tm9yZGzDtnc=?= <per.nordlow gmail.com> writes:

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