, including all inherited members.
| add(const T &point, const D &data) | cvr::kdTree< T, D, U > | |
| build(const int bucketSize=1) | cvr::kdTree< T, D, U > | |
| buildName() const | cvr::object | [protected, virtual] |
| clear() | cvr::kdTree< T, D, U > | [virtual] |
| clone() const | cvr::kdTree< T, D, U > | [virtual] |
| copy(const kdTree< T, D, U > &other) | cvr::kdTree< T, D, U > | |
| distance_type typedef | cvr::kdTree< T, D, U > | |
| distantor_ | cvr::kdTree< T, D, U > | [protected] |
| empty() const | cvr::kdTree< T, D, U > | [virtual] |
| getNumberOfAddedElements() const | cvr::kdTree< T, D, U > | [virtual] |
| getNumberOfLeaves() const | cvr::kdTree< T, D, U > | [virtual] |
| getNumberOfLevels() const | cvr::kdTree< T, D, U > | [virtual] |
| getRoot() | cvr::kdTree< T, D, U > | [virtual] |
| getStatusObject() const | cvr::status | |
| getStatusString() const | cvr::status | |
| ioObject() | cvr::ioObject | |
| kdTree() | cvr::kdTree< T, D, U > | |
| kdTree(const kdTree< T, D, U > &other) | cvr::kdTree< T, D, U > | |
| levels_ | cvr::kdTree< T, D, U > | [protected] |
| MaxIndex | cvr::container | [static] |
| MinIndex | cvr::container | [static] |
| mmap_type typedef | cvr::kdTree< T, D, U > | |
| name() const | cvr::kdTree< T, D, U > | [virtual] |
| newInstance() const | cvr::kdTree< T, D, U > | [virtual] |
| numAddedElements_ | cvr::kdTree< T, D, U > | [protected] |
| numElements_ | cvr::kdTree< T, D, U > | [protected] |
| numLeaves_ | cvr::kdTree< T, D, U > | [protected] |
| object() | cvr::object | |
| operator=(const kdTree< T, D, U > &other) | cvr::kdTree< T, D, U > | |
| read(ioHandler &handler, const bool complete=true) | cvr::kdTree< T, D, U > | [virtual] |
| rebuild(const int bucketSize=1) | cvr::kdTree< T, D, U > | |
| root_ | cvr::kdTree< T, D, U > | [protected] |
| searchBestBinFirst(const int k, const T &key, const int emax, std::list< element * > &neighbors) const | cvr::kdTree< T, D, U > | |
| searchBestBinFirst(const int k, const T &key, const int emax, mmap_type &neighbors) const | cvr::kdTree< T, D, U > | |
| searchExactly(const T &key, element &elem) const | cvr::kdTree< T, D, U > | |
| searchExactly(const T &key, std::list< element > &elems) const | cvr::kdTree< T, D, U > | |
| searchNearest(const T &key, element *&elem) const | cvr::kdTree< T, D, U > | |
| searchNearest(const T &key, element *&elem, distance_type &dist) const | cvr::kdTree< T, D, U > | |
| searchNearest(const T &key, element &elem) const | cvr::kdTree< T, D, U > | |
| searchNearest(const T &key, element &elem, distance_type &dist) const | cvr::kdTree< T, D, U > | |
| searchNearest(const T &key, D &data) const | cvr::kdTree< T, D, U > | |
| searchNearest(const int k, const T &key, std::list< element * > &neighbors) const | cvr::kdTree< T, D, U > | |
| searchNearest(const int k, const T &key, mmap_type &neighbors) const | cvr::kdTree< T, D, U > | |
| searchRange(const T &boxMin, const T &boxMax, std::list< element * > &neighbors) const | cvr::kdTree< T, D, U > | |
| searchWithin(const T &key, const distance_type &dist, std::list< element * > &elems) const | cvr::kdTree< T, D, U > | |
| searchWithin(const T &key, const distance_type &dist, mmap_type &neighbors) const | cvr::kdTree< T, D, U > | |
| setStatusMonitor(statusMonitor &monitor) | cvr::status | [static] |
| setStatusString(const char *msg) const | cvr::status | |
| setStatusString(const std::string &msg) const | cvr::status | |
| size() const | cvr::kdTree< T, D, U > | [virtual] |
| size_type typedef | cvr::kdTree< T, D, U > | |
| status() | cvr::status | |
| status(const status &other) | cvr::status | |
| totalBounds_ | cvr::kdTree< T, D, U > | [protected] |
| treePoints_ | cvr::kdTree< T, D, U > | [protected] |
| value_type typedef | cvr::kdTree< T, D, U > | |
| write(ioHandler &handler, const bool complete=true) const | cvr::kdTree< T, D, U > | [virtual] |
| ~ioObject() | cvr::ioObject | [virtual] |
| ~kdTree() | cvr::kdTree< T, D, U > | [virtual] |
| ~object() | cvr::object | [virtual] |
| ~status() | cvr::status | [virtual] |
