ESP-IDF
Select one of the symbols to view example projects that use it.
 
Outline
#define intrusive_list_h
#include <cassert>
#include <unordered_map>
#include <cstddef>
intrusive_list
intrusive_list_node
intrusive_list
Files
loading...
SourceVuESP-IDF Framework and ExamplesESP-IDFcomponents/nvs_flash/src/intrusive_list.h
 
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
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
/* * SPDX-FileCopyrightText: 2015-2022 Espressif Systems (Shanghai) CO LTD * * SPDX-License-Identifier: Apache-2.0 *//* ... */ #ifndef intrusive_list_h #define intrusive_list_h #include <cassert> #include <unordered_map> #include <cstddef> template <typename T> class intrusive_list; template <typename T> class intrusive_list_node { protected: friend class intrusive_list<T>; T* mPrev = nullptr; T* mNext = nullptr;... }{ ... }; template <typename T> class intrusive_list { typedef intrusive_list_node<T> TNode; static_assert(std::is_base_of<TNode, T>::value, ""); public: class iterator { public: using iterator_category = std::forward_iterator_tag; using value_type = T; using difference_type = ptrdiff_t; using pointer = T*; using reference = T&; iterator() : mPos(nullptr) {} iterator(T* pos) : mPos(pos) {} iterator operator++(int) { auto result = *this; mPos = mPos->mNext; return result; }{...} iterator operator--(int) { auto result = *this; mPos = mPos->mPrev; return result; }{...} iterator& operator++() { mPos = mPos->mNext; return *this; }{...} iterator& operator--() { mPos = mPos->mPrev; return *this; }{...} bool operator==(const iterator& other) const { return mPos == other.mPos; }{...} bool operator!=(const iterator& other) const { return !(*this == other); }{...} T& operator*() { return *mPos; }{...} const T& operator*() const { return *mPos; }{...} T* operator->() { return mPos; }{...} const T* operator->() const { return mPos; }{...} operator T*() { return mPos; }{...} operator const T*() const { return mPos; }{...} ... protected: T* mPos;... }{ ... }; void push_back(T* node) { if (mLast) { mLast->mNext = node; }{...} node->mPrev = mLast; node->mNext = nullptr; mLast = node; if (mFirst == nullptr) { mFirst = node; }{...} ++mSize; }{...} void push_front(T* node) { node->mPrev = nullptr; node->mNext = mFirst; if (mFirst) { mFirst->mPrev = node; }{...} mFirst = node; if (mLast == nullptr) { mLast = node; }{...} ++mSize; }{...} T& back() { return *mLast; }{...} const T& back() const { return *mLast; }{...} T& front() { return *mFirst; }{...} const T& front() const { return *mFirst; }{...} void pop_front() { erase(mFirst); }{...} void pop_back() { erase(mLast); }{...} void insert(iterator next, T* node) { if (static_cast<T*>(next) == nullptr) { push_back(node); }{...} else { auto prev = next->mPrev; if (!prev) { push_front(node); }{...} else { prev->mNext = node; next->mPrev = node; node->mNext = next; node->mPrev = &(*prev); ++mSize; }{...} }{...} }{...} void erase(iterator it) { auto prev = it->mPrev; auto next = it->mNext; if (prev) { prev->mNext = next; }{...} else { mFirst = next; }{...} if (next) { next->mPrev = prev; }{...} else { mLast = prev; }{...} --mSize; }{...} iterator begin() { return iterator(mFirst); }{...} iterator end() { return iterator(nullptr); }{...} size_t size() const { return mSize; }{...} bool empty() const { return mSize == 0; }{...} void clear() { while (mFirst) { erase(mFirst); }{...} }{...} void clearAndFreeNodes() { while (mFirst) { auto tmp = mFirst; erase(mFirst); delete tmp; }{...} }{...} ... protected: T* mFirst = nullptr; T* mLast = nullptr; size_t mSize = 0;... }{ ... }; /* ... */ #endif /* intrusive_list_h */
Details
Show:
from
Types: Columns: