Skip to content
Navigation Menu
{{ message }}
-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathCollection.cpp
More file actions
356 lines (314 loc) · 10.3 KB
/
Collection.cpp
File metadata and controls
356 lines (314 loc) · 10.3 KB
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
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
/*
* Copyright (C) 2021 CESNET, https://photonics.cesnet.cz/
*
* Written by Václav Kubernát <kubernat@cesnet.cz>
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#include <libyang-cpp/Collection.hpp>
#include <libyang-cpp/DataNode.hpp>
#include <libyang/libyang.h>
#include <stdexcept>
#include "utils/ref_count.hpp"
namespace libyang {
/**
* @brief Creates a new iterator starting at `start`.
*/
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>::Iterator(underlying_node_t<NodeType>* start, const Collection<NodeType, ITER_TYPE>* coll)
: m_current(start)
, m_start(start)
, m_next(start)
, m_collection(coll)
{
registerThis();
}
/**
* @brief Creates an iterator that acts as the `end()` for iteration.
*/
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>::Iterator(const Collection<NodeType, ITER_TYPE>* coll, const end)
: m_current(nullptr)
, m_collection(coll)
{
}
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>::~Iterator()
{
unregisterThis();
}
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>::Iterator(const Iterator<NodeType, ITER_TYPE>& other)
: m_current(other.m_current)
, m_start(other.m_start)
, m_next(other.m_next)
, m_collection(other.m_collection)
{
registerThis();
}
template <typename NodeType, IterationType ITER_TYPE>
void Iterator<NodeType, ITER_TYPE>::registerThis()
{
if (m_collection) {
if (!m_collection->m_valid) { // registerThis() is only run on construction -> the collection must be valid
throw std::logic_error("libyang-cpp internal error: collection is invalid although it was just created");
}
m_collection->m_iterators.emplace(this);
}
}
template <typename NodeType, IterationType ITER_TYPE>
void Iterator<NodeType, ITER_TYPE>::unregisterThis()
{
if (m_collection) {
m_collection->m_iterators.erase(this);
}
}
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>& Iterator<NodeType, ITER_TYPE>::operator++()
{
throwIfInvalid();
if (!m_current) {
return *this;
}
if constexpr (ITER_TYPE == IterationType::Dfs) {
// select element for the next run - children first
if constexpr (std::is_same_v<decltype(m_next), lyd_node*>) {
m_next = lyd_child(m_current);
} else {
m_next = lysc_node_child(m_current);
}
if (!m_next) {
// no children
if (m_current == m_start) {
// we are done, m_start has no children
// this iterator is now the `end` iterator, so wee need to set current to nullptr
m_current = nullptr;
return *this;
}
// try siblings
m_next = m_current->next;
}
while (!m_next) {
// parent is already processed, go to its sibling
m_current = reinterpret_cast<underlying_node_t<NodeType>*>(m_current->parent);
// no siblings, go back through parents
if (m_current->parent == m_start->parent) {
// we are done, no next element to process
break;
}
m_next = m_current->next;
}
m_current = m_next;
} else {
m_current = m_current->next;
}
return *this;
}
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE> Iterator<NodeType, ITER_TYPE>::operator++(int)
{
throwIfInvalid();
auto copy = *this;
operator++();
return copy;
}
template <typename NodeType, IterationType ITER_TYPE>
NodeType Iterator<NodeType, ITER_TYPE>::operator*() const
{
throwIfInvalid();
if (!m_current) {
throw std::out_of_range("Dereferenced .end() iterator");
}
if constexpr (std::is_same_v<NodeType, Meta>) {
return Meta{m_current, m_collection->m_refs.m_refs ? m_collection->m_refs.m_refs->context : nullptr};
} else if constexpr (std::is_same_v<NodeType, Attribute>) {
return Attribute{m_current};
} else {
return NodeType{m_current, m_collection->m_refs};
}
}
template <typename NodeType, IterationType ITER_TYPE>
typename Iterator<NodeType, ITER_TYPE>::NodeProxy Iterator<NodeType, ITER_TYPE>::operator->() const
{
throwIfInvalid();
return NodeProxy{**this};
}
/**
* @brief Checks if the both iterators to the same tree element.
*/
template <typename NodeType, IterationType ITER_TYPE>
bool Iterator<NodeType, ITER_TYPE>::operator==(const Iterator<NodeType, ITER_TYPE>& it) const
{
throwIfInvalid();
it.throwIfInvalid();
if (m_collection != it.m_collection) {
throw std::out_of_range("Iterators are from different collections");
}
return m_current == it.m_current;
}
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE>& Iterator<NodeType, ITER_TYPE>::operator=(const Iterator<NodeType, ITER_TYPE>& other)
{
if (this == &other) {
return *this;
}
this->unregisterThis();
this->m_collection = other.m_collection;
this->m_current = other.m_current;
this->m_next = other.m_next;
this->m_start = other.m_start;
return *this;
}
template <typename NodeType, IterationType ITER_TYPE>
void Iterator<NodeType, ITER_TYPE>::throwIfInvalid() const
{
if (!m_collection) {
throw std::out_of_range("Iterator is invalid");
}
}
template <typename NodeType, IterationType ITER_TYPE>
Collection<NodeType, ITER_TYPE>::Collection(underlying_node_t<NodeType>* start, impl::refs_type_t<NodeType> refs)
: m_start(start)
, m_refs(refs)
{
if constexpr (std::is_same_v<NodeType, DataNode>) {
if (m_refs) {
if constexpr (ITER_TYPE == IterationType::Dfs) {
m_refs->dataCollectionsDfs.emplace(this);
} else {
m_refs->dataCollectionsSibling.emplace(this);
}
}
}
}
template <typename NodeType, IterationType ITER_TYPE>
Collection<NodeType, ITER_TYPE>::Collection(const Collection<NodeType, ITER_TYPE>& other)
: m_start(other.m_start)
, m_refs(other.m_refs)
, m_valid(other.m_valid)
{
if constexpr (std::is_same_v<NodeType, DataNode>) {
if (m_refs) {
if constexpr (ITER_TYPE == IterationType::Dfs) {
m_refs->dataCollectionsDfs.emplace(this);
} else {
m_refs->dataCollectionsSibling.emplace(this);
}
}
}
}
template <typename NodeType, IterationType ITER_TYPE>
void Collection<NodeType, ITER_TYPE>::invalidate()
{
m_valid = false;
if constexpr (std::is_same_v<NodeType, DataNode>) {
for (const auto& iterator : m_iterators) {
iterator->m_collection = nullptr;
}
}
m_iterators.clear();
}
template <typename NodeType, IterationType ITER_TYPE>
Collection<NodeType, ITER_TYPE>& Collection<NodeType, ITER_TYPE>::operator=(const Collection<NodeType, ITER_TYPE>& other)
{
if (this == &other) {
return *this;
}
// Our iterators must be invalidated, since we're assigning a different collection.
invalidate();
m_iterators.clear();
this->m_start = other.m_start;
this->m_refs = other.m_refs;
this->m_valid = other.m_valid;
return *this;
}
template <typename NodeType, IterationType ITER_TYPE>
Collection<NodeType, ITER_TYPE>::~Collection()
{
if constexpr (std::is_same_v<NodeType, DataNode>) {
invalidate();
if (m_refs) {
if constexpr (ITER_TYPE == IterationType::Dfs) {
m_refs->dataCollectionsDfs.erase(this);
} else {
m_refs->dataCollectionsSibling.erase(this);
}
}
}
}
/**
* Returns an iterator pointing to the starting element.
*/
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE> Collection<NodeType, ITER_TYPE>::begin() const
{
throwIfInvalid();
return Iterator{m_start, this};
}
/**
* Returns an iterator used as the `end` iterator.
*/
template <typename NodeType, IterationType ITER_TYPE>
Iterator<NodeType, ITER_TYPE> Collection<NodeType, ITER_TYPE>::end() const
{
throwIfInvalid();
return Iterator<NodeType, ITER_TYPE>{this, typename Iterator<NodeType, ITER_TYPE>::end{}};
}
template <typename NodeType, IterationType ITER_TYPE>
bool Collection<NodeType, ITER_TYPE>::empty() const
{
return begin() == end();
}
template <typename NodeType, IterationType ITER_TYPE>
void Collection<NodeType, ITER_TYPE>::throwIfInvalid() const
{
if (!m_valid) {
throw std::out_of_range("Collection is invalid");
}
}
template class LIBYANG_CPP_EXPORT Collection<DataNode, IterationType::Dfs>;
template class LIBYANG_CPP_EXPORT Iterator<DataNode, IterationType::Dfs>;
template class LIBYANG_CPP_EXPORT Collection<SchemaNode, IterationType::Dfs>;
template class LIBYANG_CPP_EXPORT Iterator<SchemaNode, IterationType::Dfs>;
template class LIBYANG_CPP_EXPORT Collection<DataNode, IterationType::Sibling>;
template class LIBYANG_CPP_EXPORT Iterator<DataNode, IterationType::Sibling>;
template class LIBYANG_CPP_EXPORT Collection<SchemaNode, IterationType::Sibling>;
template class LIBYANG_CPP_EXPORT Iterator<SchemaNode, IterationType::Sibling>;
#pragma GCC diagnostic push
#if __GNUC__ && !__clang__
#pragma GCC diagnostic ignored "-Wattributes"
#endif
template class LIBYANG_CPP_EXPORT Collection<Meta, IterationType::MetaAttr>;
template class LIBYANG_CPP_EXPORT Iterator<Meta, IterationType::MetaAttr>;
template class LIBYANG_CPP_EXPORT Collection<Attribute, IterationType::MetaAttr>;
template class LIBYANG_CPP_EXPORT Iterator<Attribute, IterationType::MetaAttr>;
#pragma GCC diagnostic pop
/**
* @brief Erases a Meta element from the collection.
*
* @return Iterator to the next element in the collection.
*
* Wraps `lyd_free_meta_single`.
*/
MetaCollection::iterator_type MetaCollection::erase(iterator_type what)
{
auto toDelete = what;
auto next = ++what;
lyd_free_meta_single(toDelete.m_current);
return next;
}
/**
* @brief Erases an Attribute element from the collection.
*
* @return Iterator to the next element in the collection.
*
* Wraps `lyd_free_attr_single`.
*/
AttributeCollection::iterator_type AttributeCollection::erase(iterator_type what)
{
auto toDelete = what;
auto next = ++what;
lyd_free_attr_single(toDelete.m_current->parent->ctx, toDelete.m_current);
return next;
}
}
You can’t perform that action at this time.