Pangolin
Header-only C++20 plane computational geometry library
Loading...
Searching...
No Matches
pgl::ShapeTree< S, WeightFn > Member List

This is the complete list of members for pgl::ShapeTree< S, WeightFn >, including all inherited members.

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