1 go-radix [![Build Status](https://travis-ci.org/armon/go-radix.png)](https://travis-ci.org/armon/go-radix)
4 Provides the `radix` package that implements a [radix tree](http://en.wikipedia.org/wiki/Radix_tree).
5 The package only provides a single `Tree` implementation, optimized for sparse nodes.
7 As a radix tree, it provides the following:
8 * O(k) operations. In many cases, this can be faster than a hash table since
9 the hash function is an O(k) operation, and hash tables have very poor cache locality.
10 * Minimum / Maximum value lookups
13 For an immutable variant, see [go-immutable-radix](https://github.com/hashicorp/go-immutable-radix).
18 The full documentation is available on [Godoc](http://godoc.org/github.com/armon/go-radix).
23 Below is a simple example of usage
32 // Find the longest prefix match
33 m, _, _ := r.LongestPrefix("foozip")
35 panic("should be foo")