Java Code Examples for kodkod.ast.BinaryIntExpression#op()

The following examples show how to use kodkod.ast.BinaryIntExpression#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 vote down vote up 
/** 
 * Calls lookup(intExpr) and returns the cached value, if any.  
 * If a translation has not been cached, translates the expression,
 * calls cache(...) on it and returns it.
 * @return let t = lookup(intExpr) | some t => t, 
 * 	cache(intExpr, intExpr.left.accept(this) intExpr.op intExpr.right.accept(this))
 */
public final Int visit(BinaryIntExpression intExpr) {
	Int ret = lookup(intExpr);
	if (ret!=null) return ret;
	final Int left = intExpr.left().accept(this);
	final Int right = intExpr.right().accept(this);
	switch(intExpr.op()) {
	case PLUS  		: ret = left.plus(right); break;
	case MINUS 		: ret = left.minus(right); break;
	case MULTIPLY 	: ret = left.multiply(right); break;
	case DIVIDE 	: ret = left.divide(right); break;
	case MODULO		: ret = left.modulo(right); break;
	case AND		: ret = left.and(right); break;
	case OR			: ret = left.or(right); break;
	case XOR		: ret = left.xor(right); break;
	case SHL		: ret = left.shl(right); break;
	case SHR		: ret = left.shr(right); break;
	case SHA		: ret = left.sha(right); break;
	default    :
		throw new IllegalArgumentException("Unknown operator: " + intExpr.op());
	}
	return cache(intExpr, ret);
}
Example 2
Source File: PrettyPrinter.java    From org.alloytools.alloy with Apache License 2.0 5 votes vote down vote up 
/**
 * @ensures appends the tokenization of the given node to this.tokens
 */
@Override
public void visit(BinaryIntExpression node) {
    final IntOperator op = node.op();
    visitChild(node.left(), parenthesize(op, node.left()));
    infix(op);
    visitChild(node.right(), parenthesize(op, node.right()));
}
Example 3
Source File: PrettyPrinter.java    From kodkod with MIT License 5 votes vote down vote up 
/** @ensures appends the tokenization of the given node to this.tokens */
public void visit(BinaryIntExpression node) {
	final IntOperator op = node.op();
	visitChild(node.left(), parenthesize(op, node.left()));
	infix(op);
	visitChild(node.right(), parenthesize(op, node.right()));
}
Example 4
Source File: PartialCannonicalizer.java    From quetzal with Eclipse Public License 2.0 5 votes vote down vote up 
public IntExpression visit(BinaryIntExpression expr) { 
	IntExpression ret = lookup(expr);
	if (ret!=null) return ret;
	final IntOperator op = expr.op();
	final IntExpression left = expr.left().accept(this);
	final IntExpression right = expr.right().accept(this);
	
	ret = simplify(op, left, right);
	
	if (ret==null) {
	
		final int hash = hash(op, left, right);
		for(Iterator<PartialCannonicalizer.Holder<IntExpression>> itr = intExprs.get(hash); itr.hasNext(); ) {
			final IntExpression next = itr.next().obj;
			if (next instanceof BinaryIntExpression) { 
				final BinaryIntExpression hit = (BinaryIntExpression) next;
				if (hit.op()==op && hit.left()==left && hit.right()==right) { 
					return cache(expr, hit);
				}
			}
		}

		ret = left==expr.left()&&right==expr.right() ? expr : left.compose(op, right);
		intExprs.add(new PartialCannonicalizer.Holder<IntExpression>(ret, hash));
	}
	
	return cache(expr,ret);
}
Example 5
Source File: PrettyPrinter.java    From quetzal with Eclipse Public License 2.0 5 votes vote down vote up 
/** @effects appends the tokenization of the given node to this.tokens */
public void visit(BinaryIntExpression node) {
	if (displayed(node)) return;
	final boolean oldTop = notTop();
	final IntOperator op = node.op();
	visitChild(node.left(), parenthesize(op, node.left()));
	infix(op);
	visitChild(node.right(), parenthesize(op, node.right()));
	top = oldTop;
}
Example 6
Source File: Simplifier.java    From quetzal with Eclipse Public License 2.0 5 votes vote down vote up 
public IntExpression visit(BinaryIntExpression expr) { 
	IntExpression ret = lookup(expr);
	if (ret!=null) return ret;
	final IntOperator op = expr.op();
	final IntExpression left = expr.left().accept(this);
	final IntExpression right = expr.right().accept(this);
	
	ret = simplify(op, left, right);
	
	if (ret==null) {
		ret = left==expr.left()&&right==expr.right() ? expr : left.compose(op, right);
	}
	
	return cache(expr,ret);
}
Example 7
Source File: FOL2BoolTranslator.java    From org.alloytools.alloy with Apache License 2.0 4 votes vote down vote up 
/**
 * Calls lookup(intExpr) and returns the cached value, if any. If a translation
 * has not been cached, translates the expression, calls cache(...) on it and
 * returns it.
 *
 * @return let t = lookup(intExpr) | some t => t, cache(intExpr,
 *         intExpr.left.accept(this) intExpr.op intExpr.right.accept(this))
 */
@Override
public final Int visit(BinaryIntExpression intExpr) {
    Int ret = lookup(intExpr);
    if (ret != null)
        return ret;
    final Int left = intExpr.left().accept(this);
    final Int right = intExpr.right().accept(this);
    switch (intExpr.op()) {
        case PLUS :
            ret = left.plus(right);
            break;
        case MINUS :
            ret = left.minus(right);
            break;
        case MULTIPLY :
            ret = left.multiply(right);
            break;
        case DIVIDE :
            ret = left.divide(right);
            break;
        case MODULO :
            ret = left.modulo(right);
            break;
        case AND :
            ret = left.and(right);
            break;
        case OR :
            ret = left.or(right);
            break;
        case XOR :
            ret = left.xor(right);
            break;
        case SHL :
            ret = left.shl(right);
            break;
        case SHR :
            ret = left.shr(right);
            break;
        case SHA :
            ret = left.sha(right);
            break;
        default :
            throw new IllegalArgumentException("Unknown operator: " + intExpr.op());
    }
    return cache(intExpr, ret);
}
Example 8
Source File: TranslateKodkodToJava.java    From org.alloytools.alloy with Apache License 2.0 4 votes vote down vote up 
/** {@inheritDoc} */
@Override
public void visit(BinaryIntExpression x) {
    String newname = makename(x);
    if (newname == null)
        return;
    String left = make(x.left());
    String right = make(x.right());
    switch (x.op()) {
        case PLUS :
            file.printf("IntExpression %s=%s.plus(%s);%n", newname, left, right);
            break;
        case MINUS :
            file.printf("IntExpression %s=%s.minus(%s);%n", newname, left, right);
            break;
        case MULTIPLY :
            file.printf("IntExpression %s=%s.multiply(%s);%n", newname, left, right);
            break;
        case DIVIDE :
            file.printf("IntExpression %s=%s.divide(%s);%n", newname, left, right);
            break;
        case MODULO :
            file.printf("IntExpression %s=%s.modulo(%s);%n", newname, left, right);
            break;
        case AND :
            file.printf("IntExpression %s=%s.and(%s);%n", newname, left, right);
            break;
        case OR :
            file.printf("IntExpression %s=%s.or(%s);%n", newname, left, right);
            break;
        case XOR :
            file.printf("IntExpression %s=%s.xor(%s);%n", newname, left, right);
            break;
        case SHA :
            file.printf("IntExpression %s=%s.sha(%s);%n", newname, left, right);
            break;
        case SHL :
            file.printf("IntExpression %s=%s.shl(%s);%n", newname, left, right);
            break;
        case SHR :
            file.printf("IntExpression %s=%s.shr(%s);%n", newname, left, right);
            break;
        default :
            throw new RuntimeException("Unknown kodkod operator \"" + x.op() + "\" encountered");
    }
}