A pure Python implementation of the trie data structure.
Project description
A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
PyTrie-0.2.tar.gz
(96.4 kB
view details)
File details
Details for the file PyTrie-0.2.tar.gz.
File metadata
- Download URL: PyTrie-0.2.tar.gz
- Upload date:
- Size: 96.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
b272021351efadc6757591aac03ed4794bdfd091122204a4673e94bfb66cc500
|
|
| MD5 |
5997b46c854a68bc588f4527c987663a
|
|
| BLAKE2b-256 |
bba4b2e9f63ec9853777f77a22336020aa610233ba0678cdb7c2e63bd198fac7
|
