ant task fixed up,

symbol classes public
testregtraverser obsolete

1 files changed, 0 insertions, 106 deletions

diff --git a/sources/scalac/transformer/matching/TestRegTraverser.java b/sources/scalac/transformer/matching/TestRegTraverser.java
deleted file mode 100644
index e5dae1fc6a..0000000000
--- a/sources/scalac/transformer/matching/TestRegTraverser.java
+++ /dev/null
@@ -1,106 +0,0 @@
-/*     ____ ____  ____ ____  ______                                     *\
-**    / __// __ \/ __// __ \/ ____/    SOcos COmpiles Scala             **
-**  __\_ \/ /_/ / /__/ /_/ /\_ \       (c) 2002, LAMP/EPFL              **
-** /_____/\____/\___/\____/____/                                        **
-**                                                                      **
-** $Id$
-\*                                                                      */
-
-package scalac.transformer.matching;
-
-import scalac.Global;
-import scalac.ast.*;
-import scalac.util.*;
-import scalac.symtab.*;
-import java.util.*;
-
-
-public class TestRegTraverser extends Traverser {
-    boolean result = false;
-    Set variables = new HashSet();
-    static Set nilVariables = new HashSet();
-
-    public void traverse(Tree tree) {
-        //System.out.println("traverse:"+tree);
-    	if (!result)
-	    switch (tree) {
-	    case Alternative(_):
-		result = true;
-		break;
-	    case Bind(Name n, Tree pat):
-                if( TreeInfo.isNameOfStarPattern( n ) ) {
-                    result = true;
-                }
-		if( TreeInfo.isEmptySequence( pat ) ) {
-		    // annoying special case: b@() [or b@(()|()) after normalization]
-		    //System.err.println("bindin empty "+tree.symbol());
-		    nilVariables.add(tree.symbol());
-                    result = true;
-		} else {
-		    variables.add(tree.symbol());
-		}
-		traverse(pat);
-		break;
-	    case Ident(_):
-		Symbol symbol = tree.symbol();
-		if ((symbol != Global.instance.definitions.PATTERN_WILDCARD) &&
-		    variables.contains(symbol))
-		    result = true;
-		break;
-	    case CaseDef(Tree pat, _, _):
-		traverse(pat);
-		break;
-
-	    case Sequence( Tree[] trees):
-                if( trees.length == 0 ) {
-                    result = true;
-                    break;
-                } else traverse( trees );
-		//result = true;
-		break;
-
-            case Apply(Tree fun, Tree[] args):
-                traverse(fun);
-                traverse(args);
-                if(( args.length == 1 )&&TreeInfo.isEmptySequence(args[ 0 ]))
-                    result = false;
-                return;
-            // Matthias PatternMatcher cannot handle this case
-                /*
-	    case Apply( Tree fn, Tree[] trees ):
-                if( trees.length == 1 )
-                    switch (trees[ 0 ]) {
-
-                    case Sequence( Tree[] trees2 ):
-                        if( trees2.length == 1 ) {
-                            switch (trees2[ 0 ]) {
-                            case Sequence( Tree[] trees3 ):
-                                result = true;
-                                break;
-                            }
-                            //System.out.println( fn );
-                            //System.out.println( tree.type() );
-                        } else super.traverse( tree );
-                        break;
-                    default:
-                        super.traverse( tree );
-                    }
-		break;
-                */
-	    default:
-		super.traverse( tree );
-	    }
-    }
-
-    public static boolean apply(Tree t) {
-        TestRegTraverser trt = new TestRegTraverser();
-        nilVariables.clear();
-        trt.traverse(t);
-        //System.out.println("TestRegTraverser says "+t+" -> "+trt.result);
-        return trt.result;
-    }
-
-    public static Set getNilVariables() {
-	return nilVariables;
-    }
-}