[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Axiom-developer] 20090116.03.tpd.patch (bookvol10.3 add exports)
|
From: |
daly |
|
Subject: |
[Axiom-developer] 20090116.03.tpd.patch (bookvol10.3 add exports) |
|
Date: |
Sat, 17 Jan 2009 03:11:45 -0600 |
Add Exports for chapter J thru chapter P
=========================================================
diff --git a/books/bookvol10.3.pamphlet b/books/bookvol10.3.pamphlet
index e09ee90..8b136ee 100644
--- a/books/bookvol10.3.pamphlet
+++ b/books/bookvol10.3.pamphlet
@@ -53969,6 +53969,147 @@ LyndonWord(VarSet:OrderedSet):Public == Private where
{\bf See}\\
\pageto{MachineInteger}{MINT}
\pageto{MachineFloat}{MFLOAT}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{MCMPLX}{0} &
+\cross{MCMPLX}{1} \\
+\cross{MCMPLX}{abs} &
+\cross{MCMPLX}{acos} \\
+\cross{MCMPLX}{acosh} &
+\cross{MCMPLX}{acot} \\
+\cross{MCMPLX}{acoth} &
+\cross{MCMPLX}{acsc} \\
+\cross{MCMPLX}{acsch} &
+\cross{MCMPLX}{argument} \\
+\cross{MCMPLX}{asec} &
+\cross{MCMPLX}{asech} \\
+\cross{MCMPLX}{asin} &
+\cross{MCMPLX}{asinh} \\
+\cross{MCMPLX}{associates?} &
+\cross{MCMPLX}{atan} \\
+\cross{MCMPLX}{atanh} &
+\cross{MCMPLX}{basis} \\
+\cross{MCMPLX}{characteristic} &
+\cross{MCMPLX}{characteristicPolynomial} \\
+\cross{MCMPLX}{charthRoot} &
+\cross{MCMPLX}{coerce} \\
+\cross{MCMPLX}{complex} &
+\cross{MCMPLX}{conditionP} \\
+\cross{MCMPLX}{conjugate} &
+\cross{MCMPLX}{convert} \\
+\cross{MCMPLX}{coordinates} &
+\cross{MCMPLX}{cos} \\
+\cross{MCMPLX}{cosh} &
+\cross{MCMPLX}{cot} \\
+\cross{MCMPLX}{coth} &
+\cross{MCMPLX}{createPrimitiveElement} \\
+\cross{MCMPLX}{csc} &
+\cross{MCMPLX}{csch} \\
+\cross{MCMPLX}{D} &
+\cross{MCMPLX}{definingPolynomial} \\
+\cross{MCMPLX}{derivationCoordinates} &
+\cross{MCMPLX}{differentiate} \\
+\cross{MCMPLX}{discreteLog} &
+\cross{MCMPLX}{discriminant} \\
+\cross{MCMPLX}{divide} &
+\cross{MCMPLX}{euclideanSize} \\
+\cross{MCMPLX}{eval} &
+\cross{MCMPLX}{exp} \\
+\cross{MCMPLX}{expressIdealMember} &
+\cross{MCMPLX}{exquo} \\
+\cross{MCMPLX}{extendedEuclidean} &
+\cross{MCMPLX}{factor} \\
+\cross{MCMPLX}{factorPolynomial} &
+\cross{MCMPLX}{factorSquareFreePolynomial} \\
+\cross{MCMPLX}{factorsOfCyclicGroupSize} &
+\cross{MCMPLX}{gcd} \\
+\cross{MCMPLX}{gcdPolynomial} &
+\cross{MCMPLX}{generator} \\
+\cross{MCMPLX}{hash} &
+\cross{MCMPLX}{imag} \\
+\cross{MCMPLX}{imaginary} &
+\cross{MCMPLX}{index} \\
+\cross{MCMPLX}{init} &
+\cross{MCMPLX}{inv} \\
+\cross{MCMPLX}{latex} &
+\cross{MCMPLX}{lcm} \\
+\cross{MCMPLX}{lift} &
+\cross{MCMPLX}{log} \\
+\cross{MCMPLX}{lookup} &
+\cross{MCMPLX}{map} \\
+\cross{MCMPLX}{max} &
+\cross{MCMPLX}{min} \\
+\cross{MCMPLX}{minimalPolynomial} &
+\cross{MCMPLX}{multiEuclidean} \\
+\cross{MCMPLX}{nextItem} &
+\cross{MCMPLX}{norm} \\
+\cross{MCMPLX}{nthRoot} &
+\cross{MCMPLX}{one?} \\
+\cross{MCMPLX}{order} &
+\cross{MCMPLX}{patternMatch} \\
+\cross{MCMPLX}{pi} &
+\cross{MCMPLX}{polarCoordinates} \\
+\cross{MCMPLX}{prime?} &
+\cross{MCMPLX}{primeFrobenius} \\
+\cross{MCMPLX}{primitive?} &
+\cross{MCMPLX}{primitiveElement} \\
+\cross{MCMPLX}{principalIdeal} &
+\cross{MCMPLX}{random} \\
+\cross{MCMPLX}{rank} &
+\cross{MCMPLX}{rational} \\
+\cross{MCMPLX}{rational?} &
+\cross{MCMPLX}{rationalIfCan} \\
+\cross{MCMPLX}{real} &
+\cross{MCMPLX}{recip} \\
+\cross{MCMPLX}{reduce} &
+\cross{MCMPLX}{reducedSystem} \\
+\cross{MCMPLX}{regularRepresentation} &
+\cross{MCMPLX}{representationType} \\
+\cross{MCMPLX}{represents} &
+\cross{MCMPLX}{retract} \\
+\cross{MCMPLX}{retractIfCan} &
+\cross{MCMPLX}{sample} \\
+\cross{MCMPLX}{sec} &
+\cross{MCMPLX}{sech} \\
+\cross{MCMPLX}{sin} &
+\cross{MCMPLX}{sinh} \\
+\cross{MCMPLX}{size} &
+\cross{MCMPLX}{sizeLess?} \\
+\cross{MCMPLX}{solveLinearPolynomialEquation} &
+\cross{MCMPLX}{sqrt} \\
+\cross{MCMPLX}{squareFree} &
+\cross{MCMPLX}{squareFreePart} \\
+\cross{MCMPLX}{squareFreePolynomial} &
+\cross{MCMPLX}{subtractIfCan} \\
+\cross{MCMPLX}{tableForDiscreteLogarithm} &
+\cross{MCMPLX}{tan} \\
+\cross{MCMPLX}{tanh} &
+\cross{MCMPLX}{trace} \\
+\cross{MCMPLX}{traceMatrix} &
+\cross{MCMPLX}{traceMatrix} \\
+\cross{MCMPLX}{unit?} &
+\cross{MCMPLX}{unitCanonical} \\
+\cross{MCMPLX}{unitNormal} &
+\cross{MCMPLX}{zero?} \\
+\cross{MCMPLX}{?*?} &
+\cross{MCMPLX}{?**?} \\
+\cross{MCMPLX}{?+?} &
+\cross{MCMPLX}{?-?} \\
+\cross{MCMPLX}{-?} &
+\cross{MCMPLX}{?$<$?} \\
+\cross{MCMPLX}{?$<=$?} &
+\cross{MCMPLX}{?=?} \\
+\cross{MCMPLX}{?$>$?} &
+\cross{MCMPLX}{?$>=$?} \\
+\cross{MCMPLX}{?\^{}?} &
+\cross{MCMPLX}{?\~{}=?} \\
+\cross{MCMPLX}{?/?} &
+\cross{MCMPLX}{?.?} \\
+\cross{MCMPLX}{?quo?} &
+\cross{MCMPLX}{?rem?}
+\end{tabular}
+
<<domain MCMPLX MachineComplex>>=
)abbrev domain MCMPLX MachineComplex
++ Date Created: December 1993
@@ -54029,6 +54170,89 @@ MachineComplex():Exports == Implementation where
{\bf See}\\
\pageto{MachineInteger}{MINT}
\pageto{MachineComplex}{MCMPLX}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MFLOAT}{1} &
+\cross{MFLOAT}{0} &
+\cross{MFLOAT}{abs} &
+\cross{MFLOAT}{associates?} \\
+\cross{MFLOAT}{base} &
+\cross{MFLOAT}{bits} &
+\cross{MFLOAT}{ceiling} &
+\cross{MFLOAT}{coerce} \\
+\cross{MFLOAT}{changeBase} &
+\cross{MFLOAT}{characteristic} &
+\cross{MFLOAT}{convert} &
+\cross{MFLOAT}{decreasePrecision} \\
+\cross{MFLOAT}{digits} &
+\cross{MFLOAT}{exponent} &
+\cross{MFLOAT}{divide} &
+\cross{MFLOAT}{euclideanSize} \\
+\cross{MFLOAT}{expressIdealMember} &
+\cross{MFLOAT}{exquo} &
+\cross{MFLOAT}{extendedEuclidean} &
+\cross{MFLOAT}{factor} \\
+\cross{MFLOAT}{float} &
+\cross{MFLOAT}{floor} &
+\cross{MFLOAT}{fractionPart} &
+\cross{MFLOAT}{gcd} \\
+\cross{MFLOAT}{gcdPolynomial} &
+\cross{MFLOAT}{hash} &
+\cross{MFLOAT}{increasePrecision} &
+\cross{MFLOAT}{inv} \\
+\cross{MFLOAT}{latex} &
+\cross{MFLOAT}{lcm} &
+\cross{MFLOAT}{mantissa} &
+\cross{MFLOAT}{max} \\
+\cross{MFLOAT}{maximumExponent} &
+\cross{MFLOAT}{min} &
+\cross{MFLOAT}{minimumExponent} &
+\cross{MFLOAT}{multiEuclidean} \\
+\cross{MFLOAT}{negative?} &
+\cross{MFLOAT}{norm} &
+\cross{MFLOAT}{nthRoot} &
+\cross{MFLOAT}{one?} \\
+\cross{MFLOAT}{order} &
+\cross{MFLOAT}{patternMatch} &
+\cross{MFLOAT}{positive?} &
+\cross{MFLOAT}{precision} \\
+\cross{MFLOAT}{prime?} &
+\cross{MFLOAT}{principalIdeal} &
+\cross{MFLOAT}{recip} &
+\cross{MFLOAT}{retract} \\
+\cross{MFLOAT}{retractIfCan} &
+\cross{MFLOAT}{round} &
+\cross{MFLOAT}{sample} &
+\cross{MFLOAT}{sign} \\
+\cross{MFLOAT}{sizeLess?} &
+\cross{MFLOAT}{sqrt} &
+\cross{MFLOAT}{squareFree} &
+\cross{MFLOAT}{squareFreePart} \\
+\cross{MFLOAT}{subtractIfCan} &
+\cross{MFLOAT}{truncate} &
+\cross{MFLOAT}{unit?} &
+\cross{MFLOAT}{unitCanonical} \\
+\cross{MFLOAT}{unitNormal} &
+\cross{MFLOAT}{wholePart} &
+\cross{MFLOAT}{zero?} &
+\cross{MFLOAT}{?*?} \\
+\cross{MFLOAT}{?**?} &
+\cross{MFLOAT}{?+?} &
+\cross{MFLOAT}{?-?} &
+\cross{MFLOAT}{-?} \\
+\cross{MFLOAT}{?/?} &
+\cross{MFLOAT}{?$<$?} &
+\cross{MFLOAT}{?$<=$?} &
+\cross{MFLOAT}{?=?} \\
+\cross{MFLOAT}{?$>$?} &
+\cross{MFLOAT}{?$>=$?} &
+\cross{MFLOAT}{?\~{}=?} &
+\cross{MFLOAT}{?\^{}?} \\
+\cross{MFLOAT}{?quo?} &
+\cross{MFLOAT}{?rem?} &&
+\end{tabular}
+
<<domain MFLOAT MachineFloat>>=
)abbrev domain MFLOAT MachineFloat
++ Author: Mike Dewar
@@ -54344,6 +54568,95 @@ MachineFloat(): Exports == Implementation where
{\bf See}\\
\pageto{MachineFloat}{MFLOAT}
\pageto{MachineComplex}{MCMPLX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MINT}{0} &
+\cross{MINT}{1} &
+\cross{MINT}{abs} &
+\cross{MINT}{addmod} &
+\cross{MINT}{associates?} \\
+\cross{MINT}{base} &
+\cross{MINT}{binomial} &
+\cross{MINT}{bit?} &
+\cross{MINT}{characteristic} &
+\cross{MINT}{coerce} \\
+\cross{MINT}{convert} &
+\cross{MINT}{copy} &
+\cross{MINT}{D} &
+\cross{MINT}{dec} &
+\cross{MINT}{differentiate} \\
+\cross{MINT}{divide} &
+\cross{MINT}{euclideanSize} &
+\cross{MINT}{even?} &
+\cross{MINT}{expressIdealMember} &
+\cross{MINT}{exquo} \\
+\cross{MINT}{extendedEuclidean} &
+\cross{MINT}{factor} &
+\cross{MINT}{factorial} &
+\cross{MINT}{gcd} &
+\cross{MINT}{gcdPolynomial} \\
+\cross{MINT}{hash} &
+\cross{MINT}{inc} &
+\cross{MINT}{init} &
+\cross{MINT}{invmod} &
+\cross{MINT}{latex} \\
+\cross{MINT}{lcm} &
+\cross{MINT}{length} &
+\cross{MINT}{mask} &
+\cross{MINT}{max} &
+\cross{MINT}{maxint} \\
+\cross{MINT}{min} &
+\cross{MINT}{mulmod} &
+\cross{MINT}{multiEuclidean} &
+\cross{MINT}{negative?} &
+\cross{MINT}{nextItem} \\
+\cross{MINT}{odd?} &
+\cross{MINT}{one?} &
+\cross{MINT}{patternMatch} &
+\cross{MINT}{permutation} &
+\cross{MINT}{positive?} \\
+\cross{MINT}{positiveRemainder} &
+\cross{MINT}{powmod} &
+\cross{MINT}{prime?} &
+\cross{MINT}{principalIdeal} &
+\cross{MINT}{random} \\
+\cross{MINT}{rational} &
+\cross{MINT}{rationalIfCan} &
+\cross{MINT}{rational?} &
+\cross{MINT}{recip} &
+\cross{MINT}{reducedSystem} \\
+\cross{MINT}{retract} &
+\cross{MINT}{retractIfCan} &
+\cross{MINT}{sample} &
+\cross{MINT}{shift} &
+\cross{MINT}{sign} \\
+\cross{MINT}{sizeLess?} &
+\cross{MINT}{squareFree} &
+\cross{MINT}{squareFreePart} &
+\cross{MINT}{submod} &
+\cross{MINT}{subtractIfCan} \\
+\cross{MINT}{symmetricRemainder} &
+\cross{MINT}{unit?} &
+\cross{MINT}{unitCanonical} &
+\cross{MINT}{unitNormal} &
+\cross{MINT}{zero?} \\
+\cross{MINT}{?\~{}=?} &
+\cross{MINT}{?*?} &
+\cross{MINT}{?**?} &
+\cross{MINT}{?\^{}?} &
+\cross{MINT}{?+?} \\
+\cross{MINT}{?-?} &
+\cross{MINT}{-?} &
+\cross{MINT}{?$<$?} &
+\cross{MINT}{?$<=$?} &
+\cross{MINT}{?=?} \\
+\cross{MINT}{?$>$?} &
+\cross{MINT}{?$>=$?} &
+\cross{MINT}{?quo?} &
+\cross{MINT}{?rem?} &
+\end{tabular}
+
<<domain MINT MachineInteger>>=
)abbrev domain MINT MachineInteger
++ Author: Mike Dewar
@@ -54704,6 +55017,34 @@ o )show Magma
@
\pagehead{Magma}{MAGMA}
\pagepic{ps/v103magma.ps}{MAGMA}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MAGMA}{coerce} &
+\cross{MAGMA}{first} &
+\cross{MAGMA}{hash} &
+\cross{MAGMA}{latex} &
+\cross{MAGMA}{left} \\
+\cross{MAGMA}{length} &
+\cross{MAGMA}{lexico} &
+\cross{MAGMA}{max} &
+\cross{MAGMA}{min} &
+\cross{MAGMA}{mirror} \\
+\cross{MAGMA}{rest} &
+\cross{MAGMA}{retract} &
+\cross{MAGMA}{retractIfCan} &
+\cross{MAGMA}{retractable?} &
+\cross{MAGMA}{right} \\
+\cross{MAGMA}{varList} &
+\cross{MAGMA}{?\~{}=?} &
+\cross{MAGMA}{?*?} &
+\cross{MAGMA}{?$<$?} &
+\cross{MAGMA}{?$<=$?} \\
+\cross{MAGMA}{?=?} &
+\cross{MAGMA}{?$>$?} &
+\cross{MAGMA}{?$>=$?} &&
+\end{tabular}
+
<<domain MAGMA Magma>>=
)abbrev domain MAGMA Magma
++ Author: Michel Petitot (address@hidden).
@@ -54860,6 +55201,24 @@ Magma(VarSet:OrderedSet):Public == Private where
\pagepic{ps/v103makecachableset.ps}{MKCHSET}{1.00}
{\bf See}\\
\pageto{Kernel}{KERNEL}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{MKCHSET}{coerce} &
+\cross{MKCHSET}{hash} &
+\cross{MKCHSET}{latex} &
+\cross{MKCHSET}{max} &
+\cross{MKCHSET}{min} &
+\cross{MKCHSET}{position} \\
+\cross{MKCHSET}{setPosition} &
+\cross{MKCHSET}{?\~{}=?} &
+\cross{MKCHSET}{?$<$?} &
+\cross{MKCHSET}{?$<=$?} &
+\cross{MKCHSET}{?=?} &
+\cross{MKCHSET}{?$>$?} \\
+\cross{MKCHSET}{?$>=$?} &&&&&
+\end{tabular}
+
<<domain MKCHSET MakeCachableSet>>=
)abbrev domain MKCHSET MakeCachableSet
++ Make a cachable set from any set
@@ -55822,6 +56181,83 @@ o )show Matrix
\pageto{IndexedMatrix}{IMATRIX}
\pageto{RectangularMatrix}{RMATRIX}
\pageto{SquareMatrix}{SQMATRIX}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MATRIX}{antisymmetric?} &
+\cross{MATRIX}{any?} &
+\cross{MATRIX}{coerce} &
+\cross{MATRIX}{column} &
+\cross{MATRIX}{convert} \\
+\cross{MATRIX}{copy} &
+\cross{MATRIX}{count} &
+\cross{MATRIX}{determinant} &
+\cross{MATRIX}{diagonal?} &
+\cross{MATRIX}{diagonalMatrix} \\
+\cross{MATRIX}{elt} &
+\cross{MATRIX}{empty} &
+\cross{MATRIX}{empty?} &
+\cross{MATRIX}{eq?} &
+\cross{MATRIX}{eval} \\
+\cross{MATRIX}{every?} &
+\cross{MATRIX}{exquo} &
+\cross{MATRIX}{fill!} &
+\cross{MATRIX}{hash} &
+\cross{MATRIX}{horizConcat} \\
+\cross{MATRIX}{inverse} &
+\cross{MATRIX}{latex} &
+\cross{MATRIX}{less?} &
+\cross{MATRIX}{listOfLists} &
+\cross{MATRIX}{map} \\
+\cross{MATRIX}{map!} &
+\cross{MATRIX}{matrix} &
+\cross{MATRIX}{maxColIndex} &
+\cross{MATRIX}{maxRowIndex} &
+\cross{MATRIX}{member?} \\
+\cross{MATRIX}{members} &
+\cross{MATRIX}{minColIndex} &
+\cross{MATRIX}{minordet} &
+\cross{MATRIX}{minRowIndex} &
+\cross{MATRIX}{more?} \\
+\cross{MATRIX}{ncols} &
+\cross{MATRIX}{new} &
+\cross{MATRIX}{nrows} &
+\cross{MATRIX}{nullSpace} &
+\cross{MATRIX}{nullity} \\
+\cross{MATRIX}{parts} &
+\cross{MATRIX}{qelt} &
+\cross{MATRIX}{qsetelt!} &
+\cross{MATRIX}{rank} &
+\cross{MATRIX}{row} \\
+\cross{MATRIX}{rowEchelon} &
+\cross{MATRIX}{sample} &
+\cross{MATRIX}{scalarMatrix} &
+\cross{MATRIX}{setColumn!} &
+\cross{MATRIX}{setRow!} \\
+\cross{MATRIX}{setelt} &
+\cross{MATRIX}{setelt} &
+\cross{MATRIX}{setsubMatrix!} &
+\cross{MATRIX}{size?} &
+\cross{MATRIX}{square?} \\
+\cross{MATRIX}{squareTop} &
+\cross{MATRIX}{subMatrix} &
+\cross{MATRIX}{swapColumns!} &
+\cross{MATRIX}{swapRows!} &
+\cross{MATRIX}{symmetric?} \\
+\cross{MATRIX}{transpose} &
+\cross{MATRIX}{vertConcat} &
+\cross{MATRIX}{zero} &
+\cross{MATRIX}{\#{}?} &
+\cross{MATRIX}{?**?} \\
+\cross{MATRIX}{?/?} &
+\cross{MATRIX}{?=?} &
+\cross{MATRIX}{?\~{}=?} &
+\cross{MATRIX}{?*?} &
+\cross{MATRIX}{?+?} \\
+\cross{MATRIX}{-?} &
+\cross{MATRIX}{?-?} &&&
+\end{tabular}
+
<<domain MATRIX Matrix>>=
)abbrev domain MATRIX Matrix
++ Author: Grabmeier, Gschnitzer, Williamson
@@ -56007,6 +56443,137 @@ Matrix(R): Exports == Implementation where
\section{domain MODMON ModMonic}
\pagehead{ModMonic}{MODMON}
\pagepic{ps/v103modmonic.ps}{MODMON}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MODMON}{0} &
+\cross{MODMON}{1} &
+\cross{MODMON}{An} &
+\cross{MODMON}{associates?} \\
+\cross{MODMON}{binomThmExpt} &
+\cross{MODMON}{characteristic} &
+\cross{MODMON}{charthRoot} &
+\cross{MODMON}{coefficient} \\
+\cross{MODMON}{coefficients} &
+\cross{MODMON}{coerce} &
+\cross{MODMON}{composite} &
+\cross{MODMON}{computePowers} \\
+\cross{MODMON}{conditionP} &
+\cross{MODMON}{content} &
+\cross{MODMON}{convert} &
+\cross{MODMON}{D} \\
+\cross{MODMON}{degree} &
+\cross{MODMON}{differentiate} &
+\cross{MODMON}{discriminant} &
+\cross{MODMON}{divide} \\
+\cross{MODMON}{divideExponents} &
+\cross{MODMON}{elt} &
+\cross{MODMON}{euclideanSize} &
+\cross{MODMON}{eval} \\
+\cross{MODMON}{expressIdealMember} &
+\cross{MODMON}{exquo} &
+\cross{MODMON}{extendedEuclidean} &
+\cross{MODMON}{factor} \\
+\cross{MODMON}{factorPolynomial} &
+\cross{MODMON}{factorSquareFreePolynomial} &
+\cross{MODMON}{frobenius} &
+\cross{MODMON}{gcd} \\
+\cross{MODMON}{gcdPolynomial} &
+\cross{MODMON}{ground} &
+\cross{MODMON}{ground?} &
+\cross{MODMON}{hash} \\
+\cross{MODMON}{index} &
+\cross{MODMON}{init} &
+\cross{MODMON}{integrate} &
+\cross{MODMON}{isExpt} \\
+\cross{MODMON}{isPlus} &
+\cross{MODMON}{isTimes} &
+\cross{MODMON}{karatsubaDivide} &
+\cross{MODMON}{latex} \\
+\cross{MODMON}{lcm} &
+\cross{MODMON}{leadingCoefficient} &
+\cross{MODMON}{leadingMonomial} &
+\cross{MODMON}{lift} \\
+\cross{MODMON}{lookup} &
+\cross{MODMON}{mainVariable} &
+\cross{MODMON}{makeSUP} &
+\cross{MODMON}{map} \\
+\cross{MODMON}{mapExponents} &
+\cross{MODMON}{max} &
+\cross{MODMON}{min} &
+\cross{MODMON}{minimumDegree} \\
+\cross{MODMON}{modulus} &
+\cross{MODMON}{monicDivide} &
+\cross{MODMON}{monomial} &
+\cross{MODMON}{monomial?} \\
+\cross{MODMON}{monomials} &
+\cross{MODMON}{multiEuclidean} &
+\cross{MODMON}{multiplyExponents} &
+\cross{MODMON}{multivariate} \\
+\cross{MODMON}{nextItem} &
+\cross{MODMON}{numberOfMonomials} &
+\cross{MODMON}{one?} &
+\cross{MODMON}{order} \\
+\cross{MODMON}{patternMatch} &
+\cross{MODMON}{pomopo!} &
+\cross{MODMON}{pow} &
+\cross{MODMON}{prime?} \\
+\cross{MODMON}{primitiveMonomials} &
+\cross{MODMON}{primitivePart} &
+\cross{MODMON}{principalIdeal} &
+\cross{MODMON}{pseudoDivide} \\
+\cross{MODMON}{pseudoQuotient} &
+\cross{MODMON}{pseudoRemainder} &
+\cross{MODMON}{random} &
+\cross{MODMON}{recip} \\
+\cross{MODMON}{reduce} &
+\cross{MODMON}{reducedSystem} &
+\cross{MODMON}{reductum} &
+\cross{MODMON}{resultant} \\
+\cross{MODMON}{retract} &
+\cross{MODMON}{retractIfCan} &
+\cross{MODMON}{sample} &
+\cross{MODMON}{separate} \\
+\cross{MODMON}{setPoly} &
+\cross{MODMON}{shiftLeft} &
+\cross{MODMON}{shiftRight} &
+\cross{MODMON}{size} \\
+\cross{MODMON}{sizeLess?} &
+\cross{MODMON}{solveLinearPolynomialEquation} &
+\cross{MODMON}{squareFree} &
+\cross{MODMON}{squareFreePart} \\
+\cross{MODMON}{squareFreePolynomial} &
+\cross{MODMON}{subResultantGcd} &
+\cross{MODMON}{subtractIfCan} &
+\cross{MODMON}{totalDegree} \\
+\cross{MODMON}{unit?} &
+\cross{MODMON}{unitCanonical} &
+\cross{MODMON}{unitNormal} &
+\cross{MODMON}{univariate} \\
+\cross{MODMON}{unmakeSUP} &
+\cross{MODMON}{UnVectorise} &
+\cross{MODMON}{variables} &
+\cross{MODMON}{vectorise} \\
+\cross{MODMON}{Vectorise} &
+\cross{MODMON}{zero?} &
+\cross{MODMON}{?*?} &
+\cross{MODMON}{?**?} \\
+\cross{MODMON}{?+?} &
+\cross{MODMON}{?-?} &
+\cross{MODMON}{-?} &
+\cross{MODMON}{?=?} \\
+\cross{MODMON}{?\^{}?} &
+\cross{MODMON}{?.?} &
+\cross{MODMON}{?\~{}=?} &
+\cross{MODMON}{?/?} \\
+\cross{MODMON}{?$<$?} &
+\cross{MODMON}{?$<=$?} &
+\cross{MODMON}{?$>$?} &
+\cross{MODMON}{?$>=$?} \\
+\cross{MODMON}{?quo?} &
+\cross{MODMON}{?rem?} &
+\end{tabular}
+
<<domain MODMON ModMonic>>=
)abbrev domain MODMON ModMonic
++ Description:
@@ -56189,6 +56756,56 @@ ModMonic(R,Rep): C == T
{\bf See}\\
\pageto{ModularRing}{MODRING}
\pageto{EuclideanModularRing}{EMR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODFIELD}{0} &
+\cross{MODFIELD}{1} &
+\cross{MODFIELD}{associates?} &
+\cross{MODFIELD}{characteristic} &
+\cross{MODFIELD}{coerce} \\
+\cross{MODFIELD}{divide} &
+\cross{MODFIELD}{euclideanSize} &
+\cross{MODFIELD}{expressIdealMember} &
+\cross{MODFIELD}{exquo} &
+\cross{MODFIELD}{exQuo} \\
+\cross{MODFIELD}{extendedEuclidean} &
+\cross{MODFIELD}{factor} &
+\cross{MODFIELD}{gcd} &
+\cross{MODFIELD}{gcdPolynomial} &
+\cross{MODFIELD}{hash} \\
+\cross{MODFIELD}{inv} &
+\cross{MODFIELD}{latex} &
+\cross{MODFIELD}{lcm} &
+\cross{MODFIELD}{modulus} &
+\cross{MODFIELD}{multiEuclidean} \\
+\cross{MODFIELD}{one?} &
+\cross{MODFIELD}{prime?} &
+\cross{MODFIELD}{principalIdeal} &
+\cross{MODFIELD}{recip} &
+\cross{MODFIELD}{reduce} \\
+\cross{MODFIELD}{sample} &
+\cross{MODFIELD}{sizeLess?} &
+\cross{MODFIELD}{squareFree} &
+\cross{MODFIELD}{squareFreePart} &
+\cross{MODFIELD}{subtractIfCan} \\
+\cross{MODFIELD}{unit?} &
+\cross{MODFIELD}{unitCanonical} &
+\cross{MODFIELD}{unitNormal} &
+\cross{MODFIELD}{zero?} &
+\cross{MODFIELD}{?*?} \\
+\cross{MODFIELD}{?**?} &
+\cross{MODFIELD}{?+?} &
+\cross{MODFIELD}{?-?} &
+\cross{MODFIELD}{-?} &
+\cross{MODFIELD}{?/?} \\
+\cross{MODFIELD}{?=?} &
+\cross{MODFIELD}{?\^{}?} &
+\cross{MODFIELD}{?\~{}=?} &
+\cross{MODFIELD}{?quo?} &
+\cross{MODFIELD}{?rem?}
+\end{tabular}
+
<<domain MODFIELD ModularField>>=
)abbrev domain MODFIELD ModularField
++ These domains are used for the factorization and gcds
@@ -56228,6 +56845,34 @@ ModularField(R,Mod,reduction:(R,Mod) -> R,
{\bf See}\\
\pageto{EuclideanModularRing}{EMR}
\pageto{ModularField}{MODFIELD}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODRING}{0} &
+\cross{MODRING}{1} &
+\cross{MODRING}{characteristic} &
+\cross{MODRING}{coerce} &
+\cross{MODRING}{exQuo} \\
+\cross{MODRING}{hash} &
+\cross{MODRING}{inv} &
+\cross{MODRING}{latex} &
+\cross{MODRING}{modulus} &
+\cross{MODRING}{one?} \\
+\cross{MODRING}{recip} &
+\cross{MODRING}{reduce} &
+\cross{MODRING}{sample} &
+\cross{MODRING}{subtractIfCan} &
+\cross{MODRING}{zero?} \\
+\cross{MODRING}{?\~{}=?} &
+\cross{MODRING}{?*?} &
+\cross{MODRING}{?**?} &
+\cross{MODRING}{?\^{}?} &
+\cross{MODRING}{?+?} \\
+\cross{MODRING}{?-?} &
+\cross{MODRING}{-?} &
+\cross{MODRING}{?=?} &&
+\end{tabular}
+
<<domain MODRING ModularRing>>=
)abbrev domain MODRING ModularRing
++ Author: P.Gianni, B.Trager
@@ -56331,6 +56976,25 @@ ModularRing(R,Mod,reduction:(R,Mod) -> R,
\pagepic{ps/v103modulemonomial.ps}{MODMONOM}{1.00}
{\bf See}\\
\pageto{GeneralModulePolynomial}{GMODPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODMONOM}{coerce} &
+\cross{MODMONOM}{construct} &
+\cross{MODMONOM}{exponent} &
+\cross{MODMONOM}{hash} &
+\cross{MODMONOM}{index} \\
+\cross{MODMONOM}{latex} &
+\cross{MODMONOM}{max} &
+\cross{MODMONOM}{min} &
+\cross{MODMONOM}{?\~{}=?} &
+\cross{MODMONOM}{?$<$?} \\
+\cross{MODMONOM}{?$<=$?} &
+\cross{MODMONOM}{?=?} &
+\cross{MODMONOM}{?$>$?} &
+\cross{MODMONOM}{?$>=$?} &
+\end{tabular}
+
<<domain MODMONOM ModuleMonomial>>=
)abbrev domain MODMONOM ModuleMonomial
++ Description:
@@ -56374,6 +57038,40 @@ ModuleMonomial(IS: OrderedSet,
\pagepic{ps/v103moduleoperator.ps}{MODOP}{1.00}
{\bf See}\\
\pageto{Operator}{OP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODOP}{0} &
+\cross{MODOP}{1} &
+\cross{MODOP}{adjoint} &
+\cross{MODOP}{characteristic} &
+\cross{MODOP}{charthRoot} \\
+\cross{MODOP}{coerce} &
+\cross{MODOP}{conjug} &
+\cross{MODOP}{evaluate} &
+\cross{MODOP}{evaluateInverse} &
+\cross{MODOP}{hash} \\
+\cross{MODOP}{latex} &
+\cross{MODOP}{makeop} &
+\cross{MODOP}{one?} &
+\cross{MODOP}{opeval} &
+\cross{MODOP}{recip} \\
+\cross{MODOP}{retract} &
+\cross{MODOP}{retractIfCan} &
+\cross{MODOP}{sample} &
+\cross{MODOP}{subtractIfCan} &
+\cross{MODOP}{zero?} \\
+\cross{MODOP}{?*?} &
+\cross{MODOP}{?**?} &
+\cross{MODOP}{?+?} &
+\cross{MODOP}{?-?} &
+\cross{MODOP}{-?} \\
+\cross{MODOP}{?=?} &
+\cross{MODOP}{?\^{}?} &
+\cross{MODOP}{?.?} &
+\cross{MODOP}{?\~{}=?} &
+\end{tabular}
+
<<domain MODOP ModuleOperator>>=
)abbrev domain MODOP ModuleOperator
++ Author: Manuel Bronstein
@@ -56613,6 +57311,32 @@ ModuleOperator(R: Ring, M:LeftModule(R)): Exports ==
Implementation where
\section{domain MOEBIUS MoebiusTransform}
\pagehead{MoebiusTransform}{MOEBIUS}
\pagepic{ps/v103moebiustransform.ps}{MOEBIUS}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MOEBIUS}{1} &
+\cross{MOEBIUS}{coerce} &
+\cross{MOEBIUS}{commutator} &
+\cross{MOEBIUS}{conjugate} &
+\cross{MOEBIUS}{eval} \\
+\cross{MOEBIUS}{hash} &
+\cross{MOEBIUS}{inv} &
+\cross{MOEBIUS}{latex} &
+\cross{MOEBIUS}{moebius} &
+\cross{MOEBIUS}{one?} \\
+\cross{MOEBIUS}{recip} &
+\cross{MOEBIUS}{sample} &
+\cross{MOEBIUS}{scale} &
+\cross{MOEBIUS}{shift} &
+\cross{MOEBIUS}{?\~{}=?} \\
+\cross{MOEBIUS}{?**?} &
+\cross{MOEBIUS}{?\^{}?} &
+\cross{MOEBIUS}{?*?} &
+\cross{MOEBIUS}{?/?} &
+\cross{MOEBIUS}{?=?} \\
+\cross{MOEBIUS}{?\^{}?} &&&&
+\end{tabular}
+
<<domain MOEBIUS MoebiusTransform>>=
)abbrev domain MOEBIUS MoebiusTransform
++ 2-by-2 matrices acting on P1(F).
@@ -56724,6 +57448,48 @@ MoebiusTransform(F): Exports == Implementation where
\section{domain MRING MonoidRing}
\pagehead{MonoidRing}{MRING}
\pagepic{ps/v103monoidring.ps}{MRING}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MRING}{0} &
+\cross{MRING}{1} &
+\cross{MRING}{characteristic} &
+\cross{MRING}{charthRoot} &
+\cross{MRING}{coefficient} \\
+\cross{MRING}{coefficients} &
+\cross{MRING}{coerce} &
+\cross{MRING}{hash} &
+\cross{MRING}{index} &
+\cross{MRING}{latex} \\
+\cross{MRING}{leadingCoefficient} &
+\cross{MRING}{leadingMonomial} &
+\cross{MRING}{lookup} &
+\cross{MRING}{map} &
+\cross{MRING}{monomial} \\
+\cross{MRING}{monomial?} &
+\cross{MRING}{monomials} &
+\cross{MRING}{numberOfMonomials} &
+\cross{MRING}{one?} &
+\cross{MRING}{random} \\
+\cross{MRING}{recip} &
+\cross{MRING}{reductum} &
+\cross{MRING}{retract} &
+\cross{MRING}{retractIfCan} &
+\cross{MRING}{sample} \\
+\cross{MRING}{size} &
+\cross{MRING}{subtractIfCan} &
+\cross{MRING}{terms} &
+\cross{MRING}{zero?} &
+\cross{MRING}{?*?} \\
+\cross{MRING}{?**?} &
+\cross{MRING}{?+?} &
+\cross{MRING}{?-?} &
+\cross{MRING}{-?} &
+\cross{MRING}{?=?} \\
+\cross{MRING}{?\^{}?} &
+\cross{MRING}{?\~{}=?} &&&
+\end{tabular}
+
<<domain MRING MonoidRing>>=
)abbrev domain MRING MonoidRing
++ Authors: Stephan M. Watt; revised by Johannes Grabmeier
@@ -57267,6 +58033,58 @@ o )show Multiset
@
\pagehead{Multiset}{MSET}
\pagepic{ps/v103multiset.ps}{MSET}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MSET}{any?} &
+\cross{MSET}{bag} &
+\cross{MSET}{brace} &
+\cross{MSET}{coerce} &
+\cross{MSET}{construct} \\
+\cross{MSET}{convert} &
+\cross{MSET}{copy} &
+\cross{MSET}{count} &
+\cross{MSET}{dictionary} &
+\cross{MSET}{difference} \\
+\cross{MSET}{duplicates} &
+\cross{MSET}{empty} &
+\cross{MSET}{empty?} &
+\cross{MSET}{eq?} &
+\cross{MSET}{eval} \\
+\cross{MSET}{every?} &
+\cross{MSET}{extract!} &
+\cross{MSET}{find} &
+\cross{MSET}{hash} &
+\cross{MSET}{insert!} \\
+\cross{MSET}{inspect} &
+\cross{MSET}{intersect} &
+\cross{MSET}{latex} &
+\cross{MSET}{less?} &
+\cross{MSET}{map} \\
+\cross{MSET}{map!} &
+\cross{MSET}{members} &
+\cross{MSET}{member?} &
+\cross{MSET}{more?} &
+\cross{MSET}{multiset} \\
+\cross{MSET}{parts} &
+\cross{MSET}{reduce} &
+\cross{MSET}{remove} &
+\cross{MSET}{remove!} &
+\cross{MSET}{removeDuplicates} \\
+\cross{MSET}{sample} &
+\cross{MSET}{select} &
+\cross{MSET}{select!} &
+\cross{MSET}{set} &
+\cross{MSET}{size?} \\
+\cross{MSET}{subset?} &
+\cross{MSET}{symmetricDifference} &
+\cross{MSET}{union} &
+\cross{MSET}{\#{}?} &
+\cross{MSET}{?$<$?} \\
+\cross{MSET}{?=?} &
+\cross{MSET}{?\~{}=?} &&&
+\end{tabular}
+
<<domain MSET Multiset>>=
)abbrev domain MSET Multiset
++ Author:Stephen M. Watt, William H. Burge, Richard D. Jenks, Frederic Lehobey
@@ -57763,6 +58581,94 @@ o )show MultivariatePolynomial
\pageto{Polynomial}{POLY}
\pageto{SparseMultivariatePolynomial}{SMP}
\pageto{IndexedExponents}{INDE}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MPOLY}{0} &
+\cross{MPOLY}{1} &
+\cross{MPOLY}{associates?} &
+\cross{MPOLY}{binomThmExpt} \\
+\cross{MPOLY}{characteristic} &
+\cross{MPOLY}{charthRoot} &
+\cross{MPOLY}{coefficient} &
+\cross{MPOLY}{coefficients} \\
+\cross{MPOLY}{coerce} &
+\cross{MPOLY}{conditionP} &
+\cross{MPOLY}{content} &
+\cross{MPOLY}{convert} \\
+\cross{MPOLY}{D} &
+\cross{MPOLY}{degree} &
+\cross{MPOLY}{differentiate} &
+\cross{MPOLY}{discriminant} \\
+\cross{MPOLY}{eval} &
+\cross{MPOLY}{exquo} &
+\cross{MPOLY}{factor} &
+\cross{MPOLY}{factorPolynomial} \\
+\cross{MPOLY}{factorSquareFreePolynomial} &
+\cross{MPOLY}{gcd} &
+\cross{MPOLY}{gcdPolynomial} &
+\cross{MPOLY}{ground} \\
+\cross{MPOLY}{ground?} &
+\cross{MPOLY}{hash} &
+\cross{MPOLY}{isExpt} &
+\cross{MPOLY}{isPlus} \\
+\cross{MPOLY}{isTimes} &
+\cross{MPOLY}{latex} &
+\cross{MPOLY}{lcm} &
+\cross{MPOLY}{leadingCoefficient} \\
+\cross{MPOLY}{leadingMonomial} &
+\cross{MPOLY}{mainVariable} &
+\cross{MPOLY}{map} &
+\cross{MPOLY}{mapExponents} \\
+\cross{MPOLY}{max} &
+\cross{MPOLY}{min} &
+\cross{MPOLY}{minimumDegree} &
+\cross{MPOLY}{monicDivide} \\
+\cross{MPOLY}{monomial} &
+\cross{MPOLY}{monomial?} &
+\cross{MPOLY}{monomials} &
+\cross{MPOLY}{multivariate} \\
+\cross{MPOLY}{numberOfMonomials} &
+\cross{MPOLY}{one?} &
+\cross{MPOLY}{patternMatch} &
+\cross{MPOLY}{pomopo!} \\
+\cross{MPOLY}{prime?} &
+\cross{MPOLY}{primitivePart} &
+\cross{MPOLY}{primitiveMonomials} &
+\cross{MPOLY}{recip} \\
+\cross{MPOLY}{reducedSystem} &
+\cross{MPOLY}{reductum} &
+\cross{MPOLY}{resultant} &
+\cross{MPOLY}{retract} \\
+\cross{MPOLY}{retractIfCan} &
+\cross{MPOLY}{sample} &
+\cross{MPOLY}{solveLinearPolynomialEquation} &
+\cross{MPOLY}{squareFree} \\
+\cross{MPOLY}{squareFreePart} &
+\cross{MPOLY}{squareFreePolynomial} &
+\cross{MPOLY}{subtractIfCan} &
+\cross{MPOLY}{totalDegree} \\
+\cross{MPOLY}{unit?} &
+\cross{MPOLY}{unitCanonical} &
+\cross{MPOLY}{unitNormal} &
+\cross{MPOLY}{univariate} \\
+\cross{MPOLY}{variables} &
+\cross{MPOLY}{zero?} &
+\cross{MPOLY}{?*?} &
+\cross{MPOLY}{?**?} \\
+\cross{MPOLY}{?+?} &
+\cross{MPOLY}{?-?} &
+\cross{MPOLY}{-?} &
+\cross{MPOLY}{?=?} \\
+\cross{MPOLY}{?\^{}?} &
+\cross{MPOLY}{?\~{}=?} &
+\cross{MPOLY}{?/?} &
+\cross{MPOLY}{?$<$?} \\
+\cross{MPOLY}{?$<=$?} &
+\cross{MPOLY}{?$>$?} &
+\cross{MPOLY}{?$>=$?} &
+\end{tabular}
+
<<domain MPOLY MultivariatePolynomial>>=
)abbrev domain MPOLY MultivariatePolynomial
++ Author: Dave Barton, Barry Trager
@@ -57799,6 +58705,111 @@ MultivariatePolynomial(vl:List Symbol, R:Ring)
\pagepic{ps/v103myexpression.ps}{MYEXPR}{1.00}
{\bf See}\\
\pageto{MyUnivariatePolynomial}{MYUP}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{MYEXPR}{0} &
+\cross{MYEXPR}{1} &
+\cross{MYEXPR}{applyQuote} &
+\cross{MYEXPR}{associates?} \\
+\cross{MYEXPR}{belong?} &
+\cross{MYEXPR}{binomial} &
+\cross{MYEXPR}{box} &
+\cross{MYEXPR}{characteristic} \\
+\cross{MYEXPR}{charthRoot} &
+\cross{MYEXPR}{coerce} &
+\cross{MYEXPR}{commutator} &
+\cross{MYEXPR}{conjugate} \\
+\cross{MYEXPR}{convert} &
+\cross{MYEXPR}{D} &
+\cross{MYEXPR}{definingPolynomial} &
+\cross{MYEXPR}{denom} \\
+\cross{MYEXPR}{denominator} &
+\cross{MYEXPR}{differentiate} &
+\cross{MYEXPR}{distribute} &
+\cross{MYEXPR}{divide} \\
+\cross{MYEXPR}{elt} &
+\cross{MYEXPR}{euclideanSize} &
+\cross{MYEXPR}{eval} &
+\cross{MYEXPR}{even?} \\
+\cross{MYEXPR}{expressIdealMember} &
+\cross{MYEXPR}{exquo} &
+\cross{MYEXPR}{extendedEuclidean} &
+\cross{MYEXPR}{factor} \\
+\cross{MYEXPR}{factorial} &
+\cross{MYEXPR}{factorials} &
+\cross{MYEXPR}{freeOf?} &
+\cross{MYEXPR}{gcd} \\
+\cross{MYEXPR}{gcdPolynomial} &
+\cross{MYEXPR}{ground} &
+\cross{MYEXPR}{ground?} &
+\cross{MYEXPR}{hash} \\
+\cross{MYEXPR}{height} &
+\cross{MYEXPR}{inv} &
+\cross{MYEXPR}{is?} &
+\cross{MYEXPR}{is?} \\
+\cross{MYEXPR}{isExpt} &
+\cross{MYEXPR}{isMult} &
+\cross{MYEXPR}{isPlus} &
+\cross{MYEXPR}{isPower} \\
+\cross{MYEXPR}{isTimes} &
+\cross{MYEXPR}{kernel} &
+\cross{MYEXPR}{kernels} &
+\cross{MYEXPR}{latex} \\
+\cross{MYEXPR}{lcm} &
+\cross{MYEXPR}{mainKernel} &
+\cross{MYEXPR}{map} &
+\cross{MYEXPR}{max} \\
+\cross{MYEXPR}{min} &
+\cross{MYEXPR}{minPoly} &
+\cross{MYEXPR}{multiEuclidean} &
+\cross{MYEXPR}{numer} \\
+\cross{MYEXPR}{numerator} &
+\cross{MYEXPR}{odd?} &
+\cross{MYEXPR}{one?} &
+\cross{MYEXPR}{operator} \\
+\cross{MYEXPR}{operators} &
+\cross{MYEXPR}{paren} &
+\cross{MYEXPR}{patternMatch} &
+\cross{MYEXPR}{permutation} \\
+\cross{MYEXPR}{prime?} &
+\cross{MYEXPR}{principalIdeal} &
+\cross{MYEXPR}{product} &
+\cross{MYEXPR}{recip} \\
+\cross{MYEXPR}{reducedSystem} &
+\cross{MYEXPR}{retract} &
+\cross{MYEXPR}{retractIfCan} &
+\cross{MYEXPR}{sample} \\
+\cross{MYEXPR}{sizeLess?} &
+\cross{MYEXPR}{squareFree} &
+\cross{MYEXPR}{squareFreePart} &
+\cross{MYEXPR}{subst} \\
+\cross{MYEXPR}{subtractIfCan} &
+\cross{MYEXPR}{summation} &
+\cross{MYEXPR}{tower} &
+\cross{MYEXPR}{unit?} \\
+\cross{MYEXPR}{unitCanonical} &
+\cross{MYEXPR}{unitNormal} &
+\cross{MYEXPR}{univariate} &
+\cross{MYEXPR}{variables} \\
+\cross{MYEXPR}{zero?} &
+\cross{MYEXPR}{?*?} &
+\cross{MYEXPR}{?**?} &
+\cross{MYEXPR}{?+?} \\
+\cross{MYEXPR}{-?} &
+\cross{MYEXPR}{?-?} &
+\cross{MYEXPR}{?/?} &
+\cross{MYEXPR}{?$<$?} \\
+\cross{MYEXPR}{?$<=$?} &
+\cross{MYEXPR}{?=?} &
+\cross{MYEXPR}{?$>$?} &
+\cross{MYEXPR}{?$>=$?} \\
+\cross{MYEXPR}{?\^{}?} &
+\cross{MYEXPR}{?\~{}=?} &
+\cross{MYEXPR}{?quo?} &
+\cross{MYEXPR}{?rem?}
+\end{tabular}
+
<<domain MYEXPR MyExpression>>=
)abbrev domain MYEXPR MyExpression
MyExpression(q: Symbol, R): Exports == Implementation where
@@ -57862,6 +58873,125 @@ MyExpression(q: Symbol, R): Exports == Implementation
where
\pagepic{ps/v103myunivariatepolynomial.ps}{MYUP}{1.00}
{\bf See}\\
\pageto{MyExpression}{MYEXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{MYUP}{0} &
+\cross{MYUP}{1} &
+\cross{MYUP}{associates?} \\
+\cross{MYUP}{binomThmExpt} &
+\cross{MYUP}{characteristic} &
+\cross{MYUP}{charthRoot} \\
+\cross{MYUP}{coefficient} &
+\cross{MYUP}{coefficients} &
+\cross{MYUP}{coerce} \\
+\cross{MYUP}{composite} &
+\cross{MYUP}{conditionP} &
+\cross{MYUP}{content} \\
+\cross{MYUP}{convert} &
+\cross{MYUP}{D} &
+\cross{MYUP}{degree} \\
+\cross{MYUP}{differentiate} &
+\cross{MYUP}{discriminant} &
+\cross{MYUP}{divide} \\
+\cross{MYUP}{divideExponents} &
+\cross{MYUP}{elt} &
+\cross{MYUP}{euclideanSize} \\
+\cross{MYUP}{eval} &
+\cross{MYUP}{expressIdealMember} &
+\cross{MYUP}{exquo} \\
+\cross{MYUP}{extendedEuclidean} &
+\cross{MYUP}{factor} &
+\cross{MYUP}{factorPolynomial} \\
+\cross{MYUP}{factorSquareFreePolynomial} &
+\cross{MYUP}{fmecg} &
+\cross{MYUP}{gcd} \\
+\cross{MYUP}{gcdPolynomial} &
+\cross{MYUP}{ground} &
+\cross{MYUP}{ground?} \\
+\cross{MYUP}{hash} &
+\cross{MYUP}{init} &
+\cross{MYUP}{integrate} \\
+\cross{MYUP}{isExpt} &
+\cross{MYUP}{isPlus} &
+\cross{MYUP}{isTimes} \\
+\cross{MYUP}{karatsubaDivide} &
+\cross{MYUP}{latex} &
+\cross{MYUP}{lcm} \\
+\cross{MYUP}{leadingCoefficient} &
+\cross{MYUP}{leadingMonomial} &
+\cross{MYUP}{mainVariable} \\
+\cross{MYUP}{makeSUP} &
+\cross{MYUP}{map} &
+\cross{MYUP}{mapExponents} \\
+\cross{MYUP}{max} &
+\cross{MYUP}{min} &
+\cross{MYUP}{minimumDegree} \\
+\cross{MYUP}{monicDivide} &
+\cross{MYUP}{monomial} &
+\cross{MYUP}{monomial?} \\
+\cross{MYUP}{monomials} &
+\cross{MYUP}{multiEuclidean} &
+\cross{MYUP}{multiplyExponents} \\
+\cross{MYUP}{multivariate} &
+\cross{MYUP}{nextItem} &
+\cross{MYUP}{numberOfMonomials} \\
+\cross{MYUP}{one?} &
+\cross{MYUP}{order} &
+\cross{MYUP}{patternMatch} \\
+\cross{MYUP}{pomopo!} &
+\cross{MYUP}{prime?} &
+\cross{MYUP}{primitiveMonomials} \\
+\cross{MYUP}{primitivePart} &
+\cross{MYUP}{principalIdeal} &
+\cross{MYUP}{pseudoDivide} \\
+\cross{MYUP}{pseudoQuotient} &
+\cross{MYUP}{pseudoRemainder} &
+\cross{MYUP}{recip} \\
+\cross{MYUP}{reducedSystem} &
+\cross{MYUP}{reductum} &
+\cross{MYUP}{resultant} \\
+\cross{MYUP}{retract} &
+\cross{MYUP}{retractIfCan} &
+\cross{MYUP}{sample} \\
+\cross{MYUP}{separate} &
+\cross{MYUP}{shiftLeft} &
+\cross{MYUP}{shiftRight} \\
+\cross{MYUP}{sizeLess?} &
+\cross{MYUP}{solveLinearPolynomialEquation} &
+\cross{MYUP}{squareFree} \\
+\cross{MYUP}{squareFreePart} &
+\cross{MYUP}{squareFreePolynomial} &
+\cross{MYUP}{subResultantGcd} \\
+\cross{MYUP}{subtractIfCan} &
+\cross{MYUP}{totalDegree} &
+\cross{MYUP}{unit?} \\
+\cross{MYUP}{unitCanonical} &
+\cross{MYUP}{unitNormal} &
+\cross{MYUP}{univariate} \\
+\cross{MYUP}{unmakeSUP} &
+\cross{MYUP}{variables} &
+\cross{MYUP}{vectorise} \\
+\cross{MYUP}{zero?} &
+\cross{MYUP}{?*?} &
+\cross{MYUP}{?**?} \\
+\cross{MYUP}{?+?} &
+\cross{MYUP}{?-?} &
+\cross{MYUP}{-?} \\
+\cross{MYUP}{?=?} &
+\cross{MYUP}{?\^{}?} &
+\cross{MYUP}{?.?} \\
+\cross{MYUP}{?\~{}=?} &
+\cross{MYUP}{?/?} &
+\cross{MYUP}{?$<$?} \\
+\cross{MYUP}{?$<=$?} &
+\cross{MYUP}{?$>$?} &
+\cross{MYUP}{?$>=$?} \\
+\cross{MYUP}{?\^{}?} &
+\cross{MYUP}{?quo?} &
+\cross{MYUP}{?rem?}
+\end{tabular}
+
<<domain MYUP MyUnivariatePolynomial>>=
)abbrev domain MYUP MyUnivariatePolynomial
MyUnivariatePolynomial(x:Symbol, R:Ring):
@@ -57912,6 +59042,144 @@ by means of triangular sets.
\pagepic{ps/v103newsparsemultivariatepolynomial.ps}{NSMP}{1.00}
{\bf See}\\
\pageto{NewSparseUnivariatePolynomial}{NSUP}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{NSMP}{0} &
+\cross{NSMP}{1} &
+\cross{NSMP}{associates?} \\
+\cross{NSMP}{binomThmExpt} &
+\cross{NSMP}{characteristic} &
+\cross{NSMP}{charthRoot} \\
+\cross{NSMP}{coefficient} &
+\cross{NSMP}{coefficients} &
+\cross{NSMP}{coerce} \\
+\cross{NSMP}{conditionP} &
+\cross{NSMP}{content} &
+\cross{NSMP}{D} \\
+\cross{NSMP}{degree} &
+\cross{NSMP}{deepestInitial} &
+\cross{NSMP}{deepestTail} \\
+\cross{NSMP}{differentiate} &
+\cross{NSMP}{discriminant} &
+\cross{NSMP}{eval} \\
+\cross{NSMP}{exactQuotient} &
+\cross{NSMP}{exactQuotient!} &
+\cross{NSMP}{exquo} \\
+\cross{NSMP}{extendedSubResultantGcd} &
+\cross{NSMP}{factor} &
+\cross{NSMP}{factorPolynomial} \\
+\cross{NSMP}{factorSquareFreePolynomial} &
+\cross{NSMP}{gcd} &
+\cross{NSMP}{gcdPolynomial} \\
+\cross{NSMP}{ground} &
+\cross{NSMP}{ground?} &
+\cross{NSMP}{halfExtendedSubResultantGcd1} \\
+\cross{NSMP}{halfExtendedSubResultantGcd2} &
+\cross{NSMP}{hash} &
+\cross{NSMP}{head} \\
+\cross{NSMP}{headReduce} &
+\cross{NSMP}{headReduced?} &
+\cross{NSMP}{infRittWu?} \\
+\cross{NSMP}{init} &
+\cross{NSMP}{initiallyReduce} &
+\cross{NSMP}{initiallyReduced?} \\
+\cross{NSMP}{isExpt} &
+\cross{NSMP}{isPlus} &
+\cross{NSMP}{isTimes} \\
+\cross{NSMP}{iteratedInitials} &
+\cross{NSMP}{lastSubResultant} &
+\cross{NSMP}{latex} \\
+\cross{NSMP}{LazardQuotient} &
+\cross{NSMP}{LazardQuotient2} &
+\cross{NSMP}{lazyPremWithDefault} \\
+\cross{NSMP}{lazyPquo} &
+\cross{NSMP}{lazyPrem} &
+\cross{NSMP}{lazyPseudoDivide} \\
+\cross{NSMP}{lazyResidueClass} &
+\cross{NSMP}{lcm} &
+\cross{NSMP}{leadingCoefficient} \\
+\cross{NSMP}{leadingMonomial} &
+\cross{NSMP}{leastMonomial} &
+\cross{NSMP}{mainCoefficients} \\
+\cross{NSMP}{mainContent} &
+\cross{NSMP}{mainMonomial} &
+\cross{NSMP}{mainMonomials} \\
+\cross{NSMP}{mainPrimitivePart} &
+\cross{NSMP}{mainSquareFreePart} &
+\cross{NSMP}{mainVariable} \\
+\cross{NSMP}{map} &
+\cross{NSMP}{mapExponents} &
+\cross{NSMP}{max} \\
+\cross{NSMP}{mdeg} &
+\cross{NSMP}{min} &
+\cross{NSMP}{minimumDegree} \\
+\cross{NSMP}{monic?} &
+\cross{NSMP}{monicDivide} &
+\cross{NSMP}{monicModulo} \\
+\cross{NSMP}{monomial} &
+\cross{NSMP}{monomial?} &
+\cross{NSMP}{monomials} \\
+\cross{NSMP}{multivariate} &
+\cross{NSMP}{mvar} &
+\cross{NSMP}{nextsubResultant2} \\
+\cross{NSMP}{normalized?} &
+\cross{NSMP}{numberOfMonomials} &
+\cross{NSMP}{one?} \\
+\cross{NSMP}{patternMatch} &
+\cross{NSMP}{pomopo!} &
+\cross{NSMP}{pquo} \\
+\cross{NSMP}{prem} &
+\cross{NSMP}{primPartElseUnitCanonical} &
+\cross{NSMP}{primPartElseUnitCanonical!} \\
+\cross{NSMP}{prime?} &
+\cross{NSMP}{primitiveMonomials} &
+\cross{NSMP}{primitivePart} \\
+\cross{NSMP}{primitivePart!} &
+\cross{NSMP}{pseudoDivide} &
+\cross{NSMP}{reducedSystem} \\
+\cross{NSMP}{resultant} &
+\cross{NSMP}{retract} &
+\cross{NSMP}{retractIfCan} \\
+\cross{NSMP}{RittWuCompare} &
+\cross{NSMP}{quasiMonic?} &
+\cross{NSMP}{recip} \\
+\cross{NSMP}{reduced?} &
+\cross{NSMP}{reductum} &
+\cross{NSMP}{retract} \\
+\cross{NSMP}{sample} &
+\cross{NSMP}{solveLinearPolynomialEquation} &
+\cross{NSMP}{squareFree} \\
+\cross{NSMP}{squareFreePart} &
+\cross{NSMP}{squareFreePolynomial} &
+\cross{NSMP}{subResultantChain} \\
+\cross{NSMP}{subResultantGcd} &
+\cross{NSMP}{supRittWu?} &
+\cross{NSMP}{subtractIfCan} \\
+\cross{NSMP}{tail} &
+\cross{NSMP}{totalDegree} &
+\cross{NSMP}{unit?} \\
+\cross{NSMP}{unitCanonical} &
+\cross{NSMP}{unitNormal} &
+\cross{NSMP}{univariate} \\
+\cross{NSMP}{univariate} &
+\cross{NSMP}{variables} &
+\cross{NSMP}{zero?} \\
+\cross{NSMP}{?*?} &
+\cross{NSMP}{?**?} &
+\cross{NSMP}{?+?} \\
+\cross{NSMP}{?-?} &
+\cross{NSMP}{-?} &
+\cross{NSMP}{?=?} \\
+\cross{NSMP}{?\^{}?} &
+\cross{NSMP}{?\~{}=?} &
+\cross{NSMP}{?/?} \\
+\cross{NSMP}{?$<$?} &
+\cross{NSMP}{?$<=$?} &
+\cross{NSMP}{?$>$?} \\
+\cross{NSMP}{?$>=$?} &&
+\end{tabular}
+
<<domain NSMP NewSparseMultivariatePolynomial>>=
)abbrev domain NSMP NewSparseMultivariatePolynomial
++ Author: Marc Moreno Maza
@@ -58326,6 +59594,138 @@ constructur {\bf SparseUnivariatePolynomial}.
\pagepic{ps/v103newsparseunivariatepolynomial.ps}{NSUP}{1.00}
{\bf See}\\
\pageto{NewSparseMultivariatePolynomial}{NSMP}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{NSUP}{0} &
+\cross{NSUP}{1} \\
+\cross{NSUP}{associates?} &
+\cross{NSUP}{binomThmExpt} \\
+\cross{NSUP}{characteristic} &
+\cross{NSUP}{charthRoot} \\
+\cross{NSUP}{coefficient} &
+\cross{NSUP}{coefficients} \\
+\cross{NSUP}{coerce} &
+\cross{NSUP}{composite} \\
+\cross{NSUP}{conditionP} &
+\cross{NSUP}{content} \\
+\cross{NSUP}{convert} &
+\cross{NSUP}{D} \\
+\cross{NSUP}{degree} &
+\cross{NSUP}{differentiate} \\
+\cross{NSUP}{discriminant} &
+\cross{NSUP}{divide} \\
+\cross{NSUP}{divideExponents} &
+\cross{NSUP}{elt} \\
+\cross{NSUP}{euclideanSize} &
+\cross{NSUP}{eval} \\
+\cross{NSUP}{expressIdealMember} &
+\cross{NSUP}{exquo} \\
+\cross{NSUP}{extendedEuclidean} &
+\cross{NSUP}{extendedResultant} \\
+\cross{NSUP}{extendedSubResultantGcd} &
+\cross{NSUP}{factor} \\
+\cross{NSUP}{factorPolynomial} &
+\cross{NSUP}{factorSquareFreePolynomial} \\
+\cross{NSUP}{fmecg} &
+\cross{NSUP}{gcd} \\
+\cross{NSUP}{gcdPolynomial} &
+\cross{NSUP}{ground} \\
+\cross{NSUP}{ground?} &
+\cross{NSUP}{halfExtendedResultant1} \\
+\cross{NSUP}{halfExtendedResultant2} &
+\cross{NSUP}{halfExtendedSubResultantGcd1} \\
+\cross{NSUP}{halfExtendedSubResultantGcd2} &
+\cross{NSUP}{hash} \\
+\cross{NSUP}{init} &
+\cross{NSUP}{integrate} \\
+\cross{NSUP}{isExpt} &
+\cross{NSUP}{isPlus} \\
+\cross{NSUP}{isTimes} &
+\cross{NSUP}{karatsubaDivide} \\
+\cross{NSUP}{lastSubResultant} &
+\cross{NSUP}{latex} \\
+\cross{NSUP}{lazyPseudoDivide} &
+\cross{NSUP}{lazyPseudoQuotient} \\
+\cross{NSUP}{lazyPseudoRemainder} &
+\cross{NSUP}{lazyResidueClass} \\
+\cross{NSUP}{lcm} &
+\cross{NSUP}{leadingCoefficient} \\
+\cross{NSUP}{leadingMonomial} &
+\cross{NSUP}{mainVariable} \\
+\cross{NSUP}{makeSUP} &
+\cross{NSUP}{map} \\
+\cross{NSUP}{mapExponents} &
+\cross{NSUP}{max} \\
+\cross{NSUP}{min} &
+\cross{NSUP}{minimumDegree} \\
+\cross{NSUP}{monicDivide} &
+\cross{NSUP}{monicModulo} \\
+\cross{NSUP}{monomial} &
+\cross{NSUP}{monomial?} \\
+\cross{NSUP}{monomials} &
+\cross{NSUP}{multiEuclidean} \\
+\cross{NSUP}{multiplyExponents} &
+\cross{NSUP}{multivariate} \\
+\cross{NSUP}{nextItem} &
+\cross{NSUP}{numberOfMonomials} \\
+\cross{NSUP}{one?} &
+\cross{NSUP}{order} \\
+\cross{NSUP}{patternMatch} &
+\cross{NSUP}{pomopo!} \\
+\cross{NSUP}{prime?} &
+\cross{NSUP}{primitiveMonomials} \\
+\cross{NSUP}{primitivePart} &
+\cross{NSUP}{principalIdeal} \\
+\cross{NSUP}{pseudoDivide} &
+\cross{NSUP}{pseudoQuotient} \\
+\cross{NSUP}{pseudoRemainder} &
+\cross{NSUP}{recip} \\
+\cross{NSUP}{reducedSystem} &
+\cross{NSUP}{reductum} \\
+\cross{NSUP}{resultant} &
+\cross{NSUP}{retract} \\
+\cross{NSUP}{retractIfCan} &
+\cross{NSUP}{sample} \\
+\cross{NSUP}{separate} &
+\cross{NSUP}{shiftLeft} \\
+\cross{NSUP}{shiftRight} &
+\cross{NSUP}{sizeLess?} \\
+\cross{NSUP}{solveLinearPolynomialEquation} &
+\cross{NSUP}{squareFree} \\
+\cross{NSUP}{squareFreePart} &
+\cross{NSUP}{squareFreePolynomial} \\
+\cross{NSUP}{subResultantGcd} &
+\cross{NSUP}{subResultantsChain} \\
+\cross{NSUP}{subtractIfCan} &
+\cross{NSUP}{totalDegree} \\
+\cross{NSUP}{totalDegree} &
+\cross{NSUP}{unit?} \\
+\cross{NSUP}{unitCanonical} &
+\cross{NSUP}{unitNormal} \\
+\cross{NSUP}{univariate} &
+\cross{NSUP}{unmakeSUP} \\
+\cross{NSUP}{variables} &
+\cross{NSUP}{vectorise} \\
+\cross{NSUP}{zero?} &
+\cross{NSUP}{?*?} \\
+\cross{NSUP}{?**?} &
+\cross{NSUP}{?+?} \\
+\cross{NSUP}{?-?} &
+\cross{NSUP}{-?} \\
+\cross{NSUP}{?=?} &
+\cross{NSUP}{?\^{}?} \\
+\cross{NSUP}{?.?} &
+\cross{NSUP}{?\~{}=?} \\
+\cross{NSUP}{?/?} &
+\cross{NSUP}{?$<$?} \\
+\cross{NSUP}{?$<=$?} &
+\cross{NSUP}{?$>$?} \\
+\cross{NSUP}{?$>=$?} &
+\cross{NSUP}{?quo?} \\
+\cross{NSUP}{?rem?} &
+\end{tabular}
+
<<domain NSUP NewSparseUnivariatePolynomial>>=
)abbrev domain NSUP NewSparseUnivariatePolynomial
++ Author: Marc Moreno Maza
@@ -58658,6 +60058,16 @@ o )show None
\pagepic{ps/v103none.ps}{NONE}{1.00}
{\bf See}\\
\pageto{Any}{ANY}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{NONE}{coerce} &
+\cross{NONE}{hash} &
+\cross{NONE}{latex} &
+\cross{NONE}{?=?} &
+\cross{NONE}{?\~{}=?}
+\end{tabular}
+
<<domain NONE None>>=
)abbrev domain NONE None
++ Author:
@@ -58695,6 +60105,41 @@ None():SetCategory == add
\pageto{Integer}{INT}
\pageto{PositiveInteger}{PI}
\pageto{RomanNumeral}{ROMAN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{NNI}{0} &
+\cross{NNI}{1} &
+\cross{NNI}{coerce} &
+\cross{NNI}{divide} &
+\cross{NNI}{exquo} \\
+\cross{NNI}{gcd} &
+\cross{NNI}{hash} &
+\cross{NNI}{latex} &
+\cross{NNI}{max} &
+\cross{NNI}{min} \\
+\cross{NNI}{one?} &
+\cross{NNI}{random} &
+\cross{NNI}{recip} &
+\cross{NNI}{sample} &
+\cross{NNI}{shift} \\
+\cross{NNI}{subtractIfCan} &
+\cross{NNI}{sup} &
+\cross{NNI}{zero?} &
+\cross{NNI}{?\~{}=?} &
+\cross{NNI}{?*?} \\
+\cross{NNI}{?**?} &
+\cross{NNI}{?\^{}?} &
+\cross{NNI}{?+?} &
+\cross{NNI}{?$<$?} &
+\cross{NNI}{?$<=$?} \\
+\cross{NNI}{?=?} &
+\cross{NNI}{?$>$?} &
+\cross{NNI}{?$>=$?} &
+\cross{NNI}{?quo?} &
+\cross{NNI}{?rem?}
+\end{tabular}
+
<<domain NNI NonNegativeInteger>>=
)abbrev domain NNI NonNegativeInteger
++ Author:
@@ -58747,6 +60192,17 @@ NonNegativeInteger:
Join(OrderedAbelianMonoidSup,Monoid) with
\section{domain NIPROB NumericalIntegrationProblem}
\pagehead{NumericalIntegrationProblem}{NIPROB}
\pagepic{ps/v103numericalintegrationproblem.ps}{NIPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{NIPROB}{coerce} &
+\cross{NIPROB}{hash} &
+\cross{NIPROB}{latex} &
+\cross{NIPROB}{retract} &
+\cross{NIPROB}{?=?} &
+\cross{NIPROB}{?\~{}=?}
+\end{tabular}
+
<<domain NIPROB NumericalIntegrationProblem>>=
)abbrev domain NIPROB NumericalIntegrationProblem
++ Author: Brian Dupee
@@ -58822,6 +60278,17 @@ NumericalIntegrationProblem():SetCategory with
\section{domain ODEPROB NumericalODEProblem}
\pagehead{NumericalODEProblem}{ODEPROB}
\pagepic{ps/v103numericalodeproblem.ps}{ODEPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ODEPROB}{coerce} &
+\cross{ODEPROB}{hash} &
+\cross{ODEPROB}{latex} &
+\cross{ODEPROB}{retract} &
+\cross{ODEPROB}{?=?} &
+\cross{ODEPROB}{?\~{}=?}
+\end{tabular}
+
<<domain ODEPROB NumericalODEProblem>>=
)abbrev domain ODEPROB NumericalODEProblem
++ Author: Brian Dupee
@@ -58881,6 +60348,17 @@ NumericalODEProblem():SetCategory with
\section{domain OPTPROB NumericalOptimizationProblem}
\pagehead{NumericalOptimizationProblem}{OPTPROB}
\pagepic{ps/v103numericaloptimizationproblem.ps}{OPTPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{OPTPROB}{coerce} &
+\cross{OPTPROB}{hash} &
+\cross{OPTPROB}{latex} &
+\cross{OPTPROB}{retract} &
+\cross{OPTPROB}{?=?} &
+\cross{OPTPROB}{?\~{}=?}
+\end{tabular}
+
<<domain OPTPROB NumericalOptimizationProblem>>=
)abbrev domain OPTPROB NumericalOptimizationProblem
++ Author: Brian Dupee
@@ -58958,6 +60436,17 @@ NumericalOptimizationProblem():SetCategory with
\section{domain PDEPROB NumericalPDEProblem}
\pagehead{NumericalPDEProblem}{PDEPROB}
\pagepic{ps/v103numericalpdeproblem.ps}{PDEPROB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{PDEPROB}{coerce} &
+\cross{PDEPROB}{hash} &
+\cross{PDEPROB}{latex} &
+\cross{PDEPROB}{retract} &
+\cross{PDEPROB}{?=?} &
+\cross{PDEPROB}{?\~{}=?}
+\end{tabular}
+
<<domain PDEPROB NumericalPDEProblem>>=
)abbrev domain PDEPROB NumericalPDEProblem
++ Author: Brian Dupee
@@ -59310,6 +60799,63 @@ o )show Octonion
@
\pagehead{Octonion}{OCT}
\pagepic{ps/v103octonion.ps}{OCT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OCT}{0} &
+\cross{OCT}{1} &
+\cross{OCT}{abs} &
+\cross{OCT}{characteristic} &
+\cross{OCT}{charthRoot} \\
+\cross{OCT}{coerce} &
+\cross{OCT}{conjugate} &
+\cross{OCT}{convert} &
+\cross{OCT}{eval} &
+\cross{OCT}{hash} \\
+\cross{OCT}{imagE} &
+\cross{OCT}{imagI} &
+\cross{OCT}{imagJ} &
+\cross{OCT}{imagK} &
+\cross{OCT}{imagi} \\
+\cross{OCT}{imagj} &
+\cross{OCT}{imagk} &
+\cross{OCT}{index} &
+\cross{OCT}{inv} &
+\cross{OCT}{latex} \\
+\cross{OCT}{lookup} &
+\cross{OCT}{map} &
+\cross{OCT}{max} &
+\cross{OCT}{min} &
+\cross{OCT}{norm} \\
+\cross{OCT}{octon} &
+\cross{OCT}{one?} &
+\cross{OCT}{random} &
+\cross{OCT}{rational} &
+\cross{OCT}{rational?} \\
+\cross{OCT}{rationalIfCan} &
+\cross{OCT}{real} &
+\cross{OCT}{recip} &
+\cross{OCT}{retract} &
+\cross{OCT}{retractIfCan} \\
+\cross{OCT}{sample} &
+\cross{OCT}{size} &
+\cross{OCT}{subtractIfCan} &
+\cross{OCT}{zero?} &
+\cross{OCT}{?*?} \\
+\cross{OCT}{?**?} &
+\cross{OCT}{?+?} &
+\cross{OCT}{?-?} &
+\cross{OCT}{-?} &
+\cross{OCT}{?=?} \\
+\cross{OCT}{?\^{}?} &
+\cross{OCT}{?\~{}=?} &
+\cross{OCT}{?$<$?} &
+\cross{OCT}{?$<=$?} &
+\cross{OCT}{?$>$?} \\
+\cross{OCT}{?$>=$?} &
+\cross{OCT}{?.?} &&&
+\end{tabular}
+
<<domain OCT Octonion>>=
)abbrev domain OCT Octonion
++ Author: R. Wisbauer, J. Grabmeier
@@ -59387,6 +60933,17 @@ Octonion(R:CommutativeRing): export == impl where
\section{domain ODEIFTBL ODEIntensityFunctionsTable}
\pagehead{ODEIntensityFunctionsTable}{ODEIFTBL}
\pagepic{ps/v103odeintensityfunctionstable.ps}{ODEIFTBL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ODEIFTBL}{clearTheIFTable} &
+\cross{ODEIFTBL}{iFTable} &
+\cross{ODEIFTBL}{insert!} &
+\cross{ODEIFTBL}{keys} &
+\cross{ODEIFTBL}{showIntensityFunctions} &
+\cross{ODEIFTBL}{showTheIFTable}
+\end{tabular}
+
<<domain ODEIFTBL ODEIntensityFunctionsTable>>=
)abbrev domain ODEIFTBL ODEIntensityFunctionsTable
++ Author: Brian Dupee
@@ -59635,6 +61192,74 @@ o )show OneDimensionalArray
\pageto{IndexedFlexibleArray}{IFARRAY}
\pageto{FlexibleArray}{FARRAY}
\pageto{IndexedOneDimensionalArray}{IARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ARRAY1}{any?} &
+\cross{ARRAY1}{coerce} &
+\cross{ARRAY1}{concat} &
+\cross{ARRAY1}{construct} &
+\cross{ARRAY1}{convert} \\
+\cross{ARRAY1}{copy} &
+\cross{ARRAY1}{copyInto!} &
+\cross{ARRAY1}{count} &
+\cross{ARRAY1}{delete} &
+\cross{ARRAY1}{elt} \\
+\cross{ARRAY1}{empty} &
+\cross{ARRAY1}{empty?} &
+\cross{ARRAY1}{entries} &
+\cross{ARRAY1}{entry?} &
+\cross{ARRAY1}{eq?} \\
+\cross{ARRAY1}{eval} &
+\cross{ARRAY1}{every?} &
+\cross{ARRAY1}{fill!} &
+\cross{ARRAY1}{find} &
+\cross{ARRAY1}{first} \\
+\cross{ARRAY1}{hash} &
+\cross{ARRAY1}{index?} &
+\cross{ARRAY1}{indices} &
+\cross{ARRAY1}{insert} &
+\cross{ARRAY1}{latex} \\
+\cross{ARRAY1}{less?} &
+\cross{ARRAY1}{map} &
+\cross{ARRAY1}{map!} &
+\cross{ARRAY1}{max} &
+\cross{ARRAY1}{maxIndex} \\
+\cross{ARRAY1}{member?} &
+\cross{ARRAY1}{members} &
+\cross{ARRAY1}{merge} &
+\cross{ARRAY1}{min} &
+\cross{ARRAY1}{minIndex} \\
+\cross{ARRAY1}{more?} &
+\cross{ARRAY1}{new} &
+\cross{ARRAY1}{oneDimensionalArray} &
+\cross{ARRAY1}{parts} &
+\cross{ARRAY1}{position} \\
+\cross{ARRAY1}{qelt} &
+\cross{ARRAY1}{qsetelt!} &
+\cross{ARRAY1}{reduce} &
+\cross{ARRAY1}{remove} &
+\cross{ARRAY1}{removeDuplicates} \\
+\cross{ARRAY1}{reverse} &
+\cross{ARRAY1}{reverse!} &
+\cross{ARRAY1}{sample} &
+\cross{ARRAY1}{select} &
+\cross{ARRAY1}{setelt} \\
+\cross{ARRAY1}{size?} &
+\cross{ARRAY1}{sort} &
+\cross{ARRAY1}{sort!} &
+\cross{ARRAY1}{sorted?} &
+\cross{ARRAY1}{swap!} \\
+\cross{ARRAY1}{\#{}?} &
+\cross{ARRAY1}{?$<$?} &
+\cross{ARRAY1}{?$<=$?} &
+\cross{ARRAY1}{?=?} &
+\cross{ARRAY1}{?$>$?} \\
+\cross{ARRAY1}{?$>=$?} &
+\cross{ARRAY1}{?\~{}=?} &
+\cross{ARRAY1}{?.?} &&
+\end{tabular}
+
<<domain ARRAY1 OneDimensionalArray>>=
)abbrev domain ARRAY1 OneDimensionalArray
++ This is the domain of 1-based one dimensional arrays
@@ -59674,6 +61299,49 @@ OneDimensionalArray(S:Type): Exports == Implementation
where
\pagepic{ps/v103onepointcompletion.ps}{ONECOMP}{1.00}
{\bf See}\\
\pageto{OrderedCompletion}{ORDCOMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ONECOMP}{0} &
+\cross{ONECOMP}{1} &
+\cross{ONECOMP}{abs} &
+\cross{ONECOMP}{characteristic} &
+\cross{ONECOMP}{coerce} \\
+\cross{ONECOMP}{coerce} &
+\cross{ONECOMP}{finite?} &
+\cross{ONECOMP}{hash} &
+\cross{ONECOMP}{infinite?} &
+\cross{ONECOMP}{infinity} \\
+\cross{ONECOMP}{latex} &
+\cross{ONECOMP}{max} &
+\cross{ONECOMP}{min} &
+\cross{ONECOMP}{negative?} &
+\cross{ONECOMP}{one?} \\
+\cross{ONECOMP}{positive?} &
+\cross{ONECOMP}{rational} &
+\cross{ONECOMP}{rational?} &
+\cross{ONECOMP}{rationalIfCan} &
+\cross{ONECOMP}{recip} \\
+\cross{ONECOMP}{retract} &
+\cross{ONECOMP}{retractIfCan} &
+\cross{ONECOMP}{sample} &
+\cross{ONECOMP}{sign} &
+\cross{ONECOMP}{subtractIfCan} \\
+\cross{ONECOMP}{zero?} &
+\cross{ONECOMP}{-?} &
+\cross{ONECOMP}{?=?} &
+\cross{ONECOMP}{?\~{}=?} &
+\cross{ONECOMP}{?*?} \\
+\cross{ONECOMP}{?**?} &
+\cross{ONECOMP}{?+?} &
+\cross{ONECOMP}{?-?} &
+\cross{ONECOMP}{?$<$?} &
+\cross{ONECOMP}{?$<=$?} \\
+\cross{ONECOMP}{?$>$?} &
+\cross{ONECOMP}{?$>=$?} &
+\cross{ONECOMP}{?\^{}?} &&
+\end{tabular}
+
<<domain ONECOMP OnePointCompletion>>=
)abbrev domain ONECOMP OnePointCompletion
++ Completion with infinity
@@ -59790,6 +61458,17 @@ OnePointCompletion(R:SetCategory): Exports ==
Implementation where
{\bf See}\\
\pageto{OpenMathEncoding}{OMENC}
\pageto{OpenMathDevice}{OMDEV}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{OMCONN}{OMbindTCP} &
+\cross{OMCONN}{OMcloseConn} &
+\cross{OMCONN}{OMconnectTCP} &
+\cross{OMCONN}{OMconnInDevice} &
+\cross{OMCONN}{OMconnOutDevice} &
+\cross{OMCONN}{OMmakeConn}
+\end{tabular}
+
<<domain OMCONN OpenMathConnection>>=
)abbrev domain OMCONN OpenMathConnection
++ Author: Vilya Harvey
@@ -59839,6 +61518,54 @@ OpenMathConnection(): with
{\bf See}\\
\pageto{OpenMathEncoding}{OMENC}
\pageto{OpenMathConnection}{OMCONN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OMDEV}{OMclose} &
+\cross{OMDEV}{OMgetApp} &
+\cross{OMDEV}{OMgetAtp} &
+\cross{OMDEV}{OMgetAttr} &
+\cross{OMDEV}{OMgetBVar} \\
+\cross{OMDEV}{OMgetBind} &
+\cross{OMDEV}{OMgetEndApp} &
+\cross{OMDEV}{OMgetEndAtp} &
+\cross{OMDEV}{OMgetEndAttr} &
+\cross{OMDEV}{OMgetEndBVar} \\
+\cross{OMDEV}{OMgetEndBind} &
+\cross{OMDEV}{OMgetEndError} &
+\cross{OMDEV}{OMgetEndObject} &
+\cross{OMDEV}{OMgetError} &
+\cross{OMDEV}{OMgetFloat} \\
+\cross{OMDEV}{OMgetInteger} &
+\cross{OMDEV}{OMgetObject} &
+\cross{OMDEV}{OMgetString} &
+\cross{OMDEV}{OMgetType} &
+\cross{OMDEV}{OMgetVariable} \\
+\cross{OMDEV}{OMputApp} &
+\cross{OMDEV}{OMputAtp} &
+\cross{OMDEV}{OMputAttr} &
+\cross{OMDEV}{OMputBVar} &
+\cross{OMDEV}{OMputBind} \\
+\cross{OMDEV}{OMputEndApp} &
+\cross{OMDEV}{OMputEndAtp} &
+\cross{OMDEV}{OMputEndAttr} &
+\cross{OMDEV}{OMputEndBVar} &
+\cross{OMDEV}{OMputEndBind} \\
+\cross{OMDEV}{OMputEndError} &
+\cross{OMDEV}{OMputEndObject} &
+\cross{OMDEV}{OMputError} &
+\cross{OMDEV}{OMputObject} &
+\cross{OMDEV}{OMputString} \\
+\cross{OMDEV}{OMgetSymbol} &
+\cross{OMDEV}{OMopenFile} &
+\cross{OMDEV}{OMopenString} &
+\cross{OMDEV}{OMputFloat} &
+\cross{OMDEV}{OMputInteger} \\
+\cross{OMDEV}{OMputSymbol} &
+\cross{OMDEV}{OMputVariable} &
+\cross{OMDEV}{OMsetEncoding} &&
+\end{tabular}
+
<<domain OMDEV OpenMathDevice>>=
)abbrev domain OMDEV OpenMathDevice
++ Author: Vilya Harvey
@@ -60017,6 +61744,20 @@ OpenMathDevice(): with
{\bf See}\\
\pageto{OpenMathDevice}{OMDEV}
\pageto{OpenMathConnection}{OMCONN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{OMENC}{coerce} &
+\cross{OMENC}{hash} &
+\cross{OMENC}{latex} &
+\cross{OMENC}{OMencodingBinary} &
+\cross{OMENC}{OMencodingSGML} &
+\cross{OMENC}{OMencodingUnknown} &
+\cross{OMENC}{OMencodingXML} &
+\cross{OMENC}{?=?} &
+\cross{OMENC}{?\~{}=?}
+\end{tabular}
+
<<domain OMENC OpenMathEncoding>>=
)abbrev domain OMENC OpenMathEncoding
++ Author: Vilya Harvey
@@ -60075,6 +61816,19 @@ OpenMathEncoding(): SetCategory with
\pagepic{ps/v103openmatherror.ps}{OMERR}{1.00}
{\bf See}\\
\pageto{OpenMathErrorKind}{OMERRK}
+
+{\bf Exports:}\\
+\begin{tabular}{llllllll}
+\cross{OMERR}{coerce} &
+\cross{OMERR}{errorInfo} &
+\cross{OMERR}{errorKind} &
+\cross{OMERR}{hash} &
+\cross{OMERR}{latex} &
+\cross{OMERR}{omError} &
+\cross{OMERR}{?=?} &
+\cross{OMERR}{?~=?}
+\end{tabular}
+
<<domain OMERR OpenMathError>>=
)abbrev domain OMERR OpenMathError
++ Author: Vilya Harvey
@@ -60132,6 +61886,20 @@ OpenMathError() : SetCategory with
\pagepic{ps/v103openmatherrorkind.ps}{OMERRK}{1.00}
{\bf See}\\
\pageto{OpenMathError}{OMERR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllllllll}
+\cross{OMERRK}{OMParseError?} &
+\cross{OMERRK}{OMReadError?} &
+\cross{OMERRK}{OMUnknownCD?} &
+\cross{OMERRK}{OMUnknownSymbol?} &
+\cross{OMERRK}{coerce} &
+\cross{OMERRK}{hash} &
+\cross{OMERRK}{latex} &
+\cross{OMERRK}{?=?} &
+\cross{OMERRK}{?\~{}=?}
+\end{tabular}
+
<<domain OMERRK OpenMathErrorKind>>=
)abbrev domain OMERRK OpenMathErrorKind
++ Author: Vilya Harvey
@@ -60578,6 +62346,40 @@ o )show Operator
\pagepic{ps/v103operator.ps}{OP}{1.00}
{\bf See}\\
\pageto{ModuleOperator}{MODOP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{MODOP}{0} &
+\cross{MODOP}{1} &
+\cross{MODOP}{adjoint} &
+\cross{MODOP}{characteristic} &
+\cross{MODOP}{charthRoot} \\
+\cross{MODOP}{coerce} &
+\cross{MODOP}{conjug} &
+\cross{MODOP}{evaluate} &
+\cross{MODOP}{evaluateInverse} &
+\cross{MODOP}{makeop} \\
+\cross{MODOP}{hash} &
+\cross{MODOP}{latex} &
+\cross{MODOP}{one?} &
+\cross{MODOP}{opeval} &
+\cross{MODOP}{recip} \\
+\cross{MODOP}{retract} &
+\cross{MODOP}{retractIfCan} &
+\cross{MODOP}{sample} &
+\cross{MODOP}{subtractIfCan} &
+\cross{MODOP}{zero?} \\
+\cross{MODOP}{?\~{}=?} &
+\cross{MODOP}{?*?} &
+\cross{MODOP}{?**?} &
+\cross{MODOP}{?\^{}?} &
+\cross{MODOP}{?.?} \\
+\cross{MODOP}{?+?} &
+\cross{MODOP}{?-?} &
+\cross{MODOP}{-?} &
+\cross{MODOP}{?=?} &
+\end{tabular}
+
<<domain OP Operator>>=
)abbrev domain OP Operator
++ Author: Manuel Bronstein
@@ -60602,6 +62404,40 @@ Operator(R: Ring) == ModuleOperator(R,R)
\pageto{OrdinaryDifferentialRing}{ODR}
\pageto{DirectProductModule}{DPMO}
\pageto{DirectProductMatrixModule}{DPMM}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OMLO}{0} &
+\cross{OMLO}{1} &
+\cross{OMLO}{characteristic} &
+\cross{OMLO}{coefficient} &
+\cross{OMLO}{coerce} \\
+\cross{OMLO}{D} &
+\cross{OMLO}{degree} &
+\cross{OMLO}{differentiate} &
+\cross{OMLO}{hash} &
+\cross{OMLO}{latex} \\
+\cross{OMLO}{leadingCoefficient} &
+\cross{OMLO}{minimumDegree} &
+\cross{OMLO}{monomial} &
+\cross{OMLO}{one?} &
+\cross{OMLO}{op} \\
+\cross{OMLO}{po} &
+\cross{OMLO}{recip} &
+\cross{OMLO}{reductum} &
+\cross{OMLO}{sample} &
+\cross{OMLO}{subtractIfCan} \\
+\cross{OMLO}{zero?} &
+\cross{OMLO}{?\^{}?} &
+\cross{OMLO}{?\~{}=?} &
+\cross{OMLO}{?*?} &
+\cross{OMLO}{?**?} \\
+\cross{OMLO}{?+?} &
+\cross{OMLO}{?-?} &
+\cross{OMLO}{-?} &
+\cross{OMLO}{?=?} &
+\end{tabular}
+
<<domain OMLO OppositeMonogenicLinearOperator>>=
)abbrev domain OMLO OppositeMonogenicLinearOperator
++ Author: Stephen M. Watt
@@ -60651,6 +62487,50 @@ OppositeMonogenicLinearOperator(P, R): OPRcat ==
OPRdef where
\pagepic{ps/v103orderedcompletion.ps}{ORDCOMP}{1.00}
{\bf See}\\
\pageto{OnePointCompletion}{ONECOMP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ORDCOMP}{0} &
+\cross{ORDCOMP}{1} &
+\cross{ORDCOMP}{abs} &
+\cross{ORDCOMP}{characteristic} &
+\cross{ORDCOMP}{coerce} \\
+\cross{ORDCOMP}{finite?} &
+\cross{ORDCOMP}{hash} &
+\cross{ORDCOMP}{infinite?} &
+\cross{ORDCOMP}{latex} &
+\cross{ORDCOMP}{max} \\
+\cross{ORDCOMP}{min} &
+\cross{ORDCOMP}{minusInfinity} &
+\cross{ORDCOMP}{negative?} &
+\cross{ORDCOMP}{one?} &
+\cross{ORDCOMP}{plusInfinity} \\
+\cross{ORDCOMP}{positive?} &
+\cross{ORDCOMP}{rational} &
+\cross{ORDCOMP}{rational?} &
+\cross{ORDCOMP}{rationalIfCan} &
+\cross{ORDCOMP}{recip} \\
+\cross{ORDCOMP}{retract} &
+\cross{ORDCOMP}{retractIfCan} &
+\cross{ORDCOMP}{sample} &
+\cross{ORDCOMP}{sign} &
+\cross{ORDCOMP}{subtractIfCan} \\
+\cross{ORDCOMP}{whatInfinity} &
+\cross{ORDCOMP}{zero?} &
+\cross{ORDCOMP}{?\~{}=?} &
+\cross{ORDCOMP}{?*?} &
+\cross{ORDCOMP}{?**?} \\
+\cross{ORDCOMP}{?+?} &
+\cross{ORDCOMP}{?-?} &
+\cross{ORDCOMP}{?$<$?} &
+\cross{ORDCOMP}{?$<=$?} &
+\cross{ORDCOMP}{?$>$?} \\
+\cross{ORDCOMP}{?$>=$?} &
+\cross{ORDCOMP}{?\^{}?} &
+\cross{ORDCOMP}{-?} &
+\cross{ORDCOMP}{?=?} &
+\end{tabular}
+
<<domain ORDCOMP OrderedCompletion>>=
)abbrev domain ORDCOMP OrderedCompletion
++ Completion with + and - infinity
@@ -60793,6 +62673,86 @@ OrderedCompletion(R:SetCategory): Exports ==
Implementation where
{\bf See}\\
\pageto{HomogeneousDirectProduct}{HDP}
\pageto{SplitHomogeneousDirectProduct}{SHDP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ODP}{0} &
+\cross{ODP}{1} &
+\cross{ODP}{abs} &
+\cross{ODP}{any?} &
+\cross{ODP}{characteristic} \\
+\cross{ODP}{coerce} &
+\cross{ODP}{copy} &
+\cross{ODP}{count} &
+\cross{ODP}{D} &
+\cross{ODP}{differentiate} \\
+\cross{ODP}{dimension} &
+\cross{ODP}{directProduct} &
+\cross{ODP}{dot} &
+\cross{ODP}{elt} &
+\cross{ODP}{empty} \\
+\cross{ODP}{empty?} &
+\cross{ODP}{entries} &
+\cross{ODP}{entry?} &
+\cross{ODP}{eq?} &
+\cross{ODP}{eval} \\
+\cross{ODP}{every?} &
+\cross{ODP}{fill!} &
+\cross{ODP}{first} &
+\cross{ODP}{hash} &
+\cross{ODP}{index} \\
+\cross{ODP}{index?} &
+\cross{ODP}{indices} &
+\cross{ODP}{latex} &
+\cross{ODP}{less?} &
+\cross{ODP}{lookup} \\
+\cross{ODP}{map} &
+\cross{ODP}{map!} &
+\cross{ODP}{max} &
+\cross{ODP}{maxIndex} &
+\cross{ODP}{member?} \\
+\cross{ODP}{members} &
+\cross{ODP}{min} &
+\cross{ODP}{minIndex} &
+\cross{ODP}{more?} &
+\cross{ODP}{negative?} \\
+\cross{ODP}{one?} &
+\cross{ODP}{parts} &
+\cross{ODP}{positive?} &
+\cross{ODP}{qelt} &
+\cross{ODP}{qsetelt!} \\
+\cross{ODP}{random} &
+\cross{ODP}{recip} &
+\cross{ODP}{reducedSystem} &
+\cross{ODP}{retract} &
+\cross{ODP}{retractIfCan} \\
+\cross{ODP}{sample} &
+\cross{ODP}{setelt} &
+\cross{ODP}{sign} &
+\cross{ODP}{size} &
+\cross{ODP}{size?} \\
+\cross{ODP}{subtractIfCan} &
+\cross{ODP}{sup} &
+\cross{ODP}{swap!} &
+\cross{ODP}{unitVector} &
+\cross{ODP}{zero?} \\
+\cross{ODP}{\#{}?} &
+\cross{ODP}{?*?} &
+\cross{ODP}{?**?} &
+\cross{ODP}{?+?} &
+\cross{ODP}{?-?} \\
+\cross{ODP}{?/?} &
+\cross{ODP}{?$<$?} &
+\cross{ODP}{?$<=$?} &
+\cross{ODP}{?=?} &
+\cross{ODP}{?$>$?} \\
+\cross{ODP}{?$>=$?} &
+\cross{ODP}{?\^{}?} &
+\cross{ODP}{?\~{}=?} &
+\cross{ODP}{-?} &
+\cross{ODP}{?.?}
+\end{tabular}
+
<<domain ODP OrderedDirectProduct>>=
)abbrev domain ODP OrderedDirectProduct
-- all direct product category domains must be compiled
@@ -60835,6 +62795,47 @@ OrderedDirectProduct(dim:NonNegativeInteger,
\section{domain OFMONOID OrderedFreeMonoid}
\pagehead{OrderedFreeMonoid}{OFMONOID}
\pagepic{ps/v103orderedfreemonoid.ps}{OFMONOID}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OFMONOID}{1} &
+\cross{OFMONOID}{coerce} &
+\cross{OFMONOID}{factors} &
+\cross{OFMONOID}{first} &
+\cross{OFMONOID}{hash} \\
+\cross{OFMONOID}{hclf} &
+\cross{OFMONOID}{hcrf} &
+\cross{OFMONOID}{latex} &
+\cross{OFMONOID}{length} &
+\cross{OFMONOID}{lexico} \\
+\cross{OFMONOID}{lquo} &
+\cross{OFMONOID}{max} &
+\cross{OFMONOID}{min} &
+\cross{OFMONOID}{mirror} &
+\cross{OFMONOID}{nthExpon} \\
+\cross{OFMONOID}{nthFactor} &
+\cross{OFMONOID}{one?} &
+\cross{OFMONOID}{overlap} &
+\cross{OFMONOID}{recip} &
+\cross{OFMONOID}{rest} \\
+\cross{OFMONOID}{retract} &
+\cross{OFMONOID}{retractIfCan} &
+\cross{OFMONOID}{rquo} &
+\cross{OFMONOID}{sample} &
+\cross{OFMONOID}{size} \\
+\cross{OFMONOID}{varList} &
+\cross{OFMONOID}{?*?} &
+\cross{OFMONOID}{?**?} &
+\cross{OFMONOID}{?$<$?} &
+\cross{OFMONOID}{?$<=$?} \\
+\cross{OFMONOID}{?=?} &
+\cross{OFMONOID}{?$>$?} &
+\cross{OFMONOID}{?$>=$?} &
+\cross{OFMONOID}{?\^{}?} &
+\cross{OFMONOID}{?\~{}=?} \\
+\cross{OFMONOID}{?div?} &&&&
+\end{tabular}
+
<<domain OFMONOID OrderedFreeMonoid>>=
)abbrev domain OFMONOID OrderedFreeMonoid
++ Author: Michel Petitot address@hidden
@@ -61093,6 +63094,28 @@ o )show OrderedVariableList
@
\pagehead{OrderedVariableList}{OVAR}
\pagepic{ps/v103orderedvariablelist.ps}{OVAR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OVAR}{coerce} &
+\cross{OVAR}{convert} &
+\cross{OVAR}{hash} &
+\cross{OVAR}{index} &
+\cross{OVAR}{latex} \\
+\cross{OVAR}{lookup} &
+\cross{OVAR}{max} &
+\cross{OVAR}{min} &
+\cross{OVAR}{random} &
+\cross{OVAR}{size} \\
+\cross{OVAR}{variable} &
+\cross{OVAR}{?\~{}=?} &
+\cross{OVAR}{?$<$?} &
+\cross{OVAR}{?$<=$?} &
+\cross{OVAR}{?=?} \\
+\cross{OVAR}{?$>$?} &
+\cross{OVAR}{?$>=$?} &&&
+\end{tabular}
+
<<domain OVAR OrderedVariableList>>=
)abbrev domain OVAR OrderedVariableList
++ Description:
@@ -61789,6 +63812,103 @@ o )show OrderlyDifferentialPolynomial
@
\pagehead{OrderlyDifferentialPolynomial}{ODPOL}
\pagepic{ps/v103orderlydifferentialpolynomial.ps}{ODPOL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{ODPOL}{0} &
+\cross{ODPOL}{1} &
+\cross{ODPOL}{associates?} \\
+\cross{ODPOL}{binomThmExpt} &
+\cross{ODPOL}{characteristic} &
+\cross{ODPOL}{charthRoot} \\
+\cross{ODPOL}{coefficient} &
+\cross{ODPOL}{coefficients} &
+\cross{ODPOL}{coerce} \\
+\cross{ODPOL}{conditionP} &
+\cross{ODPOL}{content} &
+\cross{ODPOL}{D} \\
+\cross{ODPOL}{degree} &
+\cross{ODPOL}{differentialVariables} &
+\cross{ODPOL}{differentiate} \\
+\cross{ODPOL}{discriminant} &
+\cross{ODPOL}{eval} &
+\cross{ODPOL}{exquo} \\
+\cross{ODPOL}{factor} &
+\cross{ODPOL}{factorPolynomial} &
+\cross{ODPOL}{factorSquareFreePolynomial} \\
+\cross{ODPOL}{gcd} &
+\cross{ODPOL}{gcdPolynomial} &
+\cross{ODPOL}{ground} \\
+\cross{ODPOL}{ground?} &
+\cross{ODPOL}{hash} &
+\cross{ODPOL}{initial} \\
+\cross{ODPOL}{isExpt} &
+\cross{ODPOL}{isobaric?} &
+\cross{ODPOL}{isPlus} \\
+\cross{ODPOL}{isTimes} &
+\cross{ODPOL}{latex} &
+\cross{ODPOL}{lcm} \\
+\cross{ODPOL}{leader} &
+\cross{ODPOL}{leadingCoefficient} &
+\cross{ODPOL}{leadingMonomial} \\
+\cross{ODPOL}{mainVariable} &
+\cross{ODPOL}{map} &
+\cross{ODPOL}{mapExponents} \\
+\cross{ODPOL}{max} &
+\cross{ODPOL}{min} &
+\cross{ODPOL}{minimumDegree} \\
+\cross{ODPOL}{monicDivide} &
+\cross{ODPOL}{monomial} &
+\cross{ODPOL}{monomial?} \\
+\cross{ODPOL}{monomials} &
+\cross{ODPOL}{multivariate} &
+\cross{ODPOL}{numberOfMonomials} \\
+\cross{ODPOL}{one?} &
+\cross{ODPOL}{order} &
+\cross{ODPOL}{patternMatch} \\
+\cross{ODPOL}{pomopo!} &
+\cross{ODPOL}{prime?} &
+\cross{ODPOL}{primitiveMonomials} \\
+\cross{ODPOL}{primitivePart} &
+\cross{ODPOL}{recip} &
+\cross{ODPOL}{reducedSystem} \\
+\cross{ODPOL}{reductum} &
+\cross{ODPOL}{resultant} &
+\cross{ODPOL}{retract} \\
+\cross{ODPOL}{retractIfCan} &
+\cross{ODPOL}{sample} &
+\cross{ODPOL}{separant} \\
+\cross{ODPOL}{solveLinearPolynomialEquation} &
+\cross{ODPOL}{squareFree} &
+\cross{ODPOL}{squareFreePart} \\
+\cross{ODPOL}{squareFreePolynomial} &
+\cross{ODPOL}{subtractIfCan} &
+\cross{ODPOL}{totalDegree} \\
+\cross{ODPOL}{totalDegree} &
+\cross{ODPOL}{unit?} &
+\cross{ODPOL}{unitCanonical} \\
+\cross{ODPOL}{unitNormal} &
+\cross{ODPOL}{univariate} &
+\cross{ODPOL}{univariate} \\
+\cross{ODPOL}{variables} &
+\cross{ODPOL}{weight} &
+\cross{ODPOL}{weights} \\
+\cross{ODPOL}{zero?} &
+\cross{ODPOL}{?*?} &
+\cross{ODPOL}{?**?} \\
+\cross{ODPOL}{?+?} &
+\cross{ODPOL}{?-?} &
+\cross{ODPOL}{-?} \\
+\cross{ODPOL}{?=?} &
+\cross{ODPOL}{?\^{}?} &
+\cross{ODPOL}{?\~{}=?} \\
+\cross{ODPOL}{?/?} &
+\cross{ODPOL}{?$<$?} &
+\cross{ODPOL}{?$<=$?} \\
+\cross{ODPOL}{?$>$?} &
+\cross{ODPOL}{?$>=$?} &
+\end{tabular}
+
<<domain ODPOL OrderlyDifferentialPolynomial>>=
)abbrev domain ODPOL OrderlyDifferentialPolynomial
++ Author: William Sit
@@ -61838,6 +63958,29 @@ OrderlyDifferentialPolynomial(R):
\pageto{DifferentialSparseMultivariatePolynomial}{DSMP}
\pageto{OrderlyDifferentialPolynomial}{ODPOL}
\pageto{SequentialDifferentialPolynomial}{SDPOL}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{ODVAR}{coerce} &
+\cross{ODVAR}{differentiate} &
+\cross{ODVAR}{hash} &
+\cross{ODVAR}{latex} &
+\cross{ODVAR}{makeVariable} \\
+\cross{ODVAR}{max} &
+\cross{ODVAR}{min} &
+\cross{ODVAR}{order} &
+\cross{ODVAR}{retract} &
+\cross{ODVAR}{retractIfCan} \\
+\cross{ODVAR}{variable} &
+\cross{ODVAR}{weight} &
+\cross{ODVAR}{?\~{}=?} &
+\cross{ODVAR}{?$<$?} &
+\cross{ODVAR}{?$<=$?} \\
+\cross{ODVAR}{?=?} &
+\cross{ODVAR}{?$>$?} &
+\cross{ODVAR}{?$>=$?} &&
+\end{tabular}
+
<<domain ODVAR OrderlyDifferentialVariable>>=
)abbrev domain ODVAR OrderlyDifferentialVariable
++ Author: William Sit
@@ -61887,6 +64030,55 @@
OrderlyDifferentialVariable(S:OrderedSet):DifferentialVariableCategory(S)
\pageto{OppositeMonogenicLinearOperator}{OMLO}
\pageto{DirectProductModule}{DPMO}
\pageto{DirectProductMatrixModule}{DPMM}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{ODR}{0} &
+\cross{ODR}{1} &
+\cross{ODR}{associates?} &
+\cross{ODR}{characteristic} \\
+\cross{ODR}{coerce} &
+\cross{ODR}{D} &
+\cross{ODR}{differentiate} &
+\cross{ODR}{divide} \\
+\cross{ODR}{euclideanSize} &
+\cross{ODR}{expressIdealMember} &
+\cross{ODR}{exquo} &
+\cross{ODR}{extendedEuclidean} \\
+\cross{ODR}{factor} &
+\cross{ODR}{gcd} &
+\cross{ODR}{gcdPolynomial} &
+\cross{ODR}{hash} \\
+\cross{ODR}{inv} &
+\cross{ODR}{latex} &
+\cross{ODR}{lcm} &
+\cross{ODR}{multiEuclidean} \\
+\cross{ODR}{one?} &
+\cross{ODR}{prime?} &
+\cross{ODR}{principalIdeal} &
+\cross{ODR}{recip} \\
+\cross{ODR}{sample} &
+\cross{ODR}{sizeLess?} &
+\cross{ODR}{squareFree} &
+\cross{ODR}{squareFreePart} \\
+\cross{ODR}{subtractIfCan} &
+\cross{ODR}{unit?} &
+\cross{ODR}{unitCanonical} &
+\cross{ODR}{unitNormal} \\
+\cross{ODR}{zero?} &
+\cross{ODR}{?*?} &
+\cross{ODR}{?**?} &
+\cross{ODR}{?+?} \\
+\cross{ODR}{?-?} &
+\cross{ODR}{-?} &
+\cross{ODR}{?=?} &
+\cross{ODR}{?\^{}?} \\
+\cross{ODR}{?\~{}=?} &
+\cross{ODR}{?/?} &
+\cross{ODR}{?quo?} &
+\cross{ODR}{?rem?}
+\end{tabular}
+
<<domain ODR OrdinaryDifferentialRing>>=
)abbrev domain ODR OrdinaryDifferentialRing
++ Author: Stephen M. Watt
@@ -61936,6 +64128,32 @@ OrdinaryDifferentialRing(Kernels,R,var): DRcategory ==
DRcapsule where
\section{domain OWP OrdinaryWeightedPolynomials}
\pagehead{OrdinaryWeightedPolynomials}{OWP}
\pagepic{ps/v103ordinaryweightedpolynomials.ps}{OWP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OWP}{0} &
+\cross{OWP}{1} &
+\cross{OWP}{changeWeightLevel} &
+\cross{OWP}{characteristic} &
+\cross{OWP}{coerce} \\
+\cross{OWP}{hash} &
+\cross{OWP}{latex} &
+\cross{OWP}{one?} &
+\cross{OWP}{recip} &
+\cross{OWP}{sample} \\
+\cross{OWP}{subtractIfCan} &
+\cross{OWP}{zero?} &
+\cross{OWP}{?*?} &
+\cross{OWP}{?**?} &
+\cross{OWP}{?+?} \\
+\cross{OWP}{?-?} &
+\cross{OWP}{-?} &
+\cross{OWP}{?=?} &
+\cross{OWP}{?\^{}?} &
+\cross{OWP}{?\~{}=?} \\
+\cross{OWP}{?/?} &&&&
+\end{tabular}
+
<<domain OWP OrdinaryWeightedPolynomials>>=
)abbrev domain OWP OrdinaryWeightedPolynomials
++ Author: James Davenport
@@ -61988,6 +64206,23 @@ OrdinaryWeightedPolynomials(R:Ring,
{\bf See}\\
\pageto{Commutator}{COMM}
\pageto{FreeNilpotentLie}{FNLA}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OSI}{coerce} &
+\cross{OSI}{hash} &
+\cross{OSI}{latex} &
+\cross{OSI}{max} &
+\cross{OSI}{min} \\
+\cross{OSI}{value} &
+\cross{OSI}{?\~{}=?} &
+\cross{OSI}{?$<$?} &
+\cross{OSI}{?$<=$?} &
+\cross{OSI}{?=?} \\
+\cross{OSI}{?$>$?} &
+\cross{OSI}{?$>=$?} &&&
+\end{tabular}
+
<<domain OSI OrdSetInts>>=
)abbrev domain OSI OrdSetInts
++ Author : Larry Lambe
@@ -62032,6 +64267,91 @@ OrdSetInts: Export == Implement where
\section{domain OUTFORM OutputForm}
\pagehead{OutputForm}{OUTFORM}
\pagepic{ps/v103outputform.ps}{OUTFORM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{OUTFORM}{assign} &
+\cross{OUTFORM}{binomial} &
+\cross{OUTFORM}{blankSeparate} &
+\cross{OUTFORM}{box} &
+\cross{OUTFORM}{brace} \\
+\cross{OUTFORM}{bracket} &
+\cross{OUTFORM}{center} &
+\cross{OUTFORM}{coerce} &
+\cross{OUTFORM}{commaSeparate} &
+\cross{OUTFORM}{differentiate} \\
+\cross{OUTFORM}{dot} &
+\cross{OUTFORM}{empty} &
+\cross{OUTFORM}{exquo} &
+\cross{OUTFORM}{hash} &
+\cross{OUTFORM}{hconcat} \\
+\cross{OUTFORM}{height} &
+\cross{OUTFORM}{hspace} &
+\cross{OUTFORM}{infix} &
+\cross{OUTFORM}{infix?} &
+\cross{OUTFORM}{int} \\
+\cross{OUTFORM}{label} &
+\cross{OUTFORM}{latex} &
+\cross{OUTFORM}{left} &
+\cross{OUTFORM}{matrix} &
+\cross{OUTFORM}{message} \\
+\cross{OUTFORM}{messagePrint} &
+\cross{OUTFORM}{not?} &
+\cross{OUTFORM}{outputForm} &
+\cross{OUTFORM}{over} &
+\cross{OUTFORM}{overbar} \\
+\cross{OUTFORM}{overlabel} &
+\cross{OUTFORM}{paren} &
+\cross{OUTFORM}{pile} &
+\cross{OUTFORM}{postfix} &
+\cross{OUTFORM}{prefix} \\
+\cross{OUTFORM}{presub} &
+\cross{OUTFORM}{presuper} &
+\cross{OUTFORM}{prime} &
+\cross{OUTFORM}{print} &
+\cross{OUTFORM}{prod} \\
+\cross{OUTFORM}{quote} &
+\cross{OUTFORM}{rarrow} &
+\cross{OUTFORM}{right} &
+\cross{OUTFORM}{root} &
+\cross{OUTFORM}{rspace} \\
+\cross{OUTFORM}{scripts} &
+\cross{OUTFORM}{semicolonSeparate} &
+\cross{OUTFORM}{slash} &
+\cross{OUTFORM}{string} &
+\cross{OUTFORM}{sub} \\
+\cross{OUTFORM}{subHeight} &
+\cross{OUTFORM}{sum} &
+\cross{OUTFORM}{super} &
+\cross{OUTFORM}{superHeight} &
+\cross{OUTFORM}{supersub} \\
+\cross{OUTFORM}{vconcat} &
+\cross{OUTFORM}{vspace} &
+\cross{OUTFORM}{width} &
+\cross{OUTFORM}{zag} &
+\cross{OUTFORM}{?*?} \\
+\cross{OUTFORM}{?**?} &
+\cross{OUTFORM}{?+?} &
+\cross{OUTFORM}{-?} &
+\cross{OUTFORM}{?-?} &
+\cross{OUTFORM}{?/?} \\
+\cross{OUTFORM}{?$<$?} &
+\cross{OUTFORM}{?$<=$?} &
+\cross{OUTFORM}{?=?} &
+\cross{OUTFORM}{?$>$?} &
+\cross{OUTFORM}{?$>=$?} \\
+\cross{OUTFORM}{?SEGMENT} &
+\cross{OUTFORM}{?..?} &
+\cross{OUTFORM}{?\^{}=?} &
+\cross{OUTFORM}{?and?} &
+\cross{OUTFORM}{?div?} \\
+\cross{OUTFORM}{?.?} &
+\cross{OUTFORM}{?or?} &
+\cross{OUTFORM}{?quo?} &
+\cross{OUTFORM}{?rem?} &
+\cross{OUTFORM}{?\~{}=?}
+\end{tabular}
+
<<domain OUTFORM OutputForm>>=
)abbrev domain OUTFORM OutputForm
++ Keywords: output, I/O, expression
@@ -62504,6 +64824,58 @@ OutputForm(): SetCategory with
\pageto{PAdicRationalConstructor}{PADICRC}
\pageto{PAdicRational}{PADICRAT}
\pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PADIC}{0} &
+\cross{PADIC}{1} &
+\cross{PADIC}{approximate} &
+\cross{PADIC}{associates?} &
+\cross{PADIC}{characteristic} \\
+\cross{PADIC}{coerce} &
+\cross{PADIC}{complete} &
+\cross{PADIC}{digits} &
+\cross{PADIC}{divide} &
+\cross{PADIC}{euclideanSize} \\
+\cross{PADIC}{expressIdealMember} &
+\cross{PADIC}{exquo} &
+\cross{PADIC}{extend} &
+\cross{PADIC}{extendedEuclidean} &
+\cross{PADIC}{gcd} \\
+\cross{PADIC}{gcdPolynomial} &
+\cross{PADIC}{hash} &
+\cross{PADIC}{latex} &
+\cross{PADIC}{lcm} &
+\cross{PADIC}{lcm} \\
+\cross{PADIC}{moduloP} &
+\cross{PADIC}{modulus} &
+\cross{PADIC}{multiEuclidean} &
+\cross{PADIC}{one?} &
+\cross{PADIC}{order} \\
+\cross{PADIC}{principalIdeal} &
+\cross{PADIC}{quotientByP} &
+\cross{PADIC}{recip} &
+\cross{PADIC}{root} &
+\cross{PADIC}{sample} \\
+\cross{PADIC}{sizeLess?} &
+\cross{PADIC}{sqrt} &
+\cross{PADIC}{subtractIfCan} &
+\cross{PADIC}{unit?} &
+\cross{PADIC}{unitCanonical} \\
+\cross{PADIC}{unitNormal} &
+\cross{PADIC}{zero?} &
+\cross{PADIC}{?*?} &
+\cross{PADIC}{?**?} &
+\cross{PADIC}{?+?} \\
+\cross{PADIC}{?-?} &
+\cross{PADIC}{-?} &
+\cross{PADIC}{?=?} &
+\cross{PADIC}{?\^{}?} &
+\cross{PADIC}{?\~{}=?} \\
+\cross{PADIC}{?quo?} &
+\cross{PADIC}{?rem?} &&&
+\end{tabular}
+
<<domain PADIC PAdicInteger>>=
)abbrev domain PADIC PAdicInteger
++ Author: Clifton J. Williamson
@@ -62539,6 +64911,93 @@ PAdicInteger(p:Integer) ==
InnerPAdicInteger(p,true$Boolean)
\pageto{BalancedPAdicInteger}{BPADIC}
\pageto{PAdicRationalConstructor}{PADICRC}
\pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PADICRAT}{0} &
+\cross{PADICRAT}{1} &
+\cross{PADICRAT}{abs} \\
+\cross{PADICRAT}{approximate} &
+\cross{PADICRAT}{associates?} &
+\cross{PADICRAT}{ceiling} \\
+\cross{PADICRAT}{characteristic} &
+\cross{PADICRAT}{charthRoot} &
+\cross{PADICRAT}{coerce} \\
+\cross{PADICRAT}{conditionP} &
+\cross{PADICRAT}{continuedFraction} &
+\cross{PADICRAT}{convert} \\
+\cross{PADICRAT}{D} &
+\cross{PADICRAT}{denom} &
+\cross{PADICRAT}{denominator} \\
+\cross{PADICRAT}{differentiate} &
+\cross{PADICRAT}{divide} &
+\cross{PADICRAT}{euclideanSize} \\
+\cross{PADICRAT}{eval} &
+\cross{PADICRAT}{expressIdealMember} &
+\cross{PADICRAT}{exquo} \\
+\cross{PADICRAT}{extendedEuclidean} &
+\cross{PADICRAT}{factor} &
+\cross{PADICRAT}{factorPolynomial} \\
+\cross{PADICRAT}{factorSquareFreePolynomial} &
+\cross{PADICRAT}{floor} &
+\cross{PADICRAT}{fractionPart} \\
+\cross{PADICRAT}{gcd} &
+\cross{PADICRAT}{gcdPolynomial} &
+\cross{PADICRAT}{hash} \\
+\cross{PADICRAT}{init} &
+\cross{PADICRAT}{inv} &
+\cross{PADICRAT}{latex} \\
+\cross{PADICRAT}{lcm} &
+\cross{PADICRAT}{map} &
+\cross{PADICRAT}{max} \\
+\cross{PADICRAT}{min} &
+\cross{PADICRAT}{multiEuclidean} &
+\cross{PADICRAT}{negative?} \\
+\cross{PADICRAT}{nextItem} &
+\cross{PADICRAT}{numer} &
+\cross{PADICRAT}{numerator} \\
+\cross{PADICRAT}{one?} &
+\cross{PADICRAT}{patternMatch} &
+\cross{PADICRAT}{positive?} \\
+\cross{PADICRAT}{prime?} &
+\cross{PADICRAT}{principalIdeal} &
+\cross{PADICRAT}{random} \\
+\cross{PADICRAT}{recip} &
+\cross{PADICRAT}{reducedSystem} &
+\cross{PADICRAT}{removeZeroes} \\
+\cross{PADICRAT}{retract} &
+\cross{PADICRAT}{retractIfCan} &
+\cross{PADICRAT}{sample} \\
+\cross{PADICRAT}{sign} &
+\cross{PADICRAT}{sizeLess?} &
+\cross{PADICRAT}{solveLinearPolynomialEquation} \\
+\cross{PADICRAT}{squareFree} &
+\cross{PADICRAT}{squareFreePart} &
+\cross{PADICRAT}{squareFreePolynomial} \\
+\cross{PADICRAT}{subtractIfCan} &
+\cross{PADICRAT}{unit?} &
+\cross{PADICRAT}{unitCanonical} \\
+\cross{PADICRAT}{unitNormal} &
+\cross{PADICRAT}{wholePart} &
+\cross{PADICRAT}{zero?} \\
+\cross{PADICRAT}{?*?} &
+\cross{PADICRAT}{?**?} &
+\cross{PADICRAT}{?+?} \\
+\cross{PADICRAT}{?-?} &
+\cross{PADICRAT}{-?} &
+\cross{PADICRAT}{?/?} \\
+\cross{PADICRAT}{?=?} &
+\cross{PADICRAT}{?\^{}?} &
+\cross{PADICRAT}{?\~{}=?} \\
+\cross{PADICRAT}{?$<$?} &
+\cross{PADICRAT}{?$<=$?} &
+\cross{PADICRAT}{?$>$?} \\
+\cross{PADICRAT}{?$>=$?} &
+\cross{PADICRAT}{?.?} &
+\cross{PADICRAT}{?quo?} \\
+\cross{PADICRAT}{?rem?} &&
+\end{tabular}
+
<<domain PADICRAT PAdicRational>>=
)abbrev domain PADICRAT PAdicRational
++ Author: Clifton J. Williamson
@@ -62574,6 +65033,94 @@ PAdicRational(p:Integer) ==
PAdicRationalConstructor(p,PAdicInteger p)
\pageto{BalancedPAdicInteger}{BPADIC}
\pageto{PAdicRational}{PADICRAT}
\pageto{BalancedPAdicRational}{BPADICRT}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{PADICRC}{0} &
+\cross{PADICRC}{1} &
+\cross{PADICRC}{abs} &
+\cross{PADICRC}{approximate} \\
+\cross{PADICRC}{associates?} &
+\cross{PADICRC}{ceiling} &
+\cross{PADICRC}{characteristic} &
+\cross{PADICRC}{charthRoot} \\
+\cross{PADICRC}{coerce} &
+\cross{PADICRC}{conditionP} &
+\cross{PADICRC}{continuedFraction} &
+\cross{PADICRC}{convert} \\
+\cross{PADICRC}{D} &
+\cross{PADICRC}{denom} &
+\cross{PADICRC}{denominator} &
+\cross{PADICRC}{differentiate} \\
+\cross{PADICRC}{divide} &
+\cross{PADICRC}{euclideanSize} &
+\cross{PADICRC}{eval} &
+\cross{PADICRC}{expressIdealMember} \\
+\cross{PADICRC}{exquo} &
+\cross{PADICRC}{extendedEuclidean} &
+\cross{PADICRC}{factor} &
+\cross{PADICRC}{factorPolynomial} \\
+\cross{PADICRC}{factorSquareFreePolynomial} &
+\cross{PADICRC}{floor} &
+\cross{PADICRC}{fractionPart} &
+\cross{PADICRC}{gcd} \\
+\cross{PADICRC}{gcdPolynomial} &
+\cross{PADICRC}{gcd} &
+\cross{PADICRC}{hash} &
+\cross{PADICRC}{init} \\
+\cross{PADICRC}{inv} &
+\cross{PADICRC}{latex} &
+\cross{PADICRC}{lcm} &
+\cross{PADICRC}{map} \\
+\cross{PADICRC}{max} &
+\cross{PADICRC}{min} &
+\cross{PADICRC}{multiEuclidean} &
+\cross{PADICRC}{negative?} \\
+\cross{PADICRC}{nextItem} &
+\cross{PADICRC}{numer} &
+\cross{PADICRC}{numerator} &
+\cross{PADICRC}{one?} \\
+\cross{PADICRC}{patternMatch} &
+\cross{PADICRC}{positive?} &
+\cross{PADICRC}{prime?} &
+\cross{PADICRC}{principalIdeal} \\
+\cross{PADICRC}{random} &
+\cross{PADICRC}{recip} &
+\cross{PADICRC}{reducedSystem} &
+\cross{PADICRC}{removeZeroes} \\
+\cross{PADICRC}{retract} &
+\cross{PADICRC}{retractIfCan} &
+\cross{PADICRC}{sample} &
+\cross{PADICRC}{sign} \\
+\cross{PADICRC}{sizeLess?} &
+\cross{PADICRC}{solveLinearPolynomialEquation} &
+\cross{PADICRC}{squareFree} &
+\cross{PADICRC}{squareFreePart} \\
+\cross{PADICRC}{squareFreePolynomial} &
+\cross{PADICRC}{subtractIfCan} &
+\cross{PADICRC}{unit?} &
+\cross{PADICRC}{unitCanonical} \\
+\cross{PADICRC}{unitNormal} &
+\cross{PADICRC}{wholePart} &
+\cross{PADICRC}{zero?} &
+\cross{PADICRC}{?*?} \\
+\cross{PADICRC}{?**?} &
+\cross{PADICRC}{?+?} &
+\cross{PADICRC}{?-?} &
+\cross{PADICRC}{-?} \\
+\cross{PADICRC}{?/?} &
+\cross{PADICRC}{?=?} &
+\cross{PADICRC}{?\^{}?} &
+\cross{PADICRC}{?\~{}=?} \\
+\cross{PADICRC}{?$<$?} &
+\cross{PADICRC}{?$<=$?} &
+\cross{PADICRC}{?$>$?} &
+\cross{PADICRC}{?$>=$?} \\
+\cross{PADICRC}{?.?} &
+\cross{PADICRC}{?quo?} &
+\cross{PADICRC}{?rem?} &
+\end{tabular}
+
<<domain PADICRC PAdicRationalConstructor>>=
)abbrev domain PADICRC PAdicRationalConstructor
++ Author: Clifton J. Williamson
@@ -62768,6 +65315,23 @@ PAdicRationalConstructor(p,PADIC): Exports ==
Implementation where
\pagepic{ps/v103palette.ps}{PALETTE}{1.00}
{\bf See}\\
\pageto{Color}{COLOR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PALETTE}{bright} &
+\cross{PALETTE}{coerce} &
+\cross{PALETTE}{dark} &
+\cross{PALETTE}{dim} &
+\cross{PALETTE}{hash} \\
+\cross{PALETTE}{hue} &
+\cross{PALETTE}{latex} &
+\cross{PALETTE}{light} &
+\cross{PALETTE}{pastel} &
+\cross{PALETTE}{shade} \\
+\cross{PALETTE}{?\~{}=?} &
+\cross{PALETTE}{?=?} &&&
+\end{tabular}
+
<<domain PALETTE Palette>>=
)abbrev domain PALETTE Palette
++ Author: Jim Wen
@@ -62837,6 +65401,13 @@ Palette(): Exports == Implementation where
{\bf See}\\
\pageto{ParametricSpaceCurve}{PARSCURV}
\pageto{ParametricSurface}{PARSURF}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{PARPCURV}{coordinate} &
+\cross{PARPCURV}{curve}
+\end{tabular}
+
<<domain PARPCURV ParametricPlaneCurve>>=
)abbrev domain PARPCURV ParametricPlaneCurve
++ Author: Clifton J. Williamson
@@ -62888,6 +65459,13 @@ ParametricPlaneCurve(ComponentFunction): Exports ==
Implementation where
{\bf See}\\
\pageto{ParametricPlaneCurve}{PARPCURV}
\pageto{ParametricSurface}{PARSURF}
+
+{\bf Exports:}\\
+\begin{tabular}{ll}
+\cross{PARSCURV}{coordinate} &
+\cross{PARSCURV}{curve}
+\end{tabular}
+
<<domain PARSCURV ParametricSpaceCurve>>=
)abbrev domain PARSCURV ParametricSpaceCurve
++ Author: Clifton J. Williamson
@@ -62942,6 +65520,13 @@ ParametricSpaceCurve(ComponentFunction): Exports ==
Implementation where
{\bf See}\\
\pageto{ParametricPlaneCurve}{PARPCURV}
\pageto{ParametricSpaceCurve}{PARSCURV}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PARSURF}{coordinate} &
+\cross{PARSURF}{surface}
+\end{tabular}
+
<<domain PARSURF ParametricSurface>>=
)abbrev domain PARSURF ParametricSurface
++ Author: Clifton J. Williamson
@@ -63265,6 +65850,63 @@ o )show PartialFraction
@
\pagehead{PartialFraction}{PFR}
\pagepic{ps/v103partialfraction.ps}{PFR}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llll}
+\cross{PFR}{0} &
+\cross{PFR}{1} &
+\cross{PFR}{associates?} &
+\cross{PFR}{characteristic} \\
+\cross{PFR}{coerce} &
+\cross{PFR}{compactFraction} &
+\cross{PFR}{divide} &
+\cross{PFR}{euclideanSize} \\
+\cross{PFR}{expressIdealMember} &
+\cross{PFR}{exquo} &
+\cross{PFR}{extendedEuclidean} &
+\cross{PFR}{extendedEuclidean} \\
+\cross{PFR}{factor} &
+\cross{PFR}{firstDenom} &
+\cross{PFR}{firstNumer} &
+\cross{PFR}{gcd} \\
+\cross{PFR}{gcdPolynomial} &
+\cross{PFR}{hash} &
+\cross{PFR}{inv} &
+\cross{PFR}{latex} \\
+\cross{PFR}{lcm} &
+\cross{PFR}{multiEuclidean} &
+\cross{PFR}{nthFractionalTerm} &
+\cross{PFR}{numberOfFractionalTerms} \\
+\cross{PFR}{one?} &
+\cross{PFR}{padicallyExpand} &
+\cross{PFR}{padicFraction} &
+\cross{PFR}{partialFraction} \\
+\cross{PFR}{prime?} &
+\cross{PFR}{principalIdeal} &
+\cross{PFR}{recip} &
+\cross{PFR}{sample} \\
+\cross{PFR}{sizeLess?} &
+\cross{PFR}{squareFree} &
+\cross{PFR}{squareFreePart} &
+\cross{PFR}{subtractIfCan} \\
+\cross{PFR}{unit?} &
+\cross{PFR}{unitCanonical} &
+\cross{PFR}{unitNormal} &
+\cross{PFR}{wholePart} \\
+\cross{PFR}{zero?} &
+\cross{PFR}{?*?} &
+\cross{PFR}{?**?} &
+\cross{PFR}{?+?} \\
+\cross{PFR}{?-?} &
+\cross{PFR}{-?} &
+\cross{PFR}{?/?} &
+\cross{PFR}{?=?} \\
+\cross{PFR}{?\^{}?} &
+\cross{PFR}{?\~{}=?} &
+\cross{PFR}{?quo?} &
+\cross{PFR}{?rem?}
+\end{tabular}
+
<<domain PFR PartialFraction>>=
)abbrev domain PFR PartialFraction
++ Author: Robert S. Sutor
@@ -63609,6 +66251,33 @@ PartialFraction(R: EuclideanDomain): Cat == Capsule
where
\pagepic{ps/v103partition.ps}{PRTITION}{1.00}
{\bf See}\\
\pageto{SymmetricPolynomial}{SYMPOLY}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRTITION}{0} &
+\cross{PRTITION}{coerce} &
+\cross{PRTITION}{conjugate} &
+\cross{PRTITION}{convert} &
+\cross{PRTITION}{hash} \\
+\cross{PRTITION}{latex} &
+\cross{PRTITION}{max} &
+\cross{PRTITION}{min} &
+\cross{PRTITION}{partition} &
+\cross{PRTITION}{pdct} \\
+\cross{PRTITION}{powers} &
+\cross{PRTITION}{sample} &
+\cross{PRTITION}{subtractIfCan} &
+\cross{PRTITION}{zero?} &
+\cross{PRTITION}{?\~{}=?} \\
+\cross{PRTITION}{?*?} &
+\cross{PRTITION}{?+?} &
+\cross{PRTITION}{?$<$?} &
+\cross{PRTITION}{?$<=$?} &
+\cross{PRTITION}{?=?} \\
+\cross{PRTITION}{?$>$?} &
+\cross{PRTITION}{?$>=$?} &&&
+\end{tabular}
+
<<domain PRTITION Partition>>=
)abbrev domain PRTITION Partition
++ Domain for partitions of positive integers
@@ -63748,6 +66417,56 @@ Partition: Exports == Implementation where
\section{domain PATTERN Pattern}
\pagehead{Pattern}{PATTERN}
\pagepic{ps/v103pattern.ps}{PATTERN}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATTERN}{0} &
+\cross{PATTERN}{1} &
+\cross{PATTERN}{addBadValue} &
+\cross{PATTERN}{coerce} &
+\cross{PATTERN}{constant?} \\
+\cross{PATTERN}{convert} &
+\cross{PATTERN}{copy} &
+\cross{PATTERN}{depth} &
+\cross{PATTERN}{elt} &
+\cross{PATTERN}{generic?} \\
+\cross{PATTERN}{getBadValues} &
+\cross{PATTERN}{hasPredicate?} &
+\cross{PATTERN}{hasTopPredicate?} &
+\cross{PATTERN}{hash} &
+\cross{PATTERN}{inR?} \\
+\cross{PATTERN}{isExpt} &
+\cross{PATTERN}{isList} &
+\cross{PATTERN}{isOp} &
+\cross{PATTERN}{isOp} &
+\cross{PATTERN}{isPlus} \\
+\cross{PATTERN}{isPower} &
+\cross{PATTERN}{isQuotient} &
+\cross{PATTERN}{isTimes} &
+\cross{PATTERN}{latex} &
+\cross{PATTERN}{multiple?} \\
+\cross{PATTERN}{optional?} &
+\cross{PATTERN}{optpair} &
+\cross{PATTERN}{patternVariable} &
+\cross{PATTERN}{predicates} &
+\cross{PATTERN}{quoted?} \\
+\cross{PATTERN}{resetBadValues} &
+\cross{PATTERN}{retract} &
+\cross{PATTERN}{retractIfCan} &
+\cross{PATTERN}{setPredicates} &
+\cross{PATTERN}{setTopPredicate} \\
+\cross{PATTERN}{symbol?} &
+\cross{PATTERN}{topPredicate} &
+\cross{PATTERN}{variables} &
+\cross{PATTERN}{withPredicates} &
+\cross{PATTERN}{?*?} \\
+\cross{PATTERN}{?**?} &
+\cross{PATTERN}{?+?} &
+\cross{PATTERN}{?/?} &
+\cross{PATTERN}{?=?} &
+\cross{PATTERN}{?\~{}=?}
+\end{tabular}
+
<<domain PATTERN Pattern>>=
)abbrev domain PATTERN Pattern
++ Patterns for use by the pattern matcher
@@ -64135,6 +66854,22 @@ Pattern(R:SetCategory): Exports == Implementation where
\pagepic{ps/v103patternmatchlistresult.ps}{PATLRES}{1.00}
{\bf See}\\
\pageto{PatternMatchResult}{PATRES}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATLRES}{atoms} &
+\cross{PATLRES}{coerce} &
+\cross{PATLRES}{failed} &
+\cross{PATLRES}{failed?} &
+\cross{PATLRES}{hash} \\
+\cross{PATLRES}{latex} &
+\cross{PATLRES}{lists} &
+\cross{PATLRES}{makeResult} &
+\cross{PATLRES}{new} &
+\cross{PATLRES}{?=?} \\
+\cross{PATLRES}{?\~{}=?} &&&&
+\end{tabular}
+
<<domain PATLRES PatternMatchListResult>>=
)abbrev domain PATLRES PatternMatchListResult
++ Result returned by the pattern matcher when using lists
@@ -64194,6 +66929,27 @@ PatternMatchListResult(R:SetCategory, S:SetCategory,
L:ListAggregate S):
\pagepic{ps/v103patternmatchresult.ps}{PATRES}{1.00}
{\bf See}\\
\pageto{PatternMatchListResult}{PATLRES}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PATRES}{addMatch} &
+\cross{PATRES}{addMatchRestricted} &
+\cross{PATRES}{coerce} &
+\cross{PATRES}{construct} &
+\cross{PATRES}{destruct} \\
+\cross{PATRES}{failed} &
+\cross{PATRES}{failed?} &
+\cross{PATRES}{getMatch} &
+\cross{PATRES}{hash} &
+\cross{PATRES}{insertMatch} \\
+\cross{PATRES}{latex} &
+\cross{PATRES}{new} &
+\cross{PATRES}{satisfy?} &
+\cross{PATRES}{union} &
+\cross{PATRES}{?=?} \\
+\cross{PATRES}{?\~{}=?} &&&&
+\end{tabular}
+
<<domain PATRES PatternMatchResult>>=
)abbrev domain PATRES PatternMatchResult
++ Result returned by the pattern matcher
@@ -64314,6 +67070,54 @@ a left and a right both PendantTree(S)'s
\pageto{BinarySearchTree}{BSTREE}
\pageto{BinaryTournament}{BTOURN}
\pageto{BalancedBinaryTree}{BBTREE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PENDTREE}{any?} &
+\cross{PENDTREE}{child?} &
+\cross{PENDTREE}{children} &
+\cross{PENDTREE}{coerce} &
+\cross{PENDTREE}{copy} \\
+\cross{PENDTREE}{count} &
+\cross{PENDTREE}{cyclic?} &
+\cross{PENDTREE}{distance} &
+\cross{PENDTREE}{empty} &
+\cross{PENDTREE}{empty?} \\
+\cross{PENDTREE}{eq?} &
+\cross{PENDTREE}{eval} &
+\cross{PENDTREE}{every?} &
+\cross{PENDTREE}{hash} &
+\cross{PENDTREE}{latex} \\
+\cross{PENDTREE}{leaf?} &
+\cross{PENDTREE}{leaves} &
+\cross{PENDTREE}{left} &
+\cross{PENDTREE}{less?} &
+\cross{PENDTREE}{map} \\
+\cross{PENDTREE}{map!} &
+\cross{PENDTREE}{member?} &
+\cross{PENDTREE}{members} &
+\cross{PENDTREE}{more?} &
+\cross{PENDTREE}{node?} \\
+\cross{PENDTREE}{nodes} &
+\cross{PENDTREE}{parts} &
+\cross{PENDTREE}{ptree} &
+\cross{PENDTREE}{right} &
+\cross{PENDTREE}{sample} \\
+\cross{PENDTREE}{setchildren!} &
+\cross{PENDTREE}{setelt} &
+\cross{PENDTREE}{setleft!} &
+\cross{PENDTREE}{setright!} &
+\cross{PENDTREE}{setvalue!} \\
+\cross{PENDTREE}{size?} &
+\cross{PENDTREE}{value} &
+\cross{PENDTREE}{\#{}?} &
+\cross{PENDTREE}{?=?} &
+\cross{PENDTREE}{?\~{}=?} \\
+\cross{PENDTREE}{?.right} &
+\cross{PENDTREE}{?.left} &
+\cross{PENDTREE}{?.value} &&
+\end{tabular}
+
<<domain PENDTREE PendantTree>>=
)abbrev domain PENDTREE PendantTree
PendantTree(S: SetCategory): T == C where
@@ -64368,6 +67172,52 @@ PendantTree(S: SetCategory): T == C where
\section{domain PERM Permutation}
\pagehead{Permutation}{PERM}
\pagepic{ps/v103permutation.ps}{PERM}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PERM}{1} &
+\cross{PERM}{coerce} &
+\cross{PERM}{coerceImages} \\
+\cross{PERM}{coerceListOfPairs} &
+\cross{PERM}{coercePreimagesImages} &
+\cross{PERM}{commutator} \\
+\cross{PERM}{conjugate} &
+\cross{PERM}{cycle} &
+\cross{PERM}{cyclePartition} \\
+\cross{PERM}{cycles} &
+\cross{PERM}{degree} &
+\cross{PERM}{eval} \\
+\cross{PERM}{even?} &
+\cross{PERM}{fixedPoints} &
+\cross{PERM}{hash} \\
+\cross{PERM}{inv} &
+\cross{PERM}{latex} &
+\cross{PERM}{listRepresentation} \\
+\cross{PERM}{max} &
+\cross{PERM}{min} &
+\cross{PERM}{movedPoints} \\
+\cross{PERM}{numberOfCycles} &
+\cross{PERM}{odd?} &
+\cross{PERM}{one?} \\
+\cross{PERM}{orbit} &
+\cross{PERM}{order} &
+\cross{PERM}{recip} \\
+\cross{PERM}{sample} &
+\cross{PERM}{sign} &
+\cross{PERM}{sort} \\
+\cross{PERM}{?*?} &
+\cross{PERM}{?**?} &
+\cross{PERM}{?/?} \\
+\cross{PERM}{?$<$?} &
+\cross{PERM}{?=?} &
+\cross{PERM}{?\^{}?} \\
+\cross{PERM}{?.?} &
+\cross{PERM}{?\~{}=?} &
+\cross{PERM}{?$<=$?} \\
+\cross{PERM}{?$>$?} &
+\cross{PERM}{?$>=$?} &
+\end{tabular}
+
<<domain PERM Permutation>>=
)abbrev domain PERM Permutation
++ Authors: Johannes Grabmeier, Holger Gollan, Martin Rubey
@@ -64731,6 +67581,8 @@ causing bugs when computing [[movedPoints]],
[[fixedPoints]], [[even?]],
The other coercion facilities check for fixed points. It also seems that [[*]]
removes fixed points from its result.
+Up to [[patch--50]] we did not check for duplicates.
+
<<domain PERM Permutation>>=
movedPoints p == construct p.1
@@ -64879,21 +67731,13 @@ removes fixed points from its result.
coerceImages (image) ==
preImage : L S := [i::S for i in 1..maxIndex image]
coercePreimagesImages [preImage,image]
-@
-Up to [[patch--50]] we did not check for duplicates.
-
-<<domain PERM Permutation>>=
if S has Finite then
coerceImages (image) ==
preImage : L S := [index(i::PI)::S for i in 1..maxIndex image]
coercePreimagesImages [preImage,image]
-@
-Up to [[patch--50]] we did not check for duplicates.
-
-<<domain PERM Permutation>>=
fixedPoints ( p ) == complement movedPoints p
cyclePartition p ==
@@ -64911,6 +67755,35 @@ Up to [[patch--50]] we did not check for duplicates.
\section{domain PERMGRP PermutationGroup}
\pagehead{PermutationGroup}{PERMGRP}
\pagepic{ps/v103permutationgroup.ps}{PERMGRP}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PERMGRP}{base} &
+\cross{PERMGRP}{coerce} &
+\cross{PERMGRP}{degree} \\
+\cross{PERMGRP}{hash} &
+\cross{PERMGRP}{latex} &
+\cross{PERMGRP}{movedPoints} \\
+\cross{PERMGRP}{orbit} &
+\cross{PERMGRP}{orbits} &
+\cross{PERMGRP}{order} \\
+\cross{PERMGRP}{random} &
+\cross{PERMGRP}{generators} &
+\cross{PERMGRP}{initializeGroupForWordProblem} \\
+\cross{PERMGRP}{member?} &
+\cross{PERMGRP}{permutationGroup} &
+\cross{PERMGRP}{random} \\
+\cross{PERMGRP}{strongGenerators} &
+\cross{PERMGRP}{wordInGenerators} &
+\cross{PERMGRP}{wordInStrongGenerators} \\
+\cross{PERMGRP}{wordsForStrongGenerators} &
+\cross{PERMGRP}{?\~{}=?} &
+\cross{PERMGRP}{?.?} \\
+\cross{PERMGRP}{?$<$?} &
+\cross{PERMGRP}{?$<=$?} &
+\cross{PERMGRP}{?=?}
+\end{tabular}
+
<<domain PERMGRP PermutationGroup>>=
)abbrev domain PERMGRP PermutationGroup
++ Authors: G. Schneider, H. Gollan, J. Grabmeier
@@ -65681,6 +68554,59 @@ PermutationGroup(S:SetCategory): public == private
where
\pagepic{ps/v103pi.ps}{HACKPI}{1.00}
{\bf See}\\
\pageto{Expression}{EXPR}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{HACKPI}{0} &
+\cross{HACKPI}{1} &
+\cross{HACKPI}{associates?} &
+\cross{HACKPI}{characteristic} &
+\cross{HACKPI}{coerce} \\
+\cross{HACKPI}{convert} &
+\cross{HACKPI}{divide} &
+\cross{HACKPI}{euclideanSize} &
+\cross{HACKPI}{expressIdealMember} &
+\cross{HACKPI}{exquo} \\
+\cross{HACKPI}{extendedEuclidean} &
+\cross{HACKPI}{extendedEuclidean} &
+\cross{HACKPI}{factor} &
+\cross{HACKPI}{gcd} &
+\cross{HACKPI}{gcdPolynomial} \\
+\cross{HACKPI}{hash} &
+\cross{HACKPI}{inv} &
+\cross{HACKPI}{latex} &
+\cross{HACKPI}{lcm} &
+\cross{HACKPI}{multiEuclidean} \\
+\cross{HACKPI}{one?} &
+\cross{HACKPI}{pi} &
+\cross{HACKPI}{prime?} &
+\cross{HACKPI}{principalIdeal} &
+\cross{HACKPI}{recip} \\
+\cross{HACKPI}{retract} &
+\cross{HACKPI}{retractIfCan} &
+\cross{HACKPI}{retractIfCan} &
+\cross{HACKPI}{sample} &
+\cross{HACKPI}{sizeLess?} \\
+\cross{HACKPI}{squareFree} &
+\cross{HACKPI}{squareFreePart} &
+\cross{HACKPI}{subtractIfCan} &
+\cross{HACKPI}{unit?} &
+\cross{HACKPI}{unitCanonical} \\
+\cross{HACKPI}{unitNormal} &
+\cross{HACKPI}{zero?} &
+\cross{HACKPI}{?*?} &
+\cross{HACKPI}{?**?} &
+\cross{HACKPI}{?+?} \\
+\cross{HACKPI}{?-?} &
+\cross{HACKPI}{-?} &
+\cross{HACKPI}{?/?} &
+\cross{HACKPI}{?=?} &
+\cross{HACKPI}{?\^{}?} \\
+\cross{HACKPI}{?\~{}=?} &
+\cross{HACKPI}{?quo?} &
+\cross{HACKPI}{?rem?} &&
+\end{tabular}
+
<<domain HACKPI Pi>>=
)abbrev domain HACKPI Pi
++ Expressions in %pi only
@@ -65785,6 +68711,17 @@ o )show PlaneAlgebraicCurvePlot
@
\pagehead{PlaneAlgebraicCurvePlot}{ACPLOT}
\pagepic{ps/v103planealgebraiccurveplot.ps}{ACPLOT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{llllll}
+\cross{ACPLOT}{coerce} &
+\cross{ACPLOT}{listBranches} &
+\cross{ACPLOT}{makeSketch} &
+\cross{ACPLOT}{refine} &
+\cross{ACPLOT}{xRange} &
+\cross{ACPLOT}{yRange}
+\end{tabular}
+
<<domain ACPLOT PlaneAlgebraicCurvePlot>>=
)abbrev domain ACPLOT PlaneAlgebraicCurvePlot
--% PlaneAlgebraicCurvePlot
@@ -67102,6 +70039,32 @@ o )show Plot
@
\pagehead{Plot}{PLOT}
\pagepic{ps/v103plot.ps}{PLOT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PLOT}{adaptive?} &
+\cross{PLOT}{coerce} &
+\cross{PLOT}{debug} &
+\cross{PLOT}{listBranches} &
+\cross{PLOT}{maxPoints} \\
+\cross{PLOT}{minPoints} &
+\cross{PLOT}{numFunEvals} &
+\cross{PLOT}{parametric?} &
+\cross{PLOT}{plot} &
+\cross{PLOT}{plotPolar} \\
+\cross{PLOT}{pointPlot} &
+\cross{PLOT}{refine} &
+\cross{PLOT}{screenResolution} &
+\cross{PLOT}{setAdaptive} &
+\cross{PLOT}{setMaxPoints} \\
+\cross{PLOT}{setMinPoints} &
+\cross{PLOT}{setScreenResolution} &
+\cross{PLOT}{tRange} &
+\cross{PLOT}{xRange} &
+\cross{PLOT}{yRange} \\
+\cross{PLOT}{zoom} &&&&
+\end{tabular}
+
<<domain PLOT Plot>>=
)abbrev domain PLOT Plot
++ Author: Michael Monagan (revised by Clifton J. Williamson)
@@ -67675,6 +70638,32 @@ Plot(): Exports == Implementation where
\section{domain PLOT3D Plot3D}
\pagehead{Plot3D}{PLOT3D}
\pagepic{ps/v103plot3d.ps}{PLOT3D}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PLOT3D}{adaptive3D?} &
+\cross{PLOT3D}{coerce} &
+\cross{PLOT3D}{debug3D} &
+\cross{PLOT3D}{listBranches} &
+\cross{PLOT3D}{maxPoints3D} \\
+\cross{PLOT3D}{minPoints3D} &
+\cross{PLOT3D}{numFunEvals3D} &
+\cross{PLOT3D}{plot} &
+\cross{PLOT3D}{pointPlot} &
+\cross{PLOT3D}{refine} \\
+\cross{PLOT3D}{screenResolution3D} &
+\cross{PLOT3D}{setAdaptive3D} &
+\cross{PLOT3D}{setMaxPoints3D} &
+\cross{PLOT3D}{setMinPoints3D} &
+\cross{PLOT3D}{setScreenResolution3D} \\
+\cross{PLOT3D}{tRange} &
+\cross{PLOT3D}{tValues} &
+\cross{PLOT3D}{xRange} &
+\cross{PLOT3D}{yRange} &
+\cross{PLOT3D}{zRange} \\
+\cross{PLOT3D}{zoom} &&&&
+\end{tabular}
+
<<domain PLOT3D Plot3D>>=
)abbrev domain PLOT3D Plot3D
++ Author: Clifton J. Williamson based on code by Michael Monagan
@@ -68171,6 +71160,31 @@ Plot3D(): Exports == Implementation where
\section{domain PBWLB PoincareBirkhoffWittLyndonBasis}
\pagehead{PoincareBirkhoffWittLyndonBasis}{PBWLB}
\pagepic{ps/v103poincarebirkhoffwittlyndonbasis.ps}{PBWLB}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PBWLB}{1} &
+\cross{PBWLB}{coerce} &
+\cross{PBWLB}{first} &
+\cross{PBWLB}{hash} &
+\cross{PBWLB}{latex} \\
+\cross{PBWLB}{length} &
+\cross{PBWLB}{ListOfTerms} &
+\cross{PBWLB}{max} &
+\cross{PBWLB}{min} &
+\cross{PBWLB}{rest} \\
+\cross{PBWLB}{retract} &
+\cross{PBWLB}{retractable?} &
+\cross{PBWLB}{retractIfCan} &
+\cross{PBWLB}{varList} &
+\cross{PBWLB}{?\~{}=?} \\
+\cross{PBWLB}{?$<$?} &
+\cross{PBWLB}{?$<=$?} &
+\cross{PBWLB}{?=?} &
+\cross{PBWLB}{?$>$?} &
+\cross{PBWLB}{?$>=$?}
+\end{tabular}
+
<<domain PBWLB PoincareBirkhoffWittLyndonBasis>>=
)abbrev domain PBWLB PoincareBirkhoffWittLyndonBasis
++ Author: Michel Petitot (address@hidden).
@@ -68294,6 +71308,90 @@ PoincareBirkhoffWittLyndonBasis(VarSet: OrderedSet):
Public == Private where
{\bf See}\\
\pageto{SubSpaceComponentProperty}{COMPPROP}
\pageto{SubSpace}{SUBSPACE}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{POINT}{any?} &
+\cross{POINT}{coerce} &
+\cross{POINT}{concat} &
+\cross{POINT}{construct} &
+\cross{POINT}{convert} \\
+\cross{POINT}{copy} &
+\cross{POINT}{copyInto!} &
+\cross{POINT}{count} &
+\cross{POINT}{count} &
+\cross{POINT}{cross} \\
+\cross{POINT}{delete} &
+\cross{POINT}{dimension} &
+\cross{POINT}{dot} &
+\cross{POINT}{elt} &
+\cross{POINT}{empty} \\
+\cross{POINT}{empty?} &
+\cross{POINT}{entries} &
+\cross{POINT}{entry?} &
+\cross{POINT}{eq?} &
+\cross{POINT}{eval} \\
+\cross{POINT}{every?} &
+\cross{POINT}{extend} &
+\cross{POINT}{fill!} &
+\cross{POINT}{find} &
+\cross{POINT}{first} \\
+\cross{POINT}{hash} &
+\cross{POINT}{index?} &
+\cross{POINT}{indices} &
+\cross{POINT}{insert} &
+\cross{POINT}{insert} \\
+\cross{POINT}{latex} &
+\cross{POINT}{length} &
+\cross{POINT}{less?} &
+\cross{POINT}{magnitude} &
+\cross{POINT}{map} \\
+\cross{POINT}{map!} &
+\cross{POINT}{max} &
+\cross{POINT}{maxIndex} &
+\cross{POINT}{member?} &
+\cross{POINT}{members} \\
+\cross{POINT}{merge} &
+\cross{POINT}{merge} &
+\cross{POINT}{min} &
+\cross{POINT}{minIndex} &
+\cross{POINT}{more?} \\
+\cross{POINT}{new} &
+\cross{POINT}{outerProduct} &
+\cross{POINT}{parts} &
+\cross{POINT}{point} &
+\cross{POINT}{position} \\
+\cross{POINT}{qelt} &
+\cross{POINT}{qsetelt!} &
+\cross{POINT}{reduce} &
+\cross{POINT}{remove} &
+\cross{POINT}{removeDuplicates} \\
+\cross{POINT}{reverse} &
+\cross{POINT}{reverse!} &
+\cross{POINT}{sample} &
+\cross{POINT}{select} &
+\cross{POINT}{setelt} \\
+\cross{POINT}{size?} &
+\cross{POINT}{sort} &
+\cross{POINT}{sort!} &
+\cross{POINT}{sorted?} &
+\cross{POINT}{swap!} \\
+\cross{POINT}{zero} &
+\cross{POINT}{\#{}?} &
+\cross{POINT}{?*?} &
+\cross{POINT}{?+?} &
+\cross{POINT}{?-?} \\
+\cross{POINT}{?$<$?} &
+\cross{POINT}{?$<=$?} &
+\cross{POINT}{?=?} &
+\cross{POINT}{?$>$?} &
+\cross{POINT}{?$>=$?} \\
+\cross{POINT}{?.?} &
+\cross{POINT}{?\~{}=?} &
+\cross{POINT}{-?} &
+\cross{POINT}{?.?} &
+\end{tabular}
+
<<domain POINT Point>>=
)abbrev domain POINT Point
++ Description:
@@ -69128,6 +72226,96 @@ o )show Polynomial
\pageto{MultivariatePolynomial}{MPOLY}
\pageto{SparseMultivariatePolynomial}{SMP}
\pageto{IndexedExponents}{INDE}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{POLY}{0} &
+\cross{POLY}{1} &
+\cross{POLY}{associates?} \\
+\cross{POLY}{binomThmExpt} &
+\cross{POLY}{characteristic} &
+\cross{POLY}{charthRoot} \\
+\cross{POLY}{coefficient} &
+\cross{POLY}{coefficients} &
+\cross{POLY}{coerce} \\
+\cross{POLY}{conditionP} &
+\cross{POLY}{content} &
+\cross{POLY}{convert} \\
+\cross{POLY}{D} &
+\cross{POLY}{degree} &
+\cross{POLY}{differentiate} \\
+\cross{POLY}{discriminant} &
+\cross{POLY}{eval} &
+\cross{POLY}{exquo} \\
+\cross{POLY}{factor} &
+\cross{POLY}{factorPolynomial} &
+\cross{POLY}{factorSquareFreePolynomial} \\
+\cross{POLY}{gcd} &
+\cross{POLY}{gcdPolynomial} &
+\cross{POLY}{ground} \\
+\cross{POLY}{ground?} &
+\cross{POLY}{hash} &
+\cross{POLY}{integrate} \\
+\cross{POLY}{isExpt} &
+\cross{POLY}{isPlus} &
+\cross{POLY}{isTimes} \\
+\cross{POLY}{latex} &
+\cross{POLY}{lcm} &
+\cross{POLY}{leadingCoefficient} \\
+\cross{POLY}{leadingMonomial} &
+\cross{POLY}{mainVariable} &
+\cross{POLY}{map} \\
+\cross{POLY}{mapExponents} &
+\cross{POLY}{max} &
+\cross{POLY}{min} \\
+\cross{POLY}{minimumDegree} &
+\cross{POLY}{monicDivide} &
+\cross{POLY}{monomial} \\
+\cross{POLY}{monomial?} &
+\cross{POLY}{monomials} &
+\cross{POLY}{multivariate} \\
+\cross{POLY}{one?} &
+\cross{POLY}{numberOfMonomials} &
+\cross{POLY}{patternMatch} \\
+\cross{POLY}{pomopo!} &
+\cross{POLY}{prime?} &
+\cross{POLY}{primitiveMonomials} \\
+\cross{POLY}{primitivePart} &
+\cross{POLY}{recip} &
+\cross{POLY}{reducedSystem} \\
+\cross{POLY}{reductum} &
+\cross{POLY}{resultant} &
+\cross{POLY}{retract} \\
+\cross{POLY}{retractIfCan} &
+\cross{POLY}{sample} &
+\cross{POLY}{solveLinearPolynomialEquation} \\
+\cross{POLY}{squareFree} &
+\cross{POLY}{squareFreePart} &
+\cross{POLY}{squareFreePolynomial} \\
+\cross{POLY}{subtractIfCan} &
+\cross{POLY}{totalDegree} &
+\cross{POLY}{totalDegree} \\
+\cross{POLY}{unit?} &
+\cross{POLY}{unitCanonical} &
+\cross{POLY}{unitNormal} \\
+\cross{POLY}{univariate} &
+\cross{POLY}{variables} &
+\cross{POLY}{zero?} \\
+\cross{POLY}{?*?} &
+\cross{POLY}{?**?} &
+\cross{POLY}{?+?} \\
+\cross{POLY}{?-?} &
+\cross{POLY}{-?} &
+\cross{POLY}{?=?} \\
+\cross{POLY}{?\^{}?} &
+\cross{POLY}{?\~{}=?} &
+\cross{POLY}{?/?} \\
+\cross{POLY}{?$<$?} &
+\cross{POLY}{?$<=$?} &
+\cross{POLY}{?$>$?} \\
+\cross{POLY}{?$>=$?} &&
+\end{tabular}
+
<<domain POLY Polynomial>>=
)abbrev domain POLY Polynomial
++ Author: Dave Barton, Barry Trager
@@ -69178,6 +72366,38 @@ Polynomial(R:Ring):
\section{domain IDEAL PolynomialIdeals}
\pagehead{PolynomialIdeals}{IDEAL}
\pagepic{ps/v103polynomialideals.ps}{IDEAL}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{IDEAL}{backOldPos} &
+\cross{IDEAL}{coerce} &
+\cross{IDEAL}{dimension} &
+\cross{IDEAL}{element?} &
+\cross{IDEAL}{generalPosition} \\
+\cross{IDEAL}{generators} &
+\cross{IDEAL}{groebner} &
+\cross{IDEAL}{groebner?} &
+\cross{IDEAL}{groebnerIdeal} &
+\cross{IDEAL}{hash} \\
+\cross{IDEAL}{ideal} &
+\cross{IDEAL}{in?} &
+\cross{IDEAL}{inRadical?} &
+\cross{IDEAL}{intersect} &
+\cross{IDEAL}{latex} \\
+\cross{IDEAL}{leadingIdeal} &
+\cross{IDEAL}{one?} &
+\cross{IDEAL}{quotient} &
+\cross{IDEAL}{relationsIdeal} &
+\cross{IDEAL}{saturate} \\
+\cross{IDEAL}{zero?} &
+\cross{IDEAL}{zeroDim?} &
+\cross{IDEAL}{?\~{}=?} &
+\cross{IDEAL}{?**?} &
+\cross{IDEAL}{?*?} \\
+\cross{IDEAL}{?+?} &
+\cross{IDEAL}{?=?} &&&
+\end{tabular}
+
<<domain IDEAL PolynomialIdeals>>=
)abbrev domain IDEAL PolynomialIdeals
++ Author: P. Gianni
@@ -69611,6 +72831,59 @@ PolynomialIdeals(F,Expon,VarSet,DPoly) : C == T
\pageto{FreeModule}{FM}
\pageto{SparseUnivariatePolynomial}{SUP}
\pageto{UnivariatePolynomial}{UP}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PR}{0} &
+\cross{PR}{1} &
+\cross{PR}{associates?} &
+\cross{PR}{binomThmExpt} &
+\cross{PR}{characteristic} \\
+\cross{PR}{charthRoot} &
+\cross{PR}{coerce} &
+\cross{PR}{coefficient} &
+\cross{PR}{coefficients} &
+\cross{PR}{content} \\
+\cross{PR}{degree} &
+\cross{PR}{exquo} &
+\cross{PR}{exquo} &
+\cross{PR}{fmecg} &
+\cross{PR}{ground} \\
+\cross{PR}{ground?} &
+\cross{PR}{hash} &
+\cross{PR}{latex} &
+\cross{PR}{leadingCoefficient} &
+\cross{PR}{leadingMonomial} \\
+\cross{PR}{map} &
+\cross{PR}{mapExponents} &
+\cross{PR}{minimumDegree} &
+\cross{PR}{monomial} &
+\cross{PR}{monomial?} \\
+\cross{PR}{numberOfMonomials} &
+\cross{PR}{one?} &
+\cross{PR}{pomopo!} &
+\cross{PR}{primitivePart} &
+\cross{PR}{recip} \\
+\cross{PR}{reductum} &
+\cross{PR}{retract} &
+\cross{PR}{retractIfCan} &
+\cross{PR}{sample} &
+\cross{PR}{subtractIfCan} \\
+\cross{PR}{unit?} &
+\cross{PR}{unitCanonical} &
+\cross{PR}{unitNormal} &
+\cross{PR}{zero?} &
+\cross{PR}{?*?} \\
+\cross{PR}{?**?} &
+\cross{PR}{?+?} &
+\cross{PR}{?-?} &
+\cross{PR}{-?} &
+\cross{PR}{?=?} \\
+\cross{PR}{?\^{}?} &
+\cross{PR}{?\~{}=?} &
+\cross{PR}{?/?} &&
+\end{tabular}
+
<<domain PR PolynomialRing>>=
)abbrev domain PR PolynomialRing
++ Author: Dave Barton, James Davenport, Barry Trager
@@ -69931,6 +73204,31 @@ PolynomialRing(R:Ring,E:OrderedAbelianMonoid): T == C
\pageto{Integer}{INT}
\pageto{NonNegativeInteger}{NNI}
\pageto{RomanNumeral}{ROMAN}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PI}{1} &
+\cross{PI}{coerce} &
+\cross{PI}{gcd} &
+\cross{PI}{hash} &
+\cross{PI}{latex} \\
+\cross{PI}{max} &
+\cross{PI}{min} &
+\cross{PI}{one?} &
+\cross{PI}{recip} &
+\cross{PI}{sample} \\
+\cross{PI}{?\^{}?} &
+\cross{PI}{?\~{}=?} &
+\cross{PI}{?**?} &
+\cross{PI}{?*?} &
+\cross{PI}{?+?} \\
+\cross{PI}{?$<$?} &
+\cross{PI}{?$<=$?} &
+\cross{PI}{?=?} &
+\cross{PI}{?$>$?} &
+\cross{PI}{?$>=$?}
+\end{tabular}
+
<<domain PI PositiveInteger>>=
)abbrev domain PI PositiveInteger
++ Author:
@@ -69966,6 +73264,99 @@ PositiveInteger:
Join(AbelianSemiGroup,OrderedSet,Monoid) with
\pagepic{ps/v103primefield.ps}{PF}{1.00}
{\bf See}\\
\pageto{InnerPrimeField}{IPF}
+
+{\bf Exports:}\\
+\begin{tabular}{lll}
+\cross{PF}{0} &
+\cross{PF}{1} &
+\cross{PF}{algebraic?} \\
+\cross{PF}{associates?} &
+\cross{PF}{basis} &
+\cross{PF}{characteristic} \\
+\cross{PF}{charthRoot} &
+\cross{PF}{conditionP} &
+\cross{PF}{coordinates} \\
+\cross{PF}{coerce} &
+\cross{PF}{convert} &
+\cross{PF}{coordinates} \\
+\cross{PF}{createPrimitiveElement} &
+\cross{PF}{createNormalElement} &
+\cross{PF}{D} \\
+\cross{PF}{definingPolynomial} &
+\cross{PF}{degree} &
+\cross{PF}{differentiate} \\
+\cross{PF}{dimension} &
+\cross{PF}{discreteLog} &
+\cross{PF}{discreteLog} \\
+\cross{PF}{divide} &
+\cross{PF}{euclideanSize} &
+\cross{PF}{expressIdealMember} \\
+\cross{PF}{exquo} &
+\cross{PF}{extendedEuclidean} &
+\cross{PF}{extensionDegree} \\
+\cross{PF}{factor} &
+\cross{PF}{factorsOfCyclicGroupSize} &
+\cross{PF}{Frobenius} \\
+\cross{PF}{gcd} &
+\cross{PF}{gcdPolynomial} &
+\cross{PF}{generator} \\
+\cross{PF}{hash} &
+\cross{PF}{inGroundField?} &
+\cross{PF}{index} \\
+\cross{PF}{init} &
+\cross{PF}{inv} &
+\cross{PF}{latex} \\
+\cross{PF}{lcm} &
+\cross{PF}{linearAssociatedExp} &
+\cross{PF}{linearAssociatedLog} \\
+\cross{PF}{linearAssociatedOrder} &
+\cross{PF}{lookup} &
+\cross{PF}{minimalPolynomial} \\
+\cross{PF}{multiEuclidean} &
+\cross{PF}{nextItem} &
+\cross{PF}{norm} \\
+\cross{PF}{normal?} &
+\cross{PF}{normalElement} &
+\cross{PF}{one?} \\
+\cross{PF}{order} &
+\cross{PF}{prime?} &
+\cross{PF}{primeFrobenius} \\
+\cross{PF}{primitive?} &
+\cross{PF}{primitiveElement} &
+\cross{PF}{principalIdeal} \\
+\cross{PF}{random} &
+\cross{PF}{recip} &
+\cross{PF}{representationType} \\
+\cross{PF}{represents} &
+\cross{PF}{retract} &
+\cross{PF}{retractIfCan} \\
+\cross{PF}{sample} &
+\cross{PF}{size} &
+\cross{PF}{sizeLess?} \\
+\cross{PF}{squareFree} &
+\cross{PF}{squareFreePart} &
+\cross{PF}{subtractIfCan} \\
+\cross{PF}{tableForDiscreteLogarithm} &
+\cross{PF}{trace} &
+\cross{PF}{transcendenceDegree} \\
+\cross{PF}{transcendent?} &
+\cross{PF}{unit?} &
+\cross{PF}{unitCanonical} \\
+\cross{PF}{unitNormal} &
+\cross{PF}{zero?} &
+\cross{PF}{?*?} \\
+\cross{PF}{?**?} &
+\cross{PF}{?+?} &
+\cross{PF}{?-?} \\
+\cross{PF}{-?} &
+\cross{PF}{?/?} &
+\cross{PF}{?=?} \\
+\cross{PF}{?\^{}?} &
+\cross{PF}{?\~{}=?} &
+\cross{PF}{?quo?} \\
+\cross{PF}{?rem?} &&
+\end{tabular}
+
<<domain PF PrimeField>>=
)abbrev domain PF PrimeField
++ Authors: N.N.,
@@ -70009,6 +73400,74 @@ PrimeField(p:PositiveInteger): Exp == Impl where
\pageto{FlexibleArray}{FARRAY}
\pageto{IndexedOneDimensionalArray}{IARRAY1}
\pageto{OneDimensionalArray}{ARRAY1}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRIMARR}{any?} &
+\cross{PRIMARR}{coerce} &
+\cross{PRIMARR}{concat} &
+\cross{PRIMARR}{construct} &
+\cross{PRIMARR}{convert} \\
+\cross{PRIMARR}{copy} &
+\cross{PRIMARR}{copyInto!} &
+\cross{PRIMARR}{count} &
+\cross{PRIMARR}{delete} &
+\cross{PRIMARR}{entry?} \\
+\cross{PRIMARR}{elt} &
+\cross{PRIMARR}{empty} &
+\cross{PRIMARR}{empty?} &
+\cross{PRIMARR}{entries} &
+\cross{PRIMARR}{eq?} \\
+\cross{PRIMARR}{eval} &
+\cross{PRIMARR}{every?} &
+\cross{PRIMARR}{fill!} &
+\cross{PRIMARR}{find} &
+\cross{PRIMARR}{first} \\
+\cross{PRIMARR}{hash} &
+\cross{PRIMARR}{index?} &
+\cross{PRIMARR}{indices} &
+\cross{PRIMARR}{insert} &
+\cross{PRIMARR}{insert} \\
+\cross{PRIMARR}{latex} &
+\cross{PRIMARR}{less?} &
+\cross{PRIMARR}{map} &
+\cross{PRIMARR}{map!} &
+\cross{PRIMARR}{max} \\
+\cross{PRIMARR}{maxIndex} &
+\cross{PRIMARR}{member?} &
+\cross{PRIMARR}{members} &
+\cross{PRIMARR}{merge} &
+\cross{PRIMARR}{min} \\
+\cross{PRIMARR}{minIndex} &
+\cross{PRIMARR}{more?} &
+\cross{PRIMARR}{new} &
+\cross{PRIMARR}{parts} &
+\cross{PRIMARR}{position} \\
+\cross{PRIMARR}{qelt} &
+\cross{PRIMARR}{qsetelt!} &
+\cross{PRIMARR}{reduce} &
+\cross{PRIMARR}{remove} &
+\cross{PRIMARR}{removeDuplicates} \\
+\cross{PRIMARR}{reverse} &
+\cross{PRIMARR}{reverse!} &
+\cross{PRIMARR}{sample} &
+\cross{PRIMARR}{select} &
+\cross{PRIMARR}{setelt} \\
+\cross{PRIMARR}{size?} &
+\cross{PRIMARR}{sort} &
+\cross{PRIMARR}{sort!} &
+\cross{PRIMARR}{sorted?} &
+\cross{PRIMARR}{swap!} \\
+\cross{PRIMARR}{\#{}?} &
+\cross{PRIMARR}{?.?} &
+\cross{PRIMARR}{?\~{}=?} &
+\cross{PRIMARR}{?$<$?} &
+\cross{PRIMARR}{?$<=$?} \\
+\cross{PRIMARR}{?=?} &
+\cross{PRIMARR}{?$>$?} &
+\cross{PRIMARR}{?$>=$?} &&
+\end{tabular}
+
<<domain PRIMARR PrimitiveArray>>=
)abbrev domain PRIMARR PrimitiveArray
++ This provides a fast array type with no bound checking on elt's.
@@ -70044,6 +73503,47 @@ PrimitiveArray(S:Type): OneDimensionalArrayAggregate S
== add
\section{domain PRODUCT Product}
\pagehead{Product}{PRODUCT}
\pagepic{ps/v103product.ps}{PRODUCT}{1.00}
+
+{\bf Exports:}\\
+\begin{tabular}{lllll}
+\cross{PRODUCT}{0} &
+\cross{PRODUCT}{1} &
+\cross{PRODUCT}{coerce} &
+\cross{PRODUCT}{commutator} &
+\cross{PRODUCT}{conjugate} \\
+\cross{PRODUCT}{hash} &
+\cross{PRODUCT}{index} &
+\cross{PRODUCT}{inv} &
+\cross{PRODUCT}{latex} &
+\cross{PRODUCT}{lookup} \\
+\cross{PRODUCT}{makeprod} &
+\cross{PRODUCT}{max} &
+\cross{PRODUCT}{min} &
+\cross{PRODUCT}{one?} &
+\cross{PRODUCT}{random} \\
+\cross{PRODUCT}{recip} &
+\cross{PRODUCT}{sample} &
+\cross{PRODUCT}{selectfirst} &
+\cross{PRODUCT}{selectsecond} &
+\cross{PRODUCT}{size} \\
+\cross{PRODUCT}{subtractIfCan} &
+\cross{PRODUCT}{sup} &
+\cross{PRODUCT}{zero?} &
+\cross{PRODUCT}{?=?} &
+\cross{PRODUCT}{?\~{}=?} \\
+\cross{PRODUCT}{?*?} &
+\cross{PRODUCT}{?**?} &
+\cross{PRODUCT}{?+?} &
+\cross{PRODUCT}{-?} &
+\cross{PRODUCT}{?-?} \\
+\cross{PRODUCT}{?/?} &
+\cross{PRODUCT}{?$<$?} &
+\cross{PRODUCT}{?$<=$?} &
+\cross{PRODUCT}{?$>$?} &
+\cross{PRODUCT}{?$>=$?} \\
+\cross{PRODUCT}{?\^{}?} &&&&
+\end{tabular}
+
<<domain PRODUCT Product>>=
)abbrev domain PRODUCT Product
++ Description:
diff --git a/changelog b/changelog
index fefc30f..0ae872c 100644
--- a/changelog
+++ b/changelog
@@ -1,3 +1,5 @@
+20090116 tpd src/axiom-website/patches.html 20090116.03.tpd.patch
+20090116 tpd books/bookvol10.3 add exports
20090116 tpd src/axiom-website/patches.html 20090116.02.tpd.patch
20090116 tpd books/bookvol10.3 add exports
20090116 tpd src/axiom-website/patches.html 20090116.01.tpd.patch
diff --git a/src/axiom-website/patches.html b/src/axiom-website/patches.html
index 5290bbe..5ed39a1 100644
--- a/src/axiom-website/patches.html
+++ b/src/axiom-website/patches.html
@@ -885,6 +885,8 @@ bookvol10.3 add exports<br/>
bookvol10.3 add exports<br/>
<a href="patches/20090116.02.tpd.patch">20090116.02.tpd.patch</a>
bookvol10.3 add exports<br/>
+<a href="patches/20090116.03.tpd.patch">20090116.03.tpd.patch</a>
+bookvol10.3 add exports<br/>
</body>
</html>
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Axiom-developer] 20090116.03.tpd.patch (bookvol10.3 add exports),
daly <=