1 comment

[ 4.6 ms ] story [ 31.7 ms ] thread
I can't comment on how it stacks up against other router implementations, but as I understand it you're using a search tree so your router is O(log n).