X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=removelineagecommand.cpp;h=ef1e77e01755f57acbaa4581c36a3e66d376c198;hb=a4f05f09c250323132a4b9427f41a3ededaec634;hp=893b2100cc60aeb26806a6b47620d3aca468f72d;hpb=264c8a3c759d9a999c485236e98dac98d4f0db5f;p=mothur.git diff --git a/removelineagecommand.cpp b/removelineagecommand.cpp index 893b210..ef1e77e 100644 --- a/removelineagecommand.cpp +++ b/removelineagecommand.cpp @@ -556,7 +556,7 @@ int RemoveLineageCommand::readTax(){ bool wroteSomething = false; bool taxonsHasConfidence = false; - vector< map > searchTaxons; + vector< map > searchTaxons; string noConfidenceTaxons = taxons; int hasConPos = taxons.find_first_of('('); if (hasConPos != string::npos) { @@ -618,7 +618,7 @@ int RemoveLineageCommand::readTax(){ if (pos != string::npos) { //if yes, then are the confidences okay bool remove = false; - vector< map > usersTaxon = getTaxons(newtax); + vector< map > usersTaxon = getTaxons(newtax); //the usersTaxon is most likely longer than the searchTaxons, and searchTaxon[0] may relate to userTaxon[4] //we want to "line them up", so we will find the the index where the searchstring starts @@ -686,10 +686,10 @@ int RemoveLineageCommand::readTax(){ } } /**************************************************************************************************/ -vector< map > RemoveLineageCommand::getTaxons(string tax) { +vector< map > RemoveLineageCommand::getTaxons(string tax) { try { - vector< map > t; + vector< map > t; string taxon = ""; int taxLength = tax.length(); for(int i=0;i > RemoveLineageCommand::getTaxons(string tax) { newtaxon = taxon; confidence = "0"; } - int con = 0; + float con = 0; convert(confidence, con); - map temp; + map temp; temp[newtaxon] = con; t.push_back(temp);