#include <BSPTree.h>
|
| | BSPTree (const int64_t maxnodepts=64, const int64_t initsize=4) |
| |
| | BSPTree (const BSPTree &other) |
| |
| | ~BSPTree () |
| |
| int64_t | numPoints () const |
| |
| const Geom::Pnt & | getPoint (const int64_t idx) const |
| |
| void | getPoint (const int64_t idx, Geom::Pnt &pt) const |
| |
| void * | getUserData (const int64_t idx) const |
| |
| void | setUserData (const int64_t idx, void *const data) |
| |
| int64_t | addPoint (const Geom::Pnt &pt, void *const userdata=NULL) |
| |
| int64_t | removePoint (const Geom::Pnt &pt) |
| |
| void | removePoint (const int64_t idx) |
| |
| int64_t | findPoint (const Geom::Pnt &pos) const |
| |
| void | clear () |
| |
| void | findPoints (const Geom::Sphr &sphere, std::vector< int64_t > &array) const |
| |
| int64_t | findClosest (const Geom::Sphr &sphere, std::vector< int64_t > &array) const |
| |
| void | findPoints (const Geom::Pnt &pnt, const double &tol, std::vector< int64_t > &array) const |
| |
| int64_t | findClosest (const Geom::Pnt &pnt, const double &tol, std::vector< int64_t > &array) const |
| |
| int64_t | findClosest (const Geom::Pnt &pnt, const double &tol) const |
| |
| bool | operator== (const BSPTree &other) const |
| |
| BSPTree & | operator= (const BSPTree &rhs) |
| |
|
| static void | removeFast (std::vector< int64_t > &array, int64_t idx) |
| |
| static void | removeFast (std::vector< Geom::Pnt > &array, int64_t idx) |
| |
| static void | removeFast (std::vector< void * > &array, int64_t idx) |
| |
◆ BSPTree() [1/2]
| Geom::BSPTree::BSPTree |
( |
const int64_t |
maxnodepts = 64, |
|
|
const int64_t |
initsize = 4 |
|
) |
| |
◆ BSPTree() [2/2]
| Geom::BSPTree::BSPTree |
( |
const BSPTree & |
other | ) |
|
◆ ~BSPTree()
| Geom::BSPTree::~BSPTree |
( |
| ) |
|
◆ addPoint()
| int64_t Geom::BSPTree::addPoint |
( |
const Geom::Pnt & |
pt, |
|
|
void *const |
userdata = NULL |
|
) |
| |
◆ clear()
| void Geom::BSPTree::clear |
( |
| ) |
|
◆ findClosest() [1/3]
| int64_t Geom::BSPTree::findClosest |
( |
const Geom::Sphr & |
sphere, |
|
|
std::vector< int64_t > & |
array |
|
) |
| const |
◆ findClosest() [2/3]
| int64_t Geom::BSPTree::findClosest |
( |
const Geom::Pnt & |
pnt, |
|
|
const double & |
tol, |
|
|
std::vector< int64_t > & |
array |
|
) |
| const |
◆ findClosest() [3/3]
| int64_t Geom::BSPTree::findClosest |
( |
const Geom::Pnt & |
pnt, |
|
|
const double & |
tol |
|
) |
| const |
◆ findPoint()
| int64_t Geom::BSPTree::findPoint |
( |
const Geom::Pnt & |
pos | ) |
const |
◆ findPoints() [1/2]
| void Geom::BSPTree::findPoints |
( |
const Geom::Sphr & |
sphere, |
|
|
std::vector< int64_t > & |
array |
|
) |
| const |
◆ findPoints() [2/2]
| void Geom::BSPTree::findPoints |
( |
const Geom::Pnt & |
pnt, |
|
|
const double & |
tol, |
|
|
std::vector< int64_t > & |
array |
|
) |
| const |
◆ getPoint() [1/2]
| const Geom::Pnt& Geom::BSPTree::getPoint |
( |
const int64_t |
idx | ) |
const |
◆ getPoint() [2/2]
| void Geom::BSPTree::getPoint |
( |
const int64_t |
idx, |
|
|
Geom::Pnt & |
pt |
|
) |
| const |
◆ getUserData()
| void* Geom::BSPTree::getUserData |
( |
const int64_t |
idx | ) |
const |
◆ numPoints()
| int64_t Geom::BSPTree::numPoints |
( |
| ) |
const |
◆ operator=()
◆ operator==()
| bool Geom::BSPTree::operator== |
( |
const BSPTree & |
other | ) |
const |
◆ removeFast() [1/3]
| static void Geom::BSPTree::removeFast |
( |
std::vector< int64_t > & |
array, |
|
|
int64_t |
idx |
|
) |
| |
|
static |
◆ removeFast() [2/3]
| static void Geom::BSPTree::removeFast |
( |
std::vector< Geom::Pnt > & |
array, |
|
|
int64_t |
idx |
|
) |
| |
|
static |
◆ removeFast() [3/3]
| static void Geom::BSPTree::removeFast |
( |
std::vector< void * > & |
array, |
|
|
int64_t |
idx |
|
) |
| |
|
static |
◆ removePoint() [1/2]
| int64_t Geom::BSPTree::removePoint |
( |
const Geom::Pnt & |
pt | ) |
|
◆ removePoint() [2/2]
| void Geom::BSPTree::removePoint |
( |
const int64_t |
idx | ) |
|
◆ setUserData()
| void Geom::BSPTree::setUserData |
( |
const int64_t |
idx, |
|
|
void *const |
data |
|
) |
| |
◆ base_bspnode
| friend class base_bspnode |
|
friend |
The documentation for this class was generated from the following file:
- D:/CadworkJobs/Softwareprojekte/Lexocad/V28.0/lexocad/Geom/include/Geom/BSPTree.h