1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
/*
* heip.cpp
* Mothur
*
* Created by Pat Schloss on 8/21/10.
* Copyright 2010 Schloss Lab. All rights reserved.
*
*/
#include "heip.h"
#include "shannon.h"
/***********************************************************************/
EstOutput Heip::getValues(SAbundVector* rank){
try {
data.resize(1,0.0000);
vector<double> shanData(3,0);
Shannon* shannon = new Shannon();
shanData = shannon->getValues(rank);
long int sobs = rank->getNumBins();
if(sobs > 1){
data[0] = (exp(shanData[0])-1) / (sobs - 1);;
}
else{
data[0] = 1;
}
delete shannon;
return data;
}
catch(exception& e) {
m->errorOut(e, "Heip", "getValues");
exit(1);
}
}
/***********************************************************************/
|
