diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-03-13 03:43:50 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-03-13 03:43:50 +0000 |
| commit | 11eebf207528f86dfa4556be3b2cc7cba57244a6 (patch) | |
| tree | 17c1ed9132ec874b14d2dcd137ac16a91e7a5b27 /src/algebra/geneez.spad.pamphlet | |
| parent | 6c75a87d8ee00d48a0f5703aa9c86591078a50d3 (diff) | |
| download | open-axiom-11eebf207528f86dfa4556be3b2cc7cba57244a6.tar.gz | |
* src/algebra/: Systematically use not zero? when comparing for
equality with 0.
Diffstat (limited to 'src/algebra/geneez.spad.pamphlet')
| -rw-r--r-- | src/algebra/geneez.spad.pamphlet | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/algebra/geneez.spad.pamphlet b/src/algebra/geneez.spad.pamphlet index 3c449fe1..c3647b6c 100644 --- a/src/algebra/geneez.spad.pamphlet +++ b/src/algebra/geneez.spad.pamphlet @@ -96,7 +96,7 @@ GenExEuclid(R,BP) : C == T exactquo(u:BP,v:BP,p:R):Union(BP,"failed") == invlcv:=modInverse(leadingCoefficient v,p) r:=monicDivide(u,reduction(invlcv*v,p)) - reduction(r.remainder,p) ~=0 => "failed" + not zero? reduction(r.remainder,p) => "failed" reduction(invlcv*r.quotient,p) FP:=EuclideanModularRing(R,BP,R,reduction,merge,exactquo) @@ -120,7 +120,7 @@ GenExEuclid(R,BP) : C == T ftab:Vector L FP := map(reduceList(#1,lmod),table)$VectorFunctions2(List BP,List FP) sln:L FP:=[0$FP for xx in ftab.1 ] - for i in 0 .. d |(cc:=coefficient(err,i)) ~=0 repeat + for i in 0 .. d |not zero?(cc:=coefficient(err,i)) repeat sln:=[slp+reduce(cc::BP,lmod)*pp for pp in ftab.(i+1) for slp in sln] nsol:=[f-lmodk*reduction(g::BP,lmod) for f in oldsol for g in sln] @@ -165,7 +165,7 @@ GenExEuclid(R,BP) : C == T -- Actually, there's no possibility of failure d:=degree m sln:L BP:=[0$BP for xx in table.1] - for i in 0 .. d | coefficient(m,i)~=0 repeat + for i in 0 .. d | not zero? coefficient(m,i) repeat sln:=[slp+coefficient(m,i)*pp for pp in table.(i+1) for slp in sln] sln @@ -192,7 +192,7 @@ GenExEuclid(R,BP) : C == T map(reduceList(#1,pmod),table)$VectorFunctions2(List BP,List FP) lpolys:L BP:=table.(#table) sln:L FP:=[0$FP for xx in ftab.1] - for i in 0 .. d | coefficient(m,i)~=0 repeat + for i in 0 .. d | not zero? coefficient(m,i) repeat sln:=[slp+reduce(coefficient(m,i)::BP,pmod)*pp for pp in ftab.(i+1) for slp in sln] soln:=[slp::BP for slp in sln] |