c队列代码,C代码库,德仔网

代码语言
代码分类
【C】 c队列
作者:zhj444 / 发布于2012/11/19/ 830
一个通用的c队列。封装了队列操作，和具体数据无关
/*
 * Create by geet 
 * Copyright 2012 geet
 */

#include <stddef.h>
	 	 	 
#ifndef _GT_QUEUE_H_
#define _GT_QUEUE_H_

#define GT_DEBUG	0

typedef struct gt_queue_s  gt_queue_t;

struct gt_queue_s {
    gt_queue_t  *prev;
    gt_queue_t  *next;
};

/*初始化队列*/
#define gt_queue_init(q)                                                     \
    (q)->prev = q;                                                            \
    (q)->next = q

/*队列是否为空*/
#define gt_queue_empty(h)                                                    \
    (h == (h)->prev)

/*在队列头部插入*/
#define gt_queue_insert_head(h, x)                                           \
    (x)->next = (h)->next;                                                    \
    (x)->next->prev = x;                                                      \
    (x)->prev = h;                                                            \
    (h)->next = x


#define gt_queue_insert_after   gt_queue_insert_head

/*在队列尾部插入*/
#define gt_queue_insert_tail(h, x)                                           \
    (x)->prev = (h)->prev;                                                    \
    (x)->prev->next = x;                                                      \
    (x)->next = h;                                                            \
    (h)->prev = x

/*队列头*/
#define gt_queue_head(h)                                                     \
    (h)->next

/*队列尾*/
#define gt_queue_last(h)                                                     \
    (h)->prev


#define gt_queue_sentinel(h)                                                 \
    (h)

#define gt_queue_next(q)                                                     \
    (q)->next


#define gt_queue_prev(q)                                                     \
    (q)->prev


#if (GT_DEBUG)

#define gt_queue_remove(x)                                                   \
    (x)->next->prev = (x)->prev;                                              \
    (x)->prev->next = (x)->next;                                              \
    (x)->prev = NULL;                                                         \
    (x)->next = NULL

#else

#define gt_queue_remove(x)                                                   \
    (x)->next->prev = (x)->prev;                                              \
    (x)->prev->next = (x)->next

#endif

/*队列拆分*/
#define gt_queue_split(h, q, n)                                              \
    (n)->prev = (h)->prev;                                                    \
    (n)->prev->next = n;                                                      \
    (n)->next = q;                                                            \
    (h)->prev = (q)->prev;                                                    \
    (h)->prev->next = h;                                                      \
    (q)->prev = n;

/*添加一个新队列*/
#define gt_queue_add(h, n)                                                   \
    (h)->prev->next = (n)->next;                                              \
    (n)->next->prev = (h)->prev;                                              \
    (h)->prev = (n)->prev;                                                    \
    (h)->prev->next = h;


#define gt_queue_data(q, type, link)                                         \
    (type *) ((u_char *) q - offsetof(type, link))


gt_queue_t * gt_queue_middle(gt_queue_t *queue);

/*排序*/
void gt_queue_sort(gt_queue_t *queue,
    int (*cmp)(const gt_queue_t *, const gt_queue_t *));


#endif
试试其它关键字
　c队列　
同语言下
可能有用的
zhj444贡献的其它代码(2)