AABBtree::Tree< Real, N > Member List

This is the complete list of members for AABBtree::Tree< Real, N >, including all inherited members.

Box typedef	AABBtree::Tree< Real, N >	private
box(Integer const i) const	AABBtree::Tree< Real, N >	inline
boxes() const	AABBtree::Tree< Real, N >	inline
BoxUniquePtr typedef	AABBtree::Tree< Real, N >	private
BoxUniquePtrList typedef	AABBtree::Tree< Real, N >	private
build(std::unique_ptr< BoxUniquePtrList > boxes_ptr)	AABBtree::Tree< Real, N >	inline
clear()	AABBtree::Tree< Real, N >	inline
closest(Object const &obj, Integer const n, IndexSet &candidates, Function distance_function=[](Object const &o, Box const &b) {return b.interior_distance(o);}) const	AABBtree::Tree< Real, N >	inline
depth(Integer const i, Integer &d) const	AABBtree::Tree< Real, N >	inline
disable_dumping_mode()	AABBtree::Tree< Real, N >	inline
distance(Object const &obj, IndexSet &candidates) const	AABBtree::Tree< Real, N >	inline
distance(Tree const &tree, IndexMap &candidates) const	AABBtree::Tree< Real, N >	inline
DUMMY_TOL	AABBtree::Tree< Real, N >	static
dumping_mode(bool const mode)	AABBtree::Tree< Real, N >	inline
enable_dumping_mode()	AABBtree::Tree< Real, N >	inline
EPS	AABBtree::Tree< Real, N >	static
INF	AABBtree::Tree< Real, N >	static
intersect(Object const &obj, IndexSet &candidates) const	AABBtree::Tree< Real, N >	inline
intersect(Tree const &tree, IndexMap &candidates) const	AABBtree::Tree< Real, N >	inline
is_empty() const	AABBtree::Tree< Real, N >	inline
m_balance_ratio_tolerance	AABBtree::Tree< Real, N >	private
m_boxes_ptr	AABBtree::Tree< Real, N >	private
m_check_counter	AABBtree::Tree< Real, N >	mutableprivate
m_dump_counter	AABBtree::Tree< Real, N >	mutableprivate
m_dumping_mode	AABBtree::Tree< Real, N >	private
m_max_nodal_objects	AABBtree::Tree< Real, N >	private
m_queue	AABBtree::Tree< Real, N >	mutableprivate
m_separation_ratio_tolerance	AABBtree::Tree< Real, N >	private
m_stack	AABBtree::Tree< Real, N >	mutableprivate
m_tree_boxes_map	AABBtree::Tree< Real, N >	private
m_tree_structure	AABBtree::Tree< Real, N >	private
max_nodal_objects(Integer const n)	AABBtree::Tree< Real, N >	inline
max_nodal_objects() const	AABBtree::Tree< Real, N >	inline
node(Integer const i) const	AABBtree::Tree< Real, N >	inline
nodes(Integer const i, Integer &l, Integer &n, Integer &b) const	AABBtree::Tree< Real, N >	inline
Point typedef	AABBtree::Tree< Real, N >	private
print(OutStream &os) const	AABBtree::Tree< Real, N >	inline
PriorityQueue typedef	AABBtree::Tree< Real, N >	private
QueueItem typedef	AABBtree::Tree< Real, N >	private
self_intersect(IndexSet &candidates) const	AABBtree::Tree< Real, N >	inline
separation_ratio_tolerance(Real const ratio)	AABBtree::Tree< Real, N >	inline
separation_ratio_tolerance() const	AABBtree::Tree< Real, N >	inline
size() const	AABBtree::Tree< Real, N >	inline
stats(Statistics &stats) const	AABBtree::Tree< Real, N >	inline
structure() const	AABBtree::Tree< Real, N >	inline
Tree()=default	AABBtree::Tree< Real, N >
Vector typedef	AABBtree::Tree< Real, N >	private
within_distance(Object const &obj, Real const max_distance, IndexSet &candidates, Function distance_function=[](Object const &o, Box const &b) {return b.interior_distance(o);}) const	AABBtree::Tree< Real, N >	inline
~Tree()=default	AABBtree::Tree< Real, N >