Changeset a64b0e in git for factory/algext.cc

Timestamp:

Nov 15, 2012, 2:17:37 PM (11 years ago)

Author:

Martin Lee <martinlee84@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '00e2e9c41af3fde1273eb3633f4c0c7c3db2579d')

Children:

e2e4be38ca2210479e037e6d8c68c82be5b92ff1

Parents:

780b5285f9d867d03d9da5298c36e8bedf88eaf4

git-author:

Martin Lee <martinlee84@web.de>2012-11-15 14:17:37+01:00

git-committer:

Martin Lee <martinlee84@web.de>2012-11-16 13:13:23+01:00

Message:

chg: deleted unused tryDivide

File:

• factory/algext.cc (modified) (2 diffs)

factory/algext.cc

@@ -365 +365 @@
 static CanonicalForm tryvcontent ( const CanonicalForm & f, const Variable & x, const CanonicalForm & M, bool & fail );
 static CanonicalForm trycf_content ( const CanonicalForm & f, const CanonicalForm & g, const CanonicalForm & M, bool & fail );
-static void tryDivide( const CanonicalForm & f, const CanonicalForm & g, const CanonicalForm & M, CanonicalForm & result, bool & divides, bool & fail );
 
 static inline CanonicalForm
@@ -1019 +1018 @@
 }
 
-
-static void tryDivide( const CanonicalForm & f, const CanonicalForm & g, const CanonicalForm & M, CanonicalForm & result, bool & divides, bool & fail )
-{ // M "univariate" monic polynomial
-  // f, g polynomials with coeffs modulo M.
-  // if f is divisible by g, 'divides' is set to 1 and 'result' == f/g mod M coefficientwise.
-  // 'fail' is set to 1, iff a zero divisor is encountered.
-  // divides==1 implies fail==0
-  // required: getReduce(M.mvar())==0
-  if(g.inBaseDomain())
-  {
-    result = f/g;
-    divides = true;
-    return;
-  }
-  if(g.inCoeffDomain())
-  {
-    tryInvert(g,M,result,fail);
-    if(fail)
-      return;
-    result = reduce(f*result, M);
-    divides = true;
-    return;
-  }
-  // here: g NOT inCoeffDomain
-  Variable x = g.mvar();
-  if(f.degree(x) < g.degree(x))
-  {
-    divides = false;
-    return;
-  }
-  // here: f.degree(x) > 0 and f.degree(x) >= g.degree(x)
-  CanonicalForm F = f;
-  CanonicalForm q, leadG = LC(g);
-  result = 0;
-  while(!F.isZero())
-  {
-    tryDivide(F.LC(x),leadG,M,q,divides,fail);
-    if(fail || !divides)
-      return;
-    if(F.degree(x)<g.degree(x))
-    {
-      divides = false;
-      return;
-    }
-    q *= power(x,F.degree(x)-g.degree(x));
-    result += q;
-    F = reduce(F-q*g, M);
-  }
-  result = reduce(result, M);
-  divides = true;
-}
-
 void tryExtgcd( const CanonicalForm & F, const CanonicalForm & G, CanonicalForm & result, CanonicalForm & s, CanonicalForm & t, bool & fail )
 {