| begin() | CubbyFlow::Quadtree< T > | |
| begin() const | CubbyFlow::Quadtree< T > | |
| Build(const std::vector< T > &items, const BoundingBox2D &bound, const BoxIntersectionTestFunc2< T > &testFunc, size_t maxDepth) | CubbyFlow::Quadtree< T > | |
| Clear() | CubbyFlow::Quadtree< T > | |
| ClosestIntersection(const Ray2D &ray, const GetRayIntersectionFunc2< T > &testFunc) const override | CubbyFlow::Quadtree< T > | |
| CubbyFlow::IntersectionQueryEngine::ClosestIntersection(const Ray< double, N > &ray, const GetRayIntersectionFunc< T, N > &testFunc) const =0 | CubbyFlow::IntersectionQueryEngine< T, N > | pure virtual |
| ConstIterator typedef | CubbyFlow::Quadtree< T > | |
| ContainerType typedef | CubbyFlow::Quadtree< T > | |
| end() | CubbyFlow::Quadtree< T > | |
| end() const | CubbyFlow::Quadtree< T > | |
| ForEachIntersectingItem(const BoundingBox2D &box, const BoxIntersectionTestFunc2< T > &testFunc, const IntersectionVisitorFunc< T > &visitorFunc) const override | CubbyFlow::Quadtree< T > | |
| ForEachIntersectingItem(const Ray2D &ray, const RayIntersectionTestFunc2< T > &testFunc, const IntersectionVisitorFunc< T > &visitorFunc) const override | CubbyFlow::Quadtree< T > | |
| CubbyFlow::IntersectionQueryEngine::ForEachIntersectingItem(const BoundingBox< double, N > &box, const BoxIntersectionTestFunc< T, N > &testFunc, const IntersectionVisitorFunc< T > &visitorFunc) const =0 | CubbyFlow::IntersectionQueryEngine< T, N > | pure virtual |
| CubbyFlow::IntersectionQueryEngine::ForEachIntersectingItem(const Ray< double, N > &ray, const RayIntersectionTestFunc< T, N > &testFunc, const IntersectionVisitorFunc< T > &visitorFunc) const =0 | CubbyFlow::IntersectionQueryEngine< T, N > | pure virtual |
| GetBoundingBox() const | CubbyFlow::Quadtree< T > | |
| GetChildIndex(size_t nodeIdx, size_t childIdx) const | CubbyFlow::Quadtree< T > | |
| GetItem(size_t i) const | CubbyFlow::Quadtree< T > | |
| GetItemsAtNode(size_t nodeIdx) const | CubbyFlow::Quadtree< T > | |
| GetMaxDepth() const | CubbyFlow::Quadtree< T > | |
| GetNumberOfItems() const | CubbyFlow::Quadtree< T > | |
| GetNumberOfNodes() const | CubbyFlow::Quadtree< T > | |
| IntersectionQueryEngine()=default | CubbyFlow::IntersectionQueryEngine< T, N > | |
| IntersectionQueryEngine(const IntersectionQueryEngine &other)=default | CubbyFlow::IntersectionQueryEngine< T, N > | |
| IntersectionQueryEngine(IntersectionQueryEngine &&other) noexcept=default | CubbyFlow::IntersectionQueryEngine< T, N > | |
| Intersects(const BoundingBox2D &box, const BoxIntersectionTestFunc2< T > &testFunc) const override | CubbyFlow::Quadtree< T > | |
| Intersects(const Ray2D &ray, const RayIntersectionTestFunc2< T > &testFunc) const override | CubbyFlow::Quadtree< T > | |
| CubbyFlow::IntersectionQueryEngine::Intersects(const BoundingBox< double, N > &box, const BoxIntersectionTestFunc< T, N > &testFunc) const =0 | CubbyFlow::IntersectionQueryEngine< T, N > | pure virtual |
| CubbyFlow::IntersectionQueryEngine::Intersects(const Ray< double, N > &ray, const RayIntersectionTestFunc< T, N > &testFunc) const =0 | CubbyFlow::IntersectionQueryEngine< T, N > | pure virtual |
| Iterator typedef | CubbyFlow::Quadtree< T > | |
| Nearest(const Vector2D &pt, const NearestNeighborDistanceFunc2< T > &distanceFunc) const override | CubbyFlow::Quadtree< T > | |
| CubbyFlow::NearestNeighborQueryEngine::Nearest(const Vector< double, N > &pt, const NearestNeighborDistanceFunc< T, N > &distanceFunc) const =0 | CubbyFlow::NearestNeighborQueryEngine< T, N > | pure virtual |
| NearestNeighborQueryEngine()=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | |
| NearestNeighborQueryEngine(const NearestNeighborQueryEngine &other)=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | |
| NearestNeighborQueryEngine(NearestNeighborQueryEngine &&other) noexcept=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | |
| operator=(const Quadtree &)=default | CubbyFlow::Quadtree< T > | |
| operator=(Quadtree &&) noexcept=default | CubbyFlow::Quadtree< T > | |
| CubbyFlow::IntersectionQueryEngine::operator=(const IntersectionQueryEngine &other)=default | CubbyFlow::IntersectionQueryEngine< T, N > | |
| CubbyFlow::IntersectionQueryEngine::operator=(IntersectionQueryEngine &&other) noexcept=default | CubbyFlow::IntersectionQueryEngine< T, N > | |
| CubbyFlow::NearestNeighborQueryEngine::operator=(const NearestNeighborQueryEngine &other)=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | |
| CubbyFlow::NearestNeighborQueryEngine::operator=(NearestNeighborQueryEngine &&other) noexcept=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | |
| Quadtree()=default | CubbyFlow::Quadtree< T > | |
| Quadtree(const Quadtree &)=default | CubbyFlow::Quadtree< T > | |
| Quadtree(Quadtree &&) noexcept=default | CubbyFlow::Quadtree< T > | |
| ~IntersectionQueryEngine()=default | CubbyFlow::IntersectionQueryEngine< T, N > | virtual |
| ~NearestNeighborQueryEngine()=default | CubbyFlow::NearestNeighborQueryEngine< T, N > | virtual |
| ~Quadtree()=default | CubbyFlow::Quadtree< T > | virtual |
