kpriv/freebsd-ports
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
freebsd-ports/devel/re2/Makefile

24 lines
396 B
Makefile
Raw Normal View History

RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. RE2 uses automata theory to guarantee that regular expression searches run in time linear in the size of the input. RE2 implements memory limits, so that searches can be constrained to a fixed amount of memory. RE2 is engineered to use a small fixed C++ stack footprint no matter what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments where thread stacks cannot grow arbitrarily large. WWW: http://code.google.com/p/re2/ PR: ports/150185 Submitted by: Julien Laffaye <kimelto at gmail.com>
2010-09-01 23:39:33 +02:00
# New ports collection makefile for: re2
# Date created: 2010-09-01
# Whom: Julien Laffaye <kimelto@gmail.com>
#
# $FreeBSD$
#
PORTNAME= re2
- Update to 20120226 - Remove CC/CXX hacks as it is now fixed by upstream
2012-02-28 21:38:19 +01:00
PORTVERSION= 20120226
RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. RE2 uses automata theory to guarantee that regular expression searches run in time linear in the size of the input. RE2 implements memory limits, so that searches can be constrained to a fixed amount of memory. RE2 is engineered to use a small fixed C++ stack footprint no matter what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments where thread stacks cannot grow arbitrarily large. WWW: http://code.google.com/p/re2/ PR: ports/150185 Submitted by: Julien Laffaye <kimelto at gmail.com>
2010-09-01 23:39:33 +02:00
CATEGORIES= devel
- Update to 20120226 - Remove CC/CXX hacks as it is now fixed by upstream
2012-02-28 21:38:19 +01:00
MASTER_SITES= LOCAL/jlaffaye
RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. RE2 uses automata theory to guarantee that regular expression searches run in time linear in the size of the input. RE2 implements memory limits, so that searches can be constrained to a fixed amount of memory. RE2 is engineered to use a small fixed C++ stack footprint no matter what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments where thread stacks cannot grow arbitrarily large. WWW: http://code.google.com/p/re2/ PR: ports/150185 Submitted by: Julien Laffaye <kimelto at gmail.com>
2010-09-01 23:39:33 +02:00
Update my e-mail to my FreeBSD one. While I am here, use GOOGLE_CODE instead of ${MASTER_SITE_GOOGLE_CODE} Approved by: bapt (mentor)
2011-06-08 18:52:32 +02:00
MAINTAINER= jlaffaye@FreeBSD.org
RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. RE2 uses automata theory to guarantee that regular expression searches run in time linear in the size of the input. RE2 implements memory limits, so that searches can be constrained to a fixed amount of memory. RE2 is engineered to use a small fixed C++ stack footprint no matter what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments where thread stacks cannot grow arbitrarily large. WWW: http://code.google.com/p/re2/ PR: ports/150185 Submitted by: Julien Laffaye <kimelto at gmail.com>
2010-09-01 23:39:33 +02:00
COMMENT= A fast C++ regex library
LICENSE= BSD
USE_LDCONFIG= yes
USE_GMAKE= yes
MAKE_ENV= prefix=${PREFIX}
MAKE_ARGS+= -e
Respect CXX (fixes build with clang) Approved by: bapt (mentor)
2011-06-20 23:18:43 +02:00
RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. RE2 uses automata theory to guarantee that regular expression searches run in time linear in the size of the input. RE2 implements memory limits, so that searches can be constrained to a fixed amount of memory. RE2 is engineered to use a small fixed C++ stack footprint no matter what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments where thread stacks cannot grow arbitrarily large. WWW: http://code.google.com/p/re2/ PR: ports/150185 Submitted by: Julien Laffaye <kimelto at gmail.com>
2010-09-01 23:39:33 +02:00
.include <bsd.port.mk>
Reference in a new issue Copy permalink