Age | Commit message (Collapse) | Author | Files | Lines |
|
expansion pass after new opcode expansion.
|
|
if generated is malformed or contains serious warnings.
* algebra/pfo.spad.pamphlet (PointsOfFiniteOrder) [cmult]: Merge
local conditional definitions.
* algebra/permgrps.spad.pamphlet (PermutationGroup) [cosetRep]:
Don't forget to return a value.
* algebra/newpoly.spad.pamphlet (RecursivePolynomialCategory)
[exactQuo]: Merge conditional local definitions.
[ZToR]: Inline at sole use point. Remove conditional definitions.
[QToR]: Likewise.
[PZToPR]: Likewise.
[PQToPR]: Likewise.
* algebra/naalgc.spad.pamphlet (FramedNonAssociativeAlgebra)
[leftRankPolynomial]: Initialize local variable xx.
(rightRankPolynomial): Likewise.
* algebra/multsqfr.spad.pamphlet (MultivariateSquareFree)
[intChoose]: Error if no solution is found in the loop.
* algebra/mts.spad.pamphlet (SparseMultivariateTaylorSeries): Tidy.
[stream] Remove duplicate definition.
* algebra/d01routine.spad.pamphlet (d01anfAnnaType) [measure]: Tidy.
(d01asfAnnaType) [measure]: Likewise.
* algebra/d01transform.spad.pamphlet (d01TransformFunctionType)
[measure]: Likewise.
* algebra/forttyp.spad.pamphlet (FortranScalarType) [coerce]: Likewise.
|
|
[listYoungTableaus]: Fix thinko. Don't use lattice in its own
initialization.
|
|
|
|
[listYoungTableaus]: Fix thinko. Don't use lattice in its own
initialization before it is defined.
|
|
(optimizeFunctionDef): Use it.
|
|
(compRepeatOrCollect): Use it to generate appropriate %loop forms.
Bind new special variable $mayHaveFreeIteratorVariables.
(complainIfShadowing): Set it as appropriate.
|
|
* interp/c-util.boot (isLispSpecialVariable): Tidy.
(transformToBackendCode): Likewise.
|
|
[reducedSystem]: Add overload.
* algebra/si.spad.pamphlet (SingleInteger)[reducedSystem]: Tidy.
|
|
for 0 and zero?
(RightLinearSet): Likewise.
|
|
(DifferentialModuleExtension): Likewise.
(PartialDifferentialModule): New.
|
|
Now satisfies DifferentialSpace.
* algebra/gseries.spad.pamphlet (GeneralUnivariatePowerSeries):
Now satisfies an instance of PartialDifferentialDomain.
* algebra/laurent.spad.pamphlet (UnivariateLaurentSeries): Likewise.
* algebra/puiseux.spad.pamphlet (UnivariatePuiseuxSeries): Likewise.
* algebra/suls.spad.pamphlet (SparseUnivariateLaurentSeries): Likewise.
* algebra/supxs.spad.pamphlet (SparseUnivariatePuiseuxSeries):
Likewise.
* algebra/suts.spad.pamphlet (SparseUnivariateTaylorSeries): Likewise.
* algebra/taylor.spad.pamphlet (UnivariateTaylorSeries): Likewise.
|
|
extends DifferentialSpaceExtension.
|
|
(DifferentialModuleExtension): Likewise.
|
|
AbelianMonoid if element type satisfies AbelianMonoid.
Extend AbelianGroup if element type satisfies AbelianGroup.
Extend Module R if R satisfies CommutativeRing; remove bogus
Algebra R and CommutativeRing extension.
|
|
|
|
(PartialDifferentialRing): Now extend PartialDifferentialSpace.
|
|
LinearSet if the coefficient type satifies Monoid. Remove
previous bogus extension of Monoid.
Similarly, extend OrderedSet if the element type satisfies
OrderedSet. Remove previous bogus extension of OrderedRing.
|
|
on argument.
(RightLinearSet): Likewise.
(LinearSet): Likewise.
|
|
(PartialDifferentialDomain): Likewise.
|
|
DifferentialSpace.
|
|
Extend DifferentialSpace.
|
|
|
|
extends LeftModule R.
[reducedSystem: Vector % -> Matrix R]: New overload.
* algebra/lindep.spad.pamphlet (LinearDependence): Additionally
require Ring on the second parameter.
(IntegerLinearDependence): Add similar requirement on the parameter.
|
|
|
|
DifferentialDomain.
(DifferentialExtension): Check parameter for only DifferentialDomain.
* algebra/dpolcat.spad.pamphlet (DifferentialPolynomialCategory):
Likewise.
* algebra/lodop.spad.pamphlet (OppositeMonogenicLinearOperator):
Likewise.
|
|
|
|
(UnivariateLaurentSeriesConstructor) [termsToOutputForm]: Tidy.
* algebra/mts.spad.pamphlet (SparseMultivariateTaylorSeries)
[coerce]: Likewise.
* algebra/padic.spad.pamphlet (PAdicIntegerCategory) [coerce]:
Likewise.
* algebra/pscat.spad.pamphlet
(UnivariateTaylorSeriesCategory)[coerce]: Likewise.
* algebra/puiseux.spad.pamphlet (UnivariatePuiseuxSeries)
[termsToOutputForm]: Likewise.
|
|
(GenericNonAssociativeAlgebra)[generic]: Fix thinko.
|
|
* algebra/intfact.spad.pamphlet (IntegerRoots) [perfectNthRoot]:
Likewise.
* algebra/numode.spad.pamphlet
(NumericalOrdinaryDifferentialEquations) [rf4a]: Likewise.
* algebra/solvelin.spad.pamphlet (LinearSystemMatrixPackage)
[aSolution]: Likewise.
|
|
|
|
[#, cycleEntry, cycleLength]: Tidy.
(ListAggregate) [position]: Likewise.
* algebra/string.spad.pamphlet (IndexedString) [replace,split,
leftTrim, rightTrim]: Likewise.
|
|
[merge,insert,delete]: Tidy.
|
|
(compStepIterator): Use it to warn about loop variable shadowing
declaration in enclosing scope.
(compIterator): Likewise.
|
|
instanstiation, for that may erase other precious information in
the running seesion when Kernel is implicitly re-instantiated by
the interpreter.
|
|
movedPoints to support. Adjust call eval.
* algebra/perm.spad.pamphlet (PermutationCategory): Now extend
Eltable. Remove eval. Rename movedPoints to support.
(Permutation): Adjust.
* algebra/irsn.spad.pamphlet (listPermutationIrrRepSymNatPackage):
Change call to eval to elt.
* algebra/rep1.spad.pamphlet: Likewise.
|
|
(optSEQ) [getRidOfTemps]: Use it to decide when to safely inline a
temporary variable definition.
|
|
(compRepeatOrCollect): Tidy. Bind $loopBodyTag.
|
|
|
|
(mkUnionFunList): Likewise.
|
|
value.
|
|
(compLogicalNot): Generate %not form.
(satisfies): Use %bind.
(compMatch): Likewise.
(compReduce1): Generate %loop directly instead of %reduce.
* interp/g-opt.boot (changeThrowToExit): Don't check for %reduce.
* interp/g-util.boot (expandRepeat): Remove.
(expandReduce): Likewise.
|
|
non-simple case.
|
|
single %loop form.
(expandCollect): Adjust call.
(expandRepeat): Likewise.
|
|
not COLLECT.
|
|
(compMatchAlternative): Generate %bind form.
(compMatch): Likewise.
(compReduce1): Rewrite.
(getIdentity): Tidy.
* interp/g-opt.boot (changeThrowToExit): HAndle %reduce.
(varIsAssigned): %store is side-effectful.
* interp/g-util.boot (expandReduce): New. Expand %reduce forms.
* interp/i-map.boot (getUserIdentifiersIn): Handle %reduce.
(findLocalVars1): Likewise.
* interp/i-spec1.boot (checkForFreeVariables): Likewise.
|
|
|
|
predicate iterators. There is exactly one instance in the entire
OpenAxio library.
* interp/g-util.boot (expandIN): Take one more parameter to
determine early binding.
(expandIterators): Determine if wider scope is needed for iterator
variables.
|
|
variables with LET-form instead of assignment.
|
|
%return.
* interp/g-opt.boot (removeNeedlessThrow): New.
(optCatch): Use to it to avoid horrendous code generation for
return statement.
* interp/g-util.boot (expandReturn): New. Expand %return forms.
|