TANNpr_queue = class(TObject);
Priority queue A priority queue is a list of items, along with associated priorities. The basic operations are insert and extract_minimum.
The priority queue is maintained using a standard binary heap. (Implementation note: Indexing is performed from [1..max] rather than the C standard of [0..max-1]. This simplifies parent/child computations.) User information consists of a void pointer, and the user is responsible for casting this quantity into whatever useful form is desired.
Because the priority queue is so central to the efficiency of query processing, all the code is inline.
TObject Recognion_NearestNeighbor.TANNpr_queue