Package org.jamesii.core.math.parsetree.math

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

40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
    node = getInstance(getA(3));
    ValueNode<Double> res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(1.) == 0);

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

    node =
        getInstance(new ListNode(toList(new MultNode(new ValueNode<>(2),
            new ValueNode<>(-2.)), new MultNode(new ValueNode<>(2),
            new ValueNode<>(-3.)))));
    res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(-4.) == 0);
  }
View Full Code Here
42
43
44
45
46
47
48
49
50
    node = getInstance(getA(5));
    res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(Math.log(0.)) == 0);

    node =
        getInstance((new MultNode(new ValueNode<>(2), new ValueNode<>(-2.))));
    res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(Math.log(-4.)) == 0);
  }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
    resList = res.getValue();
    assertTrue(resList.size() == 1);
    assertTrue(((ValueNode<Double>) resList.get(0)).getValue().compareTo(2.0) == 0);

    node =
        getInstance(new ListNode(toList(new MultNode(new ValueNode<>(2),
            new ValueNode<>(-2.)))));
    res = node.calc(null);
    resList = res.getValue();
    assertTrue(resList.size() == 0);

    node =
        getInstance(new ListNode(toList(new MultNode(new ValueNode<>(2),
            new ValueNode<>(-2.)), new MultNode(new ValueNode<>(2),
            new ValueNode<>(-3.)))));
    res = node.calc(null);
    resList = res.getValue();
    assertTrue(resList.size() == 1);
    assertTrue(((ValueNode<Double>) resList.get(0)).getValue().compareTo(-6.0) == 0);
View Full Code Here
42
43
44
45
46
47
48
49
50
    node = getInstance(getA(5));
    res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(Math.acos(0.)) == 0);

    node =
        getInstance((new MultNode(new ValueNode<>(2), new ValueNode<>(-2.))));
    res2 = node.calc(null);
    assertTrue(res2.getValue().compareTo(Math.acos(-4.)) == 0);
  }
View Full Code Here
17
18
19
20
21
22
23
*/
public class TestMultNode extends TestBinaryNode {

  @Override
  protected BinaryNode getInstance(INode left, INode right) {
    return new MultNode(left, right);
  }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
    node = getInstance(getA(4));
    res = node.calc(null);
    assertTrue(res.getValue().compareTo(4) == 0);

    node =
        getInstance(new ListNode(toList(new MultNode(new ValueNode<>(2),
            new ValueNode<>(-2)))));
    res = node.calc(null);
    assertTrue(res.getValue().compareTo(0) == 0);

    node =
        getInstance(new ListNode(toList(new MultNode(new ValueNode<>(2),
            new ValueNode<>(-2)), new MultNode(new ValueNode<>(2),
            new ValueNode<>(-3)), new MultNode(new ValueNode<>(1),
            new ValueNode<>(1)))));
    res = node.calc(null);
    assertTrue(res.getValue().compareTo(1) == 0);
  }
View Full Code Here
TOP

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

  • org.jamesii.core.math.parsetree.lists.TestHasElementsNode
  • org.jamesii.core.math.parsetree.lists.TestHeadNode
  • org.jamesii.core.math.parsetree.lists.TestLengthNode
  • org.jamesii.core.math.parsetree.lists.TestListNode
  • org.jamesii.core.math.parsetree.lists.TestTailNode
  • org.jamesii.core.math.parsetree.math.TestAbsNode
  • org.jamesii.core.math.parsetree.math.TestArcCosNode
  • org.jamesii.core.math.parsetree.math.TestArcSinNode
  • org.jamesii.core.math.parsetree.math.TestArcTanNode
  • org.jamesii.core.math.parsetree.math.TestCeilingNode
    • 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.