A pure Python implementation of the trie data structure.
Project description
Python3 port of PyTrie. 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.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
PyTrie3-0.2.tar.gz
(97.7 kB
view details)
File details
Details for the file PyTrie3-0.2.tar.gz.
File metadata
- Download URL: PyTrie3-0.2.tar.gz
- Upload date:
- Size: 97.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c02783abf8cc93f0408ae50f44d2a33a8796b171afa17487ae59504919013eeb |
|
| MD5 | b3a48d6b29a30b38b28666a0ad534619 |
|
| BLAKE2b-256 | eb5f6fd616f7eff1f5803bc77238eac5e517f979f1cd0aeeb9ed856c9a4e023f |
