opt-prop.hpp algorithm /usr/include/gecode/int/unary.hh /usr/include/gecode/int/unary/opt-prop.hpp algorithm /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/unary.hh /usr/include/gecode/int/unary/opt-prop.hpp Gecode Gecode::Int Gecode::Int::Unary /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2009 * *Lastmodified: *$Date:2011-05-2516:56:41+0200(Wed,25May2011)$by$Author:schulte$ *$Revision:12022$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ #include<algorithm> namespaceGecode{namespaceInt{namespaceUnary{ template<classOptTask> forceinline OptProp<OptTask>::OptProp(Homehome,TaskArray<OptTask>&t) :TaskProp<OptTask,Int::PC_INT_BND>(home,t){} template<classOptTask> forceinline OptProp<OptTask>::OptProp(Space&home,boolshared,OptProp<OptTask>&p) :TaskProp<OptTask,Int::PC_INT_BND>(home,shared,p){} template<classOptTask> forceinlineExecStatus OptProp<OptTask>::post(Homehome,TaskArray<OptTask>&t){ intm=0,o=0; for(inti=t.size();i--;){ if(t[i].mandatory()) m++; elseif(t[i].optional()) o++; } if(m==t.size()){ TaskArray<typename TaskTraits<OptTask>::ManTask>mt(home,m); for(inti=m;i--;) mt[i].init(t[i]); returnManProp<typename TaskTraits<OptTask>::ManTask>::post(home,mt); } if(o+m>1) (void)new(home)OptProp<OptTask>(home,t); returnES_OK; } template<classOptTask> Actor* OptProp<OptTask>::copy(Space&home,boolshare){ returnnew(home)OptProp<OptTask>(home,share,*this); } template<classOptTask> ExecStatus OptProp<OptTask>::propagate(Space&home,constModEventDelta&med){ //DidoneoftheBooleanviewschange? if(Int::BoolView::me(med)==Int::ME_BOOL_VAL) GECODE_ES_CHECK((purge<OptTask,Int::PC_INT_BND>(home,*this,t))); GECODE_ES_CHECK(overload(home,*this,t)); GECODE_ES_CHECK(detectable(home,*this,t)); GECODE_ES_CHECK(notfirstnotlast(home,*this,t)); //Partitionintomandatoryandoptionalactivities intn=t.size(); inti=0,j=n-1; while(true){ while((i<n)&&t[i].mandatory())i++; while((j>=0)&&!t[j].mandatory())j--; if(i>=j)break; std::swap(t[i],t[j]); } if(i>1){ //Truncatearraytoonlycontainmandatorytasks t.size(i); GECODE_ES_CHECK(edgefinding(home,t)); //Restoretoalsoincludeoptionaltasks t.size(n); } GECODE_ES_CHECK(subsumed(home,*this,t)); returnES_NOFIX; } }}} //STATISTICS:int-prop