X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=matrixoutputcommand.h;h=a19ffc813945e7d8b9ead51a716149881091ad2f;hp=dc77bdf067ff194dce8bd2e5fcb8f078a9450dcc;hb=b206f634aae1b4ce13978d203247fb64757d5482;hpb=43ed0accfbc2852849e104ff7eccdd2c42acd4ec

diff --git a/matrixoutputcommand.h b/matrixoutputcommand.h
index dc77bdf..a19ffc8 100644
--- a/matrixoutputcommand.h
+++ b/matrixoutputcommand.h
@@ -54,6 +54,8 @@
 #include "memchord.h"
 #include "memeuclidean.h"
 #include "mempearson.h"
+#include "sharedjsd.h"
+#include "sharedrjsd.h"
 
 
 // aka. dist.shared()
@@ -73,7 +75,9 @@ public:
 	vector<string> setParameters();
 	string getCommandName()			{ return "dist.shared";				}
 	string getCommandCategory()		{ return "OTU-Based Approaches";	}
+	
 	string getHelpString();	
+    string getOutputPattern(string);	
 	string getCitation() { return "http://www.mothur.org/wiki/Dist.shared"; }
 	string getDescription()		{ return "generate a distance matrix that describes the dissimilarity among multiple groups"; }
 
@@ -88,7 +92,7 @@ private:
 	};
 	vector<linePair> lines;
 	
-	void printSims(ostream&, vector< vector<float> >&);
+	void printSims(ostream&, vector< vector<double> >&);
 	int process(vector<SharedRAbundVector*>);
 	
 	vector<Calculator*> matrixCalculators;
@@ -96,12 +100,12 @@ private:
 	InputData* input;
 	vector<SharedRAbundVector*> lookup;
 	string exportFileName, output, sharedfile;
-	int numGroups, processors;
+	int numGroups, processors, iters, subsampleSize;
 	ofstream out;
 
-	bool abort, allLines;
+	bool abort, allLines, subsample;
 	set<string> labels; //holds labels to be used
-	string outputFile, calc, groups, label, outputDir;
+	string outputFile, calc, groups, label, outputDir, mode;
 	vector<string>  Estimators, Groups, outputNames; //holds estimators to be used
 	int process(vector<SharedRAbundVector*>, string, string);
 	int driver(vector<SharedRAbundVector*>, int, int, vector< vector<seqDist> >&);
@@ -119,6 +123,7 @@ struct distSharedData {
 	unsigned long long start;
 	unsigned long long end;
 	MothurOut* m;
+    int count;
 	
 	distSharedData(){}
 	distSharedData(MothurOut* mout, unsigned long long st, unsigned long long en, vector<string> est, vector<SharedRAbundVector*> lu) {
@@ -127,6 +132,7 @@ struct distSharedData {
 		end = en;
         Estimators = est;
         thisLookup = lu;
+        count = 0;
 	}
 };
 /**************************************************************************************************/
@@ -220,7 +226,12 @@ static DWORD WINAPI MyDistSharedThreadFunction(LPVOID lpParam){
                     matrixCalculators.push_back(new MemEuclidean());
                 }else if (pDataArray->Estimators[i] == "mempearson") { 
                     matrixCalculators.push_back(new MemPearson());
+                }else if (pDataArray->Estimators[i] == "jsd") {
+                    matrixCalculators.push_back(new JSD());
+                }else if (pDataArray->Estimators[i] == "rjsd") {
+                    matrixCalculators.push_back(new RJSD());
                 }
+
             }
         }
         
@@ -228,7 +239,7 @@ static DWORD WINAPI MyDistSharedThreadFunction(LPVOID lpParam){
         		
 		vector<SharedRAbundVector*> subset;
 		for (int k = pDataArray->start; k < pDataArray->end; k++) { // pass cdd each set of groups to compare
-			
+			pDataArray->count++;
 			for (int l = 0; l < k; l++) {
 				
 				if (k != l) { //we dont need to similiarity of a groups to itself