Re:Mux – A lightweight, fast HTTP request router for Go
by SEJeff on Monday December 05, 2016 @02:03PM
(#13108235)
Fixed lookup time. A trie (aka radix tree) 3 levels deep with 1 million entries has the same lookup time as a 3 level deep trie with 5 entries.
[ Parent
| on HN ]
Re:Mux – A lightweight, fast HTTP request router for Go
by papaf on Monday December 05, 2016 @02:07PM
(#13108266)
Isn't the same thing true for a 3 level deep hashmap of hashmaps?
Re:Mux – A lightweight, fast HTTP request router for Go
by SEJeff on Monday December 05, 2016 @04:18PM
(#13109706)
See a much better answer than mine: https://news.ycombinator.com/item?id=13108781