-
Notifications
You must be signed in to change notification settings - Fork 2
/
Arguments.d
413 lines (324 loc) · 6.79 KB
/
Arguments.d
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
/**
* Copyright: Copyright (c) 2011-2012 Jacob Carlborg. All rights reserved.
* Authors: Jacob Carlborg
* Version: Initial created: Apr 3, 2011
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost Software License 1.0)
*/
module mambo.arguments.Arguments;
import std.conv;
import tango.util.container.HashMap;
import Internal = mambo.arguments.internal.Arguments;
import mambo.arguments.Formatter;
import mambo.arguments.Options;
import mambo.core._;
import mambo.util.Traits;
class Arguments
{
immutable string shortPrefix;
immutable string longPrefix;
immutable char assignment;
bool sloppy;
bool passThrough;
string header;
string footer = "Use the `-h' flag for help.";
package Internal.Arguments internalArguments;
private
{
Options optionProxy;
ArgumentBase[string] positionalArguments_;
ArgumentProxy proxy;
ArgumentBase[] sortedPosArgs_;
Formatter formatter_;
string[] originalArgs_;
string[] rawArgs_;
}
alias option this;
this (string shortPrefix = "-", string longPrefix = "--", char assignment = '=')
{
this.shortPrefix = shortPrefix;
this.longPrefix = longPrefix;
this.assignment = assignment;
internalArguments = new Internal.Arguments(shortPrefix, longPrefix, assignment);
optionProxy = Options(this);
proxy = ArgumentProxy.create(this);
}
@property Formatter formatter ()
{
return formatter_ = formatter_ ? formatter_ : Formatter.instance(this);
}
Option!(T) opIndex (T = string) (string name)
{
return option.opIndex!(T)(name);
}
string opIndex () (size_t index)
{
if (index > rawArgs.length || isEmpty)
assert(0, "throw MissingArgumentException - Missing argument(s)");
return rawArgs[index];
}
@property Options option ()
{
return optionProxy;
}
@property ArgumentProxy argument () ()
{
return proxy;
}
Argument!(T) argument (T = string) (string name, string helpText)
{
return proxy.opCall!(T)(name, helpText);
}
bool parse (string[] input)
{
originalArgs = input;
internalArguments.passThrough = passThrough;
auto result = internalArguments.parse(originalArgs, sloppy);
if (!result)
return false;
rawArgs = cast(string[]) internalArguments(null).assigned;
return result && parsePositionalArguments();
}
@property string first ()
{
return this[0];
}
@property string last ()
{
return this[rawArgs.length - 1];
}
@property bool isEmpty ()
{
return rawArgs.isEmpty;
}
@property bool any ()
{
return rawArgs.any;
}
@property string helpText ()
{
return formatter.helpText();
}
@property ArgumentBase[] positionalArguments ()
{
return positionalArguments_.values;
}
@property Option!(int)[] options ()
{
return optionProxy.options;
}
@property string[] rawArgs ()
{
return rawArgs_;
}
private @property string[] rawArgs (string[] rawArgs)
{
return rawArgs_ = rawArgs;
}
@property string[] originalArgs ()
{
return originalArgs_;
}
private @property string[] originalArgs (string[] args)
{
return originalArgs_ = args;
}
string errors (char[] delegate (char[] buffer, const(char)[] format, ...) dg)
{
return internalArguments.errors(dg).assumeUnique;
}
private:
@property ArgumentBase[] sortedPosArgs ()
{
if (sortedPosArgs_.any)
return sortedPosArgs_;
sortedPosArgs_ = positionalArguments;
sortedPosArgs_.sort!((a, b) => a.position < b.position)();
return sortedPosArgs_;
}
bool parsePositionalArguments ()
{
import std.algorithm : remove;
int error;
auto posArgs = sortedPosArgs;
if (posArgs.isEmpty)
return true;
auto arg = posArgs.first;
size_t numArgs;
auto len = rawArgs.length;
for (size_t i = 1; i < len; i++)
{
auto value = rawArgs[i];
if (value == "--")
break;
else if (value.startsWith(longPrefix) || value.startsWith(shortPrefix))
continue;
arg.values_ ~= value;
rawArgs = rawArgs.remove(i);
len--;
i--;
if (++numArgs == arg.max)
{
if (numArgs >= posArgs.length)
break;
arg = posArgs[i - numArgs];
numArgs = 0;
}
}
foreach (e ; posArgs)
error |= e.validate();
return error == 0;
}
}
struct ArgumentProxy
{
private Arguments arguments;
static ArgumentProxy create (Arguments arguments)
{
ArgumentProxy proxy;
proxy.arguments = arguments;
return proxy;
}
Argument!(T) opCall (T = string) (string name, string helpText)
{
assert(name !in arguments.positionalArguments_);
auto arg = new Argument!(T)(arguments.positionalArguments_.length, name);
arg.help(helpText);
arguments.positionalArguments_[name] = arg;
return arg;
}
template opDispatch (string name)
{
@property Argument!(T) opDispatch (T = string) ()
{
return opIndex!(T)(name);
}
}
Argument!(T) opIndex (T = string) (string name)
{
return cast(Argument!(T)) arguments.positionalArguments_[name];
}
}
class ArgumentBase
{
int min = 1;
int max = 1;
private
{
enum maxParams = 42;
size_t position_;
string[] values_;
int error_ = Internal.Arguments.Argument.None;
string name_;
string helpText_;
string defaults_;
bool required_;
}
private this (size_t position, string name)
{
this.position_ = position;
this.name_ = name;
}
@property string name ()
{
return name_;
}
@property string helpText ()
{
return helpText_;
}
private @property string helpText (string value)
{
return helpText_ = value;
}
@property size_t position ()
{
return position_;
}
@property int error ()
{
return error_;
}
private @property int error (int value)
{
return error_ = value;
}
@property bool hasValue ()
{
return values_.any;
}
@property U as (U) ()
{
static if (!isString!(U) && isArray!(U))
return to!(U)(values_);
else
{
assert(hasValue, "Missing value");
return to!(U)(rawValue);
}
}
@property string rawValue ()
{
return hasValue ? values_.first : "";
}
@property string[] rawValues ()
{
return values_;
}
private int validate ()
{
if (!hasValue && required_)
return error = Internal.Arguments.Argument.Required;
if (!hasValue)
return error;
if (rawValues.length < min)
error = Internal.Arguments.Argument.ParamLo;
else if (rawValues.length > max)
error = Internal.Arguments.Argument.ParamHi;
return error;
}
}
class Argument (T) : ArgumentBase
{
alias value this;
private this (size_t position, string name)
{
super(position, name);
}
@property T value ()
{
return as!(T);
}
@property T[] values ()
{
return as!(T[]);
}
Argument help (string text)
{
helpText = text;
return this;
}
Argument defaults (string values)
{
defaults_ = values;
return this;
}
Argument params ()
{
return params(1, maxParams);
}
Argument params (int count)
{
return params(count, count);
}
Argument params (int min, int max)
{
this.min = min;
this.max = max;
return this;
}
Argument required ()
{
required_ = true;
return this;
}
}