src/share/classes/com/sun/source/util/TreePath.java

Tue, 09 Oct 2012 19:10:00 -0700

author
jjg
date
Tue, 09 Oct 2012 19:10:00 -0700
changeset 1357
c75be5bc5283
parent 554
9d9f26857129
child 1455
75ab654b5cd5
permissions
-rw-r--r--

8000663: clean up langtools imports
Reviewed-by: darcy

duke@1 1 /*
jjg@1357 2 * Copyright (c) 2006, 2012, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
ohair@554 7 * published by the Free Software Foundation. Oracle designates this
duke@1 8 * particular file as subject to the "Classpath" exception as provided
ohair@554 9 * by Oracle in the LICENSE file that accompanied this code.
duke@1 10 *
duke@1 11 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 14 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 15 * accompanied this code).
duke@1 16 *
duke@1 17 * You should have received a copy of the GNU General Public License version
duke@1 18 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 20 *
ohair@554 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
ohair@554 22 * or visit www.oracle.com if you need additional information or have any
ohair@554 23 * questions.
duke@1 24 */
duke@1 25
duke@1 26 package com.sun.source.util;
duke@1 27
jjg@1357 28 import java.util.Iterator;
jjg@1357 29
duke@1 30 import com.sun.source.tree.*;
duke@1 31
duke@1 32 /**
duke@1 33 * A path of tree nodes, typically used to represent the sequence of ancestor
duke@1 34 * nodes of a tree node up to the top level CompilationUnitTree node.
duke@1 35 *
duke@1 36 * @author Jonathan Gibbons
duke@1 37 * @since 1.6
duke@1 38 */
duke@1 39 public class TreePath implements Iterable<Tree> {
duke@1 40 /**
duke@1 41 * Gets a tree path for a tree node within a compilation unit.
duke@1 42 * @return null if the node is not found
duke@1 43 */
duke@1 44 public static TreePath getPath(CompilationUnitTree unit, Tree target) {
duke@1 45 return getPath(new TreePath(unit), target);
duke@1 46 }
duke@1 47
duke@1 48 /**
duke@1 49 * Gets a tree path for a tree node within a subtree identified by a TreePath object.
duke@1 50 * @return null if the node is not found
duke@1 51 */
duke@1 52 public static TreePath getPath(TreePath path, Tree target) {
duke@1 53 path.getClass();
duke@1 54 target.getClass();
duke@1 55
duke@1 56 class Result extends Error {
duke@1 57 static final long serialVersionUID = -5942088234594905625L;
duke@1 58 TreePath path;
duke@1 59 Result(TreePath path) {
duke@1 60 this.path = path;
duke@1 61 }
duke@1 62 }
duke@1 63 class PathFinder extends TreePathScanner<TreePath,Tree> {
duke@1 64 public TreePath scan(Tree tree, Tree target) {
duke@1 65 if (tree == target)
duke@1 66 throw new Result(new TreePath(getCurrentPath(), target));
duke@1 67 return super.scan(tree, target);
duke@1 68 }
duke@1 69 }
duke@1 70
duke@1 71 try {
duke@1 72 new PathFinder().scan(path, target);
duke@1 73 } catch (Result result) {
duke@1 74 return result.path;
duke@1 75 }
duke@1 76 return null;
duke@1 77 }
duke@1 78
duke@1 79 /**
duke@1 80 * Creates a TreePath for a root node.
duke@1 81 */
duke@1 82 public TreePath(CompilationUnitTree t) {
duke@1 83 this(null, t);
duke@1 84 }
duke@1 85
duke@1 86 /**
duke@1 87 * Creates a TreePath for a child node.
duke@1 88 */
duke@1 89 public TreePath(TreePath p, Tree t) {
duke@1 90 if (t.getKind() == Tree.Kind.COMPILATION_UNIT) {
duke@1 91 compilationUnit = (CompilationUnitTree) t;
duke@1 92 parent = null;
duke@1 93 }
duke@1 94 else {
duke@1 95 compilationUnit = p.compilationUnit;
duke@1 96 parent = p;
duke@1 97 }
duke@1 98 leaf = t;
duke@1 99 }
duke@1 100 /**
duke@1 101 * Get the compilation unit associated with this path.
duke@1 102 */
duke@1 103 public CompilationUnitTree getCompilationUnit() {
duke@1 104 return compilationUnit;
duke@1 105 }
duke@1 106
duke@1 107 /**
duke@1 108 * Get the leaf node for this path.
duke@1 109 */
duke@1 110 public Tree getLeaf() {
duke@1 111 return leaf;
duke@1 112 }
duke@1 113
duke@1 114 /**
duke@1 115 * Get the path for the enclosing node, or null if there is no enclosing node.
duke@1 116 */
duke@1 117 public TreePath getParentPath() {
duke@1 118 return parent;
duke@1 119 }
duke@1 120
duke@1 121 public Iterator<Tree> iterator() {
duke@1 122 return new Iterator<Tree>() {
duke@1 123 public boolean hasNext() {
jjg@308 124 return next != null;
duke@1 125 }
duke@1 126
duke@1 127 public Tree next() {
jjg@308 128 Tree t = next.leaf;
jjg@308 129 next = next.parent;
jjg@308 130 return t;
duke@1 131 }
duke@1 132
duke@1 133 public void remove() {
duke@1 134 throw new UnsupportedOperationException();
duke@1 135 }
duke@1 136
jjg@308 137 private TreePath next = TreePath.this;
duke@1 138 };
duke@1 139 }
duke@1 140
duke@1 141 private CompilationUnitTree compilationUnit;
duke@1 142 private Tree leaf;
duke@1 143 private TreePath parent;
duke@1 144 }

mercurial