termination=t;
}
+
/** Does performing the AbstractRepair ar satisfy (or falsify if satisfy=false)
- * Rule r */
- static public boolean interferes(AbstractRepair ar, Rule r, boolean satisfy) {
+ * Rule r. */
+
+ static public boolean interfereswithrule(AbstractRepair ar, Rule r, boolean satisfy) {
boolean mayadd=false;
boolean mayremove=false;
switch (ar.getType()) {
drule=r.getDNFGuardExpr();
else
drule=r.getDNFNegGuardExpr();
-
+
for(int i=0;i<drule.size();i++) {
RuleConjunction rconj=drule.get(i);
for(int j=0;j<rconj.size();j++) {
return false;
}
- /** Does performing the AbstractRepair ar falsify the predicate dp */
+ /** This method is designed to check that modifying a relation
+ * doesn't violate a relation well-formedness constraint
+ * (ie. [forall <a,b> in R], a in S1 and b in S2; */
+
+ public boolean checkrelationconstraint(AbstractRepair ar, Constraint c) {
+ if (c.numQuantifiers()==1&&
+ (c.getQuantifier(0) instanceof RelationQuantifier)) {
+ RelationQuantifier rq=(RelationQuantifier)c.getQuantifier(0);
+ if (rq.getRelation()==ar.getDescriptor()) {
+ Hashtable ht=new Hashtable();
+ if (ar.getDomainSet()!=null)
+ ht.put(rq.x,ar.getDomainSet());
+ if (ar.getRangeSet()!=null)
+ ht.put(rq.y,ar.getRangeSet());
+ DNFConstraint dconst=c.dnfconstraint;
+ conjloop:
+ for(int i=0;i<dconst.size();i++) {
+ Conjunction conj=dconst.get(i);
+ predloop:
+ for(int j=0;j<conj.size();j++) {
+ DNFPredicate dpred=conj.get(j);
+ Predicate p=dpred.getPredicate();
+ if ((p instanceof InclusionPredicate)&&(!dpred.isNegated())) {
+ InclusionPredicate ip=(InclusionPredicate)p;
+ if (ip.expr instanceof VarExpr&&
+ ip.setexpr.getDescriptor() instanceof SetDescriptor) {
+ VarDescriptor vd=((VarExpr)ip.expr).getVar();
+ if (ht.containsKey(vd)) {
+ SetDescriptor td=(SetDescriptor)ip.setexpr.getDescriptor();
+ SetDescriptor s=(SetDescriptor)ht.get(vd);
+ if (td.isSubset(s))
+ continue predloop;
+ }
+ }
+ }
+ continue conjloop;
+ }
+ return true;
+ }
+ }
+ }
+ return false;
+ }
+
+
+ /** Check to see if performing the repair ar on repair_c does not
+ * inferere with interfere_c. Returns true if there is no
+ * interference. */
+
+ public boolean interferemodifies(AbstractRepair ar, Constraint repair_c, DNFPredicate interfere_pred, Constraint interfere_c) {
+ DNFConstraint precondition=repair_c.getDNFConstraint().not();
+ if (repair_c.numQuantifiers()!=1||
+ interfere_c.numQuantifiers()!=1||
+ !(repair_c.getQuantifier(0) instanceof SetQuantifier)||
+ !(interfere_c.getQuantifier(0) instanceof SetQuantifier)||
+ ((SetQuantifier)repair_c.getQuantifier(0)).getSet()!=((SetQuantifier)interfere_c.getQuantifier(0)).getSet())
+ return false;
+
+ Hashtable mapping=new Hashtable();
+ mapping.put(((SetQuantifier)repair_c.getQuantifier(0)).getVar(),
+ ((SetQuantifier)interfere_c.getQuantifier(0)).getVar());
+
+ if (ar.getType()!=AbstractRepair.MODIFYRELATION||
+ !(ar.getPredicate().getPredicate() instanceof ExprPredicate)||
+ !(interfere_pred.getPredicate() instanceof ExprPredicate))
+ return false;
+ Expr e=((ExprPredicate)interfere_pred.getPredicate()).expr;
+ Expr leftside=((OpExpr)((ExprPredicate)ar.getPredicate().getPredicate()).expr).left;
+ Set relationset=e.useDescriptor(ar.getDescriptor());
+ for(Iterator relit=relationset.iterator();relit.hasNext();) {
+ Expr e2=(Expr)relit.next();
+ if (!leftside.equals(mapping,e2))
+ return false;
+ }
+
+
+ /* Prune precondition using any ar's in the same conjunction */
+ adjustcondition(precondition, ar);
+ Conjunction conj=findConjunction(repair_c.getDNFConstraint(),ar.getPredicate());
+
+ /* We don't interfere with the same constraint, if there
+ aren't any shared state problems between different
+ bindings (which we've already checked for), and its a
+ different conjunction. Because we wouldn't have repair it
+ if it wasn't already broken. Doesn't appear to be needed,
+ the cycle algorithm will just eliminate one of the nodes.
+
+ if (repair_c==interfere_c) {
+ if (conj!=findConjunction(interfere_c.getDNFConstraint(),interfere_pred))
+ return true;
+ }*/
+
+ for(int i=0;i<conj.size();i++) {
+ DNFPredicate dp=conj.get(i);
+ Set s=(Set)termination.predtoabstractmap.get(dp);
+ for(Iterator it=s.iterator();it.hasNext();) {
+ GraphNode gn=(GraphNode)it.next();
+ TermNode tn=(TermNode)gn.getOwner();
+ AbstractRepair dp_ar=tn.getAbstract();
+ adjustcondition(precondition, dp_ar);
+ }
+ }
+ /* We now have precondition after interference */
+ if (precondition.size()==0)
+ return false;
+ DNFConstraint infr_const=interfere_c.getDNFConstraint();
+
+ next_conj:
+ for(int i=0;i<infr_const.size();i++) {
+ Conjunction infr_conj=infr_const.get(i);
+ for(int j=0;j<infr_conj.size();j++) {
+ DNFPredicate infr_dp=infr_conj.get(j);
+ next_pre_conj:
+ for(int i2=0;i2<precondition.size();i2++) {
+ Conjunction pre_conj=precondition.get(i2);
+ for(int j2=0;j2<pre_conj.size();j2++) {
+ DNFPredicate pre_dp=pre_conj.get(j2);
+ if (checkPreEnsures(pre_dp,infr_dp,mapping))
+ continue next_pre_conj;
+
+ }
+ continue next_conj; /* The precondition doesn't ensure this conjunction is true */
+ }
+ }
+ return true; /*Found a conjunction that must be
+ true...therefore the precondition
+ guarantees that the second constraint is
+ always true after repair*/
+ }
+ return false;
+ }
+
+ static private Conjunction findConjunction(DNFConstraint cons, DNFPredicate dp) {
+ for(int i=0;i<cons.size();i++) {
+ Conjunction conj=cons.get(i);
+ for(int j=0;j<conj.size();j++) {
+ DNFPredicate curr_dp=conj.get(j);
+ if (curr_dp==dp)
+ return conj;
+ }
+ }
+ throw new Error("Not found");
+ }
+
+ /** This method removes predicates that the abstract repair may
+ * violate. */
+
+ private void adjustcondition(DNFConstraint precond, AbstractRepair ar) {
+ HashSet conjremove=new HashSet();
+ for(int i=0;i<precond.size();i++) {
+ Conjunction conj=precond.get(i);
+ HashSet toremove=new HashSet();
+ for(int j=0;j<conj.size();j++) {
+ DNFPredicate dp=conj.get(j);
+ if (interfereswithpredicate(ar,dp)) {
+ /* Remove dp from precond */
+ toremove.add(dp);
+ }
+ }
+ conj.predicates.removeAll(toremove);
+ if (conj.size()==0)
+ conjremove.add(conj);
+ }
+ precond.conjunctions.removeAll(conjremove);
+ }
+
+ private boolean checkPreEnsures(DNFPredicate pre_dp, DNFPredicate infr_dp, Hashtable mapping) {
+ if (pre_dp.isNegated()==infr_dp.isNegated()&&(pre_dp.getPredicate() instanceof ExprPredicate)&&
+ (infr_dp.getPredicate() instanceof ExprPredicate)) {
+ if (((ExprPredicate)pre_dp.getPredicate()).expr.equals(mapping, ((ExprPredicate)infr_dp.getPredicate()).expr))
+ return true;
+ }
+ if ((!pre_dp.isNegated())&&infr_dp.isNegated()&&(pre_dp.getPredicate() instanceof ExprPredicate)&&
+ (infr_dp.getPredicate() instanceof ExprPredicate)) {
+ ExprPredicate pre_ep=(ExprPredicate)pre_dp.getPredicate();
+ ExprPredicate infr_ep=(ExprPredicate)infr_dp.getPredicate();
+ if (pre_ep.getType()==ExprPredicate.COMPARISON&&
+ infr_ep.getType()==ExprPredicate.COMPARISON&&
+ pre_ep.isRightInt()&&
+ infr_ep.isRightInt()&&
+ pre_ep.rightSize()!=infr_ep.rightSize()&&
+ pre_ep.getOp()==Opcode.EQ&&
+ infr_ep.getOp()==Opcode.EQ) {
+ if (((OpExpr)pre_ep.expr).left.equals(mapping,((OpExpr)infr_ep.expr).left))
+ return true;
+ }
+ }
+ return false;
+ }
+
+ /** This method checks whether a modify relation abstract repair
+ * to satisfy ar may violate dp. It returns true if there is no
+ * interference. */
+
+ private boolean interferemodifies(DNFPredicate ar,DNFPredicate dp) {
+ boolean neg1=ar.isNegated();
+ Opcode op1=((ExprPredicate)ar.getPredicate()).getOp();
+ Expr rexpr1=((OpExpr)((ExprPredicate)ar.getPredicate()).expr).right;
+ Expr lexpr1=((OpExpr)((ExprPredicate)ar.getPredicate()).expr).left;
+ RelationDescriptor updated_des=(RelationDescriptor)((ExprPredicate)ar.getPredicate()).getDescriptor();
+
+ boolean neg2=dp.isNegated();
+ Opcode op2=((ExprPredicate)dp.getPredicate()).getOp();
+ Expr rexpr2=((OpExpr)((ExprPredicate)dp.getPredicate()).expr).right;
+ Expr lexpr2=((OpExpr)((ExprPredicate)dp.getPredicate()).expr).left;
+
+ /* Translate the opcodes */
+ op1=Opcode.translateOpcode(neg1,op1);
+ op2=Opcode.translateOpcode(neg2,op2);
+
+ if (((op1==Opcode.EQ)||(op1==Opcode.GE)||(op1==Opcode.LE))&&
+ ((op2==Opcode.EQ)||(op2==Opcode.GE)||(op2==Opcode.LE))&&
+ !rexpr2.usesDescriptor(updated_des)) {
+ Hashtable varmap=new Hashtable();
+ Expr l1=lexpr1;
+ Expr l2=lexpr2;
+
+ boolean initialrelation=true;
+ boolean onetoone=true;
+ while(true) {
+ if ((l1 instanceof VarExpr)&&
+ (l2 instanceof VarExpr)) {
+ VarDescriptor vd1=((VarExpr)l1).getVar();
+ VarDescriptor vd2=((VarExpr)l2).getVar();
+ varmap.put(vd1,vd2);
+ break;
+ } else if ((l1 instanceof RelationExpr)&&
+ (l2 instanceof RelationExpr)) {
+ RelationExpr re1=(RelationExpr)l1;
+ RelationExpr re2=(RelationExpr)l2;
+ if (re1.getRelation()!=re2.getRelation()||
+ re1.inverted()!=re2.inverted())
+ return false;
+
+ if (!initialrelation) {
+ if (!(
+ ConstraintDependence.rulesensurefunction(termination.state, re1.getRelation(),re1.getExpr().getSet(),!re1.inverted(),true)||
+ ConstraintDependence.constraintsensurefunction(termination.state, re1.getRelation(),re1.getExpr().getSet(),!re1.inverted(),true)))
+ onetoone=false;
+ //need check one-to-one property here
+ } else initialrelation=false;
+ l1=re1.getExpr();
+ l2=re2.getExpr();
+ } else return false; // bad match
+ }
+ Set freevars=rexpr1.freeVars();
+ if (freevars!=null)
+ for(Iterator it=freevars.iterator();it.hasNext();) {
+ VarDescriptor vd=(VarDescriptor)it.next();
+ if (vd.isGlobal())
+ continue; //globals are fine
+ else if (varmap.containsKey(vd)&&onetoone) //the mapped variable is fine if we have a 1-1 mapping
+ continue;
+ else if (termination.maxsize.getsize(vd.getSet())==1)
+ continue;
+ return false;
+ }
+ return rexpr1.equals(varmap,rexpr2);
+ }
+ return false;
+ }
+
+ /** Returns true if performing the AbstractRepair ar may falsify
+ the predicate dp. */
- public boolean interferes(AbstractRepair ar, DNFPredicate dp) {
+ public boolean interfereswithpredicate(AbstractRepair ar, DNFPredicate dp) {
if ((ar.getDescriptor()!=dp.getPredicate().getDescriptor()) &&
- ((ar.getDescriptor() instanceof SetDescriptor)||
- !dp.getPredicate().usesDescriptor((RelationDescriptor)ar.getDescriptor())))
+ // ((ar.getDescriptor() instanceof SetDescriptor)||
+ // If the second predicate uses the size of the set, modifying the set size could falsify it...
+ !dp.getPredicate().usesDescriptor(ar.getDescriptor()))
+ //)
return false;
+
+ // If the update changes something in the middle of a size
+ // expression, it interferes with it.
+ if ((dp.getPredicate() instanceof ExprPredicate)&&
+ (((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.SIZE)&&
+ (((SizeofExpr)((OpExpr)((ExprPredicate)dp.getPredicate()).expr).left).setexpr instanceof ImageSetExpr)&&
+ ((ImageSetExpr)((SizeofExpr)((OpExpr)((ExprPredicate)dp.getPredicate()).expr).left).setexpr).isimageset&&
+ ((ImageSetExpr)((SizeofExpr)((OpExpr)((ExprPredicate)dp.getPredicate()).expr).left).setexpr).ise.usesDescriptor(ar.getDescriptor())) {
+ return true;
+ }
+
+ // If the update changes something in the middle of a
+ // comparison expression, it interferes with it.
+ if ((dp.getPredicate() instanceof ExprPredicate)&&
+ (((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.COMPARISON)&&
+ (((RelationExpr)((OpExpr)((ExprPredicate)dp.getPredicate()).expr).left).getExpr().usesDescriptor(ar.getDescriptor()))) {
+ return true;
+ }
+
/* This if handles all the c comparisons in the paper */
if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
(ar.getType()==AbstractRepair.ADDTOSET||ar.getType()==AbstractRepair.ADDTORELATION)&&
return false;
}
}
+
+ /* This if handles all the c comparisons in the paper */
+ if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
+ (ar.getType()==AbstractRepair.ADDTOSET||ar.getType()==AbstractRepair.ADDTORELATION)&&
+ (ar.getPredicate().getPredicate() instanceof ExprPredicate)&&
+ (dp.getPredicate() instanceof ExprPredicate)&&
+ (dp.getPredicate().inverted()==ar.getPredicate().getPredicate().inverted())&&
+ (((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.COMPARISON)) {
+ boolean neg1=ar.getPredicate().isNegated();
+ Opcode op1=((ExprPredicate)ar.getPredicate().getPredicate()).getOp();
+ int size1=((ExprPredicate)ar.getPredicate().getPredicate()).rightSize();
+ int size2=1;
+ op1=Opcode.translateOpcode(neg1,op1);
+
+ if ((op1==Opcode.EQ)||(op1==Opcode.NE)||(op1==Opcode.GT)||op1==Opcode.GE) {
+ int size1a=0;
+ if((op1==Opcode.EQ)||(op1==Opcode.GE))
+ size1a=size1;
+ if((op1==Opcode.GT)||(op1==Opcode.NE))
+ size1a=size1+1;
+ if (size1a==size2)
+ return false;
+ }
+ }
+
+ if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
+ (ar.getType()==AbstractRepair.MODIFYRELATION)&&
+ (dp.getPredicate() instanceof ExprPredicate)&&
+ (dp.getPredicate().inverted()==ar.getPredicate().getPredicate().inverted())&&
+ (((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.SIZE)) {
+ int size1=1;
+
+ boolean neg2=dp.isNegated();
+ Opcode op2=((ExprPredicate)dp.getPredicate()).getOp();
+ int size2=((ExprPredicate)dp.getPredicate()).rightSize();
+
+ op2=Opcode.translateOpcode(neg2,op2);
+
+ if (((op2==Opcode.EQ)&&(size1==size2))||
+ ((op2==Opcode.NE)&&(size1!=size2))||
+ ((op2==Opcode.GE)&&(size1>=size2))||
+ ((op2==Opcode.GT)&&(size1>size2))||
+ ((op2==Opcode.LE)&&(size1<=size2))||
+ ((op2==Opcode.LT)&&(size1<size2)))
+ return false;
+ }
+
if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
(ar.getType()==AbstractRepair.ADDTOSET||ar.getType()==AbstractRepair.ADDTORELATION)&&
(dp.getPredicate() instanceof ExprPredicate)&&
(op2==Opcode.GT))
return false;
}
+
+
if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
(ar.getType()==AbstractRepair.MODIFYRELATION)&&
(dp.getPredicate() instanceof ExprPredicate)&&
(dp.getPredicate().inverted()==ar.getPredicate().getPredicate().inverted())&&
(((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.COMPARISON)) {
-
+
boolean neg1=ar.getPredicate().isNegated();
Opcode op1=((ExprPredicate)ar.getPredicate().getPredicate()).getOp();
boolean isInt1=((ExprPredicate)ar.getPredicate().getPredicate()).isRightInt();
int size2=isInt2?((ExprPredicate)dp.getPredicate()).rightSize():0;
Expr expr2=((OpExpr)((ExprPredicate)dp.getPredicate()).expr).right;
+
+ /* If the left sides of the comparisons are both from
+ different sets, the update is orthogonal to the expr dp */
{
Expr lexpr1=((RelationExpr)((OpExpr)((ExprPredicate)ar.getPredicate().getPredicate()).expr).getLeftExpr()).getExpr();
Expr lexpr2=((RelationExpr)((OpExpr)((ExprPredicate)dp.getPredicate()).expr).getLeftExpr()).getExpr();
return false;
}
-
-
/* Translate the opcodes */
op1=Opcode.translateOpcode(neg1,op1);
op2=Opcode.translateOpcode(neg2,op2);
-
+
/* Obvious cases which can't interfere */
if (((op1==Opcode.GT)||
(op1==Opcode.GE))&&
((op2==Opcode.LT)||
(op2==Opcode.LE)))
return false;
- if (((op1==Opcode.EQ)||(op1==Opcode.GE)||(op1==Opcode.LE))&&
- ((op2==Opcode.EQ)||(op2==Opcode.GE)||(op2==Opcode.LE))&&
- expr1.equals(null,expr2)) {
+
+ if (interferemodifies(ar.getPredicate(),dp))
return false;
- }
+
if (isInt1&&isInt2) {
if (((op1==Opcode.EQ)||(op1==Opcode.GE)||(op1==Opcode.LE))&&
((op2==Opcode.EQ)||(op2==Opcode.GE)||(op2==Opcode.LE))&&
size1a--;
if (op1==Opcode.NE)
size1a++; /*FLAGNE this is current behavior for NE repairs */
-
+
if (op2==Opcode.GT)
size2a++;
if (op2==Opcode.LT)
}
}
+ /* This handles all the c comparisons in the paper */
+ if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
+ (ar.getType()==AbstractRepair.REMOVEFROMSET||ar.getType()==AbstractRepair.REMOVEFROMRELATION)&&
+ (ar.getPredicate().getPredicate() instanceof ExprPredicate)&&
+ (dp.getPredicate() instanceof ExprPredicate)&&
+ (dp.getPredicate().inverted()==ar.getPredicate().getPredicate().inverted())&&
+ (((ExprPredicate)dp.getPredicate()).getType()==ExprPredicate.COMPARISON)) {
+ boolean neg1=ar.getPredicate().isNegated();
+ Opcode op1=((ExprPredicate)ar.getPredicate().getPredicate()).getOp();
+ int size1=((ExprPredicate)ar.getPredicate().getPredicate()).rightSize();
+ int size2=1;
+ /* Translate the opcodes */
+ op1=Opcode.translateOpcode(neg1,op1);
+
+ if (((op1==Opcode.EQ)||(op1==Opcode.LT)||op1==Opcode.LE)||(op1==Opcode.NE)) {
+ int size1a=0;
+
+ if((op1==Opcode.EQ)||(op1==Opcode.LE))
+ size1a=size1;
+ if((op1==Opcode.LT)||(op1==Opcode.NE))
+ size1a=size1-1;
+
+ if (size1a==size2)
+ return false;
+ }
+ }
+
if (ar.getDescriptor()==dp.getPredicate().getDescriptor()&&
(ar.getType()==AbstractRepair.REMOVEFROMSET||ar.getType()==AbstractRepair.REMOVEFROMRELATION)&&
(dp.getPredicate() instanceof ExprPredicate)&&
return true;
}
- /** Does the increase (or decrease) in scope of a model defintion rule represented by sn
- * falsify the predicate dp */
+ /** Does the increase (or decrease) in scope of a model defintion
+ * rule represented by sn falsify the predicate dp. */
- public boolean interferes(ScopeNode sn, DNFPredicate dp) {
+ public boolean scopeinterfereswithpredicate(ScopeNode sn, DNFPredicate dp) {
if (!sn.getSatisfy()&&(sn.getDescriptor() instanceof SetDescriptor)) {
Rule r=sn.getRule();
Set target=r.getInclusion().getTargetDescriptors();
return interferes(sn.getDescriptor(), sn.getSatisfy(),dp);
}
- /** Does increasing (or decreasing if satisfy=false) the size of the set or relation des
- * falsify the predicate dp */
+ /** Does increasing (or decreasing if satisfy=false) the size of
+ * the set or relation des falsify the predicate dp. */
- public boolean interferes(Descriptor des, boolean satisfy, DNFPredicate dp) {
+ private boolean interferes(Descriptor des, boolean satisfy, DNFPredicate dp) {
if ((des!=dp.getPredicate().getDescriptor()) &&
- ((des instanceof SetDescriptor)||
- !dp.getPredicate().usesDescriptor((RelationDescriptor)des)))
+ //((des instanceof SetDescriptor)||
+ !dp.getPredicate().usesDescriptor(des))//)
return false;
/* This if handles all the c comparisons in the paper */
(op2==Opcode.LE)||
(op2==Opcode.LT))
return false;
- }
+ }
}
if ((des==dp.getPredicate().getDescriptor())&&
satisfy&&
return true;
}
- static public boolean interferesquantifier(Descriptor des, boolean satisfy, Quantifiers r, boolean satisfyrule) {
+ /** This method test whether satisfying (or falsifying depending
+ * on the flag satisfy) a rule that adds an object(or tuple) to
+ * the set(or relation) descriptor may increase (or decrease
+ * depending on the flag satisfyrule) the scope of a constraint or
+ * model defintion rule r. */
+
+ static private boolean interferesquantifier(Descriptor des, boolean satisfy, Quantifiers r, boolean satisfyrule) {
for(int i=0;i<r.numQuantifiers();i++) {
Quantifier q=r.getQuantifier(i);
if (q instanceof RelationQuantifier||q instanceof SetQuantifier) {
return false;
}
- static public boolean interferes(AbstractRepair ar, Quantifiers q) {
+ static public boolean interferesquantifier(AbstractRepair ar, Quantifiers q) {
if (ar.getType()==AbstractRepair.ADDTOSET||ar.getType()==AbstractRepair.ADDTORELATION)
return interferesquantifier(ar.getDescriptor(),true,q,true);
return false;
}
- static public boolean interferes(Descriptor des, boolean satisfy, Quantifiers q) {
+ static public boolean interfereswithquantifier(Descriptor des, boolean satisfy, Quantifiers q) {
return interferesquantifier(des, satisfy, q,true);
}
- static public boolean interferes(Descriptor des, boolean satisfy, Rule r, boolean satisfyrule) {
+ static public boolean interfereswithrule(Descriptor des, boolean satisfy, Rule r, boolean satisfyrule) {
if (interferesquantifier(des,satisfy,r,satisfyrule))
return true;
/* Scan DNF form */
projects / repair.git / blobdiff