protected <T extends Tree> void scan(List<T> trees) { for (T tree : trees) { tree.accept(this); } }
public boolean isGlobal() { return tree.is(Tree.Kind.COMPILATION_UNIT); }
public static boolean isDescendant(Tree tree, Tree potentialParent) { Tree parent = tree; while (parent != null && !potentialParent.equals(parent)) { parent = parent.getParent(); } return potentialParent.equals(parent); }
@Override public void visitNode(Tree tree) { switch (tree.getKind()) { case CLASS_DECLARATION: classCounter++; break; case NAMESPACE_NAME: namespaceNameCounter++; break; case VARIABLE_IDENTIFIER: varIdentifierCounter++; break; default: break; } } }
private static boolean isNullLiteral(Tree tree) { return tree.is(Tree.Kind.NULL_LITERAL); }
private void visitAll(Iterable<? extends Tree> trees) { for (Tree tree : trees) { tree.accept(this); } }
private static boolean isLiteral(Tree arg) { return arg.is(Tree.Kind.NUMERIC_LITERAL, Tree.Kind.BOOLEAN_LITERAL, Tree.Kind.NULL_LITERAL, Tree.Kind.REGULAR_STRING_LITERAL); }
private void visitAll(Iterable<? extends Tree> trees) { for (Tree tree : trees) { tree.accept(this); } }
private static boolean isVariable(Tree arg) { return arg.is(Tree.Kind.VARIABLE_IDENTIFIER, Tree.Kind.VARIABLE_VARIABLE, Tree.Kind.NAME_IDENTIFIER); }
protected <T extends Tree> void scan(List<T> trees) { for (T tree : trees) { tree.accept(this); } }
private static boolean isLiteral(Tree arg) { return arg.is(Tree.Kind.NUMERIC_LITERAL, Tree.Kind.BOOLEAN_LITERAL, Tree.Kind.NULL_LITERAL, Tree.Kind.REGULAR_STRING_LITERAL); }
private LineVisitor(Tree tree) { tree.accept(this); }
public static boolean isFunction(Tree tree) { return tree.is(FUNCTION_KINDS_ARRAY); }
private LineVisitor(Tree tree) { tree.accept(this); }
private static boolean isNullLiteral(Tree tree) { return tree.is(Tree.Kind.NULL_LITERAL); }
private void visit(@Nullable Tree tree) { if (tree != null) { tree.accept(this); } }
public static boolean isFunction(Tree tree) { return tree.is(FUNCTION_KINDS_ARRAY); }
public static List<Tree> complexityNodesWithoutNestedFunctions(Tree tree) { ComplexityVisitor visitor = new ShallowComplexityVisitor(tree); tree.accept(visitor); return visitor.complexityTrees; }
private static boolean isVariable(Tree arg) { return arg.is(Tree.Kind.VARIABLE_IDENTIFIER, Tree.Kind.VARIABLE_VARIABLE, Tree.Kind.NAME_IDENTIFIER); }
public boolean isGlobal() { return tree.is(Tree.Kind.COMPILATION_UNIT); }