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
|
/*
* Copyright 2010 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef GrTDArray_DEFINED
#define GrTDArray_DEFINED
#include "GrTypes.h"
#include "GrRefCnt.h"
static int GrInitialArrayAllocationCount() {
return 4;
}
static int GrNextArrayAllocationCount(int count) {
return count + ((count + 1) >> 1);
}
template <typename T> class GrTDArray {
public:
GrTDArray() : fArray(NULL), fAllocated(0), fCount(0) {}
GrTDArray(const GrTDArray& src) {
fCount = fAllocated = src.fCount;
fArray = (T*)GrMalloc(fAllocated * sizeof(T));
memcpy(fArray, src.fArray, fCount * sizeof(T));
}
~GrTDArray() {
if (fArray) {
GrFree(fArray);
}
}
bool isEmpty() const { return 0 == fCount; }
int count() const { return fCount; }
const T& at(int index) const {
GrAssert((unsigned)index < (unsigned)fCount);
return fArray[index];
}
T& at(int index) {
GrAssert((unsigned)index < (unsigned)fCount);
return fArray[index];
}
const T& operator[](int index) const { return this->at(index); }
T& operator[](int index) { return this->at(index); }
GrTDArray& operator=(const GrTDArray& src) {
if (fAllocated < src.fCount) {
fAllocated = src.fCount;
GrFree(fArray);
fArray = (T*)GrMalloc(fAllocated * sizeof(T));
}
fCount = src.fCount;
memcpy(fArray, src.fArray, fCount * sizeof(T));
return *this;
}
void reset() {
if (fArray) {
GrFree(fArray);
fArray = NULL;
}
fAllocated = fCount = 0;
}
T* begin() const { return fArray; }
T* end() const { return fArray + fCount; }
T* back() const { GrAssert(fCount); return fArray + (fCount - 1); }
T* prepend() {
this->growAt(0);
return fArray;
}
T* append() {
this->growAt(fCount);
return fArray + fCount - 1;
}
/**
* index may be [0..count], so that you can insert at the end (like append)
*/
T* insert(int index) {
GrAssert((unsigned)index <= (unsigned)fCount);
this->growAt(index);
return fArray + index;
}
void remove(int index) {
GrAssert((unsigned)index < (unsigned)fCount);
fCount -= 1;
if (index < fCount) {
int remaining = fCount - index;
memmove(fArray + index, fArray + index + 1, remaining * sizeof(T));
}
}
void removeShuffle(int index) {
GrAssert((unsigned)index < (unsigned)fCount);
fCount -= 1;
if (index < fCount) {
memmove(fArray + index, fArray + fCount, sizeof(T));
}
}
// Utility iterators
/**
* Calls GrFree() on each element. Assumes each is NULL or was allocated
* with GrMalloc().
*/
void freeAll() {
T* stop = this->end();
for (T* curr = this->begin(); curr < stop; curr++) {
GrFree(*curr);
}
this->reset();
}
/**
* Calls delete on each element. Assumes each is NULL or was allocated
* with new.
*/
void deleteAll() {
T* stop = this->end();
for (T* curr = this->begin(); curr < stop; curr++) {
delete *curr;
}
this->reset();
}
/**
* Calls GrSafeUnref() on each element. Assumes each is NULL or is a
* subclass of GrRefCnt.
*/
void unrefAll() {
T* stop = this->end();
for (T* curr = this->begin(); curr < stop; curr++) {
GrSafeUnref(*curr);
}
this->reset();
}
void visit(void visitor(T&)) const {
T* stop = this->end();
for (T* curr = this->begin(); curr < stop; curr++) {
if (*curr) {
visitor(*curr);
}
}
}
int find(const T& elem) const {
int count = this->count();
T* curr = this->begin();
for (int i = 0; i < count; i++) {
if (elem == curr[i]) {
return i;
}
}
return -1;
}
friend bool operator==(const GrTDArray<T>& a, const GrTDArray<T>& b) {
return a.count() == b.count() &&
(0 == a.count() ||
0 == memcmp(a.begin(), b.begin(), a.count() * sizeof(T)));
}
friend bool operator!=(const GrTDArray<T>& a, const GrTDArray<T>& b) {
return !(a == b);
}
private:
T* fArray;
int fAllocated, fCount;
// growAt will increment fCount, reallocate fArray (as needed), and slide
// the contents of fArray to make a hole for new data at index.
void growAt(int index) {
GrAssert(fCount <= fAllocated);
if (0 == fAllocated) {
fAllocated = GrInitialArrayAllocationCount();
fArray = (T*)GrMalloc(fAllocated * sizeof(T));
} else if (fCount == fAllocated) {
fAllocated = GrNextArrayAllocationCount(fAllocated);
T* newArray = (T*)GrMalloc(fAllocated * sizeof(T));
memcpy(newArray, fArray, index * sizeof(T));
memcpy(newArray + index + 1, fArray + index,
(fCount - index) * sizeof(T));
GrFree(fArray);
fArray = newArray;
} else {
// check that we're not just appending
if (index < fCount) {
memmove(fArray + index + 1, fArray + index,
(fCount - index) * sizeof(T));
}
}
GrAssert(fCount < fAllocated);
fCount += 1;
}
};
extern void* GrTDArray_growAt(void*, int* allocated, int& count, int index,
size_t);
#endif
|
