Set Intersection of SortedRanges

[Nordlöw via Digitalmars-d-learn]

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

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