pkgsrc/devel/tre/distinfo

$NetBSD: distinfo,v 1.4 2012/04/25 15:22:47 drochner Exp $

SHA1 (tre-0.8.0.tar.gz) = 8818058785923c32f5e1f48feeb2851507c0e61c
RMD160 (tre-0.8.0.tar.gz) = 8af2cbecdd51dfed30cbf567652b459712e2542a
Size (tre-0.8.0.tar.gz) = 481286 bytes
update to 0.8.0 changes: -Added tre_ prefix to all functions exported from libtre. This changes the ABI -Bug fixes 2012-04-25 17:22:47 +02:00			$NetBSD: distinfo,v 1.4 2012/04/25 15:22:47 drochner Exp $
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. 2005-11-29 20:12:04 +01:00
update to 0.8.0 changes: -Added tre_ prefix to all functions exported from libtre. This changes the ABI -Bug fixes 2012-04-25 17:22:47 +02:00			`SHA1 (tre-0.8.0.tar.gz) = 8818058785923c32f5e1f48feeb2851507c0e61c`
			`RMD160 (tre-0.8.0.tar.gz) = 8af2cbecdd51dfed30cbf567652b459712e2542a`
			`Size (tre-0.8.0.tar.gz) = 481286 bytes`