-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathfile.c
More file actions
65 lines (56 loc) · 1.14 KB
/
file.c
File metadata and controls
65 lines (56 loc) · 1.14 KB
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
#include "file.h"
#include <limits.h>
#include <stdlib.h>
file_t *creerFile(unsigned int capacite)
{
file_t *queue = (file_t *) malloc(sizeof(file_t));
queue->array = (int *) malloc(queue->capacity * sizeof(int));
queue->capacity = capacite;
queue->front = queue->size = 0;
queue->rear = capacite - 1;
return queue;
}
void detruireFile(file_t **queue)
{
free((*queue)->array);
free(*queue);
*queue = NULL;
}
int file_isFull(file_t *queue)
{
return (queue->size == queue->capacity);
}
int file_isEmpty(file_t *queue)
{
return (queue->size == 0);
}
void enfile(file_t *queue, int item)
{
if (file_isFull(queue))
return;
queue->rear = (queue->rear + 1) % queue->capacity;
queue->array[queue->rear] = item;
++(queue->size);
}
int defile(file_t *queue)
{
int item;
if (file_isEmpty(queue))
return INT_MAX;
item = queue->array[queue->front];
queue->front = (queue->front + 1) % queue->capacity;
--(queue->size);
return item;
}
int front(file_t *queue)
{
if (file_isEmpty(queue))
return INT_MAX;
return queue->array[queue->front];
}
int rear(file_t *queue)
{
if (file_isEmpty(queue))
return INT_MAX;
return queue->array[queue->rear];
}