joyent/libuv — pull request #928 by bnoordhuis (2013-09-12 22:31:52+00:00)
Title: unix: use a heap for timers

Replace the red-black tree with a heap. The most common operation that
libuv performs on timers is looking up the first timer to expire. With
a red-black tree, that operation is O(log n). With a heap, it's O(1).