diff options
| author | dos-reis <gdr@axiomatics.org> | 2010-02-17 10:22:47 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2010-02-17 10:22:47 +0000 |
| commit | 6506b2a44b3a06a1885ae394215c512898ffeef4 (patch) | |
| tree | f9b91d2beba118efe322de956ecd3b871e922f91 /src | |
| parent | e5fb9d979a16047d62bbe954ee08577088cdb497 (diff) | |
| download | open-axiom-6506b2a44b3a06a1885ae394215c512898ffeef4.tar.gz | |
* algebra/aggcat.spad.pamphlet: Remove unnecessary call to void.
* algebra/algext.spad.pamphlet: Likewise.
* algebra/catdef.spad.pamphlet: Likewise.
* algebra/curve.spad.pamphlet: Likewise.
* algebra/d01agents.spad.pamphlet: Likewise.
* algebra/d02agents.spad.pamphlet: Likewise.
* algebra/ffcg.spad.pamphlet: Likewise.
* algebra/ffhom.spad.pamphlet: Likewise.
* algebra/ffnb.spad.pamphlet: Likewise.
* algebra/ffp.spad.pamphlet: Likewise.
* algebra/formula.spad.pamphlet: Likewise.
* algebra/fortmac.spad.pamphlet: Likewise.
* algebra/fortpak.spad.pamphlet: Likewise.
* algebra/fortran.spad.pamphlet: Likewise.
* algebra/forttyp.spad.pamphlet: Likewise.
* algebra/generic.spad.pamphlet: Likewise.
* algebra/kl.spad.pamphlet: Likewise.
* algebra/mathml.spad.pamphlet: Likewise.
* algebra/newdata.spad.pamphlet: Likewise.
* algebra/out.spad.pamphlet: Likewise.
* algebra/permgrps.spad.pamphlet: Likewise.
* algebra/pfo.spad.pamphlet: Likewise.
* algebra/regset.spad.pamphlet: Likewise.
* algebra/routines.spad.pamphlet: Likewise.
* algebra/setorder.spad.pamphlet: Likewise.
* algebra/sups.spad.pamphlet: Likewise.
* algebra/symbol.spad.pamphlet: Likewise.
* algebra/tex.spad.pamphlet: Likewise.
Diffstat (limited to 'src')
31 files changed, 129 insertions, 165 deletions
diff --git a/src/ChangeLog b/src/ChangeLog index 903e131f..3db90ef4 100644 --- a/src/ChangeLog +++ b/src/ChangeLog @@ -1,3 +1,34 @@ +2010-02-17 Gabriel Dos Reis <gdr@cs.tamu.edu> + + * algebra/aggcat.spad.pamphlet: Remove unnecessary call to void. + * algebra/algext.spad.pamphlet: Likewise. + * algebra/catdef.spad.pamphlet: Likewise. + * algebra/curve.spad.pamphlet: Likewise. + * algebra/d01agents.spad.pamphlet: Likewise. + * algebra/d02agents.spad.pamphlet: Likewise. + * algebra/ffcg.spad.pamphlet: Likewise. + * algebra/ffhom.spad.pamphlet: Likewise. + * algebra/ffnb.spad.pamphlet: Likewise. + * algebra/ffp.spad.pamphlet: Likewise. + * algebra/formula.spad.pamphlet: Likewise. + * algebra/fortmac.spad.pamphlet: Likewise. + * algebra/fortpak.spad.pamphlet: Likewise. + * algebra/fortran.spad.pamphlet: Likewise. + * algebra/forttyp.spad.pamphlet: Likewise. + * algebra/generic.spad.pamphlet: Likewise. + * algebra/kl.spad.pamphlet: Likewise. + * algebra/mathml.spad.pamphlet: Likewise. + * algebra/newdata.spad.pamphlet: Likewise. + * algebra/out.spad.pamphlet: Likewise. + * algebra/permgrps.spad.pamphlet: Likewise. + * algebra/pfo.spad.pamphlet: Likewise. + * algebra/regset.spad.pamphlet: Likewise. + * algebra/routines.spad.pamphlet: Likewise. + * algebra/setorder.spad.pamphlet: Likewise. + * algebra/sups.spad.pamphlet: Likewise. + * algebra/symbol.spad.pamphlet: Likewise. + * algebra/tex.spad.pamphlet: Likewise. + 2010-02-16 Gabriel Dos Reis <gdr@cs.tamu.edu> * interp/compiler.boot (compAtomWithModemap): Reject niladic diff --git a/src/algebra/aggcat.spad.pamphlet b/src/algebra/aggcat.spad.pamphlet index 71553f6f..6e448706 100644 --- a/src/algebra/aggcat.spad.pamphlet +++ b/src/algebra/aggcat.spad.pamphlet @@ -1040,7 +1040,6 @@ IndexedAggregate(Index: SetCategory, Entry: Type): Category == t := a.i qsetelt!(a, i, a.j) qsetelt!(a, j, t) - void() @ diff --git a/src/algebra/algext.spad.pamphlet b/src/algebra/algext.spad.pamphlet index c0e80cda..01657494 100644 --- a/src/algebra/algext.spad.pamphlet +++ b/src/algebra/algext.spad.pamphlet @@ -124,7 +124,6 @@ SimpleAlgebraicExtension(R:CommutativeRing, mkDisc b == nodisc?() := b disc() := discriminant M - void() traceMatrix() == if nodiscmat?() then mkDiscMat false @@ -136,7 +135,6 @@ SimpleAlgebraicExtension(R:CommutativeRing, for i in 0..d1 repeat for j in 0..d1 repeat qsetelt!(discmat,mr + i,mc + j,trace reduce monomial(1,i + j)) - void() trace x == --this could be coded perhaps more efficiently xn := x; ans := coefficient(lift xn, 0) diff --git a/src/algebra/catdef.spad.pamphlet b/src/algebra/catdef.spad.pamphlet index f48017ac..f3963ea3 100644 --- a/src/algebra/catdef.spad.pamphlet +++ b/src/algebra/catdef.spad.pamphlet @@ -132,9 +132,9 @@ AbelianGroup(): Category == Join(CancellationAbelianMonoid, LeftLinearSet Intege -- define SourceLevelSubset to be EQUAL AbelianMonoid(): Category == AbelianSemiGroup with --operations - 0: constant -> % + 0: % ++ 0 is the additive identity element. - sample: constant -> % + sample: % ++ sample yields a value of type % zero?: % -> Boolean ++ zero?(x) tests if x is equal to 0. @@ -1059,8 +1059,8 @@ Module(R:CommutativeRing): Category == Join(BiModule(R,R), LinearSet R) ++ unitsKnown\tab{15}\spadfun{recip} only returns "failed" on non-units Monoid(): Category == SemiGroup with --operations - 1: constant -> % ++ 1 is the multiplicative identity. - sample: constant -> % ++ sample yields a value of type % + 1: % ++ 1 is the multiplicative identity. + sample: % ++ sample yields a value of type % one?: % -> Boolean ++ one?(x) tests if x is equal to 1. **: (%,NonNegativeInteger) -> % ++ x**n returns the repeated product ++ of x n times, i.e. exponentiation. @@ -1719,7 +1719,7 @@ SetCategory(): Category == Join(BasicType,CoercibleTo OutputForm) with ++ infinite\tab{15}repeated \spad{nextItem}'s are never "failed". StepThrough(): Category == SetCategory with --operations - init: constant -> % + init: % ++ init() chooses an initial object for stepping. nextItem: % -> Union(%,"failed") ++ nextItem(x) returns the next item, or "failed" if domain is exhausted. diff --git a/src/algebra/curve.spad.pamphlet b/src/algebra/curve.spad.pamphlet index 5a697c2b..a7185464 100644 --- a/src/algebra/curve.spad.pamphlet +++ b/src/algebra/curve.spad.pamphlet @@ -686,7 +686,6 @@ RadicalFunctionField(F, UP, UPUP, radicnd, n): Exports == Impl where qsetelt!(v, k, (qelt(ib.basis, i, j) / ib.basisDen) * a) qsetelt!(w, k, qelt(ib.basisInv, i, j) * inv a) a := a * c - void() charPStartUp() == r := mkIntegral modulus @@ -704,7 +703,6 @@ RadicalFunctionField(F, UP, UPUP, radicnd, n): Exports == Impl where radicnd ** n1 * */[qelt(ibasis, i) ** 2 for i in mini..maxIndex ibasis] discPoly() := primitivePart(numer dsc) / denom(dsc) - void() char0StartUp() == rp := rootPoly(radicnd, n) @@ -719,7 +717,6 @@ RadicalFunctionField(F, UP, UPUP, radicnd, n): Exports == Impl where invden := invden / rp.coef -- always equals 1/rp.coef**(i-mini) qsetelt!(infbasis, i, a := qelt(infb, i)) qsetelt!(invinfbasis, i, inv a) - void() ramified?(p:UP) == (r := retractIfCan(p)@Union(F, "failed")) case F => @@ -821,7 +818,6 @@ AlgebraicFunctionField(F, UP, UPUP, modulus): Exports == Impl where for j in minColIndex ib .. maxColIndex ib repeat infbasis(i, j) := qelt(ib, i, j) invinfbasis(i, j) := invib(i, j) - void() getInfBasis() == x := inv(monomial(1, 1)$UP :: RF) @@ -844,7 +840,6 @@ AlgebraicFunctionField(F, UP, UPUP, modulus): Exports == Impl where for j in minColIndex ibasis .. maxColIndex ibasis repeat infbasis(i, j) := qelt(ib2, i, j) invinfbasis(i, j) := invib2(i, j) - void() startUp b == brandNew?() := b @@ -869,7 +864,6 @@ AlgebraicFunctionField(F, UP, UPUP, modulus): Exports == Impl where infBr?() := degree(numer dsc0) < degree(denom dsc0) dsc := dsc * determinant(ibasis) ** 2 discPoly() := primitivePart(numer dsc) / denom(dsc) - void() integralDerivationMatrix d == w := integralBasis() diff --git a/src/algebra/d01agents.spad.pamphlet b/src/algebra/d01agents.spad.pamphlet index 96304507..eadc8a14 100644 --- a/src/algebra/d01agents.spad.pamphlet +++ b/src/algebra/d01agents.spad.pamphlet @@ -87,7 +87,6 @@ IntegrationFunctionsTable(): E == I where clearTheFTable():Void == theFTable := empty()$Rep - void()$Void fTable(l:List Record(key:NIA,entry:ATT)):$ == theFTable := table(l)$Rep diff --git a/src/algebra/d02agents.spad.pamphlet b/src/algebra/d02agents.spad.pamphlet index 5d5c498c..e315970a 100644 --- a/src/algebra/d02agents.spad.pamphlet +++ b/src/algebra/d02agents.spad.pamphlet @@ -73,7 +73,6 @@ ODEIntensityFunctionsTable(): E == I where clearTheIFTable():Void == theIFTable := empty()$Rep - void()$Void iFTable(l:List Record(key:ODEA,entry:ATT)):$ == theIFTable := table(l)$Rep diff --git a/src/algebra/ffcg.spad.pamphlet b/src/algebra/ffcg.spad.pamphlet index db74ff3e..54eead9b 100644 --- a/src/algebra/ffcg.spad.pamphlet +++ b/src/algebra/ffcg.spad.pamphlet @@ -185,7 +185,6 @@ FiniteFieldCyclicGroupExtensionByPolynomial(GF,defpol):_ zechlog:=createZechTable(defpol)$FFF -- set initialization flag initzech? := false - void()$Void basis(n:PI) == extensionDegree() rem n ~= 0 => @@ -283,7 +282,6 @@ FiniteFieldCyclicGroupExtensionByPolynomial(GF,defpol):_ facOfGroupSize := factors(factor(sizeCG)$Integer) normalElt:=createNormalElement() pretend SI initelt?:=false - void()$Void extensionDegree(): PositiveInteger == extdeg pretend PI diff --git a/src/algebra/ffhom.spad.pamphlet b/src/algebra/ffhom.spad.pamphlet index 8006e13e..5f0f6112 100644 --- a/src/algebra/ffhom.spad.pamphlet +++ b/src/algebra/ffhom.spad.pamphlet @@ -182,7 +182,7 @@ FiniteFieldHomomorphisms(F1,GF,F2): Exports == Implementation where conMat2to1:=copy(inverse(mat)$M :: M) --we finish the function for one case, hence reset initialization flag init? := false - void()$Void + -- print("'normal' <=> 'polynomial' matrices initialized"::OUT) -- in the other case we have to change the matrices -- repType2 = "normal" and repType1 = "polynomial" @@ -191,7 +191,7 @@ FiniteFieldHomomorphisms(F1,GF,F2): Exports == Implementation where -- print("'normal' <=> 'polynomial' matrices initialized"::OUT) --we finish the function for one case, hence reset initialization flag init? := false - void()$Void + -- 2) in the case of different def. polynomials we have to order the -- fields to get the same isomorphism, if the package is called with -- the fields F1 and F2 swapped. @@ -306,7 +306,7 @@ FiniteFieldHomomorphisms(F1,GF,F2): Exports == Implementation where -- print("conversion matrices initialized"::OUT) --we finish the function for one case, hence reset initialization flag init? := false - void()$Void + conMat1to2 :=matbs conMat2to1 :=matsb -- print(conMat1to2::OUT) @@ -314,7 +314,6 @@ FiniteFieldHomomorphisms(F1,GF,F2): Exports == Implementation where -- print("conversion matrices initialized"::OUT) --we finish the function for one case, hence reset initialization flag init? := false - void()$Void coerce(x:F1) == diff --git a/src/algebra/ffnb.spad.pamphlet b/src/algebra/ffnb.spad.pamphlet index 25c1e782..007f1efd 100644 --- a/src/algebra/ffnb.spad.pamphlet +++ b/src/algebra/ffnb.spad.pamphlet @@ -336,7 +336,6 @@ InnerNormalBasisFieldFunctions(GF): Exports == Implementation where setFieldInfo(m,n) == multTable:=m trGen:=n - void()$Void minimalPolynomial(x) == dx:=#x @@ -600,14 +599,12 @@ FiniteFieldNormalBasisExtensionByPolynomial(GF,uni): Exports == _ -- get a primitive element primitiveElt:=lookup(createPrimitiveElement()) initelt?:=false - void()$Void initializeMult() == multTable:=createMultiplicationTable(defpol)$FFF setFieldInfo(multTable,traceAlpha)$INBFF -- reset initialize flag initmult?:=false - void()$Void initializeLog() == if initelt? then initializeElt() @@ -634,7 +631,6 @@ FiniteFieldNormalBasisExtensionByPolynomial(GF,uni): Exports == _ initlog?:=false -- tell user about initialization --print("discrete logarithm table initialized"::OUT) - void()$Void tableForDiscreteLogarithm(fac) == if initlog? then initializeLog() diff --git a/src/algebra/ffp.spad.pamphlet b/src/algebra/ffp.spad.pamphlet index b6adc806..b90ca09b 100644 --- a/src/algebra/ffp.spad.pamphlet +++ b/src/algebra/ffp.spad.pamphlet @@ -219,7 +219,6 @@ FiniteFieldExtensionByPolynomial(GF:FiniteFieldCategory,_ normalElt:=lookup(nElt) -- set elements initialization flag initelt? := false - void()$Void initializeLog() == if initelt? then initializeElt() @@ -247,7 +246,6 @@ FiniteFieldExtensionByPolynomial(GF:FiniteFieldCategory,_ initlog? := false -- tell user about initialization --print("discrete logarithm tables initialized"::OUT) - void()$Void coerce(e:$):OutputForm == outputForm(lift(e),alpha) diff --git a/src/algebra/formula.spad.pamphlet b/src/algebra/formula.spad.pamphlet index 416cf9c7..27ebc1ed 100644 --- a/src/algebra/formula.spad.pamphlet +++ b/src/algebra/formula.spad.pamphlet @@ -175,7 +175,6 @@ ScriptFormulaFormat(): public == private where for s in f.formula repeat for t in splitLong(s, len) repeat sayFORMULA(t)$Lisp for s in f.epilog repeat sayFORMULA(s)$Lisp - void()$Void display(f : %) == display(f, _$LINELENGTH$Lisp pretend I) diff --git a/src/algebra/fortmac.spad.pamphlet b/src/algebra/fortmac.spad.pamphlet index bbad8853..92a1c9c7 100644 --- a/src/algebra/fortmac.spad.pamphlet +++ b/src/algebra/fortmac.spad.pamphlet @@ -184,7 +184,6 @@ MachineFloat(): Exports == Implementation where while (current := current*base) < target repeat power := power+1 POWER := power MMAX := B**POWER - void() changeBase(exp:I,man:I,base:PI):$ == newExp : I := 0 diff --git a/src/algebra/fortpak.spad.pamphlet b/src/algebra/fortpak.spad.pamphlet index 28d032de..911ed3d5 100644 --- a/src/algebra/fortpak.spad.pamphlet +++ b/src/algebra/fortpak.spad.pamphlet @@ -206,7 +206,6 @@ NAGLinkSupportPackage() : exports == implementation where systemCommand("set fortran precision single")$MoreSystemCommands if _$nagMessages$Lisp then print("** Warning: Restoring fortran precision to single")$PrintPackage - void()$Void uniqueId : String := "" counter : Integer := 0 @@ -284,7 +283,6 @@ FortranPackage(): Exports == Implementation where command : String := concat(["sys rm -f ",target," ; cp ",source," ",target])$String systemCommand(command)$MoreSystemCommands - void()$Void linkToFortran(name:S,args:L U, decls:L L U, res:L(S)):SEX == makeFort(name,args,decls,res,NIL$Lisp,NIL$Lisp)$Lisp @@ -373,7 +371,6 @@ FortranOutputStackPackage() : specification == implementation where push!(string(_$fortranOutputFile$Lisp),fortranOutputStack) push!( fn::String,fortranOutputStack) systemCommand concat(["set output fortran quiet ", fn::String])$String - void() pushFortranOutputStack(fn:String):Void == if empty? fortranOutputStack then @@ -383,14 +380,12 @@ FortranOutputStackPackage() : specification == implementation where push!(string(_$fortranOutputFile$Lisp),fortranOutputStack) push!( fn,fortranOutputStack) systemCommand concat(["set output fortran quiet ", fn])$String - void() popFortranOutputStack():Void == if not empty? fortranOutputStack then pop! fortranOutputStack if empty? fortranOutputStack then push!("CONSOLE",fortranOutputStack) systemCommand concat(["set output fortran quiet append ",_ top fortranOutputStack])$String - void() clearFortranOutputStack():Stack String == fortranOutputStack := empty()@(Stack String) diff --git a/src/algebra/fortran.spad.pamphlet b/src/algebra/fortran.spad.pamphlet index ed5ef00b..19d6bb87 100644 --- a/src/algebra/fortran.spad.pamphlet +++ b/src/algebra/fortran.spad.pamphlet @@ -505,7 +505,6 @@ FortranCode(): public == private where printCode(f:$):Void == displayLines1$Lisp getCode f - void()$Void code (f:$):OPREC == elt(f,data)$Rep @@ -776,7 +775,6 @@ FortranProgram(name,returnType,arguments,symbols): Exports == Implement where clearTheSymbolTable(tempName) for expr in body repeat displayLines1(expr)$Lisp dispStatement(END::OutputForm)$Lisp - void()$Void mkString(l:List Symbol):String == unparse(convert(l::OutputForm)@InputForm)$InputForm @@ -788,7 +786,6 @@ FortranProgram(name,returnType,arguments,symbols): Exports == Implement where s1 : String := mkString(user) s2 : String := mkString(target) error ["Incompatible variable lists:", s1, s2] - void()$Void coerce(u:EXPR MINT) : $ == checkVariables(variables(u)$EXPR(MINT),arguments) @@ -1214,7 +1211,6 @@ SimpleFortranProgram(R,FS): Exports == Implementation where dispfortexp1$Lisp ["="::OutputForm, fname, val]@List(OutputForm) dispfortexp1$Lisp "RETURN"::OutputForm dispfortexp1$Lisp "END"::OutputForm - void()$Void @ \section{domain SWITCH Switch} @@ -1641,7 +1637,6 @@ FortranExpression(basicSymbols,subscriptedSymbols,R): extras : L S := setDifference(ops,fortranFunctions) not empty? extras => error ["Non FORTRAN-77 functions detected:",[string(v) for v in extras]] - void() checkForNagOperators(u:EXPR R):$ == useNagFunctionsFlag => diff --git a/src/algebra/forttyp.spad.pamphlet b/src/algebra/forttyp.spad.pamphlet index 6d1e1175..c1800ccd 100644 --- a/src/algebra/forttyp.spad.pamphlet +++ b/src/algebra/forttyp.spad.pamphlet @@ -447,7 +447,6 @@ SymbolTable() : exports == implementation where fortFormatTypes(ty::OFORM,otl)$Lisp el : L OFORM := [u::OFORM for u in externalList(tab)] fortFormatTypes("EXTERNAL"::OFORM,el)$Lisp - void()$Void @ \section{domain SYMS TheSymbolTable} @@ -556,7 +555,6 @@ TheSymbolTable() : Exports == Implementation where checkIfEntryExists(name:Symbol,tab:$) : Void == key?(name,tab) => void()$Void setelt(tab,name,newEntry())$Rep - void()$Void returnTypeOf(name:Symbol,tab:$):FSTU == elt(elt(tab,name)$Rep,returnType)$Entry @@ -575,11 +573,9 @@ TheSymbolTable() : Exports == Implementation where clearTheSymbolTable():Void == theSymbolTable := empty()$Rep - void()$Void clearTheSymbolTable(u:Symbol):Void == remove!(u,theSymbolTable)$Rep - void()$Void empty():$ == empty()$Rep @@ -596,7 +592,6 @@ TheSymbolTable() : Exports == Implementation where newSubProgram(u:Symbol):Void == setelt(theSymbolTable,u,newEntry())$Rep currentSubProgramName := u - void()$Void argumentList!(u:Symbol,args:List Symbol,symbols:$):Void == checkIfEntryExists(u,symbols) diff --git a/src/algebra/generic.spad.pamphlet b/src/algebra/generic.spad.pamphlet index 7bfc0c49..e8eab134 100644 --- a/src/algebra/generic.spad.pamphlet +++ b/src/algebra/generic.spad.pamphlet @@ -202,7 +202,6 @@ GenericNonAssociativeAlgebra(R : CommutativeRing, n : PositiveInteger,_ -- reset initialize flag initLeft?:=false leftRankPoly := leftMinimalPolynomial genericElement - void()$Void rightRankPoly : SparseUnivariatePolynomial FPR := 0 initRight? : Boolean :=true @@ -212,7 +211,6 @@ GenericNonAssociativeAlgebra(R : CommutativeRing, n : PositiveInteger,_ -- reset initialize flag initRight?:=false rightRankPoly := rightMinimalPolynomial genericElement - void()$Void leftRankPolynomial(): SparseUnivariatePolynomial FPR == if initLeft? then initializeLeft() diff --git a/src/algebra/kl.spad.pamphlet b/src/algebra/kl.spad.pamphlet index 6dfa0358..28c7951f 100644 --- a/src/algebra/kl.spad.pamphlet +++ b/src/algebra/kl.spad.pamphlet @@ -67,13 +67,13 @@ SortedCache(S:CachableSet): Exports == Implementation where cache() == deref cach shiftCache(l, n) == - for x in l repeat setPosition(x, n + position x) - void() + for x in l repeat + setPosition(x, n + position x) clearCache() == - for x in cache() repeat setPosition(x, 0) + for x in cache() repeat + setPosition(x, 0) setref(cach,nil$List(S)) - void() enterInCache(x:S, equal?:S -> Boolean) == scan := cache() diff --git a/src/algebra/mathml.spad.pamphlet b/src/algebra/mathml.spad.pamphlet index c00c55a9..4b22db37 100644 --- a/src/algebra/mathml.spad.pamphlet +++ b/src/algebra/mathml.spad.pamphlet @@ -580,7 +580,6 @@ returning Void. I really only need the one coerce function. sayTeX$Lisp "<math xmlns=_"http://www.w3.org/1998/Math/MathML_" mathsize=_"big_" display=_"block_">" sayTeX$Lisp mathml sayTeX$Lisp "</math>" - void()$Void @@ -657,7 +656,6 @@ returning Void. I really only need the one coerce function. u := segment(enE+1,end)$US displayElt(mathML.u) - void()$Void eltName(pos:I,mathML:S): S == -- Assuming pos is the position of "<" for a start tag of a mathML diff --git a/src/algebra/newdata.spad.pamphlet b/src/algebra/newdata.spad.pamphlet index f9b1a9ed..78e3bf36 100644 --- a/src/algebra/newdata.spad.pamphlet +++ b/src/algebra/newdata.spad.pamphlet @@ -108,7 +108,7 @@ TabulatedComputationPackage(Key ,Entry): Exports == Implementation where initTable!(): Void == table? := true t := empty() - void() + printInfo!(s1: String, s2: String): Void == (empty? s1) or (empty? s2) => void() not usingTable?() => @@ -116,7 +116,7 @@ TabulatedComputationPackage(Key ,Entry): Exports == Implementation where info? := true ok := s1 ko := s2 - void() + startStats!(s: String): Void == empty? s => void() not table? => @@ -124,7 +124,7 @@ TabulatedComputationPackage(Key ,Entry): Exports == Implementation where stats? := true used := 0 domainName := s - void() + printStats!(): Void == not table? => error "in printStats!()$TBCMPPK: not allowed to use hashtable" @@ -144,7 +144,7 @@ TabulatedComputationPackage(Key ,Entry): Exports == Implementation where info? := false stats? := false domainName := empty()$String - void() + usingTable?() == table? printingInfo?() == info? makingStats?() == stats? @@ -160,7 +160,6 @@ TabulatedComputationPackage(Key ,Entry): Exports == Implementation where not table? => void() t.k := e if info? then iprint(ko)$iprintpack - void() @ \section{domain SPLNODE SplittingNode} diff --git a/src/algebra/out.spad.pamphlet b/src/algebra/out.spad.pamphlet index 68f235d5..57b24451 100644 --- a/src/algebra/out.spad.pamphlet +++ b/src/algebra/out.spad.pamphlet @@ -59,7 +59,7 @@ OutputPackage: with output e == mathprint(e)$Lisp - void() + output s == output(s:E) output(s,e) == @@ -125,32 +125,25 @@ SpecialOutputPackage: public == private where outputAsFortran e == dispfortexp$Lisp e - void()$Void outputAsFortran(var,e) == e := var::Symbol::OutputForm = e dispfortexp(e)$Lisp - void()$Void outputAsFortran l == dispfortexp$Lisp juxtaposeTerms l - void()$Void outputAsScript e == formulaFormat$Lisp e - void()$Void outputAsScript l == formulaFormat$Lisp juxtaposeTerms l - void()$Void outputAsTex e == texFormat$Lisp e - void()$Void outputAsTex l == texFormat$Lisp juxtaposeTerms l - void()$Void @ \section{package DISPLAY DisplayPackage} @@ -253,11 +246,9 @@ DisplayPackage: public == private where say s == sayBrightly$Lisp s - void()$Void say l == sayBrightly$Lisp l - void()$Void sayLength s == #s diff --git a/src/algebra/permgrps.spad.pamphlet b/src/algebra/permgrps.spad.pamphlet index afa34fbd..af907d4e 100644 --- a/src/algebra/permgrps.spad.pamphlet +++ b/src/algebra/permgrps.spad.pamphlet @@ -451,7 +451,6 @@ PermutationGroup(S:SetCategory): public == private where else i := i + 1 if removedGenerator then orbitLength := computeOrbits ( kkk ) - void() bsgs ( group : % ,maxLoops : I , diff : I ) : NNI == @@ -585,7 +584,6 @@ PermutationGroup(S:SetCategory): public == private where gporb := result.orbs supp := result.mp wordlist := result.wd - void() subgroup ( gp1 : % , gp2 : % ) : B == gpset1 := initialize gp1 @@ -770,7 +768,6 @@ PermutationGroup(S:SetCategory): public == private where wordProblem := true ord := bsgs ( gp , maxLoops , diff ) gp.information := [ ord , sgs , baseOfGroup , gporb , supp , wordlist ] - void() initializeGroupForWordProblem ( gp ) == initializeGroupForWordProblem ( gp , 0 , 1 ) diff --git a/src/algebra/pfo.spad.pamphlet b/src/algebra/pfo.spad.pamphlet index 6cda9848..45b6ac45 100644 --- a/src/algebra/pfo.spad.pamphlet +++ b/src/algebra/pfo.spad.pamphlet @@ -258,7 +258,6 @@ FunctionSpaceReduce(R, F): Exports == Implementation where newReduc() == for k in keys redmap repeat remove!(k, redmap) - void() bringDown(f, k) == ff := univariate(f, k) diff --git a/src/algebra/regset.spad.pamphlet b/src/algebra/regset.spad.pamphlet index 050960eb..3bb55e90 100644 --- a/src/algebra/regset.spad.pamphlet +++ b/src/algebra/regset.spad.pamphlet @@ -479,7 +479,6 @@ QuasiComponentPackage(R,E,V,P,TS): Exports == Implementation where initTable!()$H if (not empty? ok) and (not empty? ko) then printInfo!(ok,ko)$H if (not empty? domainName) then startStats!(domainName)$H - void() stopTable!(): Void == if makingStats?()$H then printStats!()$H @@ -828,7 +827,6 @@ RegularTriangularSetGcdPackage(R,E,V,P,TS): Exports == Implementation where initTable!()$HGcd printInfo!(ok,ko)$HGcd startStats!(domainName)$HGcd - void() stopTableGcd!(): Void == if makingStats?()$HGcd then printStats!()$HGcd @@ -838,7 +836,6 @@ RegularTriangularSetGcdPackage(R,E,V,P,TS): Exports == Implementation where initTable!()$HInvSet printInfo!(ok,ko)$HInvSet startStats!(domainName)$HInvSet - void() stopTableInvSet!(): Void == if makingStats?()$HInvSet then printStats!()$HInvSet @@ -1303,7 +1300,6 @@ RegularSetDecompositionPackage(R,E,V,P,TS): Exports == Implementation where s := concat [s, ",", convert(lpwt)@String] s := concat [s, " -> |", string(m::Z), "|; {", string(n::Z),"}]"] iprint(s)$iprintpack - void() decompose(lp: LP, lts: Split, cleanW?: B, sqfr?: B, clos?: B, rem?: B, info?: B): Split == -- if cleanW? then REMOVE REDUNDANT COMPONENTS in lts diff --git a/src/algebra/routines.spad.pamphlet b/src/algebra/routines.spad.pamphlet index ee9bf0aa..5b67f754 100644 --- a/src/algebra/routines.spad.pamphlet +++ b/src/algebra/routines.spad.pamphlet @@ -528,7 +528,6 @@ AttributeButtons(): E == I where resetAttributeButtons():Void == attributeButtons := buttons() - void()$Void setButtonValue(routineName:ST,attributeName:ST,n:F):F == f := search(routineName attributeName,attributeButtons)$Rep diff --git a/src/algebra/setorder.spad.pamphlet b/src/algebra/setorder.spad.pamphlet index b54ade5c..e767e075 100644 --- a/src/algebra/setorder.spad.pamphlet +++ b/src/algebra/setorder.spad.pamphlet @@ -68,7 +68,6 @@ UserDefinedPartialOrdering(S:SetCategory): with setOrder(l, h) == setref(llow, removeDuplicates l) setref(lhigh, removeDuplicates h) - void() less?(a, b, f) == (u := less?(a, b)) case "failed" => f(a, b) diff --git a/src/algebra/sregset.spad.pamphlet b/src/algebra/sregset.spad.pamphlet index 0fa7bee2..b46fa886 100644 --- a/src/algebra/sregset.spad.pamphlet +++ b/src/algebra/sregset.spad.pamphlet @@ -173,7 +173,6 @@ SquareFreeQuasiComponentPackage(R,E,V,P,TS): Exports == Implementation where initTable!()$H if (not empty? ok) and (not empty? ko) then printInfo!(ok,ko)$H if (not empty? domainName) then startStats!(domainName)$H - void() stopTable!(): Void == if makingStats?()$H then printStats!()$H @@ -521,7 +520,6 @@ SquareFreeRegularTriangularSetGcdPackage(R,E,V,P,TS): Exports == Implementation initTable!()$HGcd printInfo!(ok,ko)$HGcd startStats!(domainName)$HGcd - void() stopTableGcd!(): Void == if makingStats?()$HGcd then printStats!()$HGcd @@ -531,7 +529,6 @@ SquareFreeRegularTriangularSetGcdPackage(R,E,V,P,TS): Exports == Implementation initTable!()$HInvSet printInfo!(ok,ko)$HInvSet startStats!(domainName)$HInvSet - void() stopTableInvSet!(): Void == if makingStats?()$HInvSet then printStats!()$HInvSet @@ -1100,7 +1097,6 @@ SquareFreeRegularSetDecompositionPackage(R,E,V,P,TS): Exports == Implementation s := concat [s, ",", convert(lpwt)@String] s := concat [s, " -> |", string(m::Z), "|; {", string(n::Z),"}]"] iprint(s)$iprintpack - void() decompose(lp: LP, lts: Split, cleanW?: B, sqfr?: B, clos?: B, rem?: B, info?: B): Split == -- if cleanW? then REMOVE REDUNDANT COMPONENTS in lts diff --git a/src/algebra/strap/SYMBOL.lsp b/src/algebra/strap/SYMBOL.lsp index faef8b4e..f49484a6 100644 --- a/src/algebra/strap/SYMBOL.lsp +++ b/src/algebra/strap/SYMBOL.lsp @@ -533,23 +533,23 @@ (PROG (|k| #0=#:G1549) (RETURN (SEQ (SPADCALL (|getShellEntry| $ 10) 0 (|getShellEntry| $ 121)) - (SEQ (LETT |k| NIL |SYMBOL;resetNew;V;29|) - (LETT #0# - (SPADCALL (|getShellEntry| $ 13) - (|getShellEntry| $ 133)) - |SYMBOL;resetNew;V;29|) - G190 - (COND - ((OR (ATOM #0#) - (PROGN - (LETT |k| (CAR #0#) |SYMBOL;resetNew;V;29|) - NIL)) - (GO G191))) - (SEQ (EXIT (SPADCALL |k| (|getShellEntry| $ 13) - (|getShellEntry| $ 134)))) - (LETT #0# (CDR #0#) |SYMBOL;resetNew;V;29|) (GO G190) - G191 (EXIT NIL)) - (EXIT (SPADCALL (|getShellEntry| $ 135))))))) + (EXIT (SEQ (LETT |k| NIL |SYMBOL;resetNew;V;29|) + (LETT #0# + (SPADCALL (|getShellEntry| $ 13) + (|getShellEntry| $ 133)) + |SYMBOL;resetNew;V;29|) + G190 + (COND + ((OR (ATOM #0#) + (PROGN + (LETT |k| (CAR #0#) + |SYMBOL;resetNew;V;29|) + NIL)) + (GO G191))) + (SEQ (EXIT (SPADCALL |k| (|getShellEntry| $ 13) + (|getShellEntry| $ 134)))) + (LETT #0# (CDR #0#) |SYMBOL;resetNew;V;29|) + (GO G190) G191 (EXIT NIL))))))) (DEFUN |SYMBOL;scripted?;$B;30| (|sy| $) (NOT (ATOM |sy|))) @@ -563,7 +563,7 @@ (|SYMBOL;string;$S;24| (SPADCALL (|SYMBOL;list;$L;34| |sy| $) - (|getShellEntry| $ 138)) + (|getShellEntry| $ 137)) $) |SYMBOL;name;2$;31|) (SEQ (EXIT (SEQ @@ -581,7 +581,7 @@ (SPADCALL (SPADCALL |str| |i| (|getShellEntry| $ 106)) - (|getShellEntry| $ 142))) + (|getShellEntry| $ 141))) (PROGN (LETT #2# (PROGN @@ -591,9 +591,9 @@ (SPADCALL |i| (QCSIZE |str|) (|getShellEntry| $ - 144)) + 143)) (|getShellEntry| $ - 145)) + 144)) $) |SYMBOL;name;2$;31|) (GO #1#)) @@ -621,12 +621,12 @@ (LETT |str| (|SYMBOL;string;$S;24| (SPADCALL (|SYMBOL;list;$L;34| |sy| $) - (|getShellEntry| $ 138)) + (|getShellEntry| $ 137)) $) |SYMBOL;scripts;$R;32|) (LETT |nstr| (QCSIZE |str|) |SYMBOL;scripts;$R;32|) (LETT |m| - (SPADCALL |nscripts| (|getShellEntry| $ 147)) + (SPADCALL |nscripts| (|getShellEntry| $ 146)) |SYMBOL;scripts;$R;32|) (SEQ (LETT |j| (+ (|getShellEntry| $ 41) 1) |SYMBOL;scripts;$R;32|) @@ -636,7 +636,7 @@ (NULL (SPADCALL (SPADCALL |str| |j| (|getShellEntry| $ 106)) - (|getShellEntry| $ 142)))) + (|getShellEntry| $ 141)))) (GO G191))) (SPADCALL |nscripts| |i| (PROG1 (LETT #0# @@ -649,7 +649,7 @@ |SYMBOL;scripts;$R;32|) (|check-subtype| (>= #0# 0) '(|NonNegativeInteger|) #0#)) - (|getShellEntry| $ 149)) + (|getShellEntry| $ 148)) (LETT |i| (PROG1 (+ |i| 1) (LETT |j| (+ |j| 1) @@ -659,14 +659,14 @@ (LETT |nscripts| (SPADCALL (CDR |nscripts|) (|SPADfirst| |nscripts|) - (|getShellEntry| $ 152)) + (|getShellEntry| $ 151)) |SYMBOL;scripts;$R;32|) (LETT |allscripts| (SPADCALL (|SYMBOL;list;$L;34| |sy| $) - (|getShellEntry| $ 153)) + (|getShellEntry| $ 152)) |SYMBOL;scripts;$R;32|) (LETT |m| - (SPADCALL |lscripts| (|getShellEntry| $ 154)) + (SPADCALL |lscripts| (|getShellEntry| $ 153)) |SYMBOL;scripts;$R;32|) (SEQ (LETT |n| NIL |SYMBOL;scripts;$R;32|) (LETT #1# |nscripts| |SYMBOL;scripts;$R;32|) @@ -680,7 +680,7 @@ (GO G191))) (COND ((< (SPADCALL |allscripts| - (|getShellEntry| $ 155)) + (|getShellEntry| $ 154)) |n|) (|error| "Improper script count in symbol")) ('T @@ -693,7 +693,7 @@ |SYMBOL;scripts;$R;32|) (LETT #3# (SPADCALL |allscripts| |n| - (|getShellEntry| $ 157)) + (|getShellEntry| $ 156)) |SYMBOL;scripts;$R;32|) G190 (COND @@ -712,10 +712,10 @@ |SYMBOL;scripts;$R;32|) (GO G190) G191 (EXIT (NREVERSE0 #2#)))) - (|getShellEntry| $ 158)) + (|getShellEntry| $ 157)) (EXIT (LETT |allscripts| (SPADCALL |allscripts| |n| - (|getShellEntry| $ 159)) + (|getShellEntry| $ 158)) |SYMBOL;scripts;$R;32|))))) (LETT |i| (PROG1 (+ |i| 1) @@ -724,15 +724,15 @@ |SYMBOL;scripts;$R;32|) (GO G190) G191 (EXIT NIL)) (EXIT (VECTOR (SPADCALL |lscripts| |m| - (|getShellEntry| $ 160)) + (|getShellEntry| $ 159)) (SPADCALL |lscripts| (+ |m| 1) - (|getShellEntry| $ 160)) + (|getShellEntry| $ 159)) (SPADCALL |lscripts| (+ |m| 2) - (|getShellEntry| $ 160)) + (|getShellEntry| $ 159)) (SPADCALL |lscripts| (+ |m| 3) - (|getShellEntry| $ 160)) + (|getShellEntry| $ 159)) (SPADCALL |lscripts| (+ |m| 4) - (|getShellEntry| $ 160))))))))))) + (|getShellEntry| $ 159))))))))))) (DEFUN |SYMBOL;istring| (|n| $) (COND @@ -768,7 +768,7 @@ (RETURN (PROGN (LETT |dv$| '(|Symbol|) . #0=(|Symbol|)) - (LETT $ (|newShell| 165) . #0#) + (LETT $ (|newShell| 164) . #0#) (|setShellEntry| $ 0 |dv$|) (|setShellEntry| $ 3 (LETT |pv$| (|buildPredVector| 0 0 NIL) . #0#)) @@ -840,25 +840,25 @@ (277 . |Zero|) (281 . |inc|) (286 . |setelt|) (293 . |maxIndex|) (298 . |position|) (304 . >=) |SYMBOL;new;2$;28| (|List| $$) (310 . |keys|) - (315 . |remove!|) (321 . |void|) |SYMBOL;resetNew;V;29| - |SYMBOL;list;$L;34| (325 . |first|) (|SingleInteger|) - (330 . |One|) (334 . +) (340 . |digit?|) - (|UniversalSegment| 6) (345 . SEGMENT) (351 . |elt|) - (|List| 39) (357 . |minIndex|) (362 . -) (368 . |setelt|) - (375 . |rest|) (380 . |first|) (385 . |concat|) - (391 . |rest|) (396 . |minIndex|) (401 . |#|) (406 . <) - (412 . |first|) (418 . |setelt|) (425 . |rest|) - (431 . |elt|) (437 . >) (443 . |minIndex|) (448 . |elt|) + (315 . |remove!|) |SYMBOL;resetNew;V;29| + |SYMBOL;list;$L;34| (321 . |first|) (|SingleInteger|) + (326 . |One|) (330 . +) (336 . |digit?|) + (|UniversalSegment| 6) (341 . SEGMENT) (347 . |elt|) + (|List| 39) (353 . |minIndex|) (358 . -) (364 . |setelt|) + (371 . |rest|) (376 . |first|) (381 . |concat|) + (387 . |rest|) (392 . |minIndex|) (397 . |#|) (402 . <) + (408 . |first|) (414 . |setelt|) (421 . |rest|) + (427 . |elt|) (433 . >) (439 . |minIndex|) (444 . |elt|) (CONS IDENTITY (FUNCALL (|dispatchFunction| |SYMBOL;sample;$;35|) $))) - '#(~= 454 |superscript| 460 |subscript| 466 |string| 472 - |scripts| 477 |scripted?| 482 |script| 487 |sample| 499 - |resetNew| 503 |patternMatch| 507 |new| 521 |name| 530 - |min| 535 |max| 541 |list| 547 |latex| 552 |hash| 557 - |elt| 562 |convert| 568 |coerce| 588 |before?| 598 - |argscript| 604 |OMwrite| 610 >= 634 > 640 = 646 <= 652 < - 658) + '#(~= 450 |superscript| 456 |subscript| 462 |string| 468 + |scripts| 473 |scripted?| 478 |script| 483 |sample| 495 + |resetNew| 499 |patternMatch| 503 |new| 517 |name| 526 + |min| 531 |max| 537 |list| 543 |latex| 548 |hash| 553 + |elt| 558 |convert| 564 |coerce| 584 |before?| 594 + |argscript| 600 |OMwrite| 606 >= 630 > 636 = 642 <= 648 < + 654) 'NIL (CONS (|makeByteWordVec2| 1 '(0 0 0 0 0 0 0 0 0 0 0 0)) (CONS '#(|OrderedSet&| NIL NIL |SetCategory&| @@ -870,7 +870,7 @@ (|CoercibleFrom| 14) (|ConvertibleTo| 25) (|OpenMath|) (|ConvertibleTo| 46) (|CoercibleTo| 53)) - (|makeByteWordVec2| 164 + (|makeByteWordVec2| 163 '(0 6 0 7 1 8 0 6 9 0 11 0 12 1 16 0 15 17 2 26 24 0 25 27 0 28 0 29 2 26 0 14 28 30 1 26 24 0 31 1 26 24 0 32 1 @@ -893,30 +893,30 @@ 0 124 0 39 0 125 1 6 0 0 126 3 11 6 0 2 6 127 1 14 6 0 128 2 14 6 42 0 129 2 6 22 0 0 130 1 11 132 0 133 2 11 - 123 2 0 134 0 24 0 135 1 132 2 0 138 - 0 139 0 140 2 39 0 0 0 141 1 42 22 0 - 142 2 143 0 6 6 144 2 14 0 0 143 145 - 1 146 6 0 147 2 6 0 0 0 148 3 146 39 - 0 6 39 149 1 146 0 0 150 1 146 39 0 - 151 2 146 0 0 39 152 1 132 0 0 153 1 - 58 6 0 154 1 132 39 0 155 2 39 22 0 0 - 156 2 132 0 0 39 157 3 58 56 0 6 56 - 158 2 132 0 0 39 159 2 58 56 0 6 160 - 2 6 22 0 0 161 1 16 6 0 162 2 16 14 0 - 6 163 2 0 22 0 0 1 2 0 0 0 56 62 2 0 - 0 0 56 60 1 0 14 0 101 1 0 98 0 108 1 - 0 22 0 23 2 0 0 0 58 59 2 0 0 0 98 99 - 0 0 0 164 0 0 24 136 3 0 75 0 72 75 - 76 3 0 68 0 65 68 69 1 0 0 0 131 0 0 - 0 122 1 0 0 0 100 2 0 0 0 0 1 2 0 0 0 - 0 1 1 0 92 0 137 1 0 14 0 114 1 0 139 - 0 1 2 0 0 0 56 61 1 0 65 0 80 1 0 72 - 0 78 1 0 25 0 49 1 0 46 0 48 1 0 0 14 - 50 1 0 53 0 55 2 0 22 0 0 1 2 0 0 0 - 56 63 2 0 24 26 0 36 3 0 24 26 0 22 - 37 1 0 14 0 34 2 0 14 0 22 35 2 0 22 - 0 0 1 2 0 22 0 0 1 2 0 22 0 0 51 2 0 - 22 0 0 1 2 0 22 0 0 52))))) + 123 2 0 134 1 132 2 0 137 0 138 0 139 + 2 39 0 0 0 140 1 42 22 0 141 2 142 0 + 6 6 143 2 14 0 0 142 144 1 145 6 0 + 146 2 6 0 0 0 147 3 145 39 0 6 39 148 + 1 145 0 0 149 1 145 39 0 150 2 145 0 + 0 39 151 1 132 0 0 152 1 58 6 0 153 1 + 132 39 0 154 2 39 22 0 0 155 2 132 0 + 0 39 156 3 58 56 0 6 56 157 2 132 0 0 + 39 158 2 58 56 0 6 159 2 6 22 0 0 160 + 1 16 6 0 161 2 16 14 0 6 162 2 0 22 0 + 0 1 2 0 0 0 56 62 2 0 0 0 56 60 1 0 + 14 0 101 1 0 98 0 108 1 0 22 0 23 2 0 + 0 0 58 59 2 0 0 0 98 99 0 0 0 163 0 0 + 24 135 3 0 75 0 72 75 76 3 0 68 0 65 + 68 69 1 0 0 0 131 0 0 0 122 1 0 0 0 + 100 2 0 0 0 0 1 2 0 0 0 0 1 1 0 92 0 + 136 1 0 14 0 114 1 0 138 0 1 2 0 0 0 + 56 61 1 0 65 0 80 1 0 72 0 78 1 0 25 + 0 49 1 0 46 0 48 1 0 0 14 50 1 0 53 0 + 55 2 0 22 0 0 1 2 0 0 0 56 63 2 0 24 + 26 0 36 3 0 24 26 0 22 37 1 0 14 0 34 + 2 0 14 0 22 35 2 0 22 0 0 1 2 0 22 0 + 0 1 2 0 22 0 0 51 2 0 22 0 0 1 2 0 22 + 0 0 52))))) '|lookupComplete|)) (MAKEPROP '|Symbol| 'NILADIC T) diff --git a/src/algebra/sups.spad.pamphlet b/src/algebra/sups.spad.pamphlet index 12002060..b02ea1c0 100644 --- a/src/algebra/sups.spad.pamphlet +++ b/src/algebra/sups.spad.pamphlet @@ -461,11 +461,11 @@ InnerSparseUnivariatePowerSeries(Coef): Exports == Implementation where explicitEntries? y => void() xDeg := (getExpon frst x) :: COM while (xDeg + elt(yRefer)) < nn repeat lazyEvaluate y - void() + explicitEntries? y => yDeg := (getExpon frst y) :: COM while (yDeg + elt(xRefer)) < nn repeat lazyEvaluate x - void() + lazyEvaluate x -- if x = y, then y may now have explicit entries if lazy? y then lazyEvaluate y diff --git a/src/algebra/symbol.spad.pamphlet b/src/algebra/symbol.spad.pamphlet index 3db5f61e..5268bca3 100644 --- a/src/algebra/symbol.spad.pamphlet +++ b/src/algebra/symbol.spad.pamphlet @@ -273,7 +273,6 @@ Symbol(): Exports == Implementation where resetNew() == count() := 0 for k in keys xcount repeat remove!(k, xcount) - void() scripted? sy == not ATOM(sy)$Lisp diff --git a/src/algebra/tex.spad.pamphlet b/src/algebra/tex.spad.pamphlet index 4c6fcc1c..53c69b0b 100644 --- a/src/algebra/tex.spad.pamphlet +++ b/src/algebra/tex.spad.pamphlet @@ -250,7 +250,6 @@ TexFormat(): public == private where for s in f.TeX repeat for t in splitLong(s, len) repeat sayTeX$Lisp t for s in f.epilog repeat sayTeX$Lisp s - void()$Void display(f : $) == display(f, _$LINELENGTH$Lisp pretend I) |