[ buster ]
[ 原始碼： python-trie ]
套件：python-trie（0.2+ds-1）
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.
其他與 python-trie 有關的套件
|
|
|
|
-
- dep: python
- interactive high-level object-oriented language (Python2 version)
-
- sug: python-trie-doc
- Pure Python implementation of the trie data structure (doc)