this repo has no description
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2/* 3 * Main authors: 4 * Guido Tack <tack@gecode.org> 5 * Christian Schulte <schulte@gecode.org> 6 * 7 * Contributing authors: 8 * Gabor Szokoli <szokoli@gecode.org> 9 * 10 * Copyright: 11 * Guido Tack, 2004 12 * Christian Schulte, 2004 13 * Gabor Szokoli, 2004 14 * 15 * This file is part of Gecode, the generic constraint 16 * development environment: 17 * http://www.gecode.org 18 * 19 * Permission is hereby granted, free of charge, to any person obtaining 20 * a copy of this software and associated documentation files (the 21 * "Software"), to deal in the Software without restriction, including 22 * without limitation the rights to use, copy, modify, merge, publish, 23 * distribute, sublicense, and/or sell copies of the Software, and to 24 * permit persons to whom the Software is furnished to do so, subject to 25 * the following conditions: 26 * 27 * The above copyright notice and this permission notice shall be 28 * included in all copies or substantial portions of the Software. 29 * 30 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 31 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 32 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 33 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 34 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 35 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 36 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 37 * 38 */ 39 40namespace Gecode { namespace Set { namespace Rel { 41 42 template<class View0, class View1> 43 forceinline 44 Eq<View0,View1>::Eq(Home home, View0 x, View1 y) 45 : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y) {} 46 47 template<class View0, class View1> 48 forceinline 49 Eq<View0,View1>::Eq(Space& home, Eq& p) 50 : MixBinaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,p) {} 51 52 template<class View0, class View1> 53 ExecStatus 54 Eq<View0,View1>::post(Home home, View0 x, View1 y) { 55 if (!same(x,y)) 56 (void) new (home) Eq(home,x,y); 57 return ES_OK; 58 } 59 60 template<class View0, class View1> 61 Actor* 62 Eq<View0,View1>::copy(Space& home) { 63 return new (home) Eq(home,*this); 64 } 65 66 template<class View0, class View1> 67 ExecStatus 68 Eq<View0,View1>::propagate(Space& home, const ModEventDelta& med) { 69 70 ModEvent me0 = View0::me(med); 71 ModEvent me1 = View1::me(med); 72 73 Region r; 74 75 if (testSetEventLB(me0,me1)) { 76 GlbRanges<View0> x0lb(x0); 77 GlbRanges<View1> x1lb(x1); 78 Iter::Ranges::Union<GlbRanges<View0>,GlbRanges<View1> > lbu(x0lb,x1lb); 79 Iter::Ranges::Cache lbuc(r,lbu); 80 GECODE_ME_CHECK(x0.includeI(home,lbuc)); 81 lbuc.reset(); 82 GECODE_ME_CHECK(x1.includeI(home,lbuc)); 83 } 84 85 if (testSetEventUB(me0,me1)) { 86 LubRanges<View0> x0ub(x0); 87 LubRanges<View1> x1ub(x1); 88 Iter::Ranges::Inter<LubRanges<View0>,LubRanges<View1> > ubi(x0ub,x1ub); 89 Iter::Ranges::Cache ubic(r,ubi); 90 GECODE_ME_CHECK(x0.intersectI(home,ubic)); 91 ubic.reset(); 92 GECODE_ME_CHECK(x1.intersectI(home,ubic)); 93 } 94 95 if (testSetEventCard(me0,me1)) { 96 unsigned int max = std::min(x0.cardMax(),x1.cardMax()); 97 unsigned int min = std::max(x0.cardMin(),x1.cardMin()); 98 GECODE_ME_CHECK(x0.cardMax(home,max)); 99 GECODE_ME_CHECK(x1.cardMax(home,max)); 100 GECODE_ME_CHECK(x0.cardMin(home,min)); 101 GECODE_ME_CHECK(x1.cardMin(home,min)); 102 } 103 104 if (x0.assigned()) { 105 assert (x1.assigned()); 106 return home.ES_SUBSUMED(*this); 107 } 108 return shared(x0,x1) ? ES_NOFIX : ES_FIX; 109 } 110 111}}} 112 113// STATISTICS: set-prop