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
|
/****************************************************************************
* Copyright (C) from 2009 to Present EPAM Systems.
*
* This file is part of Indigo toolkit.
*
* 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.
***************************************************************************/
#ifndef __ptr_array__
#define __ptr_array__
#include "base_cpp/array.h"
#ifdef _WIN32
#pragma warning(push)
#pragma warning(disable : 4251)
#endif
namespace indigo
{
DECL_EXCEPTION(PtrArrayError);
template <typename T> class PtrArray
{
public:
explicit PtrArray()
{
}
virtual ~PtrArray()
{
clear();
}
DECL_TPL_ERROR(PtrArrayError);
T& add(T* obj)
{
_ptrarray.push(obj);
return *obj;
}
T* pop(void)
{
return _ptrarray.pop();
}
T* top(void)
{
return at(size() - 1);
}
void expand(int newsize)
{
while (_ptrarray.size() < newsize)
_ptrarray.push(0);
}
void clear(void)
{
int i;
for (i = 0; i < _ptrarray.size(); i++)
{
if (_ptrarray[i] == 0)
continue;
delete _ptrarray[i];
_ptrarray[i] = 0;
}
_ptrarray.clear();
}
int size() const
{
return _ptrarray.size();
}
void resize(const int newsize)
{
int i, oldsize = _ptrarray.size();
for (int i = newsize; i < oldsize; i++)
{
if (_ptrarray[i] == 0)
continue;
delete _ptrarray[i];
_ptrarray[i] = 0;
}
_ptrarray.resize(newsize);
for (i = oldsize; i < newsize; i++)
_ptrarray[i] = 0;
}
void removeLast()
{
delete _ptrarray.pop();
}
void remove(int idx)
{
delete _ptrarray[idx];
_ptrarray.remove(idx);
}
void set(int idx, T* obj)
{
if (_ptrarray[idx] != 0)
throw Error("object #%d already set", idx);
_ptrarray[idx] = obj;
}
void reset(int idx)
{
delete _ptrarray[idx];
_ptrarray[idx] = 0;
}
void reset(int idx, T* obj)
{
reset(idx);
set(idx, obj);
}
T* release(int idx)
{
T* result = _ptrarray[idx];
_ptrarray[idx] = 0;
return result;
}
void qsort(int (*cmp)(T* const&, T* const&, const void*), const void* context)
{
_ptrarray.qsort(cmp, context);
}
const T* operator[](int index) const
{
return _ptrarray[index];
}
T*& operator[](int index)
{
return _ptrarray[index];
}
const T* at(int index) const
{
return _ptrarray[index];
}
T*& at(int index)
{
return _ptrarray[index];
}
const T* const* ptr() const
{
return _ptrarray.ptr();
}
T** ptr()
{
return _ptrarray.ptr();
}
protected:
Array<T*> _ptrarray;
private:
PtrArray(const PtrArray&); // no implicit copy
};
} // namespace indigo
#ifdef _WIN32
#pragma warning(pop)
#endif
#endif
|
