add libtre 0.3.2

A lightweight fully POSIX compliant regexp matching library

6 files changed, 48 insertions, 0 deletions

diff --git a/textproc/Makefile b/textproc/Makefile
index b27200163bdb..5e7e14ce72bc 100644
--- a/textproc/Makefile
+++ b/textproc/Makefile
@@ -112,6 +112,7 @@
     SUBDIR += lacheck
     SUBDIR += latex2html
     SUBDIR += latte
+    SUBDIR += libtre
     SUBDIR += libxml
     SUBDIR += libxml++
     SUBDIR += libxml2
diff --git a/textproc/libtre/Makefile b/textproc/libtre/Makefile
new file mode 100644
index 000000000000..c41e6eba153e
--- /dev/null
+++ b/textproc/libtre/Makefile
@@ -0,0 +1,26 @@
+# ex:ts=8
+# Ports collection makefile for:	libtre
+# Date created:			Oct 14, 2002
+# Whom:				ijliao
+#
+# $FreeBSD$
+#
+
+PORTNAME=	libtre
+PORTVERSION=	0.3.2
+CATEGORIES=	textproc
+MASTER_SITES=	http://kouli.iki.fi/~vlaurika/libtre/
+
+MAINTAINER=	ports@FreeBSD.org
+
+USE_BZIP2=	yes
+USE_LIBTOOL=	yes
+INSTALLS_SHLIB=	yes
+
+.include <bsd.port.pre.mk>
+
+.if ${OSVERSION} < 500028
+IGNORE=		"need wchar support"
+.endif
+
+.include <bsd.port.post.mk>
diff --git a/textproc/libtre/distinfo b/textproc/libtre/distinfo
new file mode 100644
index 000000000000..4a3938f02646
--- /dev/null
+++ b/textproc/libtre/distinfo
@@ -0,0 +1 @@
+MD5 (libtre-0.3.2.tar.bz2) = baf104b2bcda81bc7fbf3950a5b6f2e4
diff --git a/textproc/libtre/pkg-comment b/textproc/libtre/pkg-comment
new file mode 100644
index 000000000000..0c9f87bcd0e9
--- /dev/null
+++ b/textproc/libtre/pkg-comment
@@ -0,0 +1 @@
+A lightweight fully POSIX compliant regexp matching library
diff --git a/textproc/libtre/pkg-descr b/textproc/libtre/pkg-descr
new file mode 100644
index 000000000000..fbd31c2cd868
--- /dev/null
+++ b/textproc/libtre/pkg-descr
@@ -0,0 +1,14 @@
+Libtre is an attempt to create a lightweight, robust, and efficient fully
+POSIX compliant regexp matching library. There is still some work left, but
+the results so far are promising.
+
+At the core of Libtre 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.
+
+WWW: http://kouli.iki.fi/~vlaurika/libtre/
diff --git a/textproc/libtre/pkg-plist b/textproc/libtre/pkg-plist
new file mode 100644
index 000000000000..3ae73f02bdac
--- /dev/null
+++ b/textproc/libtre/pkg-plist
@@ -0,0 +1,5 @@
+include/regex.h
+lib/libtre.a
+lib/libtre.la
+lib/libtre.so
+lib/libtre.so.0