1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2003
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include <climits>
namespace Gecode { namespace Int { namespace Distinct {
template<class View>
forceinline
Dom<View>::Dom(Home home, ViewArray<View>& x)
: NaryPropagator<View,PC_INT_DOM>(home,x) {}
template<class View>
ExecStatus
Dom<View>::post(Home home, ViewArray<View>& x) {
if (x.size() == 2)
return Rel::Nq<View,View>::post(home,x[0],x[1]);
if (x.size() == 3)
return TerDom<View>::post(home,x[0],x[1],x[2]);
if (x.size() > 3) {
// Do bounds propagation to make view-value graph smaller
GECODE_ES_CHECK(prop_bnd<View>(home,x));
(void) new (home) Dom<View>(home,x);
}
return ES_OK;
}
template<class View>
forceinline
Dom<View>::Dom(Space& home, Dom<View>& p)
: NaryPropagator<View,PC_INT_DOM>(home,p) {}
template<class View>
PropCost
Dom<View>::cost(const Space&, const ModEventDelta& med) const {
if (View::me(med) == ME_INT_VAL)
return PropCost::linear(PropCost::LO, x.size());
else
return PropCost::quadratic(PropCost::HI, x.size());
}
template<class View>
Actor*
Dom<View>::copy(Space& home) {
return new (home) Dom<View>(home,*this);
}
#ifdef GECODE_HAS_CBS
template<class View>
void
Dom<View>::solndistrib(Space& home, Propagator::SendMarginal send) const {
cbsdistinct(home,this->id(),x,send);
}
template<class View>
void
Dom<View>::domainsizesum(Propagator::InDecision in, unsigned int& size,
unsigned int& size_b) const {
cbssize(x,in,size,size_b);
}
#endif
template<class View>
ExecStatus
Dom<View>::propagate(Space& home, const ModEventDelta& med) {
if (View::me(med) == ME_INT_VAL) {
ExecStatus es = prop_val<View,false>(home,x);
GECODE_ES_CHECK(es);
if (x.size() < 2)
return home.ES_SUBSUMED(*this);
if (es == ES_FIX)
return home.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM));
es = prop_bnd<View>(home,x);
GECODE_ES_CHECK(es);
if (x.size() < 2)
return home.ES_SUBSUMED(*this);
es = prop_val<View,true>(home,x);
GECODE_ES_CHECK(es);
if (x.size() < 2)
return home.ES_SUBSUMED(*this);
return home.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM));
}
if (x.size() == 2)
GECODE_REWRITE(*this,(Rel::Nq<View,View>::post(home(*this),x[0],x[1])));
if (x.size() == 3)
GECODE_REWRITE(*this,TerDom<View>::post(home(*this),x[0],x[1],x[2]));
if (dc.available()) {
GECODE_ES_CHECK(dc.sync());
} else {
GECODE_ES_CHECK(dc.init(home,x));
}
bool assigned;
GECODE_ES_CHECK(dc.propagate(home,assigned));
return ES_FIX;
}
}}}
// STATISTICS: int-prop
|