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.editor.ext.html.parser;
040:
041: /**
042: *
043: * @author marek
044: */
045: public class AstNodeUtils {
046:
047: private static final String INDENT = " ";
048:
049: public static void dumpTree(AstNode node) {
050: dump(node, "");
051: }
052:
053: private static void dump(AstNode node, String prefix) {
054: System.out.println(prefix + node.toString());
055: for (AstNode child : node.children()) {
056: dump(child, INDENT);
057: }
058: }
059:
060: public static AstNode findDescendant(AstNode node, int astOffset) {
061: int so = node.startOffset();
062: int eo = node.endOffset();
063:
064: if (astOffset < so || astOffset > eo) {
065: //we are out of the scope - may happen just with the first client call
066: return null;
067: }
068:
069: if (astOffset >= so && astOffset <= eo
070: && node.children().isEmpty()) {
071: //if the node matches and has no children we found it
072: return node;
073: }
074:
075: for (AstNode child : node.children()) {
076: int ch_so = child.startOffset();
077: int ch_eo = child.endOffset();
078: if (astOffset >= ch_so && astOffset <= ch_eo) {
079: //the child is or contains the searched node
080: return findDescendant(child, astOffset);
081: }
082:
083: }
084:
085: return node;
086: }
087:
088: public static void visitChildren(AstNode node,
089: AstNodeVisitor visitor) {
090: for (AstNode n : node.children()) {
091: visitor.visit(n);
092: visitChildren(n, visitor);
093: }
094: }
095:
096: public static void visitAncestors(AstNode node,
097: AstNodeVisitor visitor) {
098: AstNode parent = (AstNode) node.parent();
099: if (parent != null) {
100: visitor.visit(parent);
101: visitAncestors(parent, visitor);
102: }
103: }
104:
105: }
|