aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/yaml/fyamlcpp/fyamlcpp.h
blob: 45423868466d48fa79fd7c7cc2286b4308c58706 (plain) (blame)
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
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
#pragma once

#include <util/generic/yexception.h>
#include <util/system/compiler.h>
#include <util/system/yassert.h>
#include <util/stream/str.h>
#include <util/generic/hash_set.h>
#include <util/generic/vector.h>

#include <memory>
#include <optional>

#define ENSURE_NODE_NOT_EMPTY(NODE) Y_ENSURE_EX(NODE, TFyamlEx() << "Expected non-empty Node")
#define ENSURE_DOCUMENT_NOT_EMPTY(NODE) Y_ENSURE_EX(NODE, TFyamlEx() << "Expected non-empty Document")

struct fy_parser;
struct fy_node;
struct fy_document;
struct fy_diag;
struct fy_document_iterator;
struct fy_node_pair;
extern "C" struct fy_node *fy_node_buildf(struct fy_document *fyd, const char *fmt, ...);

namespace NFyaml {
    namespace NDetail {
        template <class T>
        class TNodeOps;
    }
    class TNodeRef;
    class TNode;
}

bool operator==(const fy_node* node1, const NFyaml::NDetail::TNodeOps<NFyaml::TNodeRef>& node2);
bool operator==(const fy_node* node1, const NFyaml::NDetail::TNodeOps<NFyaml::TNode>& node2);

namespace NFyaml {

struct TStringPtrHashT {
    size_t operator()(const TSimpleSharedPtr<TString>& str) const {
        return (size_t)str.Get();
    }
};

// do TFyaml(str) instead of TFyaml() << str;
class TFyamlEx : public yexception {
public:
    TFyamlEx() {}

    TFyamlEx(TString error) : Errors_({error}) {}

    TFyamlEx(std::initializer_list<TString> errors) : Errors_(errors) {}

    const TVector<TString>& Errors() {
        return Errors_;
    }

    const char* what() const noexcept override {
        What_ = TString(yexception::what());
        for (auto& err : Errors_) {
            What_.push_back('\n');
            What_.append(err);
        }

        return What_.c_str();
    }

    TFyamlEx& AddError(TString error) {
        Errors_.push_back(error);
        return *this;
    }

    TStringBuf AsStrBuf() const {
        return what();
    }

private:
    TVector<TString> Errors_;
    mutable TString What_;
};

enum class ENodeType {
    Scalar,
    Sequence,
    Mapping,
};

enum class ENodeStyle {
    Any = -1,
    Flow,
    Block,
    Plain,
    SingleQuoted,
    DoubleQuoted,
    Literal,
    Folded,
    Alias,
};

class TNodeRef;
class TDocumentIterator;
class TDocument;
class TNode;
class TMappingIterator;
class TReverseMappingIterator;
class TMapping;
class TSequenceIterator;
class TReverseSequenceIterator;
class TSequence;
class TJsonEmitter;
class TParser;
struct TMark;

namespace NDetail {

class IBasicUserData {
public:
    virtual ~IBasicUserData() = default;
};

template <class T>
class TUserDataHolder : public IBasicUserData {
public:
    TUserDataHolder(IBasicUserData* next, T* data)
        : Next_(next)
        , Data_(data)
    {}

private:
    std::unique_ptr<IBasicUserData> Next_ = nullptr;
    std::unique_ptr<T> Data_ = nullptr;
};

void ThrowAllExceptionsIfAny(fy_diag* diag);

void RethrowError(fy_diag* diag);

void RethrowOnError(bool isError, fy_node* node);

void RethrowOnError(bool isError, fy_node_pair* pair);

void RethrowOnError(bool isError, fy_diag* diag);

void FreeChar(char* mem);

bool IsComplexType(ENodeType type);

class TNodeOpsBase {
protected:
    TString Path(fy_node* node) const;

    ENodeType Type(fy_node* node) const;

    fy_node* Copy(fy_node* node) const;

    fy_node* Copy(fy_node* node, fy_document* to) const;

    bool IsAlias(fy_node* node) const;

    fy_node* ResolveAlias(fy_node* node) const;

    fy_node* CreateReference(fy_node* node) const;

    fy_node* Sequence(fy_node* node) const;

    fy_node* Map(fy_node* node) const;

    TString Scalar(fy_node* node) const;

    TMark BeginMark(fy_node* node) const;

    TMark EndMark(fy_node* node) const;

    void Insert(fy_node* thisNode, fy_node* node);

    std::optional<TString> Tag(fy_node* node) const;

    void SetTag(fy_node* node, const TString& tag);

    bool RemoveTag(fy_node* node);

    bool HasAnchor(fy_node* node) const;

    void SetAnchor(fy_node* node, const TString& anchor);

    bool DeepEqual(fy_node* thisNode, fy_node* other);

    std::unique_ptr<char, void(*)(char*)> EmitToCharArray(fy_node* node) const;

    void SetStyle(fy_node* node, ENodeStyle style);

    ENodeStyle Style(fy_node* node) const;

protected:
    void SetUserData(fy_node* node, NDetail::IBasicUserData* data);

    NDetail::IBasicUserData* UserData(fy_node* node) const;

    void ClearUserData(fy_node* node);
};

template <class T>
class TNodeOps : public TNodeOpsBase {
friend class ::NFyaml::TNodeRef;

public:
    template <class OtherT>
    bool operator==(const TNodeOps<OtherT>& other) const { return Node() == other.Node(); }

    bool operator==(const fy_node* node) const { return Node() == node; }

    friend bool ::operator==(const fy_node* node1, const TNodeOps<NFyaml::TNodeRef>& node2);
    friend bool ::operator==(const fy_node* node1, const TNodeOps<NFyaml::TNode>& node2);

    explicit operator bool() const { return Node() != nullptr; }

    TString Path() const;

    ENodeType Type() const;

    TNode Copy() const;

    TNode Copy(TDocument& to) const;

    bool IsAlias() const;

    TNodeRef ResolveAlias() const;

    TNode CreateReference() const;

    TSequence Sequence() const;

    TMapping Map() const;

    TString Scalar() const;

    TMark BeginMark() const;

    TMark EndMark() const;

    void Insert(const TNodeRef& node);

    bool Empty() const { return Node() == nullptr; }

    std::optional<TString> Tag() const;

    void SetTag(const TString& tag);

    bool RemoveTag();

    bool HasAnchor() const;

    void SetAnchor(const TString& anchor);

    bool DeepEqual(const TNodeRef& other);

    std::unique_ptr<char, void(*)(char*)> EmitToCharArray() const;

    void SetStyle(ENodeStyle style);

    ENodeStyle Style() const;

protected:
    const T& AsDerived() const;

    fy_node* Node() const;

    fy_node* Node();

    void SetUserData(NDetail::IBasicUserData* data);

    NDetail::IBasicUserData* UserData() const;

    void ClearUserData();
};

} // namespace NDetail

class TDocumentIterator {
    friend class TDocument;
public:
    explicit TDocumentIterator(fy_document_iterator* iterator = nullptr);

protected:
    std::unique_ptr<fy_document_iterator, void(*)(fy_document_iterator*)> Iterator_;
};

class TNodeRef : public NDetail::TNodeOps<TNodeRef> {
    friend class TNodeOps<TNodeRef>;
    friend class TNodeOpsBase;
    friend class TDocument;
    friend class TDocumentNodeIterator;
    friend class TMapping;
    friend class TMappingIterator;
    friend class TReverseMappingIterator;
    friend class TNodePairRef;
    friend class TSequence;
    friend class TSequenceIterator;
    friend class TReverseSequenceIterator;
    friend class TJsonEmitter;

public:
    TNodeRef() = default;

    template <class T>
    TNodeRef(const TNodeOps<T>& other) : Node_(other.Node()) {}

    explicit TNodeRef(const TNodeRef& other) : Node_(other.Node_) {}

    TNodeRef(fy_node* node);

    TNodeRef& operator=(const TNodeRef& other) { Node_ = other.Node_; return *this; }

    TNodeRef& operator=(fy_node* node) { Node_ = node; return *this; }

protected:
    fy_node* Node_ = nullptr;

private:
    fy_node* NodeRawPointer() const;
};

class TNode : public NDetail::TNodeOps<TNode> {
    friend class TNodeOps<TNode>;

public:
    TNode(fy_node* node = nullptr);

    template <class T>
    explicit TNode(const TNodeOps<T>& other) : Node_(other.Node_) {}

    TNodeRef Ref() { return TNodeRef(*this); }

private:
    std::shared_ptr<fy_node> Node_;

    TNode& operator=(fy_node* node);

    fy_node* NodeRawPointer() const {
        return Node_.get();
    }
};

class TNodePairRef {
friend class TMappingIterator;
friend class TReverseMappingIterator;
friend class TMapping;

public:
    TNodePairRef(fy_node_pair* pair = nullptr) : Pair_(pair) {}

    bool operator==(const TNodePairRef& other) const { return Pair_ == other.Pair_; }

    explicit operator bool() const { return Pair_ != nullptr; }

    TNodeRef Key() const;

    int Index(const TNodeRef& node) const;

    void SetKey(const TNodeRef& node);

    TNodeRef Value() const;

    void SetValue(const TNodeRef& node);

private:
    fy_node_pair* Pair_ = nullptr;
};

class TMappingIterator {
    friend class TMapping;
public:
    explicit TMappingIterator(const TNodeRef& node, bool end = false);

    TMappingIterator(const TMappingIterator& other) {
        Node_ = other.Node_;
        NodePair_ = other.NodePair_;
    }

    TMappingIterator& operator=(const TMappingIterator& other) {
        Node_ = other.Node_;
        NodePair_ = other.NodePair_;
        return *this;
    }

    TMappingIterator& operator++();

    const TNodePairRef* operator->() const { return &NodePair_; }

    TMappingIterator operator++(int) {
        TMappingIterator retval = *this;
        ++(*this);
        return retval;
    }

    bool operator==(TMappingIterator other) const { return Node_ == other.Node_ && NodePair_ == other.NodePair_; }

    const TNodePairRef& operator*() const { return NodePair_; }

private:
    TNodeRef Node_;
    TNodePairRef NodePair_;
};

class TReverseMappingIterator {
    friend class TMapping;
public:
    explicit TReverseMappingIterator(const TNodeRef& node, bool end = false);

    TReverseMappingIterator(const TReverseMappingIterator& other) {
        Node_ = other.Node_;
        NodePair_ = other.NodePair_;
    }

    TReverseMappingIterator& operator=(const TReverseMappingIterator& other) {
        Node_ = other.Node_;
        NodePair_ = other.NodePair_;
        return *this;
    }

    TReverseMappingIterator& operator++();

    const TNodePairRef* operator->() const { return &NodePair_; }

    TReverseMappingIterator operator++(int) {
        TReverseMappingIterator retval = *this;
        ++(*this);
        return retval;
    }

    bool operator==(TReverseMappingIterator other) const { return Node_ == other.Node_ && NodePair_ == other.NodePair_; }

    bool operator!=(TReverseMappingIterator other) const { return !(*this == other); }

    const TNodePairRef& operator*() const { return NodePair_; }

private:
    TNodeRef Node_;
    TNodePairRef NodePair_;
};

class TMapping : public TNodeRef {
public:
    template <class T>
    explicit TMapping(const TNodeOps<T>& node)
        : TNodeRef(node)
    {
        Y_VERIFY_DEBUG(Type() == ENodeType::Mapping);
    }

    TMappingIterator begin() const {
        return TMappingIterator(*this);
    }

    TMappingIterator end() const {
        return TMappingIterator(*this, true);
    }

    TReverseMappingIterator rbegin() const {
        return TReverseMappingIterator(*this);
    }

    TReverseMappingIterator rend() const {
        return TReverseMappingIterator(*this, true);
    }

    size_t size() const;

    size_t empty() const;

    TNodePairRef at(int index) const;

    TNodePairRef operator[](int index) const;

    TNodeRef at(const TString& index) const;

    TNodePairRef pair_at(const TString& index) const;

    TNodePairRef pair_at_opt(const TString& index) const;

    TNodeRef operator[](const TString& index) const;

    TNodeRef operator[](const char* str) const;

    void Append(const TNodeRef& key, const TNodeRef& value);

    void Prepend(const TNodeRef& key, const TNodeRef& value);

    void Remove(const TNodePairRef& toRemove);

    bool Has(TString key) const;

    TMappingIterator Remove(const TMappingIterator& toRemove);

    void Remove(const TNodeRef& key);
};

class TSequenceIterator {
    friend class TSequence;
public:
    explicit TSequenceIterator(const TNodeRef& node, bool end = false);

    TSequenceIterator(const TSequenceIterator& other) {
        Node_ = other.Node_;
        IterNode_ = other.IterNode_;
        Iter_ = other.Iter_;
    }

    TSequenceIterator& operator=(const TSequenceIterator& other) {
        Node_ = other.Node_;
        IterNode_ = other.IterNode_;
        Iter_ = other.Iter_;
        return *this;
    }

    TSequenceIterator& operator++();

    const TNodeRef* operator->() const {
        return &IterNode_;
    }

    TSequenceIterator operator++(int) {
        TSequenceIterator retval = *this;
        ++(*this);
        return retval;
    }

    bool operator==(TSequenceIterator other) const { return Node_ == other.Node_ && Iter_ == other.Iter_; }

    bool operator!=(TSequenceIterator other) const { return !(*this == other); }

    const TNodeRef& operator*() const { return IterNode_; }

    void InsertBefore(const TNodeRef& node);

    void InsertAfter(const TNodeRef& node);

private:
    TNodeRef Node_;
    TNodeRef IterNode_;
    void* Iter_ = nullptr;
};

class TReverseSequenceIterator {
    friend class TSequence;
public:
    explicit TReverseSequenceIterator(const TNodeRef& node, bool end = false);

    TReverseSequenceIterator(const TReverseSequenceIterator& other) {
        Node_ = other.Node_;
        IterNode_ = other.IterNode_;
        Iter_ = other.Iter_;
    }

    TReverseSequenceIterator& operator=(const TReverseSequenceIterator& other) {
        Node_ = other.Node_;
        IterNode_ = other.IterNode_;
        Iter_ = other.Iter_;
        return *this;
    }

    TReverseSequenceIterator& operator++();

    const TNodeRef* operator->() const {
        return &IterNode_;
    }

    TReverseSequenceIterator operator++(int) {
        TReverseSequenceIterator retval = *this;
        ++(*this);
        return retval;
    }

    bool operator==(TReverseSequenceIterator other) const { return Node_ == other.Node_ && Iter_ == other.Iter_; }

    bool operator!=(TReverseSequenceIterator other) const { return !(*this == other); }

    const TNodeRef& operator*() const { return IterNode_; }

    void InsertBefore(const TNodeRef& node);

    void InsertAfter(const TNodeRef& node);

private:
    TNodeRef Node_;
    TNodeRef IterNode_;
    void* Iter_ = nullptr;
};

class TSequence : public TNodeRef {
public:
    explicit TSequence(const TNodeRef& node)
        : TNodeRef(node)
    {
        Y_VERIFY_DEBUG(Type() == ENodeType::Sequence);
    }

    TSequenceIterator begin() const {
        return TSequenceIterator(*this);
    }

    TSequenceIterator end() const {
        return TSequenceIterator(*this, true);
    }

    TReverseSequenceIterator rbegin() const {
        return TReverseSequenceIterator(*this);
    }

    TReverseSequenceIterator rend() const {
        return TReverseSequenceIterator(*this, true);
    }

    size_t size() const;

    size_t empty() const;

    TNodeRef at(int index) const;

    TNodeRef operator[](int index) const;

    void Append(const TNodeRef& node);

    void Prepend(const TNodeRef& node);

    void InsertBefore(const TNodeRef& mark, const TNodeRef& node);

    void InsertAfter(const TNodeRef& mark, const TNodeRef& node);

    TNode Remove(const TNodeRef& toRemove);

    TSequenceIterator Remove(const TSequenceIterator& toRemove);

    TReverseSequenceIterator Remove(const TReverseSequenceIterator& toRemove);
};

class TDocumentNodeIterator
    : public TDocumentIterator
{
public:
    explicit TDocumentNodeIterator(TNodeRef&& node);

    TDocumentNodeIterator(const TDocumentNodeIterator& other)
        : TDocumentIterator(other.Iterator_.get())
        , Node_(other.Node_)
    {}

    TDocumentNodeIterator& operator=(const TDocumentNodeIterator& other) {
        Iterator_.reset(other.Iterator_.get());
        Node_ = other.Node_;
        return *this;
    }

    TDocumentNodeIterator& operator++();

    TNodeRef* operator->() {
        return &Node_;
    }

    TDocumentNodeIterator operator++(int) {
        TDocumentNodeIterator retval = *this;
        ++(*this);
        return retval;
    }

    bool operator==(TDocumentNodeIterator other) const { return Node_ == other.Node_; }

    bool operator!=(TDocumentNodeIterator other) const { return !(*this == other); }

    TNodeRef& operator*() { return Node_; }

private:
    TNodeRef Node_;
};

class TDocument {
    friend class NDetail::TNodeOps<TNodeRef>;
    friend class NDetail::TNodeOps<TNode>;
    friend class TParser;

    explicit TDocument(TString str, fy_document* doc = nullptr, fy_diag* diag = nullptr);
    explicit TDocument(fy_document* doc = nullptr, fy_diag* diag = nullptr);

public:
    TDocument(TDocument&& other)
        : Document_(std::move(other.Document_))
        , Diag_(std::move(other.Diag_))
    {}

    static TDocument Parse(TString cstr);

    TDocument Clone() const;

    template <class... Args>
    size_t Scanf(const char* fmt, Args&& ...args) {
        Y_VERIFY_DEBUG(Document_);
        return fy_document_scanf(Document_.get(), fmt, std::forward<Args>(args)...);
    }

    void InsertAt(const char* path, const TNodeRef& node);

    template <class... Args>
    TNodeRef Buildf(const char* fmt, Args&& ...args) {
        Y_VERIFY_DEBUG(Document_);
        return fy_node_buildf(Document_.get(), fmt, std::forward<Args>(args)...);
    }

    TNodeRef Buildf(const char* content);

    void Resolve();

    bool HasDirectives();

    bool HasExplicitDocumentStart();

    bool HasExplicitDocumentEnd();

    void SetParent(const TDocument& doc);

    TNodeRef Root();

    void SetRoot(const TNodeRef& node);

    TDocumentNodeIterator begin() {
        auto it = TDocumentNodeIterator(Root());
        ++it;
        return it;
    }

    TDocumentNodeIterator end() {
        return TDocumentNodeIterator(TNodeRef(nullptr));
    }

    TNodeRef CreateAlias(const TString& name);

    std::unique_ptr<char, void(*)(char*)> EmitToCharArray() const;

    TMark BeginMark() const;

    TMark EndMark() const;

private:
    std::unique_ptr<fy_document, void(*)(fy_document*)> Document_;
    std::unique_ptr<fy_diag, void(*)(fy_diag*)> Diag_;

    static void DestroyUserData(fy_node *fyn, void *meta, void *user) {
        Y_UNUSED(fyn);
        Y_UNUSED(user);
        if (meta) {
            auto* data = reinterpret_cast<NDetail::IBasicUserData*>(meta);
            delete data;
        }
    }

    static void DestroyDocumentStrings(fy_document *fyd, void *user) {
        Y_UNUSED(fyd);
        if (user) {
            auto* data = reinterpret_cast<THashSet<TSimpleSharedPtr<TString>, TStringPtrHashT>*>(user);
            delete data;
        }
    }

    bool RegisterUserDataCleanup();
    void UnregisterUserDataCleanup();
};

class TJsonEmitter {
public:
    explicit TJsonEmitter(TDocument& doc) : Node_(doc.Root()) {}
    explicit TJsonEmitter(const TNodeRef& node) : Node_(node) {}

    std::unique_ptr<char, void(*)(char*)> EmitToCharArray() const;

private:
    const TNodeRef Node_;
};

class TParser {
    TParser(TString rawStream, fy_parser* doc, fy_diag* diag);
public:
    static TParser Create(TString str);

    std::optional<TDocument> NextDocument();
private:
    TString RawDocumentStream_;
    std::unique_ptr<fy_parser, void(*)(fy_parser*)> Parser_;
    std::unique_ptr<fy_diag, void(*)(fy_diag*)> Diag_;
};

struct TMark {
    size_t InputPos;
    int Line;
    int Column;
};

namespace NDetail {

template <class T>
TNode TNodeOps<T>::CreateReference() const {
    return TNode(TNodeOpsBase::CreateReference(Node()));
}

template <class T>
TNode TNodeOps<T>::Copy() const {
    return TNode(TNodeOpsBase::Copy(Node()));
}

template <class T>
TNode TNodeOps<T>::Copy(TDocument& to) const {
    return TNode(TNodeOpsBase::Copy(Node(), to.Document_.get()));
}

template <class T>
TString TNodeOps<T>::Path() const {
    return TNodeOpsBase::Path(Node());
}

template <class T>
ENodeType TNodeOps<T>::Type() const {
    return TNodeOpsBase::Type(Node());
}

template <class T>
bool TNodeOps<T>::IsAlias() const {
    return TNodeOpsBase::IsAlias(Node());
}

template <class T>
TNodeRef TNodeOps<T>::ResolveAlias() const {
    return TNodeRef(TNodeOpsBase::ResolveAlias(Node()));
}

template <class T>
TString TNodeOps<T>::Scalar() const {
    return TNodeOpsBase::Scalar(Node());
}

template <class T>
TMark TNodeOps<T>::BeginMark() const {
    return TNodeOpsBase::BeginMark(Node());
}

template <class T>
TMark TNodeOps<T>::EndMark() const {
    return TNodeOpsBase::EndMark(Node());
}

template <class T>
TMapping TNodeOps<T>::Map() const {
    return TMapping(TNodeRef(TNodeOpsBase::Map(Node())));
}

template <class T>
TSequence TNodeOps<T>::Sequence() const {
    return TSequence(TNodeRef(TNodeOpsBase::Sequence(Node())));
}

template <class T>
void TNodeOps<T>::Insert(const TNodeRef& node) {
    return TNodeOpsBase::Insert(Node(), node.Node_);
}

template <class T>
std::optional<TString> TNodeOps<T>::Tag() const {
    return TNodeOpsBase::Tag(Node());
}

template <class T>
void TNodeOps<T>::SetTag(const TString& tag) {
    return TNodeOpsBase::SetTag(Node(), tag);
}

template <class T>
bool TNodeOps<T>::RemoveTag() {
    return TNodeOpsBase::RemoveTag(Node());
}

template <class T>
bool TNodeOps<T>::HasAnchor() const {
    return TNodeOpsBase::HasAnchor(Node());
}

template <class T>
void TNodeOps<T>::SetAnchor(const TString& anchor) {
    return TNodeOpsBase::SetAnchor(Node(), anchor);
}

template <class T>
bool TNodeOps<T>::DeepEqual(const TNodeRef& other) {
    return TNodeOpsBase::DeepEqual(Node(), other.Node_);
}

template <class T>
std::unique_ptr<char, void(*)(char*)> TNodeOps<T>::EmitToCharArray() const {
    return TNodeOpsBase::EmitToCharArray(Node());
}

template <class T>
void TNodeOps<T>::SetStyle(ENodeStyle style) {
    return TNodeOpsBase::SetStyle(Node(), style);
}

template <class T>
ENodeStyle TNodeOps<T>::Style() const {
    return TNodeOpsBase::Style(Node());
}

template <class T>
const T& TNodeOps<T>::AsDerived() const {
    return static_cast<const T&>(*this);
}

template <class T>
fy_node* TNodeOps<T>::Node() const {
    return AsDerived().NodeRawPointer();
}

template <class T>
fy_node* TNodeOps<T>::Node() {
    return AsDerived().NodeRawPointer();
}

template <class T>
void TNodeOps<T>::SetUserData(IBasicUserData* data) {
    return TNodeOpsBase::SetUserData(Node(), data);
}

template <class T>
IBasicUserData* TNodeOps<T>::UserData() const {
    return TNodeOpsBase::UserData(Node());
}

template <class T>
void TNodeOps<T>::ClearUserData() {
    return TNodeOpsBase::ClearUserData(Node());
}

} // namespace NDetail

} // namesapce NFyaml