diff --git a/books/bookvol0.pamphlet b/books/bookvol0.pamphlet
index 2a5d851..e9df36c 100644
--- a/books/bookvol0.pamphlet
+++ b/books/bookvol0.pamphlet
@@ -51165,7 +51165,7 @@ $$
$$
\returnType{Type: XPBWPolynomial(Symbol,Fraction Integer)}
-\spadcommand{ListOfTerms pq }
+\spadcommand{listOfTerms pq }
$$
\left[
{\left[ {k={{\left[ b
diff --git a/books/bookvol10.2.pamphlet b/books/bookvol10.2.pamphlet
index 53a2e3c..5e8ae3e 100644
--- a/books/bookvol10.2.pamphlet
+++ b/books/bookvol10.2.pamphlet
@@ -28812,7 +28812,7 @@ digraph pic {
\cross{FMCAT}{leadingCoefficient} &
\cross{FMCAT}{leadingMonomial} \\
\cross{FMCAT}{leadingTerm} &
-\cross{FMCAT}{ListOfTerms} &
+\cross{FMCAT}{listOfTerms} &
\cross{FMCAT}{map} &
\cross{FMCAT}{monom} \\
\cross{FMCAT}{monomial?} &
@@ -28847,7 +28847,7 @@ These are directly exported but not implemented:
leadingCoefficient : % -> R
leadingMonomial : % -> Basis
leadingTerm : % -> Record(k: Basis,c: R)
- ListOfTerms : % -> List Record(k: Basis,c: R)
+ listOfTerms : % -> List Record(k: Basis,c: R)
map : ((R -> R),%) -> %
monom : (Basis,R) -> %
monomial? : % -> Boolean
@@ -28930,8 +28930,8 @@ FreeModuleCat(R, Basis):Category == Exports where
monomial? : % -> Boolean
++ \spad{monomial?(x)} returns true if \spad{x} contains a single
++ monomial.
- ListOfTerms : % -> List TERM
- ++ \spad{ListOfTerms(x)} returns a list \spad{lt} of terms with type
+ listOfTerms : % -> List TERM
+ ++ \spad{listOfTerms(x)} returns a list \spad{lt} of terms with type
++ \spad{Record(k: Basis, c: R)} such that \spad{x} equals
++ \spad{reduce(+, map(x +-> monom(x.k, x.c), lt))}.
coefficients : % -> List R
@@ -28944,13 +28944,13 @@ FreeModuleCat(R, Basis):Category == Exports where
++ of \spad{x}.
leadingMonomial : % -> Basis
++ \spad{leadingMonomial(x)} returns the first element from
- ++ \spad{Basis} which appears in \spad{ListOfTerms(x)}.
+ ++ \spad{Basis} which appears in \spad{listOfTerms(x)}.
leadingCoefficient : % -> R
++ \spad{leadingCoefficient(x)} returns the first coefficient
- ++ which appears in \spad{ListOfTerms(x)}.
+ ++ which appears in \spad{listOfTerms(x)}.
leadingTerm : % -> TERM
++ \spad{leadingTerm(x)} returns the first term which
- ++ appears in \spad{ListOfTerms(x)}.
+ ++ appears in \spad{listOfTerms(x)}.
reductum : % -> %
++ \spad{reductum(x)} returns \spad{x} minus its leading term.
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index 30f0835..e99143e 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -37980,7 +37980,7 @@ FreeModule(R:Ring,S:OrderedSet):
\cross{FM1}{leadingCoefficient} &
\cross{FM1}{leadingMonomial} &
\cross{FM1}{leadingTerm} &
-\cross{FM1}{ListOfTerms} \\
+\cross{FM1}{listOfTerms} \\
\cross{FM1}{map} &
\cross{FM1}{monom} &
\cross{FM1}{monomial?} &
@@ -38044,7 +38044,7 @@ FreeModule1(R:Ring,S:OrderedSet): FMcat == FMdef where
numberOfMonomials p ==
# (p::Rep)
- ListOfTerms(x) == x:List TERM
+ listOfTerms(x) == x:List TERM
leadingTerm x == x.first
leadingMonomial x == x.first.k
@@ -52541,7 +52541,7 @@ o )show LieExponentials
\cross{LEXP}{inv} \\
\cross{LEXP}{latex} &
\cross{LEXP}{log} &
-\cross{LEXP}{ListOfTerms} &
+\cross{LEXP}{listOfTerms} &
\cross{LEXP}{LyndonBasis} \\
\cross{LEXP}{LyndonCoordinates} &
\cross{LEXP}{mirror} &
@@ -52605,8 +52605,8 @@ LieExponentials(VarSet, R, Order): XDPcat == XDPdef where
++ \axiom{exp(p)} returns the exponential of \axiom{p}.
log : $ -> LPOLY
++ \axiom{log(p)} returns the logarithm of \axiom{p}.
- ListOfTerms : $ -> LTERMS
- ++ \axiom{ListOfTerms(p)} returns the internal representation of \axiom{p}.
+ listOfTerms : $ -> LTERMS
+ ++ \axiom{listOfTerms(p)} returns the internal representation of \axiom{p}.
coerce : $ -> XDPOLY
++ \axiom{coerce(g)} returns the internal representation of \axiom{g}.
coerce : $ -> PBWPOLY
@@ -52664,7 +52664,7 @@ LieExponentials(VarSet, R, Order): XDPcat == XDPdef where
ident(l1, l2)
LyndonCoordinates x ==
- lt: List TERM1 := [[l::LWORD, t.c]$TERM1 for t in ListOfTerms x | _
+ lt: List TERM1 := [[l::LWORD, t.c]$TERM1 for t in listOfTerms x | _
(l := retractIfCan(t.k)$BASIS) case LWORD ]
lt := sort(compareTerm1s,lt)
@@ -52687,7 +52687,7 @@ LieExponentials(VarSet, R, Order): XDPcat == XDPdef where
inv x ==
x = 1 => 1
- lt:LTERMS := ListOfTerms mirror x
+ lt:LTERMS := listOfTerms mirror x
lt:= [[t.k, (odd? length(t.k)$BASIS => - t.c; t.c)]$TERM for t in lt ]
lt pretend $
@@ -53122,7 +53122,7 @@ o )show LiePolynomial
\cross{LPOLY}{leadingTerm} &
\cross{LPOLY}{LiePoly} &
\cross{LPOLY}{LiePolyIfCan} &
-\cross{LPOLY}{ListOfTerms} \\
+\cross{LPOLY}{listOfTerms} \\
\cross{LPOLY}{lquo} &
\cross{LPOLY}{map} &
\cross{LPOLY}{mirror} &
@@ -53330,7 +53330,7 @@ LiePolynomial(VarSet:OrderedSet, R:CommutativeRing) : Public == Private where
null p => 0
length( p.first.k)$LWORD
- -- ListOfTerms p == p pretend List TERM
+ -- listOfTerms p == p pretend List TERM
-- coerce(x) : EX ==
-- null x => (0$R) :: EX
@@ -77558,7 +77558,7 @@ Plot3D(): Exports == Implementation where
\cross{PBWLB}{hash} &
\cross{PBWLB}{latex} \\
\cross{PBWLB}{length} &
-\cross{PBWLB}{ListOfTerms} &
+\cross{PBWLB}{listOfTerms} &
\cross{PBWLB}{max} &
\cross{PBWLB}{min} &
\cross{PBWLB}{rest} \\
@@ -77614,8 +77614,8 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet): Public == Private where
++ \spad{first([l1]*[l2]*...[ln])} returns the Lyndon word \spad{l1}.
length : $ -> NNI
++ \spad{length([l1]*[l2]*...[ln])} returns the length of the word \spad{l1*l2*...*ln}.
- ListOfTerms : $ -> LWORDS
- ++ \spad{ListOfTerms([l1]*[l2]*...[ln])} returns the list of words \spad{l1, l2, .... ln}.
+ listOfTerms : $ -> LWORDS
+ ++ \spad{listOfTerms([l1]*[l2]*...[ln])} returns the list of words \spad{l1, l2, .... ln}.
rest : $ -> $
++ \spad{rest([l1]*[l2]*...[ln])} returns the list \spad{l2, .... ln}.
retractable? : $ -> Boolean
@@ -77646,7 +77646,7 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet): Public == Private where
coerce(v: VarSet):$ == [ v::LWORD ]
coerce(l: LWORD):$ == [l]
- ListOfTerms(x:$):LWORDS == x pretend LWORDS
+ listOfTerms(x:$):LWORDS == x pretend LWORDS
coerce(x:$):WORD ==
null x => 1
@@ -112442,7 +112442,7 @@ equivalent for the
\cross{XDPOLY}{hash} &
\cross{XDPOLY}{latex} \\
\cross{XDPOLY}{leadingCoefficient} &
-\cross{XDPOLY}{ListOfTerms} &
+\cross{XDPOLY}{listOfTerms} &
\cross{XDPOLY}{leadingMonomial} &
\cross{XDPOLY}{leadingTerm} \\
\cross{XDPOLY}{lquo} &
@@ -112752,7 +112752,7 @@ mirror pq
--E 18
--S 19 of 39
-ListOfTerms pq
+listOfTerms pq
--R
--R
--R (19) [[k= [b][a],c= 1],[k= [a b],c= 1]]
@@ -113177,7 +113177,7 @@ Check some polynomial operations
[b][a]
Type: XPBWPolynomial(Symbol,Fraction Integer)
- ListOfTerms pq
+ listOfTerms pq
[[k= [b][a],c= 1],[k= [a b],c= 1]]
Type: List Record(k: PoincareBirkhoffWittLyndonBasis Symbol,
c: Fraction Integer)
@@ -113454,7 +113454,7 @@ o )show XPBWPolynomial
\cross{XPBWPOLYL}{leadingMonomial} &
\cross{XPBWPOLYL}{leadingTerm} \\
\cross{XPBWPOLYL}{LiePolyIfCan} &
-\cross{XPBWPOLYL}{ListOfTerms} &
+\cross{XPBWPOLYL}{listOfTerms} &
\cross{XPBWPOLYL}{log} &
\cross{XPBWPOLYL}{lquo} \\
\cross{XPBWPOLYL}{map} &
@@ -113590,15 +113590,15 @@ XPBWPolynomial(VarSet:OrderedSet,R:CommutativeRing): XDPcat == XDPdef where
prod(g,d) ==
d = 1 => monom(g,1)
g = 1 => monom(d,1)
- process(reverse ListOfTerms g, first d, rest ListOfTerms d)
+ process(reverse listOfTerms g, first d, rest listOfTerms d)
Dexpand b ==
b = 1 => 1$XDPOLY
- */ [LiePoly(l)$LPOLY :: XDPOLY for l in ListOfTerms b]
+ */ [LiePoly(l)$LPOLY :: XDPOLY for l in listOfTerms b]
Rexpand b ==
b = 1 => 1$XRPOLY
- */ [LiePoly(l)$LPOLY :: XRPOLY for l in ListOfTerms b]
+ */ [LiePoly(l)$LPOLY :: XRPOLY for l in listOfTerms b]
mirror1(b:BASIS):$ ==
b = 1 => 1
@@ -113615,15 +113615,15 @@ XPBWPolynomial(VarSet:OrderedSet,R:CommutativeRing): XDPcat == XDPdef where
p: LPOLY := [first gauche , x] -- on crochete !!!
null droite =>
r1 := +/ [t.c * process(rest gauche, t.k, droite) for t in _
- ListOfTerms p]
+ listOfTerms p]
r2 := process( rest gauche, x, list first gauche)
r1 + r2
rd: List LWORD := rest droite; fd: LWORD := first droite
- r1 := +/ [t.c * process(list t.k, fd, rd) for t in ListOfTerms p]
- r1 := +/ [t.c * process(rest gauche, first t.k, rest ListOfTerms(t.k))_
+ r1 := +/ [t.c * process(list t.k, fd, rd) for t in listOfTerms p]
+ r1 := +/ [t.c * process(rest gauche, first t.k, rest listOfTerms(t.k))_
for t in r1]
r2 := process([first gauche, x], fd, rd)
- r2 := +/ [t.c * process(rest gauche, first t.k, rest ListOfTerms(t.k))_
+ r2 := +/ [t.c * process(rest gauche, first t.k, rest listOfTerms(t.k))_
for t in r2]
r1 + r2
@@ -113640,7 +113640,7 @@ XPBWPolynomial(VarSet:OrderedSet,R:CommutativeRing): XDPcat == XDPdef where
coerce(v: VarSet):$ == monom(v::BASIS , 1$R)
coerce(p: LPOLY):$ ==
- [[t.k :: BASIS , t.c ]$TERM for t in ListOfTerms p]
+ [[t.k :: BASIS , t.c ]$TERM for t in listOfTerms p]
coerce(p:$):XDPOLY ==
+/ [t.c * Dexpand t.k for t in p]
@@ -113665,7 +113665,7 @@ XPBWPolynomial(VarSet:OrderedSet,R:CommutativeRing): XDPcat == XDPdef where
y = 0$$ => 0
+/ [t.c * prod1(t.k, y) for t in x]
--- ListOfTerms p == p pretend LTERMS
+-- listOfTerms p == p pretend LTERMS
varList p ==
lv: List VarSet := "setUnion"/ [varList(b.k)$BASIS for b in p]
@@ -114467,7 +114467,7 @@ o )show XPolynomialRing
\cross{XPR}{leadingCoefficient} \\
\cross{XPR}{leadingMonomial} &
\cross{XPR}{leadingTerm} &
-\cross{XPR}{ListOfTerms} &
+\cross{XPR}{listOfTerms} &
\cross{XPR}{map} \\
\cross{XPR}{maxdeg} &
\cross{XPR}{mindeg} &
@@ -114793,14 +114793,14 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
rquo(p1:%, p2:%):% ==
p2 case R => p1 * p2::R
p1 case R => p1 * p2.c0
- x:REGPOLY := construct [[t.k, a]$TERM for t in ListOfTerms(p1.reg) _
+ x:REGPOLY := construct [[t.k, a]$TERM for t in listOfTerms(p1.reg) _
| (a:= rquo(t.c,p2)) ^= 0$% ]$LTERMS
simplifie [coef(p1,p2) , x]$VPOLY
trunc(p,n) ==
n = 0 or (p case R) => (constant p)::%
n1: NNI := (n-1)::NNI
- lt: LTERMS := [[t.k, r]$TERM for t in ListOfTerms p.reg _
+ lt: LTERMS := [[t.k, r]$TERM for t in listOfTerms p.reg _
| (r := trunc(t.c, n1)) ^= 0]$LTERMS
x: REGPOLY := construct lt
simplifie [constant p, x]$VPOLY
@@ -114818,25 +114818,25 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
p case R => (p::R)** n
n1: NNI := (n-1)::NNI
p1: % := n * sh(p, n1)
- lt: LTERMS := [[t.k, sh(t.c, p1)]$TERM for t in ListOfTerms p.reg]
+ lt: LTERMS := [[t.k, sh(t.c, p1)]$TERM for t in listOfTerms p.reg]
[p.c0 ** n, construct lt]$VPOLY
sh(p1:%, p2:%) ==
p1 case R => p1::R * p2
p2 case R => p1 * p2::R
- lt1:LTERMS := ListOfTerms p1.reg ; lt2:LTERMS := ListOfTerms p2.reg
+ lt1:LTERMS := listOfTerms p1.reg ; lt2:LTERMS := listOfTerms p2.reg
x: REGPOLY := construct [[t.k,sh(t.c,p2)]$TERM for t in lt1]
y: REGPOLY := construct [[t.k,sh(p1,t.c)]$TERM for t in lt2]
[p1.c0*p2.c0,x + y]$VPOLY
RemainderList p ==
p case R => []
- ListOfTerms( p.reg)$REGPOLY
+ listOfTerms( p.reg)$REGPOLY
lquo(p1:%,p2:%):% ==
p2 case R => p1 * p2
p1 case R => p1 *$R p2.c0
- p1 * p2.c0 +$% lquo1(ListOfTerms p1.reg, ListOfTerms p2.reg)
+ p1 * p2.c0 +$% lquo1(listOfTerms p1.reg, listOfTerms p2.reg)
lquo1(x:LTERMS,y:LTERMS):% ==
null x => 0$%
@@ -114849,7 +114849,7 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
coef(p1:%, p2:%):R ==
p1 case R => p1::R * constant p2
p2 case R => p1.c0 * p2::R
- p1.c0 * p2.c0 +$R coef1(ListOfTerms p1.reg, ListOfTerms p2.reg)
+ p1.c0 * p2.c0 +$R coef1(listOfTerms p1.reg, listOfTerms p2.reg)
coef1(x:LTERMS,y:LTERMS):R ==
null x => 0$R
@@ -114861,7 +114861,7 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
--------------------------------------------------------------
outForm(p:REGPOLY): EX ==
- le : List EX := [t.k::EX * t.c::EX for t in ListOfTerms p]
+ le : List EX := [t.k::EX * t.c::EX for t in listOfTerms p]
reduce(_+, reverse_! le)$List(EX)
coerce(p:$): EX ==
@@ -114891,7 +114891,7 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
expand p ==
p case R => p::R::XDPOLY
- lt:LTERMS := ListOfTerms(p.reg)
+ lt:LTERMS := listOfTerms(p.reg)
ep:XDPOLY := (p.c0)::XDPOLY
for t in lt repeat
ep:= ep + t.k * expand(t.c)
@@ -114953,7 +114953,7 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
rquo(p:%, v:VarSet):% ==
p case R => 0
- x:REGPOLY := construct [[t.k, a]$TERM for t in ListOfTerms(p.reg)
+ x:REGPOLY := construct [[t.k, a]$TERM for t in listOfTerms(p.reg)
| (a:= rquo(t.c,v)) ^= 0 ]
simplifie [constant(coefficient(p.reg,v)) , x]$VPOLY
@@ -114982,13 +114982,13 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
p = 0 => error "XRPOLY.mindeg: polynome nul !!"
1$WORD
p.c0 ^= 0 => 1$WORD
- "min"/[(t.k) *$WORD mindeg(t.c) for t in ListOfTerms p.reg]
+ "min"/[(t.k) *$WORD mindeg(t.c) for t in listOfTerms p.reg]
maxdeg p ==
p case R =>
p = 0 => error "XRPOLY.maxdeg: polynome nul !!"
1$WORD
- "max"/[(t.k) *$WORD maxdeg(t.c) for t in ListOfTerms p.reg]
+ "max"/[(t.k) *$WORD maxdeg(t.c) for t in listOfTerms p.reg]
degree p ==
p = 0 => error "XRPOLY.degree: polynome nul !!"
@@ -114996,14 +114996,14 @@ XRecursivePolynomial(VarSet:OrderedSet,R:Ring): Xcat == Xdef where
map(fn,p) ==
p case R => fn(p::R)
- x:REGPOLY := construct [[t.k,a]$TERM for t in ListOfTerms p.reg
+ x:REGPOLY := construct [[t.k,a]$TERM for t in listOfTerms p.reg
|(a := map(fn,t.c)) ^= 0$R]
simplifie [fn(p.c0),x]$VPOLY
varList p ==
p case R => []
- lv: List VarSet := "setUnion"/[varList(t.c) for t in ListOfTerms p.reg]
- lv:= setUnion(lv,[t.k for t in ListOfTerms p.reg])
+ lv: List VarSet := "setUnion"/[varList(t.c) for t in listOfTerms p.reg]
+ lv:= setUnion(lv,[t.k for t in listOfTerms p.reg])
sort_!(lv)
@
diff --git a/books/bookvol6.pamphlet b/books/bookvol6.pamphlet
index 11c966e..1dd988b 100644
--- a/books/bookvol6.pamphlet
+++ b/books/bookvol6.pamphlet
@@ -4486,7 +4486,7 @@ listexp
listLoops
listOfLists
listOfMonoms
-ListOfTerms
+listOfTerms
listRepresentation
lists
listYoungTableaus
diff --git a/books/bookvol7.1.pamphlet b/books/bookvol7.1.pamphlet
index ee0cf26..800b8cb 100644
--- a/books/bookvol7.1.pamphlet
+++ b/books/bookvol7.1.pamphlet
@@ -62231,7 +62231,7 @@ Check some polynomial operations
}
\xtc{
}{
-\spadpaste{ListOfTerms pq \free{pq}}
+\spadpaste{listOfTerms pq \free{pq}}
}
\xtc{
}{
@@ -62621,7 +62621,7 @@ Calculations with verification in \axiomType{XRecursivePolynomial}.
\begin{patch}{XPBWPolynomialXmpPagePatch19}
\begin{paste}{XPBWPolynomialXmpPageFull19}{XPBWPolynomialXmpPageEmpty19}
\pastebutton{XPBWPolynomialXmpPageFull19}{\hidepaste}
-\tab{5}\spadcommand{ListOfTerms pq\free{pq }}
+\tab{5}\spadcommand{listOfTerms pq\free{pq }}
\indentrel{3}\begin{verbatim}
(19) [[k= [b][a],c= 1],[k= [a b],c= 1]]
Type: List Record(k: PoincareBirkhoffWittLyndonBasis Symbol,c: Fraction Integer)
@@ -62631,7 +62631,7 @@ Type: List Record(k: PoincareBirkhoffWittLyndonBasis Symbol,c: Fraction Integer)
\begin{patch}{XPBWPolynomialXmpPageEmpty19}
\begin{paste}{XPBWPolynomialXmpPageEmpty19}{XPBWPolynomialXmpPagePatch19}
\pastebutton{XPBWPolynomialXmpPageEmpty19}{\showpaste}
-\tab{5}\spadcommand{ListOfTerms pq\free{pq }}
+\tab{5}\spadcommand{listOfTerms pq\free{pq }}
\end{paste}\end{patch}
\begin{patch}{XPBWPolynomialXmpPagePatch20}
diff --git a/changelog b/changelog
index 7fa390d..34ed227 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,11 @@
+20091103 tpd src/axiom-website/patches.html 20091103.01.tpd.patch
+20091103 tpd books/bookvol0 rename ListOfTerms to listOfTerms
+20091103 tpd books/bookvol10.2 rename ListOfTerms to listOfTerms
+20091103 tpd books/bookvol10.3 rename ListOfTerms to listOfTerms
+20091103 tpd books/bookvol6 rename ListOfTerms to listOfTerms
+20091103 tpd books/bookvol7.1 rename ListOfTerms to listOfTerms
+20091103 tpd src/share/algebra/command.list rename ListOfTerms to listOfTerms
+20091103 tpd src/share/algebra/compress.daase rename ListOfTerms to listOfTerms
20091101 tpd src/axiom-website/patches.html 20091101.01.tpd.patch
20091101 tpd src/input/Makefile add solveperf.input
20091101 tpd src/input/solveperf.input added
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 0a9fc35..6e1ff46 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -2215,5 +2215,7 @@ books/bookvol10.2 AlgebraicallyClosedField input, help, examples
books/bookvol10.4 RadicalSolvePackage input, help, examples
20091101.01.tpd.patch
src/input/solveperf.input added
+20091103.01.tpd.patch
+rename ListOfTerms to listOfTerms