-
Notifications
You must be signed in to change notification settings - Fork 0
/
ferry.c
129 lines (106 loc) · 1.81 KB
/
ferry.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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include <stdio.h>
#include <stdlib.h>
#include "ferry.h"
struct node;
typedef struct node Node;
struct node
{
int data;
Node* next;
Node* prev;
};
struct queue
{
Node* head;
Node* tail;
};
typedef struct queue Queue;
QUEUE queue_init_default(void)
{
Queue* pQ;
pQ = (Queue*)malloc(sizeof(Queue));
if (pQ != NULL)
{
pQ->head = NULL;
pQ->tail = NULL;
}
return (QUEUE)pQ;
}
Status queue_enqueue(QUEUE hQ, int item)
{
Queue* pQ = (Queue*)hQ;
Node* temp;
temp = (Node*)malloc(sizeof(Node));
if (temp == NULL)
{
return FAILURE;
}
temp->data = item;
temp->next = NULL;
temp->prev = NULL;
if(pQ->head == NULL || pQ->tail == NULL)
{
pQ->head = temp;
pQ->tail = temp;
}
else
{
pQ->tail->next = temp;
temp->prev = pQ->tail;
pQ->tail = temp;
}
return SUCCESS;
}
Status queue_service(QUEUE hQ)
{
Queue* pQ = (Queue*)hQ;
Node* temp;
if (queue_empty(hQ))
{
return FAILURE;
}
temp = pQ->head;
pQ->head = pQ->head->next;
free(temp);
if(pQ->head != NULL)
{
pQ->head->prev = NULL;
}
return SUCCESS;
}
int queue_front(QUEUE hQ, Status* pStatus)
{
Queue* pQ = (Queue*)hQ;
if (queue_empty(hQ))
{
if (pStatus != NULL)
{
*pStatus = FAILURE;
}
return -1337;
}
if (pStatus != NULL)
{
*pStatus = SUCCESS;
}
return pQ->head->data;
}
Boolean queue_empty(QUEUE hQ)
{
Queue* pQ = (Queue*)hQ;
return (Boolean)(pQ->head == NULL);
}
void queue_destroy(QUEUE* phQueue)
{
Queue* pQ = (Queue*)*phQueue;
Node* head = pQ->head;
Node* temp;
while(head != NULL)
{
temp = head;
head = head->next;
free(temp);
}
free(pQ);
*phQueue = NULL;
}