Path to this page:
./
wip/py-trie3,
Python implementation of the trie data structure
Branch: CURRENT,
Version: 0.2,
Package name: py312-trie3-0.2,
Maintainer: kamelderouichePython3 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
Master sites:
RMD160: 634bc00c7a2df5c5f149c0e27ba33a6a1e48d3a9
Filesize: 95.439 KB
Version history: (Expand)
- (2024-09-19) Package has been reborn
- (2024-09-19) Updated to version: py312-trie3-0.2
- (2024-09-15) Package deleted from pkgsrc
- (2023-02-13) Updated to version: py310-trie3-0.2
- (2023-02-13) Package has been reborn
- (2021-10-08) Updated to version: py39-trie3-0.2