# -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4 PortSystem 1.0 PortGroup github 1.0 PortGroup python 1.0 github.setup mina86 pygtrie 2.5.0 v github.tarball_from archive revision 0 name py-${github.project} fetch.type git platforms {darwin any} supported_archs noarch license Apache-2 maintainers nomaintainer 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. checksums rmd160 93e6ecd4b96478715bc72f566efd9a78cca0c05c \ sha256 5d6cd0debe846ec26965a4dd547b5e2ceb749e0446f5b001b37a8be9c8745c67 \ size 43968 python.versions 38 39 if {${name} ne ${subport}} { test.run yes post-destroot { set docdir ${prefix}/share/doc/${subport} xinstall -d ${destroot}${docdir} xinstall -m 0644 -W ${worksrcpath} LICENSE README.rst \ ${destroot}${docdir} } }