#include <Index.h>
|
void | adjustTree (Node *, Node *, std::stack< id_type > &, byte *overflowTable) |
|
void | adjustTree (Node *, std::stack< id_type > &) |
|
virtual NodePtr | chooseSubtree (const Region &mbr, uint32_t level, std::stack< id_type > &pathBuffer) |
|
virtual NodePtr | findLeaf (const Region &mbr, id_type id, std::stack< id_type > &pathBuffer) |
|
uint32_t | findLeastEnlargement (const Region &) const |
|
uint32_t | findLeastOverlap (const Region &) const |
|
| Index (RTree *pTree, id_type id, uint32_t level) |
|
virtual void | split (uint32_t dataLength, byte *pData, Region &mbr, id_type id, NodePtr &left, NodePtr &right) |
|
◆ ~Index()
virtual SpatialIndex::RTree::Index::~Index |
( |
| ) |
|
|
virtual |
◆ Index()
SpatialIndex::RTree::Index::Index |
( |
RTree * | pTree, |
|
|
id_type | id, |
|
|
uint32_t | level ) |
|
protected |
◆ adjustTree() [1/2]
void SpatialIndex::RTree::Index::adjustTree |
( |
Node * | , |
|
|
Node * | , |
|
|
std::stack< id_type > & | , |
|
|
byte * | overflowTable ) |
|
protected |
◆ adjustTree() [2/2]
void SpatialIndex::RTree::Index::adjustTree |
( |
Node * | , |
|
|
std::stack< id_type > & | ) |
|
protected |
◆ chooseSubtree()
virtual NodePtr SpatialIndex::RTree::Index::chooseSubtree |
( |
const Region & | mbr, |
|
|
uint32_t | level, |
|
|
std::stack< id_type > & | pathBuffer ) |
|
protectedvirtual |
◆ findLeaf()
◆ findLeastEnlargement()
uint32_t SpatialIndex::RTree::Index::findLeastEnlargement |
( |
const Region & | | ) |
const |
|
protected |
◆ findLeastOverlap()
uint32_t SpatialIndex::RTree::Index::findLeastOverlap |
( |
const Region & | | ) |
const |
|
protected |
◆ split()
◆ BulkLoader
◆ Node
◆ RTree
The documentation for this class was generated from the following file:
- src/3rdparty/legacy/spatialindexnavel/src/rtree/Index.h