{"name":"py39-pygtrie","portdir":"python/py-pygtrie","version":"2.5.0","license":"Apache-2","platforms":"{darwin any}","epoch":0,"replaced_by":null,"homepage":"https://github.com/mina86/pygtrie","description":"Trie data structure implementation.","long_description":"pygtrie is a pure Python implementation of a trie data structure. Trie data structure, also known as radix or prefix tree, is a tree associating keys to values where all the descendants of a node have a common prefix (associated with that node). The trie module contains Trie, CharTrie and StringTrie classes each implementing a mutable mapping interface, i.e. dict interface. As such, in most circumstances, Trie could be used as a drop-in replacement for a dict, but the prefix nature of the data structure is trie’s real strength. The module also contains PrefixSet class which uses a trie to store a set of prefixes such that a key is contained in the set if it or its prefix is stored in the set.","active":false,"categories":["python"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-17","py39-setuptools","py39-wheel","py39-build","py39-installer"]},{"type":"fetch","ports":["git"]},{"type":"lib","ports":["python39"]},{"type":"test","ports":["py39-pytest"]}],"depends_on":[{"type":"lib","ports":["py39-magenta"]},{"type":"run","ports":["py39-magenta"]}]}