Paketti: python3-trie (0.4.0+ds-1)

[ Source: 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.

Muut pakettiin python3-trie liittyvät paketit

• dep: python3

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

• dep: python3-sortedcontainers

  sorted container types: SortedList, SortedDict, and SortedSet (Python 3)

• sug: python-trie-doc

  Pure Python implementation of the trie data structure (doc)

Imuroi python3-trie

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Paketin koko	Koko asennettuna	Tiedostot
all	7.5 kt	33.0 kt	[tiedostoluettelo]