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
for an immutable variant, see go-immutable-radix.

this package contains the source.