Jip J. Dekker
3e72b0e857
git-subtree-dir: software/gecode_on_record git-subtree-split: 37ed9bda495ea87e63217c19a374b5a93bb0078e
116 lines
3.1 KiB
C++
Executable File
116 lines
3.1 KiB
C++
Executable File
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Christian Schulte, 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.
|
|
*
|
|
*/
|
|
|
|
namespace Gecode { namespace Int { namespace NoOverlap {
|
|
|
|
template<class Box>
|
|
forceinline
|
|
ManProp<Box>::ManProp(Home home, Box* b, int n)
|
|
: Base<Box>(home, b, n) {}
|
|
|
|
template<class Box>
|
|
inline ExecStatus
|
|
ManProp<Box>::post(Home home, Box* b, int n) {
|
|
if (n > 1)
|
|
(void) new (home) ManProp<Box>(home,b,n);
|
|
return ES_OK;
|
|
}
|
|
|
|
template<class Box>
|
|
forceinline size_t
|
|
ManProp<Box>::dispose(Space& home) {
|
|
(void) Base<Box>::dispose(home);
|
|
return sizeof(*this);
|
|
}
|
|
|
|
|
|
template<class Box>
|
|
forceinline
|
|
ManProp<Box>::ManProp(Space& home, ManProp<Box>& p)
|
|
: Base<Box>(home, p, p.n) {}
|
|
|
|
template<class Box>
|
|
Actor*
|
|
ManProp<Box>::copy(Space& home) {
|
|
return new (home) ManProp<Box>(home,*this);
|
|
}
|
|
|
|
template<class Box>
|
|
ExecStatus
|
|
ManProp<Box>::propagate(Space& home, const ModEventDelta&) {
|
|
Region r;
|
|
|
|
// Number of disjoint boxes
|
|
int* db = r.alloc<int>(n);
|
|
for (int i=0; i<n; i++)
|
|
db[i] = n-1;
|
|
|
|
// Number of boxes to be eliminated
|
|
int e = 0;
|
|
|
|
for (int i=0; i<n; i++)
|
|
for (int j=0; j<i; j++)
|
|
if (b[i].nooverlap(b[j])) {
|
|
assert(db[i] > 0); assert(db[j] > 0);
|
|
if (--db[i] == 0) e++;
|
|
if (--db[j] == 0) e++;
|
|
continue;
|
|
} else {
|
|
GECODE_ES_CHECK(b[i].nooverlap(home,b[j]));
|
|
}
|
|
|
|
if (e == n)
|
|
return home.ES_SUBSUMED(*this);
|
|
|
|
{
|
|
int i = n-1;
|
|
while (e > 0) {
|
|
// Eliminate boxes that do not overlap
|
|
while (db[i] > 0)
|
|
i--;
|
|
b[i].cancel(home, *this);
|
|
b[i] = b[--n];
|
|
e--; i--;
|
|
}
|
|
if (n < 2)
|
|
return home.ES_SUBSUMED(*this);
|
|
}
|
|
|
|
return ES_NOFIX;
|
|
}
|
|
|
|
}}}
|
|
|
|
// STATISTICS: int-prop
|
|
|