libdatrie 0.2.8-1 source package in Ubuntu
Changelog
libdatrie (0.2.8-1) unstable; urgency=medium * Imported Upstream version 0.2.8 * Run test suites after build * Declare libdatrie-dev M-A: same * Update copyright years * Bump Standards-Version to 3.9.5 (no changes) -- Theppitak Karoonboonyanan <email address hidden> Fri, 10 Jan 2014 13:36:33 +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 | |
---|---|---|---|---|
Trusty | release | main | libs |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libdatrie_0.2.8-1.dsc | 2.0 KiB | 4cea8f61d67778ae16fa24eb28c413b5c3cc3203f84a50ba0944956a9bba05a2 |
libdatrie_0.2.8.orig.tar.xz | 279.7 KiB | 6a14d55c5687fc325216fffb5db0cf55d31b108cce65314a6d5c8042417ab7c2 |
libdatrie_0.2.8-1.debian.tar.gz | 7.5 KiB | 7563b262c917cb507d17b35437a484c54c2964cff9994ffbbac1f78fb5f3c59b |
Available diffs
- diff from 0.2.7.1-1 to 0.2.8-1 (12.5 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 with
O(1) time complexity for searching. 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 http://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 with
O(1) time complexity for searching. 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 http://linux.thai. net/~thep/ datrie/ datrie. html
.
This package contains some documents about the datrie library.
- libdatrie1: No summary available for libdatrie1 in ubuntu utopic.
No description available for libdatrie1 in ubuntu utopic.
- libdatrie1-bin: Programs for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. 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 http://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.