fixed diff method check error...

Author: gbenroscience

parser-ng/src/main/java/com/github/gbenroscience/math/differentialcalculus/equations/coeffextractor/clext/refactor/EquationDivider.java

@@ -102,8 +102,8 @@ public static Divided divide(Token[] equationPostfix, int order) {
         ExprNode topCoefficientSum = sumSigned(topTerms);
         ExprNode remainderSum = sumSigned(remainderTerms);
         ExprNode negatedRemainder = remainderSum == null
-                ? ExprNode.number(0.0) : ExprNode.op('-', List.of(remainderSum));
-        ExprNode divided = ExprNode.op('/', List.of(negatedRemainder, topCoefficientSum));
+                ? ExprNode.number(0.0) : ExprNode.op('-', Arrays.asList(remainderSum));
+        ExprNode divided = ExprNode.op('/', Arrays.asList(negatedRemainder, topCoefficientSum));
 
         int[] canonicalToReal = buildCanonicalToReal(root, order);
         int realFrameSize = computeRealFrameSize(canonicalToReal);
@@ -146,7 +146,7 @@ private static void collectTerms(ExprNode node, boolean negate, List<TermWithSig
     }
 
     private static ExprNode signed(ExprNode term, boolean negative) {
-        return negative ? ExprNode.op('-', List.of(term)) : term;
+        return negative ? ExprNode.op('-', Arrays.asList(term)) : term;
     }
 
     private static ExprNode sumSigned(List<ExprNode> terms) {
@@ -155,7 +155,7 @@ private static ExprNode sumSigned(List<ExprNode> terms) {
         }
         ExprNode acc = terms.get(0);
         for (int i = 1; i < terms.size(); i++) {
-            acc = ExprNode.op('+', List.of(acc, terms.get(i)));
+            acc = ExprNode.op('+', Arrays.asList(acc, terms.get(i)));
         }
         return acc;
     }
@@ -224,11 +224,11 @@ private static ExprNode substituteIfLinear(ExprNode node, int stateIndex) {
             }
             if (leftHas) {
                 ExprNode newLeft = substituteIfLinear(left, stateIndex);
-                return newLeft == null ? null : ExprNode.op('*', List.of(newLeft, right));
+                return newLeft == null ? null : ExprNode.op('*', Arrays.asList(newLeft, right));
             }
             if (rightHas) {
                 ExprNode newRight = substituteIfLinear(right, stateIndex);
-                return newRight == null ? null : ExprNode.op('*', List.of(left, newRight));
+                return newRight == null ? null : ExprNode.op('*', Arrays.asList(left, newRight));
             }
             return node;
         }
@@ -240,7 +240,7 @@ private static ExprNode substituteIfLinear(ExprNode node, int stateIndex) {
             }
             if (countStateOccurrences(numerator, stateIndex) > 0) {
                 ExprNode newNumerator = substituteIfLinear(numerator, stateIndex);
-                return newNumerator == null ? null : ExprNode.op('/', List.of(newNumerator, denominator));
+                return newNumerator == null ? null : ExprNode.op('/', Arrays.asList(newNumerator, denominator));
             }
             return node;
         }
@@ -253,7 +253,7 @@ private static ExprNode substituteIfLinear(ExprNode node, int stateIndex) {
                 return node;
             }
             ExprNode newChild = substituteIfLinear(child, stateIndex);
-            return newChild == null ? null : ExprNode.op('-', List.of(newChild));
+            return newChild == null ? null : ExprNode.op('-', Arrays.asList(newChild));
         }
         // Any other operator (binary '+', binary '-', '^') -- if the target
         // state variable is anywhere underneath, the path is disqualified;