Ubuntu
libdatrie package

libdatrie 0.2.7.1-1 source package in Ubuntu

Changelog

libdatrie (0.2.7.1-1) unstable; urgency=low


  * Use canonical anonscm URIs in Vcs-* fields.
  * Imported Upstream version 0.2.7
  * Bump doxygen b-dep, as per upstream
  * d/libdatrie1.symbols: Updated according to upstream API change
  * Imported Upstream version 0.2.7.1

 -- Theppitak Karoonboonyanan <email address hidden>  Tue, 22 Oct 2013 08:34:26 +0700

Upload details

Uploaded by:
Theppitak Karoonboonyanan
Uploaded to:
Sid
Original maintainer:
Theppitak Karoonboonyanan
Architectures:
any all
Section:
libs
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.7.1-1.dsc 2.1 KiB f4957876edc4892015ec76f63668b1a5e5bd3a2b1e6209edae13192fcdca2ff7
libdatrie_0.2.7.1.orig.tar.xz 277.7 KiB 7008515767629839593b7511a58e03c55354bd0d791a944288dcc5399e3cdf58
libdatrie_0.2.7.1-1.debian.tar.gz 7.2 KiB c1a61bf1348925e32ee374989267910f8bd54f42354e94f14926234210074c89

Available diffs

No changes file available.

Binary packages built by this source

libdatrie-dev: Development files for double-array trie library

 Trie is a kind of digital search tree, an efficient indexing method with
 O(1) time complexity for searching. 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 http://linux.thai.net/~thep/datrie/datrie.html
 .
 This package contains the development libraries, header files and manpages
 you need to develop your programs using the datrie library.

libdatrie-doc: Documentation files for double-array trie library

 Trie is a kind of digital search tree, an efficient indexing method with
 O(1) time complexity for searching. 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 http://linux.thai.net/~thep/datrie/datrie.html
 .
 This package contains some documents about the datrie library.

libdatrie1: Double-array trie library

 This package provides shared libraries needed to run programs that use the
 datrie library. It is usually automatically installed.

libdatrie1-bin: Programs for double-array trie library

 Trie is a kind of digital search tree, an efficient indexing method with
 O(1) time complexity for searching. 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 http://linux.thai.net/~thep/datrie/datrie.html
 .
 This package contains the program files which is used with the library,
 including trietool, the trie manipulation tool.