Package com.google.javascript.rhino

Examples of com.google.javascript.rhino.Node.addChildToBack()

942
943
944
945
946
947
948
949
950
951
952
        parse("a = b + c(d + e).print()"));
  }

  private Node createScript(Node n) {
    Node script = new Node(Token.SCRIPT);
    script.addChildToBack(n);
    return script;
  }

  public void testMethodInObjectLiteral() {
    testMethodInObjectLiteral("var a = {b() {}};");
View Full Code Here
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
   */
  static Node newVarNode(String name, Node value) {
    Node nodeName = IR.name(name);
    if (value != null) {
      Preconditions.checkState(value.getNext() == null);
      nodeName.addChildToBack(value);
      nodeName.srcref(value);
    }
    Node var = IR.var(nodeName).srcref(nodeName);

    return var;
View Full Code Here
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
  static Node newCallNode(Node callTarget, Node... parameters) {
    boolean isFreeCall = !isGet(callTarget);
    Node call = IR.call(callTarget);
    call.putBooleanProp(Node.FREE_CALL, isFreeCall);
    for (Node parameter : parameters) {
      call.addChildToBack(parameter);
    }
    return call;
  }

  /**
 
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155
    if (!guard.isEmpty()) {
      Node container = new Node(Token.BLOCK);
      n.replaceChild(guard, container);
      container.addChildToFront(IR.block(IR.exprResult(IR.assign(
        guardName.cloneTree(), guard.cloneTree()))));
      container.addChildToBack(guardName.cloneTree());
    }
    if (!incr.isEmpty()) {
      n.addChildBefore(IR.block(IR.exprResult(incr.detachFromParent())), n.getLastChild());
    }
    Node block = NodeUtil.getEnclosingType(n, Token.BLOCK);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    l.addChildToBack(i);
    l.addChildToBack(j);
    l.addChildToBack(k);

    m.addChildToBack(d);
    m.addChildToBack(h);
    m.addChildToBack(l);

    return m;
  }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
    l.addChildToBack(i);
    l.addChildToBack(j);
    l.addChildToBack(k);

    m.addChildToBack(d);
    m.addChildToBack(h);
    m.addChildToBack(l);

    return m;
  }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    l.addChildToBack(j);
    l.addChildToBack(k);

    m.addChildToBack(d);
    m.addChildToBack(h);
    m.addChildToBack(l);

    return m;
  }

  @Override
View Full Code Here
939
940
941
942
943
944
945
946
947
948
949
        IR.assign(finallyName.cloneTree(), IR.number(jumpPoint)));
    Node toFinally = createStateUpdate(finallyStartState);
    Node returnPoint = IR.number(jumpPoint);
    returnPoint.setGeneratorMarker(true);
    Node returnBlock = IR.block(setReturnState, toFinally, createSafeBreak());
    returnBlock.addChildToBack(returnPoint);
    return returnBlock;
  }

  private LoopContext getLoopContext(String label) {
    for (int i = 0; i < currentLoopContext.size(); i++) {
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
   */
  public void testNegatedNameCondition() throws Exception {
    FlowScope blind = newScope();
    Node a = createVar(blind, "a", createNullableType(STRING_TYPE));
    Node condition = new Node(Token.NOT);
    condition.addChildToBack(a);

    // true outcome.
    FlowScope informedTrue = interpreter.
        getPreciserScopeKnowingConditionOutcome(condition, blind, true);
    assertTypeEquals(createNullableType(STRING_TYPE),
View Full Code Here
549
550
551
552
553
554
555
556
557
558
559
  private void testBinop(FlowScope blind, int binop, Node left, Node right,
      Collection<TypedName> trueOutcome,
      Collection<TypedName> falseOutcome) {
    Node condition = new Node(binop);
    condition.addChildToBack(left);
    condition.addChildToBack(right);

    // true outcome.
    FlowScope informedTrue = interpreter.
        getPreciserScopeKnowingConditionOutcome(condition, blind, true);
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.