Examples of ExprOperator

kodkod.ast.operator.ExprOperator

Examples of kodkod.ast.operator.ExprOperator

               ((BinaryExpression)child).op()!=op));
    }
    
    /** @effects appends the tokenization of the given node to this.tokens */
    public void visit(BinaryExpression node) {
      final ExprOperator op = node.op();
      visitChild(node.left(), parenthesize(op, node.left()));
      infix(op);
      visitChild(node.right(), parenthesize(op, node.right()));
    }

View Full Code Here

Examples of kodkod.ast.operator.ExprOperator

    
    /*--------------NARY NODES---------------*/
    
    /** @effects appends the tokenization of the given node to this.tokens */
    public void visit(NaryExpression node) {
      final ExprOperator op = node.op();
      visitChild(node.child(0), parenthesize(op, node.child(0)));
      for(int i = 1, size = node.size(); i < size; i++) {
        infix(op);
        visitChild(node.child(i), parenthesize(op, node.child(i)));
      }

View Full Code Here

Examples of kodkod.ast.operator.ExprOperator

    BooleanMatrix ret = lookup(binExpr);
    if (ret!=null) return ret;


    final BooleanMatrix left = binExpr.left().accept(this);
    final BooleanMatrix right = binExpr.right().accept(this);
    final ExprOperator op = binExpr.op();


    switch(op) {
    case UNION          : ret = left.or(right); break;
    case INTERSECTION  : ret = left.and(right); break;
    case DIFFERENCE   : ret = left.difference(right); break;

View Full Code Here

Examples of kodkod.ast.operator.ExprOperator

   */
  public BooleanMatrix visit(NaryExpression expr) {
    BooleanMatrix ret = lookup(expr);
    if (ret!=null) return ret;


    final ExprOperator op = expr.op();
    final BooleanMatrix first = expr.child(0).accept(this);    
    final BooleanMatrix[] rest = new BooleanMatrix[expr.size()-1];
    for(int i = 0; i < rest.length; i++) {   rest[i] = expr.child(i+1).accept(this); }
    
    switch(op) {

View Full Code Here

Examples of kodkod.ast.operator.ExprOperator

  public final BooleanMatrix visit(UnaryExpression unaryExpr) {
    BooleanMatrix ret = lookup(unaryExpr);
    if (ret!=null) return ret;


    final BooleanMatrix child = unaryExpr.expression().accept(this);
    final ExprOperator op = unaryExpr.op();


    switch(op) {
    case TRANSPOSE           : ret = child.transpose(); break;
    case CLOSURE             : ret = child.closure(); break;
    case REFLEXIVE_CLOSURE  : ret = child.closure().or(visit((ConstantExpression)Expression.IDEN)); break;

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.