Package org.jamesii.core.math.parsetree

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

22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
    return new MinusNode(left, right);
  }

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

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

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

  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
    return new IsGreaterOrEqualNode(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
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
    return new AndNode(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
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
    return new DivNode(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);

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

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

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

  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
    return new IsNotEqualNode(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());

    b =
        getInstance(new AddNode(new ValueNode<>(1), new ValueNode<>(1)),
            new AddNode(new ValueNode<>(1), new ValueNode<>(1)));
    result = b.calc(null);
    assertTrue(!result.getValue());
  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
    return new IsLowerNode(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
22
23
24
25
26
27
28
29
30
31
32
33
34
35
    return new ModNode(left, right);
  }

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

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

  }
View Full Code Here
37
38
39
40
41
42
43
44
   * Test get right.
   */
  public void testGetRight() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    BinaryNode testNode = getInstance(a, b);
    assertTrue(testNode.getRight() == b);
  }
View Full Code Here
47
48
49
50
51
52
53
54
   * Test get left.
   */
  public void testGetLeft() {
    ValueNode<Integer> a = new ValueNode<>(2);
    ValueNode<Integer> b = new ValueNode<>(4);
    BinaryNode testNode = getInstance(a, b);
    assertTrue(testNode.getLeft() == a);
  }
View Full Code Here
58
59
60
61
62
63
64
65
66
   */
  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
TOP

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

  • org.jamesii.core.math.parsetree.bool.TestAndNode
  • org.jamesii.core.math.parsetree.bool.TestImpliesNode
  • org.jamesii.core.math.parsetree.bool.TestIsEqualNode
  • org.jamesii.core.math.parsetree.bool.TestIsGreaterNode
  • org.jamesii.core.math.parsetree.bool.TestIsGreaterOrEqualNode
  • org.jamesii.core.math.parsetree.bool.TestIsLowerNode
  • org.jamesii.core.math.parsetree.bool.TestIsLowerOrEqualNode
  • org.jamesii.core.math.parsetree.bool.TestIsNotEqualNode
  • org.jamesii.core.math.parsetree.bool.TestOrNode
  • org.jamesii.core.math.parsetree.bool.TestXorNode
    • 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.