| QGIS API Documentation
    3.20.0-Odense (decaadbb31)
    | 
Custom priority queue for use in pal labeling engine. More...
#include <priorityqueue.h>
| Public Member Functions | |
| PriorityQueue (const PriorityQueue &)=delete | |
| PriorityQueue cannot be copied.  More... | |
| PriorityQueue (int n, int maxId, bool min) | |
| Create a priority queue of max size n \param n max size of the queuet \param p external vector representing the priority \param min best element has the smallest p when min is trueand has the biggest when min isfalse.  More... | |
| ~PriorityQueue () | |
| void | decreaseKey (int key) | 
| void | downheap (int id) | 
| int | getBest () | 
| int | getId (int key) | 
| int | getSize () | 
| int | getSizeByPos () | 
| void | insert (int key, double p) | 
| bool | isIn (int key) | 
| PriorityQueue & | operator= (const PriorityQueue &)=delete | 
| PriorityQueue cannot be copied.  More... | |
| void | print () | 
| void | remove (int key) | 
| void | setPriority (int key, double new_p) | 
| void | sort () | 
| void | upheap (int key) | 
Custom priority queue for use in pal labeling engine.
Definition at line 52 of file priorityqueue.h.
| PriorityQueue::PriorityQueue | ( | int | n, | 
| int | maxId, | ||
| bool | min | ||
| ) | 
Create a priority queue of max size n \param n max size of the queuet \param p external vector representing the priority \param min best element has the smallest p when min is true and has the biggest when min is false. 
Definition at line 48 of file priorityqueue.cpp.
| PriorityQueue::~PriorityQueue | ( | ) | 
Definition at line 69 of file priorityqueue.cpp.
| 
 | delete | 
PriorityQueue cannot be copied.
| void PriorityQueue::decreaseKey | ( | int | key | ) | 
Definition at line 273 of file priorityqueue.cpp.
| void PriorityQueue::downheap | ( | int | id | ) | 
Definition at line 211 of file priorityqueue.cpp.
| int PriorityQueue::getBest | ( | ) | 
Definition at line 82 of file priorityqueue.cpp.
| int PriorityQueue::getId | ( | int | key | ) | 
Definition at line 111 of file priorityqueue.cpp.
| int PriorityQueue::getSize | ( | ) | 
Definition at line 76 of file priorityqueue.cpp.
| int PriorityQueue::getSizeByPos | ( | ) | 
Definition at line 307 of file priorityqueue.cpp.
| void PriorityQueue::insert | ( | int | key, | 
| double | p | ||
| ) | 
Definition at line 116 of file priorityqueue.cpp.
| bool PriorityQueue::isIn | ( | int | key | ) | 
Definition at line 106 of file priorityqueue.cpp.
| 
 | delete | 
PriorityQueue cannot be copied.
| void PriorityQueue::print | ( | ) | 
Definition at line 291 of file priorityqueue.cpp.
| void PriorityQueue::remove | ( | int | key | ) | 
Definition at line 134 of file priorityqueue.cpp.
| void PriorityQueue::setPriority | ( | int | key, | 
| double | new_p | ||
| ) | 
Definition at line 252 of file priorityqueue.cpp.
| void PriorityQueue::sort | ( | ) | 
Definition at line 154 of file priorityqueue.cpp.
| void PriorityQueue::upheap | ( | int | key | ) | 
Definition at line 168 of file priorityqueue.cpp.