ranges-positive.hpp algorithm /usr/include/gecode/iter.hh /usr/include/gecode/iter/ranges-positive.hpp algorithm /usr/include/gecode/int/nvalues/int-base.hpp /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/view/scale.hpp /usr/include/gecode/int/div.hh /usr/include/gecode/int/arithmetic/mult.hpp /usr/include/gecode/flatzinc.hh /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/minimodel.hh /usr/include/gecode/int/dom/range.hpp /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/unary.hh /usr/include/gecode/int/no-overlap.hh /usr/include/gecode/int/support-values.hh /usr/include/gecode/int/cumulatives.hh /usr/include/gecode/set/channel.hh /usr/include/gecode/int/distinct.hh /usr/include/gecode/gist/mainwindow.hh /usr/include/gecode/set/rel.hh /usr/include/gecode/iter/ranges-positive.hpp /usr/include/gecode/set/int.hh /usr/include/gecode/gist/preferences.hh /usr/include/gecode/int/member/prop.hpp /usr/include/gecode/int/exec.hh /usr/include/gecode/int/rel.hh /usr/include/gecode/driver.hh /usr/include/gecode/int/arithmetic/nroot.hpp /usr/include/gecode/float.hh /usr/include/gecode/int/arithmetic/max.hpp /usr/include/gecode/int/member.hh /usr/include/gecode/flatzinc/parser.hh /usr/include/gecode/gist/qtgist.hh /usr/include/gecode/int/nvalues/bool-gq.hpp /usr/include/gecode/set/branch.hh /usr/include/gecode/int/count.hh /usr/include/gecode/gist/treecanvas.hh /usr/include/gecode/int/nvalues/int-gq.hpp /usr/include/gecode/int/count/rel.hpp /usr/include/gecode/set/element.hh /usr/include/gecode/set/distinct.hh /usr/include/gecode/set/rel-op.hh /usr/include/gecode/int/nvalues/int-lq.hpp /usr/include/gecode/int/element.hh /usr/include/gecode/int/channel.hh /usr/include/gecode/set/ldsb.hh /usr/include/gecode/gist/nodewidget.hh /usr/include/gecode/int/view.hpp /usr/include/gecode/int/bin-packing.hh /usr/include/gecode/int/bool.hh /usr/include/gecode/set/channel/int.hpp /usr/include/gecode/set/channel/sorted.hpp /usr/include/gecode/int/member/re-prop.hpp /usr/include/gecode/int/ldsb.hh /usr/include/gecode/gist.hh /usr/include/gecode/int/branch.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/bool/ite.hpp /usr/include/gecode/int/sequence.hh /usr/include/gecode/int/view-val-graph.hh /usr/include/gecode/int/linear/bool-int.hpp /usr/include/gecode/int/sorted/propagate.hpp /usr/include/gecode/float/rel.hh /usr/include/gecode/gist/stopbrancher.hh /usr/include/gecode/float/arithmetic.hh /usr/include/gecode/flatzinc/registry.hh /usr/include/gecode/int/gcc.hh /usr/include/gecode/set/int/minmax.hpp /usr/include/gecode/set/precede.hh /usr/include/gecode/float/linear.hh /usr/include/gecode/int/val-set.hh /usr/include/gecode/int.hh /usr/include/gecode/int/nvalues/bool-eq.hpp /usr/include/gecode/int/nvalues/bool-lq.hpp /usr/include/gecode/int/task.hh /usr/include/gecode/int/extensional.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/set/int/weights.hpp /usr/include/gecode/int/precede.hh /usr/include/gecode/int/nvalues/int-eq.hpp /usr/include/gecode/float/branch.hh /usr/include/gecode/set/sequence.hh /usr/include/gecode/set/int/card.hpp /usr/include/gecode/int/arithmetic/divmod.hpp /usr/include/gecode/int/linear.hh /usr/include/gecode/int/dom.hh /usr/include/gecode/set/channel/bool.hpp /usr/include/gecode/int/element/pair.hpp /usr/include/gecode/set.hh /usr/include/gecode/iter.hh /usr/include/gecode/int/circuit.hh /usr/include/gecode/set/rel-op/post.hpp /usr/include/gecode/int/arithmetic/pow.hpp /usr/include/gecode/set/convex.hh Gecode::Iter::Ranges::Positive Gecode Gecode::Iter Gecode::Iter::Ranges /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2008 * *Lastmodified: *$Date:2010-07-2817:35:33+0200(Wed,28Jul2010)$by$Author:schulte$ *$Revision:11294$ * *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. * */ #include<algorithm> namespaceGecode{namespaceIter{namespaceRanges{ template<classI,boolstrict=false> classPositive{ protected: Ii; public: Positive(void); Positive(I&i); voidinit(I&i); booloperator ()(void)const; voidoperator ++(void); intmin(void)const; intmax(void)const; unsignedintwidth(void)const; }; template<classI,boolstrict> forceinline Positive<I,strict>::Positive(void){} template<classI,boolstrict> forceinlinevoid Positive<I,strict>::init(I&i0){ i=i0; if(strict){ while(i()&&(i.max()<0))++i; }else{ while(i()&&(i.max()<=0))++i; } } template<classI,boolstrict> forceinline Positive<I,strict>::Positive(I&i){ init(i); } template<classI,boolstrict> forceinlinevoid Positive<I,strict>::operator ++(void){ ++i; } template<classI,boolstrict> forceinlinebool Positive<I,strict>::operator ()(void)const{ returni(); } template<classI,boolstrict> forceinlineint Positive<I,strict>::min(void)const{ if(strict){ returnstd::max(i.min(),1); }else{ returnstd::max(i.min(),0); } } template<classI,boolstrict> forceinlineint Positive<I,strict>::max(void)const{ returni.max(); } template<classI,boolstrict> forceinlineunsignedint Positive<I,strict>::width(void)const{ returnstatic_cast<unsignedint>(max()-min()+1); } }}} //STATISTICS:iter-any