summaryrefslogtreecommitdiff
path: root/src/Collapse/test/collapse_unit_test.cpp
diff options
context:
space:
mode:
authorMarc Glisse <marc.glisse@inria.fr>2020-06-23 00:00:58 +0200
committerMarc Glisse <marc.glisse@inria.fr>2020-06-23 00:00:58 +0200
commite4e55054945ec25bba613bf9051b9dde0b09357e (patch)
tree04a4c3de8f6713e8b8052f89947287115fc18da7 /src/Collapse/test/collapse_unit_test.cpp
parent1fdaa406b6b0b85e409bd97090098ed5846c078c (diff)
Fix uses of emplace_back
Diffstat (limited to 'src/Collapse/test/collapse_unit_test.cpp')
-rw-r--r--src/Collapse/test/collapse_unit_test.cpp24
1 files changed, 12 insertions, 12 deletions
diff --git a/src/Collapse/test/collapse_unit_test.cpp b/src/Collapse/test/collapse_unit_test.cpp
index 67f1a732..108f77e4 100644
--- a/src/Collapse/test/collapse_unit_test.cpp
+++ b/src/Collapse/test/collapse_unit_test.cpp
@@ -54,7 +54,7 @@ void trace_and_check_collapse(const Filtered_edge_range& filtered_edges, const F
edge_collapser.process_edges(
[&remaining_edges](Vertex_handle u, Vertex_handle v, Filtration_value filtration) {
std::cout << "f[" << u << ", " << v << "] = " << filtration << std::endl;
- remaining_edges.emplace_back(Filtered_edge(u, v, filtration));
+ remaining_edges.emplace_back(u, v, filtration);
});
std::cout << "AFTER COLLAPSE - Total number of edges: " << remaining_edges.size() << std::endl;
BOOST_CHECK(remaining_edges.size() <= filtered_edges.size());
@@ -97,8 +97,8 @@ BOOST_AUTO_TEST_CASE(collapse) {
// |/ \|
// o---o
// 0 3
- edges.emplace_back(Filtered_edge(0, 2, 2.));
- edges.emplace_back(Filtered_edge(1, 3, 2.));
+ edges.emplace_back(0, 2, 2.);
+ edges.emplace_back(1, 3, 2.);
trace_and_check_collapse(edges, {{1, 3, 2.}});
// 1 2 4
@@ -108,9 +108,9 @@ BOOST_AUTO_TEST_CASE(collapse) {
// |/ \| |
// o---o---o
// 0 3 5
- edges.emplace_back(Filtered_edge(2, 4, 3.));
- edges.emplace_back(Filtered_edge(4, 5, 3.));
- edges.emplace_back(Filtered_edge(5, 3, 3.));
+ edges.emplace_back(2, 4, 3.);
+ edges.emplace_back(4, 5, 3.);
+ edges.emplace_back(5, 3, 3.);
trace_and_check_collapse(edges, {{1, 3, 2.}});
// 1 2 4
@@ -120,8 +120,8 @@ BOOST_AUTO_TEST_CASE(collapse) {
// |/ \|/ \|
// o---o---o
// 0 3 5
- edges.emplace_back(Filtered_edge(2, 5, 4.));
- edges.emplace_back(Filtered_edge(4, 3, 4.));
+ edges.emplace_back(2, 5, 4.);
+ edges.emplace_back(4, 3, 4.);
trace_and_check_collapse(edges, {{1, 3, 2.}, {4, 3, 4.}});
// 1 2 4
@@ -131,8 +131,8 @@ BOOST_AUTO_TEST_CASE(collapse) {
// |/ \|/ \|
// o---o---o
// 0 3 5
- edges.emplace_back(Filtered_edge(1, 5, 5.));
- edges.emplace_back(Filtered_edge(0, 4, 5.));
+ edges.emplace_back(1, 5, 5.);
+ edges.emplace_back(0, 4, 5.);
trace_and_check_collapse(edges, {{1, 3, 2.}, {4, 3, 4.}, {0, 4, 5.}});
}
@@ -179,7 +179,7 @@ BOOST_AUTO_TEST_CASE(collapse_from_proximity_graph) {
edge_collapser.process_edges(
[&remaining_edges](Vertex_handle u, Vertex_handle v, Filtration_value filtration) {
std::cout << "f[" << u << ", " << v << "] = " << filtration << std::endl;
- remaining_edges.emplace_back(Filtered_edge(u, v, filtration));
+ remaining_edges.emplace_back(u, v, filtration);
});
BOOST_CHECK(remaining_edges.size() == 5);
@@ -194,4 +194,4 @@ BOOST_AUTO_TEST_CASE(collapse_from_proximity_graph) {
}
BOOST_CHECK(filtration_is_edge_length_nb == 4);
BOOST_CHECK(filtration_is_diagonal_length_nb == 1);
-} \ No newline at end of file
+}