istringstream iss (tempBuf,istringstream::in);
delete buffer;
+ //read version
+ getline(iss); gobble(iss);
+
iss >> numNodes; gobble(iss);
tree.resize(numNodes);
MPI_File_close(&inMPI);
#else
+ //read version
+ string line = getline(in); gobble(in);
+
in >> numNodes; gobble(in);
tree.resize(numNodes);
#ifdef USE_MPI
int pid, num, processors;
- vector<long> positions;
+ vector<unsigned long int> positions;
MPI_Status status;
MPI_File inMPI;
//read in users taxonomy file and add sequences to tree
while(!in.eof()){
in >> name >> tax; gobble(in);
-
+
addSeqToTree(name, tax);
}
in.close();
#endif
-
+
assignHeirarchyIDs(0);
-
+
//create file for summary if needed
setUp(tfile);
}
if (pid == 0) { binUnclassified(taxFileNameTest); }
#else
- //create file needed for summary if it doesn't exist
- ifstream FileTest(taxFileNameTest.c_str());
-
- if (!FileTest) {
- binUnclassified(taxFileNameTest);
- }
+ binUnclassified(taxFileNameTest);
#endif
}
catch(exception& e) {
map<string, int>::iterator childPointer;
vector<TaxNode> copy = tree;
-
+
//fill out tree
fillOutTree(0, copy);
-
- //get leaf nodes that may need externsion
+
+ //get leaf nodes that may need extension
for (int i = 0; i < copy.size(); i++) {
if (copy[i].children.size() == 0) {
}
int copyNodes = copy.size();
-
+
//go through the seqs and if a sequence finest taxon is not the same level as the most finely defined taxon then classify it as unclassified where necessary
map<int, int>::iterator itLeaf;
for (itLeaf = leafNodes.begin(); itLeaf != leafNodes.end(); itLeaf++) {
int currentNode = itLeaf->second;
//this sequence is unclassified at some levels
- while(level <= maxLevel){
+ while(level < maxLevel){
level++;
/**************************************************************************************************/
void PhyloTree::fillOutTree(int index, vector<TaxNode>& copy) {
try {
+
map<string,int>::iterator it;
it = copy[index].children.find("unclassified");
copy[copy.size()-1].level = copy[index].level + 1;
}
- if (tree[index].level <= maxLevel) {
+ if (tree[index].level < maxLevel) {
for(it=tree[index].children.begin();it!=tree[index].children.end();it++){ //check your children
fillOutTree(it->second, copy);
}
}
-
+
}
catch(exception& e) {
m->errorOut(e, "PhyloTree", "fillOutTree");
void PhyloTree::print(ofstream& out, vector<TaxNode>& copy){
try {
+
+ //output mothur version
+ out << "#" << m->getVersion() << endl;
+
out << copy.size() << endl;
+ out << maxLevel << endl;
+
for (int i = 0; i < copy.size(); i++) {
out << copy[i].level << '\t'<< copy[i].name << '\t' << copy[i].children.size() << '\t';
ofstream outTree;
openOutputFile(treefilename, outTree);
+ //output mothur version
+ outTree << "#" << m->getVersion() << endl;
+
//print treenodes
outTree << tree.size() << endl;
for (int i = 0; i < tree.size(); i++) {