axiom-commit Mailing List for Axiom Computer Algebra System
Brought to you by:
daly,
starseeker
Menu
▾
▴
axiom-commit — Journal Commits to Axiom SVN
You can subscribe to this list here.
| 2006 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(12) |
Jun
(30) |
Jul
(5) |
Aug
(44) |
Sep
(54) |
Oct
(83) |
Nov
(138) |
Dec
(77) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2007 |
Jan
(8) |
Feb
(19) |
Mar
(36) |
Apr
(57) |
May
(62) |
Jun
(95) |
Jul
(51) |
Aug
(79) |
Sep
(39) |
Oct
(25) |
Nov
(8) |
Dec
(33) |
| 2008 |
Jan
(35) |
Feb
(37) |
Mar
(41) |
Apr
(52) |
May
(42) |
Jun
(55) |
Jul
(42) |
Aug
(47) |
Sep
(45) |
Oct
(24) |
Nov
(53) |
Dec
(102) |
| 2009 |
Jan
(39) |
Feb
(58) |
Mar
(48) |
Apr
(77) |
May
(269) |
Jun
(111) |
Jul
(21) |
Aug
(102) |
Sep
(54) |
Oct
(73) |
Nov
(42) |
Dec
(26) |
| 2010 |
Jan
(45) |
Feb
(35) |
Mar
(15) |
Apr
(25) |
May
(80) |
Jun
(62) |
Jul
(28) |
Aug
(27) |
Sep
(31) |
Oct
(40) |
Nov
(9) |
Dec
(21) |
| 2011 |
Jan
(21) |
Feb
(16) |
Mar
(12) |
Apr
(9) |
May
(23) |
Jun
(2) |
Jul
(19) |
Aug
(18) |
Sep
(20) |
Oct
(5) |
Nov
(19) |
Dec
(19) |
| 2012 |
Jan
(20) |
Feb
(21) |
Mar
(12) |
Apr
(19) |
May
(14) |
Jun
(3) |
Jul
|
Aug
(1) |
Sep
|
Oct
(1) |
Nov
|
Dec
|
| 2013 |
Jan
(12) |
Feb
(16) |
Mar
(65) |
Apr
(3) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2016 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(1) |
| 2020 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(1) |
Nov
|
Dec
|
| 2022 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| S | M | T | W | T | F | S |
|---|---|---|---|---|---|---|
|
|
|
|
|
|
1
|
2
|
|
3
|
4
|
5
|
6
|
7
|
8
|
9
|
|
10
(4) |
11
|
12
|
13
|
14
|
15
(2) |
16
(2) |
|
17
(5) |
18
(6) |
19
(4) |
20
(2) |
21
|
22
(4) |
23
(6) |
|
24
|
25
|
26
(2) |
27
(2) |
28
(4) |
29
|
30
(2) |
|
31
(2) |
|
|
|
|
|
|
|
From: <da...@us...> - 2008-08-31 04:30:04
|
Revision: 962
http://axiom.svn.sourceforge.net/axiom/?rev=962&view=rev
Author: daly
Date: 2008-08-31 04:30:08 +0000 (Sun, 31 Aug 2008)
Log Message:
-----------
20080830 tpd src/algebra/trigcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/si.spad graphviz dotfile decoration
20080830 tpd src/algebra/sf.spad graphviz dotfile decoration
20080830 tpd src/algebra/pscat.spad graphviz dotfile decoration
20080830 tpd src/algebra/pattern.spad graphviz dotfile decoration
20080830 tpd src/algebra/patmatch1.spad graphviz dotfile decoration
20080830 tpd src/algebra/omcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/misc.spad graphviz dotfile decoration
20080830 tpd src/algebra/integer.spad graphviz dotfile decoration
20080830 tpd src/algebra/equation1.spad graphviz dotfile decoration
20080830 tpd src/algebra/coerce.spad graphviz dotfile decoration
20080830 tpd src/algebra/catdef.spad graphviz dotfile decoration
20080830 tpd src/algebra/boolean.spad graphviz dotfile decoration
20080830 tpd src/algebra/bags.spad graphviz dotfile decoration
20080830 tpd src/algebra/algcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/aggcat2.spad graphviz dotfile decoration
20080830 tpd src/algebra/acplot.spad graphviz dotfile decoration
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/acplot.spad.pamphlet
trunk/axiom/src/algebra/aggcat2.spad.pamphlet
trunk/axiom/src/algebra/algcat.spad.pamphlet
trunk/axiom/src/algebra/bags.spad.pamphlet
trunk/axiom/src/algebra/boolean.spad.pamphlet
trunk/axiom/src/algebra/catdef.spad.pamphlet
trunk/axiom/src/algebra/coerce.spad.pamphlet
trunk/axiom/src/algebra/equation1.spad.pamphlet
trunk/axiom/src/algebra/integer.spad.pamphlet
trunk/axiom/src/algebra/misc.spad.pamphlet
trunk/axiom/src/algebra/omcat.spad.pamphlet
trunk/axiom/src/algebra/patmatch1.spad.pamphlet
trunk/axiom/src/algebra/pattern.spad.pamphlet
trunk/axiom/src/algebra/pscat.spad.pamphlet
trunk/axiom/src/algebra/sf.spad.pamphlet
trunk/axiom/src/algebra/si.spad.pamphlet
trunk/axiom/src/algebra/trigcat.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/changelog 2008-08-31 04:30:08 UTC (rev 962)
@@ -1,3 +1,20 @@
+20080830 tpd src/algebra/trigcat.spad graphviz dotfile decoration
+20080830 tpd src/algebra/si.spad graphviz dotfile decoration
+20080830 tpd src/algebra/sf.spad graphviz dotfile decoration
+20080830 tpd src/algebra/pscat.spad graphviz dotfile decoration
+20080830 tpd src/algebra/pattern.spad graphviz dotfile decoration
+20080830 tpd src/algebra/patmatch1.spad graphviz dotfile decoration
+20080830 tpd src/algebra/omcat.spad graphviz dotfile decoration
+20080830 tpd src/algebra/misc.spad graphviz dotfile decoration
+20080830 tpd src/algebra/integer.spad graphviz dotfile decoration
+20080830 tpd src/algebra/equation1.spad graphviz dotfile decoration
+20080830 tpd src/algebra/coerce.spad graphviz dotfile decoration
+20080830 tpd src/algebra/catdef.spad graphviz dotfile decoration
+20080830 tpd src/algebra/boolean.spad graphviz dotfile decoration
+20080830 tpd src/algebra/bags.spad graphviz dotfile decoration
+20080830 tpd src/algebra/algcat.spad graphviz dotfile decoration
+20080830 tpd src/algebra/aggcat2.spad graphviz dotfile decoration
+20080830 tpd src/algebra/acplot.spad graphviz dotfile decoration
20080829 tpd src/algebra/aggcat.spad graphviz dotfile decoration
20080828 mxr src/interp/i-funsel.boot add cost to bottomUp output
20080827 wsp src/algebra/tex.spad change \over to \frac
Modified: trunk/axiom/src/algebra/acplot.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/acplot.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/acplot.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -164,6 +164,10 @@
@
\subsection{realsolv code}
+<<dot>>=
+"REALSOLV" -> "PACKAGE"
+"RealSolvePackage()" -> "Package"
+@
<<package REALSOLV RealSolvePackage>>=
)abbrev package REALSOLV RealSolvePackage
@@ -247,6 +251,10 @@
o $AXIOM/doc/src/algebra/acplot.spad.dvi
@
+<<dot>>=
+"ACPLOT" -> "PPCURVE"
+"PlaneAlgebraicCurvePlot()" -> "PlottablePlaneCurveCategory()"
+@
<<domain ACPLOT PlaneAlgebraicCurvePlot>>=
--% PlaneAlgebraicCurvePlot
++ Plot a NON-SINGULAR plane algebraic curve p(x,y) = 0.
Modified: trunk/axiom/src/algebra/aggcat2.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/aggcat2.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/aggcat2.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{package FLAGG2 FiniteLinearAggregateFunctions2}
+<<dot>>=
+"FLAGG2" -> "PACKAGE"
+"FiniteLinearAggregateFunctions2()" -> "Package"
+@
<<package FLAGG2 FiniteLinearAggregateFunctions2>>=
)abbrev package FLAGG2 FiniteLinearAggregateFunctions2
--% FiniteLinearAggregateFunctions2
@@ -126,6 +130,10 @@
@
\section{package FSAGG2 FiniteSetAggregateFunctions2}
+<<dot>>=
+"FSAGG2" -> "PACKAGE"
+"FiniteSetAggregateFunctions2()" -> "Package"
+@
<<package FSAGG2 FiniteSetAggregateFunctions2>>=
)abbrev package FSAGG2 FiniteSetAggregateFunctions2
Modified: trunk/axiom/src/algebra/algcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/algcat.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/algcat.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,11 @@
\tableofcontents
\eject
\section{category FINRALG FiniteRankAlgebra}
+<<dot>>=
+"FINRALG" -> "ALGEBRA"
+"FiniteRankAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "Algebra(a:CommutativeRing)"
+@
<<category FINRALG FiniteRankAlgebra>>=
)abbrev category FINRALG FiniteRankAlgebra
++ Author: Barry Trager
@@ -88,6 +93,11 @@
@
\section{category FRAMALG FramedAlgebra}
+<<dot>>=
+"FRAMALG" -> "FINRALG"
+"FramedAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "FiniteRankAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))"
+@
<<category FRAMALG FramedAlgebra>>=
)abbrev category FRAMALG FramedAlgebra
++ Author: Barry Trager
@@ -179,6 +189,23 @@
@
\section{category MONOGEN MonogenicAlgebra}
+<<dot>>=
+"MONOGEN" -> "FRAMALG"
+"MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "FramedAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))"
+"MONOGEN" -> "COMRING"
+"MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "CommutativeRing()"
+"MONOGEN" -> "KONVERT"
+"MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "ConvertibleTo(UnivariatePolynomialCategory(CommutativeRing))"
+"MONOGEN" -> "FRETRCT"
+"MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "FullyRetractableTo(a:CommutativeRing)"
+"MONOGEN" -> "FLINEXP"
+"MonogenicAlgebra(a:CommutativeRing,b:UnivariatePolynomialCategory(a))" ->
+ "FullyLinearlyExplicitRingOver(a:CommutativeRing)"
+@
<<category MONOGEN MonogenicAlgebra>>=
)abbrev category MONOGEN MonogenicAlgebra
++ Author: Barry Trager
@@ -257,6 +284,11 @@
@
\section{package CPIMA CharacteristicPolynomialInMonogenicalAlgebra}
+<<dot>>=
+"CPIMA" -> "PACKAGE"
+"CharacteristicPolynomialInMonogenicalAlgebra(a:COMRING,b:UPOLYC(a),c:MONOGEN(a,b))"
+ -> "Package"
+@
<<package CPIMA CharacteristicPolynomialInMonogenicalAlgebra>>=
)abbrev package CPIMA CharacteristicPolynomialInMonogenicalAlgebra
++ Author: Claude Quitte
@@ -294,6 +326,11 @@
@
\section{package NORMMA NormInMonogenicAlgebra}
+<<dot>>=
+"NORMMA" -> "PACKAGE"
+"NormInMonogenicAlgebra(a:GcdDomain,b:UPOLYC(a),c:MONOGEN(a,b),d:UPOLYC(c))"
+ -> "Package"
+@
<<package NORMMA NormInMonogenicAlgebra>>=
)abbrev package NORMMA NormInMonogenicAlgebra
++ Author: Manuel Bronstein
Modified: trunk/axiom/src/algebra/bags.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/bags.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/bags.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{domain STACK Stack}
+<<dot>>=
+"STACK" -> "SKAGG"
+"Stack(a:SetCategory)" -> "StackAggregate(a:SetCategory)"
+@
<<domain STACK Stack>>=
)abbrev domain STACK Stack
++ Author: Michael Monagan and Stephen Watt
@@ -32,7 +36,7 @@
++ stack([x,y,...,z]) creates a stack with first (top)
++ element x, second element y,...,and last element z.
++
- ++X a:Stack INT:= stack [1,2,3,4,5]
+ ++E a:Stack INT:= stack [1,2,3,4,5]
== add
Rep := Reference List S
@@ -59,6 +63,10 @@
@
\section{domain ASTACK ArrayStack}
+<<dot>>=
+"ASTACK" -> "STACK"
+"ArrayStack(a:SetCategory)" -> "Stack(a:SetCategory)"
+@
<<domain ASTACK ArrayStack>>=
)abbrev domain ASTACK ArrayStack
++ Author: Michael Monagan and Stephen Watt
@@ -81,7 +89,7 @@
++ arrayStack([x,y,...,z]) creates an array stack with first (top)
++ element x, second element y,...,and last element z.
++
- ++X c:ArrayStack INT:= arrayStack [1,2,3,4,5]
+ ++E c:ArrayStack INT:= arrayStack [1,2,3,4,5]
== add
Rep := IndexedFlexibleArray(S,0)
@@ -112,6 +120,10 @@
@
\section{domain QUEUE Queue}
+<<dot>>=
+"QUEUE" -> "QUAGG"
+"Queue(a:SetCategory)" -> "QueueAggregate(a:SetCategory)"
+@
<<domain QUEUE Queue>>=
)abbrev domain QUEUE Queue
++ Author: Michael Monagan and Stephen Watt
@@ -134,7 +146,7 @@
++ queue([x,y,...,z]) creates a queue with first (top)
++ element x, second element y,...,and last (bottom) element z.
++
- ++X e:Queue INT:= queue [1,2,3,4,5]
+ ++E e:Queue INT:= queue [1,2,3,4,5]
== Stack S add
Rep := Reference List S
@@ -159,6 +171,10 @@
@
\section{domain DEQUEUE Dequeue}
+<<dot>>=
+"DEQUEUE" -> "DQAGG"
+"Dequeue(a:SetCategory)" -> "DequeueAggregate(a:SetCategory)"
+@
<<domain DEQUEUE Dequeue>>=
)abbrev domain DEQUEUE Dequeue
++ Author: Michael Monagan and Stephen Watt
@@ -181,7 +197,7 @@
++ dequeue([x,y,...,z]) creates a dequeue with first (top or front)
++ element x, second element y,...,and last (bottom or back) element z.
++
- ++X g:Dequeue INT:= dequeue [1,2,3,4,5]
+ ++E g:Dequeue INT:= dequeue [1,2,3,4,5]
== Queue S add
Rep := Reference List S
@@ -352,6 +368,10 @@
o $AXIOM/doc/src/algebra/bags.spad.dvi
@
+<<dot>>=
+"HEAP" -> "PRQAGG"
+"Heap(a:OrderedSet)" -> "PriorityQueueAggregate(a:OrderedSet)"
+@
<<domain HEAP Heap>>=
)abbrev domain HEAP Heap
++ Author: Michael Monagan and Stephen Watt
@@ -376,7 +396,7 @@
++ heap(ls) creates a heap of elements consisting of the
++ elements of ls.
++
- ++X i:Heap INT := heap [1,6,3,7,5,2,4]
+ ++E i:Heap INT := heap [1,6,3,7,5,2,4]
Implementation == IndexedFlexibleArray(S,0) add
Rep := IndexedFlexibleArray( S,0)
Modified: trunk/axiom/src/algebra/boolean.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/boolean.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/boolean.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{domain REF Reference}
+<<dot>>=
+"REF" -> "TYPE"
+"Reference(a:Type)" -> "Type()"
+@
<<domain REF Reference>>=
)abbrev domain REF Reference
++ Author: Stephen M. Watt
@@ -95,6 +99,10 @@
(MAKEPROP (QUOTE |Reference|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (QUOTE |Rep|) (|Boolean|) |REF;=;2$B;1| |REF;ref;S$;2| |REF;elt;$S;3| |REF;setelt;$2S;4| |REF;deref;$S;5| |REF;setref;$2S;6| (|String|) (|OutputForm|) (0 . |message|) (5 . |coerce|) (|List| |$|) (10 . |prefix|) (16 . |coerce|) (|SingleInteger|))) (QUOTE #(|~=| 21 |setref| 27 |setelt| 33 |ref| 39 |latex| 44 |hash| 49 |elt| 54 |deref| 59 |coerce| 64 |=| 69)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE (1 0 1 1))) (CONS (QUOTE #(|SetCategory&| NIL |BasicType&| NIL)) (CONS (QUOTE #((|SetCategory|) (|Type|) (|BasicType|) (|CoercibleTo| 16))) (|makeByteWordVec2| 22 (QUOTE (1 16 0 15 17 1 6 16 0 18 2 16 0 0 19 20 1 0 16 0 21 2 1 8 0 0 1 2 0 6 0 6 14 2 0 6 0 6 12 1 0 0 6 10 1 1 15 0 1 1 1 22 0 1 1 0 6 0 11 1 0 6 0 13 1 1 16 0 21 2 0 8 0 0 9)))))) (QUOTE |lookupComplete|)))
@
\section{category LOGIC Logic}
+<<dot>>=
+"LOGIC" -> "BASTYPE"
+"Logic()" -> "BasicType()"
+@
<<category LOGIC Logic>>=
)abbrev category LOGIC Logic
++ Author:
@@ -106,8 +114,6 @@
++ Description:
++ `Logic' provides the basic operations for lattices,
++ e.g., boolean algebra.
-
-
Logic: Category == BasicType with
_~: % -> %
++ ~(x) returns the logical complement of x.
@@ -120,6 +126,16 @@
@
\section{domain BOOLEAN Boolean}
+<<dot>>=
+"BOOLEAN" -> "ORDSET"
+"Boolean()" -> "OrderedSet()"
+"BOOLEAN" -> "FINITE"
+"Boolean()" -> "Finite()"
+"BOOLEAN" -> "LOGIC"
+"Boolean()" -> "Logic()"
+"BOOLEAN" -> "KONVERT"
+"Boolean()" -> "ConvertibleTo(InputForm)"
+@
<<domain BOOLEAN Boolean>>=
)abbrev domain BOOLEAN Boolean
++ Author: Stephen M. Watt
@@ -458,6 +474,10 @@
@
\section{domain IBITS IndexedBits}
+<<dot>>=
+"IBITS" -> "BTAGG"
+"IndexedBits(a:Integer)" -> "BitAggregate()"
+@
<<domain IBITS IndexedBits>>=
)abbrev domain IBITS IndexedBits
++ Author: Stephen Watt and Michael Monagan
@@ -520,6 +540,10 @@
@
\section{domain BITS Bits}
+<<dot>>=
+"BITS" -> "BTAGG"
+"Bits()" -> "BitAggregate()"
+@
<<domain BITS Bits>>=
)abbrev domain BITS Bits
++ Author: Stephen M. Watt
Modified: trunk/axiom/src/algebra/catdef.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/catdef.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/catdef.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{category ABELGRP AbelianGroup}
+<<dot>>=
+"ABELGRP" -> "CABMON"
+"AbelianGroup()" -> "CancellationAbelianMonoid()"
+@
<<category ABELGRP AbelianGroup>>=
)abbrev category ABELGRP AbelianGroup
++ Author:
@@ -178,6 +182,10 @@
@
\section{category ABELMON AbelianMonoid}
+<<dot>>=
+"ABELMON" -> "ABELSG"
+"AbelianMonoid()" -> "AbelianSemiGroup()"
+@
<<category ABELMON AbelianMonoid>>=
)abbrev category ABELMON AbelianMonoid
++ Author:
@@ -367,6 +375,10 @@
@
\section{category ABELSG AbelianSemiGroup}
+<<dot>>=
+"ABELSG" -> "SETCAT"
+"AbelianSemiGroup()" -> "SetCategory()"
+@
<<category ABELSG AbelianSemiGroup>>=
)abbrev category ABELSG AbelianSemiGroup
++ Author:
@@ -521,6 +533,13 @@
(QUOTE |lookupComplete|)))
@
\section{category ALGEBRA Algebra}
+<<dot>>=
+"ALGEBRA" -> "RING"
+"Algebra(a:CommutativeRing)" -> "Ring()"
+"ALGEBRA" -> "MODULE"
+"Algebra(a:CommutativeRing)" -> "Module(a:CommutativeRing)"
+"Algebra(Fraction(Integer))" -> "Algebra(a:CommutativeRing)"
+@
<<category ALGEBRA Algebra>>=
)abbrev category ALGEBRA Algebra
++ Author:
@@ -551,6 +570,10 @@
@
\section{category BASTYPE BasicType}
+<<dot>>=
+"BASTYPE" -> "CATEGORY"
+"BasicType()" -> "Category"
+@
<<category BASTYPE BasicType>>=
)abbrev category BASTYPE BasicType
--% BasicType
@@ -574,6 +597,14 @@
@
\section{category BMODULE BiModule}
+<<dot>>=
+"BMODULE" -> "LMODULE"
+"BiModule(a:Ring,b:Ring)" -> "LeftModule(a:Ring)"
+"BiModule(a:CommutativeRing,b:CommutativeRing)" -> "BiModule(a:Ring,b:Ring)"
+"BiModule(a:Ring,b:OrderedAbelianMonoid)" -> "BiModule(a:Ring,b:Ring)"
+"BMODULE" -> "RMODULE"
+"BiModule(a:Ring,b:Ring)" -> "RightModule(a:Ring)"
+@
<<category BMODULE BiModule>>=
)abbrev category BMODULE BiModule
++ Author:
@@ -598,6 +629,10 @@
@
\section{category CABMON CancellationAbelianMonoid}
+<<dot>>=
+"CABMON" -> "ABELMON"
+"CancellationAbelianMonoid()" -> "AbelianMonoid()"
+@
<<category CABMON CancellationAbelianMonoid>>=
)abbrev category CABMON CancellationAbelianMonoid
++ Author:
@@ -681,6 +716,10 @@
@
\section{category CHARNZ CharacteristicNonZero}
+<<dot>>=
+"CHARNZ" -> "RING"
+"CharacteristicNonZero()" -> "Ring()"
+@
<<category CHARNZ CharacteristicNonZero>>=
)abbrev category CHARNZ CharacteristicNonZero
++ Author:
@@ -701,6 +740,10 @@
@
\section{category CHARZ CharacteristicZero}
+<<dot>>=
+"CHARZ" -> "RING"
+"CharacteristicZero()" -> "Ring()"
+@
<<category CHARZ CharacteristicZero>>=
)abbrev category CHARZ CharacteristicZero
++ Author:
@@ -718,6 +761,12 @@
@
\section{category COMRING CommutativeRing}
+<<dot>>=
+"COMRING" -> "RING"
+"CommutativeRing()" -> "Ring()"
+"COMRING" -> "BMODULE"
+"CommutativeRing()" -> "BiModule(a:Ring,b:Ring)"
+@
<<category COMRING CommutativeRing>>=
)abbrev category COMRING CommutativeRing
++ Author:
@@ -780,6 +829,10 @@
@
\section{category DIFRING DifferentialRing}
+<<dot>>=
+"DIFRING" -> "RING"
+"DifferentialRing()" -> "Ring()"
+@
<<category DIFRING DifferentialRing>>=
)abbrev category DIFRING DifferentialRing
++ Author:
@@ -945,6 +998,10 @@
@
\section{category DIFEXT DifferentialExtension}
+<<dot>>=
+"DIFEXT" -> "RING"
+"DifferentialExtension(a:Ring)" -> "Ring()"
+@
<<category DIFEXT DifferentialExtension>>=
)abbrev category DIFEXT DifferentialExtension
++ Author:
@@ -994,6 +1051,12 @@
@
\section{category DIVRING DivisionRing}
+<<dot>>=
+"DIVRING" -> "ENTIRER"
+"DivisionRing()" -> "EntireRing()"
+"DIVRING" -> "ALGEBRA"
+"DivisionRing()" -> "Algebra(Fraction(Integer))"
+@
<<category DIVRING DivisionRing>>=
)abbrev category DIVRING DivisionRing
++ Author:
@@ -1183,6 +1246,12 @@
@
\section{category ENTIRER EntireRing}
+<<dot>>=
+"ENTIRER" -> "RING"
+"EntireRing()" -> "Ring()"
+"ENTIRER" -> "BMODULE"
+"EntireRing()" -> "BiModule(a:Ring,b:Ring)"
+@
<<category ENTIRER EntireRing>>=
)abbrev category ENTIRER EntireRing
++ Author:
@@ -1249,6 +1318,10 @@
@
\section{category EUCDOM EuclideanDomain}
+<<dot>>=
+"EUCDOM" -> "PID"
+"EuclideanDomain()" -> "PrincipalIdealDomain()"
+@
<<category EUCDOM EuclideanDomain>>=
)abbrev category EUCDOM EuclideanDomain
++ Author:
@@ -2066,6 +2139,14 @@
<<EUCDOM-;MAKEPROP>>
@
\section{category FIELD Field}
+<<dot>>=
+"FIELD" -> "EUCDOM"
+"Field()" -> "EuclideanDomain()"
+"FIELD" -> "UFD"
+"Field()" -> "UniqueFactorizationDomain()"
+"FIELD" -> "DIVRING"
+"Field()" -> "DivisionRing()"
+@
<<category FIELD Field>>=
)abbrev category FIELD Field
++ Author:
@@ -2116,6 +2197,10 @@
@
\section{category FINITE Finite}
+<<dot>>=
+"FINITE" -> "SETCAT"
+"Finite()" -> "SetCategory()"
+@
<<category FINITE Finite>>=
)abbrev category FINITE Finite
++ Author:
@@ -2153,6 +2238,12 @@
@
\section{category FLINEXP FullyLinearlyExplicitRingOver}
+<<dot>>=
+"FLINEXP" -> "LINEXP"
+"FullyLinearlyExplicitRingOver(a:Ring)" -> "LinearlyExplicitRingOver(a:Ring)"
+"FullyLinearlyExplicitRingOver(a:CommutativeRing)" ->
+ "FullyLinearlyExplicitRingOver(a:Ring)"
+@
<<category FLINEXP FullyLinearlyExplicitRingOver>>=
)abbrev category FLINEXP FullyLinearlyExplicitRingOver
++ Author:
@@ -2185,6 +2276,10 @@
@
\section{category GCDDOM GcdDomain}
+<<dot>>=
+"GCDDOM" -> "INTDOM"
+"GcdDomain()" -> "IntegralDomain()"
+@
<<category GCDDOM GcdDomain>>=
)abbrev category GCDDOM GcdDomain
++ Author:
@@ -2575,6 +2670,10 @@
@
\section{category GROUP Group}
+<<dot>>=
+"GROUP" -> "MONOID"
+"Group()" -> "Monoid()"
+@
<<category GROUP Group>>=
)abbrev category GROUP Group
++ Author:
@@ -2620,6 +2719,14 @@
@
\section{category INTDOM IntegralDomain}
+<<dot>>=
+"INTDOM" -> "COMRING"
+"IntegralDomain()" -> "CommutativeRing()"
+"INTDOM" -> "ALGEBRA"
+"IntegralDomain()" -> "Algebra(a:CommutativeRing)"
+"INTDOM" -> "ENTIRER"
+"IntegralDomain()" -> "EntireRing()"
+@
<<category INTDOM IntegralDomain>>=
)abbrev category INTDOM IntegralDomain
++ Author:
@@ -2844,6 +2951,11 @@
@
\section{category LMODULE LeftModule}
+<<dot>>=
+"LMODULE" -> "ABELGRP"
+"LeftModule(a:Rng)" -> "AbelianGroup()"
+"LeftModule(a:Ring)" -> "LeftModule(a:Rng)"
+@
<<category LMODULE LeftModule>>=
)abbrev category LMODULE LeftModule
++ Author:
@@ -2871,6 +2983,11 @@
@
\section{category LINEXP LinearlyExplicitRingOver}
+<<dot>>=
+"LINEXP" -> "RING"
+"LinearlyExplicitRingOver(a:Ring)" -> "Ring()"
+"LinearlyExplicitRingOver(Integer)" -> "LinearlyExplicitRingOver(a:Ring)"
+@
<<category LINEXP LinearlyExplicitRingOver>>=
)abbrev category LINEXP LinearlyExplicitRingOver
++ Author:
@@ -2894,6 +3011,11 @@
@
\section{category MODULE Module}
+<<dot>>=
+"MODULE" -> "BMODULE"
+"Module(a:CommutativeRing)" -> "BiModule(a:CommutativeRing,b:CommutativeRing)"
+"Module(Field)" -> "Module(a:CommutativeRing)"
+@
<<category MODULE Module>>=
)abbrev category MODULE Module
++ Author:
@@ -2919,6 +3041,10 @@
@
\section{category MONOID Monoid}
+<<dot>>=
+"MONOID" -> "SGROUP"
+"Monoid()" -> "SemiGroup()"
+@
<<category MONOID Monoid>>=
)abbrev category MONOID Monoid
++ Author:
@@ -3095,6 +3221,12 @@
@
\section{category OAGROUP OrderedAbelianGroup}
+<<dot>>=
+"OAGROUP" -> "OCAMON"
+"OrderedAbelianGroup()" -> "OrderedCancellationAbelianMonoid()"
+"OAGROUP" -> "ABELGRP"
+"OrderedAbelianGroup()" -> "AbelianGroup()"
+@
<<category OAGROUP OrderedAbelianGroup>>=
)abbrev category OAGROUP OrderedAbelianGroup
++ Author:
@@ -3115,6 +3247,12 @@
@
\section{category OAMON OrderedAbelianMonoid}
+<<dot>>=
+"OAMON" -> "OASGP"
+"OrderedAbelianMonoid()" -> "OrderedAbelianSemiGroup()"
+"OAMON" -> "ABELMON"
+"OrderedAbelianMonoid()" -> "AbelianMonoid()"
+@
<<category OAMON OrderedAbelianMonoid>>=
)abbrev category OAMON OrderedAbelianMonoid
++ Author:
@@ -3135,6 +3273,10 @@
@
\section{category OAMONS OrderedAbelianMonoidSup}
+<<dot>>=
+"OAMONS" -> "OCAMON"
+"OrderedAbelianMonoidSup()" -> "OrderedCancellationAbelianMonoid()"
+@
<<category OAMONS OrderedAbelianMonoidSup>>=
)abbrev category OAMONS OrderedAbelianMonoidSup
++ Author:
@@ -3165,6 +3307,12 @@
@
\section{category OASGP OrderedAbelianSemiGroup}
+<<dot>>=
+"OASGP" -> "ORDSET"
+"OrderedAbelianSemiGroup()" -> "OrderedSet()"
+"OASGP" -> "ABELMON"
+"OrderedAbelianSemiGroup()" -> "AbelianMonoid()"
+@
<<category OASGP OrderedAbelianSemiGroup>>=
)abbrev category OASGP OrderedAbelianSemiGroup
++ Author:
@@ -3185,6 +3333,12 @@
@
\section{category OCAMON OrderedCancellationAbelianMonoid}
+<<dot>>=
+"OCAMON" -> "OAMON"
+"OrderedCancellationAbelianMonoid()" -> "OrderedAbelianMonoid()"
+"OCAMON" -> "CABMON"
+"OrderedCancellationAbelianMonoid()" -> "CancellationAbelianMonoid()"
+@
<<category OCAMON OrderedCancellationAbelianMonoid>>=
)abbrev category OCAMON OrderedCancellationAbelianMonoid
++ Author:
@@ -3205,6 +3359,12 @@
@
\section{category ORDFIN OrderedFinite}
+<<dot>>=
+"ORDFIN" -> "ORDSET"
+"OrderedFinite()" -> "OrderedSet()"
+"ORDFIN" -> "FINITE"
+"OrderedFinite()" -> "Finite()"
+@
<<category ORDFIN OrderedFinite>>=
)abbrev category ORDFIN OrderedFinite
++ Author:
@@ -3223,6 +3383,12 @@
@
\section{category OINTDOM OrderedIntegralDomain}
+<<dot>>=
+"OINTDOM" -> "INTDOM"
+"OrderedIntegralDomain()" -> "IntegralDomain()"
+"OINTDOM" -> "ORDRING"
+"OrderedIntegralDomain()" -> "OrderedRing()"
+@
<<category OINTDOM OrderedIntegralDomain>>=
)abbrev category OINTDOM OrderedIntegralDomain
++ Author: JH Davenport (after L Gonzalez-Vega)
@@ -3275,6 +3441,12 @@
@
\section{category ORDMON OrderedMonoid}
+<<dot>>=
+"ORDMON" -> "ORDSET"
+"OrderedMonoid()" -> "OrderedSet()"
+"ORDMON" -> "MONOID"
+"OrderedMonoid()" -> "Monoid()"
+@
<<category ORDMON OrderedMonoid>>=
)abbrev category ORDMON OrderedMonoid
++ Author:
@@ -3298,6 +3470,14 @@
@
\section{category ORDRING OrderedRing}
+<<dot>>=
+"ORDRING" -> "OAGROUP"
+"OrderedRing()" -> "OrderedAbelianGroup()"
+"ORDRING" -> "RING"
+"OrderedRing()" -> "Ring()"
+"ORDRING" -> "MONOID"
+"OrderedRing()" -> "Monoid()"
+@
<<category ORDRING OrderedRing>>=
)abbrev category ORDRING OrderedRing
++ Author:
@@ -3474,6 +3654,10 @@
(QUOTE |lookupComplete|)))
@
\section{category ORDSET OrderedSet}
+<<dot>>=
+"ORDSET" -> "SETCAT"
+"OrderedSet()" -> "SetCategory()"
+@
<<category ORDSET OrderedSet>>=
)abbrev category ORDSET OrderedSet
++ Author:
@@ -3522,6 +3706,12 @@
@
\section{category PDRING PartialDifferentialRing}
+<<dot>>=
+"PDRING" -> "RING"
+"PartialDifferentialRing(a:SetCategory)" -> "Ring()"
+"PartialDifferentialRing(a:OrderedSet)" ->
+ "PartialDifferentialRing(a:SetCategory)"
+@
<<category PDRING PartialDifferentialRing>>=
)abbrev category PDRING PartialDifferentialRing
++ Author:
@@ -3586,6 +3776,10 @@
@
\section{category PFECAT PolynomialFactorizationExplicit}
+<<dot>>=
+"PFECAT" -> "UFD"
+"PolynomialFactorizationExplicit()" -> "UniqueFactorizationDomain()"
+@
<<category PFECAT PolynomialFactorizationExplicit>>=
)abbrev category PFECAT PolynomialFactorizationExplicit
++ Author: James Davenport
@@ -3671,6 +3865,10 @@
@
\section{category PID PrincipalIdealDomain}
+<<dot>>=
+"PID" -> "GCDDOM"
+"PrincipalIdealDomain()" -> "GcdDomain()"
+@
<<category PID PrincipalIdealDomain>>=
)abbrev category PID PrincipalIdealDomain
++ Author:
@@ -3704,6 +3902,11 @@
@
\section{category RMODULE RightModule}
+<<dot>>=
+"RMODULE" -> "ABELGRP"
+"RightModule(a:Rng)" -> "AbelianGroup()"
+"RightModule(a:Ring)" -> "RightModule(a:Rng)"
+@
<<category RMODULE RightModule>>=
)abbrev category RMODULE RightModule
++ Author:
@@ -3731,6 +3934,14 @@
@
\section{category RING Ring}
+<<dot>>=
+"RING" -> "RNG"
+"Ring()" -> "Rng()"
+"RING" -> "MONOID"
+"Ring()" -> "Monoid()"
+"RING" -> "LMODULE"
+"Ring()" -> "LeftModule(a:Ring)"
+@
<<category RING Ring>>=
)abbrev category RING Ring
++ Author:
@@ -3865,6 +4076,12 @@
@
\section{category RNG Rng}
+<<dot>>=
+"RNG" -> "ABELGRP"
+"Rng()" -> "AbelianGroup()"
+"RNG" -> "SGROUP"
+"Rng()" -> "SemiGroup()"
+@
<<category RNG Rng>>=
)abbrev category RNG Rng
++ Author:
@@ -3930,6 +4147,10 @@
\item a binary multiplicative operator ``*''
\item associative. $\forall a,b,c \in S, a*(b*c) = (a*b)*c$
\end{itemize}
+<<dot>>=
+"SGROUP" -> "SETCAT"
+"SemiGroup()" -> "SetCategory()"
+@
<<category SGROUP SemiGroup>>=
)abbrev category SGROUP SemiGroup
++ Author:
@@ -3964,6 +4185,12 @@
@
\section{category SETCAT SetCategory}
+<<dot>>=
+"SETCAT" -> "BASTYPE"
+"SetCategory()" -> "BasicType()"
+"SETCAT" -> "KOERCE"
+"SetCategory()" -> "CoercibleTo(OutputForm)"
+@
<<category SETCAT SetCategory>>=
)abbrev category SETCAT SetCategory
++ Author:
@@ -4119,6 +4346,10 @@
@
\section{category STEP StepThrough}
+<<dot>>=
+"STEP" -> "SETCAT"
+"StepThrough()" -> "SetCategory()"
+@
<<category STEP StepThrough>>=
)abbrev category STEP StepThrough
++ Author:
@@ -4151,6 +4382,10 @@
@
\section{category UFD UniqueFactorizationDomain}
+<<dot>>=
+"UFD" -> "GCDDOM"
+"UniqueFactorizationDomain()" -> "GcdDomain()"
+@
<<category UFD UniqueFactorizationDomain>>=
)abbrev category UFD UniqueFactorizationDomain
++ Author:
@@ -4366,6 +4601,10 @@
@
\section{category VSPACE VectorSpace}
+<<dot>>=
+"VSPACE" -> "MODULE"
+"VectorSpace(a:Field)" -> "Module(Field)"
+@
<<category VSPACE VectorSpace>>=
)abbrev category VSPACE VectorSpace
++ Author:
Modified: trunk/axiom/src/algebra/coerce.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/coerce.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/coerce.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{category TYPE Type}
+<<dot>>=
+"TYPE" -> "CATEGORY"
+"Type()" -> "Category"
+@
<<category TYPE Type>>=
)abbrev category TYPE Type
++ The new fundamental Type (keeping Object for 1.5 as well)
@@ -21,6 +25,12 @@
@
\section{category KOERCE CoercibleTo}
+<<dot>>=
+"KOERCE" -> "CATEGORY"
+"CoercibleTo(a:Type)" -> "Category"
+"CoercibleTo(OutputForm)" ->
+ "CoercibleTo(a:Type)"
+@
<<category KOERCE CoercibleTo>>=
)abbrev category KOERCE CoercibleTo
++ Category for coerce
@@ -36,6 +46,26 @@
@
\section{category KONVERT ConvertibleTo}
+<<dot>>=
+"KONVERT" -> "CATEGORY"
+"ConvertibleTo(a:Type)" -> "Category"
+"ConvertibleTo(DoubleFloat)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Float)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(InputForm)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Integer)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Pattern(Integer))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Pattern(Float))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Complex(Float))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Complex(DoubleFloat))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(String)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Symbol)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(SExpression)" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(Pattern(Base))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(List(Integer))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(List(Character))" -> "ConvertibleTo(a:Type)"
+"ConvertibleTo(UnivariatePolynomialCategory(CommutativeRing))" ->
+ "ConvertibleTo(a:Type)"
+@
<<category KONVERT ConvertibleTo>>=
)abbrev category KONVERT ConvertibleTo
++ Category for convert
@@ -52,6 +82,16 @@
@
\section{category RETRACT RetractableTo}
+<<dot>>=
+"RETRACT" -> "CATEGORY"
+"RetractableTo(a:Type)" -> "Category"
+"RetractableTo(SetCategory)" -> "RetractableTo(a:Type)"
+"RetractableTo(Symbol)" -> "RetractableTo(a:Type)"
+"RetractableTo(Integer)" -> "RetractableTo(a:Type)"
+"RetractableTo(NonNegativeInteger)" -> "RetractableTo(a:Type)"
+"RetractableTo(Fraction(Integer))" -> "RetractableTo(a:Type)"
+"RetractableTo(Float)" -> "RetractableTo(a:Type)"
+@
<<category RETRACT RetractableTo>>=
)abbrev category RETRACT RetractableTo
++ Category for retract
Modified: trunk/axiom/src/algebra/equation1.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/equation1.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/equation1.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,14 @@
\tableofcontents
\eject
\section{category IEVALAB InnerEvalable}
+<<dot>>=
+"IEVALAB" -> "CATEGORY"
+"InnerEvalable(a:SetCategory,b:Type)" -> "Category"
+"InnerEvalable(a:SetCategory,b:SetCategory)" ->
+ "InnerEvalable(a:SetCategory,b:Type)"
+"InnerEvalable(a:Ring,MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet))"
+ -> "InnerEvalable(a:SetCategory,b:Type)"
+@
<<category IEVALAB InnerEvalable>>=
)abbrev category IEVALAB InnerEvalable
-- FOR THE BENEFIT OF LIBAX0 GENERATION
@@ -40,6 +48,12 @@
@
\section{category EVALAB Evalable}
+<<dot>>=
+"EVALAB" -> "IEVALAB"
+"Evalable(a:SetCategory)" -> "InnerEvalable(a:SetCategory,b:SetCategory)"
+"Evalable(MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet))" ->
+ "Evalable(a:SetCategory)"
+@
<<category EVALAB Evalable>>=
)abbrev category EVALAB Evalable
++ Author:
Modified: trunk/axiom/src/algebra/integer.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/integer.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/integer.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{package INTSLPE IntegerSolveLinearPolynomialEquation}
+<<dot>>=
+"INTSLPE" -> "PACKAGE"
+"IntegerSolveLinearPolynomialEquation()" -> "Package"
+@
<<package INTSLPE IntegerSolveLinearPolynomialEquation>>=
)abbrev package INTSLPE IntegerSolveLinearPolynomialEquation
++ Author: Davenport
@@ -722,6 +726,14 @@
o $AXIOM/doc/src/algebra/integer.spad.dvi
@
+<<dot>>=
+"INT" -> "INS"
+"Integer()" -> "IntegerNumberSystem()"
+"INT" -> "KONVERT"
+"Integer()" -> "ConvertibleTo(String)"
+"INT" -> "OM"
+"Integer()" -> "OpenMath()"
+@
<<domain INT Integer>>=
)abbrev domain INT Integer
++ Author:
@@ -1111,6 +1123,12 @@
(MAKEPROP (QUOTE |Integer|) (QUOTE NILADIC) T)
@
\section{domain NNI NonNegativeInteger}
+<<dot>>=
+"NNI" -> "OAMONS"
+"NonNegativeInteger()" -> "OrderedAbelianMonoidSup()"
+"NNI" -> "MONOID"
+"NonNegativeInteger()" -> "Monoid()"
+@
<<domain NNI NonNegativeInteger>>=
)abbrev domain NNI NonNegativeInteger
++ Author:
@@ -1313,6 +1331,12 @@
@
\section{domain PI PositiveInteger}
+<<dot>>=
+"PI" -> "OASGP"
+"PositiveInteger()" -> "OrderedAbelianSemiGroup()"
+"PI" -> "MONOID"
+"PositiveInteger()" -> "Monoid()"
+@
<<domain PI PositiveInteger>>=
)abbrev domain PI PositiveInteger
++ Author:
@@ -1719,6 +1743,10 @@
o $AXIOM/doc/src/algebra/integer.spad.dvi
@
+<<dot>>=
+"ROMAN" -> "INS"
+"RomanNumeral()" -> "IntegerNumberSystem()"
+@
<<domain ROMAN RomanNumeral>>=
)abbrev domain ROMAN RomanNumeral
++ Author:
Modified: trunk/axiom/src/algebra/misc.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/misc.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/misc.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{domain SAOS SingletonAsOrderedSet}
+<<dot>>=
+"SAOS" -> "ORDSET"
+"SingletonAsOrderedSet()" -> "OrderedSet()"
+@
<<domain SAOS SingletonAsOrderedSet>>=
)abbrev domain SAOS SingletonAsOrderedSet
++ This trivial domain lets us build Univariate Polynomials
Modified: trunk/axiom/src/algebra/omcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/omcat.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/omcat.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{category OM OpenMath}
+<<dot>>=
+"OM" -> "CATEGORY"
+"OpenMath()" -> "Category"
+@
<<category OM OpenMath>>=
)abbrev category OM OpenMath
++ Author: Mike Dewar & Vilya Harvey
Modified: trunk/axiom/src/algebra/patmatch1.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/patmatch1.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/patmatch1.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{domain PATRES PatternMatchResult}
+<<dot>>=
+"PATRES" -> "SETCAT"
+"PatternMatchResult(a:SetCategory, b:SetCategory)" -> "SetCategory()"
+@
<<domain PATRES PatternMatchResult>>=
)abbrev domain PATRES PatternMatchResult
++ Result returned by the pattern matcher
@@ -113,6 +117,11 @@
@
\section{package PATRES2 PatternMatchResultFunctions2}
+<<dot>>=
+"PATRES2" -> "PACKAGE"
+"PatternMatchResultFunctions2(a:SetCategory,b:SetCategory,c:SetCategory)" ->
+ "Package"
+@
<<package PATRES2 PatternMatchResultFunctions2>>=
)abbrev package PATRES2 PatternMatchResultFunctions2
++ Lifts maps to pattern matching results
@@ -138,6 +147,11 @@
@
\section{domain PATLRES PatternMatchListResult}
+<<dot>>=
+"PATLRES" -> "SETCAT"
+"PatternMatchListResult(a:SETCAT,b:SETCAT,c:LSAGG(SETCAT))"
+ -> "SetCategory()"
+@
<<domain PATLRES PatternMatchListResult>>=
)abbrev domain PATLRES PatternMatchListResult
++ Result returned by the pattern matcher when using lists
@@ -186,6 +200,12 @@
@
\section{category PATMAB PatternMatchable}
+<<dot>>=
+"PATMAB" -> "SETCAT"
+"PatternMatchable(a:SetCategory)" -> "SetCategory()"
+"PatternMatchable(Integer)" -> "PatternMatchable(a:SetCategory)"
+"PatternMatchable(Float)" -> "PatternMatchable(a:SetCategory)"
+@
<<category PATMAB PatternMatchable>>=
)abbrev category PATMAB PatternMatchable
++ Category of sets that can be pattern-matched on
@@ -207,6 +227,10 @@
@
\section{category FPATMAB FullyPatternMatchable}
+<<dot>>=
+"FPATMAB" -> "TYPE"
+"FullyPatternMatchable(a:Type)" -> "Type()"
+@
<<category FPATMAB FullyPatternMatchable>>=
)abbrev category FPATMAB FullyPatternMatchable
++ Category of sets that can be pattern-matched on
@@ -224,6 +248,10 @@
@
\section{package PMSYM PatternMatchSymbol}
+<<dot>>=
+"PMSYM" -> "PACKAGE"
+"PatternMatchSymbol(a:SetCategory)" -> "Package"
+@
<<package PMSYM PatternMatchSymbol>>=
)abbrev package PMSYM PatternMatchSymbol
++ Pattern matching on symbols
@@ -252,6 +280,10 @@
@
\section{package PMKERNEL PatternMatchKernel}
+<<dot>>=
+"PMKERNEL" -> "PACKAGE"
+"PatternMatchKernel(a:SetCategory, b:Join(...))" -> "Package"
+@
<<package PMKERNEL PatternMatchKernel>>=
)abbrev package PMKERNEL PatternMatchKernel
++ Pattern matching on kernels
@@ -349,6 +381,11 @@
@
\section{package PMDOWN PatternMatchPushDown}
+<<dot>>=
+"PMDOWN" -> "PACKAGE"
+"PatternMatchPushDown(a:SETCAT, b:PATMAB(SETCAT), c:Join(...))"
+ -> "Package"
+@
<<package PMDOWN PatternMatchPushDown>>=
)abbrev package PMDOWN PatternMatchPushDown
++ Pattern matching in towers
@@ -449,6 +486,10 @@
@
\section{package PMTOOLS PatternMatchTools}
+<<dot>>=
+"PMTOOLS" -> "PACKAGE"
+"PatternMatchTools(a:SetCategory,b:Join(...),c:Join(...))" -> "Package"
+@
<<package PMTOOLS PatternMatchTools>>=
)abbrev package PMTOOLS PatternMatchTools
++ Tools for the pattern matcher
@@ -613,6 +654,11 @@
@
\section{package PMLSAGG PatternMatchListAggregate}
+<<dot>>=
+"PMLSAGG" -> "PACKAGE"
+"PatternMatchListAggregate(a:SETCAT,b:PATMAB(SETCAT),c:LSAGG(PATMAB(SETCAT)))"
+ -> "Package"
+@
<<package PMLSAGG PatternMatchListAggregate>>=
)abbrev package PMLSAGG PatternMatchListAggregate
++ Pattern matching for list aggregates
Modified: trunk/axiom/src/algebra/pattern.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/pattern.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/pattern.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,12 @@
\tableofcontents
\eject
\section{domain PATTERN Pattern}
+<<dot>>=
+"RETRACT" -> "CATEGORY"
+"RetractableTo(a:Type)" -> "Category"
+"RetractableTo(SetCategory)" -> "RetractableTo(a:Type)"
+"RetractableTo(Symbol)" -> "RetractableTo(a:Type)"
+@
<<domain PATTERN Pattern>>=
)abbrev domain PATTERN Pattern
++ Patterns for use by the pattern matcher
@@ -386,6 +392,10 @@
@
\section{package PATTERN1 PatternFunctions1}
+<<dot>>=
+"PATTERN1" -> "PACKAGE"
+"PatternFunctions1(a:SetCategory,b:Type)" -> "Package"
+@
<<package PATTERN1 PatternFunctions1>>=
)abbrev package PATTERN1 PatternFunctions1
++ Utilities for handling patterns
@@ -450,6 +460,10 @@
@
\section{package PATTERN2 PatternFunctions2}
+<<dot>>=
+"PATTERN2" -> "PACKAGE"
+"PatternFunctions2(a:SetCategory,b:SetCategory)" -> "Package"
+@
<<package PATTERN2 PatternFunctions2>>=
)abbrev package PATTERN2 PatternFunctions2
++ Lifting of maps to patterns
@@ -489,6 +503,10 @@
@
\section{category PATAB Patternable}
+<<dot>>=
+"PATAB" -> "CATEGORY"
+"Patternable(a:Type)" -> "Category"
+@
<<category PATAB Patternable>>=
)abbrev category PATAB Patternable
++ Category of sets that can be converted to useful patterns
Modified: trunk/axiom/src/algebra/pscat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/pscat.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/pscat.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,15 @@
\tableofcontents
\eject
\section{category PSCAT PowerSeriesCategory}
+<<dot>>=
+"PSCAT" -> "AMR"
+"PowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid,c:OrderedSet)" ->
+ "AbelianMonoidRing(a:Ring,b:OrderedAbelianMonoid)"
+"PowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid,c:SingletonAsOrderedSet)"
+ -> "PowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid,c:OrderedSet)"
+"PowerSeriesCategory(a:Ring,IndexedExponents(b:OrderedSet),c:OrderedSet))"
+ -> "PowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid,c:OrderedSet)"
+@
<<category PSCAT PowerSeriesCategory>>=
)abbrev category PSCAT PowerSeriesCategory
++ Author: Clifton J. Williamson
@@ -71,6 +80,17 @@
@
\section{category UPSCAT UnivariatePowerSeriesCategory}
+<<dot>>=
+"UPSCAT" -> "PSCAT"
+"UnivariatePowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid)" ->
+ "PowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid,c:SingletonAsOrderedSet)"
+"UnivariatePowerSeriesCategory(a:Ring,NonNegativeInteger)" ->
+ "UnivariatePowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid)"
+"UnivariatePowerSeriesCategory(a:Ring,Integer)" ->
+ "UnivariatePowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid)"
+"UnivariatePowerSeriesCategory(a:Ring,Fraction(Integer))" ->
+ "UnivariatePowerSeriesCategory(a:Ring,b:OrderedAbelianMonoid)"
+@
<<category UPSCAT UnivariatePowerSeriesCategory>>=
)abbrev category UPSCAT UnivariatePowerSeriesCategory
++ Author: Clifton J. Williamson
@@ -168,6 +188,11 @@
@
\section{category UTSCAT UnivariateTaylorSeriesCategory}
+<<dot>>=
+"UTSCAT" -> "UPSCAT"
+"UnivariateTaylorSeriesCategory(a:Ring)" ->
+ "UnivariatePowerSeriesCategory(a:Ring,NonNegativeInteger)"
+@
<<category UTSCAT UnivariateTaylorSeriesCategory>>=
)abbrev category UTSCAT UnivariateTaylorSeriesCategory
++ Author: Clifton J. Williamson
@@ -404,6 +429,11 @@
@
\section{category ULSCAT UnivariateLaurentSeriesCategory}
+<<dot>>=
+"ULSCAT" -> "UPSCAT"
+"UnivariateLaurentSeriesCategory(a:Ring)" ->
+ "UnivariatePowerSeriesCategory(a:Ring,Integer)"
+@
<<category ULSCAT UnivariateLaurentSeriesCategory>>=
)abbrev category ULSCAT UnivariateLaurentSeriesCategory
++ Author: Clifton J. Williamson
@@ -496,6 +526,11 @@
(DEFUN |UnivariateLaurentSeriesCategory;| (|t#1|) (PROG (#1=#:G83277) (RETURN (PROG1 (LETT #1# (|sublisV| (PAIR (QUOTE (|t#1|)) (LIST (|devaluate| |t#1|))) (|sublisV| (PAIR (QUOTE (#2=#:G83276)) (LIST (QUOTE (|Integer|)))) (COND (|UnivariateLaurentSeriesCategory;CAT|) ((QUOTE T) (LETT |UnivariateLaurentSeriesCategory;CAT| (|Join| (|UnivariatePowerSeriesCategory| (QUOTE |t#1|) (QUOTE #2#)) (|mkCategory| (QUOTE |domain|) (QUOTE (((|series| (|$| (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |t#1|))))) T) ((|multiplyCoefficients| (|$| (|Mapping| |t#1| (|Integer|)) |$|)) T) ((|rationalFunction| ((|Fraction| (|Polynomial| |t#1|)) |$| (|Integer|))) (|has| |t#1| (|IntegralDomain|))) ((|rationalFunction| ((|Fraction| (|Polynomial| |t#1|)) |$| (|Integer|) (|Integer|))) (|has| |t#1| (|IntegralDomain|))) ((|integrate| (|$| |$|)) (|has| |t#1| (|Algebra| (|Fraction| (|Integer|))))) ((|integrate| (|$| |$| (|Symbol|))) (AND (|has| |t#1| (SIGNATURE |variables| ((|List| (|Symbol|)) |t#1|))) (|has| |t#1| (SIGNATURE |integrate| (|t#1| |t#1| (|Symbol|)))) (|has| |t#1| (|Algebra| (|Fraction| (|Integer|)))))) ((|integrate| (|$| |$| (|Symbol|))) (AND (|has| |t#1| (|AlgebraicallyClosedFunctionSpace| (|Integer|))) (|has| |t#1| (|PrimitiveFunctionCategory|)) (|has| |t#1| (|TranscendentalFunctionCategory|)) (|has| |t#1| (|Algebra| (|Fraction| (|Integer|)))))))) (QUOTE (((|RadicalCategory|) (|has| |t#1| (|Algebra| (|Fraction| (|Integer|))))) ((|TranscendentalFunctionCategory|) (|has| |t#1| (|Algebra| (|Fraction| (|Integer|))))) ((|Field|) (|has| |t#1| (|Field|))))) (QUOTE ((|Symbol|) (|Fraction| (|Polynomial| |t#1|)) (|Integer|) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |t#1|))))) NIL)) . #3=(|UnivariateLaurentSeriesCategory|)))))) . #3#) (SETELT #1# 0 (LIST (QUOTE |UnivariateLaurentSeriesCategory|) (|devaluate| |t#1|)))))))
@
\section{category UPXSCAT UnivariatePuiseuxSeriesCategory}
+<<dot>>=
+"UPXSCAT" -> "UPSCAT"
+"UnivariatePuiseuxSeriesCategory(a:Ring)" ->
+ "UnivariatePowerSeriesCategory(a:Ring,Fraction(Integer))"
+@
<<category UPXSCAT UnivariatePuiseuxSeriesCategory>>=
)abbrev category UPXSCAT UnivariatePuiseuxSeriesCategory
++ Author: Clifton J. Williamson
@@ -558,6 +593,20 @@
@
\section{category MTSCAT MultivariateTaylorSeriesCategory}
+<<dot>>=
+"MTSCAT" -> "PDRING"
+"MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet)" ->
+ "PartialDifferentialRing(a:OrderedSet)"
+"MTSCAT" -> "PSCAT"
+"MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet)" ->
+ "PowerSeriesCategory(a:Ring,IndexedExponents(b:OrderedSet),c:OrderedSet))"
+"MTSCAT" -> "IEVALAB"
+"MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet)" ->
+ "InnerEvalable(a:Ring,MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet))"
+"MTSCAT" -> "EVALAB"
+"MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet)" ->
+ "Evalable(MultivariateTaylorSeriesCategory(a:Ring,b:OrderedSet))"
+@
<<category MTSCAT MultivariateTaylorSeriesCategory>>=
)abbrev category MTSCAT MultivariateTaylorSeriesCategory
++ Author: Clifton J. Williamson
Modified: trunk/axiom/src/algebra/sf.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/sf.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/sf.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,11 @@
\tableofcontents
\eject
\section{category REAL RealConstant}
+<<dot>>=
+"REAL" -> "KONVERT"
+"RealConstant()" -> "ConvertibleTo(DoubleFloat)"
+"RealConstant()" -> "ConvertibleTo(Float)"
+@
<<category REAL RealConstant>>=
)abbrev category REAL RealConstant
++ Author:
@@ -28,6 +33,10 @@
@
\section{category RADCAT RadicalCategory}
+<<dot>>=
+"RADCAT" -> "CATEGORY"
+"RadicalCategory()" -> "Category"
+@
<<category RADCAT RadicalCategory>>=
)abbrev category RADCAT RadicalCategory
++ Author:
@@ -50,6 +59,25 @@
@
\section{category RNS RealNumberSystem}
+<<dot>>=
+"RNS" -> "FIELD"
+"RealNumberSystem()" -> "Field()"
+"RNS" -> "ORDRING"
+"RealNumberSystem()" -> "OrderedRing()"
+"RNS" -> "REAL"
+"RealNumberSystem()" -> "RealConstant()"
+"RNS" -> "RETRACT"
+"RealNumberSystem()" -> "RetractableTo(Integer)"
+"RealNumberSystem()" -> "RetractableTo(Fraction(Integer))"
+"RNS" -> "RADCAT"
+"RealNumberSystem()" -> "RadicalCategory()"
+"RNS" -> "KONVERT"
+"RealNumberSystem()" -> "ConvertibleTo(Pattern(Float))"
+"RNS" -> "PATMAB"
+"RealNumberSystem()" -> "PatternMatchable(Float)"
+"RNS" -> "CHARZ"
+"RealNumberSystem()" -> "CharacteristicZero()"
+@
<<category RNS RealNumberSystem>>=
)abbrev category RNS RealNumberSystem
++ Author: Michael Monagan and Stephen M. Watt
@@ -395,6 +423,10 @@
@
\section{category FPS FloatingPointSystem}
+<<dot>>=
+"FPS" -> "RNS"
+"FloatingPointSystem()" -> "RealNumberSystem()"
+@
<<category FPS FloatingPointSystem>>=
)abbrev category FPS FloatingPointSystem
++ Author:
@@ -411,9 +443,11 @@
++ exactly representable by floating point numbers.
++ A floating point system is characterized by the following:
++
-++ 1: \spadfunFrom{base}{FloatingPointSystem} of the \spadfunFrom{exponent}{FloatingPointSystem}.
-++ (actual implemenations are usually binary or decimal)
-++ 2: \spadfunFrom{precision}{FloatingPointSystem} of the \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)
+++ 1: \spadfunFrom{base}{FloatingPointSystem} of the
+++ \spadfunFrom{exponent}{FloatingPointSystem}.
+++ (actual implemenations are usually binary or decimal)
+++ 2: \spadfunFrom{precision}{FloatingPointSystem} of the
+++ \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)
++ 3: rounding error for operations
--++ 4: when, and what happens if exponent overflow/underflow occurs
++
@@ -433,9 +467,13 @@
++ order x is the order of magnitude of x.
++ Note: \spad{base ** order x <= |x| < base ** (1 + order x)}.
base: () -> PositiveInteger
- ++ base() returns the base of the \spadfunFrom{exponent}{FloatingPointSystem}.
+ ++ base() returns the base of the
+ ++\spadfunFrom{exponent}{FloatingPointSystem}.
+
exponent: % -> Integer
- ++ exponent(x) returns the \spadfunFrom{exponent}{FloatingPointSystem} part of x.
+ ++ exponent(x) returns the
+ ++ \spadfunFrom{exponent}{FloatingPointSystem} part of x.
+
mantissa: % -> Integer
++ mantissa(x) returns the mantissa part of x.
-- round?: () -> B
@@ -450,17 +488,25 @@
if % has arbitraryPrecision then
bits: PositiveInteger -> PositiveInteger
- ++ bits(n) set the \spadfunFrom{precision}{FloatingPointSystem} to n bits.
+ ++ bits(n) set the \spadfunFrom{precision}{FloatingPointSystem}
+ ++ to n bits.
+
digits: PositiveInteger -> PositiveInteger
- ++ digits(d) set the \spadfunFrom{precision}{FloatingPointSystem} to d digits.
+ ++ digits(d) set the \spadfunFrom{precision}{FloatingPointSystem}
+ ++ to d digits.
+
precision: PositiveInteger -> PositiveInteger
++ precision(n) set the precision in the base to n decimal digits.
+
increasePrecision: Integer -> PositiveInteger
++ increasePrecision(n) increases the current
++ \spadfunFrom{precision}{FloatingPointSystem} by n decimal digits.
+
decreasePrecision: Integer -> PositiveInteger
++ decreasePrecision(n) decreases the current
- ++ \spadfunFrom{precision}{FloatingPointSystem} precision by n decimal digits.
+ ++ \spadfunFrom{precision}{FloatingPointSystem} precision
+ ++ by n decimal digits.
+
if not (% has arbitraryExponent) then
-- overflow: (()->Exit) -> Void
-- ++ overflow() returns the Exponent overflow of float
@@ -947,6 +993,20 @@
o $AXIOM/doc/src/algebra/sf.spad.dvi
@
+<<dot>>=
+"DFLOAT" -> "FPS"
+"DoubleFloat()" -> "FloatingPointSystem()"
+"DFLOAT" -> "DIFRING"
+"DoubleFloat()" -> "DifferentialRing()"
+"DFLOAT" -> "OM"
+"DoubleFloat()" -> "OpenMath()"
+"DFLOAT" -> "TRANFUN"
+"DoubleFloat()" -> "TranscendentalFunctionCategory()"
+"DFLOAT" -> "SPFCAT"
+"DoubleFloat()" -> "SpecialFunctionCategory()"
+"DFLOAT" -> "KONVERT"
+"DoubleFloat()" -> "ConvertibleTo(InputForm)"
+@
<<domain DFLOAT DoubleFloat>>=
)abbrev domain DFLOAT DoubleFloat
++ Author: Michael Monagan
@@ -982,7 +1042,8 @@
++ and \spadfunFrom{cos}{DoubleFloat}
++ will lose all precision for large arguments.
++
-++ The \spadtype{Float} domain provides an alternative to the \spad{DoubleFloat} domain.
+++ The \spadtype{Float} domain provides an alternative to the
+++ \spad{DoubleFloat} domain.
++ It provides an arbitrary precision model of floating point arithmetic.
++ This means that accuracy problems like those above are eliminated
++ by increasing the working precision where necessary. \spadtype{Float}
Modified: trunk/axiom/src/algebra/si.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/si.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/si.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,34 @@
\tableofcontents
\eject
\section{category INS IntegerNumberSystem}
+<<dot>>=
+"INS" -> "UFD"
+"IntegerNumberSystem()" -> "UniqueFactorizationDomain()"
+"INS" -> "EUCDOM"
+"IntegerNumberSystem()" -> "EuclideanDomain()"
+"INS" -> "OINTDOM"
+"IntegerNumberSystem()" -> "OrderedIntegralDomain()"
+"INS" -> "DIFRING"
+"IntegerNumberSystem()" -> "DifferentialRing()"
+"INS" -> "KONVERT"
+"IntegerNumberSystem()" -> "ConvertibleTo(Integer)"
+"IntegerNumberSystem()" -> "ConvertibleTo(InputForm)"
+"IntegerNumberSystem()" -> "ConvertibleTo(Pattern(Integer))"
+"INS" -> "RETRACT"
+"IntegerNumberSystem()" -> "RetractableTo(Integer)"
+"INS" -> "LINEXP"
+"IntegerNumberSystem()" -> "LinearlyExplicitRingOver(Integer)"
+"INS" -> "PATMAB"
+"IntegerNumberSystem()" -> "PatternMatchable(Integer)"
+"INS" -> "CFCAT"
+"IntegerNumberSystem()" -> "CombinatorialFunctionCategory()"
+"INS" -> "REAL"
+"IntegerNumberSystem()" -> "RealConstant()"
+"INS" -> "CHARZ"
+"IntegerNumberSystem()" -> "CharacteristicZero()"
+"INS" -> "STEP"
+"IntegerNumberSystem()" -> "StepThrough()"
+@
<<category INS IntegerNumberSystem>>=
)abbrev category INS IntegerNumberSystem
++ Author: Stephen M. Watt
@@ -837,6 +865,14 @@
o $AXIOM/doc/src/algebra/si.spad.dvi
@
+<<dot>>=
+"SINT" -> "INS"
+"SingleInteger()" -> "IntegerNumberSystem()"
+"SINT" -> "LOGIC"
+"SingleInteger()" -> "Logic()"
+"SINT" -> "OM"
+"SingleInteger()" -> "OpenMath()"
+@
<<domain SINT SingleInteger>>=
)abbrev domain SINT SingleInteger
@@ -869,11 +905,14 @@
SingleInteger(): Join(IntegerNumberSystem,Logic,OpenMath) with
canonical
- ++ \spad{canonical} means that mathematical equality is implied by data structure equality.
+ ++ \spad{canonical} means that mathematical equality is
+ ++ implied by data structure equality.
canonicalsClosed
- ++ \spad{canonicalClosed} means two positives multiply to give positive.
+ ++ \spad{canonicalClosed} means two positives multiply to
+ ++ give positive.
noetherian
- ++ \spad{noetherian} all ideals are finitely generated (in fact principal).
+ ++ \spad{noetherian} all ideals are finitely generated
+ ++ (in fact principal).
max : () -> %
++ max() returns the largest single integer.
Modified: trunk/axiom/src/algebra/trigcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/trigcat.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
+++ trunk/axiom/src/algebra/trigcat.spad.pamphlet 2008-08-31 04:30:08 UTC (rev 962)
@@ -10,6 +10,10 @@
\tableofcontents
\eject
\section{category ELEMFUN ElementaryFunctionCategory}
+<<dot>>=
+"ELEMFUN" -> "CATEGORY"
+"ElementaryFunctionCategory()" -> "Category"
+@
<<category ELEMFUN ElementaryFunctionCategory>>=
)abbrev category ELEMFUN ElementaryFunctionCategory
++ Category for the elementary functions
@@ -27,6 +31,10 @@
@
\section{category AHYP ArcHyperbolicFunctionCategory}
+<<dot>>=
+"AHYP" -> "CATEGORY"
+"ArcHyperbolicFunctionCategory()" -> "Category"
+@
<<category AHYP ArcHyperbolicFunctionCategory>>=
)abbrev category AHYP ArcHyperbolicFunctionCategory
++ Category for the inverse hyperbolic trigonometric functions
@@ -47,6 +55,10 @@
\section{category ATRIG ArcTrigonometricFunctionCategory}
The [[asec]] and [[acsc]] functions were modified to include an
intermediate test to check that the argument has a reciprocal values.
+<<dot>>=
+"ATRIG" -> "CATEGORY"
+"ArcTrigonometricFunctionCategory()" -> "Category"
+@
<<category ATRIG ArcTrigonometricFunctionCategory>>=
)abbrev category ATRIG ArcTrigonometricFunctionCategory
++ Category for the inverse trigonometric functions
@@ -74,6 +86,10 @@
\section{category HYPCAT HyperbolicFunctionCategory}
The [[csch]] and [[sech]] functions were modified to include an
intermediate test to check that the argument has a reciprocal values.
+<<dot>>=
+"HYPCAT" -> "CATEGORY"
+"HyperbolicFunctionCategory()" -> "Category"
+@
<<category HYPCAT HyperbolicFunctionCategory>>=
)abbrev category HYPCAT HyperbolicFunctionCategory
++ Category for the hyperbolic trigonometric functions
@@ -111,6 +127,23 @@
The [[acsch]], [[asech]], and [[acoth]] functions were modified to
include an intermediate test to check that the argument has a
reciprocal values.
+<<dot>>=
+"TRANFUN" -> "TRIGCAT"
+"TranscendentalFunctionCategory()" ->
+ "TrigonometricFunctionCategory()"
+"TRANFUN" -> "ATRIG"
+"TranscendentalFunctionCategory()" ->
+ "ArcTrigonometricFunctionCategory()"
+"TRANFUN" -> "HYPCAT"
+"TranscendentalFunctionCategory()" ->
+ "HyperbolicFunctionCategory()"
+"TRANFUN" -> "AHYP"
+"TranscendentalFunctionCategory()" ->
+ "ArcHyperbolicFunctionCategory()"
+"TRANFUN" -> "ELEMFUN"
+"TranscendentalFunctionCategory()" ->
+ "ElementaryFunctionCategory()"
+@
<<category TRANFUN TranscendentalFunctionCategory>>=
)abbrev category TRANFUN TranscendentalFunctionCategory
++ Category for the transcendental elementary functions
@@ -147,6 +180,10 @@
\section{category TRIGCAT TrigonometricFunctionCategory}
The [[csc]] and [[sec]] functions were modified to include an
intermediate test to check that the argument has a reciprocal values.
+<<dot>>=
+"TRIGCAT" -> "CATEGORY"
+"TrigonometricFunctionCategory()" -> "Category"
+@
<<category TRIGCAT TrigonometricFunctionCategory>>=
)abbrev category TRIGCAT TrigonometricFunctionCategory
++ Category for the trigonometric functions
@@ -174,6 +211,10 @@
@
\section{category PRIMCAT PrimitiveFunctionCategory}
+<<dot>>=
+"PRIMCAT" -> "CATEGORY"
+"PrimitiveFunctionCategory()" -> "Category"
+@
<<category PRIMCAT PrimitiveFunctionCategory>>=
)abbrev category PRIMCAT PrimitiveFunctionCategory
++ Category for the integral functions
@@ -190,6 +231,12 @@
@
\section{category LFCAT LiouvillianFunctionCategory}
+<<dot>>=
+"LFCAT" -> "PRIMCAT"
+"LiouvillianFunctionCategory()" -> "PrimitiveFunctionCategory()"
+"LFCAT" -> "TRANFUN"
+"LiouvillianFunctionCategory()" -> "TranscendentalFunctionCategory()"
+@
<<category LFCAT LiouvillianFunctionCategory>>=
)abbrev category LFCAT LiouvillianFunctionCategory
++ Category for the transcendental Liouvillian functions
@@ -220,6 +267,10 @@
@
\section{category CFCAT CombinatorialFunctionCategory}
+<<dot>>=
+"CFCAT" -> "CATEGORY"
+"CombinatorialFunctionCategory()" -> "Category"
+@
<<category CFCAT CombinatorialFunctionCategory>>=
)abbrev category CFCAT CombinatorialFunctionCategory
++ Category for the usual combinatorial functions
@@ -243,6 +294,10 @@
@
\section{category SPFCAT SpecialFunctionCategory}
+<<dot>>=
+"SPFCAT" -> "CATEGORY"
+"SpecialFunctionCategory()" -> "Category"
+@
<<category SPFCAT SpecialFunctionCategory>>=
)abbrev category SPFCAT SpecialFunctionCategory
++ Category for the other special functions
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-31 04:29:10
|
changelog | 17 +++
src/algebra/acplot.spad.pamphlet | 8 ++
src/algebra/aggcat2.spad.pamphlet | 8 ++
src/algebra/algcat.spad.pamphlet | 37 ++++++
src/algebra/bags.spad.pamphlet | 30 ++++-
src/algebra/boolean.spad.pamphlet | 28 ++++-
src/algebra/catdef.spad.pamphlet | 239 +++++++++++++++++++++++++++++++++++
src/algebra/coerce.spad.pamphlet | 40 ++++++
src/algebra/equation1.spad.pamphlet | 14 ++
src/algebra/integer.spad.pamphlet | 28 ++++
src/algebra/misc.spad.pamphlet | 4 +
src/algebra/omcat.spad.pamphlet | 4 +
src/algebra/patmatch1.spad.pamphlet | 46 +++++++
src/algebra/pattern.spad.pamphlet | 18 +++
src/algebra/pscat.spad.pamphlet | 49 +++++++
src/algebra/sf.spad.pamphlet | 79 ++++++++++--
src/algebra/si.spad.pamphlet | 45 ++++++-
src/algebra/trigcat.spad.pamphlet | 55 ++++++++
18 files changed, 730 insertions(+), 19 deletions(-)
New commits:
commit 2a67061d60b75264f286d14d30f3e5d7d0251711
Author: Tim Daly <da...@ax...>
Date: Wed Jul 16 07:20:51 2008 -0400
20080830 tpd src/algebra/trigcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/si.spad graphviz dotfile decoration
20080830 tpd src/algebra/sf.spad graphviz dotfile decoration
20080830 tpd src/algebra/pscat.spad graphviz dotfile decoration
20080830 tpd src/algebra/pattern.spad graphviz dotfile decoration
20080830 tpd src/algebra/patmatch1.spad graphviz dotfile decoration
20080830 tpd src/algebra/omcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/misc.spad graphviz dotfile decoration
20080830 tpd src/algebra/integer.spad graphviz dotfile decoration
20080830 tpd src/algebra/equation1.spad graphviz dotfile decoration
20080830 tpd src/algebra/coerce.spad graphviz dotfile decoration
20080830 tpd src/algebra/catdef.spad graphviz dotfile decoration
20080830 tpd src/algebra/boolean.spad graphviz dotfile decoration
20080830 tpd src/algebra/bags.spad graphviz dotfile decoration
20080830 tpd src/algebra/algcat.spad graphviz dotfile decoration
20080830 tpd src/algebra/aggcat2.spad graphviz dotfile decoration
20080830 tpd src/algebra/acplot.spad graphviz dotfile decoration
|
|
From: <da...@us...> - 2008-08-30 05:05:20
|
Revision: 961
http://axiom.svn.sourceforge.net/axiom/?rev=961&view=rev
Author: daly
Date: 2008-08-30 05:05:29 +0000 (Sat, 30 Aug 2008)
Log Message:
-----------
20080829 tpd src/algebra/aggcat.spad graphviz dotfile decoration
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/aggcat.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-28 13:23:36 UTC (rev 960)
+++ trunk/axiom/changelog 2008-08-30 05:05:29 UTC (rev 961)
@@ -1,3 +1,4 @@
+20080829 tpd src/algebra/aggcat.spad graphviz dotfile decoration
20080828 mxr src/interp/i-funsel.boot add cost to bottomUp output
20080827 wsp src/algebra/tex.spad change \over to \frac
20080824 tpd src/input/Makefile add liu.input to regression
Modified: trunk/axiom/src/algebra/aggcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-28 13:23:36 UTC (rev 960)
+++ trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-30 05:05:29 UTC (rev 961)
@@ -1,4 +1,3 @@
-
\documentclass{article}
\usepackage{axiom}
\begin{document}
@@ -11,8 +10,11 @@
\tableofcontents
\eject
\section{category AGG Aggregate}
+<<dot>>=
+"AGG" -> "TYPE"
+"Aggregate()" -> "Type()"
+@
<<category AGG Aggregate>>=
-
)abbrev category AGG Aggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
++ Date Created: August 87 through August 88
@@ -66,6 +68,10 @@
@
\section{category HOAGG HomogeneousAggregate}
+<<dot>>=
+"HOAGG" -> "AGG"
+"HomogeneousAggregate(a:Type)" -> "Aggregate()"
+@
<<category HOAGG HomogeneousAggregate>>=
)abbrev category HOAGG HomogeneousAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -272,6 +278,11 @@
(MAKEPROP (QUOTE |HomogeneousAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (|List| 37) (0 . |eval|) (|Mapping| 7 7) (6 . |map|) (12 . |eval|) (|List| 7) (18 . |parts|) (|NonNegativeInteger|) (23 . |#|) (|Boolean|) (|Mapping| 17 7) (28 . |any?|) (34 . |every?|) (40 . |count|) (46 . |members|) (51 . |=|) (57 . |count|) (63 . |count|) (69 . |any?|) (75 . |member?|) (81 . |#|) (86 . |size?|) (92 . |=|) (|OutputForm|) (98 . |coerce|) (|List| |$|) (103 . |commaSeparate|) (108 . |bracket|) (113 . |coerce|) (|Equation| 7))) (QUOTE #(|members| 118 |member?| 123 |every?| 129 |eval| 135 |count| 141 |coerce| 153 |any?| 158 |=| 164 |#| 170)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 36 (QUOTE (2 7 0 0 8 9 2 6 0 10 0 11 2 0 0 0 8 12 1 6 13 0 14 1 0 15 0 16 2 0 17 18 0 19 2 0 17 18 0 20 2 0 15 18 0 21 1 0 13 0 22 2 7 17 0 0 23 2 6 15 18 0 24 2 0 15 7 0 25 2 6 17 18 0 26 2 0 17 7 0 27 1 6 15 0 28 2 6 17 0 15 29 2 0 17 0 0 30 1 7 31 0 32 1 31 0 33 34 1 31 0 0 35 1 0 31 0 36 1 0 13 0 22 2 0 17 7 0 27 2 0 17 18 0 20 2 0 0 0 8 12 2 0 15 7 0 25 2 0 15 18 0 21 1 0 31 0 36 2 0 17 18 0 19 2 0 17 0 0 30 1 0 15 0 16)))))) (QUOTE |lookupComplete|)))
@
\section{category CLAGG Collection}
+<<dot>>=
+"CLAGG" -> "HOAGG"
+"Collection(a:Type)" -> "HomogeneousAggregate(a:Type)"
+"Collection(a:SetCategory)" -> "Collection(a:Type)"
+@
<<category CLAGG Collection>>=
)abbrev category CLAGG Collection
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -420,6 +431,11 @@
(MAKEPROP (QUOTE |Collection&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (|List| 7) (0 . |parts|) (|NonNegativeInteger|) (5 . |#|) (|Mapping| 14 7) (10 . |count|) (|Boolean|) (16 . |any?|) (22 . |every?|) (|Union| 7 (QUOTE "failed")) (28 . |find|) (34 . |find|) (|Mapping| 7 7 7) (40 . |reduce|) (46 . |reduce|) (52 . |reduce|) (59 . |reduce|) (66 . |remove|) (72 . |construct|) (77 . |remove|) (83 . |select|) (89 . |select|) (95 . |=|) (101 . |remove|) (107 . |remove|) (113 . |reduce|) (121 . |reduce|) (129 . |removeDuplicates|) (134 . |removeDuplicates|))) (QUOTE #(|select| 139 |removeDuplicates| 145 |remove| 150 |reduce| 162 |find| 183 |every?| 189 |count| 195 |any?| 201 |#| 207)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 36 (QUOTE (1 6 8 0 9 1 0 10 0 11 2 0 10 12 0 13 2 0 14 12 0 15 2 0 14 12 0 16 2 8 17 12 0 18 2 0 17 12 0 19 2 8 7 20 0 21 2 0 7 20 0 22 3 8 7 20 0 7 23 3 0 7 20 0 7 24 2 8 0 12 0 25 1 6 0 8 26 2 0 0 12 0 27 2 8 0 12 0 28 2 0 0 12 0 29 2 7 14 0 0 30 2 6 0 12 0 31 2 0 0 7 0 32 4 8 7 20 0 7 7 33 4 0 7 20 0 7 7 34 1 8 0 0 35 1 0 0 0 36 2 0 0 12 0 29 1 0 0 0 36 2 0 0 7 0 32 2 0 0 12 0 27 4 0 7 20 0 7 7 34 3 0 7 20 0 7 24 2 0 7 20 0 22 2 0 17 12 0 19 2 0 14 12 0 16 2 0 10 12 0 13 2 0 14 12 0 15 1 0 10 0 11)))))) (QUOTE |lookupComplete|)))
@
\section{category BGAGG BagAggregate}
+<<dot>>=
+"BGAGG" -> "HOAGG"
+"BagAggregate(a:Type)" -> "HomogeneousAggregate(a:Type)"
+"BagAggregate(a:SetCategory)" -> "BagAggregate(a:Type)"
+@
<<category BGAGG BagAggregate>>=
)abbrev category BGAGG BagAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -455,6 +471,11 @@
@
\section{category SKAGG StackAggregate}
+<<dot>>=
+"SKAGG" -> "BGAGG"
+"StackAggregate(a:Type)" -> "BagAggregate(a:Type)"
+"StackAggregate(a:SetCategory)" -> "StackAggregate(a:Type)"
+@
<<category SKAGG StackAggregate>>=
)abbrev category SKAGG StackAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -488,6 +509,11 @@
@
\section{category QUAGG QueueAggregate}
+<<dot>>=
+"QUAGG" -> "BGAGG"
+"QueueAggregate(a:Type)" -> "BagAggregate(a:Type)"
+"QueueAggregate(a:SetCategory)" -> "QueueAggregate(a:Type)"
+@
<<category QUAGG QueueAggregate>>=
)abbrev category QUAGG QueueAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -527,6 +553,13 @@
@
\section{category DQAGG DequeueAggregate}
+<<dot>>=
+"DQAGG" -> "SKAGG"
+"DequeueAggregate(a:Type)" -> "StackAggregate(a:Type)"
+"DQAGG" -> "QUAGG"
+"DequeueAggregate(a:Type)" -> "QueueAggregate(a:Type)"
+"DequeueAggregate(a:SetCategory)" -> "DequeueAggregate(a:Type)"
+@
<<category DQAGG DequeueAggregate>>=
)abbrev category DQAGG DequeueAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -578,6 +611,13 @@
@
\section{category PRQAGG PriorityQueueAggregate}
+<<dot>>=
+"PRQAGG" -> "BGAGG"
+"PriorityQueueAggregate(a:Type)" -> "BagAggregate(a:Type)"
+"PriorityQueueAggregate(a:SetCategory)" -> "PriorityQueueAggregate(a:Type)"
+"PriorityQueueAggregate(a:OrderedSet)" ->
+ "PriorityQueueAggregate(a:SetCategory)"
+@
<<category PRQAGG PriorityQueueAggregate>>=
)abbrev category PRQAGG PriorityQueueAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -605,6 +645,12 @@
@
\section{category DIOPS DictionaryOperations}
+<<dot>>=
+"DIOPS" -> "BGAGG"
+"DictionaryOperations(a:SetCategory)" -> "BagAggregate(a:SetCategory)"
+"DIOPS" -> "CLAGG"
+"DictionaryOperations(a:SetCategory)" -> "Collection(a:SetCategory)"
+@
<<category DIOPS DictionaryOperations>>=
)abbrev category DIOPS DictionaryOperations
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -655,6 +701,12 @@
@
\section{category DIAGG Dictionary}
+<<dot>>=
+"DIAGG" -> "DIOPS"
+"Dictionary(a:SetCategory)" -> "DictionaryOperations(a:SetCategory)"
+"Dictionary(Record(a:SetCategory,b:SetCategory)" ->
+ "Dictionary(a:SetCategory)"
+@
<<category DIAGG Dictionary>>=
)abbrev category DIAGG Dictionary
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -700,6 +752,10 @@
@
\section{category MDAGG MultiDictionary}
+<<dot>>=
+"MDAGG" -> "DIOPS"
+"MultiDictionary(a:SetCategory)" -> "DictionaryOperations(a:SetCategory)"
+@
<<category MDAGG MultiDictionary>>=
)abbrev category MDAGG MultiDictionary
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -732,6 +788,12 @@
@
\section{category SETAGG SetAggregate}
+<<dot>>=
+"SETAGG" -> "SETCAT"
+"SetAggregate(a:SetCategory)" -> "SetCategory()"
+"SETAGG" -> "CLAGG"
+"SetAggregate(a:SetCategory)" -> "Collection(a:SetCategory)"
+@
<<category SETAGG SetAggregate>>=
)abbrev category SETAGG SetAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -857,6 +919,12 @@
(MAKEPROP (QUOTE |SetAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (0 . |difference|) (6 . |union|) |SETAGG-;symmetricDifference;3A;1| (|List| 7) (12 . |brace|) |SETAGG-;union;ASA;2| |SETAGG-;union;S2A;3| |SETAGG-;difference;ASA;4|)) (QUOTE #(|union| 17 |symmetricDifference| 29 |difference| 35)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 15 (QUOTE (2 6 0 0 0 8 2 6 0 0 0 9 1 6 0 11 12 2 0 0 7 0 14 2 0 0 0 7 13 2 0 0 0 0 10 2 0 0 0 7 15)))))) (QUOTE |lookupComplete|)))
@
\section{category FSAGG FiniteSetAggregate}
+<<dot>>=
+"FSAGG" -> "DIAGG"
+"FiniteSetAggregate(a:SetCategory)" -> "Dictionary(a:SetCategory)"
+"FSAGG" -> "SETAGG"
+"FiniteSetAggregate(a:SetCategory)" -> "SetAggregate(a:SetCategory)"
+@
<<category FSAGG FiniteSetAggregate>>=
)abbrev category FSAGG FiniteSetAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -949,6 +1017,12 @@
@
\section{category MSETAGG MultisetAggregate}
+<<dot>>=
+"MSETAGG" -> "MDAGG"
+"MultisetAggregate(a:SetCategory)" -> "MultiDictionary(a:SetCategory)"
+"MSETAGG" -> "SETAGG"
+"MultisetAggregate(a:SetCategory)" -> "SetAggregate(a:SetCategory)"
+@
<<category MSETAGG MultisetAggregate>>=
)abbrev category MSETAGG MultisetAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -968,6 +1042,14 @@
@
\section{category OMSAGG OrderedMultisetAggregate}
+<<dot>>=
+"OMSAGG" -> "MSETAGG"
+"OrderedMultisetAggregate(a:SetCategory)" ->
+ "MultisetAggregate(a:SetCategory)"
+"OMSAGG" -> "PRQAGG"
+"OrderedMultisetAggregate(a:SetCategory)" ->
+ "PriorityQueueAggregate(a:SetCategory)"
+@
<<category OMSAGG OrderedMultisetAggregate>>=
)abbrev category OMSAGG OrderedMultisetAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -994,6 +1076,11 @@
@
\section{category KDAGG KeyedDictionary}
+<<dot>>=
+"KDAGG" -> "DIAGG"
+"KeyedDictionary(a:SetCategory,b:SetCategory)" ->
+ "Dictionary(Record(a:SetCategory,b:SetCategory)"
+@
<<category KDAGG KeyedDictionary>>=
)abbrev category KDAGG KeyedDictionary
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1035,6 +1122,10 @@
@
\section{category ELTAB Eltable}
+<<dot>>=
+"ELTAB" -> "CATEGORY"
+"Eltable(a:SetCategory,b:Type)" -> "Category"
+@
<<category ELTAB Eltable>>=
)abbrev category ELTAB Eltable
++ Author: Michael Monagan; revised by Manuel Bronstein and Manuel Bronstein
@@ -1058,6 +1149,10 @@
@
\section{category ELTAGG EltableAggregate}
+<<dot>>=
+"ELTAGG" -> "ELTAB"
+"EltableAggregate(a:SetCategory,b:Type)"-> "Eltable(a:SetCategory,b:Type)"
+@
<<category ELTAGG EltableAggregate>>=
)abbrev category ELTAGG EltableAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1109,6 +1204,18 @@
@
\section{category IXAGG IndexedAggregate}
+<<dot>>=
+"IXAGG" -> "HOAGG"
+"IndexedAggregate(a:SetCategory,b:Type)" ->
+ "HomogeneousAggregate(a:Type)"
+"IXAGG" -> "ELTAGG"
+"IndexedAggregate(a:SetCategory,b:Type)" ->
+ "EltableAggregate(a:SetCategory,b:Type)"
+"IndexedAggregate(a:SetCategory,b:SetCategory)" ->
+ "IndexedAggregate(a:SetCategory,b:Type)"
+"IndexedAggregate(b:Integer,a:Type)" ->
+ "IndexedAggregate(a:SetCategory,b:Type)"
+@
<<category IXAGG IndexedAggregate>>=
)abbrev category IXAGG IndexedAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1198,6 +1305,14 @@
@
\section{category TBAGG TableAggregate}
+<<dot>>=
+"TBAGG" -> "KDAGG"
+"TableAggregate(a:SetCategory,b:SetCategory)" ->
+ "KeyedDictionary(a:SetCategory,b:SetCategory)"
+"TBAGG" -> "IXAGG"
+"TableAggregate(a:SetCategory,b:SetCategory)" ->
+ "IndexedAggregate(a:SetCategory,b:SetCategory)"
+@
<<category TBAGG TableAggregate>>=
)abbrev category TBAGG TableAggregate
++ Author: Michael Monagan, Stephen Watt; revised by Manuel Bronstein and Richard Jenks
@@ -1220,9 +1335,9 @@
table: () -> %
++ table()$T creates an empty table of type T.
++
- ++X Data:=Record(age:Integer,gender:String)
- ++X a1:AssociationList(String,Data):=table()
- ++X a1."tim":=[55,"male"]$Data
+ ++E Data:=Record(age:Integer,gender:String)
+ ++E a1:AssociationList(String,Data):=table()
+ ++E a1."tim":=[55,"male"]$Data
table: List Record(key:Key,entry:Entry) -> %
++ table([x,y,...,z]) creates a table consisting of entries
@@ -1326,6 +1441,10 @@
@
\section{category RCAGG RecursiveAggregate}
+<<dot>>=
+"RCAGG" -> "HOAGG"
+"RecursiveAggregate(a:Type)" -> "HomogeneousAggregate(a:Type)"
+@
<<category RCAGG RecursiveAggregate>>=
)abbrev category RCAGG RecursiveAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1435,6 +1554,10 @@
(MAKEPROP (QUOTE |RecursiveAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (0 . |value|) (QUOTE "value") |RCAGG-;elt;AvalueS;1| (5 . |setvalue!|) (11 . |setelt|) (|List| |$|) (18 . |children|) (|Boolean|) (|List| 6) (23 . |member?|) (29 . |child?|))) (QUOTE #(|setelt| 35 |elt| 42 |child?| 48)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 18 (QUOTE (1 6 7 0 8 2 6 7 0 7 11 3 0 7 0 9 7 12 1 6 13 0 14 2 16 15 6 0 17 2 0 15 0 0 18 3 0 7 0 9 7 12 2 0 7 0 9 10 2 0 15 0 0 18)))))) (QUOTE |lookupComplete|)))
@
\section{category BRAGG BinaryRecursiveAggregate}
+<<dot>>=
+"BRAGG" -> "RCAGG"
+"BinaryRecursiveAggregate(a:Type)" -> "RecursiveAggregate(a:Type)"
+@
<<category BRAGG BinaryRecursiveAggregate>>=
)abbrev category BRAGG BinaryRecursiveAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1550,6 +1673,10 @@
@
\section{category DLAGG DoublyLinkedAggregate}
+<<dot>>=
+"DLAGG" -> "RCAGG"
+"DoublyLinkedAggregate(a:Type)" -> "RecursiveAggregate(a:Type)"
+@
<<category DLAGG DoublyLinkedAggregate>>=
)abbrev category DLAGG DoublyLinkedAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1596,6 +1723,10 @@
@
\section{category URAGG UnaryRecursiveAggregate}
+<<dot>>=
+"URAGG" -> "RCAGG"
+"UnaryRecursiveAggregate(a:Type)" -> "RecursiveAggregate(a:Type)"
+@
<<category URAGG UnaryRecursiveAggregate>>=
)abbrev category URAGG UnaryRecursiveAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -1619,196 +1750,90 @@
++ Since these aggregates are recursive aggregates, they may be cyclic.
UnaryRecursiveAggregate(S:Type): Category == RecursiveAggregate S with
concat: (%,%) -> %
- ++ concat(u,v) returns an aggregate w consisting of the elements of u
- ++ followed by the elements of v.
- ++ Note: \axiom{v = rest(w,#a)}.
- ++
- ++X m:=[1,2,3]
- ++X concat(5,m)
-
+ ++ concat(u,v) returns an aggregate w consisting of the elements of u
+ ++ followed by the elements of v.
+ ++ Note: \axiom{v = rest(w,#a)}.
concat: (S,%) -> %
- ++ concat(x,u) returns aggregate consisting of x followed by
- ++ the elements of u.
- ++ Note: if \axiom{v = concat(x,u)} then \axiom{x = first v}
- ++ and \axiom{u = rest v}.
- ++
- ++X m:=[1,2,3]
- ++X concat(m,m)
-
+ ++ concat(x,u) returns aggregate consisting of x followed by
+ ++ the elements of u.
+ ++ Note: if \axiom{v = concat(x,u)} then \axiom{x = first v}
+ ++ and \axiom{u = rest v}.
first: % -> S
- ++ first(u) returns the first element of u
- ++ (equivalently, the value at the current node).
- ++
- ++X m:=[1,2,3]
- ++X first(m)
-
+ ++ first(u) returns the first element of u
+ ++ (equivalently, the value at the current node).
elt: (%,"first") -> S
- ++ elt(u,"first") (also written: \axiom{u . first}) is
- ++equivalent to first u.
-
+ ++ elt(u,"first") (also written: \axiom{u . first}) is equivalent to first u.
first: (%,NonNegativeInteger) -> %
- ++ first(u,n) returns a copy of the first n
- ++ (\axiom{n >= 0}) elements of u.
- ++
- ++X m:=[1,2,3]
- ++X first(m,2)
-
+ ++ first(u,n) returns a copy of the first n (\axiom{n >= 0}) elements of u.
rest: % -> %
- ++ rest(u) returns an aggregate consisting of all but the first
- ++ element of u
- ++ (equivalently, the next node of u).
- ++
- ++X m:=[1,2,3]
- ++X rest m
-
+ ++ rest(u) returns an aggregate consisting of all but the first
+ ++ element of u
+ ++ (equivalently, the next node of u).
elt: (%,"rest") -> %
- ++ elt(%,"rest") (also written: \axiom{u.rest}) is
- ++ equivalent to \axiom{rest u}.
-
+ ++ elt(%,"rest") (also written: \axiom{u.rest}) is
+ ++ equivalent to \axiom{rest u}.
rest: (%,NonNegativeInteger) -> %
- ++ rest(u,n) returns the \axiom{n}th (n >= 0) node of u.
- ++ Note: \axiom{rest(u,0) = u}.
- ++
- ++X m:=[1,2,3]
- ++X rest(m,2)
-
+ ++ rest(u,n) returns the \axiom{n}th (n >= 0) node of u.
+ ++ Note: \axiom{rest(u,0) = u}.
last: % -> S
- ++ last(u) resturn the last element of u.
- ++ Note: for lists, \axiom{last(u) = u . (maxIndex u) = u . (# u - 1)}.
- ++
- ++X m:=[1,2,3]
- ++X last m
-
+ ++ last(u) resturn the last element of u.
+ ++ Note: for lists, \axiom{last(u) = u . (maxIndex u) = u . (# u - 1)}.
elt: (%,"last") -> S
- ++ elt(u,"last") (also written: \axiom{u . last}) is equivalent to last u.
-
+ ++ elt(u,"last") (also written: \axiom{u . last}) is equivalent to last u.
last: (%,NonNegativeInteger) -> %
- ++ last(u,n) returns a copy of the last n (\axiom{n >= 0}) nodes of u.
- ++ Note: \axiom{last(u,n)} is a list of n elements.
- ++
- ++X m:=[1,2,3]
- ++X last(m,2)
-
+ ++ last(u,n) returns a copy of the last n (\axiom{n >= 0}) nodes of u.
+ ++ Note: \axiom{last(u,n)} is a list of n elements.
tail: % -> %
- ++ tail(u) returns the last node of u.
- ++ Note: if u is \axiom{shallowlyMutable},
- ++ \axiom{setrest(tail(u),v) = concat(u,v)}.
- ++
- ++X m:=[1,2,3]
- ++X last(m,2)
-
+ ++ tail(u) returns the last node of u.
+ ++ Note: if u is \axiom{shallowlyMutable},
+ ++ \axiom{setrest(tail(u),v) = concat(u,v)}.
second: % -> S
- ++ second(u) returns the second element of u.
- ++ Note: \axiom{second(u) = first(rest(u))}.
- ++
- ++X m:=[1,2,3]
- ++X second m
-
+ ++ second(u) returns the second element of u.
+ ++ Note: \axiom{second(u) = first(rest(u))}.
third: % -> S
- ++ third(u) returns the third element of u.
- ++ Note: \axiom{third(u) = first(rest(rest(u)))}.
- ++
- ++X m:=[1,2,3]
- ++X third m
-
+ ++ third(u) returns the third element of u.
+ ++ Note: \axiom{third(u) = first(rest(rest(u)))}.
cycleEntry: % -> %
- ++ cycleEntry(u) returns the head of a top-level cycle contained in
- ++ aggregate u, or \axiom{empty()} if none exists.
- ++
- ++X m:=[1,2,3]
- ++X concat!(m,tail(m))
- ++X cycleEntry m
-
+ ++ cycleEntry(u) returns the head of a top-level cycle contained in
+ ++ aggregate u, or \axiom{empty()} if none exists.
cycleLength: % -> NonNegativeInteger
- ++ cycleLength(u) returns the length of a top-level cycle
- ++ contained in aggregate u, or 0 is u has no such cycle.
- ++
- ++X m:=[1,2,3]
- ++X concat!(m,tail(m))
- ++X cycleLength m
-
+ ++ cycleLength(u) returns the length of a top-level cycle
+ ++ contained in aggregate u, or 0 is u has no such cycle.
cycleTail: % -> %
- ++ cycleTail(u) returns the last node in the cycle, or
- ++ empty if none exists.
- ++
- ++X m:=[1,2,3]
- ++X concat!(m,tail(m))
- ++X cycleTail m
-
+ ++ cycleTail(u) returns the last node in the cycle, or
+ ++ empty if none exists.
if % has shallowlyMutable then
concat_!: (%,%) -> %
++ concat!(u,v) destructively concatenates v to the end of u.
++ Note: \axiom{concat!(u,v) = setlast_!(u,v)}.
- ++
- ++X m:=[1,2,3]
- ++X n:=[4,5,6]
- ++X concat!(m,n)
-
concat_!: (%,S) -> %
++ concat!(u,x) destructively adds element x to the end of u.
++ Note: \axiom{concat!(a,x) = setlast!(a,[x])}.
- ++
- ++X m:=[1,2,3]
- ++X concat!(m,5)
-
cycleSplit_!: % -> %
++ cycleSplit!(u) splits the aggregate by dropping off the cycle.
++ The value returned is the cycle entry, or nil if none exists.
- ++ If \axiom{w = concat(u,v)} is the cyclic list where v is
+ ++ For example, if \axiom{w = concat(u,v)} is the cyclic list where v is
++ the head of the cycle, \axiom{cycleSplit!(w)} will drop v off w thus
++ destructively changing w to u, and returning v.
- ++
- ++X m:=[1,2,3]
- ++X concat!(m,m)
- ++X n:=[4,5,6]
- ++X p:=concat(n,m)
- ++X q:=cycleSplit! p
- ++X p
- ++X q
-
setfirst_!: (%,S) -> S
++ setfirst!(u,x) destructively changes the first element of a to x.
- ++
- ++X m:=[1,2,3]
- ++X setfirst!(m,4)
- ++X m
-
setelt: (%,"first",S) -> S
++ setelt(u,"first",x) (also written: \axiom{u.first := x}) is
++ equivalent to \axiom{setfirst!(u,x)}.
-
setrest_!: (%,%) -> %
++ setrest!(u,v) destructively changes the rest of u to v.
- ++
- ++X m:=[1,2,3]
- ++X setrest!(m,[4,5,6])
- ++X m
-
setelt: (%,"rest",%) -> %
- ++ setelt(u,"rest",v) (also written: \axiom{u.rest := v})
- ++ is equivalent to \axiom{setrest!(u,v)}.
-
+ ++ setelt(u,"rest",v) (also written: \axiom{u.rest := v}) is equivalent to
+ ++ \axiom{setrest!(u,v)}.
setlast_!: (%,S) -> S
++ setlast!(u,x) destructively changes the last element of u to x.
- ++
- ++X m:=[1,2,3]
- ++X setlast!(m,4)
- ++X m
-
setelt: (%,"last",S) -> S
++ setelt(u,"last",x) (also written: \axiom{u.last := b})
++ is equivalent to \axiom{setlast!(u,v)}.
-
split_!: (%,Integer) -> %
- ++ split!(u,n) splits u into two aggregates: \axiom{v = rest(u,n)}
- ++ and \axiom{w = first(u,n)}, returning \axiom{v}.
- ++ Note: afterwards \axiom{rest(u,n)} returns \axiom{empty()}.
- ++
- ++X m:=[1,2,3,4]
- ++X n:=split!(m,2)
- ++X m
- ++X n
-
+ ++ split!(u,n) splits u into two aggregates: \axiom{v = rest(u,n)}
+ ++ and \axiom{w = first(u,n)}, returning \axiom{v}.
+ ++ Note: afterwards \axiom{rest(u,n)} returns \axiom{empty()}.
add
cycleMax ==> 1000
@@ -2068,6 +2093,12 @@
(MAKEPROP (QUOTE |UnaryRecursiveAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (0 . |first|) (QUOTE "first") |URAGG-;elt;AfirstS;1| (5 . |last|) (QUOTE "last") |URAGG-;elt;AlastS;2| (10 . |rest|) (QUOTE "rest") |URAGG-;elt;ArestA;3| |URAGG-;second;AS;4| |URAGG-;third;AS;5| (|Boolean|) (15 . |empty?|) |URAGG-;cyclic?;AB;6| (20 . |tail|) |URAGG-;last;AS;7| (|List| |$|) |URAGG-;nodes;AL;8| |URAGG-;children;AL;9| |URAGG-;leaf?;AB;10| |URAGG-;value;AS;11| (|NonNegativeInteger|) |URAGG-;less?;ANniB;12| |URAGG-;more?;ANniB;13| |URAGG-;size?;ANniB;14| (25 . |cyclic?|) |URAGG-;#;ANni;15| |URAGG-;tail;2A;16| (30 . |eq?|) (36 . |cycleEntry|) |URAGG-;cycleTail;2A;18| |URAGG-;cycleEntry;2A;19| |URAGG-;cycleLength;ANni;20| |URAGG-;rest;ANniA;21| (41 . |#|) (46 . |rest|) (52 . |copy|) (57 . |last|) (63 . |=|) (69 . |=|) (75 . |=|) (81 . |node?|) (87 . |setfirst!|) (93 . |setelt|) (100 . |setlast!|) (106 . |setelt|) (113 . |setrest!|) (119 . |setelt|) (126 . |concat!|) (132 . |concat|) (138 . |setlast!|) (144 . |setchildren!|) (150 . |setvalue!|) (156 . |empty|) (|Integer|) (160 . |split!|) (166 . |cycleSplit!|) (QUOTE "value"))) (QUOTE #(|value| 171 |third| 176 |tail| 181 |split!| 186 |size?| 192 |setvalue!| 198 |setlast!| 204 |setelt| 210 |setchildren!| 231 |second| 237 |rest| 242 |nodes| 248 |node?| 253 |more?| 259 |less?| 265 |leaf?| 271 |last| 276 |elt| 287 |cyclic?| 305 |cycleTail| 310 |cycleSplit!| 315 |cycleLength| 320 |cycleEntry| 325 |concat| 330 |children| 336 |=| 341 |#| 347)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 64 (QUOTE (1 6 7 0 8 1 6 7 0 11 1 6 0 0 14 1 6 19 0 20 1 6 0 0 22 1 6 19 0 33 2 6 19 0 0 36 1 6 0 0 37 1 6 29 0 42 2 6 0 0 29 43 1 6 0 0 44 2 0 0 0 29 45 2 7 19 0 0 46 2 0 19 0 0 47 2 6 19 0 0 48 2 0 19 0 0 49 2 6 7 0 7 50 3 0 7 0 9 7 51 2 6 7 0 7 52 3 0 7 0 12 7 53 2 6 0 0 0 54 3 0 0 0 15 0 55 2 6 0 0 0 56 2 0 0 0 0 57 2 0 7 0 7 58 2 0 0 0 24 59 2 0 7 0 7 60 0 6 0 61 2 0 0 0 62 63 1 0 0 0 64 1 0 7 0 28 1 0 7 0 18 1 0 0 0 35 2 0 0 0 62 63 2 0 19 0 29 32 2 0 7 0 7 60 2 0 7 0 7 58 3 0 7 0 12 7 53 3 0 0 0 15 0 55 3 0 7 0 9 7 51 2 0 0 0 24 59 1 0 7 0 17 2 0 0 0 29 41 1 0 24 0 25 2 0 19 0 0 49 2 0 19 0 29 31 2 0 19 0 29 30 1 0 19 0 27 2 0 0 0 29 45 1 0 7 0 23 2 0 7 0 12 13 2 0 0 0 15 16 2 0 7 0 9 10 1 0 19 0 21 1 0 0 0 38 1 0 0 0 64 1 0 29 0 40 1 0 0 0 39 2 0 0 0 0 57 1 0 24 0 26 2 0 19 0 0 47 1 0 29 0 34)))))) (QUOTE |lookupComplete|)))
@
\section{category STAGG StreamAggregate}
+<<dot>>=
+"STAGG" -> "RCAGG"
+"StreamAggregate(a:Type)" -> "RecursiveAggregate(a:Type)"
+"STAGG" -> "LNAGG"
+"StreamAggregate(a:Type)" -> "LinearAggregate(a:Type)"
+@
<<category STAGG StreamAggregate>>=
)abbrev category STAGG StreamAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -2223,6 +2254,12 @@
(MAKEPROP (QUOTE |StreamAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (|Boolean|) (0 . |cyclic?|) |STAGG-;explicitlyFinite?;AB;1| |STAGG-;possiblyInfinite?;AB;2| (5 . |rest|) (|List| 7) (10 . |construct|) (|NonNegativeInteger|) |STAGG-;first;ANniA;3| (15 . |empty?|) (20 . |first|) (|Integer|) (25 . |minIndex|) (30 . |rest|) |STAGG-;elt;AIS;5| (|UniversalSegment| 19) (36 . |lo|) (41 . |hasHi|) (46 . |copy|) (51 . |hi|) (56 . |empty|) (60 . |first|) |STAGG-;elt;AUsA;6| (66 . |concat!|) (72 . |concat|) (|List| |$|) (78 . |concat|) (83 . |concat|) (88 . |setfirst!|) (|Mapping| 7 7) (94 . |map!|) (100 . |fill!|) (106 . |setelt|) (113 . |maxIndex|) (118 . |eq?|) (124 . |setelt|) (131 . |tail|) (136 . |setrest!|) (142 . |concat!|) (QUOTE "rest") (QUOTE "last") (QUOTE "first") (QUOTE "value"))) (QUOTE #(|setelt| 148 |possiblyInfinite?| 162 |map!| 167 |first| 173 |fill!| 179 |explicitlyFinite?| 185 |elt| 190 |concat!| 202 |concat| 208)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 46 (QUOTE (1 6 8 0 9 1 6 0 0 12 1 6 0 13 14 1 6 8 0 17 1 6 7 0 18 1 6 19 0 20 2 6 0 0 15 21 1 23 19 0 24 1 23 8 0 25 1 6 0 0 26 1 23 19 0 27 0 6 0 28 2 6 0 0 15 29 2 6 0 0 0 31 2 0 0 0 0 32 1 6 0 33 34 1 0 0 33 35 2 6 7 0 7 36 2 0 0 37 0 38 2 0 0 0 7 39 3 0 7 0 19 7 40 1 6 19 0 41 2 6 8 0 0 42 3 0 7 0 23 7 43 1 6 0 0 44 2 6 0 0 0 45 2 0 0 0 0 46 3 0 7 0 19 7 40 3 0 7 0 23 7 43 1 0 8 0 11 2 0 0 37 0 38 2 0 0 0 15 16 2 0 0 0 7 39 1 0 8 0 10 2 0 7 0 19 22 2 0 0 0 23 30 2 0 0 0 0 46 1 0 0 33 35 2 0 0 0 0 32)))))) (QUOTE |lookupComplete|)))
@
\section{category LNAGG LinearAggregate}
+<<dot>>=
+"LNAGG" -> "IXAGG"
+"LinearAggregate(a:Type)" -> "IndexedAggregate(b:Integer,a:Type)"
+"LNAGG" -> "CLAGG"
+"LinearAggregate(a:Type)" -> "Collection(a:Type)"
+@
<<category LNAGG LinearAggregate>>=
)abbrev category LNAGG LinearAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -2358,6 +2395,10 @@
(MAKEPROP (QUOTE |LinearAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (|Integer|) (0 . |minIndex|) (5 . |maxIndex|) (|List| 8) |LNAGG-;indices;AL;1| (|Boolean|) |LNAGG-;index?;IAB;2| (|NonNegativeInteger|) (10 . |new|) (16 . |concat|) |LNAGG-;concat;ASA;3| |LNAGG-;concat;S2A;4| (22 . |insert|) |LNAGG-;insert;SAIA;5| (29 . |#|) (34 . |maxIndex|) (|List| |$|))) (QUOTE #(|maxIndex| 39 |insert| 44 |indices| 51 |index?| 56 |concat| 62)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 23 (QUOTE (1 6 8 0 9 1 6 8 0 10 2 6 0 15 7 16 2 6 0 0 0 17 3 6 0 0 0 8 20 1 6 15 0 22 1 0 8 0 23 1 0 8 0 23 3 0 0 7 0 8 21 1 0 11 0 12 2 0 13 8 0 14 2 0 0 0 7 18 2 0 0 7 0 19)))))) (QUOTE |lookupComplete|)))
@
\section{category FLAGG FiniteLinearAggregate}
+<<dot>>=
+"FLAGG" -> "LNAGG"
+"FiniteLinearAggregate(a:Type)" -> "LinearAggregate(a:Type)"
+@
<<category FLAGG FiniteLinearAggregate>>=
)abbrev category FLAGG FiniteLinearAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -2441,6 +2482,15 @@
@
\section{category A1AGG OneDimensionalArrayAggregate}
+<<dot>>=
+"A1AGG" -> "FLAGG"
+"OneDimensionalArrayAggregate(a:Type)" ->
+ "FiniteLinearAggregate(a:Type)"
+"OneDimensionalArrayAggregate(Character)" ->
+ "OneDimensionalArrayAggregate(a:Type)"
+"OneDimensionalArrayAggregate(Boolean)" ->
+ "OneDimensionalArrayAggregate(a:Type)"
+@
<<category A1AGG OneDimensionalArrayAggregate>>=
)abbrev category A1AGG OneDimensionalArrayAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -2689,6 +2739,10 @@
@
\section{category ELAGG ExtensibleLinearAggregate}
+<<dot>>=
+"ELAGG" -> "LNAGG"
+"ExtensibleLinearAggregate(a:Type)" -> "LinearAggregate(a:Type)"
+@
<<category ELAGG ExtensibleLinearAggregate>>=
)abbrev category ELAGG ExtensibleLinearAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -2717,10 +2771,10 @@
delete_!: (%,Integer) -> %
++ delete!(u,i) destructively deletes the \axiom{i}th element of u.
++
- ++X Data:=Record(age:Integer,gender:String)
- ++X a1:AssociationList(String,Data):=table()
- ++X a1."tim":=[55,"male"]$Data
- ++X delete!(a1,1)
+ ++E Data:=Record(age:Integer,gender:String)
+ ++E a1:AssociationList(String,Data):=table()
+ ++E a1."tim":=[55,"male"]$Data
+ ++E delete!(a1,1)
delete_!: (%,UniversalSegment(Integer)) -> %
++ delete!(u,i..j) destructively deletes elements u.i through u.j.
@@ -2763,6 +2817,12 @@
@
\section{category LSAGG ListAggregate}
+<<dot>>=
+"LSAGG" -> "FLAGG"
+"ListAggregate(a:Type)" -> "FiniteLinearAggregate(a:Type)"
+"LSAGG" -> "ELAGG"
+"ListAggregate(a:Type)" -> "ExtensibleLinearAggregate(a:Type)"
+@
<<category LSAGG ListAggregate>>=
)abbrev category LSAGG ListAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -3073,6 +3133,14 @@
(MAKEPROP (QUOTE |ListAggregate&|) (QUOTE |infovec|) (LIST (QUOTE #(NIL NIL NIL NIL NIL NIL (|local| |#1|) (|local| |#2|) (|NonNegativeInteger|) (0 . |#|) (|Mapping| 15 7 7) |LSAGG-;sort!;M2A;1| (5 . |empty|) (9 . |concat|) |LSAGG-;list;SA;2| (|Boolean|) (15 . |empty?|) (20 . |rest|) (25 . |first|) (|Mapping| 7 7 7) (30 . |reduce|) |LSAGG-;reduce;MAS;3| (37 . |copy|) (42 . |merge!|) |LSAGG-;merge;M3A;4| (49 . |setrest!|) (|Mapping| 15 7) |LSAGG-;select!;M2A;5| (55 . |eq?|) |LSAGG-;merge!;M3A;6| (|Integer|) (61 . |minIndex|) (66 . |rest|) |LSAGG-;insert!;SAIA;7| (72 . |concat!|) |LSAGG-;insert!;2AIA;8| |LSAGG-;remove!;M2A;9| |LSAGG-;delete!;AIA;10| (|UniversalSegment| 30) (78 . |lo|) (83 . |hasHi|) (88 . |hi|) (93 . |maxIndex|) |LSAGG-;delete!;AUsA;11| (|Union| 7 (QUOTE "failed")) |LSAGG-;find;MAU;12| |LSAGG-;position;MAI;13| (98 . |reverse!|) (103 . |split!|) |LSAGG-;sorted?;MAB;15| |LSAGG-;reduce;MA2S;16| (109 . |=|) (115 . |reduce|) |LSAGG-;new;NniSA;18| |LSAGG-;map;M3A;19| |LSAGG-;reverse!;2A;20| (123 . |cyclic?|) |LSAGG-;copy;2A;21| (128 . |setfirst!|) |LSAGG-;copyInto!;2AIA;22| (134 . |position|) (141 . |remove!|) (147 . |removeDuplicates!|) (152 . |<|) (158 . |<|) (|Mapping| 7 7))) (QUOTE #(|sorted?| 164 |sort!| 170 |select!| 176 |reverse!| 182 |removeDuplicates!| 187 |remove!| 192 |reduce| 198 |position| 219 |new| 232 |merge!| 238 |merge| 245 |map| 252 |list| 259 |insert!| 264 |find| 278 |delete!| 284 |copyInto!| 296 |copy| 303 |<| 308)) (QUOTE NIL) (CONS (|makeByteWordVec2| 1 (QUOTE NIL)) (CONS (QUOTE #()) (CONS (QUOTE #()) (|makeByteWordVec2| 64 (QUOTE (1 6 8 0 9 0 6 0 12 2 6 0 7 0 13 1 6 15 0 16 1 6 0 0 17 1 6 7 0 18 3 6 7 19 0 7 20 1 6 0 0 22 3 6 0 10 0 0 23 2 6 0 0 0 25 2 6 15 0 0 28 1 6 30 0 31 2 6 0 0 8 32 2 6 0 0 0 34 1 38 30 0 39 1 38 15 0 40 1 38 30 0 41 1 6 30 0 42 1 6 0 0 47 2 6 0 0 30 48 2 7 15 0 0 51 4 0 7 19 0 7 7 52 1 6 15 0 56 2 6 7 0 7 58 3 0 30 7 0 30 60 2 6 0 26 0 61 1 0 0 0 62 2 7 15 0 0 63 2 0 15 0 0 64 2 0 15 10 0 49 2 0 0 10 0 11 2 0 0 26 0 27 1 0 0 0 55 1 0 0 0 62 2 0 0 26 0 36 3 0 7 19 0 7 50 4 0 7 19 0 7 7 52 2 0 7 19 0 21 2 0 30 26 0 46 3 0 30 7 0 30 60 2 0 0 8 7 53 3 0 0 10 0 0 29 3 0 0 10 0 0 24 3 0 0 19 0 0 54 1 0 0 7 14 3 0 0 7 0 30 33 3 0 0 0 0 30 35 2 0 44 26 0 45 2 0 0 0 38 43 2 0 0 0 30 37 3 0 0 0 0 30 59 1 0 0 0 57 2 0 15 0 0 64)))))) (QUOTE |lookupComplete|)))
@
\section{category ALAGG AssociationListAggregate}
+<<dot>>=
+"ALAGG" -> "TBAGG"
+"AssociationListAggregate(a:SetCategory,b:SetCategory)" ->
+ "TableAggregate(a:SetCategory,b:SetCategory)"
+"ALAGG" -> "LSAGG"
+"AssociationListAggregate(a:SetCategory,b:SetCategory)" ->
+ "ListAggregate(Record(a:SetCategory,b:SetCategory))"
+@
<<category ALAGG AssociationListAggregate>>=
)abbrev category ALAGG AssociationListAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
@@ -3117,6 +3185,10 @@
(DEFUN |AssociationListAggregate;| (|t#1| |t#2|) (PROG (#1=#:G88401) (RETURN (PROG1 (LETT #1# (|sublisV| (PAIR (QUOTE (|t#1| |t#2|)) (LIST (|devaluate| |t#1|) (|devaluate| |t#2|))) (|sublisV| (PAIR (QUOTE (#2=#:G88400)) (LIST (QUOTE (|Record| (|:| |key| |t#1|) (|:| |entry| |t#2|))))) (COND (|AssociationListAggregate;CAT|) ((QUOTE T) (LETT |AssociationListAggregate;CAT| (|Join| (|TableAggregate| (QUOTE |t#1|) (QUOTE |t#2|)) (|ListAggregate| (QUOTE #2#)) (|mkCategory| (QUOTE |domain|) (QUOTE (((|assoc| ((|Union| (|Record| (|:| |key| |t#1|) (|:| |entry| |t#2|)) "failed") |t#1| |$|)) T))) NIL (QUOTE NIL) NIL)) . #3=(|AssociationListAggregate|)))))) . #3#) (SETELT #1# 0 (LIST (QUOTE |AssociationListAggregate|) (|devaluate| |t#1|) (|devaluate| |t#2|)))))))
@
\section{category SRAGG StringAggregate}
+<<dot>>=
+"SRAGG" -> "A1AGG"
+"StringAggregate()" -> "OneDimensionalArrayAggregate(Character)"
+@
<<category SRAGG StringAggregate>>=
)abbrev category SRAGG StringAggregate
++ Author: Stephen Watt and Michael Monagan. revised by Manuel Bronstein and Richard Jenks
@@ -3219,6 +3291,14 @@
@
\section{category BTAGG BitAggregate}
+<<dot>>=
+"BTAGG" -> "ORDSET"
+"BitAggregate()" -> "OrderedSet()"
+"BTAGG" -> "LOGIC"
+"BitAggregate()" -> "Logic()"
+"BTAGG" -> "A1AGG"
+"BitAggregate()" -> "OneDimensionalArrayAggregate(Boolean)"
+@
<<category BTAGG BitAggregate>>=
)abbrev category BTAGG BitAggregate
++ Author: Michael Monagan; revised by Manuel Bronstein and Richard Jenks
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-30 05:04:50
|
changelog | 1 +
src/algebra/aggcat.spad.pamphlet | 394 +++++++++++++++++++++++---------------
2 files changed, 238 insertions(+), 157 deletions(-)
New commits:
commit 2e771347fb687208ffc7acf02ebeaf5d413fed93
Author: Tim Daly <da...@ax...>
Date: Tue Jul 15 18:44:20 2008 -0400
20080829 tpd src/algebra/aggcat.spad graphviz dotfile decoration
|
|
From: <da...@us...> - 2008-08-28 13:23:27
|
Revision: 960
http://axiom.svn.sourceforge.net/axiom/?rev=960&view=rev
Author: daly
Date: 2008-08-28 13:23:36 +0000 (Thu, 28 Aug 2008)
Log Message:
-----------
20080828 mxr src/interp/i-funsel.boot add cost to bottomUp output
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/interp/i-funsel.boot.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-28 05:04:57 UTC (rev 959)
+++ trunk/axiom/changelog 2008-08-28 13:23:36 UTC (rev 960)
@@ -1,3 +1,4 @@
+20080828 mxr src/interp/i-funsel.boot add cost to bottomUp output
20080827 wsp src/algebra/tex.spad change \over to \frac
20080824 tpd src/input/Makefile add liu.input to regression
20080824 lxx src/input/liu.input expose difference between ^ and **
Modified: trunk/axiom/src/interp/i-funsel.boot.pamphlet
===================================================================
--- trunk/axiom/src/interp/i-funsel.boot.pamphlet 2008-08-28 05:04:57 UTC (rev 959)
+++ trunk/axiom/src/interp/i-funsel.boot.pamphlet 2008-08-28 13:23:36 UTC (rev 960)
@@ -88,8 +88,7 @@
'" Arguments:",:bright fsig]
if target then sayMSG concat ['" Target type:",
:bright prefix2String target]
- if dc then sayMSG concat ['" From: ",
- :bright prefix2String dc]
+ if dc then sayMSG concat ['" From: ", :bright prefix2String dc]
stopTimingProcess 'debug
sayFunctionSelectionResult(op,args,mmS) ==
@@ -638,6 +637,9 @@
res = $PositiveInteger => cost - 2
res = $NonNegativeInteger => cost - 1
res = $DoubleFloat => cost + 1
+ if $reportBottomUpFlag then
+ sayMSG ['"cost=",prefix2String cost,'" for ", name,'": ",_
+ :formatSignature CDR sig]
cost
mmCost0(name, sig,cond,tar,args1,args2) ==
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-28 13:22:27
|
changelog | 1 +
src/interp/i-funsel.boot.pamphlet | 6 ++++--
2 files changed, 5 insertions(+), 2 deletions(-)
New commits:
commit 348afc31831c88e6c7da44b0fd1d8963f04914bb
Author: Tim Daly <da...@ax...>
Date: Mon Jul 14 17:09:45 2008 -0400
20080828 mxr src/interp/i-funsel.boot add cost to bottomUp output
|
|
From: <da...@us...> - 2008-08-28 05:04:47
|
Revision: 959
http://axiom.svn.sourceforge.net/axiom/?rev=959&view=rev
Author: daly
Date: 2008-08-28 05:04:57 +0000 (Thu, 28 Aug 2008)
Log Message:
-----------
20080827 wsp src/algebra/tex.spad change \over to \frac
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/tex.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-27 19:12:53 UTC (rev 958)
+++ trunk/axiom/changelog 2008-08-28 05:04:57 UTC (rev 959)
@@ -1,3 +1,4 @@
+20080827 wsp src/algebra/tex.spad change \over to \frac
20080824 tpd src/input/Makefile add liu.input to regression
20080824 lxx src/input/liu.input expose difference between ^ and **
20080824 tpd src/interp/setq.lisp add Liu Xiaojun to credits
Modified: trunk/axiom/src/algebra/tex.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/tex.spad.pamphlet 2008-08-27 19:12:53 UTC (rev 958)
+++ trunk/axiom/src/algebra/tex.spad.pamphlet 2008-08-28 05:04:57 UTC (rev 959)
@@ -534,7 +534,12 @@
op
opPrec := binaryPrecs.p
s : S := formatTex(first args, opPrec)
- s := concat [s,op,formatTex(first rest args, opPrec)]
+ if op = " \over " then
+ s := concat [" \frac{",s,"}{",formatTex(first rest args, opPrec),"}"]
+ else if op = " \sp " then
+ s := concat [s,"^",formatTex(first rest args, opPrec)]
+ else
+ s := concat [s,op,formatTex(first rest args, opPrec)]
group
op = " \over " => s
opPrec < prec => parenthesize s
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-28 05:03:23
|
changelog | 1 +
src/algebra/tex.spad.pamphlet | 7 ++++++-
2 files changed, 7 insertions(+), 1 deletions(-)
New commits:
commit 2d960c63d12476b3b403f8192e44cfee5816c247
Author: Tim Daly <da...@ax...>
Date: Mon Jul 14 11:19:18 2008 -0400
20080827 wsp src/algebra/tex.spad change \over to \frac
|
|
From: <da...@us...> - 2008-08-27 19:12:43
|
Revision: 958
http://axiom.svn.sourceforge.net/axiom/?rev=958&view=rev
Author: daly
Date: 2008-08-27 19:12:53 +0000 (Wed, 27 Aug 2008)
Log Message:
-----------
20080824 tpd src/input/Makefile add liu.input to regression
20080824 lxx src/input/liu.input expose difference between ^ and **
20080824 tpd src/interp/setq.lisp add Liu Xiaojun to credits
20080824 tpd readme add Liu Xiaojun to credits
20080824 lxx "Liu Xiaojun" <tig...@gm...>
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/readme
trunk/axiom/src/input/Makefile.pamphlet
trunk/axiom/src/interp/setq.lisp.pamphlet
Added Paths:
-----------
trunk/axiom/src/input/liu.input.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-26 01:30:47 UTC (rev 957)
+++ trunk/axiom/changelog 2008-08-27 19:12:53 UTC (rev 958)
@@ -1,3 +1,8 @@
+20080824 tpd src/input/Makefile add liu.input to regression
+20080824 lxx src/input/liu.input expose difference between ^ and **
+20080824 tpd src/interp/setq.lisp add Liu Xiaojun to credits
+20080824 tpd readme add Liu Xiaojun to credits
+20080824 lxx "Liu Xiaojun" <tig...@gm...>
20080824 tpd src/interp/format.boot use ++X
20080824 tpd src/algebra/tree.spad use ++X
20080824 tpd src/algebra/string.spad use ++X
Modified: trunk/axiom/readme
===================================================================
--- trunk/axiom/readme 2008-08-26 01:30:47 UTC (rev 957)
+++ trunk/axiom/readme 2008-08-27 19:12:53 UTC (rev 958)
@@ -216,8 +216,8 @@
"Kai Kaminski Grant Keady Tony Kennedy"
"Paul Kosinski Klaus Kusche Bernhard Kutzler"
"Larry Lambe Franz Lehner Frederic Lehobey"
-"Michel Levaud Howard Levy Rudiger Loos"
-"Michael Lucks Richard Luczak"
+"Michel Levaud Howard Levy Liu Xiaojun"
+"Rudiger Loos Michael Lucks Richard Luczak"
"Camm Maguire Francois Maltey Alasdair McAndrew"
"Bob McElrath Michael McGettrick Ian Meikle"
"David Mentre Victor S. Miller Gerard Milmeister"
Modified: trunk/axiom/src/input/Makefile.pamphlet
===================================================================
--- trunk/axiom/src/input/Makefile.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
+++ trunk/axiom/src/input/Makefile.pamphlet 2008-08-27 19:12:53 UTC (rev 958)
@@ -324,8 +324,8 @@
kamke4.regress kamke5.regress kamke6.regress kamke7.regress \
kernel.regress knot2.regress kovacic.regress kuipers.regress \
laplace.regress leg.regress limit.regress linalg.regress \
- lindep.regress \
- list.regress lode.regress lodesys.regress lodo1.regress \
+ lindep.regress list.regress liu.regress \
+ lode.regress lodesys.regress lodo1.regress \
lodo2.regress lodo3.regress lodof.regress lodo.regress \
log.regress \
lpoly.regress lupfact.regress lword.regress macbug.regress \
@@ -595,7 +595,8 @@
${OUT}/lextripk.input ${OUT}/lib.input ${OUT}/limit.input \
${OUT}/linalg.input \
${OUT}/lindep.input ${OUT}/liss1.input ${OUT}/liss2.input \
- ${OUT}/list.input ${OUT}/lode.input ${OUT}/lodesys.input \
+ ${OUT}/list.input ${OUT}/liu.input \
+ ${OUT}/lode.input ${OUT}/lodesys.input \
${OUT}/lodo1.input ${OUT}/lodo2.input ${OUT}/lodof.input \
${OUT}/lodo.input ${OUT}/lodo3.input ${OUT}/log.input \
${OUT}/lpoly.input ${OUT}/lump.input \
@@ -896,7 +897,8 @@
${DOC}/lib.input.dvi ${DOC}/limit.input.dvi \
${DOC}/linalg.input.dvi ${DOC}/lindep.input.dvi \
${DOC}/liss1.input.dvi ${DOC}/liss2.input.dvi \
- ${DOC}/list.input.dvi ${DOC}/lode.input.dvi \
+ ${DOC}/list.input.dvi ${DOC}/liu.input.dvi \
+ ${DOC}/lode.input.dvi \
${DOC}/lodesys.input.dvi ${DOC}/lodo1.input.dvi \
${DOC}/lodo2.input.dvi ${DOC}/lodo3.input.dvi \
${DOC}/lodof.input.dvi ${DOC}/lodo.input.dvi \
Added: trunk/axiom/src/input/liu.input.pamphlet
===================================================================
--- trunk/axiom/src/input/liu.input.pamphlet (rev 0)
+++ trunk/axiom/src/input/liu.input.pamphlet 2008-08-27 19:12:53 UTC (rev 958)
@@ -0,0 +1,94 @@
+\documentclass{article}
+\usepackage{axiom}
+\begin{document}
+\title{\$SPAD/src/input liu.input}
+\author{Xiaojun Liu}
+\maketitle
+\begin{abstract}
+This makes it clear that the exponential operation semantics is different
+for the use of ``\verb|^|'' and ``\verb|**|'' in some cases.
+\end{abstract}
+\eject
+\tableofcontents
+\eject
+Does exponential operation ``\verb|^|'' and ``\verb|**|'' of a differential
+operator, say L, means repeating multiplications of L in Axiom ? If
+so, it seems the following code produced an unexpected result:
+@
+<<*>>=
+)spool liu.output
+)set message test on
+)set message auto off
+)set message type off
+)clear all
+
+--S 1 of 9
+Dx: LODO(EXPR INT, f+->D(f,x)) := D()
+--R
+--R (1) D
+--E 1
+
+--S 2 of 9
+u := operator 'u
+--R
+--R (2) u
+--E 2
+
+--S 3 of 9
+L := Dx + u(x)
+--R
+--R (3) D + u(x)
+--E 3
+
+--S 4 of 9
+L**2 = L*L
+--R
+--R 2 2 2 , 2
+--R (4) D + 2u(x)D + u(x) = D + 2u(x)D + u (x) + u(x)
+--R
+--E 4
+
+)clear all
+
+--S 5 of 9
+f: INT->INT:=x+->x+1
+--R
+--R (1) theMap(Closure)
+--E 5
+
+--S 6 of 9
+K := OREUP ( x, INT, 1, f);
+--R
+--E 6
+
+--S 7 of 9
+x:K
+--E 7
+
+--S 8 of 9
+L:=x+1
+--R
+--R (4) x + 1
+--E 8
+
+--S 9 of 9
+L^2=L*L
+--R
+--R 2 2
+--R (5) x + 2x + 1= x + 4x + 3
+--E 9
+
+)spool
+)lisp (bye)
+
+@
+Clearly, the r.h.s. is correct too. I checked the .spad file, it seems the
+exponential operation of LODO (or its parent OREUP) is missed (or I guess it
+is directly inherited as usual polynomial operation). However I am not
+clever enough to modify the code. Please check this, thanks.
+
+\eject
+\begin{thebibliography}{99}
+\bibitem{1} nothing
+\end{thebibliography}
+\end{document}
Modified: trunk/axiom/src/interp/setq.lisp.pamphlet
===================================================================
--- trunk/axiom/src/interp/setq.lisp.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
+++ trunk/axiom/src/interp/setq.lisp.pamphlet 2008-08-27 19:12:53 UTC (rev 958)
@@ -627,8 +627,8 @@
"Kai Kaminski Grant Keady Tony Kennedy"
"Paul Kosinski Klaus Kusche Bernhard Kutzler"
"Larry Lambe Franz Lehner Frederic Lehobey"
-"Michel Levaud Howard Levy Rudiger Loos"
-"Michael Lucks Richard Luczak"
+"Michel Levaud Howard Levy Liu Xiaojun"
+"Rudiger Loos Michael Lucks Richard Luczak"
"Camm Maguire Francois Maltey Alasdair McAndrew"
"Bob McElrath Michael McGettrick Ian Meikle"
"David Mentre Victor S. Miller Gerard Milmeister"
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-27 19:09:50
|
changelog | 5 ++
readme | 4 +-
src/input/Makefile.pamphlet | 10 +++--
src/input/liu.input.pamphlet | 94 +++++++++++++++++++++++++++++++++++++++++
src/interp/setq.lisp.pamphlet | 4 +-
5 files changed, 109 insertions(+), 8 deletions(-)
New commits:
commit be6018d20c4167c29e00971145b8a7b37721cebc
Author: Tim Daly <da...@ax...>
Date: Mon Jul 14 04:30:57 2008 -0400
20080824 tpd src/input/Makefile add liu.input to regression
20080824 lxx src/input/liu.input expose difference between ^ and **
20080824 tpd src/interp/setq.lisp add Liu Xiaojun to credits
20080824 tpd readme add Liu Xiaojun to credits
20080824 lxx "Liu Xiaojun" <tig...@gm...>
|
|
From: <da...@us...> - 2008-08-26 01:30:46
|
Revision: 957
http://axiom.svn.sourceforge.net/axiom/?rev=957&view=rev
Author: daly
Date: 2008-08-26 01:30:47 +0000 (Tue, 26 Aug 2008)
Log Message:
-----------
20080824 tpd src/interp/format.boot use ++X
20080824 tpd src/algebra/tree.spad use ++X
20080824 tpd src/algebra/string.spad use ++X
20080824 tpd src/algebra/stream.spad use ++X
20080824 tpd src/algebra/radix.spad use ++X
20080824 tpd src/algebra/plot.spad use ++X
20080824 tpd src/algebra/mkfunc.spad use ++X
20080824 tpd src/algebra/mappkg.spad use ++X
20080824 tpd src/algebra/listgcd.spad use ++X
20080824 tpd src/algebra/fr.spad use ++X
20080824 tpd src/algebra/curve.spad use ++X
20080824 tpd src/algebra/carten.spad use ++X
20080824 tpd src/algebra/card.spad use ++X
20080824 tpd src/algebra/bags.spad use ++X
20080824 tpd src/algebra/array2.spad use ++X
20080824 tpd src/algebra/array1.spad use ++X
20080824 tpd src/algebra/aggcat.spad use ++X
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/aggcat.spad.pamphlet
trunk/axiom/src/algebra/array1.spad.pamphlet
trunk/axiom/src/algebra/array2.spad.pamphlet
trunk/axiom/src/algebra/bags.spad.pamphlet
trunk/axiom/src/algebra/card.spad.pamphlet
trunk/axiom/src/algebra/carten.spad.pamphlet
trunk/axiom/src/algebra/curve.spad.pamphlet
trunk/axiom/src/algebra/fr.spad.pamphlet
trunk/axiom/src/algebra/listgcd.spad.pamphlet
trunk/axiom/src/algebra/mappkg.spad.pamphlet
trunk/axiom/src/algebra/mkfunc.spad.pamphlet
trunk/axiom/src/algebra/plot.spad.pamphlet
trunk/axiom/src/algebra/radix.spad.pamphlet
trunk/axiom/src/algebra/stream.spad.pamphlet
trunk/axiom/src/algebra/string.spad.pamphlet
trunk/axiom/src/algebra/tree.spad.pamphlet
trunk/axiom/src/interp/format.boot.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/changelog 2008-08-26 01:30:47 UTC (rev 957)
@@ -1,3 +1,20 @@
+20080824 tpd src/interp/format.boot use ++X
+20080824 tpd src/algebra/tree.spad use ++X
+20080824 tpd src/algebra/string.spad use ++X
+20080824 tpd src/algebra/stream.spad use ++X
+20080824 tpd src/algebra/radix.spad use ++X
+20080824 tpd src/algebra/plot.spad use ++X
+20080824 tpd src/algebra/mkfunc.spad use ++X
+20080824 tpd src/algebra/mappkg.spad use ++X
+20080824 tpd src/algebra/listgcd.spad use ++X
+20080824 tpd src/algebra/fr.spad use ++X
+20080824 tpd src/algebra/curve.spad use ++X
+20080824 tpd src/algebra/carten.spad use ++X
+20080824 tpd src/algebra/card.spad use ++X
+20080824 tpd src/algebra/bags.spad use ++X
+20080824 tpd src/algebra/array2.spad use ++X
+20080824 tpd src/algebra/array1.spad use ++X
+20080824 tpd src/algebra/aggcat.spad use ++X
20080823 tpd src/algebra/s.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/multsqfr.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f07.spad remove ++CapitalLetter syntax
Modified: trunk/axiom/src/algebra/aggcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -1220,9 +1220,9 @@
table: () -> %
++ table()$T creates an empty table of type T.
++
- ++E Data:=Record(age:Integer,gender:String)
- ++E a1:AssociationList(String,Data):=table()
- ++E a1."tim":=[55,"male"]$Data
+ ++X Data:=Record(age:Integer,gender:String)
+ ++X a1:AssociationList(String,Data):=table()
+ ++X a1."tim":=[55,"male"]$Data
table: List Record(key:Key,entry:Entry) -> %
++ table([x,y,...,z]) creates a table consisting of entries
@@ -1623,8 +1623,8 @@
++ followed by the elements of v.
++ Note: \axiom{v = rest(w,#a)}.
++
- ++E m:=[1,2,3]
- ++E concat(5,m)
+ ++X m:=[1,2,3]
+ ++X concat(5,m)
concat: (S,%) -> %
++ concat(x,u) returns aggregate consisting of x followed by
@@ -1632,15 +1632,15 @@
++ Note: if \axiom{v = concat(x,u)} then \axiom{x = first v}
++ and \axiom{u = rest v}.
++
- ++E m:=[1,2,3]
- ++E concat(m,m)
+ ++X m:=[1,2,3]
+ ++X concat(m,m)
first: % -> S
++ first(u) returns the first element of u
++ (equivalently, the value at the current node).
++
- ++E m:=[1,2,3]
- ++E first(m)
+ ++X m:=[1,2,3]
+ ++X first(m)
elt: (%,"first") -> S
++ elt(u,"first") (also written: \axiom{u . first}) is
@@ -1650,16 +1650,16 @@
++ first(u,n) returns a copy of the first n
++ (\axiom{n >= 0}) elements of u.
++
- ++E m:=[1,2,3]
- ++E first(m,2)
+ ++X m:=[1,2,3]
+ ++X first(m,2)
rest: % -> %
++ rest(u) returns an aggregate consisting of all but the first
++ element of u
++ (equivalently, the next node of u).
++
- ++E m:=[1,2,3]
- ++E rest m
+ ++X m:=[1,2,3]
+ ++X rest m
elt: (%,"rest") -> %
++ elt(%,"rest") (also written: \axiom{u.rest}) is
@@ -1669,15 +1669,15 @@
++ rest(u,n) returns the \axiom{n}th (n >= 0) node of u.
++ Note: \axiom{rest(u,0) = u}.
++
- ++E m:=[1,2,3]
- ++E rest(m,2)
+ ++X m:=[1,2,3]
+ ++X rest(m,2)
last: % -> S
++ last(u) resturn the last element of u.
++ Note: for lists, \axiom{last(u) = u . (maxIndex u) = u . (# u - 1)}.
++
- ++E m:=[1,2,3]
- ++E last m
+ ++X m:=[1,2,3]
+ ++X last m
elt: (%,"last") -> S
++ elt(u,"last") (also written: \axiom{u . last}) is equivalent to last u.
@@ -1686,70 +1686,70 @@
++ last(u,n) returns a copy of the last n (\axiom{n >= 0}) nodes of u.
++ Note: \axiom{last(u,n)} is a list of n elements.
++
- ++E m:=[1,2,3]
- ++E last(m,2)
+ ++X m:=[1,2,3]
+ ++X last(m,2)
tail: % -> %
++ tail(u) returns the last node of u.
++ Note: if u is \axiom{shallowlyMutable},
++ \axiom{setrest(tail(u),v) = concat(u,v)}.
++
- ++E m:=[1,2,3]
- ++E last(m,2)
+ ++X m:=[1,2,3]
+ ++X last(m,2)
second: % -> S
++ second(u) returns the second element of u.
++ Note: \axiom{second(u) = first(rest(u))}.
++
- ++E m:=[1,2,3]
- ++E second m
+ ++X m:=[1,2,3]
+ ++X second m
third: % -> S
++ third(u) returns the third element of u.
++ Note: \axiom{third(u) = first(rest(rest(u)))}.
++
- ++E m:=[1,2,3]
- ++E third m
+ ++X m:=[1,2,3]
+ ++X third m
cycleEntry: % -> %
++ cycleEntry(u) returns the head of a top-level cycle contained in
++ aggregate u, or \axiom{empty()} if none exists.
++
- ++E m:=[1,2,3]
- ++E concat!(m,tail(m))
- ++E cycleEntry m
+ ++X m:=[1,2,3]
+ ++X concat!(m,tail(m))
+ ++X cycleEntry m
cycleLength: % -> NonNegativeInteger
++ cycleLength(u) returns the length of a top-level cycle
++ contained in aggregate u, or 0 is u has no such cycle.
++
- ++E m:=[1,2,3]
- ++E concat!(m,tail(m))
- ++E cycleLength m
+ ++X m:=[1,2,3]
+ ++X concat!(m,tail(m))
+ ++X cycleLength m
cycleTail: % -> %
++ cycleTail(u) returns the last node in the cycle, or
++ empty if none exists.
++
- ++E m:=[1,2,3]
- ++E concat!(m,tail(m))
- ++E cycleTail m
+ ++X m:=[1,2,3]
+ ++X concat!(m,tail(m))
+ ++X cycleTail m
if % has shallowlyMutable then
concat_!: (%,%) -> %
++ concat!(u,v) destructively concatenates v to the end of u.
++ Note: \axiom{concat!(u,v) = setlast_!(u,v)}.
++
- ++E m:=[1,2,3]
- ++E n:=[4,5,6]
- ++E concat!(m,n)
+ ++X m:=[1,2,3]
+ ++X n:=[4,5,6]
+ ++X concat!(m,n)
concat_!: (%,S) -> %
++ concat!(u,x) destructively adds element x to the end of u.
++ Note: \axiom{concat!(a,x) = setlast!(a,[x])}.
++
- ++E m:=[1,2,3]
- ++E concat!(m,5)
+ ++X m:=[1,2,3]
+ ++X concat!(m,5)
cycleSplit_!: % -> %
++ cycleSplit!(u) splits the aggregate by dropping off the cycle.
@@ -1758,20 +1758,20 @@
++ the head of the cycle, \axiom{cycleSplit!(w)} will drop v off w thus
++ destructively changing w to u, and returning v.
++
- ++E m:=[1,2,3]
- ++E concat!(m,m)
- ++E n:=[4,5,6]
- ++E p:=concat(n,m)
- ++E q:=cycleSplit! p
- ++E p
- ++E q
+ ++X m:=[1,2,3]
+ ++X concat!(m,m)
+ ++X n:=[4,5,6]
+ ++X p:=concat(n,m)
+ ++X q:=cycleSplit! p
+ ++X p
+ ++X q
setfirst_!: (%,S) -> S
++ setfirst!(u,x) destructively changes the first element of a to x.
++
- ++E m:=[1,2,3]
- ++E setfirst!(m,4)
- ++E m
+ ++X m:=[1,2,3]
+ ++X setfirst!(m,4)
+ ++X m
setelt: (%,"first",S) -> S
++ setelt(u,"first",x) (also written: \axiom{u.first := x}) is
@@ -1780,9 +1780,9 @@
setrest_!: (%,%) -> %
++ setrest!(u,v) destructively changes the rest of u to v.
++
- ++E m:=[1,2,3]
- ++E setrest!(m,[4,5,6])
- ++E m
+ ++X m:=[1,2,3]
+ ++X setrest!(m,[4,5,6])
+ ++X m
setelt: (%,"rest",%) -> %
++ setelt(u,"rest",v) (also written: \axiom{u.rest := v})
@@ -1791,9 +1791,9 @@
setlast_!: (%,S) -> S
++ setlast!(u,x) destructively changes the last element of u to x.
++
- ++E m:=[1,2,3]
- ++E setlast!(m,4)
- ++E m
+ ++X m:=[1,2,3]
+ ++X setlast!(m,4)
+ ++X m
setelt: (%,"last",S) -> S
++ setelt(u,"last",x) (also written: \axiom{u.last := b})
@@ -1804,10 +1804,10 @@
++ and \axiom{w = first(u,n)}, returning \axiom{v}.
++ Note: afterwards \axiom{rest(u,n)} returns \axiom{empty()}.
++
- ++E m:=[1,2,3,4]
- ++E n:=split!(m,2)
- ++E m
- ++E n
+ ++X m:=[1,2,3,4]
+ ++X n:=split!(m,2)
+ ++X m
+ ++X n
add
cycleMax ==> 1000
@@ -2717,10 +2717,10 @@
delete_!: (%,Integer) -> %
++ delete!(u,i) destructively deletes the \axiom{i}th element of u.
++
- ++E Data:=Record(age:Integer,gender:String)
- ++E a1:AssociationList(String,Data):=table()
- ++E a1."tim":=[55,"male"]$Data
- ++E delete!(a1,1)
+ ++X Data:=Record(age:Integer,gender:String)
+ ++X a1:AssociationList(String,Data):=table()
+ ++X a1."tim":=[55,"male"]$Data
+ ++X delete!(a1,1)
delete_!: (%,UniversalSegment(Integer)) -> %
++ delete!(u,i..j) destructively deletes elements u.i through u.j.
Modified: trunk/axiom/src/algebra/array1.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/array1.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/array1.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -232,9 +232,9 @@
++ \spad{scan(f,a,r)} returns
++ \spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.
++
- ++E T1:=PrimitiveArrayFunctions2(Integer,Integer)
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E scan(adder,[i for i in 1..10],0)$T1
+ ++X T1:=PrimitiveArrayFunctions2(Integer,Integer)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X scan(adder,[i for i in 1..10],0)$T1
reduce : ((A, B) -> B, VA, B) -> B
++ reduce(f,a,r) applies function f to each
@@ -244,17 +244,17 @@
++ does \spad{3+(2+(1+0))}. Note: third argument r
++ may be regarded as the identity element for the function f.
++
- ++E T1:=PrimitiveArrayFunctions2(Integer,Integer)
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E reduce(adder,[i for i in 1..10],0)$T1
+ ++X T1:=PrimitiveArrayFunctions2(Integer,Integer)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X reduce(adder,[i for i in 1..10],0)$T1
map : (A -> B, VA) -> VB
++ map(f,a) applies function f to each member of primitive array
++ \spad{a} resulting in a new primitive array over a
++ possibly different underlying domain.
++
- ++E T1:=PrimitiveArrayFunctions2(Integer,Integer)
- ++E map(x+->x+2,[i for i in 1..10])$T1
+ ++X T1:=PrimitiveArrayFunctions2(Integer,Integer)
+ ++X map(x+->x+2,[i for i in 1..10])$T1
Implementation ==> add
map(f, v) == map(f, v)$O2
@@ -271,23 +271,23 @@
coerce: PrimitiveArray S -> %
++ coerce(a) makes a tuple from primitive array a
++
- ++E t1:PrimitiveArray(Integer):= [i for i in 1..10]
- ++E t2:=coerce(t1)$Tuple(Integer)
+ ++X t1:PrimitiveArray(Integer):= [i for i in 1..10]
+ ++X t2:=coerce(t1)$Tuple(Integer)
select: (%, NonNegativeInteger) -> S
++ select(x,n) returns the n-th element of tuple x.
++ tuples are 0-based
++
- ++E t1:PrimitiveArray(Integer):= [i for i in 1..10]
- ++E t2:=coerce(t1)$Tuple(Integer)
- ++E select(t2,3)
+ ++X t1:PrimitiveArray(Integer):= [i for i in 1..10]
+ ++X t2:=coerce(t1)$Tuple(Integer)
+ ++X select(t2,3)
length: % -> NonNegativeInteger
++ length(x) returns the number of elements in tuple x
++
- ++E t1:PrimitiveArray(Integer):= [i for i in 1..10]
- ++E t2:=coerce(t1)$Tuple(Integer)
- ++E length(t2)
+ ++X t1:PrimitiveArray(Integer):= [i for i in 1..10]
+ ++X t2:=coerce(t1)$Tuple(Integer)
+ ++X length(t2)
if S has SetCategory then SetCategory
== add
@@ -337,31 +337,31 @@
flexibleArray : List S -> %
++ flexibleArray(l) creates a flexible array from the list of elements l
++
- ++E T1:=IndexedFlexibleArray(Integer,20)
- ++E flexibleArray([i for i in 1..10])$T1
+ ++X T1:=IndexedFlexibleArray(Integer,20)
+ ++X flexibleArray([i for i in 1..10])$T1
physicalLength : % -> NonNegativeInteger
++ physicalLength(x) returns the number of elements x can
++ accomodate before growing
++
- ++E T1:=IndexedFlexibleArray(Integer,20)
- ++E t2:=flexibleArray([i for i in 1..10])$T1
- ++E physicalLength t2
+ ++X T1:=IndexedFlexibleArray(Integer,20)
+ ++X t2:=flexibleArray([i for i in 1..10])$T1
+ ++X physicalLength t2
physicalLength_!: (%, I) -> %
++ physicalLength!(x,n) changes the physical length of x to be n and
++ returns the new array.
++
- ++E T1:=IndexedFlexibleArray(Integer,20)
- ++E t2:=flexibleArray([i for i in 1..10])$T1
- ++E physicalLength!(t2,15)
+ ++X T1:=IndexedFlexibleArray(Integer,20)
+ ++X t2:=flexibleArray([i for i in 1..10])$T1
+ ++X physicalLength!(t2,15)
shrinkable: Boolean -> Boolean
++ shrinkable(b) sets the shrinkable attribute of flexible arrays to b
++ and returns the previous value
++
- ++E T1:=IndexedFlexibleArray(Integer,20)
- ++E shrinkable(false)$T1
+ ++X T1:=IndexedFlexibleArray(Integer,20)
+ ++X shrinkable(false)$T1
Implementation == add
Rep := Record(physLen:I, logLen:I, f:A)
@@ -1087,12 +1087,12 @@
oneDimensionalArray: List S -> %
++ oneDimensionalArray(l) creates an array from a list of elements l
++
- ++E oneDimensionalArray [i**2 for i in 1..10]
+ ++X oneDimensionalArray [i**2 for i in 1..10]
oneDimensionalArray: (NonNegativeInteger, S) -> %
++ oneDimensionalArray(n,s) creates an array from n copies of element s
++
- ++E oneDimensionalArray(10,0.0)
+ ++X oneDimensionalArray(10,0.0)
Implementation == IndexedOneDimensionalArray(S, ARRAYMININDEX) add
oneDimensionalArray(u) ==
@@ -1125,9 +1125,9 @@
++ \spad{scan(f,a,r)} returns
++ \spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.
++
- ++E T1:=OneDimensionalArrayFunctions2(Integer,Integer)
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E scan(adder,[i for i in 1..10],0)$T1
+ ++X T1:=OneDimensionalArrayFunctions2(Integer,Integer)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X scan(adder,[i for i in 1..10],0)$T1
reduce : ((A, B) -> B, VA, B) -> B
++ reduce(f,a,r) applies function f to each
@@ -1137,17 +1137,17 @@
++ does \spad{3+(2+(1+0))}. Note: third argument r
++ may be regarded as the identity element for the function f.
++
- ++E T1:=OneDimensionalArrayFunctions2(Integer,Integer)
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E reduce(adder,[i for i in 1..10],0)$T1
+ ++X T1:=OneDimensionalArrayFunctions2(Integer,Integer)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X reduce(adder,[i for i in 1..10],0)$T1
map : (A -> B, VA) -> VB
++ map(f,a) applies function f to each member of one-dimensional array
++ \spad{a} resulting in a new one-dimensional array over a
++ possibly different underlying domain.
++
- ++E T1:=OneDimensionalArrayFunctions2(Integer,Integer)
- ++E map(x+->x+2,[i for i in 1..10])$T1
+ ++X T1:=OneDimensionalArrayFunctions2(Integer,Integer)
+ ++X map(x+->x+2,[i for i in 1..10])$T1
Implementation ==> add
map(f, v) == map(f, v)$O2
Modified: trunk/axiom/src/algebra/array2.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/array2.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/array2.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -46,51 +46,51 @@
new: (NonNegativeInteger,NonNegativeInteger,R) -> %
++ new(m,n,r) is an m-by-n array all of whose entries are r
++
- ++E arr : ARRAY2 INT := new(5,4,0)
+ ++X arr : ARRAY2 INT := new(5,4,0)
fill_!: (%,R) -> %
++ fill!(m,r) fills m with r's
++
- ++E arr : ARRAY2 INT := new(5,4,0)
- ++E fill!(arr,10)
+ ++X arr : ARRAY2 INT := new(5,4,0)
+ ++X fill!(arr,10)
--% Size inquiries
minRowIndex : % -> Integer
++ minRowIndex(m) returns the index of the 'first' row of the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E minRowIndex(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X minRowIndex(arr)
maxRowIndex : % -> Integer
++ maxRowIndex(m) returns the index of the 'last' row of the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E maxRowIndex(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X maxRowIndex(arr)
minColIndex : % -> Integer
++ minColIndex(m) returns the index of the 'first' column of the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E minColIndex(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X minColIndex(arr)
maxColIndex : % -> Integer
++ maxColIndex(m) returns the index of the 'last' column of the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E maxColIndex(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X maxColIndex(arr)
nrows : % -> NonNegativeInteger
++ nrows(m) returns the number of rows in the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E nrows(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X nrows(arr)
ncols : % -> NonNegativeInteger
++ ncols(m) returns the number of columns in the array m
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E ncols(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X ncols(arr)
--% Part extractions
@@ -99,45 +99,45 @@
++ column of the array m
++ error check to determine if indices are in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E elt(arr,1,1)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X elt(arr,1,1)
qelt: (%,Integer,Integer) -> R
++ qelt(m,i,j) returns the element in the ith row and jth
++ column of the array m
++ NO error check to determine if indices are in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E qelt(arr,1,1)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X qelt(arr,1,1)
elt: (%,Integer,Integer,R) -> R
++ elt(m,i,j,r) returns the element in the ith row and jth
++ column of the array m, if m has an ith row and a jth column,
++ and returns r otherwise
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E elt(arr,1,1,6)
- ++E elt(arr,1,10,6)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X elt(arr,1,1,6)
+ ++X elt(arr,1,10,6)
row: (%,Integer) -> Row
++ row(m,i) returns the ith row of m
++ error check to determine if index is in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E row(arr,1)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X row(arr,1)
column: (%,Integer) -> Col
++ column(m,j) returns the jth column of m
++ error check to determine if index is in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E column(arr,1)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X column(arr,1)
parts: % -> List R
++ parts(m) returns a list of the elements of m in row major order
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E parts(arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X parts(arr)
--% Part assignments
@@ -147,34 +147,34 @@
++ column of m to r
++ error check to determine if indices are in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,0)
- ++E setelt(arr,1,1,17)
+ ++X arr : ARRAY2 INT := new(5,4,0)
+ ++X setelt(arr,1,1,17)
qsetelt_!: (%,Integer,Integer,R) -> R
++ qsetelt!(m,i,j,r) sets the element in the ith row and jth
++ column of m to r
++ NO error check to determine if indices are in proper ranges
++
- ++E arr : ARRAY2 INT := new(5,4,0)
- ++E qsetelt!(arr,1,1,17)
+ ++X arr : ARRAY2 INT := new(5,4,0)
+ ++X qsetelt!(arr,1,1,17)
setRow_!: (%,Integer,Row) -> %
++ setRow!(m,i,v) sets to ith row of m to v
++
- ++E T1:=TwoDimensionalArray Integer
- ++E arr:T1:= new(5,4,0)
- ++E T2:=OneDimensionalArray Integer
- ++E arow:=construct([1,2,3,4]::List(INT))$T2
- ++E setRow!(arr,1,arow)$T1
+ ++X T1:=TwoDimensionalArray Integer
+ ++X arr:T1:= new(5,4,0)
+ ++X T2:=OneDimensionalArray Integer
+ ++X arow:=construct([1,2,3,4]::List(INT))$T2
+ ++X setRow!(arr,1,arow)$T1
setColumn_!: (%,Integer,Col) -> %
++ setColumn!(m,j,v) sets to jth column of m to v
++
- ++E T1:=TwoDimensionalArray Integer
- ++E arr:T1:= new(5,4,0)
- ++E T2:=OneDimensionalArray Integer
- ++E acol:=construct([1,2,3,4,5]::List(INT))$T2
- ++E setColumn!(arr,1,acol)$T1
+ ++X T1:=TwoDimensionalArray Integer
+ ++X arr:T1:= new(5,4,0)
+ ++X T2:=OneDimensionalArray Integer
+ ++X acol:=construct([1,2,3,4,5]::List(INT))$T2
+ ++X setColumn!(arr,1,acol)$T1
--% Map and Zip
@@ -182,23 +182,23 @@
++ map(f,a) returns \spad{b}, where \spad{b(i,j) = f(a(i,j))}
++ for all \spad{i, j}
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E map(-,arr)
- ++E map((x +-> x + x),arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X map(-,arr)
+ ++X map((x +-> x + x),arr)
map_!: (R -> R,%) -> %
++ map!(f,a) assign \spad{a(i,j)} to \spad{f(a(i,j))} for all \spad{i, j}
++
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E map!(-,arr)
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X map!(-,arr)
map:((R,R) -> R,%,%) -> %
++ map(f,a,b) returns \spad{c}, where \spad{c(i,j) = f(a(i,j),b(i,j))}
++ for all \spad{i, j}
++
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E arr : ARRAY2 INT := new(5,4,10)
- ++E map(adder,arr,arr)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X arr : ARRAY2 INT := new(5,4,10)
+ ++X map(adder,arr,arr)
map:((R,R) -> R,%,%,R) -> %
++ map(f,a,b,r) returns \spad{c}, where \spad{c(i,j) = f(a(i,j),b(i,j))}
@@ -207,10 +207,10 @@
++ 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)}.
++
- ++E adder(a:Integer,b:Integer):Integer == a+b
- ++E arr1 : ARRAY2 INT := new(5,4,10)
- ++E arr2 : ARRAY2 INT := new(3,3,10)
- ++E map(adder,arr1,arr2,17)
+ ++X adder(a:Integer,b:Integer):Integer == a+b
+ ++X arr1 : ARRAY2 INT := new(5,4,10)
+ ++X arr2 : ARRAY2 INT := new(3,3,10)
+ ++X map(adder,arr1,arr2,17)
add
Modified: trunk/axiom/src/algebra/bags.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/bags.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/bags.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -32,7 +32,7 @@
++ stack([x,y,...,z]) creates a stack with first (top)
++ element x, second element y,...,and last element z.
++
- ++E a:Stack INT:= stack [1,2,3,4,5]
+ ++X a:Stack INT:= stack [1,2,3,4,5]
== add
Rep := Reference List S
@@ -81,7 +81,7 @@
++ arrayStack([x,y,...,z]) creates an array stack with first (top)
++ element x, second element y,...,and last element z.
++
- ++E c:ArrayStack INT:= arrayStack [1,2,3,4,5]
+ ++X c:ArrayStack INT:= arrayStack [1,2,3,4,5]
== add
Rep := IndexedFlexibleArray(S,0)
@@ -134,7 +134,7 @@
++ queue([x,y,...,z]) creates a queue with first (top)
++ element x, second element y,...,and last (bottom) element z.
++
- ++E e:Queue INT:= queue [1,2,3,4,5]
+ ++X e:Queue INT:= queue [1,2,3,4,5]
== Stack S add
Rep := Reference List S
@@ -181,7 +181,7 @@
++ dequeue([x,y,...,z]) creates a dequeue with first (top or front)
++ element x, second element y,...,and last (bottom or back) element z.
++
- ++E g:Dequeue INT:= dequeue [1,2,3,4,5]
+ ++X g:Dequeue INT:= dequeue [1,2,3,4,5]
== Queue S add
Rep := Reference List S
@@ -376,7 +376,7 @@
++ heap(ls) creates a heap of elements consisting of the
++ elements of ls.
++
- ++E i:Heap INT := heap [1,6,3,7,5,2,4]
+ ++X i:Heap INT := heap [1,6,3,7,5,2,4]
Implementation == IndexedFlexibleArray(S,0) add
Rep := IndexedFlexibleArray( S,0)
Modified: trunk/axiom/src/algebra/card.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/card.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/card.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -381,62 +381,62 @@
++ \spad{x - y} returns an element z such that
++ \spad{z+y=x} or "failed" if no such element exists.
++
- ++E c2:=2::CardinalNumber
- ++E c2-c2
- ++E A1:=Aleph 1
- ++E A1-c2
+ ++X c2:=2::CardinalNumber
+ ++X c2-c2
+ ++X A1:=Aleph 1
+ ++X A1-c2
"**": (%, %) -> %
++ \spad{x**y} returns \spad{#(X**Y)} where \spad{X**Y} is defined
++ as \spad{\{g| g:Y->X\}}.
++
- ++E c2:=2::CardinalNumber
- ++E c2**c2
- ++E A1:=Aleph 1
- ++E A1**c2
- ++E generalizedContinuumHypothesisAssumed true
- ++E A1**A1
+ ++X c2:=2::CardinalNumber
+ ++X c2**c2
+ ++X A1:=Aleph 1
+ ++X A1**c2
+ ++X generalizedContinuumHypothesisAssumed true
+ ++X A1**A1
Aleph: NonNegativeInteger -> %
++ Aleph(n) provides the named (infinite) cardinal number.
++
- ++E A0:=Aleph 0
+ ++X A0:=Aleph 0
finite?: % -> Boolean
++ finite?(\spad{a}) determines whether
++ \spad{a} is a finite cardinal, i.e. an integer.
++
- ++E c2:=2::CardinalNumber
- ++E finite? c2
- ++E A0:=Aleph 0
- ++E finite? A0
+ ++X c2:=2::CardinalNumber
+ ++X finite? c2
+ ++X A0:=Aleph 0
+ ++X finite? A0
countable?: % -> Boolean
++ countable?(\spad{a}) determines
++ whether \spad{a} is a countable cardinal,
++ i.e. an integer or \spad{Aleph 0}.
++
- ++E c2:=2::CardinalNumber
- ++E countable? c2
- ++E A0:=Aleph 0
- ++E countable? A0
- ++E A1:=Aleph 1
- ++E countable? A1
+ ++X c2:=2::CardinalNumber
+ ++X countable? c2
+ ++X A0:=Aleph 0
+ ++X countable? A0
+ ++X A1:=Aleph 1
+ ++X countable? A1
generalizedContinuumHypothesisAssumed?: () -> Boolean
++ generalizedContinuumHypothesisAssumed?()
++ tests if the hypothesis is currently assumed.
++
- ++E generalizedContinuumHypothesisAssumed?
+ ++X generalizedContinuumHypothesisAssumed?
generalizedContinuumHypothesisAssumed: Boolean -> Boolean
++ generalizedContinuumHypothesisAssumed(bool)
++ is used to dictate whether the hypothesis is to be assumed.
++
- ++E generalizedContinuumHypothesisAssumed true
- ++E a:=Aleph 0
- ++E c:=2**a
- ++E f:=2**c
+ ++X generalizedContinuumHypothesisAssumed true
+ ++X a:=Aleph 0
+ ++X c:=2**a
+ ++X f:=2**c
== add
NNI ==> NonNegativeInteger
FINord ==> -1
Modified: trunk/axiom/src/algebra/carten.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/carten.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/carten.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -1083,94 +1083,94 @@
coerce: DP(dim, R) -> %
++ coerce(v) views a vector as a rank 1 tensor.
++
- ++E v:DirectProduct(2,Integer):=directProduct [3,4]
- ++E tv:CartesianTensor(1,2,Integer):=v
+ ++X v:DirectProduct(2,Integer):=directProduct [3,4]
+ ++X tv:CartesianTensor(1,2,Integer):=v
coerce: SM(dim, R) -> %
++ coerce(m) views a matrix as a rank 2 tensor.
++
- ++E v:SquareMatrix(2,Integer):=[[1,2],[3,4]]
- ++E tv:CartesianTensor(1,2,Integer):=v
+ ++X v:SquareMatrix(2,Integer):=[[1,2],[3,4]]
+ ++X tv:CartesianTensor(1,2,Integer):=v
coerce: List R -> %
++ coerce([r_1,...,r_dim]) allows tensors to be constructed
++ using lists.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
coerce: List % -> %
++ coerce([t_1,...,t_dim]) allows tensors to be constructed
++ using lists.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E tm:CartesianTensor(1,2,Integer):=[tv,tv]
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X tm:CartesianTensor(1,2,Integer):=[tv,tv]
rank: % -> NNI
++ rank(t) returns the tensorial rank of t (that is, the
++ number of indices). This is the same as the graded module
++ degree.
++
- ++E CT:=CARTEN(1,2,Integer)
- ++E t0:CT:=8
- ++E rank t0
+ ++X CT:=CARTEN(1,2,Integer)
+ ++X t0:CT:=8
+ ++X rank t0
elt: (%) -> R
++ elt(t) gives the component of a rank 0 tensor.
++
- ++E tv:CartesianTensor(1,2,Integer):=8
- ++E elt(tv)
- ++E tv[]
+ ++X tv:CartesianTensor(1,2,Integer):=8
+ ++X elt(tv)
+ ++X tv[]
elt: (%, I) -> R
++ elt(t,i) gives a component of a rank 1 tensor.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E elt(tv,2)
- ++E tv[2]
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X elt(tv,2)
+ ++X tv[2]
elt: (%, I, I) -> R
++ elt(t,i,j) gives a component of a rank 2 tensor.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E tm:CartesianTensor(1,2,Integer):=[tv,tv]
- ++E elt(tm,2,2)
- ++E tm[2,2]
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X tm:CartesianTensor(1,2,Integer):=[tv,tv]
+ ++X elt(tm,2,2)
+ ++X tm[2,2]
elt: (%, I, I, I) -> R
++ elt(t,i,j,k) gives a component of a rank 3 tensor.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E tm:CartesianTensor(1,2,Integer):=[tv,tv]
- ++E tn:CartesianTensor(1,2,Integer):=[tm,tm]
- ++E elt(tn,2,2,2)
- ++E tn[2,2,2]
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X tm:CartesianTensor(1,2,Integer):=[tv,tv]
+ ++X tn:CartesianTensor(1,2,Integer):=[tm,tm]
+ ++X elt(tn,2,2,2)
+ ++X tn[2,2,2]
elt: (%, I, I, I, I) -> R
++ elt(t,i,j,k,l) gives a component of a rank 4 tensor.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E tm:CartesianTensor(1,2,Integer):=[tv,tv]
- ++E tn:CartesianTensor(1,2,Integer):=[tm,tm]
- ++E tp:CartesianTensor(1,2,Integer):=[tn,tn]
- ++E elt(tp,2,2,2,2)
- ++E tp[2,2,2,2]
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X tm:CartesianTensor(1,2,Integer):=[tv,tv]
+ ++X tn:CartesianTensor(1,2,Integer):=[tm,tm]
+ ++X tp:CartesianTensor(1,2,Integer):=[tn,tn]
+ ++X elt(tp,2,2,2,2)
+ ++X tp[2,2,2,2]
elt: (%, List I) -> R
++ elt(t,[i1,...,iN]) gives a component of a rank \spad{N} tensor.
++
- ++E v:=[2,3]
- ++E tv:CartesianTensor(1,2,Integer):=v
- ++E tm:CartesianTensor(1,2,Integer):=[tv,tv]
- ++E tn:CartesianTensor(1,2,Integer):=[tm,tm]
- ++E tp:CartesianTensor(1,2,Integer):=[tn,tn]
- ++E tq:CartesianTensor(1,2,Integer):=[tp,tp]
- ++E elt(tq,[2,2,2,2,2])
+ ++X v:=[2,3]
+ ++X tv:CartesianTensor(1,2,Integer):=v
+ ++X tm:CartesianTensor(1,2,Integer):=[tv,tv]
+ ++X tn:CartesianTensor(1,2,Integer):=[tm,tm]
+ ++X tp:CartesianTensor(1,2,Integer):=[tn,tn]
+ ++X tq:CartesianTensor(1,2,Integer):=[tp,tp]
+ ++X elt(tq,[2,2,2,2,2])
-- This specializes the documentation from GradedAlgebra.
product: (%,%) -> %
@@ -1179,11 +1179,11 @@
++ s and t, then \spad{r} is a rank 4 tensor given by
++ \spad{r(i,j,k,l) = s(i,j)*t(k,l)}.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E Tm:CartesianTensor(1,2,Integer):=m
- ++E n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
- ++E Tn:CartesianTensor(1,2,Integer):=n
- ++E Tmn:=product(Tm,Tn)
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X Tm:CartesianTensor(1,2,Integer):=m
+ ++X n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
+ ++X Tn:CartesianTensor(1,2,Integer):=n
+ ++X Tmn:=product(Tm,Tn)
"*": (%, %) -> %
++ s*t is the inner product of the tensors s and t which contracts
@@ -1193,11 +1193,11 @@
++ This is compatible with the use of \spad{M*v} to denote
++ the matrix-vector inner product.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E Tm:CartesianTensor(1,2,Integer):=m
- ++E v:DirectProduct(2,Integer):=directProduct [3,4]
- ++E Tv:CartesianTensor(1,2,Integer):=v
- ++E Tm*Tv
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X Tm:CartesianTensor(1,2,Integer):=m
+ ++X v:DirectProduct(2,Integer):=directProduct [3,4]
+ ++X Tv:CartesianTensor(1,2,Integer):=v
+ ++X Tm*Tv
contract: (%, Integer, %, Integer) -> %
++ contract(t,i,s,j) is the inner product of tenors s and t
@@ -1208,11 +1208,11 @@
++ the rank 4 \spad{(= 3 + 3 - 2)} tensor given by
++ \spad{r(i,j,k,l) = sum(h=1..dim,s(i,h,j)*t(h,k,l))}.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E Tm:CartesianTensor(1,2,Integer):=m
- ++E v:DirectProduct(2,Integer):=directProduct [3,4]
- ++E Tv:CartesianTensor(1,2,Integer):=v
- ++E Tmv:=contract(Tm,2,Tv,1)
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X Tm:CartesianTensor(1,2,Integer):=m
+ ++X v:DirectProduct(2,Integer):=directProduct [3,4]
+ ++X Tv:CartesianTensor(1,2,Integer):=v
+ ++X Tmv:=contract(Tm,2,Tv,1)
contract: (%, Integer, Integer) -> %
++ contract(t,i,j) is the contraction of tensor t which
@@ -1222,11 +1222,11 @@
++ \spad{r} is the rank 2 \spad{(= 4 - 2)} tensor given by
++ \spad{r(i,j) = sum(h=1..dim,t(h,i,h,j))}.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E Tm:CartesianTensor(1,2,Integer):=m
- ++E v:DirectProduct(2,Integer):=directProduct [3,4]
- ++E Tv:CartesianTensor(1,2,Integer):=v
- ++E Tmv:=contract(Tm,2,1)
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X Tm:CartesianTensor(1,2,Integer):=m
+ ++X v:DirectProduct(2,Integer):=directProduct [3,4]
+ ++X Tv:CartesianTensor(1,2,Integer):=v
+ ++X Tmv:=contract(Tm,2,1)
transpose: % -> %
++ transpose(t) exchanges the first and last indices of t.
@@ -1234,9 +1234,9 @@
++ tensor t, then \spad{r} is the rank 4 tensor given by
++ \spad{r(i,j,k,l) = t(l,j,k,i)}.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E Tm:CartesianTensor(1,2,Integer):=m
- ++E transpose(Tm)
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X Tm:CartesianTensor(1,2,Integer):=m
+ ++X transpose(Tm)
transpose: (%, Integer, Integer) -> %
++ transpose(t,i,j) exchanges the \spad{i}-th and \spad{j}-th
@@ -1245,10 +1245,10 @@
++ given by
++ \spad{r(i,j,k,l) = t(i,k,j,l)}.
++
- ++E m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
- ++E tm:CartesianTensor(1,2,Integer):=m
- ++E tn:CartesianTensor(1,2,Integer):=[tm,tm]
- ++E transpose(tn,1,2)
+ ++X m:SquareMatrix(2,Integer):=matrix [[1,2],[4,5]]
+ ++X tm:CartesianTensor(1,2,Integer):=m
+ ++X tn:CartesianTensor(1,2,Integer):=[tm,tm]
+ ++X transpose(tn,1,2)
reindex: (%, List Integer) -> %
++ reindex(t,[i1,...,idim]) permutes the indices of t.
@@ -1257,10 +1257,10 @@
++ then \spad{r} is the rank for tensor given by
++ \spad{r(i,j,k,l) = t(l,i,j,k)}.
++
- ++E n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
- ++E tn:CartesianTensor(1,2,Integer):=n
- ++E p:=product(tn,tn)
- ++E reindex(p,[4,3,2,1])
+ ++X n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
+ ++X tn:CartesianTensor(1,2,Integer):=n
+ ++X p:=product(tn,tn)
+ ++X reindex(p,[4,3,2,1])
kroneckerDelta: () -> %
++ kroneckerDelta() is the rank 2 tensor defined by
@@ -1268,7 +1268,7 @@
++ \spad{= 1 if i = j}
++ \spad{= 0 if i \^= j}
++
- ++E delta:CartesianTensor(1,2,Integer):=kroneckerDelta()
+ ++X delta:CartesianTensor(1,2,Integer):=kroneckerDelta()
leviCivitaSymbol: () -> %
++ leviCivitaSymbol() is the rank \spad{dim} tensor defined by
@@ -1276,15 +1276,15 @@
++ if \spad{i1,...,idim} is an even/is nota /is an odd permutation
++ of \spad{minix,...,minix+dim-1}.
++
- ++E lcs:CartesianTensor(1,2,Integer):=leviCivitaSymbol()
+ ++X lcs:CartesianTensor(1,2,Integer):=leviCivitaSymbol()
ravel: % -> List R
++ ravel(t) produces a list of components from a tensor such that
++ \spad{unravel(ravel(t)) = t}.
++
- ++E n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
- ++E tn:CartesianTensor(1,2,Integer):=n
- ++E ravel tn
+ ++X n:SquareMatrix(2,Integer):=matrix [[2,3],[0,1]]
+ ++X tn:CartesianTensor(1,2,Integer):=n
+ ++X ravel tn
unravel: List R -> %
++ unravel(t) produces a tensor from a list of
Modified: trunk/axiom/src/algebra/curve.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/curve.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/curve.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -37,42 +37,42 @@
++ numberOfComponents() returns the number of absolutely irreducible
++ components.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E numberOfComponents()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X numberOfComponents()$R
genus : () -> NonNegativeInteger
++ genus() returns the genus of one absolutely irreducible component
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E genus()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X genus()$R
absolutelyIrreducible? : () -> Boolean
++ absolutelyIrreducible?() tests if the curve absolutely irreducible?
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
- ++E absolutelyIrreducible?()$R2
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
+ ++X absolutelyIrreducible?()$R2
rationalPoint? : (F, F) -> Boolean
++ rationalPoint?(a, b) tests if \spad{(x=a,y=b)} is on the curve.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E rationalPoint?(0,0)$R
- ++E R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
- ++E rationalPoint?(0,0)$R2
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X rationalPoint?(0,0)$R
+ ++X R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
+ ++X rationalPoint?(0,0)$R2
branchPointAtInfinity? : () -> Boolean
++ branchPointAtInfinity?() tests if there is a branch point at infinity.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E branchPointAtInfinity?()$R
- ++E R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
- ++E branchPointAtInfinity?()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X branchPointAtInfinity?()$R
+ ++X R2 := RadicalFunctionField(INT, P0, P1, 2 * x**2, 4)
+ ++X branchPointAtInfinity?()$R
branchPoint? : F -> Boolean
++ branchPoint?(a) tests whether \spad{x = a} is a branch point.
branchPoint? : UP -> Boolean
@@ -92,17 +92,17 @@
integralBasis : () -> Vector $
++ integralBasis() returns the integral basis for the curve.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E integralBasis()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X integralBasis()$R
integralBasisAtInfinity: () -> Vector $
++ integralBasisAtInfinity() returns the local integral basis at infinity
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E integralBasisAtInfinity()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X integralBasisAtInfinity()$R
integralAtInfinity? : $ -> Boolean
++ integralAtInfinity?() tests if f is locally integral at infinity.
integral? : $ -> Boolean
@@ -121,40 +121,40 @@
++ where \spad{(w1,...,wn)} is the integral basis of
++ \spadfunFrom{integralBasis}{FunctionFieldCategory}.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E integralMatrix()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X integralMatrix()$R
inverseIntegralMatrix : () -> Matrix RF
++ inverseIntegralMatrix() returns M such that
++ \spad{M (w1,...,wn) = (1, y, ..., y**(n-1))}
++ where \spad{(w1,...,wn)} is the integral basis of
++ \spadfunFrom{integralBasis}{FunctionFieldCategory}.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E inverseIntegralMatrix()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X inverseIntegralMatrix()$R
integralMatrixAtInfinity : () -> Matrix RF
++ integralMatrixAtInfinity() returns M such that
++ \spad{(v1,...,vn) = M (1, y, ..., y**(n-1))}
++ where \spad{(v1,...,vn)} is the local integral basis at infinity
++ returned by \spad{infIntBasis()}.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E integralMatrixAtInfinity()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X integralMatrixAtInfinity()$R
inverseIntegralMatrixAtInfinity: () -> Matrix RF
++ inverseIntegralMatrixAtInfinity() returns M such
++ that \spad{M (v1,...,vn) = (1, y, ..., y**(n-1))}
++ where \spad{(v1,...,vn)} is the local integral basis at infinity
++ returned by \spad{infIntBasis()}.
++
- ++E P0 := UnivariatePolynomial(x, Integer)
- ++E P1 := UnivariatePolynomial(y, Fraction P0)
- ++E R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
- ++E inverseIntegralMatrixAtInfinity()$R
+ ++X P0 := UnivariatePolynomial(x, Integer)
+ ++X P1 := UnivariatePolynomial(y, Fraction P0)
+ ++X R := RadicalFunctionField(INT, P0, P1, 1 - x**20, 20)
+ ++X inverseIntegralMatrixAtInfinity()$R
yCoordinates : $ -> Record(num:Vector(UP), den:UP)
++ yCoordinates(f) returns \spad{[[A1,...,An], D]} such that
++ \spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.
Modified: trunk/axiom/src/algebra/fr.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/fr.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/fr.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -675,38 +675,38 @@
++ \spadfun{coerce} which would cause the interpreter to do this
++ automatically.
++
- ++E f:=nilFactor(y-x,3)
- ++E expand(f)
+ ++X f:=nilFactor(y-x,3)
+ ++X expand(f)
exponent: % -> Integer
++ exponent(u) returns the exponent of the first factor of
++ \spadvar{u}, or 0 if the factored form consists solely of a unit.
++
- ++E f:=nilFactor(y-x,3)
- ++E exponent(f)
+ ++X f:=nilFactor(y-x,3)
+ ++X exponent(f)
makeFR : (R, List FF) -> %
++ makeFR(unit,listOfFactors) creates a factored object (for
++ use by factoring code).
++
- ++E f:=nilFactor(x-y,3)
- ++E g:=factorList f
- ++E makeFR(z,g)
+ ++X f:=nilFactor(x-y,3)
+ ++X g:=factorList f
+ ++X makeFR(z,g)
factorList : % -> List FF
++ factorList(u) returns the list of factors with flags (for
++ use by factoring code).
++
- ++E f:=nilFactor(x-y,3)
- ++E factorList f
+ ++X f:=nilFactor(x-y,3)
+ ++X factorList f
nilFactor: (R, Integer) -> %
++ nilFactor(base,exponent) creates a factored object with
++ a single factor with no information about the kind of
++ base (flag = "nil").
++
- ++E nilFactor(24,2)
- ++E nilFactor(x-y,3)
+ ++X nilFactor(24,2)
+ ++X nilFactor(x-y,3)
factors: % -> List Record(factor:R, exponent:Integer)
++ factors(u) returns a list of the factors in a form suitable
@@ -715,26 +715,26 @@
++ object is the product of all the factors and the unit (which
++ can be extracted by \axiom{unit(u)}).
++
- ++E f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
- ++E factors f
- ++E g:=makeFR(z,factorList f)
- ++E factors g
+ ++X f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
+ ++X factors f
+ ++X g:=makeFR(z,factorList f)
+ ++X factors g
irreducibleFactor: (R, Integer) -> %
++ irreducibleFactor(base,exponent) creates a factored object with
++ a single factor whose base is asserted to be irreducible
++ (flag = "irred").
++
- ++E a:=irreducibleFactor(3,1)
- ++E nthFlag(a,1)
+ ++X a:=irreducibleFactor(3,1)
+ ++X nthFlag(a,1)
nthExponent: (%, Integer) -> Integer
++ nthExponent(u,n) returns the exponent of the nth factor of
++ \spadvar{u}. If \spadvar{n} is not a valid index for a factor
++ (for example, less than 1 or too big), 0 is returned.
++
- ++E a:=factor 9720000
- ++E nthExponent(a,2)
+ ++X a:=factor 9720000
+ ++X nthExponent(a,2)
nthFactor: (%,Integer) -> R
++ nthFactor(u,n) returns the base of the nth factor of
@@ -742,38 +742,38 @@
++ (for example, less than 1 or too big), 1 is returned. If
++ \spadvar{u} consists only of a unit, the unit is returned.
++
- ++E a:=factor 9720000
- ++E nthFactor(a,2)
+ ++X a:=factor 9720000
+ ++X nthFactor(a,2)
nthFlag: (%,Integer) -> fUnion
++ nthFlag(u,n) returns the information flag of the nth factor of
++ \spadvar{u}. If \spadvar{n} is not a valid index for a factor
++ (for example, less than 1 or too big), "nil" is returned.
++
- ++E a:=factor 9720000
- ++E nthFlag(a,2)
+ ++X a:=factor 9720000
+ ++X nthFlag(a,2)
numberOfFactors : % -> NonNegativeInteger
++ numberOfFactors(u) returns the number of factors in \spadvar{u}.
++
- ++E a:=factor 9720000
- ++E numberOfFactors a
+ ++X a:=factor 9720000
+ ++X numberOfFactors a
primeFactor: (R,Integer) -> %
++ primeFactor(base,exponent) creates a factored object with
++ a single factor whose base is asserted to be prime
++ (flag = "prime").
++
- ++E a:=primeFactor(3,4)
- ++E nthFlag(a,1)
+ ++X a:=primeFactor(3,4)
+ ++X nthFlag(a,1)
sqfrFactor: (R,Integer) -> %
++ sqfrFactor(base,exponent) creates a factored object with
++ a single factor whose base is asserted to be square-free
++ (flag = "sqfr").
++
- ++E a:=sqfrFactor(3,5)
- ++E nthFlag(a,1)
+ ++X a:=sqfrFactor(3,5)
+ ++X nthFlag(a,1)
flagFactor: (R,Integer, fUnion) -> %
++ flagFactor(base,exponent,flag) creates a factored object with
@@ -783,10 +783,10 @@
unit: % -> R
++ unit(u) extracts the unit part of the factorization.
++
- ++E f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
- ++E unit f
- ++E g:=makeFR(z,factorList f)
- ++E unit g
+ ++X f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
+ ++X unit f
+ ++X g:=makeFR(z,factorList f)
+ ++X unit g
unitNormalize: % -> %
++ unitNormalize(u) normalizes the unit part of the factorization.
@@ -799,11 +799,11 @@
++ the information flags (sets them to "nil") because the effect of
++ \userfun{fn} is clearly not known in general.
++
- ++E m(a:Factored Polynomial Integer):Factored Polynomial Integer == a^2
- ++E f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
- ++E map(m,f)
- ++E g:=makeFR(z,factorList f)
- ++E map(m,g)
+ ++X m(a:Factored Polynomial Integer):Factored Polynomial Integer == a^2
+ ++X f:=x*y^3-3*x^2*y^2+3*x^3*y-x^4
+ ++X map(m,f)
+ ++X g:=makeFR(z,factorList f)
+ ++X map(m,g)
-- the following operations are conditional on R
Modified: trunk/axiom/src/algebra/listgcd.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/listgcd.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/listgcd.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -35,8 +35,8 @@
gcd : List BP -> BP
++ gcd([f1,..,fk]) = gcd of the polynomials fi.
++
- ++E gcd([671*671*x^2-1,671*671*x^2+2*671*x+1])
- ++E gcd([7*x^2+1,(7*x^2+1)^2])
+ ++X gcd([671*671*x^2-1,671*671*x^2+2*671*x+1])
+ ++X gcd([7*x^2+1,(7*x^2+1)^2])
gcdprim : List BP -> BP
++ gcdprim([f1,..,fk]) = gcd of k PRIMITIVE univariate polynomials
Modified: trunk/axiom/src/algebra/mappkg.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/mappkg.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/mappkg.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -1783,28 +1783,28 @@
"+": (A->B, A->B) -> (A->B)
++ \spad(+) does functional addition
++
- ++E f:=(x:INT):INT +-> 3*x
- ++E g:=(x:INT):INT +-> 2*x+3
- ++E (f+g)(4)
+ ++X f:=(x:INT):INT +-> 3*x
+ ++X g:=(x:INT):INT +-> 2*x+3
+ ++X (f+g)(4)
"-": (A->B, A->B) -> (A->B)
++ \spad(+) does functional addition
++
- ++E f:=(x:INT):INT +-> 3*x
- ++E g:=(x:INT):INT +-> 2*x+3
- ++E (f-g)(4)
+ ++X f:=(x:INT):INT +-> 3*x
+ ++X g:=(x:INT):INT +-> 2*x+3
+ ++X (f-g)(4)
"*": (A->B, A->B) -> (A->B)
++ \spad(+) does functional addition
++
- ++E f:=(x:INT):INT +-> 3*x
- ++E g:=(x:INT):INT +-> 2*x+3
- ++E (f*g)(4)
+ ++X f:=(x:INT):INT +-> 3*x
+ ++X g:=(x:INT):INT +-> 2*x+3
+ ++X (f*g)(4)
"/": (A->Expression(Integer), A->Expression(Integer)) -> (A->Expression(Integer))
++ \spad(+) does functional addition
++
- ++E p:=(x:EXPR(INT)):EXPR(INT)+->3*x
- ++E q:=(x:EXPR(INT)):EXPR(INT)+->2*x+3
- ++E (p/q)(4)
- ++E (p/q)(x)
+ ++X p:=(x:EXPR(INT)):EXPR(INT)+->3*x
+ ++X q:=(x:EXPR(INT)):EXPR(INT)+->2*x+3
+ ++X (p/q)(4)
+ ++X (p/q)(x)
== add
fab ==> (A -> B)
faei ==> (A -> Expression(Integer))
Modified: trunk/axiom/src/algebra/mkfunc.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/mkfunc.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/mkfunc.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -34,8 +34,8 @@
++ \spad{binary(op, [a1,...,an])} returns the input form
++ corresponding to \spad{a1 op a2 op ... op an}.
++
- ++E a:=[1,2,3]::List(InputForm)
- ++E binary(_+::InputForm,a)
+ ++X a:=[1,2,3]::List(InputForm)
+ ++X binary(_+::InputForm,a)
function : (%, List Symbol, Symbol) -> %
++ \spad{function(code, [x1,...,xn], f)} returns the input form
Modified: trunk/axiom/src/algebra/plot.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/plot.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/plot.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -146,8 +146,8 @@
++ plot(f,a..b) plots the function \spad{f(x)}
++ on the interval \spad{[a,b]}.
++
- ++E fp:=(t:DFLOAT):DFLOAT +-> sin(t)
- ++E plot(fp,-1.0..1.0)$PLOT
+ ++X fp:=(t:DFLOAT):DFLOAT +-> sin(t)
+ ++X plot(fp,-1.0..1.0)$PLOT
plot: (F -> F,R,R) -> %
++ plot(f,a..b,c..d) plots the function \spad{f(x)} on the interval
Modified: trunk/axiom/src/algebra/radix.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/radix.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/radix.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -724,7 +724,7 @@
binary: Fraction Integer -> %
++ binary(r) converts a rational number to a binary expansion.
++
- ++E binary(22/7)
+ ++X binary(22/7)
Implementation ==> RadixExpansion(2) add
binary r == r :: %
Modified: trunk/axiom/src/algebra/stream.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/stream.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
+++ trunk/axiom/src/algebra/stream.spad.pamphlet 2008-08-26 01:30:47 UTC (rev 957)
@@ -30,40 +30,40 @@
++ st which do not satisfy the predicate f.
++ Note: \spad{remove(f,st) = [x for x in st | not f(x)]}.
++
- ++E m:=[i for i in 1..]
- ++E f(i:PositiveInteger):Boolean == even? i
- ++E remove(f,m)
+ ++X m:=[i for i in 1..]
+ ++X f(i:PositiveInteger):Boolean == even? i
+ ++X remove(f,m)
select: (S -> Boolean,%) -> %
++ select(f,st) returns a stream consisting of those elements of stream
++ st satisfying the predicate f.
++ Note: \spad{select(f,st) = [x for x in st | f(x)]}.
++
- ++E m:=[i for i in 0..]
- ++E select(x+->prime? x,m)
+ ++X m:=[i for i in 0..]
+ ++X select(x+->prime? x,m)
explicitEntries?: % -> Boolean
++ explicitEntries?(s) returns true if the stream s has
++ explicitly computed entries, and false otherwise.
++
- ++E m:=[i for i in 0..]
- ++E explicitEntries? m
+ ++X m:=[i for i in 0..]
+ ++X explicitEntries? m
explicitlyEmpty?: % -> Boolean
++ explicitlyEmpty?(s) returns true if the stream is an
++ (explicitly) empty stream.
++ Note: this is a null test which will not cause lazy evaluation.
++
- ++E m:=[i for i in 0..]
- ++E explicitlyEmpty? m
+ ++X m:=[i for i in 0..]
+ ++X explicitlyEmpty? m
lazy?: % -> Boolean
++ lazy?(s) returns true if the first node of the stream s
++ is a lazy evaluation mechanism which could produce an
++...
[truncated message content] |
|
From: <gi...@ax...> - 2008-08-26 01:27:24
|
changelog | 17 ++++
src/algebra/aggcat.spad.pamphlet | 126 +++++++++++++-------------
src/algebra/array1.spad.pamphlet | 72 ++++++++--------
src/algebra/array2.spad.pamphlet | 108 +++++++++++-----------
src/algebra/bags.spad.pamphlet | 10 +-
src/algebra/card.spad.pamphlet | 52 ++++++------
src/algebra/carten.spad.pamphlet | 160 +++++++++++++++++-----------------
src/algebra/curve.spad.pamphlet | 96 ++++++++++----------
src/algebra/fr.spad.pamphlet | 76 ++++++++--------
src/algebra/listgcd.spad.pamphlet | 4 +-
src/algebra/mappkg.spad.pamphlet | 26 +++---
src/algebra/mkfunc.spad.pamphlet | 4 +-
src/algebra/plot.spad.pamphlet | 4 +-
src/algebra/radix.spad.pamphlet | 2 +-
src/algebra/stream.spad.pamphlet | 176 ++++++++++++++++++------------------
src/algebra/string.spad.pamphlet | 46 +++++-----
src/algebra/tree.spad.pamphlet | 126 +++++++++++++-------------
src/interp/format.boot.pamphlet | 22 +++---
18 files changed, 572 insertions(+), 555 deletions(-)
New commits:
commit ea54a0665dbc5941469b746fc9ff065636e744f7
Author: Tim Daly <da...@ax...>
Date: Sun Jul 13 02:40:03 2008 -0400
20080824 tpd src/interp/format.boot use ++X
20080824 tpd src/algebra/tree.spad use ++X
20080824 tpd src/algebra/string.spad use ++X
20080824 tpd src/algebra/stream.spad use ++X
20080824 tpd src/algebra/radix.spad use ++X
20080824 tpd src/algebra/plot.spad use ++X
20080824 tpd src/algebra/mkfunc.spad use ++X
20080824 tpd src/algebra/mappkg.spad use ++X
20080824 tpd src/algebra/listgcd.spad use ++X
20080824 tpd src/algebra/fr.spad use ++X
20080824 tpd src/algebra/curve.spad use ++X
20080824 tpd src/algebra/carten.spad use ++X
20080824 tpd src/algebra/card.spad use ++X
20080824 tpd src/algebra/bags.spad use ++X
20080824 tpd src/algebra/array2.spad use ++X
20080824 tpd src/algebra/array1.spad use ++X
20080824 tpd src/algebra/aggcat.spad use ++X
|
|
From: <da...@us...> - 2008-08-23 22:48:22
|
Revision: 956
http://axiom.svn.sourceforge.net/axiom/?rev=956&view=rev
Author: daly
Date: 2008-08-23 22:48:31 +0000 (Sat, 23 Aug 2008)
Log Message:
-----------
20080823 tpd src/algebra/s.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/multsqfr.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f07.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f04.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e04.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d03.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c06.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c05.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/axtimer.as remove ++CapitalLetter syntax
20080823 tpd src/algebra/asp.spad remove ++CapitalLetter syntax
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/asp.spad.pamphlet
trunk/axiom/src/algebra/axtimer.as.pamphlet
trunk/axiom/src/algebra/c02.spad.pamphlet
trunk/axiom/src/algebra/c05.spad.pamphlet
trunk/axiom/src/algebra/c06.spad.pamphlet
trunk/axiom/src/algebra/d01.spad.pamphlet
trunk/axiom/src/algebra/d02.spad.pamphlet
trunk/axiom/src/algebra/d03.spad.pamphlet
trunk/axiom/src/algebra/e01.spad.pamphlet
trunk/axiom/src/algebra/e02.spad.pamphlet
trunk/axiom/src/algebra/e04.spad.pamphlet
trunk/axiom/src/algebra/f01.spad.pamphlet
trunk/axiom/src/algebra/f02.spad.pamphlet
trunk/axiom/src/algebra/f04.spad.pamphlet
trunk/axiom/src/algebra/f07.spad.pamphlet
trunk/axiom/src/algebra/multsqfr.spad.pamphlet
trunk/axiom/src/algebra/s.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/changelog 2008-08-23 22:48:31 UTC (rev 956)
@@ -1,3 +1,20 @@
+20080823 tpd src/algebra/s.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/multsqfr.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/f07.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/f04.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/f02.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/f01.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/e04.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/e02.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/e01.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/d03.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/d02.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/d01.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/c06.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/c05.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/c02.spad remove ++CapitalLetter syntax
+20080823 tpd src/algebra/axtimer.as remove ++CapitalLetter syntax
+20080823 tpd src/algebra/asp.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/stream.spad stream API examples
20080823 tpd src/algebra/aggcat.spad UnaryRecursiveAggregate API examples
20080822 tpd src/input/Makefile add linalg, overload regression tests
Modified: trunk/axiom/src/algebra/asp.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/asp.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/asp.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -18,9 +18,9 @@
++ 6 October 1994
++ Related Constructors: FortranFunctionCategory, FortranProgramCategory.
++ Description:
-++\spadtype{Asp1} produces Fortran for Type 1 ASPs, needed for various
-++NAG routines. Type 1 ASPs take a univariate expression (in the symbol
-++X) and turn it into a Fortran Function like the following:
+++ \spadtype{Asp1} produces Fortran for Type 1 ASPs, needed for various
+++ NAG routines. Type 1 ASPs take a univariate expression (in the symbol
+++ X) and turn it into a Fortran Function like the following:
++\begin{verbatim}
++ DOUBLE PRECISION FUNCTION F(X)
++ DOUBLE PRECISION X
@@ -2941,10 +2941,10 @@
++ 6 October 1994
++ Related Constructors: FortranVectorFunctionCategory, FortranProgramCategory
++ Description:
-++\spadtype{Asp6} produces Fortran for Type 6 ASPs, needed for NAG routines
-++\axiomOpFrom{c05nbf}{c05Package}, \axiomOpFrom{c05ncf}{c05Package}.
-++These represent vectors of functions of X(i) and look like:
-++\begin{verbatim}
+++ \spadtype{Asp6} produces Fortran for Type 6 ASPs, needed for NAG routines
+++ \axiomOpFrom{c05nbf}{c05Package}, \axiomOpFrom{c05ncf}{c05Package}.
+++ These represent vectors of functions of X(i) and look like:
+++ \begin{verbatim}
++ SUBROUTINE FCN(N,X,FVEC,IFLAG)
++ DOUBLE PRECISION X(N),FVEC(N)
++ INTEGER N,IFLAG
@@ -2966,7 +2966,7 @@
++ FVEC(9)=(-2.0D0*X(9)**2)+3.0D0*X(9)+(-1.0D0*X(8))+1.0D0
++ RETURN
++ END
-++\end{verbatim}
+++ \end{verbatim}
Asp6(name): Exports == Implementation where
name : Symbol
@@ -3088,11 +3088,11 @@
++ 6 October 1994
++ Related Constructors: FortranVectorFunctionCategory, FortranProgramCategory
++ Description:
-++\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 X and
-++the array Z, and look like:
-++\begin{verbatim}
+++ \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 X and
+++ the array Z, and look like:
+++ \begin{verbatim}
++ SUBROUTINE FCN(X,Z,F)
++ DOUBLE PRECISION F(*),X,Z(*)
++ F(1)=DTAN(Z(3))
@@ -3101,7 +3101,7 @@
++ F(3)=-0.03199999999999999D0/(X*Z(2)**2)
++ RETURN
++ END
-++\end{verbatim}
+++ \end{verbatim}
Asp7(name): Exports == Implementation where
name : Symbol
@@ -4106,19 +4106,21 @@
++ 6 October 1994
++ Related Constructors: FortranVectorFunctionCategory, FortranProgramCategory
++ Description:
-++\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 X and a vector Y, for example:
-++\begin{verbatim}
+++ \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 X and a vector 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 G, then extra information is added
-++via COMMON blocks used by certain routines. This specifies that the value
-++returned by G in this case is to be ignored.
+++ \end{verbatim}
+++ If the user provides a constant value for G, then extra information is added
+++ via COMMON blocks used by certain routines. This specifies that the value
+++ returned by G in this case is to be ignored.
Asp9(name): Exports == Implementation where
name : Symbol
Modified: trunk/axiom/src/algebra/axtimer.as.pamphlet
===================================================================
--- trunk/axiom/src/algebra/axtimer.as.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/axtimer.as.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -81,7 +81,7 @@
++ and t is not stopped or affected.
reset!: % -> %;
++ Resets the timer t to 0 and stops it if it is running.
- ++Returns the timer t after it is reset.
+ ++ Returns the timer t after it is reset.
start!: % -> Z;
++ Starts or restarts t, without resetting it to 0,
++ It has no effect on t if it is already running.
Modified: trunk/axiom/src/algebra/c02.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/c02.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/c02.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,10 +15,10 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:27 1994
-++Description:
-++This package uses the NAG Library to compute the zeros of a
-++polynomial with real or complex coefficients.
-++See \downlink{Manual Page}{manpageXXc02}.
+++ Description:
+++ This package uses the NAG Library to compute the zeros of a
+++ polynomial with real or complex coefficients.
+++ See \downlink{Manual Page}{manpageXXc02}.
NagPolynomialRootsPackage(): Exports == Implementation where
S ==> Symbol
Modified: trunk/axiom/src/algebra/c05.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/c05.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/c05.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,12 +15,12 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:28 1994
-++Description:
-++This package uses the NAG Library to calculate real zeros of
-++continuous real functions of one or more variables. (Complex
-++equations must be expressed in terms of the equivalent larger
-++system of real equations.)
-++See \downlink{Manual Page}{manpageXXc05}.
+++ Description:
+++ This package uses the NAG Library to calculate real zeros of
+++ continuous real functions of one or more variables. (Complex
+++ equations must be expressed in terms of the equivalent larger
+++ system of real equations.)
+++ See \downlink{Manual Page}{manpageXXc05}.
NagRootFindingPackage(): Exports == Implementation where
S ==> Symbol
Modified: trunk/axiom/src/algebra/c06.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/c06.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/c06.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,11 +15,11 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:30 1994
-++Description:
-++This package uses the NAG Library to calculate the discrete Fourier
-++transform of a sequence of real or complex data values, and
-++applies it to calculate convolutions and correlations.
-++See \downlink{Manual Page}{manpageXXc06}.
+++ Description:
+++ This package uses the NAG Library to calculate the discrete Fourier
+++ transform of a sequence of real or complex data values, and
+++ applies it to calculate convolutions and correlations.
+++ See \downlink{Manual Page}{manpageXXc06}.
NagSeriesSummationPackage(): Exports == Implementation where
S ==> Symbol
Modified: trunk/axiom/src/algebra/d01.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/d01.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/d01.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,11 +15,11 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:37 1994
-++Description:
-++This package uses the NAG Library to calculate the numerical value of
-++definite integrals in one or more dimensions and to evaluate
-++weights and abscissae of integration rules.
-++See \downlink{Manual Page}{manpageXXd01}.
+++ Description:
+++ This package uses the NAG Library to calculate the numerical value of
+++ definite integrals in one or more dimensions and to evaluate
+++ weights and abscissae of integration rules.
+++ See \downlink{Manual Page}{manpageXXd01}.
NagIntegrationPackage(): Exports == Implementation where
S ==> Symbol
Modified: trunk/axiom/src/algebra/d02.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/d02.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/d02.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,16 +15,16 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Mon Jun 20 17:56:33 1994
-++Description:
-++This package uses the NAG Library to calculate the numerical solution of ordinary
-++differential equations. There are two main types of problem,
-++those in which all boundary conditions are specified at one point
-++(initial-value problems), and those in which the boundary
-++conditions are distributed between two or more points (boundary-
-++value problems and eigenvalue problems). Routines are available
-++for initial-value problems, two-point boundary-value problems and
-++Sturm-Liouville eigenvalue problems.
-++See \downlink{Manual Page}{manpageXXd02}.
+++ Description:
+++ This package uses the NAG Library to calculate the numerical solution of
+++ ordinary differential equations. There are two main types of problem,
+++ those in which all boundary conditions are specified at one point
+++ (initial-value problems), and those in which the boundary
+++ conditions are distributed between two or more points (boundary-
+++ value problems and eigenvalue problems). Routines are available
+++ for initial-value problems, two-point boundary-value problems and
+++ Sturm-Liouville eigenvalue problems.
+++ See \downlink{Manual Page}{manpageXXd02}.
NagOrdinaryDifferentialEquationsPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/d03.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/d03.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/d03.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,10 +15,10 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:51 1994
-++Description:
-++This package uses the NAG Library to solve partial
-++differential equations.
-++See \downlink{Manual Page}{manpageXXd03}.
+++ Description:
+++ This package uses the NAG Library to solve partial
+++ differential equations.
+++ See \downlink{Manual Page}{manpageXXd03}.
NagPartialDifferentialEquationsPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/e01.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/e01.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/e01.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,16 +15,16 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:53 1994
-++Description:
-++This package uses the NAG Library to calculate the interpolation of a function of
-++one or two variables. When provided with the value of the
-++function (and possibly one or more of its lowest-order
-++derivatives) at each of a number of values of the variable(s),
-++the routines provide either an interpolating function or an
-++interpolated value. For some of the interpolating functions,
-++there are supporting routines to evaluate, differentiate or
-++integrate them.
-++See \downlink{Manual Page}{manpageXXe01}.
+++ Description:
+++ This package uses the NAG Library to calculate the interpolation of a
+++ function of one or two variables. When provided with the value of the
+++ function (and possibly one or more of its lowest-order
+++ derivatives) at each of a number of values of the variable(s),
+++ the routines provide either an interpolating function or an
+++ interpolated value. For some of the interpolating functions,
+++ there are supporting routines to evaluate, differentiate or
+++ integrate them.
+++ See \downlink{Manual Page}{manpageXXe01}.
NagInterpolationPackage(): Exports == Implementation where
Modified: trunk/axiom/src/algebra/e02.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/e02.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/e02.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,31 +15,31 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:44:59 1994
-++Description:
-++This package uses the NAG Library to find a
-++function which approximates a set of data points. Typically the
-++data contain random errors, as of experimental measurement, which
-++need to be smoothed out. To seek an approximation to the data, it
-++is first necessary to specify for the approximating function a
-++mathematical form (a polynomial, for example) which contains a
-++number of unspecified coefficients: the appropriate fitting
-++routine then derives for the coefficients the values which
-++provide the best fit of that particular form. The package deals
-++mainly with curve and surface fitting (i.e., fitting with
-++functions of one and of two variables) when a polynomial or a
-++cubic spline is used as the fitting function, since these cover
-++the most common needs. However, fitting with other functions
-++and/or more variables can be undertaken by means of general
-++linear or nonlinear routines (some of which are contained in
-++other packages) depending on whether the coefficients in the
-++function occur linearly or nonlinearly. Cases where a graph
-++rather than a set of data points is given can be treated simply
-++by first reading a suitable set of points from the graph.
-++The package also contains routines for evaluating,
-++differentiating and integrating polynomial and spline curves and
-++surfaces, once the numerical values of their coefficients have
-++been determined.
-++See \downlink{Manual Page}{manpageXXe02}.
+++ Description:
+++ This package uses the NAG Library to find a
+++ function which approximates a set of data points. Typically the
+++ data contain random errors, as of experimental measurement, which
+++ need to be smoothed out. To seek an approximation to the data, it
+++ is first necessary to specify for the approximating function a
+++ mathematical form (a polynomial, for example) which contains a
+++ number of unspecified coefficients: the appropriate fitting
+++ routine then derives for the coefficients the values which
+++ provide the best fit of that particular form. The package deals
+++ mainly with curve and surface fitting (i.e., fitting with
+++ functions of one and of two variables) when a polynomial or a
+++ cubic spline is used as the fitting function, since these cover
+++ the most common needs. However, fitting with other functions
+++ and/or more variables can be undertaken by means of general
+++ linear or nonlinear routines (some of which are contained in
+++ other packages) depending on whether the coefficients in the
+++ function occur linearly or nonlinearly. Cases where a graph
+++ rather than a set of data points is given can be treated simply
+++ by first reading a suitable set of points from the graph.
+++ The package also contains routines for evaluating,
+++ differentiating and integrating polynomial and spline curves and
+++ surfaces, once the numerical values of their coefficients have
+++ been determined.
+++ See \downlink{Manual Page}{manpageXXe02}.
NagFittingPackage(): Exports == Implementation where
Modified: trunk/axiom/src/algebra/e04.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/e04.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/e04.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,16 +15,16 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:09 1994
-++Description:
-++This package uses the NAG Library to perform optimization.
-++An optimization problem involves minimizing a function (called
-++the objective function) of several variables, possibly subject to
-++restrictions on the values of the variables defined by a set of
-++constraint functions. The routines in the NAG Foundation Library
-++are concerned with function minimization only, since the problem
-++of maximizing a given function can be transformed into a
-++minimization problem simply by multiplying the function by -1.
-++See \downlink{Manual Page}{manpageXXe04}.
+++ Description:
+++ This package uses the NAG Library to perform optimization.
+++ An optimization problem involves minimizing a function (called
+++ the objective function) of several variables, possibly subject to
+++ restrictions on the values of the variables defined by a set of
+++ constraint functions. The routines in the NAG Foundation Library
+++ are concerned with function minimization only, since the problem
+++ of maximizing a given function can be transformed into a
+++ minimization problem simply by multiplying the function by -1.
+++ See \downlink{Manual Page}{manpageXXe04}.
NagOptimisationPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/f01.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/f01.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/f01.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,10 +15,10 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:15 1994
-++Description:
-++This package uses the NAG Library to provide facilities for matrix factorizations and
-++associated transformations.
-++See \downlink{Manual Page}{manpageXXf01}.
+++ Description:
+++ This package uses the NAG Library to provide facilities for matrix
+++ factorizations and associated transformations.
+++ See \downlink{Manual Page}{manpageXXf01}.
NagMatrixOperationsPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/f02.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/f02.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/f02.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,15 +15,15 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:20 1994
-++Description:
-++This package uses the NAG Library to compute
-++\begin{items}
-++\item eigenvalues and eigenvectors of a matrix
-++\item eigenvalues and eigenvectors of generalized matrix
-++eigenvalue problems
-++\item singular values and singular vectors of a matrix.
-++\end{items}
-++See \downlink{Manual Page}{manpageXXf02}.
+++ Description:
+++ This package uses the NAG Library to compute
+++ \begin{items}
+++ \item eigenvalues and eigenvectors of a matrix
+++ \item eigenvalues and eigenvectors of generalized matrix
+++ eigenvalue problems
+++ \item singular values and singular vectors of a matrix.
+++ \end{items}
+++ See \downlink{Manual Page}{manpageXXf02}.
NagEigenPackage(): Exports == Implementation where
S ==> Symbol
Modified: trunk/axiom/src/algebra/f04.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/f04.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/f04.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,13 +15,14 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:31 1994
-++Description:
-++This package uses the NAG Library to solve the matrix equation \axiom{AX=B}, where \axiom{B}
-++may be a single vector or a matrix of multiple right-hand sides.
-++The matrix \axiom{A} may be real, complex, symmetric, Hermitian positive-
-++definite, or sparse. It may also be rectangular, in which case a
-++least-squares solution is obtained.
-++See \downlink{Manual Page}{manpageXXf04}.
+++ Description:
+++ This package uses the NAG Library to solve the matrix equation
+++ \axiom{AX=B}, where \axiom{B}
+++ may be a single vector or a matrix of multiple right-hand sides.
+++ The matrix \axiom{A} may be real, complex, symmetric, Hermitian positive-
+++ definite, or sparse. It may also be rectangular, in which case a
+++ least-squares solution is obtained.
+++ See \downlink{Manual Page}{manpageXXf04}.
NagLinearEquationSolvingPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/f07.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/f07.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/f07.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,11 +15,11 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:42 1994
-++Description:
-++This package uses the NAG Library to compute matrix
-++factorizations, and to solve systems of linear equations
-++following the matrix factorizations.
-++See \downlink{Manual Page}{manpageXXf07}.
+++ Description:
+++ This package uses the NAG Library to compute matrix
+++ factorizations, and to solve systems of linear equations
+++ following the matrix factorizations.
+++ See \downlink{Manual Page}{manpageXXf07}.
NagLapack(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
Modified: trunk/axiom/src/algebra/multsqfr.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/multsqfr.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/multsqfr.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -12,7 +12,7 @@
\section{package MULTSQFR MultivariateSquareFree}
<<package MULTSQFR MultivariateSquareFree>>=
)abbrev package MULTSQFR MultivariateSquareFree
-++Author : P.Gianni
+++ Author : P.Gianni
++ This package provides the functions for the computation of the square
++ free decomposition of a multivariate polynomial.
++ It uses the package GenExEuclid for the resolution of
Modified: trunk/axiom/src/algebra/s.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/s.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
+++ trunk/axiom/src/algebra/s.spad.pamphlet 2008-08-23 22:48:31 UTC (rev 956)
@@ -15,10 +15,10 @@
++ Author: Godfrey Nolan and Mike Dewar
++ Date Created: Jan 1994
++ Date Last Updated: Thu May 12 17:45:44 1994
-++Description:
-++This package uses the NAG Library to compute some commonly
-++occurring physical and mathematical functions.
-++See \downlink{Manual Page}{manpageXXs}.
+++ Description:
+++ This package uses the NAG Library to compute some commonly
+++ occurring physical and mathematical functions.
+++ See \downlink{Manual Page}{manpageXXs}.
NagSpecialFunctionsPackage(): Exports == Implementation where
S ==> Symbol
FOP ==> FortranOutputStackPackage
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-23 22:47:35
|
changelog | 17 ++++++++++++
src/algebra/asp.spad.pamphlet | 46 +++++++++++++++++----------------
src/algebra/axtimer.as.pamphlet | 2 +-
src/algebra/c02.spad.pamphlet | 8 +++---
src/algebra/c05.spad.pamphlet | 12 ++++----
src/algebra/c06.spad.pamphlet | 10 +++---
src/algebra/d01.spad.pamphlet | 10 +++---
src/algebra/d02.spad.pamphlet | 20 +++++++-------
src/algebra/d03.spad.pamphlet | 8 +++---
src/algebra/e01.spad.pamphlet | 20 +++++++-------
src/algebra/e02.spad.pamphlet | 50 ++++++++++++++++++------------------
src/algebra/e04.spad.pamphlet | 20 +++++++-------
src/algebra/f01.spad.pamphlet | 8 +++---
src/algebra/f02.spad.pamphlet | 18 ++++++------
src/algebra/f04.spad.pamphlet | 15 ++++++-----
src/algebra/f07.spad.pamphlet | 10 +++---
src/algebra/multsqfr.spad.pamphlet | 2 +-
src/algebra/s.spad.pamphlet | 8 +++---
18 files changed, 152 insertions(+), 132 deletions(-)
New commits:
commit 78b2e710dd9cd62aeb06450f10bcc75298c740b2
Author: Tim Daly <da...@ax...>
Date: Sat Jul 12 01:25:39 2008 -0400
20080823 tpd src/algebra/s.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/multsqfr.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f07.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f04.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/f01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e04.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/e01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d03.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/d01.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c06.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c05.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/c02.spad remove ++CapitalLetter syntax
20080823 tpd src/algebra/axtimer.as remove ++CapitalLetter syntax
20080823 tpd src/algebra/asp.spad remove ++CapitalLetter syntax
|
|
From: <da...@us...> - 2008-08-23 21:53:44
|
Revision: 955
http://axiom.svn.sourceforge.net/axiom/?rev=955&view=rev
Author: daly
Date: 2008-08-23 21:53:54 +0000 (Sat, 23 Aug 2008)
Log Message:
-----------
20080823 tpd src/algebra/stream.spad stream API examples
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/stream.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-23 16:48:05 UTC (rev 954)
+++ trunk/axiom/changelog 2008-08-23 21:53:54 UTC (rev 955)
@@ -1,3 +1,4 @@
+20080823 tpd src/algebra/stream.spad stream API examples
20080823 tpd src/algebra/aggcat.spad UnaryRecursiveAggregate API examples
20080822 tpd src/input/Makefile add linalg, overload regression tests
20080822 tpd src/input/linalg.input recovered
Modified: trunk/axiom/src/algebra/stream.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/stream.spad.pamphlet 2008-08-23 16:48:05 UTC (rev 954)
+++ trunk/axiom/src/algebra/stream.spad.pamphlet 2008-08-23 21:53:54 UTC (rev 955)
@@ -29,21 +29,42 @@
++ remove(f,st) returns a stream consisting of those elements of stream
++ st which do not satisfy the predicate f.
++ Note: \spad{remove(f,st) = [x for x in st | not f(x)]}.
+ ++
+ ++E m:=[i for i in 1..]
+ ++E f(i:PositiveInteger):Boolean == even? i
+ ++E remove(f,m)
+
select: (S -> Boolean,%) -> %
++ select(f,st) returns a stream consisting of those elements of stream
++ st satisfying the predicate f.
++ Note: \spad{select(f,st) = [x for x in st | f(x)]}.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E select(x+->prime? x,m)
+
explicitEntries?: % -> Boolean
++ explicitEntries?(s) returns true if the stream s has
++ explicitly computed entries, and false otherwise.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E explicitEntries? m
+
explicitlyEmpty?: % -> Boolean
++ explicitlyEmpty?(s) returns true if the stream is an
++ (explicitly) empty stream.
++ Note: this is a null test which will not cause lazy evaluation.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E explicitlyEmpty? m
+
lazy?: % -> Boolean
++ lazy?(s) returns true if the first node of the stream s
++ is a lazy evaluation mechanism which could produce an
++ additional entry to s.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E lazy? m
+
lazyEvaluate: % -> %
++ lazyEvaluate(s) causes one lazy evaluation of stream s.
++ Caution: the first node must be a lazy evaluation mechanism
@@ -54,23 +75,47 @@
++ frst(s) returns the first element of stream s.
++ Caution: this function should only be called after a \spad{empty?} test
++ has been made since there no error check.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E frst m
+
rst: % -> %
++ rst(s) returns a pointer to the next node of stream s.
++ Caution: this function should only be called after a \spad{empty?} test
++ has been made since there no error check.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E rst m
+
numberOfComputedEntries: % -> NonNegativeInteger
++ numberOfComputedEntries(st) returns the number of explicitly
++ computed entries of stream st which exist immediately prior to the time
++ this function is called.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E numberOfComputedEntries m
+
extend: (%,Integer) -> %
++ extend(st,n) causes entries to be computed, if necessary,
++ so that 'st' will have at least 'n' explicit entries or so
++ that all entries of 'st' will be computed if 'st' is finite
++ with length <= n.
+ ++
+ ++E m:=[i for i in 0..]
+ ++E numberOfComputedEntries m
+ ++E extend(m,20)
+ ++E numberOfComputedEntries m
+
complete: % -> %
++ complete(st) causes all entries of 'st' to be computed.
++ this function should only be called on streams which are
++ known to be finite.
+ ++
+ ++E m:=[i for i in 1..]
+ ++E n:=filterUntil(i+->i>100,m)
+ ++E numberOfComputedEntries n
+ ++E complete n
+ ++E numberOfComputedEntries n
add
@@ -503,16 +548,32 @@
Exports ==> with
cycleElt: ST -> Union(ST,"failed")
- ++ cycleElt(s) returns a pointer to a node in the cycle if the stream s is
- ++ cyclic and returns "failed" if s is not cyclic
+ ++ cycleElt(s) returns a pointer to a node in the cycle if the stream
+ ++ s is cyclic and returns "failed" if s is not cyclic
+ ++
+ ++E p:=repeating([1,2,3])
+ ++E q:=cons(4,p)
+ ++E cycleElt q
+ ++E r:=[1,2,3]::Stream(Integer)
+ ++E cycleElt r
+
computeCycleLength: ST -> NonNegativeInteger
++ computeCycleLength(s) returns the length of the cycle of a
++ cyclic stream t, where s is a pointer to a node in the
++ cyclic part of t.
+ ++
+ ++E p:=repeating([1,2,3])
+ ++E q:=cons(4,p)
+ ++E computeCycleLength(cycleElt(q))
+
computeCycleEntry: (ST,ST) -> ST
++ computeCycleEntry(x,cycElt), where cycElt is a pointer to a
++ node in the cyclic part of the cyclic stream x, returns a
++ pointer to the first node in the cycle
+ ++
+ ++E p:=repeating([1,2,3])
+ ++E q:=cons(4,p)
+ ++E computeCycleEntry(q,cycleElt(q))
Implementation ==> add
@@ -755,28 +816,63 @@
coerce: L S -> %
++ coerce(l) converts a list l to a stream.
+ ++
+ ++E m:=[1,2,3,4,5,6,7,8,9,10,11,12]
+ ++E coerce(m)@Stream(Integer)
+ ++E m::Stream(Integer)
+
repeating: L S -> %
++ repeating(l) is a repeating stream whose period is the list l.
+ ++
+ ++E m:=repeating([-1,0,1,2,3])
+
if S has SetCategory then
repeating?: (L S,%) -> B
++ repeating?(l,s) returns true if a stream s is periodic
++ with period l, and false otherwise.
+ ++
+ ++E m:=[1,2,3]
+ ++E n:=repeating(m)
+ ++E repeating?(m,n)
+
findCycle: (NNI,%) -> Record(cycle?: B, prefix: NNI, period: NNI)
++ findCycle(n,st) determines if st is periodic within n.
+ ++
+ ++E m:=[1,2,3]
+ ++E n:=repeating(m)
+ ++E findCycle(3,n)
+ ++E findCycle(2,n)
+
delay: (() -> %) -> %
- ++ delay(f) creates a stream with a lazy evaluation defined by function f.
+ ++ delay(f) creates a stream with a lazy evaluation defined by
+ ++ function f.
++ Caution: This function can only be called in compiled code.
cons: (S,%) -> %
++ cons(a,s) returns a stream whose \spad{first} is \spad{a}
++ and whose \spad{rest} is s.
++ Note: \spad{cons(a,s) = concat(a,s)}.
+ ++
+ ++E m:=[1,2,3]
+ ++E n:=repeating(m)
+ ++E cons(4,n)
+
if S has SetCategory then
output: (I, %) -> Void
++ output(n,st) computes and displays the first n entries
++ of st.
+ ++
+ ++E m:=[1,2,3]
+ ++E n:=repeating(m)
+ ++E output(5,n)
+
showAllElements: % -> OUT
++ showAllElements(s) creates an output form which displays all
++ computed elements.
+ ++
+ ++E m:=[1,2,3,4,5,6,7,8,9,10,11,12]
+ ++E n:=m::Stream(PositiveInteger)
+ ++E showAllElements n
+
showAll?: () -> B
++ showAll?() returns true if all computed entries of streams
++ will be displayed.
@@ -784,22 +880,46 @@
setrest_!: (%,I,%) -> %
++ setrest!(x,n,y) sets rest(x,n) to y. The function will expand
++ cycles if necessary.
+ ++
+ ++E p:=[i for i in 1..]
+ ++E q:=[i for i in 9..]
+ ++E setrest!(p,4,q)
+ ++E p
+
generate: (() -> S) -> %
++ generate(f) creates an infinite stream all of whose elements are
++ equal to \spad{f()}.
++ Note: \spad{generate(f) = [f(),f(),f(),...]}.
+ ++
+ ++E f():Integer == 1
+ ++E generate(f)
+
generate: (S -> S,S) -> %
++ generate(f,x) creates an infinite stream whose first element is
++ x and whose nth element (\spad{n > 1}) is f applied to the previous
++ element. Note: \spad{generate(f,x) = [x,f(x),f(f(x)),...]}.
+ ++
+ ++E f(x:Integer):Integer == x+10
+ ++E generate(f,10)
+
filterWhile: (S -> Boolean,%) -> %
++ filterWhile(p,s) returns \spad{[x0,x1,...,x(n-1)]} where
++ \spad{s = [x0,x1,x2,..]} and
++ n is the smallest index such that \spad{p(xn) = false}.
+ ++
+ ++E m:=[i for i in 1..]
+ ++E f(x:PositiveInteger):Boolean == x < 5
+ ++E filterWhile(f,m)
+
filterUntil: (S -> Boolean,%) -> %
++ filterUntil(p,s) returns \spad{[x0,x1,...,x(n)]} where
++ \spad{s = [x0,x1,x2,..]} and
++ n is the smallest index such that \spad{p(xn) = true}.
+ ++
+ ++E m:=[i for i in 1..]
+ ++E f(x:PositiveInteger):Boolean == x < 5
+ ++E filterUntil(f,m)
+
-- if S has SetCategory then
-- map: ((S,S) -> S,%,%,S) -> %
-- ++ map(f,x,y,a) is equivalent to map(f,x,y)
@@ -1323,8 +1443,13 @@
Exports ==> with
concat: ST ST S -> ST S
- ++ concat(u) returns the left-to-right concatentation of the streams in u.
- ++ Note: \spad{concat(u) = reduce(concat,u)}.
+ ++ concat(u) returns the left-to-right concatentation of the
+ ++ streams in u. Note: \spad{concat(u) = reduce(concat,u)}.
+ ++
+ ++E m:=[i for i in 10..]
+ ++E n:=[j for j in 1.. | prime? j]
+ ++E p:=[m,n]::Stream(Stream(PositiveInteger))
+ ++E concat(p)
Implementation ==> add
@@ -1350,17 +1475,32 @@
++ map(f,s) returns a stream whose elements are the function f applied
++ to the corresponding elements of s.
++ Note: \spad{map(f,[x0,x1,x2,...]) = [f(x0),f(x1),f(x2),..]}.
+ ++
+ ++E m:=[i for i in 1..]
+ ++E f(i:PositiveInteger):PositiveInteger==i**2
+ ++E map(f,m)
+
scan: (B,((A,B) -> B),ST A) -> ST B
++ scan(b,h,[x0,x1,x2,...]) returns \spad{[y0,y1,y2,...]}, where
++ \spad{y0 = h(x0,b)},
++ \spad{y1 = h(x1,y0)},\spad{...}
++ \spad{yn = h(xn,y(n-1))}.
+ ++
+ ++E m:=[i for i in 1..]::Stream(Integer)
+ ++E f(i:Integer,j:Integer):Integer==i+j
+ ++E scan(1,f,m)
+
reduce: (B,(A,B) -> B,ST A) -> B
++ reduce(b,f,u), where u is a finite stream \spad{[x0,x1,...,xn]},
++ returns the value \spad{r(n)} computed as follows:
++ \spad{r0 = f(x0,b),
++ r1 = f(x1,r0),...,
++ r(n) = f(xn,r(n-1))}.
+ ++
+ ++E m:=[i for i in 1..300]::Stream(Integer)
+ ++E f(i:Integer,j:Integer):Integer==i+j
+ ++E reduce(1,f,m)
+
-- rreduce: (B,(A,B) -> B,ST A) -> B
-- ++ reduce(b,h,[x0,x1,..,xn]) = h(x1,h(x2(..,h(x(n-1),h(xn,b))..)
-- reshape: (ST B,ST A) -> ST B
@@ -1411,7 +1551,13 @@
map: ((A,B) -> C,ST A,ST B) -> ST C
++ map(f,st1,st2) returns the stream whose elements are the
++ function f applied to the corresponding elements of st1 and st2.
- ++ Note: \spad{map(f,[x0,x1,x2,..],[y0,y1,y2,..]) = [f(x0,y0),f(x1,y1),..]}.
+ ++ \spad{map(f,[x0,x1,x2,..],[y0,y1,y2,..]) = [f(x0,y0),f(x1,y1),..]}.
+ ++
+ ++S
+ ++E m:=[i for i in 1..]::Stream(Integer)
+ ++E n:=[i for i in 1..]::Stream(Integer)
+ ++E f(i:Integer,j:Integer):Integer == i+j
+ ++E map(f,m,n)
Implementation ==> add
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-23 21:53:17
|
changelog | 1 +
src/algebra/stream.spad.pamphlet | 158 ++++++++++++++++++++++++++++++++++++--
2 files changed, 153 insertions(+), 6 deletions(-)
New commits:
commit de7d478134f918b7a77b1ed1bcc9a3de17872591
Author: Tim Daly <da...@ax...>
Date: Sat Jul 12 00:56:59 2008 -0400
20080823 tpd src/algebra/stream.spad stream API examples
|
|
From: <da...@us...> - 2008-08-23 16:47:55
|
Revision: 954
http://axiom.svn.sourceforge.net/axiom/?rev=954&view=rev
Author: daly
Date: 2008-08-23 16:48:05 +0000 (Sat, 23 Aug 2008)
Log Message:
-----------
20080823 tpd src/algebra/aggcat.spad UnaryRecursiveAggregate API examples
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/aggcat.spad.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-22 06:46:27 UTC (rev 953)
+++ trunk/axiom/changelog 2008-08-23 16:48:05 UTC (rev 954)
@@ -1,3 +1,4 @@
+20080823 tpd src/algebra/aggcat.spad UnaryRecursiveAggregate API examples
20080822 tpd src/input/Makefile add linalg, overload regression tests
20080822 tpd src/input/linalg.input recovered
20080822 tpd src/input/overload.input recovered
Modified: trunk/axiom/src/algebra/aggcat.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-22 06:46:27 UTC (rev 953)
+++ trunk/axiom/src/algebra/aggcat.spad.pamphlet 2008-08-23 16:48:05 UTC (rev 954)
@@ -1,3 +1,4 @@
+
\documentclass{article}
\usepackage{axiom}
\begin{document}
@@ -1618,90 +1619,196 @@
++ Since these aggregates are recursive aggregates, they may be cyclic.
UnaryRecursiveAggregate(S:Type): Category == RecursiveAggregate S with
concat: (%,%) -> %
- ++ concat(u,v) returns an aggregate w consisting of the elements of u
- ++ followed by the elements of v.
- ++ Note: \axiom{v = rest(w,#a)}.
+ ++ concat(u,v) returns an aggregate w consisting of the elements of u
+ ++ followed by the elements of v.
+ ++ Note: \axiom{v = rest(w,#a)}.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat(5,m)
+
concat: (S,%) -> %
- ++ concat(x,u) returns aggregate consisting of x followed by
- ++ the elements of u.
- ++ Note: if \axiom{v = concat(x,u)} then \axiom{x = first v}
- ++ and \axiom{u = rest v}.
+ ++ concat(x,u) returns aggregate consisting of x followed by
+ ++ the elements of u.
+ ++ Note: if \axiom{v = concat(x,u)} then \axiom{x = first v}
+ ++ and \axiom{u = rest v}.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat(m,m)
+
first: % -> S
- ++ first(u) returns the first element of u
- ++ (equivalently, the value at the current node).
+ ++ first(u) returns the first element of u
+ ++ (equivalently, the value at the current node).
+ ++
+ ++E m:=[1,2,3]
+ ++E first(m)
+
elt: (%,"first") -> S
- ++ elt(u,"first") (also written: \axiom{u . first}) is equivalent to first u.
+ ++ elt(u,"first") (also written: \axiom{u . first}) is
+ ++equivalent to first u.
+
first: (%,NonNegativeInteger) -> %
- ++ first(u,n) returns a copy of the first n (\axiom{n >= 0}) elements of u.
+ ++ first(u,n) returns a copy of the first n
+ ++ (\axiom{n >= 0}) elements of u.
+ ++
+ ++E m:=[1,2,3]
+ ++E first(m,2)
+
rest: % -> %
- ++ rest(u) returns an aggregate consisting of all but the first
- ++ element of u
- ++ (equivalently, the next node of u).
+ ++ rest(u) returns an aggregate consisting of all but the first
+ ++ element of u
+ ++ (equivalently, the next node of u).
+ ++
+ ++E m:=[1,2,3]
+ ++E rest m
+
elt: (%,"rest") -> %
- ++ elt(%,"rest") (also written: \axiom{u.rest}) is
- ++ equivalent to \axiom{rest u}.
+ ++ elt(%,"rest") (also written: \axiom{u.rest}) is
+ ++ equivalent to \axiom{rest u}.
+
rest: (%,NonNegativeInteger) -> %
- ++ rest(u,n) returns the \axiom{n}th (n >= 0) node of u.
- ++ Note: \axiom{rest(u,0) = u}.
+ ++ rest(u,n) returns the \axiom{n}th (n >= 0) node of u.
+ ++ Note: \axiom{rest(u,0) = u}.
+ ++
+ ++E m:=[1,2,3]
+ ++E rest(m,2)
+
last: % -> S
- ++ last(u) resturn the last element of u.
- ++ Note: for lists, \axiom{last(u) = u . (maxIndex u) = u . (# u - 1)}.
+ ++ last(u) resturn the last element of u.
+ ++ Note: for lists, \axiom{last(u) = u . (maxIndex u) = u . (# u - 1)}.
+ ++
+ ++E m:=[1,2,3]
+ ++E last m
+
elt: (%,"last") -> S
- ++ elt(u,"last") (also written: \axiom{u . last}) is equivalent to last u.
+ ++ elt(u,"last") (also written: \axiom{u . last}) is equivalent to last u.
+
last: (%,NonNegativeInteger) -> %
- ++ last(u,n) returns a copy of the last n (\axiom{n >= 0}) nodes of u.
- ++ Note: \axiom{last(u,n)} is a list of n elements.
+ ++ last(u,n) returns a copy of the last n (\axiom{n >= 0}) nodes of u.
+ ++ Note: \axiom{last(u,n)} is a list of n elements.
+ ++
+ ++E m:=[1,2,3]
+ ++E last(m,2)
+
tail: % -> %
- ++ tail(u) returns the last node of u.
- ++ Note: if u is \axiom{shallowlyMutable},
- ++ \axiom{setrest(tail(u),v) = concat(u,v)}.
+ ++ tail(u) returns the last node of u.
+ ++ Note: if u is \axiom{shallowlyMutable},
+ ++ \axiom{setrest(tail(u),v) = concat(u,v)}.
+ ++
+ ++E m:=[1,2,3]
+ ++E last(m,2)
+
second: % -> S
- ++ second(u) returns the second element of u.
- ++ Note: \axiom{second(u) = first(rest(u))}.
+ ++ second(u) returns the second element of u.
+ ++ Note: \axiom{second(u) = first(rest(u))}.
+ ++
+ ++E m:=[1,2,3]
+ ++E second m
+
third: % -> S
- ++ third(u) returns the third element of u.
- ++ Note: \axiom{third(u) = first(rest(rest(u)))}.
+ ++ third(u) returns the third element of u.
+ ++ Note: \axiom{third(u) = first(rest(rest(u)))}.
+ ++
+ ++E m:=[1,2,3]
+ ++E third m
+
cycleEntry: % -> %
- ++ cycleEntry(u) returns the head of a top-level cycle contained in
- ++ aggregate u, or \axiom{empty()} if none exists.
+ ++ cycleEntry(u) returns the head of a top-level cycle contained in
+ ++ aggregate u, or \axiom{empty()} if none exists.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat!(m,tail(m))
+ ++E cycleEntry m
+
cycleLength: % -> NonNegativeInteger
- ++ cycleLength(u) returns the length of a top-level cycle
- ++ contained in aggregate u, or 0 is u has no such cycle.
+ ++ cycleLength(u) returns the length of a top-level cycle
+ ++ contained in aggregate u, or 0 is u has no such cycle.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat!(m,tail(m))
+ ++E cycleLength m
+
cycleTail: % -> %
- ++ cycleTail(u) returns the last node in the cycle, or
- ++ empty if none exists.
+ ++ cycleTail(u) returns the last node in the cycle, or
+ ++ empty if none exists.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat!(m,tail(m))
+ ++E cycleTail m
+
if % has shallowlyMutable then
concat_!: (%,%) -> %
++ concat!(u,v) destructively concatenates v to the end of u.
++ Note: \axiom{concat!(u,v) = setlast_!(u,v)}.
+ ++
+ ++E m:=[1,2,3]
+ ++E n:=[4,5,6]
+ ++E concat!(m,n)
+
concat_!: (%,S) -> %
++ concat!(u,x) destructively adds element x to the end of u.
++ Note: \axiom{concat!(a,x) = setlast!(a,[x])}.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat!(m,5)
+
cycleSplit_!: % -> %
++ 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{w = concat(u,v)} is the cyclic list where v is
+ ++ If \axiom{w = concat(u,v)} is the cyclic list where v is
++ the head of the cycle, \axiom{cycleSplit!(w)} will drop v off w thus
++ destructively changing w to u, and returning v.
+ ++
+ ++E m:=[1,2,3]
+ ++E concat!(m,m)
+ ++E n:=[4,5,6]
+ ++E p:=concat(n,m)
+ ++E q:=cycleSplit! p
+ ++E p
+ ++E q
+
setfirst_!: (%,S) -> S
++ setfirst!(u,x) destructively changes the first element of a to x.
+ ++
+ ++E m:=[1,2,3]
+ ++E setfirst!(m,4)
+ ++E m
+
setelt: (%,"first",S) -> S
++ setelt(u,"first",x) (also written: \axiom{u.first := x}) is
++ equivalent to \axiom{setfirst!(u,x)}.
+
setrest_!: (%,%) -> %
++ setrest!(u,v) destructively changes the rest of u to v.
+ ++
+ ++E m:=[1,2,3]
+ ++E setrest!(m,[4,5,6])
+ ++E m
+
setelt: (%,"rest",%) -> %
- ++ setelt(u,"rest",v) (also written: \axiom{u.rest := v}) is equivalent to
- ++ \axiom{setrest!(u,v)}.
+ ++ setelt(u,"rest",v) (also written: \axiom{u.rest := v})
+ ++ is equivalent to \axiom{setrest!(u,v)}.
+
setlast_!: (%,S) -> S
++ setlast!(u,x) destructively changes the last element of u to x.
+ ++
+ ++E m:=[1,2,3]
+ ++E setlast!(m,4)
+ ++E m
+
setelt: (%,"last",S) -> S
++ setelt(u,"last",x) (also written: \axiom{u.last := b})
++ is equivalent to \axiom{setlast!(u,v)}.
+
split_!: (%,Integer) -> %
- ++ split!(u,n) splits u into two aggregates: \axiom{v = rest(u,n)}
- ++ and \axiom{w = first(u,n)}, returning \axiom{v}.
- ++ Note: afterwards \axiom{rest(u,n)} returns \axiom{empty()}.
+ ++ split!(u,n) splits u into two aggregates: \axiom{v = rest(u,n)}
+ ++ and \axiom{w = first(u,n)}, returning \axiom{v}.
+ ++ Note: afterwards \axiom{rest(u,n)} returns \axiom{empty()}.
+ ++
+ ++E m:=[1,2,3,4]
+ ++E n:=split!(m,2)
+ ++E m
+ ++E n
+
add
cycleMax ==> 1000
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-23 16:46:09
|
changelog | 8 +
src/algebra/Makefile.pamphlet | 5 +-
src/algebra/aggcat.spad.pamphlet | 191 +++++++--
src/algebra/exposed.lsp.pamphlet | 1 +
src/algebra/mappkg.spad.pamphlet | 471 ++++++++++++++++++----
src/input/Makefile.pamphlet | 7 +-
src/input/linalg.input.pamphlet | 827 +++++++++++++++++++++++++++++++++++++-
src/input/test.input.pamphlet | 4 +-
8 files changed, 1392 insertions(+), 122 deletions(-)
New commits:
commit 1696ac7f1347f306ecb23da4d2478f9603813450
Merge: 44605d8df6b9ef01eb6be1e3ea62ef957c12253e adeb80a1df45836f57c45988420abce4b3b10a31
Author: Tim Daly <da...@ax...>
Date: Fri Jul 11 22:16:04 2008 -0400
20080823 tpd src/algebra/aggcat.spad UnaryRecursiveAggregate API examples
commit 44605d8df6b9ef01eb6be1e3ea62ef957c12253e
Author: Tim Daly <da...@ax...>
Date: Fri Jul 11 02:42:28 2008 -0400
20080822 tpd src/input/Makefile add linalg, overload regression tests
20080822 tpd src/input/linalg.input recovered
20080822 tpd src/input/overload.input recovered
commit 8397f9e27b5c12dc5479191adf5e8ee737eb90c1
Author: Tim Daly <da...@ax...>
Date: Fri Jul 11 00:31:35 2008 -0400
20080821 tpd src/algebra/Makefile add MappingPackage4
20080821 tpd src/algebra/exposed.lsp add MappingPackage4
20080821 tpd src/algebra/mappkg.spad add MAPPKG4
20080821 tpd src/input/test.input repair regressions
|
|
From: <da...@us...> - 2008-08-22 06:46:19
|
Revision: 953
http://axiom.svn.sourceforge.net/axiom/?rev=953&view=rev
Author: daly
Date: 2008-08-22 06:46:27 +0000 (Fri, 22 Aug 2008)
Log Message:
-----------
20080822 tpd src/input/Makefile add linalg, overload regression tests
20080822 tpd src/input/linalg.input recovered
20080822 tpd src/input/overload.input recovered
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/input/Makefile.pamphlet
trunk/axiom/src/input/linalg.input.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-22 04:08:39 UTC (rev 952)
+++ trunk/axiom/changelog 2008-08-22 06:46:27 UTC (rev 953)
@@ -1,3 +1,6 @@
+20080822 tpd src/input/Makefile add linalg, overload regression tests
+20080822 tpd src/input/linalg.input recovered
+20080822 tpd src/input/overload.input recovered
20080821 tpd src/algebra/Makefile add MappingPackage4
20080821 tpd src/algebra/exposed.lsp add MappingPackage4
20080821 tpd src/algebra/mappkg.spad add MAPPKG4
Modified: trunk/axiom/src/input/Makefile.pamphlet
===================================================================
--- trunk/axiom/src/input/Makefile.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
+++ trunk/axiom/src/input/Makefile.pamphlet 2008-08-22 06:46:27 UTC (rev 953)
@@ -244,9 +244,6 @@
# Error: Value stack overflow.
VALUESTACK=tutchap67.output
-# Broken at |MATCAT-;*;3S;29|. Type :H for Help.
-MATCAT=linalg.output
-
# Broken at |STAGG-;ELT;AIS;5|. Type :H for Help.
STAGG=reductio.output
@@ -326,7 +323,8 @@
kamke0.regress kamke1.regress kamke2.regress kamke3.regress \
kamke4.regress kamke5.regress kamke6.regress kamke7.regress \
kernel.regress knot2.regress kovacic.regress kuipers.regress \
- laplace.regress leg.regress limit.regress lindep.regress \
+ laplace.regress leg.regress limit.regress linalg.regress \
+ lindep.regress \
list.regress lode.regress lodesys.regress lodo1.regress \
lodo2.regress lodo3.regress lodof.regress lodo.regress \
log.regress \
@@ -595,6 +593,7 @@
${OUT}/kovacic.input ${OUT}/kuipers.input \
${OUT}/laplace.input ${OUT}/leg.input ${OUT}/lexp.input \
${OUT}/lextripk.input ${OUT}/lib.input ${OUT}/limit.input \
+ ${OUT}/linalg.input \
${OUT}/lindep.input ${OUT}/liss1.input ${OUT}/liss2.input \
${OUT}/list.input ${OUT}/lode.input ${OUT}/lodesys.input \
${OUT}/lodo1.input ${OUT}/lodo2.input ${OUT}/lodof.input \
Modified: trunk/axiom/src/input/linalg.input.pamphlet
===================================================================
--- trunk/axiom/src/input/linalg.input.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
+++ trunk/axiom/src/input/linalg.input.pamphlet 2008-08-22 06:46:27 UTC (rev 953)
@@ -10,104 +10,929 @@
\tableofcontents
\eject
<<*>>=
+)spool linalg.output
+)set message test on
+)set message auto off
+)set break resume
+)clear all
-- Input for page MatrixMoreFunctionsPage
)clear all
+--S 1 of 82
m1 := matrix([[1,-2,1],[4,2,-4]])
+--R
+--R +1 - 2 1 +
+--R (1) | |
+--R +4 2 - 4+
+--R Type: Matrix Integer
+--E 1
+
+--S 2 of 82
m2 := matrix([[0,1,2],[2,3,4],[3,4,5]])
+--R
+--R +0 1 2+
+--R | |
+--R (2) |2 3 4|
+--R | |
+--R +3 4 5+
+--R Type: Matrix Integer
+--E 2
+
+--S 3 of 82
m3 := matrix([[1,2,3],[2,4,6]])
+--R
+--R +1 2 3+
+--R (3) | |
+--R +2 4 6+
+--R Type: Matrix Integer
+--E 3
+
+--S 4 of 82
m1 + m3
+--R
+--R +2 0 4+
+--R (4) | |
+--R +6 6 2+
+--R Type: Matrix Integer
+--E 4
+
+--S 5 of 82
100 * m1
+--R
+--R +100 - 200 100 +
+--R (5) | |
+--R +400 200 - 400+
+--R Type: Matrix Integer
+--E 5
+
+--S 6 of 82
m1 * m2
+--R
+--R +- 1 - 1 - 1+
+--R (6) | |
+--R +- 8 - 6 - 4+
+--R Type: Matrix Integer
+--E 6
+
+--S 7 of 82
-m1 + m3 * m2
+--R
+--R +12 21 24+
+--R (7) | |
+--R +22 36 54+
+--R Type: Matrix Integer
+--E 7
+
+--S 8 of 82
m2 * m1
+--R
+--R
+--RDaly Bug
+--R >> Error detected within library code:
+--R can't multiply matrices of incompatible dimensions
+--R
+--R Continuing to read the file...
+--R
+--E 8
+
+--S 9 of 82
v := vector([1,0,1])
+--R
+--R (8) [1,0,1]
+--R Type: Vector NonNegativeInteger
+--E 9
+
+--S 10 of 82
m3 * v
+--R
+--R (9) [4,8]
+--R Type: Vector Integer
+--E 10
+
+--S 11 of 82
m5 : MATRIX POLY INT := new(4,4,1)
+--R
+--R +1 1 1 1+
+--R | |
+--R |1 1 1 1|
+--R (10) | |
+--R |1 1 1 1|
+--R | |
+--R +1 1 1 1+
+--R Type: Matrix Polynomial Integer
+--E 11
+
+--S 12 of 82
vars : LIST POLY INT := [x,y,z,u]
+--R
+--R (11) [x,y,z,u]
+--R Type: List Polynomial Integer
+--E 12
+
+--S 13 of 82
for i in 1..4 repeat for j in 1..3 repeat m5(i,j + 1) := (vars.i)**j
+--R Type: Void
+--E 13
+
+--S 14 of 82
m5
+--R
+--R + 2 3+
+--R |1 x x x |
+--R | |
+--R | 2 3|
+--R |1 y y y |
+--R (13) | |
+--R | 2 3|
+--R |1 z z z |
+--R | |
+--R | 2 3|
+--R +1 u u u +
+--R Type: Matrix Polynomial Integer
+--E 14
+
+--S 15 of 82
trace(m5)
+--R
+--R 2 3
+--R (14) z + y + u + 1
+--R Type: Polynomial Integer
+--E 15
+
+--S 16 of 82
det := determinant(m5)
+--R
+--R (15)
+--R 2 2 2 2 2 3
+--R ((- x + u)y + (x - u )y - u x + u x)z
+--R +
+--R 3 3 3 3 3 2
+--R ((x - u)y + (- x + u )y + u x - u x)z
+--R +
+--R 2 2 3 3 3 2 2 3 3 2 2 2 3
+--R ((- x + u )y + (x - u )y - u x + u x )z + (u x - u x)y
+--R +
+--R 3 3 2 2 3 3 2
+--R (- u x + u x)y + (u x - u x )y
+--R Type: Polynomial Integer
+--E 16
+
+--S 17 of 82
factor(det)
+--R
+--R (16) - (x - u)(y - x)(y - u)(z - y)(z - x)(z - u)
+--R Type: Factored Polynomial Integer
+--E 17
+
+--S 18 of 82
m6 := matrix([[1,2,1],[-2,3,4],[-1,5,6]])
+--R
+--R + 1 2 1+
+--R | |
+--R (17) |- 2 3 4|
+--R | |
+--R +- 1 5 6+
+--R Type: Matrix Integer
+--E 18
+
+--S 19 of 82
m6inv := inverse(m6)
+--R
+--R + 2 5 +
+--R |- - - 1 - |
+--R | 7 7 |
+--R | |
+--R (18) | 8 6|
+--R | - 1 - -|
+--R | 7 7|
+--R | |
+--R +- 1 - 1 1 +
+--R Type: Union(Matrix Fraction Integer,...)
+--E 19
+
+--S 20 of 82
m6 * m6inv
+--R
+--R +1 0 0+
+--R | |
+--R (19) |0 1 0|
+--R | |
+--R +0 0 1+
+--R Type: Matrix Fraction Integer
+--E 20
+
+--S 21 of 82
m7 := matrix([[1,2,1],[-2,3,4],[-1,5,5]])
+--R
+--R + 1 2 1+
+--R | |
+--R (20) |- 2 3 4|
+--R | |
+--R +- 1 5 5+
+--R Type: Matrix Integer
+--E 21
+
+--S 22 of 82
inverse(m7)
+--R
+--R (21) "failed"
+--R Type: Union("failed",...)
+--E 22
+
+--S 23 of 82
determinant(m7)
+--R
+--R (22) 0
+--R Type: NonNegativeInteger
+--E 23
+
+--S 24 of 82
m8 : SQMATRIX(2,INT) := matrix([[1,2],[2,3]])
+--R
+--R +1 2+
+--R (23) | |
+--R +2 3+
+--R Type: SquareMatrix(2,Integer)
+--E 24
+
+--S 25 of 82
m9 : SQMATRIX(2,INT) := matrix([[1,1],[0,1]])
+--R
+--R +1 1+
+--R (24) | |
+--R +0 1+
+--R Type: SquareMatrix(2,Integer)
+--E 25
+
+--S 26 of 82
m8 ** 2
+--R
+--R +5 8 +
+--R (25) | |
+--R +8 13+
+--R Type: SquareMatrix(2,Integer)
+--E 26
+
+--S 27 of 82
m9 ** 3
+--R
+--R +1 3+
+--R (26) | |
+--R +0 1+
+--R Type: SquareMatrix(2,Integer)
+--E 27
+
+--S 28 of 82
mm : SQMATRIX(2,SQMATRIX(2,INT)) := matrix([[1,m8],[m9,0]])
+--R
+--R ++1 0+ +1 2++
+--R || | | ||
+--R |+0 1+ +2 3+|
+--R (27) | |
+--R |+1 1+ +0 0+|
+--R || | | ||
+--R ++0 1+ +0 0++
+--R Type: SquareMatrix(2,SquareMatrix(2,Integer))
+--E 28
+
+--S 29 of 82
100 * mm
+--R
+--R ++100 0 + +100 200++
+--R || | | ||
+--R |+ 0 100+ +200 300+|
+--R (28) | |
+--R |+100 100+ +0 0+ |
+--R || | | | |
+--R ++ 0 100+ +0 0+ +
+--R Type: SquareMatrix(2,SquareMatrix(2,Integer))
+--E 29
+
+--S 30 of 82
m8 * mm
+--R
+--R ++1 2+ +5 8 ++
+--R || | | ||
+--R |+2 3+ +8 13+|
+--R (29) | |
+--R |+1 3+ +0 0+ |
+--R || | | | |
+--R ++2 5+ +0 0+ +
+--R Type: SquareMatrix(2,SquareMatrix(2,Integer))
+--E 30
+
+--S 31 of 82
mm * mm
+--R
+--R ++2 3+ +1 2++
+--R || | | ||
+--R |+2 6+ +2 3+|
+--R (30) | |
+--R |+1 1+ +3 5+|
+--R || | | ||
+--R ++0 1+ +2 3++
+--R Type: SquareMatrix(2,SquareMatrix(2,Integer))
+--E 31
+
+--S 32 of 82
p : POLY SQMATRIX(2,INT) := m8 * x**2 + m9 * x + m8 * m9
+--R
+--R +1 2+ 2 +1 1+ +1 3+
+--R (31) | |x + | |x + | |
+--R +2 3+ +0 1+ +2 5+
+--R Type: Polynomial SquareMatrix(2,Integer)
+--E 32
+
+--S 33 of 82
100 * p
+--R
+--R +100 200+ 2 +100 100+ +100 300+
+--R (32) | |x + | |x + | |
+--R +200 300+ + 0 100+ +200 500+
+--R Type: Polynomial SquareMatrix(2,Integer)
+--E 33
+
+--S 34 of 82
m8 * p
+--R
+--R +5 8 + 2 +1 3+ +5 13+
+--R (33) | |x + | |x + | |
+--R +8 13+ +2 5+ +8 21+
+--R Type: Polynomial SquareMatrix(2,Integer)
+--E 34
+
+--S 35 of 82
p * p
+--R
+--R +5 8 + 4 +4 8+ 3 +13 26+ 2 +4 12+ +7 18+
+--R (34) | |x + | |x + | |x + | |x + | |
+--R +8 13+ +4 8+ +20 41+ +4 12+ +12 31+
+--R Type: Polynomial SquareMatrix(2,Integer)
+--E 35
-- Input for page MatrixCanonicalFormsPage
)clear all
+--S 36 of 82
m1 := matrix([[0,4,1],[5,3,-7],[-5,5,9]])
+--R
+--R + 0 4 1 +
+--R | |
+--R (1) | 5 3 - 7|
+--R | |
+--R +- 5 5 9 +
+--R Type: Matrix Integer
+--E 36
+
+--S 37 of 82
rank(m1)
+--R
+--R (2) 2
+--R Type: PositiveInteger
+--E 37
+
+--S 38 of 82
rowEchelon(m1)
+--R
+--R +5 3 - 7+
+--R | |
+--R (3) |0 4 1 |
+--R | |
+--R +0 0 0 +
+--R Type: Matrix Integer
+--E 38
+
+--S 39 of 82
nullSpace(m1)
+--R
+--R (4) [[31,- 5,20]]
+--R Type: List Vector Integer
+--E 39
+
+--S 40 of 82
t := eigenMatrix(m1)
+--R
+--R + +----+ +----+ +
+--R |\|- 11 + 2 - \|- 11 + 2 31 |
+--R |----------- ------------- -- |
+--R | 5 5 20 |
+--R | |
+--R (5) | +----+ +----+ |
+--R |2\|- 11 - 1 - 2\|- 11 - 1 1|
+--R |------------ -------------- - -|
+--R | 5 5 4|
+--R | |
+--R + 1 1 1 +
+--R Type: Union(Matrix Expression Integer,...)
+--E 40
+
+--S 41 of 82
inverse(t) * m1 * t
+--R
+--R + +----+ +
+--R |5581634906\|- 11 - 55255461173 |
+--R |------------------------------- 0 0|
+--R | +----+ |
+--R | 1888197247\|- 11 - 5747548576 |
+--R | |
+--R (6) | +----+ |
+--R | 6\|- 11 + 11 |
+--R | 0 ------------- 0|
+--R | +----+ |
+--R | \|- 11 |
+--R | |
+--R + 0 0 0+
+--R Type: Matrix Expression Integer
+--E 41
-- Input for page MatrixBasicFunctionsPage
)clear all
+--S 42 of 82
m1 := matrix([[1,2,3,4],[2,3,4,5],[3,4,5,6],[4,5,6,7]])
+--R
+--R +1 2 3 4+
+--R | |
+--R |2 3 4 5|
+--R (1) | |
+--R |3 4 5 6|
+--R | |
+--R +4 5 6 7+
+--R Type: Matrix Integer
+--E 42
+
+--S 43 of 82
m2 := matrix([[1,0,2],[20,30,10],[0,200,100]])
+--R
+--R +1 0 2 +
+--R | |
+--R (2) |20 30 10 |
+--R | |
+--R +0 200 100+
+--R Type: Matrix Integer
+--E 43
+
+--S 44 of 82
(m3,m4) : MATRIX PF 7
+--R Type: Void
+--E 44
+
+--S 45 of 82
m3 := matrix([[1,0,1],[5,0,1]])
+--R
+--R +1 0 1+
+--R (4) | |
+--R +5 0 1+
+--R Type: Matrix PrimeField 7
+--E 45
+
+--S 46 of 82
m4 := matrix([[1],[2],[5],[6]])
+--R
+--R +1+
+--R | |
+--R |2|
+--R (5) | |
+--R |5|
+--R | |
+--R +6+
+--R Type: Matrix PrimeField 7
+--E 46
+
+--S 47 of 82
m2(1,1)
+--R
+--R (6) 1
+--R Type: PositiveInteger
+--E 47
+
+--S 48 of 82
m2(1,1) := 99
+--R
+--R (7) 99
+--R Type: PositiveInteger
+--E 48
+
+--S 49 of 82
m2
+--R
+--R +99 0 2 +
+--R | |
+--R (8) |20 30 10 |
+--R | |
+--R +0 200 100+
+--R Type: Matrix Integer
+--E 49
+
+--S 50 of 82
row(m2,2)
+--R
+--R (9) [20,30,10]
+--R Type: Vector Integer
+--E 50
+
+--S 51 of 82
setRow!(m2,2,vector [66,77,88])
+--R
+--R +99 0 2 +
+--R | |
+--R (10) |66 77 88 |
+--R | |
+--R +0 200 100+
+--R Type: Matrix Integer
+--E 51
+
+--S 52 of 82
r := column(m2,1)
+--R
+--R (11) [99,66,0]
+--R Type: Vector Integer
+--E 52
+
+--S 53 of 82
setColumn!(m2,2,r)
+--R
+--R +99 99 2 +
+--R | |
+--R (12) |66 66 88 |
+--R | |
+--R +0 0 100+
+--R Type: Matrix Integer
+--E 53
+
+--S 54 of 82
nrows(m1)
+--R
+--R (13) 4
+--R Type: PositiveInteger
+--E 54
+
+--S 55 of 82
m5 : MATRIX INT := new(12,12,0)
+--R
+--R +0 0 0 0 0 0 0 0 0 0 0 0+
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R (14) | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 0|
+--R | |
+--R +0 0 0 0 0 0 0 0 0 0 0 0+
+--R Type: Matrix Integer
+--E 55
+
+--S 56 of 82
for i in 2..nrows(m5) repeat m5(i-1,i):= 1
+--R Type: Void
+--E 56
+
+--S 57 of 82
m5
+--R
+--R +0 1 0 0 0 0 0 0 0 0 0 0+
+--R | |
+--R |0 0 1 0 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 1 0 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 1 0 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 1 0 0 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 1 0 0 0 0 0|
+--R (16) | |
+--R |0 0 0 0 0 0 0 1 0 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 1 0 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 1 0 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 1 0|
+--R | |
+--R |0 0 0 0 0 0 0 0 0 0 0 1|
+--R | |
+--R +0 0 0 0 0 0 0 0 0 0 0 0+
+--R Type: Matrix Integer
+--E 57
+
+--S 58 of 82
d : MATRIX INT := diagonalMatrix([1,2,3,2,1])
+--R
+--R +1 0 0 0 0+
+--R | |
+--R |0 2 0 0 0|
+--R | |
+--R (17) |0 0 3 0 0|
+--R | |
+--R |0 0 0 2 0|
+--R | |
+--R +0 0 0 0 1+
+--R Type: Matrix Integer
+--E 58
+
+--S 59 of 82
m6 := matrix([[0,1,2,3,4],[5,6,7,8,9],[10,11,12,13,14]])
+--R
+--R +0 1 2 3 4 +
+--R | |
+--R (18) |5 6 7 8 9 |
+--R | |
+--R +10 11 12 13 14+
+--R Type: Matrix Integer
+--E 59
+
+--S 60 of 82
m7 := subMatrix(m6,1,3,2,4)
+--R
+--R +1 2 3 +
+--R | |
+--R (19) |6 7 8 |
+--R | |
+--R +11 12 13+
+--R Type: Matrix Integer
+--E 60
+
+--S 61 of 82
horizConcat(m6,m7)
+--R
+--R +0 1 2 3 4 1 2 3 +
+--R | |
+--R (20) |5 6 7 8 9 6 7 8 |
+--R | |
+--R +10 11 12 13 14 11 12 13+
+--R Type: Matrix Integer
+--E 61
+
+--S 62 of 82
vertConcat(m6,subMatrix(m6,1,1,1,5))
+--R
+--R +0 1 2 3 4 +
+--R | |
+--R |5 6 7 8 9 |
+--R (21) | |
+--R |10 11 12 13 14|
+--R | |
+--R +0 1 2 3 4 +
+--R Type: Matrix Integer
+--E 62
+
+--S 63 of 82
transpose(m6)
-setsubMatrix(m6,1,3,1,3,transpose(subMatrix(m6,1,3,1,3)))
+--R
+--R +0 5 10+
+--R | |
+--R |1 6 11|
+--R | |
+--R (22) |2 7 12|
+--R | |
+--R |3 8 13|
+--R | |
+--R +4 9 14+
+--R Type: Matrix Integer
+--E 63
+
+--S 64 of 82
+setsubMatrix!(m6,1,3,transpose(subMatrix(m6,1,3,1,3)))
+--R
+--R +0 1 0 5 10+
+--R | |
+--R (23) |5 6 1 6 11|
+--R | |
+--R +10 11 2 7 12+
+--R Type: Matrix Integer
+--E 64
+
+--S 65 of 82
m6
+--R
+--R +0 1 0 5 10+
+--R | |
+--R (24) |5 6 1 6 11|
+--R | |
+--R +10 11 2 7 12+
+--R Type: Matrix Integer
+--E 65
+
+--S 66 of 82
m8 := matrix([[1,2],[3,4]])
+--R
+--R +1 2+
+--R (25) | |
+--R +3 4+
+--R Type: Matrix Integer
+--E 66
+
+--S 67 of 82
m9 := m8
+--R
+--R +1 2+
+--R (26) | |
+--R +3 4+
+--R Type: Matrix Integer
+--E 67
+
+--S 68 of 82
m10 := copy(m8)
+--R
+--R +1 2+
+--R (27) | |
+--R +3 4+
+--R Type: Matrix Integer
+--E 68
+
+--S 69 of 82
m8(1,1) := 1000000
+--R
+--R (28) 1000000
+--R Type: PositiveInteger
+--E 69
+
+--S 70 of 82
m8
+--R
+--R +1000000 2+
+--R (29) | |
+--R + 3 4+
+--R Type: Matrix Integer
+--E 70
+
+--S 71 of 82
m9
+--R
+--R +1000000 2+
+--R (30) | |
+--R + 3 4+
+--R Type: Matrix Integer
+--E 71
+
+--S 72 of 82
m10
+--R
+--R +1 2+
+--R (31) | |
+--R +3 4+
+--R Type: Matrix Integer
+--E 72
-- Input for page EigenPage
)clear all
+--S 73 of 82
m1 : MATRIX FRAC INT := [[1,2,1],[2,1,-2],[1,-2,4]]
+--R
+--R +1 2 1 +
+--R | |
+--R (1) |2 1 - 2|
+--R | |
+--R +1 - 2 4 +
+--R Type: Matrix Fraction Integer
+--E 73
+
+--S 74 of 82
leig := eigenvalues(m1)
+--R
+--R 2
+--I (2) [5,%A | %A - %A - 5]
+--RType: List Union(Fraction Polynomial Integer,SuchThat(Symbol,Polynomial Integer))
+--E 74
+
+--S 75 of 82
eigenvector(first(leig),m1)
+--R
+--R + 0 +
+--R | |
+--R | 1|
+--R (3) [|- -|]
+--R | 2|
+--R | |
+--R + 1 +
+--R Type: List Matrix Fraction Polynomial Fraction Integer
+--E 75
+
+--S 76 of 82
eigenvectors(m1)
+--R
+--R (4)
+--R + 0 +
+--R | |
+--R | 1|
+--R [[eigval= 5,eigmult= 1,eigvec= [|- -|]],
+--R | 2|
+--R | |
+--R + 1 +
+--R +%C+
+--R 2 | |
+--R [eigval= (%C | %C - %C - 5),eigmult= 1,eigvec= [|2 |]]]
+--R | |
+--R +1 +
+--RType: List Record(eigval: Union(Fraction Polynomial Integer,SuchThat(Symbol,Polynomial Integer)),eigmult: NonNegativeInteger,eigvec: List Matrix Fraction Polynomial Integer)
+--E 76
+
+--S 77 of 82
radicalEigenvectors(m1)
+--R
+--R (5)
+--R + +--+ +
+--R +--+ |\|21 + 1|
+--R \|21 + 1 |---------|
+--R [[radval= ---------,radmult= 1,radvect= [| 2 |]],
+--R 2 | |
+--R | 2 |
+--R | |
+--R + 1 +
+--R + +--+ +
+--R +--+ |- \|21 + 1|
+--R - \|21 + 1 |-----------|
+--R [radval= -----------,radmult= 1,radvect= [| 2 |]],
+--R 2 | |
+--R | 2 |
+--R | |
+--R + 1 +
+--R + 0 +
+--R | |
+--R | 1|
+--R [radval= 5,radmult= 1,radvect= [|- -|]]]
+--R | 2|
+--R | |
+--R + 1 +
+--RType: List Record(radval: Expression Integer,radmult: Integer,radvect: List Matrix Expression Integer)
+--E 77
+
+--S 78 of 82
eigenMatrix(m1)
+--R
+--R + +--+ +--+ +
+--R |\|21 + 1 - \|21 + 1 |
+--R |--------- ----------- 0 |
+--R | 2 2 |
+--R (6) | |
+--R | 1|
+--R | 2 2 - -|
+--R | 2|
+--R | |
+--R + 1 1 1 +
+--R Type: Union(Matrix Expression Integer,...)
+--E 78
+
+--S 79 of 82
m2 : MATRIX FRAC INT := [[-5,-2],[18,7]]
+--R
+--R +- 5 - 2+
+--R (7) | |
+--R +18 7 +
+--R Type: Matrix Fraction Integer
+--E 79
+
+--S 80 of 82
eigenMatrix(m2)
+--R
+--R (8) "failed"
+--R Type: Union("failed",...)
+--E 80
+
+--S 81 of 82
m3 : MATRIX FRAC INT := [[1,2],[2,1]]
+--R
+--R +1 2+
+--R (9) | |
+--R +2 1+
+--R Type: Matrix Fraction Integer
+--E 81
+
+--S 82 of 82
orthonormalBasis(m3)
+--R
+--R + 1 + + 1 +
+--R |- ----| |----|
+--R | +-+| | +-+|
+--R | \|2 | |\|2 |
+--R (10) [| |,| |]
+--R | 1 | | 1 |
+--R | ---- | |----|
+--R | +-+ | | +-+|
+--R + \|2 + +\|2 +
+--R Type: List Matrix Expression Integer
+--E 82
+
+)spool
+)lisp (bye)
+
@
\eject
\begin{thebibliography}{99}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <da...@us...> - 2008-08-22 04:08:30
|
Revision: 952
http://axiom.svn.sourceforge.net/axiom/?rev=952&view=rev
Author: daly
Date: 2008-08-22 04:08:39 +0000 (Fri, 22 Aug 2008)
Log Message:
-----------
20080821 tpd src/algebra/Makefile add MappingPackage4
20080821 tpd src/algebra/exposed.lsp add MappingPackage4
20080821 tpd src/algebra/mappkg.spad add MAPPKG4
20080821 tpd src/input/test.input repair regressions
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/algebra/Makefile.pamphlet
trunk/axiom/src/algebra/exposed.lsp.pamphlet
trunk/axiom/src/algebra/mappkg.spad.pamphlet
trunk/axiom/src/input/test.input.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-20 21:18:59 UTC (rev 951)
+++ trunk/axiom/changelog 2008-08-22 04:08:39 UTC (rev 952)
@@ -1,3 +1,7 @@
+20080821 tpd src/algebra/Makefile add MappingPackage4
+20080821 tpd src/algebra/exposed.lsp add MappingPackage4
+20080821 tpd src/algebra/mappkg.spad add MAPPKG4
+20080821 tpd src/input/test.input repair regressions
20080820 tpd src/input/test.input fix typos
20080819 tpd src/input/Makefile overload.input added
20080819 dxc src/input/overload.input added
Modified: trunk/axiom/src/algebra/Makefile.pamphlet
===================================================================
--- trunk/axiom/src/algebra/Makefile.pamphlet 2008-08-20 21:18:59 UTC (rev 951)
+++ trunk/axiom/src/algebra/Makefile.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
@@ -244,7 +244,6 @@
annacat.spad.pamphlet (NIPROB ODEPROB PDEPROB OPTPROB NUMINT ODECAT PDECAT
OPTCAT)
color.spad.pamphlet (COLOR PALETTE)
-mappkg.spad.pamphlet (MAPHACK1 MAPHACK2 MAPHACK3 MAPPKG1 MAPPKG2 MAPPKG3)
paramete.spad.pamphlet (PARPCURV PARPC2 PARSCURV PARSC2 PARSURF PARSU2
suchthat.spad.pamphlet (SUCH)
ystream.spad.pamphlet (YSTREAM)
@@ -388,6 +387,8 @@
free.spad.pamphlet (LMOPS FMONOID FGROUP FAMONC IFAMON FAMONOID FAGROUP)
fourier.spad.pamphlet (FCOMP FSERIES)
functions.spad.pamphlet (BFUNCT)
+mappkg.spad.pamphlet (MAPHACK1 MAPHACK2 MAPHACK3 MAPHACK4
+ MAPPKG1 MAPPKG2 MAPPKG3 MAPPKG4)
mesh.spad.pamphlet (MESH)
moebius.spad.pamphlet (MOEBIUS)
mring.spad.pamphlet (MRING MRF2)
@@ -414,6 +415,7 @@
${OUT}/IPADIC.o ${OUT}/IROOT.o ${OUT}/IR2.o ${OUT}/LEXP.o \
${OUT}/LIECAT.o ${OUT}/LIECAT-.o ${OUT}/LIST2.o ${OUT}/LIST2MAP.o \
${OUT}/LMOPS.o ${OUT}/LZSTAGG.o ${OUT}/LZSTAGG-.o ${OUT}/MAGMA.o \
+ ${OUT}/MAPPKG4.o \
${OUT}/MESH.o ${OUT}/MOEBIUS.o ${OUT}/MODFIELD.o ${OUT}/MODOP.o \
${OUT}/MRING.o ${OUT}/MTHING.o ${OUT}/NCNTFRAC.o ${OUT}/NCODIV.o \
${OUT}/NUMTUBE.o ${OUT}/ODR.o ${OUT}/OFMONOID.o ${OUT}/ONECOMP.o \
@@ -3130,7 +3132,6 @@
document: ${DOCFILES}
<<genericRules>>
-
<<spadhelp>>
<<ps (DOC from SRC)>>
<<libdb.text (OUT from IN)>>
Modified: trunk/axiom/src/algebra/exposed.lsp.pamphlet
===================================================================
--- trunk/axiom/src/algebra/exposed.lsp.pamphlet 2008-08-20 21:18:59 UTC (rev 951)
+++ trunk/axiom/src/algebra/exposed.lsp.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
@@ -208,6 +208,7 @@
(|MappingPackage1| . MAPPKG1)
(|MappingPackage2| . MAPPKG2)
(|MappingPackage3| . MAPPKG3)
+ (|MappingPackage4| . MAPPKG4)
(|MathMLFormat| . MMLFORM)
(|Matrix| . MATRIX)
(|MatrixCategoryFunctions2| . MATCAT2)
Modified: trunk/axiom/src/algebra/mappkg.spad.pamphlet
===================================================================
--- trunk/axiom/src/algebra/mappkg.spad.pamphlet 2008-08-20 21:18:59 UTC (rev 951)
+++ trunk/axiom/src/algebra/mappkg.spad.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
@@ -2,7 +2,7 @@
\usepackage{axiom}
\begin{document}
\title{\$SPAD/src/algebra mappkg.spad}
-\author{Stephen M. Watt, William Burge}
+\author{Stephen M. Watt, William Burge, Timothy Daly}
\maketitle
\begin{abstract}
\end{abstract}
@@ -83,7 +83,8 @@
)set message test on
)set message auto off
)clear all
---S 1
+
+--S 1 of 26
power(q: FRAC INT, n: INT): FRAC INT == q**n
--R
--R Function declaration power : (Fraction Integer,Integer) -> Fraction
@@ -91,7 +92,7 @@
--R Type: Void
--E 1
---S 2
+--S 2 of 26
power(2,3)
--R
--R Compiling function power with type (Fraction Integer,Integer) ->
@@ -101,15 +102,15 @@
--R Type: Fraction Integer
--E 2
---S 3
+--S 3 of 26
rewop := twist power
--R
--R
---R (3) theMap(MAPPKG3;twist;MM;5!0)
+--I (3) theMap(MAPPKG3;twist;MM;5!0)
--R Type: ((Integer,Fraction Integer) -> Fraction Integer)
--E 3
---S 4
+--S 4 of 26
rewop(3, 2)
--R
--R
@@ -117,21 +118,21 @@
--R Type: Fraction Integer
--E 4
---S 5
+--S 5 of 26
square: FRAC INT -> FRAC INT
--R
--R Type: Void
--E 5
---S 6
+--S 6 of 26
square:= curryRight(power, 2)
--R
--R
---R (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 6
---S 7
+--S 7 of 26
square 4
--R
--R
@@ -139,15 +140,15 @@
--R Type: Fraction Integer
--E 7
---S 8
+--S 8 of 26
squirrel:= constantRight(square)$MAPPKG3(FRAC INT,FRAC INT,FRAC INT)
--R
--R
---R (8) theMap(MAPPKG3;constantRight;MM;3!0)
+--I (8) theMap(MAPPKG3;constantRight;MM;3!0)
--R Type: ((Fraction Integer,Fraction Integer) -> Fraction Integer)
--E 8
---S 9
+--S 9 of 26
squirrel(1/2, 1/3)
--R
--R
@@ -157,15 +158,15 @@
--R Type: Fraction Integer
--E 9
---S 10
+--S 10 of 26
sixteen := curry(square, 4/1)
--R
--R
---R (10) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (10) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Fraction Integer)
--E 10
---S 11
+--S 11 of 26
sixteen()
--R
--R
@@ -173,15 +174,15 @@
--R Type: Fraction Integer
--E 11
---S 12
+--S 12 of 26
square2:=square*square
--R
--R
---R (12) theMap(MAPPKG3;*;MMM;6!0,0)
+--I (12) theMap(MAPPKG3;*;MMM;6!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 12
---S 13
+--S 13 of 26
square2 3
--R
--R
@@ -189,7 +190,7 @@
--R Type: Fraction Integer
--E 13
---S 14
+--S 14 of 26
sc(x: FRAC INT): FRAC INT == x + 1
--R
--R Function declaration sc : Fraction Integer -> Fraction Integer has
@@ -197,23 +198,23 @@
--R Type: Void
--E 14
---S 15
+--S 15 of 26
incfns := [sc**i for i in 0..10]
--R
--R Compiling function sc with type Fraction Integer -> Fraction Integer
--R
--R
--R (15)
---R [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0)]
+--I [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0)]
--R Type: List (Fraction Integer -> Fraction Integer)
--E 15
---S 16
+--S 16 of 26
[f 4 for f in incfns]
--R
--R
@@ -221,7 +222,7 @@
--R Type: List Fraction Integer
--E 16
---S 17
+--S 17 of 26
times(n:NNI, i:INT):INT == n*i
--R
--R Function declaration times : (NonNegativeInteger,Integer) -> Integer
@@ -229,25 +230,25 @@
--R Type: Void
--E 17
---S 18
+--S 18 of 26
r := recur(times)
--R
--R Compiling function times with type (NonNegativeInteger,Integer) ->
--R Integer
--R
---R (18) theMap(MAPPKG1;recur;2M;7!0,0)
+--I (18) theMap(MAPPKG1;recur;2M;7!0,0)
--R Type: ((NonNegativeInteger,Integer) -> Integer)
--E 18
---S 19
+--S 19 of 26
fact := curryRight(r, 1)
--R
--R
---R (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (NonNegativeInteger -> Integer)
--E 19
---S 20
+--S 20 of 26
fact 4
--R
--R
@@ -255,7 +256,7 @@
--R Type: PositiveInteger
--E 20
---S 21
+--S 21 of 26
mto2ton(m, n) ==
raiser := square^n
raiser m
@@ -263,7 +264,7 @@
--R Type: Void
--E 21
---S 22
+--S 22 of 26
mto2ton(3, 3)
--R
--R Compiling function mto2ton with type (PositiveInteger,
@@ -273,7 +274,7 @@
--R Type: Fraction Integer
--E 22
---S 23
+--S 23 of 26
shiftfib(r: List INT) : INT ==
t := r.1
r.1 := r.2
@@ -285,7 +286,7 @@
--R Type: Void
--E 23
---S 24
+--S 24 of 26
fibinit: List INT := [0, 1]
--R
--R
@@ -293,16 +294,16 @@
--R Type: List Integer
--E 24
---S 25
+--S 25 of 26
fibs := curry(shiftfib, fibinit)
--R
--R Compiling function shiftfib with type List Integer -> Integer
--R
---R (25) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (25) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Integer)
--E 25
---S 26
+--S 26 of 26
[fibs() for i in 0..30]
--R
--R
@@ -312,6 +313,16 @@
--R 317811, 514229, 832040]
--R Type: List Integer
--E 26
+
+)spool
+)lisp (bye)
+
+@
+\eject
+\begin{thebibliography}{99}
+\bibitem{1} nothing
+\end{thebibliography}
+\end{document}
)spool
)lisp (bye)
@
@@ -486,9 +497,10 @@
Type: List Integer
See Also:
+o )show MappingPackage1
o )help MappingPackage2
o )help MappingPackage3
-o )show MappingPackage1
+o )help MappingPackage4
o $AXIOM/doc/src/algebra/mappkg.spad.dvi
@
@@ -595,7 +607,7 @@
rewop := twist power
--R
--R
---R (3) theMap(MAPPKG3;twist;MM;5!0)
+--I (3) theMap(MAPPKG3;twist;MM;5!0)
--R Type: ((Integer,Fraction Integer) -> Fraction Integer)
--E 3
@@ -617,7 +629,7 @@
square:= curryRight(power, 2)
--R
--R
---R (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 6
@@ -633,7 +645,7 @@
squirrel:= constantRight(square)$MAPPKG3(FRAC INT,FRAC INT,FRAC INT)
--R
--R
---R (8) theMap(MAPPKG3;constantRight;MM;3!0)
+--I (8) theMap(MAPPKG3;constantRight;MM;3!0)
--R Type: ((Fraction Integer,Fraction Integer) -> Fraction Integer)
--E 8
@@ -651,7 +663,7 @@
sixteen := curry(square, 4/1)
--R
--R
---R (10) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (10) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Fraction Integer)
--E 10
@@ -667,7 +679,7 @@
square2:=square*square
--R
--R
---R (12) theMap(MAPPKG3;*;MMM;6!0,0)
+--I (12) theMap(MAPPKG3;*;MMM;6!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 12
@@ -694,12 +706,12 @@
--R
--R
--R (15)
---R [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0)]
+--I [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0)]
--R Type: List (Fraction Integer -> Fraction Integer)
--E 15
@@ -725,7 +737,7 @@
--R Compiling function times with type (NonNegativeInteger,Integer) ->
--R Integer
--R
---R (18) theMap(MAPPKG1;recur;2M;7!0,0)
+--I (18) theMap(MAPPKG1;recur;2M;7!0,0)
--R Type: ((NonNegativeInteger,Integer) -> Integer)
--E 18
@@ -733,7 +745,7 @@
fact := curryRight(r, 1)
--R
--R
---R (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (NonNegativeInteger -> Integer)
--E 19
@@ -788,7 +800,7 @@
--R
--R Compiling function shiftfib with type List Integer -> Integer
--R
---R (25) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (25) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Integer)
--E 25
@@ -977,8 +989,9 @@
See Also:
o )help MappingPackage1
+o )show MappingPackage2
o )help MappingPackage3
-o )show MappingPackage2
+o )help MappingPackage4
o $AXIOM/doc/src/algebra/mappkg.spad.dvi
@
@@ -1052,7 +1065,7 @@
rewop := twist power
--R
--R
---R (3) theMap(MAPPKG3;twist;MM;5!0)
+--I (3) theMap(MAPPKG3;twist;MM;5!0)
--R Type: ((Integer,Fraction Integer) -> Fraction Integer)
--E 3
@@ -1074,7 +1087,7 @@
square:= curryRight(power, 2)
--R
--R
---R (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (6) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 6
@@ -1090,7 +1103,7 @@
squirrel:= constantRight(square)$MAPPKG3(FRAC INT,FRAC INT,FRAC INT)
--R
--R
---R (8) theMap(MAPPKG3;constantRight;MM;3!0)
+--I (8) theMap(MAPPKG3;constantRight;MM;3!0)
--R Type: ((Fraction Integer,Fraction Integer) -> Fraction Integer)
--E 8
@@ -1108,7 +1121,7 @@
sixteen := curry(square, 4/1)
--R
--R
---R (10) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (10) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Fraction Integer)
--E 10
@@ -1124,7 +1137,7 @@
square2:=square*square
--R
--R
---R (12) theMap(MAPPKG3;*;MMM;6!0,0)
+--I (12) theMap(MAPPKG3;*;MMM;6!0,0)
--R Type: (Fraction Integer -> Fraction Integer)
--E 12
@@ -1151,12 +1164,12 @@
--R
--R
--R (15)
---R [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
---R theMap(MAPPKG1;**;MNniM;6!0,0)]
+--I [theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0), theMap(MAPPKG1;**;MNniM;6!0,0),
+--I theMap(MAPPKG1;**;MNniM;6!0,0)]
--R Type: List (Fraction Integer -> Fraction Integer)
--E 15
@@ -1182,7 +1195,7 @@
--R Compiling function times with type (NonNegativeInteger,Integer) ->
--R Integer
--R
---R (18) theMap(MAPPKG1;recur;2M;7!0,0)
+--I (18) theMap(MAPPKG1;recur;2M;7!0,0)
--R Type: ((NonNegativeInteger,Integer) -> Integer)
--E 18
@@ -1190,7 +1203,7 @@
fact := curryRight(r, 1)
--R
--R
---R (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
+--I (19) theMap(MAPPKG3;curryRight;MBM;1!0,0)
--R Type: (NonNegativeInteger -> Integer)
--E 19
@@ -1245,7 +1258,7 @@
--R
--R Compiling function shiftfib with type List Integer -> Integer
--R
---R (25) theMap(MAPPKG2;curry;MAM;2!0,0)
+--I (25) theMap(MAPPKG2;curry;MAM;2!0,0)
--R Type: (() -> Integer)
--E 25
@@ -1436,6 +1449,7 @@
o )help MappingPackage1
o )help MappingPackage2
o )show MappingPackage3
+o )help MappingPackage4
o $AXIOM/doc/src/algebra/mappkg.spad.dvi
@
@@ -1499,6 +1513,320 @@
fbc*fab == comp(fbc,fab,#1)
@
+\section{package MAPPKG4 MappingPackage4}
+<<MappingPackage4.input>>=
+-- mappkg.spad.pamphlet MappingPackage4.input
+)spool MappingPackage4.output
+)set message test on
+)set message auto off
+)clear all
+
+--S 1 of 21
+p:=(x:EXPR(INT)):EXPR(INT)+->3*x
+--R
+--R
+--R (1) theMap(Closure)
+--R Type: (Expression Integer -> Expression Integer)
+--E 1
+
+--S 2 of 21
+q:=(x:EXPR(INT)):EXPR(INT)+->2*x+3
+--R
+--R
+--R (2) theMap(Closure)
+--R Type: (Expression Integer -> Expression Integer)
+--E 2
+
+--S 3 of 21
+(p+q)(4)-(p(4)+q(4))
+--R
+--R
+--R (3) 0
+--R Type: Expression Integer
+--E 3
+
+--S 4 of 21
+(p+q)(x)-(p(x)+q(x))
+--R
+--R
+--R (4) 0
+--R Type: Expression Integer
+--E 4
+
+--S 5 of 21
+(p-q)(4)-(p(4)-q(4))
+--R
+--R
+--R (5) 0
+--R Type: Expression Integer
+--E 5
+
+--S 6 of 21
+(p-q)(x)-(p(x)-q(x))
+--R
+--R
+--R (6) 0
+--R Type: Expression Integer
+--E 6
+
+--S 7 of 21
+(p*q)(4)-(p(4)*q(4))
+--R
+--R
+--R (7) 0
+--R Type: Expression Integer
+--E 7
+
+--S 8 of 21
+(p*q)(x)-(p(x)*q(x))
+--R
+--R
+--R (8) 0
+--R Type: Expression Integer
+--E 8
+
+--S 9 of 21
+(p/q)(4)-(p(4)/q(4))
+--R
+--R
+--R (9) 0
+--R Type: Expression Integer
+--E 9
+
+--S 10 of 21
+(p/q)(x)-(p(x)/q(x))
+--R
+--R
+--R (10) 0
+--R Type: Expression Integer
+--E 10
+
+--S 11 of 21
+r:=(x:INT):INT+-> (x*x*x)
+--R
+--R
+--R (11) theMap(Closure)
+--R Type: (Integer -> Integer)
+--E 11
+
+--S 12 of 21
+s:=(y:INT):INT+-> (y*y+3)
+--R
+--R
+--R (12) theMap(Closure)
+--R Type: (Integer -> Integer)
+--E 12
+
+--S 13 of 21
+(r+s)(4)-(r(4)+s(4))
+--R
+--R
+--R (13) 0
+--R Type: NonNegativeInteger
+--E 13
+
+--S 14 of 21
+(r-s)(4)-(r(4)-s(4))
+--R
+--R
+--R (14) 0
+--R Type: NonNegativeInteger
+--E 14
+
+--S 15 of 21
+(r*s)(4)-(r(4)*s(4))
+--R
+--R
+--R (15) 0
+--R Type: NonNegativeInteger
+--E 15
+
+--S 16 of 21
+t:=(x:INT):EXPR(INT)+-> (x*x*x)
+--R
+--R
+--R (16) theMap(Closure)
+--R Type: (Integer -> Expression Integer)
+--E 16
+
+--S 17 of 21
+u:=(y:INT):EXPR(INT)+-> (y*y+3)
+--R
+--R
+--R (17) theMap(Closure)
+--R Type: (Integer -> Expression Integer)
+--E 17
+
+--S 18 of 21
+(t/u)(4)-(t(4)/u(4))
+--R
+--R
+--R (18) 0
+--R Type: Expression Integer
+--E 18
+
+--S 19 of 21
+h:=(x:EXPR(INT)):EXPR(INT)+->1
+--R
+--R (19) theMap(Closure)
+--R Type: (Expression Integer -> Expression Integer)
+--E 19
+
+--S 20 of 21
+(p/h)(x)
+--R
+--R (20) 3x
+--R Type: Expression Integer
+--E 20
+
+--S 21 of 21
+(q/h)(x)
+--R
+--R (21) 2x + 3
+--R Type: Expression Integer
+--E 21
+
+)spool
+)lisp (bye)
+
+@
+\eject
+\begin{thebibliography}{99}
+\bibitem{1} nothing
+\end{thebibliography}
+\end{document}
+)spool
+)lisp (bye)
+@
+<<MappingPackage4.help>>=
+====================================================================
+MappingPackage examples
+====================================================================
+
+We can construct some simple maps that take a variable x
+into an equation:
+
+ p:=(x:EXPR(INT)):EXPR(INT)+->3*x
+ q:=(x:EXPR(INT)):EXPR(INT)+->2*x+3
+
+Now we can do the four arithmetic operations, +, -, *, / on these
+newly constructed mappings. Since the maps are from the domain
+Expression Integer to the same domain we can also use symbolic
+values for the argument. All of the following will return 0,
+showing that function composition is equivalent to the result
+of doing the operations individually.
+
+ (p+q)(4)-(p(4)+q(4))
+ (p+q)(x)-(p(x)+q(x))
+
+ (p-q)(4)-(p(4)-q(4))
+ (p-q)(x)-(p(x)-q(x))
+
+ (p*q)(4)-(p(4)*q(4))
+ (p*q)(x)-(p(x)*q(x))
+
+ (p/q)(4)-(p(4)/q(4))
+ (p/q)(x)-(p(x)/q(x))
+
+We can construct simple maps from Integer to Integer but this
+limits our ability to do division.
+
+ r:=(x:INT):INT+-> (x*x*x)
+ s:=(y:INT):INT+-> (y*y+3)
+
+Again, all of these will return 0:
+
+ (r+s)(4)-(r(4)+s(4))
+ (r-s)(4)-(r(4)-s(4))
+ (r*s)(4)-(r(4)*s(4))
+
+If we want to do division with Integer inputs we create the
+appropriate map:
+
+ t:=(x:INT):EXPR(INT)+-> (x*x*x)
+ u:=(y:INT):EXPR(INT)+-> (y*y+3)
+
+ (t/u)(4)-(t(4)/u(4))
+
+We can even recover the original functions if we make a map
+that always returns the constant 1:
+
+ h:=(x:EXPR(INT)):EXPR(INT)+->1
+
+ theMap(Closure)
+ Type: (Expression Integer -> Expression Integer)
+
+ (p/h)(x)
+
+ 3x
+ Type: Expression Integer
+ (q/h)(x)
+
+ 2x + 3
+ Type: Expression Integer
+
+See Also:
+o )show MappingPackage1
+o )help MappingPackage2
+o )help MappingPackage3
+o )help MappingPackage4
+o $AXIOM/doc/src/algebra/mappkg.spad.dvi
+
+@
+<<package MAPPKG4 MappingPackage4>>=
+)abbrev package MAPPKG4 MappingPackage4
+++ Author: Timothy Daly
+++ Description: Functional Composition
+++ Given functions f and g, returns the applicable closure
+MappingPackage4(A:SetCategory, B:Ring):
+ with
+ "+": (A->B, A->B) -> (A->B)
+ ++ \spad(+) does functional addition
+ ++
+ ++E f:=(x:INT):INT +-> 3*x
+ ++E g:=(x:INT):INT +-> 2*x+3
+ ++E (f+g)(4)
+ "-": (A->B, A->B) -> (A->B)
+ ++ \spad(+) does functional addition
+ ++
+ ++E f:=(x:INT):INT +-> 3*x
+ ++E g:=(x:INT):INT +-> 2*x+3
+ ++E (f-g)(4)
+ "*": (A->B, A->B) -> (A->B)
+ ++ \spad(+) does functional addition
+ ++
+ ++E f:=(x:INT):INT +-> 3*x
+ ++E g:=(x:INT):INT +-> 2*x+3
+ ++E (f*g)(4)
+ "/": (A->Expression(Integer), A->Expression(Integer)) -> (A->Expression(Integer))
+ ++ \spad(+) does functional addition
+ ++
+ ++E p:=(x:EXPR(INT)):EXPR(INT)+->3*x
+ ++E q:=(x:EXPR(INT)):EXPR(INT)+->2*x+3
+ ++E (p/q)(4)
+ ++E (p/q)(x)
+ == add
+ fab ==> (A -> B)
+ faei ==> (A -> Expression(Integer))
+
+ funcAdd(g:fab,h:fab,x:A):B == ((g x) + (h x))$B
+
+ (a:fab)+(b:fab) == funcAdd(a,b,#1)
+
+ funcSub(g:fab,h:fab,x:A):B == ((g x) - (h x))$B
+
+ (a:fab)-(b:fab) == funcSub(a,b,#1)
+
+ funcMul(g:fab,h:fab,x:A):B == ((g x) * (h x))$B
+
+ (a:fab)*(b:fab) == funcMul(a,b,#1)
+
+ funcDiv(g:faei,h:faei,x:A):Expression(Integer)
+ == ((g x) / (h x))$Expression(Integer)
+
+ (a:faei)/(b:faei) == funcDiv(a,b,#1)
+
+@
\section{License}
<<license>>=
--Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
@@ -1541,6 +1869,7 @@
<<package MAPPKG1 MappingPackage1>>
<<package MAPPKG2 MappingPackage2>>
<<package MAPPKG3 MappingPackage3>>
+<<package MAPPKG4 MappingPackage4>>
@
\eject
\begin{thebibliography}{99}
Modified: trunk/axiom/src/input/test.input.pamphlet
===================================================================
--- trunk/axiom/src/input/test.input.pamphlet 2008-08-20 21:18:59 UTC (rev 951)
+++ trunk/axiom/src/input/test.input.pamphlet 2008-08-22 04:08:39 UTC (rev 952)
@@ -826,7 +826,7 @@
--S 64
1+"asd" -- These should both fail in the same way
--R
---R There are 11 exposed and 5 unexposed library operations named +
+--R There are 12 exposed and 5 unexposed library operations named +
--R having 2 argument(s) but none was determined to be applicable.
--R Use HyperDoc Browse, or issue
--R )display op +
@@ -846,7 +846,7 @@
--S 65
1/"asd"
--R
---R There are 12 exposed and 12 unexposed library operations named /
+--R There are 13 exposed and 12 unexposed library operations named /
--R having 2 argument(s) but none was determined to be applicable.
--R Use HyperDoc Browse, or issue
--R )display op /
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-22 04:02:56
|
CHANGELOG | 1047 - FAQ | 1592 - Makefile | 12 +- Makefile.pamphlet | 656 +- README | 528 - axiomicon.png | Bin axiomlogo.jpg | Bin axiomsml.png | Bin books/Makefile.pamphlet | 196 + books/axbook.tgz | Bin books/bitmaps/ai.bitmap | 7 + books/bitmaps/al.bitmap | 9 + books/bitmaps/aleph.bitmap | 8 + books/bitmaps/alpha.bitmap | 8 + books/bitmaps/alpha.xbm | 7 + books/bitmaps/alphaj.bitmap | 9 + books/bitmaps/angle.bitmap | 6 + books/bitmaps/anna.xbm.tiny | 12 + books/bitmaps/anna_logo.xbm | 165 + books/bitmaps/atxequalb.bitmap | 21 + books/bitmaps/axiom.xbm | 1049 + books/bitmaps/axiom1.bitmap | 287 + books/bitmaps/back.bitmap | 23 + books/bitmaps/backslash.bitmap | 6 + books/bitmaps/beta.bitmap | 8 + books/bitmaps/beta.xbm | 7 + books/bitmaps/betaj.bitmap | 9 + books/bitmaps/bot.bitmap | 6 + books/bitmaps/bullet.bitmap | 8 + books/bitmaps/c02aff.bitmap | 53 + books/bitmaps/c1.bitmap | 9 + books/bitmaps/chi.bitmap | 8 + books/bitmaps/ci.bitmap | 7 + books/bitmaps/clear.bitmap | 8 + books/bitmaps/clearall.bitmap | 11 + books/bitmaps/clicktoset.bitmap | 78 + books/bitmaps/continue.bitmap | 41 + books/bitmaps/ctb.bitmap | 13 + books/bitmaps/d01aqf.xbm | 71 + books/bitmaps/d01fcf.bitmap | 353 + books/bitmaps/d01gaf1.bitmap | 47 + books/bitmaps/d01gaf2.bitmap | 48 + books/bitmaps/d02gaf.bitmap | 39 + books/bitmaps/d03edf.bitmap | 1253 + books/bitmaps/d03edf1.bitmap | 320 + books/bitmaps/d03eef.bitmap | 528 + books/bitmaps/d03eef.xbm | 537 + books/bitmaps/d03eef1.bitmap | 162 + books/bitmaps/d03eef2.bitmap | 97 + books/bitmaps/d03faf.bitmap | 201 + books/bitmaps/d03faf.xbm | 185 + books/bitmaps/del.bitmap | 6 + books/bitmaps/delta-cap.bitmap | 8 + books/bitmaps/delta.bitmap | 8 + books/bitmaps/delta.xbm | 7 + books/bitmaps/div.bitmap | 6 + books/bitmaps/doit.bitmap | 23 + books/bitmaps/door | 20 + books/bitmaps/door.bitmap | 23 + books/bitmaps/dot.bitmap | 8 + books/bitmaps/down.bitmap | 23 + books/bitmaps/down3.bitmap | 23 + books/bitmaps/dr.bitmap | 6 + books/bitmaps/drown.bm | 23 + books/bitmaps/e01baf.bitmap | 47 + books/bitmaps/e01baf1.bitmap | 26 + books/bitmaps/e01bef.bitmap | 31 + books/bitmaps/e01daf.bitmap | 35 + books/bitmaps/e01daf1.bitmap | 83 + books/bitmaps/e02adf.bitmap | 253 + books/bitmaps/e02adf1.bitmap | 173 + books/bitmaps/e02aef.bitmap | 117 + books/bitmaps/e02agf.bitmap | 51 + books/bitmaps/e02agf1.bitmap | 103 + books/bitmaps/e02ahf.bitmap | 110 + books/bitmaps/e02ahf1.bitmap | 100 + books/bitmaps/e02ajf.bitmap | 94 + books/bitmaps/e02baf.bitmap | 76 + books/bitmaps/e02bdf.bitmap | 25 + books/bitmaps/e02bef.bitmap | 68 + books/bitmaps/e02daf.bitmap | 260 + books/bitmaps/e02daf1.bitmap | 56 + books/bitmaps/e04fdf.bitmap | 173 + books/bitmaps/e04fdf1.bitmap | 63 + books/bitmaps/e04mbf.bitmap | 212 + books/bitmaps/e04naf.bitmap | 303 + books/bitmaps/e04ucf.bitmap | 363 + books/bitmaps/ell.bitmap | 8 + books/bitmaps/emptyset.bitmap | 8 + books/bitmaps/ep1.bitmap | 6 + books/bitmaps/ep2.bitmap | 6 + books/bitmaps/epi.bitmap | 6 + books/bitmaps/epp.bitmap | 6 + books/bitmaps/epsilon.bitmap | 8 + books/bitmaps/epsilon.xbm | 7 + books/bitmaps/eqpage.bitmap | 23 + books/bitmaps/erase.bitmap | 6 + books/bitmaps/error.bitmap | 6 + books/bitmaps/eta.bitmap | 6 + books/bitmaps/exists.bitmap | 8 + books/bitmaps/exit.bitmap | 25 + books/bitmaps/exit3d.bitmap | 23 + books/bitmaps/exit3d_old.bitmap | 23 + books/bitmaps/exit3di.bitmap | 23 + books/bitmaps/f01qcf.bitmap | 76 + books/bitmaps/f01qcf1.bitmap | 99 + books/bitmaps/f01qcf2.bitmap | 39 + books/bitmaps/f01qcf3.bitmap | 65 + books/bitmaps/f01qdf.bitmap | 13 + books/bitmaps/f01qdf1.bitmap | 33 + books/bitmaps/f01qdf2.bitmap | 9 + books/bitmaps/f01rdf.bitmap | 13 + books/bitmaps/f01rdf1.bitmap | 33 + books/bitmaps/f01rdf2.bitmap | 34 + books/bitmaps/fi.bitmap | 6 + books/bitmaps/forall.bitmap | 8 + books/bitmaps/fqr.bitmap | 9 + books/bitmaps/fr.bitmap | 8 + books/bitmaps/gamma-cap.bitmap | 8 + books/bitmaps/gamma.bitmap | 6 + books/bitmaps/gamma.xbm | 7 + books/bitmaps/gammacomplex.png | Bin books/bitmaps/gammacomplexinverse.png | Bin books/bitmaps/gammak.bitmap | 7 + books/bitmaps/gammareal3.png | Bin books/bitmaps/gi.bitmap | 6 + books/bitmaps/great=.bitmap | 8 + books/bitmaps/hbar.bitmap | 8 + books/bitmaps/help.bitmap | 23 + books/bitmaps/help2.bakmap | 23 + books/bitmaps/help2.bitmap | 25 + books/bitmaps/help3.bitmap | 23 + books/bitmaps/help3d.bitmap | 23 + books/bitmaps/help3d_old.bitmap | 23 + books/bitmaps/help3di.bitmap | 23 + books/bitmaps/home3d.bitmap | 23 + books/bitmaps/home3d_old.bitmap | 23 + books/bitmaps/home3di.bitmap | 23 + books/bitmaps/im-cap.bitmap | 6 + books/bitmaps/imath.bitmap | 8 + books/bitmaps/infty.bitmap | 8 + books/bitmaps/infty.xbm | 6 + books/bitmaps/ing.bitmap | 9 + books/bitmaps/ing1.bitmap | 11 + books/bitmaps/ing2.bitmap | 25 + books/bitmaps/int.bitmap | 8 + books/bitmaps/int1.xbm | 78 + books/bitmaps/int10.xbm | 64 + books/bitmaps/int11.xbm | 191 + books/bitmaps/int12.xbm | 127 + books/bitmaps/int13.xbm | 49 + books/bitmaps/int2.xbm | 49 + books/bitmaps/int3.xbm | 82 + books/bitmaps/int4.xbm | 60 + books/bitmaps/int5.xbm | 110 + books/bitmaps/int6.xbm | 98 + books/bitmaps/int7.xbm | 104 + books/bitmaps/int8.xbm | 91 + books/bitmaps/int9.xbm | 91 + books/bitmaps/integral.bitmap | 8 + books/bitmaps/integral.bm | 8 + books/bitmaps/iota.bitmap | 8 + books/bitmaps/jmath.bitmap | 6 + books/bitmaps/kappa.bitmap | 8 + books/bitmaps/l1.bitmap | 9 + books/bitmaps/lambda-cap.bitmap | 8 + books/bitmaps/lambda.bitmap | 8 + books/bitmaps/lamdab.bitmap | 6 + books/bitmaps/lamdai.bitmap | 7 + books/bitmaps/lamdaj.bitmap | 9 + books/bitmaps/ldlt.bitmap | 14 + books/bitmaps/less=.bitmap | 8 + books/bitmaps/lj.bitmap | 6 + books/bitmaps/llt.bitmap | 13 + books/bitmaps/loggamma.png | Bin books/bitmaps/lt.bitmap | 9 + books/bitmaps/mask.bitmap | 8 + books/bitmaps/menudot.bitmap | 6 + books/bitmaps/mkm.bitmap | 17 + books/bitmaps/mu.bitmap | 6 + books/bitmaps/mui.bitmap | 7 + books/bitmaps/muj.bitmap | 7 + books/bitmaps/mx.bitmap | 9 + books/bitmaps/my.bitmap | 9 + books/bitmaps/nabla.bitmap | 6 + books/bitmaps/naglogo.bitmap | 475 + books/bitmaps/ncap.bitmap | 6 + books/bitmaps/neg.bitmap | 6 + books/bitmaps/newrho.bitmap | 6 + books/bitmaps/nl.bitmap | 7 + books/bitmaps/nn.bitmap | 9 + books/bitmaps/noop.bitmap | 25 + books/bitmaps/noop3d.bitmap | 23 + books/bitmaps/not=.bitmap | 8 + books/bitmaps/notequal.bitmap | 6 + books/bitmaps/notequal.xbm | 6 + books/bitmaps/nu.bitmap | 8 + books/bitmaps/nx.bitmap | 9 + books/bitmaps/ny.bitmap | 9 + books/bitmaps/ode1.xbm | 273 + books/bitmaps/ode2.xbm | 300 + books/bitmaps/ode3.xbm | 97 + books/bitmaps/omega-cap.bitmap | 8 + books/bitmaps/omega.bitmap | 8 + books/bitmaps/omicron.bitmap | 8 + books/bitmaps/opt1.xbm | 73 + books/bitmaps/opt2.xbm | 117 + books/bitmaps/opt2c.xbm | 146 + books/bitmaps/opt3.xbm | 51 + books/bitmaps/opt3c1.xbm | 107 + books/bitmaps/opt3c2.xbm | 212 + books/bitmaps/opt4.xbm | 95 + books/bitmaps/opt4c1.xbm | 317 + books/bitmaps/opt4c2.xbm | 75 + books/bitmaps/opt4c3.xbm | 1151 + books/bitmaps/opt5.xbm | 245 + books/bitmaps/opt61.xbm | 298 + books/bitmaps/opt62.xbm | 313 + books/bitmaps/opt63.xbm | 315 + books/bitmaps/parallel.bitmap | 6 + books/bitmaps/partial.bitmap | 8 + books/bitmaps/pelzel.bitmap | 13 + books/bitmaps/phi-cap.bitmap | 8 + books/bitmaps/phi.bitmap | 8 + books/bitmaps/phi.xbm | 7 + books/bitmaps/pi-cap.bitmap | 8 + books/bitmaps/pi.bitmap | 8 + books/bitmaps/pi.xbm | 6 + books/bitmaps/pick.bitmap | 6 + books/bitmaps/pick_old.bitmap | 6 + books/bitmaps/plusminus.xbm | 6 + books/bitmaps/prime.bitmap | 6 + books/bitmaps/prod.bitmap | 6 + books/bitmaps/psi-cap.bitmap | 8 + books/bitmaps/psi.bitmap | 8 + books/bitmaps/psi.png | Bin books/bitmaps/psi.xbm | 7 + books/bitmaps/px.bitmap | 9 + books/bitmaps/py.bitmap | 9 + books/bitmaps/quad.bitmap | 6 + books/bitmaps/quit.bitmap | 15 + books/bitmaps/re-cap.bitmap | 8 + books/bitmaps/return.bitmap | 23 + books/bitmaps/return2.bitmap | 23 + books/bitmaps/return3.bitmap | 25 + books/bitmaps/rho.bitmap | 8 + books/bitmaps/rho=r.bitmap | 12 + books/bitmaps/rhosq=.bitmap | 37 + books/bitmaps/s13aaf.bitmap | 67 + books/bitmaps/s13aaf1.bitmap | 74 + books/bitmaps/s13aaf2.bitmap | 15 + books/bitmaps/s13acf.bitmap | 111 + books/bitmaps/s13adf.bitmap | 77 + books/bitmaps/s14baf.bitmap | 213 + books/bitmaps/s15adf.bitmap | 75 + books/bitmaps/s15aef.bitmap | 65 + books/bitmaps/s17acf.bitmap | 13 + books/bitmaps/s17adf.bitmap | 13 + books/bitmaps/s17aef.bitmap | 13 + books/bitmaps/s17aef1.bitmap | 13 + books/bitmaps/s17aff.bitmap | 13 + books/bitmaps/s17aff1.bitmap | 13 + books/bitmaps/s17dcf.bitmap | 17 + books/bitmaps/s17def.bitmap | 17 + books/bitmaps/s17dlf.bitmap | 31 + books/bitmaps/s17dlf1.bitmap | 28 + books/bitmaps/s17dlf2.bitmap | 28 + books/bitmaps/s18acf.bitmap | 28 + books/bitmaps/s18acf1.bitmap | 14 + books/bitmaps/s18adf.bitmap | 28 + books/bitmaps/s18adf1.bitmap | 14 + books/bitmaps/s18aef.bitmap | 23 + books/bitmaps/s18aef1.bitmap | 13 + books/bitmaps/s18aff.bitmap | 23 + books/bitmaps/s18aff1.bitmap | 13 + books/bitmaps/s18dcf.bitmap | 18 + books/bitmaps/s18def.bitmap | 17 + books/bitmaps/s21baf.bitmap | 170 + books/bitmaps/s21baf.bitmap.wrong | 132 + books/bitmaps/s21baf1.bitmap | 24 + books/bitmaps/s21baf1.bitmap.wrong | 27 + books/bitmaps/s21bbf.bitmap | 161 + books/bitmaps/s21bbf1.bitmap | 50 + books/bitmaps/s21bcf.bitmap | 183 + books/bitmaps/s21bcf1.bitmap | 44 + books/bitmaps/s21bdf.bitmap | 208 + books/bitmaps/s21bdf1.bitmap | 60 + books/bitmaps/sdown.bitmap | 9 + books/bitmaps/sdown.bm | 9 + books/bitmaps/sdown3d.bitmap | 9 + books/bitmaps/sdown3dpr.bitmap | 9 + books/bitmaps/si-integral.bitmap | 19 + books/bitmaps/sigma-cap.bitmap | 8 + books/bitmaps/sigma.bitmap | 8 + books/bitmaps/smile.bitmap | 15 + books/bitmaps/source.bitmap | 8 + books/bitmaps/subtwo.bitmap | 8 + books/bitmaps/sum.bitmap | 6 + books/bitmaps/sum.bm | 8 + books/bitmaps/sup.bitmap | 9 + books/bitmaps/sup.bm | 9 + books/bitmaps/sup3d.bitmap | 9 + books/bitmaps/sup3dpr.bitmap | 9 + books/bitmaps/surd.bitmap | 8 + books/bitmaps/tau.bitmap | 8 + books/bitmaps/tear.bitmap | 23 + books/bitmaps/theta-cap.bitmap | 8 + books/bitmaps/theta.bitmap | 8 + books/bitmaps/top.bitmap | 6 + books/bitmaps/triangle.bitmap | 6 + books/bitmaps/uij.bitmap | 9 + books/bitmaps/uj.bitmap | 7 + books/bitmaps/unpick.bitmap | 6 + books/bitmaps/unpick_old.bitmap | 6 + books/bitmaps/up.bitmap | 23 + books/bitmaps/up2.bitmap | 23 + books/bitmaps/up3.bitmap | 23 + books/bitmaps/up3d.bitmap | 23 + books/bitmaps/up3di.bitmap | 23 + books/bitmaps/updots.bitmap | 23 + books/bitmaps/upsilon-cap.bitmap | 8 + books/bitmaps/upsilon.bitmap | 8 + books/bitmaps/wr.bitmap | 9 + books/bitmaps/x1.xbm | 24 + books/bitmaps/xbar.bitmap | 6 + books/bitmaps/xdesp.bitmap | 6 + books/bitmaps/xe.xbm | 14 + books/bitmaps/xfbox.bitmap | 6 + books/bitmaps/xfcirc.bitmap | 6 + books/bitmaps/xfullbox.bitmap | 6 + books/bitmaps/xfullcirc.bitmap | 6 + books/bitmaps/xfullfbox.bitmap | 6 + books/bitmaps/xfullfcirc.bitmap | 6 + books/bitmaps/xgreybox.bitmap | 6 + books/bitmaps/xgreycirc.bitmap | 6 + books/bitmaps/xgreyfbox.bitmap | 6 + books/bitmaps/xgreyfcirc.bitmap | 6 + books/bitmaps/xhappy.bitmap | 6 + books/bitmaps/xi-cap.bitmap | 8 + books/bitmaps/xi.bitmap | 6 + books/bitmaps/xii.bitmap | 6 + books/bitmaps/xiii.bitmap | 6 + books/bitmaps/xj.bitmap | 8 + books/bitmaps/xmax.bitmap | 11 + books/bitmaps/xmin.bitmap | 11 + books/bitmaps/xnobox.bitmap | 6 + books/bitmaps/xnocirc.bitmap | 6 + books/bitmaps/xnoface.bitmap | 6 + books/bitmaps/xopenbox.bitmap | 6 + books/bitmaps/xopencirc.bitmap | 6 + books/bitmaps/xopenfbox.bitmap | 6 + books/bitmaps/xopenfcirc.bitmap | 6 + books/bitmaps/xperv.bitmap | 6 + books/bitmaps/xq.bitmap | 9 + books/bitmaps/xr.bitmap | 7 + books/bitmaps/xs.xbm | 18 + books/bitmaps/xsad.bitmap | 6 + books/bitmaps/xtickbox.bitmap | 6 + books/bitmaps/xtickcirc.bitmap | 6 + books/bitmaps/xtickfbox.bitmap | 6 + books/bitmaps/xtickfcirc.bitmap | 6 + books/bitmaps/xxbox.bitmap | 6 + books/bitmaps/xxcirc.bitmap | 6 + books/bitmaps/xxfbox.bitmap | 6 + books/bitmaps/xxfcirc.bitmap | 6 + books/bitmaps/y1.xbm | 83 + books/bitmaps/y2.xbm | 99 + books/bitmaps/y3.xbm | 62 + books/bitmaps/ye.xbm | 15 + books/bitmaps/yi.bitmap | 6 + books/bitmaps/yr.bitmap | 7 + books/bitmaps/ys.xbm | 16 + books/bitmaps/zeta.bitmap | 6 + books/bitmaps/zetak.bitmap | 9 + books/bitmaps/zk.bitmap | 9 + books/bookvol0.pamphlet |67730 +++++++ books/bookvol1.pamphlet |14842 ++ books/bookvol10.pamphlet | 2159 + books/bookvol11.pamphlet |50515 ++++++ books/bookvol12.pamphlet | 493 + books/bookvol2.pamphlet | 343 + books/bookvol3.pamphlet | 343 + books/bookvol4.pamphlet | 4434 + books/bookvol5.pamphlet | 6150 + books/bookvol6.pamphlet | 7301 + books/bookvol7.1.pamphlet |188318 ++++++++++++++++++++ books/bookvol7.pamphlet |20699 +++ books/bookvol8.pamphlet |20260 +++ books/bookvol9.pamphlet | 343 + books/ps/23dcola.ps | 347 + books/ps/23dcolb.ps | 347 + books/ps/23dpal.ps | 347 + books/ps/2d1vara.ps | 1535 + books/ps/2d1varb.ps | 1527 + books/ps/2d1vard.ps | 414 + books/ps/2dctrl.ps | 722 + books/ps/2doptad.ps | 347 + books/ps/2doptcp.ps | 551 + books/ps/2doptcpr.ps | 434 + books/ps/2doptcvc.ps | 363 + books/ps/2doptplr.ps | 795 + books/ps/2doptptc.ps | 363 + books/ps/2doptrga.ps | 433 + books/ps/2doptrgb.ps | 420 + books/ps/2doptsc.ps | 436 + books/ps/2doptut.ps | 644 + books/ps/2dpaca.ps | 525 + books/ps/2dppca.ps | 1051 + books/ps/2dppcb.ps | 414 + books/ps/2dppcc.ps | 424 + books/ps/2dppce.ps | 571 + books/ps/3d2vara.ps |16338 ++ books/ps/3d2varb.ps |16338 ++ books/ps/3dbuilda.ps | 444 + books/ps/3dbuildb.ps | 444 + books/ps/3dctrl.ps | 770 + books/ps/3dgamma11.ps |52320 ++++++ books/ps/3dlight.ps | 647 + books/ps/3dmult1a.ps |16041 ++ books/ps/3dmult1b.ps |24489 +++ books/ps/3doptcf1.ps |14580 ++ books/ps/3doptcf2.ps | 9024 + books/ps/3doptcf3.ps | 9024 + books/ps/3doptcrd.ps |16041 ++ books/ps/3doptpts.ps | 3468 + books/ps/3doptrad.ps | 8748 + books/ps/3doptsty.ps | 1761 + books/ps/3doptttl.ps | 1023 + books/ps/3doptvb.ps |20100 +++ books/ps/3dpsa.ps |15744 ++ books/ps/3dpsb.ps |16338 ++ books/ps/3dpsca.ps | 446 + books/ps/3dpscb.ps | 1142 + books/ps/3dvolume.ps | 682 + books/ps/CRCp27-2.1.1.ps | 1736 + books/ps/arrow.ps | 260 + books/ps/arrowr.ps | 260 + books/ps/atan-1.epsi | 1261 + books/ps/atan-1.ps |16391 ++ books/ps/axiomfront.ps | 1091 + books/ps/basic2d.ps | 1375 + books/ps/bessel.ps |35500 ++++ books/ps/bessintr.epsi | 2027 + books/ps/bessintr.ps |16338 ++ books/ps/bigbayou.png | Bin books/ps/bluebayou.ps | 4214 + books/ps/bookvol1a.ps | 1335 + books/ps/bookvol1b.ps | 2060 + books/ps/bookvol1c.ps | 856 + books/ps/bookvol1d.ps | 4299 + books/ps/bookvol1e.ps | 710 + books/ps/bookvol1f.ps | 878 + books/ps/bookvol1g.ps | 638 + books/ps/bookvol1h.ps | 1475 + books/ps/bookvol1i.ps | 638 + books/ps/bookvol1j.ps | 512 + books/ps/bookvol1k.ps | 398 + books/ps/bookvol1l.ps | 398 + books/ps/bookvol1m.ps | 1013 + books/ps/bookvol1n.ps | 638 + books/ps/bookvol1o.ps | 806 + books/ps/bookvol1p.ps | 774 + books/ps/bookvol1q.ps | 1292 + books/ps/bouquet.ps | 326 + books/ps/cartcoord.ps |16338 ++ books/ps/clipgamma.ps |55300 ++++++ books/ps/compatan.ps |16338 ++ books/ps/compexp.ps |16338 ++ books/ps/compgamm.ps |18791 ++ books/ps/complexexp.ps |14050 ++ books/ps/complexroot.ps |14050 ++ books/ps/cylcoord.ps |16338 ++ books/ps/defcoord.ps |16338 ++ books/ps/doctitle.png | Bin books/ps/exit.ps | 386 + books/ps/h-alldoms.ps | 1367 + books/ps/h-allrank.ps | 1565 + books/ps/h-atsearch.ps | 1208 + books/ps/h-brfront.ps | 1074 + books/ps/h-browse.ps | 799 + books/ps/h-comsearch.ps | 1480 + books/ps/h-condition.ps | 950 + books/ps/h-consearch.ps | 1145 + books/ps/h-consearch2.ps | 1392 + books/ps/h-crossref.ps | 819 + books/ps/h-docsearch.ps | 1260 + books/ps/h-gensearch.ps | 1138 + books/ps/h-inverse.ps | 822 + books/ps/h-matargs.ps | 1337 + books/ps/h-matats.ps | 860 + books/ps/h-matdesc.ps | 1041 + books/ps/h-matexamp.ps | 1074 + books/ps/h-matexports.ps | 911 + books/ps/h-matimp.ps | 1404 + books/ps/h-matinv.ps | 1248 + books/ps/h-matmap.ps | 1430 + books/ps/h-matops.ps | 1332 + books/ps/h-matpage.ps | 1357 + books/ps/h-matrelops.ps | 1146 + books/ps/h-matrix.ps | 871 + books/ps/h-matrixops.ps | 1114 + books/ps/h-matrixops1.ps | 871 + books/ps/h-matrixops2.ps | 871 + books/ps/h-matsource.ps | 1390 + books/ps/h-matusers.ps | 997 + books/ps/h-matxref.ps | 1248 + books/ps/h-opsearch.ps | 852 + books/ps/h-origins.ps | 926 + books/ps/h-parameter.ps | 926 + books/ps/h-root.ps | 1335 + books/ps/h-signature.ps | 816 + books/ps/help.ps | 387 + books/ps/home.ps | 389 + books/ps/knot3.ps |77023 ++++++++ books/ps/modbess.ps | 534 + books/ps/modbessc.ps |16338 ++ books/ps/newmap.ps |16041 ++ books/ps/p28a.eps | 1461 + books/ps/p28b.eps | 4299 + books/ps/quat1.ps | 1199 + books/ps/quat10.ps | 1933 + books/ps/quat11.ps | 2386 + books/ps/quat12.ps | 1422 + books/ps/quat13.ps | 837 + books/ps/quat14.ps | 2255 + books/ps/quat15.ps | 812 + books/ps/quat16.ps | 1267 + books/ps/quat17.ps | 1104 + books/ps/quat18.ps | 3925 + books/ps/quat19.ps | 1192 + books/ps/quat2.ps | 1217 + books/ps/quat3.ps | 1753 + books/ps/quat4.ps | 1944 + books/ps/quat5.ps | 1877 + books/ps/quat6.ps | 1262 + books/ps/quat7.ps | 688 + books/ps/quat8.ps | 1142 + books/ps/quat9.ps | 1282 + books/ps/realbeta.ps |23818 +++ books/ps/ribbon1.ps | 1900 + books/ps/ribbon2.ps | 418 + books/ps/ribbon2r.ps | 418 + books/ps/ribbons.ps | 560 + books/ps/ribbons2.ps | 1488 + books/ps/ribbons2b.ps | 1516 + books/ps/ribbons5.ps | 3298 + books/ps/rose-1.ps | 1230 + books/ps/torusknot.ps | 4808 + books/ps/up.ps | 382 + books/ps/v71algebrapage.eps | 2228 + books/ps/v71basiccommand.eps | 2264 + books/ps/v71binaryexpansionxmppage.eps | 3611 + books/ps/v71calculus.eps | 2087 + books/ps/v71calculuspage.eps | 2645 + books/ps/v71cardinalnumberxmppage.eps | 3449 + books/ps/v71complexxmppage.eps | 3500 + books/ps/v71continuedfractionxmppage.eps | 3578 + books/ps/v71decimalexpansionxmppage.eps | 3593 + books/ps/v71doublefloatxmppage.eps | 4004 + books/ps/v71equationpage.eps | 2672 + books/ps/v71examplesexposedpage.eps | 2633 + books/ps/v71factoredfnstwoxmppage.eps | 4628 + books/ps/v71factoredxmppage.eps | 4169 + books/ps/v71feb2005.eps | 2531 + books/ps/v71floatxmppage.eps | 4151 + books/ps/v71foundationlibrarydocpage.eps | 3326 + books/ps/v71fractionpage.eps | 2540 + books/ps/v71functionpage.eps | 3077 + books/ps/v71glossary.eps | 3407 + books/ps/v71graphicspage.eps | 2450 + books/ps/v71hexexpansionxmppage.eps | 3614 + books/ps/v71htxtoppage.eps | 2570 + books/ps/v71integerexamplepage.eps | 2876 + books/ps/v71integerpage.eps | 3518 + books/ps/v71integerproblempage.eps | 1649 + books/ps/v71integerxmppage.eps | 2930 + books/ps/v71intnumbertheoryfnsxmppage.eps | 3665 + books/ps/v71january2008.eps | 2741 + books/ps/v71july2008.eps | 3158 + books/ps/v71linalgpage.eps | 3608 + books/ps/v71man0page.eps | 2918 + books/ps/v71march2008.eps | 3035 + books/ps/v71may2008.eps | 2972 + books/ps/v71november2007.eps | 2975 + books/ps/v71numberpage.eps | 3689 + books/ps/v71octonionxmppage.eps | 3740 + books/ps/v71onlineinformation.eps | 2219 + books/ps/v71partialfractionxmppage.eps | 4058 + books/ps/v71polynomialpage.eps | 2435 + books/ps/v71quaternionxmppage.eps | 3623 + books/ps/v71radixexpansionxmppage.eps | 3635 + books/ps/v71refsearchpage.eps | 2030 + books/ps/v71releasenotes.eps | 2099 + books/ps/v71romannumeralxmppage.eps | 3788 + books/ps/v71rootpage.eps | 2822 + books/ps/v71rootpagelogo.eps | 3071 + books/ps/v71singleintegerxmppage.eps | 4043 + books/ps/v71topexamplepage.eps | 2267 + books/ps/v71topicpage.eps | 2684 + books/ps/v71topreferencepage.eps | 2387 + books/ps/v71topsettingspage.eps | 2330 + books/ps/v71ugavailclefpage.eps | 4313 + books/ps/v71ugintronumberspage.eps | 3500 + books/ps/v71uglangpage.eps | 3203 + books/ps/v71ugproblemfinitepage.eps | 3965 + books/ps/v71ugproblemgaloispage.eps | 4583 + books/ps/v71ugproblemnumericpage.eps | 3863 + books/ps/v71ugsyscmdpage.eps | 3227 + books/ps/v71ugtypesbasicdomainconspage.eps | 3707 + books/ps/v71ugtypesbasicpage.eps | 3863 + books/ps/v71ugtypesconvertpage.eps | 3371 + books/ps/v71ugxfactoredarithpage.eps | 3980 + books/ps/v71ugxfactoreddecomppage.eps | 3764 + books/ps/v71ugxfactoredexpandpage.eps | 1937 + books/ps/v71ugxfactorednewpage.eps | 3647 + books/ps/v71ugxfactoredvarpage.eps | 1985 + books/ps/v71ugxintegerbasicpage.eps | 3146 + books/ps/v71ugxintegerntpage.eps | 3740 + books/ps/v71ugxintegerprimespage.eps | 3779 + books/ps/v71usersguidepage.eps | 4079 + books/ps/v71youtriedit.eps | 1892 + books/ps/vectorroot.ps | 4310 + books/ps/vectorsin.ps | 4310 + books/ps/wd-atanz.ps | 963 + books/ps/wd-bessi.ps | 602 + books/ps/wd-bessi3.ps | 1472 + books/ps/wd-bessi3s.ps | 1048 + books/ps/wd-bessj.ps | 1256 + books/ps/wd-beta.ps | 1420 + books/ps/wd-expz.ps | 818 + books/ps/wd-gammaz.ps | 1079 + books/viewports/3dobjectgraphicspage9.view/data | 226 + .../3dobjectgraphicspage9.view/image.bm.Z | Bin .../3dobjectgraphicspage9.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage1.view/data | 1636 + .../assortedgraphicsexamplepage1.view/image.bm.Z | Bin .../assortedgraphicsexamplepage1.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage2.view/data | 57 + .../assortedgraphicsexamplepage2.view/graph0 | 651 + .../assortedgraphicsexamplepage2.view/image.bm.Z | Bin .../assortedgraphicsexamplepage2.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage3.view/data | 57 + .../assortedgraphicsexamplepage3.view/graph0 | 203 + .../assortedgraphicsexamplepage3.view/image.bm.Z | Bin .../assortedgraphicsexamplepage3.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage4.view/data | 704 + .../assortedgraphicsexamplepage4.view/image.bm.Z | Bin .../assortedgraphicsexamplepage4.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage5.view/data | 57 + .../assortedgraphicsexamplepage5.view/graph0 | 637 + .../assortedgraphicsexamplepage5.view/image.bm.Z | Bin .../assortedgraphicsexamplepage5.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage6.view/data | 57 + .../assortedgraphicsexamplepage6.view/graph0 | 71 + .../assortedgraphicsexamplepage6.view/image.bm.Z | Bin .../assortedgraphicsexamplepage6.view/image.xpm.Z | Bin books/viewports/atanz.view/data | 1636 + books/viewports/atanz.view/image.bm.Z | Bin books/viewports/atanz.view/image.xpm.Z | Bin books/viewports/basic2d.view/data | 57 + books/viewports/basic2d.view/graph0 | 461 + books/viewports/basic2d.view/image.bm.Z | Bin books/viewports/basic2d.view/image.xpm.Z | Bin books/viewports/bessi.view/data | 57 + books/viewports/bessi.view/graph0 | 117 + books/viewports/bessi.view/image.bm.Z | Bin books/viewports/bessi.view/image.xpm.Z | Bin books/viewports/bessi3.view/data | 1636 + books/viewports/bessi3.view/image.bm.Z | Bin books/viewports/bessi3.view/image.xpm.Z | Bin books/viewports/bessj.view/data | 1636 + books/viewports/bessj.view/image.bm.Z | Bin books/viewports/bessj.view/image.xpm.Z | Bin books/viewports/beta.view/data | 1636 + books/viewports/beta.view/image.bm.Z | Bin books/viewports/beta.view/image.xpm.Z | Bin books/viewports/coord1.view/data | 1636 + books/viewports/coord1.view/image.bm.Z | Bin books/viewports/coord1.view/image.xpm.Z | Bin books/viewports/coord2.view/data | 1636 + books/viewports/coord2.view/image.bm.Z | Bin books/viewports/coord2.view/image.xpm.Z | Bin books/viewports/coord3.view/data | 1636 + books/viewports/coord3.view/image.bm.Z | Bin books/viewports/coord3.view/image.xpm.Z | Bin books/viewports/explot2dalgebraic1.view/data | 57 + books/viewports/explot2dalgebraic1.view/graph0 | 71 + books/viewports/explot2dalgebraic1.view/image.bm.Z | Bin .../viewports/explot2dalgebraic1.view/image.xpm.Z | Bin books/viewports/explot2dfunctions1.view/data | 57 + books/viewports/explot2dfunctions1.view/graph0 | 651 + books/viewports/explot2dfunctions1.view/image.bm.Z | Bin .../viewports/explot2dfunctions1.view/image.xpm.Z | Bin books/viewports/explot2dparametric1.view/data | 57 + books/viewports/explot2dparametric1.view/graph0 | 169 + .../viewports/explot2dparametric1.view/image.bm.Z | Bin .../viewports/explot2dparametric1.view/image.xpm.Z | Bin books/viewports/explot2dpolar1.view/data | 57 + books/viewports/explot2dpolar1.view/graph0 | 393 + books/viewports/explot2dpolar1.view/image.bm.Z | Bin books/viewports/explot2dpolar1.view/image.xpm.Z | Bin books/viewports/explot3dfunctions1.view/data | 1636 + books/viewports/explot3dfunctions1.view/image.bm.Z | Bin .../viewports/explot3dfunctions1.view/image.xpm.Z | Bin books/viewports/explot3dparametriccurve1.view/data | 112 + .../explot3dparametriccurve1.view/image.bm.Z | Bin .../explot3dparametriccurve1.view/image.xpm.Z | Bin books/viewports/explot3dparametriccurve2.view/data | 112 + .../explot3dparametriccurve2.view/image.bm.Z | Bin .../explot3dparametriccurve2.view/image.xpm.Z | Bin .../viewports/explot3dparametricsurface1.view/data | 1636 + .../explot3dparametricsurface1.view/image.bm.Z | Bin .../explot3dparametricsurface1.view/image.xpm.Z | Bin .../viewports/explot3dparametricsurface2.view/data | 1636 + .../explot3dparametricsurface2.view/image.bm.Z | Bin .../explot3dparametricsurface2.view/image.xpm.Z | Bin books/viewports/expz.view/data | 1636 + books/viewports/expz.view/image.bm.Z | Bin books/viewports/expz.view/image.xpm.Z | Bin books/viewports/foo2.view/data | 52 + books/viewports/foo2.view/image.xpm.Z | Bin books/viewports/gammaz.view/data | 5316 + books/viewports/gammaz.view/image.bm.Z | Bin books/viewports/gammaz.view/image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage1.view/data | 57 + .../implicitcurvegraphicsexamplepage1.view/graph0 | 108 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage2.view/data | 57 + .../implicitcurvegraphicsexamplepage2.view/graph0 | 71 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage4.view/data | 57 + .../implicitcurvegraphicsexamplepage4.view/graph0 | 112 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage6.view/data | 57 + .../implicitcurvegraphicsexamplepage6.view/graph0 | 108 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../viewports/implicitcurvegraphicspage2.view/data | 57 + .../implicitcurvegraphicspage2.view/graph0 | 112 + .../implicitcurvegraphicspage2.view/image.bm.Z | Bin .../implicitcurvegraphicspage2.view/image.xpm.Z | Bin books/viewports/knot3.view/data |12832 ++ books/viewports/knot3.view/image.bm.Z | Bin books/viewports/knot3.view/image.xpm.Z | Bin .../listpointsgraphicsexamplepage24.view/data | 57 + .../listpointsgraphicsexamplepage24.view/graph0 | 54 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/listpointsgraphicspage24.view/data | 57 + .../viewports/listpointsgraphicspage24.view/graph0 | 54 + .../listpointsgraphicspage24.view/image.bm.Z | Bin .../listpointsgraphicspage24.view/image.xpm.Z | Bin books/viewports/menuexplot2d1.view/data | 57 + books/viewports/menuexplot2d1.view/graph0 | 651 + books/viewports/menuexplot2d1.view/image.bm.Z | Bin books/viewports/menuexplot2d1.view/image.xpm.Z | Bin books/viewports/menuexplot2d2.view/data | 57 + books/viewports/menuexplot2d2.view/graph0 | 169 + books/viewports/menuexplot2d2.view/image.bm.Z | Bin books/viewports/menuexplot2d2.view/image.xpm.Z | Bin books/viewports/menuexplot2d3.view/data | 57 + books/viewports/menuexplot2d3.view/graph0 | 393 + books/viewports/menuexplot2d3.view/image.bm.Z | Bin books/viewports/menuexplot2d3.view/image.xpm.Z | Bin books/viewports/menuexplot2d4.view/data | 57 + books/viewports/menuexplot2d4.view/graph0 | 71 + books/viewports/menuexplot2d4.view/image.bm.Z | Bin books/viewports/menuexplot2d4.view/image.xpm.Z | Bin books/viewports/menuexplot3d1.view/data | 1636 + books/viewports/menuexplot3d1.view/image.bm.Z | Bin books/viewports/menuexplot3d1.view/image.xpm.Z | Bin books/viewports/menuexplot3d2.view/data | 1636 + books/viewports/menuexplot3d2.view/image.bm.Z | Bin books/viewports/menuexplot3d2.view/image.xpm.Z | Bin books/viewports/menuexplot3d3.view/data | 1636 + books/viewports/menuexplot3d3.view/image.bm.Z | Bin books/viewports/menuexplot3d3.view/image.xpm.Z | Bin books/viewports/menuexplot3d4.view/data | 112 + books/viewports/menuexplot3d4.view/image.bm.Z | Bin books/viewports/menuexplot3d4.view/image.xpm.Z | Bin books/viewports/menuexplot3d5.view/data | 112 + books/viewports/menuexplot3d5.view/image.bm.Z | Bin books/viewports/menuexplot3d5.view/image.xpm.Z | Bin books/viewports/mobius.view/data | 1636 + books/viewports/mobius.view/image.bm.Z | Bin books/viewports/mobius.view/image.xpm.Z | Bin .../onevariablegraphicsexamplepage1.view/data | 57 + .../onevariablegraphicsexamplepage1.view/graph0 | 651 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage2.view/data | 57 + .../onevariablegraphicsexamplepage2.view/graph0 | 65 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage3.view/data | 57 + .../onevariablegraphicsexamplepage3.view/graph0 | 697 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage4.view/data | 57 + .../onevariablegraphicsexamplepage4.view/graph0 | 295 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/onevariablegraphicspage1.view/data | 57 + .../viewports/onevariablegraphicspage1.view/graph0 | 651 + .../onevariablegraphicspage1.view/image.bm.Z | Bin .../onevariablegraphicspage1.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage2.view/data | 57 + .../viewports/onevariablegraphicspage2.view/graph0 | 647 + .../onevariablegraphicspage2.view/image.bm.Z | Bin .../onevariablegraphicspage2.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage4.view/data | 57 + .../viewports/onevariablegraphicspage4.view/graph0 | 57 + .../onevariablegraphicspage4.view/image.bm.Z | Bin .../onevariablegraphicspage4.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage5.view/data | 57 + .../viewports/onevariablegraphicspage5.view/graph0 | 57 + .../onevariablegraphicspage5.view/image.bm.Z | Bin .../onevariablegraphicspage5.view/image.xpm.Z | Bin books/viewports/parabola.view/data | 57 + books/viewports/parabola.view/graph0 | 57 + books/viewports/parabola.view/image.bm.Z | Bin books/viewports/parabola.view/image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage1.view/data | 57 + .../graph0 | 89 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage2.view/data | 57 + .../graph0 | 169 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage3.view/data | 57 + .../graph0 | 409 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage4.view/data | 57 + .../graph0 | 393 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicspage1.view/data | 57 + .../parametriccurvegraphicspage1.view/graph0 | 409 + .../parametriccurvegraphicspage1.view/image.bm.Z | Bin .../parametriccurvegraphicspage1.view/image.xpm.Z | Bin .../parametriccurvegraphicspage2.view/data | 57 + .../parametriccurvegraphicspage2.view/graph0 | 57 + .../parametriccurvegraphicspage2.view/image.bm.Z | Bin .../parametriccurvegraphicspage2.view/image.xpm.Z | Bin .../parametriccurvegraphicspage5.view/data | 57 + .../parametriccurvegraphicspage5.view/graph0 | 61 + .../parametriccurvegraphicspage5.view/image.bm.Z | Bin .../parametriccurvegraphicspage5.view/image.xpm.Z | Bin .../parametriccurvegraphicspage6.view/data | 57 + .../parametriccurvegraphicspage6.view/graph0 | 57 + .../parametriccurvegraphicspage6.view/image.bm.Z | Bin .../parametriccurvegraphicspage6.view/image.xpm.Z | Bin .../parametriccurvegraphicspage7.view/data | 57 + .../parametriccurvegraphicspage7.view/graph0 | 169 + .../parametriccurvegraphicspage7.view/image.bm.Z | Bin .../parametriccurvegraphicspage7.view/image.xpm.Z | Bin .../parametricsurfacegraphicspage1.view/data | 1636 + .../parametricsurfacegraphicspage1.view/image.bm.Z | Bin .../image.xpm.Z | Bin .../parametricsurfacegraphicspage5.view/data | 1636 + .../parametricsurfacegraphicspage5.view/image.bm.Z | Bin .../image.xpm.Z | Bin .../parametrictubegraphicspage1.view/data | 8912 + .../parametrictubegraphicspage1.view/image.bm.Z | Bin .../parametrictubegraphicspage1.view/image.xpm.Z | Bin .../parametrictubegraphicspage5.view/data | 2272 + .../parametrictubegraphicspage5.view/image.bm.Z | Bin .../parametrictubegraphicspage5.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage1.view/data | 57 + .../polargraphicsexamplepage1.view/graph0 | 57 + .../polargraphicsexamplepage1.view/image.bm.Z | Bin .../polargraphicsexamplepage1.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage2.view/data | 57 + .../polargraphicsexamplepage2.view/graph0 | 629 + .../polargraphicsexamplepage2.view/image.bm.Z | Bin .../polargraphicsexamplepage2.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage3.view/data | 57 + .../polargraphicsexamplepage3.view/graph0 | 233 + .../polargraphicsexamplepage3.view/image.bm.Z | Bin .../polargraphicsexamplepage3.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage4.view/data | 57 + .../polargraphicsexamplepage4.view/graph0 | 85 + .../polargraphicsexamplepage4.view/image.bm.Z | Bin .../polargraphicsexamplepage4.view/image.xpm.Z | Bin books/viewports/polargraphicspage1.view/data | 57 + books/viewports/polargraphicspage1.view/graph0 | 57 + books/viewports/polargraphicspage1.view/image.bm.Z | Bin .../viewports/polargraphicspage1.view/image.xpm.Z | Bin books/viewports/polargraphicspage2.view/data | 57 + books/viewports/polargraphicspage2.view/graph0 | 637 + books/viewports/polargraphicspage2.view/image.bm.Z | Bin .../viewports/polargraphicspage2.view/image.xpm.Z | Bin books/viewports/polargraphicspage4.view/data | 57 + books/viewports/polargraphicspage4.view/graph0 | 75 + books/viewports/polargraphicspage4.view/image.bm.Z | Bin .../viewports/polargraphicspage4.view/image.xpm.Z | Bin books/viewports/polargraphicspage5.view/data | 57 + books/viewports/polargraphicspage5.view/graph0 | 393 + books/viewports/polargraphicspage5.view/image.bm.Z | Bin .../viewports/polargraphicspage5.view/image.xpm.Z | Bin books/viewports/saddle.view/data | 1636 + books/viewports/saddle.view/image.bm.Z | Bin books/viewports/saddle.view/image.xpm.Z | Bin books/viewports/segmentbindingxmppage3.view/data | 57 + books/viewports/segmentbindingxmppage3.view/graph0 | 57 + .../segmentbindingxmppage3.view/image.bm.Z | Bin .../segmentbindingxmppage3.view/image.xpm.Z | Bin books/viewports/spacecurvegraphicspage1.view/data | 208 + .../spacecurvegraphicspage1.view/image.bm.Z | Bin .../spacecurvegraphicspage1.view/image.xpm.Z | Bin books/viewports/spacecurvegraphicspage5.view/data | 904 + .../spacecurvegraphicspage5.view/image.bm.Z | Bin .../spacecurvegraphicspage5.view/image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage1.view/data | 1636 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../data | 5316 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage2.view/data | 3456 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage6.view/data | 3456 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/twovariablegraphicspage1.view/data | 1636 + .../twovariablegraphicspage1.view/image.bm.Z | Bin .../twovariablegraphicspage1.view/image.xpm.Z | Bin books/viewports/twovariablegraphicspage3.view/data | 1636 + .../twovariablegraphicspage3.view/image.bm.Z | Bin .../twovariablegraphicspage3.view/image.xpm.Z | Bin books/viewports/uggraphclippage2.view/data | 5316 + books/viewports/uggraphclippage2.view/image.bm.Z | Bin books/viewports/uggraphclippage2.view/image.xpm.Z | Bin books/viewports/uggraphcolorpage1.view/data | 57 + books/viewports/uggraphcolorpage1.view/graph0 | 57 + books/viewports/uggraphcolorpage1.view/image.bm.Z | Bin books/viewports/uggraphcolorpage1.view/image.xpm.Z | Bin books/viewports/uggraphcolorpage2.view/data | 57 + books/viewports/uggraphcolorpage2.view/graph0 | 57 + books/viewports/uggraphcolorpage2.view/image.bm.Z | Bin books/viewports/uggraphcolorpage2.view/image.xpm.Z | Bin books/viewports/uggraphcolorpalettepage5.view/data | 57 + .../viewports/uggraphcolorpalettepage5.view/graph0 | 57 + .../uggraphcolorpalettepage5.view/image.bm.Z | Bin .../uggraphcolorpalettepage5.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage13.view/data | 1636 + books/viewports/uggraphcoordpage13.view/image.bm.Z | Bin .../viewports/uggraphcoordpage13.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage2.view/data | 1636 + books/viewports/uggraphcoordpage2.view/image.bm.Z | Bin books/viewports/uggraphcoordpage2.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage4.view/data | 1636 + books/viewports/uggraphcoordpage4.view/image.bm.Z | Bin books/viewports/uggraphcoordpage4.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage6.view/data | 1636 + books/viewports/uggraphcoordpage6.view/image.bm.Z | Bin books/viewports/uggraphcoordpage6.view/image.xpm.Z | Bin books/viewports/uggraphmakeobjectpage4.view/data | 2618 + .../uggraphmakeobjectpage4.view/image.bm.Z | Bin .../uggraphmakeobjectpage4.view/image.xpm.Z | Bin books/viewports/uggraphthreedbuildpage10.view/data | 232 + .../uggraphthreedbuildpage10.view/image.bm.Z | Bin .../uggraphthreedbuildpage10.view/image.xpm.Z | Bin books/viewports/uggraphthreedbuildpage28.view/data | 94 + .../uggraphthreedbuildpage28.view/image.bm.Z | Bin .../uggraphthreedbuildpage28.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage1.view/data | 1636 + .../uggraphthreedoptionspage1.view/image.bm.Z | Bin .../uggraphthreedoptionspage1.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage10.view/data | 1636 + .../uggraphthreedoptionspage10.view/image.bm.Z | Bin .../uggraphthreedoptionspage10.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage11.view/data | 992 + .../uggraphthreedoptionspage11.view/image.bm.Z | Bin .../uggraphthreedoptionspage11.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage12.view/data | 502 + .../uggraphthreedoptionspage12.view/image.bm.Z | Bin .../uggraphthreedoptionspage12.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage13.view/data | 1996 + .../uggraphthreedoptionspage13.view/image.bm.Z | Bin .../uggraphthreedoptionspage13.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage16.view/data | 1636 + .../uggraphthreedoptionspage16.view/image.bm.Z | Bin .../uggraphthreedoptionspage16.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage17.view/data | 2618 + .../uggraphthreedoptionspage17.view/image.bm.Z | Bin .../uggraphthreedoptionspage17.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage2.view/data | 1636 + .../uggraphthreedoptionspage2.view/image.bm.Z | Bin .../uggraphthreedoptionspage2.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage20.view/data | 2618 + .../uggraphthreedoptionspage20.view/image.bm.Z | Bin .../uggraphthreedoptionspage20.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage4.view/data | 992 + .../uggraphthreedoptionspage4.view/image.bm.Z | Bin .../uggraphthreedopt... [truncated message content] |
|
From: <gi...@ax...> - 2008-08-22 04:02:56
|
CHANGELOG | 1047 - FAQ | 1592 - Makefile | 12 +- Makefile.pamphlet | 656 +- README | 528 - axiomicon.png | Bin axiomlogo.jpg | Bin axiomsml.png | Bin books/Makefile.pamphlet | 196 + books/axbook.tgz | Bin books/bitmaps/ai.bitmap | 7 + books/bitmaps/al.bitmap | 9 + books/bitmaps/aleph.bitmap | 8 + books/bitmaps/alpha.bitmap | 8 + books/bitmaps/alpha.xbm | 7 + books/bitmaps/alphaj.bitmap | 9 + books/bitmaps/angle.bitmap | 6 + books/bitmaps/anna.xbm.tiny | 12 + books/bitmaps/anna_logo.xbm | 165 + books/bitmaps/atxequalb.bitmap | 21 + books/bitmaps/axiom.xbm | 1049 + books/bitmaps/axiom1.bitmap | 287 + books/bitmaps/back.bitmap | 23 + books/bitmaps/backslash.bitmap | 6 + books/bitmaps/beta.bitmap | 8 + books/bitmaps/beta.xbm | 7 + books/bitmaps/betaj.bitmap | 9 + books/bitmaps/bot.bitmap | 6 + books/bitmaps/bullet.bitmap | 8 + books/bitmaps/c02aff.bitmap | 53 + books/bitmaps/c1.bitmap | 9 + books/bitmaps/chi.bitmap | 8 + books/bitmaps/ci.bitmap | 7 + books/bitmaps/clear.bitmap | 8 + books/bitmaps/clearall.bitmap | 11 + books/bitmaps/clicktoset.bitmap | 78 + books/bitmaps/continue.bitmap | 41 + books/bitmaps/ctb.bitmap | 13 + books/bitmaps/d01aqf.xbm | 71 + books/bitmaps/d01fcf.bitmap | 353 + books/bitmaps/d01gaf1.bitmap | 47 + books/bitmaps/d01gaf2.bitmap | 48 + books/bitmaps/d02gaf.bitmap | 39 + books/bitmaps/d03edf.bitmap | 1253 + books/bitmaps/d03edf1.bitmap | 320 + books/bitmaps/d03eef.bitmap | 528 + books/bitmaps/d03eef.xbm | 537 + books/bitmaps/d03eef1.bitmap | 162 + books/bitmaps/d03eef2.bitmap | 97 + books/bitmaps/d03faf.bitmap | 201 + books/bitmaps/d03faf.xbm | 185 + books/bitmaps/del.bitmap | 6 + books/bitmaps/delta-cap.bitmap | 8 + books/bitmaps/delta.bitmap | 8 + books/bitmaps/delta.xbm | 7 + books/bitmaps/div.bitmap | 6 + books/bitmaps/doit.bitmap | 23 + books/bitmaps/door | 20 + books/bitmaps/door.bitmap | 23 + books/bitmaps/dot.bitmap | 8 + books/bitmaps/down.bitmap | 23 + books/bitmaps/down3.bitmap | 23 + books/bitmaps/dr.bitmap | 6 + books/bitmaps/drown.bm | 23 + books/bitmaps/e01baf.bitmap | 47 + books/bitmaps/e01baf1.bitmap | 26 + books/bitmaps/e01bef.bitmap | 31 + books/bitmaps/e01daf.bitmap | 35 + books/bitmaps/e01daf1.bitmap | 83 + books/bitmaps/e02adf.bitmap | 253 + books/bitmaps/e02adf1.bitmap | 173 + books/bitmaps/e02aef.bitmap | 117 + books/bitmaps/e02agf.bitmap | 51 + books/bitmaps/e02agf1.bitmap | 103 + books/bitmaps/e02ahf.bitmap | 110 + books/bitmaps/e02ahf1.bitmap | 100 + books/bitmaps/e02ajf.bitmap | 94 + books/bitmaps/e02baf.bitmap | 76 + books/bitmaps/e02bdf.bitmap | 25 + books/bitmaps/e02bef.bitmap | 68 + books/bitmaps/e02daf.bitmap | 260 + books/bitmaps/e02daf1.bitmap | 56 + books/bitmaps/e04fdf.bitmap | 173 + books/bitmaps/e04fdf1.bitmap | 63 + books/bitmaps/e04mbf.bitmap | 212 + books/bitmaps/e04naf.bitmap | 303 + books/bitmaps/e04ucf.bitmap | 363 + books/bitmaps/ell.bitmap | 8 + books/bitmaps/emptyset.bitmap | 8 + books/bitmaps/ep1.bitmap | 6 + books/bitmaps/ep2.bitmap | 6 + books/bitmaps/epi.bitmap | 6 + books/bitmaps/epp.bitmap | 6 + books/bitmaps/epsilon.bitmap | 8 + books/bitmaps/epsilon.xbm | 7 + books/bitmaps/eqpage.bitmap | 23 + books/bitmaps/erase.bitmap | 6 + books/bitmaps/error.bitmap | 6 + books/bitmaps/eta.bitmap | 6 + books/bitmaps/exists.bitmap | 8 + books/bitmaps/exit.bitmap | 25 + books/bitmaps/exit3d.bitmap | 23 + books/bitmaps/exit3d_old.bitmap | 23 + books/bitmaps/exit3di.bitmap | 23 + books/bitmaps/f01qcf.bitmap | 76 + books/bitmaps/f01qcf1.bitmap | 99 + books/bitmaps/f01qcf2.bitmap | 39 + books/bitmaps/f01qcf3.bitmap | 65 + books/bitmaps/f01qdf.bitmap | 13 + books/bitmaps/f01qdf1.bitmap | 33 + books/bitmaps/f01qdf2.bitmap | 9 + books/bitmaps/f01rdf.bitmap | 13 + books/bitmaps/f01rdf1.bitmap | 33 + books/bitmaps/f01rdf2.bitmap | 34 + books/bitmaps/fi.bitmap | 6 + books/bitmaps/forall.bitmap | 8 + books/bitmaps/fqr.bitmap | 9 + books/bitmaps/fr.bitmap | 8 + books/bitmaps/gamma-cap.bitmap | 8 + books/bitmaps/gamma.bitmap | 6 + books/bitmaps/gamma.xbm | 7 + books/bitmaps/gammacomplex.png | Bin books/bitmaps/gammacomplexinverse.png | Bin books/bitmaps/gammak.bitmap | 7 + books/bitmaps/gammareal3.png | Bin books/bitmaps/gi.bitmap | 6 + books/bitmaps/great=.bitmap | 8 + books/bitmaps/hbar.bitmap | 8 + books/bitmaps/help.bitmap | 23 + books/bitmaps/help2.bakmap | 23 + books/bitmaps/help2.bitmap | 25 + books/bitmaps/help3.bitmap | 23 + books/bitmaps/help3d.bitmap | 23 + books/bitmaps/help3d_old.bitmap | 23 + books/bitmaps/help3di.bitmap | 23 + books/bitmaps/home3d.bitmap | 23 + books/bitmaps/home3d_old.bitmap | 23 + books/bitmaps/home3di.bitmap | 23 + books/bitmaps/im-cap.bitmap | 6 + books/bitmaps/imath.bitmap | 8 + books/bitmaps/infty.bitmap | 8 + books/bitmaps/infty.xbm | 6 + books/bitmaps/ing.bitmap | 9 + books/bitmaps/ing1.bitmap | 11 + books/bitmaps/ing2.bitmap | 25 + books/bitmaps/int.bitmap | 8 + books/bitmaps/int1.xbm | 78 + books/bitmaps/int10.xbm | 64 + books/bitmaps/int11.xbm | 191 + books/bitmaps/int12.xbm | 127 + books/bitmaps/int13.xbm | 49 + books/bitmaps/int2.xbm | 49 + books/bitmaps/int3.xbm | 82 + books/bitmaps/int4.xbm | 60 + books/bitmaps/int5.xbm | 110 + books/bitmaps/int6.xbm | 98 + books/bitmaps/int7.xbm | 104 + books/bitmaps/int8.xbm | 91 + books/bitmaps/int9.xbm | 91 + books/bitmaps/integral.bitmap | 8 + books/bitmaps/integral.bm | 8 + books/bitmaps/iota.bitmap | 8 + books/bitmaps/jmath.bitmap | 6 + books/bitmaps/kappa.bitmap | 8 + books/bitmaps/l1.bitmap | 9 + books/bitmaps/lambda-cap.bitmap | 8 + books/bitmaps/lambda.bitmap | 8 + books/bitmaps/lamdab.bitmap | 6 + books/bitmaps/lamdai.bitmap | 7 + books/bitmaps/lamdaj.bitmap | 9 + books/bitmaps/ldlt.bitmap | 14 + books/bitmaps/less=.bitmap | 8 + books/bitmaps/lj.bitmap | 6 + books/bitmaps/llt.bitmap | 13 + books/bitmaps/loggamma.png | Bin books/bitmaps/lt.bitmap | 9 + books/bitmaps/mask.bitmap | 8 + books/bitmaps/menudot.bitmap | 6 + books/bitmaps/mkm.bitmap | 17 + books/bitmaps/mu.bitmap | 6 + books/bitmaps/mui.bitmap | 7 + books/bitmaps/muj.bitmap | 7 + books/bitmaps/mx.bitmap | 9 + books/bitmaps/my.bitmap | 9 + books/bitmaps/nabla.bitmap | 6 + books/bitmaps/naglogo.bitmap | 475 + books/bitmaps/ncap.bitmap | 6 + books/bitmaps/neg.bitmap | 6 + books/bitmaps/newrho.bitmap | 6 + books/bitmaps/nl.bitmap | 7 + books/bitmaps/nn.bitmap | 9 + books/bitmaps/noop.bitmap | 25 + books/bitmaps/noop3d.bitmap | 23 + books/bitmaps/not=.bitmap | 8 + books/bitmaps/notequal.bitmap | 6 + books/bitmaps/notequal.xbm | 6 + books/bitmaps/nu.bitmap | 8 + books/bitmaps/nx.bitmap | 9 + books/bitmaps/ny.bitmap | 9 + books/bitmaps/ode1.xbm | 273 + books/bitmaps/ode2.xbm | 300 + books/bitmaps/ode3.xbm | 97 + books/bitmaps/omega-cap.bitmap | 8 + books/bitmaps/omega.bitmap | 8 + books/bitmaps/omicron.bitmap | 8 + books/bitmaps/opt1.xbm | 73 + books/bitmaps/opt2.xbm | 117 + books/bitmaps/opt2c.xbm | 146 + books/bitmaps/opt3.xbm | 51 + books/bitmaps/opt3c1.xbm | 107 + books/bitmaps/opt3c2.xbm | 212 + books/bitmaps/opt4.xbm | 95 + books/bitmaps/opt4c1.xbm | 317 + books/bitmaps/opt4c2.xbm | 75 + books/bitmaps/opt4c3.xbm | 1151 + books/bitmaps/opt5.xbm | 245 + books/bitmaps/opt61.xbm | 298 + books/bitmaps/opt62.xbm | 313 + books/bitmaps/opt63.xbm | 315 + books/bitmaps/parallel.bitmap | 6 + books/bitmaps/partial.bitmap | 8 + books/bitmaps/pelzel.bitmap | 13 + books/bitmaps/phi-cap.bitmap | 8 + books/bitmaps/phi.bitmap | 8 + books/bitmaps/phi.xbm | 7 + books/bitmaps/pi-cap.bitmap | 8 + books/bitmaps/pi.bitmap | 8 + books/bitmaps/pi.xbm | 6 + books/bitmaps/pick.bitmap | 6 + books/bitmaps/pick_old.bitmap | 6 + books/bitmaps/plusminus.xbm | 6 + books/bitmaps/prime.bitmap | 6 + books/bitmaps/prod.bitmap | 6 + books/bitmaps/psi-cap.bitmap | 8 + books/bitmaps/psi.bitmap | 8 + books/bitmaps/psi.png | Bin books/bitmaps/psi.xbm | 7 + books/bitmaps/px.bitmap | 9 + books/bitmaps/py.bitmap | 9 + books/bitmaps/quad.bitmap | 6 + books/bitmaps/quit.bitmap | 15 + books/bitmaps/re-cap.bitmap | 8 + books/bitmaps/return.bitmap | 23 + books/bitmaps/return2.bitmap | 23 + books/bitmaps/return3.bitmap | 25 + books/bitmaps/rho.bitmap | 8 + books/bitmaps/rho=r.bitmap | 12 + books/bitmaps/rhosq=.bitmap | 37 + books/bitmaps/s13aaf.bitmap | 67 + books/bitmaps/s13aaf1.bitmap | 74 + books/bitmaps/s13aaf2.bitmap | 15 + books/bitmaps/s13acf.bitmap | 111 + books/bitmaps/s13adf.bitmap | 77 + books/bitmaps/s14baf.bitmap | 213 + books/bitmaps/s15adf.bitmap | 75 + books/bitmaps/s15aef.bitmap | 65 + books/bitmaps/s17acf.bitmap | 13 + books/bitmaps/s17adf.bitmap | 13 + books/bitmaps/s17aef.bitmap | 13 + books/bitmaps/s17aef1.bitmap | 13 + books/bitmaps/s17aff.bitmap | 13 + books/bitmaps/s17aff1.bitmap | 13 + books/bitmaps/s17dcf.bitmap | 17 + books/bitmaps/s17def.bitmap | 17 + books/bitmaps/s17dlf.bitmap | 31 + books/bitmaps/s17dlf1.bitmap | 28 + books/bitmaps/s17dlf2.bitmap | 28 + books/bitmaps/s18acf.bitmap | 28 + books/bitmaps/s18acf1.bitmap | 14 + books/bitmaps/s18adf.bitmap | 28 + books/bitmaps/s18adf1.bitmap | 14 + books/bitmaps/s18aef.bitmap | 23 + books/bitmaps/s18aef1.bitmap | 13 + books/bitmaps/s18aff.bitmap | 23 + books/bitmaps/s18aff1.bitmap | 13 + books/bitmaps/s18dcf.bitmap | 18 + books/bitmaps/s18def.bitmap | 17 + books/bitmaps/s21baf.bitmap | 170 + books/bitmaps/s21baf.bitmap.wrong | 132 + books/bitmaps/s21baf1.bitmap | 24 + books/bitmaps/s21baf1.bitmap.wrong | 27 + books/bitmaps/s21bbf.bitmap | 161 + books/bitmaps/s21bbf1.bitmap | 50 + books/bitmaps/s21bcf.bitmap | 183 + books/bitmaps/s21bcf1.bitmap | 44 + books/bitmaps/s21bdf.bitmap | 208 + books/bitmaps/s21bdf1.bitmap | 60 + books/bitmaps/sdown.bitmap | 9 + books/bitmaps/sdown.bm | 9 + books/bitmaps/sdown3d.bitmap | 9 + books/bitmaps/sdown3dpr.bitmap | 9 + books/bitmaps/si-integral.bitmap | 19 + books/bitmaps/sigma-cap.bitmap | 8 + books/bitmaps/sigma.bitmap | 8 + books/bitmaps/smile.bitmap | 15 + books/bitmaps/source.bitmap | 8 + books/bitmaps/subtwo.bitmap | 8 + books/bitmaps/sum.bitmap | 6 + books/bitmaps/sum.bm | 8 + books/bitmaps/sup.bitmap | 9 + books/bitmaps/sup.bm | 9 + books/bitmaps/sup3d.bitmap | 9 + books/bitmaps/sup3dpr.bitmap | 9 + books/bitmaps/surd.bitmap | 8 + books/bitmaps/tau.bitmap | 8 + books/bitmaps/tear.bitmap | 23 + books/bitmaps/theta-cap.bitmap | 8 + books/bitmaps/theta.bitmap | 8 + books/bitmaps/top.bitmap | 6 + books/bitmaps/triangle.bitmap | 6 + books/bitmaps/uij.bitmap | 9 + books/bitmaps/uj.bitmap | 7 + books/bitmaps/unpick.bitmap | 6 + books/bitmaps/unpick_old.bitmap | 6 + books/bitmaps/up.bitmap | 23 + books/bitmaps/up2.bitmap | 23 + books/bitmaps/up3.bitmap | 23 + books/bitmaps/up3d.bitmap | 23 + books/bitmaps/up3di.bitmap | 23 + books/bitmaps/updots.bitmap | 23 + books/bitmaps/upsilon-cap.bitmap | 8 + books/bitmaps/upsilon.bitmap | 8 + books/bitmaps/wr.bitmap | 9 + books/bitmaps/x1.xbm | 24 + books/bitmaps/xbar.bitmap | 6 + books/bitmaps/xdesp.bitmap | 6 + books/bitmaps/xe.xbm | 14 + books/bitmaps/xfbox.bitmap | 6 + books/bitmaps/xfcirc.bitmap | 6 + books/bitmaps/xfullbox.bitmap | 6 + books/bitmaps/xfullcirc.bitmap | 6 + books/bitmaps/xfullfbox.bitmap | 6 + books/bitmaps/xfullfcirc.bitmap | 6 + books/bitmaps/xgreybox.bitmap | 6 + books/bitmaps/xgreycirc.bitmap | 6 + books/bitmaps/xgreyfbox.bitmap | 6 + books/bitmaps/xgreyfcirc.bitmap | 6 + books/bitmaps/xhappy.bitmap | 6 + books/bitmaps/xi-cap.bitmap | 8 + books/bitmaps/xi.bitmap | 6 + books/bitmaps/xii.bitmap | 6 + books/bitmaps/xiii.bitmap | 6 + books/bitmaps/xj.bitmap | 8 + books/bitmaps/xmax.bitmap | 11 + books/bitmaps/xmin.bitmap | 11 + books/bitmaps/xnobox.bitmap | 6 + books/bitmaps/xnocirc.bitmap | 6 + books/bitmaps/xnoface.bitmap | 6 + books/bitmaps/xopenbox.bitmap | 6 + books/bitmaps/xopencirc.bitmap | 6 + books/bitmaps/xopenfbox.bitmap | 6 + books/bitmaps/xopenfcirc.bitmap | 6 + books/bitmaps/xperv.bitmap | 6 + books/bitmaps/xq.bitmap | 9 + books/bitmaps/xr.bitmap | 7 + books/bitmaps/xs.xbm | 18 + books/bitmaps/xsad.bitmap | 6 + books/bitmaps/xtickbox.bitmap | 6 + books/bitmaps/xtickcirc.bitmap | 6 + books/bitmaps/xtickfbox.bitmap | 6 + books/bitmaps/xtickfcirc.bitmap | 6 + books/bitmaps/xxbox.bitmap | 6 + books/bitmaps/xxcirc.bitmap | 6 + books/bitmaps/xxfbox.bitmap | 6 + books/bitmaps/xxfcirc.bitmap | 6 + books/bitmaps/y1.xbm | 83 + books/bitmaps/y2.xbm | 99 + books/bitmaps/y3.xbm | 62 + books/bitmaps/ye.xbm | 15 + books/bitmaps/yi.bitmap | 6 + books/bitmaps/yr.bitmap | 7 + books/bitmaps/ys.xbm | 16 + books/bitmaps/zeta.bitmap | 6 + books/bitmaps/zetak.bitmap | 9 + books/bitmaps/zk.bitmap | 9 + books/bookvol0.pamphlet |67730 +++++++ books/bookvol1.pamphlet |14842 ++ books/bookvol10.pamphlet | 2159 + books/bookvol11.pamphlet |50515 ++++++ books/bookvol12.pamphlet | 493 + books/bookvol2.pamphlet | 343 + books/bookvol3.pamphlet | 343 + books/bookvol4.pamphlet | 4434 + books/bookvol5.pamphlet | 6150 + books/bookvol6.pamphlet | 7301 + books/bookvol7.1.pamphlet |188318 ++++++++++++++++++++ books/bookvol7.pamphlet |20699 +++ books/bookvol8.pamphlet |20260 +++ books/bookvol9.pamphlet | 343 + books/ps/23dcola.ps | 347 + books/ps/23dcolb.ps | 347 + books/ps/23dpal.ps | 347 + books/ps/2d1vara.ps | 1535 + books/ps/2d1varb.ps | 1527 + books/ps/2d1vard.ps | 414 + books/ps/2dctrl.ps | 722 + books/ps/2doptad.ps | 347 + books/ps/2doptcp.ps | 551 + books/ps/2doptcpr.ps | 434 + books/ps/2doptcvc.ps | 363 + books/ps/2doptplr.ps | 795 + books/ps/2doptptc.ps | 363 + books/ps/2doptrga.ps | 433 + books/ps/2doptrgb.ps | 420 + books/ps/2doptsc.ps | 436 + books/ps/2doptut.ps | 644 + books/ps/2dpaca.ps | 525 + books/ps/2dppca.ps | 1051 + books/ps/2dppcb.ps | 414 + books/ps/2dppcc.ps | 424 + books/ps/2dppce.ps | 571 + books/ps/3d2vara.ps |16338 ++ books/ps/3d2varb.ps |16338 ++ books/ps/3dbuilda.ps | 444 + books/ps/3dbuildb.ps | 444 + books/ps/3dctrl.ps | 770 + books/ps/3dgamma11.ps |52320 ++++++ books/ps/3dlight.ps | 647 + books/ps/3dmult1a.ps |16041 ++ books/ps/3dmult1b.ps |24489 +++ books/ps/3doptcf1.ps |14580 ++ books/ps/3doptcf2.ps | 9024 + books/ps/3doptcf3.ps | 9024 + books/ps/3doptcrd.ps |16041 ++ books/ps/3doptpts.ps | 3468 + books/ps/3doptrad.ps | 8748 + books/ps/3doptsty.ps | 1761 + books/ps/3doptttl.ps | 1023 + books/ps/3doptvb.ps |20100 +++ books/ps/3dpsa.ps |15744 ++ books/ps/3dpsb.ps |16338 ++ books/ps/3dpsca.ps | 446 + books/ps/3dpscb.ps | 1142 + books/ps/3dvolume.ps | 682 + books/ps/CRCp27-2.1.1.ps | 1736 + books/ps/arrow.ps | 260 + books/ps/arrowr.ps | 260 + books/ps/atan-1.epsi | 1261 + books/ps/atan-1.ps |16391 ++ books/ps/axiomfront.ps | 1091 + books/ps/basic2d.ps | 1375 + books/ps/bessel.ps |35500 ++++ books/ps/bessintr.epsi | 2027 + books/ps/bessintr.ps |16338 ++ books/ps/bigbayou.png | Bin books/ps/bluebayou.ps | 4214 + books/ps/bookvol1a.ps | 1335 + books/ps/bookvol1b.ps | 2060 + books/ps/bookvol1c.ps | 856 + books/ps/bookvol1d.ps | 4299 + books/ps/bookvol1e.ps | 710 + books/ps/bookvol1f.ps | 878 + books/ps/bookvol1g.ps | 638 + books/ps/bookvol1h.ps | 1475 + books/ps/bookvol1i.ps | 638 + books/ps/bookvol1j.ps | 512 + books/ps/bookvol1k.ps | 398 + books/ps/bookvol1l.ps | 398 + books/ps/bookvol1m.ps | 1013 + books/ps/bookvol1n.ps | 638 + books/ps/bookvol1o.ps | 806 + books/ps/bookvol1p.ps | 774 + books/ps/bookvol1q.ps | 1292 + books/ps/bouquet.ps | 326 + books/ps/cartcoord.ps |16338 ++ books/ps/clipgamma.ps |55300 ++++++ books/ps/compatan.ps |16338 ++ books/ps/compexp.ps |16338 ++ books/ps/compgamm.ps |18791 ++ books/ps/complexexp.ps |14050 ++ books/ps/complexroot.ps |14050 ++ books/ps/cylcoord.ps |16338 ++ books/ps/defcoord.ps |16338 ++ books/ps/doctitle.png | Bin books/ps/exit.ps | 386 + books/ps/h-alldoms.ps | 1367 + books/ps/h-allrank.ps | 1565 + books/ps/h-atsearch.ps | 1208 + books/ps/h-brfront.ps | 1074 + books/ps/h-browse.ps | 799 + books/ps/h-comsearch.ps | 1480 + books/ps/h-condition.ps | 950 + books/ps/h-consearch.ps | 1145 + books/ps/h-consearch2.ps | 1392 + books/ps/h-crossref.ps | 819 + books/ps/h-docsearch.ps | 1260 + books/ps/h-gensearch.ps | 1138 + books/ps/h-inverse.ps | 822 + books/ps/h-matargs.ps | 1337 + books/ps/h-matats.ps | 860 + books/ps/h-matdesc.ps | 1041 + books/ps/h-matexamp.ps | 1074 + books/ps/h-matexports.ps | 911 + books/ps/h-matimp.ps | 1404 + books/ps/h-matinv.ps | 1248 + books/ps/h-matmap.ps | 1430 + books/ps/h-matops.ps | 1332 + books/ps/h-matpage.ps | 1357 + books/ps/h-matrelops.ps | 1146 + books/ps/h-matrix.ps | 871 + books/ps/h-matrixops.ps | 1114 + books/ps/h-matrixops1.ps | 871 + books/ps/h-matrixops2.ps | 871 + books/ps/h-matsource.ps | 1390 + books/ps/h-matusers.ps | 997 + books/ps/h-matxref.ps | 1248 + books/ps/h-opsearch.ps | 852 + books/ps/h-origins.ps | 926 + books/ps/h-parameter.ps | 926 + books/ps/h-root.ps | 1335 + books/ps/h-signature.ps | 816 + books/ps/help.ps | 387 + books/ps/home.ps | 389 + books/ps/knot3.ps |77023 ++++++++ books/ps/modbess.ps | 534 + books/ps/modbessc.ps |16338 ++ books/ps/newmap.ps |16041 ++ books/ps/p28a.eps | 1461 + books/ps/p28b.eps | 4299 + books/ps/quat1.ps | 1199 + books/ps/quat10.ps | 1933 + books/ps/quat11.ps | 2386 + books/ps/quat12.ps | 1422 + books/ps/quat13.ps | 837 + books/ps/quat14.ps | 2255 + books/ps/quat15.ps | 812 + books/ps/quat16.ps | 1267 + books/ps/quat17.ps | 1104 + books/ps/quat18.ps | 3925 + books/ps/quat19.ps | 1192 + books/ps/quat2.ps | 1217 + books/ps/quat3.ps | 1753 + books/ps/quat4.ps | 1944 + books/ps/quat5.ps | 1877 + books/ps/quat6.ps | 1262 + books/ps/quat7.ps | 688 + books/ps/quat8.ps | 1142 + books/ps/quat9.ps | 1282 + books/ps/realbeta.ps |23818 +++ books/ps/ribbon1.ps | 1900 + books/ps/ribbon2.ps | 418 + books/ps/ribbon2r.ps | 418 + books/ps/ribbons.ps | 560 + books/ps/ribbons2.ps | 1488 + books/ps/ribbons2b.ps | 1516 + books/ps/ribbons5.ps | 3298 + books/ps/rose-1.ps | 1230 + books/ps/torusknot.ps | 4808 + books/ps/up.ps | 382 + books/ps/v71algebrapage.eps | 2228 + books/ps/v71basiccommand.eps | 2264 + books/ps/v71binaryexpansionxmppage.eps | 3611 + books/ps/v71calculus.eps | 2087 + books/ps/v71calculuspage.eps | 2645 + books/ps/v71cardinalnumberxmppage.eps | 3449 + books/ps/v71complexxmppage.eps | 3500 + books/ps/v71continuedfractionxmppage.eps | 3578 + books/ps/v71decimalexpansionxmppage.eps | 3593 + books/ps/v71doublefloatxmppage.eps | 4004 + books/ps/v71equationpage.eps | 2672 + books/ps/v71examplesexposedpage.eps | 2633 + books/ps/v71factoredfnstwoxmppage.eps | 4628 + books/ps/v71factoredxmppage.eps | 4169 + books/ps/v71feb2005.eps | 2531 + books/ps/v71floatxmppage.eps | 4151 + books/ps/v71foundationlibrarydocpage.eps | 3326 + books/ps/v71fractionpage.eps | 2540 + books/ps/v71functionpage.eps | 3077 + books/ps/v71glossary.eps | 3407 + books/ps/v71graphicspage.eps | 2450 + books/ps/v71hexexpansionxmppage.eps | 3614 + books/ps/v71htxtoppage.eps | 2570 + books/ps/v71integerexamplepage.eps | 2876 + books/ps/v71integerpage.eps | 3518 + books/ps/v71integerproblempage.eps | 1649 + books/ps/v71integerxmppage.eps | 2930 + books/ps/v71intnumbertheoryfnsxmppage.eps | 3665 + books/ps/v71january2008.eps | 2741 + books/ps/v71july2008.eps | 3158 + books/ps/v71linalgpage.eps | 3608 + books/ps/v71man0page.eps | 2918 + books/ps/v71march2008.eps | 3035 + books/ps/v71may2008.eps | 2972 + books/ps/v71november2007.eps | 2975 + books/ps/v71numberpage.eps | 3689 + books/ps/v71octonionxmppage.eps | 3740 + books/ps/v71onlineinformation.eps | 2219 + books/ps/v71partialfractionxmppage.eps | 4058 + books/ps/v71polynomialpage.eps | 2435 + books/ps/v71quaternionxmppage.eps | 3623 + books/ps/v71radixexpansionxmppage.eps | 3635 + books/ps/v71refsearchpage.eps | 2030 + books/ps/v71releasenotes.eps | 2099 + books/ps/v71romannumeralxmppage.eps | 3788 + books/ps/v71rootpage.eps | 2822 + books/ps/v71rootpagelogo.eps | 3071 + books/ps/v71singleintegerxmppage.eps | 4043 + books/ps/v71topexamplepage.eps | 2267 + books/ps/v71topicpage.eps | 2684 + books/ps/v71topreferencepage.eps | 2387 + books/ps/v71topsettingspage.eps | 2330 + books/ps/v71ugavailclefpage.eps | 4313 + books/ps/v71ugintronumberspage.eps | 3500 + books/ps/v71uglangpage.eps | 3203 + books/ps/v71ugproblemfinitepage.eps | 3965 + books/ps/v71ugproblemgaloispage.eps | 4583 + books/ps/v71ugproblemnumericpage.eps | 3863 + books/ps/v71ugsyscmdpage.eps | 3227 + books/ps/v71ugtypesbasicdomainconspage.eps | 3707 + books/ps/v71ugtypesbasicpage.eps | 3863 + books/ps/v71ugtypesconvertpage.eps | 3371 + books/ps/v71ugxfactoredarithpage.eps | 3980 + books/ps/v71ugxfactoreddecomppage.eps | 3764 + books/ps/v71ugxfactoredexpandpage.eps | 1937 + books/ps/v71ugxfactorednewpage.eps | 3647 + books/ps/v71ugxfactoredvarpage.eps | 1985 + books/ps/v71ugxintegerbasicpage.eps | 3146 + books/ps/v71ugxintegerntpage.eps | 3740 + books/ps/v71ugxintegerprimespage.eps | 3779 + books/ps/v71usersguidepage.eps | 4079 + books/ps/v71youtriedit.eps | 1892 + books/ps/vectorroot.ps | 4310 + books/ps/vectorsin.ps | 4310 + books/ps/wd-atanz.ps | 963 + books/ps/wd-bessi.ps | 602 + books/ps/wd-bessi3.ps | 1472 + books/ps/wd-bessi3s.ps | 1048 + books/ps/wd-bessj.ps | 1256 + books/ps/wd-beta.ps | 1420 + books/ps/wd-expz.ps | 818 + books/ps/wd-gammaz.ps | 1079 + books/viewports/3dobjectgraphicspage9.view/data | 226 + .../3dobjectgraphicspage9.view/image.bm.Z | Bin .../3dobjectgraphicspage9.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage1.view/data | 1636 + .../assortedgraphicsexamplepage1.view/image.bm.Z | Bin .../assortedgraphicsexamplepage1.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage2.view/data | 57 + .../assortedgraphicsexamplepage2.view/graph0 | 651 + .../assortedgraphicsexamplepage2.view/image.bm.Z | Bin .../assortedgraphicsexamplepage2.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage3.view/data | 57 + .../assortedgraphicsexamplepage3.view/graph0 | 203 + .../assortedgraphicsexamplepage3.view/image.bm.Z | Bin .../assortedgraphicsexamplepage3.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage4.view/data | 704 + .../assortedgraphicsexamplepage4.view/image.bm.Z | Bin .../assortedgraphicsexamplepage4.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage5.view/data | 57 + .../assortedgraphicsexamplepage5.view/graph0 | 637 + .../assortedgraphicsexamplepage5.view/image.bm.Z | Bin .../assortedgraphicsexamplepage5.view/image.xpm.Z | Bin .../assortedgraphicsexamplepage6.view/data | 57 + .../assortedgraphicsexamplepage6.view/graph0 | 71 + .../assortedgraphicsexamplepage6.view/image.bm.Z | Bin .../assortedgraphicsexamplepage6.view/image.xpm.Z | Bin books/viewports/atanz.view/data | 1636 + books/viewports/atanz.view/image.bm.Z | Bin books/viewports/atanz.view/image.xpm.Z | Bin books/viewports/basic2d.view/data | 57 + books/viewports/basic2d.view/graph0 | 461 + books/viewports/basic2d.view/image.bm.Z | Bin books/viewports/basic2d.view/image.xpm.Z | Bin books/viewports/bessi.view/data | 57 + books/viewports/bessi.view/graph0 | 117 + books/viewports/bessi.view/image.bm.Z | Bin books/viewports/bessi.view/image.xpm.Z | Bin books/viewports/bessi3.view/data | 1636 + books/viewports/bessi3.view/image.bm.Z | Bin books/viewports/bessi3.view/image.xpm.Z | Bin books/viewports/bessj.view/data | 1636 + books/viewports/bessj.view/image.bm.Z | Bin books/viewports/bessj.view/image.xpm.Z | Bin books/viewports/beta.view/data | 1636 + books/viewports/beta.view/image.bm.Z | Bin books/viewports/beta.view/image.xpm.Z | Bin books/viewports/coord1.view/data | 1636 + books/viewports/coord1.view/image.bm.Z | Bin books/viewports/coord1.view/image.xpm.Z | Bin books/viewports/coord2.view/data | 1636 + books/viewports/coord2.view/image.bm.Z | Bin books/viewports/coord2.view/image.xpm.Z | Bin books/viewports/coord3.view/data | 1636 + books/viewports/coord3.view/image.bm.Z | Bin books/viewports/coord3.view/image.xpm.Z | Bin books/viewports/explot2dalgebraic1.view/data | 57 + books/viewports/explot2dalgebraic1.view/graph0 | 71 + books/viewports/explot2dalgebraic1.view/image.bm.Z | Bin .../viewports/explot2dalgebraic1.view/image.xpm.Z | Bin books/viewports/explot2dfunctions1.view/data | 57 + books/viewports/explot2dfunctions1.view/graph0 | 651 + books/viewports/explot2dfunctions1.view/image.bm.Z | Bin .../viewports/explot2dfunctions1.view/image.xpm.Z | Bin books/viewports/explot2dparametric1.view/data | 57 + books/viewports/explot2dparametric1.view/graph0 | 169 + .../viewports/explot2dparametric1.view/image.bm.Z | Bin .../viewports/explot2dparametric1.view/image.xpm.Z | Bin books/viewports/explot2dpolar1.view/data | 57 + books/viewports/explot2dpolar1.view/graph0 | 393 + books/viewports/explot2dpolar1.view/image.bm.Z | Bin books/viewports/explot2dpolar1.view/image.xpm.Z | Bin books/viewports/explot3dfunctions1.view/data | 1636 + books/viewports/explot3dfunctions1.view/image.bm.Z | Bin .../viewports/explot3dfunctions1.view/image.xpm.Z | Bin books/viewports/explot3dparametriccurve1.view/data | 112 + .../explot3dparametriccurve1.view/image.bm.Z | Bin .../explot3dparametriccurve1.view/image.xpm.Z | Bin books/viewports/explot3dparametriccurve2.view/data | 112 + .../explot3dparametriccurve2.view/image.bm.Z | Bin .../explot3dparametriccurve2.view/image.xpm.Z | Bin .../viewports/explot3dparametricsurface1.view/data | 1636 + .../explot3dparametricsurface1.view/image.bm.Z | Bin .../explot3dparametricsurface1.view/image.xpm.Z | Bin .../viewports/explot3dparametricsurface2.view/data | 1636 + .../explot3dparametricsurface2.view/image.bm.Z | Bin .../explot3dparametricsurface2.view/image.xpm.Z | Bin books/viewports/expz.view/data | 1636 + books/viewports/expz.view/image.bm.Z | Bin books/viewports/expz.view/image.xpm.Z | Bin books/viewports/foo2.view/data | 52 + books/viewports/foo2.view/image.xpm.Z | Bin books/viewports/gammaz.view/data | 5316 + books/viewports/gammaz.view/image.bm.Z | Bin books/viewports/gammaz.view/image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage1.view/data | 57 + .../implicitcurvegraphicsexamplepage1.view/graph0 | 108 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage2.view/data | 57 + .../implicitcurvegraphicsexamplepage2.view/graph0 | 71 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage4.view/data | 57 + .../implicitcurvegraphicsexamplepage4.view/graph0 | 112 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../implicitcurvegraphicsexamplepage6.view/data | 57 + .../implicitcurvegraphicsexamplepage6.view/graph0 | 108 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../viewports/implicitcurvegraphicspage2.view/data | 57 + .../implicitcurvegraphicspage2.view/graph0 | 112 + .../implicitcurvegraphicspage2.view/image.bm.Z | Bin .../implicitcurvegraphicspage2.view/image.xpm.Z | Bin books/viewports/knot3.view/data |12832 ++ books/viewports/knot3.view/image.bm.Z | Bin books/viewports/knot3.view/image.xpm.Z | Bin .../listpointsgraphicsexamplepage24.view/data | 57 + .../listpointsgraphicsexamplepage24.view/graph0 | 54 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/listpointsgraphicspage24.view/data | 57 + .../viewports/listpointsgraphicspage24.view/graph0 | 54 + .../listpointsgraphicspage24.view/image.bm.Z | Bin .../listpointsgraphicspage24.view/image.xpm.Z | Bin books/viewports/menuexplot2d1.view/data | 57 + books/viewports/menuexplot2d1.view/graph0 | 651 + books/viewports/menuexplot2d1.view/image.bm.Z | Bin books/viewports/menuexplot2d1.view/image.xpm.Z | Bin books/viewports/menuexplot2d2.view/data | 57 + books/viewports/menuexplot2d2.view/graph0 | 169 + books/viewports/menuexplot2d2.view/image.bm.Z | Bin books/viewports/menuexplot2d2.view/image.xpm.Z | Bin books/viewports/menuexplot2d3.view/data | 57 + books/viewports/menuexplot2d3.view/graph0 | 393 + books/viewports/menuexplot2d3.view/image.bm.Z | Bin books/viewports/menuexplot2d3.view/image.xpm.Z | Bin books/viewports/menuexplot2d4.view/data | 57 + books/viewports/menuexplot2d4.view/graph0 | 71 + books/viewports/menuexplot2d4.view/image.bm.Z | Bin books/viewports/menuexplot2d4.view/image.xpm.Z | Bin books/viewports/menuexplot3d1.view/data | 1636 + books/viewports/menuexplot3d1.view/image.bm.Z | Bin books/viewports/menuexplot3d1.view/image.xpm.Z | Bin books/viewports/menuexplot3d2.view/data | 1636 + books/viewports/menuexplot3d2.view/image.bm.Z | Bin books/viewports/menuexplot3d2.view/image.xpm.Z | Bin books/viewports/menuexplot3d3.view/data | 1636 + books/viewports/menuexplot3d3.view/image.bm.Z | Bin books/viewports/menuexplot3d3.view/image.xpm.Z | Bin books/viewports/menuexplot3d4.view/data | 112 + books/viewports/menuexplot3d4.view/image.bm.Z | Bin books/viewports/menuexplot3d4.view/image.xpm.Z | Bin books/viewports/menuexplot3d5.view/data | 112 + books/viewports/menuexplot3d5.view/image.bm.Z | Bin books/viewports/menuexplot3d5.view/image.xpm.Z | Bin books/viewports/mobius.view/data | 1636 + books/viewports/mobius.view/image.bm.Z | Bin books/viewports/mobius.view/image.xpm.Z | Bin .../onevariablegraphicsexamplepage1.view/data | 57 + .../onevariablegraphicsexamplepage1.view/graph0 | 651 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage2.view/data | 57 + .../onevariablegraphicsexamplepage2.view/graph0 | 65 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage3.view/data | 57 + .../onevariablegraphicsexamplepage3.view/graph0 | 697 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../onevariablegraphicsexamplepage4.view/data | 57 + .../onevariablegraphicsexamplepage4.view/graph0 | 295 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/onevariablegraphicspage1.view/data | 57 + .../viewports/onevariablegraphicspage1.view/graph0 | 651 + .../onevariablegraphicspage1.view/image.bm.Z | Bin .../onevariablegraphicspage1.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage2.view/data | 57 + .../viewports/onevariablegraphicspage2.view/graph0 | 647 + .../onevariablegraphicspage2.view/image.bm.Z | Bin .../onevariablegraphicspage2.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage4.view/data | 57 + .../viewports/onevariablegraphicspage4.view/graph0 | 57 + .../onevariablegraphicspage4.view/image.bm.Z | Bin .../onevariablegraphicspage4.view/image.xpm.Z | Bin books/viewports/onevariablegraphicspage5.view/data | 57 + .../viewports/onevariablegraphicspage5.view/graph0 | 57 + .../onevariablegraphicspage5.view/image.bm.Z | Bin .../onevariablegraphicspage5.view/image.xpm.Z | Bin books/viewports/parabola.view/data | 57 + books/viewports/parabola.view/graph0 | 57 + books/viewports/parabola.view/image.bm.Z | Bin books/viewports/parabola.view/image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage1.view/data | 57 + .../graph0 | 89 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage2.view/data | 57 + .../graph0 | 169 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage3.view/data | 57 + .../graph0 | 409 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicsexamplepage4.view/data | 57 + .../graph0 | 393 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../parametriccurvegraphicspage1.view/data | 57 + .../parametriccurvegraphicspage1.view/graph0 | 409 + .../parametriccurvegraphicspage1.view/image.bm.Z | Bin .../parametriccurvegraphicspage1.view/image.xpm.Z | Bin .../parametriccurvegraphicspage2.view/data | 57 + .../parametriccurvegraphicspage2.view/graph0 | 57 + .../parametriccurvegraphicspage2.view/image.bm.Z | Bin .../parametriccurvegraphicspage2.view/image.xpm.Z | Bin .../parametriccurvegraphicspage5.view/data | 57 + .../parametriccurvegraphicspage5.view/graph0 | 61 + .../parametriccurvegraphicspage5.view/image.bm.Z | Bin .../parametriccurvegraphicspage5.view/image.xpm.Z | Bin .../parametriccurvegraphicspage6.view/data | 57 + .../parametriccurvegraphicspage6.view/graph0 | 57 + .../parametriccurvegraphicspage6.view/image.bm.Z | Bin .../parametriccurvegraphicspage6.view/image.xpm.Z | Bin .../parametriccurvegraphicspage7.view/data | 57 + .../parametriccurvegraphicspage7.view/graph0 | 169 + .../parametriccurvegraphicspage7.view/image.bm.Z | Bin .../parametriccurvegraphicspage7.view/image.xpm.Z | Bin .../parametricsurfacegraphicspage1.view/data | 1636 + .../parametricsurfacegraphicspage1.view/image.bm.Z | Bin .../image.xpm.Z | Bin .../parametricsurfacegraphicspage5.view/data | 1636 + .../parametricsurfacegraphicspage5.view/image.bm.Z | Bin .../image.xpm.Z | Bin .../parametrictubegraphicspage1.view/data | 8912 + .../parametrictubegraphicspage1.view/image.bm.Z | Bin .../parametrictubegraphicspage1.view/image.xpm.Z | Bin .../parametrictubegraphicspage5.view/data | 2272 + .../parametrictubegraphicspage5.view/image.bm.Z | Bin .../parametrictubegraphicspage5.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage1.view/data | 57 + .../polargraphicsexamplepage1.view/graph0 | 57 + .../polargraphicsexamplepage1.view/image.bm.Z | Bin .../polargraphicsexamplepage1.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage2.view/data | 57 + .../polargraphicsexamplepage2.view/graph0 | 629 + .../polargraphicsexamplepage2.view/image.bm.Z | Bin .../polargraphicsexamplepage2.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage3.view/data | 57 + .../polargraphicsexamplepage3.view/graph0 | 233 + .../polargraphicsexamplepage3.view/image.bm.Z | Bin .../polargraphicsexamplepage3.view/image.xpm.Z | Bin .../viewports/polargraphicsexamplepage4.view/data | 57 + .../polargraphicsexamplepage4.view/graph0 | 85 + .../polargraphicsexamplepage4.view/image.bm.Z | Bin .../polargraphicsexamplepage4.view/image.xpm.Z | Bin books/viewports/polargraphicspage1.view/data | 57 + books/viewports/polargraphicspage1.view/graph0 | 57 + books/viewports/polargraphicspage1.view/image.bm.Z | Bin .../viewports/polargraphicspage1.view/image.xpm.Z | Bin books/viewports/polargraphicspage2.view/data | 57 + books/viewports/polargraphicspage2.view/graph0 | 637 + books/viewports/polargraphicspage2.view/image.bm.Z | Bin .../viewports/polargraphicspage2.view/image.xpm.Z | Bin books/viewports/polargraphicspage4.view/data | 57 + books/viewports/polargraphicspage4.view/graph0 | 75 + books/viewports/polargraphicspage4.view/image.bm.Z | Bin .../viewports/polargraphicspage4.view/image.xpm.Z | Bin books/viewports/polargraphicspage5.view/data | 57 + books/viewports/polargraphicspage5.view/graph0 | 393 + books/viewports/polargraphicspage5.view/image.bm.Z | Bin .../viewports/polargraphicspage5.view/image.xpm.Z | Bin books/viewports/saddle.view/data | 1636 + books/viewports/saddle.view/image.bm.Z | Bin books/viewports/saddle.view/image.xpm.Z | Bin books/viewports/segmentbindingxmppage3.view/data | 57 + books/viewports/segmentbindingxmppage3.view/graph0 | 57 + .../segmentbindingxmppage3.view/image.bm.Z | Bin .../segmentbindingxmppage3.view/image.xpm.Z | Bin books/viewports/spacecurvegraphicspage1.view/data | 208 + .../spacecurvegraphicspage1.view/image.bm.Z | Bin .../spacecurvegraphicspage1.view/image.xpm.Z | Bin books/viewports/spacecurvegraphicspage5.view/data | 904 + .../spacecurvegraphicspage5.view/image.bm.Z | Bin .../spacecurvegraphicspage5.view/image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage1.view/data | 1636 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../data | 5316 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage2.view/data | 3456 + .../image.bm.Z | Bin .../image.xpm.Z | Bin .../threedimensionalgraphicsexamplepage6.view/data | 3456 + .../image.bm.Z | Bin .../image.xpm.Z | Bin books/viewports/twovariablegraphicspage1.view/data | 1636 + .../twovariablegraphicspage1.view/image.bm.Z | Bin .../twovariablegraphicspage1.view/image.xpm.Z | Bin books/viewports/twovariablegraphicspage3.view/data | 1636 + .../twovariablegraphicspage3.view/image.bm.Z | Bin .../twovariablegraphicspage3.view/image.xpm.Z | Bin books/viewports/uggraphclippage2.view/data | 5316 + books/viewports/uggraphclippage2.view/image.bm.Z | Bin books/viewports/uggraphclippage2.view/image.xpm.Z | Bin books/viewports/uggraphcolorpage1.view/data | 57 + books/viewports/uggraphcolorpage1.view/graph0 | 57 + books/viewports/uggraphcolorpage1.view/image.bm.Z | Bin books/viewports/uggraphcolorpage1.view/image.xpm.Z | Bin books/viewports/uggraphcolorpage2.view/data | 57 + books/viewports/uggraphcolorpage2.view/graph0 | 57 + books/viewports/uggraphcolorpage2.view/image.bm.Z | Bin books/viewports/uggraphcolorpage2.view/image.xpm.Z | Bin books/viewports/uggraphcolorpalettepage5.view/data | 57 + .../viewports/uggraphcolorpalettepage5.view/graph0 | 57 + .../uggraphcolorpalettepage5.view/image.bm.Z | Bin .../uggraphcolorpalettepage5.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage13.view/data | 1636 + books/viewports/uggraphcoordpage13.view/image.bm.Z | Bin .../viewports/uggraphcoordpage13.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage2.view/data | 1636 + books/viewports/uggraphcoordpage2.view/image.bm.Z | Bin books/viewports/uggraphcoordpage2.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage4.view/data | 1636 + books/viewports/uggraphcoordpage4.view/image.bm.Z | Bin books/viewports/uggraphcoordpage4.view/image.xpm.Z | Bin books/viewports/uggraphcoordpage6.view/data | 1636 + books/viewports/uggraphcoordpage6.view/image.bm.Z | Bin books/viewports/uggraphcoordpage6.view/image.xpm.Z | Bin books/viewports/uggraphmakeobjectpage4.view/data | 2618 + .../uggraphmakeobjectpage4.view/image.bm.Z | Bin .../uggraphmakeobjectpage4.view/image.xpm.Z | Bin books/viewports/uggraphthreedbuildpage10.view/data | 232 + .../uggraphthreedbuildpage10.view/image.bm.Z | Bin .../uggraphthreedbuildpage10.view/image.xpm.Z | Bin books/viewports/uggraphthreedbuildpage28.view/data | 94 + .../uggraphthreedbuildpage28.view/image.bm.Z | Bin .../uggraphthreedbuildpage28.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage1.view/data | 1636 + .../uggraphthreedoptionspage1.view/image.bm.Z | Bin .../uggraphthreedoptionspage1.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage10.view/data | 1636 + .../uggraphthreedoptionspage10.view/image.bm.Z | Bin .../uggraphthreedoptionspage10.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage11.view/data | 992 + .../uggraphthreedoptionspage11.view/image.bm.Z | Bin .../uggraphthreedoptionspage11.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage12.view/data | 502 + .../uggraphthreedoptionspage12.view/image.bm.Z | Bin .../uggraphthreedoptionspage12.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage13.view/data | 1996 + .../uggraphthreedoptionspage13.view/image.bm.Z | Bin .../uggraphthreedoptionspage13.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage16.view/data | 1636 + .../uggraphthreedoptionspage16.view/image.bm.Z | Bin .../uggraphthreedoptionspage16.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage17.view/data | 2618 + .../uggraphthreedoptionspage17.view/image.bm.Z | Bin .../uggraphthreedoptionspage17.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage2.view/data | 1636 + .../uggraphthreedoptionspage2.view/image.bm.Z | Bin .../uggraphthreedoptionspage2.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage20.view/data | 2618 + .../uggraphthreedoptionspage20.view/image.bm.Z | Bin .../uggraphthreedoptionspage20.view/image.xpm.Z | Bin .../viewports/uggraphthreedoptionspage4.view/data | 992 + .../uggraphthreedoptionspage4.view/image.bm.Z | Bin .../uggraphthreedopt... [truncated message content] |
|
From: <da...@us...> - 2008-08-20 21:18:50
|
Revision: 951
http://axiom.svn.sourceforge.net/axiom/?rev=951&view=rev
Author: daly
Date: 2008-08-20 21:18:59 +0000 (Wed, 20 Aug 2008)
Log Message:
-----------
20080820 tpd src/input/test.input fix typos
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/input/test.input.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-19 23:17:00 UTC (rev 950)
+++ trunk/axiom/changelog 2008-08-20 21:18:59 UTC (rev 951)
@@ -1,5 +1,8 @@
+20080820 tpd src/input/test.input fix typos
20080819 tpd src/input/Makefile overload.input added
20080819 dxc src/input/overload.input added
+20080819 tpd src/input/Makefile overload.input added
+20080819 dxc src/input/overload.input added
20080818 tpd src/input/Makefile biquat.input added
20080818 dxc src/input/biquat.input added
20080818 dxc "David Cyganski" (no known email)
Modified: trunk/axiom/src/input/test.input.pamphlet
===================================================================
--- trunk/axiom/src/input/test.input.pamphlet 2008-08-19 23:17:00 UTC (rev 950)
+++ trunk/axiom/src/input/test.input.pamphlet 2008-08-20 21:18:59 UTC (rev 951)
@@ -484,7 +484,6 @@
<<*>>=
)clear all
-@
--S 35
{}$(List INT)
--R
@@ -1608,7 +1607,7 @@
--E 121
@
-Complex & AlgebraicNumber coercions. fixed by SCM 6/91
+Complex \& AlgebraicNumber coercions. fixed by SCM 6/91
<<*>>=
)clear all
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <gi...@ax...> - 2008-08-20 21:17:08
|
changelog | 3 +++
src/input/test.input.pamphlet | 3 +--
2 files changed, 4 insertions(+), 2 deletions(-)
New commits:
commit adeb80a1df45836f57c45988420abce4b3b10a31
Author: Tim Daly <da...@ax...>
Date: Thu Jul 10 04:53:25 2008 -0400
20080820 tpd src/input/test.input fix typos
|
|
From: <da...@us...> - 2008-08-19 23:16:51
|
Revision: 950
http://axiom.svn.sourceforge.net/axiom/?rev=950&view=rev
Author: daly
Date: 2008-08-19 23:17:00 +0000 (Tue, 19 Aug 2008)
Log Message:
-----------
20080818 tpd src/input/Makefile biquat.input added
20080818 dxc src/input/biquat.input added
20080818 dxc "David Cyganski" (no known email)
20080818 tpd src/input/Makefile ifthenelse.input added
20080818 fxs src/input/ifthenelse.input added
20080818 tpd src/interp/setq.lisp add Fabio Stumbo
20080818 tpd readme add Fabio Stumbo
20080818 fxs "Fabio Stumbo" (no known email)
20080818 tpd src/input/Makefile sqrt3.input added
20080818 rhx src/input/sqrt3.input added
Modified Paths:
--------------
trunk/axiom/changelog
trunk/axiom/src/input/Makefile.pamphlet
Added Paths:
-----------
trunk/axiom/src/input/overload.input.pamphlet
Modified: trunk/axiom/changelog
===================================================================
--- trunk/axiom/changelog 2008-08-19 05:36:56 UTC (rev 949)
+++ trunk/axiom/changelog 2008-08-19 23:17:00 UTC (rev 950)
@@ -1,3 +1,5 @@
+20080819 tpd src/input/Makefile overload.input added
+20080819 dxc src/input/overload.input added
20080818 tpd src/input/Makefile biquat.input added
20080818 dxc src/input/biquat.input added
20080818 dxc "David Cyganski" (no known email)
Modified: trunk/axiom/src/input/Makefile.pamphlet
===================================================================
--- trunk/axiom/src/input/Makefile.pamphlet 2008-08-19 05:36:56 UTC (rev 949)
+++ trunk/axiom/src/input/Makefile.pamphlet 2008-08-19 23:17:00 UTC (rev 950)
@@ -341,6 +341,7 @@
nqip.regress nsfip.regress numbers.regress octonion.regress \
oct.regress ode.regress odpol.regress op1.regress \
opalg.regress operator.regress op.regress ovar.regress \
+ overload.regress \
padic.regress parabola.regress pascal1.regress pascal.regress \
patch51.regress page.regress \
patmatch.regress pat.regress perman.regress perm.regress \
@@ -613,10 +614,10 @@
${OUT}/nepip.input ${OUT}/newton.input \
${OUT}/nlode.input ${OUT}/none.input ${OUT}/noonburg.input \
${OUT}/noptip.input ${OUT}/nqip.input ${OUT}/nsfip.input \
- ${OUT}/ntube.input ${OUT}/oct.input ${OUT}/ode.input \
+ ${OUT}/ntube.input ${OUT}/oct.input ${OUT}/ode.input \
${OUT}/octonion.input ${OUT}/odpol.input \
${OUT}/opalg.input ${OUT}/operator.input ${OUT}/op.input \
- ${OUT}/op1.input ${OUT}/ovar.input \
+ ${OUT}/op1.input ${OUT}/ovar.input ${OUT}/overload.input \
${OUT}/padic.input ${OUT}/palette.input \
${OUT}/parpcurv.input ${OUT}/parscurv.input ${OUT}/parsurf.input \
${OUT}/pascal1.input \
@@ -927,6 +928,7 @@
${DOC}/odpol.input.dvi ${DOC}/op1.input.dvi \
${DOC}/opalg.input.dvi ${DOC}/operator.input.dvi \
${DOC}/op.input.dvi ${DOC}/ovar.input.dvi \
+ ${DOC}/overload.input.dvi \
${DOC}/padic.input.dvi ${DOC}/palette.input.dvi \
${DOC}/parabola.input.dvi ${DOC}/parpcurv.input.dvi \
${DOC}/parscurv.input.dvi ${DOC}/parsurf.input.dvi \
Added: trunk/axiom/src/input/overload.input.pamphlet
===================================================================
--- trunk/axiom/src/input/overload.input.pamphlet (rev 0)
+++ trunk/axiom/src/input/overload.input.pamphlet 2008-08-19 23:17:00 UTC (rev 950)
@@ -0,0 +1,680 @@
+\documentclass{article}
+\usepackage{axiom}
+\begin{document}
+\title{\$SPAD/src/input overload.input}
+\author{David Cyganski}
+\maketitle
+\begin{abstract}
+Type conversion and overload problems
+\end{abstract}
+\eject
+\tableofcontents
+\eject
+<<*>>=
+)spool overload.output
+)set message test on
+)set message auto off
+)clear all
+@
+\section{Type Conversion and Overload problems}
+Several non-intuitive problems with overloading and type conversions
+arose while developing the biquaternion (see biquat.input) support
+function collection. I have extracted the minimum code set to illustrate
+each of these problems.
+
+\section{Implicit and Explicit Type Conversions}
+We begin by illustrating function calling with variously typed
+arguments and conversion which we will break in various ways, some
+understandable, some not(?), below.
+
+The cos function will produce float outcomes for float arguments
+<<*>>=
+
+--S 1 of 28
+cos(1.237)
+--R
+--R
+--R (1) 0.3276321705 9891498386
+--R Type: Float
+--E 1
+
+@
+can handle expressions that mix floats and integers
+<<*>>=
+
+--S 2 of 28
+cos(1.237/2)
+--R
+--R
+--R (2) 0.8147490934 6341557739
+--R Type: Float
+--E 2
+
+@
+but will respect an integer expression, as we would want it to,
+by not evaluating
+<<*>>=
+
+--S 3 of 28
+cos(2/3)
+--R
+--R
+--R 2
+--R (3) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 3
+
+@
+We can coerce the evaluation as a float by forcing the floating point
+evaluation of the division and typing of the outcome in a variety of
+ways. Each of the following forms is effective in some appropriate
+and understandable way. Some act explicitly on the ``/'' operator
+to force a polymorphic choice, others convert the type of the second
+constand in each expression which results in a proper implicit selection
+of which ``/'' definitition to use.
+<<*>>=
+
+--S 4 of 28
+cos(2/3::Float)
+--R
+--R
+--R (4) 0.7858872607 7694800072
+--R Type: Float
+--E 4
+
+--S 5 of 28
+cos((2/3)::Float)
+--R
+--R
+--R (5) 0.7858872607 7694800072
+--R Type: Float
+--E 5
+
+--S 6 of 28
+cos(2/3$Float)
+--R
+--R
+--R (6) 0.7858872607 7694800072
+--R Type: Float
+--E 6
+
+--S 7 of 28
+cos((2/3)$Float)
+--R
+--R
+--R (7) 0.7858872607 7694800072
+--R Type: Float
+--E 7
+
+--S 8 of 28
+cos(2/3@Float)
+--R
+--R
+--R (8) 0.7858872607 7694800072
+--R Type: Float
+--E 8
+
+--S 9 of 28
+cos((2/3)@Float)
+--R
+--R
+--R (9) 0.7858872607 7694800072
+--R Type: Float
+--E 9
+
+@
+But, as we would expect, it is too late to attempt coercion after the
+fact. Coercion operates ``on the surface and not deeply'' as illustrated
+here.
+<<*>>=
+
+--S 10 of 28
+cos(2/3)::Float
+--R
+--R
+--RDaly Bug
+--R Cannot convert from type Expression Integer to Float for value
+--R 2
+--R cos(-)
+--R 3
+--R
+--E 10
+
+@
+However, there is a real need for a deep coercion operator that operates
+on the innermost atomic constants. Suppose we define
+<<*>>=
+
+--S 11 of 28
+cosf(x:Expression Integer):Expression Integer == 1+cos(x/2)
+--R
+--R Function declaration cosf : Expression Integer -> Expression Integer
+--R has been added to workspace.
+--R Type: Void
+--E 11
+
+@
+which is an example of a simple function that might be defined in the
+course of typical work. We wish to declare functions as having integer
+based fractions, rather than forming approximate decimal expansions, which
+is preferred for purposes of analytic examination and simplification for
+both the human and the Axiom system. The Axiom book and online resources
+are full of examples in which this choice has been made by the authors
+thanks to the power of this form of expression -- even though it amounts
+to lying to Axiom in many cases as to the ultimate destiny of the function
+being defined. But woe to us if we wish later to evaluate it in a more
+general way because it is a tangled web we weave when we practice to
+decieve.
+<<*>>=
+
+--S 12 of 28
+cosf(2/3)
+--R
+--R Compiling function cosf with type Expression Integer -> Expression
+--R Integer
+--R
+--R 1
+--R (11) cos(-) + 1
+--R 3
+--R Type: Expression Integer
+--E 12
+
+--S 13 of 28
+cosf((2/3)::Float)
+--R
+--R Conversion failed in the compiled user function cosf .
+--R
+--RDaly Bug
+--R Cannot convert from type Float to Expression Integer for value
+--R 0.6666666666 6666666667
+--R
+--E 13
+
+@
+Thus in effect once we wrap a function around an integer base definition,
+we are stuck and unable to evaluate it as a float later, unlike the core
+basic functions that can be used either way. This forces us to choose the
+Float type throughout at a loss of comprehensibility and analyzability,
+unless we seek to more than double our development type by supplying an
+overloaded integer base and Float base version of {\bf every} step of a
+sequential development of a formula.
+
+Bizarrely, the draw function seems to have the power to override the
+type problem as shown here
+<<*>>=
+
+--S 14 of 28
+--draw(cosf(x),x=0..15)
+--E 14
+
+@
+Why can't we grant this deep coercion power to some new form of floating
+point conversion operation which can be applied at will? If draw has
+this power, why not put it in the hands of the user?
+
+Alternatively, it would be best to have a {\bf mixed} type -- mixed
+= Integer/Float. Like Maple expressions it would leave integers as
+integers and floats as floats, unmolested and treated as generic
+constant quantities with distinguishable parts until an {\bf evalf}
+like function that would force them entirely into the Float type. For
+example, in Maple ``cos(2/3)+1.2323'' remains as is, while in Axiom
+we get
+<<*>>=
+
+--S 15 of 28
+cos(2/3)+1.2323
+--R
+--R
+--R (12) 2.0181872607 769480007
+--R Type: Expression Float
+--E 15
+
+@
+In a way, Axiom already has a quantity treated like this -- the constant
+%pi is treated as a special float which remains unevaluated and does not
+force combination of itself with an Integer. It simply results in a new
+kind of Integer evaluation of type Pi
+<<*>>=
+
+--S 16 of 28
+3/4+%pi
+--R
+--R
+--R 4%pi + 3
+--R (13) --------
+--R 4
+--R Type: Pi
+--E 16
+
+@
+\section{Overloading problems}
+Now let's examine properties and problems with overloading.
+
+Define the type $Q$ of Hamiltonian biquaternions
+<<*>>=
+
+--S 17 of 28
+C:=Complex Expression Integer
+--R
+--R
+--R (14) Complex Expression Integer
+--R Type: Domain
+--E 17
+
+--S 18 of 28
+Q:=Quaternion C
+--R
+--R
+--R (15) Quaternion Complex Expression Integer
+--R Type: Domain
+--E 18
+
+@
+While developing the support functions, this definition of biquat
+division was introduced to simplify the format of the formulae
+<<*>>=
+
+--S 19 of 28
+((x:Q)/(y:Q)):Q == x*inv(y)
+--R
+--R Function declaration ?/? : (Quaternion Complex Expression Integer,
+--R Quaternion Complex Expression Integer) -> Quaternion Complex
+--R Expression Integer has been added to workspace.
+--R Type: Void
+--E 19
+
+@
+But is this typed function in any way actually restricted to quaternions?
+On the face, it would appear all is normal, here's an example of
+integer division
+<<*>>=
+
+--S 20 of 28
+x:=15/6
+--R
+--R Compiling function / with type (Quaternion Complex Expression
+--R Integer,Quaternion Complex Expression Integer) -> Quaternion
+--R Complex Expression Integer
+--R
+--R 5
+--R (17) -
+--R 2
+--R Type: Quaternion Complex Expression Integer
+--E 20
+
+@
+But though the answer was right, the type is now a biquat. If we don't
+notice this, and proceed, some things seem still to act normally,
+for example, no complaint from Axiom with
+<<*>>=
+
+--S 21 of 28
+cos(x)
+--R
+--R
+--R 5
+--R (18) cos(-)
+--R 2
+--R Type: Expression Integer
+--E 21
+
+@
+Of course, we still get a correct answer with
+<<*>>=
+
+--S 22 of 28
+cos(1.237)
+--R
+--R
+--R (19) 0.3276321705 9891498386
+--R Type: Float
+--E 22
+
+@
+But let's try to apply this as a simple mixed float/integer function
+<<*>>=
+
+--S 23 of 28
+cos(15.457/6)
+--R
+--R Conversion failed in the compiled user function / .
+--R
+--RDaly Bug
+--R Cannot convert from type Float to Quaternion Complex Expression
+--R Integer for value
+--R 15.457
+--R
+--E 23
+
+@
+Obviously the quaternion version of ``/'' is being invoked despite
+mismatches of the arguments and the supposed overloading in effect.
+Well, what if we built a new cosine function that forced the form of
+the arguments into certain types to avoid mismatch?
+<<*>>=
+
+--S 24 of 28
+c(y:Float):Float == cos(y)
+--R
+--R Function declaration c : Float -> Float has been added to workspace.
+--R Type: Void
+--E 24
+
+@
+At first this seems to work, we can still evaluate a float
+<<*>>=
+
+--S 25 of 28
+c(1.237)
+--R
+--R Compiling function c with type Float -> Float
+--R
+--R (21) 0.3276321705 9891498386
+--R Type: Float
+--E 25
+
+@
+and we can even get a float answer when we introduce the integer coercible
+biquat variable value generated from the above.
+<<*>>=
+
+--S 26 of 28
+c(x)
+--R
+--R
+--R (22) - 0.8011436155 4693371483
+--R Type: Float
+--E 26
+
+@
+But that was only misdirection, because this breaks down for reasonable
+expressions because of the ``/'' operation still not being resolved
+correctly.
+<<*>>=
+
+--S 27 of 28
+c(1.237/2)
+--R
+--R Conversion failed in the compiled user function / .
+--R
+--RDaly Bug
+--R Cannot convert from type Float to Quaternion Complex Expression
+--R Integer for value
+--R 1.237
+--R
+--E 27
+
+@
+Rather than complaining about it, what if we tried the various coercions
+that served to solve the similar type conversion problem we had when
+just dealing with Integer Fraction versus Floats at the top of the page.
+Our results are mixed. Recall that each of the following worked in the
+previous case, producing the correct floating result in each case.
+<<*>>=
+
+--S 28 of 28
+cos(2/3::Float)
+--R
+--R
+--R 2
+--R (23) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 28
+
+--S 29 of 28
+cos((2/3)::Float)
+--R
+--R
+--R (24) 0.7858872607 7694800072
+--R Type: Float
+--E 29
+
+--S 30 of 28
+cos(2/3$Float)
+--R
+--R
+--R 2
+--R (25) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 30
+
+--S 31 of 28
+cos((2/3)$Float)
+--R
+--R
+--R (26) 0.7858872607 7694800072
+--R Type: Float
+--E 31
+
+--S 32 of 28
+cos(2/3@Float)
+--R
+--R
+--R 2
+--R (27) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 32
+
+--S 33 of 28
+cos((2/3)@Float)
+--R
+--R
+--RDaly Bug
+--R An expression involving @ Float actually evaluated to one of type
+--R Quaternion Complex Expression Integer . Perhaps you should use ::
+--R Float .
+--E 33
+
+@
+Try these examples with our type constrained function, which has better
+luck now
+<<*>>=
+
+--S 34 of 28
+c(2/3::Float)
+--R
+--R
+--R (28) 0.7858872607 7694800072
+--R Type: Float
+--E 34
+
+--S 35 of 28
+c((2/3)::Float)
+--R
+--R
+--R (29) 0.7858872607 7694800072
+--R Type: Float
+--E 35
+
+--S 36 of 28
+c(2/3$Float)
+--R
+--R
+--R (30) 0.7858872607 7694800072
+--R Type: Float
+--E 36
+
+--S 37 of 28
+c((2/3)$Float)
+--R
+--R
+--R (31) 0.7858872607 7694800072
+--R Type: Float
+--E 37
+
+--S 38 of 28
+c(2/3@Float)
+--R
+--R
+--R (32) 0.7858872607 7694800072
+--R Type: Float
+--E 38
+
+--S 39 of 28
+c((2/3)@Float)
+--R
+--R
+--RDaly Bug
+--R An expression involving @ Float actually evaluated to one of type
+--R Quaternion Complex Expression Integer . Perhaps you should use ::
+--R Float .
+--E 39
+
+@
+Could the above problems have been avoided by not assigning types
+to the function we defined? Let's repeat the entire example with
+this single change for the function c2
+<<*>>=
+
+--S 40 of 28
+c2(y) == cos(y)
+--R
+--R Type: Void
+--E 40
+
+--S 41 of 28
+c2(1.237)
+--R
+--R Compiling function c2 with type Float -> Float
+--R
+--R (34) 0.3276321705 9891498386
+--R Type: Float
+--E 41
+
+--S 42 of 28
+c2(x)
+--R
+--R There are 2 exposed and 6 unexposed library operations named cos
+--R having 1 argument(s) but none was determined to be applicable.
+--R Use HyperDoc Browse, or issue
+--R )display op cos
+--R to learn more about the available operations. Perhaps
+--R package-calling the operation or using coercions on the arguments
+--R will allow you to apply the operation.
+--R Cannot find a definition or applicable library operation named cos
+--R with argument type(s)
+--R Quaternion Complex Expression Integer
+--R
+--R Perhaps you should use "@" to indicate the required return type,
+--R or "$" to specify which version of the function you need.
+--R AXIOM will attempt to step through and interpret the code.
+--R
+--R 5
+--R (35) cos(-)
+--R 2
+--R Type: Expression Integer
+--E 42
+
+@
+But that was only misdirection, because this breaks down for
+reasonable expressions
+<<*>>=
+
+--S 43 of 28
+c2(1.237/2)
+--R
+--R Conversion failed in the compiled user function / .
+--R
+--RDaly Bug
+--R Cannot convert from type Float to Quaternion Complex Expression
+--R Integer for value
+--R 1.237
+--R
+--E 43
+
+@
+and various attempts at coercion also fail -- compare these results
+to the previous ones
+<<*>>=
+
+--S 44 of 28
+c2(2/3::Float)
+--R
+--R
+--R 2
+--R (36) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 44
+
+--S 45 of 28
+c2((2/3)::Float)
+--R
+--R
+--R (37) 0.7858872607 7694800072
+--R Type: Float
+--E 45
+
+--S 46 of 28
+c2(2/3$Float)
+--R
+--R
+--R 2
+--R (38) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 46
+
+--S 47 of 28
+c2((2/3)$Float)
+--R
+--R
+--R (39) 0.7858872607 7694800072
+--R Type: Float
+--E 47
+
+--S 48 of 28
+c2(2/3@Float)
+--R
+--R
+--R 2
+--R (40) cos(-)
+--R 3
+--R Type: Expression Integer
+--E 48
+
+--S 49 of 28
+c2((2/3)@Float)
+--R
+--R
+--RDaly Bug
+--R An expression involving @ Float actually evaluated to one of type
+--R Quaternion Complex Expression Integer . Perhaps you should use ::
+--R Float .
+--E 49
+
+@
+Lastly, we cannot now use the graph function, draw, on such a function
+since the wrong ``/'' function is used, contrary to the bypassing of
+internal types we saw take place with draw in the example prior to the
+introduction of operator overloading.
+<<*>>=
+
+--S 50 of 28
+--draw(c(x),x=0..15)
+--E 50
+
+@
+{\sl Not safe at any speed}. Most oddly, the ordinary cos() function which
+exposes no ``/'' division Now fails to work with draw despite the fact
+that we just saw it above still working with Integer and Float arguments
+applied directly.
+<<*>>=
+
+--S 51 of 28
+--draw(cos(x),x=0..15)
+--E 51
+
+)spool
+)lisp (bye)
+
+@
+\eject
+\begin{thebibliography}{99}
+\bibitem{1} nothing
+\end{thebibliography}
+\end{document}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|