Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.7 kB · 221 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2008 * * 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 Branch {
/// %Choice storing position and values for integer views class GECODE_VTABLE_EXPORT PosValuesChoice : public PosChoice { private: /// Information about position and minimum class PosMin { public: /// Start position of range unsigned int pos; /// Minmum of range int min; }; /// Number of ranges unsigned int n; /// Values to assign to PosMin* pm; public: /// Initialize choice for brancher \a b, position \a p, and view \a x GECODE_INT_EXPORT PosValuesChoice(const Brancher& b, const Pos& p, IntView x); /// Initialize choice for brancher \a b from archive \a e GECODE_INT_EXPORT PosValuesChoice(const Brancher& b, unsigned int alt, Pos p, Archive& e); /// Return value to branch with for alternative \a a int val(unsigned int a) const; /// Deallocate GECODE_INT_EXPORT virtual ~PosValuesChoice(void); /// Archive into \a e GECODE_INT_EXPORT virtual void archive(Archive& e) const; };
forceinline int PosValuesChoice::val(unsigned int a) const { PosMin* l = &pm[0]; PosMin* r = &pm[n-1]; while (true) { PosMin* m = l + (r-l)/2; if (a < m->pos) { r=m-1; } else if (a >= (m+1)->pos) { l=m+1; } else { return m->min + static_cast<int>(a - m->pos); } } GECODE_NEVER; return 0; }
template<int n, bool min, class Filter, class Print> forceinline ViewValuesBrancher<n,min,Filter,Print>:: ViewValuesBrancher(Home home, ViewArray<IntView>& x, ViewSel<IntView>* vs[n], IntBranchFilter bf, IntVarValPrint vvp) : ViewBrancher<IntView,Filter,n>(home,x,vs,bf), p(vvp) { if (p.notice()) home.notice(*this,AP_DISPOSE,true); }
template<int n, bool min, class Filter, class Print> forceinline void ViewValuesBrancher<n,min,Filter,Print>::post(Home home, ViewArray<IntView>& x, ViewSel<IntView>* vs[n], IntBranchFilter bf, IntVarValPrint vvp) { (void) new (home) ViewValuesBrancher<n,min,Filter,Print>(home,x,vs,bf,vvp); }
template<int n, bool min, class Filter, class Print> forceinline ViewValuesBrancher<n,min,Filter,Print>:: ViewValuesBrancher(Space& home, ViewValuesBrancher& b) : ViewBrancher<IntView,Filter,n>(home,b), p(b.p) {}
template<int n, bool min, class Filter, class Print> Actor* ViewValuesBrancher<n,min,Filter,Print>::copy(Space& home) { return new (home) ViewValuesBrancher<n,min,Filter,Print> (home,*this); }
template<int n, bool min, class Filter, class Print> const Choice* ViewValuesBrancher<n,min,Filter,Print>::choice(Space& home) { Pos p = ViewBrancher<IntView,Filter,n>::pos(home); return new PosValuesChoice(*this,p, ViewBrancher<IntView,Filter,n>::view(p)); }
template<int n, bool min, class Filter, class Print> const Choice* ViewValuesBrancher<n,min,Filter,Print>::choice (const Space& home, Archive& e) { (void) home; int p; unsigned int a; e >> p >> a; return new PosValuesChoice(*this,a,p,e); }
template<int n, bool min, class Filter, class Print> ExecStatus ViewValuesBrancher<n,min,Filter,Print>::commit(Space& home, const Choice& c, unsigned int a) { const PosValuesChoice& pvc = static_cast<const PosValuesChoice&>(c); IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos())); unsigned int b = min ? a : (pvc.alternatives() - 1 - a); return me_failed(x.eq(home,pvc.val(b))) ? ES_FAILED : ES_OK; }
template<int n, bool min, class Filter, class Print> NGL* ViewValuesBrancher<n,min,Filter,Print>::ngl(Space& home, const Choice& c, unsigned int a) const { const PosValuesChoice& pvc = static_cast<const PosValuesChoice&>(c); IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos())); unsigned int b = min ? a : (pvc.alternatives() - 1 - a); return new (home) EqNGL<IntView>(home,x,pvc.val(b)); }
template<int n, bool min, class Filter, class Print> void ViewValuesBrancher<n,min,Filter,Print>::print(const Space& home, const Choice& c, unsigned int a, std::ostream& o) const { const PosValuesChoice& pvc = static_cast<const PosValuesChoice&>(c); IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos())); unsigned int b = min ? a : (pvc.alternatives() - 1 - a); int nn = pvc.val(b); if (p) p(home,*this,a,x,pvc.pos().pos,nn,o); else o << "var[" << pvc.pos().pos << "] = " << nn; }
template<int n, bool min, class Filter, class Print> forceinline size_t ViewValuesBrancher<n,min,Filter,Print>::dispose(Space& home) { if (p.notice()) home.ignore(*this,AP_DISPOSE,true); (void) ViewBrancher<IntView,Filter,n>::dispose(home); return sizeof(ViewValuesBrancher<n,min,Filter,Print>); }
template<int n, bool min> forceinline void postviewvaluesbrancher(Home home, ViewArray<IntView>& x, ViewSel<IntView>* vs[n], IntBranchFilter bf, IntVarValPrint vvp) { if (bf) { if (vvp) { ViewValuesBrancher<n,min,BrancherFilter<IntView>, BrancherPrint<IntView,int> > ::post(home,x,vs,bf,vvp); } else { ViewValuesBrancher<n,min,BrancherFilter<IntView>, BrancherNoPrint<IntView,int> > ::post(home,x,vs,bf,vvp); } } else { if (vvp) { ViewValuesBrancher<n,min,BrancherNoFilter<IntView>, BrancherPrint<IntView,int> > ::post(home,x,vs,bf,vvp); } else { ViewValuesBrancher<n,min,BrancherNoFilter<IntView>, BrancherNoPrint<IntView,int> > ::post(home,x,vs,bf,vvp); } } }
}}}
// STATISTICS: int-branch