src/clustal/queue.h File Reference

#include "list.h"

Include dependency graph for queue.h:

Go to the source code of this file.

Defines
#define	QUEUE_INIT(prQueue, destroy_func)   ListInit((prQueue), (destroy_func))
#define	QUEUE_DESTROY(prQueue)   ListDestroy((prQueue))
#define	QUEUE_PUSH(prQueue, data)   LIST_APPEND((prQueue), (data))
#define	QUEUE_POP(prQueue, data)   ListRemoveNext((prQueue), NULL, (data))
#define	QUEUE_EMPTY(prQueue)   (0==LIST_SIZE((prQueue)))
#define	INT_QUEUE_INIT(prQueue)   INT_LIST_INIT((prQueue))
#define	INT_QUEUE_DESTROY(prQueue)   INT_LIST_DESTROY((prQueue))
#define	INT_QUEUE_PUSH(prQueue, data)   INT_LIST_APPEND((prQueue), (data))
#define	INT_QUEUE_POP(prQueue, data)   IntListRemoveNext((prQueue), NULL, (data))
#define	INT_QUEUE_EMPTY(prQueue)   (0==INT_LIST_SIZE((prQueue)))
Typedefs
typedef list_t	queue_t
typedef queue_t	int_queue_t

---

Define Documentation

#define INT_QUEUE_DESTROY

(

prQueue

)

INT_LIST_DESTROY((prQueue))

#define INT_QUEUE_EMPTY

(

prQueue

)

(0==INT_LIST_SIZE((prQueue)))

#define INT_QUEUE_INIT

(

prQueue

)

INT_LIST_INIT((prQueue))

#define INT_QUEUE_POP	(	prQueue,
		data		)	IntListRemoveNext((prQueue), NULL, (data))

#define INT_QUEUE_PUSH	(	prQueue,
		data		)	INT_LIST_APPEND((prQueue), (data))

#define QUEUE_DESTROY

(

prQueue

)

ListDestroy((prQueue))

#define QUEUE_EMPTY

(

prQueue

)

(0==LIST_SIZE((prQueue)))

#define QUEUE_INIT	(	prQueue,
		destroy_func		)	ListInit((prQueue), (destroy_func))

#define QUEUE_POP	(	prQueue,
		data		)	ListRemoveNext((prQueue), NULL, (data))

#define QUEUE_PUSH	(	prQueue,
		data		)	LIST_APPEND((prQueue), (data))

---

Typedef Documentation

typedef queue_t int_queue_t

typedef list_t queue_t