summaryrefslogtreecommitdiff
path: root/devel/tre/distinfo
diff options
context:
space:
mode:
authoradrianp <adrianp@pkgsrc.org>2005-11-29 19:12:04 +0000
committeradrianp <adrianp@pkgsrc.org>2005-11-29 19:12:04 +0000
commita06878c9657b6cc8d87531d8241dcde4859d5082 (patch)
tree0ea0e0000faa23e46660cc1519f8c51ebb575348 /devel/tre/distinfo
parentc729a89e5e333cc44d7d181e0f8d62f5837fef8e (diff)
downloadpkgsrc-a06878c9657b6cc8d87531d8241dcde4859d5082.tar.gz
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.
Diffstat (limited to 'devel/tre/distinfo')
-rw-r--r--devel/tre/distinfo5
1 files changed, 5 insertions, 0 deletions
diff --git a/devel/tre/distinfo b/devel/tre/distinfo
new file mode 100644
index 00000000000..435687b2ed7
--- /dev/null
+++ b/devel/tre/distinfo
@@ -0,0 +1,5 @@
+$NetBSD: distinfo,v 1.1.1.1 2005/11/29 19:12:04 adrianp Exp $
+
+SHA1 (tre-0.7.2.tar.gz) = 8211711cf9098ddee0d71da7a4b02036d679ba15
+RMD160 (tre-0.7.2.tar.gz) = 0fb34240e337efaac20bcd7e9cc9a69c0f66636a
+Size (tre-0.7.2.tar.gz) = 427366 bytes