-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.c
78 lines (69 loc) · 1.48 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
73
74
75
76
77
78
#include "queue.h"
#include <stdlib.h>
#include <stdio.h>
void insert(Queue *queue, Task* task){
Node* newNode = (Node*) malloc(sizeof(Node));
if(!newNode){
printf("Heap allocation failed. Task creating aborted.\n");
free(task->identifier);
free(task);
return;
}
newNode->data = task;
newNode->next = NULL;
if(!queue->size){
queue->first = newNode;
queue->last = newNode;
}
else{
queue->last->next = newNode;
queue->last = newNode;
}
queue->size++;
}
Task* pop(Queue *queue){
if(!queue->size){
return NULL;
}
Node* first = queue->first;
queue->first = first->next;
queue->size--;
Task *data = first->data;
free(first);
return data;
}
Task* getLastTask(Queue *queue){
if(!queue->size){
return NULL;
}
return queue->last->data;
}
Task* getFirstTask(Queue *queue){
if(!queue->size){
return NULL;
}
return queue->first->data;
}
Node* getFirstNode(Queue *queue){
if(!queue->size){
return NULL;
}
return queue->first;
}
void deleteQueue(Queue *queue){
if(!queue->size){
return;
}
Node *prev = NULL;
Node *curr = queue->first;
for(int i = 0; i < queue->size; i++){
prev = curr;
curr = curr->next;
free(prev->data->identifier);
free(prev->data);
free(prev);
}
queue->first = NULL;
queue->last = NULL;
queue->size = 0;
}