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

[Guillaume Piolat]

On Monday, 30 April 2018 at 02:21:37 UTC, solidstate1991 wrote:
> Looked around on dub, couldn't find anything that wouldn't 
> introduce too much new dependencies or that was actually @nogc 
> capable. I would be interested in some preexisting one, or some 
> better documented ones from the web. All I can find is either 
> very basic theory or things that already work well in my 
> implementation, like indexing and insertion without 
> optimization.

There is one in dplug:core, translated from Phobos.
https://github.com/AuburnSounds/Dplug/blob/master/core/dplug/core/map.d