QGIS API Documentation  2.11.0-Master
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 _PRIORITYQUEUE_H
31 #define _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 
44  {
45 
46  public:
52  PriorityQueue( int n, int maxId, bool min );
54 
55  void print();
56 
57  int getSize();
58  int getSizeByPos();
59 
60  bool isIn( int key );
61 
62  int getBest(); // O(log n)
63 
64  void remove( int key );
65  void insert( int key, double p );
66 
67  void sort(); // O(n log n)
68 
69  void downheap( int id );
70  void upheap( int key );
71 
72  void decreaseKey( int key );
73  void setPriority( int key, double new_p );
74 
75 
76  int getId( int key );
77  private:
78  PriorityQueue( const PriorityQueue & );
79  PriorityQueue &operator=( const PriorityQueue & );
80 
81  int size;
82  int maxsize;
83  int maxId;
84  int *heap;
85  double *p;
86  int *pos;
87 
88  bool ( *greater )( double l, double r );
89  };
90 
91 } // namespace
92 
93 #endif
void downheap(int id)
void setPriority(int key, double new_p)
void insert(int key, double p)
void upheap(int key)
void decreaseKey(int key)
bool isIn(int key)
double ANALYSIS_EXPORT min(double x, double y)
Returns the minimum of two doubles or the first argument if both are equal.
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...