diff options
Diffstat (limited to 'src/algebra/ffpoly.spad.pamphlet')
| -rw-r--r-- | src/algebra/ffpoly.spad.pamphlet | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/algebra/ffpoly.spad.pamphlet b/src/algebra/ffpoly.spad.pamphlet index b6f2f767..5fd9cd38 100644 --- a/src/algebra/ffpoly.spad.pamphlet +++ b/src/algebra/ffpoly.spad.pamphlet @@ -411,13 +411,13 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where secondOfs = firstOfsPlus1 => s := restOfs i := i + 1 - setfirst_!(s, firstOfsPlus1) -- s := [s(i)+1, s(i+1),..., s(m)] + setfirst!(s, firstOfsPlus1) -- s := [s(i)+1, s(i+1),..., s(m)] noGap := false if noGap then -- here s = [s(m)] firstOfs := first s - firstOfs < bound => setfirst_!(s, firstOfs + 1) -- s := [s(m)+1] + firstOfs < bound => setfirst!(s, firstOfs + 1) -- s := [s(m)+1] m < bound => - setfirst_!(s, m + 1) -- s := [m+1] + setfirst!(s, m + 1) -- s := [m+1] i := m return "failed" -- (here m = s(m) = bound) for j in i..1 by -1 repeat -- reconstruct the destroyed @@ -471,7 +471,7 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where headlookuplist := rest headlookuplist -- otherwise set f{i1} := index(j)$GF setelt(first headpol, coeff, index(j :: PI)$GF) - setfirst_!(headlookuplist, j) + setfirst!(headlookuplist, j) if empty? taillookuplist then pol := revListToSUP(headpol) -- @@ -586,7 +586,7 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where headlookuplist := rest headlookuplist -- otherwise set f{i1} := index(j)$GF setelt(first headpol, coeff, index(j :: PI)$GF) - setfirst_!(headlookuplist, j) + setfirst!(headlookuplist, j) if empty? taillookuplist then pol := revListToSUP cons(constterm, headpol) -- @@ -697,7 +697,7 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where middlelookuplist := rest middlelookuplist -- otherwise set f{i1} := index(j)$GF setelt(first middlepol, coeff, index(j :: PI)$GF) - setfirst_!(middlelookuplist, j) + setfirst!(middlelookuplist, j) if empty? taillookuplist then pol := listToSUP append(headpol, reverse middlepol) -- @@ -834,7 +834,7 @@ FiniteFieldPolynomialPackage GF : Exports == Implementation where middlelookuplist := rest middlelookuplist -- otherwise set f{i1} := index(j)$GF setelt(first middlepol, coeff, index(j :: PI)$GF) - setfirst_!(middlelookuplist, j) + setfirst!(middlelookuplist, j) if empty? taillookuplist then pol := listToSUP append(headpol, reverse cons(constterm, middlepol)) |