limits.hpp /usr/include/gecode/int.hh Gecode Gecode::Int /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2005 * *Lastmodified: *$Date:2013-02-1416:29:11+0100(Thu,14Feb2013)$by$Author:schulte$ *$Revision:13292$ * *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{ inlinebool Limits::valid(intn){ return((n>=min)&&(n<=max)); } inlinebool Limits::valid(longlongintn){ return((n>=min)&&(n<=max)); } inlinevoid Limits::check(intn,constchar*l){ if((n<min)||(n>max)) throwOutOfLimits(l); } inlinevoid Limits::check(longlongintn,constchar*l){ if((n<min)||(n>max)) throwOutOfLimits(l); } inlinevoid Limits::positive(intn,constchar*l){ if((n<=0)||(n>max)) throwOutOfLimits(l); } inlinevoid Limits::positive(longlongintn,constchar*l){ if((n<=0.0)||(n>max)) throwOutOfLimits(l); } inlinevoid Limits::nonnegative(intn,constchar*l){ if((n<0)||(n>max)) throwOutOfLimits(l); } inlinevoid Limits::nonnegative(longlongintn,constchar*l){ if((n<0.0)||(n>max)) throwOutOfLimits(l); } forceinlinebool Limits::overflow_add(intn,intm){ longlongintnm= static_cast<longlongint>(n)+static_cast<longlongint>(m); return(nm>INT_MAX)||(nm<INT_MIN+1); } forceinlinebool Limits::overflow_add(longlongintn,longlongintm){ if(m<0) returnn<LLONG_MIN+1-m; else returnn>LLONG_MAX-m; } forceinlinebool Limits::overflow_sub(intn,intm){ longlongintnm= static_cast<longlongint>(n)-static_cast<longlongint>(m); return(nm>INT_MAX)||(nm<INT_MIN+1); } forceinlinebool Limits::overflow_sub(longlongintn,longlongintm){ if(m<0) returnn>LLONG_MAX+m; else returnn<LLONG_MIN+1+m; } inlinebool Limits::overflow_mul(intn,intm){ longlongintnm= static_cast<longlongint>(n)*static_cast<longlongint>(m); return(nm>INT_MAX)||(nm<INT_MIN+1); } inlinebool Limits::overflow_mul(longlongintn,longlongintm){ //Checkwhetherwecanatleastchangethesign if((n==LLONG_MIN)||(m==LLONG_MIN)) returnfalse; unsignedlonglongintun= static_cast<unsignedlonglongint>(n<0?-n:n); unsignedlonglongintum= static_cast<unsignedlonglongint>(m<0?-m:m); constunsignedintk=CHAR_BIT*sizeof(int); unsignedlonglongintun_hi=un>>k; unsignedlonglongintun_lo=un&((1ULL<<k)-1ULL); unsignedlonglongintum_hi=um>>k; unsignedlonglongintum_lo=um&((1ULL<<k)-1ULL); //Thiswouldmeanthatthereissomethinglargerthan2^64 if((un_hi!=0ULL)&&(um_hi!=0ULL)) returntrue; unsignedlonglongintunm_hi=0ULL; //Now,eitherun_hiorm_hicanbedifferentfromzero if(un_hi!=0ULL) unm_hi=un_hi*um_lo; elseif(um_hi!=0ULL) unm_hi=um_hi*un_lo; else returnfalse; //Again,somethinglargerthan2^64 if((unm_hi>>k)!=0ULL) returntrue; unm_hi<<=k; unsignedlonglongintunm_lo=un_lo*um_lo; returnunm_hi>static_cast<unsignedlonglongint>(LLONG_MAX)-unm_lo; } }} //STATISTICS:int-var