4 ms·
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).
by jameskilton 12y ago
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).