Ubuntu
libdatrie package

libdatrie 0.2.10-5 source package in Ubuntu

Changelog

libdatrie (0.2.10-5) unstable; urgency=medium

  * Bump debhelper compat to level 10
  * d/rules: Replace $(MAKE) with dh_auto_* to gain dh 10 parallelism,
    except dh_auto_install, as it can't reach install-am target
  * Do not generate/install doc on nodoc DEB_BUILD_OPTIONS
    (Policy 4.0.0 Section 4.9.1)
  * Bump Standards-Version to 4.0.0, all changes done.
  * Update debian/copyright
    - Use HTTPS in Format URL
    - Update upstream author's e-mail address
    - Update copyright years
  * d/control: Use HTTPS in upstream Homepage
  * Drop unnecessary dh-autoreconf B-Dep [lintian]
    debhelper 10 already pulls it in.

 -- Theppitak Karoonboonyanan <email address hidden>  Thu, 27 Jul 2017 18:22:29 +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.10-5.dsc 2.2 KiB b81e48b6393d1d7a69d149cfa152990c840d62241c76ed9ca5cb07c588f714eb
libdatrie_0.2.10.orig.tar.xz 287.5 KiB 180eff7b0309ca19a02d5864e744185d715f021398a096fec6cf960f8ebfaa2b
libdatrie_0.2.10-5.debian.tar.xz 7.4 KiB 24031d8a2c1003ba1895cc1179c4d30563d90555a39a3a4cdb4b1290d4a1a4bf

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 https://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 https://linux.thai.net/~thep/datrie/datrie.html
 .
 This package contains some documents about the datrie library.

libdatrie1: No summary available for libdatrie1 in ubuntu artful.

No description available for libdatrie1 in ubuntu artful.

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 https://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 libdatrie1-bin
libdatrie1-dbgsym: debug symbols for libdatrie1
libdatrie1-udeb: Double-array trie library for D-I use

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