libdatrie 0.2.10-2 source package in Ubuntu

Changelog

libdatrie (0.2.10-2) unstable; urgency=medium

  * Use system jquery.js for doc package [lintian].
    - d/control: Add dependency on libjs-jquery.
    - d/rules: Exclude jquery.js on dh_install.
    - d/libdatrie-doc.links: Add symlinks for jquery.js to system file.
    - d/control: Demote web browser from Depends to Suggests;
      Use iceweasel instead of lynx.
  * Convert rules to dh.
    - d/rules: Rewrite rules using dh with appropriate overrides.
    - d/compat: Bump to level 9, to get multiarch support from dh.
    - d/control: B-Dep on debhelper >= 9.
  * Use HTTPS in Vcs-* fields [lintian].

 -- Theppitak Karoonboonyanan <email address hidden>  Mon, 01 Feb 2016 22:08:41 +0700

Upload details

Uploaded by:
Theppitak Karoonboonyanan on 2016-02-01
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
Xenial release on 2016-02-02 main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.10-2.dsc 2.2 KiB 28028afb148bbe42e31a32c9c28ebc19bd0448694fe136e9180bd162345f95c2
libdatrie_0.2.10.orig.tar.xz 287.5 KiB 180eff7b0309ca19a02d5864e744185d715f021398a096fec6cf960f8ebfaa2b
libdatrie_0.2.10-2.debian.tar.xz 7.0 KiB 9f4b854767fa683853c74f5fb7b477694b9d7b3279315dd56fd6c51aa9a43ff0

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 zesty.

No description available for libdatrie1 in ubuntu zesty.

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.

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 zesty.

No description available for libdatrie1-dbgsym in ubuntu zesty.

libdatrie1-udeb: No summary available for libdatrie1-udeb in ubuntu zesty.

No description available for libdatrie1-udeb in ubuntu zesty.

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

 This package provides double-array trie shared library needed to run
 libthai for the debian-installer GTK+ frontend.