Ubuntu
libdatrie package

libdatrie 0.2.9-2 source package in Ubuntu

Changelog

libdatrie (0.2.9-2) unstable; urgency=medium

  * Add maintscript to handle symlink-to-dir in -dev package.
    - d/libdatrie-dev.maintscript: Add maintscript.
    - d/control: Add Pre-Depends for the maintscript helper.
    (Closes: #788163)

 -- Theppitak Karoonboonyanan <email address hidden>  Tue, 09 Jun 2015 11:43:39 +0700

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.9-2.dsc 2.1 KiB 4adc17f4a976a71b281284d4a48b1f5ae84637ec5994b624e4594a0ac22db770
libdatrie_0.2.9.orig.tar.xz 284.1 KiB d980713e7ad8e19cf3b54ee0173782b94332af8e7e4e936dde01d2cd72e1da1d
libdatrie_0.2.9-2.debian.tar.xz 7.1 KiB b91f2008ec41051868cc378be36b6612c109f8785b994d8d64962c5498b00737

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: No summary available for libdatrie1 in ubuntu wily.

No description available for libdatrie1 in ubuntu wily.

libdatrie1-bin: No summary available for libdatrie1-bin in ubuntu wily.

No description available for libdatrie1-bin in ubuntu wily.

libdatrie1-bin-dbgsym: debug symbols for package libdatrie1-bin

 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.

libdatrie1-dbgsym: No summary available for libdatrie1-dbgsym in ubuntu wily.

No description available for libdatrie1-dbgsym in ubuntu wily.