Quick experiment to speed up searchs form my http router.
http://en.wikipedia.org/wiki/Radix_tree
Example:
n := radix.New()
n.Insert("romane", "romane")
n.Insert("romanus", "romanus")
n.Insert("romulus", "romulus")
n.Insert("rubens", "rubens")
n.Insert("ruber", "ruber")
n.Insert("rubicon", "rubicon")
n.Insert("rubicundus", "rubicundus")Builds:
r <nil>
-om <nil>
--an <nil>
---e romane
---us romanus
--ulus romulus
-ub <nil>
--e <nil>
---ns rubens
---r ruber
--ic <nil>
---on rubicon
---undus rubicundus
Search a path:
v, ok := n.Lookup("rubicundus")
if !ok {
t.Fatal("path not found")
}
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent