1#ifndef fooprioqhfoo 2#define fooprioqhfoo 3 4/* $Id$ */ 5 6/*** 7 This file is part of avahi. 8 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. 13 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. 18 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 22 USA. 23***/ 24 25typedef struct AvahiPrioQueue AvahiPrioQueue; 26typedef struct AvahiPrioQueueNode AvahiPrioQueueNode; 27 28typedef int (*AvahiPQCompareFunc)(const void* a, const void* b); 29 30struct AvahiPrioQueue { 31 AvahiPrioQueueNode *root, *last; 32 unsigned n_nodes; 33 AvahiPQCompareFunc compare; 34}; 35 36struct AvahiPrioQueueNode { 37 AvahiPrioQueue *queue; 38 void* data; 39 unsigned x, y; 40 AvahiPrioQueueNode *left, *right, *parent, *next, *prev; 41}; 42 43AvahiPrioQueue* avahi_prio_queue_new(AvahiPQCompareFunc compare); 44void avahi_prio_queue_free(AvahiPrioQueue *q); 45 46AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data); 47void avahi_prio_queue_remove(AvahiPrioQueue *q, AvahiPrioQueueNode *n); 48 49void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n); 50 51#endif 52