X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=suffixtree.cpp;h=9cd835185c31a61bd024590f5a3fc7396d31610f;hp=fd18109513bea9f59590e16a1c705128f61ca43e;hb=050a3ff02473a3d4c0980964e1a9ebe52e55d6b8;hpb=d3aed959ca3b68890eeb7b815e24210bcfeb256c

diff --git a/suffixtree.cpp b/suffixtree.cpp
index fd18109..9cd8351 100644
--- a/suffixtree.cpp
+++ b/suffixtree.cpp
@@ -33,25 +33,6 @@ inline bool compareParents(SuffixNode* left, SuffixNode* right){//	this is neces
 	return (left->getParentNode() < right->getParentNode());	//	nodes in order of their parent
 }
 
-//********************************************************************************************************************
- 
-SuffixTree::SuffixTree(const SuffixTree& st) : root(st.root), activeEndPosition(st.activeEndPosition), activeStartPosition(st.activeStartPosition), activeNode(st.activeNode),
-												nodeCounter(st.nodeCounter), seqName(st.seqName), sequence(st.sequence) { 
-	try {
-		m = MothurOut::getInstance(); 
-		
-		for (int i = 0; i < st.nodeVector.size(); i++) {
-			SuffixNode* temp = new SuffixBranch(*((SuffixBranch*)st.nodeVector[i]));
-			nodeVector.push_back(temp);
-		}
-		
-		
-	}catch(exception& e) {
-		m->errorOut(e, "SuffixTree", "SuffixTree");
-		exit(1);
-	}
-}
- 
 //********************************************************************************************************************
 
 SuffixTree::SuffixTree(){ m = MothurOut::getInstance(); }