common.hpp /usr/include/gecode/set/sequence.hh /usr/include/gecode/set/sequence/common.hpp /usr/include/gecode/set/sequence.hh Gecode Gecode::Set Gecode::Set::Sequence /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> *ChristianSchulte<schulte@gecode.org> * *Contributingauthors: *GaborSzokoli<szokoli@gecode.org> * *Copyright: *GuidoTack,2004 *ChristianSchulte,2004 *GaborSzokoli,2004 * *Lastmodified: *$Date:2012-09-0717:31:22+0200(Fri,07Sep2012)$by$Author:schulte$ *$Revision:13068$ * *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. * */ namespaceGecode{namespaceSet{namespaceSequence{ inlineExecStatus propagateSeq(Space&home,bool&modified,bool&assigned, ViewArray<SetView>&x){ intlastElem=x.size()-1; intcur_max=BndSet::MAX_OF_EMPTY; intcur_min=BndSet::MIN_OF_EMPTY; Regionr(home); Support::DynamicArray<int,Region>ub(r); for(inti=0;i<lastElem;i++){ if(x[i].glbSize()>0) cur_max=std::max(cur_max,x[i].glbMax()); if(x[i].cardMin()>0) cur_max=std::max(cur_max,x[i].lubMinN(x[i].cardMin()-1)); if(cur_max>=Limits::min) GECODE_SET_ME_CHECK_VAL_B(modified, x[i+1].exclude(home,Limits::min, cur_max), assigned); if(x[lastElem-i].lubSize()>0){ cur_min=std::min(cur_min,x[lastElem-i].glbMin()); if(x[lastElem-i].cardMin()>0){ //Computen-thlargestelementinx[lastElem-i].lub //forn=x[lastElem-i].cardMin()-1 intmaxN=BndSet::MAX_OF_EMPTY; intj=0; for(LubRanges<SetView>ubr(x[lastElem-i]);ubr();++ubr,++j){ ub[2*j]=ubr.min();ub[2*j+1]=ubr.max(); } unsignedintxcm=x[lastElem-i].cardMin()-1; while(j--){ unsignedintwidth=static_cast<unsignedint>(ub[2*j+1]-ub[2*j]+1); if(width>xcm){ maxN=static_cast<int>(ub[2*j+1]-xcm); break; } xcm-=width; } cur_min=std::min(cur_min,maxN); } } if(Limits::max>=cur_min) GECODE_SET_ME_CHECK_VAL_B(modified, x[lastElem-i-1].exclude(home,cur_min, Limits::max), assigned); } returnES_NOFIX; } }}} //STATISTICS:set-prop