Source: python-trie Section: python Priority: optional Maintainer: Debian Python Modules Team Uploaders: Orestis Ioannou , Build-Depends: debhelper (>= 9), dh-python, python-all, python-sphinx, python3-all, Standards-Version: 3.9.8 Homepage: http://pythonhosted.org/PyTrie/ Vcs-Git: https://anonscm.debian.org/git/python-modules/packages/python-trie.git Vcs-Browser: https://anonscm.debian.org/git/python-modules/packages/python-trie.git Package: python-trie Architecture: all Suggests: python-trie-doc, Depends: ${misc:Depends}, ${python:Depends}, Description: Pure Python implementation of the trie data structure (Python 2) 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. . This is the Python 2 package. Package: python3-trie Architecture: all Suggests: python-trie-doc, Depends: ${misc:Depends}, ${python3:Depends}, Description: Pure Python implementation of the trie data structure (Python 3) 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. . This is the Python 3 package. Package: python-trie-doc Architecture: all Depends: ${misc:Depends}, ${sphinxdoc:Depends}, Section: doc Description: Pure Python implementation of the trie data structure (doc) 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. . This package contains the HTML documentation.