From 9768bbe02ab26be28a33ce59fc8480bb1317b5f9 Mon Sep 17 00:00:00 2001
From: Thomas Fischer <thomas.fischer@ufz.de>
Date: Wed, 21 Oct 2015 09:58:55 +0200
Subject: [PATCH] [SimpleTests/MeshTests] Fix compiling error in
MeshSearchTest.
---
SimpleTests/MeshTests/MeshSearchTest.cpp | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/SimpleTests/MeshTests/MeshSearchTest.cpp b/SimpleTests/MeshTests/MeshSearchTest.cpp
index 30d9904627d..1fc453f9e7a 100644
--- a/SimpleTests/MeshTests/MeshSearchTest.cpp
+++ b/SimpleTests/MeshTests/MeshSearchTest.cpp
@@ -56,7 +56,7 @@ void testMeshGridAlgorithm(MeshLib::Mesh const*const mesh,
INFO ("[MeshGridAlgorithm] searching %d points ...", pnts_for_search.size());
clock_t start = clock();
for (std::size_t k(0); k<n_pnts_for_search; k++) {
- MeshLib::Node const* node(mesh_grid.getNearestPoint(*pnts_for_search[k]));
+ MeshLib::Node const* node(mesh_grid.getNearestPoint(*(pnts_for_search[k])));
idx_found_nodes.push_back(node->getID());
}
clock_t stop = clock();
@@ -80,7 +80,7 @@ void testMeshGridAlgorithm(MeshLib::Mesh const*const mesh,
INFO ("[MeshGridAlgorithm] searching %d points ...", pnts_for_search.size());
clock_t start = clock();
for (std::size_t k(0); k<n_pnts_for_search; k++) {
- MeshLib::Node const* node(mesh_grid.getNearestPoint(pnts_for_search[k]));
+ MeshLib::Node const* node(mesh_grid.getNearestPoint(*(pnts_for_search[k])));
idx_found_nodes.push_back(node->getID());
}
clock_t stop = clock();
@@ -135,7 +135,7 @@ int main(int argc, char *argv[])
std::vector<GeoLib::Point*> pnts_for_search;
unsigned n(std::min(static_cast<unsigned>(nodes.size()), number_arg.getValue()));
for (std::size_t k(0); k<n; k++) {
- pnts_for_search.push_back(new GeoLib::Point(nodes[k]));
+ pnts_for_search.push_back(new GeoLib::Point(*(nodes[k]), k));
}
std::vector<std::size_t> idx_found_nodes;
--
GitLab