summaryrefslogtreecommitdiff
path: root/devel/tre
AgeCommit message (Collapse)AuthorFilesLines
2011-04-22recursive bump from gettext-lib shlib bump.obache2-3/+4
2010-12-28buildlink with gettext-lib additionally.obache1-1/+3
libtre.la refer -lintl.
2009-09-07Mark devel/tre and textproc/glimpse as conflicting since both installghen1-1/+5
${PREFIX}/bin/agrep (approx. grep utility).
2009-08-17Update tre to version 0.7.6:agc1-4/+4
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-17Update tre to version 0.7.6:agc1-5/+4
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-07-17Give up MAINTAINERadrianp1-2/+2
2009-07-02Include agrep in DESCR.ghen1-0/+7
2009-07-02Build and install agrep (approximate grep), too. Ok adrianp.ghen2-4/+5
2009-06-14Remove @dirrm entries from PLISTsjoerg1-2/+1
2009-05-18Use INSTALLATION_DIRS to create the directoryagc1-2/+3
2009-05-18Also install the html docs for tre's API and its regexp syntaxagc2-3/+12
Bump PKGREVISION to 5 Add licensing info
2009-03-20Simply and speed up buildlink3.mk files and processing.joerg1-13/+6
This changes the buildlink3.mk files to use an include guard for the recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS, BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of enter/exit marker, which can be used to reconstruct the tree and to determine first level includes. Avoiding := for large variables (BUILDLINK_ORDER) speeds up parse time as += has linear complexity. The include guard reduces system time by avoiding reading files over and over again. For complex packages this reduces both %user and %sys time to half of the former time.
2008-01-05Removed options.mk, since it is not included anymore.rillig1-20/+0
2007-12-14Remove 'nls' option per joerg's request. I added it because I figuredbjs3-8/+6
there was some reason that the .mo files were in a seperate PLIST, though I did not see why. Bump rev again.
2007-12-14For consistency's sake, remove PLIST.linux and instead add an optionbjs4-4/+28
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-10-13nls support means extra files get installed on Linuxadrianp2-2/+5
Report from Aleksey Cheusov in PR# 37099
2007-09-13Newer versions of "streamripper" want wchar supportadrianp2-12/+4
Enable shared libraries PKGREVISION++ Patch from Matthias Drochner
2007-07-14Update to 0.7.5adrianp2-6/+6
* Removed unused tre_filter code. * Fixed printf format string and argument types for 64 bit builds. * Fixed params array signedness inconsistencies. * Fixed not to build agrep if --disable-approx is used. * Included GNU getopt implementation from gnulib. * Fixed backtracking matcher to work if malloc(0) returns NULL. * Removed guessing of best optimizing CFLAGS. * Fixed agrep exit status when no matches found. * Fixed regex parser on big-endian 64 bit architectures. * Added support for the -q command line option.
2006-07-08Change the format of BUILDLINK_ORDER to contain depth information as well,jlam1-2/+2
and add a new helper target and script, "show-buildlink3", that outputs a listing of the buildlink3.mk files included as well as the depth at which they are included. For example, "make show-buildlink3" in fonts/Xft2 displays: zlib fontconfig iconv zlib freetype2 expat freetype2 Xrender renderproto
2006-07-08Track information in a new variable BUILDLINK_ORDER that informs usjlam1-1/+2
of the order in which buildlink3.mk files are (recursively) included by a package Makefile.
2006-05-09Fix typo in comment.wiz1-2/+2
2006-05-09Make pkglint happy about the comment in the Makefileadrianp2-10/+11
Add an extra CPPFLAGS to the bl3.mk to ensure the correct regexp files are picked up by any package that requires this one. From Aleksey Cheusov.
2006-04-12Aligned the last line of the buildlink3.mk files with the first line, sorillig1-2/+2
that they look nicer.
2006-04-06Over 1200 files touched but no revisions bumped :)reed1-2/+2
RECOMMENDED is removed. It becomes ABI_DEPENDS. BUILDLINK_RECOMMENDED.foo becomes BUILDLINK_ABI_DEPENDS.foo. BUILDLINK_DEPENDS.foo becomes BUILDLINK_API_DEPENDS.foo. BUILDLINK_DEPENDS does not change. IGNORE_RECOMMENDED (which defaulted to "no") becomes USE_ABI_DEPENDS which defaults to "yes". Added to obsolete.mk checking for IGNORE_RECOMMENDED. I did not manually go through and fix any aesthetic tab/spacing issues. I have tested the above patch on DragonFly building and packaging subversion and pkglint and their many dependencies. I have also tested USE_ABI_DEPENDS=no on my NetBSD workstation (where I have used IGNORE_RECOMMENDED for a long time). I have been an active user of IGNORE_RECOMMENDED since it was available. As suggested, I removed the documentation sentences suggesting bumping for "security" issues. As discussed on tech-pkg. I will commit to revbump, pkglint, pkg_install, createbuildlink separately. Note that if you use wip, it will fail! I will commit to pkgsrc-wip later (within day).
2005-11-29TRE is a lightweight, robust, and efficient POSIX compliant regexp matchingadrianp5-0/+67
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.