From 8c47810df65c610513d4be825bd6ee9a56f97f9f Mon Sep 17 00:00:00 2001 From: dos-reis <gdr@axiomatics.org> Date: Wed, 9 Mar 2011 23:54:10 +0000 Subject: * algebra/catdef.spad.pamphlet (StepThrough) [nextItem]: Now return Maybe %. * algebra/ffcat.spad.pamphlet: Propagate change. * algebra/fmod.spad.pamphlet: Likewise. * algebra/fraction.spad.pamphlet: Likewise. * algebra/integer.spad.pamphlet: Likewise. * algebra/pfbr.spad.pamphlet: Likewise. * algebra/polycat.spad.pamphlet: Likewise. * algebra/si.spad.pamphlet: Likewise. --- src/algebra/pfbr.spad.pamphlet | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'src/algebra/pfbr.spad.pamphlet') diff --git a/src/algebra/pfbr.spad.pamphlet b/src/algebra/pfbr.spad.pamphlet index 85943f84..5919c7ec 100644 --- a/src/algebra/pfbr.spad.pamphlet +++ b/src/algebra/pfbr.spad.pamphlet @@ -176,10 +176,10 @@ PolynomialFactorizationByRecursionUnivariate(R, S): public == private where while true repeat tempAns:=factorSFBRlcUnitInner(pp,val) not (tempAns case "failed") => return tempAns - val1:=nextItem val - val1 case "failed" => + val1 := nextItem val + val1 case nothing => error "at this point, we know we have a finite field" - val:=val1 + val := val1 else factorSFBRlcUnit(pp) == val:R := randomR() @@ -191,7 +191,7 @@ PolynomialFactorizationByRecursionUnivariate(R, S): public == private where randomCount:R:= init() randomR() == v:=nextItem(randomCount) - v case "failed" => + v case nothing => SAY$Lisp "Taking another set of random values" randomCount:=init() randomCount @@ -404,7 +404,7 @@ PolynomialFactorizationByRecursion(R,E, VarSet:OrderedSet, S): public == tempAns:=factorSFBRlcUnitInner(lvpp,pp,val) not (tempAns case "failed") => return tempAns val1:=nextItem val - val1 case "failed" => + val1 case nothing => error "at this point, we know we have a finite field" val:=val1 else -- cgit v1.2.3