1 comment

[ 3.5 ms ] story [ 9.4 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).