Ubuntu
libdatrie package

libdatrie 0.2.10-7 source package in Ubuntu

Changelog

libdatrie (0.2.10-7) unstable; urgency=medium

  * Update Vcs fields for migration to salsa.debian.org
  * Bump debhelper compat to level 11
    - d/compat: 10 -> 11
    - d/control: Bump debhelper version to >= 11
    - d/rules, d/libdatrie-doc.docs, -d/libdatrie-doc.install:
      Use dh 11 dh_installdocs to install generated doc directly
      instead of using upstream install, as 'nodoc' DEB_BUILD_OPTIONS
      is now supported with more concise commands.
    - d/libdatrie-doc.docs:
      Don't install NEWS et. al., to avoid conflicts with libdatrie1
  * Bump Standards-Version to 4.1.3 (no changes)
  * d/copyright: Update year on packaging
  * d/control: Update reference URLs in description to HTTPS

 -- Theppitak Karoonboonyanan <email address hidden>  Wed, 14 Feb 2018 14:56:49 +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
Bionic release main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.10-7.dsc 2.2 KiB 63ad3d2782cfcca0d34055a152908ad65c6b2fc84d3079b79cf90ac4924a77fb
libdatrie_0.2.10.orig.tar.xz 287.5 KiB 180eff7b0309ca19a02d5864e744185d715f021398a096fec6cf960f8ebfaa2b
libdatrie_0.2.10-7.debian.tar.xz 8.4 KiB 0c1496995d89daacad655618e6fff5402cb6935bb5b386c54bf4dcd1cf1b8f85

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: No summary available for libdatrie-doc in ubuntu cosmic.

No description available for libdatrie-doc in ubuntu cosmic.

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

No description available for libdatrie1-bin-dbgsym in ubuntu cosmic.

libdatrie1-dbgsym: debug symbols for libdatrie1
libdatrie1-udeb: No summary available for libdatrie1-udeb in ubuntu cosmic.

No description available for libdatrie1-udeb in ubuntu cosmic.