libBM.cpp itpp/itbase.h libBM.h ../itpp_ext.h libBM.h ../itpp_ext.h work/git/mixpp/bdm/stat/libBM.cpp itpp/itbase.h int int RVcounter RVcounter 0 std::ostream & std::ostream& operator<< (std::ostream &os, const RV &rv) operator<< std::ostream & os const RV & rv RV RV concat (const RV &rv1, const RV &rv2) concat const RV & rv1 const RV & rv2 Concat two random variables. RV::add #include<itpp/itbase.h> #include"libBM.h" #include"../itpp_ext.h" usingnamespaceitpp; usingstd::cout; staticintRVcounter=0; voidRV::init(ivecin_ids,Array<std::string>in_names,ivecin_sizes,ivecin_times){ //Refer inti; len=in_ids.length(); //PRUDENT_MODE //Allvetorsshouldbeofsamelength if((len!=in_names.length())||\ (len!=in_sizes.length())||\ (len!=in_times.length())){ it_error("RV::RVinconsistentlengthofinputvectors."); } ids=in_ids; names=in_names; sizes=in_sizes; times=in_times; tsize=0; for(i=0;i<len;i++){tsize+=sizes(i);} }; RV::RV(Array<std::string>in_names,ivecin_sizes,ivecin_times){ intlen=in_names.length(); init(linspace(RVcounter+1,RVcounter+len),in_names,in_sizes,in_times); RVcounter+=len; } RV::RV(Array<std::string>in_names,ivecin_sizes){ intlen=in_names.length(); init(linspace(RVcounter+1,RVcounter+len),in_names,in_sizes,zeros_i(in_names.length())); RVcounter+=len; } RV::RV(Array<std::string>in_names){ intlen=in_names.length(); init(linspace(RVcounter+1,RVcounter+len),in_names,ones_i(in_names.length()),zeros_i(in_names.length())); RVcounter+=len; } RV::RV():tsize(0),len(0),ids(0),names(0),sizes(0),times(0){}; boolRV::add(constRV&rv2){ //TODO if(rv2.len>0){//rv2isnonempty ivecind=rv2.findself(*this);//shouldbe-1allthetime ivecindex=itpp::find(ind==-1); if(index.length()<rv2.len){//conflict ids=concat(ids,rv2.ids(index)); sizes=concat(sizes,rv2.sizes(index)); times=concat(times,rv2.times(index)); names=concat(names,rv2.names(to_Arr(index))); } else{ ids=concat(ids,rv2.ids); sizes=concat(sizes,rv2.sizes); times=concat(times,rv2.times); names=concat(names,rv2.names); } tsize=sum(sizes); len=ids.length(); return(index.length()<rv2.len); } else{//rv2isempty returntrue; } //return*this; }; //RV::RV(ivecin_ids){ // //len=in_ids.length(); //Array<std::string>A(len); //std::stringrvstr="rv"; // //for(inti=0;i<len;i++){ //A(i)=rvstr+to_str(i); //} // //init(in_ids,A,ones_i(len),zeros_i(len)); //} RVRV::subselect(ivecind)const{ RVret; ret.init(ids(ind),names(to_Arr(ind)),sizes(ind),times(ind)); returnret; } voidRV::t(intdelta){times+=delta;} RVRV::operator() (ivecind)const{ RVret; if(ind.length()>0){ ret.init(ids(ind),names(to_Arr(ind)),sizes(ind),times(ind)); } returnret; } boolRV::equal(constRV&rv2)const{ return(ids==rv2.ids)&&(times==rv2.times)&&(sizes==rv2.sizes); } matepdf::sampleN(intN)const{ matX=zeros(rv.count(),N); for(inti=0;i<N;i++)X.set_col(i,this->sample()); returnX; }; std::ostream&operator<<(std::ostream&os,constRV&rv){ for(inti=0;i<rv.len;i++){ os<<rv.ids(i)<<"("<<rv.sizes(i)<<")"<<//id(size)= "="<<rv.names(i)<<"_{"<<rv.times(i)<<"};";//name_{time} } returnos; } strRV::tostr()const{ ivecidlist(tsize); ivectmlist(tsize); inti; intpos=0; for(i=0;i<len;i++){ idlist.set_subvector(pos,pos+sizes(i)-1,ids(i)); tmlist.set_subvector(pos,pos+sizes(i)-1,times(i)); pos+=sizes(i); } returnstr(idlist,tmlist); } ivecRV::dataind(RVrv2)const{ strstr2=rv2.tostr(); ivecres(0); ivecpart; inti; for(i=0;i<len;i++){ part=itpp::find((str2.ids==ids(i))&(str2.times==times(i))); res=concat(res,part); } returnres; } RVRV::subt(constRVrv2)const{ cout<<*this<<endl; cout<<rv2<<endl; ivecres=this->findself(rv2);//nonzeros ivecvalid=itpp::find(res==-1);//-1=>valuenotfound=>itremains return(*this)(valid);//keepthosethatwerenotfoundinrv2 } ivecRV::findself(constRV&rv2)const{ inti,j; ivectmp=-ones_i(len); for(i=0;i<len;i++){ for(j=0;j<rv2.length();j++){ if((ids(i)==rv2.ids(j))&(times(i)==rv2.times(j))){ tmp(i)=j; break; } } } returntmp; } RVconcat(constRV&rv1,constRV&rv2){ RVpom=rv1; pom.add(rv2); returnpom; }