pow-ops.hpp /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/arithmetic/pow-ops.hpp Gecode Gecode::Int Gecode::Int::Arithmetic /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2012 * *Lastmodified: *$Date:2013-08-2220:55:38+0200(Thu,22Aug2013)$by$Author:schulte$ *$Revision:13987$ * *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{namespaceArithmetic{ forceinline PowOps::PowOps(intn0):n(n0){} forceinlinebool PowOps::even(intm){ return(m&1)==0; } forceinlinebool PowOps::even(void)const{ returneven(n); } forceinlineint PowOps::exp(void)const{ returnn; } forceinlinevoid PowOps::exp(intm){ n=m; } template<classIntType> inlineIntType PowOps::pow(IntTypex)const{ intm=n; IntTypep=1; do{ if(even(m)){ x*=x;m>>=1; }else{ p*=x;m--; } }while(m>0); returnp; } inlineint PowOps::tpow(int_x)const{ intm=n; longlongintp=1; longlongintx=_x; do{ if(even(m)){ x*=x;m>>=1; }else{ p*=x;m--; } if(p>Limits::max) returnLimits::max+1; if(p<Limits::min) returnLimits::min-1; }while(m>0); returnstatic_cast<int>(p); } forceinlinebool PowOps::powgr(longlongintr,intx)const{ assert(r>=0); intm=n; longlonginty=r; longlongintp=1; do{ if(even(m)){ y*=y;m>>=1; if(y>x) returntrue; }else{ p*=y;m--; if(p>x) returntrue; } }while(m>0); assert(y<=x); returnfalse; } inlineint PowOps::fnroot(intx)const{ if(x<2) returnx; /* *Welookforlsuchthat:l^n<=x<(l+1)^n */ longlongintl=1; longlongintu=x; do{ longlongintm=(l+u)>>1; if(powgr(m,x))u=m;elsel=m; }while(l+1<u); assert((pow(l)<=x)&&(x<pow(l+1))); returnstatic_cast<int>(l); } forceinlinebool PowOps::powle(longlongintr,intx)const{ assert(r>=0); intm=n; longlonginty=r; longlongintp=1; do{ if(even(m)){ y*=y;m>>=1; if(y>=x) returnfalse; }else{ p*=y;m--; if(p>=x) returnfalse; } }while(m>0); assert(y<x); returntrue; } inlineint PowOps::cnroot(intx)const{ if(x<2) returnx; /* *Welookforusuchthat:(u-1)^n<x<=u^n */ longlongintl=1; longlongintu=x; do{ longlongintm=(l+u)>>1; if(powle(m,x))l=m;elseu=m; }while(l+1<u); assert((pow(u-1)<x)&&(x<=pow(u))); returnstatic_cast<int>(u); } forceinlinebool SqrOps::even(void)const{ returntrue; } forceinlineint SqrOps::exp(void)const{ return2; } forceinlinevoid SqrOps::exp(int){ GECODE_NEVER; } template<classIntType> inlineIntType SqrOps::pow(IntTypex)const{ returnx*x; } inlineint SqrOps::tpow(int_x)const{ longlongintx=_x; if(x*x>Limits::max) returnLimits::max+1; if(x*x<Limits::min) returnLimits::min-1; returnstatic_cast<int>(x*x); } inlineint SqrOps::fnroot(intx)const{ if(x<2) returnx; /* *Welookforlsuchthat:l^2<=x<(l+1)^2 */ longlongintl=1; longlongintu=x; do{ longlongintm=(l+u)>>1; if(m*m>x)u=m;elsel=m; }while(l+1<u); assert((pow(l)<=x)&&(x<pow(l+1))); returnstatic_cast<int>(l); } inlineint SqrOps::cnroot(intx)const{ if(x<2) returnx; /* *Welookforusuchthat:(u-1)^n<x<=u^n */ longlongintl=1; longlongintu=x; do{ longlongintm=(l+u)>>1; if(m*m<x)l=m;elseu=m; }while(l+1<u); assert((pow(u-1)<x)&&(x<=pow(u))); returnstatic_cast<int>(u); } }}} //STATISTICS:int-other