#include <HashMapFinder.h>
|
| HashMapFinder (const RunSettings &settings, const Float cellMult=1._f) |
|
| ~HashMapFinder () |
|
template<bool FindAll> |
Size | find (const Vector &pos, const Size index, const Float radius, Array< NeighbourRecord > &neighs) const |
|
template<typename TFunctor > |
void | iterate (const TFunctor &func) const |
|
Outcome | good () const |
|
MinMaxMean | getBucketStats () const |
|
virtual Size | findAll (const Size index, const Float radius, Array< NeighbourRecord > &neighbours) const override |
| Finds all neighbours within given radius from the point given by index. More...
|
|
virtual Size | findAll (const Vector &pos, const Float radius, Array< NeighbourRecord > &neighbours) const override |
| Finds all points within given radius from given position. More...
|
|
virtual Size | findLowerRank (const Size index, const Float radius, Array< NeighbourRecord > &neighbours) const override |
| Finds all points within radius that have a lower rank in smoothing length. More...
|
|
void | build (IScheduler &scheduler, ArrayView< const Vector > points, Flags< FinderFlag > flags=FinderFlag::MAKE_RANK) |
| Constructs the struct with an array of vectors. More...
|
|
template<typename TCompare > |
void | buildWithRank (IScheduler &scheduler, ArrayView< const Vector > points, TCompare &&comp) |
| Constructs the struct with custom predicate for ordering particles. More...
|
|
void | build (IScheduler &scheduler, ArrayView< const Vector > points) |
| Constructs the struct with an array of vectors. More...
|
|
virtual | ~Polymorphic () |
|
Definition at line 16 of file HashMapFinder.h.
◆ HashMapFinder()
HashMapFinder::HashMapFinder |
( |
const RunSettings & |
settings, |
|
|
const Float |
cellMult = 1._f |
|
) |
| |
◆ ~HashMapFinder()
HashMapFinder::~HashMapFinder |
( |
| ) |
|
|
default |
◆ buildImpl()
Builds finder from set of vectors.
This must be called before findAll, can be called more than once.
- Parameters
-
scheduler | Scheduler that can be used for parallelization. |
points | View of the array of points in space. |
Implements IBasicFinder.
Definition at line 19 of file HashMapFinder.cpp.
◆ find()
◆ getBucketStats()
MinMaxMean HashMapFinder::getBucketStats |
( |
| ) |
const |
|
inline |
◆ good()
Outcome HashMapFinder::good |
( |
| ) |
const |
|
inline |
◆ iterate()
template<typename TFunctor >
void HashMapFinder::iterate |
( |
const TFunctor & |
func | ) |
const |
|
inline |
The documentation for this class was generated from the following files: