84 virtual void flush() ;
93 void insertData_impl(uint32_t dataLength, uint8_t* pData,
MovingRegion& mbr,
id_type id, uint32_t level, uint8_t* overflowTable);
98 void deleteNode(
Node*);
110 uint32_t m_indexCapacity;
112 uint32_t m_leafCapacity;
114 uint32_t m_nearMinimumOverlapFactor;
119 double m_splitDistributionFactor;
124 double m_reinsertFactor;
129 uint32_t m_dimension;
137 double m_currentTime;
146 std::vector<std::shared_ptr<ICommand> > m_writeNodeCommands;
147 std::vector<std::shared_ptr<ICommand> > m_readNodeCommands;
148 std::vector<std::shared_ptr<ICommand> > m_deleteNodeCommands;
157 NNEntry(
id_type id,
IEntry* e,
double f) : m_id(
id), m_pEntry(e), m_minDist(f) {}
158 ~NNEntry() =
default;
165 double getMinimumDistance(
const IShape& query,
const IShape& entry)
170 double getMinimumDistance(
const IShape& query,
const IData& data)
virtual void selfJoinQuery(const IShape &s, IVisitor &v)
virtual void insertData(uint32_t len, const uint8_t *pData, const IShape &shape, id_type shapeIdentifier)
virtual void containsWhatQuery(const IShape &query, IVisitor &v)
virtual void addCommand(ICommand *pCommand, CommandType ct)
virtual bool deleteData(const IShape &shape, id_type id)
virtual double getMinimumDistance(const IShape &in) const =0
friend std::ostream & operator<<(std::ostream &os, const TPRTree &t)
virtual void nearestNeighborQuery(uint32_t k, const IShape &query, IVisitor &v, INearestNeighborComparator &)
virtual void getStatistics(IStatistics **out) const
virtual void queryStrategy(IQueryStrategy &qs)
virtual void intersectsWithQuery(const IShape &query, IVisitor &v)
virtual void getIndexProperties(Tools::PropertySet &out) const
virtual void internalNodesQuery(const IShape &query, IVisitor &v)
virtual void pointLocationQuery(const Point &query, IVisitor &v)
virtual bool isIndexValid()
TPRTree(IStorageManager &, Tools::PropertySet &)
virtual void getShape(IShape **out) const =0