| buildOptimized(std::vector< std::pair< kdKey, kdDataItem > > &dataSet) | te::sam::kdtree::Index< KdTreeNode > | inline |
| buildOptimized(std::vector< std::pair< kdKey, kdDataItem > > &dataSet, const std::size_t &first, const std::size_t &last) | te::sam::kdtree::Index< KdTreeNode > | inlineprivate |
| clear() | te::sam::kdtree::Index< KdTreeNode > | inline |
| erase(KdTreeNode *node) | te::sam::kdtree::Index< KdTreeNode > | inlineprivate |
| getMBR() const | te::sam::kdtree::Index< KdTreeNode > | inline |
| Index(const te::gm::Envelope &mbr) | te::sam::kdtree::Index< KdTreeNode > | inline |
| Index(const Index &rhs) | te::sam::kdtree::Index< KdTreeNode > | private |
| insert(const kdKey &key, const kdDataItem &item) | te::sam::kdtree::Index< KdTreeNode > | inline |
| insertData(KdTreeNode *&node, const kdDataItem &data, const kd_node_m_datasingle_tag &) | te::sam::kdtree::Index< KdTreeNode > | inlineprivate |
| isEmpty() const | te::sam::kdtree::Index< KdTreeNode > | inline |
| kdData typedef | te::sam::kdtree::Index< KdTreeNode > | |
| kdDataItem typedef | te::sam::kdtree::Index< KdTreeNode > | |
| kdDataTag typedef | te::sam::kdtree::Index< KdTreeNode > | |
| kdKey typedef | te::sam::kdtree::Index< KdTreeNode > | |
| m_mbr | te::sam::kdtree::Index< KdTreeNode > | private |
| m_root | te::sam::kdtree::Index< KdTreeNode > | private |
| m_size | te::sam::kdtree::Index< KdTreeNode > | private |
| operator=(const Index &rhs) | te::sam::kdtree::Index< KdTreeNode > | private |
| search(const te::gm::Envelope &e, std::vector< KdTreeNode *> &report) const | te::sam::kdtree::Index< KdTreeNode > | inline |
| search(const te::gm::Envelope &e, KdTreeNode *node, const char &level, std::vector< KdTreeNode *> &report) const | te::sam::kdtree::Index< KdTreeNode > | inlineprivate |
| setMBR(const te::gm::Envelope &mbr) | te::sam::kdtree::Index< KdTreeNode > | inline |
| size() const | te::sam::kdtree::Index< KdTreeNode > | inline |
| ~Index() | te::sam::kdtree::Index< KdTreeNode > | inline |