X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FGSS.java;h=32ce6fcdc9630a398ea1733350c547a3c141f8f2;hb=b3113fa359f0ca112e9a29b4f183634f70cf1278;hp=3c6beacabbf2c2ccd75f2286c75e2ab4d9312124;hpb=5c4157c1118401c4223ff485e9531fc3ba851be2;p=sbp.git

diff --git a/src/edu/berkeley/sbp/GSS.java b/src/edu/berkeley/sbp/GSS.java
index 3c6beac..32ce6fc 100644
--- a/src/edu/berkeley/sbp/GSS.java
+++ b/src/edu/berkeley/sbp/GSS.java
@@ -1,10 +1,11 @@
-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
 
 package edu.berkeley.sbp;
 import edu.berkeley.sbp.*;
 import edu.berkeley.sbp.util.*;
 import edu.berkeley.sbp.Parser.Table.*;
 import edu.berkeley.sbp.Sequence.Position;
+import edu.berkeley.sbp.Sequence.Pos;
 import java.io.*;
 import java.util.*;
 import java.lang.reflect.*;
@@ -26,7 +27,7 @@ class GSS {
     class Phase<Tok> implements Invokable<State, Result>, IntegerMappable, GraphViz.ToGraphViz, Iterable<Node> {
 
         // FIXME: right now, these are the performance bottleneck
-        private HashMapBag<Integer,Sequence>       performed       = new HashMapBag<Integer,Sequence>();
+        private HashMapBag<Integer,Integer>       performed       = new HashMapBag<Integer,Integer>();
 
         public Forest.Many finalResult;
         private PriorityQueue<Reduction> reductionQueue = new PriorityQueue<Reduction>();
@@ -52,7 +53,6 @@ class GSS {
         private Phase prev;
         private Input.Location location;
         private Input.Location nextLocation;
-        private Input.Location prevLocation;
         
         private Forest forest;
 
@@ -62,18 +62,16 @@ class GSS {
             newNode(primordealResult, startState, true);
         }
         public Phase(Phase prev, Forest forest) throws ParseFailed, IOException {
-            this.prevLocation = input.getLocation();
-            this.token = (Tok)input.next();
             this.location = input.getLocation();
+            this.token = (Tok)input.next();
+            this.nextLocation = input.getLocation();
             this.prev = prev;
             this.forest = forest;
             this.pos = prev==null ? 0 : prev.pos+1;
-            this.nextLocation = input.getLocation();
             if (prev != null) prev.shift(this, forest);
             numReductions = 0;
 
             int minPhasePos = Integer.MAX_VALUE;
-            int maxOrd = -1;
             Reduction best = null;
             //System.out.println("==============================================================================");
             while(!reductionQueue.isEmpty()) {
@@ -86,7 +84,6 @@ class GSS {
                 if (r.parentPhase() != null) {
                     if (r.parentPhase().pos < minPhasePos) {
                         minPhasePos = r.parentPhase().pos;
-                        maxOrd = r.reduction().ord;
                         best = r;
                     } else if (r.parentPhase().pos == minPhasePos) {
                         /*
@@ -95,7 +92,6 @@ class GSS {
                                             Parser.mastercache.comparePositions(r.reduction(), best.reduction())+"\n"+r.compareTo(best)+
                                             "\n"+(r.reduction().ord-best.reduction().ord));
                         */
-                        maxOrd = r.reduction().ord;
                         best = r;
                     }
                 }
@@ -112,9 +108,7 @@ class GSS {
             return true;
         }
 
-        public Input.Location getPrevLocation() { return prevLocation; }
         public Input.Location getLocation() { return location; }
-        public Input.Region getRegion() { return prevLocation.createRegion(location); }
         public Input.Location getNextLocation() { return nextLocation; }
         public boolean        isFrontier() { return hash!=null; }
 
@@ -126,8 +120,7 @@ class GSS {
                 IntPairMap<Node> h = prev.hash;
                 prev.hash = null;
                 prev.performed = null;
-                for(Node n : h)
-                    n.check();
+                for(Node n : h) n.check();
             }
             numOldNodes = hash.size();
             for(Node n : hash.values()) {
@@ -161,19 +154,22 @@ class GSS {
             for(Node n : hash) n.check();
         }
 
-        void newNodeFromReduction(Result result, State state, Position reduction) {
+        Input.Region getRegionFromThisToNext() {
+            return getLocation().createRegion(getNextLocation());
+        }
+
+        void newNodeFromReduction(Result result, State state, Pos reduction) {
             int pos = result.phase().pos;
-            Sequence owner = reduction.owner();
-            for(Sequence s : owner.hates())
+            for(int s : reduction.hates())
                 if (performed.contains(pos, s))
                     return;
-            for(Sequence s : owner.needs())
+            for(int s : reduction.needs())
                 if (!performed.contains(pos, s))
                     return;
-            if (owner.needed_or_hated && !performed.contains(pos, owner))
-                performed.add(pos, owner);
+            if (reduction.owner_needed_or_hated() && !performed.contains(pos, reduction.provides()))
+                performed.add(pos, reduction.provides());
             if (state!=null)
-                newNode(result, state, reduction.pos<=0);
+                newNode(result, state, reduction.numPops()<=0);
         }
 
         /** add a new node (merging with existing nodes if possible)