OpenCV
4.0.0
Open Source Computer Vision
|
#include "heap.h"
Classes | |
struct | CompareT |
Public Member Functions | |
Heap (int sz) | |
void | clear () |
bool | empty () |
void | insert (T value) |
bool | popMin (T &value) |
int | size () |
Priority Queue Implementation
The priority queue is implemented with a heap. A heap is a complete (full) binary tree in which each parent is less than both of its children, but the order of the children is unspecified.
|
inline |
Constructor.
Params: sz = heap size
|
inline |
Clears the heap.
|
inline |
Tests if the heap is empty
Returns: true is heap empty, false otherwise
|
inline |
Insert a new element in the heap.
We select the next empty leaf node, and then keep moving any larger parents down until the right location is found to store this element.
Params: value = the new element to be inserted in the heap
|
inline |
Returns the node of minimum value from the heap (top of the heap).
Params: value = out parameter used to return the min element Returns: false if heap empty
|
inline |
Returns: heap size