-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathNodeQueueOperation.c
43 lines (36 loc) · 1.02 KB
/
NodeQueueOperation.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
#include <stdlib.h>
#include "NodeQueueOperation.h"
void enqueue(NodeQueue queue, Node node) {
QueueElement element = malloc(sizeof(QueueElementStruct));
element->data = node;
element->next = NULL;
// first enqueue
if(queue->rear == NULL) {
queue->front = element;
}
else queue->rear->next = element;
queue->rear = element;
}
Node dequeue(NodeQueue queue) {
if(queue->front != NULL) {
// last queue element
if(queue->front == queue->rear) {
queue->rear = NULL;
}
QueueElement element = queue->front;
queue->front = queue->front->next;
Node node = element->data;
free(element);
return node;
}
else return NULL;
}
NodeQueueOperation NodeQueueOperationFactory() {
static NodeQueueOperation nodeQueueOperation = NULL;
if(!nodeQueueOperation) {
nodeQueueOperation = malloc(sizeof(NodeQueueOperationStruct));
nodeQueueOperation->enqueue = enqueue;
nodeQueueOperation->dequeue = dequeue;
}
return nodeQueueOperation;
}