| add(const Point &x, const TYPE &data) | AMP::kdtree2< NDIM, TYPE > | |
| box() const | AMP::kdtree2< NDIM, TYPE > | |
| checkNearest(const Point &x, size_t N, std::tuple< Point, TYPE > *nearest, double *dist) const | AMP::kdtree2< NDIM, TYPE > | private |
| d_data | AMP::kdtree2< NDIM, TYPE > | private |
| d_lb | AMP::kdtree2< NDIM, TYPE > | private |
| d_left | AMP::kdtree2< NDIM, TYPE > | private |
| d_N | AMP::kdtree2< NDIM, TYPE > | private |
| d_right | AMP::kdtree2< NDIM, TYPE > | private |
| d_split | AMP::kdtree2< NDIM, TYPE > | private |
| d_split_dim | AMP::kdtree2< NDIM, TYPE > | private |
| d_ub | AMP::kdtree2< NDIM, TYPE > | private |
| empty() const | AMP::kdtree2< NDIM, TYPE > | inline |
| findNearest(const Point &x) const | AMP::kdtree2< NDIM, TYPE > | |
| findNearest(const Point &x, int N) const | AMP::kdtree2< NDIM, TYPE > | |
| findNearest(const Point &x, double dist) const | AMP::kdtree2< NDIM, TYPE > | |
| findNearest(const Point &x, size_t N, std::tuple< Point, TYPE > *nearest, double *dist) const | AMP::kdtree2< NDIM, TYPE > | private |
| findNearest(const Point &x, double dist2, std::vector< std::tuple< Point, TYPE > > &nearest) const | AMP::kdtree2< NDIM, TYPE > | private |
| findNearestRay(const Point &x, const Point &dir, double dist) const | AMP::kdtree2< NDIM, TYPE > | |
| findNearestRay(const Point &x, const Point &dir, const Point &n_inv, double dist2, std::vector< std::tuple< Point, TYPE > > &nearest) const | AMP::kdtree2< NDIM, TYPE > | private |
| getPoints() const | AMP::kdtree2< NDIM, TYPE > | |
| getPoints(std::vector< Point > &x) const | AMP::kdtree2< NDIM, TYPE > | private |
| getPoints(std::vector< std::pair< Point, TYPE > > &x) const | AMP::kdtree2< NDIM, TYPE > | private |
| getPointsAndData() const | AMP::kdtree2< NDIM, TYPE > | |
| initialize(size_t N, Point *x, TYPE *data) | AMP::kdtree2< NDIM, TYPE > | private |
| intersect(const Point &x, double dist2) const | AMP::kdtree2< NDIM, TYPE > | private |
| kdtree2(const std::vector< Point > &x, const std::vector< TYPE > &data) | AMP::kdtree2< NDIM, TYPE > | |
| kdtree2()=default | AMP::kdtree2< NDIM, TYPE > | |
| kdtree2(const kdtree2 &)=delete | AMP::kdtree2< NDIM, TYPE > | |
| kdtree2(kdtree2 &&)=default | AMP::kdtree2< NDIM, TYPE > | |
| kdtree2(size_t N, Point *x, TYPE *data) | AMP::kdtree2< NDIM, TYPE > | private |
| operator=(const kdtree2 &)=delete | AMP::kdtree2< NDIM, TYPE > | |
| operator=(kdtree2 &&)=default | AMP::kdtree2< NDIM, TYPE > | |
| Point typedef | AMP::kdtree2< NDIM, TYPE > | |
| size() const | AMP::kdtree2< NDIM, TYPE > | inline |
| splitData(size_t N, Point *x, TYPE *data) | AMP::kdtree2< NDIM, TYPE > | private |
| ~kdtree2()=default | AMP::kdtree2< NDIM, TYPE > | |
