libdatrie-doc binary package in Ubuntu Xenial amd64

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2016-02-02 00:54:20 UTC Published Ubuntu Xenial amd64 release main doc Optional 0.2.10-2
  • Published
  • Copied from ubuntu xenial-proposed amd64 in Primary Archive for Ubuntu
  Deleted Ubuntu Xenial amd64 proposed main doc Optional 0.2.10-2
  • Removal requested .
  • Deleted by Ubuntu Archive Robot

    moved to release

  • Published
  2016-02-02 00:54:52 UTC Superseded Ubuntu Xenial amd64 release main doc Optional 0.2.10-1
  • Removed from disk .
  • Removal requested .
  • Superseded by amd64 build of libdatrie 0.2.10-2 in ubuntu xenial PROPOSED
  • Published
  • Copied from ubuntu xenial-proposed amd64 in Primary Archive for Ubuntu
  2016-02-03 06:10:11 UTC Deleted Ubuntu Xenial amd64 proposed main doc Optional 0.2.10-1
  • Removed from disk .
  • Removal requested .
  • Deleted by Ubuntu Archive Robot

    moved to release

  • Published
  2015-10-24 02:45:40 UTC Superseded Ubuntu Xenial amd64 release main doc Optional 0.2.9-2
  • Removed from disk .
  • Removal requested .
  • Superseded by amd64 build of libdatrie 0.2.10-1 in ubuntu xenial PROPOSED
  • Published
  • Copied from ubuntu wily-proposed amd64 in Primary Archive for Ubuntu