Examples with GenericVisitor org.eclipse.jdt.internal.corext.dom.GenericVisitor used on opensource projects

Example 6 with GenericVisitor

use of org.eclipse.jdt.internal.corext.dom.GenericVisitor in project che by eclipse.

the class AdvancedQuickAssistProcessor method getFullyCoveredNodes.

static ArrayList<ASTNode> getFullyCoveredNodes(IInvocationContext context, ASTNode coveringNode) {
    final ArrayList<ASTNode> coveredNodes = new ArrayList<ASTNode>();
    final int selectionBegin = context.getSelectionOffset();
    final int selectionEnd = selectionBegin + context.getSelectionLength();
    coveringNode.accept(new GenericVisitor() {

        @Override
        protected boolean visitNode(ASTNode node) {
            int nodeStart = node.getStartPosition();
            int nodeEnd = nodeStart + node.getLength();
            // if node does not intersects with selection, don't visit children
            if (nodeEnd < selectionBegin || selectionEnd < nodeStart) {
                return false;
            }
            // if node is fully covered, we don't need to visit children
            if (isCovered(node)) {
                ASTNode parent = node.getParent();
                if (parent == null || !isCovered(parent)) {
                    coveredNodes.add(node);
                    return false;
                }
            }
            // if node only partly intersects with selection, we try to find fully covered children
            return true;
        }

        private boolean isCovered(ASTNode node) {
            int begin = node.getStartPosition();
            int end = begin + node.getLength();
            return begin >= selectionBegin && end <= selectionEnd;
        }
    });
    return coveredNodes;
}

Example 7 with GenericVisitor

use of org.eclipse.jdt.internal.corext.dom.GenericVisitor in project flux by eclipse.

the class AdvancedQuickAssistProcessor method getFullyCoveredNodes.

static ArrayList<ASTNode> getFullyCoveredNodes(IInvocationContext context, ASTNode coveringNode) {
    final ArrayList<ASTNode> coveredNodes = new ArrayList<ASTNode>();
    final int selectionBegin = context.getSelectionOffset();
    final int selectionEnd = selectionBegin + context.getSelectionLength();
    coveringNode.accept(new GenericVisitor() {

        @Override
        protected boolean visitNode(ASTNode node) {
            int nodeStart = node.getStartPosition();
            int nodeEnd = nodeStart + node.getLength();
            // if node does not intersects with selection, don't visit children
            if (nodeEnd < selectionBegin || selectionEnd < nodeStart) {
                return false;
            }
            // if node is fully covered, we don't need to visit children
            if (isCovered(node)) {
                ASTNode parent = node.getParent();
                if (parent == null || !isCovered(parent)) {
                    coveredNodes.add(node);
                    return false;
                }
            }
            // if node only partly intersects with selection, we try to find fully covered children
            return true;
        }

        private boolean isCovered(ASTNode node) {
            int begin = node.getStartPosition();
            int end = begin + node.getLength();
            return begin >= selectionBegin && end <= selectionEnd;
        }
    });
    return coveredNodes;
}