[Lunar-commits] <moonbase> libdatrie: move from zbeta to libs
Paul Bredbury
brebs at lunar-linux.org
Sat Feb 19 13:28:55 CET 2011
commit 8c80ea890a1922473ad1e61cc03775c37710c0f4
Author: Paul Bredbury <brebs at lunar-linux.org>
Date: Sat Feb 19 19:28:55 2011 +0700
libdatrie: move from zbeta to libs
---
libs/libdatrie/DEPENDS | 1 +
libs/libdatrie/DETAILS | 20 ++++++++++++++++++++
zbeta/libdatrie/DEPENDS | 1 -
zbeta/libdatrie/DETAILS | 20 --------------------
4 files changed, 21 insertions(+), 21 deletions(-)
diff --git a/libs/libdatrie/DEPENDS b/libs/libdatrie/DEPENDS
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/libs/libdatrie/DEPENDS
@@ -0,0 +1 @@
+
diff --git a/libs/libdatrie/DETAILS b/libs/libdatrie/DETAILS
new file mode 100644
index 0000000..1db782a
--- /dev/null
+++ b/libs/libdatrie/DETAILS
@@ -0,0 +1,20 @@
+ MODULE=libdatrie
+ VERSION=0.2.4
+ SOURCE=$MODULE-$VERSION.tar.gz
+ SOURCE_URL=http://linux.thai.net/pub/thailinux/software/libthai
+ SOURCE_VFY=sha1:723fb01530c7917982cfdd68deb2361d16a6e6ab
+ WEB_SITE=http://linux.thai.net/~thep/datrie/datrie.html
+ ENTERED=20100731
+ UPDATED=20100731
+ SHORT="Double-array trie library"
+
+cat << EOF
+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.
+EOF
diff --git a/zbeta/libdatrie/DEPENDS b/zbeta/libdatrie/DEPENDS
deleted file mode 100644
index 8b13789..0000000
--- a/zbeta/libdatrie/DEPENDS
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/zbeta/libdatrie/DETAILS b/zbeta/libdatrie/DETAILS
deleted file mode 100644
index 1db782a..0000000
--- a/zbeta/libdatrie/DETAILS
+++ /dev/null
@@ -1,20 +0,0 @@
- MODULE=libdatrie
- VERSION=0.2.4
- SOURCE=$MODULE-$VERSION.tar.gz
- SOURCE_URL=http://linux.thai.net/pub/thailinux/software/libthai
- SOURCE_VFY=sha1:723fb01530c7917982cfdd68deb2361d16a6e6ab
- WEB_SITE=http://linux.thai.net/~thep/datrie/datrie.html
- ENTERED=20100731
- UPDATED=20100731
- SHORT="Double-array trie library"
-
-cat << EOF
-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.
-EOF
More information about the Lunar-commits
mailing list