All library names listed by *.la files no longer need to be listed
in the PLIST, e.g., instead of:
lib/libfoo.a
lib/libfoo.la
lib/libfoo.so
lib/libfoo.so.0
lib/libfoo.so.0.1
one simply needs:
lib/libfoo.la
and bsd.pkg.mk will automatically ensure that the additional library
names are listed in the installed package +CONTENTS file.
Also make LIBTOOLIZE_PLIST default to "yes".
curses.buildlink2.mk. This was wrong because we _really_ do want to
express that we want _n_curses when we include the buildlink2.mk file.
We should have a better way to say that the NetBSD curses doesn't
quite work well enough. In fact, it's far better to depend on ncurses
by default, and exceptionally note when it's okay to use NetBSD curses
for specific packages. We will look into this again in the future.
Remove `-p' from mkdir arguments, it is already part of ${MKDIR}.
While here substitute a couple of ${PREFIX} by `%D' in
`@exec ${MKDIR} ...' lines and add a couple of missing `%D' in such lines too!
all dependencies on packages depending on "png" which contain shared
libraries, all for the (imminent) update to the "png" package.
[List courtesy of John Darrow, courtesy of "bulk-build".]
Fixed
1- return() could forget objects on heap [F2]
2- polhensellift(x^3+x^2+2,[x^2,x+1],2) --> pols not coprime [F3]
3- Configure missed some shared libraries [e.g RedHat 7.0] [F4]
4- requests for precision of bnfinit(x) [ = Q ] could yield SEGV [F6]
5- compatible = 3 not taken into account when reading a file [F7]
6- lines > 0: output driver didn't reset properly after user output [F9]
7- nfdisc(x^5+2*x^4+3*x^3-3*x^2+122*x-1) --> impossible inverse [F10]
8- bug in gcc-2.95: SEGV on Linux (quicksqri) [F11]
9- addrfrac: could return a t_RFRAC whose denominator wasn't a t_POL[F12]
10- bnfcertify (zimmertbound): off by two error when reading bound [F13]
BA 11- pbs in Fp_factor_irred (factoring over Fq a pol. defined over Fp)[F25]
12- typo in quadhilbertimag (SEGV for very large discriminants) [F28]
BA 13- isprime(n < 2, 2 or 3) gave wrong result [F31]
BA 14- nfgaloisconj(polcyclo(11)+1)--> oo loop [F35]
nfgaloisconj(polcyclo(40))-->incorrect result
IS 15- typo in squfof tuning on 64bit machines [F36]
16- van Hoeij's algorithm (factor(Z[X])): wrong bound in LLL_cmbf [F41]
17- rare SEGV in nfdisc [F44]
18- rare problem in isprincipal (large non Galois base field) [F56]
--> wrong result (generators not required) or infinite loop.
19- build failed with readline-4.2 [F57]
Changed
1- DOS distribution archives (GPM removed) [C1]
XR 2- try more prime ideals in nfsqff [nffactor, modular part] [C4]
3- renamed library function gsize() to sizedigit() [pb with gtk] [C10]
IK 4- let lisGEN() return NULL when EOF is met (was oo loop) [C12]
5- install the whole distribution (see ?12) + improved Configure [C17]
Added
1- README.WIN, config/[arch-osname|locatesymbol], doc/tex2mail.1 [A1]
* Install library as libpari.a. (Previously the package installed
libpari.a.2.1 and created a symbolic link libpari.a).
* Fix warning about O_RDONLY being redefined.
first component is now a package name+version/pattern, no more
executable/patchname/whatnot.
While there, introduce BUILD_USES_MSGFMT as shorthand to pull in
devel/gettext unless /usr/bin/msgfmt exists (i.e. on post-1.5 -current).
Patch by Alistair Crooks <agc@netbsd.org>
PARI-GP is a package which is aimed at efficient computations in
number theory, but also contains a large number of other useful
functions. It is somewhat related to a Computer Algebra System, but
is not really one since it treats symbolic expressions as mathematical
entities such as matrices, polynomials, series, etc..., and not as
expressions per se. However it is often much faster than other CAS,
and contains a large number of specific functions not found elsewhere,
essentially for use in number theory.
This package can be used in an interactive shell (GP) or as a C/C++
library (PARI). It is free software, in the sense of freedom AND 'free
of charge'.
