KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > netbeans > api > java > source > support > CancellableTreePathScanner


1 /*
2  * The contents of this file are subject to the terms of the Common Development
3  * and Distribution License (the License). You may not use this file except in
4  * compliance with the License.
5  *
6  * You can obtain a copy of the License at http://www.netbeans.org/cddl.html
7  * or http://www.netbeans.org/cddl.txt.
8  *
9  * When distributing Covered Code, include this CDDL Header Notice in each file
10  * and include the License file at http://www.netbeans.org/cddl.txt.
11  * If applicable, add the following below the CDDL Header, with the fields
12  * enclosed by brackets [] replaced by your own identifying information:
13  * "Portions Copyrighted [year] [name of copyright owner]"
14  *
15  * The Original Software is NetBeans. The Initial Developer of the Original
16  * Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
17  * Microsystems, Inc. All Rights Reserved.
18  */
19 package org.netbeans.api.java.source.support;
20
21 import com.sun.source.tree.Tree;
22 import com.sun.source.util.TreePathScanner;
23
24 /**
25  *
26  * @author Jan Lahoda
27  */
28 public class CancellableTreePathScanner<R,P> extends TreePathScanner<R,P> {
29
30     private boolean canceled;
31
32     /** Creates a new instance of CancellableTreeScanner */
33     public CancellableTreePathScanner() {
34     }
35
36     protected synchronized boolean isCanceled() {
37         return canceled;
38     }
39
40     public synchronized void cancel() {
41         canceled = true;
42     }
43
44     /** @inheritDoc
45      */
46     public R scan(Tree tree, P p) {
47         if (isCanceled())
48             return null;
49         
50         return super.scan(tree, p);
51     }
52
53     /** @inheritDoc
54      */
55     public R scan(Iterable JavaDoc<? extends Tree> trees, P p) {
56         if (isCanceled())
57             return null;
58         
59         return super.scan(trees, p);
60     }
61
62 }
63
Popular Tags