dom.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2007
*
* 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.
*
*/
namespace Gecode { namespace Int { namespace Circuit {
/*
* The actual propagator
*
*/
template<class View, class Offset>
forceinline
Dom<View,Offset>::Dom(Home home, ViewArray<View>& x, Offset& o)
: Base<View,Offset>(home,x,o) {}
template<class View, class Offset>
forceinline
Dom<View,Offset>::Dom(Space& home, Dom<View,Offset>& p)
: Base<View,Offset>(home,p) {}
template<class View, class Offset>
Actor*
Dom<View,Offset>::copy(Space& home) {
return new (home) Dom<View,Offset>(home,*this);
}
template<class View, class Offset>
PropCost
Dom<View,Offset>::cost(const Space&, const ModEventDelta& med) const {
if (View::me(med) == Int::ME_INT_VAL)
return PropCost::linear(PropCost::LO, x.size());
else
return PropCost::quadratic(PropCost::HI, x.size());
}
template<class View, class Offset>
void
Dom<View,Offset>::reschedule(Space& home) {
for (int i=0; i<y.size(); i++)
if (y[i].assigned()) {
View::schedule(home, *this, ME_INT_VAL);
return;
}
View::schedule(home, *this, ME_INT_DOM);
}
template<class View, class Offset>
ExecStatus
Dom<View,Offset>::propagate(Space& home, const ModEventDelta& med) {
if (View::me(med) == Int::ME_INT_VAL) {
GECODE_ES_CHECK((Int::Distinct::prop_val<View,true>(home,y)));
ExecStatus escv = connected(home);
if (escv != ES_FIX)
return escv;
if (y.size() < 2)
return home.ES_SUBSUMED(*this);
return home.ES_FIX_PARTIAL(*this,View::med(Int::ME_INT_DOM));
}
if (dc.available()) {
GECODE_ES_CHECK(dc.sync());
} else {
GECODE_ES_CHECK(dc.init(home,y));
}
bool assigned;
GECODE_ES_CHECK(dc.propagate(home,assigned));
ExecStatus esc = connected(home);
if (esc != ES_FIX)
return esc;
// Elminiate assigned views from y, as they have been assigned
// and propagated by domain consistent propagation. This is required
// as we need to know how many assigned views actually exist.
if (assigned)
for (int i=y.size(); i--; )
if (y[i].assigned())
y.move_lst(i);
return path(home);
}
template<class View, class Offset>
ExecStatus
Dom<View,Offset>::post(Home home, ViewArray<View>& x, Offset& o) {
int n = x.size();
if (n == 1) {
GECODE_ME_CHECK(o(x[0]).eq(home,0));
} else if (n == 2) {
GECODE_ME_CHECK(o(x[0]).eq(home,1));
GECODE_ME_CHECK(o(x[1]).eq(home,0));
} else {
for (int i=0; i<n; i++) {
GECODE_ME_CHECK(o(x[i]).gq(home,0));
GECODE_ME_CHECK(o(x[i]).le(home,n));
GECODE_ME_CHECK(o(x[i]).nq(home,i));
}
(void) new (home) Dom<View,Offset>(home,x,o);
}
return ES_OK;
}
}}}
// STATISTICS: int-prop
Gecode::Actor
Base-class for both propagators and branchers.
Definition core.hpp:628
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Int::Circuit::Base
Base-class for circuit propagator.
Definition circuit.hh:55
Gecode::Int::Circuit::Base::connected
ExecStatus connected(Space &home)
Check whether the view value graph is strongly connected.
Definition base.hpp:69
Gecode::Int::Circuit::Base::y
ViewArray< View > y
Array for performing value propagation for distinct.
Definition circuit.hh:61
Gecode::Int::Circuit::Base::o
Offset o
Offset transformation.
Definition circuit.hh:63
Gecode::Int::Circuit::Base::Base
Base(Space &home, Base &p)
Constructor for cloning p.
Gecode::Int::Circuit::Dom
"Domain consistent" circuit propagator
Definition circuit.hh:121
Gecode::Int::Circuit::Dom::Dom
Dom(Space &home, Dom &p)
Constructor for cloning p.
Gecode::Int::Circuit::Dom::post
static ExecStatus post(Home home, ViewArray< View > &x, Offset &o)
Post propagator for circuit on x.
Definition dom.hpp:114
Gecode::Int::Circuit::Dom::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition dom.hpp:58
Gecode::Int::Circuit::Dom::dc
Int::Distinct::DomCtrl< View > dc
Propagation controller for propagating distinct.
Definition circuit.hh:129
Gecode::Int::Circuit::Dom::reschedule
virtual void reschedule(Space &home)
Schedule function.
Definition dom.hpp:67
Gecode::Int::Circuit::Dom::copy
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Definition dom.hpp:52
Gecode::Int::Circuit::Dom::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition dom.hpp:78
Gecode::Int::Offset
Converter with fixed offset.
Definition view.hpp:650
Gecode::NaryPropagator< View, Int::PC_INT_DOM >::x
ViewArray< View > x
Definition pattern.hpp:145
Gecode::PropCost
Propagation cost.
Definition core.hpp:486
Gecode::PropCost::quadratic
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
Definition core.hpp:4787
Gecode::PropCost::linear
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Definition core.hpp:4796
Gecode::PropCost::LO
@ LO
Cheap.
Definition core.hpp:513
Gecode::PropCost::HI
@ HI
Expensive.
Definition core.hpp:514
Gecode::Propagator::Space
friend class Space
Definition core.hpp:1066
Gecode::Propagator::med
ModEventDelta med
A set of modification events (used during propagation).
Definition core.hpp:1075
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::View
Gecode::ViewArray
View arrays.
Definition array.hpp:253
Gecode::Space::ES_FIX_PARTIAL
ExecStatus ES_FIX_PARTIAL(Propagator &p, const ModEventDelta &med)
Propagator p has computed partial fixpoint
Definition core.hpp:3569
Gecode::Space::ES_SUBSUMED
ExecStatus ES_SUBSUMED(Propagator &p)
Definition core.hpp:3563
Gecode::ModEventDelta
int ModEventDelta
Modification event deltas.
Definition core.hpp:89
GECODE_ME_CHECK
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
GECODE_ES_CHECK
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
Gecode::Int::Circuit
Circuit propagators
Gecode::Int::Distinct::prop_val
ExecStatus prop_val(Space &home, ViewArray< View > &)
Eliminate singletons by naive value propagation.
Definition val.hpp:42
Gecode::Int
Finite domain integers.
Gecode::Int::ME_INT_VAL
const Gecode::ModEvent ME_INT_VAL
Domain operation has resulted in a value (assigned variable).
Definition var-type.hpp:56
Gecode::Int::ME_INT_DOM
const Gecode::ModEvent ME_INT_DOM
Domain operation has changed the domain.
Definition var-type.hpp:72
Gecode
Gecode toplevel namespace
Gecode::path
void path(Home home, const IntVarArgs &x, IntVar s, IntVar e, IntPropLevel ipl=IPL_DEF)
Post propagator such that x forms a Hamiltonian path.
Definition circuit.cpp:169
Gecode::ExecStatus
ExecStatus
Definition core.hpp:472
Gecode::ES_OK
@ ES_OK
Execution is okay.
Definition core.hpp:476
Gecode::ES_FIX
@ ES_FIX
Propagation has computed fixpoint.
Definition core.hpp:477
forceinline
#define forceinline
Definition config.hpp:187