Provides the radix
package that implements a radix tree. The package only provides a single Tree
implementation, optimized for sparse nodes.
As a radix tree, it provides the following:
The full documentation is available on Godoc.
Below is a simple example of usage
// Create a tree r := radix.New() r.Insert("foo", 1) r.Insert("bar", 2) r.Insert("foobar", 2) // Find the longest prefix match m, _, _ := r.LongestPrefix("foozip") if m != "foo" { panic("should be foo") }