@Override public Void visitClass(ClassTree classTree, VisitorState visitorState) { boolean priorInShadowClass = inShadowClass; inShadowClass = hasAnnotation(classTree, Implements.class, visitorState); try { return super.visitClass(classTree, visitorState); } finally { inShadowClass = priorInShadowClass; } }
@Override public Void visitClass(ClassTree classTree, VisitorState visitorState) { boolean priorInShadowClass = inShadowClass; inShadowClass = hasAnnotation(classTree, Implements.class, visitorState); try { return super.visitClass(classTree, visitorState); } finally { inShadowClass = priorInShadowClass; } }
@Override public Void visitClass(ClassTree node, Context context) { rules.addAll(RefasterRuleBuilderScanner.extractRules(node, context)); return super.visitClass(node, context); } }.scan(tree, context);
className = node.getSimpleName().toString(); fqn = getElement(node).asType().toString(); return super.visitClass(node, v); } finally { className = oldClassName;
@Override public Void visitClass(ClassTree arg0, Void arg1) { // stop the checks if a new type is encountered checkStopped = true; return super.visitClass(arg0, arg1); }
@Override public Void visitClass(ClassTree node, Void p) { if (fromIdx[0] < -2) return super.visitClass(node, p); fromIdx[0] = ((IndexedClassDecl)node).index; return null; } @Override
@Override public Void visitClass(ClassTree node, Context context) { rules.addAll(RefasterRuleBuilderScanner.extractRules(node, context)); return super.visitClass(node, context); } }.scan(tree, context);
@Override public Void visitClass(ClassTree node, Void p) { if (firstInner == -1) { firstInner = ((IndexedClassDecl)node).index; } if (node.getSimpleName().length() != 0) { hasLocalClass = true; } noInner++; handleDoc(node); return super.visitClass(node, p); }
@Override public Void visitClass(ClassTree node, Void p) { String parent = fqn.getFQN(); fqn.enterClass(node); overlay.registerClass(parent, fqn.getFQN(), node, true); super.visitClass(node, p); fqn.leaveClass(); return null; } }.scan(t, null);
public Boolean visitClass(ClassTree node, TreePath p) { if (p == null) return super.visitClass(node, p);
try { className = node.getSimpleName().toString(); return super.visitClass(node, v); } finally { className = oldClassName;
try { className = node.getSimpleName().toString(); return super.visitClass(node, v); } finally { className = oldClassName;
/** * Class declaration. */ public Void visitClass(ClassTree ct, Void _) { TypeElement e = (TypeElement) TreeUtil.getElement(ct); if(e!=null) { // put the marker on the class name portion. Token token=null; if(ct.getModifiers()!=null) token = gen.findTokenAfter(ct.getModifiers(), true, ct.getSimpleName().toString()); // on enum class, like "public enum En {ABC,DEF}", the above returns null somehow. // so go with the plan B if it's not found. // TODO: report to javac team if(token==null) token = gen.findTokenAfter(ct, false, ct.getSimpleName().toString()); if(token!=null) gen.add(new DeclName(lineMap, token)); List<ParsedType> descendants = getParsedType(e).descendants; gen.add(new ClassDecl(cu, srcPos, ct, e, descendants)); if(e.getNestingKind()== NestingKind.ANONYMOUS) { // don't visit the extends and implements clause as // they already show up in the NewClassTree scan(ct.getMembers()); return _; } } return super.visitClass(ct, _); }