Java Code Examples for kodkod.ast.UnaryIntExpression#intExpr()
The following examples show how to use
kodkod.ast.UnaryIntExpression#intExpr() .
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: PartialCannonicalizer.java From quetzal with Eclipse Public License 2.0 | 6 votes |
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 2
Source File: AbstractReplacer.java From org.alloytools.alloy with Apache License 2.0 | 5 votes |
/** * Calls lookup(intExpr) and returns the cached value, if any. If a replacement * has not been cached, visits the expression's child. If nothing changes, the * argument is cached and returned, otherwise a replacement expression is cached * and returned. * * @return { u: UnaryIntExpression | u.expression = * intExpr.expression.accept(delegate) && u.op = intExpr.op } */ @Override public IntExpression visit(UnaryIntExpression intExpr) { IntExpression ret = lookup(intExpr); if (ret != null) return ret; final IntExpression child = intExpr.intExpr().accept(delegate); ret = (child == intExpr.intExpr()) ? intExpr : child.apply(intExpr.op()); return cache(intExpr, ret); }
Example 3
Source File: PrettyPrinter.java From org.alloytools.alloy with Apache License 2.0 | 5 votes |
/** * @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 4
Source File: AbstractReplacer.java From kodkod with MIT License | 5 votes |
/** * Calls lookup(intExpr) and returns the cached value, if any. * If a replacement has not been cached, visits the expression's * child. If nothing changes, the argument is cached and * returned, otherwise a replacement expression is cached and returned. * @return { u: UnaryIntExpression | u.expression = intExpr.expression.accept(this) && u.op = intExpr.op } */ public IntExpression visit(UnaryIntExpression intExpr) { IntExpression ret = lookup(intExpr); if (ret!=null) return ret; final IntExpression child = intExpr.intExpr().accept(this); ret = (child==intExpr.intExpr()) ? intExpr : child.apply(intExpr.op()); return cache(intExpr,ret); }
Example 5
Source File: PrettyPrinter.java From kodkod with MIT License | 5 votes |
/** @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 6
Source File: PrettyPrinter.java From quetzal with Eclipse Public License 2.0 | 5 votes |
/** @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 7
Source File: Simplifier.java From quetzal with Eclipse Public License 2.0 | 5 votes |
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); }