aboutsummaryrefslogtreecommitdiff
path: root/src/algebra/defintrf.spad.pamphlet
diff options
context:
space:
mode:
authordos-reis <gdr@axiomatics.org>2008-04-03 04:23:42 +0000
committerdos-reis <gdr@axiomatics.org>2008-04-03 04:23:42 +0000
commit001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532 (patch)
treeda9e2fe5d81ff4cd7709d12e44b8c3e348b8a8e3 /src/algebra/defintrf.spad.pamphlet
parenta7bab9a6c2070d05e2dbd256ce455079c8ced385 (diff)
downloadopen-axiom-001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532.tar.gz
Replace `^=' with `~='.
Diffstat (limited to 'src/algebra/defintrf.spad.pamphlet')
-rw-r--r--src/algebra/defintrf.spad.pamphlet12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/algebra/defintrf.spad.pamphlet b/src/algebra/defintrf.spad.pamphlet
index 097192a5..fc89b11f 100644
--- a/src/algebra/defintrf.spad.pamphlet
+++ b/src/algebra/defintrf.spad.pamphlet
@@ -148,7 +148,7 @@ DefiniteIntegrationTools(R, F): Exports == Implementation where
maprat p ==
ans:UPQ := 0
- while p ^= 0 repeat
+ while p ~= 0 repeat
(r := retractIfCan(c := leadingCoefficient p)@Union(Q,"failed"))
case "failed" => return "failed"
ans := ans + monomial(r::Q, degree p)
@@ -157,14 +157,14 @@ DefiniteIntegrationTools(R, F): Exports == Implementation where
)$SparseUnivariatePolynomialFunctions2(Q, Z)
intrat(a, b) ==
- (n := whatInfinity a) ^= 0 =>
+ (n := whatInfinity a) ~= 0 =>
(r := retractIfCan(b)@Union(F,"failed")) case "failed" => ["all"]
(q := retractIfCan(r::F)@Union(Q, "failed")) case "failed" =>
["failed"]
[[q::Q, n]]
(q := retractIfCan(retract(a)@F)@Union(Q,"failed")) case "failed"
=> ["failed"]
- (n := whatInfinity b) ^= 0 => [[q::Q, n]]
+ (n := whatInfinity b) ~= 0 => [[q::Q, n]]
(t := retractIfCan(retract(b)@F)@Union(Q,"failed")) case "failed"
=> ["failed"]
[[q::Q, t::Q]]
@@ -187,11 +187,11 @@ DefiniteIntegrationTools(R, F): Exports == Implementation where
checkBudan(p, a, b, incl?) ==
r := retractIfCan(b)@Union(F, "failed")
- (n := whatInfinity a) ^= 0 =>
+ (n := whatInfinity a) ~= 0 =>
r case "failed" => realRoot p
checkHalfAx(p, r::F, n, incl?)
(za? := zero? p(aa := retract(a)@F)) and incl? => true
- (n := whatInfinity b) ^= 0 => checkHalfAx(p, aa, n, incl?)
+ (n := whatInfinity b) ~= 0 => checkHalfAx(p, aa, n, incl?)
(zb? := zero? p(bb := r::F)) and incl? => true
(va := variation(p, aa)) case "failed" or
(vb := variation(p, bb)) case "failed" => "failed"
@@ -250,7 +250,7 @@ DefiniteIntegrationTools(R, F): Exports == Implementation where
i:Z := 0
(lastCoef := negative leadingCoefficient q) case "failed" =>
"failed"
- while ((q := reductum q) ^= 0) repeat
+ while ((q := reductum q) ~= 0) repeat
(next := negative leadingCoefficient q) case "failed" =>
return "failed"
if ((not(lastCoef::B)) and next::B) or