diff options
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 296 |
1 files changed, 148 insertions, 148 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index 6292b330..a6fc07ca 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,12 +1,12 @@ -(2232450 . 3409757246) +(2232450 . 3409760518) (-18 A S) ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) NIL NIL (-19 S) ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-20 S) ((|constructor| (NIL "The class of abelian groups,{} \\spadignore{i.e.} additive monoids where each element has an additive inverse. \\blankline")) (* (($ (|Integer|) $) "\\spad{n*x} is the product of \\spad{x} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x-y} is the difference of \\spad{x} and \\spad{y} \\spadignore{i.e.} \\spad{x + (-y)}.") (($ $) "\\spad{-x} is the additive inverse of \\spad{x}."))) @@ -46,7 +46,7 @@ NIL NIL (-29 R) ((|constructor| (NIL "Model for algebraically closed function spaces.")) (|zerosOf| (((|List| $) $ (|Symbol|)) "\\spad{zerosOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{zerosOf(p)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible. The returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable.")) (|zeroOf| (($ $ (|Symbol|)) "\\spad{zeroOf(p,{} y)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity which displays as \\spad{'y}.") (($ $) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity. Error: if \\spad{p} has more than one variable.")) (|rootsOf| (((|List| $) $ (|Symbol|)) "\\spad{rootsOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{rootsOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}; Note: the returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootOf| (($ $ (|Symbol|)) "\\spad{rootOf(p,{}y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}.") (($ $) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. Error: if \\spad{p} has more than one variable \\spad{y}."))) -((-4226 . T) (-4224 . T) (-4223 . T) ((-4231 "*") . T) (-4222 . T) (-4227 . T) (-4221 . T) (-2093 . T)) +((-4226 . T) (-4224 . T) (-4223 . T) ((-4231 "*") . T) (-4222 . T) (-4227 . T) (-4221 . T) (-2046 . T)) NIL (-30) ((|constructor| (NIL "\\indented{1}{Plot a NON-SINGULAR plane algebraic curve \\spad{p}(\\spad{x},{}\\spad{y}) = 0.} Author: Clifton \\spad{J}. Williamson Date Created: Fall 1988 Date Last Updated: 27 April 1990 Keywords: algebraic curve,{} non-singular,{} plot Examples: References:")) (|refine| (($ $ (|DoubleFloat|)) "\\spad{refine(p,{}x)} \\undocumented{}")) (|makeSketch| (($ (|Polynomial| (|Integer|)) (|Symbol|) (|Symbol|) (|Segment| (|Fraction| (|Integer|))) (|Segment| (|Fraction| (|Integer|)))) "\\spad{makeSketch(p,{}x,{}y,{}a..b,{}c..d)} creates an ACPLOT of the curve \\spad{p = 0} in the region {\\em a <= x <= b,{} c <= y <= d}. More specifically,{} 'makeSketch' plots a non-singular algebraic curve \\spad{p = 0} in an rectangular region {\\em xMin <= x <= xMax},{} {\\em yMin <= y <= yMax}. The user inputs \\spad{makeSketch(p,{}x,{}y,{}xMin..xMax,{}yMin..yMax)}. Here \\spad{p} is a polynomial in the variables \\spad{x} and \\spad{y} with integer coefficients (\\spad{p} belongs to the domain \\spad{Polynomial Integer}). The case where \\spad{p} is a polynomial in only one of the variables is allowed. The variables \\spad{x} and \\spad{y} are input to specify the the coordinate axes. The horizontal axis is the \\spad{x}-axis and the vertical axis is the \\spad{y}-axis. The rational numbers xMin,{}...,{}yMax specify the boundaries of the region in which the curve is to be plotted."))) @@ -62,7 +62,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4229))) (-33) ((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,{}n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,{}n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,{}n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} \\spad{:=} empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,{}v)} tests if \\spad{u} and \\spad{v} are same objects."))) -((-2093 . T)) +((-2046 . T)) NIL (-34) ((|constructor| (NIL "Category for the inverse hyperbolic trigonometric functions.")) (|atanh| (($ $) "\\spad{atanh(x)} returns the hyperbolic arc-tangent of \\spad{x}.")) (|asinh| (($ $) "\\spad{asinh(x)} returns the hyperbolic arc-sine of \\spad{x}.")) (|asech| (($ $) "\\spad{asech(x)} returns the hyperbolic arc-secant of \\spad{x}.")) (|acsch| (($ $) "\\spad{acsch(x)} returns the hyperbolic arc-cosecant of \\spad{x}.")) (|acoth| (($ $) "\\spad{acoth(x)} returns the hyperbolic arc-cotangent of \\spad{x}.")) (|acosh| (($ $) "\\spad{acosh(x)} returns the hyperbolic arc-cosine of \\spad{x}."))) @@ -70,7 +70,7 @@ NIL NIL (-35 |Key| |Entry|) ((|constructor| (NIL "An association list is a list of key entry pairs which may be viewed as a table. It is a poor mans version of a table: searching for a key is a linear operation.")) (|assoc| (((|Union| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)) "failed") |#1| $) "\\spad{assoc(k,{}u)} returns the element \\spad{x} in association list \\spad{u} stored with key \\spad{k},{} or \"failed\" if \\spad{u} has no key \\spad{k}."))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-36 S R) ((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline")) (|coerce| (($ |#2|) "\\spad{coerce(r)} maps the ring element \\spad{r} to a member of the algebra."))) @@ -84,7 +84,7 @@ NIL ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in \\spadtype{AlgebraicNumber}.")) (|doublyTransitive?| (((|Boolean|) |#1|) "\\spad{doublyTransitive?(p)} is \\spad{true} if \\spad{p} is irreducible over over the field \\spad{K} generated by its coefficients,{} and if \\spad{p(X) / (X - a)} is irreducible over \\spad{K(a)} where \\spad{p(a) = 0}.")) (|split| (((|Factored| |#1|) |#1|) "\\spad{split(p)} returns a prime factorisation of \\spad{p} over its splitting field.")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p} over the field generated by its coefficients.") (((|Factored| |#1|) |#1| (|List| (|AlgebraicNumber|))) "\\spad{factor(p,{} [a1,{}...,{}an])} returns a prime factorisation of \\spad{p} over the field generated by its coefficients and a1,{}...,{}an."))) NIL NIL -(-39 -4045 UP UPUP -3859) +(-39 -4045 UP UPUP -3178) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) ((-4222 |has| (-380 |#2|) (-336)) (-4227 |has| (-380 |#2|) (-336)) (-4221 |has| (-380 |#2|) (-336)) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) ((|HasCategory| (-380 |#2|) (QUOTE (-133))) (|HasCategory| (-380 |#2|) (QUOTE (-135))) (|HasCategory| (-380 |#2|) (QUOTE (-322))) (|HasCategory| (-380 |#2|) (QUOTE (-336))) (-3700 (|HasCategory| (-380 |#2|) (QUOTE (-336))) (|HasCategory| (-380 |#2|) (QUOTE (-322)))) (|HasCategory| (-380 |#2|) (QUOTE (-341))) (|HasCategory| (-380 |#2|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| (-380 |#2|) (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| (-380 |#2|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-341))) (-3700 (|HasCategory| (-380 |#2|) (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| (-380 |#2|) (QUOTE (-336)))) (-12 (|HasCategory| (-380 |#2|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| (-380 |#2|) (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-380 |#2|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| (-380 |#2|) (QUOTE (-336)))) (-12 (|HasCategory| (-380 |#2|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| (-380 |#2|) (QUOTE (-322))))) (-12 (|HasCategory| (-380 |#2|) (QUOTE (-209))) (|HasCategory| (-380 |#2|) (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-380 |#2|) (QUOTE (-209))) (|HasCategory| (-380 |#2|) (QUOTE (-336)))) (|HasCategory| (-380 |#2|) (QUOTE (-322))))) @@ -107,7 +107,7 @@ NIL (-44 |Key| |Entry|) ((|constructor| (NIL "\\spadtype{AssociationList} implements association lists. These may be viewed as lists of pairs where the first part is a key and the second is the stored value. For example,{} the key might be a string with a persons employee identification number and the value might be a record with personnel data."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-520) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (-3700 (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|))))))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-520) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (-3700 (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|))))))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-45 S R E) ((|constructor| (NIL "Abelian monoid ring elements (not necessarily of finite support) of this ring are of the form formal SUM (r_i * e_i) where the r_i are coefficents and the e_i,{} elements of the ordered abelian monoid,{} are thought of as exponents or monomials. The monomials commute with each other,{} and with the coefficients (which themselves may or may not be commutative). See \\spadtype{FiniteAbelianMonoidRing} for the case of finite support a useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.")) (/ (($ $ |#2|) "\\spad{p/c} divides \\spad{p} by the coefficient \\spad{c}.")) (|coefficient| ((|#2| $ |#3|) "\\spad{coefficient(p,{}e)} extracts the coefficient of the monomial with exponent \\spad{e} from polynomial \\spad{p},{} or returns zero if exponent is not present.")) (|reductum| (($ $) "\\spad{reductum(u)} returns \\spad{u} minus its leading monomial returns zero if handed the zero element.")) (|monomial| (($ |#2| |#3|) "\\spad{monomial(r,{}e)} makes a term from a coefficient \\spad{r} and an exponent \\spad{e}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(p)} tests if \\spad{p} is a single monomial.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,{}u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|degree| ((|#3| $) "\\spad{degree(p)} returns the maximum of the exponents of the terms of \\spad{p}.")) (|leadingMonomial| (($ $) "\\spad{leadingMonomial(p)} returns the monomial of \\spad{p} with the highest degree.")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(p)} returns the coefficient highest degree term of \\spad{p}."))) NIL @@ -150,7 +150,7 @@ NIL NIL (-55 R |Row| |Col|) ((|constructor| (NIL "\\indented{1}{TwoDimensionalArrayCategory is a general array category which} allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and columns returned as objects of type Col. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,{}a)} assign \\spad{a(i,{}j)} to \\spad{f(a(i,{}j))} for all \\spad{i,{} j}")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $ |#1|) "\\spad{map(f,{}a,{}b,{}r)} returns \\spad{c},{} where \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} when both \\spad{a(i,{}j)} and \\spad{b(i,{}j)} exist; else \\spad{c(i,{}j) = f(r,{} b(i,{}j))} when \\spad{a(i,{}j)} does not exist; else \\spad{c(i,{}j) = f(a(i,{}j),{}r)} when \\spad{b(i,{}j)} does not exist; otherwise \\spad{c(i,{}j) = f(r,{}r)}.") (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,{}a,{}b)} returns \\spad{c},{} where \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} for all \\spad{i,{} j}") (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}a)} returns \\spad{b},{} where \\spad{b(i,{}j) = f(a(i,{}j))} for all \\spad{i,{} j}")) (|setColumn!| (($ $ (|Integer|) |#3|) "\\spad{setColumn!(m,{}j,{}v)} sets to \\spad{j}th column of \\spad{m} to \\spad{v}")) (|setRow!| (($ $ (|Integer|) |#2|) "\\spad{setRow!(m,{}i,{}v)} sets to \\spad{i}th row of \\spad{m} to \\spad{v}")) (|qsetelt!| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{qsetelt!(m,{}i,{}j,{}r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} NO error check to determine if indices are in proper ranges")) (|setelt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{setelt(m,{}i,{}j,{}r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} error check to determine if indices are in proper ranges")) (|parts| (((|List| |#1|) $) "\\spad{parts(m)} returns a list of the elements of \\spad{m} in row major order")) (|column| ((|#3| $ (|Integer|)) "\\spad{column(m,{}j)} returns the \\spad{j}th column of \\spad{m} error check to determine if index is in proper ranges")) (|row| ((|#2| $ (|Integer|)) "\\spad{row(m,{}i)} returns the \\spad{i}th row of \\spad{m} error check to determine if index is in proper ranges")) (|qelt| ((|#1| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} NO error check to determine if indices are in proper ranges")) (|elt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{elt(m,{}i,{}j,{}r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise") ((|#1| $ (|Integer|) (|Integer|)) "\\spad{elt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} error check to determine if indices are in proper ranges")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the array \\spad{m}")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the array \\spad{m}")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the array \\spad{m}")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the array \\spad{m}")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the array \\spad{m}")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the array \\spad{m}")) (|fill!| (($ $ |#1|) "\\spad{fill!(m,{}r)} fills \\spad{m} with \\spad{r}\\spad{'s}")) (|new| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{new(m,{}n,{}r)} is an \\spad{m}-by-\\spad{n} array all of whose entries are \\spad{r}")) (|finiteAggregate| ((|attribute|) "two-dimensional arrays are finite")) (|shallowlyMutable| ((|attribute|) "one may destructively alter arrays"))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-56 A B) ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on one-dimensional arrays} with unary and binary functions involving different underlying types")) (|map| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1|) (|OneDimensionalArray| |#1|)) "\\spad{map(f,{}a)} applies function \\spad{f} to each member of one-dimensional array \\spad{a} resulting in a new one-dimensional array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{reduce(f,{}a,{}r)} applies function \\spad{f} to each successive element of the one-dimensional array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,{}[1,{}2,{}3],{}0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{scan(f,{}a,{}r)} successively applies \\spad{reduce(f,{}x,{}r)} to more and more leading sub-arrays \\spad{x} of one-dimensional array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,{}a2,{}...]},{} then \\spad{scan(f,{}a,{}r)} returns \\spad{[reduce(f,{}[a1],{}r),{}reduce(f,{}[a1,{}a2],{}r),{}...]}."))) @@ -164,59 +164,59 @@ NIL ((|constructor| (NIL "\\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.")) (|shallowlyMutable| ((|attribute|) "One may destructively alter TwoDimensionalArray\\spad{'s}."))) ((-4229 . T) (-4230 . T)) ((|HasCategory| |#1| (QUOTE (-1012))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))))) -(-59 -2889) +(-59 -2883) ((|constructor| (NIL "\\spadtype{ASP10} produces Fortran for Type 10 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package}. This ASP computes the values of a set of functions,{} for example:\\begin{verbatim} SUBROUTINE COEFFN(P,Q,DQDL,X,ELAM,JINT) DOUBLE PRECISION ELAM,P,Q,X,DQDL INTEGER JINT P=1.0D0 Q=((-1.0D0*X**3)+ELAM*X*X-2.0D0)/(X*X) DQDL=1.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE JINT) (QUOTE X) (QUOTE ELAM)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-60 -2889) +(-60 -2883) ((|constructor| (NIL "\\spadtype{Asp12} produces Fortran for Type 12 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package} etc.,{} for example:\\begin{verbatim} SUBROUTINE MONIT (MAXIT,IFLAG,ELAM,FINFO) DOUBLE PRECISION ELAM,FINFO(15) INTEGER MAXIT,IFLAG IF(MAXIT.EQ.-1)THEN PRINT*,\"Output from Monit\" ENDIF PRINT*,MAXIT,IFLAG,ELAM,(FINFO(I),I=1,4) RETURN END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP12}."))) NIL NIL -(-61 -2889) +(-61 -2883) ((|constructor| (NIL "\\spadtype{Asp19} produces Fortran for Type 19 ASPs,{} evaluating a set of functions and their jacobian at a given point,{} for example:\\begin{verbatim} SUBROUTINE LSFUN2(M,N,XC,FVECC,FJACC,LJC) DOUBLE PRECISION FVECC(M),FJACC(LJC,N),XC(N) INTEGER M,N,LJC INTEGER I,J DO 25003 I=1,LJC DO 25004 J=1,N FJACC(I,J)=0.0D025004 CONTINUE25003 CONTINUE FVECC(1)=((XC(1)-0.14D0)*XC(3)+(15.0D0*XC(1)-2.1D0)*XC(2)+1.0D0)/( &XC(3)+15.0D0*XC(2)) FVECC(2)=((XC(1)-0.18D0)*XC(3)+(7.0D0*XC(1)-1.26D0)*XC(2)+1.0D0)/( &XC(3)+7.0D0*XC(2)) FVECC(3)=((XC(1)-0.22D0)*XC(3)+(4.333333333333333D0*XC(1)-0.953333 &3333333333D0)*XC(2)+1.0D0)/(XC(3)+4.333333333333333D0*XC(2)) FVECC(4)=((XC(1)-0.25D0)*XC(3)+(3.0D0*XC(1)-0.75D0)*XC(2)+1.0D0)/( &XC(3)+3.0D0*XC(2)) FVECC(5)=((XC(1)-0.29D0)*XC(3)+(2.2D0*XC(1)-0.6379999999999999D0)* &XC(2)+1.0D0)/(XC(3)+2.2D0*XC(2)) FVECC(6)=((XC(1)-0.32D0)*XC(3)+(1.666666666666667D0*XC(1)-0.533333 &3333333333D0)*XC(2)+1.0D0)/(XC(3)+1.666666666666667D0*XC(2)) FVECC(7)=((XC(1)-0.35D0)*XC(3)+(1.285714285714286D0*XC(1)-0.45D0)* &XC(2)+1.0D0)/(XC(3)+1.285714285714286D0*XC(2)) FVECC(8)=((XC(1)-0.39D0)*XC(3)+(XC(1)-0.39D0)*XC(2)+1.0D0)/(XC(3)+ &XC(2)) FVECC(9)=((XC(1)-0.37D0)*XC(3)+(XC(1)-0.37D0)*XC(2)+1.285714285714 &286D0)/(XC(3)+XC(2)) FVECC(10)=((XC(1)-0.58D0)*XC(3)+(XC(1)-0.58D0)*XC(2)+1.66666666666 &6667D0)/(XC(3)+XC(2)) FVECC(11)=((XC(1)-0.73D0)*XC(3)+(XC(1)-0.73D0)*XC(2)+2.2D0)/(XC(3) &+XC(2)) FVECC(12)=((XC(1)-0.96D0)*XC(3)+(XC(1)-0.96D0)*XC(2)+3.0D0)/(XC(3) &+XC(2)) FVECC(13)=((XC(1)-1.34D0)*XC(3)+(XC(1)-1.34D0)*XC(2)+4.33333333333 &3333D0)/(XC(3)+XC(2)) FVECC(14)=((XC(1)-2.1D0)*XC(3)+(XC(1)-2.1D0)*XC(2)+7.0D0)/(XC(3)+X &C(2)) FVECC(15)=((XC(1)-4.39D0)*XC(3)+(XC(1)-4.39D0)*XC(2)+15.0D0)/(XC(3 &)+XC(2)) FJACC(1,1)=1.0D0 FJACC(1,2)=-15.0D0/(XC(3)**2+30.0D0*XC(2)*XC(3)+225.0D0*XC(2)**2) FJACC(1,3)=-1.0D0/(XC(3)**2+30.0D0*XC(2)*XC(3)+225.0D0*XC(2)**2) FJACC(2,1)=1.0D0 FJACC(2,2)=-7.0D0/(XC(3)**2+14.0D0*XC(2)*XC(3)+49.0D0*XC(2)**2) FJACC(2,3)=-1.0D0/(XC(3)**2+14.0D0*XC(2)*XC(3)+49.0D0*XC(2)**2) FJACC(3,1)=1.0D0 FJACC(3,2)=((-0.1110223024625157D-15*XC(3))-4.333333333333333D0)/( &XC(3)**2+8.666666666666666D0*XC(2)*XC(3)+18.77777777777778D0*XC(2) &**2) FJACC(3,3)=(0.1110223024625157D-15*XC(2)-1.0D0)/(XC(3)**2+8.666666 &666666666D0*XC(2)*XC(3)+18.77777777777778D0*XC(2)**2) FJACC(4,1)=1.0D0 FJACC(4,2)=-3.0D0/(XC(3)**2+6.0D0*XC(2)*XC(3)+9.0D0*XC(2)**2) FJACC(4,3)=-1.0D0/(XC(3)**2+6.0D0*XC(2)*XC(3)+9.0D0*XC(2)**2) FJACC(5,1)=1.0D0 FJACC(5,2)=((-0.1110223024625157D-15*XC(3))-2.2D0)/(XC(3)**2+4.399 &999999999999D0*XC(2)*XC(3)+4.839999999999998D0*XC(2)**2) FJACC(5,3)=(0.1110223024625157D-15*XC(2)-1.0D0)/(XC(3)**2+4.399999 &999999999D0*XC(2)*XC(3)+4.839999999999998D0*XC(2)**2) FJACC(6,1)=1.0D0 FJACC(6,2)=((-0.2220446049250313D-15*XC(3))-1.666666666666667D0)/( &XC(3)**2+3.333333333333333D0*XC(2)*XC(3)+2.777777777777777D0*XC(2) &**2) FJACC(6,3)=(0.2220446049250313D-15*XC(2)-1.0D0)/(XC(3)**2+3.333333 &333333333D0*XC(2)*XC(3)+2.777777777777777D0*XC(2)**2) FJACC(7,1)=1.0D0 FJACC(7,2)=((-0.5551115123125783D-16*XC(3))-1.285714285714286D0)/( &XC(3)**2+2.571428571428571D0*XC(2)*XC(3)+1.653061224489796D0*XC(2) &**2) FJACC(7,3)=(0.5551115123125783D-16*XC(2)-1.0D0)/(XC(3)**2+2.571428 &571428571D0*XC(2)*XC(3)+1.653061224489796D0*XC(2)**2) FJACC(8,1)=1.0D0 FJACC(8,2)=-1.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(8,3)=-1.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(9,1)=1.0D0 FJACC(9,2)=-1.285714285714286D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)* &*2) FJACC(9,3)=-1.285714285714286D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)* &*2) FJACC(10,1)=1.0D0 FJACC(10,2)=-1.666666666666667D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2) &**2) FJACC(10,3)=-1.666666666666667D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2) &**2) FJACC(11,1)=1.0D0 FJACC(11,2)=-2.2D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(11,3)=-2.2D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(12,1)=1.0D0 FJACC(12,2)=-3.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(12,3)=-3.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(13,1)=1.0D0 FJACC(13,2)=-4.333333333333333D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2) &**2) FJACC(13,3)=-4.333333333333333D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2) &**2) FJACC(14,1)=1.0D0 FJACC(14,2)=-7.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(14,3)=-7.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(15,1)=1.0D0 FJACC(15,2)=-15.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) FJACC(15,3)=-15.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2) RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-62 -2889) +(-62 -2883) ((|constructor| (NIL "\\spadtype{Asp1} produces Fortran for Type 1 ASPs,{} needed for various NAG routines. Type 1 ASPs take a univariate expression (in the symbol \\spad{X}) and turn it into a Fortran Function like the following:\\begin{verbatim} DOUBLE PRECISION FUNCTION F(X) DOUBLE PRECISION X F=DSIN(X) RETURN END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) NIL NIL -(-63 -2889) +(-63 -2883) ((|constructor| (NIL "\\spadtype{Asp20} produces Fortran for Type 20 ASPs,{} for example:\\begin{verbatim} SUBROUTINE QPHESS(N,NROWH,NCOLH,JTHCOL,HESS,X,HX) DOUBLE PRECISION HX(N),X(N),HESS(NROWH,NCOLH) INTEGER JTHCOL,N,NROWH,NCOLH HX(1)=2.0D0*X(1) HX(2)=2.0D0*X(2) HX(3)=2.0D0*X(4)+2.0D0*X(3) HX(4)=2.0D0*X(4)+2.0D0*X(3) HX(5)=2.0D0*X(5) HX(6)=(-2.0D0*X(7))+(-2.0D0*X(6)) HX(7)=(-2.0D0*X(7))+(-2.0D0*X(6)) RETURN END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct|) (|construct| (QUOTE X) (QUOTE HESS)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-64 -2889) +(-64 -2883) ((|constructor| (NIL "\\spadtype{Asp24} produces Fortran for Type 24 ASPs which evaluate a multivariate function at a point (needed for NAG routine \\axiomOpFrom{e04jaf}{e04Package}),{} for example:\\begin{verbatim} SUBROUTINE FUNCT1(N,XC,FC) DOUBLE PRECISION FC,XC(N) INTEGER N FC=10.0D0*XC(4)**4+(-40.0D0*XC(1)*XC(4)**3)+(60.0D0*XC(1)**2+5 &.0D0)*XC(4)**2+((-10.0D0*XC(3))+(-40.0D0*XC(1)**3))*XC(4)+16.0D0*X &C(3)**4+(-32.0D0*XC(2)*XC(3)**3)+(24.0D0*XC(2)**2+5.0D0)*XC(3)**2+ &(-8.0D0*XC(2)**3*XC(3))+XC(2)**4+100.0D0*XC(2)**2+20.0D0*XC(1)*XC( &2)+10.0D0*XC(1)**4+XC(1)**2 RETURN END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) NIL NIL -(-65 -2889) +(-65 -2883) ((|constructor| (NIL "\\spadtype{Asp27} produces Fortran for Type 27 ASPs,{} needed for NAG routine \\axiomOpFrom{f02fjf}{f02Package} ,{}for example:\\begin{verbatim} FUNCTION DOT(IFLAG,N,Z,W,RWORK,LRWORK,IWORK,LIWORK) DOUBLE PRECISION W(N),Z(N),RWORK(LRWORK) INTEGER N,LIWORK,IFLAG,LRWORK,IWORK(LIWORK) DOT=(W(16)+(-0.5D0*W(15)))*Z(16)+((-0.5D0*W(16))+W(15)+(-0.5D0*W(1 &4)))*Z(15)+((-0.5D0*W(15))+W(14)+(-0.5D0*W(13)))*Z(14)+((-0.5D0*W( &14))+W(13)+(-0.5D0*W(12)))*Z(13)+((-0.5D0*W(13))+W(12)+(-0.5D0*W(1 &1)))*Z(12)+((-0.5D0*W(12))+W(11)+(-0.5D0*W(10)))*Z(11)+((-0.5D0*W( &11))+W(10)+(-0.5D0*W(9)))*Z(10)+((-0.5D0*W(10))+W(9)+(-0.5D0*W(8)) &)*Z(9)+((-0.5D0*W(9))+W(8)+(-0.5D0*W(7)))*Z(8)+((-0.5D0*W(8))+W(7) &+(-0.5D0*W(6)))*Z(7)+((-0.5D0*W(7))+W(6)+(-0.5D0*W(5)))*Z(6)+((-0. &5D0*W(6))+W(5)+(-0.5D0*W(4)))*Z(5)+((-0.5D0*W(5))+W(4)+(-0.5D0*W(3 &)))*Z(4)+((-0.5D0*W(4))+W(3)+(-0.5D0*W(2)))*Z(3)+((-0.5D0*W(3))+W( &2)+(-0.5D0*W(1)))*Z(2)+((-0.5D0*W(2))+W(1))*Z(1) RETURN END\\end{verbatim}"))) NIL NIL -(-66 -2889) +(-66 -2883) ((|constructor| (NIL "\\spadtype{Asp28} produces Fortran for Type 28 ASPs,{} used in NAG routine \\axiomOpFrom{f02fjf}{f02Package},{} for example:\\begin{verbatim} SUBROUTINE IMAGE(IFLAG,N,Z,W,RWORK,LRWORK,IWORK,LIWORK) DOUBLE PRECISION Z(N),W(N),IWORK(LRWORK),RWORK(LRWORK) INTEGER N,LIWORK,IFLAG,LRWORK W(1)=0.01707454969713436D0*Z(16)+0.001747395874954051D0*Z(15)+0.00 &2106973900813502D0*Z(14)+0.002957434991769087D0*Z(13)+(-0.00700554 &0882865317D0*Z(12))+(-0.01219194009813166D0*Z(11))+0.0037230647365 &3087D0*Z(10)+0.04932374658377151D0*Z(9)+(-0.03586220812223305D0*Z( &8))+(-0.04723268012114625D0*Z(7))+(-0.02434652144032987D0*Z(6))+0. &2264766947290192D0*Z(5)+(-0.1385343580686922D0*Z(4))+(-0.116530050 &8238904D0*Z(3))+(-0.2803531651057233D0*Z(2))+1.019463911841327D0*Z &(1) W(2)=0.0227345011107737D0*Z(16)+0.008812321197398072D0*Z(15)+0.010 &94012210519586D0*Z(14)+(-0.01764072463999744D0*Z(13))+(-0.01357136 &72105995D0*Z(12))+0.00157466157362272D0*Z(11)+0.05258889186338282D &0*Z(10)+(-0.01981532388243379D0*Z(9))+(-0.06095390688679697D0*Z(8) &)+(-0.04153119955569051D0*Z(7))+0.2176561076571465D0*Z(6)+(-0.0532 &5555586632358D0*Z(5))+(-0.1688977368984641D0*Z(4))+(-0.32440166056 &67343D0*Z(3))+0.9128222941872173D0*Z(2)+(-0.2419652703415429D0*Z(1 &)) W(3)=0.03371198197190302D0*Z(16)+0.02021603150122265D0*Z(15)+(-0.0 &06607305534689702D0*Z(14))+(-0.03032392238968179D0*Z(13))+0.002033 &305231024948D0*Z(12)+0.05375944956767728D0*Z(11)+(-0.0163213312502 &9967D0*Z(10))+(-0.05483186562035512D0*Z(9))+(-0.04901428822579872D &0*Z(8))+0.2091097927887612D0*Z(7)+(-0.05760560341383113D0*Z(6))+(- &0.1236679206156403D0*Z(5))+(-0.3523683853026259D0*Z(4))+0.88929961 &32269974D0*Z(3)+(-0.2995429545781457D0*Z(2))+(-0.02986582812574917 &D0*Z(1)) W(4)=0.05141563713660119D0*Z(16)+0.005239165960779299D0*Z(15)+(-0. &01623427735779699D0*Z(14))+(-0.01965809746040371D0*Z(13))+0.054688 &97337339577D0*Z(12)+(-0.014224695935687D0*Z(11))+(-0.0505181779315 &6355D0*Z(10))+(-0.04353074206076491D0*Z(9))+0.2012230497530726D0*Z &(8)+(-0.06630874514535952D0*Z(7))+(-0.1280829963720053D0*Z(6))+(-0 &.305169742604165D0*Z(5))+0.8600427128450191D0*Z(4)+(-0.32415033802 &68184D0*Z(3))+(-0.09033531980693314D0*Z(2))+0.09089205517109111D0* &Z(1) W(5)=0.04556369767776375D0*Z(16)+(-0.001822737697581869D0*Z(15))+( &-0.002512226501941856D0*Z(14))+0.02947046460707379D0*Z(13)+(-0.014 &45079632086177D0*Z(12))+(-0.05034242196614937D0*Z(11))+(-0.0376966 &3291725935D0*Z(10))+0.2171103102175198D0*Z(9)+(-0.0824949256021352 &4D0*Z(8))+(-0.1473995209288945D0*Z(7))+(-0.315042193418466D0*Z(6)) &+0.9591623347824002D0*Z(5)+(-0.3852396953763045D0*Z(4))+(-0.141718 &5427288274D0*Z(3))+(-0.03423495461011043D0*Z(2))+0.319820917706851 &6D0*Z(1) W(6)=0.04015147277405744D0*Z(16)+0.01328585741341559D0*Z(15)+0.048 &26082005465965D0*Z(14)+(-0.04319641116207706D0*Z(13))+(-0.04931323 &319055762D0*Z(12))+(-0.03526886317505474D0*Z(11))+0.22295383396730 &01D0*Z(10)+(-0.07375317649315155D0*Z(9))+(-0.1589391311991561D0*Z( &8))+(-0.328001910890377D0*Z(7))+0.952576555482747D0*Z(6)+(-0.31583 &09975786731D0*Z(5))+(-0.1846882042225383D0*Z(4))+(-0.0703762046700 &4427D0*Z(3))+0.2311852964327382D0*Z(2)+0.04254083491825025D0*Z(1) W(7)=0.06069778964023718D0*Z(16)+0.06681263884671322D0*Z(15)+(-0.0 &2113506688615768D0*Z(14))+(-0.083996867458326D0*Z(13))+(-0.0329843 &8523869648D0*Z(12))+0.2276878326327734D0*Z(11)+(-0.067356038933017 &95D0*Z(10))+(-0.1559813965382218D0*Z(9))+(-0.3363262957694705D0*Z( &8))+0.9442791158560948D0*Z(7)+(-0.3199955249404657D0*Z(6))+(-0.136 &2463839920727D0*Z(5))+(-0.1006185171570586D0*Z(4))+0.2057504515015 &423D0*Z(3)+(-0.02065879269286707D0*Z(2))+0.03160990266745513D0*Z(1 &) W(8)=0.126386868896738D0*Z(16)+0.002563370039476418D0*Z(15)+(-0.05 &581757739455641D0*Z(14))+(-0.07777893205900685D0*Z(13))+0.23117338 &45834199D0*Z(12)+(-0.06031581134427592D0*Z(11))+(-0.14805474755869 &52D0*Z(10))+(-0.3364014128402243D0*Z(9))+0.9364014128402244D0*Z(8) &+(-0.3269452524413048D0*Z(7))+(-0.1396841886557241D0*Z(6))+(-0.056 &1733845834199D0*Z(5))+0.1777789320590069D0*Z(4)+(-0.04418242260544 &359D0*Z(3))+(-0.02756337003947642D0*Z(2))+0.07361313110326199D0*Z( &1) W(9)=0.07361313110326199D0*Z(16)+(-0.02756337003947642D0*Z(15))+(- &0.04418242260544359D0*Z(14))+0.1777789320590069D0*Z(13)+(-0.056173 &3845834199D0*Z(12))+(-0.1396841886557241D0*Z(11))+(-0.326945252441 &3048D0*Z(10))+0.9364014128402244D0*Z(9)+(-0.3364014128402243D0*Z(8 &))+(-0.1480547475586952D0*Z(7))+(-0.06031581134427592D0*Z(6))+0.23 &11733845834199D0*Z(5)+(-0.07777893205900685D0*Z(4))+(-0.0558175773 &9455641D0*Z(3))+0.002563370039476418D0*Z(2)+0.126386868896738D0*Z( &1) W(10)=0.03160990266745513D0*Z(16)+(-0.02065879269286707D0*Z(15))+0 &.2057504515015423D0*Z(14)+(-0.1006185171570586D0*Z(13))+(-0.136246 &3839920727D0*Z(12))+(-0.3199955249404657D0*Z(11))+0.94427911585609 &48D0*Z(10)+(-0.3363262957694705D0*Z(9))+(-0.1559813965382218D0*Z(8 &))+(-0.06735603893301795D0*Z(7))+0.2276878326327734D0*Z(6)+(-0.032 &98438523869648D0*Z(5))+(-0.083996867458326D0*Z(4))+(-0.02113506688 &615768D0*Z(3))+0.06681263884671322D0*Z(2)+0.06069778964023718D0*Z( &1) W(11)=0.04254083491825025D0*Z(16)+0.2311852964327382D0*Z(15)+(-0.0 &7037620467004427D0*Z(14))+(-0.1846882042225383D0*Z(13))+(-0.315830 &9975786731D0*Z(12))+0.952576555482747D0*Z(11)+(-0.328001910890377D &0*Z(10))+(-0.1589391311991561D0*Z(9))+(-0.07375317649315155D0*Z(8) &)+0.2229538339673001D0*Z(7)+(-0.03526886317505474D0*Z(6))+(-0.0493 &1323319055762D0*Z(5))+(-0.04319641116207706D0*Z(4))+0.048260820054 &65965D0*Z(3)+0.01328585741341559D0*Z(2)+0.04015147277405744D0*Z(1) W(12)=0.3198209177068516D0*Z(16)+(-0.03423495461011043D0*Z(15))+(- &0.1417185427288274D0*Z(14))+(-0.3852396953763045D0*Z(13))+0.959162 &3347824002D0*Z(12)+(-0.315042193418466D0*Z(11))+(-0.14739952092889 &45D0*Z(10))+(-0.08249492560213524D0*Z(9))+0.2171103102175198D0*Z(8 &)+(-0.03769663291725935D0*Z(7))+(-0.05034242196614937D0*Z(6))+(-0. &01445079632086177D0*Z(5))+0.02947046460707379D0*Z(4)+(-0.002512226 &501941856D0*Z(3))+(-0.001822737697581869D0*Z(2))+0.045563697677763 &75D0*Z(1) W(13)=0.09089205517109111D0*Z(16)+(-0.09033531980693314D0*Z(15))+( &-0.3241503380268184D0*Z(14))+0.8600427128450191D0*Z(13)+(-0.305169 &742604165D0*Z(12))+(-0.1280829963720053D0*Z(11))+(-0.0663087451453 &5952D0*Z(10))+0.2012230497530726D0*Z(9)+(-0.04353074206076491D0*Z( &8))+(-0.05051817793156355D0*Z(7))+(-0.014224695935687D0*Z(6))+0.05 &468897337339577D0*Z(5)+(-0.01965809746040371D0*Z(4))+(-0.016234277 &35779699D0*Z(3))+0.005239165960779299D0*Z(2)+0.05141563713660119D0 &*Z(1) W(14)=(-0.02986582812574917D0*Z(16))+(-0.2995429545781457D0*Z(15)) &+0.8892996132269974D0*Z(14)+(-0.3523683853026259D0*Z(13))+(-0.1236 &679206156403D0*Z(12))+(-0.05760560341383113D0*Z(11))+0.20910979278 &87612D0*Z(10)+(-0.04901428822579872D0*Z(9))+(-0.05483186562035512D &0*Z(8))+(-0.01632133125029967D0*Z(7))+0.05375944956767728D0*Z(6)+0 &.002033305231024948D0*Z(5)+(-0.03032392238968179D0*Z(4))+(-0.00660 &7305534689702D0*Z(3))+0.02021603150122265D0*Z(2)+0.033711981971903 &02D0*Z(1) W(15)=(-0.2419652703415429D0*Z(16))+0.9128222941872173D0*Z(15)+(-0 &.3244016605667343D0*Z(14))+(-0.1688977368984641D0*Z(13))+(-0.05325 &555586632358D0*Z(12))+0.2176561076571465D0*Z(11)+(-0.0415311995556 &9051D0*Z(10))+(-0.06095390688679697D0*Z(9))+(-0.01981532388243379D &0*Z(8))+0.05258889186338282D0*Z(7)+0.00157466157362272D0*Z(6)+(-0. &0135713672105995D0*Z(5))+(-0.01764072463999744D0*Z(4))+0.010940122 &10519586D0*Z(3)+0.008812321197398072D0*Z(2)+0.0227345011107737D0*Z &(1) W(16)=1.019463911841327D0*Z(16)+(-0.2803531651057233D0*Z(15))+(-0. &1165300508238904D0*Z(14))+(-0.1385343580686922D0*Z(13))+0.22647669 &47290192D0*Z(12)+(-0.02434652144032987D0*Z(11))+(-0.04723268012114 &625D0*Z(10))+(-0.03586220812223305D0*Z(9))+0.04932374658377151D0*Z &(8)+0.00372306473653087D0*Z(7)+(-0.01219194009813166D0*Z(6))+(-0.0 &07005540882865317D0*Z(5))+0.002957434991769087D0*Z(4)+0.0021069739 &00813502D0*Z(3)+0.001747395874954051D0*Z(2)+0.01707454969713436D0* &Z(1) RETURN END\\end{verbatim}"))) NIL NIL -(-67 -2889) +(-67 -2883) ((|constructor| (NIL "\\spadtype{Asp29} produces Fortran for Type 29 ASPs,{} needed for NAG routine \\axiomOpFrom{f02fjf}{f02Package},{} for example:\\begin{verbatim} SUBROUTINE MONIT(ISTATE,NEXTIT,NEVALS,NEVECS,K,F,D) DOUBLE PRECISION D(K),F(K) INTEGER K,NEXTIT,NEVALS,NVECS,ISTATE CALL F02FJZ(ISTATE,NEXTIT,NEVALS,NEVECS,K,F,D) RETURN END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP29}."))) NIL NIL -(-68 -2889) +(-68 -2883) ((|constructor| (NIL "\\spadtype{Asp30} produces Fortran for Type 30 ASPs,{} needed for NAG routine \\axiomOpFrom{f04qaf}{f04Package},{} for example:\\begin{verbatim} SUBROUTINE APROD(MODE,M,N,X,Y,RWORK,LRWORK,IWORK,LIWORK) DOUBLE PRECISION X(N),Y(M),RWORK(LRWORK) INTEGER M,N,LIWORK,IFAIL,LRWORK,IWORK(LIWORK),MODE DOUBLE PRECISION A(5,5) EXTERNAL F06PAF A(1,1)=1.0D0 A(1,2)=0.0D0 A(1,3)=0.0D0 A(1,4)=-1.0D0 A(1,5)=0.0D0 A(2,1)=0.0D0 A(2,2)=1.0D0 A(2,3)=0.0D0 A(2,4)=0.0D0 A(2,5)=-1.0D0 A(3,1)=0.0D0 A(3,2)=0.0D0 A(3,3)=1.0D0 A(3,4)=-1.0D0 A(3,5)=0.0D0 A(4,1)=-1.0D0 A(4,2)=0.0D0 A(4,3)=-1.0D0 A(4,4)=4.0D0 A(4,5)=-1.0D0 A(5,1)=0.0D0 A(5,2)=-1.0D0 A(5,3)=0.0D0 A(5,4)=-1.0D0 A(5,5)=4.0D0 IF(MODE.EQ.1)THEN CALL F06PAF('N',M,N,1.0D0,A,M,X,1,1.0D0,Y,1) ELSEIF(MODE.EQ.2)THEN CALL F06PAF('T',M,N,1.0D0,A,M,Y,1,1.0D0,X,1) ENDIF RETURN END\\end{verbatim}"))) NIL NIL -(-69 -2889) +(-69 -2883) ((|constructor| (NIL "\\spadtype{Asp31} produces Fortran for Type 31 ASPs,{} needed for NAG routine \\axiomOpFrom{d02ejf}{d02Package},{} for example:\\begin{verbatim} SUBROUTINE PEDERV(X,Y,PW) DOUBLE PRECISION X,Y(*) DOUBLE PRECISION PW(3,3) PW(1,1)=-0.03999999999999999D0 PW(1,2)=10000.0D0*Y(3) PW(1,3)=10000.0D0*Y(2) PW(2,1)=0.03999999999999999D0 PW(2,2)=(-10000.0D0*Y(3))+(-60000000.0D0*Y(2)) PW(2,3)=-10000.0D0*Y(2) PW(3,1)=0.0D0 PW(3,2)=60000000.0D0*Y(2) PW(3,3)=0.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-70 -2889) +(-70 -2883) ((|constructor| (NIL "\\spadtype{Asp33} produces Fortran for Type 33 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package}. The code is a dummy ASP:\\begin{verbatim} SUBROUTINE REPORT(X,V,JINT) DOUBLE PRECISION V(3),X INTEGER JINT RETURN END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP33}."))) NIL NIL -(-71 -2889) +(-71 -2883) ((|constructor| (NIL "\\spadtype{Asp34} produces Fortran for Type 34 ASPs,{} needed for NAG routine \\axiomOpFrom{f04mbf}{f04Package},{} for example:\\begin{verbatim} SUBROUTINE MSOLVE(IFLAG,N,X,Y,RWORK,LRWORK,IWORK,LIWORK) DOUBLE PRECISION RWORK(LRWORK),X(N),Y(N) INTEGER I,J,N,LIWORK,IFLAG,LRWORK,IWORK(LIWORK) DOUBLE PRECISION W1(3),W2(3),MS(3,3) IFLAG=-1 MS(1,1)=2.0D0 MS(1,2)=1.0D0 MS(1,3)=0.0D0 MS(2,1)=1.0D0 MS(2,2)=2.0D0 MS(2,3)=1.0D0 MS(3,1)=0.0D0 MS(3,2)=1.0D0 MS(3,3)=2.0D0 CALL F04ASF(MS,N,X,N,Y,W1,W2,IFLAG) IFLAG=-IFLAG RETURN END\\end{verbatim}"))) NIL NIL -(-72 -2889) +(-72 -2883) ((|constructor| (NIL "\\spadtype{Asp35} produces Fortran for Type 35 ASPs,{} needed for NAG routines \\axiomOpFrom{c05pbf}{c05Package},{} \\axiomOpFrom{c05pcf}{c05Package},{} for example:\\begin{verbatim} SUBROUTINE FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N) INTEGER LDFJAC,N,IFLAG IF(IFLAG.EQ.1)THEN FVEC(1)=(-1.0D0*X(2))+X(1) FVEC(2)=(-1.0D0*X(3))+2.0D0*X(2) FVEC(3)=3.0D0*X(3) ELSEIF(IFLAG.EQ.2)THEN FJAC(1,1)=1.0D0 FJAC(1,2)=-1.0D0 FJAC(1,3)=0.0D0 FJAC(2,1)=0.0D0 FJAC(2,2)=2.0D0 FJAC(2,3)=-1.0D0 FJAC(3,1)=0.0D0 FJAC(3,2)=0.0D0 FJAC(3,3)=3.0D0 ENDIF END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL @@ -228,55 +228,55 @@ NIL ((|constructor| (NIL "\\spadtype{Asp42} produces Fortran for Type 42 ASPs,{} needed for NAG routines \\axiomOpFrom{d02raf}{d02Package} and \\axiomOpFrom{d02saf}{d02Package} in particular. These ASPs are in fact three Fortran routines which return a vector of functions,{} and their derivatives \\spad{wrt} \\spad{Y}(\\spad{i}) and also a continuation parameter EPS,{} for example:\\begin{verbatim} SUBROUTINE G(EPS,YA,YB,BC,N) DOUBLE PRECISION EPS,YA(N),YB(N),BC(N) INTEGER N BC(1)=YA(1) BC(2)=YA(2) BC(3)=YB(2)-1.0D0 RETURN END SUBROUTINE JACOBG(EPS,YA,YB,AJ,BJ,N) DOUBLE PRECISION EPS,YA(N),AJ(N,N),BJ(N,N),YB(N) INTEGER N AJ(1,1)=1.0D0 AJ(1,2)=0.0D0 AJ(1,3)=0.0D0 AJ(2,1)=0.0D0 AJ(2,2)=1.0D0 AJ(2,3)=0.0D0 AJ(3,1)=0.0D0 AJ(3,2)=0.0D0 AJ(3,3)=0.0D0 BJ(1,1)=0.0D0 BJ(1,2)=0.0D0 BJ(1,3)=0.0D0 BJ(2,1)=0.0D0 BJ(2,2)=0.0D0 BJ(2,3)=0.0D0 BJ(3,1)=0.0D0 BJ(3,2)=1.0D0 BJ(3,3)=0.0D0 RETURN END SUBROUTINE JACGEP(EPS,YA,YB,BCEP,N) DOUBLE PRECISION EPS,YA(N),YB(N),BCEP(N) INTEGER N BCEP(1)=0.0D0 BCEP(2)=0.0D0 BCEP(3)=0.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE EPS)) (|construct| (QUOTE YA) (QUOTE YB)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-75 -2889) +(-75 -2883) ((|constructor| (NIL "\\spadtype{Asp49} produces Fortran for Type 49 ASPs,{} needed for NAG routines \\axiomOpFrom{e04dgf}{e04Package},{} \\axiomOpFrom{e04ucf}{e04Package},{} for example:\\begin{verbatim} SUBROUTINE OBJFUN(MODE,N,X,OBJF,OBJGRD,NSTATE,IUSER,USER) DOUBLE PRECISION X(N),OBJF,OBJGRD(N),USER(*) INTEGER N,IUSER(*),MODE,NSTATE OBJF=X(4)*X(9)+((-1.0D0*X(5))+X(3))*X(8)+((-1.0D0*X(3))+X(1))*X(7) &+(-1.0D0*X(2)*X(6)) OBJGRD(1)=X(7) OBJGRD(2)=-1.0D0*X(6) OBJGRD(3)=X(8)+(-1.0D0*X(7)) OBJGRD(4)=X(9) OBJGRD(5)=-1.0D0*X(8) OBJGRD(6)=-1.0D0*X(2) OBJGRD(7)=(-1.0D0*X(3))+X(1) OBJGRD(8)=(-1.0D0*X(5))+X(3) OBJGRD(9)=X(4) RETURN END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) NIL NIL -(-76 -2889) +(-76 -2883) ((|constructor| (NIL "\\spadtype{Asp4} produces Fortran for Type 4 ASPs,{} which take an expression in \\spad{X}(1) .. \\spad{X}(NDIM) and produce a real function of the form:\\begin{verbatim} DOUBLE PRECISION FUNCTION FUNCTN(NDIM,X) DOUBLE PRECISION X(NDIM) INTEGER NDIM FUNCTN=(4.0D0*X(1)*X(3)**2*DEXP(2.0D0*X(1)*X(3)))/(X(4)**2+(2.0D0* &X(2)+2.0D0)*X(4)+X(2)**2+2.0D0*X(2)+1.0D0) RETURN END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) NIL NIL -(-77 -2889) +(-77 -2883) ((|constructor| (NIL "\\spadtype{Asp50} produces Fortran for Type 50 ASPs,{} needed for NAG routine \\axiomOpFrom{e04fdf}{e04Package},{} for example:\\begin{verbatim} SUBROUTINE LSFUN1(M,N,XC,FVECC) DOUBLE PRECISION FVECC(M),XC(N) INTEGER I,M,N FVECC(1)=((XC(1)-2.4D0)*XC(3)+(15.0D0*XC(1)-36.0D0)*XC(2)+1.0D0)/( &XC(3)+15.0D0*XC(2)) FVECC(2)=((XC(1)-2.8D0)*XC(3)+(7.0D0*XC(1)-19.6D0)*XC(2)+1.0D0)/(X &C(3)+7.0D0*XC(2)) FVECC(3)=((XC(1)-3.2D0)*XC(3)+(4.333333333333333D0*XC(1)-13.866666 &66666667D0)*XC(2)+1.0D0)/(XC(3)+4.333333333333333D0*XC(2)) FVECC(4)=((XC(1)-3.5D0)*XC(3)+(3.0D0*XC(1)-10.5D0)*XC(2)+1.0D0)/(X &C(3)+3.0D0*XC(2)) FVECC(5)=((XC(1)-3.9D0)*XC(3)+(2.2D0*XC(1)-8.579999999999998D0)*XC &(2)+1.0D0)/(XC(3)+2.2D0*XC(2)) FVECC(6)=((XC(1)-4.199999999999999D0)*XC(3)+(1.666666666666667D0*X &C(1)-7.0D0)*XC(2)+1.0D0)/(XC(3)+1.666666666666667D0*XC(2)) FVECC(7)=((XC(1)-4.5D0)*XC(3)+(1.285714285714286D0*XC(1)-5.7857142 &85714286D0)*XC(2)+1.0D0)/(XC(3)+1.285714285714286D0*XC(2)) FVECC(8)=((XC(1)-4.899999999999999D0)*XC(3)+(XC(1)-4.8999999999999 &99D0)*XC(2)+1.0D0)/(XC(3)+XC(2)) FVECC(9)=((XC(1)-4.699999999999999D0)*XC(3)+(XC(1)-4.6999999999999 &99D0)*XC(2)+1.285714285714286D0)/(XC(3)+XC(2)) FVECC(10)=((XC(1)-6.8D0)*XC(3)+(XC(1)-6.8D0)*XC(2)+1.6666666666666 &67D0)/(XC(3)+XC(2)) FVECC(11)=((XC(1)-8.299999999999999D0)*XC(3)+(XC(1)-8.299999999999 &999D0)*XC(2)+2.2D0)/(XC(3)+XC(2)) FVECC(12)=((XC(1)-10.6D0)*XC(3)+(XC(1)-10.6D0)*XC(2)+3.0D0)/(XC(3) &+XC(2)) FVECC(13)=((XC(1)-1.34D0)*XC(3)+(XC(1)-1.34D0)*XC(2)+4.33333333333 &3333D0)/(XC(3)+XC(2)) FVECC(14)=((XC(1)-2.1D0)*XC(3)+(XC(1)-2.1D0)*XC(2)+7.0D0)/(XC(3)+X &C(2)) FVECC(15)=((XC(1)-4.39D0)*XC(3)+(XC(1)-4.39D0)*XC(2)+15.0D0)/(XC(3 &)+XC(2)) END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-78 -2889) +(-78 -2883) ((|constructor| (NIL "\\spadtype{Asp55} produces Fortran for Type 55 ASPs,{} needed for NAG routines \\axiomOpFrom{e04dgf}{e04Package} and \\axiomOpFrom{e04ucf}{e04Package},{} for example:\\begin{verbatim} SUBROUTINE CONFUN(MODE,NCNLN,N,NROWJ,NEEDC,X,C,CJAC,NSTATE,IUSER &,USER) DOUBLE PRECISION C(NCNLN),X(N),CJAC(NROWJ,N),USER(*) INTEGER N,IUSER(*),NEEDC(NCNLN),NROWJ,MODE,NCNLN,NSTATE IF(NEEDC(1).GT.0)THEN C(1)=X(6)**2+X(1)**2 CJAC(1,1)=2.0D0*X(1) CJAC(1,2)=0.0D0 CJAC(1,3)=0.0D0 CJAC(1,4)=0.0D0 CJAC(1,5)=0.0D0 CJAC(1,6)=2.0D0*X(6) ENDIF IF(NEEDC(2).GT.0)THEN C(2)=X(2)**2+(-2.0D0*X(1)*X(2))+X(1)**2 CJAC(2,1)=(-2.0D0*X(2))+2.0D0*X(1) CJAC(2,2)=2.0D0*X(2)+(-2.0D0*X(1)) CJAC(2,3)=0.0D0 CJAC(2,4)=0.0D0 CJAC(2,5)=0.0D0 CJAC(2,6)=0.0D0 ENDIF IF(NEEDC(3).GT.0)THEN C(3)=X(3)**2+(-2.0D0*X(1)*X(3))+X(2)**2+X(1)**2 CJAC(3,1)=(-2.0D0*X(3))+2.0D0*X(1) CJAC(3,2)=2.0D0*X(2) CJAC(3,3)=2.0D0*X(3)+(-2.0D0*X(1)) CJAC(3,4)=0.0D0 CJAC(3,5)=0.0D0 CJAC(3,6)=0.0D0 ENDIF RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-79 -2889) +(-79 -2883) ((|constructor| (NIL "\\spadtype{Asp6} produces Fortran for Type 6 ASPs,{} needed for NAG routines \\axiomOpFrom{c05nbf}{c05Package},{} \\axiomOpFrom{c05ncf}{c05Package}. These represent vectors of functions of \\spad{X}(\\spad{i}) and look like:\\begin{verbatim} SUBROUTINE FCN(N,X,FVEC,IFLAG) DOUBLE PRECISION X(N),FVEC(N) INTEGER N,IFLAG FVEC(1)=(-2.0D0*X(2))+(-2.0D0*X(1)**2)+3.0D0*X(1)+1.0D0 FVEC(2)=(-2.0D0*X(3))+(-2.0D0*X(2)**2)+3.0D0*X(2)+(-1.0D0*X(1))+1. &0D0 FVEC(3)=(-2.0D0*X(4))+(-2.0D0*X(3)**2)+3.0D0*X(3)+(-1.0D0*X(2))+1. &0D0 FVEC(4)=(-2.0D0*X(5))+(-2.0D0*X(4)**2)+3.0D0*X(4)+(-1.0D0*X(3))+1. &0D0 FVEC(5)=(-2.0D0*X(6))+(-2.0D0*X(5)**2)+3.0D0*X(5)+(-1.0D0*X(4))+1. &0D0 FVEC(6)=(-2.0D0*X(7))+(-2.0D0*X(6)**2)+3.0D0*X(6)+(-1.0D0*X(5))+1. &0D0 FVEC(7)=(-2.0D0*X(8))+(-2.0D0*X(7)**2)+3.0D0*X(7)+(-1.0D0*X(6))+1. &0D0 FVEC(8)=(-2.0D0*X(9))+(-2.0D0*X(8)**2)+3.0D0*X(8)+(-1.0D0*X(7))+1. &0D0 FVEC(9)=(-2.0D0*X(9)**2)+3.0D0*X(9)+(-1.0D0*X(8))+1.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-80 -2889) +(-80 -2883) ((|constructor| (NIL "\\spadtype{Asp73} produces Fortran for Type 73 ASPs,{} needed for NAG routine \\axiomOpFrom{d03eef}{d03Package},{} for example:\\begin{verbatim} SUBROUTINE PDEF(X,Y,ALPHA,BETA,GAMMA,DELTA,EPSOLN,PHI,PSI) DOUBLE PRECISION ALPHA,EPSOLN,PHI,X,Y,BETA,DELTA,GAMMA,PSI ALPHA=DSIN(X) BETA=Y GAMMA=X*Y DELTA=DCOS(X)*DSIN(Y) EPSOLN=Y+X PHI=X PSI=Y RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X) (QUOTE Y)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-81 -2889) +(-81 -2883) ((|constructor| (NIL "\\spadtype{Asp74} produces Fortran for Type 74 ASPs,{} needed for NAG routine \\axiomOpFrom{d03eef}{d03Package},{} for example:\\begin{verbatim} SUBROUTINE BNDY(X,Y,A,B,C,IBND) DOUBLE PRECISION A,B,C,X,Y INTEGER IBND IF(IBND.EQ.0)THEN A=0.0D0 B=1.0D0 C=-1.0D0*DSIN(X) ELSEIF(IBND.EQ.1)THEN A=1.0D0 B=0.0D0 C=DSIN(X)*DSIN(Y) ELSEIF(IBND.EQ.2)THEN A=1.0D0 B=0.0D0 C=DSIN(X)*DSIN(Y) ELSEIF(IBND.EQ.3)THEN A=0.0D0 B=1.0D0 C=-1.0D0*DSIN(Y) ENDIF END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE X) (QUOTE Y)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-82 -2889) +(-82 -2883) ((|constructor| (NIL "\\spadtype{Asp77} produces Fortran for Type 77 ASPs,{} needed for NAG routine \\axiomOpFrom{d02gbf}{d02Package},{} for example:\\begin{verbatim} SUBROUTINE FCNF(X,F) DOUBLE PRECISION X DOUBLE PRECISION F(2,2) F(1,1)=0.0D0 F(1,2)=1.0D0 F(2,1)=0.0D0 F(2,2)=-10.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-83 -2889) +(-83 -2883) ((|constructor| (NIL "\\spadtype{Asp78} produces Fortran for Type 78 ASPs,{} needed for NAG routine \\axiomOpFrom{d02gbf}{d02Package},{} for example:\\begin{verbatim} SUBROUTINE FCNG(X,G) DOUBLE PRECISION G(*),X G(1)=0.0D0 G(2)=0.0D0 END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-84 -2889) +(-84 -2883) ((|constructor| (NIL "\\spadtype{Asp7} produces Fortran for Type 7 ASPs,{} needed for NAG routines \\axiomOpFrom{d02bbf}{d02Package},{} \\axiomOpFrom{d02gaf}{d02Package}. These represent a vector of functions of the scalar \\spad{X} and the array \\spad{Z},{} and look like:\\begin{verbatim} SUBROUTINE FCN(X,Z,F) DOUBLE PRECISION F(*),X,Z(*) F(1)=DTAN(Z(3)) F(2)=((-0.03199999999999999D0*DCOS(Z(3))*DTAN(Z(3)))+(-0.02D0*Z(2) &**2))/(Z(2)*DCOS(Z(3))) F(3)=-0.03199999999999999D0/(X*Z(2)**2) RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-85 -2889) +(-85 -2883) ((|constructor| (NIL "\\spadtype{Asp80} produces Fortran for Type 80 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package},{} for example:\\begin{verbatim} SUBROUTINE BDYVAL(XL,XR,ELAM,YL,YR) DOUBLE PRECISION ELAM,XL,YL(3),XR,YR(3) YL(1)=XL YL(2)=2.0D0 YR(1)=1.0D0 YR(2)=-1.0D0*DSQRT(XR+(-1.0D0*ELAM)) RETURN END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE XL) (QUOTE XR) (QUOTE ELAM)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-86 -2889) +(-86 -2883) ((|constructor| (NIL "\\spadtype{Asp8} produces Fortran for Type 8 ASPs,{} needed for NAG routine \\axiomOpFrom{d02bbf}{d02Package}. This ASP prints intermediate values of the computed solution of an ODE and might look like:\\begin{verbatim} SUBROUTINE OUTPUT(XSOL,Y,COUNT,M,N,RESULT,FORWRD) DOUBLE PRECISION Y(N),RESULT(M,N),XSOL INTEGER M,N,COUNT LOGICAL FORWRD DOUBLE PRECISION X02ALF,POINTS(8) EXTERNAL X02ALF INTEGER I POINTS(1)=1.0D0 POINTS(2)=2.0D0 POINTS(3)=3.0D0 POINTS(4)=4.0D0 POINTS(5)=5.0D0 POINTS(6)=6.0D0 POINTS(7)=7.0D0 POINTS(8)=8.0D0 COUNT=COUNT+1 DO 25001 I=1,N RESULT(COUNT,I)=Y(I)25001 CONTINUE IF(COUNT.EQ.M)THEN IF(FORWRD)THEN XSOL=X02ALF() ELSE XSOL=-X02ALF() ENDIF ELSE XSOL=POINTS(COUNT) ENDIF END\\end{verbatim}"))) NIL NIL -(-87 -2889) +(-87 -2883) ((|constructor| (NIL "\\spadtype{Asp9} produces Fortran for Type 9 ASPs,{} needed for NAG routines \\axiomOpFrom{d02bhf}{d02Package},{} \\axiomOpFrom{d02cjf}{d02Package},{} \\axiomOpFrom{d02ejf}{d02Package}. These ASPs represent a function of a scalar \\spad{X} and a vector \\spad{Y},{} for example:\\begin{verbatim} DOUBLE PRECISION FUNCTION G(X,Y) DOUBLE PRECISION X,Y(*) G=X+Y(1) RETURN END\\end{verbatim} If the user provides a constant value for \\spad{G},{} then extra information is added via COMMON blocks used by certain routines. This specifies that the value returned by \\spad{G} in this case is to be ignored.")) (|coerce| (($ (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) NIL NIL @@ -338,7 +338,7 @@ NIL NIL (-102 S) ((|constructor| (NIL "A bag aggregate is an aggregate for which one can insert and extract objects,{} and where the order in which objects are inserted determines the order of extraction. Examples of bags are stacks,{} queues,{} and dequeues.")) (|inspect| ((|#1| $) "\\spad{inspect(u)} returns an (random) element from a bag.")) (|insert!| (($ |#1| $) "\\spad{insert!(x,{}u)} inserts item \\spad{x} into bag \\spad{u}.")) (|extract!| ((|#1| $) "\\spad{extract!(u)} destructively removes a (random) item from bag \\spad{u}.")) (|bag| (($ (|List| |#1|)) "\\spad{bag([x,{}y,{}...,{}z])} creates a bag with elements \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.")) (|shallowlyMutable| ((|attribute|) "shallowlyMutable means that elements of bags may be destructively changed."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-103) ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating binary expansions.")) (|binary| (($ (|Fraction| (|Integer|))) "\\spad{binary(r)} converts a rational number to a binary expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(b)} returns the fractional part of a binary expansion.")) (|coerce| (((|RadixExpansion| 2) $) "\\spad{coerce(b)} converts a binary expansion to a radix expansion with base 2.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(b)} converts a binary expansion to a rational number."))) @@ -390,7 +390,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230))) (-115 S) ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,{}x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,{}b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,{}\"right\",{}b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,{}\"left\",{}b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,{}\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,{}\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) -((-2093 . T)) +((-2046 . T)) NIL (-116 UP) ((|constructor| (NIL "\\indented{1}{Author: Frederic Lehobey,{} James \\spad{H}. Davenport} Date Created: 28 June 1994 Date Last Updated: 11 July 1997 Basic Operations: brillhartIrreducible? Related Domains: Also See: AMS Classifications: Keywords: factorization Examples: References: [1] John Brillhart,{} Note on Irreducibility Testing,{} Mathematics of Computation,{} vol. 35,{} num. 35,{} Oct. 1980,{} 1379-1381 [2] James Davenport,{} On Brillhart Irreducibility. To appear. [3] John Brillhart,{} On the Euler and Bernoulli polynomials,{} \\spad{J}. Reine Angew. Math.,{} \\spad{v}. 234,{} (1969),{} \\spad{pp}. 45-64")) (|noLinearFactor?| (((|Boolean|) |#1|) "\\spad{noLinearFactor?(p)} returns \\spad{true} if \\spad{p} can be shown to have no linear factor by a theorem of Lehmer,{} \\spad{false} else. \\spad{I} insist on the fact that \\spad{false} does not mean that \\spad{p} has a linear factor.")) (|brillhartTrials| (((|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{brillhartTrials(n)} sets to \\spad{n} the number of tests in \\spadfun{brillhartIrreducible?} and returns the previous value.") (((|NonNegativeInteger|)) "\\spad{brillhartTrials()} returns the number of tests in \\spadfun{brillhartIrreducible?}.")) (|brillhartIrreducible?| (((|Boolean|) |#1| (|Boolean|)) "\\spad{brillhartIrreducible?(p,{}noLinears)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} else. If \\spad{noLinears} is \\spad{true},{} we are being told \\spad{p} has no linear factors \\spad{false} does not mean that \\spad{p} is reducible.") (((|Boolean|) |#1|) "\\spad{brillhartIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} is inconclusive."))) @@ -406,7 +406,7 @@ NIL NIL (-119) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,{}b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,{}b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,{}b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (^ (($ $) "\\spad{^ b} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-120 A S) ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#2| $) "\\spad{node(left,{}v,{}right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) @@ -414,7 +414,7 @@ NIL NIL (-121 S) ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#1| $) "\\spad{node(left,{}v,{}right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-122 S) ((|constructor| (NIL "\\spadtype{BinaryTournament(S)} is the domain of binary trees where elements are ordered down the tree. A binary search tree is either empty or is a node containing a \\spadfun{value} of type \\spad{S},{} and a \\spadfun{right} and a \\spadfun{left} which are both \\spadtype{BinaryTree(S)}")) (|insert!| (($ |#1| $) "\\spad{insert!(x,{}b)} inserts element \\spad{x} as leaves into binary tournament \\spad{b}.")) (|binaryTournament| (($ (|List| |#1|)) "\\spad{binaryTournament(ls)} creates a binary tournament with the elements of \\spad{ls} as values at the nodes."))) @@ -436,11 +436,11 @@ NIL ((|constructor| (NIL "Members of the domain CardinalNumber are values indicating the cardinality of sets,{} both finite and infinite. Arithmetic operations are defined on cardinal numbers as follows. \\blankline If \\spad{x = \\#X} and \\spad{y = \\#Y} then \\indented{2}{\\spad{x+y\\space{2}= \\#(X+Y)}\\space{3}\\tab{30}disjoint union} \\indented{2}{\\spad{x-y\\space{2}= \\#(X-Y)}\\space{3}\\tab{30}relative complement} \\indented{2}{\\spad{x*y\\space{2}= \\#(X*Y)}\\space{3}\\tab{30}cartesian product} \\indented{2}{\\spad{x**y = \\#(X**Y)}\\space{2}\\tab{30}\\spad{X**Y = \\{g| g:Y->X\\}}} \\blankline The non-negative integers have a natural construction as cardinals \\indented{2}{\\spad{0 = \\#\\{\\}},{} \\spad{1 = \\{0\\}},{} \\spad{2 = \\{0,{} 1\\}},{} ...,{} \\spad{n = \\{i| 0 <= i < n\\}}.} \\blankline That \\spad{0} acts as a zero for the multiplication of cardinals is equivalent to the axiom of choice. \\blankline The generalized continuum hypothesis asserts \\center{\\spad{2**Aleph i = Aleph(i+1)}} and is independent of the axioms of set theory [Goedel 1940]. \\blankline Three commonly encountered cardinal numbers are \\indented{3}{\\spad{a = \\#Z}\\space{7}\\tab{30}countable infinity} \\indented{3}{\\spad{c = \\#R}\\space{7}\\tab{30}the continuum} \\indented{3}{\\spad{f = \\#\\{g| g:[0,{}1]->R\\}}} \\blankline In this domain,{} these values are obtained using \\indented{3}{\\spad{a := Aleph 0},{} \\spad{c := 2**a},{} \\spad{f := 2**c}.} \\blankline")) (|generalizedContinuumHypothesisAssumed| (((|Boolean|) (|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.")) (|generalizedContinuumHypothesisAssumed?| (((|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.")) (|countable?| (((|Boolean|) $) "\\spad{countable?(\\spad{a})} determines whether \\spad{a} is a countable cardinal,{} \\spadignore{i.e.} an integer or \\spad{Aleph 0}.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(\\spad{a})} determines whether \\spad{a} is a finite cardinal,{} \\spadignore{i.e.} an integer.")) (|Aleph| (($ (|NonNegativeInteger|)) "\\spad{Aleph(n)} provides the named (infinite) cardinal number.")) (** (($ $ $) "\\spad{x**y} returns \\spad{\\#(X**Y)} where \\spad{X**Y} is defined \\indented{1}{as \\spad{\\{g| g:Y->X\\}}.}")) (- (((|Union| $ "failed") $ $) "\\spad{x - y} returns an element \\spad{z} such that \\spad{z+y=x} or \"failed\" if no such element exists.")) (|commutative| ((|attribute| "*") "a domain \\spad{D} has \\spad{commutative(\"*\")} if it has an operation \\spad{\"*\": (D,{}D) -> D} which is commutative."))) (((-4231 "*") . T)) NIL -(-127 |minix| -2621 S T$) +(-127 |minix| -2615 S T$) ((|constructor| (NIL "This package provides functions to enable conversion of tensors given conversion of the components.")) (|map| (((|CartesianTensor| |#1| |#2| |#4|) (|Mapping| |#4| |#3|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{map(f,{}ts)} does a componentwise conversion of the tensor \\spad{ts} to a tensor with components of type \\spad{T}.")) (|reshape| (((|CartesianTensor| |#1| |#2| |#4|) (|List| |#4|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{reshape(lt,{}ts)} organizes the list of components \\spad{lt} into a tensor with the same shape as \\spad{ts}."))) NIL NIL -(-128 |minix| -2621 R) +(-128 |minix| -2615 R) ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,{}...idim) = +1/0/-1} if \\spad{i1,{}...,{}idim} is an even/is nota /is an odd permutation of \\spad{minix,{}...,{}minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,{}j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\^= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,{}[i1,{}...,{}idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t,{} [4,{}1,{}2,{}3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}i,{}j,{}k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,{}i,{}j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,{}2,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(i,{}k,{}j,{}l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}j,{}k,{}i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,{}i,{}j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,{}1,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j) = sum(h=1..dim,{}t(h,{}i,{}h,{}j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,{}i,{}s,{}j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,{}2,{}t,{}1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = sum(h=1..dim,{}s(i,{}h,{}j)*t(h,{}k,{}l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,{}rank t,{} s,{} 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N,{} t[i1,{}..,{}iN,{}k]*s[k,{}j1,{}..,{}jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,{}t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,{}t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = s(i,{}j)*t(k,{}l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,{}[i1,{}...,{}iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k,{}l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j)} gives a component of a rank 2 tensor.") ((|#3| $ (|Integer|)) "\\spad{elt(t,{}i)} gives a component of a rank 1 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,{}...,{}t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,{}...,{}r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) NIL NIL @@ -486,7 +486,7 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasAttribute| |#1| (QUOTE -4229))) (-139 S) ((|constructor| (NIL "A collection is a homogeneous aggregate which can built from list of members. The operation used to build the aggregate is generically named \\spadfun{construct}. However,{} each collection provides its own special function with the same name as the data type,{} except with an initial lower case letter,{} \\spadignore{e.g.} \\spadfun{list} for \\spadtype{List},{} \\spadfun{flexibleArray} for \\spadtype{FlexibleArray},{} and so on.")) (|removeDuplicates| (($ $) "\\spad{removeDuplicates(u)} returns a copy of \\spad{u} with all duplicates removed.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(p,{}u)} returns a copy of \\spad{u} containing only those elements such \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{select(\\spad{p},{}\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})]}.")) (|remove| (($ |#1| $) "\\spad{remove(x,{}u)} returns a copy of \\spad{u} with all elements \\axiom{\\spad{y} = \\spad{x}} removed. Note: \\axiom{remove(\\spad{y},{}\\spad{c}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{c} | \\spad{x} \\spad{^=} \\spad{y}]}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(p,{}u)} returns a copy of \\spad{u} removing all elements \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{remove(\\spad{p},{}\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u} | not \\spad{p}(\\spad{x})]}.")) (|reduce| ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1| |#1|) "\\spad{reduce(f,{}u,{}x,{}z)} reduces the binary operation \\spad{f} across \\spad{u},{} stopping when an \"absorbing element\" \\spad{z} is encountered. As for \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})},{} \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})} when \\spad{u} contains no element \\spad{z}. Thus the third argument \\spad{x} is returned when \\spad{u} is empty.") ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1|) "\\spad{reduce(f,{}u,{}x)} reduces the binary operation \\spad{f} across \\spad{u},{} where \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u})} if \\spad{u} has 2 or more elements. Returns \\axiom{\\spad{f}(\\spad{x},{}\\spad{y})} if \\spad{u} has one element \\spad{y},{} \\spad{x} if \\spad{u} is empty. For example,{} \\axiom{reduce(+,{}\\spad{u},{}0)} returns the sum of the elements of \\spad{u}.") ((|#1| (|Mapping| |#1| |#1| |#1|) $) "\\spad{reduce(f,{}u)} reduces the binary operation \\spad{f} across \\spad{u}. For example,{} if \\spad{u} is \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]} then \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\axiom{\\spad{f}(..\\spad{f}(\\spad{f}(\\spad{x},{}\\spad{y}),{}...),{}\\spad{z})}. Note: if \\spad{u} has one element \\spad{x},{} \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\spad{x}. Error: if \\spad{u} is empty.")) (|find| (((|Union| |#1| "failed") (|Mapping| (|Boolean|) |#1|) $) "\\spad{find(p,{}u)} returns the first \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \"failed\" otherwise.")) (|construct| (($ (|List| |#1|)) "\\axiom{construct(\\spad{x},{}\\spad{y},{}...,{}\\spad{z})} returns the collection of elements \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}} ordered as given. Equivalently written as \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]\\$\\spad{D}},{} where \\spad{D} is the domain. \\spad{D} may be omitted for those of type List."))) -((-2093 . T)) +((-2046 . T)) NIL (-140 |n| K Q) ((|constructor| (NIL "CliffordAlgebra(\\spad{n},{} \\spad{K},{} \\spad{Q}) defines a vector space of dimension \\spad{2**n} over \\spad{K},{} given a quadratic form \\spad{Q} on \\spad{K**n}. \\blankline If \\spad{e[i]},{} \\spad{1<=i<=n} is a basis for \\spad{K**n} then \\indented{3}{1,{} \\spad{e[i]} (\\spad{1<=i<=n}),{} \\spad{e[i1]*e[i2]}} (\\spad{1<=i1<i2<=n}),{}...,{}\\spad{e[1]*e[2]*..*e[n]} is a basis for the Clifford Algebra. \\blankline The algebra is defined by the relations \\indented{3}{\\spad{e[i]*e[j] = -e[j]*e[i]}\\space{2}(\\spad{i \\~~= j}),{}} \\indented{3}{\\spad{e[i]*e[i] = Q(e[i])}} \\blankline Examples of Clifford Algebras are: gaussians,{} quaternions,{} exterior algebras and spin algebras.")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} computes the multiplicative inverse of \\spad{x} or \"failed\" if \\spad{x} is not invertible.")) (|coefficient| ((|#2| $ (|List| (|PositiveInteger|))) "\\spad{coefficient(x,{}[i1,{}i2,{}...,{}iN])} extracts the coefficient of \\spad{e(i1)*e(i2)*...*e(iN)} in \\spad{x}.")) (|monomial| (($ |#2| (|List| (|PositiveInteger|))) "\\spad{monomial(c,{}[i1,{}i2,{}...,{}iN])} produces the value given by \\spad{c*e(i1)*e(i2)*...*e(iN)}.")) (|e| (($ (|PositiveInteger|)) "\\spad{e(n)} produces the appropriate unit element."))) @@ -534,7 +534,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-505))) (|HasCategory| |#2| (QUOTE (-926))) (|HasCategory| |#2| (QUOTE (-1104))) (|HasCategory| |#2| (QUOTE (-978))) (|HasCategory| |#2| (QUOTE (-945))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (QUOTE (-336))) (|HasAttribute| |#2| (QUOTE -4225)) (|HasAttribute| |#2| (QUOTE -4228)) (|HasCategory| |#2| (QUOTE (-281))) (|HasCategory| |#2| (QUOTE (-512))) (|HasCategory| |#2| (QUOTE (-783)))) (-151 R) ((|constructor| (NIL "This category represents the extension of a ring by a square root of \\spad{-1}.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} or \"failed\" if \\spad{x} is not a rational number.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a rational number.")) (|polarCoordinates| (((|Record| (|:| |r| |#1|) (|:| |phi| |#1|)) $) "\\spad{polarCoordinates(x)} returns (\\spad{r},{} phi) such that \\spad{x} = \\spad{r} * exp(\\%\\spad{i} * phi).")) (|argument| ((|#1| $) "\\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\\spad{x}).")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x} = sqrt(norm(\\spad{x})).")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(x,{} r)} returns the exact quotient of \\spad{x} by \\spad{r},{} or \"failed\" if \\spad{r} does not divide \\spad{x} exactly.")) (|norm| ((|#1| $) "\\spad{norm(x)} returns \\spad{x} * conjugate(\\spad{x})")) (|real| ((|#1| $) "\\spad{real(x)} returns real part of \\spad{x}.")) (|imag| ((|#1| $) "\\spad{imag(x)} returns imaginary part of \\spad{x}.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}.")) (|complex| (($ |#1| |#1|) "\\spad{complex(x,{}y)} constructs \\spad{x} + \\%i*y.") ((|attribute|) "indicates that \\% has sqrt(\\spad{-1})"))) -((-4222 -3700 (|has| |#1| (-512)) (-12 (|has| |#1| (-281)) (|has| |#1| (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4225 |has| |#1| (-6 -4225)) (-4228 |has| |#1| (-6 -4228)) (-3902 . T) (-2093 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) +((-4222 -3700 (|has| |#1| (-512)) (-12 (|has| |#1| (-281)) (|has| |#1| (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4225 |has| |#1| (-6 -4225)) (-4228 |has| |#1| (-6 -4228)) (-3901 . T) (-2046 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL (-152 RR PR) ((|constructor| (NIL "\\indented{1}{Author:} Date Created: Date Last Updated: Basic Functions: Related Constructors: Complex,{} UnivariatePolynomial Also See: AMS Classifications: Keywords: complex,{} polynomial factorization,{} factor References:")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} factorizes the polynomial \\spad{p} with complex coefficients."))) @@ -546,7 +546,7 @@ NIL NIL (-154 R) ((|constructor| (NIL "\\spadtype {Complex(R)} creates the domain of elements of the form \\spad{a + b * i} where \\spad{a} and \\spad{b} come from the ring \\spad{R},{} and \\spad{i} is a new element such that \\spad{i**2 = -1}."))) -((-4222 -3700 (|has| |#1| (-512)) (-12 (|has| |#1| (-281)) (|has| |#1| (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4225 |has| |#1| (-6 -4225)) (-4228 |has| |#1| (-6 -4228)) (-3902 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) +((-4222 -3700 (|has| |#1| (-512)) (-12 (|has| |#1| (-281)) (|has| |#1| (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4225 |has| |#1| (-6 -4225)) (-4228 |has| |#1| (-6 -4228)) (-3901 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) ((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-322)))) (|HasCategory| |#1| (QUOTE (-341))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-1104))) (-12 (|HasCategory| |#1| (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-1104)))) (|HasCategory| |#1| (QUOTE (-945))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -260) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-764))) (|HasCategory| |#1| (QUOTE (-978))) (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1104)))) (|HasCategory| |#1| (QUOTE (-505))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-281))) (-3700 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-322)))) (|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-209))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-322)))) (|HasCategory| |#1| (QUOTE (-209))) (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-322)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -260) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-341)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-764)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-783)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-945)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-1104)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496))))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-352))))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-336))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-837))))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-322))) (|HasCategory| |#1| (QUOTE (-837))))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasAttribute| |#1| (QUOTE -4225)) (|HasAttribute| |#1| (QUOTE -4228)) (-12 (|HasCategory| |#1| (QUOTE (-209))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083))))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-322))))) (-155 R S CS) ((|constructor| (NIL "This package supports converting complex expressions to patterns")) (|convert| (((|Pattern| |#1|) |#3|) "\\spad{convert(cs)} converts the complex expression \\spad{cs} to a pattern"))) @@ -750,7 +750,7 @@ NIL NIL (-205 S) ((|constructor| (NIL "A dictionary is an aggregate in which entries can be inserted,{} searched for and removed. Duplicates are thrown away on insertion. This category models the usual notion of dictionary which involves large amounts of data where copying is impractical. Principal operations are thus destructive (non-copying) ones."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-206 S R) ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{D(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{D(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{differentiate(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) @@ -774,25 +774,25 @@ NIL ((|HasAttribute| |#1| (QUOTE -4229))) (-211 S) ((|constructor| (NIL "This category is a collection of operations common to both categories \\spadtype{Dictionary} and \\spadtype{MultiDictionary}")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,{}d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is not \\spad{true}.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,{}d)} destructively changes dictionary \\spad{d} by removeing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.") (($ |#1| $) "\\spad{remove!(x,{}d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{y} such that \\axiom{\\spad{y} = \\spad{x}}.")) (|dictionary| (($ (|List| |#1|)) "\\spad{dictionary([x,{}y,{}...,{}z])} creates a dictionary consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{dictionary()}\\$\\spad{D} creates an empty dictionary of type \\spad{D}."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-212) ((|constructor| (NIL "any solution of a homogeneous linear Diophantine equation can be represented as a sum of minimal solutions,{} which form a \"basis\" (a minimal solution cannot be represented as a nontrivial sum of solutions) in the case of an inhomogeneous linear Diophantine equation,{} each solution is the sum of a inhomogeneous solution and any number of homogeneous solutions therefore,{} it suffices to compute two sets: \\indented{3}{1. all minimal inhomogeneous solutions} \\indented{3}{2. all minimal homogeneous solutions} the algorithm implemented is a completion procedure,{} which enumerates all solutions in a recursive depth-first-search it can be seen as finding monotone paths in a graph for more details see Reference")) (|dioSolve| (((|Record| (|:| |varOrder| (|List| (|Symbol|))) (|:| |inhom| (|Union| (|List| (|Vector| (|NonNegativeInteger|))) "failed")) (|:| |hom| (|List| (|Vector| (|NonNegativeInteger|))))) (|Equation| (|Polynomial| (|Integer|)))) "\\spad{dioSolve(u)} computes a basis of all minimal solutions for linear homogeneous Diophantine equation \\spad{u},{} then all minimal solutions of inhomogeneous equation"))) NIL NIL -(-213 S -2621 R) +(-213 S -2615 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#3|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#3| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#3| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#3|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) NIL ((|HasCategory| |#3| (QUOTE (-336))) (|HasCategory| |#3| (QUOTE (-728))) (|HasCategory| |#3| (QUOTE (-781))) (|HasAttribute| |#3| (QUOTE -4226)) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-341))) (|HasCategory| |#3| (QUOTE (-662))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (QUOTE (-1012)))) -(-214 -2621 R) +(-214 -2615 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#2|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#2| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#2| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#2|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) -((-4223 |has| |#2| (-969)) (-4224 |has| |#2| (-969)) (-4226 |has| |#2| (-6 -4226)) ((-4231 "*") |has| |#2| (-157)) (-4229 . T) (-2093 . T)) +((-4223 |has| |#2| (-969)) (-4224 |has| |#2| (-969)) (-4226 |has| |#2| (-6 -4226)) ((-4231 "*") |has| |#2| (-157)) (-4229 . T) (-2046 . T)) NIL -(-215 -2621 A B) +(-215 -2615 A B) ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} direct products of elements of some type \\spad{A} and functions from \\spad{A} to another type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a direct product over \\spad{B}.")) (|map| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2|) (|DirectProduct| |#1| |#2|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#3| (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{reduce(func,{}vec,{}ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if the vector is empty.")) (|scan| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{scan(func,{}vec,{}ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) NIL NIL -(-216 -2621 R) +(-216 -2615 R) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying component type. This contrasts with simple vectors in that the members can be viewed as having constant length. Thus many categorical properties can by lifted from the underlying component type. Component extraction operations are provided but no updating operations. Thus new direct product elements can either be created by converting vector elements using the \\spadfun{directProduct} function or by taking appropriate linear combinations of basis vectors provided by the \\spad{unitVector} operation."))) ((-4223 |has| |#2| (-969)) (-4224 |has| |#2| (-969)) (-4226 |has| |#2| (-6 -4226)) ((-4231 "*") |has| |#2| (-157)) (-4229 . T)) ((|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (-3700 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-209))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| (-520) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (|HasCategory| |#2| (QUOTE (-662))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (|HasCategory| |#2| (QUOTE (-969))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasAttribute| |#2| (QUOTE -4226)) (|HasCategory| |#2| (QUOTE (-124))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-25))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-209)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-341)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-728)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012))))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-3700 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) @@ -810,7 +810,7 @@ NIL NIL (-220 S) ((|constructor| (NIL "A doubly-linked aggregate serves as a model for a doubly-linked list,{} that is,{} a list which can has links to both next and previous nodes and thus can be efficiently traversed in both directions.")) (|setnext!| (($ $ $) "\\spad{setnext!(u,{}v)} destructively sets the next node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|setprevious!| (($ $ $) "\\spad{setprevious!(u,{}v)} destructively sets the previous node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|concat!| (($ $ $) "\\spad{concat!(u,{}v)} destructively concatenates doubly-linked aggregate \\spad{v} to the end of doubly-linked aggregate \\spad{u}.")) (|next| (($ $) "\\spad{next(l)} returns the doubly-linked aggregate beginning with its next element. Error: if \\spad{l} has no next element. Note: \\axiom{next(\\spad{l}) = rest(\\spad{l})} and \\axiom{previous(next(\\spad{l})) = \\spad{l}}.")) (|previous| (($ $) "\\spad{previous(l)} returns the doubly-link list beginning with its previous element. Error: if \\spad{l} has no previous element. Note: \\axiom{next(previous(\\spad{l})) = \\spad{l}}.")) (|tail| (($ $) "\\spad{tail(l)} returns the doubly-linked aggregate \\spad{l} starting at its second element. Error: if \\spad{l} is empty.")) (|head| (($ $) "\\spad{head(l)} returns the first element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty.")) (|last| ((|#1| $) "\\spad{last(l)} returns the last element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty."))) -((-2093 . T)) +((-2046 . T)) NIL (-221 S) ((|constructor| (NIL "This domain provides some nice functions on lists")) (|elt| (((|NonNegativeInteger|) $ "count") "\\axiom{\\spad{l}.\"count\"} returns the number of elements in \\axiom{\\spad{l}}.") (($ $ "sort") "\\axiom{\\spad{l}.sort} returns \\axiom{\\spad{l}} with elements sorted. Note: \\axiom{\\spad{l}.sort = sort(\\spad{l})}") (($ $ "unique") "\\axiom{\\spad{l}.unique} returns \\axiom{\\spad{l}} with duplicates removed. Note: \\axiom{\\spad{l}.unique = removeDuplicates(\\spad{l})}.")) (|datalist| (($ (|List| |#1|)) "\\spad{datalist(l)} creates a datalist from \\spad{l}")) (|coerce| (((|List| |#1|) $) "\\spad{coerce(x)} returns the list of elements in \\spad{x}") (($ (|List| |#1|)) "\\spad{coerce(l)} creates a datalist from \\spad{l}"))) @@ -830,11 +830,11 @@ NIL NIL (-225 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4226 -3700 (-4005 (|has| |#4| (-969)) (|has| |#4| (-209))) (-4005 (|has| |#4| (-969)) (|has| |#4| (-828 (-1083)))) (|has| |#4| (-6 -4226)) (-4005 (|has| |#4| (-969)) (|has| |#4| (-582 (-520))))) (-4223 |has| |#4| (-969)) (-4224 |has| |#4| (-969)) ((-4231 "*") |has| |#4| (-157)) (-4229 . T)) +((-4226 -3700 (-4006 (|has| |#4| (-969)) (|has| |#4| (-209))) (-4006 (|has| |#4| (-969)) (|has| |#4| (-828 (-1083)))) (|has| |#4| (-6 -4226)) (-4006 (|has| |#4| (-969)) (|has| |#4| (-582 (-520))))) (-4223 |has| |#4| (-969)) (-4224 |has| |#4| (-969)) ((-4231 "*") |has| |#4| (-157)) (-4229 . T)) ((|HasCategory| |#4| (QUOTE (-336))) (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (QUOTE (-728))) (|HasCategory| |#4| (QUOTE (-781))) (-3700 (|HasCategory| |#4| (QUOTE (-728))) (|HasCategory| |#4| (QUOTE (-781)))) (|HasCategory| |#4| (QUOTE (-157))) (-3700 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-336))) (|HasCategory| |#4| (QUOTE (-969)))) (-3700 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-336)))) (-3700 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-969)))) (|HasCategory| |#4| (QUOTE (-341))) (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#4| (QUOTE (-209))) (-3700 (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-209))) (|HasCategory| |#4| (QUOTE (-969)))) (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| (-520) (QUOTE (-783))) (|HasCategory| |#4| (QUOTE (-662))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#4| (QUOTE (-209))) (|HasCategory| |#4| (QUOTE (-969)))) (-12 (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-209))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-336))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-341))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-728))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-781))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520)))))) (-3700 (|HasCategory| |#4| (QUOTE (-969))) (-12 (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| |#4| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-1012)))) (-3700 (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-157)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-209)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-336)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-341)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-728)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-781)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-969)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#4| (QUOTE (-1012))))) (-3700 (|HasAttribute| |#4| (QUOTE -4226)) (-12 (|HasCategory| |#4| (QUOTE (-209))) (|HasCategory| |#4| (QUOTE (-969)))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#4| (QUOTE (-124))) (|HasCategory| |#4| (QUOTE (-25))) (-12 (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-3700 (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-209))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-336))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-341))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-728))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-781))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-969))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1012))) (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -283) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#4| (LIST (QUOTE -560) (QUOTE (-791))))) (-226 |n| R S) ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) -((-4226 -3700 (-4005 (|has| |#3| (-969)) (|has| |#3| (-209))) (-4005 (|has| |#3| (-969)) (|has| |#3| (-828 (-1083)))) (|has| |#3| (-6 -4226)) (-4005 (|has| |#3| (-969)) (|has| |#3| (-582 (-520))))) (-4223 |has| |#3| (-969)) (-4224 |has| |#3| (-969)) ((-4231 "*") |has| |#3| (-157)) (-4229 . T)) +((-4226 -3700 (-4006 (|has| |#3| (-969)) (|has| |#3| (-209))) (-4006 (|has| |#3| (-969)) (|has| |#3| (-828 (-1083)))) (|has| |#3| (-6 -4226)) (-4006 (|has| |#3| (-969)) (|has| |#3| (-582 (-520))))) (-4223 |has| |#3| (-969)) (-4224 |has| |#3| (-969)) ((-4231 "*") |has| |#3| (-157)) (-4229 . T)) ((|HasCategory| |#3| (QUOTE (-336))) (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (QUOTE (-728))) (|HasCategory| |#3| (QUOTE (-781))) (-3700 (|HasCategory| |#3| (QUOTE (-728))) (|HasCategory| |#3| (QUOTE (-781)))) (|HasCategory| |#3| (QUOTE (-157))) (-3700 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-336))) (|HasCategory| |#3| (QUOTE (-969)))) (-3700 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-336)))) (-3700 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-969)))) (|HasCategory| |#3| (QUOTE (-341))) (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#3| (QUOTE (-209))) (-3700 (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-209))) (|HasCategory| |#3| (QUOTE (-969)))) (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| (-520) (QUOTE (-783))) (|HasCategory| |#3| (QUOTE (-662))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#3| (QUOTE (-209))) (|HasCategory| |#3| (QUOTE (-969)))) (-12 (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-209))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-336))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-341))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-728))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520)))))) (-3700 (|HasCategory| |#3| (QUOTE (-969))) (-12 (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| |#3| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-1012)))) (-3700 (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-157)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-209)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-336)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-341)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-728)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-781)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-969)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#3| (QUOTE (-1012))))) (-3700 (|HasAttribute| |#3| (QUOTE -4226)) (-12 (|HasCategory| |#3| (QUOTE (-209))) (|HasCategory| |#3| (QUOTE (-969)))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (-12 (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-3700 (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-209))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-336))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-341))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-728))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-969))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1012))) (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -283) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#3| (LIST (QUOTE -560) (QUOTE (-791))))) (-227 A R S V E) ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#4| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#3|) "\\spad{weight(p,{} s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#3|) "\\spad{weights(p,{} s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,{} s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{order(p,{}s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#3|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#3|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) @@ -846,7 +846,7 @@ NIL NIL (-229 S) ((|constructor| (NIL "A dequeue is a doubly ended stack,{} that is,{} a bag where first items inserted are the first items extracted,{} at either the front or the back end of the data structure.")) (|reverse!| (($ $) "\\spad{reverse!(d)} destructively replaces \\spad{d} by its reverse dequeue,{} \\spadignore{i.e.} the top (front) element is now the bottom (back) element,{} and so on.")) (|extractBottom!| ((|#1| $) "\\spad{extractBottom!(d)} destructively extracts the bottom (back) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|extractTop!| ((|#1| $) "\\spad{extractTop!(d)} destructively extracts the top (front) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|insertBottom!| ((|#1| |#1| $) "\\spad{insertBottom!(x,{}d)} destructively inserts \\spad{x} into the dequeue \\spad{d} at the bottom (back) of the dequeue.")) (|insertTop!| ((|#1| |#1| $) "\\spad{insertTop!(x,{}d)} destructively inserts \\spad{x} into the dequeue \\spad{d},{} that is,{} at the top (front) of the dequeue. The element previously at the top of the dequeue becomes the second in the dequeue,{} and so on.")) (|bottom!| ((|#1| $) "\\spad{bottom!(d)} returns the element at the bottom (back) of the dequeue.")) (|top!| ((|#1| $) "\\spad{top!(d)} returns the element at the top (front) of the dequeue.")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(d)} returns the number of elements in dequeue \\spad{d}. Note: \\axiom{height(\\spad{d}) = \\# \\spad{d}}.")) (|dequeue| (($ (|List| |#1|)) "\\spad{dequeue([x,{}y,{}...,{}z])} creates a dequeue with first (top or front) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom or back) element \\spad{z}.") (($) "\\spad{dequeue()}\\$\\spad{D} creates an empty dequeue of type \\spad{D}."))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-230) ((|constructor| (NIL "TopLevelDrawFunctionsForCompiledFunctions provides top level functions for drawing graphics of expressions.")) (|recolor| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{recolor()},{} uninteresting to top level user; exported in order to compile package.")) (|makeObject| (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}c..d)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)},{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.")) (|draw| (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)} The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}c..d,{}l)} draws the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g),{}a..b)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied."))) @@ -954,7 +954,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012)))) (-256 S) ((|constructor| (NIL "An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists and streams which are represented by linked structures so as to make insertion,{} deletion,{} and concatenation efficient. However,{} access to elements of these extensible aggregates is generally slow since access is made from the end. See \\spadtype{FlexibleArray} for an exception.")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(u)} destructively removes duplicates from \\spad{u}.")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,{}u)} destructively changes \\spad{u} by keeping only values \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})}.")) (|merge!| (($ $ $) "\\spad{merge!(u,{}v)} destructively merges \\spad{u} and \\spad{v} in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge!(p,{}u,{}v)} destructively merges \\spad{u} and \\spad{v} using predicate \\spad{p}.")) (|insert!| (($ $ $ (|Integer|)) "\\spad{insert!(v,{}u,{}i)} destructively inserts aggregate \\spad{v} into \\spad{u} at position \\spad{i}.") (($ |#1| $ (|Integer|)) "\\spad{insert!(x,{}u,{}i)} destructively inserts \\spad{x} into \\spad{u} at position \\spad{i}.")) (|remove!| (($ |#1| $) "\\spad{remove!(x,{}u)} destructively removes all values \\spad{x} from \\spad{u}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,{}u)} destructively removes all elements \\spad{x} of \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.")) (|delete!| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete!(u,{}i..j)} destructively deletes elements \\spad{u}.\\spad{i} through \\spad{u}.\\spad{j}.") (($ $ (|Integer|)) "\\spad{delete!(u,{}i)} destructively deletes the \\axiom{\\spad{i}}th element of \\spad{u}.")) (|concat!| (($ $ $) "\\spad{concat!(u,{}v)} destructively appends \\spad{v} to the end of \\spad{u}. \\spad{v} is unchanged") (($ $ |#1|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-257 S) ((|constructor| (NIL "Category for the elementary functions.")) (** (($ $ $) "\\spad{x**y} returns \\spad{x} to the power \\spad{y}.")) (|exp| (($ $) "\\spad{exp(x)} returns \\%\\spad{e} to the power \\spad{x}.")) (|log| (($ $) "\\spad{log(x)} returns the natural logarithm of \\spad{x}."))) @@ -980,7 +980,7 @@ NIL ((|constructor| (NIL "An eltable aggregate is one which can be viewed as a function. For example,{} the list \\axiom{[1,{}7,{}4]} can applied to 0,{}1,{} and 2 respectively will return the integers 1,{}7,{} and 4; thus this list may be viewed as mapping 0 to 1,{} 1 to 7 and 2 to 4. In general,{} an aggregate can map members of a domain {\\em Dom} to an image domain {\\em Im}.")) (|qsetelt!| ((|#2| $ |#1| |#2|) "\\spad{qsetelt!(u,{}x,{}y)} sets the image of \\axiom{\\spad{x}} to be \\axiom{\\spad{y}} under \\axiom{\\spad{u}},{} without checking that \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If such a check is required use the function \\axiom{setelt}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(u,{}x,{}y)} sets the image of \\spad{x} to be \\spad{y} under \\spad{u},{} assuming \\spad{x} is in the domain of \\spad{u}. Error: if \\spad{x} is not in the domain of \\spad{u}.")) (|qelt| ((|#2| $ |#1|) "\\spad{qelt(u,{} x)} applies \\axiom{\\spad{u}} to \\axiom{\\spad{x}} without checking whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If \\axiom{\\spad{x}} is not in the domain of \\axiom{\\spad{u}} a memory-access violation may occur. If a check on whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}} is required,{} use the function \\axiom{elt}.")) (|elt| ((|#2| $ |#1| |#2|) "\\spad{elt(u,{} x,{} y)} applies \\spad{u} to \\spad{x} if \\spad{x} is in the domain of \\spad{u},{} and returns \\spad{y} otherwise. For example,{} if \\spad{u} is a polynomial in \\axiom{\\spad{x}} over the rationals,{} \\axiom{elt(\\spad{u},{}\\spad{n},{}0)} may define the coefficient of \\axiom{\\spad{x}} to the power \\spad{n},{} returning 0 when \\spad{n} is out of range."))) NIL NIL -(-263 S R |Mod| -2091 -3478 |exactQuo|) +(-263 S R |Mod| -2742 -1819 |exactQuo|) ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|elt| ((|#2| $ |#2|) "\\spad{elt(x,{}r)} or \\spad{x}.\\spad{r} \\undocumented")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,{}y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,{}m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) ((-4222 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL @@ -989,7 +989,7 @@ NIL ((-4222 . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL (-265) -((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. An `Environment' is a stack of scope.")) (|categoryFrame| (($) "the current category environment in the interpreter.")) (|currentEnv| (($) "the current normal environment in effect.")) (|setProperties!| (($ (|Symbol|) (|List| (|ObjectProperty|)) $) "setBinding!(\\spad{n},{}props,{}\\spad{e}) set the list of properties of \\spad{`n'} to `props' in `e'.")) (|getProperties| (((|Union| (|List| (|ObjectProperty|)) "failed") (|Symbol|) $) "getBinding(\\spad{n},{}\\spad{e}) returns the list of properties of \\spad{`n'} in \\spad{e}; otherwise `failed'.")) (|setProperty!| (($ (|Symbol|) (|Symbol|) (|SExpression|) $) "\\spad{setProperty!(n,{}p,{}v,{}e)} binds the property `(\\spad{p},{}\\spad{v})' to \\spad{`n'} in the topmost scope of `e'.")) (|getProperty| (((|Union| (|SExpression|) "failed") (|Symbol|) (|Symbol|) $) "\\spad{getProperty(n,{}p,{}e)} returns the value of property with name \\spad{`p'} for the symbol \\spad{`n'} in environment `e'. Otherwise,{} `failed'.")) (|scopes| (((|List| (|Scope|)) $) "\\spad{scopes(e)} returns the stack of scopes in environment \\spad{e}.")) (|empty| (($) "\\spad{empty()} constructs an empty environment"))) +((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 19,{} 2008. An `Environment' is a stack of scope.")) (|categoryFrame| (($) "the current category environment in the interpreter.")) (|currentEnv| (($) "the current normal environment in effect.")) (|setProperties!| (($ (|Symbol|) (|List| (|ObjectProperty|)) $) "setBinding!(\\spad{n},{}props,{}\\spad{e}) set the list of properties of \\spad{`n'} to `props' in `e'.")) (|getProperties| (((|Union| (|List| (|ObjectProperty|)) "failed") (|Symbol|) $) "getBinding(\\spad{n},{}\\spad{e}) returns the list of properties of \\spad{`n'} in \\spad{e}; otherwise `failed'.")) (|setProperty!| (($ (|Symbol|) (|Symbol|) (|SExpression|) $) "\\spad{setProperty!(n,{}p,{}v,{}e)} binds the property `(\\spad{p},{}\\spad{v})' to \\spad{`n'} in the topmost scope of `e'.")) (|getProperty| (((|Union| (|SExpression|) "failed") (|Symbol|) (|Symbol|) $) "\\spad{getProperty(n,{}p,{}e)} returns the value of property with name \\spad{`p'} for the symbol \\spad{`n'} in environment `e'. Otherwise,{} `failed'.")) (|scopes| (((|List| (|Scope|)) $) "\\spad{scopes(e)} returns the stack of scopes in environment \\spad{e}.")) (|empty| (($) "\\spad{empty()} constructs an empty environment"))) NIL NIL (-266 R) @@ -1007,7 +1007,7 @@ NIL (-269 |Key| |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are compared using \\spadfun{eq?}. Thus keys are considered equal only if they are the same instance of a structure."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-270) ((|constructor| (NIL "ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \\indented{2}{\\spad{f x == if x < 0 then error \"negative argument\" else x}} the call to error will actually be of the form \\indented{2}{\\spad{error(\"f\",{}\"negative argument\")}} because the interpreter will have created a new first argument. \\blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \\indented{3}{\\spad{\\%l}\\space{6}start a new line} \\indented{3}{\\spad{\\%b}\\space{6}start printing in a bold font (where available)} \\indented{3}{\\spad{\\%d}\\space{6}stop\\space{2}printing in a bold font (where available)} \\indented{3}{\\spad{ \\%ceon}\\space{2}start centering message lines} \\indented{3}{\\spad{\\%ceoff}\\space{2}stop\\space{2}centering message lines} \\indented{3}{\\spad{\\%rjon}\\space{3}start displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%rjoff}\\space{2}stop\\space{2}displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%i}\\space{6}indent\\space{3}following lines 3 additional spaces} \\indented{3}{\\spad{\\%u}\\space{6}unindent following lines 3 additional spaces} \\indented{3}{\\spad{\\%xN}\\space{5}insert \\spad{N} blanks (eg,{} \\spad{\\%x10} inserts 10 blanks)} \\blankline")) (|error| (((|Exit|) (|String|) (|List| (|String|))) "\\spad{error(nam,{}lmsg)} displays error messages \\spad{lmsg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|String|) (|String|)) "\\spad{error(nam,{}msg)} displays error message \\spad{msg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|List| (|String|))) "\\spad{error(lmsg)} displays error message \\spad{lmsg} and terminates.") (((|Exit|) (|String|)) "\\spad{error(msg)} displays error message \\spad{msg} and terminates."))) NIL @@ -1086,7 +1086,7 @@ NIL NIL (-289 R) ((|constructor| (NIL "Expressions involving symbolic functions.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} \\undocumented{}")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} \\undocumented{}")) (|simplifyPower| (($ $ (|Integer|)) "simplifyPower?(\\spad{f},{}\\spad{n}) \\undocumented{}")) (|number?| (((|Boolean|) $) "\\spad{number?(f)} tests if \\spad{f} is rational")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \\spad{f} by applying their defining relations."))) -((-4226 -3700 (-4005 (|has| |#1| (-969)) (|has| |#1| (-582 (-520)))) (-12 (|has| |#1| (-512)) (-3700 (-4005 (|has| |#1| (-969)) (|has| |#1| (-582 (-520)))) (|has| |#1| (-969)) (|has| |#1| (-445)))) (|has| |#1| (-969)) (|has| |#1| (-445))) (-4224 |has| |#1| (-157)) (-4223 |has| |#1| (-157)) ((-4231 "*") |has| |#1| (-512)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-512)) (-4221 |has| |#1| (-512))) +((-4226 -3700 (-4006 (|has| |#1| (-969)) (|has| |#1| (-582 (-520)))) (-12 (|has| |#1| (-512)) (-3700 (-4006 (|has| |#1| (-969)) (|has| |#1| (-582 (-520)))) (|has| |#1| (-969)) (|has| |#1| (-445)))) (|has| |#1| (-969)) (|has| |#1| (-445))) (-4224 |has| |#1| (-157)) (-4223 |has| |#1| (-157)) ((-4231 "*") |has| |#1| (-512)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-512)) (-4221 |has| |#1| (-512))) ((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-969))) (-3700 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-969)))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-969)))) (-12 (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-969)))) (|HasCategory| |#1| (QUOTE (-21))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-969)))) (-3700 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))))) (|HasCategory| |#1| (QUOTE (-25))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-969)))) (-3700 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))))) (|HasCategory| |#1| (QUOTE (-1024))) (-3700 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-1024)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-1024)))) (-3700 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-969))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-1024)))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))))) (|HasCategory| $ (QUOTE (-969))) (|HasCategory| $ (LIST (QUOTE -960) (QUOTE (-520))))) (-290 R -4045) ((|constructor| (NIL "Taylor series solutions of explicit ODE\\spad{'s}.")) (|seriesSolve| (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,{} y,{} x = a,{} [b0,{}...,{}bn])} is equivalent to \\spad{seriesSolve(eq = 0,{} y,{} x = a,{} [b0,{}...,{}b(n-1)])}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,{} y,{} x = a,{} y a = b)} is equivalent to \\spad{seriesSolve(eq=0,{} y,{} x=a,{} y a = b)}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,{} y,{} x = a,{} b)} is equivalent to \\spad{seriesSolve(eq = 0,{} y,{} x = a,{} y a = b)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,{}y,{} x=a,{} b)} is equivalent to \\spad{seriesSolve(eq,{} y,{} x=a,{} y a = b)}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x = a,{}[y1 a = b1,{}...,{} yn a = bn])} is equivalent to \\spad{seriesSolve([eq1=0,{}...,{}eqn=0],{} [y1,{}...,{}yn],{} x = a,{} [y1 a = b1,{}...,{} yn a = bn])}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])} is equivalent to \\spad{seriesSolve([eq1=0,{}...,{}eqn=0],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])} is equivalent to \\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x = a,{} [y1 a = b1,{}...,{} yn a = bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,{}...,{}eqn],{}[y1,{}...,{}yn],{}x = a,{}[y1 a = b1,{}...,{}yn a = bn])} returns a taylor series solution of \\spad{[eq1,{}...,{}eqn]} around \\spad{x = a} with initial conditions \\spad{\\spad{yi}(a) = \\spad{bi}}. Note: eqi must be of the form \\spad{\\spad{fi}(x,{} y1 x,{} y2 x,{}...,{} yn x) y1'(x) + \\spad{gi}(x,{} y1 x,{} y2 x,{}...,{} yn x) = h(x,{} y1 x,{} y2 x,{}...,{} yn x)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,{}y,{}x=a,{}[b0,{}...,{}b(n-1)])} returns a Taylor series solution of \\spad{eq} around \\spad{x = a} with initial conditions \\spad{y(a) = b0},{} \\spad{y'(a) = b1},{} \\spad{y''(a) = b2},{} ...,{}\\spad{y(n-1)(a) = b(n-1)} \\spad{eq} must be of the form \\spad{f(x,{} y x,{} y'(x),{}...,{} y(n-1)(x)) y(n)(x) + g(x,{}y x,{}y'(x),{}...,{}y(n-1)(x)) = h(x,{}y x,{} y'(x),{}...,{} y(n-1)(x))}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,{}y,{}x=a,{} y a = b)} returns a Taylor series solution of \\spad{eq} around \\spad{x} = a with initial condition \\spad{y(a) = b}. Note: \\spad{eq} must be of the form \\spad{f(x,{} y x) y'(x) + g(x,{} y x) = h(x,{} y x)}."))) @@ -1099,7 +1099,7 @@ NIL (-292 FE |var| |cen|) ((|constructor| (NIL "ExponentialOfUnivariatePuiseuxSeries is a domain used to represent essential singularities of functions. An object in this domain is a function of the form \\spad{exp(f(x))},{} where \\spad{f(x)} is a Puiseux series with no terms of non-negative degree. Objects are ordered according to order of singularity,{} with functions which tend more rapidly to zero or infinity considered to be larger. Thus,{} if \\spad{order(f(x)) < order(g(x))},{} \\spadignore{i.e.} the first non-zero term of \\spad{f(x)} has lower degree than the first non-zero term of \\spad{g(x)},{} then \\spad{exp(f(x)) > exp(g(x))}. If \\spad{order(f(x)) = order(g(x))},{} then the ordering is essentially random. This domain is used in computing limits involving functions with essential singularities.")) (|exponentialOrder| (((|Fraction| (|Integer|)) $) "\\spad{exponentialOrder(exp(c * x **(-n) + ...))} returns \\spad{-n}. exponentialOrder(0) returns \\spad{0}.")) (|exponent| (((|UnivariatePuiseuxSeries| |#1| |#2| |#3|) $) "\\spad{exponent(exp(f(x)))} returns \\spad{f(x)}")) (|exponential| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{exponential(f(x))} returns \\spad{exp(f(x))}. Note: the function does NOT check that \\spad{f(x)} has no non-negative terms."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-293 M) ((|constructor| (NIL "computes various functions on factored arguments.")) (|log| (((|List| (|Record| (|:| |coef| (|NonNegativeInteger|)) (|:| |logand| |#1|))) (|Factored| |#1|)) "\\spad{log(f)} returns \\spad{[(a1,{}b1),{}...,{}(am,{}bm)]} such that the logarithm of \\spad{f} is equal to \\spad{a1*log(b1) + ... + am*log(bm)}.")) (|nthRoot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#1|) (|:| |radicand| (|List| |#1|))) (|Factored| |#1|) (|NonNegativeInteger|)) "\\spad{nthRoot(f,{} n)} returns \\spad{(p,{} r,{} [r1,{}...,{}rm])} such that the \\spad{n}th-root of \\spad{f} is equal to \\spad{r * \\spad{p}th-root(r1 * ... * rm)},{} where \\spad{r1},{}...,{}\\spad{rm} are distinct factors of \\spad{f},{} each of which has an exponent smaller than \\spad{p} in \\spad{f}."))) NIL @@ -1314,7 +1314,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012)))) (-346 S) ((|constructor| (NIL "A finite linear aggregate is a linear aggregate of finite length. The finite property of the aggregate adds several exports to the list of exports from \\spadtype{LinearAggregate} such as \\spadfun{reverse},{} \\spadfun{sort},{} and so on.")) (|sort!| (($ $) "\\spad{sort!(u)} returns \\spad{u} with its elements in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort!(p,{}u)} returns \\spad{u} with its elements ordered by \\spad{p}.")) (|reverse!| (($ $) "\\spad{reverse!(u)} returns \\spad{u} with its elements in reverse order.")) (|copyInto!| (($ $ $ (|Integer|)) "\\spad{copyInto!(u,{}v,{}i)} returns aggregate \\spad{u} containing a copy of \\spad{v} inserted at element \\spad{i}.")) (|position| (((|Integer|) |#1| $ (|Integer|)) "\\spad{position(x,{}a,{}n)} returns the index \\spad{i} of the first occurrence of \\spad{x} in \\axiom{a} where \\axiom{\\spad{i} \\spad{>=} \\spad{n}},{} and \\axiom{minIndex(a) - 1} if no such \\spad{x} is found.") (((|Integer|) |#1| $) "\\spad{position(x,{}a)} returns the index \\spad{i} of the first occurrence of \\spad{x} in a,{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.") (((|Integer|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{position(p,{}a)} returns the index \\spad{i} of the first \\spad{x} in \\axiom{a} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.")) (|sorted?| (((|Boolean|) $) "\\spad{sorted?(u)} tests if the elements of \\spad{u} are in ascending order.") (((|Boolean|) (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sorted?(p,{}a)} tests if \\axiom{a} is sorted according to predicate \\spad{p}.")) (|sort| (($ $) "\\spad{sort(u)} returns an \\spad{u} with elements in ascending order. Note: \\axiom{sort(\\spad{u}) = sort(\\spad{<=},{}\\spad{u})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort(p,{}a)} returns a copy of \\axiom{a} sorted using total ordering predicate \\spad{p}.")) (|reverse| (($ $) "\\spad{reverse(a)} returns a copy of \\axiom{a} with elements in reverse order.")) (|merge| (($ $ $) "\\spad{merge(u,{}v)} merges \\spad{u} and \\spad{v} in ascending order. Note: \\axiom{merge(\\spad{u},{}\\spad{v}) = merge(\\spad{<=},{}\\spad{u},{}\\spad{v})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge(p,{}a,{}b)} returns an aggregate \\spad{c} which merges \\axiom{a} and \\spad{b}. The result is produced by examining each element \\spad{x} of \\axiom{a} and \\spad{y} of \\spad{b} successively. If \\axiom{\\spad{p}(\\spad{x},{}\\spad{y})} is \\spad{true},{} then \\spad{x} is inserted into the result; otherwise \\spad{y} is inserted. If \\spad{x} is chosen,{} the next element of \\axiom{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \\axiom{merge(<,{}[1,{}3],{}[2,{}7,{}5])} returns \\axiom{[1,{}2,{}3,{}7,{}5]}."))) -((-4229 . T) (-2093 . T)) +((-4229 . T) (-2046 . T)) NIL (-347 |VarSet| R) ((|constructor| (NIL "The category of free Lie algebras. It is used by domains of non-commutative algebra: \\spadtype{LiePolynomial} and \\spadtype{XPBWPolynomial}. \\newline Author: Michel Petitot (petitot@lifl.\\spad{fr})")) (|eval| (($ $ (|List| |#1|) (|List| $)) "\\axiom{eval(\\spad{p},{} [\\spad{x1},{}...,{}\\spad{xn}],{} [\\spad{v1},{}...,{}\\spad{vn}])} replaces \\axiom{\\spad{xi}} by \\axiom{\\spad{vi}} in \\axiom{\\spad{p}}.") (($ $ |#1| $) "\\axiom{eval(\\spad{p},{} \\spad{x},{} \\spad{v})} replaces \\axiom{\\spad{x}} by \\axiom{\\spad{v}} in \\axiom{\\spad{p}}.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|trunc| (($ $ (|NonNegativeInteger|)) "\\axiom{trunc(\\spad{p},{}\\spad{n})} returns the polynomial \\axiom{\\spad{p}} truncated at order \\axiom{\\spad{n}}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{x})} returns \\axiom{Sum(r_i mirror(w_i))} if \\axiom{\\spad{x}} is \\axiom{Sum(r_i w_i)}.")) (|LiePoly| (($ (|LyndonWord| |#1|)) "\\axiom{LiePoly(\\spad{l})} returns the bracketed form of \\axiom{\\spad{l}} as a Lie polynomial.")) (|rquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{rquo(\\spad{x},{}\\spad{y})} returns the right simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|lquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{lquo(\\spad{x},{}\\spad{y})} returns the left simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{x})} returns the greatest length of a word in the support of \\axiom{\\spad{x}}.")) (|coerce| (((|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a recursive polynomial.") (((|XDistributedPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as distributed polynomial.") (($ |#1|) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a Lie polynomial.")) (|coef| ((|#2| (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coef(\\spad{x},{}\\spad{y})} returns the scalar product of \\axiom{\\spad{x}} by \\axiom{\\spad{y}},{} the set of words being regarded as an orthogonal basis."))) @@ -1354,11 +1354,11 @@ NIL NIL (-356) ((|constructor| (NIL "\\axiomType{FortranMatrixCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Matrix} or in domains involving \\axiomType{FortranCode}.")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|Matrix| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) -((-2093 . T)) +((-2046 . T)) NIL (-357) ((|constructor| (NIL "\\axiomType{FortranMatrixFunctionCategory} provides support for producing Functions and Subroutines representing matrices of expressions.")) (|retractIfCan| (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) -((-2093 . T)) +((-2046 . T)) NIL (-358 R S) ((|constructor| (NIL "A \\spad{bi}-module is a free module over a ring with generators indexed by an ordered set. Each element can be expressed as a finite linear combination of generators. Only non-zero terms are stored."))) @@ -1402,17 +1402,17 @@ NIL NIL (-368) ((|constructor| (NIL "\\axiomType{FortranProgramCategory} provides various models of FORTRAN subprograms. These can be transformed into actual FORTRAN code.")) (|outputAsFortran| (((|Void|) $) "\\axiom{outputAsFortran(\\spad{u})} translates \\axiom{\\spad{u}} into a legal FORTRAN subprogram."))) -((-2093 . T)) +((-2046 . T)) NIL (-369) ((|constructor| (NIL "\\axiomType{FortranFunctionCategory} is the category of arguments to NAG Library routines which return (sets of) function values.")) (|retractIfCan| (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) -((-2093 . T)) +((-2046 . T)) NIL (-370) ((|constructor| (NIL "provides an interface to the boot code for calling Fortran")) (|setLegalFortranSourceExtensions| (((|List| (|String|)) (|List| (|String|))) "\\spad{setLegalFortranSourceExtensions(l)} \\undocumented{}")) (|outputAsFortran| (((|Void|) (|FileName|)) "\\spad{outputAsFortran(fn)} \\undocumented{}")) (|linkToFortran| (((|SExpression|) (|Symbol|) (|List| (|Symbol|)) (|TheSymbolTable|) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}t,{}lv)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|)) (|Symbol|)) "\\spad{linkToFortran(s,{}l,{}ll,{}lv,{}t)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}ll,{}lv)} \\undocumented{}"))) NIL NIL -(-371 -2889 |returnType| |arguments| |symbols|) +(-371 -2883 |returnType| |arguments| |symbols|) ((|constructor| (NIL "\\axiomType{FortranProgram} allows the user to build and manipulate simple models of FORTRAN subprograms. These can then be transformed into actual FORTRAN notation.")) (|coerce| (($ (|Equation| (|Expression| (|Complex| (|Float|))))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Float|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Integer|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|Complex| (|Float|)))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Float|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Integer|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineComplex|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineFloat|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineInteger|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|MachineComplex|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineFloat|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineInteger|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(r)} \\undocumented{}") (($ (|List| (|FortranCode|))) "\\spad{coerce(lfc)} \\undocumented{}") (($ (|FortranCode|)) "\\spad{coerce(fc)} \\undocumented{}"))) NIL NIL @@ -1422,7 +1422,7 @@ NIL NIL (-373 R) ((|constructor| (NIL "A set \\spad{S} is PatternMatchable over \\spad{R} if \\spad{S} can lift the pattern-matching functions of \\spad{S} over the integers and float to itself (necessary for matching in towers)."))) -((-2093 . T)) +((-2046 . T)) NIL (-374 S) ((|constructor| (NIL "FieldOfPrimeCharacteristic is the category of fields of prime characteristic,{} \\spadignore{e.g.} finite fields,{} algebraic closures of fields of prime characteristic,{} transcendental extensions of of fields of prime characteristic.")) (|primeFrobenius| (($ $ (|NonNegativeInteger|)) "\\spad{primeFrobenius(a,{}s)} returns \\spad{a**(p**s)} where \\spad{p} is the characteristic.") (($ $) "\\spad{primeFrobenius(a)} returns \\spad{a ** p} where \\spad{p} is the characteristic.")) (|discreteLog| (((|Union| (|NonNegativeInteger|) "failed") $ $) "\\spad{discreteLog(b,{}a)} computes \\spad{s} with \\spad{b**s = a} if such an \\spad{s} exists.")) (|order| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{order(a)} computes the order of an element in the multiplicative group of the field. Error: if \\spad{a} is 0."))) @@ -1522,7 +1522,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-341)))) (-398 S) ((|constructor| (NIL "A finite-set aggregate models the notion of a finite set,{} that is,{} a collection of elements characterized by membership,{} but not by order or multiplicity. See \\spadtype{Set} for an example.")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#1| $) "\\spad{max(u)} returns the largest element of aggregate \\spad{u}.")) (|universe| (($) "\\spad{universe()}\\$\\spad{D} returns the universal set for finite set aggregate \\spad{D}.")) (|complement| (($ $) "\\spad{complement(u)} returns the complement of the set \\spad{u},{} \\spadignore{i.e.} the set of all values not in \\spad{u}.")) (|cardinality| (((|NonNegativeInteger|) $) "\\spad{cardinality(u)} returns the number of elements of \\spad{u}. Note: \\axiom{cardinality(\\spad{u}) = \\#u}."))) -((-4229 . T) (-4219 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4219 . T) (-4230 . T) (-2046 . T)) NIL (-399 R -4045) ((|constructor| (NIL "\\spadtype{FunctionSpaceComplexIntegration} provides functions for the indefinite integration of complex-valued functions.")) (|complexIntegrate| ((|#2| |#2| (|Symbol|)) "\\spad{complexIntegrate(f,{} x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable.")) (|internalIntegrate0| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate0 should} be a local function,{} but is conditional.")) (|internalIntegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate(f,{} x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable."))) @@ -1542,7 +1542,7 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#2| (QUOTE (-512))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-1024))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (-403 R) ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f,{} k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n,{} x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,{}...,{}mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,{}f)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,{}op)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x,{} s,{} n,{} f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x,{} s,{} n,{} f)} replaces every \\spad{s(a1,{}...,{}am)**n} in \\spad{x} by \\spad{f(a1,{}...,{}am)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [n1,{}...,{}nm],{} [f1,{}...,{}fm])} replaces every \\spad{\\spad{si}(a1,{}...,{}an)**ni} in \\spad{x} by \\spad{\\spad{fi}(a1,{}...,{}an)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ $))) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [n1,{}...,{}nm],{} [f1,{}...,{}fm])} replaces every \\spad{\\spad{si}(a)**ni} in \\spad{x} by \\spad{\\spad{fi}(a)} for any \\spad{a}.") (($ $ (|List| (|BasicOperator|)) (|List| $) (|Symbol|)) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [f1,{}...,{}fm],{} y)} replaces every \\spad{\\spad{si}(a)} in \\spad{x} by \\spad{\\spad{fi}(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $ (|BasicOperator|) $ (|Symbol|)) "\\spad{eval(x,{} s,{} f,{} y)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $) "\\spad{eval(f)} unquotes all the quoted operators in \\spad{f}.") (($ $ (|List| (|Symbol|))) "\\spad{eval(f,{} [foo1,{}...,{}foon])} unquotes all the \\spad{fooi}\\spad{'s} in \\spad{f}.") (($ $ (|Symbol|)) "\\spad{eval(f,{} foo)} unquotes all the foo\\spad{'s} in \\spad{f}.")) (|applyQuote| (($ (|Symbol|) (|List| $)) "\\spad{applyQuote(foo,{} [x1,{}...,{}xn])} returns \\spad{'foo(x1,{}...,{}xn)}.") (($ (|Symbol|) $ $ $ $) "\\spad{applyQuote(foo,{} x,{} y,{} z,{} t)} returns \\spad{'foo(x,{}y,{}z,{}t)}.") (($ (|Symbol|) $ $ $) "\\spad{applyQuote(foo,{} x,{} y,{} z)} returns \\spad{'foo(x,{}y,{}z)}.") (($ (|Symbol|) $ $) "\\spad{applyQuote(foo,{} x,{} y)} returns \\spad{'foo(x,{}y)}.") (($ (|Symbol|) $) "\\spad{applyQuote(foo,{} x)} returns \\spad{'foo(x)}.")) (|variables| (((|List| (|Symbol|)) $) "\\spad{variables(f)} returns the list of all the variables of \\spad{f}.")) (|ground| ((|#1| $) "\\spad{ground(f)} returns \\spad{f} as an element of \\spad{R}. An error occurs if \\spad{f} is not an element of \\spad{R}.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(f)} tests if \\spad{f} is an element of \\spad{R}."))) -((-4226 -3700 (|has| |#1| (-969)) (|has| |#1| (-445))) (-4224 |has| |#1| (-157)) (-4223 |has| |#1| (-157)) ((-4231 "*") |has| |#1| (-512)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-512)) (-4221 |has| |#1| (-512)) (-2093 . T)) +((-4226 -3700 (|has| |#1| (-969)) (|has| |#1| (-445))) (-4224 |has| |#1| (-157)) (-4223 |has| |#1| (-157)) ((-4231 "*") |has| |#1| (-512)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-512)) (-4221 |has| |#1| (-512)) (-2046 . T)) NIL (-404 R -4045) ((|constructor| (NIL "Provides some special functions over an integral domain.")) (|iiabs| ((|#2| |#2|) "\\spad{iiabs(x)} should be local but conditional.")) (|iiGamma| ((|#2| |#2|) "\\spad{iiGamma(x)} should be local but conditional.")) (|airyBi| ((|#2| |#2|) "\\spad{airyBi(x)} returns the airybi function applied to \\spad{x}")) (|airyAi| ((|#2| |#2|) "\\spad{airyAi(x)} returns the airyai function applied to \\spad{x}")) (|besselK| ((|#2| |#2| |#2|) "\\spad{besselK(x,{}y)} returns the besselk function applied to \\spad{x} and \\spad{y}")) (|besselI| ((|#2| |#2| |#2|) "\\spad{besselI(x,{}y)} returns the besseli function applied to \\spad{x} and \\spad{y}")) (|besselY| ((|#2| |#2| |#2|) "\\spad{besselY(x,{}y)} returns the bessely function applied to \\spad{x} and \\spad{y}")) (|besselJ| ((|#2| |#2| |#2|) "\\spad{besselJ(x,{}y)} returns the besselj function applied to \\spad{x} and \\spad{y}")) (|polygamma| ((|#2| |#2| |#2|) "\\spad{polygamma(x,{}y)} returns the polygamma function applied to \\spad{x} and \\spad{y}")) (|digamma| ((|#2| |#2|) "\\spad{digamma(x)} returns the digamma function applied to \\spad{x}")) (|Beta| ((|#2| |#2| |#2|) "\\spad{Beta(x,{}y)} returns the beta function applied to \\spad{x} and \\spad{y}")) (|Gamma| ((|#2| |#2| |#2|) "\\spad{Gamma(a,{}x)} returns the incomplete Gamma function applied to a and \\spad{x}") ((|#2| |#2|) "\\spad{Gamma(f)} returns the formal Gamma function applied to \\spad{f}")) (|abs| ((|#2| |#2|) "\\spad{abs(f)} returns the absolute value operator applied to \\spad{f}")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a special function operator")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a special function operator."))) @@ -1578,11 +1578,11 @@ NIL NIL (-412) ((|constructor| (NIL "\\axiomType{FortranVectorCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Vector} or in domains involving \\axiomType{FortranCode}.")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|Vector| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) -((-2093 . T)) +((-2046 . T)) NIL (-413) ((|constructor| (NIL "\\axiomType{FortranVectorFunctionCategory} is the catagory of arguments to NAG Library routines which return the values of vectors of functions.")) (|retractIfCan| (((|Union| $ "failed") (|Vector| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Vector| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Expression| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) -((-2093 . T)) +((-2046 . T)) NIL (-414 UP) ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.")) (|btwFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|) (|Set| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{btwFact(p,{}sqf,{}pd,{}r)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors). \\spad{pd} is the \\spadtype{Set} of possible degrees. \\spad{r} is a lower bound for the number of factors of \\spad{p}. Please do not use this function in your code because its design may change.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(p,{}sqf)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).")) (|factorOfDegree| (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|) (|Boolean|)) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees,{}r,{}sqf)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees,{}r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,{}p,{}r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1|) "\\spad{factorOfDegree(d,{}p)} returns a factor of \\spad{p} of degree \\spad{d}.")) (|factorSquareFree| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}d,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}listOfDegrees,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorSquareFree(p,{}listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} returns the factorization of \\spad{p} which is supposed not having any repeated factor (this is not checked).")) (|factor| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factor(p,{}d,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factor(p,{}listOfDegrees,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factor(p,{}listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factor(p,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns the factorization of \\spad{p} over the integers.")) (|tryFunctionalDecomposition| (((|Boolean|) (|Boolean|)) "\\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\\spad{true}) or not (\\spad{false}). Returns the previous value.")) (|tryFunctionalDecomposition?| (((|Boolean|)) "\\spad{tryFunctionalDecomposition?()} returns \\spad{true} if factorizers try functional decomposition of polynomials before factoring them.")) (|eisensteinIrreducible?| (((|Boolean|) |#1|) "\\spad{eisensteinIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by Eisenstein\\spad{'s} criterion,{} \\spad{false} is inconclusive.")) (|useEisensteinCriterion| (((|Boolean|) (|Boolean|)) "\\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein\\spad{'s} criterion before factoring: \\spad{true} for using it,{} \\spad{false} else. Returns the previous value.")) (|useEisensteinCriterion?| (((|Boolean|)) "\\spad{useEisensteinCriterion?()} returns \\spad{true} if factorizers check Eisenstein\\spad{'s} criterion before factoring.")) (|useSingleFactorBound| (((|Boolean|) (|Boolean|)) "\\spad{useSingleFactorBound(b)} chooses the algorithm to be used by the factorizers: \\spad{true} for algorithm with single factor bound,{} \\spad{false} for algorithm with overall bound. Returns the previous value.")) (|useSingleFactorBound?| (((|Boolean|)) "\\spad{useSingleFactorBound?()} returns \\spad{true} if algorithm with single factor bound is used for factorization,{} \\spad{false} for algorithm with overall bound.")) (|modularFactor| (((|Record| (|:| |prime| (|Integer|)) (|:| |factors| (|List| |#1|))) |#1|) "\\spad{modularFactor(f)} chooses a \"good\" prime and returns the factorization of \\spad{f} modulo this prime in a form that may be used by \\spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \\spad{f} has been proved to be irreducible over the integers or that \\spad{f} is a unit (\\spadignore{i.e.} 1 or \\spad{-1}). \\spad{f} shall be primitive (\\spadignore{i.e.} content(\\spad{p})\\spad{=1}) and square free (\\spadignore{i.e.} without repeated factors).")) (|numberOfFactors| (((|NonNegativeInteger|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{numberOfFactors(ddfactorization)} returns the number of factors of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|stopMusserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{stopMusserTrials(n)} sets to \\spad{n} the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**n} trials. Returns the previous value.") (((|PositiveInteger|)) "\\spad{stopMusserTrials()} returns the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**stopMusserTrials()} trials.")) (|musserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{musserTrials(n)} sets to \\spad{n} the number of primes to be tried in \\spadfun{modularFactor} and returns the previous value.") (((|PositiveInteger|)) "\\spad{musserTrials()} returns the number of primes that are tried in \\spadfun{modularFactor}.")) (|degreePartition| (((|Multiset| (|NonNegativeInteger|)) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{degreePartition(ddfactorization)} returns the degree partition of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|makeFR| (((|Factored| |#1|) (|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|))))))) "\\spad{makeFR(flist)} turns the final factorization of henselFact into a \\spadtype{Factored} object."))) @@ -1715,11 +1715,11 @@ NIL (-446 |Coef| |var| |cen|) ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,{}f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-447 |Key| |Entry| |Tbl| |dent|) ((|constructor| (NIL "A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key."))) ((-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-448 R E V P) ((|constructor| (NIL "A domain constructor of the category \\axiomType{TriangularSetCategory}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. Triangular sets are stored as sorted lists \\spad{w}.\\spad{r}.\\spad{t}. the main variables of their members but they are displayed in reverse order.\\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}"))) ((-4230 . T) (-4229 . T)) @@ -1731,7 +1731,7 @@ NIL (-450 |Key| |Entry| |hashfn|) ((|constructor| (NIL "This domain provides access to the underlying Lisp hash tables. By varying the hashfn parameter,{} tables suited for different purposes can be obtained."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-451) ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date Created : August 1988 Date Last Updated : March 9 1990 Related Constructors: OrderedSetInts,{} Commutator,{} FreeNilpotentLie AMS Classification: Primary 17B05,{} 17B30; Secondary 17A50 Keywords: free Lie algebra,{} Hall basis,{} basic commutators Description : Generate a basis for the free Lie algebra on \\spad{n} generators over a ring \\spad{R} with identity up to basic commutators of length \\spad{c} using the algorithm of \\spad{P}. Hall as given in Serre\\spad{'s} book Lie Groups \\spad{--} Lie Algebras")) (|generate| (((|Vector| (|List| (|Integer|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{generate(numberOfGens,{} maximalWeight)} generates a vector of elements of the form [left,{}weight,{}right] which represents a \\spad{P}. Hall basis element for the free lie algebra on \\spad{numberOfGens} generators. We only generate those basis elements of weight less than or equal to maximalWeight")) (|inHallBasis?| (((|Boolean|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{inHallBasis?(numberOfGens,{} leftCandidate,{} rightCandidate,{} left)} tests to see if a new element should be added to the \\spad{P}. Hall basis being constructed. The list \\spad{[leftCandidate,{}wt,{}rightCandidate]} is included in the basis if in the unique factorization of \\spad{rightCandidate},{} we have left factor leftOfRight,{} and leftOfRight \\spad{<=} \\spad{leftCandidate}")) (|lfunc| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{lfunc(d,{}n)} computes the rank of the \\spad{n}th factor in the lower central series of the free \\spad{d}-generated free Lie algebra; This rank is \\spad{d} if \\spad{n} = 1 and binom(\\spad{d},{}2) if \\spad{n} = 2"))) NIL @@ -1740,7 +1740,7 @@ NIL ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is total degree ordering refined by reverse lexicographic ordering with respect to the position that the variables appear in the list of variables parameter.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) (((-4231 "*") |has| |#2| (-157)) (-4222 |has| |#2| (-512)) (-4227 |has| |#2| (-6 -4227)) (-4224 . T) (-4223 . T) (-4226 . T)) ((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-512))) (|HasCategory| |#2| (QUOTE (-157))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-512)))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-352))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasAttribute| |#2| (QUOTE -4227)) (|HasCategory| |#2| (QUOTE (-424))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-424))) (|HasCategory| |#2| (QUOTE (-512))) (|HasCategory| |#2| (QUOTE (-837)))) (-3700 (|HasCategory| |#2| (QUOTE (-424))) (|HasCategory| |#2| (QUOTE (-512))) (|HasCategory| |#2| (QUOTE (-837)))) (-3700 (|HasCategory| |#2| (QUOTE (-424))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) -(-453 -2621 S) +(-453 -2615 S) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered first by the sum of their components,{} and then refined using a reverse lexicographic ordering. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4223 |has| |#2| (-969)) (-4224 |has| |#2| (-969)) (-4226 |has| |#2| (-6 -4226)) ((-4231 "*") |has| |#2| (-157)) (-4229 . T)) ((|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (-3700 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-209))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| (-520) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (|HasCategory| |#2| (QUOTE (-662))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (|HasCategory| |#2| (QUOTE (-969))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasAttribute| |#2| (QUOTE -4226)) (|HasCategory| |#2| (QUOTE (-124))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-25))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-209)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-341)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-728)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012))))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-3700 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) @@ -1766,7 +1766,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4229)) (|HasAttribute| |#1| (QUOTE -4230)) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-459 S) ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#1| $) "\\spad{member?(x,{}u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#1|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#1|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#1| $) "\\spad{count(x,{}u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{count(p,{}u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{every?(f,{}u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{any?(p,{}u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,{}u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) -((-2093 . T)) +((-2046 . T)) NIL (-460 S) ((|constructor| (NIL "Category for the hyperbolic trigonometric functions.")) (|tanh| (($ $) "\\spad{tanh(x)} returns the hyperbolic tangent of \\spad{x}.")) (|sinh| (($ $) "\\spad{sinh(x)} returns the hyperbolic sine of \\spad{x}.")) (|sech| (($ $) "\\spad{sech(x)} returns the hyperbolic secant of \\spad{x}.")) (|csch| (($ $) "\\spad{csch(x)} returns the hyperbolic cosecant of \\spad{x}.")) (|coth| (($ $) "\\spad{coth(x)} returns the hyperbolic cotangent of \\spad{x}.")) (|cosh| (($ $) "\\spad{cosh(x)} returns the hyperbolic cosine of \\spad{x}."))) @@ -1955,7 +1955,7 @@ NIL (-506 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-507 R -4045) ((|constructor| (NIL "This package provides functions for the integration of algebraic integrands over transcendental functions.")) (|algint| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|SparseUnivariatePolynomial| |#2|) (|SparseUnivariatePolynomial| |#2|))) "\\spad{algint(f,{} x,{} y,{} d)} returns the integral of \\spad{f(x,{}y)dx} where \\spad{y} is an algebraic function of \\spad{x}; \\spad{d} is the derivation to use on \\spad{k[x]}."))) NIL @@ -2111,7 +2111,7 @@ NIL (-545 |Coef|) ((|constructor| (NIL "InnerSparseUnivariatePowerSeries is an internal domain \\indented{2}{used for creating sparse Taylor and Laurent series.}")) (|cAcsch| (($ $) "\\spad{cAcsch(f)} computes the inverse hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsech| (($ $) "\\spad{cAsech(f)} computes the inverse hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcoth| (($ $) "\\spad{cAcoth(f)} computes the inverse hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtanh| (($ $) "\\spad{cAtanh(f)} computes the inverse hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcosh| (($ $) "\\spad{cAcosh(f)} computes the inverse hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsinh| (($ $) "\\spad{cAsinh(f)} computes the inverse hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsch| (($ $) "\\spad{cCsch(f)} computes the hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSech| (($ $) "\\spad{cSech(f)} computes the hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCoth| (($ $) "\\spad{cCoth(f)} computes the hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTanh| (($ $) "\\spad{cTanh(f)} computes the hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCosh| (($ $) "\\spad{cCosh(f)} computes the hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSinh| (($ $) "\\spad{cSinh(f)} computes the hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcsc| (($ $) "\\spad{cAcsc(f)} computes the arccosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsec| (($ $) "\\spad{cAsec(f)} computes the arcsecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcot| (($ $) "\\spad{cAcot(f)} computes the arccotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtan| (($ $) "\\spad{cAtan(f)} computes the arctangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcos| (($ $) "\\spad{cAcos(f)} computes the arccosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsin| (($ $) "\\spad{cAsin(f)} computes the arcsine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsc| (($ $) "\\spad{cCsc(f)} computes the cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSec| (($ $) "\\spad{cSec(f)} computes the secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCot| (($ $) "\\spad{cCot(f)} computes the cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTan| (($ $) "\\spad{cTan(f)} computes the tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCos| (($ $) "\\spad{cCos(f)} computes the cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSin| (($ $) "\\spad{cSin(f)} computes the sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cLog| (($ $) "\\spad{cLog(f)} computes the logarithm of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cExp| (($ $) "\\spad{cExp(f)} computes the exponential of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cRationalPower| (($ $ (|Fraction| (|Integer|))) "\\spad{cRationalPower(f,{}r)} computes \\spad{f^r}. For use when the coefficient ring is commutative.")) (|cPower| (($ $ |#1|) "\\spad{cPower(f,{}r)} computes \\spad{f^r},{} where \\spad{f} has constant coefficient 1. For use when the coefficient ring is commutative.")) (|integrate| (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. Warning: function does not check for a term of degree \\spad{-1}.")) (|seriesToOutputForm| (((|OutputForm|) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) (|Reference| (|OrderedCompletion| (|Integer|))) (|Symbol|) |#1| (|Fraction| (|Integer|))) "\\spad{seriesToOutputForm(st,{}refer,{}var,{}cen,{}r)} prints the series \\spad{f((var - cen)^r)}.")) (|iCompose| (($ $ $) "\\spad{iCompose(f,{}g)} returns \\spad{f(g(x))}. This is an internal function which should only be called for Taylor series \\spad{f(x)} and \\spad{g(x)} such that the constant coefficient of \\spad{g(x)} is zero.")) (|taylorQuoByVar| (($ $) "\\spad{taylorQuoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...}")) (|iExquo| (((|Union| $ "failed") $ $ (|Boolean|)) "\\spad{iExquo(f,{}g,{}taylor?)} is the quotient of the power series \\spad{f} and \\spad{g}. If \\spad{taylor?} is \\spad{true},{} then we must have \\spad{order(f) >= order(g)}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(fn,{}f)} returns the series \\spad{sum(fn(n) * an * x^n,{}n = n0..)},{} where \\spad{f} is the series \\spad{sum(an * x^n,{}n = n0..)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(f)} tests if \\spad{f} is a single monomial.")) (|series| (($ (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents.")) (|getStream| (((|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) $) "\\spad{getStream(f)} returns the stream of terms representing the series \\spad{f}.")) (|getRef| (((|Reference| (|OrderedCompletion| (|Integer|))) $) "\\spad{getRef(f)} returns a reference containing the order to which the terms of \\spad{f} have been computed.")) (|makeSeries| (($ (|Reference| (|OrderedCompletion| (|Integer|))) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|)))) "\\spad{makeSeries(refer,{}str)} creates a power series from the reference \\spad{refer} and the stream \\spad{str}."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083))))))) (-546 |Coef|) ((|constructor| (NIL "Internal package for dense Taylor series. This is an internal Taylor series type in which Taylor series are represented by a \\spadtype{Stream} of \\spadtype{Ring} elements. For univariate series,{} the \\spad{Stream} elements are the Taylor coefficients. For multivariate series,{} the \\spad{n}th Stream element is a form of degree \\spad{n} in the power series variables.")) (* (($ $ (|Integer|)) "\\spad{x*i} returns the product of integer \\spad{i} and the series \\spad{x}.") (($ $ |#1|) "\\spad{x*c} returns the product of \\spad{c} and the series \\spad{x}.") (($ |#1| $) "\\spad{c*x} returns the product of \\spad{c} and the series \\spad{x}.")) (|order| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{order(x,{}n)} returns the minimum of \\spad{n} and the order of \\spad{x}.") (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the order of a power series \\spad{x},{} \\indented{1}{\\spadignore{i.e.} the degree of the first non-zero term of the series.}")) (|pole?| (((|Boolean|) $) "\\spad{pole?(x)} tests if the series \\spad{x} has a pole. \\indented{1}{Note: this is \\spad{false} when \\spad{x} is a Taylor series.}")) (|series| (($ (|Stream| |#1|)) "\\spad{series(s)} creates a power series from a stream of \\indented{1}{ring elements.} \\indented{1}{For univariate series types,{} the stream \\spad{s} should be a stream} \\indented{1}{of Taylor coefficients. For multivariate series types,{} the} \\indented{1}{stream \\spad{s} should be a stream of forms the \\spad{n}th element} \\indented{1}{of which is a} \\indented{1}{form of degree \\spad{n} in the power series variables.}")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(x)} returns a stream of ring elements. \\indented{1}{When \\spad{x} is a univariate series,{} this is a stream of Taylor} \\indented{1}{coefficients. When \\spad{x} is a multivariate series,{} the} \\indented{1}{\\spad{n}th element of the stream is a form of} \\indented{1}{degree \\spad{n} in the power series variables.}"))) ((-4224 |has| |#1| (-512)) (-4223 |has| |#1| (-512)) ((-4231 "*") |has| |#1| (-512)) (-4222 |has| |#1| (-512)) (-4226 . T)) @@ -2142,23 +2142,23 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-783))) (|HasAttribute| |#1| (QUOTE -4229)) (|HasCategory| |#3| (QUOTE (-1012)))) (-553 |Index| |Entry|) ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#1| |#1|) "\\spad{swap!(u,{}i,{}j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#2|) "\\spad{fill!(u,{}x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#2| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#1| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#1| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#2| $) "\\spad{entry?(x,{}u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#1|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#1| $) "\\spad{index?(i,{}u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#2|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) -((-2093 . T)) +((-2046 . T)) NIL (-554 R A) ((|constructor| (NIL "\\indented{1}{AssociatedJordanAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A}} \\indented{1}{to define the new multiplications \\spad{a*b := (a *\\$A b + b *\\$A a)/2}} \\indented{1}{(anticommutator).} \\indented{1}{The usual notation \\spad{{a,{}b}_+} cannot be used due to} \\indented{1}{restrictions in the current language.} \\indented{1}{This domain only gives a Jordan algebra if the} \\indented{1}{Jordan-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds} \\indented{1}{for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}.} \\indented{1}{This relation can be checked by} \\indented{1}{\\spadfun{jordanAdmissible?()\\$A}.} \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Jordan algebra. Moreover,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same \\spad{true} for the associated Jordan algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Jordan algebra \\spadtype{AssociatedJordanAlgebra}(\\spad{R},{}A)."))) -((-4226 -3700 (-4005 (|has| |#2| (-340 |#1|)) (|has| |#1| (-512))) (-12 (|has| |#2| (-390 |#1|)) (|has| |#1| (-512)))) (-4224 . T) (-4223 . T)) +((-4226 -3700 (-4006 (|has| |#2| (-340 |#1|)) (|has| |#1| (-512))) (-12 (|has| |#2| (-390 |#1|)) (|has| |#1| (-512)))) (-4224 . T) (-4223 . T)) ((|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))))) (-555 |Entry|) ((|constructor| (NIL "This domain allows a random access file to be viewed both as a table and as a file object.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-1012))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -560) (QUOTE (-791))))) +((|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-1012))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -560) (QUOTE (-791))))) (-556 S |Key| |Entry|) ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#3| "failed") |#2| $) "\\spad{search(k,{}t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#3| "failed") |#2| $) "\\spad{remove!(k,{}t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#2|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#2| $) "\\spad{key?(k,{}t)} tests if \\spad{k} is a key in table \\spad{t}."))) NIL NIL (-557 |Key| |Entry|) ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#2| "failed") |#1| $) "\\spad{search(k,{}t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#2| "failed") |#1| $) "\\spad{remove!(k,{}t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#1|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#1| $) "\\spad{key?(k,{}t)} tests if \\spad{k} is a key in table \\spad{t}."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-558 R S) ((|constructor| (NIL "This package exports some auxiliary functions on kernels")) (|constantIfCan| (((|Union| |#1| "failed") (|Kernel| |#2|)) "\\spad{constantIfCan(k)} \\undocumented")) (|constantKernel| (((|Kernel| |#2|) |#1|) "\\spad{constantKernel(r)} \\undocumented"))) @@ -2231,7 +2231,7 @@ NIL (-575) ((|constructor| (NIL "This domain provides a simple way to save values in files.")) (|setelt| (((|Any|) $ (|Symbol|) (|Any|)) "\\spad{lib.k := v} saves the value \\spad{v} in the library \\spad{lib}. It can later be extracted using the key \\spad{k}.")) (|elt| (((|Any|) $ (|Symbol|)) "\\spad{elt(lib,{}k)} or \\spad{lib}.\\spad{k} extracts the value corresponding to the key \\spad{k} from the library \\spad{lib}.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space.")) (|library| (($ (|FileName|)) "\\spad{library(ln)} creates a new library file."))) ((-4230 . T)) -((|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3049) (QUOTE (-51))))))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3043) (QUOTE (-51))))))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) (-576 S R) ((|constructor| (NIL "\\axiom{JacobiIdentity} means that \\axiom{[\\spad{x},{}[\\spad{y},{}\\spad{z}]]+[\\spad{y},{}[\\spad{z},{}\\spad{x}]]+[\\spad{z},{}[\\spad{x},{}\\spad{y}]] = 0} holds.")) (/ (($ $ |#2|) "\\axiom{\\spad{x/r}} returns the division of \\axiom{\\spad{x}} by \\axiom{\\spad{r}}.")) (|construct| (($ $ $) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket of \\axiom{\\spad{x}} and \\axiom{\\spad{y}}."))) NIL @@ -2242,7 +2242,7 @@ NIL NIL (-578 R A) ((|constructor| (NIL "AssociatedLieAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A} to define the Lie bracket \\spad{a*b := (a *\\$A b - b *\\$A a)} (commutator). Note that the notation \\spad{[a,{}b]} cannot be used due to restrictions of the current compiler. This domain only gives a Lie algebra if the Jacobi-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}. This relation can be checked by \\spad{lieAdmissible?()\\$A}. \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Lie algebra. Also,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same is \\spad{true} for the associated Lie algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Lie algebra \\spadtype{AssociatedLieAlgebra}(\\spad{R},{}A)."))) -((-4226 -3700 (-4005 (|has| |#2| (-340 |#1|)) (|has| |#1| (-512))) (-12 (|has| |#2| (-390 |#1|)) (|has| |#1| (-512)))) (-4224 . T) (-4223 . T)) +((-4226 -3700 (-4006 (|has| |#2| (-340 |#1|)) (|has| |#1| (-512))) (-12 (|has| |#2| (-390 |#1|)) (|has| |#1| (-512)))) (-4224 . T) (-4223 . T)) ((|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#2| (LIST (QUOTE -340) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#2| (LIST (QUOTE -390) (|devaluate| |#1|)))))) (-579 R FE) ((|constructor| (NIL "PowerSeriesLimitPackage implements limits of expressions in one or more variables as one of the variables approaches a limiting value. Included are two-sided limits,{} left- and right- hand limits,{} and limits at plus or minus infinity.")) (|complexLimit| (((|Union| (|OnePointCompletion| |#2|) "failed") |#2| (|Equation| (|OnePointCompletion| |#2|))) "\\spad{complexLimit(f(x),{}x = a)} computes the complex limit \\spad{lim(x -> a,{}f(x))}.")) (|limit| (((|Union| (|OrderedCompletion| |#2|) "failed") |#2| (|Equation| |#2|) (|String|)) "\\spad{limit(f(x),{}x=a,{}\"left\")} computes the left hand real limit \\spad{lim(x -> a-,{}f(x))}; \\spad{limit(f(x),{}x=a,{}\"right\")} computes the right hand real limit \\spad{lim(x -> a+,{}f(x))}.") (((|Union| (|OrderedCompletion| |#2|) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed")) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed"))) "failed") |#2| (|Equation| (|OrderedCompletion| |#2|))) "\\spad{limit(f(x),{}x = a)} computes the real limit \\spad{lim(x -> a,{}f(x))}."))) @@ -2255,7 +2255,7 @@ NIL (-581 S R) ((|constructor| (NIL "Test for linear dependence.")) (|solveLinear| (((|Union| (|Vector| (|Fraction| |#1|)) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in the quotient field of \\spad{S}.") (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in \\spad{S}.")) (|linearDependence| (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|)) "\\spad{linearDependence([v1,{}...,{}vn])} returns \\spad{[c1,{}...,{}cn]} if \\spad{c1*v1 + ... + cn*vn = 0} and not all the \\spad{ci}\\spad{'s} are 0,{} \"failed\" if the \\spad{vi}\\spad{'s} are linearly independent over \\spad{S}.")) (|linearlyDependent?| (((|Boolean|) (|Vector| |#2|)) "\\spad{linearlyDependent?([v1,{}...,{}vn])} returns \\spad{true} if the \\spad{vi}\\spad{'s} are linearly dependent over \\spad{S},{} \\spad{false} otherwise."))) NIL -((|HasCategory| |#1| (QUOTE (-336))) (-2415 (|HasCategory| |#1| (QUOTE (-336))))) +((|HasCategory| |#1| (QUOTE (-336))) (-2399 (|HasCategory| |#1| (QUOTE (-336))))) (-582 R) ((|constructor| (NIL "An extension ring with an explicit linear dependence test.")) (|reducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| $) (|Vector| $)) "\\spad{reducedSystem(A,{} v)} returns a matrix \\spad{B} and a vector \\spad{w} such that \\spad{A x = v} and \\spad{B x = w} have the same solutions in \\spad{R}.") (((|Matrix| |#1|) (|Matrix| $)) "\\spad{reducedSystem(A)} returns a matrix \\spad{B} such that \\spad{A x = 0} and \\spad{B x = 0} have the same solutions in \\spad{R}."))) ((-4226 . T)) @@ -2294,7 +2294,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230))) (-591 S) ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#1| $ (|UniversalSegment| (|Integer|)) |#1|) "\\spad{setelt(u,{}i..j,{}x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) \\spad{:=} \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} \\spad{:=} \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,{}u,{}k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,{}u,{}i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,{}i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,{}i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) \\spad{==} concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|elt| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{elt(u,{}i..j)} (also written: \\axiom{a(\\spad{i}..\\spad{j})}) returns the aggregate of elements \\axiom{\\spad{u}} for \\spad{k} from \\spad{i} to \\spad{j} in that order. Note: in general,{} \\axiom{a.\\spad{s} = [a.\\spad{k} for \\spad{i} in \\spad{s}]}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,{}u,{}v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,{}v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,{}u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) \\spad{==} concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,{}x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) \\spad{==} concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,{}x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) -((-2093 . T)) +((-2046 . T)) NIL (-592 R -4045 L) ((|constructor| (NIL "\\spad{ElementaryFunctionLODESolver} provides the top-level functions for finding closed form solutions of linear ordinary differential equations and initial value problems.")) (|solve| (((|Union| |#2| "failed") |#3| |#2| (|Symbol|) |#2| (|List| |#2|)) "\\spad{solve(op,{} g,{} x,{} a,{} [y0,{}...,{}ym])} returns either the solution of the initial value problem \\spad{op y = g,{} y(a) = y0,{} y'(a) = y1,{}...} or \"failed\" if the solution cannot be found; \\spad{x} is the dependent variable.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) "failed") |#3| |#2| (|Symbol|)) "\\spad{solve(op,{} g,{} x)} returns either a solution of the ordinary differential equation \\spad{op y = g} or \"failed\" if no non-trivial solution can be found; When found,{} the solution is returned in the form \\spad{[h,{} [b1,{}...,{}bm]]} where \\spad{h} is a particular solution and and \\spad{[b1,{}...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{op y = 0}. A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; \\spad{x} is the dependent variable."))) @@ -2320,7 +2320,7 @@ NIL ((|constructor| (NIL "\\spadtype{LinearOrdinaryDifferentialOperatorFactorizer} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.")) (|factor1| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor1(a)} returns the factorisation of a,{} assuming that a has no first-order right factor.")) (|factor| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor(a)} returns the factorisation of a.") (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{factor(a,{} zeros)} returns the factorisation of a. \\spad{zeros} is a zero finder in \\spad{UP}."))) NIL ((|HasCategory| |#1| (QUOTE (-27)))) -(-598 A -4064) +(-598 A -1615) ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperator} defines a ring of differential operators with coefficients in a ring A with a given derivation. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}"))) ((-4223 . T) (-4224 . T) (-4226 . T)) ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-336)))) @@ -2354,7 +2354,7 @@ NIL NIL (-606 S) ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#1|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-607 -4045) ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}. It is essentially a particular instantiation of the package \\spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package\\spad{'s} existence makes it easier to use \\spadfun{solve} in the AXIOM interpreter.")) (|rank| (((|NonNegativeInteger|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{rank(A,{}B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{hasSolution?(A,{}B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| (|Vector| |#1|) "failed") (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{particularSolution(A,{}B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|List| (|List| |#1|)) (|List| (|Vector| |#1|))) "\\spad{solve(A,{}LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|Matrix| |#1|) (|List| (|Vector| |#1|))) "\\spad{solve(A,{}LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|List| (|List| |#1|)) (|Vector| |#1|)) "\\spad{solve(A,{}B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{solve(A,{}B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) @@ -2382,7 +2382,7 @@ NIL NIL (-613 S) ((|constructor| (NIL "LazyStreamAggregate is the category of streams with lazy evaluation. It is understood that the function 'empty?' will cause lazy evaluation if necessary to determine if there are entries. Functions which call 'empty?',{} \\spadignore{e.g.} 'first' and 'rest',{} will also cause lazy evaluation if necessary.")) (|complete| (($ $) "\\spad{complete(st)} causes all entries of 'st' to be computed. this function should only be called on streams which are known to be finite.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(st,{}n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least \\spad{'n'} explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length \\spad{<=} \\spad{n}.")) (|numberOfComputedEntries| (((|NonNegativeInteger|) $) "\\spad{numberOfComputedEntries(st)} returns the number of explicitly computed entries of stream \\spad{st} which exist immediately prior to the time this function is called.")) (|rst| (($ $) "\\spad{rst(s)} returns a pointer to the next node of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|frst| ((|#1| $) "\\spad{frst(s)} returns the first element of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|lazyEvaluate| (($ $) "\\spad{lazyEvaluate(s)} causes one lazy evaluation of stream \\spad{s}. Caution: the first node must be a lazy evaluation mechanism (satisfies \\spad{lazy?(s) = true}) as there is no error check. Note: a call to this function may or may not produce an explicit first entry")) (|lazy?| (((|Boolean|) $) "\\spad{lazy?(s)} returns \\spad{true} if the first node of the stream \\spad{s} is a lazy evaluation mechanism which could produce an additional entry to \\spad{s}.")) (|explicitlyEmpty?| (((|Boolean|) $) "\\spad{explicitlyEmpty?(s)} returns \\spad{true} if the stream is an (explicitly) empty stream. Note: this is a null test which will not cause lazy evaluation.")) (|explicitEntries?| (((|Boolean|) $) "\\spad{explicitEntries?(s)} returns \\spad{true} if the stream \\spad{s} has explicitly computed entries,{} and \\spad{false} otherwise.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(f,{}st)} returns a stream consisting of those elements of stream \\spad{st} satisfying the predicate \\spad{f}. Note: \\spad{select(f,{}st) = [x for x in st | f(x)]}.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(f,{}st)} returns a stream consisting of those elements of stream \\spad{st} which do not satisfy the predicate \\spad{f}. Note: \\spad{remove(f,{}st) = [x for x in st | not f(x)]}."))) -((-2093 . T)) +((-2046 . T)) NIL (-614 R) ((|constructor| (NIL "This domain represents three dimensional matrices over a general object type")) (|matrixDimensions| (((|Vector| (|NonNegativeInteger|)) $) "\\spad{matrixDimensions(x)} returns the dimensions of a matrix")) (|matrixConcat3D| (($ (|Symbol|) $ $) "\\spad{matrixConcat3D(s,{}x,{}y)} concatenates two 3-\\spad{D} matrices along a specified axis")) (|coerce| (((|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|))) $) "\\spad{coerce(x)} moves from the domain to the representation type") (($ (|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|)))) "\\spad{coerce(p)} moves from the representation type (PrimitiveArray PrimitiveArray PrimitiveArray \\spad{R}) to the domain")) (|setelt!| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{setelt!(x,{}i,{}j,{}k,{}s)} (or \\spad{x}.\\spad{i}.\\spad{j}.k:=s) sets a specific element of the array to some value of type \\spad{R}")) (|elt| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{elt(x,{}i,{}j,{}k)} extract an element from the matrix \\spad{x}")) (|construct| (($ (|List| (|List| (|List| |#1|)))) "\\spad{construct(lll)} creates a 3-\\spad{D} matrix from a List List List \\spad{R} \\spad{lll}")) (|plus| (($ $ $) "\\spad{plus(x,{}y)} adds two matrices,{} term by term we note that they must be the same size")) (|identityMatrix| (($ (|NonNegativeInteger|)) "\\spad{identityMatrix(n)} create an identity matrix we note that this must be square")) (|zeroMatrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zeroMatrix(i,{}j,{}k)} create a matrix with all zero terms"))) @@ -2426,7 +2426,7 @@ NIL ((|HasAttribute| |#2| (QUOTE (-4231 "*"))) (|HasCategory| |#2| (QUOTE (-281))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-512)))) (-624 R |Row| |Col|) ((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#1| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#3|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#1|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(m,{}r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#2| |#2| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#3| $ |#3|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#1|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#1| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,{}i1,{}j1,{}y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,{}j)} is set to \\spad{y(i-i1+1,{}j-j1+1)} for \\spad{i = i1,{}...,{}i1-1+nrows y} and \\spad{j = j1,{}...,{}j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,{}i1,{}i2,{}j1,{}j2)} extracts the submatrix \\spad{[x(i,{}j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,{}i,{}j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,{}i,{}j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,{}rowList,{}colList,{}y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,{}i<2>,{}...,{}i<m>]} and \\spad{colList = [j<1>,{}j<2>,{}...,{}j<n>]},{} then \\spad{x(i<k>,{}j<l>)} is set to \\spad{y(k,{}l)} for \\spad{k = 1,{}...,{}m} and \\spad{l = 1,{}...,{}n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,{}rowList,{}colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,{}i<2>,{}...,{}i<m>]} and \\spad{colList = [j<1>,{}j<2>,{}...,{}j<n>]},{} then the \\spad{(k,{}l)}th entry of \\spad{elt(x,{}rowList,{}colList)} is \\spad{x(i<k>,{}j<l>)}.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,{}y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,{}y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#2|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#3|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,{}...,{}mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{\\spad{ri} := nrows \\spad{mi}},{} \\spad{\\spad{ci} := ncols \\spad{mi}},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#1|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#1|) "\\spad{scalarMatrix(n,{}r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|List| (|List| |#1|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,{}n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = -m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-625 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{MatrixLinearAlgebraFunctions} provides functions to compute inverses and canonical forms.")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|normalizedDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{normalizedDivide(n,{}d)} returns a normalized quotient and remainder such that consistently unique representatives for the residue class are chosen,{} \\spadignore{e.g.} positive remainders")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (|adjoint| (((|Record| (|:| |adjMat| |#4|) (|:| |detMat| |#1|)) |#4|) "\\spad{adjoint(m)} returns the ajoint matrix of \\spad{m} (\\spadignore{i.e.} the matrix \\spad{n} such that \\spad{m*n} = determinant(\\spad{m})*id) and the detrminant of \\spad{m}.")) (|invertIfCan| (((|Union| |#4| "failed") |#4|) "\\spad{invertIfCan(m)} returns the inverse of \\spad{m} over \\spad{R}")) (|fractionFreeGauss!| ((|#4| |#4|) "\\spad{fractionFreeGauss(m)} performs the fraction free gaussian elimination on the matrix \\spad{m}.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|elColumn2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elColumn2!(m,{}a,{}i,{}j)} adds to column \\spad{i} a*column(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} \\spad{^=j})")) (|elRow2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elRow2!(m,{}a,{}i,{}j)} adds to row \\spad{i} a*row(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} \\spad{^=j})")) (|elRow1!| ((|#4| |#4| (|Integer|) (|Integer|)) "\\spad{elRow1!(m,{}i,{}j)} swaps rows \\spad{i} and \\spad{j} of matrix \\spad{m} : elementary operation of first kind")) (|minordet| ((|#1| |#4|) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square."))) @@ -2450,11 +2450,11 @@ NIL NIL (-630) ((|constructor| (NIL "A domain which models the complex number representation used by machines in the AXIOM-NAG link.")) (|coerce| (((|Complex| (|Float|)) $) "\\spad{coerce(u)} transforms \\spad{u} into a COmplex Float") (($ (|Complex| (|MachineInteger|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|MachineFloat|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Integer|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Float|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex"))) -((-4222 . T) (-4227 |has| (-635) (-336)) (-4221 |has| (-635) (-336)) (-3902 . T) (-4228 |has| (-635) (-6 -4228)) (-4225 |has| (-635) (-6 -4225)) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) +((-4222 . T) (-4227 |has| (-635) (-336)) (-4221 |has| (-635) (-336)) (-3901 . T) (-4228 |has| (-635) (-6 -4228)) (-4225 |has| (-635) (-6 -4225)) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) ((|HasCategory| (-635) (QUOTE (-135))) (|HasCategory| (-635) (QUOTE (-133))) (|HasCategory| (-635) (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| (-635) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| (-635) (QUOTE (-341))) (|HasCategory| (-635) (QUOTE (-336))) (|HasCategory| (-635) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| (-635) (QUOTE (-209))) (|HasCategory| (-635) (QUOTE (-322))) (-3700 (|HasCategory| (-635) (QUOTE (-336))) (|HasCategory| (-635) (QUOTE (-322)))) (|HasCategory| (-635) (LIST (QUOTE -260) (QUOTE (-635)) (QUOTE (-635)))) (|HasCategory| (-635) (LIST (QUOTE -283) (QUOTE (-635)))) (|HasCategory| (-635) (LIST (QUOTE -481) (QUOTE (-1083)) (QUOTE (-635)))) (|HasCategory| (-635) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| (-635) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| (-635) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| (-635) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| (-635) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-635) (QUOTE (-945))) (|HasCategory| (-635) (QUOTE (-1104))) (-12 (|HasCategory| (-635) (QUOTE (-926))) (|HasCategory| (-635) (QUOTE (-1104)))) (|HasCategory| (-635) (QUOTE (-505))) (|HasCategory| (-635) (QUOTE (-978))) (-12 (|HasCategory| (-635) (QUOTE (-978))) (|HasCategory| (-635) (QUOTE (-1104)))) (-3700 (|HasCategory| (-635) (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| (-635) (QUOTE (-336)))) (|HasCategory| (-635) (QUOTE (-281))) (-3700 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-336))) (|HasCategory| (-635) (QUOTE (-322)))) (|HasCategory| (-635) (QUOTE (-837))) (-12 (|HasCategory| (-635) (QUOTE (-209))) (|HasCategory| (-635) (QUOTE (-336)))) (-12 (|HasCategory| (-635) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| (-635) (QUOTE (-336)))) (|HasCategory| (-635) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| (-635) (QUOTE (-783))) (|HasCategory| (-635) (QUOTE (-512))) (|HasAttribute| (-635) (QUOTE -4228)) (|HasAttribute| (-635) (QUOTE -4225)) (-12 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (-3700 (-12 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (|HasCategory| (-635) (QUOTE (-336))) (-12 (|HasCategory| (-635) (QUOTE (-322))) (|HasCategory| (-635) (QUOTE (-837))))) (-3700 (-12 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (-12 (|HasCategory| (-635) (QUOTE (-336))) (|HasCategory| (-635) (QUOTE (-837)))) (-12 (|HasCategory| (-635) (QUOTE (-322))) (|HasCategory| (-635) (QUOTE (-837))))) (-3700 (-12 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (|HasCategory| (-635) (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (|HasCategory| (-635) (QUOTE (-512)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (|HasCategory| (-635) (QUOTE (-133)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-635) (QUOTE (-281))) (|HasCategory| (-635) (QUOTE (-837)))) (|HasCategory| (-635) (QUOTE (-322))))) (-631 S) ((|constructor| (NIL "A multi-dictionary is a dictionary which may contain duplicates. As for any dictionary,{} its size is assumed large so that copying (non-destructive) operations are generally to be avoided.")) (|duplicates| (((|List| (|Record| (|:| |entry| |#1|) (|:| |count| (|NonNegativeInteger|)))) $) "\\spad{duplicates(d)} returns a list of values which have duplicates in \\spad{d}")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(d)} destructively removes any duplicate values in dictionary \\spad{d}.")) (|insert!| (($ |#1| $ (|NonNegativeInteger|)) "\\spad{insert!(x,{}d,{}n)} destructively inserts \\spad{n} copies of \\spad{x} into dictionary \\spad{d}."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-632 U) ((|constructor| (NIL "This package supports factorization and gcds of univariate polynomials over the integers modulo different primes. The inputs are given as polynomials over the integers with the prime passed explicitly as an extra argument.")) (|exptMod| ((|#1| |#1| (|Integer|) |#1| (|Integer|)) "\\spad{exptMod(f,{}n,{}g,{}p)} raises the univariate polynomial \\spad{f} to the \\spad{n}th power modulo the polynomial \\spad{g} and the prime \\spad{p}.")) (|separateFactors| (((|List| |#1|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) (|Integer|)) "\\spad{separateFactors(ddl,{} p)} refines the distinct degree factorization produced by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} to give a complete list of factors.")) (|ddFact| (((|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) |#1| (|Integer|)) "\\spad{ddFact(f,{}p)} computes a distinct degree factorization of the polynomial \\spad{f} modulo the prime \\spad{p},{} \\spadignore{i.e.} such that each factor is a product of irreducibles of the same degrees. The input polynomial \\spad{f} is assumed to be square-free modulo \\spad{p}.")) (|factor| (((|List| |#1|) |#1| (|Integer|)) "\\spad{factor(f1,{}p)} returns the list of factors of the univariate polynomial \\spad{f1} modulo the integer prime \\spad{p}. Error: if \\spad{f1} is not square-free modulo \\spad{p}.")) (|linears| ((|#1| |#1| (|Integer|)) "\\spad{linears(f,{}p)} returns the product of all the linear factors of \\spad{f} modulo \\spad{p}. Potentially incorrect result if \\spad{f} is not square-free modulo \\spad{p}.")) (|gcd| ((|#1| |#1| |#1| (|Integer|)) "\\spad{gcd(f1,{}f2,{}p)} computes the \\spad{gcd} of the univariate polynomials \\spad{f1} and \\spad{f2} modulo the integer prime \\spad{p}."))) @@ -2500,7 +2500,7 @@ NIL ((|constructor| (NIL "MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.")) (|makeRecord| (((|Record| (|:| |part1| |#1|) (|:| |part2| |#2|)) |#1| |#2|) "\\spad{makeRecord(a,{}b)} creates a record object with type Record(part1:S,{} part2:R),{} where part1 is \\spad{a} and part2 is \\spad{b}."))) NIL NIL -(-643 S -2243 I) +(-643 S -2211 I) ((|constructor| (NIL "transforms top-level objects into compiled functions.")) (|compiledFunction| (((|Mapping| |#3| |#2|) |#1| (|Symbol|)) "\\spad{compiledFunction(expr,{} x)} returns a function \\spad{f: D -> I} defined by \\spad{f(x) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\spad{D}.")) (|unaryFunction| (((|Mapping| |#3| |#2|) (|Symbol|)) "\\spad{unaryFunction(a)} is a local function"))) NIL NIL @@ -2516,7 +2516,7 @@ NIL ((|constructor| (NIL "Lifting of a map through 2 levels of polynomials.")) (|map| ((|#6| (|Mapping| |#4| |#1|) |#3|) "\\spad{map(f,{} p)} lifts \\spad{f} to the domain of \\spad{p} then applies it to \\spad{p}."))) NIL NIL -(-647 R |Mod| -2091 -3478 |exactQuo|) +(-647 R |Mod| -2742 -1819 |exactQuo|) ((|constructor| (NIL "\\indented{1}{These domains are used for the factorization and gcds} of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{EuclideanModularRing}")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,{}y)} \\undocumented")) (|reduce| (($ |#1| |#2|) "\\spad{reduce(r,{}m)} \\undocumented")) (|coerce| ((|#1| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#2| $) "\\spad{modulus(x)} \\undocumented"))) ((-4221 . T) (-4227 . T) (-4222 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL @@ -2532,7 +2532,7 @@ NIL ((|constructor| (NIL "Algebra of ADDITIVE operators on a module.")) (|makeop| (($ |#1| (|FreeGroup| (|BasicOperator|))) "\\spad{makeop should} be local but conditional")) (|opeval| ((|#2| (|BasicOperator|) |#2|) "\\spad{opeval should} be local but conditional")) (** (($ $ (|Integer|)) "\\spad{op**n} \\undocumented") (($ (|BasicOperator|) (|Integer|)) "\\spad{op**n} \\undocumented")) (|evaluateInverse| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluateInverse(x,{}f)} \\undocumented")) (|evaluate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluate(f,{} u +-> g u)} attaches the map \\spad{g} to \\spad{f}. \\spad{f} must be a basic operator \\spad{g} MUST be additive,{} \\spadignore{i.e.} \\spad{g(a + b) = g(a) + g(b)} for any \\spad{a},{} \\spad{b} in \\spad{M}. This implies that \\spad{g(n a) = n g(a)} for any \\spad{a} in \\spad{M} and integer \\spad{n > 0}.")) (|conjug| ((|#1| |#1|) "\\spad{conjug(x)}should be local but conditional")) (|adjoint| (($ $ $) "\\spad{adjoint(op1,{} op2)} sets the adjoint of \\spad{op1} to be op2. \\spad{op1} must be a basic operator") (($ $) "\\spad{adjoint(op)} returns the adjoint of the operator \\spad{op}."))) ((-4224 |has| |#1| (-157)) (-4223 |has| |#1| (-157)) (-4226 . T)) ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135)))) -(-651 R |Mod| -2091 -3478 |exactQuo|) +(-651 R |Mod| -2742 -1819 |exactQuo|) ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{EuclideanModularRing} ,{}\\spadtype{ModularField}")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,{}y)} \\undocumented")) (|reduce| (($ |#1| |#2|) "\\spad{reduce(r,{}m)} \\undocumented")) (|coerce| ((|#1| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#2| $) "\\spad{modulus(x)} \\undocumented"))) ((-4226 . T)) NIL @@ -2618,7 +2618,7 @@ NIL ((-12 (|HasCategory| |#1| (QUOTE (-341))) (|HasCategory| |#2| (QUOTE (-341)))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-783)))) (-672 S) ((|constructor| (NIL "A multi-set aggregate is a set which keeps track of the multiplicity of its elements."))) -((-4219 . T) (-4230 . T) (-2093 . T)) +((-4219 . T) (-4230 . T) (-2046 . T)) NIL (-673 S) ((|constructor| (NIL "A multiset is a set with multiplicities.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove!(p,{}ms,{}number)} removes destructively at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove!(x,{}ms,{}number)} removes destructively at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove(p,{}ms,{}number)} removes at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove(x,{}ms,{}number)} removes at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|members| (((|List| |#1|) $) "\\spad{members(ms)} returns a list of the elements of \\spad{ms} {\\em without} their multiplicity. See also \\spadfun{parts}.")) (|multiset| (($ (|List| |#1|)) "\\spad{multiset(ls)} creates a multiset with elements from \\spad{ls}.") (($ |#1|) "\\spad{multiset(s)} creates a multiset with singleton \\spad{s}.") (($) "\\spad{multiset()}\\$\\spad{D} creates an empty multiset of domain \\spad{D}."))) @@ -2791,7 +2791,7 @@ NIL (-715 R |VarSet|) ((|constructor| (NIL "A post-facto extension for \\axiomType{\\spad{SMP}} in order to speed up operations related to pseudo-division and \\spad{gcd}. This domain is based on the \\axiomType{NSUP} constructor which is itself a post-facto extension of the \\axiomType{SUP} constructor."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-6 -4227)) (-4224 . T) (-4223 . T) (-4226 . T)) -((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-352))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083))))) (|HasCategory| |#1| (QUOTE (-336))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2415 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2415 (|HasCategory| |#1| (QUOTE (-505)))) (-2415 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2415 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520))))) (-2415 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2415 (|HasCategory| |#1| (LIST (QUOTE -917) (QUOTE (-520))))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasAttribute| |#1| (QUOTE -4227)) (|HasCategory| |#1| (QUOTE (-424))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) +((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-352))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083))))) (|HasCategory| |#1| (QUOTE (-336))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2399 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2399 (|HasCategory| |#1| (QUOTE (-505)))) (-2399 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2399 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-520))))) (-2399 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-1083)))) (-2399 (|HasCategory| |#1| (LIST (QUOTE -917) (QUOTE (-520))))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasAttribute| |#1| (QUOTE -4227)) (|HasCategory| |#1| (QUOTE (-424))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (|HasCategory| |#1| (QUOTE (-424))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) (-716 R S) ((|constructor| (NIL "This package lifts a mapping from coefficient rings \\spad{R} to \\spad{S} to a mapping from sparse univariate polynomial over \\spad{R} to a sparse univariate polynomial over \\spad{S}. Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.")) (|map| (((|NewSparseUnivariatePolynomial| |#2|) (|Mapping| |#2| |#1|) (|NewSparseUnivariatePolynomial| |#1|)) "\\axiom{map(func,{} poly)} creates a new polynomial by applying func to every non-zero coefficient of the polynomial poly."))) NIL @@ -2806,7 +2806,7 @@ NIL ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-719 R E V P) ((|constructor| (NIL "The category of normalized triangular sets. A triangular set \\spad{ts} is said normalized if for every algebraic variable \\spad{v} of \\spad{ts} the polynomial \\spad{select(ts,{}v)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. every polynomial in \\spad{collectUnder(ts,{}v)}. A polynomial \\spad{p} is said normalized \\spad{w}.\\spad{r}.\\spad{t}. a non-constant polynomial \\spad{q} if \\spad{p} is constant or \\spad{degree(p,{}mdeg(q)) = 0} and \\spad{init(p)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. \\spad{q}. One of the important features of normalized triangular sets is that they are regular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[3] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of AAECC11} \\indented{5}{Paris,{} 1995.} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.}"))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-720 S) ((|constructor| (NIL "Numeric provides real and complex numerical evaluation functions for various symbolic types.")) (|numericIfCan| (((|Union| (|Float|) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Expression| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numericIfCan(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.")) (|complexNumericIfCan| (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not constant.")) (|complexNumeric| (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x}") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Complex| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Complex| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) |#1| (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) |#1|) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.")) (|numeric| (((|Float|) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numeric(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Expression| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numeric(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Fraction| (|Polynomial| |#1|))) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numeric(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Polynomial| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) |#1| (|PositiveInteger|)) "\\spad{numeric(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) |#1|) "\\spad{numeric(x)} returns a real approximation of \\spad{x}."))) @@ -2932,7 +2932,7 @@ NIL ((|constructor| (NIL "\\spad{ODETools} provides tools for the linear ODE solver.")) (|particularSolution| (((|Union| |#1| "failed") |#2| |#1| (|List| |#1|) (|Mapping| |#1| |#1|)) "\\spad{particularSolution(op,{} g,{} [f1,{}...,{}fm],{} I)} returns a particular solution \\spad{h} of the equation \\spad{op y = g} where \\spad{[f1,{}...,{}fm]} are linearly independent and \\spad{op(\\spad{fi})=0}. The value \"failed\" is returned if no particular solution is found. Note: the method of variations of parameters is used.")) (|variationOfParameters| (((|Union| (|Vector| |#1|) "failed") |#2| |#1| (|List| |#1|)) "\\spad{variationOfParameters(op,{} g,{} [f1,{}...,{}fm])} returns \\spad{[u1,{}...,{}um]} such that a particular solution of the equation \\spad{op y = g} is \\spad{f1 int(u1) + ... + fm int(um)} where \\spad{[f1,{}...,{}fm]} are linearly independent and \\spad{op(\\spad{fi})=0}. The value \"failed\" is returned if \\spad{m < n} and no particular solution is found.")) (|wronskianMatrix| (((|Matrix| |#1|) (|List| |#1|) (|NonNegativeInteger|)) "\\spad{wronskianMatrix([f1,{}...,{}fn],{} q,{} D)} returns the \\spad{q x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),{}...,{}fn^(i-1)]}.") (((|Matrix| |#1|) (|List| |#1|)) "\\spad{wronskianMatrix([f1,{}...,{}fn])} returns the \\spad{n x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),{}...,{}fn^(i-1)]}."))) NIL NIL -(-751 -2621 S |f|) +(-751 -2615 S |f|) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The ordering on the type is determined by its third argument which represents the less than function on vectors. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4223 |has| |#2| (-969)) (-4224 |has| |#2| (-969)) (-4226 |has| |#2| (-6 -4226)) ((-4231 "*") |has| |#2| (-157)) (-4229 . T)) ((|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (-3700 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-336)))) (-3700 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-209))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| (-520) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (|HasCategory| |#2| (QUOTE (-662))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-3700 (|HasCategory| |#2| (QUOTE (-969))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasAttribute| |#2| (QUOTE -4226)) (|HasCategory| |#2| (QUOTE (-124))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (|HasCategory| |#2| (QUOTE (-25))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3700 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-969)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-209)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-341)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-728)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012))))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-3700 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-341))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-728))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (-12 (|HasCategory| |#2| (LIST (QUOTE -960) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-209))) (|HasCategory| |#2| (QUOTE (-969)))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083))))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) @@ -2994,7 +2994,7 @@ NIL NIL (-766 S) ((|constructor| (NIL "to become an in order iterator")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest entry in the multiset aggregate \\spad{u}."))) -((-4229 . T) (-4219 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4219 . T) (-4230 . T) (-2046 . T)) NIL (-767) ((|constructor| (NIL "\\spadtype{OpenMathServerPackage} provides the necessary operations to run AXIOM as an OpenMath server,{} reading/writing objects to/from a port. Please note the facilities available here are very basic. The idea is that a user calls \\spadignore{e.g.} \\axiom{Omserve(4000,{}60)} and then another process sends OpenMath objects to port 4000 and reads the result.")) (|OMserve| (((|Void|) (|SingleInteger|) (|SingleInteger|)) "\\spad{OMserve(portnum,{}timeout)} puts AXIOM into server mode on port number \\axiom{\\spad{portnum}}. The parameter \\axiom{\\spad{timeout}} specifies the \\spad{timeout} period for the connection.")) (|OMsend| (((|Void|) (|OpenMathConnection|) (|Any|)) "\\spad{OMsend(c,{}u)} attempts to output \\axiom{\\spad{u}} on \\aciom{\\spad{c}} in OpenMath.")) (|OMreceive| (((|Any|) (|OpenMathConnection|)) "\\spad{OMreceive(c)} reads an OpenMath object from connection \\axiom{\\spad{c}} and returns the appropriate AXIOM object."))) @@ -3040,7 +3040,7 @@ NIL ((|constructor| (NIL "Ordered finite sets."))) NIL NIL -(-778 -2621 S) +(-778 -2615 S) ((|constructor| (NIL "\\indented{3}{This package provides ordering functions on vectors which} are suitable parameters for OrderedDirectProduct.")) (|reverseLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{reverseLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by the reverse lexicographic ordering.")) (|totalLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{totalLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by lexicographic ordering.")) (|pureLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{pureLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the lexicographic ordering."))) NIL NIL @@ -3191,7 +3191,7 @@ NIL (-815 |Base| |Subject| |Pat|) ((|constructor| (NIL "This package provides the top-level pattern macthing functions.")) (|Is| (((|PatternMatchResult| |#1| |#2|) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a match of the form \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty match if \\spad{expr} is exactly equal to pat. returns a \\spadfun{failed} match if pat does not match \\spad{expr}.") (((|List| (|Equation| (|Polynomial| |#2|))) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|List| (|Equation| |#2|)) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|PatternMatchListResult| |#1| |#2| (|List| |#2|)) (|List| |#2|) |#3|) "\\spad{Is([e1,{}...,{}en],{} pat)} matches the pattern pat on the list of expressions \\spad{[e1,{}...,{}en]} and returns the result.")) (|is?| (((|Boolean|) (|List| |#2|) |#3|) "\\spad{is?([e1,{}...,{}en],{} pat)} tests if the list of expressions \\spad{[e1,{}...,{}en]} matches the pattern pat.") (((|Boolean|) |#2| |#3|) "\\spad{is?(expr,{} pat)} tests if the expression \\spad{expr} matches the pattern pat."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))) (-12 (-2415 (|HasCategory| |#2| (QUOTE (-969)))) (-2415 (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (-2415 (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083))))))) +((|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))) (-12 (-2399 (|HasCategory| |#2| (QUOTE (-969)))) (-2399 (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))))) (-12 (|HasCategory| |#2| (QUOTE (-969))) (-2399 (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083))))))) (-816 R A B) ((|constructor| (NIL "Lifts maps to pattern matching results.")) (|map| (((|PatternMatchResult| |#1| |#3|) (|Mapping| |#3| |#2|) (|PatternMatchResult| |#1| |#2|)) "\\spad{map(f,{} [(v1,{}a1),{}...,{}(vn,{}an)])} returns the matching result [(\\spad{v1},{}\\spad{f}(a1)),{}...,{}(\\spad{vn},{}\\spad{f}(an))]."))) NIL @@ -3200,7 +3200,7 @@ NIL ((|constructor| (NIL "A PatternMatchResult is an object internally returned by the pattern matcher; It is either a failed match,{} or a list of matches of the form (var,{} expr) meaning that the variable var matches the expression expr.")) (|satisfy?| (((|Union| (|Boolean|) "failed") $ (|Pattern| |#1|)) "\\spad{satisfy?(r,{} p)} returns \\spad{true} if the matches satisfy the top-level predicate of \\spad{p},{} \\spad{false} if they don\\spad{'t},{} and \"failed\" if not enough variables of \\spad{p} are matched in \\spad{r} to decide.")) (|construct| (($ (|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|)))) "\\spad{construct([v1,{}e1],{}...,{}[vn,{}en])} returns the match result containing the matches (\\spad{v1},{}e1),{}...,{}(\\spad{vn},{}en).")) (|destruct| (((|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|))) $) "\\spad{destruct(r)} returns the list of matches (var,{} expr) in \\spad{r}. Error: if \\spad{r} is a failed match.")) (|addMatchRestricted| (($ (|Pattern| |#1|) |#2| $ |#2|) "\\spad{addMatchRestricted(var,{} expr,{} r,{} val)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} that \\spad{var} is not matched to another expression already,{} and that either \\spad{var} is an optional pattern variable or that \\spad{expr} is not equal to val (usually an identity).")) (|insertMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{insertMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} without checking predicates or previous matches for \\spad{var}.")) (|addMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{addMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} and that \\spad{var} is not matched to another expression already.")) (|getMatch| (((|Union| |#2| "failed") (|Pattern| |#1|) $) "\\spad{getMatch(var,{} r)} returns the expression that \\spad{var} matches in the result \\spad{r},{} and \"failed\" if \\spad{var} is not matched in \\spad{r}.")) (|union| (($ $ $) "\\spad{union(a,{} b)} makes the set-union of two match results.")) (|new| (($) "\\spad{new()} returns a new empty match result.")) (|failed| (($) "\\spad{failed()} returns a failed match.")) (|failed?| (((|Boolean|) $) "\\spad{failed?(r)} tests if \\spad{r} is a failed match."))) NIL NIL -(-818 R -2243) +(-818 R -2211) ((|constructor| (NIL "Tools for patterns.")) (|badValues| (((|List| |#2|) (|Pattern| |#1|)) "\\spad{badValues(p)} returns the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (((|Pattern| |#1|) (|Pattern| |#1|) |#2|) "\\spad{addBadValue(p,{} v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|satisfy?| (((|Boolean|) (|List| |#2|) (|Pattern| |#1|)) "\\spad{satisfy?([v1,{}...,{}vn],{} p)} returns \\spad{f(v1,{}...,{}vn)} where \\spad{f} is the top-level predicate attached to \\spad{p}.") (((|Boolean|) |#2| (|Pattern| |#1|)) "\\spad{satisfy?(v,{} p)} returns \\spad{f}(\\spad{v}) where \\spad{f} is the predicate attached to \\spad{p}.")) (|predicate| (((|Mapping| (|Boolean|) |#2|) (|Pattern| |#1|)) "\\spad{predicate(p)} returns the predicate attached to \\spad{p},{} the constant function \\spad{true} if \\spad{p} has no predicates attached to it.")) (|suchThat| (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#2|))) "\\spad{suchThat(p,{} [a1,{}...,{}an],{} f)} returns a copy of \\spad{p} with the top-level predicate set to \\spad{f(a1,{}...,{}an)}.") (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Mapping| (|Boolean|) |#2|))) "\\spad{suchThat(p,{} [f1,{}...,{}fn])} makes a copy of \\spad{p} and adds the predicate \\spad{f1} and ... and \\spad{fn} to the copy,{} which is returned.") (((|Pattern| |#1|) (|Pattern| |#1|) (|Mapping| (|Boolean|) |#2|)) "\\spad{suchThat(p,{} f)} makes a copy of \\spad{p} and adds the predicate \\spad{f} to the copy,{} which is returned."))) NIL NIL @@ -3388,11 +3388,11 @@ NIL ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p,{} pat,{} res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p,{} pat,{} res,{} vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) NIL ((|HasCategory| |#3| (LIST (QUOTE -814) (|devaluate| |#1|)))) -(-865 R -4045 -2243) +(-865 R -4045 -2211) ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| ((|#2| |#2| (|List| (|Mapping| (|Boolean|) |#3|))) "\\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}. Error: if \\spad{x} is not a symbol.") ((|#2| |#2| (|Mapping| (|Boolean|) |#3|)) "\\spad{suchThat(x,{} foo)} attaches the predicate foo to \\spad{x}; error if \\spad{x} is not a symbol."))) NIL NIL -(-866 -2243) +(-866 -2211) ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| (((|Expression| (|Integer|)) (|Symbol|) (|List| (|Mapping| (|Boolean|) |#1|))) "\\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}.") (((|Expression| (|Integer|)) (|Symbol|) (|Mapping| (|Boolean|) |#1|)) "\\spad{suchThat(x,{} foo)} attaches the predicate foo to \\spad{x}."))) NIL NIL @@ -3506,7 +3506,7 @@ NIL NIL (-894 S) ((|constructor| (NIL "A priority queue is a bag of items from an ordered set where the item extracted is always the maximum element.")) (|merge!| (($ $ $) "\\spad{merge!(q,{}q1)} destructively changes priority queue \\spad{q} to include the values from priority queue \\spad{q1}.")) (|merge| (($ $ $) "\\spad{merge(q1,{}q2)} returns combines priority queues \\spad{q1} and \\spad{q2} to return a single priority queue \\spad{q}.")) (|max| ((|#1| $) "\\spad{max(q)} returns the maximum element of priority queue \\spad{q}."))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-895 R |polR|) ((|constructor| (NIL "This package contains some functions: \\axiomOpFrom{discriminant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultant}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcd}{PseudoRemainderSequence},{} \\axiomOpFrom{chainSubResultants}{PseudoRemainderSequence},{} \\axiomOpFrom{degreeSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{lastSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultantEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcdEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{semiSubResultantGcdEuclidean1}{PseudoRemainderSequence},{} \\axiomOpFrom{semiSubResultantGcdEuclidean2}{PseudoRemainderSequence},{} etc. This procedures are coming from improvements of the subresultants algorithm. \\indented{2}{Version : 7} \\indented{2}{References : Lionel Ducos \"Optimizations of the subresultant algorithm\"} \\indented{2}{to appear in the Journal of Pure and Applied Algebra.} \\indented{2}{Author : Ducos Lionel \\axiom{Lionel.Ducos@mathlabo.univ-poitiers.\\spad{fr}}}")) (|semiResultantEuclideannaif| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the semi-extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantEuclideannaif| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantnaif| ((|#1| |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|nextsousResultant2| ((|#2| |#2| |#2| |#2| |#1|) "\\axiom{nextsousResultant2(\\spad{P},{} \\spad{Q},{} \\spad{Z},{} \\spad{s})} returns the subresultant \\axiom{\\spad{S_}{\\spad{e}-1}} where \\axiom{\\spad{P} ~ \\spad{S_d},{} \\spad{Q} = \\spad{S_}{\\spad{d}-1},{} \\spad{Z} = S_e,{} \\spad{s} = \\spad{lc}(\\spad{S_d})}")) (|Lazard2| ((|#2| |#2| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard2(\\spad{F},{} \\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{(x/y)\\spad{**}(\\spad{n}-1) * \\spad{F}}")) (|Lazard| ((|#1| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard(\\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{x**n/y**(\\spad{n}-1)}")) (|divide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{divide(\\spad{F},{}\\spad{G})} computes quotient and rest of the exact euclidean division of \\axiom{\\spad{F}} by \\axiom{\\spad{G}}.")) (|pseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{pseudoDivide(\\spad{P},{}\\spad{Q})} computes the pseudoDivide of \\axiom{\\spad{P}} by \\axiom{\\spad{Q}}.")) (|exquo| (((|Vector| |#2|) (|Vector| |#2|) |#1|) "\\axiom{\\spad{v} exquo \\spad{r}} computes the exact quotient of \\axiom{\\spad{v}} by \\axiom{\\spad{r}}")) (* (((|Vector| |#2|) |#1| (|Vector| |#2|)) "\\axiom{\\spad{r} * \\spad{v}} computes the product of \\axiom{\\spad{r}} and \\axiom{\\spad{v}}")) (|gcd| ((|#2| |#2| |#2|) "\\axiom{\\spad{gcd}(\\spad{P},{} \\spad{Q})} returns the \\spad{gcd} of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiResultantReduitEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{semiResultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduitEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{resultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{coef1*P + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduit| ((|#1| |#2| |#2|) "\\axiom{resultantReduit(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|schema| (((|List| (|NonNegativeInteger|)) |#2| |#2|) "\\axiom{schema(\\spad{P},{}\\spad{Q})} returns the list of degrees of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|chainSubResultants| (((|List| |#2|) |#2| |#2|) "\\axiom{chainSubResultants(\\spad{P},{} \\spad{Q})} computes the list of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiDiscriminantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{...\\spad{P} + coef2 * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|discriminantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{coef1 * \\spad{P} + coef2 * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}.")) (|discriminant| ((|#1| |#2|) "\\axiom{discriminant(\\spad{P},{} \\spad{Q})} returns the discriminant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiSubResultantGcdEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{semiSubResultantGcdEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + ? \\spad{Q} = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|semiSubResultantGcdEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{semiSubResultantGcdEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|subResultantGcdEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{subResultantGcdEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|subResultantGcd| ((|#2| |#2| |#2|) "\\axiom{subResultantGcd(\\spad{P},{} \\spad{Q})} returns the \\spad{gcd} of two primitive polynomials \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiLastSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{semiLastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{S}}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|lastSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{lastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{coef1*P + coef2*Q = \\spad{S}}.")) (|lastSubResultant| ((|#2| |#2| |#2|) "\\axiom{lastSubResultant(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}")) (|semiDegreeSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|degreeSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i}.")) (|degreeSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{degreeSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{d})} computes a subresultant of degree \\axiom{\\spad{d}}.")) (|semiIndiceSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{semiIndiceSubResultantEuclidean(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i(\\spad{P},{}\\spad{Q})} Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|indiceSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i(\\spad{P},{}\\spad{Q})}")) (|indiceSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant of indice \\axiom{\\spad{i}}")) (|semiResultantEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{semiResultantEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1.\\spad{P} + ? \\spad{Q} = resultant(\\spad{P},{}\\spad{Q})}.")) (|semiResultantEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{semiResultantEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|resultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}")) (|resultant| ((|#1| |#2| |#2|) "\\axiom{resultant(\\spad{P},{} \\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}"))) @@ -3534,7 +3534,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-512)))) (-901 R E |VarSet| P) ((|constructor| (NIL "A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \\spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \\spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.")) (|triangular?| (((|Boolean|) $) "\\axiom{triangular?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} is a triangular set,{} \\spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \\axiom{\\spad{ps}}.")) (|rewriteIdealWithRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that every polynomial in \\axiom{\\spad{lr}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{cs})} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|rewriteIdealWithHeadRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithHeadRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that the leading monomial of every polynomial in \\axiom{\\spad{lr}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{cs})} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|remainder| (((|Record| (|:| |rnum| |#1|) (|:| |polnum| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{remainder(a,{}\\spad{ps})} returns \\axiom{[\\spad{c},{}\\spad{b},{}\\spad{r}]} such that \\axiom{\\spad{b}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ps}},{} \\axiom{r*a - \\spad{c*b}} lies in the ideal generated by \\axiom{\\spad{ps}}. Furthermore,{} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} \\axiom{\\spad{b}} is primitive.")) (|headRemainder| (((|Record| (|:| |num| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{headRemainder(a,{}\\spad{ps})} returns \\axiom{[\\spad{b},{}\\spad{r}]} such that the leading monomial of \\axiom{\\spad{b}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ps}} and \\axiom{r*a - \\spad{b}} lies in the ideal generated by \\axiom{\\spad{ps}}.")) (|roughUnitIdeal?| (((|Boolean|) $) "\\axiom{roughUnitIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} contains some non null element lying in the base ring \\axiom{\\spad{R}}.")) (|roughEqualIdeals?| (((|Boolean|) $ $) "\\axiom{roughEqualIdeals?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that \\axiom{\\spad{ps1}} and \\axiom{\\spad{ps2}} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}} without computing Groebner bases.")) (|roughSubIdeal?| (((|Boolean|) $ $) "\\axiom{roughSubIdeal?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that all polynomials in \\axiom{\\spad{ps1}} lie in the ideal generated by \\axiom{\\spad{ps2}} in \\axiom{\\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}} without computing Groebner bases.")) (|roughBase?| (((|Boolean|) $) "\\axiom{roughBase?(\\spad{ps})} returns \\spad{true} iff for every pair \\axiom{{\\spad{p},{}\\spad{q}}} of polynomials in \\axiom{\\spad{ps}} their leading monomials are relatively prime.")) (|trivialIdeal?| (((|Boolean|) $) "\\axiom{trivialIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} does not contain non-zero elements.")) (|sort| (((|Record| (|:| |under| $) (|:| |floor| $) (|:| |upper| $)) $ |#3|) "\\axiom{sort(\\spad{v},{}\\spad{ps})} returns \\axiom{us,{}\\spad{vs},{}\\spad{ws}} such that \\axiom{us} is \\axiom{collectUnder(\\spad{ps},{}\\spad{v})},{} \\axiom{\\spad{vs}} is \\axiom{collect(\\spad{ps},{}\\spad{v})} and \\axiom{\\spad{ws}} is \\axiom{collectUpper(\\spad{ps},{}\\spad{v})}.")) (|collectUpper| (($ $ |#3|) "\\axiom{collectUpper(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable greater than \\axiom{\\spad{v}}.")) (|collect| (($ $ |#3|) "\\axiom{collect(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with \\axiom{\\spad{v}} as main variable.")) (|collectUnder| (($ $ |#3|) "\\axiom{collectUnder(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable less than \\axiom{\\spad{v}}.")) (|mainVariable?| (((|Boolean|) |#3| $) "\\axiom{mainVariable?(\\spad{v},{}\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ps}}.")) (|mainVariables| (((|List| |#3|) $) "\\axiom{mainVariables(\\spad{ps})} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \\axiom{\\spad{ps}}.")) (|variables| (((|List| |#3|) $) "\\axiom{variables(\\spad{ps})} returns the decreasingly sorted list of the variables which are variables of some polynomial in \\axiom{\\spad{ps}}.")) (|mvar| ((|#3| $) "\\axiom{mvar(\\spad{ps})} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.")) (|retract| (($ (|List| |#4|)) "\\axiom{retract(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{retractIfCan(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise \\axiom{\"failed\"} is returned."))) -((-4229 . T) (-2093 . T)) +((-4229 . T) (-2046 . T)) NIL (-902 R E V P) ((|constructor| (NIL "This package provides modest routines for polynomial system solving. The aim of many of the operations of this package is to remove certain factors in some polynomials in order to avoid unnecessary computations in algorithms involving splitting techniques by partial factorization.")) (|removeIrreducibleRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeIrreducibleRedundantFactors(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{irreducibleFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.")) (|lazyIrreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{lazyIrreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*fm=0},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct. The algorithm tries to avoid factorization into irreducible factors as far as possible and makes previously use of \\spad{gcd} techniques over \\axiom{\\spad{R}}.")) (|irreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*fm=0},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct.")) (|removeRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in every polynomial \\axiom{\\spad{lp}}.")) (|removeRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|removeRoughlyRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|univariatePolynomialsGcds| (((|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{univariatePolynomialsGcds(\\spad{lp},{}opt)} returns the same as \\axiom{univariatePolynomialsGcds(\\spad{lp})} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|)) "\\axiom{univariatePolynomialsGcds(\\spad{lp})} returns \\axiom{\\spad{lg}} where \\axiom{\\spad{lg}} is a list of the gcds of every pair in \\axiom{\\spad{lp}} of univariate polynomials in the same main variable.")) (|squareFreeFactors| (((|List| |#4|) |#4|) "\\axiom{squareFreeFactors(\\spad{p})} returns the square-free factors of \\axiom{\\spad{p}} over \\axiom{\\spad{R}}")) (|rewriteIdealWithQuasiMonicGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteIdealWithQuasiMonicGenerators(\\spad{lp},{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{lq}} and \\axiom{\\spad{lp}} generate the same ideal in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{lq}} has rank not higher than the one of \\axiom{\\spad{lp}}. Moreover,{} \\axiom{\\spad{lq}} is computed by reducing \\axiom{\\spad{lp}} \\spad{w}.\\spad{r}.\\spad{t}. some basic set of the ideal generated by the quasi-monic polynomials in \\axiom{\\spad{lp}}.")) (|rewriteSetByReducingWithParticularGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteSetByReducingWithParticularGenerators(\\spad{lp},{}pred?,{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{lq}} is computed by the following algorithm. Chose a basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-test \\axiom{redOp?} among the polynomials satisfying property \\axiom{pred?},{} if it is empty then leave,{} else reduce the other polynomials by this basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-operation \\axiom{redOp}. Repeat while another basic set with smaller rank can be computed. See code. If \\axiom{pred?} is \\axiom{quasiMonic?} the ideal is unchanged.")) (|crushedSet| (((|List| |#4|) (|List| |#4|)) "\\axiom{crushedSet(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and and \\axiom{\\spad{lq}} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \\axiom{\\spad{lq}}.")) (|roughBasicSet| (((|Union| (|Record| (|:| |bas| (|GeneralTriangularSet| |#1| |#2| |#3| |#4|)) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|)) "\\axiom{roughBasicSet(\\spad{lp})} returns the smallest (with Ritt-Wu ordering) triangular set contained in \\axiom{\\spad{lp}}.")) (|interReduce| (((|List| |#4|) (|List| |#4|)) "\\axiom{interReduce(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and \\axiom{\\spad{lq}} generate the same ideal and no polynomial in \\axiom{\\spad{lq}} is reducuble by the others in the sense of Groebner bases. Since no assumptions are required the result may depend on the ordering the reductions are performed.")) (|removeRoughlyRedundantFactorsInPol| ((|#4| |#4| (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPol(\\spad{p},{}\\spad{lf})} returns the same as removeRoughlyRedundantFactorsInPols([\\spad{p}],{}\\spad{lf},{}\\spad{true})")) (|removeRoughlyRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf},{}opt)} returns the same as \\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. This may involve a lot of exact-quotients computations.")) (|bivariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{bivariatePolynomials(\\spad{lp})} returns \\axiom{\\spad{bps},{}nbps} where \\axiom{\\spad{bps}} is a list of the bivariate polynomials,{} and \\axiom{nbps} are the other ones.")) (|bivariate?| (((|Boolean|) |#4|) "\\axiom{bivariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves two and only two variables.")) (|linearPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{linearPolynomials(\\spad{lp})} returns \\axiom{\\spad{lps},{}nlps} where \\axiom{\\spad{lps}} is a list of the linear polynomials in \\spad{lp},{} and \\axiom{nlps} are the other ones.")) (|linear?| (((|Boolean|) |#4|) "\\axiom{linear?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} does not lie in the base ring \\axiom{\\spad{R}} and has main degree \\axiom{1}.")) (|univariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{univariatePolynomials(\\spad{lp})} returns \\axiom{ups,{}nups} where \\axiom{ups} is a list of the univariate polynomials,{} and \\axiom{nups} are the other ones.")) (|univariate?| (((|Boolean|) |#4|) "\\axiom{univariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves one and only one variable.")) (|quasiMonicPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{quasiMonicPolynomials(\\spad{lp})} returns \\axiom{qmps,{}nqmps} where \\axiom{qmps} is a list of the quasi-monic polynomials in \\axiom{\\spad{lp}} and \\axiom{nqmps} are the other ones.")) (|selectAndPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectAndPolynomials(lpred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for every \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectOrPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectOrPolynomials(lpred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for some \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|Mapping| (|Boolean|) |#4|) (|List| |#4|)) "\\axiom{selectPolynomials(pred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds and \\axiom{\\spad{bps}} are the other ones.")) (|probablyZeroDim?| (((|Boolean|) (|List| |#4|)) "\\axiom{probablyZeroDim?(\\spad{lp})} returns \\spad{true} iff the number of polynomials in \\axiom{\\spad{lp}} is not smaller than the number of variables occurring in these polynomials.")) (|possiblyNewVariety?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\axiom{possiblyNewVariety?(newlp,{}\\spad{llp})} returns \\spad{true} iff for every \\axiom{\\spad{lp}} in \\axiom{\\spad{llp}} certainlySubVariety?(newlp,{}\\spad{lp}) does not hold.")) (|certainlySubVariety?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{certainlySubVariety?(newlp,{}\\spad{lp})} returns \\spad{true} iff for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}} the remainder of \\axiom{\\spad{p}} by \\axiom{newlp} using the division algorithm of Groebner techniques is zero.")) (|unprotectedRemoveRedundantFactors| (((|List| |#4|) |#4| |#4|) "\\axiom{unprotectedRemoveRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} but does assume that neither \\axiom{\\spad{p}} nor \\axiom{\\spad{q}} lie in the base ring \\axiom{\\spad{R}} and assumes that \\axiom{infRittWu?(\\spad{p},{}\\spad{q})} holds. Moreover,{} if \\axiom{\\spad{R}} is \\spad{gcd}-domain,{} then \\axiom{\\spad{p}} and \\axiom{\\spad{q}} are assumed to be square free.")) (|removeSquaresIfCan| (((|List| |#4|) (|List| |#4|)) "\\axiom{removeSquaresIfCan(\\spad{lp})} returns \\axiom{removeDuplicates [squareFreePart(\\spad{p})\\$\\spad{P} for \\spad{p} in \\spad{lp}]} if \\axiom{\\spad{R}} is \\spad{gcd}-domain else returns \\axiom{\\spad{lp}}.")) (|removeRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Mapping| (|List| |#4|) (|List| |#4|))) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq},{}remOp)} returns the same as \\axiom{concat(remOp(removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lq})),{}\\spad{lq})} assuming that \\axiom{remOp(\\spad{lq})} returns \\axiom{\\spad{lq}} up to similarity.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{removeRedundantFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.") (((|List| |#4|) (|List| |#4|) |#4|) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(cons(\\spad{q},{}\\spad{lp}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.") (((|List| |#4|) |#4| |#4|) "\\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors([\\spad{p},{}\\spad{q}])}") (((|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lq}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lq} = [\\spad{q1},{}...,{}\\spad{qm}]} then the product \\axiom{p1*p2*...\\spad{*pn}} vanishes iff the product \\axiom{q1*q2*...\\spad{*qm}} vanishes,{} and the product of degrees of the \\axiom{\\spad{qi}} is not greater than the one of the \\axiom{\\spad{pj}},{} and no polynomial in \\axiom{\\spad{lq}} divides another polynomial in \\axiom{\\spad{lq}}. In particular,{} polynomials lying in the base ring \\axiom{\\spad{R}} are removed. Moreover,{} \\axiom{\\spad{lq}} is sorted \\spad{w}.\\spad{r}.\\spad{t} \\axiom{infRittWu?}. Furthermore,{} if \\spad{R} is \\spad{gcd}-domain,{} the polynomials in \\axiom{\\spad{lq}} are pairwise without common non trivial factor."))) @@ -3550,7 +3550,7 @@ NIL NIL (-905 R) ((|constructor| (NIL "PointCategory is the category of points in space which may be plotted via the graphics facilities. Functions are provided for defining points and handling elements of points.")) (|extend| (($ $ (|List| |#1|)) "\\spad{extend(x,{}l,{}r)} \\undocumented")) (|cross| (($ $ $) "\\spad{cross(p,{}q)} computes the cross product of the two points \\spad{p} and \\spad{q}. Error if the \\spad{p} and \\spad{q} are not 3 dimensional")) (|convert| (($ (|List| |#1|)) "\\spad{convert(l)} takes a list of elements,{} \\spad{l},{} from the domain Ring and returns the form of point category.")) (|dimension| (((|PositiveInteger|) $) "\\spad{dimension(s)} returns the dimension of the point category \\spad{s}.")) (|point| (($ (|List| |#1|)) "\\spad{point(l)} returns a point category defined by a list \\spad{l} of elements from the domain \\spad{R}."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-906 R1 R2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|Point| |#2|) (|Mapping| |#2| |#1|) (|Point| |#1|)) "\\spad{map(f,{}p)} \\undocumented"))) @@ -3598,7 +3598,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-505))) (|HasCategory| |#2| (QUOTE (-281))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#2| (QUOTE (-945))) (|HasCategory| |#2| (QUOTE (-756))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#2| (QUOTE (-1059)))) (-917 S) ((|constructor| (NIL "QuotientField(\\spad{S}) is the category of fractions of an Integral Domain \\spad{S}.")) (|floor| ((|#1| $) "\\spad{floor(x)} returns the largest integral element below \\spad{x}.")) (|ceiling| ((|#1| $) "\\spad{ceiling(x)} returns the smallest integral element above \\spad{x}.")) (|random| (($) "\\spad{random()} returns a random fraction.")) (|fractionPart| (($ $) "\\spad{fractionPart(x)} returns the fractional part of \\spad{x}. \\spad{x} = wholePart(\\spad{x}) + fractionPart(\\spad{x})")) (|wholePart| ((|#1| $) "\\spad{wholePart(x)} returns the whole part of the fraction \\spad{x} \\spadignore{i.e.} the truncated quotient of the numerator by the denominator.")) (|denominator| (($ $) "\\spad{denominator(x)} is the denominator of the fraction \\spad{x} converted to \\%.")) (|numerator| (($ $) "\\spad{numerator(x)} is the numerator of the fraction \\spad{x} converted to \\%.")) (|denom| ((|#1| $) "\\spad{denom(x)} returns the denominator of the fraction \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer(x)} returns the numerator of the fraction \\spad{x}.")) (/ (($ |#1| |#1|) "\\spad{d1 / d2} returns the fraction \\spad{d1} divided by \\spad{d2}."))) -((-2093 . T) (-4221 . T) (-4227 . T) (-4222 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) +((-2046 . T) (-4221 . T) (-4227 . T) (-4222 . T) ((-4231 "*") . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL (-918 |n| K) ((|constructor| (NIL "This domain provides modest support for quadratic forms.")) (|elt| ((|#2| $ (|DirectProduct| |#1| |#2|)) "\\spad{elt(qf,{}v)} evaluates the quadratic form \\spad{qf} on the vector \\spad{v},{} producing a scalar.")) (|matrix| (((|SquareMatrix| |#1| |#2|) $) "\\spad{matrix(qf)} creates a square matrix from the quadratic form \\spad{qf}.")) (|quadraticForm| (($ (|SquareMatrix| |#1| |#2|)) "\\spad{quadraticForm(m)} creates a quadratic form from a symmetric,{} square matrix \\spad{m}."))) @@ -3606,7 +3606,7 @@ NIL NIL (-919 S) ((|constructor| (NIL "A queue is a bag where the first item inserted is the first item extracted.")) (|back| ((|#1| $) "\\spad{back(q)} returns the element at the back of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|front| ((|#1| $) "\\spad{front(q)} returns the element at the front of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(q)} returns the number of elements in the queue. Note: \\axiom{length(\\spad{q}) = \\spad{#q}}.")) (|rotate!| (($ $) "\\spad{rotate! q} rotates queue \\spad{q} so that the element at the front of the queue goes to the back of the queue. Note: rotate! \\spad{q} is equivalent to enqueue!(dequeue!(\\spad{q})).")) (|dequeue!| ((|#1| $) "\\spad{dequeue! s} destructively extracts the first (top) element from queue \\spad{q}. The element previously second in the queue becomes the first element. Error: if \\spad{q} is empty.")) (|enqueue!| ((|#1| |#1| $) "\\spad{enqueue!(x,{}q)} inserts \\spad{x} into the queue \\spad{q} at the back end."))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-920 S R) ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#2| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#2| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#2| |#2| |#2| |#2|) "\\spad{quatern(r,{}i,{}j,{}k)} constructs a quaternion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#2| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#2| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) @@ -3666,7 +3666,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-1012)))) (-934 S) ((|constructor| (NIL "A recursive aggregate over a type \\spad{S} is a model for a a directed graph containing values of type \\spad{S}. Recursively,{} a recursive aggregate is a {\\em node} consisting of a \\spadfun{value} from \\spad{S} and 0 or more \\spadfun{children} which are recursive aggregates. A node with no children is called a \\spadfun{leaf} node. A recursive aggregate may be cyclic for which some operations as noted may go into an infinite loop.")) (|setvalue!| ((|#1| $ |#1|) "\\spad{setvalue!(u,{}x)} sets the value of node \\spad{u} to \\spad{x}.")) (|setelt| ((|#1| $ "value" |#1|) "\\spad{setelt(a,{}\"value\",{}x)} (also written \\axiom{a . value \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setvalue!(a,{}\\spad{x})}")) (|setchildren!| (($ $ (|List| $)) "\\spad{setchildren!(u,{}v)} replaces the current children of node \\spad{u} with the members of \\spad{v} in left-to-right order.")) (|node?| (((|Boolean|) $ $) "\\spad{node?(u,{}v)} tests if node \\spad{u} is contained in node \\spad{v} (either as a child,{} a child of a child,{} etc.).")) (|child?| (((|Boolean|) $ $) "\\spad{child?(u,{}v)} tests if node \\spad{u} is a child of node \\spad{v}.")) (|distance| (((|Integer|) $ $) "\\spad{distance(u,{}v)} returns the path length (an integer) from node \\spad{u} to \\spad{v}.")) (|leaves| (((|List| |#1|) $) "\\spad{leaves(t)} returns the list of values in obtained by visiting the nodes of tree \\axiom{\\spad{t}} in left-to-right order.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(u)} tests if \\spad{u} has a cycle.")) (|elt| ((|#1| $ "value") "\\spad{elt(u,{}\"value\")} (also written: \\axiom{a. value}) is equivalent to \\axiom{value(a)}.")) (|value| ((|#1| $) "\\spad{value(u)} returns the value of the node \\spad{u}.")) (|leaf?| (((|Boolean|) $) "\\spad{leaf?(u)} tests if \\spad{u} is a terminal node.")) (|nodes| (((|List| $) $) "\\spad{nodes(u)} returns a list of all of the nodes of aggregate \\spad{u}.")) (|children| (((|List| $) $) "\\spad{children(u)} returns a list of the children of aggregate \\spad{u}."))) -((-2093 . T)) +((-2046 . T)) NIL (-935 S) ((|constructor| (NIL "\\axiomType{RealClosedField} provides common acces functions for all real closed fields.")) (|approximate| (((|Fraction| (|Integer|)) $ $) "\\axiom{approximate(\\spad{n},{}\\spad{p})} gives an approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|rename| (($ $ (|OutputForm|)) "\\axiom{rename(\\spad{x},{}name)} gives a new number that prints as name")) (|rename!| (($ $ (|OutputForm|)) "\\axiom{rename!(\\spad{x},{}name)} changes the way \\axiom{\\spad{x}} is printed")) (|sqrt| (($ (|Integer|)) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $ (|NonNegativeInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} \\spad{**} (1/n)}")) (|allRootsOf| (((|List| $) (|Polynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely")) (|rootOf| (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} creates the \\spad{n}th root for the order of \\axiom{pol} and gives it unique name") (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|) (|OutputForm|)) "\\axiom{rootOf(pol,{}\\spad{n},{}name)} creates the \\spad{n}th root for the order of \\axiom{pol} and names it \\axiom{name}")) (|mainValue| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainValue(\\spad{x})} is the expression of \\axiom{\\spad{x}} in terms of \\axiom{SparseUnivariatePolynomial(\\$)}")) (|mainDefiningPolynomial| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainDefiningPolynomial(\\spad{x})} is the defining polynomial for the main algebraic quantity of \\axiom{\\spad{x}}")) (|mainForm| (((|Union| (|OutputForm|) "failed") $) "\\axiom{mainForm(\\spad{x})} is the main algebraic quantity name of \\axiom{\\spad{x}}"))) @@ -3763,7 +3763,7 @@ NIL (-958) ((|constructor| (NIL "A domain used to return the results from a call to the NAG Library. It prints as a list of names and types,{} though the user may choose to display values automatically if he or she wishes.")) (|showArrayValues| (((|Boolean|) (|Boolean|)) "\\spad{showArrayValues(true)} forces the values of array components to be \\indented{1}{displayed rather than just their types.}")) (|showScalarValues| (((|Boolean|) (|Boolean|)) "\\spad{showScalarValues(true)} forces the values of scalar components to be \\indented{1}{displayed rather than just their types.}"))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (QUOTE (-1083))) (LIST (QUOTE |:|) (QUOTE -3049) (QUOTE (-51))))))) (|HasCategory| (-1083) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (QUOTE (-1083))) (LIST (QUOTE |:|) (QUOTE -3043) (QUOTE (-51))))))) (|HasCategory| (-1083) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) (-959 A S) ((|constructor| (NIL "A is retractable to \\spad{B} means that some elementsif A can be converted into elements of \\spad{B} and any element of \\spad{B} can be converted into an element of A.")) (|retract| ((|#2| $) "\\spad{retract(a)} transforms a into an element of \\spad{S} if possible. Error: if a cannot be made into an element of \\spad{S}.")) (|retractIfCan| (((|Union| |#2| "failed") $) "\\spad{retractIfCan(a)} transforms a into an element of \\spad{S} if possible. Returns \"failed\" if a cannot be made into an element of \\spad{S}.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} transforms a into an element of \\%."))) NIL @@ -3818,7 +3818,7 @@ NIL ((|HasCategory| |#4| (QUOTE (-281))) (|HasCategory| |#4| (QUOTE (-336))) (|HasCategory| |#4| (QUOTE (-512))) (|HasCategory| |#4| (QUOTE (-157)))) (-972 |m| |n| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{RectangularMatrixCategory} is a category of matrices of fixed dimensions. The dimensions of the matrix will be parameters of the domain. Domains in this category will be \\spad{R}-modules and will be non-mutable.")) (|nullSpace| (((|List| |#5|) $) "\\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#3|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#3|) "\\spad{exquo(m,{}r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (|map| (($ (|Mapping| |#3| |#3| |#3|) $ $) "\\spad{map(f,{}a,{}b)} returns \\spad{c},{} where \\spad{c} is such that \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} for all \\spad{i},{} \\spad{j}.") (($ (|Mapping| |#3| |#3|) $) "\\spad{map(f,{}a)} returns \\spad{b},{} where \\spad{b(i,{}j) = a(i,{}j)} for all \\spad{i},{} \\spad{j}.")) (|column| ((|#5| $ (|Integer|)) "\\spad{column(m,{}j)} returns the \\spad{j}th column of the matrix \\spad{m}. Error: if the index outside the proper range.")) (|row| ((|#4| $ (|Integer|)) "\\spad{row(m,{}i)} returns the \\spad{i}th row of the matrix \\spad{m}. Error: if the index is outside the proper range.")) (|qelt| ((|#3| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Note: there is NO error check to determine if indices are in the proper ranges.")) (|elt| ((|#3| $ (|Integer|) (|Integer|) |#3|) "\\spad{elt(m,{}i,{}j,{}r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Error: if indices are outside the proper ranges.")) (|listOfLists| (((|List| (|List| |#3|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the matrix \\spad{m}.")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the matrix \\spad{m}.")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \\spad{m}.")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \\spad{m}.")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \\spad{m}.")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \\spad{m}.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = -m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|matrix| (($ (|List| (|List| |#3|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|finiteAggregate| ((|attribute|) "matrices are finite"))) -((-4229 . T) (-2093 . T) (-4224 . T) (-4223 . T)) +((-4229 . T) (-2046 . T) (-4224 . T) (-4223 . T)) NIL (-973 |m| |n| R) ((|constructor| (NIL "\\spadtype{RectangularMatrix} is a matrix domain where the number of rows and the number of columns are parameters of the domain.")) (|coerce| (((|Matrix| |#3|) $) "\\spad{coerce(m)} converts a matrix of type \\spadtype{RectangularMatrix} to a matrix of type \\spad{Matrix}.")) (|rectangularMatrix| (($ (|Matrix| |#3|)) "\\spad{rectangularMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spad{RectangularMatrix}."))) @@ -3855,7 +3855,7 @@ NIL (-981) ((|constructor| (NIL "\\axiomType{RoutinesTable} implements a database and associated tuning mechanisms for a set of known NAG routines")) (|recoverAfterFail| (((|Union| (|String|) "failed") $ (|String|) (|Integer|)) "\\spad{recoverAfterFail(routs,{}routineName,{}ifailValue)} acts on the instructions given by the ifail list")) (|showTheRoutinesTable| (($) "\\spad{showTheRoutinesTable()} returns the current table of NAG routines.")) (|deleteRoutine!| (($ $ (|Symbol|)) "\\spad{deleteRoutine!(R,{}s)} destructively deletes the given routine from the current database of NAG routines")) (|getExplanations| (((|List| (|String|)) $ (|String|)) "\\spad{getExplanations(R,{}s)} gets the explanations of the output parameters for the given NAG routine.")) (|getMeasure| (((|Float|) $ (|Symbol|)) "\\spad{getMeasure(R,{}s)} gets the current value of the maximum measure for the given NAG routine.")) (|changeMeasure| (($ $ (|Symbol|) (|Float|)) "\\spad{changeMeasure(R,{}s,{}newValue)} changes the maximum value for a measure of the given NAG routine.")) (|changeThreshhold| (($ $ (|Symbol|) (|Float|)) "\\spad{changeThreshhold(R,{}s,{}newValue)} changes the value below which,{} given a NAG routine generating a higher measure,{} the routines will make no attempt to generate a measure.")) (|selectMultiDimensionalRoutines| (($ $) "\\spad{selectMultiDimensionalRoutines(R)} chooses only those routines from the database which are designed for use with multi-dimensional expressions")) (|selectNonFiniteRoutines| (($ $) "\\spad{selectNonFiniteRoutines(R)} chooses only those routines from the database which are designed for use with non-finite expressions.")) (|selectSumOfSquaresRoutines| (($ $) "\\spad{selectSumOfSquaresRoutines(R)} chooses only those routines from the database which are designed for use with sums of squares")) (|selectFiniteRoutines| (($ $) "\\spad{selectFiniteRoutines(R)} chooses only those routines from the database which are designed for use with finite expressions")) (|selectODEIVPRoutines| (($ $) "\\spad{selectODEIVPRoutines(R)} chooses only those routines from the database which are for the solution of ODE\\spad{'s}")) (|selectPDERoutines| (($ $) "\\spad{selectPDERoutines(R)} chooses only those routines from the database which are for the solution of PDE\\spad{'s}")) (|selectOptimizationRoutines| (($ $) "\\spad{selectOptimizationRoutines(R)} chooses only those routines from the database which are for integration")) (|selectIntegrationRoutines| (($ $) "\\spad{selectIntegrationRoutines(R)} chooses only those routines from the database which are for integration")) (|routines| (($) "\\spad{routines()} initialises a database of known NAG routines")) (|concat| (($ $ $) "\\spad{concat(x,{}y)} merges two tables \\spad{x} and \\spad{y}"))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (QUOTE (-1083))) (LIST (QUOTE |:|) (QUOTE -3049) (QUOTE (-51))))))) (|HasCategory| (-1083) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1083)) (|:| -3049 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (QUOTE (-1083))) (LIST (QUOTE |:|) (QUOTE -3043) (QUOTE (-51))))))) (|HasCategory| (-1083) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-51) (QUOTE (-1012)))) (-12 (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -283) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1012))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1083)) (|:| -3043 (-51))) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -560) (QUOTE (-791)))))) (-982 S R E V) ((|constructor| (NIL "A category for general multi-variate polynomials with coefficients in a ring,{} variables in an ordered set,{} and exponents from an ordered abelian monoid,{} with a \\axiomOp{sup} operation. When not constant,{} such a polynomial is viewed as a univariate polynomial in its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.")) (|mainSquareFreePart| (($ $) "\\axiom{mainSquareFreePart(\\spad{p})} returns the square free part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainPrimitivePart| (($ $) "\\axiom{mainPrimitivePart(\\spad{p})} returns the primitive part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainContent| (($ $) "\\axiom{mainContent(\\spad{p})} returns the content of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|primitivePart!| (($ $) "\\axiom{primitivePart!(\\spad{p})} replaces \\axiom{\\spad{p}} by its primitive part.")) (|gcd| ((|#2| |#2| $) "\\axiom{\\spad{gcd}(\\spad{r},{}\\spad{p})} returns the \\spad{gcd} of \\axiom{\\spad{r}} and the content of \\axiom{\\spad{p}}.")) (|nextsubResultant2| (($ $ $ $ $) "\\axiom{nextsubResultant2(\\spad{p},{}\\spad{q},{}\\spad{z},{}\\spad{s})} is the multivariate version of the operation \\axiomOpFrom{next_sousResultant2}{PseudoRemainderSequence} from the \\axiomType{PseudoRemainderSequence} constructor.")) (|LazardQuotient2| (($ $ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient2(\\spad{p},{}a,{}\\spad{b},{}\\spad{n})} returns \\axiom{(a**(\\spad{n}-1) * \\spad{p}) exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|LazardQuotient| (($ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient(a,{}\\spad{b},{}\\spad{n})} returns \\axiom{a**n exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns the last non-zero subresultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|subResultantChain| (((|List| $) $ $) "\\axiom{subResultantChain(a,{}\\spad{b})},{} where \\axiom{a} and \\axiom{\\spad{b}} are not contant polynomials with the same main variable,{} returns the subresultant chain of \\axiom{a} and \\axiom{\\spad{b}}.")) (|resultant| (($ $ $) "\\axiom{resultant(a,{}\\spad{b})} computes the resultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[ca,{}\\spad{cb},{}\\spad{r}]} such that \\axiom{\\spad{r}} is \\axiom{subResultantGcd(a,{}\\spad{b})} and we have \\axiom{ca * a + \\spad{cb} * \\spad{cb} = \\spad{r}} .")) (|subResultantGcd| (($ $ $) "\\axiom{subResultantGcd(a,{}\\spad{b})} computes a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}} with coefficients in the fraction field of the polynomial ring generated by their other variables over \\axiom{\\spad{R}}.")) (|exactQuotient!| (($ $ $) "\\axiom{exactQuotient!(a,{}\\spad{b})} replaces \\axiom{a} by \\axiom{exactQuotient(a,{}\\spad{b})}") (($ $ |#2|) "\\axiom{exactQuotient!(\\spad{p},{}\\spad{r})} replaces \\axiom{\\spad{p}} by \\axiom{exactQuotient(\\spad{p},{}\\spad{r})}.")) (|exactQuotient| (($ $ $) "\\axiom{exactQuotient(a,{}\\spad{b})} computes the exact quotient of \\axiom{a} by \\axiom{\\spad{b}},{} which is assumed to be a divisor of \\axiom{a}. No error is returned if this exact quotient fails!") (($ $ |#2|) "\\axiom{exactQuotient(\\spad{p},{}\\spad{r})} computes the exact quotient of \\axiom{\\spad{p}} by \\axiom{\\spad{r}},{} which is assumed to be a divisor of \\axiom{\\spad{p}}. No error is returned if this exact quotient fails!")) (|primPartElseUnitCanonical!| (($ $) "\\axiom{primPartElseUnitCanonical!(\\spad{p})} replaces \\axiom{\\spad{p}} by \\axiom{primPartElseUnitCanonical(\\spad{p})}.")) (|primPartElseUnitCanonical| (($ $) "\\axiom{primPartElseUnitCanonical(\\spad{p})} returns \\axiom{primitivePart(\\spad{p})} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} otherwise \\axiom{unitCanonical(\\spad{p})}.")) (|convert| (($ (|Polynomial| |#2|)) "\\axiom{convert(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}},{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.")) (|retract| (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.")) (|initiallyReduce| (($ $ $) "\\axiom{initiallyReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|headReduce| (($ $ $) "\\axiom{headReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| $) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{p},{}\\spad{q},{}\\spad{n}]} where \\axiom{\\spad{p} / q**n} represents the residue class of \\axiom{a} modulo \\axiom{\\spad{b}} and \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{q}} is \\axiom{init(\\spad{b})}.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} computes \\axiom{a mod \\spad{b}},{} if \\axiom{\\spad{b}} is monic as univariate polynomial in its main variable.")) (|pseudoDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{pseudoDivide(a,{}\\spad{b})} computes \\axiom{[pquo(a,{}\\spad{b}),{}prem(a,{}\\spad{b})]},{} both polynomials viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}},{} if \\axiom{\\spad{b}} is not a constant polynomial.")) (|lazyPseudoDivide| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})},{} \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}] = lazyPremWithDefault(a,{}\\spad{b})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.")) (|lazyPremWithDefault| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPremWithDefault(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})}.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $) "\\axiom{lazyPremWithDefault(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b})}.")) (|lazyPquo| (($ $ $ |#4|) "\\axiom{lazyPquo(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.") (($ $ $) "\\axiom{lazyPquo(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.")) (|lazyPrem| (($ $ $ |#4|) "\\axiom{lazyPrem(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} viewed as univariate polynomials in the variable \\axiom{\\spad{v}} such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.") (($ $ $) "\\axiom{lazyPrem(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.")) (|pquo| (($ $ $ |#4|) "\\axiom{pquo(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{pquo(a,{}\\spad{b})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|prem| (($ $ $ |#4|) "\\axiom{prem(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{prem(a,{}\\spad{b})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|normalized?| (((|Boolean|) $ (|List| $)) "\\axiom{normalized?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{normalized?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{normalized?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{a} and its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variable of \\axiom{\\spad{b}}")) (|initiallyReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{initiallyReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{initiallyReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{initiallyReduced?(a,{}\\spad{b})} returns \\spad{false} iff there exists an iterated initial of \\axiom{a} which is not reduced \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{b}}.")) (|headReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{headReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{headReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{headReduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(head(a),{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|reduced?| (((|Boolean|) $ (|List| $)) "\\axiom{reduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{reduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{reduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(a,{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|supRittWu?| (((|Boolean|) $ $) "\\axiom{supRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is greater than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is less than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|RittWuCompare| (((|Union| (|Boolean|) "failed") $ $) "\\axiom{RittWuCompare(a,{}\\spad{b})} returns \\axiom{\"failed\"} if \\axiom{a} and \\axiom{\\spad{b}} have same rank \\spad{w}.\\spad{r}.\\spad{t}. Ritt and Wu Wen Tsun ordering using the refinement of Lazard,{} otherwise returns \\axiom{infRittWu?(a,{}\\spad{b})}.")) (|mainMonomials| (((|List| $) $) "\\axiom{mainMonomials(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [1],{} otherwise returns the list of the monomials of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainCoefficients| (((|List| $) $) "\\axiom{mainCoefficients(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [\\spad{p}],{} otherwise returns the list of the coefficients of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|leastMonomial| (($ $) "\\axiom{leastMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} the monomial of \\axiom{\\spad{p}} with lowest degree,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainMonomial| (($ $) "\\axiom{mainMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} \\axiom{mvar(\\spad{p})} raised to the power \\axiom{mdeg(\\spad{p})}.")) (|quasiMonic?| (((|Boolean|) $) "\\axiom{quasiMonic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff the initial of \\axiom{\\spad{p}} lies in the base ring \\axiom{\\spad{R}}.")) (|monic?| (((|Boolean|) $) "\\axiom{monic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff \\axiom{\\spad{p}} is monic as a univariate polynomial in its main variable.")) (|reductum| (($ $ |#4|) "\\axiom{reductum(\\spad{p},{}\\spad{v})} returns the reductum of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in \\axiom{\\spad{v}}.")) (|leadingCoefficient| (($ $ |#4|) "\\axiom{leadingCoefficient(\\spad{p},{}\\spad{v})} returns the leading coefficient of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as A univariate polynomial in \\axiom{\\spad{v}}.")) (|deepestInitial| (($ $) "\\axiom{deepestInitial(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the last term of \\axiom{iteratedInitials(\\spad{p})}.")) (|iteratedInitials| (((|List| $) $) "\\axiom{iteratedInitials(\\spad{p})} returns \\axiom{[]} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the list of the iterated initials of \\axiom{\\spad{p}}.")) (|deepestTail| (($ $) "\\axiom{deepestTail(\\spad{p})} returns \\axiom{0} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns tail(\\spad{p}),{} if \\axiom{tail(\\spad{p})} belongs to \\axiom{\\spad{R}} or \\axiom{mvar(tail(\\spad{p})) < mvar(\\spad{p})},{} otherwise returns \\axiom{deepestTail(tail(\\spad{p}))}.")) (|tail| (($ $) "\\axiom{tail(\\spad{p})} returns its reductum,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|head| (($ $) "\\axiom{head(\\spad{p})} returns \\axiom{\\spad{p}} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading term (monomial in the AXIOM sense),{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|init| (($ $) "\\axiom{init(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading coefficient,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mdeg| (((|NonNegativeInteger|) $) "\\axiom{mdeg(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{0},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{0},{} otherwise,{} returns the degree of \\axiom{\\spad{p}} in its main variable.")) (|mvar| ((|#4| $) "\\axiom{mvar(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in \\axiom{\\spad{V}}."))) NIL @@ -3882,7 +3882,7 @@ NIL NIL (-988 R E V P) ((|constructor| (NIL "The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \\spad{k[x1,{}...,{}xn]} where \\spad{k} is the fraction field of \\spad{R}. The triangular set \\spad{[t1,{}...,{}tm]} is regular iff for every \\spad{i} the initial of \\spad{ti+1} is invertible in the tower of simple extensions associated with \\spad{[t1,{}...,{}\\spad{ti}]}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \\spad{I} iff the radical of \\spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \\spad{[T1,{}...,{}\\spad{Ti}]}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \\spad{T} iff it is a split of Kalkbrener of the saturated ideal of \\spad{T}. Let \\spad{K} be an algebraic closure of \\spad{k}. Assume that \\spad{V} is finite with cardinality \\spad{n} and let \\spad{A} be the affine space \\spad{K^n}. For a regular triangular set \\spad{T} let denote by \\spad{W(T)} the set of regular zeros of \\spad{T}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Lazard of a given subset \\spad{S} of \\spad{A} iff the union of the \\spad{W(\\spad{Ti})} contains \\spad{S} and is contained in the closure of \\spad{S} (\\spad{w}.\\spad{r}.\\spad{t}. Zariski topology). A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Lazard of a given triangular set \\spad{T} if it is a split of Lazard of \\spad{W(T)}. Note that if \\spad{[T1,{}...,{}Ts]} is a split of Lazard of \\spad{T} then it is also a split of Kalkbrener of \\spad{T}. The converse is \\spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \\newline References : \\indented{1}{[1] \\spad{M}. KALKBRENER \"Three contributions to elimination theory\"} \\indented{5}{\\spad{Phd} Thesis,{} University of Linz,{} Austria,{} 1991.} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Journal of Symbol. Comp. 1998} \\indented{1}{[3] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|)) "\\spad{zeroSetSplit(lp,{}clos?)} returns \\spad{lts} a split of Kalkbrener of the radical ideal associated with \\spad{lp}. If \\spad{clos?} is \\spad{false},{} it is also a decomposition of the variety associated with \\spad{lp} into the regular zero set of the \\spad{ts} in \\spad{lts} (or,{} in other words,{} a split of Lazard of this variety). See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets.")) (|extend| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{extend(lp,{}lts)} returns the same as \\spad{concat([extend(lp,{}ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{extend(lp,{}ts)} returns \\spad{ts} if \\spad{empty? lp} \\spad{extend(p,{}ts)} if \\spad{lp = [p]} else \\spad{extend(first lp,{} extend(rest lp,{} ts))}") (((|List| $) |#4| (|List| $)) "\\spad{extend(p,{}lts)} returns the same as \\spad{concat([extend(p,{}ts) for ts in lts])|}") (((|List| $) |#4| $) "\\spad{extend(p,{}ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is not a regular triangular set.")) (|internalAugment| (($ (|List| |#4|) $) "\\spad{internalAugment(lp,{}ts)} returns \\spad{ts} if \\spad{lp} is empty otherwise returns \\spad{internalAugment(rest lp,{} internalAugment(first lp,{} ts))}") (($ |#4| $) "\\spad{internalAugment(p,{}ts)} assumes that \\spad{augment(p,{}ts)} returns a singleton and returns it.")) (|augment| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{augment(lp,{}lts)} returns the same as \\spad{concat([augment(lp,{}ts) for ts in lts])}") (((|List| $) (|List| |#4|) $) "\\spad{augment(lp,{}ts)} returns \\spad{ts} if \\spad{empty? lp},{} \\spad{augment(p,{}ts)} if \\spad{lp = [p]},{} otherwise \\spad{augment(first lp,{} augment(rest lp,{} ts))}") (((|List| $) |#4| (|List| $)) "\\spad{augment(p,{}lts)} returns the same as \\spad{concat([augment(p,{}ts) for ts in lts])}") (((|List| $) |#4| $) "\\spad{augment(p,{}ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. This operation assumes also that if \\spad{p} is added to \\spad{ts} the resulting set,{} say \\spad{ts+p},{} is a regular triangular set. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is required to be square-free.")) (|intersect| (((|List| $) |#4| (|List| $)) "\\spad{intersect(p,{}lts)} returns the same as \\spad{intersect([p],{}lts)}") (((|List| $) (|List| |#4|) (|List| $)) "\\spad{intersect(lp,{}lts)} returns the same as \\spad{concat([intersect(lp,{}ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{intersect(lp,{}ts)} returns \\spad{lts} a split of Lazard of the intersection of the affine variety associated with \\spad{lp} and the regular zero set of \\spad{ts}.") (((|List| $) |#4| $) "\\spad{intersect(p,{}ts)} returns the same as \\spad{intersect([p],{}ts)}")) (|squareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| $) "\\spad{squareFreePart(p,{}ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a square-free polynomial \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} this polynomial being associated with \\spad{p} modulo \\spad{lpwt.i.tower},{} for every \\spad{i}. Moreover,{} the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. WARNING: This assumes that \\spad{p} is a non-constant polynomial such that if \\spad{p} is added to \\spad{ts},{} then the resulting set is a regular triangular set.")) (|lastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| |#4| $) "\\spad{lastSubResultant(p1,{}p2,{}ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a quasi-monic \\spad{gcd} of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} for every \\spad{i},{} and such that the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. Moreover,{} if \\spad{p1} and \\spad{p2} do not have a non-trivial \\spad{gcd} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower} then \\spad{lpwt.i.val} is the resultant of these polynomials \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|lastSubResultantElseSplit| (((|Union| |#4| (|List| $)) |#4| |#4| $) "\\spad{lastSubResultantElseSplit(p1,{}p2,{}ts)} returns either \\spad{g} a quasi-monic \\spad{gcd} of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. the \\spad{ts} or a split of Kalkbrener of \\spad{ts}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|invertibleSet| (((|List| $) |#4| $) "\\spad{invertibleSet(p,{}ts)} returns a split of Kalkbrener of the quotient ideal of the ideal \\axiom{\\spad{I}} by \\spad{p} where \\spad{I} is the radical of saturated of \\spad{ts}.")) (|invertible?| (((|Boolean|) |#4| $) "\\spad{invertible?(p,{}ts)} returns \\spad{true} iff \\spad{p} is invertible in the tower associated with \\spad{ts}.") (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| $))) |#4| $) "\\spad{invertible?(p,{}ts)} returns \\spad{lbwt} where \\spad{lbwt.i} is the result of \\spad{invertibleElseSplit?(p,{}lbwt.i.tower)} and the list of the \\spad{(lqrwt.i).tower} is a split of Kalkbrener of \\spad{ts}.")) (|invertibleElseSplit?| (((|Union| (|Boolean|) (|List| $)) |#4| $) "\\spad{invertibleElseSplit?(p,{}ts)} returns \\spad{true} (resp. \\spad{false}) if \\spad{p} is invertible in the tower associated with \\spad{ts} or returns a split of Kalkbrener of \\spad{ts}.")) (|purelyAlgebraicLeadingMonomial?| (((|Boolean|) |#4| $) "\\spad{purelyAlgebraicLeadingMonomial?(p,{}ts)} returns \\spad{true} iff the main variable of any non-constant iterarted initial of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|algebraicCoefficients?| (((|Boolean|) |#4| $) "\\spad{algebraicCoefficients?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} which is not the main one of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|purelyTranscendental?| (((|Boolean|) |#4| $) "\\spad{purelyTranscendental?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} is not algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}")) (|purelyAlgebraic?| (((|Boolean|) $) "\\spad{purelyAlgebraic?(ts)} returns \\spad{true} iff for every algebraic variable \\spad{v} of \\spad{ts} we have \\spad{algebraicCoefficients?(t_v,{}ts_v_-)} where \\spad{ts_v} is \\axiomOpFrom{select}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}) and \\spad{ts_v_-} is \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}).") (((|Boolean|) |#4| $) "\\spad{purelyAlgebraic?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-989 R E V P TS) ((|constructor| (NIL "An internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of AAECC11} \\indented{5}{Paris,{} 1995.} \\indented{1}{[2] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|toseSquareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseSquareFreePart(\\spad{p},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{squareFreePart}{RegularTriangularSetCategory}.")) (|toseInvertibleSet| (((|List| |#5|) |#4| |#5|) "\\axiom{toseInvertibleSet(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertibleSet}{RegularTriangularSetCategory}.")) (|toseInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.") (((|Boolean|) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.")) (|toseLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{toseLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{lastSubResultant}{RegularTriangularSetCategory}.")) (|integralLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{integralLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|internalLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) (|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#3| (|Boolean|)) "\\axiom{internalLastSubResultant(lpwt,{}\\spad{v},{}flag)} is an internal subroutine,{} exported only for developement.") (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5| (|Boolean|) (|Boolean|)) "\\axiom{internalLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts},{}inv?,{}break?)} is an internal subroutine,{} exported only for developement.")) (|prepareSubResAlgo| (((|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{prepareSubResAlgo(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|stopTableInvSet!| (((|Void|)) "\\axiom{stopTableInvSet!()} is an internal subroutine,{} exported only for developement.")) (|startTableInvSet!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableInvSet!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement.")) (|stopTableGcd!| (((|Void|)) "\\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.")) (|startTableGcd!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableGcd!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement."))) @@ -3954,7 +3954,7 @@ NIL ((|HasCategory| |#1| (QUOTE (-1012)))) (-1006 S) ((|constructor| (NIL "This category provides operations on ranges,{} or {\\em segments} as they are called.")) (|convert| (($ |#1|) "\\spad{convert(i)} creates the segment \\spad{i..i}.")) (|segment| (($ |#1| |#1|) "\\spad{segment(i,{}j)} is an alternate way to create the segment \\spad{i..j}.")) (|incr| (((|Integer|) $) "\\spad{incr(s)} returns \\spad{n},{} where \\spad{s} is a segment in which every \\spad{n}\\spad{-}th element is used. Note: \\spad{incr(l..h by n) = n}.")) (|high| ((|#1| $) "\\spad{high(s)} returns the second endpoint of \\spad{s}. Note: \\spad{high(l..h) = h}.")) (|low| ((|#1| $) "\\spad{low(s)} returns the first endpoint of \\spad{s}. Note: \\spad{low(l..h) = l}.")) (|hi| ((|#1| $) "\\spad{\\spad{hi}(s)} returns the second endpoint of \\spad{s}. Note: \\spad{\\spad{hi}(l..h) = h}.")) (|lo| ((|#1| $) "\\spad{lo(s)} returns the first endpoint of \\spad{s}. Note: \\spad{lo(l..h) = l}.")) (BY (($ $ (|Integer|)) "\\spad{s by n} creates a new segment in which only every \\spad{n}\\spad{-}th element is used.")) (SEGMENT (($ |#1| |#1|) "\\spad{l..h} creates a segment with \\spad{l} and \\spad{h} as the endpoints."))) -((-2093 . T)) +((-2046 . T)) NIL (-1007 S) ((|constructor| (NIL "This type is used to specify a range of values from type \\spad{S}."))) @@ -3962,7 +3962,7 @@ NIL ((|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (QUOTE (-1012)))) (-1008 S L) ((|constructor| (NIL "This category provides an interface for expanding segments to a stream of elements.")) (|map| ((|#2| (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}l..h by k)} produces a value of type \\spad{L} by applying \\spad{f} to each of the succesive elements of the segment,{} that is,{} \\spad{[f(l),{} f(l+k),{} ...,{} f(lN)]},{} where \\spad{lN <= h < lN+k}.")) (|expand| ((|#2| $) "\\spad{expand(l..h by k)} creates value of type \\spad{L} with elements \\spad{l,{} l+k,{} ... lN} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand(1..5 by 2) = [1,{}3,{}5]}.") ((|#2| (|List| $)) "\\spad{expand(l)} creates a new value of type \\spad{L} in which each segment \\spad{l..h by k} is replaced with \\spad{l,{} l+k,{} ... lN},{} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand [1..4,{} 7..9] = [1,{}2,{}3,{}4,{}7,{}8,{}9]}."))) -((-2093 . T)) +((-2046 . T)) NIL (-1009 A S) ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#2| $) "\\spad{union(x,{}u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#2|) "\\spad{union(u,{}x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,{}v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,{}v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,{}v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#2|) "\\spad{difference(u,{}x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,{}v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,{}v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#2|)) "\\spad{set([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#2|)) "\\spad{brace([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (< (((|Boolean|) $ $) "\\spad{s < t} returns \\spad{true} if all elements of set aggregate \\spad{s} are also elements of set aggregate \\spad{t}."))) @@ -3970,7 +3970,7 @@ NIL NIL (-1010 S) ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#1| $) "\\spad{union(x,{}u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#1|) "\\spad{union(u,{}x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,{}v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,{}v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,{}v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#1|) "\\spad{difference(u,{}x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,{}v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,{}v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#1|)) "\\spad{set([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#1|)) "\\spad{brace([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (< (((|Boolean|) $ $) "\\spad{s < t} returns \\spad{true} if all elements of set aggregate \\spad{s} are also elements of set aggregate \\spad{t}."))) -((-4219 . T) (-2093 . T)) +((-4219 . T) (-2046 . T)) NIL (-1011 S) ((|constructor| (NIL "\\spadtype{SetCategory} is the basic category for describing a collection of elements with \\spadop{=} (equality) and \\spadfun{coerce} to output form. \\blankline Conditional Attributes: \\indented{3}{canonical\\tab{15}data structure equality is the same as \\spadop{=}}")) (|latex| (((|String|) $) "\\spad{latex(s)} returns a LaTeX-printable output representation of \\spad{s}.")) (|hash| (((|SingleInteger|) $) "\\spad{hash(s)} calculates a hash code for \\spad{s}."))) @@ -4014,7 +4014,7 @@ NIL NIL (-1021 R E V P) ((|constructor| (NIL "The category of square-free regular triangular sets. A regular triangular set \\spad{ts} is square-free if the \\spad{gcd} of any polynomial \\spad{p} in \\spad{ts} and \\spad{differentiate(p,{}mvar(p))} \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\axiomOpFrom{mvar}{RecursivePolynomialCategory}(\\spad{p})) has degree zero \\spad{w}.\\spad{r}.\\spad{t}. \\spad{mvar(p)}. Thus any square-free regular set defines a tower of square-free simple extensions.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Habilitation Thesis,{} ETZH,{} Zurich,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1022) ((|constructor| (NIL "SymmetricGroupCombinatoricFunctions contains combinatoric functions concerning symmetric groups and representation theory: list young tableaus,{} improper partitions,{} subsets bijection of Coleman.")) (|unrankImproperPartitions1| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions1(n,{}m,{}k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in at most \\spad{m} nonnegative parts ordered as follows: first,{} in reverse lexicographically according to their non-zero parts,{} then according to their positions (\\spadignore{i.e.} lexicographical order using {\\em subSet}: {\\em [3,{}0,{}0] < [0,{}3,{}0] < [0,{}0,{}3] < [2,{}1,{}0] < [2,{}0,{}1] < [0,{}2,{}1] < [1,{}2,{}0] < [1,{}0,{}2] < [0,{}1,{}2] < [1,{}1,{}1]}). Note: counting of subtrees is done by {\\em numberOfImproperPartitionsInternal}.")) (|unrankImproperPartitions0| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions0(n,{}m,{}k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in \\spad{m} nonnegative parts in reverse lexicographical order. Example: {\\em [0,{}0,{}3] < [0,{}1,{}2] < [0,{}2,{}1] < [0,{}3,{}0] < [1,{}0,{}2] < [1,{}1,{}1] < [1,{}2,{}0] < [2,{}0,{}1] < [2,{}1,{}0] < [3,{}0,{}0]}. Error: if \\spad{k} is negative or too big. Note: counting of subtrees is done by \\spadfunFrom{numberOfImproperPartitions}{SymmetricGroupCombinatoricFunctions}.")) (|subSet| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subSet(n,{}m,{}k)} calculates the {\\em k}\\spad{-}th {\\em m}-subset of the set {\\em 0,{}1,{}...,{}(n-1)} in the lexicographic order considered as a decreasing map from {\\em 0,{}...,{}(m-1)} into {\\em 0,{}...,{}(n-1)}. See \\spad{S}.\\spad{G}. Williamson: Theorem 1.60. Error: if not {\\em (0 <= m <= n and 0 < = k < (n choose m))}.")) (|numberOfImproperPartitions| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{numberOfImproperPartitions(n,{}m)} computes the number of partitions of the nonnegative integer \\spad{n} in \\spad{m} nonnegative parts with regarding the order (improper partitions). Example: {\\em numberOfImproperPartitions (3,{}3)} is 10,{} since {\\em [0,{}0,{}3],{} [0,{}1,{}2],{} [0,{}2,{}1],{} [0,{}3,{}0],{} [1,{}0,{}2],{} [1,{}1,{}1],{} [1,{}2,{}0],{} [2,{}0,{}1],{} [2,{}1,{}0],{} [3,{}0,{}0]} are the possibilities. Note: this operation has a recursive implementation.")) (|nextPartition| (((|Vector| (|Integer|)) (|List| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,{}part,{}number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. the first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.") (((|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,{}part,{}number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. The first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.")) (|nextLatticePermutation| (((|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Boolean|)) "\\spad{nextLatticePermutation(lambda,{}lattP,{}constructNotFirst)} generates the lattice permutation according to the proper partition {\\em lambda} succeeding the lattice permutation {\\em lattP} in lexicographical order as long as {\\em constructNotFirst} is \\spad{true}. If {\\em constructNotFirst} is \\spad{false},{} the first lattice permutation is returned. The result {\\em nil} indicates that {\\em lattP} has no successor.")) (|nextColeman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{nextColeman(alpha,{}beta,{}C)} generates the next Coleman matrix of column sums {\\em alpha} and row sums {\\em beta} according to the lexicographical order from bottom-to-top. The first Coleman matrix is achieved by {\\em C=new(1,{}1,{}0)}. Also,{} {\\em new(1,{}1,{}0)} indicates that \\spad{C} is the last Coleman matrix.")) (|makeYoungTableau| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{makeYoungTableau(lambda,{}gitter)} computes for a given lattice permutation {\\em gitter} and for an improper partition {\\em lambda} the corresponding standard tableau of shape {\\em lambda}. Notes: see {\\em listYoungTableaus}. The entries are from {\\em 0,{}...,{}n-1}.")) (|listYoungTableaus| (((|List| (|Matrix| (|Integer|))) (|List| (|Integer|))) "\\spad{listYoungTableaus(lambda)} where {\\em lambda} is a proper partition generates the list of all standard tableaus of shape {\\em lambda} by means of lattice permutations. The numbers of the lattice permutation are interpreted as column labels. Hence the contents of these lattice permutations are the conjugate of {\\em lambda}. Notes: the functions {\\em nextLatticePermutation} and {\\em makeYoungTableau} are used. The entries are from {\\em 0,{}...,{}n-1}.")) (|inverseColeman| (((|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{inverseColeman(alpha,{}beta,{}C)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For such a matrix \\spad{C},{} inverseColeman(\\spad{alpha},{}\\spad{beta},{}\\spad{C}) calculates the lexicographical smallest {\\em \\spad{pi}} in the corresponding double coset. Note: the resulting permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}} is given in list form. Notes: the inverse of this map is {\\em coleman}. For details,{} see James/Kerber.")) (|coleman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{coleman(alpha,{}beta,{}\\spad{pi})}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For a representing element {\\em \\spad{pi}} of such a double coset,{} coleman(\\spad{alpha},{}\\spad{beta},{}\\spad{pi}) generates the Coleman-matrix corresponding to {\\em alpha,{} beta,{} \\spad{pi}}. Note: The permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}} has to be given in list form. Note: the inverse of this map is {\\em inverseColeman} (if {\\em \\spad{pi}} is the lexicographical smallest permutation in the coset). For details see James/Kerber."))) @@ -4054,7 +4054,7 @@ NIL NIL (-1031 S) ((|constructor| (NIL "A stack is a bag where the last item inserted is the first item extracted.")) (|depth| (((|NonNegativeInteger|) $) "\\spad{depth(s)} returns the number of elements of stack \\spad{s}. Note: \\axiom{depth(\\spad{s}) = \\spad{#s}}.")) (|top| ((|#1| $) "\\spad{top(s)} returns the top element \\spad{x} from \\spad{s}; \\spad{s} remains unchanged. Note: Use \\axiom{pop!(\\spad{s})} to obtain \\spad{x} and remove it from \\spad{s}.")) (|pop!| ((|#1| $) "\\spad{pop!(s)} returns the top element \\spad{x},{} destructively removing \\spad{x} from \\spad{s}. Note: Use \\axiom{top(\\spad{s})} to obtain \\spad{x} without removing it from \\spad{s}. Error: if \\spad{s} is empty.")) (|push!| ((|#1| |#1| $) "\\spad{push!(x,{}s)} pushes \\spad{x} onto stack \\spad{s},{} \\spadignore{i.e.} destructively changing \\spad{s} so as to have a new first (top) element \\spad{x}. Afterwards,{} pop!(\\spad{s}) produces \\spad{x} and pop!(\\spad{s}) produces the original \\spad{s}."))) -((-4229 . T) (-4230 . T) (-2093 . T)) +((-4229 . T) (-4230 . T) (-2046 . T)) NIL (-1032 S |ndim| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#3| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#3| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#4| |#4| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#5| $ |#5|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#3| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#3| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#4| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#3|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#3|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere."))) @@ -4062,7 +4062,7 @@ NIL ((|HasCategory| |#3| (QUOTE (-336))) (|HasAttribute| |#3| (QUOTE (-4231 "*"))) (|HasCategory| |#3| (QUOTE (-157)))) (-1033 |ndim| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#2| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#2| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#3| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#2|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere."))) -((-2093 . T) (-4229 . T) (-4223 . T) (-4224 . T) (-4226 . T)) +((-2046 . T) (-4229 . T) (-4223 . T) (-4224 . T) (-4226 . T)) NIL (-1034 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{SmithNormalForm} is a package which provides some standard canonical forms for matrices.")) (|diophantineSystem| (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{diophantineSystem(A,{}B)} returns a particular integer solution and an integer basis of the equation \\spad{AX = B}.")) (|completeSmith| (((|Record| (|:| |Smith| |#4|) (|:| |leftEqMat| |#4|) (|:| |rightEqMat| |#4|)) |#4|) "\\spad{completeSmith} returns a record that contains the Smith normal form \\spad{H} of the matrix and the left and right equivalence matrices \\spad{U} and \\spad{V} such that U*m*v = \\spad{H}")) (|smith| ((|#4| |#4|) "\\spad{smith(m)} returns the Smith Normal form of the matrix \\spad{m}.")) (|completeHermite| (((|Record| (|:| |Hermite| |#4|) (|:| |eqMat| |#4|)) |#4|) "\\spad{completeHermite} returns a record that contains the Hermite normal form \\spad{H} of the matrix and the equivalence matrix \\spad{U} such that U*m = \\spad{H}")) (|hermite| ((|#4| |#4|) "\\spad{hermite(m)} returns the Hermite normal form of the matrix \\spad{m}."))) @@ -4078,7 +4078,7 @@ NIL ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-512))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-336)))) (-1037 R E V P) ((|constructor| (NIL "The category of square-free and normalized triangular sets. Thus,{} up to the primitivity axiom of [1],{} these sets are Lazard triangular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991}"))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1038 UP -4045) ((|constructor| (NIL "This package factors the formulas out of the general solve code,{} allowing their recursive use over different domains. Care is taken to introduce few radicals so that radical extension domains can more easily simplify the results.")) (|aQuartic| ((|#2| |#2| |#2| |#2| |#2| |#2|) "\\spad{aQuartic(f,{}g,{}h,{}i,{}k)} \\undocumented")) (|aCubic| ((|#2| |#2| |#2| |#2| |#2|) "\\spad{aCubic(f,{}g,{}h,{}j)} \\undocumented")) (|aQuadratic| ((|#2| |#2| |#2| |#2|) "\\spad{aQuadratic(f,{}g,{}h)} \\undocumented")) (|aLinear| ((|#2| |#2| |#2|) "\\spad{aLinear(f,{}g)} \\undocumented")) (|quartic| (((|List| |#2|) |#2| |#2| |#2| |#2| |#2|) "\\spad{quartic(f,{}g,{}h,{}i,{}j)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quartic(u)} \\undocumented")) (|cubic| (((|List| |#2|) |#2| |#2| |#2| |#2|) "\\spad{cubic(f,{}g,{}h,{}i)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{cubic(u)} \\undocumented")) (|quadratic| (((|List| |#2|) |#2| |#2| |#2|) "\\spad{quadratic(f,{}g,{}h)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quadratic(u)} \\undocumented")) (|linear| (((|List| |#2|) |#2| |#2|) "\\spad{linear(f,{}g)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{linear(u)} \\undocumented")) (|mapSolve| (((|Record| (|:| |solns| (|List| |#2|)) (|:| |maps| (|List| (|Record| (|:| |arg| |#2|) (|:| |res| |#2|))))) |#1| (|Mapping| |#2| |#2|)) "\\spad{mapSolve(u,{}f)} \\undocumented")) (|particularSolution| ((|#2| |#1|) "\\spad{particularSolution(u)} \\undocumented")) (|solve| (((|List| |#2|) |#1|) "\\spad{solve(u)} \\undocumented"))) @@ -4138,7 +4138,7 @@ NIL NIL (-1052) ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,{}t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,{}cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,{}c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,{}cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,{}c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,{}cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,{}c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,{}cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,{}c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,{}t,{}i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,{}t,{}i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,{}i..j,{}t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,{}t,{}c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,{}s,{}wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,{}t,{}i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,{}t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,{}t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1053 R E V P TS) ((|constructor| (NIL "A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are provided: in the sense of Zariski closure (like in Kalkbrener\\spad{'s} algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard- Moreno methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \\spad{TS} and the packages \\spad{QCMPPK(R,{}E,{}V,{}P,{}TS)} and \\spad{RSETGCD(R,{}E,{}V,{}P,{}TS)}. The same way it does not care about the way univariate polynomial gcds (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcds need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \\axiomType{\\spad{TS}}. Thus,{} the operations of this package are not documented.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) @@ -4158,12 +4158,12 @@ NIL NIL (-1057 S) ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) -((-2093 . T)) +((-2046 . T)) NIL (-1058 |Key| |Ent| |dent|) ((|constructor| (NIL "A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key."))) ((-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-1059) ((|constructor| (NIL "A class of objects which can be 'stepped through'. Repeated applications of \\spadfun{nextItem} is guaranteed never to return duplicate items and only return \"failed\" after exhausting all elements of the domain. This assumes that the sequence starts with \\spad{init()}. For infinite domains,{} repeated application of \\spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \\blankline Conditional attributes: \\indented{2}{infinite\\tab{15}repeated \\spad{nextItem}\\spad{'s} are never \"failed\".}")) (|nextItem| (((|Union| $ "failed") $) "\\spad{nextItem(x)} returns the next item,{} or \"failed\" if domain is exhausted.")) (|init| (($) "\\spad{init()} chooses an initial object for stepping."))) NIL @@ -4190,7 +4190,7 @@ NIL ((|HasCategory| |#1| (QUOTE (-1012))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-520) (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))))) (-1065) ((|constructor| (NIL "A category for string-like objects")) (|string| (($ (|Integer|)) "\\spad{string(i)} returns the decimal representation of \\spad{i} in a string"))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1066) NIL @@ -4199,7 +4199,7 @@ NIL (-1067 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#1|)))))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 (-1066)) (|:| -3049 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (QUOTE (-1066))) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#1|)))))) (|HasCategory| (-1066) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -283) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#1| (QUOTE (-1012))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 (-1066)) (|:| -3043 |#1|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#1| (LIST (QUOTE -560) (QUOTE (-791)))))) (-1068 A) ((|constructor| (NIL "StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.")) (|power| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{power(a,{}f)} returns the power series \\spad{f} raised to the power \\spad{a}.")) (|lazyGintegrate| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyGintegrate(f,{}r,{}g)} is used for fixed point computations.")) (|mapdiv| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapdiv([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0/b0,{}a1/b1,{}..]}.")) (|powern| (((|Stream| |#1|) (|Fraction| (|Integer|)) (|Stream| |#1|)) "\\spad{powern(r,{}f)} raises power series \\spad{f} to the power \\spad{r}.")) (|nlde| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{nlde(u)} solves a first order non-linear differential equation described by \\spad{u} of the form \\spad{[[b<0,{}0>,{}b<0,{}1>,{}...],{}[b<1,{}0>,{}b<1,{}1>,{}.],{}...]}. the differential equation has the form \\spad{y' = sum(i=0 to infinity,{}j=0 to infinity,{}b<i,{}j>*(x**i)*(y**j))}.")) (|lazyIntegrate| (((|Stream| |#1|) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyIntegrate(r,{}f)} is a local function used for fixed point computations.")) (|integrate| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{integrate(r,{}a)} returns the integral of the power series \\spad{a} with respect to the power series variableintegration where \\spad{r} denotes the constant of integration. Thus \\spad{integrate(a,{}[a0,{}a1,{}a2,{}...]) = [a,{}a0,{}a1/2,{}a2/3,{}...]}.")) (|invmultisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{invmultisect(a,{}b,{}st)} substitutes \\spad{x**((a+b)*n)} for \\spad{x**n} and multiplies by \\spad{x**b}.")) (|multisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{multisect(a,{}b,{}st)} selects the coefficients of \\spad{x**((a+b)*n+a)},{} and changes them to \\spad{x**n}.")) (|generalLambert| (((|Stream| |#1|) (|Stream| |#1|) (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),{}a,{}d)} returns \\spad{f(x**a) + f(x**(a + d)) + f(x**(a + 2 d)) + ...}. \\spad{f(x)} should have zero constant coefficient and \\spad{a} and \\spad{d} should be positive.")) (|evenlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{evenlambert(st)} computes \\spad{f(x**2) + f(x**4) + f(x**6) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1,{} then \\spad{prod(f(x**(2*n)),{}n=1..infinity) = exp(evenlambert(log(f(x))))}.")) (|oddlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{oddlambert(st)} computes \\spad{f(x) + f(x**3) + f(x**5) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f}(\\spad{x}) is a power series with constant coefficient 1 then \\spad{prod(f(x**(2*n-1)),{}n=1..infinity) = exp(oddlambert(log(f(x))))}.")) (|lambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lambert(st)} computes \\spad{f(x) + f(x**2) + f(x**3) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1 then \\spad{prod(f(x**n),{}n = 1..infinity) = exp(lambert(log(f(x))))}.")) (|addiag| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{addiag(x)} performs diagonal addition of a stream of streams. if \\spad{x} = \\spad{[[a<0,{}0>,{}a<0,{}1>,{}..],{}[a<1,{}0>,{}a<1,{}1>,{}..],{}[a<2,{}0>,{}a<2,{}1>,{}..],{}..]} and \\spad{addiag(x) = [b<0,{}b<1>,{}...],{} then b<k> = sum(i+j=k,{}a<i,{}j>)}.")) (|revert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{revert(a)} computes the inverse of a power series \\spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient 1.")) (|lagrange| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lagrange(g)} produces the power series for \\spad{f} where \\spad{f} is implicitly defined as \\spad{f(z) = z*g(f(z))}.")) (|compose| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{compose(a,{}b)} composes the power series \\spad{a} with the power series \\spad{b}.")) (|eval| (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{eval(a,{}r)} returns a stream of partial sums of the power series \\spad{a} evaluated at the power series variable equal to \\spad{r}.")) (|coerce| (((|Stream| |#1|) |#1|) "\\spad{coerce(r)} converts a ring element \\spad{r} to a stream with one element.")) (|gderiv| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) (|Stream| |#1|)) "\\spad{gderiv(f,{}[a0,{}a1,{}a2,{}..])} returns \\spad{[f(0)*a0,{}f(1)*a1,{}f(2)*a2,{}..]}.")) (|deriv| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{deriv(a)} returns the derivative of the power series with respect to the power series variable. Thus \\spad{deriv([a0,{}a1,{}a2,{}...])} returns \\spad{[a1,{}2 a2,{}3 a3,{}...]}.")) (|mapmult| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapmult([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0*b0,{}a1*b1,{}..]}.")) (|int| (((|Stream| |#1|) |#1|) "\\spad{int(r)} returns [\\spad{r},{}\\spad{r+1},{}\\spad{r+2},{}...],{} where \\spad{r} is a ring element.")) (|oddintegers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{oddintegers(n)} returns \\spad{[n,{}n+2,{}n+4,{}...]}.")) (|integers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{integers(n)} returns \\spad{[n,{}n+1,{}n+2,{}...]}.")) (|monom| (((|Stream| |#1|) |#1| (|Integer|)) "\\spad{monom(deg,{}coef)} is a monomial of degree \\spad{deg} with coefficient \\spad{coef}.")) (|recip| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|)) "\\spad{recip(a)} returns the power series reciprocal of \\spad{a},{} or \"failed\" if not possible.")) (/ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a / b} returns the power series quotient of \\spad{a} by \\spad{b}. An error message is returned if \\spad{b} is not invertible. This function is used in fixed point computations.")) (|exquo| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|) (|Stream| |#1|)) "\\spad{exquo(a,{}b)} returns the power series quotient of \\spad{a} by \\spad{b},{} if the quotient exists,{} and \"failed\" otherwise")) (* (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{a * r} returns the power series scalar multiplication of \\spad{a} by \\spad{r:} \\spad{[a0,{}a1,{}...] * r = [a0 * r,{}a1 * r,{}...]}") (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{r * a} returns the power series scalar multiplication of \\spad{r} by \\spad{a}: \\spad{r * [a0,{}a1,{}...] = [r * a0,{}r * a1,{}...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a * b} returns the power series (Cauchy) product of \\spad{a} and \\spad{b:} \\spad{[a0,{}a1,{}...] * [b0,{}b1,{}...] = [c0,{}c1,{}...]} where \\spad{ck = sum(i + j = k,{}\\spad{ai} * bk)}.")) (- (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{- a} returns the power series negative of \\spad{a}: \\spad{- [a0,{}a1,{}...] = [- a0,{}- a1,{}...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a - b} returns the power series difference of \\spad{a} and \\spad{b}: \\spad{[a0,{}a1,{}..] - [b0,{}b1,{}..] = [a0 - b0,{}a1 - b1,{}..]}")) (+ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a + b} returns the power series sum of \\spad{a} and \\spad{b}: \\spad{[a0,{}a1,{}..] + [b0,{}b1,{}..] = [a0 + b0,{}a1 + b1,{}..]}"))) NIL @@ -4226,8 +4226,8 @@ NIL NIL (-1074 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,{}x,{}3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4231 "*") -3700 (-4005 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4005 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-837)))) (-4222 -3700 (-4005 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-756))) (|has| |#1| (-512)) (-4005 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-209))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-505))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133))))) +(((-4231 "*") -3700 (-4006 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4006 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-837)))) (-4222 -3700 (-4006 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-756))) (|has| |#1| (-512)) (-4006 (|has| |#1| (-336)) (|has| (-1081 |#1| |#2| |#3|) (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) +((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-209))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-505))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1081) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1081 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133))))) (-1075 R -4045) ((|constructor| (NIL "computes sums of top-level expressions.")) (|sum| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{sum(f(n),{} n = a..b)} returns \\spad{f}(a) + \\spad{f}(a+1) + ... + \\spad{f}(\\spad{b}).") ((|#2| |#2| (|Symbol|)) "\\spad{sum(a(n),{} n)} returns A(\\spad{n}) such that A(\\spad{n+1}) - A(\\spad{n}) = a(\\spad{n})."))) NIL @@ -4251,11 +4251,11 @@ NIL (-1080 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Puiseux series in one variable \\indented{2}{\\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-1081 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),{}x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,{}k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|))))) (|HasCategory| (-706) (QUOTE (-1024))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|))))) (|HasCategory| (-706) (QUOTE (-1024))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-1082) ((|constructor| (NIL "This domain builds representations of boolean expressions for use with the \\axiomType{FortranCode} domain.")) (NOT (($ $) "\\spad{NOT(x)} returns the \\axiomType{Switch} expression representing \\spad{\\~~x}.") (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{NOT(x)} returns the \\axiomType{Switch} expression representing \\spad{\\~~x}.")) (AND (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{AND(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x and y}.")) (EQ (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{EQ(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x = y}.")) (OR (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{OR(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x or y}.")) (GE (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{GE(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x>=y}.")) (LE (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{LE(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x<=y}.")) (GT (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{GT(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x>y}.")) (LT (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{LT(x,{}y)} returns the \\axiomType{Switch} expression representing \\spad{x<y}.")) (|coerce| (($ (|Symbol|)) "\\spad{coerce(s)} \\undocumented{}"))) NIL @@ -4299,7 +4299,7 @@ NIL (-1092 |Key| |Entry|) ((|constructor| (NIL "This is the general purpose table type. The keys are hashed to look up the entries. This creates a \\spadtype{HashTable} if equal for the Key domain is consistent with Lisp EQUAL otherwise an \\spadtype{AssociationList}"))) ((-4229 . T) (-4230 . T)) -((|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2534) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3049) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2534 |#1|) (|:| -3049 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) +((|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (-12 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -283) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2526) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3043) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1012))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (QUOTE (-1012))) (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1012))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791))))) (-3700 (|HasCategory| (-2 (|:| -2526 |#1|) (|:| -3043 |#2|)) (LIST (QUOTE -560) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -560) (QUOTE (-791)))))) (-1093 R) ((|constructor| (NIL "Expands tangents of sums and scalar products.")) (|tanNa| ((|#1| |#1| (|Integer|)) "\\spad{tanNa(a,{} n)} returns \\spad{f(a)} such that if \\spad{a = tan(u)} then \\spad{f(a) = tan(n * u)}.")) (|tanAn| (((|SparseUnivariatePolynomial| |#1|) |#1| (|PositiveInteger|)) "\\spad{tanAn(a,{} n)} returns \\spad{P(x)} such that if \\spad{a = tan(u)} then \\spad{P(tan(u/n)) = 0}.")) (|tanSum| ((|#1| (|List| |#1|)) "\\spad{tanSum([a1,{}...,{}an])} returns \\spad{f(a1,{}...,{}an)} such that if \\spad{\\spad{ai} = tan(\\spad{ui})} then \\spad{f(a1,{}...,{}an) = tan(u1 + ... + un)}."))) NIL @@ -4310,7 +4310,7 @@ NIL NIL (-1095 |Key| |Entry|) ((|constructor| (NIL "A table aggregate is a model of a table,{} \\spadignore{i.e.} a discrete many-to-one mapping from keys to entries.")) (|map| (($ (|Mapping| |#2| |#2| |#2|) $ $) "\\spad{map(fn,{}t1,{}t2)} creates a new table \\spad{t} from given tables \\spad{t1} and \\spad{t2} with elements \\spad{fn}(\\spad{x},{}\\spad{y}) where \\spad{x} and \\spad{y} are corresponding elements from \\spad{t1} and \\spad{t2} respectively.")) (|table| (($ (|List| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)))) "\\spad{table([x,{}y,{}...,{}z])} creates a table consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{table()}\\$\\spad{T} creates an empty table of type \\spad{T}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(t,{}k,{}e)} (also written \\axiom{\\spad{t}.\\spad{k} \\spad{:=} \\spad{e}}) is equivalent to \\axiom{(insert([\\spad{k},{}\\spad{e}],{}\\spad{t}); \\spad{e})}."))) -((-4230 . T) (-2093 . T)) +((-4230 . T) (-2046 . T)) NIL (-1096 |Key| |Entry|) ((|constructor| (NIL "\\axiom{TabulatedComputationPackage(Key ,{}Entry)} provides some modest support for dealing with operations with type \\axiom{Key \\spad{->} Entry}. The result of such operations can be stored and retrieved with this package by using a hash-table. The user does not need to worry about the management of this hash-table. However,{} onnly one hash-table is built by calling \\axiom{TabulatedComputationPackage(Key ,{}Entry)}.")) (|insert!| (((|Void|) |#1| |#2|) "\\axiom{insert!(\\spad{x},{}\\spad{y})} stores the item whose key is \\axiom{\\spad{x}} and whose entry is \\axiom{\\spad{y}}.")) (|extractIfCan| (((|Union| |#2| "failed") |#1|) "\\axiom{extractIfCan(\\spad{x})} searches the item whose key is \\axiom{\\spad{x}}.")) (|makingStats?| (((|Boolean|)) "\\axiom{makingStats?()} returns \\spad{true} iff the statisitics process is running.")) (|printingInfo?| (((|Boolean|)) "\\axiom{printingInfo?()} returns \\spad{true} iff messages are printed when manipulating items from the hash-table.")) (|usingTable?| (((|Boolean|)) "\\axiom{usingTable?()} returns \\spad{true} iff the hash-table is used")) (|clearTable!| (((|Void|)) "\\axiom{clearTable!()} clears the hash-table and assumes that it will no longer be used.")) (|printStats!| (((|Void|)) "\\axiom{printStats!()} prints the statistics.")) (|startStats!| (((|Void|) (|String|)) "\\axiom{startStats!(\\spad{x})} initializes the statisitics process and sets the comments to display when statistics are printed")) (|printInfo!| (((|Void|) (|String|) (|String|)) "\\axiom{printInfo!(\\spad{x},{}\\spad{y})} initializes the mesages to be printed when manipulating items from the hash-table. If a key is retrieved then \\axiom{\\spad{x}} is displayed. If an item is stored then \\axiom{\\spad{y}} is displayed.")) (|initTable!| (((|Void|)) "\\axiom{initTable!()} initializes the hash-table."))) @@ -4378,7 +4378,7 @@ NIL ((|HasCategory| |#4| (QUOTE (-341)))) (-1112 R E V P) ((|constructor| (NIL "The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \\axiom{\\spad{R}} be an integral domain and \\axiom{\\spad{V}} a finite ordered set of variables,{} say \\axiom{\\spad{X1} < \\spad{X2} < ... < \\spad{Xn}}. A set \\axiom{\\spad{S}} of polynomials in \\axiom{\\spad{R}[\\spad{X1},{}\\spad{X2},{}...,{}\\spad{Xn}]} is triangular if no elements of \\axiom{\\spad{S}} lies in \\axiom{\\spad{R}},{} and if two distinct elements of \\axiom{\\spad{S}} have distinct main variables. Note that the empty set is a triangular set. A triangular set is not necessarily a (lexicographical) Groebner basis and the notion of reduction related to triangular sets is based on the recursive view of polynomials. We recall this notion here and refer to [1] for more details. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a non-constant polynomial \\axiom{\\spad{Q}} if the degree of \\axiom{\\spad{P}} in the main variable of \\axiom{\\spad{Q}} is less than the main degree of \\axiom{\\spad{Q}}. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a triangular set \\axiom{\\spad{T}} if it is reduced \\spad{w}.\\spad{r}.\\spad{t}. every polynomial of \\axiom{\\spad{T}}. \\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}")) (|coHeight| (((|NonNegativeInteger|) $) "\\axiom{coHeight(\\spad{ts})} returns \\axiom{size()\\spad{\\$}\\spad{V}} minus \\axiom{\\spad{\\#}\\spad{ts}}.")) (|extend| (($ $ |#4|) "\\axiom{extend(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.")) (|extendIfCan| (((|Union| $ "failed") $ |#4|) "\\axiom{extendIfCan(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then \"failed\" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used to implement the \\axiom{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.")) (|select| (((|Union| |#4| "failed") $ |#3|) "\\axiom{select(\\spad{ts},{}\\spad{v})} returns the polynomial of \\axiom{\\spad{ts}} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#3| $) "\\axiom{algebraic?(\\spad{v},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ts}}.")) (|algebraicVariables| (((|List| |#3|) $) "\\axiom{algebraicVariables(\\spad{ts})} returns the decreasingly sorted list of the main variables of the polynomials of \\axiom{\\spad{ts}}.")) (|rest| (((|Union| $ "failed") $) "\\axiom{rest(\\spad{ts})} returns the polynomials of \\axiom{\\spad{ts}} with smaller main variable than \\axiom{mvar(\\spad{ts})} if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \"failed\"")) (|last| (((|Union| |#4| "failed") $) "\\axiom{last(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with smallest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|first| (((|Union| |#4| "failed") $) "\\axiom{first(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with greatest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|zeroSetSplitIntoTriangularSystems| (((|List| (|Record| (|:| |close| $) (|:| |open| (|List| |#4|)))) (|List| |#4|)) "\\axiom{zeroSetSplitIntoTriangularSystems(\\spad{lp})} returns a list of triangular systems \\axiom{[[\\spad{ts1},{}\\spad{qs1}],{}...,{}[\\spad{tsn},{}\\spad{qsn}]]} such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the \\axiom{W_i} where \\axiom{W_i} consists of the zeros of \\axiom{\\spad{ts}} which do not cancel any polynomial in \\axiom{qsi}.")) (|zeroSetSplit| (((|List| $) (|List| |#4|)) "\\axiom{zeroSetSplit(\\spad{lp})} returns a list \\axiom{\\spad{lts}} of triangular sets such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the regular zero sets of the members of \\axiom{\\spad{lts}}.")) (|reduceByQuasiMonic| ((|#4| |#4| $) "\\axiom{reduceByQuasiMonic(\\spad{p},{}\\spad{ts})} returns the same as \\axiom{remainder(\\spad{p},{}collectQuasiMonic(\\spad{ts})).polnum}.")) (|collectQuasiMonic| (($ $) "\\axiom{collectQuasiMonic(\\spad{ts})} returns the subset of \\axiom{\\spad{ts}} consisting of the polynomials with initial in \\axiom{\\spad{R}}.")) (|removeZero| ((|#4| |#4| $) "\\axiom{removeZero(\\spad{p},{}\\spad{ts})} returns \\axiom{0} if \\axiom{\\spad{p}} reduces to \\axiom{0} by pseudo-division \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{ts}} otherwise returns a polynomial \\axiom{\\spad{q}} computed from \\axiom{\\spad{p}} by removing any coefficient in \\axiom{\\spad{p}} reducing to \\axiom{0}.")) (|initiallyReduce| ((|#4| |#4| $) "\\axiom{initiallyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|headReduce| ((|#4| |#4| $) "\\axiom{headReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduce?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|stronglyReduce| ((|#4| |#4| $) "\\axiom{stronglyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{stronglyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|rewriteSetWithReduction| (((|List| |#4|) (|List| |#4|) $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{rewriteSetWithReduction(\\spad{lp},{}\\spad{ts},{}redOp,{}redOp?)} returns a list \\axiom{\\spad{lq}} of polynomials such that \\axiom{[reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?) for \\spad{p} in \\spad{lp}]} and \\axiom{\\spad{lp}} have the same zeros inside the regular zero set of \\axiom{\\spad{ts}}. Moreover,{} for every polynomial \\axiom{\\spad{q}} in \\axiom{\\spad{lq}} and every polynomial \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{q},{}\\spad{t})} holds and there exists a polynomial \\axiom{\\spad{p}} in the ideal generated by \\axiom{\\spad{lp}} and a product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|reduce| ((|#4| |#4| $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{redOp?(\\spad{r},{}\\spad{p})} holds for every \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} and there exists some product \\axiom{\\spad{h}} of the initials of the members of \\axiom{\\spad{ts}} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|autoReduced?| (((|Boolean|) $ (|Mapping| (|Boolean|) |#4| (|List| |#4|))) "\\axiom{autoReduced?(\\spad{ts},{}redOp?)} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to every other in the sense of \\axiom{redOp?}")) (|initiallyReduced?| (((|Boolean|) $) "\\spad{initiallyReduced?(ts)} returns \\spad{true} iff for every element \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the other elements of \\axiom{\\spad{ts}} with the same main variable.") (((|Boolean|) |#4| $) "\\axiom{initiallyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the elements of \\axiom{\\spad{ts}} with the same main variable.")) (|headReduced?| (((|Boolean|) $) "\\spad{headReduced?(ts)} returns \\spad{true} iff the head of every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#4| $) "\\axiom{headReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff the head of \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|stronglyReduced?| (((|Boolean|) $) "\\axiom{stronglyReduced?(\\spad{ts})} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#4| $) "\\axiom{stronglyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|reduced?| (((|Boolean|) |#4| $ (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduced?(\\spad{p},{}\\spad{ts},{}redOp?)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. in the sense of the operation \\axiom{redOp?},{} that is if for every \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{p},{}\\spad{t})} holds.")) (|normalized?| (((|Boolean|) $) "\\axiom{normalized?(\\spad{ts})} returns \\spad{true} iff for every axiom{\\spad{p}} in axiom{\\spad{ts}} we have \\axiom{normalized?(\\spad{p},{}us)} where \\axiom{us} is \\axiom{collectUnder(\\spad{ts},{}mvar(\\spad{p}))}.") (((|Boolean|) |#4| $) "\\axiom{normalized?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variables of the polynomials of \\axiom{\\spad{ts}}")) (|quasiComponent| (((|Record| (|:| |close| (|List| |#4|)) (|:| |open| (|List| |#4|))) $) "\\axiom{quasiComponent(\\spad{ts})} returns \\axiom{[\\spad{lp},{}\\spad{lq}]} where \\axiom{\\spad{lp}} is the list of the members of \\axiom{\\spad{ts}} and \\axiom{\\spad{lq}}is \\axiom{initials(\\spad{ts})}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{ts})} returns the product of main degrees of the members of \\axiom{\\spad{ts}}.")) (|initials| (((|List| |#4|) $) "\\axiom{initials(\\spad{ts})} returns the list of the non-constant initials of the members of \\axiom{\\spad{ts}}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}pred?,{}redOp?)} returns the same as \\axiom{basicSet(\\spad{qs},{}redOp?)} where \\axiom{\\spad{qs}} consists of the polynomials of \\axiom{\\spad{ps}} satisfying property \\axiom{pred?}.") (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}redOp?)} returns \\axiom{[\\spad{bs},{}\\spad{ts}]} where \\axiom{concat(\\spad{bs},{}\\spad{ts})} is \\axiom{\\spad{ps}} and \\axiom{\\spad{bs}} is a basic set in Wu Wen Tsun sense of \\axiom{\\spad{ps}} \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?},{} if no non-zero constant polynomial lie in \\axiom{\\spad{ps}},{} otherwise \\axiom{\"failed\"} is returned.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(\\spad{ts1},{}\\spad{ts2})} returns \\spad{true} iff \\axiom{\\spad{ts2}} has higher rank than \\axiom{\\spad{ts1}} in Wu Wen Tsun sense."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1113 |Coef|) ((|constructor| (NIL "\\spadtype{TaylorSeries} is a general multivariate Taylor series domain over the ring Coef and with variables of type Symbol.")) (|fintegrate| (($ (|Mapping| $) (|Symbol|) |#1|) "\\spad{fintegrate(f,{}v,{}c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ (|Symbol|) |#1|) "\\spad{integrate(s,{}v,{}c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|coerce| (($ (|Polynomial| |#1|)) "\\spad{coerce(s)} regroups terms of \\spad{s} by total degree \\indented{1}{and forms a series.}") (($ (|Symbol|)) "\\spad{coerce(s)} converts a variable to a Taylor series")) (|coefficient| (((|Polynomial| |#1|) $ (|NonNegativeInteger|)) "\\spad{coefficient(s,{} n)} gives the terms of total degree \\spad{n}."))) @@ -4402,7 +4402,7 @@ NIL NIL (-1118) ((|constructor| (NIL "The fundamental Type."))) -((-2093 . T)) +((-2046 . T)) NIL (-1119 S) ((|constructor| (NIL "Provides functions to force a partial ordering on any set.")) (|more?| (((|Boolean|) |#1| |#1|) "\\spad{more?(a,{} b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and uses the ordering on \\spad{S} if \\spad{a} and \\spad{b} are not comparable in the partial ordering.")) (|userOrdered?| (((|Boolean|)) "\\spad{userOrdered?()} tests if the partial ordering induced by \\spadfunFrom{setOrder}{UserDefinedPartialOrdering} is not empty.")) (|largest| ((|#1| (|List| |#1|)) "\\spad{largest l} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by the ordering on \\spad{S}.") ((|#1| (|List| |#1|) (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{largest(l,{} fn)} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by \\spad{fn}.")) (|less?| (((|Boolean|) |#1| |#1| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{less?(a,{} b,{} fn)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and returns \\spad{fn(a,{} b)} if \\spad{a} and \\spad{b} are not comparable in that ordering.") (((|Union| (|Boolean|) "failed") |#1| |#1|) "\\spad{less?(a,{} b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder.")) (|getOrder| (((|Record| (|:| |low| (|List| |#1|)) (|:| |high| (|List| |#1|)))) "\\spad{getOrder()} returns \\spad{[[b1,{}...,{}bm],{} [a1,{}...,{}an]]} such that the partial ordering on \\spad{S} was given by \\spad{setOrder([b1,{}...,{}bm],{}[a1,{}...,{}an])}.")) (|setOrder| (((|Void|) (|List| |#1|) (|List| |#1|)) "\\spad{setOrder([b1,{}...,{}bm],{} [a1,{}...,{}an])} defines a partial ordering on \\spad{S} given \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{bj < c < \\spad{ai}}\\space{2}for \\spad{c} not among the \\spad{ai}\\spad{'s} and \\spad{bj}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(c,{}d)} if neither is among the \\spad{ai}\\spad{'s},{}\\spad{bj}\\spad{'s}.}") (((|Void|) (|List| |#1|)) "\\spad{setOrder([a1,{}...,{}an])} defines a partial ordering on \\spad{S} given \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{b < \\spad{ai}\\space{3}for i = 1..n} and \\spad{b} not among the \\spad{ai}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(b,{} c)} if neither is among the \\spad{ai}\\spad{'s}.}"))) @@ -4434,16 +4434,16 @@ NIL ((|HasCategory| |#2| (QUOTE (-336)))) (-1126 |Coef| UTS) ((|constructor| (NIL "This is a category of univariate Laurent series constructed from univariate Taylor series. A Laurent series is represented by a pair \\spad{[n,{}f(x)]},{} where \\spad{n} is an arbitrary integer and \\spad{f(x)} is a Taylor series. This pair represents the Laurent series \\spad{x**n * f(x)}.")) (|taylorIfCan| (((|Union| |#2| "failed") $) "\\spad{taylorIfCan(f(x))} converts the Laurent series \\spad{f(x)} to a Taylor series,{} if possible. If this is not possible,{} \"failed\" is returned.")) (|taylor| ((|#2| $) "\\spad{taylor(f(x))} converts the Laurent series \\spad{f}(\\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.")) (|coerce| (($ |#2|) "\\spad{coerce(f(x))} converts the Taylor series \\spad{f(x)} to a Laurent series.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,{}f(x))} removes up to \\spad{n} leading zeroes from the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable.") (($ $) "\\spad{removeZeroes(f(x))} removes leading zeroes from the representation of the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}")) (|taylorRep| ((|#2| $) "\\spad{taylorRep(f(x))} returns \\spad{g(x)},{} where \\spad{f = x**n * g(x)} is represented by \\spad{[n,{}g(x)]}.")) (|degree| (((|Integer|) $) "\\spad{degree(f(x))} returns the degree of the lowest order term of \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurent| (($ (|Integer|) |#2|) "\\spad{laurent(n,{}f(x))} returns \\spad{x**n * f(x)}."))) -(((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-2093 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) +(((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-2046 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) NIL (-1127 |Coef| UTS) ((|constructor| (NIL "This package enables one to construct a univariate Laurent series domain from a univariate Taylor series domain. Univariate Laurent series are represented by a pair \\spad{[n,{}f(x)]},{} where \\spad{n} is an arbitrary integer and \\spad{f(x)} is a Taylor series. This pair represents the Laurent series \\spad{x**n * f(x)}."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-135))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-135))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-209)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-945)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-1059)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -260) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-352))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783))))) (|HasCategory| |#2| (QUOTE (-837))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-505)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-281)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133))) (-3700 (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-133))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -260) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-945)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-1059)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-133)))))) +((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-135))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-135))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-209)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-945)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-1059)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -260) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -582) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-352))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783)))) (-3700 (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783))))) (|HasCategory| |#2| (QUOTE (-837))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-505)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-281)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133))) (-3700 (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-133))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -260) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -481) (QUOTE (-1083)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-783)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-945)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-1059)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-496))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -283) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-520))))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (LIST (QUOTE -960) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#2| (QUOTE (-133)))))) (-1128 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,{}x,{}3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4231 "*") -3700 (-4005 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4005 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-837)))) (-4222 -3700 (-4005 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-756))) (|has| |#1| (-512)) (-4005 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-209))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-505))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133))))) +(((-4231 "*") -3700 (-4006 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4006 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-837)))) (-4222 -3700 (-4006 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-756))) (|has| |#1| (-512)) (-4006 (|has| |#1| (-336)) (|has| (-1156 |#1| |#2| |#3|) (-837)))) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) +((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| (-520) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-209))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-520)) (|devaluate| |#1|))))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-505))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-281))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-945))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-1059))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (QUOTE (-496)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-352))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -561) (LIST (QUOTE -820) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -260) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -283) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -481) (QUOTE (-1083)) (LIST (QUOTE -1156) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -582) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-352)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-1083)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|)))))) (-3700 (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (LIST (QUOTE -960) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-3700 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-336)))) (-12 (|HasCategory| (-1156 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-336)))) (|HasCategory| |#1| (QUOTE (-133))))) (-1129 ZP) ((|constructor| (NIL "Package for the factorization of univariate polynomials with integer coefficients. The factorization is done by \"lifting\" (HENSEL) the factorization over a finite field.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(m,{}flag)} returns the factorization of \\spad{m},{} FinalFact is a Record \\spad{s}.\\spad{t}. FinalFact.contp=content \\spad{m},{} FinalFact.factors=List of irreducible factors of \\spad{m} with exponent ,{} if \\spad{flag} =true the polynomial is assumed square free.")) (|factorSquareFree| (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(m)} returns the factorization of \\spad{m} square free polynomial")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(m)} returns the factorization of \\spad{m}"))) NIL @@ -4495,7 +4495,7 @@ NIL (-1141 S |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#2|) $ |#2|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#3|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#2| $ |#3|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#3| |#3|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#3|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#3| $ |#3|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#3| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#2| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#2| $ |#3|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#3|) (|:| |c| |#2|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1024))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2222) (LIST (|devaluate| |#2|) (QUOTE (-1083)))))) +((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1024))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2188) (LIST (|devaluate| |#2|) (QUOTE (-1083)))))) (-1142 |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#1|) $ |#1|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#2|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#1| $ |#2|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#2| |#2|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#2|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#2| $ |#2|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#2| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#1| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#1| $ |#2|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) @@ -4523,11 +4523,11 @@ NIL (-1148 |Coef| ULS) ((|constructor| (NIL "This package enables one to construct a univariate Puiseux series domain from a univariate Laurent series domain. Univariate Puiseux series are represented by a pair \\spad{[r,{}f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x^r)}."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-1149 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Puiseux series in one variable \\indented{2}{\\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux series in} \\indented{2}{\\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4227 |has| |#1| (-336)) (-4221 |has| |#1| (-336)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520))) (|devaluate| |#1|))))) (|HasCategory| (-380 (-520)) (QUOTE (-1024))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (-3700 (|HasCategory| |#1| (QUOTE (-336))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -380) (QUOTE (-520)))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-1150 R FE |var| |cen|) ((|constructor| (NIL "UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent functions with essential singularities. Objects in this domain are sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series. Thus,{} the elements of this domain are sums of expressions of the form \\spad{g(x) * exp(f(x))},{} where \\spad{g}(\\spad{x}) is a univariate Puiseux series and \\spad{f}(\\spad{x}) is a univariate Puiseux series with no terms of non-negative degree.")) (|dominantTerm| (((|Union| (|Record| (|:| |%term| (|Record| (|:| |%coef| (|UnivariatePuiseuxSeries| |#2| |#3| |#4|)) (|:| |%expon| (|ExponentialOfUnivariatePuiseuxSeries| |#2| |#3| |#4|)) (|:| |%expTerms| (|List| (|Record| (|:| |k| (|Fraction| (|Integer|))) (|:| |c| |#2|)))))) (|:| |%type| (|String|))) "failed") $) "\\spad{dominantTerm(f(var))} returns the term that dominates the limiting behavior of \\spad{f(var)} as \\spad{var -> cen+} together with a \\spadtype{String} which briefly describes that behavior. The value of the \\spadtype{String} will be \\spad{\"zero\"} (resp. \\spad{\"infinity\"}) if the term tends to zero (resp. infinity) exponentially and will \\spad{\"series\"} if the term is a Puiseux series.")) (|limitPlus| (((|Union| (|OrderedCompletion| |#2|) "failed") $) "\\spad{limitPlus(f(var))} returns \\spad{limit(var -> cen+,{}f(var))}."))) (((-4231 "*") |has| (-1149 |#2| |#3| |#4|) (-157)) (-4222 |has| (-1149 |#2| |#3| |#4|) (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) @@ -4538,7 +4538,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4230))) (-1152 S) ((|constructor| (NIL "A unary-recursive aggregate is a one where nodes may have either 0 or 1 children. This aggregate models,{} though not precisely,{} a linked list possibly with a single cycle. A node with one children models a non-empty list,{} with the \\spadfun{value} of the list designating the head,{} or \\spadfun{first},{} of the list,{} and the child designating the tail,{} or \\spadfun{rest},{} of the list. A node with no child then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.")) (|split!| (($ $ (|Integer|)) "\\spad{split!(u,{}n)} splits \\spad{u} into two aggregates: \\axiom{\\spad{v} = rest(\\spad{u},{}\\spad{n})} and \\axiom{\\spad{w} = first(\\spad{u},{}\\spad{n})},{} returning \\axiom{\\spad{v}}. Note: afterwards \\axiom{rest(\\spad{u},{}\\spad{n})} returns \\axiom{empty()}.")) (|setlast!| ((|#1| $ |#1|) "\\spad{setlast!(u,{}x)} destructively changes the last element of \\spad{u} to \\spad{x}.")) (|setrest!| (($ $ $) "\\spad{setrest!(u,{}v)} destructively changes the rest of \\spad{u} to \\spad{v}.")) (|setelt| ((|#1| $ "last" |#1|) "\\spad{setelt(u,{}\"last\",{}x)} (also written: \\axiom{\\spad{u}.last \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,{}\"rest\",{}v)} (also written: \\axiom{\\spad{u}.rest \\spad{:=} \\spad{v}}) is equivalent to \\axiom{setrest!(\\spad{u},{}\\spad{v})}.") ((|#1| $ "first" |#1|) "\\spad{setelt(u,{}\"first\",{}x)} (also written: \\axiom{\\spad{u}.first \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setfirst!(\\spad{u},{}\\spad{x})}.")) (|setfirst!| ((|#1| $ |#1|) "\\spad{setfirst!(u,{}x)} destructively changes the first element of a to \\spad{x}.")) (|cycleSplit!| (($ $) "\\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or nil if none exists. For example,{} if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} is the cyclic list where \\spad{v} is the head of the cycle,{} \\axiom{cycleSplit!(\\spad{w})} will drop \\spad{v} off \\spad{w} thus destructively changing \\spad{w} to \\spad{u},{} and returning \\spad{v}.")) (|concat!| (($ $ |#1|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}. Note: \\axiom{concat!(a,{}\\spad{x}) = setlast!(a,{}[\\spad{x}])}.") (($ $ $) "\\spad{concat!(u,{}v)} destructively concatenates \\spad{v} to the end of \\spad{u}. Note: \\axiom{concat!(\\spad{u},{}\\spad{v}) = setlast_!(\\spad{u},{}\\spad{v})}.")) (|cycleTail| (($ $) "\\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.")) (|cycleLength| (((|NonNegativeInteger|) $) "\\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \\spad{u},{} or 0 is \\spad{u} has no such cycle.")) (|cycleEntry| (($ $) "\\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \\spad{u},{} or \\axiom{empty()} if none exists.")) (|third| ((|#1| $) "\\spad{third(u)} returns the third element of \\spad{u}. Note: \\axiom{third(\\spad{u}) = first(rest(rest(\\spad{u})))}.")) (|second| ((|#1| $) "\\spad{second(u)} returns the second element of \\spad{u}. Note: \\axiom{second(\\spad{u}) = first(rest(\\spad{u}))}.")) (|tail| (($ $) "\\spad{tail(u)} returns the last node of \\spad{u}. Note: if \\spad{u} is \\axiom{shallowlyMutable},{} \\axiom{setrest(tail(\\spad{u}),{}\\spad{v}) = concat(\\spad{u},{}\\spad{v})}.")) (|last| (($ $ (|NonNegativeInteger|)) "\\spad{last(u,{}n)} returns a copy of the last \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) nodes of \\spad{u}. Note: \\axiom{last(\\spad{u},{}\\spad{n})} is a list of \\spad{n} elements.") ((|#1| $) "\\spad{last(u)} resturn the last element of \\spad{u}. Note: for lists,{} \\axiom{last(\\spad{u}) = \\spad{u} . (maxIndex \\spad{u}) = \\spad{u} . (\\# \\spad{u} - 1)}.")) (|rest| (($ $ (|NonNegativeInteger|)) "\\spad{rest(u,{}n)} returns the \\axiom{\\spad{n}}th (\\spad{n} \\spad{>=} 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#1| $ "last") "\\spad{elt(u,{}\"last\")} (also written: \\axiom{\\spad{u} . last}) is equivalent to last \\spad{u}.") (($ $ "rest") "\\spad{elt(\\%,{}\"rest\")} (also written: \\axiom{\\spad{u}.rest}) is equivalent to \\axiom{rest \\spad{u}}.") ((|#1| $ "first") "\\spad{elt(u,{}\"first\")} (also written: \\axiom{\\spad{u} . first}) is equivalent to first \\spad{u}.")) (|first| (($ $ (|NonNegativeInteger|)) "\\spad{first(u,{}n)} returns a copy of the first \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) elements of \\spad{u}.") ((|#1| $) "\\spad{first(u)} returns the first element of \\spad{u} (equivalently,{} the value at the current node).")) (|concat| (($ |#1| $) "\\spad{concat(x,{}u)} returns aggregate consisting of \\spad{x} followed by the elements of \\spad{u}. Note: if \\axiom{\\spad{v} = concat(\\spad{x},{}\\spad{u})} then \\axiom{\\spad{x} = first \\spad{v}} and \\axiom{\\spad{u} = rest \\spad{v}}.") (($ $ $) "\\spad{concat(u,{}v)} returns an aggregate \\spad{w} consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: \\axiom{\\spad{v} = rest(\\spad{w},{}\\#a)}."))) -((-2093 . T)) +((-2046 . T)) NIL (-1153 |Coef1| |Coef2| UTS1 UTS2) ((|constructor| (NIL "Mapping package for univariate Taylor series. \\indented{2}{This package allows one to apply a function to the coefficients of} \\indented{2}{a univariate Taylor series.}")) (|map| ((|#4| (|Mapping| |#2| |#1|) |#3|) "\\spad{map(f,{}g(x))} applies the map \\spad{f} to the coefficients of \\indented{1}{the Taylor series \\spad{g(x)}.}"))) @@ -4547,7 +4547,7 @@ NIL (-1154 S |Coef|) ((|constructor| (NIL "\\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(f(x),{}y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $ (|Symbol|)) "\\spad{integrate(f(x),{}y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (** (($ $ |#2|) "\\spad{f(x) ** a} computes a power of a power series. When the coefficient ring is a field,{} we may raise a series to an exponent from the coefficient ring provided that the constant coefficient of the series is 1.")) (|polynomial| (((|Polynomial| |#2|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{polynomial(f,{}k1,{}k2)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (((|Polynomial| |#2|) $ (|NonNegativeInteger|)) "\\spad{polynomial(f,{}k)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|multiplyCoefficients| (($ (|Mapping| |#2| (|Integer|)) $) "\\spad{multiplyCoefficients(f,{}sum(n = 0..infinity,{}a[n] * x**n))} returns \\spad{sum(n = 0..infinity,{}f(n) * a[n] * x**n)}. This function is used when Laurent series are represented by a Taylor series and an order.")) (|quoByVar| (($ $) "\\spad{quoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...} Thus,{} this function substracts the constant term and divides by the series variable. This function is used when Laurent series are represented by a Taylor series and an order.")) (|coefficients| (((|Stream| |#2|) $) "\\spad{coefficients(a0 + a1 x + a2 x**2 + ...)} returns a stream of coefficients: \\spad{[a0,{}a1,{}a2,{}...]}. The entries of the stream may be zero.")) (|series| (($ (|Stream| |#2|)) "\\spad{series([a0,{}a1,{}a2,{}...])} is the Taylor series \\spad{a0 + a1 x + a2 x**2 + ...}.") (($ (|Stream| (|Record| (|:| |k| (|NonNegativeInteger|)) (|:| |c| |#2|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#2| (QUOTE (-886))) (|HasCategory| |#2| (QUOTE (-1104))) (|HasSignature| |#2| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -1213) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1083))))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336)))) +((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#2| (QUOTE (-886))) (|HasCategory| |#2| (QUOTE (-1104))) (|HasSignature| |#2| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3517) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1083))))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#2| (QUOTE (-336)))) (-1155 |Coef|) ((|constructor| (NIL "\\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(f(x),{}y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $ (|Symbol|)) "\\spad{integrate(f(x),{}y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (** (($ $ |#1|) "\\spad{f(x) ** a} computes a power of a power series. When the coefficient ring is a field,{} we may raise a series to an exponent from the coefficient ring provided that the constant coefficient of the series is 1.")) (|polynomial| (((|Polynomial| |#1|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{polynomial(f,{}k1,{}k2)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (((|Polynomial| |#1|) $ (|NonNegativeInteger|)) "\\spad{polynomial(f,{}k)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(f,{}sum(n = 0..infinity,{}a[n] * x**n))} returns \\spad{sum(n = 0..infinity,{}f(n) * a[n] * x**n)}. This function is used when Laurent series are represented by a Taylor series and an order.")) (|quoByVar| (($ $) "\\spad{quoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...} Thus,{} this function substracts the constant term and divides by the series variable. This function is used when Laurent series are represented by a Taylor series and an order.")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(a0 + a1 x + a2 x**2 + ...)} returns a stream of coefficients: \\spad{[a0,{}a1,{}a2,{}...]}. The entries of the stream may be zero.")) (|series| (($ (|Stream| |#1|)) "\\spad{series([a0,{}a1,{}a2,{}...])} is the Taylor series \\spad{a0 + a1 x + a2 x**2 + ...}.") (($ (|Stream| (|Record| (|:| |k| (|NonNegativeInteger|)) (|:| |c| |#1|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) @@ -4555,7 +4555,7 @@ NIL (-1156 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),{}x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,{}b,{}f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,{}b,{}f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and 1st order coefficient 1.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),{}a,{}d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,{}f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,{}f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,{}f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,{}k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4231 "*") |has| |#1| (-157)) (-4222 |has| |#1| (-512)) (-4223 . T) (-4224 . T) (-4226 . T)) -((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|))))) (|HasCategory| (-706) (QUOTE (-1024))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (|HasSignature| |#1| (LIST (QUOTE -2222) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -1213) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasCategory| |#1| (QUOTE (-512))) (|HasCategory| |#1| (QUOTE (-157))) (-3700 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-512)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1083)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-706)) (|devaluate| |#1|))))) (|HasCategory| (-706) (QUOTE (-1024))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-706))))) (|HasSignature| |#1| (LIST (QUOTE -2188) (LIST (|devaluate| |#1|) (QUOTE (-1083)))))) (|HasCategory| |#1| (QUOTE (-336))) (-3700 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-520)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1104))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -380) (QUOTE (-520))))) (|HasSignature| |#1| (LIST (QUOTE -3517) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1083))))) (|HasSignature| |#1| (LIST (QUOTE -4081) (LIST (LIST (QUOTE -586) (QUOTE (-1083))) (|devaluate| |#1|))))))) (-1157 |Coef| UTS) ((|constructor| (NIL "\\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.")) (|mpsode| (((|List| |#2|) (|List| |#1|) (|List| (|Mapping| |#2| (|List| |#2|)))) "\\spad{mpsode(r,{}f)} solves the system of differential equations \\spad{dy[i]/dx =f[i] [x,{}y[1],{}y[2],{}...,{}y[n]]},{} \\spad{y[i](a) = r[i]} for \\spad{i} in 1..\\spad{n}.")) (|ode| ((|#2| (|Mapping| |#2| (|List| |#2|)) (|List| |#1|)) "\\spad{ode(f,{}cl)} is the solution to \\spad{y<n>=f(y,{}y',{}..,{}y<n-1>)} such that \\spad{y<i>(a) = cl.i} for \\spad{i} in 1..\\spad{n}.")) (|ode2| ((|#2| (|Mapping| |#2| |#2| |#2|) |#1| |#1|) "\\spad{ode2(f,{}c0,{}c1)} is the solution to \\spad{y'' = f(y,{}y')} such that \\spad{y(a) = c0} and \\spad{y'(a) = c1}.")) (|ode1| ((|#2| (|Mapping| |#2| |#2|) |#1|) "\\spad{ode1(f,{}c)} is the solution to \\spad{y' = f(y)} such that \\spad{y(a) = c}.")) (|fixedPointExquo| ((|#2| |#2| |#2|) "\\spad{fixedPointExquo(f,{}g)} computes the exact quotient of \\spad{f} and \\spad{g} using a fixed point computation.")) (|stFuncN| (((|Mapping| (|Stream| |#1|) (|List| (|Stream| |#1|))) (|Mapping| |#2| (|List| |#2|))) "\\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc2| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2| |#2|)) "\\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc1| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2|)) "\\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user."))) NIL @@ -4566,7 +4566,7 @@ NIL ((|HasCategory| |#1| (QUOTE (-512)))) (-1159) ((|constructor| (NIL "The category of domains that act like unions. UnionType,{} like Type or Category,{} acts mostly as a take that communicates `union-like' intended semantics to the compiler. A domain \\spad{D} that satifies UnionType should provide definitions for `case' operators,{} with corresponding `autoCoerce' operators."))) -((-2093 . T)) +((-2046 . T)) NIL (-1160 |sym|) ((|constructor| (NIL "This domain implements variables")) (|variable| (((|Symbol|)) "\\spad{variable()} returns the symbol")) (|coerce| (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol"))) @@ -4578,7 +4578,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-926))) (|HasCategory| |#2| (QUOTE (-969))) (|HasCategory| |#2| (QUOTE (-662))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25)))) (-1162 R) ((|constructor| (NIL "\\spadtype{VectorCategory} represents the type of vector like objects,{} \\spadignore{i.e.} finite sequences indexed by some finite segment of the integers. The operations available on vectors depend on the structure of the underlying components. Many operations from the component domain are defined for vectors componentwise. It can by assumed that extraction or updating components can be done in constant time.")) (|magnitude| ((|#1| $) "\\spad{magnitude(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the length")) (|length| ((|#1| $) "\\spad{length(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the magnitude")) (|cross| (($ $ $) "vectorProduct(\\spad{u},{}\\spad{v}) constructs the cross product of \\spad{u} and \\spad{v}. Error: if \\spad{u} and \\spad{v} are not of length 3.")) (|outerProduct| (((|Matrix| |#1|) $ $) "\\spad{outerProduct(u,{}v)} constructs the matrix whose (\\spad{i},{}\\spad{j})\\spad{'}th element is \\spad{u}(\\spad{i})\\spad{*v}(\\spad{j}).")) (|dot| ((|#1| $ $) "\\spad{dot(x,{}y)} computes the inner product of the two vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.")) (* (($ $ |#1|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#1| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.") (($ (|Integer|) $) "\\spad{n * y} multiplies each component of the vector \\spad{y} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x - y} returns the component-wise difference of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.") (($ $) "\\spad{-x} negates all components of the vector \\spad{x}.")) (|zero| (($ (|NonNegativeInteger|)) "\\spad{zero(n)} creates a zero vector of length \\spad{n}.")) (+ (($ $ $) "\\spad{x + y} returns the component-wise sum of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length."))) -((-4230 . T) (-4229 . T) (-2093 . T)) +((-4230 . T) (-4229 . T) (-2046 . T)) NIL (-1163 A B) ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} vectors of elements of some type \\spad{A} and functions from \\spad{A} to another of type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a vector over \\spad{B}.")) (|map| (((|Union| (|Vector| |#2|) "failed") (|Mapping| (|Union| |#2| "failed") |#1|) (|Vector| |#1|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values or \\spad{\"failed\"}.") (((|Vector| |#2|) (|Mapping| |#2| |#1|) (|Vector| |#1|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{reduce(func,{}vec,{}ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if \\spad{vec} is empty.")) (|scan| (((|Vector| |#2|) (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{scan(func,{}vec,{}ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) |