| 1 | #include "emix.h" |
|---|
| 2 | |
|---|
| 3 | namespace bdm{ |
|---|
| 4 | |
|---|
| 5 | void emix::set_parameters ( const vec &w0, const Array<epdf*> &Coms0, bool copy ) { |
|---|
| 6 | w = w0/sum ( w0 ); |
|---|
| 7 | dim = Coms0(0)->dimension(); |
|---|
| 8 | int i; |
|---|
| 9 | for ( i=0;i<w.length();i++ ) { |
|---|
| 10 | it_assert_debug ( dim== ( Coms0 ( i )->dimension() ),"Component sizes do not match!" ); |
|---|
| 11 | } |
|---|
| 12 | if ( copy ) { |
|---|
| 13 | Coms.set_length(Coms0.length()); |
|---|
| 14 | for ( i=0;i<w.length();i++ ) {it_error("Not imp..."); |
|---|
| 15 | *Coms ( i ) =*Coms0 ( i );} |
|---|
| 16 | destroyComs=true; |
|---|
| 17 | } |
|---|
| 18 | else { |
|---|
| 19 | Coms = Coms0; |
|---|
| 20 | destroyComs=false; |
|---|
| 21 | } |
|---|
| 22 | } |
|---|
| 23 | |
|---|
| 24 | vec emix::sample() const { |
|---|
| 25 | //Sample which component |
|---|
| 26 | vec cumDist = cumsum ( w ); |
|---|
| 27 | double u0; |
|---|
| 28 | #pragma omp critical |
|---|
| 29 | u0 = UniRNG.sample(); |
|---|
| 30 | |
|---|
| 31 | int i=0; |
|---|
| 32 | while ( ( cumDist ( i ) <u0 ) && ( i< ( w.length()-1 ) ) ) {i++;} |
|---|
| 33 | |
|---|
| 34 | return Coms ( i )->sample(); |
|---|
| 35 | } |
|---|
| 36 | |
|---|
| 37 | emix* emix::marginal(const RV &rv) const{ |
|---|
| 38 | it_assert_debug(isnamed(), "rvs are not assigned"); |
|---|
| 39 | |
|---|
| 40 | Array<epdf*> Cn(Coms.length()); |
|---|
| 41 | for(int i=0;i<Coms.length();i++){Cn(i)=Coms(i)->marginal(rv);} |
|---|
| 42 | emix* tmp = new emix(); |
|---|
| 43 | tmp->set_parameters(w,Cn,false); |
|---|
| 44 | tmp->ownComs(); |
|---|
| 45 | return tmp; |
|---|
| 46 | } |
|---|
| 47 | |
|---|
| 48 | mratio* emix::condition(const RV &rv) const{ |
|---|
| 49 | it_assert_debug(isnamed(), "rvs are not assigned"); |
|---|
| 50 | return new mratio(this,rv); |
|---|
| 51 | }; |
|---|
| 52 | |
|---|
| 53 | } |
|---|
| 54 | // mprod::mprod ( Array<mpdf*> mFacs, bool overlap) : mpdf ( RV(), RV() ), n ( mFacs.length() ), epdfs ( n ), mpdfs ( mFacs ), rvinds ( n ), rvcinrv ( n ), irvcs_rvc ( n ) { |
|---|
| 55 | // int i; |
|---|
| 56 | // bool rvaddok; |
|---|
| 57 | // // Create rv |
|---|
| 58 | // for ( i = 0;i < n;i++ ) { |
|---|
| 59 | // rvaddok=rv.add ( mpdfs ( i )->_rv() ); //add rv to common rvs. |
|---|
| 60 | // // If rvaddok==false, mpdfs overlap => assert error. |
|---|
| 61 | // it_assert_debug(rvaddok||overlap,"mprod::mprod() input mpdfs overlap in rv!"); |
|---|
| 62 | // epdfs ( i ) = & ( mpdfs ( i )->posterior() ); // add pointer to epdf |
|---|
| 63 | // }; |
|---|
| 64 | // // Create rvc |
|---|
| 65 | // for ( i = 0;i < n;i++ ) { |
|---|
| 66 | // rvc.add ( mpdfs ( i )->_rvc().subt ( rv ) ); //add rv to common rvs. |
|---|
| 67 | // }; |
|---|
| 68 | // |
|---|
| 69 | // // independent = true; |
|---|
| 70 | // //test rvc of mpdfs and fill rvinds |
|---|
| 71 | // for ( i = 0;i < n;i++ ) { |
|---|
| 72 | // // find ith rv in common rv |
|---|
| 73 | // rvsinrv ( i ) = mpdfs ( i )->_rv().dataind ( rv ); |
|---|
| 74 | // // find ith rvc in common rv |
|---|
| 75 | // rvcinrv ( i ) = mpdfs ( i )->_rvc().dataind ( rv ); |
|---|
| 76 | // // find ith rvc in common rv |
|---|
| 77 | // irvcs_rvc ( i ) = mpdfs ( i )->_rvc().dataind ( rvc ); |
|---|
| 78 | // // |
|---|
| 79 | // /* if ( rvcinrv ( i ).length() >0 ) {independent = false;} |
|---|
| 80 | // if ( irvcs_rvc ( i ).length() >0 ) {independent = false;}*/ |
|---|
| 81 | // } |
|---|
| 82 | // }; |
|---|
