This repository has been archived by the owner on Oct 16, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
rtVector.c
135 lines (116 loc) · 2.48 KB
/
rtVector.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
130
131
132
133
134
135
/* Copyright [2017] [Comcast, Corp.]
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "rtVector.h"
#include <errno.h>
#include <stdlib.h>
#define RTVECT_BLOCKSIZE 16
struct _rtVector
{
void** data;
size_t capacity;
size_t count;
};
rtError
rtVector_Create(rtVector* v)
{
(*v) = (struct _rtVector *) malloc(sizeof(struct _rtVector));
if (!(*v))
return rtError_FromErrno(ENOMEM);
(*v)->data = NULL;
(*v)->capacity = 0;
(*v)->count = 0;
return RT_OK;
}
rtError
rtVector_Destroy(rtVector v, rtVector_Cleanup destroyer)
{
size_t i;
if (!v)
return RT_ERROR_INVALID_ARG;
if (v->data)
{
if (destroyer)
{
for (i = 0; i < v->count; ++i)
destroyer(v->data[i]);
}
free(v->data);
}
free(v);
return RT_OK;
}
rtError
rtVector_PushBack(rtVector v, void* item)
{
if (!v)
return RT_ERROR_INVALID_ARG;
if (!v->data)
{
v->data = calloc(RTVECT_BLOCKSIZE, sizeof(void *));
v->capacity = RTVECT_BLOCKSIZE;
}
else if (v->count + 1 >= v->capacity)
{
v->data = realloc(v->data, (v->capacity + RTVECT_BLOCKSIZE) * sizeof(void *));
v->capacity += RTVECT_BLOCKSIZE;
}
if (!v->data)
return rtError_FromErrno(ENOMEM);
v->data[v->count++] = item;
return RT_OK;
}
rtError
rtVector_RemoveItem(rtVector v, void* item, rtVector_Cleanup destroyer)
{
size_t i;
for (i = 0; i < v->count; ++i)
{
if (v->data[i] == item)
return rtVector_RemoveItemAt(v, (int) i, destroyer);
}
return RT_OK;
}
rtError
rtVector_RemoveItemAt(rtVector v, int n, rtVector_Cleanup destroyer)
{
size_t i = n;
if (destroyer)
destroyer(v->data[i]);
while (i < v->count)
{
v->data[i] = v->data[i+1];
i++;
}
v->count -= 1;
while (i < v->capacity)
{
v->data[i] = NULL;
i++;
}
return RT_OK;
}
void*
rtVector_At(rtVector v, size_t index)
{
if (!v) return NULL;
if (index >= v->count) return NULL;
return v->data[index];
}
size_t
rtVector_Size(rtVector v)
{
if (!v) return 0;
return v->count;
}