/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * 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 forceinline ManProp::ManProp(Home home, Box* b, int n) : Base(home, b, n) {} template inline ExecStatus ManProp::post(Home home, Box* b, int n) { if (n > 1) (void) new (home) ManProp(home,b,n); return ES_OK; } template forceinline size_t ManProp::dispose(Space& home) { (void) Base::dispose(home); return sizeof(*this); } template forceinline ManProp::ManProp(Space& home, ManProp& p) : Base(home, p, p.n) {} template Actor* ManProp::copy(Space& home) { return new (home) ManProp(home,*this); } template ExecStatus ManProp::propagate(Space& home, const ModEventDelta&) { Region r; // Number of disjoint boxes int* db = r.alloc(n); for (int i=0; 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