unshare.cpp
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.
*
*/
#include <gecode/int/rel.hh>
#include <gecode/int/bool.hh>
namespace Gecode { namespace Int { namespace Unshare {
template<class Var>
class VarPtrLess {
public:
forceinline bool
operator ()(const Var* a, const Var* b) {
return a->varimp() < b->varimp();
}
};
forceinline void
link(Home home, IntVar** x, int n, IntPropLevel ipl) {
if (home.failed()) {
for (int i=1; i<n; i++)
*x[i]=IntVar(home,x[0]->min(),x[0]->min());
} else if (n > 2) {
ViewArray<IntView> y(home,n);
y[0]=*x[0];
for (int i=1; i<n; i++)
y[i]=*x[i]=IntVar(home,x[0]->min(),x[0]->max());
if ((ipl == IPL_DOM) || (ipl == IPL_DEF)) {
ExecStatus es = Rel::NaryEqDom<IntView>::post(home,y);
(void) es; assert(es == ES_OK);
} else {
ExecStatus es = Rel::NaryEqBnd<IntView>::post(home,y);
(void) es; assert(es == ES_OK);
}
} else if (n == 2) {
*x[1]=IntVar(home,x[0]->min(),x[0]->max());
if ((ipl == IPL_DOM) || (ipl == IPL_DEF)) {
ExecStatus es = Rel::EqDom<IntView,IntView>::post(home,*x[0],*x[1]);
(void) es; assert(es == ES_OK);
} else {
ExecStatus es = Rel::EqBnd<IntView,IntView>::post(home,*x[0],*x[1]);
(void) es; assert(es == ES_OK);
}
}
}
forceinline void
link(Home home, BoolVar** x, int n, IntPropLevel) {
if (home.failed()) {
for (int i=1; i<n; i++)
*x[i]=BoolVar(home,0,0);
} else if (n > 2) {
ViewArray<BoolView> y(home,n);
y[0]=*x[0];
for (int i=1; i<n; i++)
y[i]=*x[i]=BoolVar(home,0,1);
ExecStatus es = Bool::NaryEq<BoolView>::post(home,y);
(void) es; assert(es == ES_OK);
} else if (n == 2) {
*x[1] = BoolVar(home,0,1);
ExecStatus es = Bool::Eq<BoolView,BoolView>::post(home,*x[0],*x[1]);
(void) es; assert(es == ES_OK);
}
}
template<class Var>
forceinline void
unshare(Home home, VarArgArray<Var>& x, IntPropLevel ipl) {
int n=x.size();
if (n < 2)
return;
Region r;
Var** y = r.alloc<Var*>(n);
for (int i=0; i<n; i++)
y[i]=&x[i];
VarPtrLess<Var> vpl;
Support::quicksort<Var*,VarPtrLess<Var> >(y,n,vpl);
// Replace all shared variables with new and equal variables
for (int i=0; i<n;) {
int j=i++;
while ((i<n) && (y[j]->varimp() == y[i]->varimp()))
i++;
if (!y[j]->assigned())
link(home,&y[j],i-j,ipl);
}
}
}}}
namespace Gecode {
void
unshare(Home home, IntVarArgs& x, IntPropLevel ipl) {
Int::Unshare::unshare<IntVar>(home,x,vbd(ipl));
}
void
unshare(Home home, BoolVarArgs& x, IntPropLevel) {
Int::Unshare::unshare<BoolVar>(home,x,IPL_DEF);
}
}
// STATISTICS: int-post
Gecode::ArgArrayBase::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:1607
Gecode::BoolVarArgs
Passing Boolean variables.
Definition int.hh:712
Gecode::BoolVar
Boolean integer variables.
Definition int.hh:512
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Home::failed
bool failed(void) const
Check whether corresponding space is failed.
Definition core.hpp:4048
Gecode::IntVarArgs
Passing integer variables.
Definition int.hh:656
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::Int::Bool::Eq::post
static ExecStatus post(Home home, BVA x0, BVB x1)
Post propagator .
Definition eq.hpp:60
Gecode::Int::Bool::NaryEq::post
static ExecStatus post(Home home, ViewArray< BV > &x)
Post propagator .
Definition eq.hpp:131
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::Rel::NaryEqBnd::post
static ExecStatus post(Home home, ViewArray< View > &x)
Post bounds consistent propagator .
Definition eq.hpp:402
Gecode::Int::Rel::NaryEqDom::post
static ExecStatus post(Home home, ViewArray< View > &x)
Post domain consistent propagator .
Definition eq.hpp:270
Gecode::Int::Unshare::VarPtrLess
Sort order for variables.
Definition unshare.cpp:46
Gecode::Int::Unshare::VarPtrLess::operator()
bool operator()(const Var *a, const Var *b)
Definition unshare.cpp:49
Gecode::Region
Handle to region.
Definition region.hpp:55
Gecode::VarArgArray
Argument array for variables.
Definition array.hpp:774
Gecode::Var
Base class for variables.
Definition var.hpp:40
Gecode::ViewArray
View arrays.
Definition array.hpp:253
Gecode::IntPropLevel
IntPropLevel
Propagation levels for integer propagators.
Definition int.hh:974
Gecode::IPL_DOM
@ IPL_DOM
Domain propagation Options: basic versus advanced propagation.
Definition int.hh:979
Gecode::IPL_DEF
@ IPL_DEF
Simple propagation levels.
Definition int.hh:976
bool.hh
rel.hh
Gecode::Int::Unshare
Unsharing shared variables.
Gecode::Int::Unshare::unshare
void unshare(Home home, VarArgArray< Var > &x, IntPropLevel ipl)
Replace unassigned shared variables by fresh, yet equal variables.
Definition unshare.cpp:108
Gecode::Int::Unshare::link
void link(Home home, IntVar **x, int n, IntPropLevel ipl)
Replace by fresh yet equal integer variables.
Definition unshare.cpp:57
Gecode::Int
Finite domain integers.
Gecode::Support::quicksort
void quicksort(Type *l, Type *r, Less &less)
Standard quick sort.
Definition sort.hpp:130
Gecode
Gecode toplevel namespace
Gecode::min
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
Gecode::vbd
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Definition ipl.hpp:37
Gecode::ExecStatus
ExecStatus
Definition core.hpp:472
Gecode::ES_OK
@ ES_OK
Execution is okay.
Definition core.hpp:476
Gecode::unshare
void unshare(Home home, IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Replace multiple variable occurences in x by fresh variables.
Definition unshare.cpp:136
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
forceinline
#define forceinline
Definition config.hpp:187