./devel/tre, Lightweight and robust POSIX compliant regexp matching library

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2009Q1, Version: 0.7.5nb4, Package name: tre-0.7.5nb4, Maintainer: adrianp

TRE is a lightweight, robust, and efficient POSIX compliant regexp matching
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.


Required to build:
[devel/libtool-base]

Master sites:

SHA1: eafb065d70462d112b6df7767da81ecab8cf609c
RMD160: ddb1960a0be3803e8b55c100150d967993b9af8c
Filesize: 485.396 KB

Version history: (Expand)