ArborX::BruteForce¶
Note
For ArborX 1.x, see ArborX::BruteForce (v1).
Defined in header <ArborX_BruteForce.hpp>
template <typename MemorySpace, typename Value, typename IndexableGetter, typename BoundingVolume>
class BruteForce;
The class template ArborX::BruteForce is a data structure that can be used to search for geometrical objects in space. When performing queries, it checks each indexed value against each predicate.
Template parameters¶
MemorySpace: valid Kokkos memory spaceValue: type of objects stored in the containerIndexableGetter: function extracting an indexable geometry fromValueBoundingVolume: bounding volume used for internal nodes
Member types¶
Member type |
Definition |
|---|---|
|
|
|
|
|
|
|
|
|
|
Member functions¶
constructs the data structure |
|
returns the number of elements stored in the data structure |
|
checks whether the data structure has no elements |
|
returns an axis-aligned bounding box able to contain all elements stored in the data structure |
|
finds all elements that satisfy given predicates, e.g. intersecting with a box or a sphere |