8 Boolean::Boolean(ASTNodeType _type) :
10 polarity(P_UNDEFINED),
11 boolVal(BV_UNDEFINED),
16 BooleanVar::BooleanVar(VarType t) :
22 BooleanOrder::BooleanOrder(Order *_order, uint64_t _first, uint64_t _second) :
27 order->constraints.push(this);
30 BooleanPredicate::BooleanPredicate(Predicate *_predicate, Element **_inputs, uint _numInputs, Boolean *_undefinedStatus) :
32 predicate(_predicate),
34 inputs(_inputs, _numInputs),
35 undefStatus(_undefinedStatus) {
36 for (uint i = 0; i < _numInputs; i++) {
37 _inputs[i]->parents.push(this);
41 BooleanLogic::BooleanLogic(CSolver *solver, LogicOp _op, Boolean **array, uint asize) :
44 inputs(array, asize) {
47 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
48 Boolean *b = (Boolean *) map->get(this);
51 Boolean *bvar = solver->getBooleanVar(type);
56 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
57 Order *ordercopy = order->clone(solver, 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(solver, map);
75 Boolean *defstatus = (undefStatus != NULL) ? undefStatus->clone(solver, map) : NULL;
77 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus);