trying to make disjointness example versus shape even simpler, still get totally...
authorjjenista <jjenista>
Fri, 2 Oct 2009 18:43:43 +0000 (18:43 +0000)
committerjjenista <jjenista>
Fri, 2 Oct 2009 18:43:43 +0000 (18:43 +0000)
Robust/src/Tests/OwnershipAnalysisTest/versusShape/test.java

index 166f063d671e18f6524677a2a8a7e6ce9afce02f..255456c6e3b1d59008550a53dbe08d02eed9bdf8 100644 (file)
@@ -39,15 +39,17 @@ public class Test {
       DenseGraph  d = (DenseGraph)  dSet.iterator().next();
       process(  );
       */
-
-
+      
+      
       Node sNew = disjoint sparse new Node( 3*i );
       //Node dNew = disjoint dense  new Node( 2*i );
-      sSet.add( sNew );
+      
       //dSet.add( dNew );
-      Node s = (Node) sSet.iterator().next();
+      //Node s = (Node) sSet.iterator().next();
       //Node d = (Node) dSet.iterator().next();
-      growSparseAndDense( s /*, d*/ );
+      growSparseAndDense( sNew /*, d*/ );
+    
+      sSet.add( sNew );
     }
   }