链表实现
【数据结构和方法设计】
#ifndef __QUEUE__H_
#define __QUEUE__H_
#include "slist.h"
static void *queue_create()
{
return slist_create();
}
static void queue_enqueue(void *queue, void *entry)
{
if (!queue || !entry) return;
slist_append((slist_t *)queue, (slist_entry_t *)entry);
}
static void *queue_dequeue(void *queue)
{
if (!queue) return NULL;
slist_t* list = (slist_t *)queue;
if (slist_isEmpty(list)) return NULL;
slist_entry_t* entry = list->head;
list->head = entry->next;
slist_node_init(entry);
return (void*) entry;
}
#endif
/* TEST CASE */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stddef.h>
#include "slist.h"
typedef struct node_t_ {
slist_entry_t link;
int val;
} node_t;
int test_queue()
{
int i = 0;
node_t *item = NULL;
void *queue = queue_create();
for (i=0; i<100; i++) {
item = (node_t *) malloc(sizeof(node_t));
if (item) {
memset(item, 0x0, sizeof(node_t));
item->val = i;
queue_enqueue(queue, &item->link);
}
item = NULL;
}
void *link = NULL;
while(link=queue_dequeue(queue)) {
item = container_of(link, node_t, link);
printf("%d\n", item->val);
}
//free TODO
return 0;
}
int main()
{
test_queue();
return 0;
}