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.
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.
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.
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.
* 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.
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
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).
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.
