kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/tre/Makefile

28 lines
700 B
Makefile
Raw Normal View History

Update tre to version 0.7.6: A huge thankyou to Ville Laurikari for changing the license on tre to be a two clause BSD license: Version 0.7.6 - The license is changed from LGPL to a BSD-style license. The new license is essentially the same as the "2 clause" BSD-style license used in NetBSD. See the file LICENSE for details. - No longer using gnulib due to potential license conflicts. - Bug fixes. Take maintainership of this package.
2009-08-17 22:58:26 +02:00
# $NetBSD: Makefile,v 1.13 2009/08/17 20:58:26 agc Exp $
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.
2005-11-29 20:12:04 +01:00
Update tre to version 0.7.6: A huge thankyou to Ville Laurikari for changing the license on tre to be a two clause BSD license: Version 0.7.6 - The license is changed from LGPL to a BSD-style license. The new license is essentially the same as the "2 clause" BSD-style license used in NetBSD. See the file LICENSE for details. - No longer using gnulib due to potential license conflicts. - Bug fixes. Take maintainership of this package.
2009-08-17 22:58:26 +02:00
DISTNAME= tre-0.7.6
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.
2005-11-29 20:12:04 +01:00
CATEGORIES= devel
MASTER_SITES= http://laurikari.net/tre/
Update tre to version 0.7.6: A huge thankyou to Ville Laurikari for changing the license on tre to be a two clause BSD license: Version 0.7.6 - The license is changed from LGPL to a BSD-style license. The new license is essentially the same as the "2 clause" BSD-style license used in NetBSD. See the file LICENSE for details. - No longer using gnulib due to potential license conflicts. - Bug fixes. Take maintainership of this package.
2009-08-17 22:58:26 +02:00
MAINTAINER= agc@NetBSD.org
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.
2005-11-29 20:12:04 +01:00
HOMEPAGE= http://laurikari.net/tre/
COMMENT= Lightweight and robust POSIX compliant regexp matching library
Update tre to version 0.7.6: A huge thankyou to Ville Laurikari for changing the license on tre to be a two clause BSD license: Version 0.7.6 - The license is changed from LGPL to a BSD-style license. The new license is essentially the same as the "2 clause" BSD-style license used in NetBSD. See the file LICENSE for details. - No longer using gnulib due to potential license conflicts. - Bug fixes. Take maintainership of this package.
2009-08-17 22:58:26 +02:00
LICENSE= modified-bsd
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.
2005-11-29 20:12:04 +01:00
For consistency's sake, remove PLIST.linux and instead add an option to enable/disable NLS. This option is added to PKG_SUPPORTED_OPTIONS by default if there is a built-in gettext library. While here, add PKG_DESTDIR_SUPPORT=user-destdir. Bump revision.
2007-12-14 09:34:42 +01:00
PKG_DESTDIR_SUPPORT= user-destdir
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.
2005-11-29 20:12:04 +01:00
GNU_CONFIGURE= YES
Newer versions of "streamripper" want wchar support Enable shared libraries PKGREVISION++ Patch from Matthias Drochner
2007-09-13 21:23:40 +02:00
USE_LIBTOOL= YES
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.
2005-11-29 20:12:04 +01:00
CONFIGURE_ARGS+= --disable-system-abi
Use INSTALLATION_DIRS to create the directory
2009-05-18 08:40:59 +02:00
INSTALLATION_DIRS+= share/doc/tre
Also install the html docs for tre's API and its regexp syntax Bump PKGREVISION to 5 Add licensing info
2009-05-18 08:33:20 +02:00
post-install:
${INSTALL_DATA} ${WRKSRC}/doc/tre-api.html ${DESTDIR}${PREFIX}/share/doc/tre/
${INSTALL_DATA} ${WRKSRC}/doc/tre-syntax.html ${DESTDIR}${PREFIX}/share/doc/tre/
Remove 'nls' option per joerg's request. I added it because I figured there was some reason that the .mo files were in a seperate PLIST, though I did not see why. Bump rev again.
2007-12-14 20:07:44 +01:00
.include "../../devel/gettext-lib/buildlink3.mk"
For consistency's sake, remove PLIST.linux and instead add an option to enable/disable NLS. This option is added to PKG_SUPPORTED_OPTIONS by default if there is a built-in gettext library. While here, add PKG_DESTDIR_SUPPORT=user-destdir. Bump revision.
2007-12-14 09:34:42 +01:00
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.
2005-11-29 20:12:04 +01:00
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink