aboutsummaryrefslogtreecommitdiff
path: root/src/algebra/integer.spad.pamphlet
diff options
context:
space:
mode:
authorGabriel Dos Reis <gdr@axiomatics.org>2015-12-31 18:51:12 -0800
committerGabriel Dos Reis <gdr@axiomatics.org>2015-12-31 18:51:12 -0800
commit4da6a6b5179d818b0f3b50b0e7e271edef7a8489 (patch)
tree63dbe13a199e57600614c965a574f86cb2f0eae7 /src/algebra/integer.spad.pamphlet
parent50617665789d393c74ddbb779129fba0edd201f5 (diff)
downloadopen-axiom-4da6a6b5179d818b0f3b50b0e7e271edef7a8489.tar.gz
coerceEasy: Allow expansion of current domain in the target mode.
Diffstat (limited to 'src/algebra/integer.spad.pamphlet')
-rw-r--r--src/algebra/integer.spad.pamphlet14
1 files changed, 6 insertions, 8 deletions
diff --git a/src/algebra/integer.spad.pamphlet b/src/algebra/integer.spad.pamphlet
index 6474ec28..a91b6d63 100644
--- a/src/algebra/integer.spad.pamphlet
+++ b/src/algebra/integer.spad.pamphlet
@@ -120,9 +120,9 @@ Integer: IntegerNumberSystem with
hash x == %hash x
negative? x == x < 0$%
positive? x == 0$% < x
- coerce(x):OutputForm == outputForm(x pretend Integer)
+ coerce(x):OutputForm == outputForm x
coerce(m:Integer):% == m pretend %
- convert(x:%):Integer == x pretend Integer
+ convert(x:%):Integer == x
length a == %ilength a
addmod(a, b, p) == %iaddmod(a,b,p)
submod(a, b, p) == %isubmod(a,b,p)
@@ -142,12 +142,10 @@ Integer: IntegerNumberSystem with
r + b
r
- reducedSystem(m:Matrix %):Matrix(Integer) ==
- m pretend Matrix(Integer)
+ reducedSystem(m:Matrix %):Matrix(Integer) == m
reducedSystem(m:Matrix %, v:Vector %):
- Record(mat:Matrix(Integer), vec:Vector(Integer)) ==
- [m pretend Matrix(Integer), v pretend Vector(Integer)]
+ Record(mat:Matrix(Integer), vec:Vector(Integer)) == [m, v]
abs(x) == %iabs x
random() == %ibigrandom()
@@ -179,8 +177,8 @@ Integer: IntegerNumberSystem with
[1$%,x,1$%]$UCA
unitCanonical x == abs x
solveLinearPolynomialEquation(lp:List ZP,p:ZP):Union(List ZP,"failed") ==
- solveLinearPolynomialEquation(lp pretend List ZZP,
- p pretend ZZP)$IntegerSolveLinearPolynomialEquation pretend
+ solveLinearPolynomialEquation(lp @ List ZZP,
+ p @ ZZP)$IntegerSolveLinearPolynomialEquation pretend
Union(List ZP,"failed")
squareFreePolynomial(p:ZP):Factored ZP ==
squareFree(p)$UnivariatePolynomialSquareFree(%,ZP)