| Name | Version | Summary | date |
| roa-checker |
1.1.4 |
Fast prefix origin pair lookups |
2024-03-17 20:50:56 |
| 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 |
| lib-cidr-trie |
1.2.2 |
Contains a trie of prefixes for fast lookups |
2024-02-23 04:01:38 |
| 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 |
| trie |
3.0.0 |
Python implementation of the Ethereum Trie structure |
2023-12-06 19:51:11 |
| triesus |
0.5.2 |
Find the Smallest Unique Subset (SUS) |
2023-12-06 10:44:35 |
| 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 |
| remerkleable |
0.1.27 |
Typed mutable SSZ views over cached and immutable binary merkle trees |
2023-01-26 10:56:18 |
| trie_basic |
0.1.1 |
trie package |
2022-12-24 10:34:17 |
| eth-bloom |
2.0.0 |
Python implementation of the Ethereum Trie structure |
2022-11-28 21:50:06 |
| lexpy |
1.0.0 |
Python package for lexicon |
2022-08-30 05:27:02 |
| 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 |