8 Boolean::Boolean(ASTNodeType _type) :
10 polarity(P_UNDEFINED),
11 boolVal(BV_UNDEFINED),
15 BooleanVar::BooleanVar(VarType t) :
21 BooleanOrder::BooleanOrder(Order *_order, uint64_t _first, uint64_t _second) :
26 order->constraints.push(this);
29 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, Boolean *_undefinedStatus) :
31 predicate(_predicate),
33 inputs(_inputs, _numInputs),
34 undefStatus(_undefinedStatus) {
35 for (uint i = 0; i < _numInputs; i++) {
36 GETELEMENTPARENTS(_inputs[i])->push(this);
40 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, Boolean **array, uint asize) :
43 inputs(array, asize) {
46 Boolean * BooleanVar::clone(CSolver *solver, CloneMap *map) {
47 if (map->boolean.contains(this)) {
48 return map->boolean.get(this);
50 Boolean * bvar=solver->getBooleanVar(type);
51 map->boolean.put(this, bvar);
56 Boolean * BooleanOrder::clone(CSolver * solver, CloneMap *map) {
57 Order * ordercopy=order->clone(map);
58 return solver->orderConstraint(ordercopy, first, second);
61 Boolean * BooleanLogic::clone(CSolver * solver, CloneMap *map) {
62 Boolean * array[inputs.getSize()];
63 for(uint i=0;i<inputs.getSize();i++) {
64 array[i]=inputs.get(i)->clone(solver, map);
66 return solver->applyLogicalOperation(op, array, inputs.getSize());
69 Boolean * BooleanPredicate::clone(CSolver * solver, CloneMap *map) {
70 Element * array[inputs.getSize()];
71 for(uint i=0;i<inputs.getSize();i++) {
72 array[i]=inputs.get(i)->clone(solver, map);
74 Predicate * pred=predicate->clone(map);
75 Boolean * defstatus=(undefStatus != NULL) ? undefStatus->clone(solver, map) : NULL;
77 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus);