Jip J. Dekker
1d9faf38de
git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
119 lines
3.6 KiB
C++
Executable File
119 lines
3.6 KiB
C++
Executable File
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Christian Schulte, 2009
|
|
*
|
|
* 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 <algorithm>
|
|
|
|
namespace Gecode { namespace Int { namespace Unary {
|
|
|
|
template<class OptTask, class PL>
|
|
forceinline
|
|
OptProp<OptTask,PL>::OptProp(Home home, TaskArray<OptTask>& t)
|
|
: TaskProp<OptTask,PL>(home,t) {}
|
|
|
|
template<class OptTask, class PL>
|
|
forceinline
|
|
OptProp<OptTask,PL>::OptProp(Space& home, OptProp<OptTask,PL>& p)
|
|
: TaskProp<OptTask,PL>(home,p) {}
|
|
|
|
template<class OptTask, class PL>
|
|
ExecStatus
|
|
OptProp<OptTask,PL>::post(Home home, TaskArray<OptTask>& t) {
|
|
int m=0, o=0;
|
|
for (int i=0; i<t.size(); i++) {
|
|
if (t[i].mandatory())
|
|
m++;
|
|
else if (t[i].optional())
|
|
o++;
|
|
}
|
|
if (m == t.size()) {
|
|
TaskArray<typename TaskTraits<OptTask>::ManTask> mt(home,m);
|
|
for (int i=0; i<m; i++)
|
|
mt[i].init(t[i]);
|
|
return ManProp<typename TaskTraits<OptTask>::ManTask,PL>::post(home,mt);
|
|
}
|
|
if (o+m > 1)
|
|
(void) new (home) OptProp<OptTask,PL>(home,t);
|
|
return ES_OK;
|
|
}
|
|
|
|
template<class OptTask, class PL>
|
|
Actor*
|
|
OptProp<OptTask,PL>::copy(Space& home) {
|
|
return new (home) OptProp<OptTask,PL>(home,*this);
|
|
}
|
|
|
|
template<class OptTask, class PL>
|
|
ExecStatus
|
|
OptProp<OptTask,PL>::propagate(Space& home, const ModEventDelta& med) {
|
|
// Did one of the Boolean views change?
|
|
if (BoolView::me(med) == ME_BOOL_VAL)
|
|
GECODE_ES_CHECK((purge<OptTask,PL>(home,*this,t)));
|
|
|
|
GECODE_ES_CHECK((overload<OptTask,PL>(home,*this,t)));
|
|
|
|
if (PL::basic)
|
|
GECODE_ES_CHECK(timetabling(home,*this,t));
|
|
|
|
if (PL::advanced) {
|
|
GECODE_ES_CHECK((detectable<OptTask,PL>(home,*this,t)));
|
|
GECODE_ES_CHECK((notfirstnotlast<OptTask,PL>(home,*this,t)));
|
|
|
|
// Partition into mandatory and optional activities
|
|
int n = t.size();
|
|
int i=0, j=n-1;
|
|
while (true) {
|
|
while ((i < n) && t[i].mandatory()) i++;
|
|
while ((j >= 0) && !t[j].mandatory()) j--;
|
|
if (i >= j) break;
|
|
std::swap(t[i],t[j]);
|
|
}
|
|
|
|
if (i > 1) {
|
|
// Truncate array to only contain mandatory tasks
|
|
t.size(i);
|
|
GECODE_ES_CHECK(edgefinding(home,t));
|
|
// Restore to also include optional tasks
|
|
t.size(n);
|
|
}
|
|
}
|
|
|
|
if (!PL::basic)
|
|
GECODE_ES_CHECK(subsumed(home,*this,t));
|
|
|
|
return ES_NOFIX;
|
|
}
|
|
|
|
}}}
|
|
|
|
// STATISTICS: int-prop
|