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

The following examples show how to use kodkod.ast.UnaryIntExpression#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 org.alloytools.alloy with Apache License 2.0 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.op(intExpr.expression.accept(this)))
 */
@Override
public final Int visit(UnaryIntExpression intExpr) {
    Int ret = lookup(intExpr);
    if (ret != null)
        return ret;
    final Int child = intExpr.intExpr().accept(this);
    switch (intExpr.op()) {
        case NEG :
            ret = child.negate();
            break;
        case NOT :
            ret = child.not();
            break;
        case ABS :
            ret = child.abs();
            break;
        case SGN :
            ret = child.sgn();
            break;
        default :
            throw new IllegalArgumentException("Unknown operator: " + intExpr.op());
    }
    return cache(intExpr, ret);
}
Example 2
Source File: TranslateKodkodToJava.java    From org.alloytools.alloy with Apache License 2.0 6 votes vote down vote up 
/** {@inheritDoc} */
@Override
public void visit(UnaryIntExpression x) {
    String newname = makename(x);
    if (newname == null)
        return;
    String sub = make(x.intExpr());
    switch (x.op()) {
        case MINUS :
            file.printf("IntExpression %s=%s.negate();%n", newname, sub);
            break;
        case NOT :
            file.printf("IntExpression %s=%s.not();%n", newname, sub);
            break;
        case ABS :
            file.printf("IntExpression %s=%s.abs();%n", newname, sub);
            break;
        case SGN :
            file.printf("IntExpression %s=%s.signum();%n", newname, sub);
            break;
        default :
            throw new RuntimeException("Unknown kodkod operator \"" + x.op() + "\" encountered");
    }
}
Example 3
Source File: PartialCannonicalizer.java    From quetzal with Eclipse Public License 2.0 6 votes vote down vote up 
public IntExpression visit(UnaryIntExpression expr) { 
	IntExpression ret = lookup(expr);
	if (ret!=null) return ret;
	
	final IntOperator op = expr.op();
	final IntExpression child = expr.intExpr().accept(this);
	
	ret = simplify(op, child);
	if (ret==null) {
		final int hash = hash(op, child);
		for(Iterator<PartialCannonicalizer.Holder<IntExpression>> itr = intExprs.get(hash); itr.hasNext(); ) {
			final IntExpression next = itr.next().obj;
			if (next.getClass()==UnaryIntExpression.class) { 
				if (((UnaryIntExpression)next).intExpr()==child)
					return cache(expr, next);
			}
		}
		ret = child==expr.intExpr() ? expr : child.apply(op);
		intExprs.add(new PartialCannonicalizer.Holder<IntExpression>(ret, hash));
	}
	return cache(expr,ret);
}
Example 4
Source File: PrettyPrinter.java    From org.alloytools.alloy with Apache License 2.0 5 votes vote down vote up 
/**
 * @ensures appends the given op and child to this.tokens; the child is
 *          parenthesized if it's not an instance of unary int expression or int
 *          constant.
 **/
@Override
public void visit(UnaryIntExpression node) {
    final IntExpression child = node.intExpr();
    final IntOperator op = node.op();
    final boolean parens = (op == IntOperator.ABS) || (op == IntOperator.SGN) || parenthesize(child);
    append(node.op());
    visitChild(child, parens);
}
Example 5
Source File: FOL2BoolTranslator.java    From kodkod with MIT License 5 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.op(intExpr.expression.accept(this)))
 */
public final Int visit(UnaryIntExpression intExpr) {
	Int ret = lookup(intExpr);
	if (ret!=null) return ret;
	final Int child = intExpr.intExpr().accept(this);
	switch(intExpr.op()) {
	case NEG 	: ret = child.negate(); break;
	case NOT 	: ret = child.not(); break;
	case ABS 	: ret = child.abs(); break;
	case SGN 	: ret = child.sgn(); break;
	default : 
		throw new IllegalArgumentException("Unknown operator: " + intExpr.op());
	}
	return cache(intExpr, ret);
}
Example 6
Source File: PrettyPrinter.java    From kodkod with MIT License 5 votes vote down vote up 
/** @ensures appends the given op and child to this.tokens; the child is 
 * parenthesized if it's not an instance of unary int expression or int constant. **/
public void visit(UnaryIntExpression node)  { 
	final IntExpression child = node.intExpr();
	final IntOperator op = node.op();
	final boolean parens = 
		(op==IntOperator.ABS) || (op==IntOperator.SGN) || 
		parenthesize(child);
	append(node.op());
	visitChild(child, parens);
}
Example 7
Source File: PrettyPrinter.java    From quetzal with Eclipse Public License 2.0 5 votes vote down vote up 
/** @effects appends the given op and child to this.tokens; the child is 
 * parenthesized if it's not an instance of unary int expression or int constant. **/
public void visit(UnaryIntExpression node)  { 
	if (displayed(node)) return;
	final boolean oldTop = notTop();
	final IntExpression child = node.intExpr();
	final IntOperator op = node.op();
	final boolean parens = 
		(op==IntOperator.ABS) || (op==IntOperator.SGN) || 
		parenthesize(child);
	append(node.op());
	visitChild(child, parens);
	top = oldTop;
}
Example 8
Source File: Simplifier.java    From quetzal with Eclipse Public License 2.0 5 votes vote down vote up 
public IntExpression visit(UnaryIntExpression expr) { 
	IntExpression ret = lookup(expr);
	if (ret!=null) return ret;
	
	final IntOperator op = expr.op();
	final IntExpression child = expr.intExpr().accept(this);
	
	ret = simplify(op, child);
	if (ret==null) {
		ret = child==expr.intExpr() ? expr : child.apply(op);
	}
	return cache(expr,ret);
}