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
|
Source: python-trie
Section: python
Priority: optional
Maintainer: Debian Python Team <team+python@tracker.debian.org>
Uploaders: Orestis Ioannou <orestis@oioannou.com>,
Build-Depends: debhelper-compat (= 13),
dh-python,
python3-all,
python3-setuptools,
python3-sortedcontainers,
python3-sphinx,
Standards-Version: 4.6.0
Rules-Requires-Root: no
Homepage: https://github.com/gsakkis/pytrie
Vcs-Git: https://salsa.debian.org/python-team/packages/python-trie.git
Vcs-Browser: https://salsa.debian.org/python-team/packages/python-trie
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
Multi-Arch: foreign
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.
|
