libevent的min_heap.h使用示例

#include<stdio.h>
#include<string.h>
#include<malloc.h>
struct event{
        int value;
        int priv;
};

typedef struct min_heap
{
    struct event** p;
    unsigned n, a;
} min_heap_t;

#define evutil_timercmp(tvp, uvp, cmp)                                                  \
         (tvp->value cmp uvp->value)


static inline void           min_heap_ctor(min_heap_t* s);
static inline void           min_heap_dtor(min_heap_t* s);
static inline void           min_heap_elem_init(struct event* e);
static inline int            min_heap_elem_greater(struct event *a, struct event *b);
static inline int            min_heap_empty(min_heap_t* s);
static inline unsigned       min_heap_size(min_heap_t* s);
static inline struct event*  min_heap_top(min_heap_t* s);
static inline int            min_heap_reserve(min_heap_t* s, unsigned n);
static inline int            min_heap_push(min_heap_t* s, struct event* e);
static inline struct event*  min_heap_pop(min_heap_t* s);
static inline int            min_heap_erase(min_heap_t* s, struct event* e);
static inline void           min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e);
static inline void           min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e);

int min_heap_elem_greater(struct event *a, struct event *b)
{
    return evutil_timercmp(a, b, >);
}

void min_heap_ctor(min_heap_t* s) { s->p = 0; s->n = 0; s->a = 0; }
void min_heap_dtor(min_heap_t* s) { free(s->p); }
void min_heap_elem_init(struct event* e) { e->priv = -1; }
int min_heap_empty(min_heap_t* s) { return 0u == s->n; }
unsigned min_heap_size(min_heap_t* s) { return s->n; }
struct event* min_heap_top(min_heap_t* s) { return s->n ? *s->p : 0; }

int min_heap_push(min_heap_t* s, struct event* e)
{
    if(min_heap_reserve(s, s->n + 1))
        return -1;
    min_heap_shift_up_(s, s->n++, e);
    return 0;
}

struct event* min_heap_pop(min_heap_t* s)
{
    if(s->n)
    {
        struct event* e = *s->p;
        min_heap_shift_down_(s, 0u, s->p[--s->n]);
        e->priv = -1;
        return e;
    }
    return 0;
}

int min_heap_erase(min_heap_t* s, struct event* e)
{
    if(((unsigned int)-1) != e->priv)
    {
        min_heap_shift_down_(s, e->priv, s->p[--s->n]);
        e->priv = -1;
        return 0;
    }
    return -1;
}

int min_heap_reserve(min_heap_t* s, unsigned n)
{
    if(s->a < n)
    {
        struct event** p;
        unsigned a = s->a ? s->a * 2 : 8;
        if(a < n)
            a = n;
        if(!(p = (struct event**)realloc(s->p, a * sizeof *p)))
            return -1;
        s->p = p;
        s->a = a;
    }
    return 0;
}

void min_heap_shift_up_(min_heap_t* s, unsigned hole_index, struct event* e)
{
    unsigned parent = (hole_index - 1) / 2;
    while(hole_index && min_heap_elem_greater(s->p[parent], e))
    {
        (s->p[hole_index] = s->p[parent])->priv = hole_index;
        hole_index = parent;
        parent = (hole_index - 1) / 2;
    }
    (s->p[hole_index] = e)->priv = hole_index;
}

void min_heap_shift_down_(min_heap_t* s, unsigned hole_index, struct event* e)
{
    unsigned min_child = 2 * (hole_index + 1);
    while(min_child <= s->n)
        {
        min_child -= min_child == s->n || min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]);
        if(!(min_heap_elem_greater(e, s->p[min_child])))
            break;
        (s->p[hole_index] = s->p[min_child])->priv = hole_index;
        hole_index = min_child;
        min_child = 2 * (hole_index + 1);
        }
    min_heap_shift_up_(s, hole_index,  e);
}
void
heap_print(min_heap_t *t){
        int i=0;
        for(;i<t->n;i++){
                printf("value:%d,priv:%d\n",t->p[i]->value,t->p[i]->priv);
        }
}
int main(int argv,char** args){
        min_heap_t *p;
        struct event *tmp;
        int i;
        p = (min_heap_t *)calloc(1,sizeof(min_heap_t));
        min_heap_ctor(p);
        for(i=0;i<10;i++){
                struct event *e=(struct event *)calloc(1,sizeof(struct event));
                e->value=i+1;
                min_heap_push(p,e);
        }
        heap_print(p);
        for(i=1;i<10;i++){
                tmp = min_heap_pop(p);
                printf("pop:value:%d,priv:%d\n",tmp->value,tmp->priv);
                heap_print(p);
        }
}