Ubuntu
libdatrie package

libdatrie 0.2.13-1ubuntu3 source package in Ubuntu

Changelog

libdatrie (0.2.13-1ubuntu3) impish; urgency=medium

  * No-change rebuild to build packages with zstd compression.

 -- Matthias Klose <email address hidden>  Thu, 07 Oct 2021 12:14:47 +0200

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Impish
Original maintainer:
Ubuntu Developers
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.13.orig.tar.xz 306.7 KiB 12231bb2be2581a7f0fb9904092d24b0ed2a271a16835071ed97bed65267f4be
libdatrie_0.2.13-1ubuntu3.debian.tar.xz 9.4 KiB 386e08f782382a880c42dd92b2213ceccbbfc536acfbcbf3e0b1539056f9d710
libdatrie_0.2.13-1ubuntu3.dsc 2.3 KiB 9d0a39fe3cd6d0856289f145b168ac5ae85244054b676b6d07da87d98c5d060e

Available diffs

View changes file

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

No description available for libdatrie1 in ubuntu impish.

libdatrie1-bin: No summary available for libdatrie1-bin in ubuntu impish.

No description available for libdatrie1-bin in ubuntu impish.

libdatrie1-bin-dbgsym: No summary available for libdatrie1-bin-dbgsym in ubuntu impish.

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

libdatrie1-dbgsym: debug symbols for libdatrie1