SW_FourInARow/SPArrayList.c at master · AShugaley/SW_FourInARow · 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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
#include "SPArrayList.h"
#include <stdio.h>
#include <stdlib.h>


SPArrayList* spArrayListCreate(int maxSize)
{
    if (maxSize <= 0)
        return NULL;

    SPArrayList * arrLstForUndo = (SPArrayList *)malloc(sizeof(SPArrayList));
    if (arrLstForUndo == NULL)
        return NULL;

    arrLstForUndo->elements = (int*)malloc(maxSize * sizeof(int));
    arrLstForUndo->maxSize = maxSize;
    arrLstForUndo->actualSize = 0;
    return arrLstForUndo;
}


SPArrayList* spArrayListCopy(SPArrayList* src)
{
    int i = 0;
    if (src == NULL)
        return NULL;

    SPArrayList * arrLstCopy = spArrayListCreate(src->maxSize);

    arrLstCopy->actualSize = src->actualSize;
    for (i = 0; i < arrLstCopy->actualSize; i++)
    {
        (arrLstCopy->elements)[i] = (src->elements)[i];
    }
    return arrLstCopy;

}

void spArrayListDestroy(SPArrayList* src)
{
    if (src != NULL)
    {
        free(src->elements);	//free to int*
        free(src);
    }
}


SP_ARRAY_LIST_MESSAGE spArrayListClear(SPArrayList* src)
{
    if (src == NULL)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;
    else
    {
        src->actualSize = 0;
    }
    return SP_ARRAY_LIST_SUCCESS;
}

SP_ARRAY_LIST_MESSAGE spArrayListAddAt(SPArrayList* src, int elem, int index)
{
    int i = 0;
    if (src == NULL || index > src->actualSize || index < 0)	//if index is out of ACTUAL size- will create discontinuity of the memory
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsFull(src))
        return SP_ARRAY_LIST_FULL;

    for (i = src->actualSize; i > index; i--)
    {
        src->elements[i] = src->elements[i - 1];
    }
    src->elements[index] = elem;
    src->actualSize++;

    return SP_ARRAY_LIST_SUCCESS;
}

SP_ARRAY_LIST_MESSAGE spArrayListAddFirst(SPArrayList* src, int elem)
{
    int i = 0;
    if (src == NULL)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsFull(src))
        return SP_ARRAY_LIST_FULL;

    for (i = src->actualSize; i > 0; i--)
    {
        src->elements[i] = (src->elements)[i - 1];
    }

    src->elements[0] = elem;
    //printf("elements - %d\n", src->elements[0]);
    src->actualSize++;

    return SP_ARRAY_LIST_SUCCESS;

}

SP_ARRAY_LIST_MESSAGE spArrayListAddLast(SPArrayList* src, int elem)
{
    if (src == NULL)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsFull(src))
        return SP_ARRAY_LIST_FULL;

    src->elements[src->actualSize] = elem;
    src->actualSize++;

    return SP_ARRAY_LIST_SUCCESS;


}

SP_ARRAY_LIST_MESSAGE spArrayListRemoveAt(SPArrayList* src, int index)
{
    int i = 0;
    if (src == NULL || index >= src->actualSize || index < 0)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsEmpty(src))
        return SP_ARRAY_LIST_EMPTY;

    for (i = index; i<src->actualSize - 1; i++)
    {
        src->elements[i] = src->elements[i + 1];
    }

    src->actualSize--;

    return SP_ARRAY_LIST_SUCCESS;

}

SP_ARRAY_LIST_MESSAGE spArrayListRemoveFirst(SPArrayList* src)
{
    int i = 0;
    if (src == NULL)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsEmpty(src))
        return SP_ARRAY_LIST_EMPTY;

    for (i = 0; i<src->actualSize - 1; i++)
    {
        src->elements[i] = src->elements[i + 1];
    }

    src->actualSize--;

    return SP_ARRAY_LIST_SUCCESS;


}

SP_ARRAY_LIST_MESSAGE spArrayListRemoveLast(SPArrayList* src)
{
    if (src == NULL)
        return SP_ARRAY_LIST_INVALID_ARGUMENT;

    if (spArrayListIsEmpty(src))
        return SP_ARRAY_LIST_EMPTY;

    (src->actualSize)--;

    return SP_ARRAY_LIST_SUCCESS;

}

int spArrayListGetAt(SPArrayList* src, int index)
{
    if (src == NULL || index >= src->actualSize || index < 0)
        return -1;
    return src->elements[index];

}

int spArrayListGetFirst(SPArrayList* src)
{
    if (src == NULL || src->actualSize == 0)
        return -1;
    return src->elements[0];
}

int spArrayListGetLast(SPArrayList* src)
{
    if (src == NULL || src->actualSize == 0)
        return -1;
    return src->elements[src->actualSize - 1];

}

int spArrayListMaxCapacity(SPArrayList* src)
{
    if (src == NULL)
        return -1;
    return src->maxSize;
}

int spArrayListSize(SPArrayList* src)
{
    if (src == NULL)
        return -1;
    return src->actualSize;
}

bool spArrayListIsFull(SPArrayList* src)
{
    if ((src->maxSize > src->actualSize) || (src == NULL))
        return false;
    return true;
}

bool spArrayListIsEmpty(SPArrayList* src)
{
    if ((src->actualSize != 0) || (src == NULL))
        return false;
    return true;

}