bab.hh gecode/search.hh gecode/search/support.hh gecode/search/worker.hh gecode/search/sequential/path.hh gecode/support/cast.hpp gecode/search/cutoff.hpp gecode/kernel/brancher-val-sel-commit.hpp gecode/support/static-stack.hpp gecode/kernel/var-imp.hpp gecode/support/random.hpp limits gecode/kernel/var.hpp gecode/support/thread/none.hpp iterator gecode/support/timer.hpp /usr/include/gecode/search/sequential/bab.hh gecode/support/thread/thread.hpp gecode/kernel/brancher-val-commit.hpp gecode/kernel/afc.hpp gecode/kernel/var-type.hpp gecode/support/hw-rnd.hpp cmath cassert gecode/kernel/brancher-view-sel.hpp gecode/kernel/allocators.hpp gecode/search.hh cstdarg gecode/support/bitset-base.hpp gecode/kernel/shared-array.hpp gecode/kernel/modevent.hpp gecode/search/bab.hpp gecode/kernel/memory-config.hpp gecode/support/int-type.hpp gecode/support/exception.hpp exception gecode/search/stop.hpp gecode/kernel/region.hpp gecode/support/marked-pointer.hpp gecode/support/thread.hpp gecode/kernel.hh gecode/kernel/branch-traits.hpp gecode/kernel/array.hpp gecode/kernel/branch-val.hpp gecode/search/dfs.hpp gecode/support/dynamic-stack.hpp gecode/kernel/archive.hpp gecode/kernel/range-list.hpp gecode/search/options.hpp gecode/kernel/brancher-merit.hpp gecode/support/config.hpp gecode/search/worker.hh gecode/kernel/branch-var.hpp gecode/kernel/memory-manager.hpp gecode/support/dynamic-queue.hpp gecode/kernel/macros.hpp ctime vector gecode/search/meta/rbs.hh gecode/kernel/advisor.hpp gecode/kernel/brancher-view-val.hpp sstream gecode/kernel/brancher-val-sel.hpp gecode/kernel/propagator.hpp gecode/support/block-allocator.hpp gecode/search/engine-base.hpp gecode/search/sequential/path.hh gecode/search/rbs.hpp gecode/kernel/activity.hpp cstdlib gecode/support/bitset.hpp gecode/support/auto-link.hpp iostream gecode/kernel/exception.hpp gecode/search/meta/nogoods.hh gecode/support/macros.hpp gecode/kernel/view.hpp gecode/kernel/branch-tiebreak.hpp cstddef climits gecode/search/exception.hpp gecode/kernel/core.hpp gecode/support.hh gecode/search/statistics.hpp gecode/support/dynamic-array.hpp gecode/support/sort.hpp gecode/kernel/rnd.hpp algorithm gecode/kernel/brancher-view.hpp gecode/kernel/global-afc.hpp gecode/search/support.hh cstring gecode/support/bitset-offset.hpp gecode/support/heap.hpp Gecode::Search::Sequential::BAB Gecode Gecode::Search Gecode::Search::Sequential /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Contributingauthors: *GuidoTack<tack@gecode.org> * *Copyright: *ChristianSchulte,2004 *GuidoTack,2004 * *Lastmodified: *$Date:2013-10-2416:42:20+0200(Thu,24Oct2013)$by$Author:schulte$ *$Revision:14030$ * *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. * */ #ifndef__GECODE_SEARCH_SEQUENTIAL_BAB_HH__ #define__GECODE_SEARCH_SEQUENTIAL_BAB_HH__ #include<gecode/search.hh> #include<gecode/search/support.hh> #include<gecode/search/worker.hh> #include<gecode/search/sequential/path.hh> namespaceGecode{namespaceSearch{namespaceSequential{ classBAB:publicWorker{ private: Optionsopt; Pathpath; Space*cur; unsignedintd; intmark; Space*best; public: BAB(Space*s,constOptions&o); Space*next(void); Statisticsstatistics(void)const; voidreset(Space*s); NoGoods&nogoods(void); ~BAB(void); }; forceinline BAB::BAB(Space*s,constOptions&o) :opt(o),path(static_cast<int>(opt.nogoods_limit)), d(0),mark(0),best(NULL){ if((s==NULL)||(s->status(*this)==SS_FAILED)){ fail++; cur=NULL; if(!o.clone) deletes; }else{ cur=snapshot(s,opt); } } forceinlineSpace* BAB::next(void){ /* *Theinvariantmaintainedbytheengineis: *Forallnodesstoredatadepthlessthanmark,there *isnoguaranteeofbetterness.Forthoseabovethemark, *betternessisguaranteed. * *Theenginemaintainsthepathonthestackforthecurrent *nodetobeexplored. * */ start(); while(true){ while(cur){ if(stop(opt)) returnNULL; node++; switch(cur->status(*this)){ caseSS_FAILED: fail++; deletecur; cur=NULL; break; caseSS_SOLVED: //Deletesallpendingbranchers (void)cur->choice(); deletebest; best=cur; cur=NULL; mark=path.entries(); returnbest->clone(); caseSS_BRANCH: { Space*c; if((d==0)||(d>=opt.c_d)){ c=cur->clone(); d=1; }else{ c=NULL; d++; } constChoice*ch=path.push(*this,cur,c); cur->commit(*ch,0); break; } default: GECODE_NEVER; } } //Recomputeandaddconstraintifnecessary do{ if(!path.next()) returnNULL; cur=path.recompute(d,opt.a_d,*this,best,mark); }while(cur==NULL); } GECODE_NEVER; returnNULL; } forceinlineStatistics BAB::statistics(void)const{ return*this; } forceinlinevoid BAB::reset(Space*s){ deletebest; best=NULL; path.reset(); d=mark=0U; deletecur; if((s==NULL)||(s->status(*this)==SS_FAILED)){ cur=NULL; }else{ cur=s; } Worker::reset(); } forceinlineNoGoods& BAB::nogoods(void){ returnpath; } forceinline BAB::~BAB(void){ path.reset(); deletebest; deletecur; } }}} #endif //STATISTICS:search-sequential