Example usage for org.eclipse.jdt.core.dom ASTVisitor visit

List of usage examples for org.eclipse.jdt.core.dom ASTVisitor visit

  1. HOME
  2. Java
  3. org.eclipse.jdt
  4. org.eclipse.jdt.core.dom.*
  5. ASTVisitor
  6. visit

Introduction

In this page you can find the example usage for org.eclipse.jdt.core.dom ASTVisitor visit.

Prototype

public boolean visit(YieldStatement node)

Source Link

Document

Visits the given type-specific AST node.

Usage

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(AnnotationTypeDeclaration node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, AnnotationTypeDeclaration.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*  w  w w .j a v a2  s.  co m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(AnnotationTypeMemberDeclaration node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, AnnotationTypeMemberDeclaration.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*from  ww  w .  jav a2s  .  c  o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(AnonymousClassDeclaration node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, AnonymousClassDeclaration.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*from www.  j  ava2 s . c o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(ArrayAccess node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, ArrayAccess.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*w  w  w . j  a  v a2 s  .  c  o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(ArrayCreation node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, ArrayCreation.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {//from w ww  .  j a va 2 s . c  o m
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(ArrayInitializer node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, ArrayInitializer.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*from  ww w. j a  va 2s . c  o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(ArrayType node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, ArrayType.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*from w ww  . jav a 2s.c o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(AssertStatement node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, AssertStatement.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/* w  w  w.  j a  va  2s .  c  o  m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(Assignment node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, Assignment.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/* w w  w.j a  va 2s  .  c  o m*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}

From source file:org.autorefactor.refactoring.rules.AggregateASTVisitor.java

License:Open Source License

@Override
public boolean visit(Block node) {
    final List<ASTVisitor> visitorList = getVisitors(visitorsMap, Block.class);
    for (Iterator<ASTVisitor> iter = visitorList.iterator(); iter.hasNext();) {
        final ASTVisitor v = iter.next();
        try {/*  www. j a  va2  s . c om*/
            if (!continueVisiting(v.visit(node), v, node)) {
                return DO_NOT_VISIT_SUBTREE;
            }
        } catch (Exception e) {
            logFaultyVisitor(v, node, e);
            iter.remove();
        }
    }
    return VISIT_SUBTREE;
}