Skip to content
This repository has been archived by the owner on May 4, 2018. It is now read-only.
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: joyent/libuv
base: fc40836f9abe
Choose a base ref
...
head repository: joyent/libuv
compare: f17c535b73a8
Choose a head ref
  • 1 commit
  • 7 files changed
  • 1 contributor

Commits on Feb 19, 2014

  1. 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).
    @bnoordhuis @saghul
    bnoordhuis authored and saghul committed Feb 19, 2014
    Copy the full SHA
    f17c535 View commit details
    Browse the repository at this point in the history