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, Boolean *_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, Boolean **array, uint asize) :
48 inputs(array, asize) {
51 Boolean *BooleanConst::clone(CSolver *solver, CloneMap *map) {
53 return solver->getBooleanTrue();
55 return solver->getBooleanFalse();
58 Boolean *BooleanVar::clone(CSolver *solver, CloneMap *map) {
59 Boolean *b = (Boolean *) map->get(this);
62 Boolean *bvar = solver->getBooleanVar(type);
67 Boolean *BooleanOrder::clone(CSolver *solver, CloneMap *map) {
68 Order *ordercopy = order->clone(solver, map);
69 return solver->orderConstraint(ordercopy, first, second);
72 Boolean *BooleanLogic::clone(CSolver *solver, CloneMap *map) {
73 Boolean *array[inputs.getSize()];
74 for (uint i = 0; i < inputs.getSize(); i++) {
75 array[i] = inputs.get(i)->clone(solver, map);
77 return solver->applyLogicalOperation(op, array, inputs.getSize());
80 Boolean *BooleanPredicate::clone(CSolver *solver, CloneMap *map) {
81 Element *array[inputs.getSize()];
82 for (uint i = 0; i < inputs.getSize(); i++) {
83 array[i] = inputs.get(i)->clone(solver, map);
85 Predicate *pred = predicate->clone(solver, map);
86 Boolean *defstatus = (undefStatus != NULL) ? undefStatus->clone(solver, map) : NULL;
88 return solver->applyPredicateTable(pred, array, inputs.getSize(), defstatus);