/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Copyright: * Christian Schulte, 2009 * * Last modified: * $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $ * $Revision: 12022 $ * * 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 Unary { // Overload checking for mandatory tasks template ExecStatus overload(Space& home, TaskArray& t) { TaskViewArray::TaskViewFwd> f(t); sort::TaskViewFwd,STO_LCT,true>(f); Region r(home); OmegaTree::TaskViewFwd> o(r,f); for (int i=0; i f[i].lct()) return ES_FAILED; } return ES_OK; } // Overload checking for optional tasks template ExecStatus overload(Space& home, Propagator& p, TaskArray& t) { TaskViewArray::TaskViewFwd> f(t); sort::TaskViewFwd,STO_LCT,true>(f); Region r(home); OmegaLambdaTree::TaskViewFwd> ol(r,f,false); bool to_purge = false; for (int i=0; i f[i].lct()) return ES_FAILED; } while (!ol.lempty() && (ol.lect() > f[i].lct())) { int j = ol.responsible(); GECODE_ME_CHECK(f[j].excluded(home)); ol.lremove(j); to_purge = true; } } if (to_purge) GECODE_ES_CHECK((purge(home,p,t))); return ES_OK; } }}} // STATISTICS: int-prop