On Friday, 11 May 2012 at 18:05:58 UTC, Mehrdad wrote:
and the solution indeed was NOT something I would've found by myself without spending hours on it.
Just a note: I believe I *had* seen SortedRange in the docs, but I'd never realized there's something called assumeSorted() that I was supposed to call... so I was searching up and down for how to search an *arbitrary* container, not how to search something which was already pre-sorted for me. (In retrospect, I probably should've just coded binary search myself...) It's very counterintuitive to have to make a new object (or struct) just to do binary search on an array...
