std.container.rbtree as Interval Tree?
edi33416 at gmail.com
Thu Feb 7 13:07:01 UTC 2019
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.
I believe this is what you are looking for.
More information about the Digitalmars-d-learn