diff options
author | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
---|---|---|
committer | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
commit | 001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532 (patch) | |
tree | da9e2fe5d81ff4cd7709d12e44b8c3e348b8a8e3 /src/algebra/clifford.spad.pamphlet | |
parent | a7bab9a6c2070d05e2dbd256ce455079c8ced385 (diff) | |
download | open-axiom-001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532.tar.gz |
Replace `^=' with `~='.
Diffstat (limited to 'src/algebra/clifford.spad.pamphlet')
-rw-r--r-- | src/algebra/clifford.spad.pamphlet | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/algebra/clifford.spad.pamphlet b/src/algebra/clifford.spad.pamphlet index eeec3b36..ecedf9ac 100644 --- a/src/algebra/clifford.spad.pamphlet +++ b/src/algebra/clifford.spad.pamphlet @@ -297,7 +297,7 @@ CliffordAlgebra(n, K, Q): T == Impl where x = y == for i in 0..dim-1 repeat - if x.i ^= y.i then return false + if x.i ~= y.i then return false true x + y == (z := New; for i in 0..dim-1 repeat z.i := x.i + y.i; z) @@ -322,7 +322,7 @@ CliffordAlgebra(n, K, Q): T == Impl where c := c1 * c2 bz := b2 for i in 0..n-1 | bit?(b1,i) repeat - -- Apply rule ei*ej = -ej*ei for i^=j + -- Apply rule ei*ej = -ej*ei for i~=j k := 0 for j in i+1..n-1 | bit?(b1, j) repeat k := k+1 for j in 0..i-1 | bit?(bz, j) repeat k := k+1 @@ -339,15 +339,15 @@ CliffordAlgebra(n, K, Q): T == Impl where x * y == z := New for ix in 0..dim-1 repeat - if x.ix ^= 0 then for iy in 0..dim-1 repeat - if y.iy ^= 0 then addMonomProd(x.ix,ix,y.iy,iy,z) + if x.ix ~= 0 then for iy in 0..dim-1 repeat + if y.iy ~= 0 then addMonomProd(x.ix,ix,y.iy,iy,z) z canonMonom(c: K, lb: List PI): Record(coef: K, basel: NNI) == -- 0. Check input for b in lb repeat b > n => error "No such basis element" - -- 1. Apply identity ei*ej = -ej*ei, i^=j. + -- 1. Apply identity ei*ej = -ej*ei, i~=j. -- The Rep assumes n is small so bubble sort is ok. -- Using bubble sort keeps the exchange info obvious. wasordered := false @@ -392,7 +392,7 @@ CliffordAlgebra(n, K, Q): T == Impl where c = 1 => be c::Ex * be coerce(x): Ex == - tl := [coerceMonom(x.i,i) for i in 0..dim-1 | x.i^=0] + tl := [coerceMonom(x.i,i) for i in 0..dim-1 | x.i~=0] null tl => "0"::Ex reduce("+", tl) |