skip to navigation
skip to content

TriePy 0.2.1

Simple Python Trie Data Structure


A simple trie implementation in Python

This implementation utilizes a dictionary as its backing
data structure. Essentially, it is creating nested dictionaries.

>>> from trie import TriePy
>>> t = TriePy()
>>> t.add_word("dog")
>>> t.add_word("doggy")
>>> t.add_word("dogs")
>>> t.contains_word("dog")
>>> t.contains_word("dogg")
>>> t.root
{'d': {'o': {'g': {'\0': {'word': 'dog'}, 's': {'\0': {'word': 'dogs'}}, 'g': {'y': {'\0': {'word': 'doggy'}}}}}}}

Unit Testing
nose is used for unit testing and simple unit tests
can be run with the following in the source trie directory:

You can install this as usual with ``.
`python install`

You can also install this via pip.
`pip install TriePy`

The usual "use virtualenv to test first" warnings apply.  
File Type Py Version Uploaded on Size
TriePy-0.2.1.tar.gz (md5) Source 2015-05-15 2KB
  • Downloads (All Versions):
  • 9 downloads in the last day
  • 69 downloads in the last week
  • 393 downloads in the last month