X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;ds=sidebyside;f=sharedchao1.h;fp=sharedchao1.h;h=0000000000000000000000000000000000000000;hb=4a877efa127e56e81a21f53cfdbbfd3bfbe8c4ff;hp=ae07a8706c30fa76d1b2c975db417201a9470b5f;hpb=a6cf29fa4dac0909c7582cb1094151d34093ee76;p=mothur.git

diff --git a/sharedchao1.h b/sharedchao1.h
deleted file mode 100644
index ae07a87..0000000
--- a/sharedchao1.h
+++ /dev/null
@@ -1,49 +0,0 @@
-#ifndef SHAREDCHAO1_H
-#define SHAREDCHAO1_H
-/*
- *  sharedchao1.h
- *  Dotur
- *
- *  Created by Sarah Westcott on 1/8/09.
- *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
- *
- */
-
-/* This class implements the Sharedchao1 estimator on two groups. 
-It is a child of the calculator class. */
-
-
-#include "calculator.h"
-
-/***********************************************************************/
-
-
-class SharedChao1 : public Calculator  {
-	
-	public: 
-		SharedChao1() : Calculator("sharedchao", 1, true) {};
-		EstOutput getValues(SAbundVector*) {return data;};
-		EstOutput getValues(vector<SharedRAbundVector*>);
-		string getCitation() { return "http://www.mothur.org/wiki/Sharedchao"; }
-	private:
-		IntNode* f1root;
-		IntNode* f2root;
-		vector<IntNode*> f1leaves;
-		vector<IntNode*> f2leaves;
-		int numLeaves;
-		int numNodes;
-
-		void initialTree(int);  //builds trees structure with n leaf nodes initialized to 0.
-		void setCoef(IntNode*, int);
-		void updateTree(vector<int>); //take vector containing the abundance info. for a bin and updates trees.
-		void updateBranchf1(IntNode*, vector<int>, int);  //pointer, vector of abundance values, index into vector
-		void updateBranchf2(IntNode*, vector<int>, int);  //pointer, vector of abundance values, index into vector
-		
-		//for debugging
-		void printTree();
-		void printBranch(IntNode*);
-};
-
-/***********************************************************************/
-
-#endif