private void visitAll(Iterable<? extends Tree> trees) { for (Tree tree : trees) { tree.accept(this); } }
private void visitAll(Iterable<? extends Tree> trees) { for (Tree tree : trees) { tree.accept(this); } }
protected <T extends Tree> void scan(List<T> trees) { for (T tree : trees) { tree.accept(this); } }
protected <T extends Tree> void scan(List<T> trees) { for (T tree : trees) { tree.accept(this); } }
private void visit(@Nullable Tree tree) { if (tree != null) { tree.accept(this); } }
private void visit(@Nullable Tree tree) { if (tree != null) { tree.accept(this); } }
private void visitWithNesting(@Nullable Tree tree) { if (tree != null) { visitWithNesting(() -> tree.accept(this)); } }
public static List<Tree> complexityNodesWithoutNestedFunctions(Tree tree) { ComplexityVisitor visitor = new ShallowComplexityVisitor(tree); tree.accept(visitor); return visitor.complexityTrees; }
public static List<Tree> complexityNodesWithoutNestedFunctions(Tree tree) { ComplexityVisitor visitor = new ShallowComplexityVisitor(tree); tree.accept(visitor); return visitor.complexityTrees; }
private static List<ReturnStatementTree> getReturnedStatements(Tree body) { ReturnStatementCollector visitor = new ReturnStatementCollector(); body.accept(visitor); return visitor.returnStatements; }
static Map<Symbol, VariableUsage> getVariableUsages(Tree tree, SymbolTable symbols) { ReadWriteVisitor visitor = new ReadWriteVisitor(symbols); tree.accept(visitor); return visitor.variables; }
protected void scan(Tree tree) { Iterator<Tree> childrenIterator = ((PHPTree) tree).childrenIterator(); Tree child; while (childrenIterator.hasNext()) { child = childrenIterator.next(); if (child != null) { child.accept(this); } } }
public ReadWriteUsages(Tree tree, SymbolTable symbolTable) { this.symbolTable = symbolTable; tree.accept(new UsageVisitor()); }
protected void scan(Tree tree) { Iterator<Tree> childrenIterator = ((PHPTree) tree).childrenIterator(); Tree child; while (childrenIterator.hasNext()) { child = childrenIterator.next(); if (child != null) { child.accept(this); } } }
private static boolean containsTryCatchBlock(Tree tree) { TryVisitor tryVisitor = new TryVisitor(); tree.accept(tryVisitor); return tryVisitor.hasTry; }
private static boolean containsTryCatchBlock(Tree tree) { TryVisitor tryVisitor = new TryVisitor(); tree.accept(tryVisitor); return tryVisitor.hasTry; }
public static List<Tree> complexityTrees(Tree tree) { ComplexityVisitor visitor = new ComplexityVisitor(); tree.accept(visitor); return visitor.complexityTrees; }
public static List<Tree> complexityTrees(Tree tree) { ComplexityVisitor visitor = new ComplexityVisitor(); tree.accept(visitor); return visitor.complexityTrees; }
static Map<Symbol, VariableUsage> getVariableUsages(Tree tree, SymbolTable symbols) { ReadWriteVisitor visitor = new ReadWriteVisitor(symbols); tree.accept(visitor); return visitor.variables; }
@Override public void visitMemberAccess(MemberAccessTree tree) { boolean functionCall = tree.getParent().is(Kind.FUNCTION_CALL) && ((FunctionCallTree) tree.getParent()).callee() == tree; tree.object().accept(this); classMemberUsageState = new ClassMemberUsageState(); classMemberUsageState.isStatic = tree.isStatic(); classMemberUsageState.isSelfMember = isSelfMember(tree); classMemberUsageState.isField = !functionCall; classMemberUsageState.isConst = classMemberUsageState.isField && tree.isStatic(); tree.member().accept(this); }