Efficient binary search using two-way comparisons

[Andrei Alexandrescu via Digitalmars-d]

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