BSD Portsdevel/py-pytrie 0.4.0_1 DragonFly
Pure Python implementation of the trie data structure
- System
- DragonFly
- Repository
- DPorts
- Maintainer
- [email protected] (as in FreeBSD)
- License
- BSD3CLAUSE
- Categories
- devel, python
- Package size
- 11.6 KiB, 58.5 KiB installed
Description
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.
In the other systems
| System | Port | Version |
|---|---|---|
| DragonFly | devel/py-pytrie | 0.4.0_1 |
| FreeBSD | devel/py-pytrie | 0.4.0_1 |
| MidnightBSD | devel/py-pytrie | 0.4.0_1 |
| HardenedBSD | devel/py-pytrie | 0.4.0_1 |
| GhostBSD | devel/py-pytrie | 0.4.0_1 |
Install
Binary package:
pkg install py311-pytrieFrom DPorts:
cd /usr/dports/devel/py-pytrie && make install clean