libthai Library
Submitted by thep on
This version breaks 0.1.x interoperability in many ways, to allow more use cases, and to provide more storage capacity.
Please read README.migration in the source tree for the details.
Submitted by thep on
This is a development version toward 0.2.0. Do not use it for production. Testing and bug reports are welcome.
MD5 sums:
Submitted by thep on
This is a development version toward 0.2.0. Do not use it for production. Testing and bug reports are welcome.
Submitted by thep on
ftp://linux.thai.net/pub/thailinux/software/libthai/scim-thai-0.1.1.tar.gz
caa84f54fedf4fe1bcf50dfe69ec112d scim-thai-0.1.1.tar.gz
$ cvs -d :pserver:anonymous@linux.thai.net:/home/cvs \ co -r r_0_1_1 software/scim-thai
Submitted by thep on
MD5 sums:
Submitted by thep on
ftp://linux.thai.net/pub/thailinux/software/libthai/libthai-0.1.9.tar.gz
MD5 Sums:
7002d111b293f202d20b28aa2b4ed68f libthai-0.1.9.tar.gz
$ cvs -d :pserver:anonymous@linux.thai.net:/home/cvs \ co -r r_0_1_9 software/libthai
Submitted by thep on
MD5 sums:
3eaedd5452149e11547a0dc74ee3fcfd libdatrie-0.1.2.tar.gz
$ cvs -d :pserver:anonymous@linux.thai.net:/home/cvs \ co -r r_0_1_2 software/datrie
Submitted by thep on
Submitted by thep on
This is a bug-fix release of datrie.
datrie 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 manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
See the details of the implementation at: http://linux.thai.net/~thep/datrie/datrie.html
Submitted by thep on
This is the first release of datrie.
datrie 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 manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
See the details of the implementation at: http://linux.thai.net/~thep/datrie/datrie.html
