Skip to content
Sections
>> Trisquel >> Packages >> aramo >> doc >> libdatrie-doc
etiona  ] [  nabia  ] [  aramo  ]
[ Source: libdatrie  ]

Package: libdatrie-doc (0.2.13-2)

Documentation files for double-array trie library

Trie is a kind of digital search tree, an efficient indexing method in which search time is independent of database size. It only takes O(m) search time, where m is the length of the search string. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.

This library is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. The details of the implementation can be found at https://linux.thai.net/~thep/datrie/datrie.html

This package contains some documents about the datrie library.

Other Packages Related to libdatrie-doc

  • depends
  • recommends
  • suggests
  • dep: libjs-jquery
    JavaScript library for dynamic web applications

Download libdatrie-doc

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