Update Kokkos library in LAMMPS to v3.6.0

lib/kokkos/algorithms/unit_tests/TestStdAlgorithmsFind.cpp

@@ -0,0 +1,191 @@
+/*
+//@HEADER
+// ************************************************************************
+//
+//                        Kokkos v. 3.0
+//       Copyright (2020) National Technology & Engineering
+//               Solutions of Sandia, LLC (NTESS).
+//
+// Under the terms of Contract DE-NA0003525 with NTESS,
+// the U.S. Government retains certain rights in this software.
+//
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// 1. Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+//
+// 2. Redistributions in binary form must reproduce the above copyright
+// notice, this list of conditions and the following disclaimer in the
+// documentation and/or other materials provided with the distribution.
+//
+// 3. Neither the name of the Corporation nor the names of the
+// contributors may be used to endorse or promote products derived from
+// this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY NTESS "AS IS" AND ANY
+// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NTESS OR THE
+// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Questions? Contact Christian R. Trott (crtrott@sandia.gov)
+//
+// ************************************************************************
+//@HEADER
+*/
+
+#include <TestStdAlgorithmsCommon.hpp>
+#include <iterator>
+#include <std_algorithms/Kokkos_BeginEnd.hpp>
+#include <std_algorithms/Kokkos_NonModifyingSequenceOperations.hpp>
+#include <algorithm>
+
+namespace Test {
+namespace stdalgos {
+namespace Find {
+
+namespace KE = Kokkos::Experimental;
+
+template <class ViewType>
+void test_find(const ViewType view) {
+  using value_t           = typename ViewType::value_type;
+  using view_host_space_t = Kokkos::View<value_t*, Kokkos::HostSpace>;
+
+  view_host_space_t expected("count_expected", view.extent(0));
+  compare_views(expected, view);
+  constexpr value_t find_value = 13;
+
+  // value not found, return last
+  EXPECT_EQ(KE::end(expected),
+            std::find(KE::begin(expected), KE::end(expected), find_value));
+
+  // pass const iterators, returns const iterator
+  EXPECT_EQ(KE::cend(view),
+            KE::find(exespace(), KE::cbegin(view), KE::cend(view), find_value));
+  // pass view, returns iterator
+  EXPECT_EQ(KE::end(view), KE::find(exespace(), view, find_value));
+
+  fill_views_inc(view, expected);
+
+  auto std_result =
+      std::find(KE::begin(expected), KE::end(expected), find_value);
+  auto distance = std::distance(KE::begin(expected), std_result);
+
+  // pass iterators, returns iterator
+  EXPECT_EQ(KE::begin(view) + distance,
+            KE::find(exespace(), KE::begin(view), KE::end(view), find_value));
+  // pass view, returns iterator
+  EXPECT_EQ(KE::begin(view) + distance, KE::find(exespace(), view, find_value));
+}
+
+template <class ViewType>
+void test_find_if(const ViewType view) {
+  using value_t           = typename ViewType::value_type;
+  using view_host_space_t = Kokkos::View<value_t*, Kokkos::HostSpace>;
+
+  view_host_space_t expected("count_expected", view.extent(0));
+  compare_views(expected, view);
+
+  const auto not_equals_zero = NotEqualsZeroFunctor<value_type>();
+
+  // value not found, return last
+  EXPECT_EQ(
+      KE::end(expected),
+      std::find_if(KE::begin(expected), KE::end(expected), not_equals_zero));
+
+  // pass iterators, returns iterator
+  EXPECT_EQ(KE::end(view), KE::find_if(exespace(), KE::begin(view),
+                                       KE::end(view), not_equals_zero));
+  // pass view, returns iterator
+  EXPECT_EQ(KE::end(view), KE::find_if(exespace(), view, not_equals_zero));
+
+  fill_views_inc(view, expected);
+
+  constexpr value_t find_value = 13;
+  const auto equals_val        = EqualsValFunctor<value_type>(find_value);
+  auto std_result =
+      std::find_if(KE::begin(expected), KE::end(expected), equals_val);
+  auto distance = std::distance(KE::begin(expected), std_result);
+
+  // pass const iterators, returns const iterator
+  EXPECT_EQ(
+      KE::cbegin(view) + distance,
+      KE::find_if(exespace(), KE::cbegin(view), KE::cend(view), equals_val));
+  // pass view, returns iterator
+  EXPECT_EQ(KE::begin(view) + distance,
+            KE::find_if(exespace(), view, equals_val));
+}
+
+template <class ViewType>
+void test_find_if_not(const ViewType view) {
+  using value_t           = typename ViewType::value_type;
+  using view_host_space_t = Kokkos::View<value_t*, Kokkos::HostSpace>;
+
+  view_host_space_t expected("count_expected", view.extent(0));
+  compare_views(expected, view);
+
+  const auto not_equals_zero = NotEqualsZeroFunctor<value_type>();
+
+  // first value matches
+  EXPECT_EQ(KE::begin(expected),
+            std::find_if_not(KE::begin(expected), KE::end(expected),
+                             not_equals_zero));
+
+  // pass iterators, returns iterator
+  EXPECT_EQ(KE::begin(view), KE::find_if_not(exespace(), KE::begin(view),
+                                             KE::end(view), not_equals_zero));
+  // pass view, returns iterator
+  EXPECT_EQ(KE::begin(view),
+            KE::find_if_not(exespace(), view, not_equals_zero));
+
+  fill_views_inc(view, expected);
+
+  const auto equals_zero = EqualsValFunctor<value_type>(0);
+  auto std_result =
+      std::find_if_not(KE::begin(expected), KE::end(expected), equals_zero);
+  auto distance = std::distance(KE::begin(expected), std_result);
+
+  // pass const iterators, returns const iterator
+  EXPECT_EQ(KE::cbegin(view) + distance,
+            KE::find_if_not(exespace(), KE::cbegin(view), KE::cend(view),
+                            equals_zero));
+  // pass view, returns const iterator
+  EXPECT_EQ(KE::begin(view) + distance,
+            KE::find_if_not(exespace(), view, equals_zero));
+}
+
+template <class Tag, class ValueType>
+void run_all_scenarios() {
+  for (const auto& scenario : default_scenarios) {
+    {
+      auto view = create_view<ValueType>(Tag{}, scenario.second, "find");
+      test_find(view);
+    }
+    {
+      auto view = create_view<ValueType>(Tag{}, scenario.second, "find_if");
+      test_find_if(view);
+    }
+    {
+      auto view = create_view<ValueType>(Tag{}, scenario.second, "find_if_not");
+      test_find_if_not(view);
+    }
+  }
+}
+
+TEST(std_algorithms_find_test, test) {
+  run_all_scenarios<DynamicTag, double>();
+  run_all_scenarios<StridedTwoTag, int>();
+  run_all_scenarios<StridedThreeTag, unsigned>();
+}
+
+}  // namespace Find
+}  // namespace stdalgos
+}  // namespace Test