assignSplitBounds(const AABox &myBounds) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
child | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | |
deserializeStructure(BinaryInput &bi) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inlinestatic |
findDeepestContainingNode(const Vector3 &point) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
getHandles(Array< Handle > &handleArray) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
getIntersectingMembers(const AABox &sphereBounds, const Sphere &sphere, Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
getIntersectingMembers(const AABox &box, const Sphere &sphere, Array< T > &members, bool useSphere) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
isLeaf() const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
Node() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
Node(const Node &other) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
Node(const Array< Handle > &pt) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
serializeStructure(const Node *n, BinaryOutput &bo) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inlinestatic |
splitAxis | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | |
splitBounds | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | |
splitLocation | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | |
valueArray | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | |
verifyNode(const Vector3 &lo, const Vector3 &hi) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |
~Node() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc >::Node | inline |