Factorization stops after some time

[axkr]

Maybe related to #12 ?

This example stops (or gets very slow?) after random throughput.

Every run it uses the same polynomial example as above.

import java.util.SortedMap;

import edu.jas.poly.GenPolynomial;
import edu.jas.poly.GenPolynomialRing;
import edu.jas.poly.TermOrder;
import edu.jas.ufd.FactorAbstract;
import edu.jas.ufd.FactorFactory;

public class TestFactor {

  public static void main(String[] args) { 
    String str =
        "-2*m1*m2*u1*u2+m1*m2*u2^2-m2^2*u2^2+2*m1*m2*u1*v2+2*m2^2*u2*v2-m1*m2*v2^2-m2^2*v2^2";

    String[] vars = new String[] {"m1", "m2", "u1", "u2", "v2"};
    GenPolynomialRing<edu.jas.arith.BigInteger> fac;
    fac =
        new GenPolynomialRing<edu.jas.arith.BigInteger>(
            edu.jas.arith.BigInteger.ZERO, vars.length, new TermOrder(TermOrder.INVLEX), vars);

    GenPolynomial<edu.jas.arith.BigInteger> poly = fac.parse(str);
    for (int i = 0; i < 100000; i++) {
      System.out.println("Run: " + i + " -" + poly.toString());
      FactorAbstract<edu.jas.arith.BigInteger> factorAbstract =
          FactorFactory.getImplementation(edu.jas.arith.BigInteger.ZERO);
      SortedMap<GenPolynomial<edu.jas.arith.BigInteger>, Long> map = factorAbstract.factors(poly);
      System.out.println("Factors: " + map.toString());
    }
  }
}

[kredel]

With JAS 2.7.20 the situation has improved. Please keep an eye on it.

[axkr]

The problem seems to be still the same, if I run the TestFactor program?
Any option I must switch on?

[kredel]

Yes for this example the problem is still there. Continue with searching ...

[kredel]

After the latest improvements this problem did not occur again.