-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathqueue.c
64 lines (58 loc) · 1.27 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
//
// Created by Once on 2019/12/4.
//
#include "queue.h"
#include <stdlib.h>
#include <stdio.h>
Queue* queue_new(){
Queue *queue = (Queue*)malloc(sizeof(Queue));
if(!queue){
perror("alloc for queue error");
return NULL;
}
queue->size = 0;
queue->head = queue->tail = NULL;
return queue;
}
int queue_is_empty(Queue *queue){
if(queue == NULL)
return 1;
return queue->size == 0;
}
void queue_push(Queue *queue, QValue value){
if(queue == NULL)
return;
QNode *node = (QNode*)malloc(sizeof(QNode));
node->value = value;
node->next = NULL;
if(queue->size == 0){
queue->head = queue->tail = node;
queue->size++;
return;
}
QNode *tail = queue->tail;
tail->next = node;
queue->tail = node;
queue->size++;
}
QValue queue_pop(Queue *queue){
if(queue == NULL || queue->size == 0)
return NULL;
QNode *head = queue->head;
queue->head = head->next;
QValue value = head->value;
free(head);
queue->size--;
return value;
}
void queue_clear(Queue *queue){
if(queue == NULL)
return;
QNode *node = queue->head, *temp;
while(node != NULL){
temp = node->next;
free(node);
node = temp;
}
free(queue);
}