1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/*
This file is part of DepQBF.
DepQBF, a solver for quantified boolean formulae (QBF).
Copyright 2010, 2011, 2012, 2013, 2014, 2015, 2016
Florian Lonsing, Johannes Kepler University, Linz, Austria and
Vienna University of Technology, Vienna, Austria.
DepQBF is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
DepQBF is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with DepQBF. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef QDPLL_PQUEUE_H_INCLUDED
#define QDPLL_PQUEUE_H_INCLUDED
#include <limits.h>
#include "qdpll_mem.h"
struct PriorityQueueElem
{
void *data;
unsigned int pos;
double priority;
};
typedef struct PriorityQueueElem PriorityQueueElem;
struct PriorityQueue
{
unsigned int size;
unsigned int cnt;
PriorityQueueElem *queue;
};
typedef struct PriorityQueue PriorityQueue;
#define PQUEUE_INVALID_POS UINT_MAX
PriorityQueue *pqueue_create (QDPLLMemMan * mm, unsigned int init_size);
void pqueue_delete (QDPLLMemMan * mm, PriorityQueue * pqueue);
void pqueue_adjust (QDPLLMemMan * mm, PriorityQueue * pqueue,
unsigned int size);
void pqueue_insert (QDPLLMemMan * mm, PriorityQueue * pqueue,
void *data, double priority);
void *pqueue_remove_first (PriorityQueue * pqueue);
void *pqueue_remove_min (PriorityQueue * pqueue);
void *pqueue_access_min (PriorityQueue * pqueue);
#endif
|
