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
|
/****************************************************************************
* 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 __reusable_obj_array__
#define __reusable_obj_array__
#include "base_cpp/array.h"
namespace indigo
{
template <typename T> class ReusableObjArray
{
public:
explicit ReusableObjArray()
{
_count = 0;
}
~ReusableObjArray()
{
for (int i = 0; i < _array.size(); i++)
{
_array[i].~T();
}
}
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 _count;
}
void resize(const int newSize)
{
if (newSize <= _count)
{
_count = newSize;
}
else
{
_array.reserve(newSize);
while (_count < newSize)
{
push();
}
}
}
T& push()
{
T* addr;
if (_count == _array.size())
{
addr = &_array.push();
new (addr) T();
}
else
{
addr = &_array[_count];
}
_count++;
addr->clear();
return *addr;
}
void pop()
{
_count--;
}
T& top()
{
return _array[_count - 1];
}
void clear()
{
_count = 0;
}
void reserve(int to_reserve)
{
_array.reserve(to_reserve);
}
protected:
Array<T> _array;
int _count;
private:
ReusableObjArray(const ReusableObjArray&); // no implicit copy
};
} // namespace indigo
#endif
|
