java方法choice怎么用_Java Int.choice方法代码示例

import kodkod.engine.bool.Int; //导入方法依赖的package包/类

/**

* Translates the given sum expression as follows

* (where A_0...A_|A| stand for boolean variables that represent the

* tuples of the expression A, etc.):

* let sum = "sum a: A, b: B, ..., x: X | IE(a, b, ..., x) " |

* sum a: A, b: B, ..., x: X | if (a in A && b in B && ... && x in X) then IE(a, b, ..., x) else 0 }.

* @param decls intexpr declarations

* @param formula the formula body

* @param currentDecl currently processed declaration; should be 0 initially

* @param declConstraints the constraints implied by the declarations; should be Boolean.TRUE intially

* @param values integer values computed so far

*/

private final void sum(Decls decls, IntExpression expr, int currentDecl, BooleanValue declConstraints,

List values) {

final BooleanFactory factory = interpreter.factory();

if (decls.size()==currentDecl) {

Int intExpr = expr.accept(this);

Int newInt = intExpr.choice(declConstraints, factory.integer(0));

values.add(newInt);

return;

}

final Decl decl = decls.get(currentDecl);

final BooleanMatrix declTransl = visit(decl);

final BooleanMatrix groundValue = factory.matrix(declTransl.dimensions());

env = env.extend(decl.variable(), decl.expression(), groundValue);

for(IndexedEntry entry : declTransl) {

groundValue.set(entry.index(), BooleanConstant.TRUE);

sum(decls, expr, currentDecl+1, factory.and(entry.value(), declConstraints), values);

groundValue.set(entry.index(), BooleanConstant.FALSE);

}

env = env.parent();

}