libdatrie 0.2.12-1 source package in Ubuntu

Changelog

libdatrie (0.2.12-1) unstable; urgency=medium

  * Add Depends: pkg-config to libdatrie-dev
  * Update package description as per upstream
  * New upstream version 0.2.12

 -- Theppitak Karoonboonyanan <email address hidden>  Tue, 19 Jun 2018 14:11:14 +0700

Upload details

Uploaded by:
Theppitak Karoonboonyanan on 2018-06-19
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
Cosmic release on 2018-06-19 main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.12-1.dsc 2.2 KiB e6468419bfe179dd8b810d60c71700b14e72dc30bedde0a69e86c10792bfa842
libdatrie_0.2.12.orig.tar.xz 303.0 KiB 452dcc4d3a96c01f80f7c291b42be11863cd1554ff78b93e110becce6e00b149
libdatrie_0.2.12-1.debian.tar.xz 8.6 KiB 6554937768ce2f851733791a9d1b8b82463b0e5c070055fcebe5312b9b3fa3b9

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 in which
 search time is independent of database size. It only takes O(m) search time,
 where m is the length of the search string. 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 in which
 search time is independent of database size. It only takes O(m) search time,
 where m is the length of the search string. 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 in which
 search time is independent of database size. It only takes O(m) search time,
 where m is the length of the search string. 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.