Paket: python3-trie (0.2+ds-1)

[ Källkod: python-trie  ]

Pure Python implementation of the trie data structure (Python 3)

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 3 package.

Andra paket besläktade med python3-trie

• dep: python3

  interactive high-level object-oriented language (default python3 version)

• sug: python-trie-doc

  Pure Python implementation of the trie data structure (doc)

Hämta python3-trie

Hämtningar för alla tillgängliga arkitekturer

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