Opportunistic worst-case complexity upgrade? aka binary search with `find`

[Jakob Ovrum via Digitalmars-d]

On Thursday, 24 July 2014 at 01:21:44 UTC, Jakob Ovrum wrote:
> -snip-

Another point is that the range types of the two currently 
available sorted containers - RedBlackTree and BinaryHeap - are 
*not* instances of SortedRange. If algorithms working on sorted 
ranges become a thing, it seems like they should be.