Package: python-trie (0.2+ds-1)

[ Source: python-trie  ]

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.

Other Packages Related to python-trie

• dep: python

  interactive high-level object-oriented language (Python2 version)

• sug: python-trie-doc

  Pure Python implementation of the trie data structure (doc)

Download python-trie

Download for all available architectures

Architecture	Package Size	Installed Size	Files
all	6.9 kB	35.0 kB	[list of files]