Efficient binary search using two-way comparisons

[Enamex via Digitalmars-d]

On Saturday, 28 November 2015 at 20:04:11 UTC, Andrei 
Alexandrescu wrote:
> While reading Okasaki's bool on persistent data structures, I 
> found (page 14) a reference to a nice idea applicable to binary 
> search using D's two-way "less than" comparisons.
>
> https://issues.dlang.org/show_bug.cgi?id=15385
>
> Any takers?
>
>
> Andrei

Looks really simple. I could try? Though I'll probably come 
asking here about contribution procedures and stuff (especially 
that I can't, not possibly, compile Phobos or anything close to 
it with tests and such).