#include <RTree.h>
◆ Box2dRTree() [1/3]
Geom::Box2dRTree::Box2dRTree |
( |
| ) |
|
◆ Box2dRTree() [2/3]
Geom::Box2dRTree::Box2dRTree |
( |
const std::vector< Value > & |
values | ) |
|
◆ Box2dRTree() [3/3]
Geom::Box2dRTree::Box2dRTree |
( |
const Box2dRTree & |
other | ) |
|
◆ ~Box2dRTree()
Geom::Box2dRTree::~Box2dRTree |
( |
| ) |
|
◆ hasIntersection() [1/2]
bool Geom::Box2dRTree::hasIntersection |
( |
const Bnd_Box & |
bbox | ) |
const |
◆ hasIntersection() [2/2]
bool Geom::Box2dRTree::hasIntersection |
( |
const RTree::Box2d & |
bbox | ) |
const |
◆ insert() [1/2]
void Geom::Box2dRTree::insert |
( |
const Bnd_Box & |
bbox, |
|
|
uintptr_t |
userData |
|
) |
| |
◆ insert() [2/2]
void Geom::Box2dRTree::insert |
( |
const Value & |
value | ) |
|
◆ queryIntersects() [1/2]
void Geom::Box2dRTree::queryIntersects |
( |
const Bnd_Box & |
bbox, |
|
|
std::vector< uintptr_t > & |
userDataVec |
|
) |
| const |
◆ queryIntersects() [2/2]
void Geom::Box2dRTree::queryIntersects |
( |
const RTree::Box2d & |
bbox, |
|
|
std::vector< uintptr_t > & |
userDataVec |
|
) |
| const |
◆ remove() [1/2]
bool Geom::Box2dRTree::remove |
( |
const Bnd_Box & |
bbox, |
|
|
uintptr_t |
userData |
|
) |
| |
◆ remove() [2/2]
bool Geom::Box2dRTree::remove |
( |
const Value & |
value | ) |
|
The documentation for this class was generated from the following file:
- D:/CadworkJobs/Softwareprojekte/Lexocad/V27.0/lexocad/Geom/include/Geom/RTree.h