Ubuntu
libdatrie package

libdatrie 0.2.5-2 source package in Ubuntu

Changelog

libdatrie (0.2.5-2) unstable; urgency=low

  * debian/copyright:
    - Use non-forwarding format URL. Bump to revision 202.
    - Upstream license is actually LGPL-2.1, not 2.0.
    - Add extended text for LGPL-2.1 and GPL-2.
  * debian/rules:
    - Add back upstream 'make distclean' that was lost in 0.2.4-3, so it
      builds twice in a row again.
 -- Ubuntu Archive Auto-Sync <email address hidden>   Mon,  28 Nov 2011 13:42:04 +0000

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync
Uploaded to:
Precise
Original maintainer:
Theppitak Karoonboonyanan
Architectures:
any all
Section:
libs
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.5.orig.tar.gz 372.4 KiB e9f3c82e2f157341e88836dbc048da61c320bcc43c42781d7f7944a18f2415b8
libdatrie_0.2.5-2.debian.tar.gz 6.9 KiB 4647e0d46555a8c259eab46766c4646d6f523f0616cb9f6f8da20bfd211baa98
libdatrie_0.2.5-2.dsc 2.0 KiB 9b9d9d7a1708ed1389652fd27bd2ae09173a80980ecc7fb9cbec89e30bacf429

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 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: 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 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.