git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
169 lines
5.3 KiB
C++
Executable File
169 lines
5.3 KiB
C++
Executable 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, 2006
|
|
* Guido Tack, 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/channel.hh>
|
|
|
|
namespace Gecode {
|
|
|
|
void
|
|
channel(Home home, const IntVarArgs& x, int xoff,
|
|
const IntVarArgs& y, int yoff,
|
|
IntPropLevel ipl) {
|
|
using namespace Int;
|
|
using namespace Channel;
|
|
int n = x.size();
|
|
if (n != y.size())
|
|
throw ArgumentSizeMismatch("Int::channel");
|
|
if (same(x) || same(y))
|
|
throw ArgumentSame("Int::channel");
|
|
Limits::check(xoff,"Int::channel");
|
|
Limits::check(yoff,"Int::channel");
|
|
if ((xoff < 0) || (yoff < 0))
|
|
throw OutOfLimits("Int::channel");
|
|
GECODE_POST;
|
|
if (n == 0)
|
|
return;
|
|
|
|
if ((xoff < 2) && (yoff < 2) && (xoff == yoff)) {
|
|
if (vbd(ipl) == IPL_DOM) {
|
|
DomInfo<IntView,NoOffset<IntView> >* di =
|
|
static_cast<Space&>(home).
|
|
alloc<DomInfo<IntView,NoOffset<IntView> > >(2*(n+xoff));
|
|
for (int i=0; i<n; i++) {
|
|
di[xoff+i ].init(x[i],n+xoff);
|
|
di[2*xoff+i+n].init(y[i],n+xoff);
|
|
}
|
|
if (xoff == 1) {
|
|
IntVar x0(home,0,0);
|
|
di[0].init(x0, n+xoff);
|
|
IntVar y0(home,0,0);
|
|
di[n+xoff].init(y0, n+xoff);
|
|
}
|
|
NoOffset<IntView> noff;
|
|
if (same(x,y)) {
|
|
GECODE_ES_FAIL((Dom<IntView,NoOffset<IntView>,true>
|
|
::post(home,n+xoff,di,noff,noff)));
|
|
} else {
|
|
GECODE_ES_FAIL((Dom<IntView,NoOffset<IntView>,false>
|
|
::post(home,n+xoff,di,noff,noff)));
|
|
}
|
|
} else {
|
|
ValInfo<IntView>* vi =
|
|
static_cast<Space&>(home).alloc<ValInfo<IntView> >(2*(n+xoff));
|
|
for (int i=0; i<n; i++) {
|
|
vi[xoff+i ].init(x[i],n+xoff);
|
|
vi[2*xoff+i+n].init(y[i],n+xoff);
|
|
}
|
|
if (xoff == 1) {
|
|
IntVar x0(home,0,0);
|
|
vi[0].init(x0, n+xoff);
|
|
IntVar y0(home,0,0);
|
|
vi[n+xoff].init(y0, n+xoff);
|
|
}
|
|
NoOffset<IntView> noff;
|
|
if (same(x,y)) {
|
|
GECODE_ES_FAIL((Val<IntView,NoOffset<IntView>,true>
|
|
::post(home,n+xoff,vi,noff,noff)));
|
|
} else {
|
|
GECODE_ES_FAIL((Val<IntView,NoOffset<IntView>,false>
|
|
::post(home,n+xoff,vi,noff,noff)));
|
|
}
|
|
}
|
|
} else {
|
|
if (vbd(ipl) == IPL_DOM) {
|
|
DomInfo<IntView,Offset>* di =
|
|
static_cast<Space&>(home).alloc<DomInfo<IntView,Offset> >(2*n);
|
|
for (int i=0; i<n; i++) {
|
|
di[i ].init(x[i],n);
|
|
di[i+n].init(y[i],n);
|
|
}
|
|
Offset ox(-xoff);
|
|
Offset oy(-yoff);
|
|
if (same(x,y)) {
|
|
GECODE_ES_FAIL((Dom<IntView,Offset,true>
|
|
::post(home,n,di,ox,oy)));
|
|
} else {
|
|
GECODE_ES_FAIL((Dom<IntView,Offset,false>
|
|
::post(home,n,di,ox,oy)));
|
|
}
|
|
} else {
|
|
ValInfo<IntView>* vi =
|
|
static_cast<Space&>(home).alloc<ValInfo<IntView> >(2*n);
|
|
for (int i=0; i<n; i++) {
|
|
vi[i ].init(x[i],n);
|
|
vi[i+n].init(y[i],n);
|
|
}
|
|
Offset ox(-xoff);
|
|
Offset oy(-yoff);
|
|
if (same(x,y)) {
|
|
GECODE_ES_FAIL((Val<IntView,Offset,true>
|
|
::post(home,n,vi,ox,oy)));
|
|
} else {
|
|
GECODE_ES_FAIL((Val<IntView,Offset,false>
|
|
::post(home,n,vi,ox,oy)));
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
void
|
|
channel(Home home, const IntVarArgs& x, const IntVarArgs& y,
|
|
IntPropLevel ipl) {
|
|
channel(home, x, 0, y, 0, ipl);
|
|
}
|
|
void
|
|
channel(Home home, BoolVar x0, IntVar x1, IntPropLevel) {
|
|
using namespace Int;
|
|
GECODE_POST;
|
|
GECODE_ES_FAIL(Channel::LinkSingle::post(home,x0,x1));
|
|
}
|
|
|
|
void
|
|
channel(Home home, const BoolVarArgs& x, IntVar y, int o,
|
|
IntPropLevel) {
|
|
using namespace Int;
|
|
if (same(x))
|
|
throw ArgumentSame("Int::channel");
|
|
Limits::check(o,"Int::channel");
|
|
GECODE_POST;
|
|
ViewArray<BoolView> xv(home,x);
|
|
GECODE_ES_FAIL(Channel::LinkMulti::post(home,xv,y,o));
|
|
}
|
|
|
|
}
|
|
|
|
// STATISTICS: int-post
|