bzr branch
http://gegoxaren.bato24.eu/bzr/simpletypesystem/trunk
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
1 |
/* c-basic-offset: 2; tab-width: 2; indent-tabs-mode: nil
|
2 |
* vi: set shiftwidth=2 tabstop=2 expandtab:
|
|
3 |
* :indentSize=2:tabSize=2:noTabs=true:
|
|
4 |
*/
|
|
5 |
||
6 |
/*
|
|
|
5.2.9
by Gustav Hartvigsson
* Added license to files |
7 |
Copyright (c) 2013-2014 Gustav Hartvigsson
|
8 |
||
9 |
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
10 |
of this software and associated documentation files (the "Software"), to deal
|
|
11 |
in the Software without restriction, including without limitation the rights
|
|
12 |
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
13 |
copies of the Software, and to permit persons to whom the Software is
|
|
14 |
furnished to do so, subject to the following conditions:
|
|
15 |
||
16 |
The above copyright notice and this permission notice shall be included in
|
|
17 |
all copies or substantial portions of the Software.
|
|
18 |
||
19 |
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
20 |
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
21 |
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
22 |
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
23 |
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
24 |
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
25 |
THE SOFTWARE.
|
|
26 |
*/
|
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
27 |
|
|
30
by Gustav Hartvigsson
* Made the code compile using CMake. |
28 |
#include "DynamicArray.h" |
29 |
||
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
30 |
struct
|
31 |
SDynamicArray { |
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
32 |
FreeFunc free_func; |
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
33 |
FuncPointer to_json; |
34 |
FuncPointer from_json; |
|
35 |
size_t max_size; |
|
36 |
size_t last_item; |
|
|
30
by Gustav Hartvigsson
* Made the code compile using CMake. |
37 |
spointer * array; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
38 |
};
|
39 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
40 |
void
|
41 |
_private_for_each_item_free (SDynamicArray * self, spointer item, |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
42 |
spointer data); |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
43 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
44 |
SDynamicArray * |
45 |
_s_dynamic_array_new_full (size_t len, |
|
46 |
FreeFunc free_func, |
|
47 |
FuncPointer to_json, |
|
48 |
FuncPointer from_json) { |
|
|
46
by Gustav Hartvigsson
* Renamed DynamicArray to SDynamicArray. |
49 |
SDynamicArray * self = malloc (sizeof(SDynamicArray)); |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
50 |
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
51 |
self->max_size = len; |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
52 |
|
|
48
by Gustav Hartvigsson
* Finnished SLinkedList. |
53 |
self->last_item = 0; |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
54 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
55 |
self->free_func = free_func; |
56 |
self->to_json = to_json; |
|
57 |
self->from_json = from_json; |
|
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
58 |
|
|
104
by Gustav Hartvigsson
* Passing arguments can not be initialised from within a function... |
59 |
self->array = calloc (len ,sizeof (spointer)); |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
60 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
61 |
return self; |
62 |
}
|
|
63 |
||
64 |
SDynamicArray * |
|
65 |
s_dynamic_array_new (size_t len, |
|
66 |
FreeFunc free_func) { |
|
|
104
by Gustav Hartvigsson
* Passing arguments can not be initialised from within a function... |
67 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
68 |
SDynamicArray * self = _s_dynamic_array_new_full (len, free_func, NULL, NULL); |
|
104
by Gustav Hartvigsson
* Passing arguments can not be initialised from within a function... |
69 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
70 |
return self; |
71 |
}
|
|
72 |
||
73 |
SDynamicArray * |
|
74 |
s_dynamic_array_new_json (size_t len, |
|
75 |
FreeFunc free_func, |
|
76 |
FuncPointer to_json, |
|
77 |
FuncPointer from_json) { |
|
78 |
SDynamicArray * self = _s_dynamic_array_new_full (len, free_func, to_json, from_json); |
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
79 |
return self; |
80 |
}
|
|
81 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
82 |
void
|
83 |
s_dynamic_array_free (SDynamicArray * self, sboolean free_data) { |
|
|
48
by Gustav Hartvigsson
* Finnished SLinkedList. |
84 |
if (free_data) { |
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
85 |
if (self->free_func != NULL) { |
|
48
by Gustav Hartvigsson
* Finnished SLinkedList. |
86 |
s_dynamic_array_for_each (self, (ForEachFunc) _private_for_each_item_free, |
87 |
NULL); |
|
88 |
} else { |
|
89 |
for (int i = 0; i < self->last_item; i++) { |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
90 |
free (self->array[i]); |
|
48
by Gustav Hartvigsson
* Finnished SLinkedList. |
91 |
} |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
92 |
} |
93 |
} |
|
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
94 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
95 |
free (self->array); |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
96 |
free (self); |
97 |
}
|
|
98 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
99 |
spointer
|
100 |
s_dynamic_array_get (SDynamicArray * self, size_t index) { |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
101 |
return self->array[index]; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
102 |
}
|
103 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
104 |
void
|
105 |
s_dynamic_array_set (SDynamicArray * self, size_t index, spointer item) { |
|
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
106 |
if (self->max_size <= index) { |
107 |
size_t new_size = round_up (index + ARRAY_PADDING, ARRAY_PADDING) + 1; |
|
|
48
by Gustav Hartvigsson
* Finnished SLinkedList. |
108 |
s_dbg_print ("Index: %zu current array size: %zu new array size: %zu ", |
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
109 |
index, self->max_size, new_size); |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
110 |
|
111 |
size_t old_size = self->max_size; |
|
112 |
||
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
113 |
self->max_size = new_size; |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
114 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
115 |
self->array = realloc (self->array, |
116 |
(sizeof (* self->array) * (self->max_size))); |
|
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
117 |
/* Zero new momery */ |
118 |
for (size_t i = old_size; i <= new_size; i++) { |
|
119 |
self->array[i] = NULL; |
|
120 |
} |
|
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
121 |
} |
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
122 |
|
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
123 |
if (self->last_item < index) { |
124 |
self->last_item = index; |
|
125 |
} |
|
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
126 |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
127 |
self->array[index] = item; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
128 |
}
|
129 |
||
|
103
by Gustav Hartvigsson
* General cleanup/make it pritty. |
130 |
void
|
131 |
s_dynamic_array_append (SDynamicArray * self, |
|
132 |
spointer item) { |
|
133 |
size_t next_pos = s_dynamic_array_last_item (self) + 1; |
|
134 |
s_dynamic_array_set (self, next_pos, item); |
|
135 |
}
|
|
136 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
137 |
size_t
|
138 |
s_dynamic_array_size (SDynamicArray * self) { |
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
139 |
return self->max_size; |
140 |
}
|
|
141 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
142 |
size_t
|
143 |
s_dynamic_array_last_item (SDynamicArray * self) { |
|
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
144 |
return self->last_item; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
145 |
}
|
146 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
147 |
spointer * |
148 |
s_dynamic_array_dump_array (SDynamicArray * self) { |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
149 |
spointer * ret_val = calloc (self->last_item + 1, sizeof (* self->array)); |
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
150 |
for (int i = 0; i < self->last_item; i++) { |
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
151 |
ret_val[i] = self->array[i]; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
152 |
} |
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
153 |
ret_val[self->last_item] = NULL; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
154 |
return ret_val; |
155 |
}
|
|
156 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
157 |
void
|
158 |
s_dynamic_array_for_each (SDynamicArray * self, ForEachFunc func, |
|
|
30
by Gustav Hartvigsson
* Made the code compile using CMake. |
159 |
spointer data) { |
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
160 |
for (int i = 0; i < self->max_size && i <= self->last_item; i++) { |
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
161 |
spointer item = self->array[i]; |
|
47
by Gustav Hartvigsson
* Added a few skeletal functions to Callback.h |
162 |
if (item) { |
163 |
func (self, item, data); |
|
164 |
} |
|
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
165 |
} |
166 |
}
|
|
167 |
||
168 |
||
|
61
by Gustav Hartvigsson
* Made the code more easy to read. |
169 |
void
|
170 |
_private_for_each_item_free (SDynamicArray * self, spointer item, |
|
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
171 |
spointer data) { |
|
104
by Gustav Hartvigsson
* Passing arguments can not be initialised from within a function... |
172 |
s_dbg_print ("Removing item from array"); |
|
68
by Gustav Hartvigsson
* Hid internals of SDynamicArray. |
173 |
FreeFunc func = self->free_func; |
|
5.2.8
by Gustav Hartvigsson
* Copied over LinkedList and DynamicArray from c_sdl_js |
174 |
func (item); |
175 |
}
|
|
176 |