From: bdemsky <bdemsky>
Date: Fri, 26 Mar 2010 05:40:53 +0000 (+0000)
Subject: stack implementation...may expose bugs
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=ab766f9bc54f876cd2eb27960c149e3c35700367;p=IRC.git

stack implementation...may expose bugs
---

diff --git a/Robust/src/Analysis/Disjoint/DisjointAnalysis.java b/Robust/src/Analysis/Disjoint/DisjointAnalysis.java
index 2e26936e..ab0fda06 100644
--- 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 );