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
|
/* Priority queue functions.
* Copyright (C) 2003 Yasuhiro Ohara
*
* This file is part of GNU Zebra.
*
* GNU Zebra 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 2, or (at your
* option) any later version.
*
* GNU Zebra 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 this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef _ZEBRA_PQUEUE_H
#define _ZEBRA_PQUEUE_H
struct pqueue {
void **array;
int array_size;
int size;
int (*cmp)(void *, void *);
void (*update)(void *node, int actual_position);
};
#define PQUEUE_INIT_ARRAYSIZE 32
extern struct pqueue *pqueue_create(void);
extern void pqueue_delete(struct pqueue *queue);
extern void pqueue_enqueue(void *data, struct pqueue *queue);
extern void *pqueue_dequeue(struct pqueue *queue);
extern void pqueue_remove_at(int index, struct pqueue *queue);
extern void pqueue_remove(void *data, struct pqueue *queue);
extern void trickle_down(int index, struct pqueue *queue);
extern void trickle_up(int index, struct pqueue *queue);
#endif /* _ZEBRA_PQUEUE_H */
|
