Quick pass at a SortedArray implementation in Ruby backed by binary search, comes in handy quite a bit: https://gist.github.com/3828839 /cc @bascule
@ryanlecompte what I really need for timers is a heap with O(1) retrieval of the first element
-
-
@bascule definitely. I actually based that sample on your timers binary search insertion and python's bisect library impl. -
@ryanlecompte heh, nice!
End of conversation
New conversation -
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.