@Override public int computeHashCode(Abstraction abs) { if (abs.neighborHashCode != 0) return abs.neighborHashCode; final int prime = 31; int result = 1; result = prime * result + abs.hashCode(); result = prime * result + ((abs.predecessor == null) ? 0 : abs.predecessor.hashCode()); abs.neighborHashCode = result; return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((abstraction == null) ? 0 : abstraction.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((abstraction == null) ? 0 : abstraction.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((abstraction == null) ? 0 : abstraction.hashCode()); result = prime * result + ((sinkDefinition == null) ? 0 : sinkDefinition.hashCode()); result = prime * result + ((sinkStmt == null) ? 0 : sinkStmt.hashCode()); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((taint == null) ? 0 : taint.hashCode()); result = prime * result + ((gap == null) ? 0 : gap.hashCode()); // result = prime * result // + ((parent == null) ? 0 : parent.hashCode()); result = prime * result + ((stmt == null) ? 0 : stmt.hashCode()); result = prime * result + ((d1 == null) ? 0 : d1.hashCode()); result = prime * result + ((d2 == null) ? 0 : d2.hashCode()); result = prime * result + (inversePropagator ? 1 : 0); return result; }
@Override public int hashCode() { final int prime = 31; int result = 1; result = prime * abs.hashCode(); result = prime * result + ((abs.getPredecessor() == null) ? 0 : abs.getPredecessor().hashCode()); result = prime * result + ((abs.getCurrentStmt() == null) ? 0 : abs.getCurrentStmt().hashCode()); result = prime * result + ((abs.getCorrespondingCallSite() == null) ? 0 : abs.getCorrespondingCallSite().hashCode()); return result; }