* Removed unused tre_filter code.
* Fixed printf format string and argument types for 64 bit builds.
* Fixed params array signedness inconsistencies.
* Fixed not to build agrep if --disable-approx is used.
* Included GNU getopt implementation from gnulib.
* Fixed backtracking matcher to work if malloc(0) returns NULL.
* Removed guessing of best optimizing CFLAGS.
* Fixed agrep exit status when no matches found.
* Fixed regex parser on big-endian 64 bit architectures.
* Added support for the -q command line option.
library with some exciting features such as approximate (fuzzy) matching.
At the core of TRE is a new algorithm for regular expression matching with
submatch addressing. The algorithm 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.
