From c93e84048964194e5674e859d6bd8827010f09f6 Mon Sep 17 00:00:00 2001
From: dos-reis <gdr@axiomatics.org>
Date: Sat, 12 Mar 2011 19:17:32 +0000
Subject: 	* src/algebra/: Systematically use negative? when comparing
 for 	greater than 0.

---
 src/algebra/crfp.spad.pamphlet | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'src/algebra/crfp.spad.pamphlet')

diff --git a/src/algebra/crfp.spad.pamphlet b/src/algebra/crfp.spad.pamphlet
index 1ac1ba20..8bbd8ee9 100644
--- a/src/algebra/crfp.spad.pamphlet
+++ b/src/algebra/crfp.spad.pamphlet
@@ -306,7 +306,7 @@ ComplexRootFindingPackage(R, UP): public == private where
        -- next we check if one of these centers is a root
        centerIsRoot : Boolean := false
        for i in 1..maxIndex lp repeat
-         if (mD := minimumDegree lp.i) > 0 then
+         if positive? (mD := minimumDegree lp.i) then
            pp : UP := monomial(1,1)-monomial(listOfCenters.i-u,0)
            centerIsRoot := true
            fp := fp * irreducibleFactor(pp,mD)
@@ -418,7 +418,7 @@ ComplexRootFindingPackage(R, UP): public == private where
 
      divisorCascade(p, tp, info) ==
        lfae : L FAE :=  nil()
-       for i in 1..degree tp while (degree tp > 0)  repeat
+       for i in 1..degree tp while positive? degree tp  repeat
          -- USE monicDivide !!!
          qr  : Record(quotient: UP, remainder: UP)  :=  divide(p,tp)
          factor1 : UP := tp
-- 
cgit v1.2.3