start of a revised disjoint reachability analysis

[IRC.git] / Robust / src / Analysis / Disjoint / ChangeTuple.java

diff --git a/Robust/src/Analysis/Disjoint/ChangeTuple.java b/Robust/src/Analysis/Disjoint/ChangeTuple.java
new file mode 100644 (file)
index 0000000..b4ddfd3
--- /dev/null
+++ b/Robust/src/Analysis/Disjoint/ChangeTuple.java
@@ -0,0 +1,76 @@
+package Analysis.DisjointAnalysis;
+
+import IR.*;
+import IR.Flat.*;
+import java.util.*;
+import java.io.*;
+
+
+// a change touple is a pair that indicates if the
+// first ReachState is found in a ReachSet,
+// then the second ReachState should be added
+
+// THIS CLASS IS IMMUTABLE!
+
+public class ChangeTuple extends Canonical
+{
+  private ReachState toMatch;
+  private ReachState toAdd;
+
+  public ChangeTuple(ReachState toMatch,
+                     ReachState toAdd) {
+    this.toMatch = toMatch;
+    this.toAdd   = toAdd;
+  }
+
+  public ChangeTuple makeCanonical() {
+    return (ChangeTuple) Canonical.makeCanonical(this);
+  }
+
+  public ReachState getSetToMatch() {
+    return toMatch;
+  }
+  public ReachState getSetToAdd() {
+    return toAdd;
+  }
+
+
+  public boolean equals(Object o) {
+    if( o == null ) {
+      return false;
+    }
+
+    if( !(o instanceof ChangeTuple) ) {
+      return false;
+    }
+
+    ChangeTuple ct = (ChangeTuple) o;
+
+    return toMatch.equals(ct.getSetToMatch() ) &&
+           toAdd.equals(ct.getSetToAdd()   );
+  }
+
+  private boolean oldHashSet = false;
+  private int oldHash    = 0;
+  public int hashCode() {
+    int currentHash = toMatch.hashCode() + toAdd.hashCode()*3;
+
+    if( oldHashSet == false ) {
+      oldHash = currentHash;
+      oldHashSet = true;
+    } else {
+      if( oldHash != currentHash ) {
+       System.out.println("IF YOU SEE THIS A CANONICAL ChangeTuple CHANGED");
+       Integer x = null;
+       x.toString();
+      }
+    }
+
+    return currentHash;
+  }
+
+
+  public String toString() {
+    return new String("("+toMatch+" -> "+toAdd+")");
+  }
+}