|File Search||Catalog||Content Search|
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.
datrie - Double-Array Trie Library ================================== This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe . 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 ma more»
libdatrie 0.2.5 (2011-11-04) ===== - Fix missing 'extern "C"' in header file. [Patch from Aurimas Černius] - Minor documentation fix. 0.2.4 (2010-06-30) ===== - Close file on saving trie. [Bug report from Xu Jiandong] - Add trie_store_if_absent() API which fails on adding duplicated key. This is useful for preventing race condition in multi-thread applications. [Suggestion from Dan Searle] more»
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 -- Theppitak Karoonboonyanan <email@example.com> Thu, 22 Dec 2011 13:03:09 +0700 libdatrie (0.2.5-2) unstable; urgency=low * debian/copyright: - Use non-forwarding format URL. Bump to revision 202. more»
2011-11-04 Theppitak Karoonboonyanan <firstname.lastname@example.org> * NEWS, configure.ac: === Version 0. more»
Format: http://anonscm.debian.org/viewvc/dep/web/deps/dep5.mdwn?view=co&revision=202 Upstream-Name: more»