AddPoint(PointND &pt, Tindex ii) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
AddPoint(Tfloat *xx, Tindex ii) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
begin() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
clear() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
end() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindClosestPoint(PointND &pt) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindClosestPoint(PointND &pt, PointND &clp) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindClosestPoint(PointND &pt, Tindex &ind, Tfloat &dist) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindClosestPoint(PointND &pt, Tindex &ind, Tfloat &dist, PointND &clp) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindClosestPointSlow(PointND &pt, Tindex &ind, Tfloat &dist) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindNeighborPoints(PointND &pt, Tfloat R, std::vector< Tindex > &res, std::vector< Tfloat > &dist) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindNeighborPoints(PointND &pt, Tfloat R, std::vector< Tindex > &res) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindNeighborPointsSlow(PointND &pt, Tfloat R, std::vector< Tindex > &res, std::vector< Tfloat > &dist) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
FindNeighborPointsSlow(PointND &pt, Tfloat R, std::vector< Tindex > &res) | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
iterator typedef | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | |
KDTree()=default | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | |
size() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
Sort() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |
SpaceDimension() | mfem::KDTree< Tindex, Tfloat, ndim, Tnorm > | inline |