kodkod.util.ints.TreeSequence Java Examples

/**
 * Constructs an ARCE strategy that will use the given translation log to relate
 * the cnf clauses back to the logic constraints from which they were generated.
 *
 * @ensures this.hardnessCutOff' = hardnessCutOff and this.recycleLimit' =
 *          recycleLimit and this.noRecycleRatio' = noRecycleRatio
 */
public DynamicRCEStrategy(final TranslationLog log, double noRecycleRatio, double hardnessCutOff, double recycleLimit) {
    if (noRecycleRatio < 0 || noRecycleRatio > 1)
        throw new IllegalArgumentException("noRecycleRatio must be in [0..1]: " + noRecycleRatio);
    if (hardnessCutOff < 1)
        throw new IllegalArgumentException("hardnessCutOff must be >=1: " + hardnessCutOff);
    if (recycleLimit < 1)
        throw new IllegalArgumentException("recycleLimit must be >=1: " + recycleLimit);
    this.noRecycleRatio = noRecycleRatio;
    this.hardnessCutOff = hardnessCutOff;
    this.recycleLimit = recycleLimit;
    this.hits = new TreeSequence<IntSet>();
    for (IntIterator itr = StrategyUtils.rootVars(log).iterator(); itr.hasNext();) {
        hits.put(itr.next(), null);
    }
}
 

/**
 * Constructs an ARCE strategy that will use the given translation
 * log to relate the cnf clauses back to the logic constraints from 
 * which they were generated. 
 * @ensures this.hardnessCutOff' = hardnessCutOff and this.recycleLimit' = recycleLimit and 
 * this.noRecycleRatio' = noRecycleRatio
 */
public DynamicRCEStrategy(final TranslationLog log, double noRecycleRatio, double hardnessCutOff, double recycleLimit) {
	if (noRecycleRatio<0 || noRecycleRatio>1) 
		throw new IllegalArgumentException("noRecycleRatio must be in [0..1]: " + noRecycleRatio);
	if (hardnessCutOff < 1)
		throw new IllegalArgumentException("hardnessCutOff must be >=1: " + hardnessCutOff);
	if (recycleLimit < 1)
		throw new IllegalArgumentException("recycleLimit must be >=1: " + recycleLimit);
	this.noRecycleRatio = noRecycleRatio;
	this.hardnessCutOff = hardnessCutOff;
	this.recycleLimit = recycleLimit;
	this.hits = new TreeSequence<IntSet>();
	for(IntIterator itr = StrategyUtils.rootVars(log).iterator(); itr.hasNext(); ) { 
		hits.put(itr.next(), null);
	}
}
 

/**
 * Constructs new Bounds over the given universe.
 *
 * @ensures this.universe' = universe && no this.relations' && no this.intBound'
 * @throws NullPointerException universe = null
 */
public Bounds(Universe universe) {
    this.factory = universe.factory();
    this.lowers = new LinkedHashMap<Relation,TupleSet>();
    this.uppers = new LinkedHashMap<Relation,TupleSet>();
    this.intbounds = new TreeSequence<TupleSet>();
    this.relations = relations(lowers, uppers);
    this.atom2rel = new HashMap<Object,Relation>();
}
 

/**
 * Constructs new Bounds over the given universe.
 * @ensures this.universe' = universe && no this.relations' && no this.intBound'
 * @throws NullPointerException  universe = null
 */
public Bounds(Universe universe) {
	this.factory = universe.factory();
	this.lowers = new LinkedHashMap<Relation, TupleSet>();
	this.uppers = new LinkedHashMap<Relation, TupleSet>();
	this.intbounds = new TreeSequence<TupleSet>();
	this.relations = relations(lowers, uppers);
}
 

/**
 * Constructs an empty instance over the given universe
 * 
 * @ensures this.universe' = universe && no this.tuples' 
 * @throws NullPointerException  universe = null
 */
public Instance(final Universe universe) {
	if (universe==null) throw new NullPointerException("universe=null");
	this.universe = universe;
	this.tuples = new LinkedHashMap<Relation, TupleSet>();
	this.ints = new TreeSequence<TupleSet>();
}
 

@Override
protected void setUp() throws Exception {
    s0 = new TreeSequence<Integer>();
}
 

@Before
public void setUp() throws Exception {
	s0 = new TreeSequence<Integer>();
}
 

/**
 * Constructs a new simplifier with the empties sequence initializes with 
 * Expression.NONE and Nodes.NONE2.
 */
Simplifier() {	
	this(new TreeSequence<Expression>(), new TreeSequence<IntConstant>()); 
	empties.put(1, Expression.NONE);
	empties.put(2, Nodes.NONE2);
}
 

/**
 * Constructs an empty instance over the given universe
 *
 * @ensures this.universe' = universe && no this.tuples'
 * @throws NullPointerException universe = null
 */
public Instance(final Universe universe) {
    this(universe, new LinkedHashMap<Relation,TupleSet>(), new TreeSequence<TupleSet>());
}
 

/**
 * Constructs a new accumulator with the given operator.
 *
 * @requires op != null
 * @ensures this.op' = op && this.label' = label
 */
private BooleanAccumulator(Operator.Nary op) {
    this.op = op;
    inputs = new TreeSequence<BooleanValue>();
    // inputs = new ArrayList<BooleanValue>();
}
 

/**
	 * Constructs a new accumulator with the given
	 * operator.
	 * @requires op != null
	 * @ensures this.op' = op && this.label' = label
	 */
	private BooleanAccumulator(Operator.Nary op) {
		this.op = op;
		inputs = new TreeSequence<BooleanValue>();
//		inputs = new ArrayList<BooleanValue>();
	}