@warrenm Most implementations should actually allow for this by creating a representative element. I think.
Is there a modification to binary search for searching over a discrete inequality, e.g. to locate the largest item below a given threshold?
-
-
-
@billjings One extra kink is that the elements are expensive to generate, so I want to do that lazily. This works: http://is.gd/s1lMra
End of conversation
New conversation -
-
-
@warrenm Iirc this would be a trivial modification. Plenty of good refs to implement by hand, too.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.