set-op.hpp /usr/include/gecode/int/sequence.hh /usr/include/gecode/int/sequence/set-op.hpp /usr/include/gecode/int/sequence.hh Gecode Gecode::Int Gecode::Int::Sequence /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2009 * *Lastmodified: *$Date:2010-03-0316:38:41+0100(Wed,03Mar2010)$ *$Revision:10359$ * *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{namespaceInt{namespaceSequence{ enumTakesStatus{ TS_NO, TS_YES, TS_MAYBE }; template<classView> forceinlineTakesStatus takes(constView&x,ints){ if(x.in(s)) returnx.assigned()?TS_YES:TS_MAYBE; else returnTS_NO; } template<classView> forceinlineTakesStatus takes(constView&x,constIntSet&s){ if((x.max()<s.min())||(x.min()>s.max())) returnTS_NO; ViewRanges<View>ix(x); IntSetRangesis(s); switch(Iter::Ranges::compare(ix,is)){ caseIter::Ranges::CS_SUBSET:returnTS_YES; caseIter::Ranges::CS_DISJOINT:returnTS_NO; caseIter::Ranges::CS_NONE:returnTS_MAYBE; default:GECODE_NEVER; } returnTS_MAYBE; } template<classView> forceinlinebool includes(constView&x,ints){ returnx.assigned()&&x.in(s); } template<classView> forceinlinebool includes(constView&x,constIntSet&s){ if((x.max()<s.min())||(x.min()>s.max())) returnfalse; ViewRanges<View>ix(x); IntSetRangesis(s); returnIter::Ranges::subset(ix,is); } template<classView> forceinlinebool excludes(constView&x,ints){ return!x.in(s); } template<classView> forceinlinebool excludes(constView&x,constIntSet&s){ if((x.max()<s.min())||(x.min()>s.max())) returntrue; ViewRanges<View>ix(x); IntSetRangesis(s); returnIter::Ranges::disjoint(ix,is); } template<classView> forceinlinebool undecided(constView&x,ints){ return!x.assigned()&&x.in(s); } template<classView> forceinlinebool undecided(constView&x,constIntSet&s){ if((x.max()<s.min())||(x.min()>s.max())) returnfalse; ViewRanges<View>ix(x); IntSetRangesis(s); returnIter::Ranges::compare(ix,is)==Iter::Ranges::CS_NONE; } template<classView> forceinlineModEvent include(Space&home,View&x,ints){ returnx.eq(home,s); } template<classView> forceinlineModEvent include(Space&home,View&x,constIntSet&s){ IntSetRangesis(s); returnx.inter_r(home,is,false); } template<classView> forceinlineModEvent exclude(Space&home,View&x,ints){ returnx.nq(home,s); } template<classView> forceinlineModEvent exclude(Space&home,View&x,constIntSet&s){ IntSetRangesis(s); returnx.minus_r(home,is,false); } }}} //STATISTICS:int-prop