Loading CMakeLists.txt +1 −1 Original line number Diff line number Diff line Loading @@ -51,7 +51,7 @@ add_definitions(-DIQ_TREE) # The version number. set (iqtree_VERSION_MAJOR 1) set (iqtree_VERSION_MINOR 6) set (iqtree_VERSION_PATCH "8") set (iqtree_VERSION_PATCH "9") set(BUILD_SHARED_LIBS OFF) Loading README.md +3 −0 Original line number Diff line number Diff line IQ-TREE ======= [](https://travis-ci.org/bqminh/IQ-TREE) [](https://www.gnu.org/licenses/old-licenses/gpl-2.0.en.html) Efficient and versatile phylogenomic software by maximum likelihood <http://www.iqtree.org> Introduction Loading alignment/superalignment.cpp +7 −2 Original line number Diff line number Diff line Loading @@ -1008,6 +1008,9 @@ void SuperAlignment::createBootstrapAlignment(int *pattern_freq, const char *spe // resampling sites within genes int offset = 0; for (vector<Alignment*>::iterator it = partitions.begin(); it != partitions.end(); it++) { if (spec && strncmp(spec, "SCALE=", 6) == 0) (*it)->createBootstrapAlignment(pattern_freq + offset, spec, rstream); else (*it)->createBootstrapAlignment(pattern_freq + offset, NULL, rstream); offset += (*it)->getNPattern(); } Loading Loading @@ -1259,11 +1262,12 @@ Alignment *SuperAlignment::concatenateAlignments(set<int> &ids) { Alignment *SuperAlignment::concatenateAlignments() { vector<SeqType> seq_types; vector<char*> genetic_codes; vector<set<int> > ids; for (int i = 0; i < partitions.size(); i++) { bool found = false; for (int j = 0; j < seq_types.size(); j++) if (partitions[i]->seq_type == seq_types[j]) { if (partitions[i]->seq_type == seq_types[j] && partitions[i]->genetic_code == genetic_codes[j]) { ids[j].insert(i); found = true; break; Loading @@ -1272,6 +1276,7 @@ Alignment *SuperAlignment::concatenateAlignments() { continue; // create a new partition seq_types.push_back(partitions[i]->seq_type); genetic_codes.push_back(partitions[i]->genetic_code); ids.push_back(set<int>()); ids.back().insert(i); } Loading nclextra/msetsblock.cpp +8 −0 Original line number Diff line number Diff line Loading @@ -267,6 +267,9 @@ void MSetsBlock::Read(NxsToken &token) else { errormsg = "Unknown command "; errormsg += token.GetToken(); throw NxsException(errormsg, token.GetFilePosition(), token.GetFileLine(), token.GetFileColumn()); SkippingCommand(token.GetToken()); do { Loading @@ -284,6 +287,11 @@ void MSetsBlock::Read(NxsToken &token) } void MSetsBlock::SkippingCommand(NxsString commandName) { cout << "WARNING: Skipping unknown command " << commandName << endl; } CharSet *MSetsBlock::findCharSet(string name) { for (vector<CharSet*>::iterator it = charsets.begin(); it != charsets.end(); it++) if ((*it)->name == name) return (*it); Loading nclextra/msetsblock.h +6 −0 Original line number Diff line number Diff line Loading @@ -95,6 +95,12 @@ public: */ virtual void Reset(); /** called when some commands are skipped @param commandName command name */ virtual void SkippingCommand(NxsString commandName); /** @return the number of sets */ Loading Loading
CMakeLists.txt +1 −1 Original line number Diff line number Diff line Loading @@ -51,7 +51,7 @@ add_definitions(-DIQ_TREE) # The version number. set (iqtree_VERSION_MAJOR 1) set (iqtree_VERSION_MINOR 6) set (iqtree_VERSION_PATCH "8") set (iqtree_VERSION_PATCH "9") set(BUILD_SHARED_LIBS OFF) Loading
README.md +3 −0 Original line number Diff line number Diff line IQ-TREE ======= [](https://travis-ci.org/bqminh/IQ-TREE) [](https://www.gnu.org/licenses/old-licenses/gpl-2.0.en.html) Efficient and versatile phylogenomic software by maximum likelihood <http://www.iqtree.org> Introduction Loading
alignment/superalignment.cpp +7 −2 Original line number Diff line number Diff line Loading @@ -1008,6 +1008,9 @@ void SuperAlignment::createBootstrapAlignment(int *pattern_freq, const char *spe // resampling sites within genes int offset = 0; for (vector<Alignment*>::iterator it = partitions.begin(); it != partitions.end(); it++) { if (spec && strncmp(spec, "SCALE=", 6) == 0) (*it)->createBootstrapAlignment(pattern_freq + offset, spec, rstream); else (*it)->createBootstrapAlignment(pattern_freq + offset, NULL, rstream); offset += (*it)->getNPattern(); } Loading Loading @@ -1259,11 +1262,12 @@ Alignment *SuperAlignment::concatenateAlignments(set<int> &ids) { Alignment *SuperAlignment::concatenateAlignments() { vector<SeqType> seq_types; vector<char*> genetic_codes; vector<set<int> > ids; for (int i = 0; i < partitions.size(); i++) { bool found = false; for (int j = 0; j < seq_types.size(); j++) if (partitions[i]->seq_type == seq_types[j]) { if (partitions[i]->seq_type == seq_types[j] && partitions[i]->genetic_code == genetic_codes[j]) { ids[j].insert(i); found = true; break; Loading @@ -1272,6 +1276,7 @@ Alignment *SuperAlignment::concatenateAlignments() { continue; // create a new partition seq_types.push_back(partitions[i]->seq_type); genetic_codes.push_back(partitions[i]->genetic_code); ids.push_back(set<int>()); ids.back().insert(i); } Loading
nclextra/msetsblock.cpp +8 −0 Original line number Diff line number Diff line Loading @@ -267,6 +267,9 @@ void MSetsBlock::Read(NxsToken &token) else { errormsg = "Unknown command "; errormsg += token.GetToken(); throw NxsException(errormsg, token.GetFilePosition(), token.GetFileLine(), token.GetFileColumn()); SkippingCommand(token.GetToken()); do { Loading @@ -284,6 +287,11 @@ void MSetsBlock::Read(NxsToken &token) } void MSetsBlock::SkippingCommand(NxsString commandName) { cout << "WARNING: Skipping unknown command " << commandName << endl; } CharSet *MSetsBlock::findCharSet(string name) { for (vector<CharSet*>::iterator it = charsets.begin(); it != charsets.end(); it++) if ((*it)->name == name) return (*it); Loading
nclextra/msetsblock.h +6 −0 Original line number Diff line number Diff line Loading @@ -95,6 +95,12 @@ public: */ virtual void Reset(); /** called when some commands are skipped @param commandName command name */ virtual void SkippingCommand(NxsString commandName); /** @return the number of sets */ Loading