libdatrie 0.2.13-1ubuntu2 source package in Ubuntu
Changelog
libdatrie (0.2.13-1ubuntu2) hirsute; urgency=medium * No-change rebuild to drop the udeb package. -- Matthias Klose <email address hidden> Mon, 22 Feb 2021 10:34:25 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Hirsute
- Original maintainer:
- Ubuntu Developers
- 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.orig.tar.xz | 306.7 KiB | 12231bb2be2581a7f0fb9904092d24b0ed2a271a16835071ed97bed65267f4be |
libdatrie_0.2.13-1ubuntu2.debian.tar.xz | 9.4 KiB | 8900b1c60bd277deae17071f18db3c0dc791a80b7b26617c147fead97c29d19d |
libdatrie_0.2.13-1ubuntu2.dsc | 2.3 KiB | 0ba99a96cfb71c061945d2fdbcff40ac6cdaa5206548c05cfc3abc73462a89fe |
Available diffs
- diff from 0.2.13-1ubuntu1 to 0.2.13-1ubuntu2 (321 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: No summary available for libdatrie-doc in ubuntu hirsute.
No description available for libdatrie-doc in ubuntu hirsute.
- 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: No summary available for libdatrie1-bin-dbgsym in ubuntu hirsute.
No description available for libdatrie1-
bin-dbgsym in ubuntu hirsute.
- libdatrie1-dbgsym: No summary available for libdatrie1-dbgsym in ubuntu impish.
No description available for libdatrie1-dbgsym in ubuntu impish.