std.container.rbtree as Interval Tree?

[Eduard Staniloiu]

On Tuesday, 5 February 2019 at 19:12:43 UTC, James Blachly wrote:
>
>
> However, even when allowing (pseudo)duplicates, this means the 
> distinct intervals with same start but different end 
> coordinates are not deterministically placed/sorted within the 
> tree, because they are not sortable with the simple `this.start 
> < other.start` less function.
>

I have updated the example with an `opCmp` implementation.
https://run.dlang.io/is/ailnsy

I believe this is what you are looking for.

Cheers,
Edi