K2Tree< T > Member List

This is the complete list of members for K2Tree< T >, including all inherited members.

bu_insert(Node *root, const Point &p)	K2Tree< T >	inlineprivate
bu_nearest(Node *root, const Point &p, NearestState &st) noexcept	K2Tree< T >	inlineprivatestatic
bu_search(Node *root, const Point &p) noexcept	K2Tree< T >	inlineprivatestatic
build(Array< Point > points, const Point &pmin, const Point &pmax)	K2Tree< T >	inlinestatic
build_balanced(Array< Point > &pts, const size_t lo, const size_t hi, const bool split_x, const Point &rmin, const Point &rmax)	K2Tree< T >	inlineprivatestatic
contains(const Point &p) const noexcept	K2Tree< T >	inline
destroy_tree(Node *node) noexcept	K2Tree< T >	inlineprivate
for_each(Op &&op) const	K2Tree< T >	inline
for_each_node(const Node *node, Op &&op)	K2Tree< T >	inlineprivatestatic
insert(const Point &p)	K2Tree< T >	inline
is_empty() const noexcept	K2Tree< T >	inline
K2Tree()	K2Tree< T >	inline
K2Tree(Point pmin, Point pmax)	K2Tree< T >	inline
K2Tree(const Geom_Number &xmin, const Geom_Number &ymin, const Geom_Number &xmax, const Geom_Number &ymax)	K2Tree< T >	inline
K2Tree(const K2Tree &)=delete	K2Tree< T >
K2Tree(K2Tree &&other) noexcept	K2Tree< T >	inline
lr_insert(Node *root, const Point &p)	K2Tree< T >	inlineprivate
lr_nearest(Node *root, const Point &p, NearestState &st) noexcept	K2Tree< T >	inlineprivatestatic
lr_search(Node *root, const Point &p) noexcept	K2Tree< T >	inlineprivatestatic
N_	K2Tree< T >	private
nearest(const Point &p) const noexcept	K2Tree< T >	inline
operator=(const K2Tree &)=delete	K2Tree< T >
operator=(K2Tree &&other) noexcept	K2Tree< T >	inline
pmax_	K2Tree< T >	private
pmin_	K2Tree< T >	private
range(Node *root, const Rectangle &rect, DynList< Point > *q)	K2Tree< T >	inlineprivatestatic
range(const Rectangle &rect, DynList< Point > *l) const	K2Tree< T >	inline
root_	K2Tree< T >	private
size() const noexcept	K2Tree< T >	inline
~K2Tree()	K2Tree< T >	inline