1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2 /* 3 * Main authors: 4 * Vincent Barichard <Vincent.Barichard@univ-angers.fr> 5 * 6 * Copyright: 7 * Vincent Barichard, 2013 8 * 9 * Last modified: 10 * $Date$ by $Author$ 11 * $Revision$ 12 * 13 * This file is part of Quacode: 14 * http://quacode.barichard.com 15 * 16 * This file is based on gecode/int/bool/eqv.hpp 17 * and is under the same license as given below: 18 * 19 * Main authors: 20 * Christian Schulte <schulte@gecode.org> 21 * 22 * Copyright: 23 * Christian Schulte, 2004 24 * 25 * This file is part of Gecode, the generic constraint 26 * development environment: 27 * http://www.gecode.org 28 * 29 * Permission is hereby granted, free of charge, to any person obtaining 30 * a copy of this software and associated documentation files (the 31 * "Software"), to deal in the Software without restriction, including 32 * without limitation the rights to use, copy, modify, merge, publish, 33 * distribute, sublicense, and/or sell copies of the Software, and to 34 * permit persons to whom the Software is furnished to do so, subject to 35 * the following conditions: 36 * 37 * The above copyright notice and this permission notice shall be 38 * included in all copies or substantial portions of the Software. 39 * 40 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 41 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 42 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 43 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 44 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 45 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 46 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 47 * 48 */ 49 50 namespace Gecode { namespace Int { namespace Bool { 51 52 /* 53 * Quantified Boolean equivalence propagator 54 * 55 */ 56 57 template<class BVA, class BVB, class BVC> 58 forceinline QEqv(Home home,BVA b0,TQuantifier _q0,int _r0,BVB b1,TQuantifier _q1,int _r1,BVC b2)59 QEqv<BVA,BVB,BVC>::QEqv(Home home, BVA b0, TQuantifier _q0, int _r0, BVB b1, TQuantifier _q1, int _r1, BVC b2) 60 : BoolTernary<BVA,BVB,BVC>(home,b0,b1,b2), q0(_q0), r0(_r0), q1(_q1), r1(_r1) {} 61 62 template<class BVA, class BVB, class BVC> 63 forceinline QEqv(Space & home,bool share,QEqv<BVA,BVB,BVC> & p)64 QEqv<BVA,BVB,BVC>::QEqv(Space& home, bool share, QEqv<BVA,BVB,BVC>& p) 65 : BoolTernary<BVA,BVB,BVC>(home,share,p), q0(p.q0), r0(p.r0), q1(p.q1), r1(p.r1) {} 66 67 template<class BVA, class BVB, class BVC> 68 inline ExecStatus post(Home home,BVA b0,TQuantifier _q0,int _r0,BVB b1,TQuantifier _q1,int _r1,BVC b2)69 QEqv<BVA,BVB,BVC>::post(Home home, BVA b0, TQuantifier _q0, int _r0, BVB b1, TQuantifier _q1, int _r1, BVC b2) { 70 switch (bool_test(b0,b1)) { 71 case BT_SAME: 72 GECODE_ME_CHECK(b2.one(home)); break; 73 case BT_COMP: 74 GECODE_ME_CHECK(b2.zero(home)); break; 75 case BT_NONE: 76 if ( ((_q0 == FORALL) && (_q1 == FORALL)) 77 || ((_r0 < _r1) && (_q1 == FORALL)) 78 || ((_r0 > _r1) && (_q0 == FORALL)) ) 79 { 80 GECODE_ME_CHECK(b2.zero(home)); return ES_OK; 81 } 82 if (b2.one()) 83 return QEq<BVA,BVB>::post(home,b0,_q0,_r0,b1,_q1,_r1); 84 if (b2.zero()) 85 return QXor<BVA,BVB>::post(home,b0,_q0,_r0,b1,_q1,_r1); 86 if (b0.one()) { 87 if (b1.one()) { 88 GECODE_ME_CHECK(b2.one(home)); return ES_OK; 89 } else if (b1.zero()) { 90 GECODE_ME_CHECK(b2.zero(home)); return ES_OK; 91 } 92 } 93 if (b0.zero()) { 94 if (b1.one()) { 95 GECODE_ME_CHECK(b2.zero(home)); return ES_OK; 96 } else if (b1.zero()) { 97 GECODE_ME_CHECK(b2.one(home)); return ES_OK; 98 } 99 } 100 (void) new (home) QEqv(home,b0,_q0,_r0,b1,_q1,_r1,b2); 101 break; 102 default: 103 GECODE_NEVER; 104 } 105 return ES_OK; 106 } 107 108 template<class BVA, class BVB, class BVC> 109 inline ExecStatus post(Home home,QBoolVar b0,QBoolVar b1,BVC b2)110 QEqv<BVA,BVB,BVC>::post(Home home, QBoolVar b0, QBoolVar b1, BVC b2) { 111 return post(home,b0.x,b0.q,b0.r,b1.x,b1.q,b1.r,b2); 112 } 113 114 template<class BVA, class BVB, class BVC> 115 Actor* copy(Space & home,bool share)116 QEqv<BVA,BVB,BVC>::copy(Space& home, bool share) { 117 return new (home) QEqv<BVA,BVB,BVC>(home,share,*this); 118 } 119 120 template<class BVA, class BVB, class BVC> 121 ExecStatus propagate(Space & home,const ModEventDelta &)122 QEqv<BVA,BVB,BVC>::propagate(Space& home, const ModEventDelta&) { 123 #define GECODE_INT_STATUS(S0,S1,S2) \ 124 ((BVA::S0<<(2*BVA::BITS))|(BVB::S1<<(1*BVB::BITS))|(BVC::S2<<(0*BVC::BITS))) 125 switch ((x0.status() << (2*BVA::BITS)) | (x1.status() << (1*BVB::BITS)) | 126 (x2.status() << (0*BVC::BITS))) { 127 case GECODE_INT_STATUS(NONE,NONE,NONE): 128 GECODE_NEVER; 129 case GECODE_INT_STATUS(NONE,NONE,ZERO): 130 case GECODE_INT_STATUS(NONE,NONE,ONE): 131 return ES_FIX; 132 case GECODE_INT_STATUS(NONE,ZERO,NONE): 133 if (q0 == FORALL) 134 { 135 GECODE_ME_CHECK(x2.zero_none(home)); break; 136 } 137 return ES_FIX; 138 case GECODE_INT_STATUS(NONE,ZERO,ZERO): 139 if (q0 == FORALL) return ES_FAILED; 140 GECODE_ME_CHECK(x0.one_none(home)); break; 141 case GECODE_INT_STATUS(NONE,ZERO,ONE): 142 if (q0 == FORALL) return ES_FAILED; 143 GECODE_ME_CHECK(x0.zero_none(home)); break; 144 case GECODE_INT_STATUS(NONE,ONE,NONE): 145 if (q0 == FORALL) 146 { 147 GECODE_ME_CHECK(x2.zero_none(home)); break; 148 } 149 return ES_FIX; 150 case GECODE_INT_STATUS(NONE,ONE,ZERO): 151 if (q0 == FORALL) return ES_FAILED; 152 GECODE_ME_CHECK(x0.zero_none(home)); break; 153 case GECODE_INT_STATUS(NONE,ONE,ONE): 154 if (q0 == FORALL) return ES_FAILED; 155 GECODE_ME_CHECK(x0.one_none(home)); break; 156 case GECODE_INT_STATUS(ZERO,NONE,NONE): 157 if (q1 == FORALL) 158 { 159 GECODE_ME_CHECK(x2.zero_none(home)); break; 160 } 161 return ES_FIX; 162 case GECODE_INT_STATUS(ZERO,NONE,ZERO): 163 if (q1 == FORALL) return ES_FAILED; 164 GECODE_ME_CHECK(x1.one_none(home)); break; 165 case GECODE_INT_STATUS(ZERO,NONE,ONE): 166 if (q1 == FORALL) return ES_FAILED; 167 GECODE_ME_CHECK(x1.zero_none(home)); break; 168 case GECODE_INT_STATUS(ZERO,ZERO,NONE): 169 GECODE_ME_CHECK(x2.one_none(home)); break; 170 case GECODE_INT_STATUS(ZERO,ZERO,ZERO): 171 return ES_FAILED; 172 case GECODE_INT_STATUS(ZERO,ZERO,ONE): 173 break; 174 case GECODE_INT_STATUS(ZERO,ONE,NONE): 175 GECODE_ME_CHECK(x2.zero_none(home)); break; 176 case GECODE_INT_STATUS(ZERO,ONE,ZERO): 177 break; 178 case GECODE_INT_STATUS(ZERO,ONE,ONE): 179 return ES_FAILED; 180 case GECODE_INT_STATUS(ONE,NONE,NONE): 181 if (q1 == FORALL) 182 { 183 GECODE_ME_CHECK(x2.zero_none(home)); break; 184 } 185 return ES_FIX; 186 case GECODE_INT_STATUS(ONE,NONE,ZERO): 187 if (q1 == FORALL) return ES_FAILED; 188 GECODE_ME_CHECK(x1.zero_none(home)); break; 189 case GECODE_INT_STATUS(ONE,NONE,ONE): 190 if (q1 == FORALL) return ES_FAILED; 191 GECODE_ME_CHECK(x1.one_none(home)); break; 192 case GECODE_INT_STATUS(ONE,ZERO,NONE): 193 GECODE_ME_CHECK(x2.zero_none(home)); break; 194 case GECODE_INT_STATUS(ONE,ZERO,ZERO): 195 break; 196 case GECODE_INT_STATUS(ONE,ZERO,ONE): 197 return ES_FAILED; 198 case GECODE_INT_STATUS(ONE,ONE,NONE): 199 GECODE_ME_CHECK(x2.one_none(home)); break; 200 case GECODE_INT_STATUS(ONE,ONE,ZERO): 201 return ES_FAILED; 202 case GECODE_INT_STATUS(ONE,ONE,ONE): 203 break; 204 default: 205 GECODE_NEVER; 206 } 207 return home.ES_SUBSUMED(*this); 208 #undef GECODE_INT_STATUS 209 } 210 211 212 }}} 213 214 // STATISTICS: int-prop 215