Ubuntu
libdatrie package

libdatrie 0.2.5-3 source package in Ubuntu

Changelog

libdatrie (0.2.5-3) unstable; urgency=low

  * Set Vcs-Git and Vcs-Browser to alioth
  * Point Homepage directly to linux.thai.net page
  * debian/control, debian/copyright: Apply wrap-and-sort
 -- Ubuntu Archive Auto-Sync <email address hidden>   Tue,  03 Jan 2012 02:33:26 +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
Precise release main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.5.orig.tar.gz 372.4 KiB e9f3c82e2f157341e88836dbc048da61c320bcc43c42781d7f7944a18f2415b8
libdatrie_0.2.5-3.debian.tar.gz 6.8 KiB 5c04454b22b08f0adffdf7e02acbab66d7ac050235bf8803a865d8fd86e57356
libdatrie_0.2.5-3.dsc 2.0 KiB d38666c275d8690cbcfcef90d50860d220670dad28c5f453283befc273963d38

Available diffs

View changes file

Binary packages built by this source

libdatrie-dev: No summary available for libdatrie-dev in ubuntu quantal.

No description available for libdatrie-dev in ubuntu quantal.

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

No description available for libdatrie1 in ubuntu quantal.

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.