| Name | Version | Summary | date |
| gen-tries |
0.3.1 |
Generalized trie implementation |
2025-01-12 19:15:06 |
| eth-bloom |
3.1.0 |
A python implementation of the bloom filter used by Ethereum |
2025-01-08 19:05:18 |
| lexpy |
1.1.0 |
Python package for lexicon |
2024-06-10 04:57:37 |
| trie |
3.0.1 |
Python implementation of the Ethereum Trie structure |
2024-04-22 20:38:26 |
| typed-trie |
0.1.0 |
A pure Python implementation of a trie with typing. |
2024-03-07 22:04:10 |
| strie |
0.2 |
Storage string trie. |
2024-03-07 08:12:19 |
| retrie |
0.3.0 |
Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing |
2024-02-22 07:32:43 |
| leven-search |
0.1.0 |
Fast and flexible search in a dictionary using Levenshtein distance |
2024-01-15 23:38:27 |
| py-fast-trie |
2.1.2 |
Python library for tries with different grades of fastness. |
2023-08-30 16:43:53 |
| astrie |
1.2 |
A simple trie data structure implementation |
2023-08-27 14:59:17 |
| baumregextrie |
0.10 |
A Trie data structure for efficient pattern matching using regular expressions - up to 1000 times faster |
2023-08-20 16:55:12 |
| trie_basic |
0.1.1 |
trie package |
2022-12-24 10:34:17 |
| pygtrie |
2.5.0 |
A pure Python trie data structure implementation. |
2022-07-16 14:29:47 |
| trieregex |
1.0.0 |
Build trie-based regular expressions from large word lists |
2020-06-23 11:42:10 |
| py-radix |
0.10.0 |
Radix tree implementation |
2017-10-09 14:48:33 |