-
Notifications
You must be signed in to change notification settings - Fork 35
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #325 from dalg24/callback
Add example for callbacks and lift requirement for tagging inline
- Loading branch information
Showing
6 changed files
with
223 additions
and
23 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,3 @@ | ||
| add_executable(ArborX_Callback.exe example_callback.cpp) | ||
| target_link_libraries(ArborX_Callback.exe ${ArborX_TARGET}) | ||
| add_test(NAME ArborX_Callback_Example COMMAND ./ArborX_Callback.exe) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,149 @@ | ||
| /**************************************************************************** | ||
| * Copyright (c) 2012-2020 by the ArborX authors * | ||
| * All rights reserved. * | ||
| * * | ||
| * This file is part of the ArborX library. ArborX is * | ||
| * distributed under a BSD 3-clause license. For the licensing terms see * | ||
| * the LICENSE file in the top-level directory. * | ||
| * * | ||
| * SPDX-License-Identifier: BSD-3-Clause * | ||
| ****************************************************************************/ | ||
|
|
||
| #include <ArborX.hpp> | ||
|
|
||
| #include <Kokkos_Core.hpp> | ||
|
|
||
| #include <iostream> | ||
| #include <random> | ||
| #include <vector> | ||
|
|
||
| using ExecutionSpace = Kokkos::DefaultExecutionSpace; | ||
| using MemorySpace = ExecutionSpace::memory_space; | ||
|
|
||
| struct FirstOctant | ||
| { | ||
| }; | ||
|
|
||
| struct NearestToOrigin | ||
| { | ||
| int k; | ||
| }; | ||
|
|
||
| namespace ArborX | ||
| { | ||
| namespace Traits | ||
| { | ||
| template <> | ||
| struct Access<FirstOctant, PredicatesTag> | ||
| { | ||
| KOKKOS_FUNCTION static std::size_t size(FirstOctant) { return 1; } | ||
| KOKKOS_FUNCTION static auto get(FirstOctant, std::size_t) | ||
| { | ||
| return intersects(Box{{{0, 0, 0}}, {{1, 1, 1}}}); | ||
| } | ||
| using memory_space = MemorySpace; | ||
| }; | ||
| template <> | ||
| struct Access<NearestToOrigin, PredicatesTag> | ||
| { | ||
| KOKKOS_FUNCTION static std::size_t size(NearestToOrigin) { return 1; } | ||
| KOKKOS_FUNCTION static auto get(NearestToOrigin d, std::size_t) | ||
| { | ||
| return nearest(Point{0, 0, 0}, d.k); | ||
| } | ||
| using memory_space = MemorySpace; | ||
| }; | ||
| } // namespace Traits | ||
| } // namespace ArborX | ||
|
|
||
| struct PairIndexDistance | ||
| { | ||
| int index; | ||
| float distance; | ||
| }; | ||
|
|
||
| struct PrintfCallback | ||
| { | ||
| template <typename Predicate, typename OutputFunctor> | ||
| KOKKOS_FUNCTION void operator()(Predicate, int primitive, | ||
| OutputFunctor const &out) const | ||
| { | ||
| printf("Found %d from functor\n", primitive); | ||
| out(primitive); | ||
| } | ||
| template <typename Predicate, typename OutputFunctor> | ||
| KOKKOS_FUNCTION void operator()(Predicate, int primitive, float distance, | ||
| OutputFunctor const &out) const | ||
| { | ||
| printf("Found %d with distance %.3f from functor\n", primitive, distance); | ||
| out({primitive, distance}); | ||
| } | ||
| }; | ||
|
|
||
| int main(int argc, char *argv[]) | ||
| { | ||
| Kokkos::ScopeGuard guard(argc, argv); | ||
|
|
||
| int const n = 100; | ||
| std::vector<ArborX::Point> points; | ||
| // Fill vector with random points in [-1, 1]^3 | ||
| std::uniform_real_distribution<float> dis{-1., 1.}; | ||
| std::default_random_engine gen; | ||
| auto rd = [&]() { return dis(gen); }; | ||
| std::generate_n(std::back_inserter(points), n, [&]() { | ||
| return ArborX::Point{rd(), rd(), rd()}; | ||
| }); | ||
|
|
||
| ArborX::BVH<MemorySpace> bvh{ | ||
| ExecutionSpace{}, | ||
| Kokkos::create_mirror_view_and_copy( | ||
| MemorySpace{}, | ||
| Kokkos::View<ArborX::Point *, Kokkos::HostSpace, | ||
| Kokkos::MemoryUnmanaged>(points.data(), points.size()))}; | ||
|
|
||
| { | ||
| Kokkos::View<int *, MemorySpace> values("values", 0); | ||
| Kokkos::View<int *, MemorySpace> offsets("offsets", 0); | ||
| bvh.query(ExecutionSpace{}, FirstOctant{}, PrintfCallback{}, values, | ||
| offsets); | ||
| #ifndef __NVCC__ | ||
| bvh.query(ExecutionSpace{}, FirstOctant{}, | ||
| KOKKOS_LAMBDA(auto /*predicate*/, int primitive, | ||
| auto /*output_functor*/) { | ||
| printf("Found %d from generic lambda\n", primitive); | ||
| }, | ||
| values, offsets); | ||
| #endif | ||
| } | ||
|
|
||
| { | ||
| int const k = 10; | ||
| Kokkos::View<PairIndexDistance *, MemorySpace> values("values", 0); | ||
| Kokkos::View<int *, MemorySpace> offsets("offsets", 0); | ||
| bvh.query(ExecutionSpace{}, NearestToOrigin{k}, PrintfCallback{}, values, | ||
| offsets); | ||
| #ifndef __NVCC__ | ||
| bvh.query(ExecutionSpace{}, NearestToOrigin{k}, | ||
| KOKKOS_LAMBDA(auto /*predicate*/, int primitive, float distance, | ||
| auto /*output_functor*/) { | ||
| printf("Found %d with distance %.3f from generic lambda\n", | ||
| primitive, distance); | ||
| }, | ||
| values, offsets); | ||
| #endif | ||
| } | ||
|
|
||
| { | ||
| // EXPERIMENTAL | ||
| // TODO replace with BVH::query(ExecutionSpace, Predicates, Callback) when | ||
| // new overload is added | ||
| Kokkos::View<int, ExecutionSpace, Kokkos::MemoryTraits<Kokkos::Atomic>> c( | ||
| "counter"); | ||
|
|
||
| ArborX::Details::traverse( | ||
| ExecutionSpace{}, bvh, FirstOctant{}, | ||
| KOKKOS_LAMBDA(int i, int j) { printf("%d %d %d\n", ++c(), i, j); }); | ||
| } | ||
|
|
||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters