Skip to main content

Simple Python Trie Data Structure

Project description


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.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for TriePy, version 0.2.1
Filename, size File type Python version Upload date Hashes
Filename, size TriePy-0.2.1.tar.gz (2.8 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page