Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
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) noexceptK2Tree< T >inlineprivate
bu_search(Node *root, const Point &p) noexceptK2Tree< T >inlineprivatestatic
contains(const Point &p) const noexceptK2Tree< T >inline
destroy_tree(Node *node) noexceptK2Tree< T >inlineprivate
insert(const Point &p)K2Tree< T >inline
is_empty() const noexceptK2Tree< T >inline
K2Tree()K2Tree< T >inline
K2Tree(const Point &__pmin, const 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 &)=deleteK2Tree< T >
lr_insert(Node *root, const Point &p)K2Tree< T >inlineprivate
lr_nearest(Node *root, const Point &p) noexceptK2Tree< T >inlineprivate
lr_search(Node *root, const Point &p) noexceptK2Tree< T >inlineprivatestatic
min_dist2K2Tree< T >private
min_nodeK2Tree< T >private
NK2Tree< T >private
nearest(const Point &p) noexceptK2Tree< T >inline
operator=(const K2Tree &)=deleteK2Tree< T >
pmaxK2Tree< T >private
pminK2Tree< T >private
range(Node *root, const Rectangle &rect, DynList< Point > *q)K2Tree< T >inlineprivatestatic
range(const Rectangle &rect, DynList< Point > *l)K2Tree< T >inline
rootK2Tree< T >private
size() const noexceptK2Tree< T >inline
~K2Tree()K2Tree< T >inline