Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.6 kB · 160 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * Christian Schulte <schulte@gecode.org> * * Contributing authors: * Gabor Szokoli <szokoli@gecode.org> * * Copyright: * Guido Tack, 2004 * Christian Schulte, 2004 * Gabor Szokoli, 2004 * * 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 Set { namespace RelOp {
/* * "Nary partition" propagator * */
template<class View0, class View1> forceinline PartitionN<View0,View1>::PartitionN(Home home, ViewArray<View0>& x, View1 y) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home, x, y) { shared = Gecode::shared(x) || viewarrayshared(x,y); }
template<class View0, class View1> forceinline PartitionN<View0,View1>::PartitionN(Home home, ViewArray<View0>& x, const IntSet& z, View1 y) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home, x, y) { shared = Gecode::shared(x) || viewarrayshared(x,y); IntSetRanges rz(z); unionOfDets.includeI(home, rz); }
template<class View0, class View1> forceinline PartitionN<View0,View1>::PartitionN(Space& home, PartitionN& p) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,p), shared(p.shared) { unionOfDets.update(home,p.unionOfDets); }
template<class View0, class View1> Actor* PartitionN<View0,View1>::copy(Space& home) { return new (home) PartitionN(home,*this); }
template<class View0, class View1> ExecStatus PartitionN<View0,View1>::post(Home home, ViewArray<View0>& x, View1 y) { switch (x.size()) { case 0: GECODE_ME_CHECK(y.cardMax(home, 0)); return ES_OK; case 1: return Rel::Eq<View0,View1>::post(home, x[0], y); default: (void) new (home) PartitionN<View0,View1>(home,x,y); return ES_OK; } }
template<class View0, class View1> ExecStatus PartitionN<View0,View1>::post(Home home, ViewArray<View0>& x, const IntSet& z, View1 y) { (void) new (home) PartitionN<View0,View1>(home,x,z,y); return ES_OK; }
template<class View0, class View1> PropCost PartitionN<View0,View1>::cost(const Space&, const ModEventDelta&) const { return PropCost::quadratic(PropCost::LO, x.size()+1); }
template<class View0, class View1> ExecStatus PartitionN<View0,View1>::propagate(Space& home, const ModEventDelta& med) {
ModEvent me0 = View0::me(med); ModEvent me1 = View1::me(med); bool ubevent = Rel::testSetEventUB(me0, me1); bool lbevent = Rel::testSetEventLB(me0, me1); bool anybevent = Rel::testSetEventAnyB(me0, me1); bool cardevent = Rel::testSetEventCard(me0, me1);
bool modified = false; bool oldModified = false;
do { oldModified = modified; modified = false; if (oldModified || anybevent) GECODE_ES_CHECK(partitionNXiUB(home,modified, x, y,unionOfDets)); if (modified || oldModified || anybevent) GECODE_ES_CHECK(partitionNXiLB(home,modified, x, y,unionOfDets)); if (modified || oldModified || ubevent) GECODE_ES_CHECK(partitionNYUB(home,modified, x, y,unionOfDets)); if (modified || oldModified || lbevent) GECODE_ES_CHECK(partitionNYLB(home,modified, x, y,unionOfDets)); if (modified || oldModified || ubevent) GECODE_ES_CHECK(unionNXiUB(home,modified, x, y,unionOfDets)); if (modified || oldModified || cardevent) GECODE_ES_CHECK(partitionNCard(home,modified, x, y,unionOfDets)); } while (modified);
//removing assigned sets from x, accumulating the value: for(int i=0;i<x.size();i++) { //Do not reverse! Eats away the end of the array! while (i<x.size() && x[i].assigned()) { GlbRanges<View0> det(x[i]); unionOfDets.includeI(home,det); x.move_lst(i); } } // When we run out of variables, make a final check and disolve: if (x.size()==0) { BndSetRanges all1(unionOfDets); GECODE_ME_CHECK( y.intersectI(home,all1) ); BndSetRanges all2(unionOfDets); GECODE_ME_CHECK( y.includeI(home,all2) ); unionOfDets.dispose(home); return home.ES_SUBSUMED(*this); }
return shared ? ES_NOFIX : ES_FIX; }
}}}
// STATISTICS: set-prop