License has been changed from LGPL to MIT, permitted by Rik Faith,
original author of this library.
Build system changed from autoshit to mk-configure.
Library version/soname was bumped from 3 to 4. I cannot
guarantee that mk-configure and libtool build shared library the
same way.
Tests were added for stk_*, mem_* and prm_* functions.
stk_isempty function was added.
stk_* and other was reimplemented without obstack functions (glibc
extension).
Issues found with existing distfiles:
distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip
distfiles/fortran-utils-1.1.tar.gz
distfiles/ivykis-0.39.tar.gz
distfiles/enum-1.11.tar.gz
distfiles/pvs-3.2-libraries.tgz
distfiles/pvs-3.2-linux.tgz
distfiles/pvs-3.2-solaris.tgz
distfiles/pvs-3.2-system.tgz
No changes made to these distinfo files.
Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden). All existing
SHA1 digests retained for now as an audit trail.
pkg/42344: update for devel/libmaa [patch]
update devel/libmaa to 1.2.0.
Major changes in upstream:
For better conformance with POSIX/SUS xmalloc, xrealloc and xcalloc
functions take 'size_t' args, not 'unsigned int'.
Due to change in API a major shared library number is bumped from 1 to 2
New trivial test for log.c
fix for sltest.c: on OpenBSD intptr_t is defined in stdint.h
Makefile.in: GNU make is not required anymore, bsd make is enough
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.
The LIBMAA library provides many low-level data structures which are
helpful for writing compilers, including hash tables, sets, lists,
debugging support, and memory management. Although LIBMAA was
designed and implemented as a foundation for the Khepera
Transformation System, the data structures are generally applicable to
a wide range of programming problems.
The memory management routines are especially helpful for improving the
performance of memory-intensive applications.
