Skip to content
Sections
>> Trisquel >> Packages >> nabia >> python >> python3-trie
etiona  ] [  nabia  ] [  aramo  ]
[ Source: python-trie  ]

Package: python3-trie (0.2+ds-2)

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.

Other Packages Related to python3-trie

  • depends
  • recommends
  • suggests
  • dep: python3
    interactive high-level object-oriented language (default python3 version)
  • sug: python-trie-doc
    Pure Python implementation of the trie data structure (doc)

Download python3-trie

Download for all available architectures
Architecture Package Size Installed Size Files
all 7.3 kB35 kB [list of files]