Package org.jamesii.core.math.parsetree

Examples of org.jamesii.core.math.parsetree.BinaryNode


    return new IsGreaterNode(left, right);
  }

  @Override
  public void testCalc() {
    BinaryNode b = getInstance(new ValueNode<>(0), new ValueNode<>(1));
    ValueNode<Boolean> result = b.calc(null);
    assertTrue(!result.getValue());

    b = getInstance(new ValueNode<>(5), new ValueNode<>(1));
    result = b.calc(null);
    assertTrue(result.getValue());

    b = getInstance(new ValueNode<>(5), new ValueNode<>(5));
    result = b.calc(null);
    assertTrue(!result.getValue());

    b = getInstance(new ValueNode<>(2.), new ValueNode<>(7.));
    result = b.calc(null);
    assertTrue(!result.getValue());

    b = getInstance(new ValueNode<>(42.), new ValueNode<>(3.5));
    result = b.calc(null);
    assertTrue(result.getValue());

    // check sub tree handling
    b =
        getInstance(new AddNode(new ValueNode<>(5), new ValueNode<>(6)),
            new ValueNode<>(1));
    result = b.calc(null);
    assertTrue(result.getValue());

    b =
        getInstance(new ValueNode<>(1), new AddNode(new ValueNode<>(5),
            new ValueNode<>(6)));
    result = b.calc(null);
    assertTrue(!result.getValue());

    b =
        getInstance(new AddNode(new ValueNode<>(1), new ValueNode<>(1)),
            new AddNode(new ValueNode<>(5), new ValueNode<>(6)));
    result = b.calc(null);
    assertTrue(!result.getValue());
  }
View Full Code Here


    return new MultNode(left, right);
  }

  @Override
  public void testCalc() {
    BinaryNode node = getInstance(new ValueNode<>(2.), new ValueNode<>(1.));
    ValueNode<Double> res = node.calc(null);
    assertTrue(res.getValue().compareTo(2.) == 0);

    BinaryNode node2 = getInstance(new ValueNode<>(2), new ValueNode<>(1));
    ValueNode<Integer> res2 = node2.calc(null);
    assertTrue(res2.getValue().compareTo(2) == 0);

    BinaryNode node3 = getInstance(new ValueNode<>(2), new ValueNode<>(3.));
    ValueNode<Double> res3 = node3.calc(null);
    assertTrue(res3.getValue().compareTo(6.) == 0);

    BinaryNode node4 =
        getInstance(getInstance(new ValueNode<>(1), new ValueNode<>(3.)),
            getInstance(new ValueNode<>(2), new ValueNode<>(3.)));
    ValueNode<Double> res4 = node4.calc(null);
    assertTrue(res4.getValue().compareTo(18.) == 0);

  }
View Full Code Here

    return new OrNode(left, right);
  }

  @Override
  public void testCalc() {
    BinaryNode b = getInstance(new ValueNode<>(true), new ValueNode<>(false));
    ValueNode<Boolean> result = b.calc(null);
    assertTrue(result.getValue());

    b = getInstance(new ValueNode<>(true), new ValueNode<>(true));
    result = b.calc(null);
    assertTrue(result.getValue());

    b = getInstance(new ValueNode<>(false), new ValueNode<>(true));
    result = b.calc(null);
    assertTrue(result.getValue());

    b = getInstance(new ValueNode<>(false), new ValueNode<>(false));
    result = b.calc(null);
    assertTrue(!result.getValue());

    // check sub tree handling
    b =
        getInstance(new OrNode(new ValueNode<>(true), new ValueNode<>(true)),
            new ValueNode<>(false));
    result = b.calc(null);
    assertTrue(result.getValue());

    b =
        getInstance(new ValueNode<>(false), new OrNode(new ValueNode<>(true),
            new ValueNode<>(false)));
    result = b.calc(null);
    assertTrue(result.getValue());

    b =
        getInstance(new OrNode(new ValueNode<>(false), new ValueNode<>(true)),
            new AndNode(new ValueNode<>(true), new ValueNode<>(true)));
    result = b.calc(null);
    assertTrue(result.getValue());
  }
View Full Code Here

TOP

Related Classes of org.jamesii.core.math.parsetree.BinaryNode

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.