diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-08-31 13:56:20 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-08-31 13:56:20 +0000 |
| commit | e8df02fd0970cad96e174ffb5b7707081266f371 (patch) | |
| tree | 5e5322ecc176e9e8bb2bc5caad00409a0a687f42 /src/algebra/listgcd.spad.pamphlet | |
| parent | 3c58b07e75e2c6cc1cd57d2902aa305335161e5e (diff) | |
| download | open-axiom-e8df02fd0970cad96e174ffb5b7707081266f371.tar.gz | |
* algebra/boolean.spad.pamphlet (Boolean): Remove definition of
operator ^.
* algebra/aggcat.spad.pamphlet (BitAggregate): Likewise.
* algebra/color.spad.pamphlet: Replace use of '^' as logical
negation by 'not'.
* algebra/ddfact.spad.pamphlet: Likewise.
* algebra/fortran.spad.pamphlet: Likewise.
* algebra/gaussfac.spad.pamphlet: Likewise.
* algebra/gbeuclid.spad.pamphlet: Likewise.
* algebra/gbintern.spad.pamphlet: Likewise.
* algebra/ghensel.spad.pamphlet: Likewise.
* algebra/groebsol.spad.pamphlet: Likewise.
* algebra/ideal.spad.pamphlet: Likewise.
* algebra/idecomp.spad.pamphlet: Likewise.
* algebra/indexedp.spad.pamphlet: Likewise.
* algebra/listgcd.spad.pamphlet: Likewise.
* algebra/mfinfact.spad.pamphlet: Likewise.
* algebra/modgcd.spad.pamphlet: Likewise.
* algebra/multfact.spad.pamphlet: Likewise.
* algebra/multsqfr.spad.pamphlet: Likewise.
* algebra/newpoint.spad.pamphlet: Likewise.
* algebra/npcoef.spad.pamphlet: Likewise.
* algebra/permgrps.spad.pamphlet: Likewise.
* algebra/pgcd.spad.pamphlet: Likewise.
* algebra/pleqn.spad.pamphlet: Likewise.
* algebra/qalgset.spad.pamphlet: Likewise.
* algebra/radeigen.spad.pamphlet: Likewise.
* algebra/rep2.spad.pamphlet: Likewise.
* algebra/solverad.spad.pamphlet: Likewise.
* algebra/space.spad.pamphlet: Likewise.
* algebra/view2D.spad.pamphlet: Likewise.
* algebra/strap/: Update cached Lisp translateion
* share/algebra/: Update databases.
Diffstat (limited to 'src/algebra/listgcd.spad.pamphlet')
| -rw-r--r-- | src/algebra/listgcd.spad.pamphlet | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/algebra/listgcd.spad.pamphlet b/src/algebra/listgcd.spad.pamphlet index 2f4ccde4..a654bf61 100644 --- a/src/algebra/listgcd.spad.pamphlet +++ b/src/algebra/listgcd.spad.pamphlet @@ -68,7 +68,7 @@ HeuGcd (BP):C == T myNextPrime(val:Z,bound:NNI) : Z == nextPrime(val)$IntegerPrimesPackage(Z) - constNotZero(f : BP ) : Boolean == (degree f = 0) and ^(zero? f) + constNotZero(f : BP ) : Boolean == (degree f = 0) and not (zero? f) negShiftz(n:Z,Modulus:PI):Z == n < 0 => n:= n+Modulus @@ -100,7 +100,7 @@ HeuGcd (BP):C == T member?(1,lval) => 1$Z lval:=sort(#1<#2,lval) val:=lval.first - for val1 in lval.rest while ^(val=1) repeat val:=gcd(val,val1) + for val1 in lval.rest while not (val=1) repeat val:=gcd(val,val1) val --content for a list of univariate polynomials @@ -149,9 +149,9 @@ HeuGcd (BP):C == T --local function for the gcd among n PRIMITIVE univariate polynomials localgcd(listf:List BP ):List BP == - hgt:="min"/[height(f) for f in listf|^zero? f] + hgt:="min"/[height(f) for f in listf| not zero? f] answr:=2+2*hgt - minf := "mindegpol"/[f for f in listf|^zero? f] + minf := "mindegpol"/[f for f in listf| not zero? f] (result := testDivide(listf, minf)) case List(BP) => cons(minf, result::List BP) if degree minf < 100 then for k in 1..10 repeat |