prop.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, 2011
*
* 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 <gecode/int/rel.hh>
namespace Gecode { namespace Int { namespace Member {
template<class View>
forceinline
Prop<View>::Prop(Home home, ValSet& vs0, ViewArray<View>& x, View y)
: NaryOnePropagator<View,PC_INT_DOM>(home,x,y),
vs(vs0) {}
template<class View>
forceinline void
Prop<View>::add(Space& home, ValSet& vs, ViewArray<View>& x) {
int n=x.size();
for (int i=n; i--; )
if (x[i].assigned()) {
vs.add(home, x[i].val());
x[i] = x[--n];
}
x.size(n);
}
template<class View>
forceinline void
Prop<View>::eliminate(Space& home) {
int n=x.size();
for (int i=n; i--; )
if ((rtest_eq_dom(x[i],y) == RT_FALSE) || vs.subset(x[i])) {
// x[i] is different from y or values are contained in vs
x[i].cancel(home, *this, PC_INT_DOM);
x[i] = x[--n];
}
x.size(n);
}
template<class View>
inline ExecStatus
Prop<View>::post(Home home, ViewArray<View>& x, View y) {
if (x.size() == 0)
return ES_FAILED;
x.unique();
if (x.size() == 1)
return Rel::EqDom<View,View>::post(home,x[0],y);
if (x.same(y))
return ES_OK;
// Eliminate assigned views and store them into the value set
ValSet vs;
add(home, vs, x);
if (x.size() == 0) {
ValSet::Ranges vsr(vs);
GECODE_ME_CHECK(y.inter_r(home,vsr,false));
return ES_OK;
}
(void) new (home) Prop<View>(home, vs, x, y);
return ES_OK;
}
template<class View>
forceinline ExecStatus
Prop<View>::post(Home home, ValSet& vs, ViewArray<View>& x, View y) {
(void) new (home) Prop<View>(home, vs, x, y);
return ES_OK;
}
template<class View>
forceinline
Prop<View>::Prop(Space& home, Prop<View>& p)
: NaryOnePropagator<View,PC_INT_DOM>(home, p) {
vs.update(home, p.vs);
}
template<class View>
Propagator*
Prop<View>::copy(Space& home) {
return new (home) Prop<View>(home, *this);
}
template<class View>
forceinline size_t
Prop<View>::dispose(Space& home) {
vs.dispose(home);
(void) NaryOnePropagator<View,PC_INT_DOM>::dispose(home);
return sizeof(*this);
}
template<class View>
PropCost
Prop<View>::cost(const Space&, const ModEventDelta&) const {
return PropCost::linear(PropCost::HI, x.size()+1);
}
template<class View>
ExecStatus
Prop<View>::propagate(Space& home, const ModEventDelta& med) {
// Add assigned views to value set
if (View::me(med) == ME_INT_VAL)
add(home,vs,x);
// Eliminate views from x
eliminate(home);
if (x.size() == 0) {
// y must have values in the value set
ValSet::Ranges vsr(vs);
GECODE_ME_CHECK(y.inter_r(home,vsr,false));
return home.ES_SUBSUMED(*this);
}
// Constrain y to union of x and value set
Region r;
assert(x.size() > 0);
ValSet::Ranges vsr(vs);
ViewRanges<View> xsr(x[0]);
Iter::Ranges::NaryUnion u(r,vsr,xsr);
for (int i=1; i<x.size(); i++) {
ViewRanges<View> xir(x[i]);
u |= xir;
}
GECODE_ME_CHECK(y.inter_r(home,u,false));
// Check whether all values in y are already in the value set
if (vs.subset(y))
return home.ES_SUBSUMED(*this);
return ES_FIX;
}
}}}
// STATISTICS: int-prop
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Int::Member::Prop::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition prop.hpp:133
Gecode::Int::Member::Prop::copy
virtual Propagator * copy(Space &home)
Copy propagator during cloning.
Definition prop.hpp:113
Gecode::Int::Member::Prop::cost
virtual PropCost cost(const Space &, const ModEventDelta &med) const
Cost function.
Definition prop.hpp:127
Gecode::Int::Member::Prop::add
static void add(Space &home, ValSet &vs, ViewArray< View > &x)
Add values of assigned views in x to value set va.
Definition prop.hpp:46
Gecode::Int::Member::Prop::Prop
Prop(Home home, ValSet &vs, ViewArray< View > &x, View y)
Constructor for posting.
Definition prop.hpp:40
Gecode::Int::Member::Prop::vs
ValSet vs
Value set storing the values of already assigned views.
Definition member.hh:59
Gecode::Int::Member::Prop::eliminate
void eliminate(Space &home)
Eliminate views from x that are not equal to y or ar subsumed by vs.
Definition prop.hpp:58
Gecode::Int::Member::Prop::post
static ExecStatus post(Home home, ViewArray< View > &x, View y)
Post propagator for .
Definition prop.hpp:71
Gecode::Int::Member::Prop::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition prop.hpp:119
Gecode::Int::Rel::EqDom::post
static ExecStatus post(Home home, View0 x0, View1 x1)
Post domain consistent propagator .
Definition eq.hpp:176
Gecode::Int::ValSet::Ranges
Iterator over ranges.
Definition val-set.hh:78
Gecode::Int::ValSet
Class for storing values of already assigned views.
Definition val-set.hh:44
Gecode::Int::ViewRanges
Range iterator for integer views.
Definition view.hpp:54
Gecode::Iter::Ranges::NaryUnion
Range iterator for union of iterators.
Definition ranges-union.hpp:74
Gecode::NaryOnePropagator< View, PC_INT_DOM >::x
ViewArray< View > x
Definition pattern.hpp:175
Gecode::NaryOnePropagator< View, PC_INT_DOM >::NaryOnePropagator
NaryOnePropagator(Space &home, NaryOnePropagator &p)
Gecode::NaryOnePropagator::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition pattern.hpp:570
Gecode::NaryOnePropagator< View, PC_INT_DOM >::y
View y
Definition pattern.hpp:177
Gecode::PropCost
Propagation cost.
Definition core.hpp:486
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::HI
@ HI
Expensive.
Definition core.hpp:514
Gecode::Propagator
Base-class for propagators.
Definition core.hpp:1064
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::Region
Handle to region.
Definition region.hpp:55
Gecode::View
Gecode::ViewArray
View arrays.
Definition array.hpp:253
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
rel.hh
Gecode::Int::Member
Membership propagators.
Gecode::Int
Finite domain integers.
Gecode::Int::rtest_eq_dom
RelTest rtest_eq_dom(VX x, VY y)
Test whether views x and y are equal (use full domain information).
Definition rel-test.hpp:65
Gecode::Int::PC_INT_DOM
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
Definition var-type.hpp:100
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::RT_FALSE
@ RT_FALSE
Relation does not hold.
Definition view.hpp:1735
Gecode
Gecode toplevel namespace
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
Gecode::ES_FAILED
@ ES_FAILED
Execution has resulted in failure.
Definition core.hpp:474
forceinline
#define forceinline
Definition config.hpp:187