src/share/classes/com/sun/tools/javac/tree/TreeCopier.java

Sun, 17 Feb 2013 16:44:55 -0500

author
dholmes
date
Sun, 17 Feb 2013 16:44:55 -0500
changeset 1571
af8417e590f4
parent 1521
71f35e4b93a5
child 1755
ddb4a2bfcd82
permissions
-rw-r--r--

Merge

duke@1 1 /*
jjg@1521 2 * Copyright (c) 2006, 2013, 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.tools.javac.tree;
duke@1 27
duke@1 28 import com.sun.source.tree.*;
duke@1 29 import com.sun.tools.javac.tree.JCTree.*;
duke@1 30 import com.sun.tools.javac.util.List;
duke@1 31 import com.sun.tools.javac.util.ListBuffer;
duke@1 32
duke@1 33 /**
duke@1 34 * Creates a copy of a tree, using a given TreeMaker.
duke@1 35 * Names, literal values, etc are shared with the original.
duke@1 36 *
jjg@581 37 * <p><b>This is NOT part of any supported API.
jjg@581 38 * If you write code that depends on this, you do so at your own risk.
duke@1 39 * This code and its internal interfaces are subject to change or
duke@1 40 * deletion without notice.</b>
duke@1 41 */
duke@1 42 public class TreeCopier<P> implements TreeVisitor<JCTree,P> {
duke@1 43 private TreeMaker M;
duke@1 44
duke@1 45 /** Creates a new instance of TreeCopier */
duke@1 46 public TreeCopier(TreeMaker M) {
duke@1 47 this.M = M;
duke@1 48 }
duke@1 49
duke@1 50 public <T extends JCTree> T copy(T tree) {
duke@1 51 return copy(tree, null);
duke@1 52 }
duke@1 53
duke@1 54 @SuppressWarnings("unchecked")
duke@1 55 public <T extends JCTree> T copy(T tree, P p) {
duke@1 56 if (tree == null)
duke@1 57 return null;
duke@1 58 return (T) (tree.accept(this, p));
duke@1 59 }
duke@1 60
duke@1 61 public <T extends JCTree> List<T> copy(List<T> trees) {
duke@1 62 return copy(trees, null);
duke@1 63 }
duke@1 64
duke@1 65 public <T extends JCTree> List<T> copy(List<T> trees, P p) {
duke@1 66 if (trees == null)
duke@1 67 return null;
duke@1 68 ListBuffer<T> lb = new ListBuffer<T>();
duke@1 69 for (T tree: trees)
duke@1 70 lb.append(copy(tree, p));
duke@1 71 return lb.toList();
duke@1 72 }
duke@1 73
jjg@1521 74 public JCTree visitAnnotatedType(AnnotatedTypeTree node, P p) {
jjg@1521 75 JCAnnotatedType t = (JCAnnotatedType) node;
jjg@1521 76 List<JCAnnotation> annotations = copy(t.annotations, p);
jjg@1521 77 JCExpression underlyingType = copy(t.underlyingType, p);
jjg@1521 78 return M.at(t.pos).AnnotatedType(annotations, underlyingType);
jjg@1521 79 }
jjg@1521 80
duke@1 81 public JCTree visitAnnotation(AnnotationTree node, P p) {
duke@1 82 JCAnnotation t = (JCAnnotation) node;
duke@1 83 JCTree annotationType = copy(t.annotationType, p);
duke@1 84 List<JCExpression> args = copy(t.args, p);
jjg@1521 85 if (t.getKind() == Tree.Kind.TYPE_ANNOTATION) {
jjg@1521 86 JCAnnotation newTA = M.at(t.pos).TypeAnnotation(annotationType, args);
jjg@1521 87 newTA.attribute = t.attribute;
jjg@1521 88 return newTA;
jjg@1521 89 } else {
jjg@1521 90 JCAnnotation newT = M.at(t.pos).Annotation(annotationType, args);
jjg@1521 91 newT.attribute = t.attribute;
jjg@1521 92 return newT;
jjg@1521 93 }
duke@1 94 }
duke@1 95
duke@1 96 public JCTree visitAssert(AssertTree node, P p) {
duke@1 97 JCAssert t = (JCAssert) node;
duke@1 98 JCExpression cond = copy(t.cond, p);
duke@1 99 JCExpression detail = copy(t.detail, p);
duke@1 100 return M.at(t.pos).Assert(cond, detail);
duke@1 101 }
duke@1 102
duke@1 103 public JCTree visitAssignment(AssignmentTree node, P p) {
duke@1 104 JCAssign t = (JCAssign) node;
duke@1 105 JCExpression lhs = copy(t.lhs, p);
duke@1 106 JCExpression rhs = copy(t.rhs, p);
duke@1 107 return M.at(t.pos).Assign(lhs, rhs);
duke@1 108 }
duke@1 109
duke@1 110 public JCTree visitCompoundAssignment(CompoundAssignmentTree node, P p) {
duke@1 111 JCAssignOp t = (JCAssignOp) node;
duke@1 112 JCTree lhs = copy(t.lhs, p);
duke@1 113 JCTree rhs = copy(t.rhs, p);
duke@1 114 return M.at(t.pos).Assignop(t.getTag(), lhs, rhs);
duke@1 115 }
duke@1 116
duke@1 117 public JCTree visitBinary(BinaryTree node, P p) {
duke@1 118 JCBinary t = (JCBinary) node;
duke@1 119 JCExpression lhs = copy(t.lhs, p);
duke@1 120 JCExpression rhs = copy(t.rhs, p);
duke@1 121 return M.at(t.pos).Binary(t.getTag(), lhs, rhs);
duke@1 122 }
duke@1 123
duke@1 124 public JCTree visitBlock(BlockTree node, P p) {
duke@1 125 JCBlock t = (JCBlock) node;
duke@1 126 List<JCStatement> stats = copy(t.stats, p);
duke@1 127 return M.at(t.pos).Block(t.flags, stats);
duke@1 128 }
duke@1 129
duke@1 130 public JCTree visitBreak(BreakTree node, P p) {
duke@1 131 JCBreak t = (JCBreak) node;
duke@1 132 return M.at(t.pos).Break(t.label);
duke@1 133 }
duke@1 134
duke@1 135 public JCTree visitCase(CaseTree node, P p) {
duke@1 136 JCCase t = (JCCase) node;
duke@1 137 JCExpression pat = copy(t.pat, p);
duke@1 138 List<JCStatement> stats = copy(t.stats, p);
duke@1 139 return M.at(t.pos).Case(pat, stats);
duke@1 140 }
duke@1 141
duke@1 142 public JCTree visitCatch(CatchTree node, P p) {
duke@1 143 JCCatch t = (JCCatch) node;
duke@1 144 JCVariableDecl param = copy(t.param, p);
duke@1 145 JCBlock body = copy(t.body, p);
duke@1 146 return M.at(t.pos).Catch(param, body);
duke@1 147 }
duke@1 148
duke@1 149 public JCTree visitClass(ClassTree node, P p) {
duke@1 150 JCClassDecl t = (JCClassDecl) node;
duke@1 151 JCModifiers mods = copy(t.mods, p);
duke@1 152 List<JCTypeParameter> typarams = copy(t.typarams, p);
jjg@904 153 JCExpression extending = copy(t.extending, p);
duke@1 154 List<JCExpression> implementing = copy(t.implementing, p);
duke@1 155 List<JCTree> defs = copy(t.defs, p);
duke@1 156 return M.at(t.pos).ClassDef(mods, t.name, typarams, extending, implementing, defs);
duke@1 157 }
duke@1 158
duke@1 159 public JCTree visitConditionalExpression(ConditionalExpressionTree node, P p) {
duke@1 160 JCConditional t = (JCConditional) node;
duke@1 161 JCExpression cond = copy(t.cond, p);
duke@1 162 JCExpression truepart = copy(t.truepart, p);
duke@1 163 JCExpression falsepart = copy(t.falsepart, p);
duke@1 164 return M.at(t.pos).Conditional(cond, truepart, falsepart);
duke@1 165 }
duke@1 166
duke@1 167 public JCTree visitContinue(ContinueTree node, P p) {
duke@1 168 JCContinue t = (JCContinue) node;
duke@1 169 return M.at(t.pos).Continue(t.label);
duke@1 170 }
duke@1 171
duke@1 172 public JCTree visitDoWhileLoop(DoWhileLoopTree node, P p) {
duke@1 173 JCDoWhileLoop t = (JCDoWhileLoop) node;
duke@1 174 JCStatement body = copy(t.body, p);
duke@1 175 JCExpression cond = copy(t.cond, p);
duke@1 176 return M.at(t.pos).DoLoop(body, cond);
duke@1 177 }
duke@1 178
duke@1 179 public JCTree visitErroneous(ErroneousTree node, P p) {
duke@1 180 JCErroneous t = (JCErroneous) node;
duke@1 181 List<? extends JCTree> errs = copy(t.errs, p);
duke@1 182 return M.at(t.pos).Erroneous(errs);
duke@1 183 }
duke@1 184
duke@1 185 public JCTree visitExpressionStatement(ExpressionStatementTree node, P p) {
duke@1 186 JCExpressionStatement t = (JCExpressionStatement) node;
duke@1 187 JCExpression expr = copy(t.expr, p);
duke@1 188 return M.at(t.pos).Exec(expr);
duke@1 189 }
duke@1 190
duke@1 191 public JCTree visitEnhancedForLoop(EnhancedForLoopTree node, P p) {
duke@1 192 JCEnhancedForLoop t = (JCEnhancedForLoop) node;
duke@1 193 JCVariableDecl var = copy(t.var, p);
duke@1 194 JCExpression expr = copy(t.expr, p);
duke@1 195 JCStatement body = copy(t.body, p);
duke@1 196 return M.at(t.pos).ForeachLoop(var, expr, body);
duke@1 197 }
duke@1 198
duke@1 199 public JCTree visitForLoop(ForLoopTree node, P p) {
duke@1 200 JCForLoop t = (JCForLoop) node;
duke@1 201 List<JCStatement> init = copy(t.init, p);
duke@1 202 JCExpression cond = copy(t.cond, p);
duke@1 203 List<JCExpressionStatement> step = copy(t.step, p);
duke@1 204 JCStatement body = copy(t.body, p);
duke@1 205 return M.at(t.pos).ForLoop(init, cond, step, body);
duke@1 206 }
duke@1 207
duke@1 208 public JCTree visitIdentifier(IdentifierTree node, P p) {
duke@1 209 JCIdent t = (JCIdent) node;
duke@1 210 return M.at(t.pos).Ident(t.name);
duke@1 211 }
duke@1 212
duke@1 213 public JCTree visitIf(IfTree node, P p) {
duke@1 214 JCIf t = (JCIf) node;
duke@1 215 JCExpression cond = copy(t.cond, p);
duke@1 216 JCStatement thenpart = copy(t.thenpart, p);
duke@1 217 JCStatement elsepart = copy(t.elsepart, p);
duke@1 218 return M.at(t.pos).If(cond, thenpart, elsepart);
duke@1 219 }
duke@1 220
duke@1 221 public JCTree visitImport(ImportTree node, P p) {
duke@1 222 JCImport t = (JCImport) node;
duke@1 223 JCTree qualid = copy(t.qualid, p);
duke@1 224 return M.at(t.pos).Import(qualid, t.staticImport);
duke@1 225 }
duke@1 226
duke@1 227 public JCTree visitArrayAccess(ArrayAccessTree node, P p) {
duke@1 228 JCArrayAccess t = (JCArrayAccess) node;
duke@1 229 JCExpression indexed = copy(t.indexed, p);
duke@1 230 JCExpression index = copy(t.index, p);
duke@1 231 return M.at(t.pos).Indexed(indexed, index);
duke@1 232 }
duke@1 233
duke@1 234 public JCTree visitLabeledStatement(LabeledStatementTree node, P p) {
duke@1 235 JCLabeledStatement t = (JCLabeledStatement) node;
duke@1 236 JCStatement body = copy(t.body, p);
duke@1 237 return M.at(t.pos).Labelled(t.label, t.body);
duke@1 238 }
duke@1 239
duke@1 240 public JCTree visitLiteral(LiteralTree node, P p) {
duke@1 241 JCLiteral t = (JCLiteral) node;
duke@1 242 return M.at(t.pos).Literal(t.typetag, t.value);
duke@1 243 }
duke@1 244
duke@1 245 public JCTree visitMethod(MethodTree node, P p) {
duke@1 246 JCMethodDecl t = (JCMethodDecl) node;
duke@1 247 JCModifiers mods = copy(t.mods, p);
duke@1 248 JCExpression restype = copy(t.restype, p);
duke@1 249 List<JCTypeParameter> typarams = copy(t.typarams, p);
duke@1 250 List<JCVariableDecl> params = copy(t.params, p);
jjg@1521 251 JCVariableDecl recvparam = copy(t.recvparam, p);
duke@1 252 List<JCExpression> thrown = copy(t.thrown, p);
duke@1 253 JCBlock body = copy(t.body, p);
duke@1 254 JCExpression defaultValue = copy(t.defaultValue, p);
jjg@1521 255 return M.at(t.pos).MethodDef(mods, t.name, restype, typarams, recvparam, params, thrown, body, defaultValue);
duke@1 256 }
duke@1 257
duke@1 258 public JCTree visitMethodInvocation(MethodInvocationTree node, P p) {
duke@1 259 JCMethodInvocation t = (JCMethodInvocation) node;
duke@1 260 List<JCExpression> typeargs = copy(t.typeargs, p);
duke@1 261 JCExpression meth = copy(t.meth, p);
duke@1 262 List<JCExpression> args = copy(t.args, p);
duke@1 263 return M.at(t.pos).Apply(typeargs, meth, args);
duke@1 264 }
duke@1 265
duke@1 266 public JCTree visitModifiers(ModifiersTree node, P p) {
duke@1 267 JCModifiers t = (JCModifiers) node;
duke@1 268 List<JCAnnotation> annotations = copy(t.annotations, p);
duke@1 269 return M.at(t.pos).Modifiers(t.flags, annotations);
duke@1 270 }
duke@1 271
duke@1 272 public JCTree visitNewArray(NewArrayTree node, P p) {
duke@1 273 JCNewArray t = (JCNewArray) node;
duke@1 274 JCExpression elemtype = copy(t.elemtype, p);
duke@1 275 List<JCExpression> dims = copy(t.dims, p);
duke@1 276 List<JCExpression> elems = copy(t.elems, p);
duke@1 277 return M.at(t.pos).NewArray(elemtype, dims, elems);
duke@1 278 }
duke@1 279
duke@1 280 public JCTree visitNewClass(NewClassTree node, P p) {
duke@1 281 JCNewClass t = (JCNewClass) node;
duke@1 282 JCExpression encl = copy(t.encl, p);
duke@1 283 List<JCExpression> typeargs = copy(t.typeargs, p);
duke@1 284 JCExpression clazz = copy(t.clazz, p);
duke@1 285 List<JCExpression> args = copy(t.args, p);
duke@1 286 JCClassDecl def = copy(t.def, p);
duke@1 287 return M.at(t.pos).NewClass(encl, typeargs, clazz, args, def);
duke@1 288 }
duke@1 289
mcimadamore@1142 290 public JCTree visitLambdaExpression(LambdaExpressionTree node, P p) {
mcimadamore@1142 291 JCLambda t = (JCLambda) node;
mcimadamore@1142 292 List<JCVariableDecl> params = copy(t.params, p);
mcimadamore@1142 293 JCTree body = copy(t.body, p);
mcimadamore@1142 294 return M.at(t.pos).Lambda(params, body);
mcimadamore@1142 295 }
mcimadamore@1142 296
duke@1 297 public JCTree visitParenthesized(ParenthesizedTree node, P p) {
duke@1 298 JCParens t = (JCParens) node;
duke@1 299 JCExpression expr = copy(t.expr, p);
duke@1 300 return M.at(t.pos).Parens(expr);
duke@1 301 }
duke@1 302
duke@1 303 public JCTree visitReturn(ReturnTree node, P p) {
duke@1 304 JCReturn t = (JCReturn) node;
duke@1 305 JCExpression expr = copy(t.expr, p);
duke@1 306 return M.at(t.pos).Return(expr);
duke@1 307 }
duke@1 308
duke@1 309 public JCTree visitMemberSelect(MemberSelectTree node, P p) {
duke@1 310 JCFieldAccess t = (JCFieldAccess) node;
duke@1 311 JCExpression selected = copy(t.selected, p);
duke@1 312 return M.at(t.pos).Select(selected, t.name);
duke@1 313 }
duke@1 314
mcimadamore@1143 315 public JCTree visitMemberReference(MemberReferenceTree node, P p) {
mcimadamore@1143 316 JCMemberReference t = (JCMemberReference) node;
mcimadamore@1143 317 JCExpression expr = copy(t.expr, p);
mcimadamore@1143 318 List<JCExpression> typeargs = copy(t.typeargs, p);
mcimadamore@1143 319 return M.at(t.pos).Reference(t.mode, t.name, expr, typeargs);
mcimadamore@1143 320 }
mcimadamore@1143 321
duke@1 322 public JCTree visitEmptyStatement(EmptyStatementTree node, P p) {
duke@1 323 JCSkip t = (JCSkip) node;
duke@1 324 return M.at(t.pos).Skip();
duke@1 325 }
duke@1 326
duke@1 327 public JCTree visitSwitch(SwitchTree node, P p) {
duke@1 328 JCSwitch t = (JCSwitch) node;
duke@1 329 JCExpression selector = copy(t.selector, p);
duke@1 330 List<JCCase> cases = copy(t.cases, p);
duke@1 331 return M.at(t.pos).Switch(selector, cases);
duke@1 332 }
duke@1 333
duke@1 334 public JCTree visitSynchronized(SynchronizedTree node, P p) {
duke@1 335 JCSynchronized t = (JCSynchronized) node;
duke@1 336 JCExpression lock = copy(t.lock, p);
duke@1 337 JCBlock body = copy(t.body, p);
duke@1 338 return M.at(t.pos).Synchronized(lock, body);
duke@1 339 }
duke@1 340
duke@1 341 public JCTree visitThrow(ThrowTree node, P p) {
duke@1 342 JCThrow t = (JCThrow) node;
duke@1 343 JCTree expr = copy(t.expr, p);
duke@1 344 return M.at(t.pos).Throw(expr);
duke@1 345 }
duke@1 346
duke@1 347 public JCTree visitCompilationUnit(CompilationUnitTree node, P p) {
duke@1 348 JCCompilationUnit t = (JCCompilationUnit) node;
duke@1 349 List<JCAnnotation> packageAnnotations = copy(t.packageAnnotations, p);
duke@1 350 JCExpression pid = copy(t.pid, p);
duke@1 351 List<JCTree> defs = copy(t.defs, p);
duke@1 352 return M.at(t.pos).TopLevel(packageAnnotations, pid, defs);
duke@1 353 }
duke@1 354
duke@1 355 public JCTree visitTry(TryTree node, P p) {
duke@1 356 JCTry t = (JCTry) node;
darcy@609 357 List<JCTree> resources = copy(t.resources, p);
duke@1 358 JCBlock body = copy(t.body, p);
duke@1 359 List<JCCatch> catchers = copy(t.catchers, p);
duke@1 360 JCBlock finalizer = copy(t.finalizer, p);
darcy@609 361 return M.at(t.pos).Try(resources, body, catchers, finalizer);
duke@1 362 }
duke@1 363
duke@1 364 public JCTree visitParameterizedType(ParameterizedTypeTree node, P p) {
duke@1 365 JCTypeApply t = (JCTypeApply) node;
duke@1 366 JCExpression clazz = copy(t.clazz, p);
duke@1 367 List<JCExpression> arguments = copy(t.arguments, p);
duke@1 368 return M.at(t.pos).TypeApply(clazz, arguments);
duke@1 369 }
duke@1 370
darcy@969 371 public JCTree visitUnionType(UnionTypeTree node, P p) {
darcy@969 372 JCTypeUnion t = (JCTypeUnion) node;
jjg@724 373 List<JCExpression> components = copy(t.alternatives, p);
darcy@969 374 return M.at(t.pos).TypeUnion(components);
mcimadamore@550 375 }
mcimadamore@550 376
mcimadamore@1436 377 public JCTree visitIntersectionType(IntersectionTypeTree node, P p) {
mcimadamore@1436 378 JCTypeIntersection t = (JCTypeIntersection) node;
mcimadamore@1436 379 List<JCExpression> bounds = copy(t.bounds, p);
mcimadamore@1436 380 return M.at(t.pos).TypeIntersection(bounds);
mcimadamore@1436 381 }
mcimadamore@1436 382
duke@1 383 public JCTree visitArrayType(ArrayTypeTree node, P p) {
duke@1 384 JCArrayTypeTree t = (JCArrayTypeTree) node;
duke@1 385 JCExpression elemtype = copy(t.elemtype, p);
duke@1 386 return M.at(t.pos).TypeArray(elemtype);
duke@1 387 }
duke@1 388
duke@1 389 public JCTree visitTypeCast(TypeCastTree node, P p) {
duke@1 390 JCTypeCast t = (JCTypeCast) node;
duke@1 391 JCTree clazz = copy(t.clazz, p);
duke@1 392 JCExpression expr = copy(t.expr, p);
duke@1 393 return M.at(t.pos).TypeCast(clazz, expr);
duke@1 394 }
duke@1 395
duke@1 396 public JCTree visitPrimitiveType(PrimitiveTypeTree node, P p) {
duke@1 397 JCPrimitiveTypeTree t = (JCPrimitiveTypeTree) node;
duke@1 398 return M.at(t.pos).TypeIdent(t.typetag);
duke@1 399 }
duke@1 400
duke@1 401 public JCTree visitTypeParameter(TypeParameterTree node, P p) {
duke@1 402 JCTypeParameter t = (JCTypeParameter) node;
jjg@1521 403 List<JCAnnotation> annos = copy(t.annotations, p);
duke@1 404 List<JCExpression> bounds = copy(t.bounds, p);
jjg@1521 405 return M.at(t.pos).TypeParameter(t.name, bounds, annos);
duke@1 406 }
duke@1 407
duke@1 408 public JCTree visitInstanceOf(InstanceOfTree node, P p) {
duke@1 409 JCInstanceOf t = (JCInstanceOf) node;
duke@1 410 JCExpression expr = copy(t.expr, p);
duke@1 411 JCTree clazz = copy(t.clazz, p);
duke@1 412 return M.at(t.pos).TypeTest(expr, clazz);
duke@1 413 }
duke@1 414
duke@1 415 public JCTree visitUnary(UnaryTree node, P p) {
duke@1 416 JCUnary t = (JCUnary) node;
duke@1 417 JCExpression arg = copy(t.arg, p);
duke@1 418 return M.at(t.pos).Unary(t.getTag(), arg);
duke@1 419 }
duke@1 420
duke@1 421 public JCTree visitVariable(VariableTree node, P p) {
duke@1 422 JCVariableDecl t = (JCVariableDecl) node;
duke@1 423 JCModifiers mods = copy(t.mods, p);
duke@1 424 JCExpression vartype = copy(t.vartype, p);
duke@1 425 JCExpression init = copy(t.init, p);
duke@1 426 return M.at(t.pos).VarDef(mods, t.name, vartype, init);
duke@1 427 }
duke@1 428
duke@1 429 public JCTree visitWhileLoop(WhileLoopTree node, P p) {
duke@1 430 JCWhileLoop t = (JCWhileLoop) node;
duke@1 431 JCStatement body = copy(t.body, p);
duke@1 432 JCExpression cond = copy(t.cond, p);
duke@1 433 return M.at(t.pos).WhileLoop(cond, body);
duke@1 434 }
duke@1 435
duke@1 436 public JCTree visitWildcard(WildcardTree node, P p) {
duke@1 437 JCWildcard t = (JCWildcard) node;
duke@1 438 TypeBoundKind kind = M.at(t.kind.pos).TypeBoundKind(t.kind.kind);
duke@1 439 JCTree inner = copy(t.inner, p);
duke@1 440 return M.at(t.pos).Wildcard(kind, inner);
duke@1 441 }
duke@1 442
duke@1 443 public JCTree visitOther(Tree node, P p) {
duke@1 444 JCTree tree = (JCTree) node;
duke@1 445 switch (tree.getTag()) {
jjg@1127 446 case LETEXPR: {
duke@1 447 LetExpr t = (LetExpr) node;
duke@1 448 List<JCVariableDecl> defs = copy(t.defs, p);
duke@1 449 JCTree expr = copy(t.expr, p);
duke@1 450 return M.at(t.pos).LetExpr(defs, expr);
duke@1 451 }
duke@1 452 default:
duke@1 453 throw new AssertionError("unknown tree tag: " + tree.getTag());
duke@1 454 }
duke@1 455 }
duke@1 456
duke@1 457 }

mercurial