5 This file is part of avahi.
7 avahi is free software; you can redistribute it and/or modify it
8 under the terms of the GNU Lesser General Public License as
9 published by the Free Software Foundation; either version 2.1 of the
10 License, or (at your option) any later version.
12 avahi is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
15 Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with avahi; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
23 typedef struct AvahiPrioQueue AvahiPrioQueue;
24 typedef struct AvahiPrioQueueNode AvahiPrioQueueNode;
26 typedef int (*AvahiPQCompareFunc)(const void* a, const void* b);
28 struct AvahiPrioQueue {
29 AvahiPrioQueueNode *root, *last;
31 AvahiPQCompareFunc compare;
34 struct AvahiPrioQueueNode {
35 AvahiPrioQueue *queue;
38 AvahiPrioQueueNode *left, *right, *parent, *next, *prev;
41 AvahiPrioQueue* avahi_prio_queue_new(AvahiPQCompareFunc compare);
42 void avahi_prio_queue_free(AvahiPrioQueue *q);
44 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data);
45 void avahi_prio_queue_remove(AvahiPrioQueue *q, AvahiPrioQueueNode *n);
47 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n);