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
|
/****************************************************************************
* Copyright (C) 2009-2015 EPAM Systems
*
* This file is part of Indigo toolkit.
*
* This file may be distributed and/or modified under the terms of the
* GNU General Public License version 3 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
***************************************************************************/
#ifndef __objarray_h__
#define __objarray_h__
#include "base_cpp/array.h"
namespace indigo {
template <typename T> class ObjArray
{
public:
explicit ObjArray ()
{
}
~ObjArray ()
{
while (size() > 0)
pop();
}
const T & operator[] (int index) const
{
return _array[index];
}
T & operator[] (int index)
{
return _array[index];
}
const T & at (int index) const
{
return (*this)[index];
}
T & at (int index)
{
return (*this)[index];
}
int size (void) const { return _array.size(); }
T & push ()
{
void *addr = &_array.push();
new (addr) T();
return _array.top();
}
template <typename A> T & push (A &a)
{
void *addr = &_array.push();
new (addr) T(a);
return _array.top();
}
template <typename A, typename B> T & push (A &a, B *b)
{
void *addr = &_array.push();
new (addr) T(a, b);
return _array.top();
}
template <typename A, typename B, typename C> T & push (A &a, B &b, C &c)
{
void *addr = &_array.push();
new (addr) T(a, b, c);
return _array.top();
}
template <typename A, typename B, typename C> T & push (A *a, B b, C c)
{
void *addr = &_array.push();
new (addr) T(a, b, c);
return _array.top();
}
void clear ()
{
while (size() > 0)
pop();
}
void resize (int newSize)
{
while (newSize < size()) {
pop();
}
while (newSize > size()) {
push();
}
}
void reserve (int size)
{
_array.reserve(size);
}
void expand (int newSize)
{
while (newSize > size()) {
push();
}
}
void remove (int idx)
{
_array[idx].~T();
_array.remove(idx);
}
T & top ()
{
return _array.top();
}
const T & top () const
{
return _array.top();
}
void pop ()
{
_array.top().~T();
_array.pop();
}
template <typename T1, typename T2>
void qsort (int (*cmp)(T1, T2, void *), void *context)
{
_array.qsort(cmp, context);
}
const T * ptr () const
{
return _array.ptr();
}
protected:
Array<T> _array;
private:
ObjArray (const ObjArray &); // no implicit copy
};
}
#endif
|
