aboutsummaryrefslogtreecommitdiff
path: root/devel/libdatrie/pkg-descr
diff options
context:
space:
mode:
Diffstat (limited to 'devel/libdatrie/pkg-descr')
-rw-r--r--devel/libdatrie/pkg-descr10
1 files changed, 10 insertions, 0 deletions
diff --git a/devel/libdatrie/pkg-descr b/devel/libdatrie/pkg-descr
new file mode 100644
index 000000000000..a7747d9a0a98
--- /dev/null
+++ b/devel/libdatrie/pkg-descr
@@ -0,0 +1,10 @@
+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
+manipulation. This makes it ideal for lexical analyzers, as well as
+spelling dictionaries.
+
+WWW: http://linux.thai.net/projects/datrie/