Package org.sbml.jsbml

Examples of org.sbml.jsbml.ASTNode.addChild()

299
300
301
302
303
304
305
306
307
308
309
        break;
      case MINUS:
        jj_consume_token(MINUS);
        rightChild = TermLvl2();
      node = new ASTNode('-');
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      case BOOLEAN_LOGIC:
        t = jj_consume_token(BOOLEAN_LOGIC);
        rightChild = TermLvl2();
View Full Code Here
300
301
302
303
304
305
306
307
308
309
310
      case MINUS:
        jj_consume_token(MINUS);
        rightChild = TermLvl2();
      node = new ASTNode('-');
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      case BOOLEAN_LOGIC:
        t = jj_consume_token(BOOLEAN_LOGIC);
        rightChild = TermLvl2();
      s = t.image;
View Full Code Here
319
320
321
322
323
324
325
326
327
328
329
      else if (s.equalsIgnoreCase("xor"))
      {
        type = ASTNode.Type.LOGICAL_XOR;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      case COMPARISON:
        t = jj_consume_token(COMPARISON);
        rightChild = TermLvl2();
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
      {
        type = ASTNode.Type.LOGICAL_XOR;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      case COMPARISON:
        t = jj_consume_token(COMPARISON);
        rightChild = TermLvl2();
      s = t.image;
View Full Code Here
351
352
353
354
355
356
357
358
359
360
361
      else if (s.equalsIgnoreCase("<="))
      {
        type = ASTNode.Type.RELATIONAL_LEQ;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      default:
        jj_la1[6] = jj_gen;
        jj_consume_token(-1);
View Full Code Here
352
353
354
355
356
357
358
359
360
361
362
      {
        type = ASTNode.Type.RELATIONAL_LEQ;
      }
      node = new ASTNode(type);
      node.addChild(leftChild);
      node.addChild(rightChild);
        break;
      default:
        jj_la1[6] = jj_gen;
        jj_consume_token(-1);
        throw new ParseException();
View Full Code Here
511
512
513
514
515
516
517
518
519
520
521
          break;
        case MINUS:
          jj_consume_token(MINUS);
          node = Primary();
    ASTNode uiMinus = new ASTNode('-');
    uiMinus.addChild(node);
    {if (true) return uiMinus;}
          break;
        case NOT:
          jj_consume_token(NOT);
          node = TermLvl1();
View Full Code Here
518
519
520
521
522
523
524
525
526
527
528
          break;
        case NOT:
          jj_consume_token(NOT);
          node = TermLvl1();
    ASTNode not = new ASTNode(Type.LOGICAL_NOT);
    not.addChild(node);
    {if (true) return not;}
          break;
        case LOG:
          jj_consume_token(LOG);
          child = Primary();
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
    int version = 1;
    SBMLDocument doc = new SBMLDocument(level, 1);
    Model m = doc.createModel("id");
    FunctionDefinition fd = m.createFunctionDefinition("fd");
    ASTNode math = new ASTNode(Type.LAMBDA, fd);
    math.addChild(new ASTNode("x", fd));
    ASTNode pieces = ASTNode.piecewise(new ASTNode(3, fd), ASTNode.lt("x",
        ASTNode.abs(Double.NEGATIVE_INFINITY, fd)), ASTNode.times(
        new ASTNode(5.3, fd), ASTNode.log(new ASTNode(8, fd))));
    pieces = ASTNode.times(pieces, ASTNode.root(new ASTNode(2, fd),
        new ASTNode(16, fd)));
View Full Code Here
520
521
522
523
524
525
526
527
528
529
530
  public void test_ASTNode_isUMinus()
  {
    ASTNode n = new  ASTNode();
    n.setType(ASTNode.Type.MINUS);
    assertTrue( n.isUMinus() == false );
    n.addChild(new  ASTNode(ASTNode.Type.NAME));
    assertTrue( n.isUMinus() == true );
    n = null;
  }

  @SuppressWarnings("deprecation")
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.