Unverified Commit d941908d authored by Fedor Scholz's avatar Fedor Scholz
Browse files

reformat

parent 28453b5c
......@@ -63,7 +63,8 @@ std::vector<struct supertree_node*> construct_supertree(index, const constraints
/**
* Generate the supertree given a vector of indices and a vector of contraints.
*/
std::vector<struct supertree_node*> construct_supertree(const std::vector<index>&, const constraints&);
std::vector<struct supertree_node*> construct_supertree(const std::vector<index>&,
const constraints&);
} // namespace terraces
......
......@@ -147,7 +147,8 @@ std::vector<struct supertree_node*> construct_supertree(index number, const cons
return construct_supertree(leaves, c);
}
std::vector<struct supertree_node*> construct_supertree(const std::vector<index>& leaves, const constraints& c) {
std::vector<struct supertree_node*> construct_supertree(const std::vector<index>& leaves,
const constraints& c) {
std::vector<struct supertree_node*> list;
if (leaves.size() == 1) {
......
......@@ -16,7 +16,6 @@ TEST_CASE("bipartition1", "[bipartition]") {
CHECK(bip_it.get_bipartition() == res.at(1));
bip_it.increase();
CHECK(bip_it.get_bipartition() == res.at(2));
bip_it.increase();
}
} // namespace tests
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment