Precomputed index bounds for iterating a pre-sorted SoA pair.
More...
#include <PairwiseFunctor.h>
|
|
size_t | startI |
| | First index in soa1 whose projection range overlaps soa2.
|
| |
|
const std::vector< size_t > & | maxIndex |
| | Per-particle upper bound index into soa2 (exclusive).
|
| |
|
const std::vector< size_t > & | minIndex |
| | Per-particle lower bound index into soa2 (inclusive).
|
| |
Precomputed index bounds for iterating a pre-sorted SoA pair.
Produced by CellFunctor and consumed by SoAFunctorPairSorted overrides.
- Note
- Importantly SoASortingData does not hold its own storage but rather references. meaning the storage must outlive the struct.
The documentation for this struct was generated from the following file: