"Nice Trie Mister"

[Jason E. Aten]

Who can resist a good trie pun?

I put my combined ART (adaptive radix trie) + Order-Statistics tree

up on github.  It is a nice sorted key/value alternative to red-black trees. 

Some unique features:

You can iterate and delete at the same time. I tend to need to do this often.

Especially deleting the key that I've just found.

You can access the tree like a slice: tree.At(i) will give you the i-th element in the lexicographic sorted []byte keys. Almost as if you had said tree[i], were tree a slice.

https://github.com/glycerine/uart

Feedback welcome.

Enjoy.

Jason