Slice Intersection in D

Question

Have anybody implemented intersections for array slices that overlap in memory? Algorithm returns [] upon no overlap.

I want this when pretty-printing (using overlap indentation) arrays slices that overlap in memory.

Answer 1

if you are sure they are arrays then just take the difference of the ptr fields:

size_t startoffset = b.ptr-a.ptr