Java Code Examples for kodkod.ast.IntComparisonFormula#op()
The following examples show how to use
kodkod.ast.IntComparisonFormula#op() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
| Source File: FOL2BoolTranslator.java From kodkod with MIT License | 6 votes |
|
/**
* Calls lookup(intComp) and returns the cached value, if any.
* If a translation has not been cached, translates the formula,
* calls cache(...) on it and returns it.
* @return let t = lookup(intComp) | some t => t,
* cache(intComp, intComp.left.accept(this) intComp.op intComp.right.accept(this))
*/
public final BooleanValue visit(IntComparisonFormula intComp) {
BooleanValue ret = lookup(intComp);
if (ret!=null) return ret;
final Int left = intComp.left().accept(this);
final Int right = intComp.right().accept(this);
switch(intComp.op()) {
case EQ : ret = left.eq(right); break;
case LT : ret = left.lt(right); break;
case LTE : ret = left.lte(right); break;
case GT : ret = left.gt(right); break;
case GTE : ret = left.gte(right); break;
default:
throw new IllegalArgumentException("Unknown operator: " + intComp.op());
}
return cache(intComp, ret);
}
Example 2
| Source File: PartialCannonicalizer.java From quetzal with Eclipse Public License 2.0 | 6 votes |
|
public Formula visit(IntComparisonFormula formula) {
Formula ret = lookup(formula);
if (ret!=null) return ret;
final IntCompOperator op = formula.op();
final IntExpression left = formula.left().accept(this);
final IntExpression right = formula.right().accept(this);
if (left==right) return cache(formula,Formula.TRUE);
final int hash = hash(op, left, right);
for(Iterator<PartialCannonicalizer.Holder<Formula>> itr = formulas.get(hash); itr.hasNext(); ) {
final Formula next = itr.next().obj;
if (next instanceof IntComparisonFormula) {
final IntComparisonFormula hit = (IntComparisonFormula) next;
if (hit.op()==op && hit.left()==left && hit.right()==right) {
return cache(formula, hit);
}
}
}
ret = left==formula.left()&&right==formula.right() ? formula : left.compare(op, right);
formulas.add(new PartialCannonicalizer.Holder<Formula>(ret, hash));
return cache(formula,ret);
}
Example 3
| Source File: FullNegationPropagator.java From org.alloytools.alloy with Apache License 2.0 | 5 votes |
|
/** @see #visitFormula(Formula) */
@Override
public final void visit(IntComparisonFormula cf) {
if (visited(cf))
return;
if (!negated) {
addConjunct(cf);
} else {
switch (cf.op()) {
case GT :
addConjunct(cf.left().lte(cf.right()), false, cf);
hasChanged = true;
break;
case GTE :
addConjunct(cf.left().lt(cf.right()), false, cf);
hasChanged = true;
break;
case LT :
addConjunct(cf.left().gte(cf.right()), false, cf);
hasChanged = true;
break;
case LTE :
addConjunct(cf.left().gt(cf.right()), false, cf);
hasChanged = true;
break;
case EQ :
addConjunct(cf.left().neq(cf.right()), false, cf);
hasChanged = true;
break;
case NEQ :
addConjunct(cf.left().eq(cf.right()), false, cf);
hasChanged = true;
break;
default :
addConjunct(cf);
}
}
}
Example 4
| Source File: FOL2BoolTranslator.java From org.alloytools.alloy with Apache License 2.0 | 5 votes |
|
/**
* Calls lookup(intComp) and returns the cached value, if any. If a translation
* has not been cached, translates the formula, calls cache(...) on it and
* returns it. This is the only place where <code>Int</code>s are turned into
* formulas, so that's where the overflow circuits of individual
* <code>Int</code>s are built into the translated formula.
*
* @return let t = lookup(intComp) | some t => t, cache(intComp,
* intComp.left.accept(this) intComp.op intComp.right.accept(this))
*/
@Override
public final BooleanValue visit(IntComparisonFormula intComp) {
BooleanValue ret = lookup(intComp);
if (ret != null)
return ret;
final Int left = intComp.left().accept(this);
final Int right = intComp.right().accept(this);
switch (intComp.op()) {
case EQ :
ret = left.eq(right, env);
break;
case NEQ :
ret = left.neq(right, env);
break;
case LT :
ret = left.lt(right, env);
break;
case LTE :
ret = left.lte(right, env);
break;
case GT :
ret = left.gt(right, env);
break;
case GTE :
ret = left.gte(right, env);
break;
default :
throw new IllegalArgumentException("Unknown operator: " + intComp.op());
}
return cache(intComp, ret);
}
Example 5
| Source File: TranslateKodkodToJava.java From org.alloytools.alloy with Apache License 2.0 | 5 votes |
|
/** {@inheritDoc} */
@Override
public void visit(IntComparisonFormula x) {
String newname = makename(x);
if (newname == null)
return;
String left = make(x.left());
String right = make(x.right());
switch (x.op()) {
case NEQ :
file.printf("Formula %s=%s.neq(%s);%n", newname, left, right);
break;
case EQ :
file.printf("Formula %s=%s.eq(%s);%n", newname, left, right);
break;
case GT :
file.printf("Formula %s=%s.gt(%s);%n", newname, left, right);
break;
case GTE :
file.printf("Formula %s=%s.gte(%s);%n", newname, left, right);
break;
case LT :
file.printf("Formula %s=%s.lt(%s);%n", newname, left, right);
break;
case LTE :
file.printf("Formula %s=%s.lte(%s);%n", newname, left, right);
break;
default :
throw new RuntimeException("Unknown kodkod operator \"" + x.op() + "\" encountered");
}
}
Example 6
| Source File: Simplifier.java From quetzal with Eclipse Public License 2.0 | 5 votes |
|
public Formula visit(IntComparisonFormula formula) {
Formula ret = lookup(formula);
if (ret!=null) return ret;
final IntCompOperator op = formula.op();
final IntExpression left = formula.left().accept(this);
final IntExpression right = formula.right().accept(this);
if (left==right) return cache(formula,Formula.TRUE);
ret = left==formula.left()&&right==formula.right() ? formula : left.compare(op, right);
return cache(formula,ret);
}
