|
0
|
1 /* =========================================================================
|
|
|
2 * Freetype GL - A C OpenGL Freetype engine
|
|
|
3 * Platform: Any
|
|
|
4 * WWW: http://code.google.com/p/freetype-gl/
|
|
|
5 * -------------------------------------------------------------------------
|
|
|
6 * Copyright 2011,2012 Nicolas P. Rougier. All rights reserved.
|
|
|
7 *
|
|
|
8 * Redistribution and use in source and binary forms, with or without
|
|
|
9 * modification, are permitted provided that the following conditions are met:
|
|
|
10 *
|
|
|
11 * 1. Redistributions of source code must retain the above copyright notice,
|
|
|
12 * this list of conditions and the following disclaimer.
|
|
|
13 *
|
|
|
14 * 2. Redistributions in binary form must reproduce the above copyright
|
|
|
15 * notice, this list of conditions and the following disclaimer in the
|
|
|
16 * documentation and/or other materials provided with the distribution.
|
|
|
17 *
|
|
|
18 * THIS SOFTWARE IS PROVIDED BY NICOLAS P. ROUGIER ''AS IS'' AND ANY EXPRESS OR
|
|
|
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
20 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
|
|
21 * EVENT SHALL NICOLAS P. ROUGIER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
|
|
22 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
|
23 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
24 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
|
25 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
28 *
|
|
|
29 * The views and conclusions contained in the software and documentation are
|
|
|
30 * those of the authors and should not be interpreted as representing official
|
|
|
31 * policies, either expressed or implied, of Nicolas P. Rougier.
|
|
|
32 * ========================================================================= */
|
|
|
33 #include <assert.h>
|
|
|
34 #include <stdlib.h>
|
|
|
35 #include <string.h>
|
|
|
36 #include <stdio.h>
|
|
|
37 #include "vector.h"
|
|
|
38
|
|
|
39
|
|
|
40
|
|
|
41 // ------------------------------------------------------------- vector_new ---
|
|
|
42 vector_t *
|
|
|
43 vector_new( size_t item_size )
|
|
|
44 {
|
|
|
45 vector_t *self = (vector_t *) malloc( sizeof(vector_t) );
|
|
|
46 assert( item_size );
|
|
|
47
|
|
|
48 if( !self )
|
|
|
49 {
|
|
|
50 fprintf( stderr,
|
|
|
51 "line %d: No more memory for allocating data\n", __LINE__ );
|
|
|
52 exit( EXIT_FAILURE );
|
|
|
53 }
|
|
|
54 self->item_size = item_size;
|
|
|
55 self->size = 0;
|
|
|
56 self->capacity = 1;
|
|
|
57 self->items = malloc( self->item_size * self->capacity );
|
|
|
58 return self;
|
|
|
59 }
|
|
|
60
|
|
|
61
|
|
|
62
|
|
|
63 // ---------------------------------------------------------- vector_delete ---
|
|
|
64 void
|
|
|
65 vector_delete( vector_t *self )
|
|
|
66 {
|
|
|
67 assert( self );
|
|
|
68
|
|
|
69 free( self->items );
|
|
|
70 free( self );
|
|
|
71 }
|
|
|
72
|
|
|
73
|
|
|
74
|
|
|
75 // ------------------------------------------------------------- vector_get ---
|
|
|
76 const void *
|
|
|
77 vector_get( const vector_t *self,
|
|
|
78 size_t index )
|
|
|
79 {
|
|
|
80 assert( self );
|
|
|
81 assert( self->size );
|
|
|
82 assert( index < self->size );
|
|
|
83
|
|
|
84 return (char*)(self->items) + index * self->item_size;
|
|
|
85 }
|
|
|
86
|
|
|
87
|
|
|
88
|
|
|
89 // ----------------------------------------------------------- vector_front ---
|
|
|
90 const void *
|
|
|
91 vector_front( const vector_t *self )
|
|
|
92 {
|
|
|
93 assert( self );
|
|
|
94 assert( self->size );
|
|
|
95
|
|
|
96 return vector_get( self, 0 );
|
|
|
97 }
|
|
|
98
|
|
|
99
|
|
|
100 // ------------------------------------------------------------ vector_back ---
|
|
|
101 const void *
|
|
|
102 vector_back( const vector_t *self )
|
|
|
103 {
|
|
|
104 assert( self );
|
|
|
105 assert( self->size );
|
|
|
106
|
|
|
107 return vector_get( self, self->size-1 );
|
|
|
108 }
|
|
|
109
|
|
|
110
|
|
|
111 // -------------------------------------------------------- vector_contains ---
|
|
|
112 int
|
|
|
113 vector_contains( const vector_t *self,
|
|
|
114 const void *item,
|
|
|
115 int (*cmp)(const void *, const void *) )
|
|
|
116 {
|
|
|
117 size_t i;
|
|
|
118 assert( self );
|
|
|
119
|
|
|
120 for( i=0; i<self->size; ++i )
|
|
|
121 {
|
|
|
122 if( (*cmp)(item, vector_get(self,i) ) == 0 )
|
|
|
123 {
|
|
|
124 return 1;
|
|
|
125 }
|
|
|
126 }
|
|
|
127 return 0;
|
|
|
128 }
|
|
|
129
|
|
|
130
|
|
|
131 // ----------------------------------------------------------- vector_empty ---
|
|
|
132 int
|
|
|
133 vector_empty( const vector_t *self )
|
|
|
134 {
|
|
|
135 assert( self );
|
|
|
136
|
|
|
137 return self->size == 0;
|
|
|
138 }
|
|
|
139
|
|
|
140
|
|
|
141 // ------------------------------------------------------------ vector_size ---
|
|
|
142 size_t
|
|
|
143 vector_size( const vector_t *self )
|
|
|
144 {
|
|
|
145 assert( self );
|
|
|
146
|
|
|
147 return self->size;
|
|
|
148 }
|
|
|
149
|
|
|
150
|
|
|
151 // --------------------------------------------------------- vector_reserve ---
|
|
|
152 void
|
|
|
153 vector_reserve( vector_t *self,
|
|
|
154 const size_t size )
|
|
|
155 {
|
|
|
156 assert( self );
|
|
|
157
|
|
|
158 if( self->capacity < size)
|
|
|
159 {
|
|
|
160 self->items = realloc( self->items, size * self->item_size );
|
|
|
161 self->capacity = size;
|
|
|
162 }
|
|
|
163 }
|
|
|
164
|
|
|
165
|
|
|
166 // -------------------------------------------------------- vector_capacity ---
|
|
|
167 size_t
|
|
|
168 vector_capacity( const vector_t *self )
|
|
|
169 {
|
|
|
170 assert( self );
|
|
|
171
|
|
|
172 return self->capacity;
|
|
|
173 }
|
|
|
174
|
|
|
175
|
|
|
176 // ---------------------------------------------------------- vector_shrink ---
|
|
|
177 void
|
|
|
178 vector_shrink( vector_t *self )
|
|
|
179 {
|
|
|
180 assert( self );
|
|
|
181
|
|
|
182 if( self->capacity > self->size )
|
|
|
183 {
|
|
|
184 self->items = realloc( self->items, self->size * self->item_size );
|
|
|
185 }
|
|
|
186 self->capacity = self->size;
|
|
|
187 }
|
|
|
188
|
|
|
189
|
|
|
190 // ----------------------------------------------------------- vector_clear ---
|
|
|
191 void
|
|
|
192 vector_clear( vector_t *self )
|
|
|
193 {
|
|
|
194 assert( self );
|
|
|
195
|
|
|
196 self->size = 0;
|
|
|
197 }
|
|
|
198
|
|
|
199
|
|
|
200 // ------------------------------------------------------------- vector_set ---
|
|
|
201 void
|
|
|
202 vector_set( vector_t *self,
|
|
|
203 const size_t index,
|
|
|
204 const void *item )
|
|
|
205 {
|
|
|
206 assert( self );
|
|
|
207 assert( self->size );
|
|
|
208 assert( index < self->size );
|
|
|
209
|
|
|
210 memcpy( (char *)(self->items) + index * self->item_size,
|
|
|
211 item, self->item_size );
|
|
|
212 }
|
|
|
213
|
|
|
214
|
|
|
215 // ---------------------------------------------------------- vector_insert ---
|
|
|
216 void
|
|
|
217 vector_insert( vector_t *self,
|
|
|
218 const size_t index,
|
|
|
219 const void *item )
|
|
|
220 {
|
|
|
221 assert( self );
|
|
|
222 assert( index <= self->size);
|
|
|
223
|
|
|
224 if( self->capacity <= self->size )
|
|
|
225 {
|
|
|
226 vector_reserve(self, 2 * self->capacity );
|
|
|
227 }
|
|
|
228 if( index < self->size )
|
|
|
229 {
|
|
|
230 memmove( (char *)(self->items) + (index + 1) * self->item_size,
|
|
|
231 (char *)(self->items) + (index + 0) * self->item_size,
|
|
|
232 (self->size - index) * self->item_size);
|
|
|
233 }
|
|
|
234 self->size++;
|
|
|
235 vector_set( self, index, item );
|
|
|
236 }
|
|
|
237
|
|
|
238
|
|
|
239 // ----------------------------------------------------- vector_erase_range ---
|
|
|
240 void
|
|
|
241 vector_erase_range( vector_t *self,
|
|
|
242 const size_t first,
|
|
|
243 const size_t last )
|
|
|
244 {
|
|
|
245 assert( self );
|
|
|
246 assert( first < self->size );
|
|
|
247 assert( last < self->size+1 );
|
|
|
248 assert( first < last );
|
|
|
249
|
|
|
250 memmove( (char *)(self->items) + first * self->item_size,
|
|
|
251 (char *)(self->items) + last * self->item_size,
|
|
|
252 (self->size - last) * self->item_size);
|
|
|
253 self->size -= (last-first);
|
|
|
254 }
|
|
|
255
|
|
|
256
|
|
|
257 // ----------------------------------------------------------- vector_erase ---
|
|
|
258 void
|
|
|
259 vector_erase( vector_t *self,
|
|
|
260 const size_t index )
|
|
|
261 {
|
|
|
262 assert( self );
|
|
|
263 assert( index < self->size );
|
|
|
264
|
|
|
265 vector_erase_range( self, index, index+1 );
|
|
|
266 }
|
|
|
267
|
|
|
268
|
|
|
269 // ------------------------------------------------------- vector_push_back ---
|
|
|
270 void
|
|
|
271 vector_push_back( vector_t *self,
|
|
|
272 const void *item )
|
|
|
273 {
|
|
|
274 vector_insert( self, self->size, item );
|
|
|
275 }
|
|
|
276
|
|
|
277
|
|
|
278 // -------------------------------------------------------- vector_pop_back ---
|
|
|
279 void
|
|
|
280 vector_pop_back( vector_t *self )
|
|
|
281 {
|
|
|
282 assert( self );
|
|
|
283 assert( self->size );
|
|
|
284
|
|
|
285 self->size--;
|
|
|
286 }
|
|
|
287
|
|
|
288
|
|
|
289 // ---------------------------------------------------------- vector_resize ---
|
|
|
290 void
|
|
|
291 vector_resize( vector_t *self,
|
|
|
292 const size_t size )
|
|
|
293 {
|
|
|
294 assert( self );
|
|
|
295
|
|
|
296 if( size > self->capacity)
|
|
|
297 {
|
|
|
298 vector_reserve( self, size );
|
|
|
299 self->size = self->capacity;
|
|
|
300 }
|
|
|
301 else
|
|
|
302 {
|
|
|
303 self->size = size;
|
|
|
304 }
|
|
|
305 }
|
|
|
306
|
|
|
307
|
|
|
308 // -------------------------------------------------- vector_push_back_data ---
|
|
|
309 void
|
|
|
310 vector_push_back_data( vector_t *self,
|
|
|
311 const void * data,
|
|
|
312 const size_t count )
|
|
|
313 {
|
|
|
314 assert( self );
|
|
|
315 assert( data );
|
|
|
316 assert( count );
|
|
|
317
|
|
|
318 if( self->capacity < (self->size+count) )
|
|
|
319 {
|
|
|
320 vector_reserve(self, self->size+count);
|
|
|
321 }
|
|
|
322 memmove( (char *)(self->items) + self->size * self->item_size, data,
|
|
|
323 count*self->item_size );
|
|
|
324 self->size += count;
|
|
|
325 }
|
|
|
326
|
|
|
327
|
|
|
328 // ----------------------------------------------------- vector_insert_data ---
|
|
|
329 void
|
|
|
330 vector_insert_data( vector_t *self,
|
|
|
331 const size_t index,
|
|
|
332 const void * data,
|
|
|
333 const size_t count )
|
|
|
334 {
|
|
|
335 assert( self );
|
|
|
336 assert( index < self->size );
|
|
|
337 assert( data );
|
|
|
338 assert( count );
|
|
|
339
|
|
|
340 if( self->capacity < (self->size+count) )
|
|
|
341 {
|
|
|
342 vector_reserve(self, self->size+count);
|
|
|
343 }
|
|
|
344 memmove( (char *)(self->items) + (index + count ) * self->item_size,
|
|
|
345 (char *)(self->items) + (index ) * self->item_size,
|
|
|
346 count*self->item_size );
|
|
|
347 memmove( (char *)(self->items) + index * self->item_size, data,
|
|
|
348 count*self->item_size );
|
|
|
349 self->size += count;
|
|
|
350 }
|
|
|
351
|
|
|
352
|
|
|
353 // ------------------------------------------------------------ vector_sort ---
|
|
|
354 void
|
|
|
355 vector_sort( vector_t *self,
|
|
|
356 int (*cmp)(const void *, const void *) )
|
|
|
357 {
|
|
|
358 assert( self );
|
|
|
359 assert( self->size );
|
|
|
360
|
|
|
361 qsort(self->items, self->size, self->item_size, cmp);
|
|
|
362 }
|
