aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--src/ChangeLog16
-rw-r--r--src/algebra/aggcat2.spad.pamphlet6
-rw-r--r--src/algebra/algcat.spad.pamphlet2
-rw-r--r--src/algebra/cden.spad.pamphlet4
-rw-r--r--src/algebra/clifford.spad.pamphlet2
-rw-r--r--src/algebra/divisor.spad.pamphlet4
-rw-r--r--src/algebra/galfact.spad.pamphlet4
-rw-r--r--src/algebra/lodof.spad.pamphlet2
-rw-r--r--src/algebra/naalgc.spad.pamphlet4
-rw-r--r--src/algebra/oderf.spad.pamphlet2
-rw-r--r--src/algebra/rule.spad.pamphlet2
-rw-r--r--src/algebra/space.spad.pamphlet2
-rw-r--r--src/algebra/view3D.spad.pamphlet2
-rw-r--r--src/algebra/zerodim.spad.pamphlet16
14 files changed, 42 insertions, 26 deletions
diff --git a/src/ChangeLog b/src/ChangeLog
index 510a5291..28679c63 100644
--- a/src/ChangeLog
+++ b/src/ChangeLog
@@ -1,5 +1,21 @@
2013-05-18 Gabriel Dos Reis <gdr@integrable-solutions.net>
+ * algebra/aggcat2.spad.pamphlet: Use members, not parts.
+ * algebra/algcat.spad.pamphlet: Likewise.
+ * algebra/cden.spad.pamphlet: Likewise.
+ * algebra/clifford.spad.pamphlet: Likewise.
+ * algebra/divisor.spad.pamphlet: Likewise.
+ * algebra/galfact.spad.pamphlet: Likewise.
+ * algebra/lodof.spad.pamphlet: Likewise.
+ * algebra/naalgc.spad.pamphlet: Likewise.
+ * algebra/oderf.spad.pamphlet: Likewise.
+ * algebra/rule.spad.pamphlet: Likewise.
+ * algebra/space.spad.pamphlet: Likewise.
+ * algebra/view3D.spad.pamphlet: Likewise.
+ * algebra/zerodim.spad.pamphlet: Likewise.
+
+2013-05-18 Gabriel Dos Reis <gdr@integrable-solutions.net>
+
* algebra/array1.spad.pamphlet: Define members, not parts.
* algebra/array2.spad.pamphlet: Likewise.
* algebra/bags.spad.pamphlet: Likewise.
diff --git a/src/algebra/aggcat2.spad.pamphlet b/src/algebra/aggcat2.spad.pamphlet
index 0bfd05b6..816a467c 100644
--- a/src/algebra/aggcat2.spad.pamphlet
+++ b/src/algebra/aggcat2.spad.pamphlet
@@ -182,11 +182,11 @@ FiniteSetAggregateFunctions2(S, A, R, B): Exports == Implementation where
Implementation ==> add
map(fn, a) ==
- set(map(fn, parts a)$ListFunctions2(S, R))$B
+ set(map(fn, members a)$ListFunctions2(S, R))$B
reduce(fn, a, ident) ==
- reduce(fn, parts a, ident)$ListFunctions2(S, R)
+ reduce(fn, members a, ident)$ListFunctions2(S, R)
scan(fn, a, ident) ==
- set(scan(fn, parts a, ident)$ListFunctions2(S, R))$B
+ set(scan(fn, members a, ident)$ListFunctions2(S, R))$B
@
\section{License}
diff --git a/src/algebra/algcat.spad.pamphlet b/src/algebra/algcat.spad.pamphlet
index 27fdf00a..d6888213 100644
--- a/src/algebra/algcat.spad.pamphlet
+++ b/src/algebra/algcat.spad.pamphlet
@@ -92,7 +92,7 @@ FiniteRankAlgebra(R:CommutativeRing, UP:UnivariatePolynomialCategory R):
regularRepresentation(x, b) ==
m := minIndex b - 1
matrix
- [parts coordinates(x*b(i+m),b) for i in 1..rank()]$List(List R)
+ [members coordinates(x*b(i+m),b) for i in 1..rank()]$List(List R)
@
diff --git a/src/algebra/cden.spad.pamphlet b/src/algebra/cden.spad.pamphlet
index 0e7240cc..849d4c4c 100644
--- a/src/algebra/cden.spad.pamphlet
+++ b/src/algebra/cden.spad.pamphlet
@@ -185,9 +185,9 @@ MatrixCommonDenominator(R, Q): Exports == Implementation where
[map(numer(d * #1), m), d]
if R has GcdDomain then
- commonDenominator m == lcm map(denom, parts m)
+ commonDenominator m == lcm map(denom, members m)
else
- commonDenominator m == reduce("*",map(denom, parts m),1)$List(R)
+ commonDenominator m == reduce("*",map(denom, members m),1)$List(R)
@
\section{License}
diff --git a/src/algebra/clifford.spad.pamphlet b/src/algebra/clifford.spad.pamphlet
index ab4c481e..dd7a0826 100644
--- a/src/algebra/clifford.spad.pamphlet
+++ b/src/algebra/clifford.spad.pamphlet
@@ -418,7 +418,7 @@ CliffordAlgebra(n, K, Q): T == Impl where
ans := particularSolution(matrix(lhsEqs),
vector(rhsEqs))$LinearSystemMatrixPackage(K, Vector K, Vector K, Matrix K)
ans case "failed" => "failed"
- ansP := parts(ans)
+ ansP := members(ans)
ansC:% := 0
for pj in Pn repeat
cj:= first ansP
diff --git a/src/algebra/divisor.spad.pamphlet b/src/algebra/divisor.spad.pamphlet
index 888ff89e..f8c15f86 100644
--- a/src/algebra/divisor.spad.pamphlet
+++ b/src/algebra/divisor.spad.pamphlet
@@ -101,7 +101,7 @@ FractionalIdeal(R, F, UP, A): Exports == Implementation where
cd := splitDenominator(denom(i)::F::UP::QF * m)
cd2 := splitDenominator coefficients(cd.den)
invd:= cd2.den / reduce("gcd", cd2.num)
- d := reduce("max", [degree p for p in parts(cd.num)])
+ d := reduce("max", [degree p for p in members(cd.num)])
ideal
[invd * invrep map(coefficient(#1, j), cd.num) for j in 0..d]$VA
@@ -285,7 +285,7 @@ ModularHermitianRowReduction(R): Exports == Implementation where
-- returns a matrix made from the non-zero rows of x whose row number
-- is not in l
mkMat(x, l) ==
- empty?(ll := [parts row(x, i)
+ empty?(ll := [members row(x, i)
for i in minRowIndex x .. maxRowIndex x |
(not member?(i, l)) and nonzero? row(x, i)]$List(List R)) =>
zero(1, ncols x)
diff --git a/src/algebra/galfact.spad.pamphlet b/src/algebra/galfact.spad.pamphlet
index edce7558..e9b111a2 100644
--- a/src/algebra/galfact.spad.pamphlet
+++ b/src/algebra/galfact.spad.pamphlet
@@ -274,7 +274,7 @@ GaloisGroupFactorizer(UP): Exports == Implementation where
n
-- local function, returns the a Set of shifted elements
- shiftSet(s:Set N,shift:N):Set N == set [ e+shift for e in parts s ]
+ shiftSet(s:Set N,shift:N):Set N == set [ e+shift for e in members s ]
-- local function, returns the "reductum" of an Integer (as chain of bits)
reductum(n:Z):Z == n-shift(1,length(n)-1)
@@ -484,7 +484,7 @@ GaloisGroupFactorizer(UP): Exports == Implementation where
-- local function, returns the set of elements "divided" by an integer
divideSet(s:Set N, n:N):Set N ==
l: List N := [ 0 ]
- for e in parts s repeat
+ for e in members s repeat
if (ee := (e exquo n)$N) case N then l := cons(ee::N,l)
set(l)
diff --git a/src/algebra/lodof.spad.pamphlet b/src/algebra/lodof.spad.pamphlet
index 1e102220..dd3d6209 100644
--- a/src/algebra/lodof.spad.pamphlet
+++ b/src/algebra/lodof.spad.pamphlet
@@ -289,7 +289,7 @@ AssociatedEquations(R, L):Exports == Implementation where
diff:L := D()
- makeMatrix(v, n) == matrix [parts row(v.i, n) for i in 1..#v]
+ makeMatrix(v, n) == matrix [members row(v.i, n) for i in 1..#v]
associatedSystem(op, m) ==
eq: Vector R
diff --git a/src/algebra/naalgc.spad.pamphlet b/src/algebra/naalgc.spad.pamphlet
index ce4b81ef..f5b56a47 100644
--- a/src/algebra/naalgc.spad.pamphlet
+++ b/src/algebra/naalgc.spad.pamphlet
@@ -882,12 +882,12 @@ FiniteRankNonAssociativeAlgebra(R:CommutativeRing):
leftRegularRepresentation(x, b) ==
m := minIndex b - 1
matrix
- [parts coordinates(x*b(i+m),b) for i in 1..rank()]$List(List R)
+ [members coordinates(x*b(i+m),b) for i in 1..rank()]$List(List R)
rightRegularRepresentation(x, b) ==
m := minIndex b - 1
matrix
- [parts coordinates(b(i+m)*x,b) for i in 1..rank()]$List(List R)
+ [members coordinates(b(i+m)*x,b) for i in 1..rank()]$List(List R)
@
\section{category FRNAALG FramedNonAssociativeAlgebra}
diff --git a/src/algebra/oderf.spad.pamphlet b/src/algebra/oderf.spad.pamphlet
index 45decdf3..d6c3c0dc 100644
--- a/src/algebra/oderf.spad.pamphlet
+++ b/src/algebra/oderf.spad.pamphlet
@@ -517,7 +517,7 @@ RationalLODE(F, UP): Exports == Implementation where
unitlist(i, q) ==
v := new(q, 0)$Vector(F)
v.i := 1
- parts v
+ members v
candidates(op, lg, d) ==
n := degree d + infBound(op, lg)
diff --git a/src/algebra/rule.spad.pamphlet b/src/algebra/rule.spad.pamphlet
index 6c56bca9..2e9307a3 100644
--- a/src/algebra/rule.spad.pamphlet
+++ b/src/algebra/rule.spad.pamphlet
@@ -300,7 +300,7 @@ Ruleset(Base, R, F): Exports == Implementation where
x = y == x =$Rep y
elt(x:$, f:F) == applyRules(rules x, f)
elt(r:$, s:F, n:PositiveInteger) == applyRules(rules r, s, n)
- rules x == parts(x)$Rep
+ rules x == members(x)$Rep
@
\section{License}
diff --git a/src/algebra/space.spad.pamphlet b/src/algebra/space.spad.pamphlet
index 60d4a13e..23d46039 100644
--- a/src/algebra/space.spad.pamphlet
+++ b/src/algebra/space.spad.pamphlet
@@ -526,7 +526,7 @@ ThreeSpace(R:Ring):Exports == Implementation where
for eachCurve in kid repeat
insert!(#children eachCurve,whatSizes)
#whatSizes > 1 => error "Mesh defined with curves of different sizes"
- first parts whatSizes < 2 =>
+ first members whatSizes < 2 =>
error "Mesh defined with single point curves (use curve())"
true
false
diff --git a/src/algebra/view3D.spad.pamphlet b/src/algebra/view3D.spad.pamphlet
index 9d8daed2..4f78a67a 100644
--- a/src/algebra/view3D.spad.pamphlet
+++ b/src/algebra/view3D.spad.pamphlet
@@ -504,7 +504,7 @@ ThreeDimensionalViewport(): Exports == Implementation where
for pt in lpts repeat
insert!(dimension pt,s)
#s > 1 => error "All points should have the same dimension"
- (n := first parts s) < 3 => error "Dimension of points should be greater than 2"
+ (n := first members s) < 3 => error "Dimension of points should be greater than 2"
sendI(VIEW,viewport.fun)$Lisp
sendI(VIEW,makeVIEW3D)$Lisp
sendSTR(VIEW,viewport.title)$Lisp
diff --git a/src/algebra/zerodim.spad.pamphlet b/src/algebra/zerodim.spad.pamphlet
index 21ee0bcc..226e65c1 100644
--- a/src/algebra/zerodim.spad.pamphlet
+++ b/src/algebra/zerodim.spad.pamphlet
@@ -438,7 +438,7 @@ InternalRationalUnivariateRepresentationPackage(R,E,V,P,TS): Exports == Implemen
z := mvar(f0)
ts := collectUpper(ts,z)
dts: N := degree(ts)
- lp := parts(ts)
+ lp := members(ts)
dlts: N := 0
for us in lts repeat
dlts := dlts + degree(us)
@@ -458,7 +458,7 @@ InternalRationalUnivariateRepresentationPackage(R,E,V,P,TS): Exports == Implemen
prepareRur(ts: TS): List LPWT ==
not purelyAlgebraic?(ts)$TS =>
error "rur$IRURPK: #1 is not zero-dimensional"
- lp: LP := parts(ts)$TS
+ lp: LP := members(ts)$TS
lp := sort(infRittWu?,lp)
empty? lp =>
error "rur$IRURPK: #1 is empty"
@@ -484,7 +484,7 @@ InternalRationalUnivariateRepresentationPackage(R,E,V,P,TS): Exports == Implemen
--ASSUME c and a have main degree 1
--ASSUME c and s have a constant initial
--ASSUME mvar(ts) < mvar(s)
- lp: LP := parts(ts)
+ lp: LP := members(ts)
lp := sort(infRittWu?,lp)
newts: TS := convert(r,true)@TS
s := remainder(s,newts).polnum
@@ -697,7 +697,7 @@ RationalUnivariateRepresentationPackage(R,ls): Exports == Implementation where
error "rur$RURPACK: bad result with function rur$IRURPK"
for us in lus repeat
g: U := univariate(select(us,newv)::Q)$Q
- lc: LP := [convert(q)@P for q in parts(collectUpper(us,newv))]
+ lc: LP := [convert(q)@P for q in members(collectUpper(us,newv))]
toReturn := cons([g,lc]$RUR, toReturn)
toReturn
@@ -914,7 +914,7 @@ ZeroDimensionalSolvePackage(R,ls,ls2): Exports == Implementation where
squareFree(ts:TS):List(ST) ==
irred?: Boolean := false
st: ST := [[newq]$(List Q2)]
- lq: List(Q2) := [convert(p)@Q2 for p in parts(ts)]
+ lq: List(Q2) := [convert(p)@Q2 for p in members(ts)]
lq := sort(infRittWu?,lq)
toSee: List LQ2WT := []
if irred?
@@ -973,7 +973,7 @@ ZeroDimensionalSolvePackage(R,ls,ls2): Exports == Implementation where
convert(p)@PRC
convert(sts:ST): List Q2 ==
- lq2: List(Q2) := parts(sts)$ST
+ lq2: List(Q2) := members(sts)$ST
lq2 := sort(infRittWu?,lq2)
rest(lq2)
@@ -1128,7 +1128,7 @@ ZeroDimensionalSolvePackage(R,ls,ls2): Exports == Implementation where
lus: List ST := rur(st,true)$rurpack
for us in lus repeat
g: U := univariate(select(us,newv)::Q2)$Q2
- lc: LP := [convert(q2)@P for q2 in parts(collectUpper(us,newv)$ST)$ST]
+ lc: LP := [convert(q2)@P for q2 in members(collectUpper(us,newv)$ST)$ST]
toSave := cons([g,lc]$RUR, toSave)
toSave
@@ -1160,7 +1160,7 @@ ZeroDimensionalSolvePackage(R,ls,ls2): Exports == Implementation where
output(us::OutputForm)$OutputPackage
error "univariateSolve$ZDSOLVE: bad RUR"
g: U := univariate(select(us,newv)::Q2)$Q2
- lc: LP := [convert(q2)@P for q2 in parts(collectUpper(us,newv)$ST)$ST]
+ lc: LP := [convert(q2)@P for q2 in members(collectUpper(us,newv)$ST)$ST]
toSave := cons([g,lc]$RUR, toSave)
toSave
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-23 07:42:45 +0000