libdatrie 0.2.13-3build1 source package in Ubuntu
Changelog
libdatrie (0.2.13-3build1) noble; urgency=high * No change rebuild for 64-bit time_t and frame pointers. -- Julian Andres Klode <email address hidden> Mon, 08 Apr 2024 18:02:23 +0200
Upload details
- Uploaded by:
- Julian Andres Klode
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Very Urgent
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | main | libs | |
Noble | release | main | libs |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libdatrie_0.2.13.orig.tar.xz | 306.7 KiB | 12231bb2be2581a7f0fb9904092d24b0ed2a271a16835071ed97bed65267f4be |
libdatrie_0.2.13-3build1.debian.tar.xz | 9.5 KiB | 7e321906339b790e881700643bba7e4fa66accf61788d466a94eaba25e30637b |
libdatrie_0.2.13-3build1.dsc | 2.3 KiB | 9d4bef261b1f1a5abd62c99ecdee5cd8b5dc09987b13d1ba1b66a73f1b1f0c6f |
Available diffs
- diff from 0.2.13-3 (in Debian) to 0.2.13-3build1 (524 bytes)
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