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