-
Notifications
You must be signed in to change notification settings - Fork 7
/
innerlist.hpp
328 lines (267 loc) · 6.69 KB
/
innerlist.hpp
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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
// solid/utility/innerlist.hpp
//
// Copyright (c) 2007, 2008 Valentin Palade (vipalade @ gmail . com)
//
// This file is part of SolidFrame framework.
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt.
//
#pragma once
#include "solid/utility/common.hpp"
namespace solid {
namespace inner {
struct Link {
size_t prev_;
size_t next_;
void clear()
{
prev_ = next_ = InvalidIndex();
}
Link(
const size_t _prev = InvalidIndex(),
const size_t _next = InvalidIndex())
: prev_(_prev)
, next_(_next)
{
}
};
template <size_t Size>
struct Node;
template <size_t Size>
Link& link_accessor(Node<Size>& _node, const size_t _index);
template <size_t Size>
Link const& link_const_accessor(Node<Size> const& _node, const size_t _index);
template <size_t Size>
struct Node {
enum {
NodeSize = Size,
};
private:
template <size_t Sz>
friend Link& link_accessor(Node<Sz>& _node, const size_t _index);
template <size_t Sz>
friend Link const& link_const_accessor(Node<Sz> const& _node, const size_t _index);
Link links[NodeSize];
};
template <size_t Size>
Link& link_accessor(Node<Size>& _node, const size_t _index)
{
return _node.links[_index];
}
template <size_t Size>
Link const& link_const_accessor(Node<Size> const& _node, const size_t _index)
{
return _node.links[_index];
}
template <class Vec, size_t LinkId>
class List {
public:
typedef typename Vec::value_type ValueT;
List(Vec& _rvec)
: rvec_(_rvec)
, size_(0)
, back_(InvalidIndex())
, front_(InvalidIndex())
{
}
List(List<Vec, LinkId>&) = delete;
List(List<Vec, LinkId>&&) = delete;
List(
Vec& _rvec,
List<Vec, LinkId>& _rinnerlist)
: rvec_(_rvec)
, size_(_rinnerlist.size_)
, back_(_rinnerlist.back_)
, front_(_rinnerlist.front_)
{
}
void pushBack(const size_t _index)
{
Link& rcrt_link = link(_index);
rcrt_link = Link(back_, InvalidIndex());
if (back_ != InvalidIndex()) {
link(back_).next_ = _index;
back_ = _index;
} else {
back_ = _index;
front_ = _index;
}
++size_;
}
void pushFront(const size_t _index)
{
Link& rcrt_link = link(_index);
rcrt_link = Link(InvalidIndex(), front_);
if (front_ != InvalidIndex()) {
link(front_).prev_ = _index;
front_ = _index;
} else {
back_ = _index;
front_ = _index;
}
++size_;
}
// insert in front of the sentinel
void insertBefore(const size_t _sentinel, const size_t _index)
{
Link& rsent_link = link(_sentinel);
Link& rcrt_link = link(_index);
rcrt_link = Link(rsent_link.prev_, _sentinel);
rsent_link.prev_ = _index;
if (front_ == _sentinel) {
front_ = _index;
} else {
Link& lnk = link(rcrt_link.prev_);
lnk.next_ = _index;
}
++size_;
}
void insertAfter(const size_t _sentinel, const size_t _index)
{
Link& rsent_link = link(_sentinel);
Link& rcrt_link = link(_index);
rcrt_link = Link(_sentinel, rsent_link.next_);
rsent_link.next_ = _index;
if (back_ == _sentinel) {
back_ = _index;
} else {
Link& lnk = link(rcrt_link.next_);
lnk.prev_ = _index;
}
++size_;
}
ValueT& front()
{
return rvec_[front_];
}
ValueT const& front() const
{
return rvec_[front_];
}
size_t frontIndex() const
{
return front_;
}
ValueT& back()
{
return rvec_[back_];
}
ValueT const& back() const
{
return rvec_[back_];
}
size_t backIndex() const
{
return back_;
}
void erase(const size_t _index)
{
Link& rcrt_link = link(_index);
if (rcrt_link.prev_ != InvalidIndex()) {
link(rcrt_link.prev_).next_ = rcrt_link.next_;
} else {
// first in the list
front_ = rcrt_link.next_;
}
if (rcrt_link.next_ != InvalidIndex()) {
link(rcrt_link.next_).prev_ = rcrt_link.prev_;
} else {
// last in the list
back_ = rcrt_link.prev_;
}
--size_;
rcrt_link.clear();
}
size_t popFront()
{
const size_t old_front = front_;
erase(front_);
return old_front;
}
size_t popBack()
{
const size_t old_back = back_;
erase(back_);
return old_back;
}
size_t size() const
{
return size_;
}
bool empty() const
{
return size_ == 0;
}
template <class F>
void forEach(F _f)
{
size_t it = front_;
while (it != InvalidIndex()) {
const size_t crtit = it;
it = link(it).next_;
_f(crtit, rvec_[crtit]);
}
}
template <class F>
void forEach(F _f) const
{
size_t it = front_;
while (it != InvalidIndex()) {
const size_t crtit = it;
it = link(it).next_;
_f(crtit, rvec_[crtit]);
}
}
void fastClear()
{
size_ = 0;
back_ = front_ = InvalidIndex();
}
void clear()
{
while (size()) {
popFront();
}
}
size_t previousIndex(const size_t _index) const
{
return link(_index).prev_;
}
size_t nextIndex(const size_t _index) const
{
return link(_index).next_;
}
bool check() const
{
if (size() && (back_ == InvalidIndex() || front_ == InvalidIndex())) {
return false;
}
if (back_ == InvalidIndex() || front_ == InvalidIndex()) {
return back_ == front_;
}
return true;
}
bool contains(const size_t _index) const
{
return link(_index).prev_ != InvalidIndex() || link(_index).next_ != InvalidIndex() || _index == back_;
}
private:
Link& link(const size_t _index)
{
// typedef Vec::value_type NodeT;
return link_accessor(rvec_[_index], LinkId);
}
Link const& link(const size_t _index) const
{
// typedef Vec::value_type NodeT;
return link_const_accessor(rvec_[_index], LinkId);
}
private:
Vec& rvec_;
size_t size_;
size_t back_;
size_t front_;
};
} // namespace inner
} // namespace solid