balance(int valuesPerNode=40, int numMeanSplits=3) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
begin() const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
beginBoxIntersection(const AABox &box) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
clear() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
clearData() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
cloneTree(Node *src) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inlineprotected |
computeBounds(const Array< Handle > &point) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inlineprotectedstatic |
contains(const T &value) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
deserializeStructure(BinaryInput &bi) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
end() const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
endBoxIntersection() const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
getIntersectingMembers(const Array< Plane > &plane, Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
getIntersectingMembers(const Frustum &frustum, Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
getIntersectingMembers(const AABox &box, Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
getIntersectingMembers(const Sphere &sphere, Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
getMembers(Array< T > &members) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
insert(const T &value) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
insert(const Array< T > &valueArray) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
makeNode(Array< Handle > &source, Array< Handle > &temp, int valuesPerNode, int numMeanSplits) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inlineprotected |
memberTable | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | protected |
MemberTable typedef | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | protected |
operator=(const PointKDTree &src) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
PointKDTree() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
PointKDTree(const PointKDTree &src) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
remove(const T &value) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
root | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | protected |
serializeStructure(BinaryOutput &bo) const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
size() const | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
update(const T &value) | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |
~PointKDTree() | G3D::PointKDTree< T, PositionFunc, HashFunc, EqualsFunc > | inline |