This file is indexed.

/usr/include/yaml-cpp/node/impl.h is in libyaml-cpp-dev 0.5.1-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
#ifndef NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66
#define NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66

#if defined(_MSC_VER) || (defined(__GNUC__) && (__GNUC__ == 3 && __GNUC_MINOR__ >= 4) || (__GNUC__ >= 4)) // GCC supports "pragma once" correctly since 3.4
#pragma once
#endif


#include "yaml-cpp/node/node.h"
#include "yaml-cpp/node/iterator.h"
#include "yaml-cpp/node/detail/memory.h"
#include "yaml-cpp/node/detail/node.h"
#include "yaml-cpp/exceptions.h"
#include <string>

namespace YAML
{
	inline Node::Node(): m_isValid(true), m_pNode(NULL)
	{
	}
	
	inline Node::Node(NodeType::value type): m_isValid(true), m_pMemory(new detail::memory_holder), m_pNode(&m_pMemory->create_node())
	{
		m_pNode->set_type(type);
	}
	
	template<typename T>
	inline Node::Node(const T& rhs): m_isValid(true), m_pMemory(new detail::memory_holder), m_pNode(&m_pMemory->create_node())
	{
		Assign(rhs);
	}
	
    inline Node::Node(const detail::iterator_value& rhs): m_isValid(rhs.m_isValid), m_pMemory(rhs.m_pMemory), m_pNode(rhs.m_pNode)
    {
    }

	inline Node::Node(const Node& rhs): m_isValid(rhs.m_isValid), m_pMemory(rhs.m_pMemory), m_pNode(rhs.m_pNode)
	{
	}
	
    inline Node::Node(Zombie): m_isValid(false), m_pNode(NULL)
    {
    }

    inline Node::Node(detail::node& node, detail::shared_memory_holder pMemory): m_isValid(true), m_pMemory(pMemory), m_pNode(&node)
	{
	}

	inline Node::~Node()
	{
	}

	inline void Node::EnsureNodeExists() const
	{
        if(!m_isValid)
            throw InvalidNode();
		if(!m_pNode) {
			m_pMemory.reset(new detail::memory_holder);
			m_pNode = &m_pMemory->create_node();
			m_pNode->set_null();
		}
	}
	
	inline bool Node::IsDefined() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? m_pNode->is_defined() : true;
	}

	inline NodeType::value Node::Type() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? m_pNode->type() : NodeType::Null;
	}
	
	// access
    
    // template helpers
    template<typename T, typename S>
    struct as_if {
        explicit as_if(const Node& node_): node(node_) {}
        const Node& node;
        
        const T operator()(const S& fallback) const {
            if(!node.m_pNode)
                return fallback;
            
            T t;
            if(convert<T>::decode(node, t))
                return t;
            return fallback;
        }
    };
    
    template<typename S>
    struct as_if<std::string, S> {
        explicit as_if(const Node& node_): node(node_) {}
        const Node& node;
        
        const std::string operator()(const S& fallback) const {
            if(node.Type() != NodeType::Scalar)
                return fallback;
            return node.Scalar();
        }
    };
    
    template<typename T>
    struct as_if<T, void> {
        explicit as_if(const Node& node_): node(node_) {}
        const Node& node;
        
        const T operator()() const {
            if(!node.m_pNode)
                throw TypedBadConversion<T>();
			
            T t;
            if(convert<T>::decode(node, t))
                return t;
            throw TypedBadConversion<T>();
        }
    };
    
    template<>
    struct as_if<std::string, void> {
        explicit as_if(const Node& node_): node(node_) {}
        const Node& node;
        
        const std::string operator()() const {
            if(node.Type() != NodeType::Scalar)
                throw TypedBadConversion<std::string>();
            return node.Scalar();
        }
    };

    // access functions
	template<typename T>
	inline const T Node::as() const
	{
        if(!m_isValid)
            throw InvalidNode();
        return as_if<T, void>(*this)();
	}

    template<typename T, typename S>
    inline const T Node::as(const S& fallback) const
    {
        if(!m_isValid)
            throw InvalidNode();
        return as_if<T, S>(*this)(fallback);
    }
    
	inline const std::string& Node::Scalar() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? m_pNode->scalar() : detail::node_data::empty_scalar;
	}

	inline const std::string& Node::Tag() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? m_pNode->tag() : detail::node_data::empty_scalar;
	}

	inline void Node::SetTag(const std::string& tag)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		m_pNode->set_tag(tag);
	}

	// assignment
	inline bool Node::is(const Node& rhs) const
	{
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
        if(!m_pNode || !rhs.m_pNode)
            return false;
		return m_pNode->is(*rhs.m_pNode);
	}

	template<typename T>
	inline Node& Node::operator=(const T& rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		Assign(rhs);
		return *this;
	}
	
    inline void Node::reset(const YAML::Node& rhs)
    {
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
        m_pMemory = rhs.m_pMemory;
        m_pNode = rhs.m_pNode;
    }

	template<typename T>
	inline void Node::Assign(const T& rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		AssignData(convert<T>::encode(rhs));
	}

	template<>
	inline void Node::Assign(const std::string& rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		m_pNode->set_scalar(rhs);
	}

	inline void Node::Assign(const char *rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		m_pNode->set_scalar(rhs);
	}

	inline void Node::Assign(char *rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		m_pNode->set_scalar(rhs);
	}
	
	inline Node& Node::operator=(const Node& rhs)
	{
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
		if(is(rhs))
			return *this;
		AssignNode(rhs);
		return *this;
	}

	inline void Node::AssignData(const Node& rhs)
	{
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		rhs.EnsureNodeExists();
		
		m_pNode->set_data(*rhs.m_pNode);
		m_pMemory->merge(*rhs.m_pMemory);
	}

	inline void Node::AssignNode(const Node& rhs)
	{
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
		rhs.EnsureNodeExists();

		if(!m_pNode) {
			m_pNode = rhs.m_pNode;
			m_pMemory = rhs.m_pMemory;
			return;
		}

		m_pNode->set_ref(*rhs.m_pNode);
		m_pMemory->merge(*rhs.m_pMemory);
		m_pNode = rhs.m_pNode;
	}
    
	// size/iterator
	inline std::size_t Node::size() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? m_pNode->size() : 0;
	}

	inline const_iterator Node::begin() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? const_iterator(m_pNode->begin(), m_pMemory) : const_iterator();
	}
	
	inline iterator Node::begin()
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? iterator(m_pNode->begin(), m_pMemory) : iterator();
	}

	inline const_iterator Node::end() const
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? const_iterator(m_pNode->end(), m_pMemory) : const_iterator();
	}

	inline iterator Node::end()
	{
        if(!m_isValid)
            throw InvalidNode();
		return m_pNode ? iterator(m_pNode->end(), m_pMemory) : iterator();
	}
	
	// sequence
	template<typename T>
	inline void Node::push_back(const T& rhs)
	{
        if(!m_isValid)
            throw InvalidNode();
		push_back(Node(rhs));
	}
	
	inline void Node::push_back(const Node& rhs)
	{
        if(!m_isValid || !rhs.m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		rhs.EnsureNodeExists();
		
		m_pNode->push_back(*rhs.m_pNode, m_pMemory);
		m_pMemory->merge(*rhs.m_pMemory);
	}

    // helpers for indexing
    namespace detail {
        template<typename T>
        struct to_value_t {
            explicit to_value_t(const T& t_): t(t_) {}
            const T& t;
            typedef const T& return_type;
            
            const T& operator()() const { return t; }
        };
        
        template<>
        struct to_value_t<const char*> {
            explicit to_value_t(const char *t_): t(t_) {}
            const char *t;
            typedef std::string return_type;
            
            const std::string operator()() const { return t; }
        };
        
        template<>
        struct to_value_t<char*> {
            explicit to_value_t(char *t_): t(t_) {}
            const char *t;
            typedef std::string return_type;
            
            const std::string operator()() const { return t; }
        };
        
        template<std::size_t N>
        struct to_value_t<char [N]> {
            explicit to_value_t(const char *t_): t(t_) {}
            const char *t;
            typedef std::string return_type;
            
            const std::string operator()() const { return t; }
        };

        // converts C-strings to std::strings so they can be copied
        template<typename T>
        inline typename to_value_t<T>::return_type to_value(const T& t) {
            return to_value_t<T>(t)();
        }
    }

	// indexing
	template<typename Key>
	inline const Node Node::operator[](const Key& key) const
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		detail::node& value = static_cast<const detail::node&>(*m_pNode).get(detail::to_value(key), m_pMemory);
		return Node(value, m_pMemory);
	}
	
	template<typename Key>
	inline Node Node::operator[](const Key& key)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		detail::node& value = m_pNode->get(detail::to_value(key), m_pMemory);
		return Node(value, m_pMemory);
	}
	
	template<typename Key>
	inline bool Node::remove(const Key& key)
	{
        if(!m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		return m_pNode->remove(detail::to_value(key), m_pMemory);
	}
	
	inline const Node Node::operator[](const Node& key) const
	{
        if(!m_isValid || !key.m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		key.EnsureNodeExists();
		detail::node& value = static_cast<const detail::node&>(*m_pNode).get(*key.m_pNode, m_pMemory);
		return Node(value, m_pMemory);
	}
	
	inline Node Node::operator[](const Node& key)
	{
        if(!m_isValid || !key.m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		key.EnsureNodeExists();
		detail::node& value = m_pNode->get(*key.m_pNode, m_pMemory);
		return Node(value, m_pMemory);
	}
	
	inline bool Node::remove(const Node& key)
	{
        if(!m_isValid || !key.m_isValid)
            throw InvalidNode();
		EnsureNodeExists();
		key.EnsureNodeExists();
		return m_pNode->remove(*key.m_pNode, m_pMemory);
	}
    
    // map
    template<typename Key, typename Value>
    inline void Node::force_insert(const Key& key, const Value& value)
    {
        if(!m_isValid)
            throw InvalidNode();
        EnsureNodeExists();
		m_pNode->force_insert(detail::to_value(key), detail::to_value(value), m_pMemory);
    }

	// free functions
	inline bool operator==(const Node& lhs, const Node& rhs)
	{
		return lhs.is(rhs);
	}
}

#endif // NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66