Changes commited to PARI GIT during the last two weeks

14- [libpari] Rg_to_F2, RgV_to_F2v, RgM_to_F2m

1	0	CHANGES
6	0	doc/usersch5.tex
31	14	src/basemath/F2x.c
23	0	src/basemath/Flx.c
3	0	src/headers/paridecl.h

gtrans: kill dead code

12	26	src/basemath/alglin3.c

add tests

6	0	src/test/32/mat
2	0	src/test/in/mat

add tests

5	0	src/test/32/mat
6	0	src/test/32/pol
4	0	src/test/32/quad
2	1	src/test/32/rfrac
2	0	src/test/32/ser
4	0	src/test/in/mat
2	0	src/test/in/pol
4	0	src/test/in/quad
2	0	src/test/in/rfrac
2	0	src/test/in/ser

add test

1	0	src/test/32/pol
1	0	src/test/in/pol

improve test

5	4	src/test/32/charpoly
3	1	src/test/in/charpoly

add tests

10	1	src/test/32/charpoly
5	1	src/test/in/charpoly

add tests

5	2	src/test/32/factormod
3	3	src/test/in/factormod

update

68	1	src/test/32/ff
9	1	src/test/32/ispower

factorff(Pol(0),2,y) -> corruption of 2nd col; add tests

1	1	src/basemath/FpX_factor.c
50	1	src/test/32/factormod
68	1	src/test/64/ff
21	0	src/test/in/factormod
5	0	src/test/in/ff

add test

2	0	src/test/32/factormod
2	0	src/test/in/factormod

49- truncation (precision) errors in bnfnarrow [#1491]

1	0	CHANGES
3	2	src/basemath/buch2.c

call uissquare from Z_issquareall + add tests

4	4	src/basemath/arith1.c
9	1	src/test/64/ispower
9	1	src/test/in/ispower

further improve Help

10	0	src/functions/programming/allocatemem

improve Help

8	5	src/functions/programming/allocatemem

48- poliscyclo(x^0) -> 2

1	0	CHANGES
3	3	src/basemath/QX_factor.c
6	1	src/test/32/cyclo
3	0	src/test/in/cyclo

whitespace edit

1	1	src/basemath/base1.c

[T,basis]: further consistency checks

27	9	src/basemath/base1.c
10	1	src/test/32/nf
9	3	src/test/64/nf
7	5	src/test/in/nf

matconcat([]) -> [;]

1	1	src/basemath/concat.c
1	0	src/test/32/concat
1	0	src/test/in/concat

19- chinese(t_POL,t_POL): allow polynomials of different degrees

1	0	CHANGES
12	4	src/basemath/arith1.c
28	5	src/functions/number_theoretical/chinese

[T, basis] format: add further consistency checks [#1494]

15	10	src/basemath/base1.c
4	1	src/test/64/nf
1	0	src/test/in/nf

47- forqfvec(v,[;],0,) -> SEGV [#1495]

1	0	CHANGES
1	0	src/basemath/bibli1.c
1	0	src/test/in/qf

off-by-1 error in mpbern [harmless umr]

2	1	src/basemath/trans2.c

update

11	2	src/test/32/random

46- randomprime(2) -> SEGV [#1493, 2.6.0]

1	0	CHANGES
36	15	src/basemath/prime.c
3	3	src/functions/number_theoretical/randomprime
12	3	src/test/64/random
4	1	src/test/in/random

disallow bernreal(n < 0)

3	7	src/basemath/trans3.c
8	2	src/test/32/bern
3	1	src/test/in/bern

sanity check n>= 0 in bernfrac [#1492]

1	0	src/basemath/trans2.c
4	1	src/test/32/bern
1	0	src/test/in/bern

abelian_group: use zv_prod instead of group_order on a false group

1	2	src/basemath/perm.c

galoisgen: do not prealloc pf

5	8	src/basemath/galconj.c

galoisgen: Use vecsmall_prepend

2	4	src/basemath/galconj.c

galoisgen: cleanup cyclic case

2	7	src/basemath/galconj.c

galoisgen, galoisfixedfield: Use gerepileupto

9	13	src/basemath/galconj.c

galoisgen: use frob instead of cyc_pow_perm(,1)

2	2	src/basemath/galconj.c

galoisgenliftauto: fix off-by-one error

1	1	src/basemath/galconj.c

Mark galoisgenliftauto as static

1	1	src/basemath/galconj.c

galoisinit: special case polcyclo

14	1	src/basemath/galconj.c
0	1	src/basemath/subcyclo.c
19	1	src/test/32/galoisinit
3	0	src/test/in/galoisinit

add test

2	1	src/test/32/galoisinit
1	0	src/test/in/galoisinit

add tests

7	1	src/test/32/subgroup
5	0	src/test/in/subgroup

Split galoisgenliftauto from galoisgen

66	58	src/basemath/galconj.c

add tests

5	1	src/test/32/zn
5	0	src/test/in/zn

add tests

9	1	src/test/32/deriv
2	1	src/test/32/div
2	1	src/test/64/div
8	0	src/test/in/deriv
2	0	src/test/in/div

add test

2	1	src/test/32/ser
1	0	src/test/in/ser

add test

1	0	src/test/32/div
2	1	src/test/64/div
2	0	src/test/in/div

add test

5	0	src/test/in/random

add test

1	0	src/test/in/random

galoisgenfixedfield: extract get_image()

Avoid code duplication

25	21	src/basemath/galconj.c

add test

7	1	src/test/32/qfisom
15	9	src/test/in/qfisom

update

2	2	src/test/32/compat
2	2	src/test/32/elliptic
2	2	src/test/32/nfields
1	1	src/test/32/polyser

45- polroots(): wrong accuracy of (real) 0 components

At \p38, polroots((x-2.)*(x^2+1)) had entries of the form 0.E-55
(instead of 0.E-38)

1	0	CHANGES
18	7	src/basemath/rootpol.c
1	1	src/test/32/factor
2	2	src/test/64/compat
2	2	src/test/64/elliptic
2	2	src/test/64/nfields
1	1	src/test/64/polyser

fix mateigen(,1) broken by previous commit

3	3	src/basemath/alglin1.c

galoisgenfixedfield: remove last parameter

19	18	src/basemath/galconj.c

44- mateigen(rational matrix): inconsistent concatenation [#1489,2.6.0]

1	0	CHANGES
1	0	src/basemath/alglin1.c
4	0	src/test/in/charpoly

add tests

3	1	src/test/32/addprimes
3	0	src/test/in/addprimes

kill dead code

2	9	src/basemath/polarit2.c

add tests

13	1	src/test/32/factor
30	1	src/test/32/gcdext
1	0	src/test/32/pol
2	0	src/test/in/factor
28	0	src/test/in/gcdext
1	0	src/test/in/pol

fix modfun test

1	0	src/test/in/modfun

substpol for t_SER:

- allow fallback when v != varn(ser)
- fail with meaningful message in gdeflate (since fallback won't handle
  that case)

14	1	src/basemath/gen3.c
2	1	src/test/32/subst
1	0	src/test/in/subst

add test

1	0	src/test/32/subst
1	0	src/test/in/subst

update

4	0	src/test/32/subst

minor cleanup subst failure + add test

2	3	src/basemath/gen3.c
3	0	src/test/in/subst

add tests

3	0	src/test/32/subst
3	0	src/test/in/subst

rewrite gdeflate

74	67	src/basemath/gen3.c
3	1	src/test/32/subst
3	0	src/test/in/subst

3- [libpari] removed useless functions gand, gor

1	0	CHANGES
1	0	COMPAT
0	6	src/basemath/gen3.c
0	2	src/headers/paridecl.h

rename eta -> modfun + add tests (for j + theta)

0	4	src/test/32/eta
7	0	src/test/32/modfun
0	2	src/test/in/eta
6	0	src/test/in/modfun

eta: kill dead code + add test

2	8	src/basemath/trans3.c
4	0	src/test/32/eta
2	0	src/test/in/eta

add test

14	0	src/test/32/polylog
6	0	src/test/in/polylog

add GENHTML_FLAGS to genhtml (lcov-report target)

2	1	config/Makefile.SH

13- GP function getabstime()

1	0	CHANGES
12	0	src/functions/programming/getabstime
2	0	src/functions/programming/gettime
1	0	src/headers/paridecl.h
4	1	src/language/init.c
3	0	src/test/32/time
9	0	src/test/in/time

update

1	1	src/test/32/analyz
2	2	src/test/32/compat
1	1	src/test/32/elliptic
2	2	src/test/32/graph
2	2	src/test/32/linear
2	2	src/test/32/nfields
2	2	src/test/32/number
2	2	src/test/32/objets
1	1	src/test/32/polyser
3	3	src/test/32/program

store timings together with history entries

12- GP operator %#n to recover time used to compute history result %n
18- GP: all results are now stored in GP history, together with the time
    to obtain them [ used to only store non-gnil results, and no timings ]

minigp, various improvements:
- fix pari_add_hist call
- add timer + default(timer)
- move "entree" arrays out of main to make structure simpler

3	0	CHANGES
9	7	doc/usersch2.tex
6	1	doc/usersch5.tex
27	16	examples/minigp.c
6	0	src/functions/symbolic_operators/hist
14	12	src/gp/gp.c
2	1	src/headers/paridecl.h
5	2	src/headers/paripriv.h
18	19	src/language/default.c
23	24	src/language/es.c
1	1	src/language/init.c
3	0	src/language/parse.y
1	1	src/language/parsec.h
1	1	src/language/tree.h
2	2	src/test/32/ellanal
18	0	src/test/32/history
1	1	src/test/32/list
0	3	src/test/32/op
1	1	src/test/64/analyz
1	1	src/test/64/compat
2	2	src/test/64/elliptic
2	2	src/test/64/graph
2	2	src/test/64/linear
2	2	src/test/64/nfields
1	1	src/test/64/number
2	2	src/test/64/objets
1	1	src/test/64/polyser
3	3	src/test/64/program
17	0	src/test/in/history
0	2	src/test/in/op

initial gettime call: make sure result is normalized (= 0)

otherwise, getheap is essentially random

1	1	src/test/dotest

43- Configure --time=ftime: wrong reported timings

fixes an overflow. Previous commit 38f0d1df fixed the test suite

1	0	CHANGES
1	1	src/language/init.c

move initial 'gettime' to dotest

3	3	src/test/32/analyz
3	3	src/test/32/compat
2	2	src/test/32/ellanal
3	3	src/test/32/elliptic
3	3	src/test/32/graph
2	2	src/test/32/intnum
3	3	src/test/32/linear
2	2	src/test/32/list
2	2	src/test/32/nfields
3	3	src/test/32/number
3	3	src/test/32/objets
2	2	src/test/32/op
3	3	src/test/32/polyser
4	4	src/test/32/program
1	2	src/test/32/quadclassunit
3	3	src/test/32/sumiter
3	3	src/test/32/trans
2	2	src/test/64/analyz
3	3	src/test/64/compat
2	2	src/test/64/elliptic
3	3	src/test/64/graph
2	4	src/test/64/intnum
2	2	src/test/64/linear
3	3	src/test/64/nfields
2	2	src/test/64/number
3	3	src/test/64/objets
3	3	src/test/64/polyser
4	4	src/test/64/program
2	2	src/test/64/sumiter
2	2	src/test/64/trans
1	1	src/test/dotest
1	1	src/test/in/analyz
1	1	src/test/in/compat
1	1	src/test/in/elliptic
0	1	src/test/in/galois
1	1	src/test/in/graph
1	1	src/test/in/intnum
1	1	src/test/in/linear
1	1	src/test/in/nfields
1	1	src/test/in/number
1	1	src/test/in/objets
1	1	src/test/in/op
1	1	src/test/in/ploth
1	1	src/test/in/polyser
1	1	src/test/in/program
0	1	src/test/in/qfb
0	1	src/test/in/qfbsolve
0	1	src/test/in/quadclassunit
0	2	src/test/in/quadray
0	1	src/test/in/resultant
0	1	src/test/in/rnfkummer
1	1	src/test/in/stark
1	1	src/test/in/sumiter
1	1	src/test/in/trans

42- nfroots(nf, deg 1 polynomial) -> wrong result

1	0	CHANGES
4	1	src/basemath/nffactor.c
2	1	src/test/32/nffactor
2	0	src/test/in/nffactor

FF_ellrandom: use more transparent notations in the code + update ??random

14	7	src/basemath/FF.c
6	5	src/functions/conversions/random

FF_ellrandom(): avoid oo-loops with curves with trivial groups.

Now we detect this case and return the point at infinity.

3	1	doc/usersch7.tex
17	3	src/basemath/FF.c
5	5	src/basemath/elliptic.c
1	0	src/test/in/ellff

fix test

4	2	src/test/in/ellff

41- ellinit([0,1,1,0,1],2).group -> SEGV

1	0	CHANGES
3	1	src/basemath/bb_group.c

add tests + whitespace edits

3	1	src/test/32/ellweilpairing
7	3	src/test/in/ellff
48	38	src/test/in/ellweilpairing

update

2	1	src/test/32/ispower

ispower(1009^11). Better fix than e9cdacc7d

Repect the cutoff and don't test one prime too many in is_pth_prime.
OTOH, don't advance the prime iterator on return, start from T.p

2	2	src/basemath/arith1.c
1	2	src/basemath/ifactor1.c

update

4	4	src/test/32/ff

40- ispower(1009^11) -> 0 [2.6.0]

could miss p-th power, if is_pth_power() advanced the prime iterator
without testing for the prime due to cutoff

1	0	CHANGES
2	1	src/basemath/ifactor1.c
2	1	src/test/64/ispower
2	0	src/test/in/ispower

ffgen(ffinit) -> ffinit(p^n)

4	4	src/test/32/sqrtn
4	4	src/test/64/ff
1	1	src/test/in/deriv
5	5	src/test/in/ell
6	6	src/test/in/ellff
3	3	src/test/in/ff
4	4	src/test/in/member
1	1	src/test/in/random
3	3	src/test/in/sqrtn

muliispec_mirror: kill trailing zeros first

application to mulrr (lz> MULRR_MULII_LIMIT) when a "small" argument
was converted by itor() to the accuracy of the other.

16	7	src/kernel/gmp/mp.c

refactor mulrrz_i / sqrz_i, apply to mulir

- final rounding code was identical
- x t_REAL * y t_INT: either convert y to t_REAL (as before) or use
  integer multiplication (if lg(x)>> lg(y))

2	0	CHANGES
99	123	src/kernel/none/mp_indep.c

cleanup

- include -fno-strict-aliasing if flag exists (don't test against version)
- alpha + gcc <= 2.95.2 no longer inhibit ASMINLINE

10	15	config/get_cc

update

2	1	src/test/32/bnr

Add Colrev

1	0	CHANGES
11	0	src/basemath/gen3.c
12	0	src/functions/conversions/Colrev
2	0	src/headers/paridecl.h
12	1	src/test/32/extract
1	1	src/test/in/extract

Doc improvement

2	2	src/functions/conversions/Vecrev

10- mathnfmodid(m, d): allow d an arbitrary vector of positive integers.
   The old syntax (d an integer, representing a vector of equal integers)
   is still allowed

3	0	CHANGES
12	8	src/basemath/buch2.c
27	24	src/basemath/buch3.c
84	53	src/basemath/hnf_snf.c
3	3	src/basemath/subgroup.c
28	3	src/functions/linear_algebra/mathnfmodid
1	1	src/modules/kummer.c
21	33	src/modules/stark.c
1	4	src/test/32/err
10	0	src/test/32/mathnf
1	0	src/test/64/bnr
1	0	src/test/in/bnr
0	1	src/test/in/err
2	0	src/test/in/mathnf

closure_unlink/closure_relink: ignore NULL entree

NULL entree is an artifact of the implementation of my().

9	7	src/language/eval.c