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/sgcf.spad.pamphlet | |
| parent | a7bab9a6c2070d05e2dbd256ce455079c8ced385 (diff) | |
| download | open-axiom-001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532.tar.gz | |
Replace `^=' with `~='.
Diffstat (limited to 'src/algebra/sgcf.spad.pamphlet')
| -rw-r--r-- | src/algebra/sgcf.spad.pamphlet | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/algebra/sgcf.spad.pamphlet b/src/algebra/sgcf.spad.pamphlet index b2740766..c871cb18 100644 --- a/src/algebra/sgcf.spad.pamphlet +++ b/src/algebra/sgcf.spad.pamphlet @@ -234,7 +234,7 @@ SymmetricGroupCombinatoricFunctions(): public == private where k < 0 => nonZeros k >= numberOfImproperPartitions(n,m) => nonZeros cm : I := m --cm gives the depth of the tree - while n ^= 0 repeat + while n ~= 0 repeat s : I := 0 cm := cm - 1 for y in n..1 by -1 repeat --determination of the next son @@ -374,7 +374,7 @@ SymmetricGroupCombinatoricFunctions(): public == private where vrest : V I := new(ncol,0) cnull : M I := new(1,1,0) coleman := copy C - if coleman ^= cnull then + if coleman ~= cnull then -- look for the first row of "coleman" that has a succeeding -- partition, this can be atmost row nrow-1 i : NNI := (nrow-1)::NNI @@ -416,7 +416,7 @@ SymmetricGroupCombinatoricFunctions(): public == private where nextPartition(gamma:L I,part:V I,number:I) == n : NNI := #gamma vnull : V I := vector(nil()$(L I)) -- empty vector - if part ^= vnull then + if part ~= vnull then i : NNI := 2 sum := part(1) while (part(i) = gamma(i)) or (sum = 0) repeat |