Examples of BinaryNode


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

   */
  public void testSetRight() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    ValueNode<Integer> c = new ValueNode<>(6);
    BinaryNode testNode = getInstance(a, b);
    testNode.setRight(c);
    assertTrue(testNode.getRight() == c);
  }
View Full Code Here

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

   */
  public void testSetLeft() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    ValueNode<Integer> c = new ValueNode<>(6);
    BinaryNode testNode = getInstance(a, b);
    testNode.setLeft(c);
    assertTrue(testNode.getLeft() == c);
  }
View Full Code Here

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

   * Test get op.
   */
  public void testGetOp() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    BinaryNode testNode = getInstance(a, b);
    assertTrue(testNode.getName() != null);
  }
View Full Code Here

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

   * Test to string.
   */
  public void testToString() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    BinaryNode testNode = getInstance(a, b);
    assertTrue(testNode.toString() != null);
  }
View Full Code Here

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

  @Override
  public void testGetChildren() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    BinaryNode testNode = getInstance(a, b);
    List<INode> res = testNode.getChildren();
    assertTrue(res.size() == 2);
    assertTrue(res.contains(a));
    assertTrue(res.contains(b));
  }
View Full Code Here

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

    return new IsLowerOrEqualNode(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

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

    return new AddNode(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(3.) == 0);

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

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

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

  }
View Full Code Here

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

    return new ImpliesNode(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());

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

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

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

    return new PowerNode(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<Double> 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(8.) == 0);

    node3 = getInstance(new ValueNode<>(2), new ValueNode<>(0.));
    res3 = node3.calc(null);
    assertTrue(res3.getValue().compareTo(1.) == 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(1.) == 0);

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

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

  }
View Full Code Here

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

    return new XorNode(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());
  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.