distinct.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>
* Gabor Szokoli <szokoli@gecode.org>
*
* Contributing authors:
* Roberto Castaņeda Lozano <rcas@kth.se>
*
* Copyright:
* Roberto Castaņeda Lozano, 2015
* Christian Schulte, 2002
* Gabor Szokoli, 2003
*
* 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/distinct.hh>
#include <gecode/int/bool.hh>
namespace Gecode {
void
distinct(Home home, const IntVarArgs& x, IntPropLevel ipl) {
using namespace Int;
if (same(x))
throw ArgumentSame("Int::distinct");
GECODE_POST;
ViewArray<IntView> xv(home,x);
switch (vbd(ipl)) {
case IPL_BND:
GECODE_ES_FAIL(Distinct::Bnd<IntView>::post(home,xv));
break;
case IPL_DOM:
GECODE_ES_FAIL(Distinct::Dom<IntView>::post(home,xv));
break;
default:
GECODE_ES_FAIL(Distinct::Val<IntView>::post(home,xv));
}
}
void
distinct(Home home, const IntArgs& c, const IntVarArgs& x,
IntPropLevel ipl) {
using namespace Int;
if (same(x))
throw ArgumentSame("Int::distinct");
if (c.size() != x.size())
throw ArgumentSizeMismatch("Int::distinct");
GECODE_POST;
ViewArray<OffsetView> cx(home,x.size());
for (int i=0; i<c.size(); i++) {
long long int cx_min = (static_cast<long long int>(c[i]) +
static_cast<long long int>(x[i].min()));
long long int cx_max = (static_cast<long long int>(c[i]) +
static_cast<long long int>(x[i].max()));
Limits::check(c[i],"Int::distinct");
Limits::check(cx_min,"Int::distinct");
Limits::check(cx_max,"Int::distinct");
cx[i] = OffsetView(x[i],c[i]);
}
switch (vbd(ipl)) {
case IPL_BND:
GECODE_ES_FAIL(Distinct::Bnd<OffsetView>::post(home,cx));
break;
case IPL_DOM:
GECODE_ES_FAIL(Distinct::Dom<OffsetView>::post(home,cx));
break;
default:
GECODE_ES_FAIL(Distinct::Val<OffsetView>::post(home,cx));
}
}
void
distinct(Home home, const BoolVarArgs& b, const IntVarArgs& x,
IntPropLevel ipl) {
using namespace Int;
if (same(x))
throw ArgumentSame("Int::distinct");
if (b.size() != x.size())
throw ArgumentSizeMismatch("Int::distinct");
GECODE_POST;
int n = x.size();
int min = Limits::max;
int max = Limits::min;
int m = 0;
for (int i=0; i<n; i++)
if (!b[i].zero()) {
min = std::min(min,x[i].min());
max = std::max(max,x[i].max());
m++;
}
if (m < 2)
return;
int start;
if (max < Limits::max-m)
start = max+1;
else if (min > Limits::min+m)
start = min-(m+1);
else
throw OutOfLimits("Int::distinct");
ViewArray<IntView> y(home,m);
int j = 0;
for (int i=0; i<n; i++)
if (b[i].one()) {
y[j] = x[i]; j++;
} else if (b[i].none()) {
y[j] = IntVar(home, Limits::min, Limits::max);
GECODE_ES_FAIL((Bool::IteDom<IntView,ConstIntView,IntView>::post
(home, b[i], x[i], start+j, y[j])));
j++;
}
assert(j == m);
switch (vbd(ipl)) {
case IPL_BND:
GECODE_ES_FAIL(Distinct::Bnd<IntView>::post(home,y));
break;
case IPL_DOM:
GECODE_ES_FAIL(Distinct::Dom<IntView>::post(home,y));
break;
default:
GECODE_ES_FAIL(Distinct::Val<IntView>::post(home,y));
}
}
void
distinct(Home home, const IntVarArgs& x, int c,
IntPropLevel ipl) {
using namespace Int;
if (same(x))
throw ArgumentSame("Int::distinct");
GECODE_POST;
int n = x.size();
int min = Limits::max;
int max = Limits::min;
int m = 0;
for (int i=0; i<n; i++)
if (!(x[i].assigned() && (x[i].val() == c))) {
min = std::min(min,x[i].min());
max = std::max(max,x[i].max());
m++;
}
if (m < 2)
return;
int start;
if (max < Limits::max-m)
start = max+1;
else if (min > Limits::min+m)
start = min-(m+1);
else
throw OutOfLimits("Int::distinct");
ViewArray<IntView> y(home,m);
int j = 0;
for (int i=0; i<n; i++)
if (!x[i].in(c)) {
y[j] = x[i]; j++;
} else if (!(x[i].assigned() && (x[i].val() == c))) {
y[j] = IntVar(home, Limits::min, Limits::max);
GECODE_ES_FAIL(Distinct::EqIte::post
(home, x[i], y[j], c, start+j));
j++;
}
assert(j == m);
switch (vbd(ipl)) {
case IPL_BND:
GECODE_ES_FAIL(Distinct::Bnd<IntView>::post(home,y));
break;
case IPL_DOM:
GECODE_ES_FAIL(Distinct::Dom<IntView>::post(home,y));
break;
default:
GECODE_ES_FAIL(Distinct::Val<IntView>::post(home,y));
}
}
}
// 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::FloatVal::size
FloatNum size(void) const
Return size of float value (distance between maximum and minimum).
Definition val.hpp:78
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::IntArgs
Passing integer arguments.
Definition int.hh:628
Gecode::IntVarArgs
Passing integer variables.
Definition int.hh:656
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::Int::ArgumentSame
Exception: Arguments contain same variable multiply
Definition exception.hpp:80
Gecode::Int::ArgumentSizeMismatch
Exception: Arguments are of different size
Definition exception.hpp:73
Gecode::Int::Bool::IteDom::post
static ExecStatus post(Home home, BoolView b, V0 x0, V1 x1, V2 x2)
Post if-then-else propagator.
Definition ite.hpp:176
Gecode::Int::Distinct::Bnd::post
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for view array x.
Definition bnd.hpp:476
Gecode::Int::Distinct::Dom::post
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for views x.
Definition dom.hpp:45
Gecode::Int::Distinct::EqIte::post
static ExecStatus post(Home home, IntView x0, IntView x1, int c0, int c1)
Post if-then-else propagator.
Definition eqite.hpp:49
Gecode::Int::Distinct::Val::post
static ExecStatus post(Home home, ViewArray< View > &x)
Post propagator for view array x.
Definition val.hpp:185
Gecode::Int::OffsetView
Offset integer view.
Definition view.hpp:443
Gecode::Int::OutOfLimits
Exception: Value out of limits
Definition exception.hpp:44
Gecode::ViewArray
View arrays.
Definition array.hpp:253
GECODE_POST
#define GECODE_POST
Check for failure in a constraint post function.
Definition macros.hpp:40
GECODE_ES_FAIL
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Definition macros.hpp:103
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_BND
@ IPL_BND
Bounds propagation.
Definition int.hh:978
bool.hh
distinct.hh
Gecode::Int::Limits::check
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Definition limits.hpp:46
Gecode::Int::Limits::min
const int min
Smallest allowed integer value.
Definition int.hh:118
Gecode::Int::Limits::max
const int max
Largest allowed integer value.
Definition int.hh:116
Gecode::Int
Finite domain integers.
Gecode
Gecode toplevel namespace
Gecode::distinct
void distinct(Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Post propagator for for all .
Definition distinct.cpp:46
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::same
bool same(VarArgArray< Var > x, VarArgArray< Var > y)
Definition array.hpp:1937
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49