Java ExprToIntCast.op方法代码示例

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/**
 * 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,
 *         translate(intExpr))
 */
public final Int visit(ExprToIntCast intExpr) {
	Int ret = lookup(intExpr);
	if (ret != null)
		return ret;
	vars = vars.createNested();
	BooleanMatrix expr = intExpr.expression().accept(this);
	switch (intExpr.op()) {
		case CARDINALITY :
			ret = expr.cardinality();
			break;
		case SUM :
			final IntSet ints = interpreter.ints();
			ret = sum(expr, ints.iterator(), 0, ints.size() - 1);
			break;
		default :
			throw new IllegalArgumentException("unknown operator: " + intExpr.op());
	}
	for (Variable v : vars)
		ret.defCond().addVar(v);
	vars = vars.parent();
	return cache(intExpr, ret);
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/**
 * @ensures this.tokens' = concat[ this.tokens, "int","[",
 *          tokenize[node.expression], "]" ]
 **/
public void visit(ExprToIntCast node) {
	switch (node.op()) {
		case SUM :
			append("int");
			append("[");
			node.expression().accept(this);
			append("]");
			break;
		case CARDINALITY :
			append("#");
			append("(");
			node.expression().accept(this);
			append(")");
			break;
		default :
			throw new IllegalArgumentException("unknown operator: " + node.op());
	}

}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** {@inheritDoc} */
public void visit(ExprToIntCast x) {
	String newname = makename(x);
	if (newname == null)
		return;
	String sub = make(x.expression());
	switch (x.op()) {
		case CARDINALITY :
			file.printf("IntExpression %s=%s.count();%n", newname, sub);
			break;
		case SUM :
			file.printf("IntExpression %s=%s.sum();%n", newname, sub);
			break;
		default :
			throw new RuntimeException("Unknown kodkod operator \"" + x.op() + "\" encountered");
	}
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** 
 * 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, translate(intExpr))
 */
public final Int visit(ExprToIntCast intExpr) {
	Int ret = lookup(intExpr);
	if (ret!=null) return ret;
	vars = vars.createNested();
	BooleanMatrix expr = intExpr.expression().accept(this);
       switch(intExpr.op()) {
	case CARDINALITY : 
		ret = expr.cardinality(); break;
	case SUM         :
		final IntSet ints = interpreter.ints();
		ret = sum(expr, ints.iterator(), 0, ints.size()-1); break;
	default: 
		throw new IllegalArgumentException("unknown operator: " + intExpr.op());
	}
       for (Variable v : vars) ret.defCond().addVar(v); 
       vars = vars.parent(); 
	return cache(intExpr, ret);
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** @ensures this.tokens' = concat[ this.tokens, "int","[",
 *   tokenize[node.expression], "]" ] **/
public void visit(ExprToIntCast node) {
	switch(node.op()) { 
	case SUM:
		append("int");
		append("[");
		node.expression().accept(this);
		append("]");
		break;
	case CARDINALITY : 
		append("#");
		append("(");
		node.expression().accept(this);
		append(")");
		break;
	default : throw new IllegalArgumentException("unknown operator: " + node.op());
	}
	
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
public IntExpression visit(ExprToIntCast expr) { 
	IntExpression ret = lookup(expr);
	if (ret!=null) return ret;
	
	final ExprCastOperator op = expr.op();
	final Expression child = expr.expression().accept(this);
	
	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()==ExprToIntCast.class) { 
			if (((ExprToIntCast)next).expression()==child)
				return cache(expr, next);
		}
	}
	ret = child==expr.expression() ? expr : child.apply(op);
	intExprs.add(new PartialCannonicalizer.Holder<IntExpression>(ret, hash));
	return cache(expr,ret);
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** @effects this.tokens' = concat[ this.tokens, "int","[",
 *   tokenize[node.expression], "]" ] **/
public void visit(ExprToIntCast node) {
	if (displayed(node)) return;
	final boolean oldTop = notTop();
	switch(node.op()) { 
	case SUM:
		append("int");
		append("[");
		node.expression().accept(this);
		append("]");
		break;
	case CARDINALITY : 
		append("#");
		append("(");
		node.expression().accept(this);
		append(")");
		break;
	default : throw new IllegalArgumentException("unknown operator: " + node.op());
	}
	top = oldTop;
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** {@inheritDoc} */
public void visit(ExprToIntCast x) {
    String newname=makename(x); if (newname==null) return;
    String sub=make(x.expression());
    switch(x.op()) {
       case CARDINALITY: file.printf("IntExpression %s=%s.count();%n", newname, sub); break;
       case SUM: file.printf("IntExpression %s=%s.sum();%n", newname, sub); break;
       default: throw new RuntimeException("Unknown kodkod operator \""+x.op()+"\" encountered");
    }
}
 

import kodkod.ast.ExprToIntCast; //导入方法依赖的package包/类
/** 
 * 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, translate(intExpr))
 */
public final Int visit(ExprToIntCast intExpr) {
	Int ret = lookup(intExpr);
	if (ret!=null) return ret;
	switch(intExpr.op()) {
	case CARDINALITY : 
		ret = intExpr.expression().accept(this).cardinality(); break;
	case SUM         :
		final IntSet ints = interpreter.ints();
		ret = sum(intExpr.expression().accept(this), ints.iterator(), 0, ints.size()-1); break;
	default: 
		throw new IllegalArgumentException("unknown operator: " + intExpr.op());
	}
	return cache(intExpr, ret);
}