common.hpp /usr/include/gecode/set/rel-op.hh /usr/include/gecode/set/sequence.hh /usr/include/gecode/set/element.hh /usr/include/gecode/set/rel-op.hh /usr/include/gecode/set/rel-op/common.hpp /usr/include/gecode/set/sequence.hh /usr/include/gecode/set/rel-op/post.hpp Gecode Gecode::Set Gecode::Set::RelOp /*-*-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. * */ #ifndef__GECODE_SET_RELOP_COMM_ICC__ #define__GECODE_SET_RELOP_COMM_ICC__ namespaceGecode{ template<classView0,classView1> forceinlinebool viewarrayshared(constSpace&home, constViewArray<View0>&va,constView1&y){ returnva.shared(home,y); } template<> forceinlinebool viewarrayshared<Set::SingletonView,Set::SetView> (constSpace&,constViewArray<Set::SingletonView>&,constSet::SetView&){ returnfalse; } template<> forceinlinebool viewarrayshared<Set::ComplementView<Set::SingletonView>,Set::SetView> (constSpace&,constViewArray<Set::ComplementView<Set::SingletonView>>&, constSet::SetView&){ returnfalse; } template<> forceinlinebool viewarrayshared<Set::ComplementView<Set::SingletonView>, Set::ComplementView<Set::SetView>> (constSpace&,constViewArray<Set::ComplementView<Set::SingletonView>>&, constSet::ComplementView<Set::SetView>&){ returnfalse; } namespaceSet{namespaceRelOp{ /* *Detectsharingbetween3variables * */ template<classView0,classView1,classView2> forceinlinebool shared(View0v0,View1v1,View2v2){ returnshared(v0,v1)||shared(v0,v2)||shared(v1,v2); } template<classView0,classView1,classView2> ExecStatusinterCard(Space&home, bool&retmodified,View0&x0,View1&x1,View2&x2){ boolmodified=false; do{ retmodified|=modified; modified=false; { LubRanges<View0>x0ub(x0); LubRanges<View1>x1ub(x1); Iter::Ranges::Union<LubRanges<View0>,LubRanges<View1>> u1(x0ub,x1ub); unsignedints1=Iter::Ranges::size(u1); if(x0.cardMin()+x1.cardMin()>s1){ GECODE_ME_CHECK_MODIFIED(modified, x2.cardMin(home,x0.cardMin()+x1.cardMin()-s1)); } //unsignedintres=std::max(x0.cardMin()+ //(x1.cardMin()<s1? //0:x1.cardMin()-s1), //std::max(x0.cardMin(), //x1.cardMin())); //GECODE_ME_CHECK_MODIFIED(modified,x2.cardMin(home,res)); } { GlbRanges<View0>x0lb(x0); GlbRanges<View1>x1lb(x1); Iter::Ranges::Union<GlbRanges<View0>,GlbRanges<View1>> u1(x0lb,x1lb); unsignedints1=Iter::Ranges::size(u1); GECODE_ME_CHECK_MODIFIED(modified, x2.cardMax(home, x0.cardMax()+x1.cardMax()-s1)); } if(x2.cardMax()<x1.cardMin()) GECODE_ME_CHECK_MODIFIED(modified, x0.cardMax(home, Set::Limits::card+x2.cardMax()-x1.cardMin())); if(x2.cardMax()<x0.cardMin()) GECODE_ME_CHECK_MODIFIED(modified, x1.cardMax(home, Set::Limits::card+x2.cardMax()-x0.cardMin())); GECODE_ME_CHECK_MODIFIED(modified, x0.cardMin(home,x2.cardMin())); GECODE_ME_CHECK_MODIFIED(modified, x1.cardMin(home,x2.cardMin())); }while(modified); returnES_FIX; } template<classView0,classView1,classView2> ExecStatusunionCard(Space&home, bool&retmodified,View0&x0,View1&x1,View2&x2){ boolmodified=false; do{ retmodified|=modified; modified=false; { LubRanges<View0>x0ub(x0); LubRanges<View1>x1ub(x1); Iter::Ranges::Inter<LubRanges<View0>,LubRanges<View1>>i1(x0ub,x1ub); unsignedints1=Iter::Ranges::size(i1); unsignedintres=std::max(x0.cardMin()+ (x1.cardMin()<s1? 0:x1.cardMin()-s1), std::max(x0.cardMin(), x1.cardMin())); GECODE_ME_CHECK_MODIFIED(modified,x2.cardMin(home,res)); } { LubRanges<View0>x0ub(x0); LubRanges<View1>x1ub(x1); Iter::Ranges::Union<LubRanges<View0>,LubRanges<View1>>u1(x0ub,x1ub); unsignedints1=Iter::Ranges::size(u1); GECODE_ME_CHECK_MODIFIED(modified, x2.cardMax(home, std::min(x0.cardMax()+x1.cardMax(),s1))); } if(x2.cardMin()>x1.cardMax()) GECODE_ME_CHECK_MODIFIED(modified, x0.cardMin(home,x2.cardMin()-x1.cardMax())); if(x2.cardMin()>x0.cardMax()) GECODE_ME_CHECK_MODIFIED(modified, x1.cardMin(home,x2.cardMin()-x0.cardMax())); GECODE_ME_CHECK_MODIFIED(modified, x0.cardMax(home,x2.cardMax())); GECODE_ME_CHECK_MODIFIED(modified, x1.cardMax(home,x2.cardMax())); }while(modified); returnES_FIX; } template<classView0,classView1> ExecStatus unionNCard(Space&home,bool&modified,ViewArray<View0>&x, View1&y,GLBndSet&unionOfDets){ intxsize=x.size(); //Max(Xi.cardMin)<=y.card<=Sum(Xi.cardMax) //Xi.card<=y.cardMax unsignedintcardMaxSum=unionOfDets.size(); boolmaxValid=true; for(inti=xsize;i--;){ cardMaxSum+=x[i].cardMax(); if(cardMaxSum<x[i].cardMax()){maxValid=false;}//overflow GECODE_ME_CHECK_MODIFIED(modified,y.cardMin(home,x[i].cardMin())); GECODE_ME_CHECK_MODIFIED(modified,x[i].cardMax(home,y.cardMax())); } if(maxValid){ GECODE_ME_CHECK_MODIFIED(modified,y.cardMax(home,cardMaxSum)); } //y.cardMin-Sum(Xj.cardMax)<=Xi.card if(x.size()==0) returnES_NOFIX; Regionr(home); //TODO:overflowmanagementisawastenow. { unsignedint*rightSum=r.alloc<unsignedint>(xsize); rightSum[xsize-1]=0; for(inti=x.size()-1;i--;){ rightSum[i]=rightSum[i+1]+x[i+1].cardMax(); if(rightSum[i]<rightSum[i+1]){ //overflow,filltherestofthearray. for(intj=i;j>0;j--){ rightSum[j]=Limits::card; } break; } } //Sizeofunionofdetermiedvarsmissingfromxsneakedinhere: unsignedintleftAcc=unionOfDets.size(); for(inti=0;i<xsize;i++){ unsignedintjsum=leftAcc+rightSum[i]; //Ifjsumdidnotoverflowandislessthany.cardMin: if(jsum>=leftAcc&&jsum<y.cardMin()){ GECODE_ME_CHECK_MODIFIED(modified,x[i].cardMin(home,y.cardMin()-jsum)); } leftAcc+=x[i].cardMax(); if(leftAcc<x[i].cardMax()){leftAcc=Limits::card;} } } //y.cardMin-|U(Xj.ub)|<=Xi.card { GLBndSet*rightUnion= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); new(&rightUnion[xsize-1])GLBndSet(home); for(inti=xsize-1;i--;){ BndSetRangesprev(rightUnion[i+1]); LubRanges<View0>prevX(x[i+1]); Iter::Ranges::Union< BndSetRanges,LubRanges<View0>> iter(prev,prevX); new(&rightUnion[i])GLBndSet(home); rightUnion[i].includeI(home,iter); } //unionofdetermiedvarsmissingfromxsneakedinhere: GLBndSetleftAcc; leftAcc.update(home,unionOfDets); for(inti=0;i<xsize;i++){ BndSetRangesleft(leftAcc); BndSetRangesright(rightUnion[i]); Iter::Ranges::Union<BndSetRanges, BndSetRanges>iter(left,right); unsignedintunionSize=Iter::Ranges::size(iter); if(y.cardMin()>unionSize){ GECODE_ME_CHECK_MODIFIED(modified, x[i].cardMin(home,y.cardMin()-unionSize)); } LubRanges<View0>xiub(x[i]); leftAcc.includeI(home,xiub); } for(inti=xsize;i--;) rightUnion[i].dispose(home); leftAcc.dispose(home); } //noneedforthis:|y.lb-U(Xj.cardMax)|<=S.card returnES_NOFIX; } /* *XiUBissubsetofYUB *SubscribestoYUB */ template<classView0,classView1> ExecStatus unionNXiUB(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&){ intxsize=x.size(); for(inti=xsize;i--;){ LubRanges<View1>yub(y); GECODE_ME_CHECK_MODIFIED(modified,x[i].intersectI(home,yub)); } returnES_FIX; } //cardinalityrulesforPartitionNconstraint template<classView0,classView1> ExecStatus partitionNCard(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&unionOfDets){ unsignedintcardMinSum=unionOfDets.size(); unsignedintcardMaxSum=unionOfDets.size(); intxsize=x.size(); for(inti=xsize;i--;){ cardMinSum+=x[i].cardMin(); if(cardMinSum<x[i].cardMin()){ //sumofminsoverflows:failthespace. GECODE_ME_CHECK(ME_SET_FAILED); } } GECODE_ME_CHECK_MODIFIED(modified,y.cardMin(home,cardMinSum)); for(inti=xsize;i--;){ cardMaxSum+=x[i].cardMax(); if(cardMaxSum<x[i].cardMax()){ //sumofmaxesoverflows:nousefulinformationtotell. gotooverflow; } } GECODE_ME_CHECK_MODIFIED(modified,y.cardMax(home,cardMaxSum)); if(x.size()==0) returnES_NOFIX; overflow: //Cardinalityofeachx[i]limitedbycardinalityofyminusallx[j]s: { Regionr(home); unsignedint*rightMinSum=r.alloc<unsignedint>(xsize); unsignedint*rightMaxSum=r.alloc<unsignedint>(xsize); rightMinSum[xsize-1]=0; rightMaxSum[xsize-1]=0; for(inti=x.size()-1;i--;){ rightMaxSum[i]=rightMaxSum[i+1]+x[i+1].cardMax(); if(rightMaxSum[i]<rightMaxSum[i+1]){ //overflow,filltherestofthearray. for(intj=i;j>0;j--){ rightMaxSum[j]=Limits::card; } break; } } for(inti=x.size()-1;i--;){ rightMinSum[i]=rightMinSum[i+1]+x[i+1].cardMin(); if(rightMinSum[i]<rightMinSum[i+1]){ //overflow,failthespace GECODE_ME_CHECK(ME_SET_FAILED); } } unsignedintleftMinAcc=unionOfDets.size(); unsignedintleftMaxAcc=unionOfDets.size(); for(inti=0;i<xsize;i++){ unsignedintmaxSum=leftMaxAcc+rightMaxSum[i]; unsignedintminSum=leftMinAcc+rightMinSum[i]; //IfmaxSumdidnotoverflowandislessthany.cardMin: if(maxSum>=leftMaxAcc&&maxSum<y.cardMin()){ GECODE_ME_CHECK_MODIFIED(modified,x[i].cardMin(home,y.cardMin()-maxSum)); } //Overflow,fail. if(minSum<leftMinAcc||y.cardMax()<minSum){ GECODE_ME_CHECK(ME_SET_FAILED); } else{ GECODE_ME_CHECK_MODIFIED(modified,x[i].cardMax(home,y.cardMax()-minSum)); } leftMaxAcc+=x[i].cardMax(); if(leftMaxAcc<x[i].cardMax()) leftMaxAcc=Limits::card; leftMinAcc+=x[i].cardMin(); if(leftMinAcc<x[i].cardMin()) GECODE_ME_CHECK(ME_SET_FAILED); } } returnES_NOFIX; } //XiLBincludesYLBminusunionXjUB //XiUBissubsetofYUBminusunionofXjLBs template<classView0,classView1> ExecStatus partitionNXi(Space&home, bool&modified,ViewArray<View0>&x,View1&y){ intxsize=x.size(); Regionr(home); GLBndSet*afterUB= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); GLBndSet*afterLB= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); { GLBndSetsofarAfterUB; GLBndSetsofarAfterLB; for(inti=xsize;i--;){ new(&afterUB[i])GLBndSet(home); new(&afterLB[i])GLBndSet(home); afterUB[i].update(home,sofarAfterUB); afterLB[i].update(home,sofarAfterLB); LubRanges<View0>xiub(x[i]); GlbRanges<View0>xilb(x[i]); sofarAfterUB.includeI(home,xiub); sofarAfterLB.includeI(home,xilb); } sofarAfterUB.dispose(home); sofarAfterLB.dispose(home); } { GLBndSetsofarBeforeUB; GLBndSetsofarBeforeLB; for(inti=0;i<xsize;i++){ LubRanges<View1>yub(y); BndSetRangesslb(sofarBeforeLB); BndSetRangesafterlb(afterLB[i]); Iter::Ranges::Union<BndSetRanges, BndSetRanges>xjlb(slb,afterlb); Iter::Ranges::Diff<LubRanges<View1>, Iter::Ranges::Union<BndSetRanges, BndSetRanges>>diff1(yub,xjlb); GECODE_ME_CHECK_MODIFIED(modified,x[i].intersectI(home,diff1)); GlbRanges<View1>ylb(y); BndSetRangessub(sofarBeforeUB); BndSetRangesafterub(afterUB[i]); Iter::Ranges::Union<BndSetRanges, BndSetRanges>xjub(sub,afterub); Iter::Ranges::Diff<GlbRanges<View1>, Iter::Ranges::Union<BndSetRanges, BndSetRanges>>diff2(ylb,xjub); GECODE_ME_CHECK_MODIFIED(modified,x[i].includeI(home,diff2)); LubRanges<View0>xiub(x[i]); GlbRanges<View0>xilb(x[i]); sofarBeforeUB.includeI(home,xiub); sofarBeforeLB.includeI(home,xilb); } sofarBeforeLB.dispose(home); sofarBeforeUB.dispose(home); } for(inti=xsize;i--;){ afterUB[i].dispose(home); afterLB[i].dispose(home); } returnES_NOFIX; } //XiUBissubsetofYUBminusunionofXjLBs template<classView0,classView1> ExecStatus partitionNXiUB(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&unionOfDets){ intxsize=x.size(); Regionr(home); GLBndSet*afterLB= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); { GLBndSetsofarAfterLB; for(inti=xsize;i--;){ new(&afterLB[i])GLBndSet(home); afterLB[i].update(home,sofarAfterLB); GlbRanges<View0>xilb(x[i]); sofarAfterLB.includeI(home,xilb); } sofarAfterLB.dispose(home); } { GLBndSetsofarBeforeLB; sofarBeforeLB.update(home,unionOfDets); for(inti=0;i<xsize;i++){ LubRanges<View1>yub(y); BndSetRangesslb(sofarBeforeLB); BndSetRangesafterlb(afterLB[i]); Iter::Ranges::Union<BndSetRanges, BndSetRanges>xjlb(slb,afterlb); Iter::Ranges::Diff<LubRanges<View1>, Iter::Ranges::Union<BndSetRanges, BndSetRanges>>diff1(yub,xjlb); GECODE_ME_CHECK_MODIFIED(modified,x[i].intersectI(home,diff1)); GlbRanges<View0>xilb(x[i]); sofarBeforeLB.includeI(home,xilb); } sofarBeforeLB.dispose(home); } for(inti=xsize;i--;) afterLB[i].dispose(home); returnES_NOFIX; } //XiLBincludesYLBminusunionXjUB template<classView0,classView1> ExecStatus partitionNXiLB(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&unionOfDets){ intxsize=x.size(); Regionr(home); GLBndSet*afterUB= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); { GLBndSetsofarAfterUB; for(inti=xsize;i--;){ new(&afterUB[i])GLBndSet(home); afterUB[i].update(home,sofarAfterUB); LubRanges<View0>xiub(x[i]); sofarAfterUB.includeI(home,xiub); } sofarAfterUB.dispose(home); } { //Theunionofpreviouslydeterminedx[j]-sisaddedtothemixhere: GLBndSetsofarBeforeUB; sofarBeforeUB.update(home,unionOfDets); for(inti=0;i<xsize;i++){ GlbRanges<View1>ylb(y); BndSetRangessub(sofarBeforeUB); BndSetRangesafterub(afterUB[i]); Iter::Ranges::Union<BndSetRanges, BndSetRanges>xjub(sub,afterub); Iter::Ranges::Diff<GlbRanges<View1>, Iter::Ranges::Union<BndSetRanges, BndSetRanges>>diff2(ylb,xjub); GECODE_ME_CHECK_MODIFIED(modified,x[i].includeI(home,diff2)); LubRanges<View0>xiub(x[i]); sofarBeforeUB.includeI(home,xiub); } sofarBeforeUB.dispose(home); } for(inti=xsize;i--;) afterUB[i].dispose(home); returnES_NOFIX; } //YLBcontainsunionofXLBs template<classView0,classView1> ExecStatus partitionNYLB(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&unionOfDets){ assert(unionOfDets.isConsistent()); intxsize=x.size(); Regionr(home); GlbRanges<View0>*xLBs=r.alloc<GlbRanges<View0>>(xsize); intnonEmptyCounter=0; for(inti=xsize;i--;){ GlbRanges<View0>r(x[i]); if(r()){ xLBs[nonEmptyCounter]=r; nonEmptyCounter++; } } if(nonEmptyCounter!=0){ Iter::Ranges::NaryUnionxLBUnion(r,xLBs,nonEmptyCounter); BndSetRangesdets(unionOfDets); xLBUnion|=dets; GECODE_ME_CHECK_MODIFIED(modified,y.includeI(home,xLBUnion)); } returnES_FIX; } //YUBissubsetofunionofXUBs template<classView0,classView1> ExecStatus partitionNYUB(Space&home, bool&modified,ViewArray<View0>&x,View1&y, GLBndSet&unionOfDets){ intxsize=x.size(); Regionr(home); LubRanges<View0>*xUBs=r.alloc<LubRanges<View0>>(xsize); intnonEmptyCounter=0; for(inti=xsize;i--;){ LubRanges<View0>r(x[i]); if(r()){ xUBs[nonEmptyCounter]=r; nonEmptyCounter++; } } if(nonEmptyCounter!=0){ Iter::Ranges::NaryUnionxUBUnion(r,xUBs,nonEmptyCounter); BndSetRangesdets(unionOfDets); xUBUnion|=dets; GECODE_ME_CHECK_MODIFIED(modified,y.intersectI(home,xUBUnion)); } returnES_FIX; } }}} #endif //STATISTICS:set-prop