1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
Source: python-trie
Section: python
Priority: optional
Maintainer: Debian Python Modules Team <python-modules-team@lists.alioth.debian.org>
Uploaders:
Orestis Ioannou <orestis@oioannou.com>,
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.
|
