          MODULE=tre
         VERSION=0.8.0
          SOURCE=$MODULE-$VERSION.tar.bz2
      SOURCE_URL=http://laurikari.net/tre/
      SOURCE_VFY=sha1:a41692e64b40ebae3cffe83931ddbf8420a10ae3
        WEB_SITE=http://laurikari.net/tre/
         ENTERED=20081114
         UPDATED=20101212
           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
