Java IntComparisonFormula类代码示例

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** 
 * 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))
 */
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);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** 
 * 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);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
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);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/**
 * Calls lookup(intComp) and returns the cached value, if any. If a
 * replacement has not been cached, visits the formula's children. If
 * nothing changes, the argument is cached and returned, otherwise a
 * replacement formula is cached and returned.
 * 
 * @return { c: Formula | [[c]] = intComp.left.accept(delegate) op
 *         intComp.right.accept(delegate) }
 */
public Formula visit(IntComparisonFormula intComp) {
	Formula ret = lookup(intComp);
	if (ret != null)
		return ret;

	final IntExpression left = intComp.left().accept(delegate);
	final IntExpression right = intComp.right().accept(delegate);
	ret = (left == intComp.left() && right == intComp.right()) ? intComp : left.compare(intComp.op(), right);
	return cache(intComp, ret);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/**
 * Visits the children of the given integer comparison formula if
 * this.visited(intComp) returns false. Otherwise does nothing.
 * 
 * @ensures intComp.left.accept(this) && intComp.right.accept(this)
 */
public void visit(IntComparisonFormula intComp) {
	if (visited(intComp))
		return;
	intComp.left().accept(this);
	intComp.right().accept(this);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/**
 * Calls lookup(intComp) and returns the cached value, if any. If no cached
 * value exists, visits each child, caches the union of the children's
 * return values and returns it.
 * 
 * @return let x = lookup(intComp) | x != null => x, cache(intComp,
 *         intComp.left.accept(this) + intComp.right.accept(this))
 */
public Set<T> visit(IntComparisonFormula intComp) {
	Set<T> ret = lookup(intComp);
	if (ret != null)
		return ret;
	ret = newSet();
	ret.addAll(intComp.left().accept(this));
	ret.addAll(intComp.right().accept(this));
	return cache(intComp, ret);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** @see #visitFormula(Formula) */
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);
		}
	}
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/**
 * Calls super.visit(icf) after disabling skolemization and returns the
 * result.
 * 
 * @return super.visit(icf)
 **/
public final Formula visit(IntComparisonFormula icf) {
	final int oldDepth = skolemDepth;
	skolemDepth = -1; // cannot skolemize inside an int comparison formula
	final Formula ret = super.visit(icf);
	skolemDepth = oldDepth;
	return source(ret, icf);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/**
 * 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))
 */
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);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** {@inheritDoc} */
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");
	}
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** {@inheritDoc} */
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");
    }
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** 
* Calls lookup(intComp) and returns the cached value, if any.  
* If a replacement has not been cached, visits the formula's 
* children.  If nothing changes, the argument is cached and
* returned, otherwise a replacement formula is cached and returned.
* @return { c: Formula | [[c]] = intComp.left.accept(this) op intComp.right.accept(this) }
*/
  public Formula visit(IntComparisonFormula intComp) {
Formula ret = lookup(intComp);
if (ret!=null) return ret;

final IntExpression left  = intComp.left().accept(this);
final IntExpression right = intComp.right().accept(this);
ret =  (left==intComp.left() && right==intComp.right()) ? 
		intComp : left.compare(intComp.op(), right);
return cache(intComp,ret);
  }
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** 
 * Calls lookup(intComp) and returns the cached value, if any.  
 * If no cached value exists, visits each child, caches the
 * union of the children's return values and returns it. 
 * @return let x = lookup(intComp) | 
 *          x != null => x,  
 *          cache(intComp, intComp.left.accept(this) + intComp.right.accept(this)) 
 */
public Set<T> visit(IntComparisonFormula intComp) {
	Set<T> ret = lookup(intComp);
	if (ret!=null) return ret;		
	ret = newSet();
	ret.addAll(intComp.left().accept(this));
	ret.addAll(intComp.right().accept(this));
	return cache(intComp, ret);
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** @see #visitFormula(Formula) */
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);
        }            
    }
}
 

import kodkod.ast.IntComparisonFormula; //导入依赖的package包/类
/** @see #visitFormula(Formula) */
public final Formula visit(IntComparisonFormula cf) {
    //if (visited(cf)) return;
    IntExpression lh = cf.left().accept(this);
    IntExpression rh = cf.right().accept(this);
    if (!negated) {
        if (lh == cf.left() && rh == cf.right()) {
            return addMapping(cf, cf);                
        } else {
            return addMapping(lh.compare(cf.op(), rh), cf);
        }
    } else {
        switch (cf.op()) {
        case GT:
            return addMapping(lh.lte(rh), cf);
        case GTE:
            return addMapping(lh.lt(rh), cf);
        case LT:
            return addMapping(lh.gte(rh), cf);
        case LTE:
            return addMapping(lh.gt(rh), cf);
        case EQ:
            return addMapping(lh.neq(rh), cf);
        case NEQ:
            return addMapping(lh.eq(rh), cf);
        default:   
            return addMapping(cf, cf);
        }            
    }
}