-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.c
72 lines (64 loc) · 1.08 KB
/
queue.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include "queue.h"
#include <assert.h>
#include <stddef.h>
#include "mem.h"
#include <stdint.h>
#define T Queue_T
struct elem{
void *x;
struct elem *link;
};
struct T{
int32_t count;
struct elem* head;
struct elem* tail;
};
T Queue_new(void){
T que;
NEW(que);
que->count = 0;
que->head = NULL;
que->tail = NULL;
return que;
}
int32_t Queue_empty(T que){
assert(que);
return que->count == 0;
}
void Queue_enqueue(T que, void *x){
struct elem *t;
assert(que);
NEW(t);
t->x=x;
t->link=NULL;
if(Queue_empty(que)){
que->head = t;
que->tail = t;
}
else{
que->tail->link = t;
que->tail = t;
}
que->count++;
}
void *Queue_dequeue(T que){
void *x;
struct elem *t;
assert(que);
assert(que->count>0);
t=que->head;
que->head=t->link;
que->count--;
x=t->x;
FREE(t);
return x;
}
void Queue_free(T* que){
struct elem *t, *u;
assert(que && *que);
for(t=(*que)->head; t; t=u){
u=t->link;
FREE(t);
}
FREE(*que);
}