Ubuntu
libdatrie package

libdatrie 0.2.6-2 source package in Ubuntu

Changelog

libdatrie (0.2.6-2) unstable; urgency=low


  * debian/watch: Watch upstream .tar.xz instead of .tar.gz.
  * Upload to unstable.

 -- Theppitak Karoonboonyanan <email address hidden>  Thu, 09 May 2013 09:41:45 +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.6-2.dsc 2.0 KiB 55425704274e87ab08b091ebf51da997ce44d77e714cc5a097834746aa518db9
libdatrie_0.2.6.orig.tar.xz 263.0 KiB 8cbefcad704a293d950aeb2fa87b67ee82d2d53f9c57cd1eb0bb9ab8cf3e99ab
libdatrie_0.2.6-2.debian.tar.gz 7.1 KiB 734b5149f912d5ca842680a8411cde2cdc9d62860d714810301c8bd70ffc0920

Available diffs

No changes file available.

Binary packages built by this source

libdatrie-dev: No summary available for libdatrie-dev in ubuntu saucy.

No description available for libdatrie-dev in ubuntu saucy.

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.