This is the complete list of members for BOctTree< T >, including all inherited members.
| _FindClosest(int threadNum, bitoct &node, int size, int x, int y, int z) const | BOctTree< T > | inlineprotected |
| add | BOctTree< T > | protected |
| alloc | BOctTree< T > | protected |
| AllPoints(vector< T *> &vp) | BOctTree< T > | inline |
| AllPoints(bitoct &node, vector< T *> &vp) | BOctTree< T > | inlineprotected |
| BOctTree() | BOctTree< T > | inline |
| BOctTree(P *const *pts, int n, T voxelSize, PointType _pointtype=PointType(), bool _earlystop=false) | BOctTree< T > | inline |
| BOctTree(std::string filename) | BOctTree< T > | inline |
| BOctTree(vector< P *> &pts, T voxelSize, PointType _pointtype=PointType(), bool _earlystop=false) | BOctTree< T > | inline |
| BOctTree(const BOctTree &other, unsigned char *mem_ptr, unsigned int mem_max) | BOctTree< T > | inline |
| branch(bitoct &node, P *const *splitPoints, int n, T _center[3], T _size) | BOctTree< T > | inlineprotected |
| branch(bitoct &node, vector< P *> &splitPoints, T _center[3], T _size) | BOctTree< T > | inlineprotected |
| center | BOctTree< T > | protected |
| child_bit_depth | BOctTree< T > | protected |
| child_bit_depth_inv | BOctTree< T > | protected |
| childcenter(const T *pcenter, T *ccenter, T size, unsigned char i) | BOctTree< T > | inlinestatic |
| childcenter(int x, int y, int z, int &cx, int &cy, int &cz, char i, int size) | BOctTree< T > | inlinestatic |
| childIndex(const T *center, const P *point) | BOctTree< T > | inlineprotected |
| copy_children(const bitoct &other, bitoct &my) | BOctTree< T > | inlineprivate |
| countLeaves() | BOctTree< T > | inline |
| countLeaves(bitoct &node) | BOctTree< T > | inlineprotected |
| countNodes() | BOctTree< T > | inline |
| countNodes(bitoct &node) | BOctTree< T > | inlineprotected |
| countOctLeaves() | BOctTree< T > | inline |
| countOctLeaves(bitoct &node) | BOctTree< T > | inlineprotected |
| countPointsAndQueue(vector< P *> &i_points, T center[8][3], T size, bitoct &parent, T *pcenter) | BOctTree< T > | inlineprotected |
| countPointsAndQueueFast(P *const *points, int n, T center[8][3], T size, bitoct &parent, T pcenter[3]) | BOctTree< T > | inlineprotected |
| deletetNodes(bitoct &node) | BOctTree< T > | inlineprotected |
| deserialize(std::string filename) | BOctTree< T > | inline |
| deserialize(std::string filename, vector< Point > &points) | BOctTree< T > | inlinestatic |
| deserialize(std::ifstream &f, vector< Point > &vpoints, PointType &pointtype) | BOctTree< T > | inlineprotectedstatic |
| deserialize(std::ifstream &f, bitoct &node) | BOctTree< T > | inlineprotected |
| earlystop | BOctTree< T > | protected |
| FindClosest(double *point, double maxdist2, int threadNum) const | BOctTree< T > | inlineprotectedvirtual |
| FindClosestInBucket(double *point, double maxdist2, int threadNum) | BOctTree< T > | inlineprotected |
| findClosestInLeaf(bitunion< T > *node, int threadNum) const | BOctTree< T > | inlineprotected |
| fullsort(P *const *points, int n, T splitval[3], P *const *blocks[9]) | BOctTree< T > | inlineprotected |
| getByIndex(T *point, T *&points, unsigned int &length) | BOctTree< T > | inlineprotected |
| getCenter() const | BOctTree< T > | inline |
| getCenter(double _center[3]) const | BOctTree< T > | inline |
| getMaxDepth() const | BOctTree< T > | inline |
| getMaxs() const | BOctTree< T > | inline |
| getMemorySize() | BOctTree< T > | inline |
| getMins() const | BOctTree< T > | inline |
| GetOctTreeCenter(vector< T *> &c) | BOctTree< T > | inline |
| GetOctTreeCenter(vector< T *> &c, bitoct &node, T *center, T size) | BOctTree< T > | inlineprotected |
| GetOctTreeRandom(vector< T *> &c) | BOctTree< T > | inline |
| GetOctTreeRandom(vector< T *> &c, unsigned int ptspervoxel) | BOctTree< T > | inline |
| GetOctTreeRandom(vector< T *> &c, bitoct &node) | BOctTree< T > | inlineprotected |
| GetOctTreeRandom(vector< T *> &c, unsigned int ptspervoxel, bitoct &node) | BOctTree< T > | inlineprotected |
| getPointdim() const | BOctTree< T > | inline |
| getPtPairs(vector< PtPair > *pairs, double *source_alignxf, double *const *q_points, unsigned int startindex, unsigned int endindex, int thread_num, int rnd, double max_dist_match2, double &sum, double *centroid_m, double *centroid_d) | SearchTree | virtual |
| getPtPairs(vector< PtPair > *pairs, double *source_alignxf, const DataXYZ &xyz_r, unsigned int startindex, unsigned int endindex, int thread_num, int rnd, double max_dist_match2, double &sum, double *centroid_m, double *centroid_d) | SearchTree | virtual |
| getRoot() const | BOctTree< T > | inline |
| getSize() const | BOctTree< T > | inline |
| init() | BOctTree< T > | inline |
| largest_index | BOctTree< T > | protected |
| lock() | SearchTree | inlinevirtual |
| max_depth | BOctTree< T > | protected |
| maxs | BOctTree< T > | protected |
| mins | BOctTree< T > | protected |
| mult | BOctTree< T > | protected |
| params | BOctTree< T > | protectedstatic |
| pickPoint(bitoct &node) | BOctTree< T > | inline |
| POINTDIM | BOctTree< T > | protected |
| pointtype | BOctTree< T > | protected |
| readType(std::string filename) | BOctTree< T > | inlinestatic |
| real_voxelSize | BOctTree< T > | protected |
| root | BOctTree< T > | protected |
| SearchTree() | SearchTree | inline |
| SearchTree(double **pts, int n) | SearchTree | |
| serialize(std::string filename) | BOctTree< T > | inline |
| serialize(std::ofstream &of, bitoct &node) | BOctTree< T > | inlineprotected |
| size | BOctTree< T > | protected |
| sizeChildren(const bitoct &node) | BOctTree< T > | inlineprivate |
| sort(P *const *points, unsigned int n, T splitval, unsigned char index) | BOctTree< T > | inlineprotected |
| unlock() | SearchTree | inlinevirtual |
| uroot | BOctTree< T > | protected |
| voxelSize | BOctTree< T > | protected |
| ~BOctTree() | BOctTree< T > | inlinevirtual |
| ~SearchTree() | SearchTree | inlinevirtual |
| ~Tree() | Tree | inlinevirtual |