, including all inherited members.
| acc_type typedef | lti::kdTree< T, D, U > | |
| add(const T &point, const D &data) | lti::kdTree< T, D, U > | |
| appendStatusString(const char *msg) const | lti::status | [virtual] |
| appendStatusString(const int &msg) const | lti::status | [virtual] |
| appendStatusString(const double &msg) const | lti::status | [virtual] |
| appendStatusString(const status &other) const | lti::status | [virtual] |
| build(const int bucketSize=1) | lti::kdTree< T, D, U > | |
| clear() | lti::kdTree< T, D, U > | [virtual] |
| clone() const | lti::kdTree< T, D, U > | [virtual] |
| copy(const kdTree &other) | lti::kdTree< T, D, U > | |
| distantor | lti::kdTree< T, D, U > | [protected] |
| empty() const | lti::kdTree< T, D, U > | [virtual] |
| getLevels() const | lti::kdTree< T, D, U > | [virtual] |
| getNumberOfAddedElements() const | lti::kdTree< T, D, U > | [virtual] |
| getNumberOfLeaves() const | lti::kdTree< T, D, U > | [virtual] |
| getRoot() | lti::kdTree< T, D, U > | [virtual] |
| getStatusString() const | lti::status | [virtual] |
| getTypeName() const | lti::kdTree< T, D, U > | [virtual] |
| initialize() | lti::object | [protected] |
| ioObject() | lti::ioObject | |
| ioObject(const ioObject &other) | lti::ioObject | |
| kdTree() | lti::kdTree< T, D, U > | |
| kdTree(const kdTree &other) | lti::kdTree< T, D, U > | |
| levels | lti::kdTree< T, D, U > | [protected] |
| ltiLibInitialized | lti::object | [protected, static] |
| numAddedElements | lti::kdTree< T, D, U > | [protected] |
| numElements | lti::kdTree< T, D, U > | [protected] |
| numLeaves | lti::kdTree< T, D, U > | [protected] |
| object() | lti::object | |
| operator=(const kdTree &other) | lti::kdTree< T, D, U > | |
| points | lti::kdTree< T, D, U > | [protected] |
| read(ioHandler &handler, const bool complete=true) | lti::kdTree< T, D, U > | [virtual] |
| rebuild(const int bucketSize=1) | lti::kdTree< T, D, U > | |
| root | lti::kdTree< T, D, U > | [protected] |
| searchBestBinFirst(const int k, const T &key, const int emax, std::list< element * > &neighbors) const | lti::kdTree< T, D, U > | |
| searchBestBinFirst(const int k, const T &key, const int emax, std::multimap< acc_type, element * > &neighbors) const | lti::kdTree< T, D, U > | |
| searchExactly(const T &key, element &elem) const | lti::kdTree< T, D, U > | |
| searchExactly(const T &key, std::list< element > &elems) const | lti::kdTree< T, D, U > | |
| searchNearest(const T &key, element *&elem) const | lti::kdTree< T, D, U > | |
| searchNearest(const T &key, element *&elem, acc_type &dist) const | lti::kdTree< T, D, U > | |
| searchNearest(const T &key, element &elem) const | lti::kdTree< T, D, U > | |
| searchNearest(const T &key, element &elem, acc_type &dist) const | lti::kdTree< T, D, U > | |
| searchNearest(const T &key, D &data) const | lti::kdTree< T, D, U > | |
| searchNearest(const int k, const T &key, std::list< element * > &neighbors) const | lti::kdTree< T, D, U > | |
| searchNearest(const int k, const T &key, std::multimap< acc_type, element * > &neighbors) const | lti::kdTree< T, D, U > | |
| searchRange(const T &boxMin, const T &boxMax, std::list< element * > &neighbors) const | lti::kdTree< T, D, U > | |
| searchWithin(const T &key, const acc_type &dist, std::list< element * > &elems) const | lti::kdTree< T, D, U > | |
| searchWithin(const T &key, const acc_type &dist, std::multimap< acc_type, element * > &neighbors) const | lti::kdTree< T, D, U > | |
| setStatusString(const char *msg) const | lti::status | [virtual] |
| size() const | lti::kdTree< T, D, U > | [virtual] |
| size_type typedef | lti::kdTree< T, D, U > | |
| status() | lti::status | |
| totalBounds | lti::kdTree< T, D, U > | [protected] |
| value_type typedef | lti::kdTree< T, D, U > | |
| write(ioHandler &handler, const bool complete=true) const | lti::kdTree< T, D, U > | [virtual] |
| ~ioObject() | lti::ioObject | [virtual] |
| ~kdTree() | lti::kdTree< T, D, U > | [virtual] |
| ~object() | lti::object | [virtual] |
| ~status() | lti::status | [virtual] |
