tuple-set.hpp sstream /usr/include/gecode/int.hh Gecode /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *MikaelLagerkvist<lagerkvist@gecode.org> * *Copyright: *MikaelLagerkvist,2007 * *Lastmodified: *$Date:2012-04-1102:34:42+0200(Wed,11Apr2012)$by$Author:tack$ *$Revision:12728$ * *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<sstream> namespaceGecode{ forceinlinebool TupleSet::TupleSetI::finalized(void)const{ assert(((excess==-1)&&(domsize>0))|| ((excess!=-1)&&(domsize==0))); returnexcess==-1; } forceinline TupleSet::TupleSetI::TupleSetI(void) :arity(-1), size(0), tuples(NULL), tuple_data(NULL), data(NULL), excess(0), min(Int::Limits::max), max(Int::Limits::min), domsize(0), last(NULL), nullpointer(NULL) {} template<classT> void TupleSet::TupleSetI::add(Tt){ assert(arity!=-1);//Arityhasbeenset assert(excess!=-1);//Tuplesmaystillbeadded if(excess==0)resize(); assert(excess>=0); --excess; intend=size*arity; for(inti=arity;i--;){ data[end+i]=t[i]; if(t[i]<min)min=t[i]; if(t[i]>max)max=t[i]; } ++size; } forceinline TupleSet::TupleSet(void){ } forceinline TupleSet::TupleSet(constTupleSet&ts) :SharedHandle(ts){} forceinlineTupleSet::TupleSetI* TupleSet::implementation(void){ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); returnimp; } inlinevoid TupleSet::add(constIntArgs&tuple){ TupleSetI*imp=static_cast<TupleSetI*>(object()); if(imp==NULL){ imp=newTupleSetI; object(imp); } assert(imp->arity==-1|| imp->arity==tuple.size()); imp->arity=tuple.size(); imp->add(tuple); } forceinlinevoid TupleSet::finalize(void){ TupleSetI*imp=static_cast<TupleSetI*>(object()); if(imp==NULL){ imp=newTupleSetI; imp->arity=0; imp->excess=-1; imp->domsize=1; imp->size=1; object(imp); } if(!imp->finalized()){ imp->finalize(); } } forceinlinebool TupleSet::finalized(void)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); returnimp->finalized(); } forceinlineint TupleSet::arity(void)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); assert(imp->arity!=-1); returnimp->arity; } forceinlineint TupleSet::tuples(void)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); assert(imp->finalized()); returnimp->size-1; } forceinlineTupleSet::Tuple TupleSet::operator [](inti)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); assert(imp->finalized()); returnimp->data+i*imp->arity; } forceinlineint TupleSet::min(void)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); assert(imp->finalized()); returnimp->min; } forceinlineint TupleSet::max(void)const{ TupleSetI*imp=static_cast<TupleSetI*>(object()); assert(imp); assert(imp->finalized()); returnimp->max; } template<classChar,classTraits,classT> std::basic_ostream<Char,Traits>& operator<<(std::basic_ostream<Char,Traits>&os,constTupleSet&ts){ std::basic_ostringstream<Char,Traits>s; s.copyfmt(os);s.width(0); s<<"Numberoftuples:"<<ts.tuples()<<std::endl <<"Tuples:"<<std::endl; for(inti=0;i<ts.tuples();++i){ s<<'\t'; for(intj=0;j<ts.arity();++j){ s.width(3); s<<""<<ts[i][j]; } s<<std::endl; } returnos<<s.str(); } } //STATISTICS:int-prop