diff options
| author | dos-reis <gdr@axiomatics.org> | 2009-06-11 23:00:40 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2009-06-11 23:00:40 +0000 |
| commit | 9e07dcd91c45bf8b22d932321f5c97e931ffe8ac (patch) | |
| tree | 6d2174e90e5779b1b3ab4ae7df3ae6603b66c6c2 /src/algebra/pfbr.spad.pamphlet | |
| parent | 7bd82b57975bbc1ff5b87fed0739815c620ecdcc (diff) | |
| download | open-axiom-9e07dcd91c45bf8b22d932321f5c97e931ffe8ac.tar.gz | |
* algebra/: Don't quote '!' at end of names.
Diffstat (limited to 'src/algebra/pfbr.spad.pamphlet')
| -rw-r--r-- | src/algebra/pfbr.spad.pamphlet | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/algebra/pfbr.spad.pamphlet b/src/algebra/pfbr.spad.pamphlet index fd3b9900..b8637020 100644 --- a/src/algebra/pfbr.spad.pamphlet +++ b/src/algebra/pfbr.spad.pamphlet @@ -466,7 +466,7 @@ PolynomialFactorizationByRecursion(R,E, VarSet:OrderedSet, S): public == -- pp1 is mathematically equal to pp, but is in S[z][v] -- so we wish to operate on all of its coefficients ans:List SupSupS:= [0 for u in lpolys] - for m in reverse_! monomials pp1 repeat + for m in reverse! monomials pp1 repeat ans1:=SLPEBR(lpolys,lvpolys,leadingCoefficient m,lvpp) ans1 case "failed" => return "failed" d:=degree m @@ -487,15 +487,15 @@ PolynomialFactorizationByRecursion(R,E, VarSet:OrderedSet, S): public == solveLinearPolynomialEquationByFractions(lpolys,pp)$LPEBFS solveLinearPolynomialEquationByRecursion(lpolys,pp) == - lvpolys := removeDuplicates_! + lvpolys := removeDuplicates! concat [ concat [variables z for z in coefficients u] for u in lpolys] - lvpp := removeDuplicates_! + lvpp := removeDuplicates! concat [variables z for z in coefficients pp] SLPEBR(lpolys,lvpolys,pp,lvpp) factorByRecursion pp == - lv:List(VarSet) := removeDuplicates_! + lv:List(VarSet) := removeDuplicates! concat [variables z for z in coefficients pp] empty? lv => map(raise,factorPolynomial lower pp) @@ -505,7 +505,7 @@ PolynomialFactorizationByRecursion(R,E, VarSet:OrderedSet, S): public == mergeFactors(refine(squareFree pp,factorSquareFreeByRecursion), map(#1:S::SupS,factor(c)$S)) factorSquareFreeByRecursion pp == - lv:List(VarSet) := removeDuplicates_! + lv:List(VarSet) := removeDuplicates! concat [variables z for z in coefficients pp] empty? lv => map(raise,factorPolynomial lower pp) |