X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=tree.h;fp=tree.h;h=40ae14f8615651693985b8f7249c4098cde7f07b;hb=e98d56be8369a799e61a411bc13d3bd1fa3451e5;hp=0660e8a181632ae09668d1484236276e5898ed39;hpb=0caf3fbabaa3ece404f8ce77f4c883dc5b1bf1dc;p=mothur.git

diff --git a/tree.h b/tree.h
index 0660e8a..40ae14f 100644
--- a/tree.h
+++ b/tree.h
@@ -24,6 +24,7 @@ public:
 	
     TreeMap* getTreeMap() { return tmap; }
 	void getCopy(Tree*);  //makes tree a copy of the one passed in.
+    void getCopy(Tree* copy, map<string, string>, vector<string>); //makes a copy of the tree passed in, but everyone who is not in the vector<string> has group set to doNotIncludeMe. Assumes the tmap already has these seqs group set to doNotIncludeMe.
 	void getSubTree(Tree*, vector<string>);  //makes tree a that contains only the names passed in.
     int getSubTree(Tree* originalToCopy, vector<string> seqToInclude, map<string, string> nameMap);  //used with (int, TreeMap) constructor. SeqsToInclude contains subsample wanted - assumes these are unique seqs and size of vector=numLeaves passed into constructor. nameMap is unique -> redundantList can be empty if no namesfile was provided.