2 #include "integerencoding.h"
5 #include "satencoder.h"
7 #include "integerencodingrecord.h"
10 IntegerEncodingTransform::IntegerEncodingTransform(CSolver* _solver)
13 orderIntEncoding = new HashTableOrderIntEncoding();
16 IntegerEncodingTransform::~IntegerEncodingTransform(){
17 orderIntEncoding->resetanddelete();
20 bool IntegerEncodingTransform::canExecuteTransform(){
21 return canExecutePass(solver, currOrder->type, ORDERINTEGERENCODING, &offon);
24 void IntegerEncodingTransform::doTransform(){
25 if (!orderIntEncoding->contains(currOrder)) {
26 orderIntEncoding->put(currOrder, new IntegerEncodingRecord(
27 solver->createRangeSet(currOrder->set->getType(), 0, (uint64_t) currOrder->set->getSize()-1)));
29 uint size = currOrder->constraints.getSize();
30 for(uint i=0; i<size; i++){
31 orderIntegerEncodingSATEncoder(currOrder->constraints.get(i));
36 void IntegerEncodingTransform::orderIntegerEncodingSATEncoder(BooleanOrder *boolOrder) {
37 IntegerEncodingRecord* ierec = orderIntEncoding->get(currOrder);
38 //getting two elements and using LT predicate ...
39 Element *elem1 = ierec->getOrderIntegerElement(solver, boolOrder->first);
40 Element *elem2 = ierec->getOrderIntegerElement(solver, boolOrder->second);
41 Set *sarray[] = {ierec->getSecondarySet(), ierec->getSecondarySet()};
42 Predicate *predicate = solver->createPredicateOperator(LT, sarray, 2);
43 Element *parray[] = {elem1, elem2};
44 Boolean *boolean = solver->applyPredicate(predicate, parray, 2);
45 solver->addConstraint(boolean);
46 solver->replaceBooleanWithBoolean(boolOrder, boolean);