set.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, 2004
*
* 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 Dom {
template<class View, ReifyMode rm>
forceinline
ReIntSet<View,rm>::ReIntSet
(Home home, View x, const IntSet& s, BoolView b)
: ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,x,b), is(s) {
home.notice(*this,AP_DISPOSE);
}
template<class View, ReifyMode rm>
forceinline size_t
ReIntSet<View,rm>::dispose(Space& home) {
home.ignore(*this,AP_DISPOSE);
is.~IntSet();
(void) ReUnaryPropagator<View,PC_INT_DOM,BoolView>::dispose(home);
return sizeof(*this);
}
template<class View, ReifyMode rm>
ExecStatus
ReIntSet<View,rm>::post(Home home, View x, const IntSet& s, BoolView b) {
if (s.ranges() == 0) {
if (rm == RM_PMI)
return ES_OK;
GECODE_ME_CHECK(b.zero(home));
} else if (s.ranges() == 1) {
return ReRange<View,rm>::post(home,x,s.min(),s.max(),b);
} else if (b.one()) {
if (rm == RM_PMI)
return ES_OK;
IntSetRanges i_is(s);
GECODE_ME_CHECK(x.inter_r(home,i_is,false));
} else if (b.zero()) {
if (rm == RM_IMP)
return ES_OK;
IntSetRanges i_is(s);
GECODE_ME_CHECK(x.minus_r(home,i_is,false));
} else {
(void) new (home) ReIntSet<View,rm>(home,x,s,b);
}
return ES_OK;
}
template<class View, ReifyMode rm>
forceinline
ReIntSet<View,rm>::ReIntSet(Space& home, ReIntSet& p)
: ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,p), is(p.is) {
}
template<class View, ReifyMode rm>
Actor*
ReIntSet<View,rm>::copy(Space& home) {
return new (home) ReIntSet(home,*this);
}
template<class View, ReifyMode rm>
ExecStatus
ReIntSet<View,rm>::propagate(Space& home, const ModEventDelta&) {
IntSetRanges i_is(is);
if (b.one()) {
if (rm != RM_PMI)
GECODE_ME_CHECK(x0.inter_r(home,i_is,false));
return home.ES_SUBSUMED(*this);
}
if (b.zero()) {
if (rm != RM_IMP)
GECODE_ME_CHECK(x0.minus_r(home,i_is,false));
return home.ES_SUBSUMED(*this);
}
{
ViewRanges<View> i_x(x0);
switch (Iter::Ranges::compare(i_x,i_is)) {
case Iter::Ranges::CS_SUBSET:
if (rm != RM_IMP)
GECODE_ME_CHECK(b.one_none(home));
return home.ES_SUBSUMED(*this);
case Iter::Ranges::CS_DISJOINT:
if (rm != RM_PMI)
GECODE_ME_CHECK(b.zero_none(home));
return home.ES_SUBSUMED(*this);
case Iter::Ranges::CS_NONE:
break;
default: GECODE_NEVER;
}
}
return ES_FIX;
}
}}}
// 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::Home::notice
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Definition core.hpp:3219
Gecode::IntSetRanges
Range iterator for integer sets.
Definition int.hh:292
Gecode::IntSet
Integer sets.
Definition int.hh:174
Gecode::IntSet::min
int min(int i) const
Return minimum of range at position i.
Definition int-set-1.hpp:152
Gecode::IntSet::max
int max(int i) const
Return maximum of range at position i.
Definition int-set-1.hpp:158
Gecode::IntSet::ranges
int ranges(void) const
Return number of ranges of the specification.
Definition int-set-1.hpp:171
Gecode::Int::BoolView
Boolean view for Boolean variables.
Definition view.hpp:1380
Gecode::Int::Dom::ReIntSet::propagate
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition set.hpp:93
Gecode::Int::Dom::ReIntSet::copy
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Definition set.hpp:87
Gecode::Int::Dom::ReIntSet::ReIntSet
ReIntSet(Space &home, ReIntSet &p)
Constructor for cloning p.
Definition set.hpp:81
Gecode::Int::Dom::ReIntSet::is
IntSet is
Domain
Definition dom.hh:90
Gecode::Int::Dom::ReIntSet::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition set.hpp:46
Gecode::Int::Dom::ReIntSet::post
static ExecStatus post(Home home, View x, const IntSet &s, BoolView b)
Post propagator for .
Definition set.hpp:55
Gecode::Int::Dom::ReRange::post
static ExecStatus post(Home home, View x, int min, int max, BoolView b)
Post propagator for .
Definition range.hpp:46
Gecode::Int::ReUnaryPropagator< View, PC_INT_DOM, BoolView >::b
BoolView b
Definition propagator.hpp:59
Gecode::Int::ReUnaryPropagator< View, PC_INT_DOM, BoolView >::ReUnaryPropagator
ReUnaryPropagator(Space &home, ReUnaryPropagator &p)
Gecode::Int::ReUnaryPropagator::dispose
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition propagator.hpp:196
Gecode::Int::ReUnaryPropagator< View, PC_INT_DOM, BoolView >::x0
View x0
Definition propagator.hpp:57
Gecode::Int::ViewRanges
Range iterator for integer views.
Definition view.hpp:54
Gecode::Propagator::Space
friend class Space
Definition core.hpp:1066
Gecode::View
Gecode::Space::ES_SUBSUMED
ExecStatus ES_SUBSUMED(Propagator &p)
Definition core.hpp:3563
Gecode::Space::ignore
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Definition core.hpp:4074
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::AP_DISPOSE
@ AP_DISPOSE
Actor must always be disposed.
Definition core.hpp:562
Gecode::RM_IMP
@ RM_IMP
Implication for reification.
Definition int.hh:862
Gecode::RM_PMI
@ RM_PMI
Inverse implication for reification.
Definition int.hh:869
Gecode::Int::Dom
Domain propagators.
Gecode::Int
Finite domain integers.
Gecode::Int::PC_INT_DOM
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
Definition var-type.hpp:100
Gecode::Iter::Ranges::CS_NONE
@ CS_NONE
Neither of the above.
Definition ranges-operations.hpp:63
Gecode::Iter::Ranges::CS_SUBSET
@ CS_SUBSET
First is subset of second iterator.
Definition ranges-operations.hpp:61
Gecode::Iter::Ranges::CS_DISJOINT
@ CS_DISJOINT
Intersection is empty.
Definition ranges-operations.hpp:62
Gecode::Iter::Ranges::compare
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Definition ranges-operations.hpp:127
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
forceinline
#define forceinline
Definition config.hpp:187
GECODE_NEVER
#define GECODE_NEVER
Assert that this command is never executed.
Definition macros.hpp:56