Trie data structure implementation.
Project description
pytrie is a Python library implementing a trie data structure.
Trie data structure, also known as radix or prefix tree, is an ordered tree associating keys to values where all the descendants of a node have a common prefix (associated with that node).
The trie module contains Trie, CharTrie and StringTrie classes each implementing a mutable mapping interface, i.e. interface of the dictionary. As such, in most circumstances, Trie could be used as a drop-in replacement for a dict. Obviously the prefix nature of the data structure is what gives it its strengths.
Features
A full mutable mapping implementation.
Supports iterating over as well as deleting a subtrie.
Supports prefix checking as well as shortest and longest prefix look-up.
Extensible for any kind of user-defined keys.
Version History
0.9: 2014/02/03
Initial release.
Project details
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
File details
Details for the file pygtrie-0.9.1.tar.gz
.
File metadata
- Download URL: pygtrie-0.9.1.tar.gz
- Upload date:
- Size: 11.1 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 6e50fde0c25a0e46cdf21270e8e6aa4381a92f34a445a690c9995fbc8dc7cc34 |
|
MD5 | 3a6f99b2da13edf51862cdc0d297c0d9 |
|
BLAKE2b-256 | c7570a772a1d186b2908a6691db0e52e560de993b3cf310a6fd058cd58e019ff |