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
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
|
/* Copyright (c) 2016 Taylor C. Richberger <taywee@gmx.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#include <algorithm>
#include <exception>
#include <functional>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
#include <unordered_set>
namespace args
{
/** (INTERNAL) Count UTF-8 glyphs
*
* This is not reliable, and will fail for combinatory glyphs, but it's
* good enough here for now.
*
* \param string The string to count glyphs from
* \return The UTF-8 glyphs in the string
*/
std::string::size_type Glyphs(const std::string &string)
{
std::string::size_type length = 0;
for (const char c: string)
{
if ((c & 0xc0) != 0x80)
{
++length;
}
}
return length;
}
/** (INTERNAL) Wrap a string into a vector of lines
*
* This is quick and hacky, but works well enough. You can specify a
* different width for the first line
*
* \param width The width of the body
* \param the widtho f the first line, defaults to the width of the body
* \return the vector of lines
*/
std::vector<std::string> Wrap(const std::string &in, const std::string::size_type width, std::string::size_type firstlinewidth = 0)
{
// Preserve existing line breaks
const std::string::size_type newlineloc = in.find('\n');
if (newlineloc != in.npos)
{
std::vector<std::string> first(Wrap(std::string(in, 0, newlineloc), width));
std::vector<std::string> second(Wrap(std::string(in, newlineloc + 1), width));
first.insert(
std::end(first),
std::make_move_iterator(std::begin(second)),
std::make_move_iterator(std::end(second)));
return first;
}
if (firstlinewidth == 0)
{
firstlinewidth = width;
}
std::string::size_type currentwidth = firstlinewidth;
std::istringstream stream(in);
std::vector<std::string> output;
std::ostringstream line;
std::string::size_type linesize = 0;
while (stream)
{
std::string item;
stream >> item;
std::string::size_type itemsize = Glyphs(item);
if ((linesize + 1 + itemsize) > currentwidth)
{
if (linesize > 0)
{
output.push_back(line.str());
line.str(std::string());
linesize = 0;
currentwidth = width;
}
}
if (linesize)
{
++linesize;
line << " ";
}
line << item;
linesize += itemsize;
}
if (linesize > 0)
{
output.push_back(line.str());
}
return output;
}
/** Errors that occur during regular parsing
*/
class ParseError : public std::runtime_error
{
public:
ParseError(const char *problem) : std::runtime_error(problem) {}
virtual ~ParseError() {};
};
/** Errors that are detected from group validation after parsing finishes
*/
class ValidationError : public std::runtime_error
{
public:
ValidationError(const char *problem) : std::runtime_error(problem) {}
virtual ~ValidationError() {};
};
/** An exception that indicates that the user has requested help
*/
class Help : public std::exception
{
private:
const std::string flag;
public:
Help(const std::string &flag) : flag(flag) {}
virtual ~Help() {};
virtual const char *what() const noexcept override
{
return flag.c_str();
}
};
/** A class of "matchers", specifying short and long options that can possibly be matched
*
* This is supposed to be constructed and then passed in, not used directly from user code.
*/
class Matcher
{
private:
const std::unordered_set<char> shortOpts;
const std::unordered_set<std::string> longOpts;
public:
/** Specify short and long opts separately as iterators
*/
template <typename ShortIt, typename LongIt>
Matcher(ShortIt shortOptsStart, ShortIt shortOptsEnd, LongIt longOptsStart, LongIt longOptsEnd) :
shortOpts(shortOptsStart, shortOptsEnd),
longOpts(longOptsStart, longOptsEnd)
{}
/** Specify short and long opts separately as iterables
*/
template <typename Short, typename Long>
Matcher(Short &&shortIn, Long &&longIn) :
shortOpts(std::begin(shortIn), std::end(shortIn)), longOpts(std::begin(longIn), std::end(longIn))
{}
/** Specify short and long opts as initializer lists
*/
Matcher(const std::initializer_list<char> &shortIn, const std::initializer_list<std::string> &longIn) :
shortOpts(std::begin(shortIn), std::end(shortIn)), longOpts(std::begin(longIn), std::end(longIn))
{}
/** Specify short opts only as initializer lists
*/
Matcher(const std::initializer_list<char> &shortIn) :
shortOpts(std::begin(shortIn), std::end(shortIn))
{}
/** Specify long opts only as initializer lists
*/
Matcher(const std::initializer_list<std::string> &longIn) :
longOpts(std::begin(longIn), std::end(longIn))
{}
Matcher(Matcher &&other) : shortOpts(std::move(other.shortOpts)), longOpts(std::move(other.longOpts))
{}
~Matcher() {}
/** (INTERNAL) Check if there is a match of a short opt
*/
bool Match(const char opt) const
{
return shortOpts.find(opt) != shortOpts.end();
}
/** (INTERNAL) Check if there is a match of a long opt
*/
bool Match(const std::string &opt) const
{
return longOpts.find(opt) != longOpts.end();
}
/** (INTERNAL) Get all option strings as a vector, with the prefixes embedded
*/
std::vector<std::string> GetOptionStrings(const std::string &shortPrefix, const std::string &longPrefix) const
{
std::vector<std::string> optStrings;
optStrings.reserve(shortOpts.size() + longOpts.size());
for (const char opt: shortOpts)
{
optStrings.emplace_back(shortPrefix + std::string(1, opt));
}
for (const std::string &opt: longOpts)
{
optStrings.emplace_back(longPrefix + opt);
}
return optStrings;
}
};
/** Base class for all match types
*/
class Base
{
protected:
bool matched;
const std::string help;
public:
Base(const std::string &help) : matched(false), help(help) {}
virtual ~Base() {}
virtual bool Matched() const noexcept
{
return matched;
}
operator bool() const noexcept
{
return Matched();
}
virtual std::tuple<std::string, std::string> GetDescription(const std::string &shortPrefix, const std::string &longPrefix) const
{
std::tuple<std::string, std::string> description;
std::get<1>(description) = help;
return description;
}
virtual void ResetMatched()
{
matched = false;
}
};
/** Base class for all match types that have a name
*/
class NamedBase : public Base
{
protected:
const std::string name;
public:
NamedBase(const std::string &name, const std::string &help) : Base(help), name(name) {}
virtual ~NamedBase() {}
virtual std::tuple<std::string, std::string> GetDescription(const std::string &shortPrefix, const std::string &longPrefix) const override
{
std::tuple<std::string, std::string> description;
std::get<0>(description) = name;
std::get<1>(description) = help;
return description;
}
virtual std::string Name() const
{
return name;
}
};
/** Base class for all flag arguments
*/
class FlagBase : public NamedBase
{
protected:
const Matcher matcher;
public:
FlagBase(const std::string &name, const std::string &help, Matcher &&matcher) : NamedBase(name, help), matcher(std::move(matcher)) {}
virtual ~FlagBase() {}
virtual FlagBase *Match(const std::string &arg)
{
if (matcher.Match(arg))
{
matched = true;
return this;
}
return nullptr;
}
virtual FlagBase *Match(const char arg)
{
if (matcher.Match(arg))
{
matched = true;
return this;
}
return nullptr;
}
virtual std::tuple<std::string, std::string> GetDescription(const std::string &shortPrefix, const std::string &longPrefix) const override
{
std::tuple<std::string, std::string> description;
const std::vector<std::string> optStrings(matcher.GetOptionStrings(shortPrefix, longPrefix));
std::ostringstream flagstream;
for (auto it = std::begin(optStrings); it != std::end(optStrings); ++it)
{
if (it != std::begin(optStrings))
{
flagstream << ", ";
}
flagstream << *it;
}
std::get<0>(description) = flagstream.str();
std::get<1>(description) = help;
return description;
}
};
/** Base class for argument-accepting flag arguments
*/
class ArgFlagBase : public FlagBase
{
public:
ArgFlagBase(const std::string &name, const std::string &help, Matcher &&matcher) : FlagBase(name, help, std::move(matcher)) {}
virtual ~ArgFlagBase() {}
virtual void ParseArg(const std::string &value) = 0;
virtual std::tuple<std::string, std::string> GetDescription(const std::string &shortPrefix, const std::string &longPrefix) const override
{
std::tuple<std::string, std::string> description;
const std::vector<std::string> optStrings(matcher.GetOptionStrings(shortPrefix, longPrefix));
std::ostringstream flagstream;
for (auto it = std::begin(optStrings); it != std::end(optStrings); ++it)
{
if (it != std::begin(optStrings))
{
flagstream << ", ";
}
flagstream << *it << ' ' << name;
}
std::get<0>(description) = flagstream.str();
std::get<1>(description) = help;
return description;
}
};
/** Base class for positional arguments
*/
class PosBase : public NamedBase
{
protected:
bool ready;
public:
PosBase(const std::string &name, const std::string &help) : NamedBase(name, help), ready(true) {}
virtual ~PosBase() {}
bool Ready()
{
return ready;
}
virtual void ParseArg(const std::string &value) = 0;
};
/** Class for all kinds of validating groups, including ArgumentParser
*/
class Group : public Base
{
private:
std::vector<Base*> children;
std::function<bool(const Group &)> validator;
public:
Group(const std::string &help, const std::function<bool(const Group &)> &validator = Validators::DontCare) : Base(help), validator(validator) {}
Group(Group &group, const std::string &help, const std::function<bool(const Group &)> &validator = Validators::DontCare) : Base(help), validator(validator)
{
group.Add(*this);
}
virtual ~Group() {}
/** Return the first FlagBase that matches arg, or nullptr
*
* \param arg The argument with prefixes stripped
* \return the first matching FlagBase pointer, or nullptr if there is no match
*/
FlagBase *Match(const std::string &arg)
{
for (Base *child: children)
{
FlagBase *flag = dynamic_cast<FlagBase *>(child);
Group *group = dynamic_cast<Group *>(child);
if (flag)
{
FlagBase *match = flag->Match(arg);
if (match)
{
return match;
}
} else if (group)
{
FlagBase *match = group->Match(arg);
if (match)
{
return match;
}
}
}
return nullptr;
}
/** Return the first FlagBase that matches arg, or nullptr
*
* \param arg The argument with prefixes stripped
* \return the first matching FlagBase pointer, or nullptr if there is no match
*/
FlagBase *Match(const char arg)
{
for (Base *child: children)
{
FlagBase *flag = dynamic_cast<FlagBase *>(child);
Group *group = dynamic_cast<Group *>(child);
if (flag)
{
FlagBase *match = flag->Match(arg);
if (match)
{
return match;
}
} else if (group)
{
FlagBase *match = group->Match(arg);
if (match)
{
return match;
}
}
}
return nullptr;
}
/** Get the next ready positional parameter, or nullptr if there is none
*
* \return the first ready PosBase pointer, or nullptr if there is no match
*/
PosBase *GetNextPos()
{
for (Base *child: children)
{
PosBase *next = dynamic_cast<PosBase *>(child);
Group *group = dynamic_cast<Group *>(child);
if (group)
{
next = group->GetNextPos();
}
if (next and next->Ready())
{
return next;
}
}
return nullptr;
}
/** Get whether this has any FlagBase children
*
* \return Whether or not there are any FlagBase children
*/
bool HasFlag() const
{
for (Base *child: children)
{
FlagBase *flag = dynamic_cast<FlagBase *>(child);
Group *group = dynamic_cast<Group *>(child);
if (flag)
{
return true;
}
if (group)
{
if (group->HasFlag())
{
return true;
}
}
}
return false;
}
/** Append a child to this Group.
*/
void Add(Base &child)
{
children.emplace_back(&child);
}
/** Get all this group's children
*/
const std::vector<Base *> Children() const
{
return children;
}
/** Count the number of matched children this group has
*/
std::vector<Base *>::size_type MatchedChildren() const
{
std::vector<Base *>::size_type sum = 0;
for (const Base * child: children)
{
if (child->Matched())
{
++sum;
}
}
return sum;
}
/** Whether or not this group matches validation
*/
virtual bool Matched() const noexcept override
{
return validator(*this);
}
/** Get all the child descriptions for help generation
*/
std::vector<std::tuple<std::string, std::string>> GetChildDescriptions(const std::string &shortPrefix, const std::string &longPrefix) const
{
std::vector<std::tuple<std::string, std::string>> descriptions;
for (const auto &child: children)
{
const Group *group = dynamic_cast<Group *>(child);
const NamedBase *named = dynamic_cast<NamedBase *>(child);
if (group)
{
std::vector<std::tuple<std::string, std::string>> groupDescriptions(group->GetChildDescriptions(shortPrefix, longPrefix));
descriptions.insert(
std::end(descriptions),
std::make_move_iterator(std::begin(groupDescriptions)),
std::make_move_iterator(std::end(groupDescriptions)));
} else if (named)
{
descriptions.emplace_back(named->GetDescription(shortPrefix, longPrefix));
}
}
return descriptions;
}
/** Get the names of positional parameters
*/
std::vector<std::string> GetPosNames() const
{
std::vector <std::string> names;
for (const auto &child: children)
{
const Group *group = dynamic_cast<Group *>(child);
const PosBase *pos = dynamic_cast<PosBase *>(child);
if (group)
{
std::vector<std::string> groupNames(group->GetPosNames());
names.insert(
std::end(names),
std::make_move_iterator(std::begin(groupNames)),
std::make_move_iterator(std::end(groupNames)));
} else if (pos)
{
names.emplace_back(pos->Name());
}
}
return names;
}
virtual void ResetMatched() override
{
for (auto &child: children)
{
child->ResetMatched();
}
}
/** Default validators
*/
struct Validators
{
static bool Xor(const Group &group)
{
return group.MatchedChildren() == 1;
}
static bool AtLeastOne(const Group &group)
{
return group.MatchedChildren() >= 1;
}
static bool AtMostOne(const Group &group)
{
return group.MatchedChildren() <= 1;
}
static bool All(const Group &group)
{
return group.Children().size() == group.MatchedChildren();
}
static bool AllOrNone(const Group &group)
{
return (All(group) || None(group));
}
static bool AllChildGroups(const Group &group)
{
for (const auto child: group.Children())
{
const Group *group = dynamic_cast<Group *>(child);
if (group && (!group->Matched()))
{
return false;
}
}
return true;
}
static bool DontCare(const Group &group)
{
return true;
}
static bool CareTooMuch(const Group &group)
{
return false;
}
static bool None(const Group &group)
{
return group.MatchedChildren() == 0;
}
};
};
/** The main user facing command line argument parser class
*/
class ArgumentParser : public Group
{
private:
std::string prog;
std::string description;
std::string epilog;
std::string longprefix;
std::string shortprefix;
std::string longseparator;
std::string terminator;
public:
struct HelpParams
{
/** The width of the help menu
*/
unsigned int width = 80;
/** The indent of the program line
*/
unsigned int progindent = 2;
/** The indent of the program trailing lines for long parameters
*/
unsigned int progtailindent = 4;
/** The indent of the description and epilogs
*/
unsigned int descriptionindent = 4;
/** The indent of the flags
*/
unsigned int flagindent = 6;
/** The indent of the flag descriptions
*/
unsigned int helpindent = 25;
/** The additional indent each group adds
*/
unsigned int eachgroupindent = 2;
/** The minimum gutter between each flag and its help
*/
unsigned int gutter = 1;
} helpParams;
ArgumentParser(const std::string &description, const std::string &epilog = std::string()) :
Group("arguments", Group::Validators::AllChildGroups),
description(description),
epilog(epilog),
longprefix("--"),
shortprefix("-"),
longseparator("="),
terminator("--") {}
/** The program name for help generation
*/
const std::string &Prog() const
{ return prog; }
/** The program name for help generation
*/
void Prog(const std::string &prog)
{ this->prog = prog; }
/** The description that appears above options
*/
const std::string &Description() const
{ return description; }
/** The description that appears above options
*/
void Description(const std::string &description)
{ this->description = description; }
/** The description that appears below options
*/
const std::string &Epilog() const
{ return epilog; }
/** The description that appears below options
*/
void Epilog(const std::string &epilog)
{ this->epilog = epilog; }
/** The prefix for long options
*/
const std::string &LongPrefix() const
{ return longprefix; }
/** The prefix for long options
*/
void LongPrefix(const std::string &longprefix)
{ this->longprefix = longprefix; }
/** The prefix for short options
*/
const std::string &ShortPrefix() const
{ return shortprefix; }
/** The prefix for short options
*/
void ShortPrefix(const std::string &shortprefix)
{ this->shortprefix = shortprefix; }
/** The separator for long options
*/
const std::string &LongSeparator() const
{ return longseparator; }
/** The separator for long options
*/
void LongSeparator(const std::string &longseparator)
{
this->longseparator = longseparator;
}
/** The terminator that separates short options from long ones
*/
const std::string &Terminator() const
{ return terminator; }
/** The terminator that separates short options from long ones
*/
void Terminator(const std::string &terminator)
{ this->terminator = terminator; }
/** Pass the help menu into an ostream
*/
void Help(std::ostream &help) const
{
bool hasoptions = false;
bool hasarguments = false;
const std::vector<std::string> description(Wrap(this->description, helpParams.width - helpParams.descriptionindent));
const std::vector<std::string> epilog(Wrap(this->epilog, helpParams.width - helpParams.descriptionindent));
std::ostringstream prognameline;
prognameline << prog;
if (HasFlag())
{
hasoptions = true;
prognameline << " {OPTIONS}";
}
for (const std::string &posname: GetPosNames())
{
hasarguments = true;
prognameline << " [" << posname << ']';
}
const std::vector<std::string> proglines(Wrap(prognameline.str(), helpParams.width - (helpParams.progindent + 4), helpParams.width - helpParams.progindent));
auto progit = std::begin(proglines);
if (progit != std::end(proglines))
{
help << std::string(helpParams.progindent, ' ') << *progit << '\n';
++progit;
}
for (; progit != std::end(proglines); ++progit)
{
help << std::string(helpParams.progtailindent, ' ') << *progit << '\n';
}
help << '\n';
for (const std::string &line: description)
{
help << std::string(helpParams.descriptionindent, ' ') << line << "\n";
}
help << "\n";
help << std::string(helpParams.progindent, ' ') << "OPTIONS:\n\n";
for (const auto &description: GetChildDescriptions(shortprefix, longprefix))
{
const std::string &flags = std::get<0>(description);
const std::vector<std::string> info(Wrap(std::get<1>(description), helpParams.width - helpParams.helpindent));
help << std::string(helpParams.flagindent, ' ') << flags;
auto infoit = std::begin(info);
const std::string::size_type flagssize = Glyphs(flags);
if ((helpParams.flagindent + flagssize + helpParams.gutter) > helpParams.helpindent)
{
help << '\n';
} else if (infoit != std::end(info))
{
help << std::string(helpParams.helpindent - (helpParams.flagindent + flagssize), ' ') << *infoit << '\n';
++infoit;
}
for (; infoit != std::end(info); ++infoit)
{
help << std::string(helpParams.helpindent, ' ') << *infoit << '\n';
}
}
if (hasoptions && hasarguments)
{
for (const std::string &item: Wrap(std::string("\"") + terminator + "\" can be used to terminate flag options and force all following arguments to be treated as positional options", helpParams.width - helpParams.flagindent))
{
help << std::string(helpParams.flagindent, ' ') << item << '\n';
}
}
help << "\n";
for (const std::string &line: epilog)
{
help << std::string(helpParams.descriptionindent, ' ') << line << "\n";
}
}
/** Generate a help menu as a string.
*
* \return the help text as a single string
*/
std::string Help() const
{
std::ostringstream help;
Help(help);
return help.str();
}
/** Parse all arguments.
*
* \param args an iterable of the arguments
*/
template <typename T>
void ParseArgs(const T &args)
{
// Reset all Matched statuses to false, for validation. Don't reset values.
ResetMatched();
bool terminated = false;
// Check all arg chunks
for (auto it = std::begin(args); it != std::end(args); ++it)
{
const std::string &chunk = *it;
if (!terminated and chunk == terminator)
{
terminated = true;
// If a long arg was found
} else if (!terminated && chunk.find(longprefix) == 0 && chunk.size() > longprefix.size())
{
const std::string argchunk(chunk.substr(longprefix.size()));
// Try to separate it, in case of a separator:
const auto separator = longseparator.empty() ? argchunk.npos : argchunk.find(longseparator);
const std::string arg = (separator != argchunk.npos ?
std::string(argchunk, 0, separator)
: argchunk);
FlagBase *base = Match(arg);
if (base)
{
ArgFlagBase *argbase = dynamic_cast<ArgFlagBase *>(base);
if (argbase)
{
if (separator != argchunk.npos)
{
argbase->ParseArg(argchunk.substr(separator + longseparator.size()));
} else
{
++it;
if (it == std::end(args))
{
std::ostringstream problem;
problem << "Argument " << arg << " requires an argument but received none";
throw ParseError(problem.str().c_str());
} else
{
argbase->ParseArg(*it);
}
}
} else if (separator != argchunk.npos)
{
std::ostringstream problem;
problem << "Passed an argument into a non-argument flag: " << chunk;
throw ParseError(problem.str().c_str());
}
} else
{
std::ostringstream problem;
problem << "Argument could not be matched: " << arg;
throw ParseError(problem.str().c_str());
}
// Check short args
} else if (!terminated && chunk.find(shortprefix) == 0 && chunk.size() > shortprefix.size())
{
std::string argchunk(chunk.substr(shortprefix.size()));
for (auto argit = std::begin(argchunk); argit != std::end(argchunk); ++argit)
{
const char arg = *argit;
Base *base = Match(arg);
if (base)
{
ArgFlagBase *argbase = dynamic_cast<ArgFlagBase *>(base);
if (argbase)
{
argchunk.erase(std::begin(argchunk), ++argit);
if (!argchunk.empty())
{
argbase->ParseArg(argchunk);
} else
{
++it;
if (it == std::end(args))
{
std::ostringstream problem;
problem << "Flag '" << arg << "' requires an argument but received none";
throw ParseError(problem.str().c_str());
} else
{
argbase->ParseArg(*it);
}
}
// Because this argchunk is done regardless
break;
}
} else
{
std::ostringstream problem;
problem << "Argument could not be matched: '" << arg << "'";
throw ParseError(problem.str().c_str());
}
}
} else
{
PosBase *pos = GetNextPos();
if (pos)
{
pos->ParseArg(chunk);
} else
{
std::ostringstream problem;
problem << "Passed in argument, but no positional arguments were ready to receive it" << chunk;
throw ParseError(problem.str().c_str());
}
}
}
if (!Matched())
{
std::ostringstream problem;
problem << "Group validation failed somewhere!";
throw ValidationError(problem.str().c_str());
}
}
/** Convenience function to parse the CLI from argc and argv
*
* Just assigns the program name and vectorizes arguments for passing into ParseArgs()
*/
void ParseCLI(const int argc, const char * const * const argv)
{
if (prog.empty())
{
prog.assign(argv[0]);
}
std::vector<std::string> args;
for (int i = 1; i < argc; ++i)
{
args.emplace_back(argv[i]);
}
ParseArgs(args);
}
};
std::ostream &operator<<(std::ostream &os, ArgumentParser &parser)
{
parser.Help(os);
return os;
}
/** Boolean argument matcher
*/
class Flag : public FlagBase
{
public:
Flag(Group &group, const std::string &name, const std::string &help, Matcher &&matcher): FlagBase(name, help, std::move(matcher))
{
group.Add(*this);
}
virtual ~Flag() {}
};
/** Help flag class
*
* Works like a regular flag, but throws an instance of Help when it is matched
*/
class HelpFlag : public Flag
{
public:
HelpFlag(Group &group, const std::string &name, const std::string &help, Matcher &&matcher): Flag(group, name, help, std::move(matcher)) {}
virtual ~HelpFlag() {}
virtual FlagBase *Match(const std::string &arg) override
{
if (FlagBase::Match(arg))
{
throw Help(arg);
}
return nullptr;
}
virtual FlagBase *Match(const char arg) override
{
if (FlagBase::Match(arg))
{
throw Help(std::string(1, arg));
}
return nullptr;
}
};
/** A flag class that simply counts the number of times it's matched
*/
class Counter : public Flag
{
public:
/** The public count variable. Can be changed at will, but probably shouldn't be.
*/
int count;
Counter(Group &group, const std::string &name, const std::string &help, Matcher &&matcher, const int startcount = 0): Flag(group, name, help, std::move(matcher)), count(startcount) {}
virtual ~Counter() {}
virtual FlagBase *Match(const std::string &arg) override
{
FlagBase *me = FlagBase::Match(arg);
if (me)
{
++count;
}
return me;
}
virtual FlagBase *Match(const char arg) override
{
FlagBase *me = FlagBase::Match(arg);
if (me)
{
++count;
}
return me;
}
};
/** A default Reader function for argument classes
*
* Simply uses a std::istringstream to read into the destination type, and
* raises a ParseError if there are any characters left.
*/
template <typename T>
void ArgReader(const std::string &name, const std::string &value, T &destination)
{
std::istringstream ss(value);
ss >> destination;
if (ss.rdbuf()->in_avail() > 0)
{
std::ostringstream problem;
problem << "Argument '" << name << "' received invalid value type '" << value << "'";
throw ParseError(problem.str().c_str());
}
}
/** std::string specialization for ArgReader
*
* By default, stream extraction into a string splits on white spaces, and
* it is more efficient to ust copy a string into the destination.
*/
template <>
void ArgReader<std::string>(const std::string &name, const std::string &value, std::string &destination)
{
destination.assign(value);
}
/** An argument-accepting flag class
*
* \tparam T the type to extract the argument as
* \tparam Reader The function used to read the argument, taking the name, value, and destination reference
*/
template <typename T, void (*Reader)(const std::string &, const std::string &, T&) = ArgReader<T>>
class ArgFlag : public ArgFlagBase
{
public:
/** The publicly accessible value member
*
* You can change this, but you probably shouldn't.
*/
T value;
ArgFlag(Group &group, const std::string &name, const std::string &help, Matcher &&matcher, const T &defaultValue = T()): ArgFlagBase(name, help, std::move(matcher)), value(defaultValue)
{
group.Add(*this);
}
virtual ~ArgFlag() {}
virtual void ParseArg(const std::string &value) override
{
Reader(name, value, this->value);
}
};
/** An argument-accepting flag class that pushes the found values into a list
*
* \tparam T the type to extract the argument as
* \tparam List the list type that houses the values
* \tparam Reader The function used to read the argument, taking the name, value, and destination reference
*/
template <
typename T,
typename List = std::vector<T>,
void (*Reader)(const std::string &, const std::string &, T&) = ArgReader<T>>
class ArgFlagList : public ArgFlagBase
{
public:
/** The publicly accessible value member list
*
* You can change this, but you probably shouldn't.
*/
List values;
ArgFlagList(Group &group, const std::string &name, const std::string &help, Matcher &&matcher, const List &defaultValues = List()): ArgFlagBase(name, help, std::move(matcher)), values(defaultValues)
{
group.Add(*this);
}
virtual ~ArgFlagList() {}
virtual void ParseArg(const std::string &value) override
{
values.emplace_back();
Reader(name, value, values.back());
}
};
/** A positional argument class
*
* \tparam T the type to extract the argument as
* \tparam Reader The function used to read the argument, taking the name, value, and destination reference
*/
template <typename T, void (*Reader)(const std::string &, const std::string &, T&) = ArgReader<T>>
class PosArg : public PosBase
{
public:
/** The publicly accessible value member
*
* You can change this, but you probably shouldn't.
*/
T value;
PosArg(Group &group, const std::string &name, const std::string &help, const T &defaultValue = T()): PosBase(name, help), value(defaultValue)
{
group.Add(*this);
}
virtual ~PosArg() {}
virtual void ParseArg(const std::string &value) override
{
Reader(name, value, this->value);
ready = false;
matched = true;
}
};
/** A positional argument class that pushes the found values into a list
*
* \tparam T the type to extract the argument as
* \tparam List the list type that houses the values
* \tparam Reader The function used to read the argument, taking the name, value, and destination reference
*/
template <
typename T,
typename List = std::vector<T>,
void (*Reader)(const std::string &, const std::string &, T&) = ArgReader<T>>
class PosArgList : public PosBase
{
public:
/** The publicly accessible value member list
*
* You can change this, but you probably shouldn't.
*/
List values;
PosArgList(Group &group, const std::string &name, const std::string &help, const List &defaultValues = List()): PosBase(name, help), values(defaultValues)
{
group.Add(*this);
}
virtual ~PosArgList() {}
virtual void ParseArg(const std::string &value) override
{
values.emplace_back();
Reader(name, value, values.back());
matched = true;
}
virtual std::string Name() const override
{
return name + std::string("...");
}
};
}
|