mirror of
http://43.156.76.180:8026/YuuMJ/EukPhylo.git
synced 2025-12-28 06:30:25 +08:00
96 lines
2.2 KiB
C++
96 lines
2.2 KiB
C++
// $Id: Multinomial.h 409 2005-06-28 13:12:24Z ninio $
|
|
#ifndef __Multinomial_h
|
|
#define __Multinomial_h
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
#include <string>
|
|
using namespace std;
|
|
|
|
class tDirichletPrior;
|
|
|
|
#define MaxN 40
|
|
class tMultinomial {
|
|
//static const int MaxN = 40;
|
|
// const int MaxN = 40;
|
|
public:
|
|
//static void setMaxN(int n);
|
|
|
|
tMultinomial();
|
|
tMultinomial(int n);
|
|
tMultinomial(const vector<double>&, const bool isExp);
|
|
tMultinomial(const tMultinomial& );
|
|
tMultinomial operator=( const tMultinomial& );
|
|
bool operator==( const tMultinomial& ) const;
|
|
bool operator!=( const tMultinomial& )const;
|
|
|
|
double operator[]( int i ) const;
|
|
double& operator[]( int i );
|
|
|
|
int size() const;
|
|
void Normalize();
|
|
void NormalizeExp();
|
|
/**
|
|
* a simple method to compute the (complementary) normalized probbility ,
|
|
* when each value is given in it's log form , and we normlize by the (1-prob) of each value.
|
|
*/
|
|
void NormalizeCompExp();
|
|
//void getParams(int & n , double const * & p) const;
|
|
double const * getParams(int & n ) const;
|
|
|
|
friend ostream& operator<<(ostream &, tMultinomial const&);
|
|
|
|
void Read( istream& );
|
|
|
|
int MAP() const;
|
|
|
|
/**
|
|
* its the user reponsibility to use it on normallized dist only.
|
|
* also note the user should avoid using it with prob of 0 in one of the values.
|
|
* the multinomials themselves should be of the same size.
|
|
*/
|
|
double KL(tMultinomial const & m) const ;
|
|
|
|
friend class tDirichletPrior;
|
|
|
|
private:
|
|
int _n;
|
|
double _PR1[MaxN];
|
|
|
|
};
|
|
|
|
inline
|
|
double
|
|
tMultinomial::operator[]( int i ) const
|
|
{
|
|
return _PR1[i];
|
|
}
|
|
|
|
inline
|
|
double&
|
|
tMultinomial::operator[]( int i )
|
|
{
|
|
return _PR1[i];
|
|
}
|
|
|
|
inline
|
|
bool tMultinomial::operator==(tMultinomial const & m) const {
|
|
if(_n != m._n) return false;
|
|
for (int i =0;i<_n;i++)
|
|
if (_PR1[i]!=m._PR1[i]) return false;
|
|
return true;
|
|
}
|
|
|
|
inline
|
|
bool tMultinomial::operator!=(tMultinomial const & m) const {
|
|
return (! ((*this)==m) );
|
|
}
|
|
|
|
inline
|
|
int tMultinomial::size() const { return _n;}
|
|
|
|
inline
|
|
//void tMultinomial::getParams(int & n , double const * & p ) const { n=_n;p=_PR1;}
|
|
double const * tMultinomial::getParams(int & n ) const { n=_n;return _PR1;}
|
|
#endif
|