Stores data like an English dictionary (or other natural language) in a relatively space-efficient manner. Allows lookups in constant time in the number of words stored, by making each node represent a single character in a hierarchy of characters.

This module is based on this.

Note that although the portion of the API that covers iteration over the keys is lazy, the implementation is still eager.

The code passes:

1. pylint
2. pycodestyle
3. pydocstyle
4. pyflakes

1. CPython 2.7
2. CPython 3.[0123456]
3. Pypy 5.10.0
4. Pypy3 5.10.0
5. Jython 2.7.

You can e-mail the author with questions or comments: