array.hpp /usr/include/gecode/int.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/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/array.hpp /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/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 /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2005 * *Lastmodified: *$Date:2012-03-3001:56:07+0200(Fri,30Mar2012)$by$Author:tack$ *$Revision:12663$ * *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{ /* *Implementation * */ forceinline IntArgs::IntArgs(void):PrimArgArray<int>(0){} forceinline IntArgs::IntArgs(intn):PrimArgArray<int>(n){} forceinline IntArgs::IntArgs(constSharedArray<int>&x) :PrimArgArray<int>(x.size()){ for(inti=x.size();i--;) a[i]=x[i]; } forceinline IntArgs::IntArgs(conststd::vector<int>&x) :PrimArgArray<int>(x){} template<classInputIterator> forceinline IntArgs::IntArgs(InputIteratorfirst,InputIteratorlast) :PrimArgArray<int>(first,last){} forceinline IntArgs::IntArgs(intn,constint*e):PrimArgArray<int>(n,e){} forceinline IntArgs::IntArgs(constPrimArgArray<int>&a):PrimArgArray<int>(a){} forceinlineIntArgs IntArgs::create(intn,intstart,intinc){ IntArgsr(n); for(inti=0;i<n;i++,start+=inc) r[i]=start; returnr; } forceinline IntVarArray::IntVarArray(void){} forceinline IntVarArray::IntVarArray(Space&home,intn) :VarArray<IntVar>(home,n){} forceinline IntVarArray::IntVarArray(constIntVarArray&a) :VarArray<IntVar>(a){} forceinline IntVarArray::IntVarArray(Space&home,constIntVarArgs&a) :VarArray<IntVar>(home,a){} forceinline BoolVarArray::BoolVarArray(void){} forceinline BoolVarArray::BoolVarArray(Space&home,intn) :VarArray<BoolVar>(home,n){} forceinline BoolVarArray::BoolVarArray(constBoolVarArray&a) :VarArray<BoolVar>(a){} forceinline BoolVarArray::BoolVarArray(Space&home,constBoolVarArgs&a) :VarArray<BoolVar>(home,a){} } //STATISTICS:int-other