4a6d5ed2f5
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. WWW: https://bitbucket.org/gsakkis/pytrie
2 lines
127 B
Text
2 lines
127 B
Text
SHA256 (PyTrie-0.2.tar.gz) = b272021351efadc6757591aac03ed4794bdfd091122204a4673e94bfb66cc500
|
|
SIZE (PyTrie-0.2.tar.gz) = 96378
|