6162636465666768
System.out.printf("%s : %s = ?%n", quad, x); Set roots = quad.solve(); System.out.printf(" %s = %s%n", x, roots); Expression expected = new EmptySet(); assertEquals(expected, roots); }
75767778798081
System.out.printf("%s : %s = ?%n", req, x); Set roots = req.solve(); System.out.printf(" %s = %s%n", x, roots); assertEquals(roots, new EmptySet()); }
230231232233234235236237238239240
ExpressionContext.getInstance().addExpression(new Equality(x, x1)); return new FiniteSet(x1); } else if (!((ANumber) c).isNegative()) { return new EmptySet(); } } Expression x1 = new Sqrt(new Division(new Negation(c), a)); Expression x2 = new Negation(x1);
336337338339340341342343344345346
if (dd instanceof ANumber) { ANumber d = (ANumber) dd; if (d.isNegative()) { return new EmptySet(); } else if (d.isZero()) { return new FiniteSet(new Division(new Negation(b), new Multiplication(two, a)).evaluate()); } }
153154155156157158159160161162163164165
for (Equation e : equations) { System.out.printf(" solving %s: %s%n", e.getClass().getSimpleName(), e); results.add(e.solve()); } Set result = new EmptySet(); for (Set s : results) { result = result.union(s); } return result; }