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
|
/* Copyright (c) 2007 Scott Lembcke
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <stdlib.h>
#include <string.h>
#include "chipmunk.h"
#define CP_ARRAY_INCREMENT 10
// NOTE: cpArray is rarely used and will probably go away.
cpArray*
cpArrayAlloc(void)
{
return (cpArray *)calloc(1, sizeof(cpArray));
}
cpArray*
cpArrayInit(cpArray *arr, int size)
{
arr->num = 0;
size = (size ? size : CP_ARRAY_INCREMENT);
arr->max = size;
arr->arr = (void **)malloc(size*sizeof(void**));
return arr;
}
cpArray*
cpArrayNew(int size)
{
return cpArrayInit(cpArrayAlloc(), size);
}
void
cpArrayDestroy(cpArray *arr)
{
free(arr->arr);
}
void
cpArrayFree(cpArray *arr)
{
if(!arr) return;
cpArrayDestroy(arr);
free(arr);
}
void
cpArrayPush(cpArray *arr, void *object)
{
if(arr->num == arr->max){
arr->max += CP_ARRAY_INCREMENT;
arr->arr = (void **)realloc(arr->arr, arr->max*sizeof(void**));
}
arr->arr[arr->num] = object;
arr->num++;
}
void
cpArrayDeleteIndex(cpArray *arr, int index)
{
int last = --arr->num;
arr->arr[index] = arr->arr[last];
}
void
cpArrayDeleteObj(cpArray *arr, void *obj)
{
for(int i=0; i<arr->num; i++){
if(arr->arr[i] == obj){
cpArrayDeleteIndex(arr, i);
return;
}
}
}
void
cpArrayEach(cpArray *arr, cpArrayIter iterFunc, void *data)
{
for(int i=0; i<arr->num; i++)
iterFunc(arr->arr[i], data);
}
int
cpArrayContains(cpArray *arr, void *ptr)
{
for(int i=0; i<arr->num; i++)
if(arr->arr[i] == ptr) return 1;
return 0;
}
|
