a06878c965
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.
25 lines
702 B
Makefile
25 lines
702 B
Makefile
# $NetBSD: Makefile,v 1.1.1.1 2005/11/29 19:12:04 adrianp Exp $
|
|
|
|
#
|
|
# Please do not update or modify this package as it has been imported only
|
|
# as a dependecy for chat/unrealircd. This package should only be updated
|
|
# when chat/unrealircd requires it.
|
|
#
|
|
|
|
DISTNAME= tre-0.7.2
|
|
CATEGORIES= devel
|
|
MASTER_SITES= http://laurikari.net/tre/
|
|
|
|
MAINTAINER= adrianp@NetBSD.org
|
|
HOMEPAGE= http://laurikari.net/tre/
|
|
COMMENT= Lightweight and robust POSIX compliant regexp matching library
|
|
|
|
GNU_CONFIGURE= YES
|
|
|
|
CONFIGURE_ARGS+= --disable-agrep
|
|
CONFIGURE_ARGS+= --disable-shared
|
|
CONFIGURE_ARGS+= --disable-system-abi
|
|
CONFIGURE_ARGS+= --disable-wchar
|
|
CONFIGURE_ARGS+= --disable-multibyte
|
|
|
|
.include "../../mk/bsd.pkg.mk"
|