Paket: python-trie-doc (0.2+ds-2)

[ Källkod: python-trie  ]

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.

Andra paket besläktade med python-trie-doc

• dep: libjs-sphinxdoc (>= 1.0)

  JavaScript support for Sphinx documentation

Hämta python-trie-doc

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
all	21,7 kbyte	124,0 kbyte	[filförteckning]