[ 原始碼： python-trie ]
套件：python-trie-doc（0.2+ds-1）
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.
其他與 python-trie-doc 有關的套件
|
|
|
|
-
- dep: libjs-sphinxdoc (>= 1.0)
- JavaScript support for Sphinx documentation