libdatrie-dev binary package in Ubuntu Precise powerpc

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2012-01-03 04:04:17 UTC Published Ubuntu Precise powerpc release main libdevel Optional 0.2.5-3
  • Published
  2012-01-03 04:05:53 UTC Superseded Ubuntu Precise powerpc release main libdevel Optional 0.2.5-2
  • Removed from disk .
  • Removal requested .
  • Superseded by powerpc build of libdatrie 0.2.5-3 in ubuntu precise RELEASE
  • Published
  2011-11-28 14:05:23 UTC Superseded Ubuntu Precise powerpc release main libdevel Optional 0.2.5-1
  • Removed from disk .
  • Removal requested .
  • Superseded by powerpc build of libdatrie 0.2.5-2 in ubuntu precise RELEASE
  • Published
  2011-11-18 14:08:56 UTC Superseded Ubuntu Precise powerpc release main libdevel Optional 0.2.4-3
  • Removed from disk .
  • Removal requested .
  • Superseded by powerpc build of libdatrie 0.2.5-1 in ubuntu precise RELEASE
  • Published
  • Copied from ubuntu oneiric-release powerpc in Primary Archive for Ubuntu