aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/ipreg/util_helpers.cpp
blob: 1b64baef552dc036486faf540cbddce98b663862 (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
#include "util_helpers.h"

#include <library/cpp/ipreg/reader.h>

#include <library/cpp/json/json_reader.h>
#include <library/cpp/json/json_value.h>
#include <library/cpp/json/json_writer.h>

#include <library/cpp/geobase/lookup.hpp>

#include <util/generic/ptr.h>
#include <util/generic/vector.h>
#include <util/stream/file.h>
#include <util/stream/format.h>
#include <util/string/split.h>
#include <util/string/vector.h>
#include <util/stream/str.h>

namespace NIPREG {
    namespace {
        double FindNearestCoarsedCoeff(double baseValue) {
            using ValueStepPair = std::pair<double, double>;
            static const double fix = 0.01;
            static const TVector<ValueStepPair> limits = {
                { 100.,   20. + fix },
                { 500.,   50. + fix },
                { 2500.,  100. + fix },
                { 10000., 1000. + fix },
                { 50000., 10000. + fix }
            };

            double last_step{};
            for (const auto& pair : limits) {
                last_step = pair.second;
                if (baseValue <= pair.first) {
                    break;
                }
            }
            return last_step;
        }

        double CalcCoarsedValue(double baseValue) {
            if (baseValue < 0.) {
                ythrow yexception() << "negative value detected: " << baseValue;
            }

            // TODO(dieash) some "strange" calculation below
            const auto coarsedCoeff = FindNearestCoarsedCoeff(baseValue);
            const double fixedValue = coarsedCoeff * static_cast<int>((baseValue + coarsedCoeff / 2) / coarsedCoeff);
            return fixedValue;
        }

        const char * const REL_FIELD = "reliability";
        const char * const REG_FIELD = "region_id";

        void CorrectReliability(NJson::TJsonValue& jsonData, const TString& data) {
            jsonData = ParseJsonString(data);
            auto& jsonMap = jsonData.GetMapSafe();

            auto& reliabilityField = jsonMap[REL_FIELD];
            reliabilityField = CalcCoarsedValue(reliabilityField.GetDouble());
        }

        TString SortJson(const TString& data) {
            NJson::TJsonValue json = ParseJsonString(data);
            return SortJsonData(json);
        }

        static TString MergeJsonsData(const TString& data1, const TString& data2, bool sortKeys = false, bool countMerge = false) {
            static const char* MERGE_QTY = "_mrg_qty_";

            auto json1 = ParseJsonString(data1);
            const auto& json2 = ParseJsonString(data2);

            if (countMerge && !json1.Has(MERGE_QTY)) {
                json1.InsertValue(MERGE_QTY, 1);
            }

            for (const auto& item : json2.GetMapSafe()) {
                json1.InsertValue(item.first, item.second);
            }

            if (countMerge) {
                json1.InsertValue(MERGE_QTY, (json1[MERGE_QTY].GetInteger() + 1));
            }

            const auto NoFormat = false;
            return NJson::WriteJson(json1, NoFormat, sortKeys);
        }

        bool IsJsonEquals(const TVector<TString>& excludeFieldsList, const TString& data1, const TString& data2) {
            if (excludeFieldsList.empty()) {
                return data1 == data2;
            }

            auto json1 = ParseJsonString(data1);
            auto json2 = ParseJsonString(data2);

            for (const auto& excludeField : excludeFieldsList) {
                json1.EraseValue(excludeField);
                json2.EraseValue(excludeField);
            }

            return json1 == json2;
        }

        class Patcher {
        public:
            Patcher(TReader& base, TReader& patch, IOutputStream& output, bool sortData)
                : BaseStream(base)
                , PatchStream(patch)
                , Output(output)
                , SortData(sortData)
            {
                GetNext(BaseStream, BaseRangePtr);
                GetNext(PatchStream, PatchRangePtr);
            }

            void Process() {
                while (BaseRangePtr || PatchRangePtr) {
                    if (   CheckPatch()
                        || OnlySecond(BaseRangePtr, PatchRangePtr, PatchStream)
                        || OnlySecond(PatchRangePtr, BaseRangePtr, BaseStream)
                        || Range1BeforeRange2(BaseRangePtr, PatchRangePtr, BaseStream)
                        || Range1BeforeRange2(PatchRangePtr, BaseRangePtr, PatchStream)
                        || FirstEndInSecond(BaseRangePtr, PatchRangePtr)
                        || FirstEndInSecond(PatchRangePtr, BaseRangePtr)
                        || FirstStartInSecond(BaseRangePtr, PatchRangePtr, BaseStream, PatchStream))
                    {
                        continue;
                    }
                }
            }

        private:
            void GetNext(TReader& stream, TAutoPtr<TRange>& rangePtr) {
                if (stream.Next()) {
                    if (rangePtr) {
                        *rangePtr = stream.Get();
                    } else {
                        rangePtr.Reset(new TRange(stream.Get()));
                    }
                }
                else {
                    rangePtr.Reset();
                }
            }

            void Print(const TRange& range) const {
                Output << range;
            }

            void PrintSorted(const TRange& range) const {
                const TRange sortedCopy{range.First, range.Last, SortJson(range.Data)};
                Output << sortedCopy;
            }

            bool CheckPatch() {
                if (PatchRangePtr && PatchRangePtr->First > PatchRangePtr->Last) {
                    GetNext(PatchStream, PatchRangePtr);
                    return true;
                }
                return false;
            }

            bool OnlySecond(TAutoPtr<TRange>& first, TAutoPtr<TRange>& second, TReader& stream) {
                if (!first && second) {
                    Print(*second);
                    GetNext(stream, second);
                    return true;
                }
                return false;
            }

            bool Range1BeforeRange2(TAutoPtr<TRange>& first, TAutoPtr<TRange>& second, TReader& stream) {
                if (first->Last < second->First) {
                    Print(*first);
                    GetNext(stream, first);
                    return true;
                }
                return false;
            }

            bool FirstEndInSecond(TAutoPtr<TRange>& first, TAutoPtr<TRange>& second) {
                if (first->First < second->First) {
                    auto leftBaseRange = *first;
                    leftBaseRange.Last = second->First.Prev();
                    Print(leftBaseRange);

                    first->First = second->First;
                    return true;
                }
                return false;
            }

            bool FirstStartInSecond(TAutoPtr<TRange>& first, TAutoPtr<TRange>& second, TReader& stream1, TReader& stream2) {
                if (first->First >= second->First) {
                    auto leftBaseRange = *first;
                    leftBaseRange.Data = MergeJsonsData(first->Data, second->Data);

                    if (first->Last <= second->Last) {
                        second->First = first->Last.Next();
                        GetNext(stream1, first);
                        if (second->First == TAddress::Highest()) {
                            GetNext(stream2, second);
                        }
                    } else {
                        leftBaseRange.Last = second->Last;
                        first->First = second->Last.Next();
                        GetNext(stream2, second);
                    }

                    SortData ? PrintSorted(leftBaseRange) : Print(leftBaseRange);
                    return true;
                }
                return false;
            }

        private:
            TAutoPtr<TRange> BaseRangePtr;
            TAutoPtr<TRange> PatchRangePtr;

            TReader& BaseStream;
            TReader& PatchStream;
            IOutputStream& Output;
            const bool SortData = false;
        };

        struct IpChecker {
            static void LessOrEqual(const size_t row, const TAddress& lastIp, const TAddress& checkedIp) {
                if (lastIp <= checkedIp) {
                    return;
                }
                GenErr(row, " <= ", lastIp, checkedIp);
            }

            static void Less(const size_t row, const TAddress& lastIp, const TAddress& checkedIp) {
                if (lastIp < checkedIp) {
                    return;
                }
                GenErr(row, " < ", lastIp, checkedIp);
            }

            static void GenErr(const size_t row, const char* msg, const TAddress& lastIp, const TAddress& checkedIp) {
                const TString& errMsg = ">>> row#" + ToString(row) + "; " + lastIp.AsIPv6() + msg + checkedIp.AsIPv6();
                throw std::runtime_error(errMsg.data());
            }
        };

        class MergerBy3 {
        public:
            MergerBy3(const TString& geodataPath, IOutputStream& output)
                : Geobase(geodataPath)
                , Out(output)
            {}

            void Process(TReader& input, bool ByRegsOnly, bool silentMode) {
                while (input.Next()) {
                    Trio.push_back(input.Get());
                    if (3 > Trio.size()) {
                        continue;
                    }

                    auto& range2Data = (++Trio.begin())->Data;
                    if (range2Data.npos != range2Data.find("\"is_placeholder\":1")) {
                        PrintAndDrop1stRange();
                        PrintAndDrop1stRange();
                        continue;
                    }

                    const auto range1RegId = GetRegionId(Trio.begin()->Data);
                    const auto range3RegId = GetRegionId(Trio.rbegin()->Data);
                    if (range1RegId != range3RegId) {
                        PrintAndDrop1stRange();
                        continue;
                    }

                    const auto range2RegId = GetRegionId(range2Data);
                    const auto& parentsIds = Geobase.GetParentsIds(range1RegId);
                    if (parentsIds.end() == std::find(parentsIds.begin() + 1, parentsIds.end(), range2RegId)) {
                        PrintAndDrop1stRange();
                        continue;
                    }

                    if (!ByRegsOnly) {
                        const auto range1Size = Trio.begin()->GetAddrsQty();
                        const auto range2Size = (++Trio.begin())->GetAddrsQty();
                        const auto range3Size = Trio.rbegin()->GetAddrsQty();

                        if (range2Size > (range1Size + range3Size)) {
                            PrintAndDrop1stRange();
                            continue;
                        }
                    }

                    range2Data = SubstRegionId(range2Data, range1RegId);
                    if (!silentMode) {
                        PrintSubstNote(range2RegId, range1RegId);
                    }

                    PrintAndDrop1stRange(); // 1st
                    PrintAndDrop1stRange(); // 2nd
                }

                while (Trio.end() != Trio.begin()) {
                    PrintAndDrop1stRange();
                }
            }
        private:
            void PrintAndDrop1stRange() {
                Out << *Trio.begin();
                Trio.erase(Trio.begin());
            }

            void PrintSubstNote(const int oldId, const int newId) {
                const bool NoData = false;
                Cerr << "s/" << oldId << "/" << newId << "/: [";

                Trio.begin()->DumpTo(Cerr, NoData);
                Cerr << "/" << Trio.begin()->GetAddrsQty() << " | ";

                const auto& range2nd = *(++Trio.begin());
                range2nd.DumpTo(Cerr, NoData);
                Cerr << "/" << range2nd.GetAddrsQty() << " | ";

                Trio.rbegin()->DumpTo(Cerr, NoData);
                Cerr << "/" << Trio.rbegin()->GetAddrsQty() << "]\n";
            }


            static int GetRegionId(const TString& data) {
                const auto& json = ParseJsonString(data);
                auto reg_id = json["region_id"].GetIntegerSafe(0);
                return 99999 == reg_id ? 10000 : reg_id;
            }

            static TString SubstRegionId(const TString& data, const int newId) {
                auto json = ParseJsonString(data);
                json.InsertValue("region_id", newId);
                return SortJsonData(json);
            }

            const NGeobase::TLookup Geobase;
            IOutputStream& Out;
            TList<TRange> Trio;
        };
    } // anon-ns

    void DoCoarsening(IInputStream& input, IOutputStream& output) {
        TString line;
        while (input.ReadLine(line)) {
            TVector<TString> parts;
            StringSplitter(line).Split('\t').AddTo(&parts);

            NJson::TJsonValue jsonData;
            CorrectReliability(jsonData, parts[1]);
            output << parts[0]  << "\t"  << "{\""
                   << REG_FIELD << "\":" << jsonData[REG_FIELD] << ",\""
                   << REL_FIELD << "\":" << Prec(jsonData[REL_FIELD].GetDouble(), PREC_POINT_DIGITS_STRIP_ZEROES, 2)
                   << "}\n";
        }
    }

    void DoMergeEqualsRange(TReader& input, IOutputStream& output) {
        // TODO(dieash@) may be check region for parent/child relation
        // , const TString& geodataPath
        // NGeobase::TLookup geoLookup(geodataPath);

        TVector<TString> rangeDataList;
        TRange lastRange{};

        const char* REG_ID_ATTR = "region_id";
        const char* ORG_NET_ATTR = "orig_net_size";
        const char* HUGE_SIZE_VALUE = "huge";

        const int HUGE_SIZE_COEFF = 100;

        const auto CalcRegionBinding = [&]() {
            if (rangeDataList.empty()) {
                throw std::runtime_error("empty data list");
            }

            if (1 == rangeDataList.size()) {
                return rangeDataList[0];
            }

            size_t maxAmount{};
            NJson::TJsonValue maxData;

            THashMap<NGeobase::TId, size_t> reg2amount;
            for (const auto& data : rangeDataList) {
                const auto& json = ParseJsonString(data);

                const auto id = json[REG_ID_ATTR].GetInteger();
                const auto amount = (json.Has(ORG_NET_ATTR) && HUGE_SIZE_VALUE == json[ORG_NET_ATTR].GetString()) ? HUGE_SIZE_COEFF : FromString<int>(json[ORG_NET_ATTR].GetString());
                reg2amount[id] += amount;

                if (reg2amount[id] > maxAmount) {
                    maxData = json;
                }
            }

            maxData.EraseValue(ORG_NET_ATTR);
            return SortJsonData(maxData);
        };

        const auto PrintRow = [&]() {
            if (rangeDataList.empty()) {
                return;
            }
            lastRange.Data = CalcRegionBinding();
            output << lastRange;
        };

        while (input.Next()) {
            auto currRange = input.Get();
            if (currRange != lastRange) {
                PrintRow();

                lastRange = currRange;
                rangeDataList = {};
            }

            rangeDataList.push_back(currRange.Data);
        }
        PrintRow();
    }

    void DoMerging(TReader& input, IOutputStream& output, const MergeTraits& traits) {
        if (!input.Next()) {
            return; // empty file here
        }

        const bool IsJsonData = traits.ConcatSep.empty();

        TRange joinedRange = input.Get();
        if (traits.SortData) {
            joinedRange.Data = SortJson(joinedRange.Data);
        }

        while (input.Next()) {
            auto currRange = input.Get();
            if (traits.SortData) {
                currRange.Data = SortJson(currRange.Data);
            }

            if (currRange.Contains(joinedRange) && joinedRange.Data == currRange.Data) {
                joinedRange = currRange;
                continue;
            }

            if (traits.JoinNestedRanges && joinedRange.Contains(currRange) && joinedRange.Data == currRange.Data) {
                continue;
            }

            if (   currRange.First != joinedRange.Last.Next()
                || ( IsJsonData && !IsJsonEquals(traits.ExcludeFieldsList, currRange.Data, joinedRange.Data))
                || (!IsJsonData && currRange.Data != joinedRange.Data))
            {
                output << joinedRange;
                joinedRange = currRange;
            } else {
                if (IsJsonData) {
                    joinedRange.Data = MergeJsonsData(currRange.Data, joinedRange.Data, traits.SortData, traits.CountMerges);
                } else {
                    joinedRange.Data = (joinedRange.Data == currRange.Data) ? joinedRange.Data : (joinedRange.Data + traits.ConcatSep + currRange.Data);
                }
                joinedRange.Last = currRange.Last;
            }
        }

        output << joinedRange;
    }

    void DoMerging3(TReader& input, IOutputStream& output, const TString& geodata, bool ByRegsOnly, bool silentMode) {
        MergerBy3 merger(geodata, output);
        merger.Process(input, ByRegsOnly, silentMode);
    }

    void DoPatching(TReader& base, TReader& patch, IOutputStream& output, bool sortData) {
        Patcher(base, patch, output, sortData).Process();
    }

    const TString STUB_DATA{"{\"is_placeholder\":1,\"region_id\":10000,\"reliability\":0}"};

    void AddStubRanges(TReader& input, IOutputStream& output) {
        TRange stub{
            TAddress::Lowest(),
            TAddress::Lowest(),
            STUB_DATA
        };

        while (input.Next()) {
            const auto& currRange = input.Get();

            if (stub.First > currRange.First) {
                const TString& errMsg = ">>> bad ranges ($stub.begin > $next.begin) // " + stub.First.AsShortIPv6() + " | " + currRange.First.AsShortIPv6();
                throw std::runtime_error(errMsg.data());
            }

            if (stub.First < currRange.First) {
                stub.Last = currRange.First.Prev();
                output << stub;
            }

            output << currRange;
            stub.First = currRange.Last.Next();
        }

        if (stub.First != TAddress::Highest()) {
            stub.Last  = TAddress::Highest();
            output << stub;
        }
    }

    void CheckAddressSpaceForCompleteness(IInputStream& input, IOutputStream& output) {
        TAddress lastIp = TAddress::Lowest();
        size_t row_number = 0;

        TString line;
        while (input.ReadLine(line)) {
            ++row_number;
            output << line << "\n";

            const auto& currRange = TRange::BuildRange(line);
            if (row_number == 1) {
                if (currRange.First != TAddress::Lowest()) {
                     const TString err_msg = "bad first addr (ip / wanted_ip) => " + currRange.First.AsIPv6() + " / " + TAddress::Lowest().AsIPv6();
                     throw std::runtime_error(err_msg);
                }
                lastIp = currRange.Last;
                continue;
            }

            if (lastIp == currRange.First || lastIp.Next() != currRange.First) {
                const TString err_msg = ">>> row#" + ToString(row_number) + " bad pair (last_ip / next_ip) => " + lastIp.AsIPv6() + " / " + currRange.First.AsIPv6();
                throw std::runtime_error(err_msg);
            }

            lastIp = currRange.Last;
        }

        if (lastIp != TAddress::Highest()) {
            const TString err_msg = "bad last addr (last_ip / wanted_ip) => " + lastIp.AsIPv6() + " / " + TAddress::Highest().AsIPv6();
            throw std::runtime_error(err_msg);
        }
    }

    void CheckRangesForMonotonicSequence(IInputStream& input, IOutputStream& output, bool IsStrict) {
        TAddress lastIp = TAddress::Lowest();

        size_t row = 0;
        TString line;
        while (input.ReadLine(line)) {
            ++row;
            output << line << "\n";

            const auto& currRange = TRange::BuildRange(line);
            if (row == 1) {
                lastIp = currRange.Last;
                continue;
            }

            if (IsStrict) {
                IpChecker::Less(row, lastIp, currRange.First);
            } else {
                IpChecker::LessOrEqual(row, lastIp, currRange.First);
            }
            lastIp = currRange.Last;
        }
    }

    NJson::TJsonValue ParseJsonString(const TString& data) {
        const auto throwIfError = true;

        NJson::TJsonValue json;
        NJson::ReadJsonFastTree(data, &json, throwIfError);
        return json;
    }

    TString SortJsonData(const NJson::TJsonValue& json) {
        const auto NoFormat = false;
        const auto SortKeys = true;

        return NJson::WriteJson(json, NoFormat, SortKeys);
    }

    TString SortJsonData(const TString& jsonStr) {
        return SortJsonData(ParseJsonString(jsonStr));
    }

    TString AddJsonAttrs(const TVector<TString>& addFieldsList, const TString& jsonStr, const TMaybe<TString>& attrValue) {
        if (addFieldsList.empty()) {
            return jsonStr;
        }

        auto json = ParseJsonString(jsonStr);
        for (const auto& newField : addFieldsList) {
            if (!newField.empty()) {
                if (attrValue) {
                    json.InsertValue(newField, *attrValue);
                } else {
                    json.InsertValue(newField, 1);
                }
            }
        }
        return json.GetStringRobust();
    }

    TString ExcludeJsonAttrs(const TVector<TString>& excludeFieldsList, const TString& jsonStr) {
        if (excludeFieldsList.empty()) {
            return jsonStr;
        }

        auto json = ParseJsonString(jsonStr);
        for (const auto& excludeField : excludeFieldsList) {
            if (!excludeField.empty()) {
                json.EraseValue(excludeField);
            }
        }
        return json.GetStringRobust();
    }

    TString ExtractJsonAttrs(const TVector<TString>& extractFieldsList, const TString& jsonStr) {
        if (extractFieldsList.empty()) {
            return jsonStr;
        }

        auto json = ParseJsonString(jsonStr);
        NJson::TJsonValue newJson;
        for (const auto& field : extractFieldsList) {
            if (json.Has(field)) {
                newJson.InsertValue(field, json[field]);
            }
        }
        if (!newJson.IsDefined()) {
            return {};
        }
        return newJson.GetStringRobust();
    }

    namespace CliParamsDesc {
        const TString InputFnameParam  = "input-data";
        const TString OutputFnameParam = "output-data";
        const TString OutputFullIpParam = "show-full-ip";
        const TString PrintStatsParam = "print-stats";
        const TString PrintYtStatsParam = "yt-stats";

        const TString InputFnameParamDesc  = "path to input IPREG-data; leave empty or use '-' for stdin";
        const TString OutputFnameParamDesc = "path to file for output results; leave empty for stdout";
        const TString OutputFullIpParamDesc = "print full ipv6 (by default - short)";
        const TString PrintStatsParamDesc = "print internal statistics; @stderr";
        const TString PrintYtStatsParamDesc = "print YT-stats (by default, file-descriptor 5)";
    }  // ns CliParamsDesc

    DefaultCliParams::DefaultCliParams() {
        using namespace CliParamsDesc;

        Opts.SetFreeArgsMax(0);
        Opts.AddHelpOption('h');

        Opts.AddLongOption('i', InputFnameParam)
            .RequiredArgument("filename")
            .DefaultValue(InputFname)
            .StoreResult(&InputFname).Help(InputFnameParamDesc);

        Opts.AddLongOption('o', OutputFnameParam)
            .RequiredArgument("filename")
            .DefaultValue(OutputFname)
            .StoreResult(&OutputFname).Help(OutputFnameParamDesc);

        Opts.AddLongOption('f', OutputFullIpParam)
            .Optional()
            .NoArgument()
            .DefaultValue("0")
            .OptionalValue("1")
            .StoreResult(&OutputFullIp).Help(OutputFullIpParamDesc);

        Opts.AddLongOption(PrintStatsParam)
            .Optional()
            .NoArgument()
            .DefaultValue("0")
            .OptionalValue("1")
            .StoreResult(&PrintStats).Help(PrintStatsParamDesc);

        Opts.AddLongOption(PrintYtStatsParam)
            .Optional()
            .NoArgument()
            .DefaultValue("0")
            .OptionalValue("1")
            .StoreResult(&PrintYtStats).Help(PrintYtStatsParamDesc);
    }

    void DefaultCliParams::ApplyFlags() const {
        if (OutputFullIp) {
            SetIpFullOutFormat();
        }
    }

    void DefaultCliParams::Parse(int argc, const char **argv) {
        NLastGetopt::TOptsParseResult optRes(&GetOpts(), argc, argv);
        ApplyFlags();
    }

} // NIPREG