39 namespace Test {
namespace Int {
70 n_bins(m), n_items(n), d_load(d_m), d_bin(d_n), load(l),
71 dsv(new
Gecode::IntSetValues[static_cast<unsigned int>(m+n)]) {
72 for (
int i=n_bins;
i--; )
74 for (
int i=n_items;
i--; )
75 dsv[n_bins+
i].init(d_bin);
90 dsv[n_bins+(i--)].init(d_bin);
99 if (dsv[i]() || (i == 0)) {
100 if (dsv[i]() && (load >= 0)) {
102 for (
int k=0;k<
n_bins; k++)
109 dsv[i--].
init(d_load);
115 assert((i>=0) && (i<n_bins+n_items));
140 for (
int i=s.
size();
i--; )
147 :
Test(
"BinPacking::"+str(m0)+
"::"+str(s0)+
"::"+(
v ?
"+" :
"-"),
148 m0+s0.
size(), 0, 100),
149 m(m0), s(s0), valid(
v), t(total(s)) {
171 if ((x[m+j] < 0) || (x[m+j] >= m))
176 for (
int i=s.
size();
i--; )
190 for (
int i=s.
size();
i--; )
208 mutable int il[4][8];
213 :
Test(
"MultiBinPacking::"+str(d0)+
"::"+str(m0)+
"::"+
214 str(s0)+
"::"+str(c0), s0.
size() / d0, 0, m0-1),
215 d(d0), m(m0), s(s0), c(c0) {
226 for (
int i=x.
size();
i--; )
227 il[k][x[
i]] += s[
i*d+k];
238 for (
int j=m*d; j--; )
264 :
Base(
"Int::MultiBinPacking::Clique::"+
Test::str(c)), clique(c) {}
277 int n_items = clique[clique.
size()-1] + 1;
282 for (
int i=2*n_items;
i--; )
285 for (
int i=clique.
size()-1;
i--; )
286 s[rand(n_items)*2+0]=2;
288 for (
int i=clique.
size();
i--; )
298 if (static_cast<unsigned int>(clique.
size()) != mc.
size()) {
302 for (
int i=clique.
size();
i--; )
303 if (!mc.
in(clique[
i])) {
331 for (
int m=1; m<4; m++) {
332 (void)
new BPT(m, s0);
333 (void)
new BPT(m, s1);
334 (void)
new BPT(m, s2);
335 (void)
new BPT(m, s3);
336 (void)
new BPT(m, s4);
337 (void)
new BPT(m, s5);
338 (void)
new BPT(m, s6);
339 (void)
new BPT(m, s7);
340 (void)
new BPT(m, s8);
341 (void)
new BPT(m, s9);
342 (void)
new BPT(m, s1,
false);
347 IntArgs s1({1,2, 2,1, 1,2, 2,1});
349 (void)
new MBPT(2, 4, s1, c1);
350 (void)
new MBPT(2, 6, s1, c1);
354 (void)
new MBPT(2, 6, s2, c21);
355 (void)
new MBPT(2, 6, s2, c22);
356 IntArgs s3({1,2,3, 3,2,1, 2,1,3, 1,3,2});
360 (void)
new MBPT(3, 4, s3, c31);
361 (void)
new MBPT(3, 4, s3, c32);
362 (void)
new MBPT(3, 4, s3, c33);
363 (void)
new MBPT(3, 5, s3, c31);
364 (void)
new MBPT(3, 5, s3, c32);
365 (void)
new MBPT(3, 5, s3, c33);
371 IntArgs c3({1,3,7,10,15,22,27,97});
372 IntArgs c41({1,2,3,4,5,6,7,14});
373 IntArgs c42({1,2,3,4,5,6,7,15});
374 IntArgs c43({1,2,3,4,5,6,7,16});
375 IntArgs c44({1,2,3,4,5,6,7,30});
376 IntArgs c45({1,2,3,4,5,6,7,31});
377 IntArgs c46({1,2,3,4,5,6,7,32});
378 IntArgs c47({1,2,3,4,5,6,7,62});
379 IntArgs c48({1,2,3,4,5,6,7,63});
380 IntArgs c49({1,2,3,4,5,6,7,64});
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
int n_items
Number of items.
int size(void) const
Return size of array (number of elements)
IntSet binpacking(Home home, int d, const IntVarArgs &l, const IntVarArgs &b, const IntArgs &s, const IntArgs &c, IntPropLevel)
int size(void) const
Return number of variables.
Create(void)
Perform creation and registration.
void init(const IntSet &s)
Initialize with values for s.
int n_items
Number of items.
Gecode::IntArgs s
Item sizes.
Gecode::IntArgs c
Bin capacities.
bool valid
Whether to generate only valid loads.
virtual ~LoadBinAssignment(void)
Destructor.
MBPT(int d0, int m0, const Gecode::IntArgs &s0, const Gecode::IntArgs &c0)
Create and register test for d0 dimensions, m0 bins, item sizes s0, and capacities c0...
Gecode::IntSet d_bin
Domain for bin variables.
const int max
Largest allowed integer value.
static int total(const Gecode::IntArgs &s)
Compute total size.
virtual void operator++(void)
Move to next assignment.
int val(void) const
Return current value.
int n
Number of variables.
int n_bins
Number of bins.
Test with different bin loads and items
Gecode::IntArgs clique
Expected clique.
Gecode::IntArgs i({1, 2, 3, 4})
Help class to create and register tests.
Gecode::IntSetValues * dsv
Iterator for each variable.
virtual int operator[](int i) const
Return value for variable i.
unsigned int size(void) const
Return size (cardinality) of set.
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Base class for all tests to be run
virtual Assignment * assignment(void) const
Create assignment.
virtual Gecode::Space * copy(void)
Copying member function.
virtual bool solution(const Assignment &x) const
Test whether x is solution
CliqueMBPT(const Gecode::IntArgs &c)
Test for number of items n expected clique c.
Passing integer variables.
Passing integer arguments.
Generate load and bin assignments.
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Node * x
Pointer to corresponding Boolean expression node.
Test with different bin loads and items
Gecode::IntSet d_load
Domain for load variables.
Base class for assignments
Value iterator for integer sets.
Test for testing the max-clique finding for multi bin-packing.
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
Gecode toplevel namespace
BPT(int m0, const Gecode::IntArgs &s0, bool v=true)
Create and register test for m bins and item sizes s.
virtual bool run(void)
Run the actual test.
bool in(int n) const
Return whether n is included in the set.
Gecode::IntArgs s
Item sizes.
virtual bool solution(const Assignment &x) const
Test whether x is solution
virtual bool operator()(void) const
Test whether all assignments have been iterated.
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.
LoadBinAssignment(int m, const Gecode::IntSet &d_m, int n, const Gecode::IntSet &d_n, int l)
Initialize assignments for load and bin variables.
int load
Load to generate (unless -1)