abs.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>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
* Guido Tack, 2006
*
* 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 <algorithm>
namespace Gecode { namespace Int { namespace Arithmetic {
template<class View, template<class View0,class View1> class Eq>
ExecStatus
prop_abs_bnd(Space& home, Propagator& p, View x0, View x1) {
if (x0.assigned()) {
GECODE_ME_CHECK(x1.eq(home,(x0.val() < 0) ? -x0.val() : x0.val()));
return home.ES_SUBSUMED(p);
}
if (x1.assigned()) {
if (x0.min() >= 0) {
GECODE_ME_CHECK(x0.eq(home,x1.val()));
return home.ES_SUBSUMED(p);
} else if (x0.max() <= 0) {
GECODE_ME_CHECK(x0.eq(home,-x1.val()));
return home.ES_SUBSUMED(p);
} else if (x1.val() == 0) {
GECODE_ME_CHECK(x0.eq(home,0));
return home.ES_SUBSUMED(p);
} else {
int mp[2] = {-x1.val(),x1.val()};
Iter::Values::Array i(mp,2);
GECODE_ME_CHECK(x0.inter_v(home,i,false));
return home.ES_SUBSUMED(p);
}
}
if (x0.min() >= 0)
GECODE_REWRITE(p,(Eq<View,View>::post(home(p),x0,x1)));
if (x0.max() <= 0)
GECODE_REWRITE(p,(Eq<MinusView,View>::post(home(p),MinusView(x0),x1)));
GECODE_ME_CHECK(x1.lq(home,std::max(x0.max(),-x0.min())));
GECODE_ME_CHECK(x0.gq(home,-x1.max()));
GECODE_ME_CHECK(x0.lq(home,x1.max()));
if (x1.min() > 0) {
if (-x1.min() < x0.min()) {
GECODE_ME_CHECK(x0.gq(home,x1.min()));
} else if (x0.max() < x1.min()) {
GECODE_ME_CHECK(x0.lq(home,-x1.min()));
}
}
return ES_NOFIX;
}
template<class View>
forceinline
AbsBnd<View>::AbsBnd(Home home, View x0, View x1)
: BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
template<class View>
ExecStatus
AbsBnd<View>::post(Home home, View x0, View x1) {
if (x0.min() >= 0) {
return Rel::EqBnd<View,View>::post(home,x0,x1);
} else if (x0.max() <= 0) {
return Rel::EqBnd<MinusView,View>::post(home,MinusView(x0),x1);
} else {
assert(!x0.assigned());
GECODE_ME_CHECK(x1.gq(home,0));
if (x1.assigned()) {
int mp[2] = {-x1.val(),x1.val()};
Iter::Values::Array i(mp,2);
GECODE_ME_CHECK(x0.inter_v(home,i,false));
} else if (x0 != x1) {
GECODE_ME_CHECK(x1.lq(home,std::max(-x0.min(),x0.max())));
(void) new (home) AbsBnd<View>(home,x0,x1);
}
}
return ES_OK;
}
template<class View>
forceinline
AbsBnd<View>::AbsBnd(Space& home, AbsBnd<View>& p)
: BinaryPropagator<View,PC_INT_BND>(home,p) {}
template<class View>
Actor*
AbsBnd<View>::copy(Space& home) {
return new (home) AbsBnd<View>(home,*this);
}
template<class View>
PropCost
AbsBnd<View>::cost(const Space&, const ModEventDelta& med) const {
if (View::me(med) == ME_INT_VAL)
return PropCost::unary(PropCost::LO);
else
return PropCost::binary(PropCost::LO);
}
template<class View>
ExecStatus
AbsBnd<View>::propagate(Space& home, const ModEventDelta&) {
return prop_abs_bnd<View,Rel::EqBnd>(home, *this, x0, x1);
}
template<class View>
forceinline
AbsDom<View>::AbsDom(Home home, View x0, View x1)
: BinaryPropagator<View,PC_INT_DOM>(home,x0,x1) {}
template<class View>
ExecStatus
AbsDom<View>::post(Home home, View x0, View x1) {
if (x0.min() >= 0) {
return Rel::EqDom<View,View>::post(home,x0,x1);
} else if (x0.max() <= 0) {
return Rel::EqDom<MinusView,View>::post(home,MinusView(x0),x1);
} else {
assert(!x0.assigned());
GECODE_ME_CHECK(x1.gq(home,0));
if (x1.assigned()) {
int mp[2] = {-x1.val(),x1.val()};
Iter::Values::Array i(mp,2);
GECODE_ME_CHECK(x0.inter_v(home,i,false));
} else if (x0 != x1) {
GECODE_ME_CHECK(x1.lq(home,std::max(-x0.min(),x0.max())));
(void) new (home) AbsDom<View>(home,x0,x1);
}
}
return ES_OK;
}
template<class View>
forceinline
AbsDom<View>::AbsDom(Space& home, AbsDom<View>& p)
: BinaryPropagator<View,PC_INT_DOM>(home,p) {}
template<class View>
Actor*
AbsDom<View>::copy(Space& home) {
return new (home) AbsDom<View>(home,*this);
}
template<class View>
PropCost
AbsDom<View>::cost(const Space&, const ModEventDelta& med) const {
if (View::me(med) == ME_INT_VAL)
return PropCost::unary(PropCost::LO);
else
return PropCost::binary((View::me(med) == ME_INT_DOM) ?
PropCost::HI : PropCost::LO);
}
template<class View>
ExecStatus
AbsDom<View>::propagate(Space& home, const ModEventDelta& med) {
if (View::me(med) != ME_INT_DOM) {
GECODE_ES_CHECK((prop_abs_bnd<View,Rel::EqDom>(home, *this, x0, x1)));
return home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM));
}
Region r;
{
ViewRanges<View> i(x0), j(x0);
using namespace Iter::Ranges;
Positive<ViewRanges<View> > p(i);
Negative<ViewRanges<View> > n(j);
Minus m(r,n);
Union<Positive<ViewRanges<View> >,Minus> u(p,m);
GECODE_ME_CHECK(x1.inter_r(home,u,false));
}
{
ViewRanges<View> i(x1), j(x1);
using namespace Iter::Ranges;
Minus m(r,j);
Union<ViewRanges<View>,Minus> u(i,m);
GECODE_ME_CHECK(x0.inter_r(home,u,false));
}
if (x1.assigned())
return home.ES_SUBSUMED(*this);
if (x0.min() >= 0)
GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x1)));
if (x0.max() <= 0) {
MinusView mx0(x0);
GECODE_REWRITE(*this,(Rel::EqDom<MinusView,View>::post(home(*this),mx0,x1)));
}
return ES_FIX;
}
}}}
// STATISTICS: int-prop
Gecode::Actor
Base-class for both propagators and branchers.
Definition core.hpp:628
Gecode::BinaryPropagator
Binary propagator.
Definition pattern.hpp:84
Gecode::BinaryPropagator< View, PC_INT_BND >::x0
View x0
Definition pattern.hpp:87
Gecode::BinaryPropagator< View, PC_INT_BND >::BinaryPropagator
BinaryPropagator(Space &home, BinaryPropagator &p)
Gecode::BinaryPropagator< View, PC_INT_BND >::x1
View x1
Definition pattern.hpp:87
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Int::Arithmetic::AbsBnd
Bounds consistent absolute value propagator.
Definition arithmetic.hh:59
Gecode::Int::Arithmetic::AbsBnd::AbsBnd
AbsBnd(Space &home, AbsBnd &p)
Constructor for cloning p.
Gecode::Int::Arithmetic::AbsBnd::post
static ExecStatus post(Home home, View x0, View x1)
Post bounds consistent propagator .
Definition abs.hpp:93
Gecode::Int::Arithmetic::AbsBnd::copy
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Definition abs.hpp:120
Gecode::Int::Arithmetic::AbsBnd::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition abs.hpp:126
Gecode::Int::Arithmetic::AbsBnd::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition abs.hpp:135
Gecode::Int::Arithmetic::AbsDom
Domain consistent absolute value propagator.
Definition arithmetic.hh:92
Gecode::Int::Arithmetic::AbsDom::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition abs.hpp:191
Gecode::Int::Arithmetic::AbsDom::AbsDom
AbsDom(Space &home, AbsDom &p)
Constructor for cloning p.
Gecode::Int::Arithmetic::AbsDom::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition abs.hpp:181
Gecode::Int::Arithmetic::AbsDom::post
static ExecStatus post(Home home, View x0, View x1)
Post domain consistent propagator .
Definition abs.hpp:148
Gecode::Int::Arithmetic::AbsDom::copy
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Definition abs.hpp:175
Gecode::Int::MinusView
Minus integer view.
Definition view.hpp:282
Gecode::Int::Rel::EqBnd::post
static ExecStatus post(Home home, View0 x0, View1 x1)
Post bounds consistent propagator .
Definition eq.hpp:108
Gecode::Int::Rel::EqDom::post
static ExecStatus post(Home home, View0 x0, View1 x1)
Post domain consistent propagator .
Definition eq.hpp:176
Gecode::Int::ViewRanges
Range iterator for integer views.
Definition view.hpp:54
Gecode::Iter::Values::Array
Value iterator for array of integers
Definition values-array.hpp:46
Gecode::PropCost
Propagation cost.
Definition core.hpp:486
Gecode::PropCost::unary
static PropCost unary(PropCost::Mod m)
Single variable for modifier pcm.
Definition core.hpp:4813
Gecode::PropCost::binary
static PropCost binary(PropCost::Mod m)
Two variables for modifier pcm.
Definition core.hpp:4809
Gecode::PropCost::LO
@ LO
Cheap.
Definition core.hpp:513
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::Set::RelOp::Union
Propagator for ternary union
Definition rel-op.hh:154
Gecode::Set::Rel::Eq::post
static ExecStatus post(Home home, View0 x, View1 y)
Post propagator .
Definition eq.hpp:54
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::View
Gecode::ValSelCommitBase::val
virtual Val val(const Space &home, View x, int i)=0
Return value of view x at position i.
Gecode::Space::ES_NOFIX_PARTIAL
ExecStatus ES_NOFIX_PARTIAL(Propagator &p, const ModEventDelta &med)
Propagator p has not computed partial fixpoint
Definition core.hpp:3576
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_REWRITE
#define GECODE_REWRITE(prop, post)
Rewrite propagator by executing post function.
Definition macros.hpp:116
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::Arithmetic
Numerical (arithmetic) propagators.
Gecode::Int::Arithmetic::prop_abs_bnd
ExecStatus prop_abs_bnd(Space &home, Propagator &p, View x0, View x1)
Definition abs.hpp:42
Gecode::Int
Finite domain integers.
Gecode::Int::PC_INT_BND
const Gecode::PropCond PC_INT_BND
Propagate when minimum or maximum of a view changes.
Definition var-type.hpp:91
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::ME_INT_DOM
const Gecode::ModEvent ME_INT_DOM
Domain operation has changed the domain.
Definition var-type.hpp:72
Gecode::Iter::Ranges
Range iterators.
Definition iter.hh:43
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_NOFIX
@ ES_NOFIX
Propagation has not computed fixpoint.
Definition core.hpp:475
forceinline
#define forceinline
Definition config.hpp:187