QGIS API Documentation  2.99.0-Master (c42dad3)
priorityqueue.h
Go to the documentation of this file.
1 /*
2  * libpal - Automated Placement of Labels Library
3  *
4  * Copyright (C) 2008 Maxence Laurent, MIS-TIC, HEIG-VD
5  * University of Applied Sciences, Western Switzerland
6  * http://www.hes-so.ch
7  *
8  * Contact:
9  * maxence.laurent <at> heig-vd <dot> ch
10  * or
11  * eric.taillard <at> heig-vd <dot> ch
12  *
13  * This file is part of libpal.
14  *
15  * libpal is free software: you can redistribute it and/or modify
16  * it under the terms of the GNU General Public License as published by
17  * the Free Software Foundation, either version 3 of the License, or
18  * (at your option) any later version.
19  *
20  * libpal is distributed in the hope that it will be useful,
21  * but WITHOUT ANY WARRANTY; without even the implied warranty of
22  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23  * GNU General Public License for more details.
24  *
25  * You should have received a copy of the GNU General Public License
26  * along with libpal. If not, see <http://www.gnu.org/licenses/>.
27  *
28  */
29 
30 #ifndef PAL_PRIORITYQUEUE_H
31 #define PAL_PRIORITYQUEUE_H
32 
33 #include <iostream>
34 
35 #define LEFT(x) (2*x+1)
36 #define RIGHT(x) (2*x+2)
37 #define PARENT(x) ((x-1)/2)
38 
39 
40 namespace pal
41 {
42 
49  {
50 
51  public:
52 
58  PriorityQueue( int n, int maxId, bool min );
60 
61  void print();
62 
63  int getSize();
64  int getSizeByPos();
65 
66  bool isIn( int key );
67 
68  int getBest(); // O(log n)
69 
70  void remove( int key );
71  void insert( int key, double p );
72 
73  void sort(); // O(n log n)
74 
75  void downheap( int id );
76  void upheap( int key );
77 
78  void decreaseKey( int key );
79  void setPriority( int key, double new_p );
80 
81 
82  int getId( int key );
83  private:
84  PriorityQueue( const PriorityQueue & );
85  PriorityQueue &operator=( const PriorityQueue & );
86 
87  int size;
88  int maxsize;
89  int maxId;
90  int *heap;
91  double *p;
92  int *pos;
93 
94  bool ( *greater )( double l, double r );
95  };
96 
97 } // namespace
98 
99 #endif
bool isIn(int key)
void upheap(int key)
void downheap(int id)
double ANALYSIS_EXPORT min(double x, double y)
Returns the minimum of two doubles or the first argument if both are equal.
Definition: MathUtils.cc:452
void insert(int key, double p)
void setPriority(int key, double new_p)
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 repres...
void decreaseKey(int key)