Changeset b770bf in git

Timestamp:

Jan 22, 2013, 3:50:24 PM (11 years ago)

Author:

Martin Lee <martinlee84@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

0d74e75b36845cfee9b1869860c0e05542b9ace7

Parents:

ce41efa65fbc644059a89e4c50fddaa477d9877d

git-author:

Martin Lee <martinlee84@web.de>2013-01-22 15:50:24+01:00

git-committer:

Martin Lee <martinlee84@web.de>2013-02-18 15:13:17+01:00

Message:

chg: faster gcd computation in EZGCD in corner cases

Location:

factory

Files:

• cf_gcd_smallp.cc (modified) (1 diff)
• fac_ezgcd.cc (modified) (1 diff)

factory/cf_gcd_smallp.cc

@@ -4558 +4558 @@
     if( F.mvar() == G.mvar() )
       d *= gcd( F, G );
+    else
+      return N (d);
     return N (d);
+  }
+  if ( F.isUnivariate())
+  {
+    g= content (G,G.mvar());
+    return N(d*gcd(F,g));
+  }
+  if ( G.isUnivariate())
+  {
+    f= content (F,F.mvar());
+    return N(d*gcd(G,f));
   }
 

factory/fac_ezgcd.cc

@@ -480 +480 @@
     if(F.mvar()==G.mvar())
       d*=gcd(F,G);
+    else
+      return N (d);
     return N (d);
+  }
+  if ( F.isUnivariate())
+  {
+    g= content (G,G.mvar());
+    return N(d*gcd(F,g));
+  }
+  if ( G.isUnivariate())
+  {
+    f= content (F,F.mvar());
+    return N(d*gcd(G,f));
   }