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 _inputs[i]->parents.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 Boolean *b = (Boolean *) map->get(this);
50 Boolean *bvar = solver->getBooleanVar(type);
55 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
56 Order *ordercopy = order->clone(solver, map);
57 return solver->orderConstraint(ordercopy, first, second);
60 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
61 Boolean *array[inputs.getSize()];
62 for (uint i = 0; i < inputs.getSize(); i++) {
63 array[i] = inputs.get(i)->clone(solver, map);
65 return solver->applyLogicalOperation(op, array, inputs.getSize());
68 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
69 Element *array[inputs.getSize()];
70 for (uint i = 0; i < inputs.getSize(); i++) {
71 array[i] = inputs.get(i)->clone(solver, map);
73 Predicate *pred = predicate->clone(solver, map);
74 Boolean *defstatus = (undefStatus != NULL) ? undefStatus->clone(solver, map) : NULL;
76 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus);