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
|
/****************************************************************************
* 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 __obj_list_h__
#define __obj_list_h__
#include "base_cpp/list.h"
namespace indigo
{
template <typename T> class ObjList
{
public:
typedef typename List<T>::Elem Elem;
ObjList()
{
}
explicit ObjList(Pool<Elem>& pool) : _list(pool)
{
}
~ObjList()
{
clear();
}
int add()
{
int idx = _list.add();
new (&_list[idx]) T();
return idx;
}
template <typename A> int add(A& a)
{
int idx = _list.add();
new (&_list[idx]) T(a);
return idx;
}
int insertAfter(int existing)
{
int idx = _list.insertAfter(existing);
new (&_list[idx]) T();
return idx;
}
template <typename A> int insertAfter(int existing, A& a)
{
int idx = _list.insertAfter(existing);
new (&_list[idx]) T(a);
return idx;
}
int insertBefore(int existing)
{
int idx = _list.insertBefore(existing);
new (&_list[idx]) T();
return idx;
}
template <typename A> int insertBefore(int existing, A& a)
{
int idx = _list.insertBefore(existing);
new (&_list[idx]) T(a);
return idx;
}
void remove(int idx)
{
_list[idx].~T();
_list.remove(idx);
}
int size() const
{
return _list.size();
}
int begin() const
{
return _list.begin();
}
int end() const
{
return _list.end();
}
int next(int idx) const
{
return _list.next(idx);
}
void clear()
{
while (_list.size() > 0)
remove(_list.tail());
}
T& operator[](int index) const
{
return _list[index];
}
T& at(int index) const
{
return _list[index];
}
protected:
List<T> _list;
private:
ObjList(const ObjList<T>&); // no implicit copy
};
} // namespace indigo
#endif
|
