gist.hpp /usr/include/gecode/gist.hh /usr/include/gecode/gist/mainwindow.hh /usr/include/gecode/gist/preferences.hh /usr/include/gecode/gist/qtgist.hh /usr/include/gecode/gist/treecanvas.hh /usr/include/gecode/gist/nodewidget.hh /usr/include/gecode/gist.hh /usr/include/gecode/gist/stopbrancher.hh /usr/include/gecode/gist/gist.hpp Gecode Gecode::Gist /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2006 * *Lastmodified: *$Date:2012-03-3005:58:02+0200(Fri,30Mar2012)$by$Author:tack$ *$Revision:12665$ * *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{namespaceGist{ template<classS> VarComparator<S>::VarComparator(std::stringname) :TextOutput(name){} template<classS> void VarComparator<S>::compare(constSpace&s0,constSpace&s1){ std::ostringstreamresult; dynamic_cast<constS&>(s0).compare(s1,result); if(result.str()!=""){ init(); addHtml("<pre>\n"); getStream()<<result.str()<<std::endl; addHtml("</pre><hr/>"); } } template<classS> std::string VarComparator<S>::name(void){ returnTextOutput::name(); } template<classS> void VarComparator<S>::finalize(void){ TextOutput::finalize(); } inlinestd::string Comparator::compare(std::stringx_n,IntVarx,IntVary){ IntVarRangesxr(x),yr(y); if(!Iter::Ranges::equal(xr,yr)){ std::ostringstreamret; ret<<x_n<<"="<<x<<"->"<<y; returnret.str(); } return""; } inlinestd::string Comparator::compare(std::stringx_n,BoolVarx,BoolVary){ if(!(x.min()==y.min()&&x.max()==y.max())){ std::ostringstreamret; ret<<x_n<<"="<<x<<"->"<<y; returnret.str(); } return""; } #ifdefGECODE_HAS_SET_VARS inlinestd::string Comparator::compare(std::stringx_n,SetVarx,SetVary){ SetVarGlbRangesxglbr(x),yglbr(y); SetVarLubRangesxlubr(x),ylubr(y); if(!(Iter::Ranges::equal(xglbr,yglbr)&& Iter::Ranges::equal(xlubr,ylubr)&& x.cardMin()==y.cardMin()&& y.cardMax()==y.cardMax())){ std::ostringstreamret; ret<<x_n<<"="<<x<<"->"<<y; returnret.str(); } return""; } #endif #ifdefGECODE_HAS_FLOAT_VARS inlinestd::string Comparator::compare(std::stringx_n,FloatVarx,FloatVary){ if(!(x.min()==y.min()&&x.max()==y.max())){ std::ostringstreamret; ret<<x_n<<"="<<x<<"->"<<y; returnret.str(); } return""; } #endif template<classVar> std::string Comparator::compare(std::stringx_n,constVarArgArray<Var>&x, constVarArgArray<Var>&y){ if(x.size()!=y.size()) return"Error:arraysizemismatch"; std::ostringstreamret; boolfirst=true; for(inti=0;i<x.size();i++){ std::ostringstreamxni; xni<<x_n<<"["<<i<<"]"; std::stringcmp=compare(xni.str(),x[i],y[i]); if(cmp!=""){ if(!first){ ret<<","; }else{ first=false; } ret<<cmp; } } returnret.str(); } template<classS> Print<S>::Print(conststd::string&name) :TextOutput(name){} template<classS> void Print<S>::inspect(constSpace&node){ init(); addHtml("<pre>\n"); dynamic_cast<constS&>(node).print(getStream()); flush(); addHtml("</pre><hr/>"); } template<classS> std::string Print<S>::name(void){ returnTextOutput::name(); } template<classS> void Print<S>::finalize(void){ TextOutput::finalize(); } forceinline Options::Options(void){} forceinline Options::_I::_I(void):_click(heap,1),n_click(0), _solution(heap,1),n_solution(0), _move(heap,1),n_move(0),_compare(heap,1),n_compare(0){} forceinlinevoid Options::_I::click(Inspector*i){ _click[static_cast<int>(n_click++)]=i; } forceinlinevoid Options::_I::solution(Inspector*i){ _solution[static_cast<int>(n_solution++)]=i; } forceinlinevoid Options::_I::move(Inspector*i){ _move[static_cast<int>(n_move++)]=i; } forceinlinevoid Options::_I::compare(Comparator*c){ _compare[static_cast<int>(n_compare++)]=c; } forceinlineInspector* Options::_I::click(unsignedinti)const{ return(i<n_click)?_click[i]:NULL; } forceinlineInspector* Options::_I::solution(unsignedinti)const{ return(i<n_solution)?_solution[i]:NULL; } forceinlineInspector* Options::_I::move(unsignedinti)const{ return(i<n_move)?_move[i]:NULL; } forceinlineComparator* Options::_I::compare(unsignedinti)const{ return(i<n_compare)?_compare[i]:NULL; } inlineint dfs(Space*root,constGist::Options&opt){ returnexplore(root,false,opt); } inlineint bab(Space*root,constGist::Options&opt){ returnGist::explore(root,true,opt); } }} //STATISTICS:gist-any