Fixed a problem in polynomial divide by deactivating a recursion that lead to a

significant slowdown in sqrfree() and sometimes to a infinite loop.

diff --git a/ginac/normal.cpp b/ginac/normal.cpp
index 09773d37489693a4854964f129002abb186b2c5b..8f5ba73f03308c3daabaf7a9c2f55491250f1362 100644 (file)
--- a/ginac/normal.cpp
+++ b/ginac/normal.cpp
@@ -672,12 +672,13 @@ bool divide(const ex &a, const ex &b, ex &q, bool check_args)
                        q = rem_i*power(ab, a_exp - 1);
                        return true;
                }
-               for (int i=2; i < a_exp; i++) {
-                       if (divide(power(ab, i), b, rem_i, false)) {
-                               q = rem_i*power(ab, a_exp - i);
-                               return true;
-                       }
-               } // ... so we *really* need to expand expression.
+// code below is commented-out because it leads to a significant slowdown
+//             for (int i=2; i < a_exp; i++) {
+//                     if (divide(power(ab, i), b, rem_i, false)) {
+//                             q = rem_i*power(ab, a_exp - i);
+//                             return true;
+//                     }
+//             } // ... so we *really* need to expand expression.
        }
        
        // Polynomial long division (recursive)