Package com.google.javascript.rhino

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

1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
      current = new Node(Token.ADD, current);

      // 1000 is printed as 1E3, and screws up our test.
      int num = i % 1000;
      numbers.add(String.valueOf(num));
      current.addChildToBack(Node.newNumber(num));
    }

    String expected = Joiner.on("+").join(numbers);
    String actual = printNode(current).replace("\n", "");
    assertEquals(expected, actual);
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
        if (forCondition.isEmpty()) {
          n.replaceChild(forCondition, fixedIfCondition);
        } else {
          Node replacement = new Node(Token.AND);
          n.replaceChild(forCondition, replacement);
          replacement.addChildToBack(forCondition);
          replacement.addChildToBack(fixedIfCondition);
        }

        reportCodeChange();
      }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
          n.replaceChild(forCondition, fixedIfCondition);
        } else {
          Node replacement = new Node(Token.AND);
          n.replaceChild(forCondition, replacement);
          replacement.addChildToBack(forCondition);
          replacement.addChildToBack(fixedIfCondition);
        }

        reportCodeChange();
      }
    }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
            //   if (x||y) return 1;
            child.detachFromParent();
            child.detachChildren();
            Node newCond = new Node(Token.OR, cond);
            nextNode.replaceChild(nextCond, newCond);
            newCond.addChildToBack(nextCond);
            reportCodeChange();
          } else if (nextElse != null
              && thenBranch.isEquivalentToTyped(nextElse)) {
            // Transform
            //   if (x) return 1; if (y) foo() else return 1;
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
            child.detachFromParent();
            child.detachChildren();
            Node newCond = new Node(Token.AND,
                IR.not(cond).srcref(cond));
            nextNode.replaceChild(nextCond, newCond);
            newCond.addChildToBack(nextCond);
            reportCodeChange();
          }
        } else if (nextNode != null && elseBranch == null &&
            isReturnBlock(thenBranch) && isReturnExpression(nextNode)) {
          Node thenExpr = null;
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
    Node node = new Node(Token.CONTINUE);
    Scope localScope = context.scopeManager.localScope();
    double toLabel = getOwnConfig().get("toLabel").getAsDouble();
    if (budget > 1 && !localScope.loopLabels.isEmpty()
        && context.random.nextDouble() < toLabel) {
      node.addChildToBack(
          Node.newString(Token.LABEL_NAME,
              localScope.randomLabelForContinue(context.random)));
    }
    return node;
  }
View Full Code Here
246
247
248
249
250
251
252
253
254
255
256
    protected void insertAliasDeclaration(Node codeRoot) {
      Node varNode = new Node(Token.VAR);
      Node value = new Node(getTokenId());
      Node name = NodeUtil.newName(
          compiler, getAliasName(), varNode, getAliasName());
      name.addChildToBack(value);
      varNode.addChildToBack(name);
      codeRoot.addChildrenToFront(varNode);
    }
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
  @Override
  protected Node generate(int budget, Set<Type> types) {
    Node node = new Node(Token.RETURN);
    if (budget > 1 &&
        context.random.nextDouble() < getOwnConfig().get("hasValue").getAsDouble()) {
      node.addChildToBack(
          new ExpressionFuzzer(context).
          generate(budget - 1));
    }
    return node;
  }
View Full Code Here
287
288
289
290
291
292
293
294
295
296
297
    protected void insertAliasDeclaration(Node codeRoot) {
      Node varNode = new Node(Token.VAR);
      Node value = IR.voidNode(IR.number(0));
      Node name = NodeUtil.newName(
          compiler, getAliasName(), varNode, getAliasName());
      name.addChildToBack(value);
      varNode.addChildToBack(name);
      codeRoot.addChildrenToFront(varNode);
    }
  }
View Full Code Here
782
783
784
785
786
787
788
789
790
791
792
    // Split the string and convert the returned array into JS nodes
    String[] stringArray = jsSplit(stringValue, separator, limit);
    Node arrayOfStrings = IR.arraylit();
    for (int i = 0; i < stringArray.length; i++) {
      arrayOfStrings.addChildToBack(
          IR.string(stringArray[i]).srcref(stringNode));
    }

    Node parent = n.getParent();
    parent.replaceChild(n, arrayOfStrings);
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.