an entry of the heap tree More...
#include <index_heap.h>
Public Member Functions | |
Entry (const IT index, const VT value) | |
create a new entry | |
Public Attributes | |
IT | index |
index of point | |
VT | value |
distance for this point | |
Friends | |
bool | operator< (const Entry &e0, const Entry &e1) |
return true if e0 is of lower value than e1, false otherwise |
an entry of the heap tree
Definition at line 60 of file index_heap.h.
Nabo::IndexHeapSTL< IT, VT >::Entry::Entry | ( | const IT | index, |
const VT | value | ||
) | [inline] |
create a new entry
Definition at line 66 of file index_heap.h.
return true if e0 is of lower value than e1, false otherwise
Definition at line 68 of file index_heap.h.
IT Nabo::IndexHeapSTL< IT, VT >::Entry::index |
index of point
Definition at line 62 of file index_heap.h.
VT Nabo::IndexHeapSTL< IT, VT >::Entry::value |
distance for this point
Definition at line 63 of file index_heap.h.