This is the complete list of members for bitpit::SurfaceSkdTree, including all inherited members.
| _getNode(std::size_t nodeId) | bitpit::PatchSkdTree | protected |
| areLookupsThreadSafe() const | bitpit::PatchSkdTree | |
| build(std::size_t leaftThreshold=1, bool squeezeStorage=false) | bitpit::PatchSkdTree | |
| clear(bool release) | bitpit::SurfaceSkdTree | |
| enableThreadSafeLookups(bool enable) | bitpit::PatchSkdTree | |
| evalMaxDepth(std::size_t rootId=0) const | bitpit::PatchSkdTree | |
| evalPointDistance(const std::array< double, 3 > &point) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(const std::array< double, 3 > &point, double maxDistance) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(const std::array< double, 3 > &point, double maxDistance, bool interorOnly) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(int nPoints, const std::array< double, 3 > *points, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(int nPoints, const std::array< double, 3 > *points, double maxDistance, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointDistance(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, bool interorOnly, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointGlobalDistance(int nPoints, const std::array< double, 3 > *points, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointGlobalDistance(int nPoints, const std::array< double, 3 > *points, double maxDistance, double *distances) const | bitpit::SurfaceSkdTree | |
| evalPointGlobalDistance(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(const std::array< double, 3 > &point, long *id, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(const std::array< double, 3 > &point, double maxDistance, long *id, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(const std::array< double, 3 > &point, double maxDistance, bool interorOnly, long *id, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(int nPoints, const std::array< double, 3 > *points, long *ids, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(int nPoints, const std::array< double, 3 > *points, double maxDistance, long *ids, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, long *ids, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestCell(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, bool interorOnly, long *ids, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestCells(const std::array< double, 3 > &point, std::vector< long > &ids, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestCells(const std::array< double, 3 > &point, double maxDistance, std::vector< long > &ids, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestCells(const std::array< double, 3 > &point, double maxDistance, bool interorOnly, std::vector< long > &ids, double *distance) const | bitpit::SurfaceSkdTree | |
| findPointClosestGlobalCell(int nPoints, const std::array< double, 3 > *points, long *ids, int *ranks, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestGlobalCell(int nPoints, const std::array< double, 3 > *points, double maxDistance, long *ids, int *ranks, double *distances) const | bitpit::SurfaceSkdTree | |
| findPointClosestGlobalCell(int nPoints, const std::array< double, 3 > *points, const double *maxDistances, long *ids, int *ranks, double *distances) const | bitpit::SurfaceSkdTree | |
| freeCommunicator() | bitpit::PatchSkdTree | protected |
| getCommunicator() const | bitpit::PatchSkdTree | protected |
| getLeafCount() const | bitpit::PatchSkdTree | |
| getLeafMaxCellCount() const | bitpit::PatchSkdTree | |
| getLeafMinCellCount() const | bitpit::PatchSkdTree | |
| getNode(std::size_t nodeId) const | bitpit::PatchSkdTree | |
| getNodeCount() const | bitpit::PatchSkdTree | |
| getPartitionBox(int rank) const | bitpit::PatchSkdTree | |
| getPatch() const | bitpit::PatchSkdTree | |
| isCommunicatorSet() const | bitpit::PatchSkdTree | protected |
| m_cellRawIds (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_communicator (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_interiorCellsOnly (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_nLeafs (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_nMaxLeafCells (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_nMinLeafCells (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_nodes (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_nProcessors (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_partitionBoxes (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_patchInfo (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| m_rank | bitpit::PatchSkdTree | protected |
| m_threadSafeLookups (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | protected |
| PatchSkdTree(const PatchKernel *patch, bool interiorCellsOnly=false) | bitpit::PatchSkdTree | protected |
| setCommunicator(MPI_Comm communicator) | bitpit::PatchSkdTree | protected |
| SurfaceSkdTree(const SurfaceKernel *patch, bool interorOnly=false) | bitpit::SurfaceSkdTree | |
| ~PatchSkdTree()=default (defined in bitpit::PatchSkdTree) | bitpit::PatchSkdTree | virtual |
1.10.0