Ubuntu
libdatrie package

libdatrie 0.2.10-6 source package in Ubuntu

Changelog

libdatrie (0.2.10-6) unstable; urgency=medium

  * Add autopkgtest test suite
    - d/control: Add Testsuite: entry
    - +d/tests/control, +d/tests/build: Add test building against libdatrie
  * Add test for trietool utility
    - d/tests/control, +d/tests/tool: Add test suite for trietool
  * d/control: Drop unneeded Testsuite field [lintian]
    - Remove Testsite field
    - Bump dpkg-dev versioned dep to 1.17.1~, as suggested by lintian
  * d/watch: Use HTTPS on watch URL [lintian]
  * d/copyright: Use HTTPS in Source field
  * d/rules: Use all hardening flags [lintian]
  * Bump Standards-Version to 4.1.2 (no changes)

 -- Theppitak Karoonboonyanan <email address hidden>  Tue, 26 Dec 2017 11:47:22 +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-6.dsc 2.2 KiB a7aa81f1f45520f3c009502381553799a7adaa4e528023fd35ffcc38ff54babb
libdatrie_0.2.10.orig.tar.xz 287.5 KiB 180eff7b0309ca19a02d5864e744185d715f021398a096fec6cf960f8ebfaa2b
libdatrie_0.2.10-6.debian.tar.xz 8.3 KiB fc8080def08c6314bc70a014ec527e660ed4c13a140da58e1f493a183a03ea78

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