# -*- 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           python 1.0

name                py-pygtrie
version             2.6.1
revision            0

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  2d975531f2cf17c9e0147a085e689d35d4833f93 \
                    sha256  1934613126070b4ec51a3cefcf0c94cebb0139043b444c0f02486caebd0d8011 \
                    size    56334

python.versions     314

if {${name} ne ${subport}} {
    test.run        yes
    test.args       test.py

    post-destroot {
        set docdir ${prefix}/share/doc/${subport}
        xinstall -d ${destroot}${docdir}
        xinstall -m 0644 -W ${worksrcpath} README.rst \
            ${destroot}${docdir}
    }
}
