demerphq wrote:
>  
>  A trie is a way of storing keys in a tree structure where the
>  branching logic is determined by the value of the digits of the key.
>  Ie: if we have "car", "cart", "carp", "call", "cull" and "cars" we can
>  build a trie like this:
>  
>    c + a + r + t
>      |   |   |
>      |   |   + p
>      |   |   |
>      |   |   + s
>      |   | 
>      |   + l - l
>      |   
>      + u - l - l

I think this could go in a comment, in the next iteration of the patch.

...
>  BTW, should i send a more detailed high level explanation of what this
>  patch does? I assumed most people would be familiar with the ideas it
>  involves.