UT_KDTree Member List

This is the complete list of members for UT_KDTree, including all inherited members.

balance(bool enable_multithreading=true)	UT_KDTree	protected
balanceSet(int &split, fpreal &radius, int *list, int entries, fpreal *boxmin, fpreal *boxmax, UT_Lock *splitlock)	UT_KDTree	protected
buildIfNeeded(bool enable_multithreading=true)	UT_KDTree	inlinevirtual
comparePosition(int idx0, int idx1, int dim) const =0	UT_KDTree	pure virtual
computeBox(int start_index=0)	UT_KDTree	protected
createQueue()	UT_KDTree	static
filterVolume(VolumeData &data, const UT_Vector3 &pos, const UT_Filter &filter, const AggregateVolume &aggdata, int max_nodes)	UT_KDTree
findAllClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared)	UT_KDTree	inline
findClosest(const QueryPoint &pt, fpreal max_distance_squared)	UT_KDTree
findClosest(UT_IntArray &list, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree
findClosest(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree
findClosest(ut_KDPQueue &list, const QueryPoint &pt)	UT_KDTree	protected
findClosestQueue(const QueryPoint &pt, ut_KDPQueue &queue, fpreal max_distance_squared)	UT_KDTree
findClosestQueue(UT_IntArray &list, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree
findClosestQueue(UT_IntArray &list, UT_FloatArray &dist, const QueryPoint &pt, ut_KDPQueue &q, fpreal max_distance_squared, int max_nodes, bool sorted=true)	UT_KDTree
findInLeaf(ut_KDPQueue &list, const QueryPoint &pt, int lo, int hi, int invalid_limit, int &invalid) const	UT_KDTree	protected
findNClosest(UT_IntArray &list, const QueryPoint &pt, int max_nodes)	UT_KDTree	inline
flagDirty()	UT_KDTree	inline
getBoxMax()	UT_KDTree
getBoxMin()	UT_KDTree
getEntries() const	UT_KDTree	inline
getHead() const	UT_KDTree	inlineprotected
getInvalidLimit(int maxn) const	UT_KDTree	inlinevirtual
getMemoryUsage(bool inclusive) const	UT_KDTree	inline
getP(int idx) const =0	UT_KDTree	pure virtual
getRadius(int) const	UT_KDTree	inlinevirtual
getRebalanceCount() const	UT_KDTree	inline
growEntries(size_t amount)	UT_KDTree
isBalanced() const	UT_KDTree	inlineprotected
isBoxClose(const fpreal *P, fpreal qd, fpreal r) const	UT_KDTree	protected
isValid(int) const	UT_KDTree	inlinevirtual
isValid(int idx, const UT_KDQueryPt &) const	UT_KDTree	inlinevirtual
isValid(int node, const UT_KDTubeQuery &) const	UT_KDTree	inlineprotected
isValid(int node, const UT_KDLineQuery &) const	UT_KDTree	inlineprotected
isValid(int node, const UT_KDTriQuery &) const	UT_KDTree	inlineprotected
isValid(int node, const UT_KDTetQuery &) const	UT_KDTree	inlineprotected
isValid(int node, const UT_KDQueryPtUnitWrap &) const	UT_KDTree	inlineprotected
myBalanced	UT_KDTree	protected
myBalancer	UT_KDTree	protected
myBMax	UT_KDTree	protected
myBMin	UT_KDTree	protected
myBoxComputed	UT_KDTree	protected
myDim	UT_KDTree	protected
myEntries	UT_KDTree	protected
myFullEntries	UT_KDTree	protected
myHasRadius	UT_KDTree	protected
myList	UT_KDTree	protected
myLock	UT_KDTree	protected
myMaxLeafNodes	UT_KDTree	protected
myRebalanceCount	UT_KDTree	protected
mySplits	UT_KDTree	protected
pointsHaveRadius() const	UT_KDTree	inlinevirtual
recurseFind(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	protected
recurseFindTri(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	protected
recurseFindTube(ut_KDPQueue &list, const QueryPoint &pt, int split, int lo, int hi) const	UT_KDTree	protected
setBalancer(ut_KDBalancer balance)	UT_KDTree	inline
setEntries(size_t size)	UT_KDTree
setMaxLeafNodes(int max_leaf_nodes)	UT_KDTree	inline
setRebalanceCount(size_t count)	UT_KDTree
traverse(Visitor &visitor)	UT_KDTree
traverseRecursive(Visitor &visitor, int split, int nodeid, UT_BoundingBox &box, int lo, int hi)	UT_KDTree	protected
UT_KD_CENTROID enum value	UT_KDTree
UT_KD_MEDIAN enum value	UT_KDTree
UT_KD_SAH enum value	UT_KDTree
ut_KDBalancer enum name	UT_KDTree
ut_KDPQueueDeleter class	UT_KDTree	friend
UT_KDTree(int dim=3, size_t size=0)	UT_KDTree	inline
~UT_KDTree()	UT_KDTree	virtual