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
|
Metadata-Version: 1.1
Name: PyTrie
Version: 0.4.0
Summary: A pure Python implementation of the trie data structure.
Home-page: https://github.com/gsakkis/pytrie/
Author: George Sakkis
Author-email: george.sakkis@gmail.com
License: UNKNOWN
Description: # pytrie
`pytrie` is a a pure Python 3 implementation of the trie data structure.
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.
To install run:
pip install pytrie
Documentation is available at [Read the Docs](https://pytrie.readthedocs.io/).
## Changelog
### 0.4.0
* Drop Python 2 support
### 0.3.1
* Fixed iteritems/itervalues for SortedDicts in Python 2.7.
### 0.3
* Fixed bug for tries with zero-length keys.
* Added `__bool__` (`__nonzero__`) and `__cmp__` methods to `Trie`.
* Added `sortedcontainers` dependency.
* Linting.
* Converted from Mercurial to Git.
### 0.2
* Initial Python 3 support (thanks Dmitrijs Milajevs)
### 0.1
* Initial release
Platform: UNKNOWN
Classifier: Development Status :: 4 - Beta
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: BSD License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3
Classifier: Topic :: Software Development :: Libraries :: Python Modules
|
