001: /*
002: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
003: *
004: * Copyright 1997-2007 Sun Microsystems, Inc. All rights reserved.
005: *
006: * The contents of this file are subject to the terms of either the GNU
007: * General Public License Version 2 only ("GPL") or the Common
008: * Development and Distribution License("CDDL") (collectively, the
009: * "License"). You may not use this file except in compliance with the
010: * License. You can obtain a copy of the License at
011: * http://www.netbeans.org/cddl-gplv2.html
012: * or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
013: * specific language governing permissions and limitations under the
014: * License. When distributing the software, include this License Header
015: * Notice in each file and include the License file at
016: * nbbuild/licenses/CDDL-GPL-2-CP. Sun designates this
017: * particular file as subject to the "Classpath" exception as provided
018: * by Sun in the GPL Version 2 section of the License file that
019: * accompanied this code. If applicable, add the following below the
020: * License Header, with the fields enclosed by brackets [] replaced by
021: * your own identifying information:
022: * "Portions Copyrighted [year] [name of copyright owner]"
023: *
024: * If you wish your version of this file to be governed by only the CDDL
025: * or only the GPL Version 2, indicate your decision by adding
026: * "[Contributor] elects to include this software in this distribution
027: * under the [CDDL or GPL Version 2] license." If you do not indicate a
028: * single choice of license, a recipient has the option to distribute
029: * your version of this file under either the CDDL, the GPL Version 2 or
030: * to extend the choice of license to its licensees as provided above.
031: * However, if you add GPL Version 2 code and therefore, elected the GPL
032: * Version 2 license, then the option applies only if the new code is
033: * made subject to such option by the copyright holder.
034: *
035: * Contributor(s):
036: *
037: * Portions Copyrighted 2008 Sun Microsystems, Inc.
038: */
039: package org.netbeans.modules.css.parser;
040:
041: import java.util.ArrayList;
042:
043: /**
044: *
045: * @author marek
046: */
047: public class SimpleNodeUtil {
048:
049: public static SimpleNode findDescendant(SimpleNode node,
050: int astOffset) {
051: int so = node.startOffset();
052: int eo = node.endOffset();
053:
054: if (astOffset < so || astOffset > eo) {
055: //we are out of the scope - may happen just with the first client call
056: return null;
057: }
058:
059: if (astOffset >= so && astOffset <= eo
060: && node.jjtGetNumChildren() == 0) {
061: //if the node matches and has no children we found it
062: return node;
063: }
064:
065: for (int i = 0; i < node.jjtGetNumChildren(); i++) {
066: SimpleNode child = (SimpleNode) node.jjtGetChild(i);
067:
068: int ch_so = child.startOffset();
069: int ch_eo = child.endOffset();
070: if (astOffset >= ch_so && astOffset <= ch_eo) {
071: //the child is or contains the searched node
072: return findDescendant(child, astOffset);
073: }
074:
075: }
076:
077: return node;
078: }
079:
080: /** @return first child of the node with the specified kind. */
081: public static SimpleNode getChildByType(SimpleNode node, int kind) {
082: SimpleNode[] children = getChildrenByType(node, kind);
083: return children.length == 0 ? null : children[0];
084: }
085:
086: /** @return list of children of the node with the specified kind. */
087: public static SimpleNode[] getChildrenByType(SimpleNode node,
088: int kind) {
089: int childrenCount = node.children.length;
090: ArrayList<SimpleNode> list = new ArrayList<SimpleNode>(
091: childrenCount / 4);
092: for (int i = 0; i < childrenCount; i++) {
093: SimpleNode child = (SimpleNode) node.children[i];
094: if (child.kind() == kind) {
095: list.add(child);
096: }
097: }
098: return list.toArray(new SimpleNode[] {});
099: }
100:
101: public static void visitChildren(SimpleNode node,
102: NodeVisitor visitor) {
103: Node[] children = node.children;
104: if (children != null) {
105: for (int i = 0; i < children.length; ++i) {
106: SimpleNode n = (SimpleNode) children[i];
107: if (n != null) {
108: visitor.visit(n);
109: n.visitChildren(visitor);
110: }
111: }
112: }
113: }
114:
115: public static void visitAncestors(SimpleNode node,
116: NodeVisitor visitor) {
117: SimpleNode parent = (SimpleNode) node.parent;
118: if (parent != null) {
119: visitor.visit(parent);
120: visitAncestors(parent, visitor);
121: }
122: }
123: }
|