298 lines
8.9 KiB
C++
298 lines
8.9 KiB
C++
//@HEADER
|
|
// ************************************************************************
|
|
//
|
|
// Kokkos v. 4.0
|
|
// Copyright (2022) 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.
|
|
//
|
|
// Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://kokkos.org/LICENSE for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//@HEADER
|
|
|
|
#include <TestStdAlgorithmsCommon.hpp>
|
|
#include <std_algorithms/Kokkos_BeginEnd.hpp>
|
|
#include "std_algorithms/Kokkos_AdjacentFind.hpp"
|
|
#include <utility>
|
|
|
|
namespace Test {
|
|
namespace stdalgos {
|
|
namespace AdjacentFind {
|
|
|
|
namespace KE = Kokkos::Experimental;
|
|
|
|
// impl is here for std because it is only avail from c++>=17
|
|
template <class InputIterator, class OutputIterator, class BinaryPredicate>
|
|
auto my_unique_copy(InputIterator first, InputIterator last,
|
|
OutputIterator result, BinaryPredicate pred) {
|
|
if (first != last) {
|
|
typename OutputIterator::value_type t(*first);
|
|
*result = t;
|
|
++result;
|
|
while (++first != last) {
|
|
if (!pred(t, *first)) {
|
|
t = *first;
|
|
*result = t;
|
|
++result;
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator>
|
|
auto my_unique_copy(InputIterator first, InputIterator last,
|
|
OutputIterator result) {
|
|
using value_type = typename OutputIterator::value_type;
|
|
using func_t = IsEqualFunctor<value_type>;
|
|
return my_unique_copy(first, last, result, func_t());
|
|
}
|
|
|
|
template <class ValueType>
|
|
struct UnifDist;
|
|
|
|
template <>
|
|
struct UnifDist<int> {
|
|
using dist_type = std::uniform_int_distribution<int>;
|
|
std::mt19937 m_gen;
|
|
dist_type m_dist;
|
|
|
|
// make bounds tight so that it is likely we get
|
|
// consecutive equal elements
|
|
UnifDist() : m_dist(2, 8) { m_gen.seed(345823); }
|
|
|
|
int operator()() { return m_dist(m_gen); }
|
|
};
|
|
|
|
template <>
|
|
struct UnifDist<double> {
|
|
using dist_type = std::uniform_real_distribution<double>;
|
|
std::mt19937 m_gen;
|
|
dist_type m_dist;
|
|
|
|
// make bounds tight so that it is likely we get
|
|
// consecutive equal elements
|
|
UnifDist() : m_dist(2, 8) { m_gen.seed(345823); }
|
|
|
|
double operator()() { return m_dist(m_gen); }
|
|
};
|
|
|
|
template <class ViewType>
|
|
void fill_view(ViewType dest_view, const std::string& name) {
|
|
using value_type = typename ViewType::value_type;
|
|
using exe_space = typename ViewType::execution_space;
|
|
const std::size_t ext = dest_view.extent(0);
|
|
using aux_view_t = Kokkos::View<value_type*, exe_space>;
|
|
aux_view_t aux_view("aux_view", ext);
|
|
auto v_h = create_mirror_view(Kokkos::HostSpace(), aux_view);
|
|
|
|
if (name == "empty") {
|
|
// no op
|
|
}
|
|
|
|
else if (name == "one-element-a") {
|
|
v_h(0) = static_cast<value_type>(1);
|
|
}
|
|
|
|
else if (name == "one-element-b") {
|
|
v_h(0) = static_cast<value_type>(2);
|
|
}
|
|
|
|
else if (name == "two-elements-a") {
|
|
v_h(0) = static_cast<value_type>(1);
|
|
v_h(1) = static_cast<value_type>(2);
|
|
}
|
|
|
|
else if (name == "two-elements-b") {
|
|
v_h(0) = static_cast<value_type>(2);
|
|
v_h(1) = static_cast<value_type>(-1);
|
|
}
|
|
|
|
else if (name == "small-a") {
|
|
v_h(0) = static_cast<value_type>(0);
|
|
v_h(1) = static_cast<value_type>(1);
|
|
v_h(2) = static_cast<value_type>(2);
|
|
v_h(3) = static_cast<value_type>(3);
|
|
v_h(4) = static_cast<value_type>(2);
|
|
v_h(5) = static_cast<value_type>(5);
|
|
v_h(6) = static_cast<value_type>(4);
|
|
v_h(7) = static_cast<value_type>(4);
|
|
v_h(8) = static_cast<value_type>(5);
|
|
v_h(9) = static_cast<value_type>(6);
|
|
v_h(10) = static_cast<value_type>(6);
|
|
}
|
|
|
|
else if (name == "small-b") {
|
|
v_h(0) = static_cast<value_type>(1);
|
|
v_h(1) = static_cast<value_type>(1);
|
|
v_h(2) = static_cast<value_type>(1);
|
|
v_h(3) = static_cast<value_type>(2);
|
|
v_h(4) = static_cast<value_type>(3);
|
|
v_h(5) = static_cast<value_type>(4);
|
|
v_h(6) = static_cast<value_type>(4);
|
|
v_h(7) = static_cast<value_type>(4);
|
|
v_h(8) = static_cast<value_type>(5);
|
|
v_h(9) = static_cast<value_type>(6);
|
|
v_h(10) = static_cast<value_type>(8);
|
|
v_h(11) = static_cast<value_type>(9);
|
|
v_h(12) = static_cast<value_type>(8);
|
|
}
|
|
|
|
else if (name == "medium") {
|
|
// beginning just contains increasing values
|
|
for (std::size_t i = 0; i < 1000; ++i) {
|
|
v_h(i) = static_cast<value_type>(i);
|
|
}
|
|
|
|
// then use random
|
|
UnifDist<value_type> randObj;
|
|
for (std::size_t i = 1000; i < ext; ++i) {
|
|
v_h(i) = randObj();
|
|
}
|
|
}
|
|
|
|
else if (name == "large-a") {
|
|
// put equal elements at the end
|
|
for (std::size_t i = 0; i < ext; ++i) {
|
|
v_h(i) = static_cast<value_type>(i);
|
|
}
|
|
v_h(ext - 3) = static_cast<value_type>(44);
|
|
v_h(ext - 2) = static_cast<value_type>(44);
|
|
v_h(ext - 1) = static_cast<value_type>(44);
|
|
}
|
|
|
|
else if (name == "large-b") {
|
|
UnifDist<value_type> randObj;
|
|
for (std::size_t i = 0; i < ext; ++i) {
|
|
v_h(i) = randObj();
|
|
}
|
|
}
|
|
|
|
else {
|
|
FAIL() << "invalid choice";
|
|
}
|
|
|
|
Kokkos::deep_copy(aux_view, v_h);
|
|
CopyFunctor<aux_view_t, ViewType> F1(aux_view, dest_view);
|
|
Kokkos::parallel_for("copy", dest_view.extent(0), F1);
|
|
}
|
|
|
|
template <class IteratorType, class BinaryPredicate>
|
|
IteratorType my_std_adjacent_find(IteratorType first, IteratorType last,
|
|
BinaryPredicate p) {
|
|
if (first == last) {
|
|
return last;
|
|
}
|
|
IteratorType next = first;
|
|
++next;
|
|
for (; next != last; ++next, ++first) {
|
|
if (p(*first, *next)) {
|
|
return first;
|
|
}
|
|
}
|
|
return last;
|
|
}
|
|
|
|
template <class IteratorType>
|
|
IteratorType my_std_adjacent_find(IteratorType first, IteratorType last) {
|
|
using value_type = typename IteratorType::value_type;
|
|
return my_std_adjacent_find(first, last, IsEqualFunctor<value_type>());
|
|
}
|
|
|
|
std::string value_type_to_string(int) { return "int"; }
|
|
std::string value_type_to_string(double) { return "double"; }
|
|
|
|
template <class Tag, class ValueType>
|
|
void print_scenario_details(const std::string& name) {
|
|
std::cout << "adjacent_find: default predicate: " << name << ", "
|
|
<< view_tag_to_string(Tag{}) << " "
|
|
<< value_type_to_string(ValueType()) << '\n';
|
|
}
|
|
|
|
template <class Tag, class ValueType, class Predicate>
|
|
void print_scenario_details(const std::string& name, Predicate pred) {
|
|
(void)pred;
|
|
std::cout << "adjacent_find: custom predicate: " << name << ", "
|
|
<< view_tag_to_string(Tag{}) << " "
|
|
<< value_type_to_string(ValueType()) << '\n';
|
|
}
|
|
|
|
template <class DiffType, class ViewType, class... Args>
|
|
void verify(DiffType my_diff, ViewType view, Args... args) {
|
|
auto view_dc = create_deep_copyable_compatible_clone(view);
|
|
auto view_h = create_mirror_view_and_copy(Kokkos::HostSpace(), view_dc);
|
|
auto std_r =
|
|
my_std_adjacent_find(KE::cbegin(view_h), KE::cend(view_h), args...);
|
|
const auto std_diff = std_r - KE::cbegin(view_h);
|
|
|
|
ASSERT_EQ(my_diff, std_diff);
|
|
}
|
|
|
|
template <class Tag, class ValueType, class InfoType, class... Args>
|
|
void run_single_scenario(const InfoType& scenario_info, Args... args) {
|
|
const auto name = std::get<0>(scenario_info);
|
|
const std::size_t view_ext = std::get<1>(scenario_info);
|
|
// print_scenario_details<Tag, ValueType>(name, args...);
|
|
|
|
auto view = create_view<ValueType>(Tag{}, view_ext, "adjacent_find_view");
|
|
fill_view(view, name);
|
|
|
|
{
|
|
auto res_it = KE::adjacent_find(exespace(), KE::cbegin(view),
|
|
KE::cend(view), args...);
|
|
const auto my_diff = res_it - KE::cbegin(view);
|
|
verify(my_diff, view, args...);
|
|
}
|
|
|
|
{
|
|
auto res_it = KE::adjacent_find("label", exespace(), KE::cbegin(view),
|
|
KE::cend(view), args...);
|
|
const auto my_diff = res_it - KE::cbegin(view);
|
|
verify(my_diff, view, args...);
|
|
}
|
|
|
|
{
|
|
auto res_it = KE::adjacent_find(exespace(), view, args...);
|
|
const auto my_diff = res_it - KE::begin(view);
|
|
verify(my_diff, view, args...);
|
|
}
|
|
|
|
{
|
|
auto res_it = KE::adjacent_find("label", exespace(), view, args...);
|
|
const auto my_diff = res_it - KE::begin(view);
|
|
verify(my_diff, view, args...);
|
|
}
|
|
|
|
Kokkos::fence();
|
|
}
|
|
|
|
template <class Tag, class ValueType>
|
|
void run_all_scenarios() {
|
|
const std::map<std::string, std::size_t> scenarios = {
|
|
{"empty", 0}, {"one-element-a", 1}, {"one-element-b", 1},
|
|
{"two-elements-a", 2}, {"two-elements-b", 2}, {"small-a", 11},
|
|
{"small-b", 13}, {"medium", 21103}, {"large-a", 101513},
|
|
{"large-b", 100111}};
|
|
|
|
for (const auto& it : scenarios) {
|
|
run_single_scenario<Tag, ValueType>(it);
|
|
|
|
using func_t = IsEqualFunctor<ValueType>;
|
|
run_single_scenario<Tag, ValueType>(it, func_t());
|
|
}
|
|
}
|
|
|
|
TEST(std_algorithms_nonmod_seq_ops, adjacent_find) {
|
|
run_all_scenarios<DynamicTag, int>();
|
|
run_all_scenarios<DynamicTag, double>();
|
|
run_all_scenarios<StridedThreeTag, int>();
|
|
}
|
|
|
|
} // namespace AdjacentFind
|
|
} // namespace stdalgos
|
|
} // namespace Test
|