A class used for sorting a queue of tree nodes by an assigned value. More...
#include <imesh_kd_tree.h>
Public Member Functions | |
imesh_kd_tree_queue_entry () | |
Constructor. | |
imesh_kd_tree_queue_entry (double val, imesh_kd_tree_node *node) | |
Constructor. | |
bool | operator< (const imesh_kd_tree_queue_entry &right) const |
Used in sorting by distance. | |
Public Attributes | |
double | val_ |
The value. | |
imesh_kd_tree_node * | node_ |
pointer to the node. |
A class used for sorting a queue of tree nodes by an assigned value.
In the most common case this value is a distance measure
Definition at line 90 of file imesh_kd_tree.h.
imesh_kd_tree_queue_entry::imesh_kd_tree_queue_entry | ( | ) | [inline] |
Constructor.
Definition at line 94 of file imesh_kd_tree.h.
imesh_kd_tree_queue_entry::imesh_kd_tree_queue_entry | ( | double | val, |
imesh_kd_tree_node * | node | ||
) | [inline] |
Constructor.
Definition at line 96 of file imesh_kd_tree.h.
bool imesh_kd_tree_queue_entry::operator< | ( | const imesh_kd_tree_queue_entry & | right | ) | const [inline] |
Used in sorting by distance.
Definition at line 100 of file imesh_kd_tree.h.
pointer to the node.
Definition at line 106 of file imesh_kd_tree.h.
The value.
Definition at line 104 of file imesh_kd_tree.h.