Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.6 kB · 184 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * David Rijsman <David.Rijsman@quintiq.com> * * Contributing authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * David Rijsman, 2009 * 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. * */
namespace Gecode { namespace Int { namespace Sequence {
template<class View, class Val> forceinline Sequence<View,Val>::Sequence(Home home, ViewArray<View>& x0, Val s0, int q0, int l0, int u0) : Propagator(home), x(x0), s(s0), q(q0), l(l0), u(u0), vvsamax(home,x,s0,q0), vvsamin(home,x,s0,q0), ac(home), tofail(false) { home.notice(*this,AP_DISPOSE); bool assigned = false; for (int i=x.size(); i--; ) { if (undecided(x[i],s)) x[i].subscribe(home,*new (home) SupportAdvisor<View>(home,*this,ac,i)); if (x[i].assigned()) assigned = true; } View::schedule(home,*this,assigned ? ME_INT_VAL : ME_INT_BND); }
template<class View, class Val> forceinline Sequence<View,Val>::Sequence(Space& home, Sequence& p) : Propagator(home,p), s(p.s), q(p.q), l(p.l), u(p.u), vvsamax(), vvsamin(), tofail(p.tofail) { x.update(home,p.x); ac.update(home,p.ac); vvsamax.update(home,p.vvsamax); vvsamin.update(home,p.vvsamin); }
template<class View,class Val> ExecStatus Sequence<View,Val>::advise(Space& home, Advisor& _a, const Delta& d) { SupportAdvisor<View>& a = static_cast<SupportAdvisor<View>&>(_a); ExecStatus status = vvsamax.advise(home,x,s,q,a.i,d); if ( ES_NOFIX == vvsamin.advise(home,x,s,q,a.i,d) ) { status = ES_NOFIX; }
if (!undecided(x[a.i],s)) { if (!x[a.i].assigned()) x[a.i].cancel(home,a);
if ( ES_NOFIX == status ) { return home.ES_NOFIX_DISPOSE(ac,a); } else { return home.ES_FIX_DISPOSE(ac,a); } }
if ((status == ES_FAILED) && disabled()) { tofail = true; return ES_FIX; }
return status; }
template<class View, class Val> forceinline size_t Sequence<View,Val>::dispose(Space& home) { home.ignore(*this,AP_DISPOSE); ac.dispose(home); s.~Val(); (void) Propagator::dispose(home); return sizeof(*this); }
template<class View, class Val> forceinline ExecStatus Sequence<View,Val>::check(ViewArray<View>& x, Val s, int q, int l, int u) { Region r; // could do this with an array of length q... int* upper = r.alloc<int>(x.size()+1); int* lower = r.alloc<int>(x.size()+1); upper[0] = 0; lower[0] = 0; for ( int j=0; j<x.size(); j++ ) { upper[j+1] = upper[j]; lower[j+1] = lower[j]; if (includes(x[j],s)) { upper[j+1] += 1; } else if (excludes(x[j],s)) { lower[j+1] += 1; } if ( j+1 >= q && (q - l < lower[j+1] - lower[j+1-q] || upper[j+1] - upper[j+1-q] > u) ) { return ES_FAILED; } } return ES_OK; }
template<class View, class Val> ExecStatus Sequence<View,Val>::post(Home home, ViewArray<View>& x, Val s, int q, int l, int u) { GECODE_ES_CHECK(check(x,s,q,l,u)); Sequence<View,Val>* p = new (home) Sequence<View,Val>(home,x,s,q,l,u);
GECODE_ES_CHECK(p->vvsamax.propagate(home,x,s,q,l,u)); GECODE_ES_CHECK(p->vvsamin.propagate(home,x,s,q,l,u));
return ES_OK; }
template<class View, class Val> Actor* Sequence<View,Val>::copy(Space& home) { return new (home) Sequence<View,Val>(home,*this); }
template<class View, class Val> PropCost Sequence<View,Val>::cost(const Space&, const ModEventDelta&) const { return PropCost::cubic(PropCost::HI,x.size()); }
template<class View, class Val> void Sequence<View,Val>::reschedule(Space& home) { for (int i=x.size(); i--; ) if (!undecided(x[i],s)) x[i].schedule(home,*this,x[i].assigned() ? ME_INT_VAL : ME_INT_BND); if (tofail) View::schedule(home,*this,ME_INT_BND); }
template<class View, class Val> ExecStatus Sequence<View,Val>::propagate(Space& home, const ModEventDelta&) { if (tofail) return ES_FAILED;
GECODE_ES_CHECK(vvsamax.propagate(home,x,s,q,l,u)); GECODE_ES_CHECK(vvsamin.propagate(home,x,s,q,l,u));
for (int i=x.size(); i--; ) if (undecided(x[i],s)) return ES_FIX;
return home.ES_SUBSUMED(*this); }
}}}
// STATISTICS: int-prop