python3-trie - 0.2+ds-2 main

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.

Priority: optional
Section: python
Suites: amber byzantium crimson dawn landing 
Maintainer: Debian Python Modules Team <python-modules-team [꩜] lists.alioth.debian.org>
 
Homepage Source Package
 

Dependencies

Installed Size: 35.8 kB
Architectures: all 

 

Versions

0.2+ds-2 all