ranges-map.hpp /usr/include/gecode/iter.hh /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/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/iter/ranges-map.hpp /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::Map Gecode::Iter::Ranges::Map< I, M, false > Gecode::Iter::Ranges::Map< I, M, true > 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. * */ namespaceGecode{namespaceIter{namespaceRanges{ template<classI,classM,boolstrict=true> classMap{ public: Map(void); Map(I&i); Map(I&i,constM&m); voidinit(I&i); voidinit(I&i,constM&m); booloperator ()(void)const; voidoperator ++(void); intmin(void)const; intmax(void)const; unsignedintwidth(void)const; }; template<classI,classM> classMap<I,M,false>:publicMinMax{ protected: Ii; Mm; voidnext(void); public: Map(void); Map(I&i); Map(I&i,constM&m); voidinit(I&i); voidinit(I&i,constM&m); voidoperator ++(void); }; template<classI,classM> classMap<I,M,true>{ protected: Ii; Mm; public: Map(void); Map(I&i); Map(I&i,constM&m); voidinit(I&i); voidinit(I&i,constM&m); booloperator ()(void)const; voidoperator ++(void); intmin(void)const; intmax(void)const; unsignedintwidth(void)const; }; template<classI,classM> forceinline Map<I,M,false>::Map(void){} template<classI,classM> forceinlinevoid Map<I,M,false>::next(void){ if(i()){ mi=m.min(i.min()); ma=m.max(i.max()); ++i; while(i()&&(ma+1>=m.min(i.min()))){ ma=m.max(i.max());++i; } }else{ finish(); } } template<classI,classM> forceinlinevoid Map<I,M,false>::init(I&i0){ i=i0;next(); } template<classI,classM> forceinlinevoid Map<I,M,false>::init(I&i0,constM&m0){ i=i0;m=m0;next(); } template<classI,classM> forceinline Map<I,M,false>::Map(I&i0):i(i0){ next(); } template<classI,classM> forceinline Map<I,M,false>::Map(I&i0,constM&m0):i(i0),m(m0){ next(); } template<classI,classM> forceinlinevoid Map<I,M,false>::operator ++(void){ next(); } template<classI,classM> forceinline Map<I,M,true>::Map(void){} template<classI,classM> forceinlinevoid Map<I,M,true>::init(I&i0){ i=i0; } template<classI,classM> forceinlinevoid Map<I,M,true>::init(I&i0,constM&m0){ i=i0;m=m0; } template<classI,classM> forceinline Map<I,M,true>::Map(I&i0):i(i0){} template<classI,classM> forceinline Map<I,M,true>::Map(I&i0,constM&m0):i(i0),m(m0){} template<classI,classM> forceinlinebool Map<I,M,true>::operator ()(void)const{ returni(); } template<classI,classM> forceinlinevoid Map<I,M,true>::operator ++(void){ ++i; } template<classI,classM> forceinlineint Map<I,M,true>::min(void)const{ returnm.min(i.min()); } template<classI,classM> forceinlineint Map<I,M,true>::max(void)const{ returnm.max(i.max()); } template<classI,classM> forceinlineunsignedint Map<I,M,true>::width(void)const{ returnstatic_cast<unsignedint>(max()-min())+1; } }}} //STATISTICS:iter-any