|
| | Node (std::size_t depth, int fQuadtrant) |
| |
| size_t | size () |
| |
| bool | isLeaf () |
| |
| void | resize (const SGRectd &bounds) |
| |
| bool | add (const SGRectd &pos, SGSharedPtr< T > value, const Equal &equalFkt, const GetBox &getBoxFunction) |
| |
| bool | move (const SGRectd &newPos, const SGRectd &oldPos, SGSharedPtr< T > value, const Equal &equalFkt, const GetBox &getBoxFunction) |
| |
| bool | removeValue (SGSharedPtr< T > value, const Equal &equalFkt) |
| |
| bool | remove (const SGRectd &pos, SGSharedPtr< T > value, const Equal &equalFunction) |
| |
| bool | findFullScan (SGSharedPtr< T > value, const Equal &equalFkt, const std::string &path) |
| | For debugging.
|
| |
| bool | removeFullScan (SGSharedPtr< T > value, const Equal &equalFkt, const std::string &path) |
| | For debugging.
|
| |
| bool | printPath (const SGRectd &pos, SGSharedPtr< T > value, const Equal &equalFkt, const std::string &path) |
| |
| bool | printPath (const SGRectd &pos, const std::string &path) |
| |
| bool | tryMerge () |
| |
| int | split (const SGRectd &pos, const Equal &equalFkt, const GetBox &getBoxFunction) |
| |
| SGRectd | computeBox (const SGRectd &box, int i) const |
| |
| SGRectd | computeBoxCenter (const SGRectd &box, int i) const |
| |
| void | query (const SGRectd &queryBox, const GetBox &getBoxFunction, std::vector< SGSharedPtr< T > > &values) |
| |
| Quadrant | getQuadrant (const SGRectd &nodeBox, const SGRectd &valueBox) const |
| |
| SGRectd | getBounds () |
| |
| bool | intersection (const SGRectd &firstBox, const SGRectd &secondBox) |
| |
| void | dumpGeoJson (const std::unique_ptr< sg_ofstream > &o, const SGRectd &box) |
| |
| void | dumpGeoJson (const std::unique_ptr< sg_ofstream > &o, const GetBox &getBoxFunction) |
| |
template<class T, typename GetBox, typename Equal>
class quadtree::Node< T, GetBox, Equal >
Definition at line 50 of file QuadTree.hxx.