From e13a5645991253ac689ac4052f15935fcd8fd4e5 Mon Sep 17 00:00:00 2001
From: Dmitri Naumov <dmitri.naumov@ufz.de>
Date: Thu, 10 Aug 2017 17:36:22 +0200
Subject: [PATCH] [T] Clarify the next neighbor search fct. name.
---
Tests/MeshLib/TestFindElementsWithinRadius.cpp | 6 ++++--
1 file changed, 4 insertions(+), 2 deletions(-)
diff --git a/Tests/MeshLib/TestFindElementsWithinRadius.cpp b/Tests/MeshLib/TestFindElementsWithinRadius.cpp
index 25969d087dc..2d3d66b7ee6 100644
--- a/Tests/MeshLib/TestFindElementsWithinRadius.cpp
+++ b/Tests/MeshLib/TestFindElementsWithinRadius.cpp
@@ -53,7 +53,8 @@ std::vector<std::size_t> findElementIdsConnectedToNode(Node const& node)
}
// Find all elements connected through all nodes of the element
-std::vector<std::size_t> findByNodeConnectedElements(Element const& element)
+std::vector<std::size_t> findNextNeighborsConnectedByNode(
+ Element const& element)
{
std::vector<std::size_t> connected_elements;
for (unsigned n = 0; n < element.getNumberOfBaseNodes(); ++n)
@@ -135,7 +136,8 @@ TEST_F(MeshLibFindElementWithinRadius, VerySmallRadius)
auto result = findElementsWithinRadius(element, 1e-5);
std::sort(std::begin(result), std::end(result));
- auto const expected_elements = findByNodeConnectedElements(element);
+ auto const expected_elements =
+ findNextNeighborsConnectedByNode(element);
return result.size() == expected_elements.size() &&
std::includes(std::begin(result), std::end(result),
--
GitLab