[Lunar-commits] <moonbase> tre: Initial import.

[Dennis 'stumbles' Veatch]

commit c6d4e443ae04f1fa8e9ab50dacfb54258487dc53
Author: Dennis 'stumbles' Veatch <stumbles at lunar-linux.org>
Date:   Fri Nov 14 16:01:38 2008 -0500

    tre: Initial import.
---
 utils/tre/DETAILS |   22 ++++++++++++++++++++++
 1 files changed, 22 insertions(+), 0 deletions(-)

diff --git a/utils/tre/DETAILS b/utils/tre/DETAILS
new file mode 100644
index 0000000..5f01ba3
--- /dev/null
+++ b/utils/tre/DETAILS
@@ -0,0 +1,22 @@
+          MODULE=tre
+         VERSION=0.7.5
+          SOURCE=$MODULE-$VERSION.tar.bz2
+      SOURCE_URL=http://laurikari.net/$MODULE/
+      SOURCE_VFY=sha1:16b860479341f3179ef987765aacda9e2803f7bb
+        WEB_SITE=http://laurikari.net/tre/index.html
+         ENTERED=20081114
+         UPDATED=20081114
+           SHORT="POSIX compliant regexp matching library"
+
+cat << EOF
+TRE is a lightweight, robust, and efficient POSIX compliant regexp matching
+library with some exciting features such as approximate (fuzzy) matching.
+
+The matching algorithm used in TRE uses linear worst-case time in the length of
+the text being searched, and quadratic worst-case time in the length of the
+used regular expression. In other words, the time complexity of the algorithm
+is O(M2N), where M is the length of the regular expression and N is the length
+of the text. The used space is also quadratic on the length of the regex, but
+does not depend on the searched string. This quadratic behaviour occurs only on
+pathological cases which are probably very rare in practice.
+EOF