Skip to content
Sections
>> Trisquel >> Paket >> etiona >> python >> python-trie
etiona  ]
[ Källkod: python-trie  ]

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

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.

Andra paket besläktade med python-trie

  • beror
  • rekommenderar
  • föreslår
  • dep: python
    interactive high-level object-oriented language (default version)
  • sug: python-trie-doc
    Pure Python implementation of the trie data structure (doc)

Hämta python-trie

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
all 6,9 kbyte35 kbyte [filförteckning]