| begin() const | pgl::ShapeTree< S, WeightFn > | inline |
| boundingBoxes() const | pgl::ShapeTree< S, WeightFn > | inline |
| cbegin() const | pgl::ShapeTree< S, WeightFn > | inline |
| cend() const | pgl::ShapeTree< S, WeightFn > | inline |
| const_iterator typedef | pgl::ShapeTree< S, WeightFn > | |
| const_reference typedef | pgl::ShapeTree< S, WeightFn > | |
| countContainedIn(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| countIntersecting(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| empty() const | pgl::ShapeTree< S, WeightFn > | inline |
| emptyContainedIn(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| emptyIntersecting(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| end() const | pgl::ShapeTree< S, WeightFn > | inline |
| erase(const ShapeType &shape) | pgl::ShapeTree< S, WeightFn > | inline |
| has(const ShapeType &shape) const | pgl::ShapeTree< S, WeightFn > | inline |
| insert(const ShapeType &shape) | pgl::ShapeTree< S, WeightFn > | inline |
| kNearestNeighbors(const Q &q, int k) const | pgl::ShapeTree< S, WeightFn > | inline |
| kNearestNeighbors(const Q &q, int k) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighbor(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighbor(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighborL1(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighborL1(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighborLInf(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| nearestNeighborLInf(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| NumberType typedef | pgl::ShapeTree< S, WeightFn > | |
| operator<<(Canvas &canvas, const ShapeTree &tree) | pgl::ShapeTree< S, WeightFn > | friend |
| PointType typedef | pgl::ShapeTree< S, WeightFn > | |
| rebuild(std::size_t leafSize=0) | pgl::ShapeTree< S, WeightFn > | inline |
| Rect typedef | pgl::ShapeTree< S, WeightFn > | |
| reportContainedIn(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| reportIntersecting(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| shapes() const | pgl::ShapeTree< S, WeightFn > | inline |
| ShapeTree()=default | pgl::ShapeTree< S, WeightFn > | |
| ShapeTree(const Container &shapes, std::size_t leafSize=defaultLeafSize, WeightFn weight=WeightFn{}) | pgl::ShapeTree< S, WeightFn > | inlineexplicit |
| ShapeTree(const Container &shapes, WeightFn weight) | pgl::ShapeTree< S, WeightFn > | inlineexplicit |
| ShapeType typedef | pgl::ShapeTree< S, WeightFn > | |
| size() const | pgl::ShapeTree< S, WeightFn > | inline |
| size_type typedef | pgl::ShapeTree< S, WeightFn > | |
| sumContainedIn(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| sumIntersecting(const Q &q) const | pgl::ShapeTree< S, WeightFn > | inline |
| value_type typedef | pgl::ShapeTree< S, WeightFn > | |
| visitContainedIn(const Q &q, Fn fn) const | pgl::ShapeTree< S, WeightFn > | inline |
| visitIntersecting(const Q &q, Fn fn) const | pgl::ShapeTree< S, WeightFn > | inline |
| WeightFunction typedef | pgl::ShapeTree< S, WeightFn > | |
| WeightType typedef | pgl::ShapeTree< S, WeightFn > | |