Is there some fast and @nogc capable binary search tree for D?

[solidstate1991]

On Monday, 30 April 2018 at 02:43:44 UTC, 12345swordy wrote:
>
> If the data involved classes then the answer is no, as there is 
> a bug regarding destroy as it involved external finalized c 
> function. I'm writing a DIP draft that address this.

I think I can get around that by storing the data in dynamic 
arrays for the while I need them, then use the tree for quicker 
random access.