Package kodkod.ast

Examples of kodkod.ast.NaryFormula.op()

77
78
79
80
81
82
83
84
85
86
87
          itr.previous();
          itr.previous();
        }
      } else if (f instanceof NaryFormula) {
        final NaryFormula nf = (NaryFormula) f;
        if (nf.op()==FormulaOperator.AND) {
          itr.remove();
          for(Formula child : nf) {
            itr.add(child);
          }
          for(int i = nf.size(); i>0; i--) {
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
         
        };
      }
    } else if (formula instanceof NaryFormula) {
      final NaryFormula nf = (NaryFormula) formula;
      if (nf.op()==FormulaOperator.AND) {
        final LinkedHashSet<Formula> children = new LinkedHashSet<Formula>(1+(nf.size()*4)/3);
        for(Formula child : nf) { children.add(child); }
        return Collections.unmodifiableSet(children);
      }
    }
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
    /** Simplify the bounds based on the fact that "form is true"; return false if we discover the formula is unsat. */
    private final boolean simplify_in (Formula form) {
       if (form instanceof NaryFormula) {
          NaryFormula f = (NaryFormula)form;
          if (f.op() == FormulaOperator.AND) {
             for(Iterator<Formula> i = f.iterator(); i.hasNext();) if (!simplify_in(i.next())) return false;
          }
       }
       if (form instanceof BinaryFormula) {
          BinaryFormula f = (BinaryFormula)form;
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
             for(Iterator<Formula> i = f.iterator(); i.hasNext();) if (!simplify_in(i.next())) return false;
          }
       }
       if (form instanceof BinaryFormula) {
          BinaryFormula f = (BinaryFormula)form;
          if (f.op() == FormulaOperator.AND) {
             return simplify_in(f.left()) && simplify_in(f.right());
          }
       }
       if (form instanceof ComparisonFormula) {
          ComparisonFormula f = (ComparisonFormula)form;
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
             return simplify_in(f.left()) && simplify_in(f.right());
          }
       }
       if (form instanceof ComparisonFormula) {
          ComparisonFormula f = (ComparisonFormula)form;
          if (f.op() == ExprCompOperator.SUBSET) {
             if (!simplify_in(f.left(), f.right())) return false;
          }
          if (f.op() == ExprCompOperator.EQUALS) {
             if (!simplify_in(f.left(), f.right())) return false;
             if (!simplify_in(f.right(), f.left())) return false;
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
       if (form instanceof ComparisonFormula) {
          ComparisonFormula f = (ComparisonFormula)form;
          if (f.op() == ExprCompOperator.SUBSET) {
             if (!simplify_in(f.left(), f.right())) return false;
          }
          if (f.op() == ExprCompOperator.EQUALS) {
             if (!simplify_in(f.left(), f.right())) return false;
             if (!simplify_in(f.right(), f.left())) return false;
          }
       }
       return true;
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
    /** Simplify the bounds based on the fact that "form is true"; return false if we discover the formula is unsat. */
    private final boolean simplify_eq (Formula form) {
       if (form instanceof NaryFormula) {
          NaryFormula f = (NaryFormula)form;
          if (f.op() == FormulaOperator.AND) {
             for(Iterator<Formula> i = f.iterator(); i.hasNext();) if (!simplify_eq(i.next())) return false;
          }
       }
       if (form instanceof BinaryFormula) {
          BinaryFormula f = (BinaryFormula)form;
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
             for(Iterator<Formula> i = f.iterator(); i.hasNext();) if (!simplify_eq(i.next())) return false;
          }
       }
       if (form instanceof BinaryFormula) {
          BinaryFormula f = (BinaryFormula)form;
          if (f.op() == FormulaOperator.AND) {
             return simplify_eq(f.left()) && simplify_eq(f.right());
          }
       }
       if (form instanceof ComparisonFormula) {
          ComparisonFormula f = (ComparisonFormula)form;
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
             return simplify_eq(f.left()) && simplify_eq(f.right());
          }
       }
       if (form instanceof ComparisonFormula) {
          ComparisonFormula f = (ComparisonFormula)form;
          if (f.op() == ExprCompOperator.EQUALS) {
             if (!simplify_equal(f.left(), f.right())) return false;
          }
       }
       return true;
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.