stack implementation...may expose bugs

diff --git a/Robust/src/Analysis/Disjoint/DisjointAnalysis.java b/Robust/src/Analysis/Disjoint/DisjointAnalysis.java
index 2e26936e915a132dea548df3beb0fa5ccbce7ff6..ab0fda06d8922f587303aa039d18b826ef7ffd81 100644 (file)
--- a/Robust/src/Analysis/Disjoint/DisjointAnalysis.java
+++ b/Robust/src/Analysis/Disjoint/DisjointAnalysis.java
@@ -362,7 +362,7 @@ public class DisjointAnalysis {
   // current descriptors to visit in fixed-point
   // interprocedural analysis, prioritized by
   // dependency in the call graph
-  protected PriorityQueue<DescriptorQWrapper> 
+  protected Stack<DescriptorQWrapper> 
     descriptorsToVisitQ;
   
   // a duplication of the above structure, but
@@ -461,7 +461,7 @@ public class DisjointAnalysis {
       new Hashtable <TypeDescriptor, FieldDescriptor>();
 
     descriptorsToVisitQ =
-      new PriorityQueue<DescriptorQWrapper>();
+      new Stack<DescriptorQWrapper>();
 
     descriptorsToVisitSet =
       new HashSet<Descriptor>();
@@ -623,7 +623,7 @@ public class DisjointAnalysis {
 
     // analyze methods from the priority queue until it is empty
     while( !descriptorsToVisitQ.isEmpty() ) {
-      Descriptor d = descriptorsToVisitQ.poll().getDescriptor();
+      Descriptor d = descriptorsToVisitQ.pop().getDescriptor();
       assert descriptorsToVisitSet.contains( d );
       descriptorsToVisitSet.remove( d );