Changeset 4bca3e in git

Timestamp:

Jun 18, 1996, 2:22:54 PM (28 years ago)

Author:

Rüdiger Stobbe <stobbe@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

e6cc6869a80f3829d41e2482196f1181e9328e68

Parents:

cc2b49426a297bb36dc03b3dd6744400011e8b3a

Message:

"gcd_poly_univar0: now uses getSmallPrimes (due to changes in the handling
                  of prime numbers in cf_primes.
"


git-svn-id: file:///usr/local/Singular/svn/trunk@26 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• factory/cf_gcd.cc (modified) (3 diffs)

factory/cf_gcd.cc

@@ -1 +1 @@
 // emacs edit mode for this file is -*- C++ -*-
-// $Id: cf_gcd.cc,v 1.2 1996-06-13 08:18:34 stobbe Exp $
+// $Id: cf_gcd.cc,v 1.3 1996-06-18 12:22:54 stobbe Exp $
 
 /*
 $Log: not supported by cvs2svn $
+Revision 1.2  1996/06/13 08:18:34  stobbe
+"balance: Now balaces polynomials even if the coefficient sizes are higher
+         than the bound.
+gcd: Now returns the results with positive leading coefficient.
+     The isOne test is now performed if pi or pi1 is multivariate.
+"
+
 Revision 1.1  1996/06/03 08:32:56  stobbe
 "gcd_poly: now uses new function gcd_poly_univar0 to compute univariate
@@ -247 +254 @@
     BB = power(CanonicalForm(2),tmin(f.degree(),g.degree()))*M;
     q = 0;
-    i = 1;
-    n = cf_getNumBigPrimes();
+    i = cf_getNumSmallPrimes() - 1;
     while ( true ) {
         B = BB;
-        while ( i < n && q < B ) {
-            p = cf_getBigPrime( i );
-            i++;
-            while ( i < n && mod( cl, p ) == 0 ) {
-                p = cf_getBigPrime( i );
-                i++;
+        while ( i >= 0 && q < B ) {
+            p = cf_getSmallPrime( i );
+            i--;
+            while ( i >= 0 && mod( cl, p ) == 0 ) {
+                p = cf_getSmallPrime( i );
+                i--;
             }
             setCharacteristic( p );
@@ -283 +289 @@
             }
         }
-        if ( i < n ) {
+        if ( i >= 0 ) {
             // now balance D mod q
             D = pp( balance( cg * D, q ) );