private void createParentLink(JavaTree tree) { if (!tree.isLeaf()) { for (Iterator<Tree> iter = tree.childrenIterator(); iter.hasNext(); ) { Tree next = iter.next(); if (next != null) { parentLink.put(next, tree); createParentLink((JavaTree) next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Iterator<Tree> iter = javaTree.childrenIterator(); iter.hasNext(); ) { Tree next = iter.next(); if (next != null) { visit(next); } } } }
private Tree createParentLink(JavaTree topParent) { parentList.push(topParent); while (!parentList.isEmpty()) { JavaTree parent = parentList.pop(); if (!parent.isLeaf()) { for (Tree nextTree : parent.getChildren()) { JavaTree next = (JavaTree) nextTree; if (next != null) { next.setParent(parent); parentList.push(next); } } } } return topParent; } }
private Tree createParentLink(JavaTree topParent) { parentList.push(topParent); while (!parentList.isEmpty()) { JavaTree parent = parentList.pop(); if (!parent.isLeaf()) { for (Tree nextTree : parent.getChildren()) { JavaTree next = (JavaTree) nextTree; if (next != null) { next.setParent(parent); parentList.push(next); } } } } return topParent; } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Iterator<Tree> iter = javaTree.childrenIterator(); iter.hasNext(); ) { Tree next = iter.next(); if (next != null && !isExcluded(next)) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.children()) { if (next != null) { visit(next); } } } }
private static boolean containsChildrenOfKind(JavaTree tree, Tree.Kind... kinds) { if (Arrays.asList(kinds).contains(tree.kind())) { return true; } if (!tree.isLeaf()) { for (Tree javaTree : tree.getChildren()) { if (javaTree != null && containsChildrenOfKind((JavaTree) javaTree, kinds)) { return true; } } } return false; }
void handleMissingTypes(Tree tree) { parentList.push((JavaTree) tree); while (!parentList.isEmpty()) { JavaTree parent = parentList.pop(); if (parent instanceof AbstractTypedTree) { ((AbstractTypedTree) parent).completeMissingType(); } if (!parent.isLeaf()) { for (Tree nextTree : parent.getChildren()) { JavaTree next = (JavaTree) nextTree; if (next != null) { next.setParent(parent); parentList.push(next); } } } } } }
private static boolean containsChildrenOfKind(JavaTree tree, Tree.Kind... kinds) { if (Arrays.asList(kinds).contains(tree.kind())) { return true; } if (!tree.isLeaf()) { for (Tree javaTree : tree.getChildren()) { if (javaTree != null && containsChildrenOfKind((JavaTree) javaTree, kinds)) { return true; } } } return false; }
void handleMissingTypes(Tree tree) { parentList.push((JavaTree) tree); while (!parentList.isEmpty()) { JavaTree parent = parentList.pop(); if (parent instanceof AbstractTypedTree) { ((AbstractTypedTree) parent).completeMissingType(); } if (!parent.isLeaf()) { for (Tree nextTree : parent.getChildren()) { JavaTree next = (JavaTree) nextTree; if (next != null) { next.setParent(parent); parentList.push(next); } } } } } }
private boolean containsChildrenOfKind(JavaTree tree, Tree.Kind... kinds) { for (Tree.Kind kind : kinds) { if (tree.is(kind)) { return true; } } if (!tree.isLeaf()) { Iterator<Tree> treeIterator = tree.childrenIterator(); while (treeIterator.hasNext()) { JavaTree javaTree = (JavaTree) treeIterator.next(); if (javaTree != null && containsChildrenOfKind(javaTree, kinds)) { return true; } } } return false; }
private static boolean areEquivalent(@Nullable JavaTree leftNode, @Nullable JavaTree rightNode) { if (leftNode == rightNode) { return true; } if (leftNode == null || rightNode == null) { return false; } if (leftNode.kind() != rightNode.kind() || leftNode.is(Tree.Kind.OTHER)) { return false; } else if (leftNode.isLeaf()) { return areLeafsEquivalent(leftNode, rightNode); } Iterator<Tree> iteratorA = leftNode.getChildren().iterator(); Iterator<Tree> iteratorB = rightNode.getChildren().iterator(); while (iteratorA.hasNext() && iteratorB.hasNext()) { if (!areEquivalent(iteratorA.next(), iteratorB.next())) { return false; } } return !iteratorA.hasNext() && !iteratorB.hasNext(); }
private static boolean areEquivalent(@Nullable JavaTree leftNode, @Nullable JavaTree rightNode) { if (leftNode == rightNode) { return true; } if (leftNode == null || rightNode == null) { return false; } if (leftNode.kind() != rightNode.kind() || leftNode.is(Tree.Kind.OTHER)) { return false; } else if (leftNode.isLeaf()) { return areLeafsEquivalent(leftNode, rightNode); } Iterator<Tree> iteratorA = leftNode.children().iterator(); Iterator<Tree> iteratorB = rightNode.children().iterator(); while (iteratorA.hasNext() && iteratorB.hasNext()) { if (!areEquivalent(iteratorA.next(), iteratorB.next())) { return false; } } return !iteratorA.hasNext() && !iteratorB.hasNext(); }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null && !isExcluded(next)) { visit(next); } } } }
private void visitChildren(Tree tree) { JavaTree javaTree = (JavaTree) tree; if (!javaTree.isLeaf()) { for (Tree next : javaTree.getChildren()) { if (next != null && !isExcluded(next)) { visit(next); } } } }
private static Tree createParentLink(JavaTree parent) { if (!parent.isLeaf()) { for (Tree nextTree : parent.children()) { JavaTree next = (JavaTree) nextTree; if (next != null) { next.setParent(parent); createParentLink(next); } } } return parent; } }