diff --git a/benchmarks/brute_force_vs_bvh/brute_force_vs_bvh_timpl.hpp b/benchmarks/brute_force_vs_bvh/brute_force_vs_bvh_timpl.hpp index 6276ee136..af8f0f111 100644 --- a/benchmarks/brute_force_vs_bvh/brute_force_vs_bvh_timpl.hpp +++ b/benchmarks/brute_force_vs_bvh/brute_force_vs_bvh_timpl.hpp @@ -93,8 +93,7 @@ static void run_fp(int nprimitives, int nqueries, int nrepeats) ArborX::PairValueIndex> bvh{space, ArborX::Experimental::attach_indices(primitives)}; - Kokkos::View indices("Benchmark::indices_ref", - 0); + Kokkos::View indices("Benchmark::indices_ref", 0); Kokkos::View offset("Benchmark::offset_ref", 0); bvh.query(space, predicates, indices, offset); @@ -112,7 +111,7 @@ static void run_fp(int nprimitives, int nqueries, int nrepeats) ArborX::BruteForce> brute{ space, ArborX::Experimental::attach_indices(primitives)}; - Kokkos::View indices("Benchmark::indices", 0); + Kokkos::View indices("Benchmark::indices", 0); Kokkos::View offset("Benchmark::offset", 0); brute.query(space, predicates, indices, offset); diff --git a/benchmarks/dbscan/ArborX_DBSCANVerification.hpp b/benchmarks/dbscan/ArborX_DBSCANVerification.hpp index 3033b67e6..5cadc3830 100644 --- a/benchmarks/dbscan/ArborX_DBSCANVerification.hpp +++ b/benchmarks/dbscan/ArborX_DBSCANVerification.hpp @@ -317,7 +317,7 @@ bool verifyDBSCAN(ExecutionSpace exec_space, Primitives const &primitives, auto const predicates = ArborX::Experimental::attach_indices( ArborX::Experimental::make_intersects(points, eps)); - Kokkos::View indices("ArborX::DBSCAN::indices", 0); + Kokkos::View indices("ArborX::DBSCAN::indices", 0); Kokkos::View offset("ArborX::DBSCAN::offset", 0); ArborX::query(bvh, exec_space, predicates, indices, offset); diff --git a/examples/simple_intersection/example_intersection.cpp b/examples/simple_intersection/example_intersection.cpp index 1310d57ed..7d0cacb15 100644 --- a/examples/simple_intersection/example_intersection.cpp +++ b/examples/simple_intersection/example_intersection.cpp @@ -50,8 +50,8 @@ int main(int argc, char *argv[]) ExecutionSpace space; - ArborX::BVH> const tree( - space, ArborX::Experimental::attach_indices(boxes)); + ArborX::BVH> const tree( + space, ArborX::Experimental::attach_indices(boxes)); // The query will resize indices and offsets accordingly Kokkos::View indices("Example::indices", 0); diff --git a/src/ArborX_BruteForce.hpp b/src/ArborX_BruteForce.hpp index d83cc20d6..84ec4384e 100644 --- a/src/ArborX_BruteForce.hpp +++ b/src/ArborX_BruteForce.hpp @@ -92,10 +92,8 @@ class BruteForce else if constexpr (!Details::is_pair_value_index_v) return false; else - { - return std::is_same_v::value_type, - typename value_type::index_type>; - } + return std::is_integral_v< + typename std::decay_t::value_type>; }(); if constexpr (use_convenient_shortcut) diff --git a/src/ArborX_LinearBVH.hpp b/src/ArborX_LinearBVH.hpp index fa68cc5d3..47dfe64ee 100644 --- a/src/ArborX_LinearBVH.hpp +++ b/src/ArborX_LinearBVH.hpp @@ -116,10 +116,8 @@ class BoundingVolumeHierarchy else if constexpr (!Details::is_pair_value_index_v) return false; else - { - return std::is_same_v::value_type, - typename value_type::index_type>; - } + return std::is_integral_v< + typename std::decay_t::value_type>; }(); if constexpr (use_convenient_shortcut)