kodkod.ast.ConstantFormula Java Examples

private void edge(Node n1, Node n2) { 
	if (n2 instanceof LeafExpression || n2 instanceof ConstantFormula || n2 instanceof IntConstant) {
		
	}
	graph.append(id(n1));
	graph.append("->");
	graph.append(id(n2));
	graph.append(";\n");
}
 

/** {@inheritDoc} */
@Override
public void visit(ConstantFormula x) {
    if (map.containsKey(x))
        return;
    String newname = (x.booleanValue() ? "Formula.TRUE" : "Formula.FALSE");
    map.put(x, newname);
}
 

private void edge(Node n1, Node n2) {
    if (n2 instanceof LeafExpression || n2 instanceof ConstantFormula || n2 instanceof IntConstant) {

    }
    graph.append(id(n1));
    graph.append("->");
    graph.append(id(n2));
    graph.append(";\n");
}
 

@Override
public Boolean visit(ConstantFormula cnst) {
    return noHOL(cnst);
}
 

/** @return true if the given formula should be parenthesized when a 
 * child of a compound parent */
private boolean parenthesize(Formula child) { 
	return !(child instanceof NotFormula || child instanceof ConstantFormula || 
			 child instanceof RelationPredicate);
}
 

/** @effects this.tokens' = concat[ this.tokens, node ] */
public void visit(ConstantFormula node) { append(node); }
 

/** @return true if the given formula should be parenthesized when a 
 * child of a compound parent */
private boolean parenthesize(Formula child) { 
	return !(child instanceof NotFormula || child instanceof ConstantFormula || 
			 child instanceof RelationPredicate);
}
 

/** @ensures this.tokens' = concat[ this.tokens, node ] */
public void visit(ConstantFormula node) { append(node); }
 

/** @see #visitFormula(Formula) */
public final void visit(ConstantFormula constant)	{ visitFormula(constant); }
 

/**
 * @return constant = ConstantFormula.TRUE => BooleanConstant.TRUE, BooleanConstant.FALSE
 */
public final BooleanValue visit(ConstantFormula constant) {
	return cache(constant, BooleanConstant.constant(constant.booleanValue()));
}
 

public void visit(ConstantFormula formula) { 
	relevant.add(formula);
}
 

/**
 * Returns Collections.EMPTY_SET
 * @return Collections.EMPTY_SET
 */
@SuppressWarnings("unchecked")
public Set<T> visit(ConstantFormula constant) {
	return Collections.EMPTY_SET;
}
 

@Override
public F visit(ConstantFormula constant) {
    start(constant);
    return end(constant, visitor.visit(constant));
}
 

@Override
public void visit(ConstantFormula constant) {
    visit(constant, constant.booleanValue());
}
 

/** @ensures this.tokens' = concat[ this.tokens, node ] */
@Override
public void visit(ConstantFormula node) {
    append(node);
}
 

@Override
public Proc visit(ConstantFormula constant) {
    return new Proc.FOL(bounds, constant);
}
 

/** @see #visitFormula(Formula) */
@Override
public final void visit(ConstantFormula constant) {
    visitFormula(constant);
}
 

/**
 * @return constant = ConstantFormula.TRUE => BooleanConstant.TRUE,
 *         BooleanConstant.FALSE
 */
@Override
public final BooleanValue visit(ConstantFormula constant) {
    return cache(constant, BooleanConstant.constant(constant.booleanValue()));
}
 

/**
 * Returns Collections.EMPTY_SET
 *
 * @return Collections.EMPTY_SET
 */
@Override
@SuppressWarnings("unchecked" )
public Set<T> visit(ConstantFormula constant) {
    return Collections.EMPTY_SET;
}
 

/** @see #visitFormula(Formula) */
@Override
public final void visit(ConstantFormula constant) {
    visitFormula(constant);
}
 

@Override
public void visit(ConstantFormula formula) {
    relevant.add(formula);
}
 

/**
 * Visits the given constant formula.
 **/
public void visit(ConstantFormula constant);
 

/**
 * @return true if the given formula should be parenthesized when a child of a
 *         compound parent
 */
private boolean parenthesize(Formula child) {
    return !(child instanceof NotFormula || child instanceof ConstantFormula || child instanceof RelationPredicate);
}
 

/**
 * Calls lookup(constant) and returns the cached value, if any. If a replacement
 * has not been cached, the constant is cached and returned.
 *
 * @return constant
 */
@Override
public Formula visit(ConstantFormula constant) {
    final Formula ret = lookup(constant);
    return ret == null ? cache(constant, constant) : constant;
}
 

/**
 * Does nothing.
 */
@Override
public void visit(ConstantFormula constant) {}
 

/**
 * Visits the given constant formula and returns the result.
 *
 * @return the result of visiting <code>constant</code>
 **/
public F visit(ConstantFormula constant);
 

/**
 * Returns FALSE.
 *
 * @return FALSE
 */
@Override
public Boolean visit(ConstantFormula constant) {
    return Boolean.FALSE;
}
 

/**
 * Returns FALSE.
 * @return FALSE
 */
public Boolean visit(ConstantFormula constant) { return Boolean.FALSE; }
 

/** 
* Visits the given constant formula and returns the result.
* @return the result of visiting <code>constant</code> 
**/
  public F visit(ConstantFormula constant);
 

/**
 * Does nothing.
 */
public void visit(ConstantFormula constant) {}