X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=weighted.h;h=d4082fe9c82a7aeeb41aeaad62f016d0ec588d4d;hb=cc19310422f125d6628980bd1148e1e816792382;hp=c23a11599b4b8d74fdfacd05a5a02ae727834455;hpb=ca9ac1d80c62f57270b0dcd49410ebe08a8aecd6;p=mothur.git

diff --git a/weighted.h b/weighted.h
index c23a115..d4082fe 100644
--- a/weighted.h
+++ b/weighted.h
@@ -12,14 +12,14 @@
  */
 
 #include "treecalculator.h"
-#include "treemap.h"
+#include "counttable.h"
 
 /***********************************************************************/
 
 class Weighted : public TreeCalculator  {
 	
 	public:
-		Weighted(TreeMap* t, bool r) : tmap(t), includeRoot(r) {};
+        Weighted( bool r) : includeRoot(r) {};
 		~Weighted() {};
 		
 		EstOutput getValues(Tree*, string, string);
@@ -34,7 +34,6 @@ class Weighted : public TreeCalculator  {
 		vector<linePair> lines;
 
 		EstOutput data;
-		TreeMap* tmap;
 		map<string, int>::iterator it;
 		map<string, double> WScore; //a score for each group combination i.e. AB, AC, BC.
 		int processors;
@@ -42,8 +41,8 @@ class Weighted : public TreeCalculator  {
 		map< vector<string>, set<int> > rootForGrouping;  //maps a grouping combo to the root for that combo
 		bool includeRoot;
 		
-		EstOutput driver(Tree*, vector< vector<string> >, int, int); 
-		EstOutput createProcesses(Tree*, vector< vector<string> >);
+		EstOutput driver(Tree*, vector< vector<string> >, int, int, CountTable*); 
+		EstOutput createProcesses(Tree*, vector< vector<string> >, CountTable*);
 		double getLengthToRoot(Tree*, int, string, string);
 };