mirror of
https://git.FreeBSD.org/ports.git
synced 2024-12-19 03:52:17 +00:00
Add a port for 'tre', an LGPL'ed regex library. From the port's
description: TRE is a lightweight, robust, and efficient POSIX compliant regexp matching library supporting: - approximate (fuzzy) matching, - strict standards conformance, - predicable and modest memory consumption, - wide-character and multibyte character support, - binary pattern and data support, - thread-safe implementation. 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.
This commit is contained in:
parent
16304de1c5
commit
9d5eee1322
Notes:
svn2git
2021-03-31 03:12:20 +00:00
svn path=/head/; revision=169462
@ -1881,6 +1881,7 @@
|
||||
SUBDIR += towitoko
|
||||
SUBDIR += tpasm
|
||||
SUBDIR += tpg
|
||||
SUBDIR += tre
|
||||
SUBDIR += trio
|
||||
SUBDIR += tvision
|
||||
SUBDIR += uclmmbase
|
||||
|
35
devel/tre/Makefile
Normal file
35
devel/tre/Makefile
Normal file
@ -0,0 +1,35 @@
|
||||
# New ports collection makefile for: tre
|
||||
# Date created: 2006-07-31
|
||||
# Whom: Joseph Koshy <jkoshy@FreeBSD.org>
|
||||
#
|
||||
# $FreeBSD$
|
||||
#
|
||||
|
||||
PORTNAME= tre
|
||||
PORTVERSION= 0.7.4
|
||||
CATEGORIES= devel
|
||||
MASTER_SITES= http://laurikari.net/tre/
|
||||
|
||||
MAINTAINER= jkoshy@FreeBSD.org
|
||||
COMMENT= A lightweight, robust, efficient regexp matching library
|
||||
|
||||
USE_LDCONFIG= yes
|
||||
USE_BZIP2= yes
|
||||
GNU_CONFIGURE= yes
|
||||
CONFIGURE_ARGS+= --program-prefix="" --enable-system-abi
|
||||
USE_AUTOTOOLS= libtool:15
|
||||
|
||||
OPTIONS= AGREP "Build agrep(1)" on
|
||||
|
||||
.include <bsd.port.pre.mk>
|
||||
|
||||
.if defined(WITH_AGREP)
|
||||
MAN1= agrep.1
|
||||
PLIST_SUB+= AGREP=""
|
||||
CONFLICTS= glimpse-4.*
|
||||
.else
|
||||
PLIST_SUB+= AGREP="@comment "
|
||||
CONFIGURE_ARGS+= --disable-agrep
|
||||
.endif
|
||||
|
||||
.include <bsd.port.post.mk>
|
3
devel/tre/distinfo
Normal file
3
devel/tre/distinfo
Normal file
@ -0,0 +1,3 @@
|
||||
MD5 (tre-0.7.4.tar.bz2) = 8b4bfb078f2cc9e01f37d3d251672f75
|
||||
SHA256 (tre-0.7.4.tar.bz2) = 0d55b4bc0a9594c433f2657de9bf4610a1553776f42d317a065929d1c4e91f66
|
||||
SIZE (tre-0.7.4.tar.bz2) = 387358
|
11
devel/tre/files/patch-Makefile.in
Normal file
11
devel/tre/files/patch-Makefile.in
Normal file
@ -0,0 +1,11 @@
|
||||
--- Makefile.in.orig Sun May 21 19:51:30 2006
|
||||
+++ Makefile.in Wed Aug 2 16:14:50 2006
|
||||
@@ -236,7 +236,7 @@
|
||||
|
||||
ACLOCAL_AMFLAGS = -I m4 -I gnulib/m4
|
||||
AC_CONFIG_AUX_DIR = utils
|
||||
-pkgconfigdir = $(libdir)/pkgconfig
|
||||
+pkgconfigdir = $(PREFIX)/libdata/pkgconfig
|
||||
pkgconfig_DATA = tre.pc
|
||||
all: config.h
|
||||
$(MAKE) $(AM_MAKEFLAGS) all-recursive
|
11
devel/tre/files/patch-tests_Makefile.in
Normal file
11
devel/tre/files/patch-tests_Makefile.in
Normal file
@ -0,0 +1,11 @@
|
||||
--- tests/Makefile.in.orig Sun May 21 19:51:44 2006
|
||||
+++ tests/Makefile.in Wed Aug 2 16:31:05 2006
|
||||
@@ -82,7 +82,7 @@
|
||||
libxtre_la_OBJECTS = $(am_libxtre_la_OBJECTS)
|
||||
@TRE_DEBUG_FALSE@am_libxtre_la_rpath =
|
||||
am_bench_OBJECTS = bench.$(OBJEXT)
|
||||
-bench_OBJECTS = $(am_bench_OBJECTS)
|
||||
+bench_OBJECTS = $(am_bench_OBJECTS) ../gnulib/lib/getopt.o
|
||||
am__DEPENDENCIES_1 =
|
||||
am__DEPENDENCIES_2 = $(am__DEPENDENCIES_1)
|
||||
bench_DEPENDENCIES = ../lib/libtre.la $(am__DEPENDENCIES_2)
|
15
devel/tre/pkg-descr
Normal file
15
devel/tre/pkg-descr
Normal file
@ -0,0 +1,15 @@
|
||||
TRE is a lightweight, robust, and efficient POSIX compliant regexp
|
||||
matching library supporting:
|
||||
- approximate (fuzzy) matching,
|
||||
- strict standards conformance,
|
||||
- predicable and modest memory consumption,
|
||||
- wide-character and multibyte character support,
|
||||
- binary pattern and data support,
|
||||
- thread-safe implementation.
|
||||
|
||||
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.
|
||||
|
||||
WWW: http://laurikari.net/tre/
|
10
devel/tre/pkg-plist
Normal file
10
devel/tre/pkg-plist
Normal file
@ -0,0 +1,10 @@
|
||||
@comment $FreeBSD$
|
||||
%%AGREP%%bin/agrep
|
||||
include/tre/regex.h
|
||||
include/tre/tre-config.h
|
||||
lib/libtre.a
|
||||
lib/libtre.la
|
||||
lib/libtre.so
|
||||
lib/libtre.so.6
|
||||
libdata/pkgconfig/tre.pc
|
||||
@dirrm include/tre
|
Loading…
Reference in New Issue
Block a user