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:

- O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality.
- Minimum / Maximum value lookups
- Ordered iteration

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") }