{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["misc","python"],"comment":"Pure Python trie data structure implementation","compare":null,"dependentCount":null,"description":"A trie is a tree-like data structure whose nodes store the letters of an\nalphabet. By structuring the nodes in a particular way, words and strings\ncan be retrieved from the structure by traversing down a branch path of\nthe tree.","flavors":[],"html":"https://daemonports.org/dragonfly/misc/py-pygtrie/","kind":"port","lastUpdate":null,"license":["APACHE20"],"licenses":["Apache-2.0"],"maintainer":"yuri@FreeBSD.org","name":"py312-pygtrie","newest":true,"newestVersion":"2.6.2","noVulnData":false,"origin":"misc/py-pygtrie","otherSystems":[{"maintainer":"yuri@FreeBSD.org","newest":true,"origin":"misc/py-pygtrie","path":"/misc/py-pygtrie/","system":"FreeBSD","updated":"2026-09-16","version":"2.6.2"},{"maintainer":"yuri@FreeBSD.org","newest":true,"noVulnData":true,"origin":"misc/py-pygtrie","path":"","system":"HardenedBSD","version":"2.6.2"},{"maintainer":"yuri@FreeBSD.org","newest":true,"noVulnData":true,"origin":"misc/py-pygtrie","path":"","system":"GhostBSD","version":"2.6.2"}],"packages":null,"pkgName":"py312-pygtrie-2.6.2","related":null,"repository":"DPorts","requiredBy":[],"requiredByCount":0,"runDepends":["lang/python312"],"status":null,"system":"dragonfly","systemLabel":"DragonFly","version":"2.6.2","versions":[{"date":"2026-11-11","version":"2.6.2"}],"vulnerabilities":null,"www":"https://github.com/mina86/pygtrie"}
