[ 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
- 交互式高级面向对象语言（Python2 版本）
-
- sug: python-trie-doc
- Pure Python implementation of the trie data structure (doc)