libdatrie 0.2.13-3 source package in Ubuntu
Changelog
libdatrie (0.2.13-3) unstable; urgency=medium
* Switch from pkg-config to pkgconf
- libdatrie-dev: Dep on pkgconf
- d/tests/control: Dep on pkgconf for build test
* d/copyright: Update packaging years
* Declare compliance with Debian Policy 4.6.2 (no changes)
-- Theppitak Karoonboonyanan <email address hidden> Wed, 03 Jan 2024 12:08:47 +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 | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libdatrie_0.2.13-3.dsc | 2.2 KiB | 6ddcaf319da01cc044f9b335b6b01b608a0380ccdaecb06bda71710b6f4395bb |
| libdatrie_0.2.13.orig.tar.xz | 306.7 KiB | 12231bb2be2581a7f0fb9904092d24b0ed2a271a16835071ed97bed65267f4be |
| libdatrie_0.2.13-3.debian.tar.xz | 9.4 KiB | e656d536beb5db9e52ef92dd1fccd5480ebd21e4eddbfe013c51a1e2ec45cf38 |
Available diffs
- diff from 0.2.13-2 to 0.2.13-3 (1.0 KiB)
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
