affix-tree
A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string.
Installation
In a virtualenv (see these instructions if you need to create one):
pip3 install affix-tree
Releases
| Version | Released | Bullseye Python 3.9 |
Bookworm Python 3.11 |
Files |
|---|---|---|---|---|
| 0.1.1 | 2025-02-15 | |||
|
|
||||
| 0.1.0 | 2025-02-15 | |||
Issues with this package?
- Search issues for this package
- Package or version missing? Open a new issue
- Something else? Open a new issue