8 Boolean::Boolean(ASTNodeType _type) :
10 polarity(P_UNDEFINED),
11 boolVal(BV_UNDEFINED),
15 BooleanConst::BooleanConst(bool _isTrue) :
20 BooleanVar::BooleanVar(VarType t) :
26 BooleanOrder::BooleanOrder(Order *_order, uint64_t _first, uint64_t _second) :
31 order->constraints.push(this);
34 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, BooleanEdge _undefinedStatus) :
36 predicate(_predicate),
38 inputs(_inputs, _numInputs),
39 undefStatus(_undefinedStatus) {
40 for (uint i = 0; i < _numInputs; i++) {
41 _inputs[i]->parents.push(this);
45 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, BooleanEdge *array, uint asize) :
49 inputs(array, asize) {
50 for (uint i = 0; i < asize; i++) {
51 array[i]->parents.push(this);
55 BooleanEdge cloneEdge(CSolver *solver, CloneMap *map, BooleanEdge e) {
56 bool isnegated=e.isNegated();
57 Boolean *b=e->clone(solver, map);
58 BooleanEdge be=BooleanEdge(b);
59 return isnegated ? be.negate() : be;
62 Boolean *BooleanConst::clone(CSolver *solver, CloneMap *map) {
63 return solver->getBooleanTrue().getRaw();
66 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
67 Boolean *b = (Boolean *) map->get(this);
70 BooleanEdge bvar = solver->getBooleanVar(type);
71 Boolean * base=bvar.getRaw();
76 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
77 Order *ordercopy = order->clone(solver, map);
78 return solver->orderConstraint(ordercopy, first, second).getRaw();
81 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
82 BooleanEdge array[inputs.getSize()];
83 for (uint i = 0; i < inputs.getSize(); i++) {
84 array[i] = cloneEdge(solver, map, inputs.get(i));
86 return solver->applyLogicalOperation(op, array, inputs.getSize()).getRaw();
89 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
90 Element *array[inputs.getSize()];
91 for (uint i = 0; i < inputs.getSize(); i++) {
92 array[i] = inputs.get(i)->clone(solver, map);
94 Predicate *pred = predicate->clone(solver, map);
95 BooleanEdge defstatus = undefStatus ? cloneEdge(solver, map, undefStatus) : BooleanEdge();
97 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus).getRaw();