ASCII_snake/queue.h at master · peppepol/ASCII_snake · GitHub

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
130
131
132
133
134
135
136
137
138
139
140
141
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void memory_realloc();

int ITEMS_LENGTH = 100;
int tail = -1;
int head = -1;
int **items;
int length = 0;

typedef struct
{
    void (*allocate_memory)();
    void (*deallocate_memory)();
    void (*enqueue)(int x, int y);
    void (*dequeue)();
    void (*print)();
    int (*size)();
    int (*contains)(int x, int y);
} Queue;

void enqueue(int x, int y)
{
    if (tail == ITEMS_LENGTH - 1)
    {
        memory_realloc();
    }

    if (head == -1)
    {
        head = 0;
    }

    tail++;
    items[tail][0] = x;
    items[tail][1] = y;
    length++;
}

void dequeue()
{
    if (head == -1)
    {
        //printf("empty queue");
    }
    else
    {
        head++;

        if (head > tail)
        {
            head = tail - 1;
        }

        length--;
    }
}

int contains(int x, int y)
{
    if(tail == -1) return 0;
    for (int i = head; i <= tail; i++)
        if (items[i][0] == x && items[i][1] == y)
            return 1;
    return 0;
}

void print()
{
    if (tail == -1)
    {
        printf("empty queue\n");
    }
    else
    {
        for (int i = head; i <= tail; i++)
        {
            if (i != tail)
                printf("(%i,%i), ", items[i][0], items[i][1]);
            else
                printf("(%i,%i)\n", items[i][0], items[i][1]);
        }
    }
}

int size()
{
    int c = 0;
    for (int i = head; i <= tail; i++)
        c++;
    return c;
}

void allocate_memory()
{
    items = (int **)malloc(ITEMS_LENGTH * sizeof(int *));
    if (items == NULL)
    {
        printf("memory allocation error");
        exit(-1);
    }

    for (int i = 0; i < ITEMS_LENGTH; i++)
    {
        items[i] = (int *)malloc(sizeof(int) * 2);
        if (items[i] == NULL)
        {
            printf("memory allocation error");
            exit(-1);
        }
    }
}

void deallocate_memory()
{
    for (int i = 0; i < ITEMS_LENGTH; i++)
        free(items[i]);
    free(items);
}

void memory_realloc()
{
    items = (int **)realloc(items, sizeof(int *) * (ITEMS_LENGTH * ITEMS_LENGTH));
    ITEMS_LENGTH *= ITEMS_LENGTH;

    if(items == NULL){
        printf("memory allocation error");
        exit(-1);
    }

    for (int i = tail+1; i < ITEMS_LENGTH; i++)
    {
        items[i] = (int*) malloc(sizeof(int) * 2);
        if(items[i] == NULL){
            printf("memory allocation error");
            exit(-1);
        }
    }
}