![]() |
deal.II version 9.7.0
|
#include <deal.II/arborx/access_traits.h>
This class defines a predicate used by ArborXWrappers::BVH to determine for given points which of the bounding boxes used to build the ArborXWrappers::BVH intersect with them.
Definition at line 70 of file access_traits.h.

Public Member Functions | |
| template<int dim, typename Number> | |
| PointIntersectPredicate (const std::vector<::Point< dim, Number > > &points) | |
| const ::Point< 3, float > & | get (unsigned int i) const |
| std::size_t | size () const |
Private Attributes | |
| std::vector<::Point< 3, float > > | points |
| ArborXWrappers::PointIntersectPredicate::PointIntersectPredicate | ( | const std::vector<::Point< dim, Number > > & | points | ) |
Constructor. points is a list of points which we are interested in knowing if they intersect ArborXWrappers::BVH bounding boxes.
Definition at line 71 of file access_traits.cc.
| const::Point< 3, float > & ArborXWrappers::PointPredicate::get | ( | unsigned int | i | ) | const |
Return the ith Point stored in the object.
Definition at line 56 of file access_traits.cc.
| std::size_t ArborXWrappers::PointPredicate::size | ( | ) | const |
The number of points stored in the structure.
Definition at line 50 of file access_traits.cc.
|
privateinherited |
Definition at line 59 of file access_traits.h.