@sapphire/lexure 1.1.8-next.d4ebe803.0 → 1.1.8-next.db356eb0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/dist/cjs/index.cjs +38 -77
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/esm/index.mjs +38 -77
  4. package/dist/esm/index.mjs.map +1 -1
  5. package/dist/iife/index.global.js +48 -95
  6. package/dist/iife/index.global.js.map +1 -1
  7. package/package.json +11 -10
package/dist/cjs/index.cjs CHANGED
@@ -5,10 +5,7 @@ var result = require('@sapphire/result');
5
5
  var __defProp = Object.defineProperty;
6
6
  var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
7
7
  var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
8
- var __publicField = (obj, key, value) => {
9
- __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
10
- return value;
11
- };
8
+ var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
12
9
  var _ArgumentStream = class _ArgumentStream {
13
10
  constructor(results) {
14
11
  __publicField(this, "results");
@@ -63,8 +60,7 @@ var _ArgumentStream = class _ArgumentStream {
63
60
  * @returns The value, if any.
64
61
  */
65
62
  single() {
66
- if (this.finished)
67
- return result.Option.none;
63
+ if (this.finished) return result.Option.none;
68
64
  while (this.state.used.has(this.state.position)) {
69
65
  ++this.state.position;
70
66
  }
@@ -104,8 +100,7 @@ var _ArgumentStream = class _ArgumentStream {
104
100
  * @returns The mapped value, if any.
105
101
  */
106
102
  singleMap(predicate, useAnyways = false) {
107
- if (this.finished)
108
- return result.Option.none;
103
+ if (this.finished) return result.Option.none;
109
104
  while (this.state.used.has(this.state.position)) {
110
105
  ++this.state.position;
111
106
  }
@@ -127,8 +122,7 @@ var _ArgumentStream = class _ArgumentStream {
127
122
  * @returns The mapped value, if any.
128
123
  */
129
124
  async singleMapAsync(predicate, useAnyways = false) {
130
- if (this.finished)
131
- return result.Option.none;
125
+ if (this.finished) return result.Option.none;
132
126
  while (this.state.used.has(this.state.position)) {
133
127
  ++this.state.position;
134
128
  }
@@ -176,8 +170,7 @@ var _ArgumentStream = class _ArgumentStream {
176
170
  * @returns The transformed value, if any.
177
171
  */
178
172
  singleParse(predicate, useAnyways = false) {
179
- if (this.finished)
180
- return result.Result.err(null);
173
+ if (this.finished) return result.Result.err(null);
181
174
  while (this.state.used.has(this.state.position)) {
182
175
  ++this.state.position;
183
176
  }
@@ -200,8 +193,7 @@ var _ArgumentStream = class _ArgumentStream {
200
193
  * @returns The mapped value, if any.
201
194
  */
202
195
  async singleParseAsync(predicate, useAnyways = false) {
203
- if (this.finished)
204
- return result.Result.err(null);
196
+ if (this.finished) return result.Result.err(null);
205
197
  while (this.state.used.has(this.state.position)) {
206
198
  ++this.state.position;
207
199
  }
@@ -234,8 +226,7 @@ var _ArgumentStream = class _ArgumentStream {
234
226
  */
235
227
  find(predicate, from = this.state.position) {
236
228
  for (let i = from; i < this.length; ++i) {
237
- if (this.state.used.has(i))
238
- continue;
229
+ if (this.state.used.has(i)) continue;
239
230
  const parameter = this.results.ordered[i].value;
240
231
  if (predicate(parameter)) {
241
232
  this.state.used.add(i);
@@ -266,8 +257,7 @@ var _ArgumentStream = class _ArgumentStream {
266
257
  */
267
258
  async findAsync(predicate, from = this.state.position) {
268
259
  for (let i = from; i < this.length; ++i) {
269
- if (this.state.used.has(i))
270
- continue;
260
+ if (this.state.used.has(i)) continue;
271
261
  const parameter = this.results.ordered[i].value;
272
262
  if (await predicate(parameter)) {
273
263
  this.state.used.add(i);
@@ -299,8 +289,7 @@ var _ArgumentStream = class _ArgumentStream {
299
289
  */
300
290
  findMap(predicate, from = this.state.position) {
301
291
  for (let i = from; i < this.length; ++i) {
302
- if (this.state.used.has(i))
303
- continue;
292
+ if (this.state.used.has(i)) continue;
304
293
  const parameter = this.results.ordered[i].value;
305
294
  const result = predicate(parameter);
306
295
  if (result.isSome()) {
@@ -333,8 +322,7 @@ var _ArgumentStream = class _ArgumentStream {
333
322
  */
334
323
  async findMapAsync(predicate, from = this.state.position) {
335
324
  for (let i = from; i < this.length; ++i) {
336
- if (this.state.used.has(i))
337
- continue;
325
+ if (this.state.used.has(i)) continue;
338
326
  const parameter = this.results.ordered[i].value;
339
327
  const result = await predicate(parameter);
340
328
  if (result.isSome()) {
@@ -384,8 +372,7 @@ var _ArgumentStream = class _ArgumentStream {
384
372
  findParse(predicate, from = this.state.position) {
385
373
  const errors = [];
386
374
  for (let i = from; i < this.length; ++i) {
387
- if (this.state.used.has(i))
388
- continue;
375
+ if (this.state.used.has(i)) continue;
389
376
  const parameter = this.results.ordered[i].value;
390
377
  const result = predicate(parameter);
391
378
  if (result.isOk()) {
@@ -413,8 +400,7 @@ var _ArgumentStream = class _ArgumentStream {
413
400
  async findParseAsync(predicate, from = this.state.position) {
414
401
  const errors = [];
415
402
  for (let i = from; i < this.length; ++i) {
416
- if (this.state.used.has(i))
417
- continue;
403
+ if (this.state.used.has(i)) continue;
418
404
  const parameter = this.results.ordered[i].value;
419
405
  const result = await predicate(parameter);
420
406
  if (result.isOk()) {
@@ -449,26 +435,21 @@ var _ArgumentStream = class _ArgumentStream {
449
435
  * @returns The unused parameters within the range.
450
436
  */
451
437
  many(limit = Infinity, from = this.state.position) {
452
- if (this.finished)
453
- return result.Option.none;
438
+ if (this.finished) return result.Option.none;
454
439
  const parameters = [];
455
440
  for (let i = from; i < this.length; ++i) {
456
- if (this.state.used.has(i))
457
- continue;
441
+ if (this.state.used.has(i)) continue;
458
442
  this.state.used.add(i);
459
443
  parameters.push(this.results.ordered[i]);
460
- if (parameters.length >= limit)
461
- break;
444
+ if (parameters.length >= limit) break;
462
445
  }
463
446
  return parameters.length ? result.Option.some(parameters) : result.Option.none;
464
447
  }
465
448
  filter(predicate, from = this.state.position) {
466
- if (this.finished)
467
- return result.Option.none;
449
+ if (this.finished) return result.Option.none;
468
450
  const parameters = [];
469
451
  for (let i = from; i < this.length; ++i) {
470
- if (this.state.used.has(i))
471
- continue;
452
+ if (this.state.used.has(i)) continue;
472
453
  const parameter = this.results.ordered[i].value;
473
454
  if (predicate(parameter)) {
474
455
  this.state.used.add(i);
@@ -478,12 +459,10 @@ var _ArgumentStream = class _ArgumentStream {
478
459
  return result.Option.some(parameters);
479
460
  }
480
461
  async filterAsync(predicate, from = this.state.position) {
481
- if (this.finished)
482
- return result.Option.none;
462
+ if (this.finished) return result.Option.none;
483
463
  const parameters = [];
484
464
  for (let i = from; i < this.length; ++i) {
485
- if (this.state.used.has(i))
486
- continue;
465
+ if (this.state.used.has(i)) continue;
487
466
  const parameter = this.results.ordered[i].value;
488
467
  if (await predicate(parameter)) {
489
468
  this.state.used.add(i);
@@ -493,12 +472,10 @@ var _ArgumentStream = class _ArgumentStream {
493
472
  return result.Option.some(parameters);
494
473
  }
495
474
  filterMap(predicate, from = this.state.position) {
496
- if (this.finished)
497
- return result.Option.none;
475
+ if (this.finished) return result.Option.none;
498
476
  const parameters = [];
499
477
  for (let i = from; i < this.length; ++i) {
500
- if (this.state.used.has(i))
501
- continue;
478
+ if (this.state.used.has(i)) continue;
502
479
  const parameter = this.results.ordered[i].value;
503
480
  const result = predicate(parameter);
504
481
  result.inspect((value) => {
@@ -509,12 +486,10 @@ var _ArgumentStream = class _ArgumentStream {
509
486
  return result.Option.some(parameters);
510
487
  }
511
488
  async filterMapAsync(predicate, from = this.state.position) {
512
- if (this.finished)
513
- return result.Option.none;
489
+ if (this.finished) return result.Option.none;
514
490
  const parameters = [];
515
491
  for (let i = from; i < this.length; ++i) {
516
- if (this.state.used.has(i))
517
- continue;
492
+ if (this.state.used.has(i)) continue;
518
493
  const parameter = this.results.ordered[i].value;
519
494
  const result = await predicate(parameter);
520
495
  result.inspect((value) => {
@@ -592,8 +567,7 @@ var _ArgumentStream = class _ArgumentStream {
592
567
  const entries = [];
593
568
  for (const key of keys) {
594
569
  const values = this.results.options.get(key);
595
- if (values)
596
- entries.push(...values);
570
+ if (values) entries.push(...values);
597
571
  }
598
572
  return entries.length ? result.Option.some(entries) : result.Option.none;
599
573
  }
@@ -686,11 +660,9 @@ var _TokenStream = class _TokenStream {
686
660
  }
687
661
  getPossibleQuotedArgument() {
688
662
  for (const [open, close] of this.quotes) {
689
- if (!this.input.startsWith(open, this.position))
690
- continue;
663
+ if (!this.input.startsWith(open, this.position)) continue;
691
664
  const end = this.input.indexOf(close, this.position + open.length);
692
- if (end === -1)
693
- continue;
665
+ if (end === -1) continue;
694
666
  const value = this.input.slice(this.position + open.length, end);
695
667
  this.position = end + close.length;
696
668
  return { type: 1 /* Quoted */, value, open, close };
@@ -774,10 +746,8 @@ var _ParserResult = class _ParserResult {
774
746
  parsePossibleOptions(parameter) {
775
747
  return this.strategy.matchOption(parameter.value).inspect(([key, value]) => {
776
748
  const existing = this.options.get(key);
777
- if (existing)
778
- existing.push(value);
779
- else
780
- this.options.set(key, [value]);
749
+ if (existing) existing.push(value);
750
+ else this.options.set(key, [value]);
781
751
  }).isSome();
782
752
  }
783
753
  parseOrdered(parameter) {
@@ -823,22 +793,17 @@ var _PrefixedStrategy = class _PrefixedStrategy {
823
793
  }
824
794
  matchFlag(input) {
825
795
  const prefix = this.prefixes.find((x) => input.startsWith(x));
826
- if (!prefix)
827
- return result.Option.none;
828
- if (this.separators.some((x) => input.includes(x, prefix.length)))
829
- return result.Option.none;
796
+ if (!prefix) return result.Option.none;
797
+ if (this.separators.some((x) => input.includes(x, prefix.length))) return result.Option.none;
830
798
  return result.Option.some(input.slice(prefix.length));
831
799
  }
832
800
  matchOption(input) {
833
801
  const prefix = this.prefixes.find((x) => input.startsWith(x));
834
- if (!prefix)
835
- return result.Option.none;
802
+ if (!prefix) return result.Option.none;
836
803
  for (const separator of this.separators) {
837
804
  const index = input.indexOf(separator, prefix.length + 1);
838
- if (index === -1)
839
- continue;
840
- if (index + separator.length === input.length)
841
- return result.Option.none;
805
+ if (index === -1) continue;
806
+ if (index + separator.length === input.length) return result.Option.none;
842
807
  const key = input.slice(prefix.length, index);
843
808
  const value = input.slice(index + separator.length);
844
809
  return result.Option.some([key, value]);
@@ -851,10 +816,8 @@ var PrefixedStrategy = _PrefixedStrategy;
851
816
 
852
817
  // src/lib/util/util.ts
853
818
  function join(parameters) {
854
- if (parameters.length === 0)
855
- return "";
856
- if (parameters.length === 1)
857
- return parameters[0].value;
819
+ if (parameters.length === 0) return "";
820
+ if (parameters.length === 1) return parameters[0].value;
858
821
  let output = parameters[0].value;
859
822
  for (let i = 1; i < parameters.length; i++) {
860
823
  const parameter = parameters[i];
@@ -864,10 +827,8 @@ function join(parameters) {
864
827
  }
865
828
  __name(join, "join");
866
829
  function joinRaw(parameters) {
867
- if (parameters.length === 0)
868
- return "";
869
- if (parameters.length === 1)
870
- return parameters[0].raw;
830
+ if (parameters.length === 0) return "";
831
+ if (parameters.length === 1) return parameters[0].raw;
871
832
  let output = parameters[0].raw;
872
833
  for (let i = 1; i < parameters.length; i++) {
873
834
  const parameter = parameters[i];
@@ -891,5 +852,5 @@ exports.TokenType = TokenType;
891
852
  exports.WordParameter = WordParameter;
892
853
  exports.join = join;
893
854
  exports.joinRaw = joinRaw;
894
- //# sourceMappingURL=out.js.map
855
+ //# sourceMappingURL=index.cjs.map
895
856
  //# sourceMappingURL=index.cjs.map
package/dist/cjs/index.cjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../../src/lib/ArgumentStream.ts","../../src/lib/lexer/streams/parameters/BaseParameter.ts","../../src/lib/lexer/streams/parameters/QuotedParameter.ts","../../src/lib/lexer/streams/parameters/WordParameter.ts","../../src/lib/lexer/streams/raw/TokenStream.ts","../../src/lib/lexer/streams/ParameterStream.ts","../../src/lib/lexer/Lexer.ts","../../src/lib/parser/ParserResult.ts","../../src/lib/parser/strategies/EmptyStrategy.ts","../../src/lib/parser/Parser.ts","../../src/lib/parser/strategies/PrefixedStrategy.ts","../../src/lib/util/util.ts"],"names":["TokenType","Option"],"mappings":";;;;;;;;;AAAA,SAAS,QAAQ,cAAc;AAIxB,IAAM,kBAAN,MAAM,gBAAe;AAAA,EAIpB,YAAY,SAAuB;AAH1C,wBAAgB;AAChB,wBAAO;AAGN,SAAK,UAAU;AACf,SAAK,QAAQ,EAAE,MAAM,oBAAI,IAAI,GAAG,UAAU,EAAE;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,WAAW;AACrB,WAAO,KAAK,SAAS,KAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,SAAS;AACnB,WAAO,KAAK,QAAQ,QAAQ;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,YAAY;AACtB,WAAO,KAAK,SAAS,KAAK;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,OAAO;AACjB,WAAO,KAAK,MAAM,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBO,SAAyB;AAC/B,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,GAAG;AAChD,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,SAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ;AACvC,WAAO,OAAO,KAAK,KAAK,QAAQ,QAAQ,KAAK,MAAM,UAAU,EAAE,KAAK;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkCO,UAAa,WAAyC,aAAa,OAAkB;AAC3F,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,GAAG;AAChD,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,UAAM,SAAS,UAAU,KAAK,QAAQ,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK;AACxE,QAAI,OAAO,OAAO,KAAK,YAAY;AAClC,WAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ;AACvC,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAa,eAAkB,WAAkD,aAAa,OAA2B;AACxH,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,GAAG;AAChD,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,UAAM,SAAS,MAAM,UAAU,KAAK,QAAQ,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK;AAC9E,QAAI,OAAO,OAAO,KAAK,YAAY;AAClC,WAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ;AACvC,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsCO,YAAkB,WAA4C,aAAa,OAA4B;AAC7G,QAAI,KAAK;AAAU,aAAO,OAAO,IAAI,IAAI;AAEzC,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,GAAG;AAChD,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,UAAM,SAAS,UAAU,KAAK,QAAQ,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK;AACxE,QAAI,OAAO,KAAK,KAAK,YAAY;AAChC,WAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ;AACvC,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAa,iBAAuB,WAAqD,aAAa,OAAqC;AAC1I,QAAI,KAAK;AAAU,aAAO,OAAO,IAAI,IAAI;AAEzC,WAAO,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,GAAG;AAChD,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,UAAM,SAAS,MAAM,UAAU,KAAK,QAAQ,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK;AAC9E,QAAI,OAAO,KAAK,KAAK,YAAY;AAChC,WAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ;AACvC,QAAE,KAAK,MAAM;AAAA,IACd;AAEA,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBO,KAAK,WAAuC,OAAO,KAAK,MAAM,UAA0B;AAC9F,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,UAAI,UAAU,SAAS,GAAG;AACzB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO,OAAO,KAAK,SAAS;AAAA,MAC7B;AAAA,IACD;AAEA,WAAO,OAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,MAAa,UAAU,WAAgD,OAAO,KAAK,MAAM,UAAmC;AAC3H,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,UAAI,MAAM,UAAU,SAAS,GAAG;AAC/B,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO,OAAO,KAAK,SAAS;AAAA,MAC7B;AAAA,IACD;AAEA,WAAO,OAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBO,QAAW,WAAyC,OAAO,KAAK,MAAM,UAAqB;AACjG,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,UAAU,SAAS;AAClC,UAAI,OAAO,OAAO,GAAG;AACpB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO;AAAA,MACR;AAAA,IACD;AAEA,WAAO,OAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,MAAa,aAAgB,WAAkD,OAAO,KAAK,MAAM,UAA8B;AAC9H,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,MAAM,UAAU,SAAS;AACxC,UAAI,OAAO,OAAO,GAAG;AACpB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO;AAAA,MACR;AAAA,IACD;AAEA,WAAO,OAAO;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuCO,UAAgB,WAA4C,OAAO,KAAK,MAAM,UAA0B;AAC9G,UAAM,SAAc,CAAC;AACrB,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,UAAU,SAAS;AAClC,UAAI,OAAO,KAAK,GAAG;AAClB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO;AAAA,MACR;AAEA,aAAO,KAAK,OAAO,UAAU,CAAC;AAAA,IAC/B;AAEA,WAAO,OAAO,IAAI,MAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAa,eAAqB,WAAqD,OAAO,KAAK,MAAM,UAAmC;AAC3I,UAAM,SAAc,CAAC;AACrB,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,MAAM,UAAU,SAAS;AACxC,UAAI,OAAO,KAAK,GAAG;AAClB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,eAAO;AAAA,MACR;AAEA,aAAO,KAAK,OAAO,UAAU,CAAC;AAAA,IAC/B;AAEA,WAAO,OAAO,IAAI,MAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBO,KAAK,QAAQ,UAAU,OAAO,KAAK,MAAM,UAA+B;AAC9E,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,UAAM,aAA0B,CAAC;AACjC,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AAExC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAG5B,WAAK,MAAM,KAAK,IAAI,CAAC;AACrB,iBAAW,KAAK,KAAK,QAAQ,QAAQ,CAAC,CAAC;AAGvC,UAAI,WAAW,UAAU;AAAO;AAAA,IACjC;AAEA,WAAO,WAAW,SAAS,OAAO,KAAK,UAAU,IAAI,OAAO;AAAA,EAC7D;AAAA,EAEO,OAAO,WAAuC,OAAO,KAAK,MAAM,UAA4B;AAClG,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,UAAM,aAAuB,CAAC;AAC9B,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,UAAI,UAAU,SAAS,GAAG;AACzB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,mBAAW,KAAK,SAAS;AAAA,MAC1B;AAAA,IACD;AAEA,WAAO,OAAO,KAAK,UAAU;AAAA,EAC9B;AAAA,EAEA,MAAa,YAAY,WAAgD,OAAO,KAAK,MAAM,UAAqC;AAC/H,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,UAAM,aAAuB,CAAC;AAC9B,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,UAAI,MAAM,UAAU,SAAS,GAAG;AAC/B,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,mBAAW,KAAK,SAAS;AAAA,MAC1B;AAAA,IACD;AAEA,WAAO,OAAO,KAAK,UAAU;AAAA,EAC9B;AAAA,EAEO,UAAa,WAAyC,OAAO,KAAK,MAAM,UAAuB;AACrG,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,UAAM,aAAkB,CAAC;AACzB,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,UAAU,SAAS;AAClC,aAAO,QAAQ,CAAC,UAAU;AACzB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,mBAAW,KAAK,KAAK;AAAA,MACtB,CAAC;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,UAAU;AAAA,EAC9B;AAAA,EAEA,MAAa,eAAkB,WAAkD,OAAO,KAAK,MAAM,UAAgC;AAClI,QAAI,KAAK;AAAU,aAAO,OAAO;AAEjC,UAAM,aAAkB,CAAC;AACzB,aAAS,IAAI,MAAM,IAAI,KAAK,QAAQ,EAAE,GAAG;AACxC,UAAI,KAAK,MAAM,KAAK,IAAI,CAAC;AAAG;AAE5B,YAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAC1C,YAAM,SAAS,MAAM,UAAU,SAAS;AACxC,aAAO,QAAQ,CAAC,UAAU;AACzB,aAAK,MAAM,KAAK,IAAI,CAAC;AACrB,mBAAW,KAAK,KAAK;AAAA,MACtB,CAAC;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,UAAU;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBO,QAAQ,MAAkC;AAChD,WAAO,KAAK,KAAK,CAAC,QAAQ,KAAK,QAAQ,MAAM,IAAI,GAAG,CAAC;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBO,UAAU,MAAyC;AACzD,WAAO,KAAK,QAAQ,GAAG,IAAI,EAAE,IAAI,CAAC,WAAW,OAAO,GAAG,EAAE,CAAE;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBO,WAAW,MAAoD;AACrE,UAAM,UAAoB,CAAC;AAC3B,eAAW,OAAO,MAAM;AACvB,YAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,GAAG;AAC3C,UAAI;AAAQ,gBAAQ,KAAK,GAAG,MAAM;AAAA,IACnC;AAEA,WAAO,QAAQ,SAAS,OAAO,KAAK,OAAO,IAAI,OAAO;AAAA,EACvD;AAAA,EAEO,OAA6B;AACnC,WAAO;AAAA,MACN,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI;AAAA,MAC7B,UAAU,KAAK,MAAM;AAAA,IACtB;AAAA,EACD;AAAA,EAEO,QAAQ,OAA6B;AAC3C,SAAK,QAAQ;AAAA,EACd;AAAA,EAEO,QAAQ;AACd,SAAK,QAAQ,EAAE,MAAM,oBAAI,IAAI,GAAG,UAAU,EAAE,CAAC;AAAA,EAC9C;AACD;AA5oB4B;AAArB,IAAM,iBAAN;;;ACJA,IAAe,iBAAf,MAAe,eAAc;AAAA,EAG5B,YAAY,YAA+B;AAFlD,wBAAgB;AAGf,SAAK,aAAa;AAAA,EACnB;AAAA,EAEA,IAAW,UAAkB;AAC5B,WAAO,KAAK,WAAW,KAAK,EAAE;AAAA,EAC/B;AAGD;AAZoC;AAA7B,IAAe,gBAAf;;;ACGA,IAAM,mBAAN,MAAM,yBAAwB,cAAc;AAAA,EAK3C,YAAY,YAA+B,MAAiC;AAClF,UAAM,UAAU;AALjB,wBAAgB;AAChB,wBAAgB;AAChB,wBAAgB;AAIf,SAAK,QAAQ,KAAK;AAClB,SAAK,OAAO,KAAK;AACjB,SAAK,QAAQ,KAAK;AAAA,EACnB;AAAA,EAEA,IAAW,MAAM;AAChB,WAAO,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,GAAG,KAAK,KAAK;AAAA,EAC9C;AACD;AAfmD;AAA5C,IAAM,kBAAN;;;ACAA,IAAM,iBAAN,MAAM,uBAAsB,cAAc;AAAA,EAGzC,YAAY,YAA+B,MAA+B;AAChF,UAAM,UAAU;AAHjB,wBAAgB;AAIf,SAAK,QAAQ,KAAK;AAAA,EACnB;AAAA,EAEA,IAAW,MAAM;AAChB,WAAO,KAAK;AAAA,EACb;AACD;AAXiD;AAA1C,IAAM,gBAAN;;;ACDA,IAAM,eAAN,MAAM,aAAuC;AAAA,EAM5C,YAAY,OAAc,OAAe;AALhD,wBAAiB;AACjB,wBAAiB;AACjB,wBAAiB;AACjB,wBAAQ,YAAW;AAGlB,SAAK,SAAS,MAAM;AACpB,SAAK,YAAY,MAAM;AACvB,SAAK,QAAQ;AAAA,EACd;AAAA,EAEA,IAAW,WAAW;AACrB,WAAO,KAAK,YAAY,KAAK,MAAM;AAAA,EACpC;AAAA,EAEA,EAAS,OAAO,QAAQ,IAAqB;AAC5C,WAAO,CAAC,KAAK,UAAU;AACtB,YAAM,KAAK,qBAAqB,KAAK,KAAK,0BAA0B,KAAK,KAAK,aAAa;AAAA,IAC5F;AAAA,EACD;AAAA,EAEQ,uBAA8C;AACrD,QAAI,KAAK,MAAM,WAAW,KAAK,WAAW,KAAK,QAAQ,GAAG;AACzD,WAAK,YAAY,KAAK,UAAU;AAChC,aAAO,EAAE,MAAM,mBAAqB,OAAO,KAAK,UAAU;AAAA,IAC3D;AAEA,WAAO;AAAA,EACR;AAAA,EAEQ,4BAAgD;AACvD,eAAW,CAAC,MAAM,KAAK,KAAK,KAAK,QAAQ;AACxC,UAAI,CAAC,KAAK,MAAM,WAAW,MAAM,KAAK,QAAQ;AAAG;AAEjD,YAAM,MAAM,KAAK,MAAM,QAAQ,OAAO,KAAK,WAAW,KAAK,MAAM;AACjE,UAAI,QAAQ;AAAI;AAEhB,YAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,WAAW,KAAK,QAAQ,GAAG;AAC/D,WAAK,WAAW,MAAM,MAAM;AAE5B,aAAO,EAAE,MAAM,gBAAkB,OAAO,MAAM,MAAM;AAAA,IACrD;AAEA,WAAO;AAAA,EACR;AAAA,EAEQ,eAA0B;AACjC,UAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK,WAAW,KAAK,QAAQ;AAC9D,UAAM,QAAQ,UAAU,KAAK,KAAK,MAAM,MAAM,KAAK,QAAQ,IAAI,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK;AACpG,SAAK,YAAY,MAAM;AACvB,WAAO,EAAE,MAAM,mBAAqB,MAAM;AAAA,EAC3C;AACD;AArDoD;AAA7C,IAAM,cAAN;AAuDA,IAAK,YAAL,kBAAKA,eAAL;AACN,EAAAA,sBAAA;AACA,EAAAA,sBAAA;AACA,EAAAA,sBAAA;AAHW,SAAAA;AAAA,GAAA;;;ACrDL,IAAM,mBAAN,MAAM,iBAAgB;AAAA,EAIrB,YAAY,QAAyB;AAH5C,wBAAiB;AACjB,wBAAQ,cAAuB,CAAC;AAG/B,SAAK,SAAS;AAAA,EACf;AAAA,EAEA,EAAS,OAAO,QAAQ,IAAmC;AAC1D,eAAW,QAAQ,KAAK,QAAQ;AAC/B,UAAI,KAAK,4BAA8B;AACtC,aAAK,WAAW,KAAK,KAAK,KAAK;AAC/B;AAAA,MACD;AAEA,YAAM,KAAK,0BAA4B,IAAI,gBAAgB,KAAK,YAAY,IAAI,IAAI,IAAI,cAAc,KAAK,YAAY,IAAI;AAC3H,WAAK,aAAa,CAAC;AAAA,IACpB;AAEA,WAAO,KAAK;AAAA,EACb;AACD;AArB6B;AAAtB,IAAM,kBAAN;;;ACDA,IAAM,SAAN,MAAM,OAAM;AAAA,EAIX,YAAY,UAAyB,CAAC,GAAG;AAHhD,wBAAgB;AAChB,wBAAgB;AAGf,SAAK,SAAS,QAAQ,UAAU,CAAC;AACjC,SAAK,YAAY,QAAQ,aAAa;AAAA,EACvC;AAAA,EAEO,IAAI,OAAe;AACzB,WAAO,IAAI,gBAAgB,KAAK,IAAI,KAAK,CAAC;AAAA,EAC3C;AAAA,EAEO,IAAI,OAAe;AACzB,WAAO,IAAI,YAAY,MAAM,KAAK;AAAA,EACnC;AACD;AAhBmB;AAAZ,IAAM,QAAN;;;ACCA,IAAM,gBAAN,MAAM,cAAa;AAAA,EAMlB,YAAY,QAAgB;AALnC,wBAAgB,WAAuB,CAAC;AACxC,wBAAgB,SAAQ,oBAAI,IAAY;AACxC,wBAAgB,WAAU,oBAAI,IAAsB;AACpD,wBAAiB;AAGhB,SAAK,WAAW,OAAO;AAAA,EACxB;AAAA,EAEO,MAAM,YAAiC;AAC7C,eAAW,aAAa,YAAY;AACnC,WAAK,kBAAkB,SAAS,KAAK,KAAK,qBAAqB,SAAS,KAAK,KAAK,aAAa,SAAS;AAAA,IACzG;AAEA,WAAO;AAAA,EACR;AAAA,EAEQ,kBAAkB,WAA+B;AACxD,WAAO,KAAK,SACV,UAAU,UAAU,KAAK,EACzB,QAAQ,CAAC,UAAU,KAAK,MAAM,IAAI,KAAK,CAAC,EACxC,OAAO;AAAA,EACV;AAAA,EAEQ,qBAAqB,WAA+B;AAC3D,WAAO,KAAK,SACV,YAAY,UAAU,KAAK,EAC3B,QAAQ,CAAC,CAAC,KAAK,KAAK,MAAM;AAC1B,YAAM,WAAW,KAAK,QAAQ,IAAI,GAAG;AACrC,UAAI;AAAU,iBAAS,KAAK,KAAK;AAAA;AAC5B,aAAK,QAAQ,IAAI,KAAK,CAAC,KAAK,CAAC;AAAA,IACnC,CAAC,EACA,OAAO;AAAA,EACV;AAAA,EAEQ,aAAa,WAA+B;AACnD,SAAK,QAAQ,KAAK,SAAS;AAC3B,WAAO;AAAA,EACR;AACD;AAxC0B;AAAnB,IAAM,eAAN;;;ACJP,SAAS,UAAAC,eAAc;AAGhB,IAAM,iBAAN,MAAM,eAA4C;AAAA,EACjD,YAA4B;AAClC,WAAOA,QAAO;AAAA,EACf;AAAA,EAEO,cAA6D;AACnE,WAAOA,QAAO;AAAA,EACf;AACD;AARyD;AAAlD,IAAM,gBAAN;;;ACEA,IAAM,UAAN,MAAM,QAAO;AAAA,EAGZ,YAAY,UAA+B;AAFlD,wBAAO;AAGN,SAAK,WAAW,YAAY,IAAI,cAAc;AAAA,EAC/C;AAAA,EAEO,qBAAqB,UAA8B;AACzD,SAAK,WAAW;AAChB,WAAO;AAAA,EACR;AAAA,EAEO,IAAI,OAA0C;AACpD,WAAO,IAAI,aAAa,IAAI,EAAE,MAAM,KAAK;AAAA,EAC1C;AACD;AAfoB;AAAb,IAAM,SAAN;;;ACLP,SAAS,UAAAA,eAAc;AAGhB,IAAM,oBAAN,MAAM,kBAA+C;AAAA,EAIpD,YAAY,UAA6B,YAA+B;AAH/E,wBAAgB;AAChB,wBAAgB;AAGf,SAAK,WAAW;AAChB,SAAK,aAAa;AAAA,EACnB;AAAA,EAEO,UAAU,OAA+B;AAC/C,UAAM,SAAS,KAAK,SAAS,KAAK,CAAC,MAAM,MAAM,WAAW,CAAC,CAAC;AAG5D,QAAI,CAAC;AAAQ,aAAOA,QAAO;AAG3B,QAAI,KAAK,WAAW,KAAK,CAAC,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,CAAC;AAAG,aAAOA,QAAO;AAEjF,WAAOA,QAAO,KAAK,MAAM,MAAM,OAAO,MAAM,CAAC;AAAA,EAC9C;AAAA,EAEO,YAAY,OAA8D;AAChF,UAAM,SAAS,KAAK,SAAS,KAAK,CAAC,MAAM,MAAM,WAAW,CAAC,CAAC;AAG5D,QAAI,CAAC;AAAQ,aAAOA,QAAO;AAE3B,eAAW,aAAa,KAAK,YAAY;AACxC,YAAM,QAAQ,MAAM,QAAQ,WAAW,OAAO,SAAS,CAAC;AAGxD,UAAI,UAAU;AAAI;AAGlB,UAAI,QAAQ,UAAU,WAAW,MAAM;AAAQ,eAAOA,QAAO;AAE7D,YAAM,MAAM,MAAM,MAAM,OAAO,QAAQ,KAAK;AAC5C,YAAM,QAAQ,MAAM,MAAM,QAAQ,UAAU,MAAM;AAClD,aAAOA,QAAO,KAAK,CAAC,KAAK,KAAK,CAAU;AAAA,IACzC;AAEA,WAAOA,QAAO;AAAA,EACf;AACD;AA3C4D;AAArD,IAAM,mBAAN;;;ACKA,SAAS,KAAK,YAAkC;AACtD,MAAI,WAAW,WAAW;AAAG,WAAO;AACpC,MAAI,WAAW,WAAW;AAAG,WAAO,WAAW,CAAC,EAAE;AAElD,MAAI,SAAS,WAAW,CAAC,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC3C,UAAM,YAAY,WAAW,CAAC;AAC9B,cAAU,UAAU,UAAU,UAAU;AAAA,EACzC;AAEA,SAAO;AACR;AAXgB;AAmBT,SAAS,QAAQ,YAAkC;AACzD,MAAI,WAAW,WAAW;AAAG,WAAO;AACpC,MAAI,WAAW,WAAW;AAAG,WAAO,WAAW,CAAC,EAAE;AAElD,MAAI,SAAS,WAAW,CAAC,EAAE;AAC3B,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC3C,UAAM,YAAY,WAAW,CAAC;AAC9B,cAAU,UAAU,UAAU,UAAU;AAAA,EACzC;AAEA,SAAO;AACR;AAXgB","sourcesContent":["import { Option, Result } from '@sapphire/result';\nimport type { Parameter } from './lexer/streams/ParameterStream';\nimport type { ParserResult } from './parser/ParserResult';\n\nexport class ArgumentStream {\n\tpublic readonly results: ParserResult;\n\tpublic state: ArgumentStream.State;\n\n\tpublic constructor(results: ParserResult) {\n\t\tthis.results = results;\n\t\tthis.state = { used: new Set(), position: 0 };\n\t}\n\n\t/**\n\t * Whether or not all ordered parameters were used.\n\t */\n\tpublic get finished() {\n\t\treturn this.used === this.length;\n\t}\n\n\t/**\n\t * The amount of ordered parameters.\n\t */\n\tpublic get length() {\n\t\treturn this.results.ordered.length;\n\t}\n\n\t/**\n\t * The remaining amount of ordered parameters.\n\t */\n\tpublic get remaining() {\n\t\treturn this.length - this.used;\n\t}\n\n\t/**\n\t * The amount of ordered parameters that have been used.\n\t */\n\tpublic get used() {\n\t\treturn this.state.used.size;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '1' }\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '2' }\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '3' }\n\t *\n\t * console.log(args.single());\n\t * // None\n\t * ```\n\t *\n\t * @returns The value, if any.\n\t */\n\tpublic single(): Option<string> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tthis.state.used.add(this.state.position);\n\t\treturn Option.some(this.results.ordered[this.state.position++].value);\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link singleMapAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number) ? Option.none : Option.some(number);\n\t * };\n\t *\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 1 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 2 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 3 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // None\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic singleMap<T>(predicate: (value: string) => Option<T>, useAnyways = false): Option<T> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isSome() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This is an asynchronous variant of {@link singleMap}.\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic async singleMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, useAnyways = false): Promise<Option<T>> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = await predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isSome() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Finds and retrieves the next unused parameter and transforms it.\n\t *\n\t * @note This is a variant of {@link findMap} that returns the errors on failure.\n\t * @note This does not support asynchronous results, refer to {@link singleParseAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number)\n\t * ? Result.err(`Could not parse ${value} to a number`)\n\t * : Result.ok(number);\n\t * };\n\t *\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 1 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 2 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 3 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Err { error: null }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate The predicate that determines the parameter's transformed value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the transformation failed. Defaults to `false`.\n\t * @returns The transformed value, if any.\n\t */\n\tpublic singleParse<T, E>(predicate: (value: string) => Result<T, E>, useAnyways = false): Result<T, E | null> {\n\t\tif (this.finished) return Result.err(null);\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isOk() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This is an asynchronous variant of {@link singleParse}.\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic async singleParseAsync<T, E>(predicate: (value: string) => Promise<Result<T, E>>, useAnyways = false): Promise<Result<T, E | null>> {\n\t\tif (this.finished) return Result.err(null);\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = await predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isOk() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `true`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link findAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `true`. If such an element is found, find immediately returns a `Option.some`\n\t * with that element value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic find(predicate: (value: string) => boolean, from = this.state.position): Option<string> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn Option.some(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `true`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This is an asynchronous variant of {@link find}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `true`. If such an element is found, find immediately returns a `Option.some`\n\t * with that element value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findAsync(predicate: (value: string) => Promise<boolean>, from = this.state.position): Promise<Option<string>> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (await predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn Option.some(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `Some`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link findMapAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `Some`. If such an element is found, find immediately returns the returned\n\t * value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic findMap<T>(predicate: (value: string) => Option<T>, from = this.state.position): Option<T> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tif (result.isSome()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `Some`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This is an asynchronous variant of {@link findMap}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `Some`. If such an element is found, find immediately returns the returned\n\t * value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, from = this.state.position): Promise<Option<T>> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tif (result.isSome()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Finds and retrieves the first unused parameter that could be transformed.\n\t *\n\t * @note This is a variant of {@link findMap} that returns the errors on failure.\n\t * @note This does not support asynchronous results, refer to {@link findParseAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number)\n\t * ? Result.err(`Could not parse ${value} to a number`)\n\t * : Result.ok(number);\n\t * };\n\t *\n\t * // Suppose args are from 'ba 1 cc'.\n\t *\n\t * console.log(args.findParse(parse));\n\t * // Ok { value: 1 }\n\t *\n\t * console.log(args.findParse(parse));\n\t * // Err {\n\t * // error: [\n\t * // 'Could not parse ba to a number',\n\t * // 'Could not parse cc to a number'\n\t * // ]\n\t * // }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate `findParse` calls `predicate` once for each unused ordered parameter, in ascending order, until\n\t * it finds one where `predicate` returns `Ok`. If such an element is found, `findParse` immediately returns the\n\t * returned value. Otherwise, `findParse` returns `Result.Err` with all the returned errors.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic findParse<T, E>(predicate: (value: string) => Result<T, E>, from = this.state.position): Result<T, E[]> {\n\t\tconst errors: E[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tif (result.isOk()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result as Result.Ok<T>;\n\t\t\t}\n\n\t\t\terrors.push(result.unwrapErr());\n\t\t}\n\n\t\treturn Result.err(errors);\n\t}\n\n\t/**\n\t * Finds and retrieves the first unused parameter that could be transformed.\n\t *\n\t * @note This is a variant of {@link findMapAsync} that returns the errors on failure.\n\t * @note This is an asynchronous variant of {@link findParse}.\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate `findParse` calls `predicate` once for each unused ordered parameter, in ascending order, until\n\t * it finds one where `predicate` returns `Ok`. If such an element is found, `findParse` immediately returns the\n\t * returned value. Otherwise, `findParse` returns `Result.Err` with all the returned errors.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findParseAsync<T, E>(predicate: (value: string) => Promise<Result<T, E>>, from = this.state.position): Promise<Result<T, E[]>> {\n\t\tconst errors: E[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tif (result.isOk()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result as Result.Ok<T>;\n\t\t\t}\n\n\t\t\terrors.push(result.unwrapErr());\n\t\t}\n\n\t\treturn Result.err(errors);\n\t}\n\n\t/**\n\t * Retrieves multiple unused parameters.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(join(args.many().unwrap()));\n\t * // '1 2 3'\n\t * ```\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(join(args.many(2).unwrap()));\n\t * // '1 2'\n\t * ```\n\t *\n\t * @param limit The maximum amount of parameters to retrieve, defaults to `Infinity`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The unused parameters within the range.\n\t */\n\tpublic many(limit = Infinity, from = this.state.position): Option<Parameter[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: Parameter[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\t// If the current parameter was already used, skip:\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\t// Mark current parameter as used, and push it to the resulting array:\n\t\t\tthis.state.used.add(i);\n\t\t\tparameters.push(this.results.ordered[i]);\n\n\t\t\t// If the parameters reached the limit, break the loop:\n\t\t\tif (parameters.length >= limit) break;\n\t\t}\n\n\t\treturn parameters.length ? Option.some(parameters) : Option.none;\n\t}\n\n\tpublic filter(predicate: (value: string) => boolean, from = this.state.position): Option<string[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: string[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic async filterAsync(predicate: (value: string) => Promise<boolean>, from = this.state.position): Promise<Option<string[]>> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: string[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (await predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic filterMap<T>(predicate: (value: string) => Option<T>, from = this.state.position): Option<T[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: T[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tresult.inspect((value) => {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(value);\n\t\t\t});\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic async filterMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, from = this.state.position): Promise<Option<T[]>> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: T[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tresult.inspect((value) => {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(value);\n\t\t\t});\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\t/**\n\t * Checks whether any of the flags were given.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--f --g':\n\t *\n\t * console.log(args.flag('f'));\n\t * // true\n\t *\n\t * console.log(args.flag('g', 'h'));\n\t * // true\n\t *\n\t * console.log(args.flag('h'));\n\t * // false\n\t * ```\n\t *\n\t * @param keys The names of the flags to check.\n\t * @returns Whether or not any of the flags were given.\n\t */\n\tpublic flag(...keys: readonly string[]): boolean {\n\t\treturn keys.some((key) => this.results.flags.has(key));\n\t}\n\n\t/**\n\t * Gets the last value of any option. When there are multiple names, the last value of the last found name is given.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--a=1 --b=2 --c=3'.\n\t * console.log(args.option('a'));\n\t * // Some { value: '1' }\n\t *\n\t * console.log(args.option('b', 'c'));\n\t * // Some { value: '3' }\n\t *\n\t * console.log(args.option('d'));\n\t * // None {}\n\t * ```\n\t *\n\t * @param keys The names of the options to check.\n\t * @returns The last value of the option, if any.\n\t */\n\tpublic option(...keys: readonly string[]): Option<string> {\n\t\treturn this.options(...keys).map((values) => values.at(-1)!);\n\t}\n\n\t/**\n\t * Gets all values from all options.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--a=1 --a=1 --b=2 --c=3'.\n\t * console.log(args.option('a'));\n\t * // Some { value: ['1', '1'] }\n\t *\n\t * console.log(args.option('b', 'c'));\n\t * // Some { value: ['2', '3'] }\n\t *\n\t * console.log(args.option('d'));\n\t * // None {}\n\t * ```\n\t *\n\t * @param keys The names of the options to check.\n\t * @returns The values from all the options concatenated, if any.\n\t */\n\tpublic options(...keys: readonly string[]): Option<readonly string[]> {\n\t\tconst entries: string[] = [];\n\t\tfor (const key of keys) {\n\t\t\tconst values = this.results.options.get(key);\n\t\t\tif (values) entries.push(...values);\n\t\t}\n\n\t\treturn entries.length ? Option.some(entries) : Option.none;\n\t}\n\n\tpublic save(): ArgumentStream.State {\n\t\treturn {\n\t\t\tused: new Set(this.state.used),\n\t\t\tposition: this.state.position\n\t\t};\n\t}\n\n\tpublic restore(state: ArgumentStream.State) {\n\t\tthis.state = state;\n\t}\n\n\tpublic reset() {\n\t\tthis.restore({ used: new Set(), position: 0 });\n\t}\n}\n\nexport namespace ArgumentStream {\n\texport interface State {\n\t\tused: Set<number>;\n\t\tposition: number;\n\t}\n}\n","export abstract class BaseParameter {\n\tpublic readonly separators: readonly string[];\n\n\tpublic constructor(separators: readonly string[]) {\n\t\tthis.separators = separators;\n\t}\n\n\tpublic get leading(): string {\n\t\treturn this.separators.join('');\n\t}\n\n\tpublic abstract get raw(): string;\n}\n","import type { QuotedToken } from '../raw/TokenStream';\nimport { BaseParameter } from './BaseParameter';\n\nexport class QuotedParameter extends BaseParameter {\n\tpublic readonly value: string;\n\tpublic readonly open: string;\n\tpublic readonly close: string;\n\n\tpublic constructor(separators: readonly string[], part: Omit<QuotedToken, 'type'>) {\n\t\tsuper(separators);\n\t\tthis.value = part.value;\n\t\tthis.open = part.open;\n\t\tthis.close = part.close;\n\t}\n\n\tpublic get raw() {\n\t\treturn `${this.open}${this.value}${this.close}`;\n\t}\n}\n","import type { WordToken } from '../raw/TokenStream';\nimport { BaseParameter } from './BaseParameter';\n\nexport class WordParameter extends BaseParameter {\n\tpublic readonly value: string;\n\n\tpublic constructor(separators: readonly string[], part: Omit<WordToken, 'type'>) {\n\t\tsuper(separators);\n\t\tthis.value = part.value;\n\t}\n\n\tpublic get raw() {\n\t\treturn this.value;\n\t}\n}\n","import type { Lexer } from '../../Lexer';\n\nexport class TokenStream implements Iterable<Token> {\n\tprivate readonly input: string;\n\tprivate readonly quotes: readonly [string, string][];\n\tprivate readonly separator: string;\n\tprivate position = 0;\n\n\tpublic constructor(lexer: Lexer, input: string) {\n\t\tthis.quotes = lexer.quotes;\n\t\tthis.separator = lexer.separator;\n\t\tthis.input = input;\n\t}\n\n\tpublic get finished() {\n\t\treturn this.position >= this.input.length;\n\t}\n\n\tpublic *[Symbol.iterator](): Iterator<Token> {\n\t\twhile (!this.finished) {\n\t\t\tyield this.getPossibleSeparator() ?? this.getPossibleQuotedArgument() ?? this.getParameter();\n\t\t}\n\t}\n\n\tprivate getPossibleSeparator(): SeparatorToken | null {\n\t\tif (this.input.startsWith(this.separator, this.position)) {\n\t\t\tthis.position += this.separator.length;\n\t\t\treturn { type: TokenType.Separator, value: this.separator };\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate getPossibleQuotedArgument(): QuotedToken | null {\n\t\tfor (const [open, close] of this.quotes) {\n\t\t\tif (!this.input.startsWith(open, this.position)) continue;\n\n\t\t\tconst end = this.input.indexOf(close, this.position + open.length);\n\t\t\tif (end === -1) continue;\n\n\t\t\tconst value = this.input.slice(this.position + open.length, end);\n\t\t\tthis.position = end + close.length;\n\n\t\t\treturn { type: TokenType.Quoted, value, open, close };\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate getParameter(): WordToken {\n\t\tconst index = this.input.indexOf(this.separator, this.position);\n\t\tconst value = index === -1 ? this.input.slice(this.position) : this.input.slice(this.position, index);\n\t\tthis.position += value.length;\n\t\treturn { type: TokenType.Parameter, value };\n\t}\n}\n\nexport enum TokenType {\n\tParameter,\n\tQuoted,\n\tSeparator\n}\n\nexport type Token = WordToken | QuotedToken | SeparatorToken;\n\nexport interface WordToken {\n\treadonly type: TokenType.Parameter;\n\treadonly value: string;\n}\n\nexport interface QuotedToken {\n\treadonly type: TokenType.Quoted;\n\treadonly value: string;\n\treadonly open: string;\n\treadonly close: string;\n}\n\nexport interface SeparatorToken {\n\treadonly type: TokenType.Separator;\n\treadonly value: string;\n}\n","import { QuotedParameter } from './parameters/QuotedParameter';\nimport { WordParameter } from './parameters/WordParameter';\nimport { TokenType, type Token } from './raw/TokenStream';\n\nexport class ParameterStream {\n\tprivate readonly stream: Iterable<Token>;\n\tprivate separators: string[] = [];\n\n\tpublic constructor(stream: Iterable<Token>) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic *[Symbol.iterator](): Iterator<Parameter, string[]> {\n\t\tfor (const part of this.stream) {\n\t\t\tif (part.type === TokenType.Separator) {\n\t\t\t\tthis.separators.push(part.value);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tyield part.type === TokenType.Quoted ? new QuotedParameter(this.separators, part) : new WordParameter(this.separators, part);\n\t\t\tthis.separators = [];\n\t\t}\n\n\t\treturn this.separators;\n\t}\n}\n\nexport type Parameter = QuotedParameter | WordParameter;\n","import { ParameterStream } from './streams/ParameterStream';\nimport { TokenStream } from './streams/raw/TokenStream';\n\nexport class Lexer {\n\tpublic readonly quotes: readonly [open: string, close: string][];\n\tpublic readonly separator: string;\n\n\tpublic constructor(options: Lexer.Options = {}) {\n\t\tthis.quotes = options.quotes ?? [];\n\t\tthis.separator = options.separator ?? ' ';\n\t}\n\n\tpublic run(input: string) {\n\t\treturn new ParameterStream(this.raw(input));\n\t}\n\n\tpublic raw(input: string) {\n\t\treturn new TokenStream(this, input);\n\t}\n}\n\nexport namespace Lexer {\n\texport interface Options {\n\t\tseparator?: string;\n\t\tquotes?: readonly [open: string, close: string][];\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\nimport type { Parser } from './Parser';\nimport type { IUnorderedStrategy } from './strategies/IUnorderedStrategy';\n\nexport class ParserResult {\n\tpublic readonly ordered: Parameter[] = [];\n\tpublic readonly flags = new Set<string>();\n\tpublic readonly options = new Map<string, string[]>();\n\tprivate readonly strategy: IUnorderedStrategy;\n\n\tpublic constructor(parser: Parser) {\n\t\tthis.strategy = parser.strategy;\n\t}\n\n\tpublic parse(parameters: Iterable<Parameter>) {\n\t\tfor (const parameter of parameters) {\n\t\t\tthis.parsePossibleFlag(parameter) || this.parsePossibleOptions(parameter) || this.parseOrdered(parameter);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\tprivate parsePossibleFlag(parameter: Parameter): boolean {\n\t\treturn this.strategy\n\t\t\t.matchFlag(parameter.value)\n\t\t\t.inspect((value) => this.flags.add(value))\n\t\t\t.isSome();\n\t}\n\n\tprivate parsePossibleOptions(parameter: Parameter): boolean {\n\t\treturn this.strategy\n\t\t\t.matchOption(parameter.value)\n\t\t\t.inspect(([key, value]) => {\n\t\t\t\tconst existing = this.options.get(key);\n\t\t\t\tif (existing) existing.push(value);\n\t\t\t\telse this.options.set(key, [value]);\n\t\t\t})\n\t\t\t.isSome();\n\t}\n\n\tprivate parseOrdered(parameter: Parameter): boolean {\n\t\tthis.ordered.push(parameter);\n\t\treturn true;\n\t}\n}\n","import { Option } from '@sapphire/result';\nimport type { IUnorderedStrategy } from './IUnorderedStrategy';\n\nexport class EmptyStrategy implements IUnorderedStrategy {\n\tpublic matchFlag(): Option<string> {\n\t\treturn Option.none;\n\t}\n\n\tpublic matchOption(): Option<readonly [key: string, value: string]> {\n\t\treturn Option.none;\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\nimport type { IUnorderedStrategy } from './strategies/IUnorderedStrategy';\nimport { ParserResult } from './ParserResult';\nimport { EmptyStrategy } from './strategies/EmptyStrategy';\n\nexport class Parser {\n\tpublic strategy: IUnorderedStrategy;\n\n\tpublic constructor(strategy?: IUnorderedStrategy) {\n\t\tthis.strategy = strategy ?? new EmptyStrategy();\n\t}\n\n\tpublic setUnorderedStrategy(strategy: IUnorderedStrategy) {\n\t\tthis.strategy = strategy;\n\t\treturn this;\n\t}\n\n\tpublic run(input: Iterable<Parameter>): ParserResult {\n\t\treturn new ParserResult(this).parse(input);\n\t}\n}\n","import { Option } from '@sapphire/result';\nimport type { IUnorderedStrategy } from './IUnorderedStrategy';\n\nexport class PrefixedStrategy implements IUnorderedStrategy {\n\tpublic readonly prefixes: readonly string[];\n\tpublic readonly separators: readonly string[];\n\n\tpublic constructor(prefixes: readonly string[], separators: readonly string[]) {\n\t\tthis.prefixes = prefixes;\n\t\tthis.separators = separators;\n\t}\n\n\tpublic matchFlag(input: string): Option<string> {\n\t\tconst prefix = this.prefixes.find((x) => input.startsWith(x));\n\n\t\t// If the prefix is missing, return None:\n\t\tif (!prefix) return Option.none;\n\n\t\t// If the separator is present, return None:\n\t\tif (this.separators.some((x) => input.includes(x, prefix.length))) return Option.none;\n\n\t\treturn Option.some(input.slice(prefix.length));\n\t}\n\n\tpublic matchOption(input: string): Option<readonly [key: string, value: string]> {\n\t\tconst prefix = this.prefixes.find((x) => input.startsWith(x));\n\n\t\t// If the prefix is missing, return None:\n\t\tif (!prefix) return Option.none;\n\n\t\tfor (const separator of this.separators) {\n\t\t\tconst index = input.indexOf(separator, prefix.length + 1);\n\n\t\t\t// If the separator is missing, skip:\n\t\t\tif (index === -1) continue;\n\n\t\t\t// If the separator is present, but has no value, return None:\n\t\t\tif (index + separator.length === input.length) return Option.none;\n\n\t\t\tconst key = input.slice(prefix.length, index);\n\t\t\tconst value = input.slice(index + separator.length);\n\t\t\treturn Option.some([key, value] as const);\n\t\t}\n\n\t\treturn Option.none;\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\n\n/**\n * Joins the parameters by their `leading` value, using the `value` property.\n * @seealso {@link joinRaw} for the version using `raw` instead of `value`.\n * @param parameters The parameters to join.\n * @returns The result of joining the parameters.\n */\nexport function join(parameters: readonly Parameter[]) {\n\tif (parameters.length === 0) return '';\n\tif (parameters.length === 1) return parameters[0].value;\n\n\tlet output = parameters[0].value;\n\tfor (let i = 1; i < parameters.length; i++) {\n\t\tconst parameter = parameters[i];\n\t\toutput += parameter.leading + parameter.value;\n\t}\n\n\treturn output;\n}\n\n/**\n * Joins the parameters by their `leading` value, using the `raw` property.\n * @seealso {@link join} for the version using `value` instead of `raw`.\n * @param parameters The parameters to join.\n * @returns The result of joining the parameters.\n */\nexport function joinRaw(parameters: readonly Parameter[]) {\n\tif (parameters.length === 0) return '';\n\tif (parameters.length === 1) return parameters[0].raw;\n\n\tlet output = parameters[0].raw;\n\tfor (let i = 1; i < parameters.length; i++) {\n\t\tconst parameter = parameters[i];\n\t\toutput += parameter.leading + parameter.raw;\n\t}\n\n\treturn output;\n}\n"]}
1
+ {"version":3,"sources":["../../src/lib/ArgumentStream.ts","../../src/lib/lexer/streams/parameters/BaseParameter.ts","../../src/lib/lexer/streams/parameters/QuotedParameter.ts","../../src/lib/lexer/streams/parameters/WordParameter.ts","../../src/lib/lexer/streams/raw/TokenStream.ts","../../src/lib/lexer/streams/ParameterStream.ts","../../src/lib/lexer/Lexer.ts","../../src/lib/parser/ParserResult.ts","../../src/lib/parser/strategies/EmptyStrategy.ts","../../src/lib/parser/Parser.ts","../../src/lib/parser/strategies/PrefixedStrategy.ts","../../src/lib/util/util.ts"],"names":["Option","result","Result","TokenType"],"mappings":";;;;;;;;AAIO,IAAM,eAAA,GAAN,MAAM,eAAe,CAAA;AAAA,EAIpB,YAAY,OAAuB,EAAA;AAH1C,IAAgB,aAAA,CAAA,IAAA,EAAA,SAAA,CAAA,CAAA;AAChB,IAAO,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA,CAAA;AAGN,IAAA,IAAA,CAAK,OAAU,GAAA,OAAA,CAAA;AACf,IAAA,IAAA,CAAK,QAAQ,EAAE,IAAA,sBAAU,GAAI,EAAA,EAAG,UAAU,CAAE,EAAA,CAAA;AAAA,GAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,QAAW,GAAA;AACrB,IAAO,OAAA,IAAA,CAAK,SAAS,IAAK,CAAA,MAAA,CAAA;AAAA,GAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,MAAS,GAAA;AACnB,IAAO,OAAA,IAAA,CAAK,QAAQ,OAAQ,CAAA,MAAA,CAAA;AAAA,GAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,SAAY,GAAA;AACtB,IAAO,OAAA,IAAA,CAAK,SAAS,IAAK,CAAA,IAAA,CAAA;AAAA,GAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAW,IAAO,GAAA;AACjB,IAAO,OAAA,IAAA,CAAK,MAAM,IAAK,CAAA,IAAA,CAAA;AAAA,GACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBO,MAAyB,GAAA;AAC/B,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,OAAO,KAAK,KAAM,CAAA,IAAA,CAAK,IAAI,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAG,EAAA;AAChD,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,GAAI,CAAA,IAAA,CAAK,MAAM,QAAQ,CAAA,CAAA;AACvC,IAAO,OAAAA,aAAA,CAAO,KAAK,IAAK,CAAA,OAAA,CAAQ,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAU,EAAA,CAAA,CAAE,KAAK,CAAA,CAAA;AAAA,GACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkCO,SAAA,CAAa,SAAyC,EAAA,UAAA,GAAa,KAAkB,EAAA;AAC3F,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,OAAO,KAAK,KAAM,CAAA,IAAA,CAAK,IAAI,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAG,EAAA;AAChD,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAM,MAAAC,QAAA,GAAS,UAAU,IAAK,CAAA,OAAA,CAAQ,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAA,CAAE,KAAK,CAAA,CAAA;AACxE,IAAI,IAAAA,QAAA,CAAO,MAAO,EAAA,IAAK,UAAY,EAAA;AAClC,MAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,GAAI,CAAA,IAAA,CAAK,MAAM,QAAQ,CAAA,CAAA;AACvC,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAO,OAAAA,QAAA,CAAA;AAAA,GACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAa,cAAA,CAAkB,SAAkD,EAAA,UAAA,GAAa,KAA2B,EAAA;AACxH,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOD,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,OAAO,KAAK,KAAM,CAAA,IAAA,CAAK,IAAI,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAG,EAAA;AAChD,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAM,MAAAC,QAAA,GAAS,MAAM,SAAA,CAAU,IAAK,CAAA,OAAA,CAAQ,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAA,CAAE,KAAK,CAAA,CAAA;AAC9E,IAAI,IAAAA,QAAA,CAAO,MAAO,EAAA,IAAK,UAAY,EAAA;AAClC,MAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,GAAI,CAAA,IAAA,CAAK,MAAM,QAAQ,CAAA,CAAA;AACvC,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAO,OAAAA,QAAA,CAAA;AAAA,GACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsCO,WAAA,CAAkB,SAA4C,EAAA,UAAA,GAAa,KAA4B,EAAA;AAC7G,IAAA,IAAI,IAAK,CAAA,QAAA,EAAiB,OAAAC,aAAA,CAAO,IAAI,IAAI,CAAA,CAAA;AAEzC,IAAA,OAAO,KAAK,KAAM,CAAA,IAAA,CAAK,IAAI,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAG,EAAA;AAChD,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAM,MAAAD,QAAA,GAAS,UAAU,IAAK,CAAA,OAAA,CAAQ,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAA,CAAE,KAAK,CAAA,CAAA;AACxE,IAAI,IAAAA,QAAA,CAAO,IAAK,EAAA,IAAK,UAAY,EAAA;AAChC,MAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,GAAI,CAAA,IAAA,CAAK,MAAM,QAAQ,CAAA,CAAA;AACvC,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAO,OAAAA,QAAA,CAAA;AAAA,GACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAa,gBAAA,CAAuB,SAAqD,EAAA,UAAA,GAAa,KAAqC,EAAA;AAC1I,IAAA,IAAI,IAAK,CAAA,QAAA,EAAiB,OAAAC,aAAA,CAAO,IAAI,IAAI,CAAA,CAAA;AAEzC,IAAA,OAAO,KAAK,KAAM,CAAA,IAAA,CAAK,IAAI,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAG,EAAA;AAChD,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAM,MAAAD,QAAA,GAAS,MAAM,SAAA,CAAU,IAAK,CAAA,OAAA,CAAQ,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAQ,CAAA,CAAE,KAAK,CAAA,CAAA;AAC9E,IAAI,IAAAA,QAAA,CAAO,IAAK,EAAA,IAAK,UAAY,EAAA;AAChC,MAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,GAAI,CAAA,IAAA,CAAK,MAAM,QAAQ,CAAA,CAAA;AACvC,MAAA,EAAE,KAAK,KAAM,CAAA,QAAA,CAAA;AAAA,KACd;AAEA,IAAO,OAAAA,QAAA,CAAA;AAAA,GACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBO,IAAK,CAAA,SAAA,EAAuC,IAAO,GAAA,IAAA,CAAK,MAAM,QAA0B,EAAA;AAC9F,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAI,IAAA,SAAA,CAAU,SAAS,CAAG,EAAA;AACzB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAAD,aAAA,CAAO,KAAK,SAAS,CAAA,CAAA;AAAA,OAC7B;AAAA,KACD;AAEA,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,MAAa,SAAU,CAAA,SAAA,EAAgD,IAAO,GAAA,IAAA,CAAK,MAAM,QAAmC,EAAA;AAC3H,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAI,IAAA,MAAM,SAAU,CAAA,SAAS,CAAG,EAAA;AAC/B,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAAA,aAAA,CAAO,KAAK,SAAS,CAAA,CAAA;AAAA,OAC7B;AAAA,KACD;AAEA,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBO,OAAW,CAAA,SAAA,EAAyC,IAAO,GAAA,IAAA,CAAK,MAAM,QAAqB,EAAA;AACjG,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,UAAU,SAAS,CAAA,CAAA;AAClC,MAAI,IAAA,MAAA,CAAO,QAAU,EAAA;AACpB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAA,MAAA,CAAA;AAAA,OACR;AAAA,KACD;AAEA,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,MAAa,YAAgB,CAAA,SAAA,EAAkD,IAAO,GAAA,IAAA,CAAK,MAAM,QAA8B,EAAA;AAC9H,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,MAAM,SAAA,CAAU,SAAS,CAAA,CAAA;AACxC,MAAI,IAAA,MAAA,CAAO,QAAU,EAAA;AACpB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAA,MAAA,CAAA;AAAA,OACR;AAAA,KACD;AAEA,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuCO,SAAgB,CAAA,SAAA,EAA4C,IAAO,GAAA,IAAA,CAAK,MAAM,QAA0B,EAAA;AAC9G,IAAA,MAAM,SAAc,EAAC,CAAA;AACrB,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,UAAU,SAAS,CAAA,CAAA;AAClC,MAAI,IAAA,MAAA,CAAO,MAAQ,EAAA;AAClB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAA,MAAA,CAAA;AAAA,OACR;AAEA,MAAO,MAAA,CAAA,IAAA,CAAK,MAAO,CAAA,SAAA,EAAW,CAAA,CAAA;AAAA,KAC/B;AAEA,IAAO,OAAAE,aAAA,CAAO,IAAI,MAAM,CAAA,CAAA;AAAA,GACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAa,cAAqB,CAAA,SAAA,EAAqD,IAAO,GAAA,IAAA,CAAK,MAAM,QAAmC,EAAA;AAC3I,IAAA,MAAM,SAAc,EAAC,CAAA;AACrB,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,MAAM,SAAA,CAAU,SAAS,CAAA,CAAA;AACxC,MAAI,IAAA,MAAA,CAAO,MAAQ,EAAA;AAClB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAO,OAAA,MAAA,CAAA;AAAA,OACR;AAEA,MAAO,MAAA,CAAA,IAAA,CAAK,MAAO,CAAA,SAAA,EAAW,CAAA,CAAA;AAAA,KAC/B;AAEA,IAAO,OAAAA,aAAA,CAAO,IAAI,MAAM,CAAA,CAAA;AAAA,GACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBO,KAAK,KAAQ,GAAA,QAAA,EAAU,IAAO,GAAA,IAAA,CAAK,MAAM,QAA+B,EAAA;AAC9E,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOF,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,MAAM,aAA0B,EAAC,CAAA;AACjC,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AAExC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAG5B,MAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,MAAA,UAAA,CAAW,IAAK,CAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA;AAGvC,MAAI,IAAA,UAAA,CAAW,UAAU,KAAO,EAAA,MAAA;AAAA,KACjC;AAEA,IAAA,OAAO,WAAW,MAAS,GAAAA,aAAA,CAAO,IAAK,CAAA,UAAU,IAAIA,aAAO,CAAA,IAAA,CAAA;AAAA,GAC7D;AAAA,EAEO,MAAO,CAAA,SAAA,EAAuC,IAAO,GAAA,IAAA,CAAK,MAAM,QAA4B,EAAA;AAClG,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,MAAM,aAAuB,EAAC,CAAA;AAC9B,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAI,IAAA,SAAA,CAAU,SAAS,CAAG,EAAA;AACzB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAA,UAAA,CAAW,KAAK,SAAS,CAAA,CAAA;AAAA,OAC1B;AAAA,KACD;AAEA,IAAO,OAAAA,aAAA,CAAO,KAAK,UAAU,CAAA,CAAA;AAAA,GAC9B;AAAA,EAEA,MAAa,WAAY,CAAA,SAAA,EAAgD,IAAO,GAAA,IAAA,CAAK,MAAM,QAAqC,EAAA;AAC/H,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,MAAM,aAAuB,EAAC,CAAA;AAC9B,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAI,IAAA,MAAM,SAAU,CAAA,SAAS,CAAG,EAAA;AAC/B,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAA,UAAA,CAAW,KAAK,SAAS,CAAA,CAAA;AAAA,OAC1B;AAAA,KACD;AAEA,IAAO,OAAAA,aAAA,CAAO,KAAK,UAAU,CAAA,CAAA;AAAA,GAC9B;AAAA,EAEO,SAAa,CAAA,SAAA,EAAyC,IAAO,GAAA,IAAA,CAAK,MAAM,QAAuB,EAAA;AACrG,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,MAAM,aAAkB,EAAC,CAAA;AACzB,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,UAAU,SAAS,CAAA,CAAA;AAClC,MAAO,MAAA,CAAA,OAAA,CAAQ,CAAC,KAAU,KAAA;AACzB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAA,UAAA,CAAW,KAAK,KAAK,CAAA,CAAA;AAAA,OACrB,CAAA,CAAA;AAAA,KACF;AAEA,IAAO,OAAAA,aAAA,CAAO,KAAK,UAAU,CAAA,CAAA;AAAA,GAC9B;AAAA,EAEA,MAAa,cAAkB,CAAA,SAAA,EAAkD,IAAO,GAAA,IAAA,CAAK,MAAM,QAAgC,EAAA;AAClI,IAAI,IAAA,IAAA,CAAK,QAAU,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAEjC,IAAA,MAAM,aAAkB,EAAC,CAAA;AACzB,IAAA,KAAA,IAAS,IAAI,IAAM,EAAA,CAAA,GAAI,IAAK,CAAA,MAAA,EAAQ,EAAE,CAAG,EAAA;AACxC,MAAA,IAAI,IAAK,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAG,EAAA,SAAA;AAE5B,MAAA,MAAM,SAAY,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,CAAC,CAAE,CAAA,KAAA,CAAA;AAC1C,MAAM,MAAA,MAAA,GAAS,MAAM,SAAA,CAAU,SAAS,CAAA,CAAA;AACxC,MAAO,MAAA,CAAA,OAAA,CAAQ,CAAC,KAAU,KAAA;AACzB,QAAK,IAAA,CAAA,KAAA,CAAM,IAAK,CAAA,GAAA,CAAI,CAAC,CAAA,CAAA;AACrB,QAAA,UAAA,CAAW,KAAK,KAAK,CAAA,CAAA;AAAA,OACrB,CAAA,CAAA;AAAA,KACF;AAEA,IAAO,OAAAA,aAAA,CAAO,KAAK,UAAU,CAAA,CAAA;AAAA,GAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBO,QAAQ,IAAkC,EAAA;AAChD,IAAO,OAAA,IAAA,CAAK,KAAK,CAAC,GAAA,KAAQ,KAAK,OAAQ,CAAA,KAAA,CAAM,GAAI,CAAA,GAAG,CAAC,CAAA,CAAA;AAAA,GACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBO,UAAU,IAAyC,EAAA;AACzD,IAAO,OAAA,IAAA,CAAK,OAAQ,CAAA,GAAG,IAAI,CAAA,CAAE,GAAI,CAAA,CAAC,MAAW,KAAA,MAAA,CAAO,EAAG,CAAA,CAAA,CAAE,CAAE,CAAA,CAAA;AAAA,GAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBO,WAAW,IAAoD,EAAA;AACrE,IAAA,MAAM,UAAoB,EAAC,CAAA;AAC3B,IAAA,KAAA,MAAW,OAAO,IAAM,EAAA;AACvB,MAAA,MAAM,MAAS,GAAA,IAAA,CAAK,OAAQ,CAAA,OAAA,CAAQ,IAAI,GAAG,CAAA,CAAA;AAC3C,MAAA,IAAI,MAAQ,EAAA,OAAA,CAAQ,IAAK,CAAA,GAAG,MAAM,CAAA,CAAA;AAAA,KACnC;AAEA,IAAA,OAAO,QAAQ,MAAS,GAAAA,aAAA,CAAO,IAAK,CAAA,OAAO,IAAIA,aAAO,CAAA,IAAA,CAAA;AAAA,GACvD;AAAA,EAEO,IAA6B,GAAA;AACnC,IAAO,OAAA;AAAA,MACN,IAAM,EAAA,IAAI,GAAI,CAAA,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,MAC7B,QAAA,EAAU,KAAK,KAAM,CAAA,QAAA;AAAA,KACtB,CAAA;AAAA,GACD;AAAA,EAEO,QAAQ,KAA6B,EAAA;AAC3C,IAAA,IAAA,CAAK,KAAQ,GAAA,KAAA,CAAA;AAAA,GACd;AAAA,EAEO,KAAQ,GAAA;AACd,IAAK,IAAA,CAAA,OAAA,CAAQ,EAAE,IAAM,kBAAA,IAAI,KAAO,EAAA,QAAA,EAAU,GAAG,CAAA,CAAA;AAAA,GAC9C;AACD,CAAA,CAAA;AA5oB4B,MAAA,CAAA,eAAA,EAAA,gBAAA,CAAA,CAAA;AAArB,IAAM,cAAN,GAAA,gBAAA;;;ACJA,IAAe,cAAA,GAAf,MAAe,cAAc,CAAA;AAAA,EAG5B,YAAY,UAA+B,EAAA;AAFlD,IAAgB,aAAA,CAAA,IAAA,EAAA,YAAA,CAAA,CAAA;AAGf,IAAA,IAAA,CAAK,UAAa,GAAA,UAAA,CAAA;AAAA,GACnB;AAAA,EAEA,IAAW,OAAkB,GAAA;AAC5B,IAAO,OAAA,IAAA,CAAK,UAAW,CAAA,IAAA,CAAK,EAAE,CAAA,CAAA;AAAA,GAC/B;AAGD,CAAA,CAAA;AAZoC,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA,CAAA;AAA7B,IAAe,aAAf,GAAA,eAAA;;;ACGA,IAAM,gBAAA,GAAN,MAAM,gBAAA,SAAwB,aAAc,CAAA;AAAA,EAK3C,WAAA,CAAY,YAA+B,IAAiC,EAAA;AAClF,IAAA,KAAA,CAAM,UAAU,CAAA,CAAA;AALjB,IAAgB,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA,CAAA;AAChB,IAAgB,aAAA,CAAA,IAAA,EAAA,MAAA,CAAA,CAAA;AAChB,IAAgB,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA,CAAA;AAIf,IAAA,IAAA,CAAK,QAAQ,IAAK,CAAA,KAAA,CAAA;AAClB,IAAA,IAAA,CAAK,OAAO,IAAK,CAAA,IAAA,CAAA;AACjB,IAAA,IAAA,CAAK,QAAQ,IAAK,CAAA,KAAA,CAAA;AAAA,GACnB;AAAA,EAEA,IAAW,GAAM,GAAA;AAChB,IAAO,OAAA,CAAA,EAAG,KAAK,IAAI,CAAA,EAAG,KAAK,KAAK,CAAA,EAAG,KAAK,KAAK,CAAA,CAAA,CAAA;AAAA,GAC9C;AACD,CAAA,CAAA;AAfmD,MAAA,CAAA,gBAAA,EAAA,iBAAA,CAAA,CAAA;AAA5C,IAAM,eAAN,GAAA,iBAAA;;;ACAA,IAAM,cAAA,GAAN,MAAM,cAAA,SAAsB,aAAc,CAAA;AAAA,EAGzC,WAAA,CAAY,YAA+B,IAA+B,EAAA;AAChF,IAAA,KAAA,CAAM,UAAU,CAAA,CAAA;AAHjB,IAAgB,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA,CAAA;AAIf,IAAA,IAAA,CAAK,QAAQ,IAAK,CAAA,KAAA,CAAA;AAAA,GACnB;AAAA,EAEA,IAAW,GAAM,GAAA;AAChB,IAAA,OAAO,IAAK,CAAA,KAAA,CAAA;AAAA,GACb;AACD,CAAA,CAAA;AAXiD,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA,CAAA;AAA1C,IAAM,aAAN,GAAA,eAAA;;;ACDA,IAAM,YAAA,GAAN,MAAM,YAAuC,CAAA;AAAA,EAM5C,WAAA,CAAY,OAAc,KAAe,EAAA;AALhD,IAAiB,aAAA,CAAA,IAAA,EAAA,OAAA,CAAA,CAAA;AACjB,IAAiB,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA,CAAA;AACjB,IAAiB,aAAA,CAAA,IAAA,EAAA,WAAA,CAAA,CAAA;AACjB,IAAA,aAAA,CAAA,IAAA,EAAQ,UAAW,EAAA,CAAA,CAAA,CAAA;AAGlB,IAAA,IAAA,CAAK,SAAS,KAAM,CAAA,MAAA,CAAA;AACpB,IAAA,IAAA,CAAK,YAAY,KAAM,CAAA,SAAA,CAAA;AACvB,IAAA,IAAA,CAAK,KAAQ,GAAA,KAAA,CAAA;AAAA,GACd;AAAA,EAEA,IAAW,QAAW,GAAA;AACrB,IAAO,OAAA,IAAA,CAAK,QAAY,IAAA,IAAA,CAAK,KAAM,CAAA,MAAA,CAAA;AAAA,GACpC;AAAA,EAEA,EAAS,MAAO,CAAA,QAAQ,CAAqB,GAAA;AAC5C,IAAO,OAAA,CAAC,KAAK,QAAU,EAAA;AACtB,MAAA,MAAM,KAAK,oBAAqB,EAAA,IAAK,KAAK,yBAA0B,EAAA,IAAK,KAAK,YAAa,EAAA,CAAA;AAAA,KAC5F;AAAA,GACD;AAAA,EAEQ,oBAA8C,GAAA;AACrD,IAAA,IAAI,KAAK,KAAM,CAAA,UAAA,CAAW,KAAK,SAAW,EAAA,IAAA,CAAK,QAAQ,CAAG,EAAA;AACzD,MAAK,IAAA,CAAA,QAAA,IAAY,KAAK,SAAU,CAAA,MAAA,CAAA;AAChC,MAAA,OAAO,EAAE,IAAA,EAAM,CAAqB,kBAAA,KAAA,EAAO,KAAK,SAAU,EAAA,CAAA;AAAA,KAC3D;AAEA,IAAO,OAAA,IAAA,CAAA;AAAA,GACR;AAAA,EAEQ,yBAAgD,GAAA;AACvD,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,KAAK,CAAA,IAAK,KAAK,MAAQ,EAAA;AACxC,MAAA,IAAI,CAAC,IAAK,CAAA,KAAA,CAAM,WAAW,IAAM,EAAA,IAAA,CAAK,QAAQ,CAAG,EAAA,SAAA;AAEjD,MAAM,MAAA,GAAA,GAAM,KAAK,KAAM,CAAA,OAAA,CAAQ,OAAO,IAAK,CAAA,QAAA,GAAW,KAAK,MAAM,CAAA,CAAA;AACjE,MAAA,IAAI,QAAQ,CAAI,CAAA,EAAA,SAAA;AAEhB,MAAM,MAAA,KAAA,GAAQ,KAAK,KAAM,CAAA,KAAA,CAAM,KAAK,QAAW,GAAA,IAAA,CAAK,QAAQ,GAAG,CAAA,CAAA;AAC/D,MAAK,IAAA,CAAA,QAAA,GAAW,MAAM,KAAM,CAAA,MAAA,CAAA;AAE5B,MAAA,OAAO,EAAE,IAAA,EAAM,CAAkB,eAAA,KAAA,EAAO,MAAM,KAAM,EAAA,CAAA;AAAA,KACrD;AAEA,IAAO,OAAA,IAAA,CAAA;AAAA,GACR;AAAA,EAEQ,YAA0B,GAAA;AACjC,IAAA,MAAM,QAAQ,IAAK,CAAA,KAAA,CAAM,QAAQ,IAAK,CAAA,SAAA,EAAW,KAAK,QAAQ,CAAA,CAAA;AAC9D,IAAA,MAAM,KAAQ,GAAA,KAAA,KAAU,CAAK,CAAA,GAAA,IAAA,CAAK,MAAM,KAAM,CAAA,IAAA,CAAK,QAAQ,CAAA,GAAI,IAAK,CAAA,KAAA,CAAM,KAAM,CAAA,IAAA,CAAK,UAAU,KAAK,CAAA,CAAA;AACpG,IAAA,IAAA,CAAK,YAAY,KAAM,CAAA,MAAA,CAAA;AACvB,IAAO,OAAA,EAAE,IAAM,EAAA,CAAA,kBAAqB,KAAM,EAAA,CAAA;AAAA,GAC3C;AACD,CAAA,CAAA;AArDoD,MAAA,CAAA,YAAA,EAAA,aAAA,CAAA,CAAA;AAA7C,IAAM,WAAN,GAAA,aAAA;AAuDK,IAAA,SAAA,qBAAAG,UAAL,KAAA;AACN,EAAAA,UAAA,CAAA,UAAA,CAAA,WAAA,CAAA,GAAA,CAAA,CAAA,GAAA,WAAA,CAAA;AACA,EAAAA,UAAA,CAAA,UAAA,CAAA,QAAA,CAAA,GAAA,CAAA,CAAA,GAAA,QAAA,CAAA;AACA,EAAAA,UAAA,CAAA,UAAA,CAAA,WAAA,CAAA,GAAA,CAAA,CAAA,GAAA,WAAA,CAAA;AAHW,EAAAA,OAAAA,UAAAA,CAAAA;AAAA,CAAA,EAAA,SAAA,IAAA,EAAA,EAAA;;;ACrDL,IAAM,gBAAA,GAAN,MAAM,gBAAgB,CAAA;AAAA,EAIrB,YAAY,MAAyB,EAAA;AAH5C,IAAiB,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA,CAAA;AACjB,IAAA,aAAA,CAAA,IAAA,EAAQ,cAAuB,EAAC,CAAA,CAAA;AAG/B,IAAA,IAAA,CAAK,MAAS,GAAA,MAAA,CAAA;AAAA,GACf;AAAA,EAEA,EAAS,MAAO,CAAA,QAAQ,CAAmC,GAAA;AAC1D,IAAW,KAAA,MAAA,IAAA,IAAQ,KAAK,MAAQ,EAAA;AAC/B,MAAA,IAAI,KAAK,IAA8B,KAAA,CAAA,kBAAA;AACtC,QAAK,IAAA,CAAA,UAAA,CAAW,IAAK,CAAA,IAAA,CAAK,KAAK,CAAA,CAAA;AAC/B,QAAA,SAAA;AAAA,OACD;AAEA,MAAA,MAAM,IAAK,CAAA,IAAA,KAAA,CAAA,gBAA4B,IAAI,eAAA,CAAgB,IAAK,CAAA,UAAA,EAAY,IAAI,CAAA,GAAI,IAAI,aAAA,CAAc,IAAK,CAAA,UAAA,EAAY,IAAI,CAAA,CAAA;AAC3H,MAAA,IAAA,CAAK,aAAa,EAAC,CAAA;AAAA,KACpB;AAEA,IAAA,OAAO,IAAK,CAAA,UAAA,CAAA;AAAA,GACb;AACD,CAAA,CAAA;AArB6B,MAAA,CAAA,gBAAA,EAAA,iBAAA,CAAA,CAAA;AAAtB,IAAM,eAAN,GAAA,iBAAA;;;ACDA,IAAM,MAAA,GAAN,MAAM,MAAM,CAAA;AAAA,EAIX,WAAA,CAAY,OAAyB,GAAA,EAAI,EAAA;AAHhD,IAAgB,aAAA,CAAA,IAAA,EAAA,QAAA,CAAA,CAAA;AAChB,IAAgB,aAAA,CAAA,IAAA,EAAA,WAAA,CAAA,CAAA;AAGf,IAAK,IAAA,CAAA,MAAA,GAAS,OAAQ,CAAA,MAAA,IAAU,EAAC,CAAA;AACjC,IAAK,IAAA,CAAA,SAAA,GAAY,QAAQ,SAAa,IAAA,GAAA,CAAA;AAAA,GACvC;AAAA,EAEO,IAAI,KAAe,EAAA;AACzB,IAAA,OAAO,IAAI,eAAA,CAAgB,IAAK,CAAA,GAAA,CAAI,KAAK,CAAC,CAAA,CAAA;AAAA,GAC3C;AAAA,EAEO,IAAI,KAAe,EAAA;AACzB,IAAO,OAAA,IAAI,WAAY,CAAA,IAAA,EAAM,KAAK,CAAA,CAAA;AAAA,GACnC;AACD,CAAA,CAAA;AAhBmB,MAAA,CAAA,MAAA,EAAA,OAAA,CAAA,CAAA;AAAZ,IAAM,KAAN,GAAA,OAAA;;;ACCA,IAAM,aAAA,GAAN,MAAM,aAAa,CAAA;AAAA,EAMlB,YAAY,MAAgB,EAAA;AALnC,IAAA,aAAA,CAAA,IAAA,EAAgB,WAAuB,EAAC,CAAA,CAAA;AACxC,IAAgB,aAAA,CAAA,IAAA,EAAA,OAAA,sBAAY,GAAY,EAAA,CAAA,CAAA;AACxC,IAAgB,aAAA,CAAA,IAAA,EAAA,SAAA,sBAAc,GAAsB,EAAA,CAAA,CAAA;AACpD,IAAiB,aAAA,CAAA,IAAA,EAAA,UAAA,CAAA,CAAA;AAGhB,IAAA,IAAA,CAAK,WAAW,MAAO,CAAA,QAAA,CAAA;AAAA,GACxB;AAAA,EAEO,MAAM,UAAiC,EAAA;AAC7C,IAAA,KAAA,MAAW,aAAa,UAAY,EAAA;AACnC,MAAK,IAAA,CAAA,iBAAA,CAAkB,SAAS,CAAK,IAAA,IAAA,CAAK,qBAAqB,SAAS,CAAA,IAAK,IAAK,CAAA,YAAA,CAAa,SAAS,CAAA,CAAA;AAAA,KACzG;AAEA,IAAO,OAAA,IAAA,CAAA;AAAA,GACR;AAAA,EAEQ,kBAAkB,SAA+B,EAAA;AACxD,IAAA,OAAO,IAAK,CAAA,QAAA,CACV,SAAU,CAAA,SAAA,CAAU,KAAK,CACzB,CAAA,OAAA,CAAQ,CAAC,KAAA,KAAU,KAAK,KAAM,CAAA,GAAA,CAAI,KAAK,CAAC,EACxC,MAAO,EAAA,CAAA;AAAA,GACV;AAAA,EAEQ,qBAAqB,SAA+B,EAAA;AAC3D,IAAO,OAAA,IAAA,CAAK,QACV,CAAA,WAAA,CAAY,SAAU,CAAA,KAAK,CAC3B,CAAA,OAAA,CAAQ,CAAC,CAAC,GAAK,EAAA,KAAK,CAAM,KAAA;AAC1B,MAAA,MAAM,QAAW,GAAA,IAAA,CAAK,OAAQ,CAAA,GAAA,CAAI,GAAG,CAAA,CAAA;AACrC,MAAI,IAAA,QAAA,EAAmB,QAAA,CAAA,IAAA,CAAK,KAAK,CAAA,CAAA;AAAA,gBACvB,OAAQ,CAAA,GAAA,CAAI,GAAK,EAAA,CAAC,KAAK,CAAC,CAAA,CAAA;AAAA,KAClC,EACA,MAAO,EAAA,CAAA;AAAA,GACV;AAAA,EAEQ,aAAa,SAA+B,EAAA;AACnD,IAAK,IAAA,CAAA,OAAA,CAAQ,KAAK,SAAS,CAAA,CAAA;AAC3B,IAAO,OAAA,IAAA,CAAA;AAAA,GACR;AACD,CAAA,CAAA;AAxC0B,MAAA,CAAA,aAAA,EAAA,cAAA,CAAA,CAAA;AAAnB,IAAM,YAAN,GAAA,cAAA;ACDA,IAAM,cAAA,GAAN,MAAM,cAA4C,CAAA;AAAA,EACjD,SAA4B,GAAA;AAClC,IAAA,OAAOH,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AAAA,EAEO,WAA6D,GAAA;AACnE,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AACD,CAAA,CAAA;AARyD,MAAA,CAAA,cAAA,EAAA,eAAA,CAAA,CAAA;AAAlD,IAAM,aAAN,GAAA,eAAA;;;ACEA,IAAM,OAAA,GAAN,MAAM,OAAO,CAAA;AAAA,EAGZ,YAAY,QAA+B,EAAA;AAFlD,IAAO,aAAA,CAAA,IAAA,EAAA,UAAA,CAAA,CAAA;AAGN,IAAK,IAAA,CAAA,QAAA,GAAW,QAAY,IAAA,IAAI,aAAc,EAAA,CAAA;AAAA,GAC/C;AAAA,EAEO,qBAAqB,QAA8B,EAAA;AACzD,IAAA,IAAA,CAAK,QAAW,GAAA,QAAA,CAAA;AAChB,IAAO,OAAA,IAAA,CAAA;AAAA,GACR;AAAA,EAEO,IAAI,KAA0C,EAAA;AACpD,IAAA,OAAO,IAAI,YAAA,CAAa,IAAI,CAAA,CAAE,MAAM,KAAK,CAAA,CAAA;AAAA,GAC1C;AACD,CAAA,CAAA;AAfoB,MAAA,CAAA,OAAA,EAAA,QAAA,CAAA,CAAA;AAAb,IAAM,MAAN,GAAA,QAAA;ACFA,IAAM,iBAAA,GAAN,MAAM,iBAA+C,CAAA;AAAA,EAIpD,WAAA,CAAY,UAA6B,UAA+B,EAAA;AAH/E,IAAgB,aAAA,CAAA,IAAA,EAAA,UAAA,CAAA,CAAA;AAChB,IAAgB,aAAA,CAAA,IAAA,EAAA,YAAA,CAAA,CAAA;AAGf,IAAA,IAAA,CAAK,QAAW,GAAA,QAAA,CAAA;AAChB,IAAA,IAAA,CAAK,UAAa,GAAA,UAAA,CAAA;AAAA,GACnB;AAAA,EAEO,UAAU,KAA+B,EAAA;AAC/C,IAAM,MAAA,MAAA,GAAS,KAAK,QAAS,CAAA,IAAA,CAAK,CAAC,CAAM,KAAA,KAAA,CAAM,UAAW,CAAA,CAAC,CAAC,CAAA,CAAA;AAG5D,IAAI,IAAA,CAAC,MAAQ,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAG3B,IAAA,IAAI,IAAK,CAAA,UAAA,CAAW,IAAK,CAAA,CAAC,CAAM,KAAA,KAAA,CAAM,QAAS,CAAA,CAAA,EAAG,MAAO,CAAA,MAAM,CAAC,CAAA,SAAUA,aAAO,CAAA,IAAA,CAAA;AAEjF,IAAA,OAAOA,cAAO,IAAK,CAAA,KAAA,CAAM,KAAM,CAAA,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA;AAAA,GAC9C;AAAA,EAEO,YAAY,KAA8D,EAAA;AAChF,IAAM,MAAA,MAAA,GAAS,KAAK,QAAS,CAAA,IAAA,CAAK,CAAC,CAAM,KAAA,KAAA,CAAM,UAAW,CAAA,CAAC,CAAC,CAAA,CAAA;AAG5D,IAAI,IAAA,CAAC,MAAQ,EAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAE3B,IAAW,KAAA,MAAA,SAAA,IAAa,KAAK,UAAY,EAAA;AACxC,MAAA,MAAM,QAAQ,KAAM,CAAA,OAAA,CAAQ,SAAW,EAAA,MAAA,CAAO,SAAS,CAAC,CAAA,CAAA;AAGxD,MAAA,IAAI,UAAU,CAAI,CAAA,EAAA,SAAA;AAGlB,MAAA,IAAI,QAAQ,SAAU,CAAA,MAAA,KAAW,KAAM,CAAA,MAAA,SAAeA,aAAO,CAAA,IAAA,CAAA;AAE7D,MAAA,MAAM,GAAM,GAAA,KAAA,CAAM,KAAM,CAAA,MAAA,CAAO,QAAQ,KAAK,CAAA,CAAA;AAC5C,MAAA,MAAM,KAAQ,GAAA,KAAA,CAAM,KAAM,CAAA,KAAA,GAAQ,UAAU,MAAM,CAAA,CAAA;AAClD,MAAA,OAAOA,aAAO,CAAA,IAAA,CAAK,CAAC,GAAA,EAAK,KAAK,CAAU,CAAA,CAAA;AAAA,KACzC;AAEA,IAAA,OAAOA,aAAO,CAAA,IAAA,CAAA;AAAA,GACf;AACD,CAAA,CAAA;AA3C4D,MAAA,CAAA,iBAAA,EAAA,kBAAA,CAAA,CAAA;AAArD,IAAM,gBAAN,GAAA,kBAAA;;;ACKA,SAAS,KAAK,UAAkC,EAAA;AACtD,EAAI,IAAA,UAAA,CAAW,MAAW,KAAA,CAAA,EAAU,OAAA,EAAA,CAAA;AACpC,EAAA,IAAI,WAAW,MAAW,KAAA,CAAA,EAAU,OAAA,UAAA,CAAW,CAAC,CAAE,CAAA,KAAA,CAAA;AAElD,EAAI,IAAA,MAAA,GAAS,UAAW,CAAA,CAAC,CAAE,CAAA,KAAA,CAAA;AAC3B,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,UAAA,CAAW,QAAQ,CAAK,EAAA,EAAA;AAC3C,IAAM,MAAA,SAAA,GAAY,WAAW,CAAC,CAAA,CAAA;AAC9B,IAAU,MAAA,IAAA,SAAA,CAAU,UAAU,SAAU,CAAA,KAAA,CAAA;AAAA,GACzC;AAEA,EAAO,OAAA,MAAA,CAAA;AACR,CAAA;AAXgB,MAAA,CAAA,IAAA,EAAA,MAAA,CAAA,CAAA;AAmBT,SAAS,QAAQ,UAAkC,EAAA;AACzD,EAAI,IAAA,UAAA,CAAW,MAAW,KAAA,CAAA,EAAU,OAAA,EAAA,CAAA;AACpC,EAAA,IAAI,WAAW,MAAW,KAAA,CAAA,EAAU,OAAA,UAAA,CAAW,CAAC,CAAE,CAAA,GAAA,CAAA;AAElD,EAAI,IAAA,MAAA,GAAS,UAAW,CAAA,CAAC,CAAE,CAAA,GAAA,CAAA;AAC3B,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,UAAA,CAAW,QAAQ,CAAK,EAAA,EAAA;AAC3C,IAAM,MAAA,SAAA,GAAY,WAAW,CAAC,CAAA,CAAA;AAC9B,IAAU,MAAA,IAAA,SAAA,CAAU,UAAU,SAAU,CAAA,GAAA,CAAA;AAAA,GACzC;AAEA,EAAO,OAAA,MAAA,CAAA;AACR,CAAA;AAXgB,MAAA,CAAA,OAAA,EAAA,SAAA,CAAA","file":"index.cjs","sourcesContent":["import { Option, Result } from '@sapphire/result';\nimport type { Parameter } from './lexer/streams/ParameterStream';\nimport type { ParserResult } from './parser/ParserResult';\n\nexport class ArgumentStream {\n\tpublic readonly results: ParserResult;\n\tpublic state: ArgumentStream.State;\n\n\tpublic constructor(results: ParserResult) {\n\t\tthis.results = results;\n\t\tthis.state = { used: new Set(), position: 0 };\n\t}\n\n\t/**\n\t * Whether or not all ordered parameters were used.\n\t */\n\tpublic get finished() {\n\t\treturn this.used === this.length;\n\t}\n\n\t/**\n\t * The amount of ordered parameters.\n\t */\n\tpublic get length() {\n\t\treturn this.results.ordered.length;\n\t}\n\n\t/**\n\t * The remaining amount of ordered parameters.\n\t */\n\tpublic get remaining() {\n\t\treturn this.length - this.used;\n\t}\n\n\t/**\n\t * The amount of ordered parameters that have been used.\n\t */\n\tpublic get used() {\n\t\treturn this.state.used.size;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '1' }\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '2' }\n\t *\n\t * console.log(args.single());\n\t * // Ok { value: '3' }\n\t *\n\t * console.log(args.single());\n\t * // None\n\t * ```\n\t *\n\t * @returns The value, if any.\n\t */\n\tpublic single(): Option<string> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tthis.state.used.add(this.state.position);\n\t\treturn Option.some(this.results.ordered[this.state.position++].value);\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link singleMapAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number) ? Option.none : Option.some(number);\n\t * };\n\t *\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 1 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 2 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // Some { value: 3 }\n\t *\n\t * console.log(args.singleMap(parse));\n\t * // None\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic singleMap<T>(predicate: (value: string) => Option<T>, useAnyways = false): Option<T> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isSome() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This is an asynchronous variant of {@link singleMap}.\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic async singleMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, useAnyways = false): Promise<Option<T>> {\n\t\tif (this.finished) return Option.none;\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = await predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isSome() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Finds and retrieves the next unused parameter and transforms it.\n\t *\n\t * @note This is a variant of {@link findMap} that returns the errors on failure.\n\t * @note This does not support asynchronous results, refer to {@link singleParseAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number)\n\t * ? Result.err(`Could not parse ${value} to a number`)\n\t * : Result.ok(number);\n\t * };\n\t *\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 1 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 2 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Ok { value: 3 }\n\t *\n\t * console.log(args.singleParse(parse));\n\t * // Err { error: null }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate The predicate that determines the parameter's transformed value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the transformation failed. Defaults to `false`.\n\t * @returns The transformed value, if any.\n\t */\n\tpublic singleParse<T, E>(predicate: (value: string) => Result<T, E>, useAnyways = false): Result<T, E | null> {\n\t\tif (this.finished) return Result.err(null);\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isOk() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Retrieves the value of the next unused ordered token, but only if it could be transformed.\n\t *\n\t * @note This is an asynchronous variant of {@link singleParse}.\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate The predicate that determines the parameter's mapped value, or nothing if failed.\n\t * @param useAnyways Whether to consider the parameter used even if the mapping failed. Defaults to `false`.\n\t * @returns The mapped value, if any.\n\t */\n\tpublic async singleParseAsync<T, E>(predicate: (value: string) => Promise<Result<T, E>>, useAnyways = false): Promise<Result<T, E | null>> {\n\t\tif (this.finished) return Result.err(null);\n\n\t\twhile (this.state.used.has(this.state.position)) {\n\t\t\t++this.state.position;\n\t\t}\n\n\t\tconst result = await predicate(this.results.ordered[this.state.position].value);\n\t\tif (result.isOk() || useAnyways) {\n\t\t\tthis.state.used.add(this.state.position);\n\t\t\t++this.state.position;\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `true`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link findAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `true`. If such an element is found, find immediately returns a `Option.some`\n\t * with that element value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic find(predicate: (value: string) => boolean, from = this.state.position): Option<string> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn Option.some(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `true`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This is an asynchronous variant of {@link find}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `true`. If such an element is found, find immediately returns a `Option.some`\n\t * with that element value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findAsync(predicate: (value: string) => Promise<boolean>, from = this.state.position): Promise<Option<string>> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (await predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn Option.some(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `Some`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This does not support asynchronous results, refer to {@link findMapAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `Some`. If such an element is found, find immediately returns the returned\n\t * value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic findMap<T>(predicate: (value: string) => Option<T>, from = this.state.position): Option<T> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tif (result.isSome()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Returns the value of the first element in the array within `Option.some` where `predicate` returns `Some`, and\n\t * `Option.none` otherwise.\n\t *\n\t * @note This is an asynchronous variant of {@link findMap}.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Suppose args are from 'ba aa cc'.\n\t *\n\t * console.log(args.find((value) => value.startsWith('a')));\n\t * // Some { value: 'aa' }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @param predicate find calls `predicate` once for each unused ordered parameter, in ascending order, until it\n\t * finds one where `predicate` returns `Some`. If such an element is found, find immediately returns the returned\n\t * value. Otherwise, find returns `Option.none`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, from = this.state.position): Promise<Option<T>> {\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tif (result.isSome()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result;\n\t\t\t}\n\t\t}\n\n\t\treturn Option.none;\n\t}\n\n\t/**\n\t * Finds and retrieves the first unused parameter that could be transformed.\n\t *\n\t * @note This is a variant of {@link findMap} that returns the errors on failure.\n\t * @note This does not support asynchronous results, refer to {@link findParseAsync}.\n\t *\n\t * @example\n\t * ```typescript\n\t * const parse = (value) => {\n\t * const number = Number(value);\n\t * return Number.isNaN(number)\n\t * ? Result.err(`Could not parse ${value} to a number`)\n\t * : Result.ok(number);\n\t * };\n\t *\n\t * // Suppose args are from 'ba 1 cc'.\n\t *\n\t * console.log(args.findParse(parse));\n\t * // Ok { value: 1 }\n\t *\n\t * console.log(args.findParse(parse));\n\t * // Err {\n\t * // error: [\n\t * // 'Could not parse ba to a number',\n\t * // 'Could not parse cc to a number'\n\t * // ]\n\t * // }\n\t * ```\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate `findParse` calls `predicate` once for each unused ordered parameter, in ascending order, until\n\t * it finds one where `predicate` returns `Ok`. If such an element is found, `findParse` immediately returns the\n\t * returned value. Otherwise, `findParse` returns `Result.Err` with all the returned errors.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic findParse<T, E>(predicate: (value: string) => Result<T, E>, from = this.state.position): Result<T, E[]> {\n\t\tconst errors: E[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tif (result.isOk()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result as Result.Ok<T>;\n\t\t\t}\n\n\t\t\terrors.push(result.unwrapErr());\n\t\t}\n\n\t\treturn Result.err(errors);\n\t}\n\n\t/**\n\t * Finds and retrieves the first unused parameter that could be transformed.\n\t *\n\t * @note This is a variant of {@link findMapAsync} that returns the errors on failure.\n\t * @note This is an asynchronous variant of {@link findParse}.\n\t *\n\t * @typeparam T The output type.\n\t * @typeparam E The error type.\n\t * @param predicate `findParse` calls `predicate` once for each unused ordered parameter, in ascending order, until\n\t * it finds one where `predicate` returns `Ok`. If such an element is found, `findParse` immediately returns the\n\t * returned value. Otherwise, `findParse` returns `Result.Err` with all the returned errors.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The found parameter's value.\n\t */\n\tpublic async findParseAsync<T, E>(predicate: (value: string) => Promise<Result<T, E>>, from = this.state.position): Promise<Result<T, E[]>> {\n\t\tconst errors: E[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tif (result.isOk()) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\treturn result as Result.Ok<T>;\n\t\t\t}\n\n\t\t\terrors.push(result.unwrapErr());\n\t\t}\n\n\t\treturn Result.err(errors);\n\t}\n\n\t/**\n\t * Retrieves multiple unused parameters.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(join(args.many().unwrap()));\n\t * // '1 2 3'\n\t * ```\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '1 2 3':\n\t *\n\t * console.log(join(args.many(2).unwrap()));\n\t * // '1 2'\n\t * ```\n\t *\n\t * @param limit The maximum amount of parameters to retrieve, defaults to `Infinity`.\n\t * @param from The position where to start looking for unused parameters, defaults to current position.\n\t * @returns The unused parameters within the range.\n\t */\n\tpublic many(limit = Infinity, from = this.state.position): Option<Parameter[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: Parameter[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\t// If the current parameter was already used, skip:\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\t// Mark current parameter as used, and push it to the resulting array:\n\t\t\tthis.state.used.add(i);\n\t\t\tparameters.push(this.results.ordered[i]);\n\n\t\t\t// If the parameters reached the limit, break the loop:\n\t\t\tif (parameters.length >= limit) break;\n\t\t}\n\n\t\treturn parameters.length ? Option.some(parameters) : Option.none;\n\t}\n\n\tpublic filter(predicate: (value: string) => boolean, from = this.state.position): Option<string[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: string[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic async filterAsync(predicate: (value: string) => Promise<boolean>, from = this.state.position): Promise<Option<string[]>> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: string[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tif (await predicate(parameter)) {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(parameter);\n\t\t\t}\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic filterMap<T>(predicate: (value: string) => Option<T>, from = this.state.position): Option<T[]> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: T[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = predicate(parameter);\n\t\t\tresult.inspect((value) => {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(value);\n\t\t\t});\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\tpublic async filterMapAsync<T>(predicate: (value: string) => Promise<Option<T>>, from = this.state.position): Promise<Option<T[]>> {\n\t\tif (this.finished) return Option.none;\n\n\t\tconst parameters: T[] = [];\n\t\tfor (let i = from; i < this.length; ++i) {\n\t\t\tif (this.state.used.has(i)) continue;\n\n\t\t\tconst parameter = this.results.ordered[i].value;\n\t\t\tconst result = await predicate(parameter);\n\t\t\tresult.inspect((value) => {\n\t\t\t\tthis.state.used.add(i);\n\t\t\t\tparameters.push(value);\n\t\t\t});\n\t\t}\n\n\t\treturn Option.some(parameters);\n\t}\n\n\t/**\n\t * Checks whether any of the flags were given.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--f --g':\n\t *\n\t * console.log(args.flag('f'));\n\t * // true\n\t *\n\t * console.log(args.flag('g', 'h'));\n\t * // true\n\t *\n\t * console.log(args.flag('h'));\n\t * // false\n\t * ```\n\t *\n\t * @param keys The names of the flags to check.\n\t * @returns Whether or not any of the flags were given.\n\t */\n\tpublic flag(...keys: readonly string[]): boolean {\n\t\treturn keys.some((key) => this.results.flags.has(key));\n\t}\n\n\t/**\n\t * Gets the last value of any option. When there are multiple names, the last value of the last found name is given.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--a=1 --b=2 --c=3'.\n\t * console.log(args.option('a'));\n\t * // Some { value: '1' }\n\t *\n\t * console.log(args.option('b', 'c'));\n\t * // Some { value: '3' }\n\t *\n\t * console.log(args.option('d'));\n\t * // None {}\n\t * ```\n\t *\n\t * @param keys The names of the options to check.\n\t * @returns The last value of the option, if any.\n\t */\n\tpublic option(...keys: readonly string[]): Option<string> {\n\t\treturn this.options(...keys).map((values) => values.at(-1)!);\n\t}\n\n\t/**\n\t * Gets all values from all options.\n\t *\n\t * @example\n\t * ```typescript\n\t * // Assume args are '--a=1 --a=1 --b=2 --c=3'.\n\t * console.log(args.option('a'));\n\t * // Some { value: ['1', '1'] }\n\t *\n\t * console.log(args.option('b', 'c'));\n\t * // Some { value: ['2', '3'] }\n\t *\n\t * console.log(args.option('d'));\n\t * // None {}\n\t * ```\n\t *\n\t * @param keys The names of the options to check.\n\t * @returns The values from all the options concatenated, if any.\n\t */\n\tpublic options(...keys: readonly string[]): Option<readonly string[]> {\n\t\tconst entries: string[] = [];\n\t\tfor (const key of keys) {\n\t\t\tconst values = this.results.options.get(key);\n\t\t\tif (values) entries.push(...values);\n\t\t}\n\n\t\treturn entries.length ? Option.some(entries) : Option.none;\n\t}\n\n\tpublic save(): ArgumentStream.State {\n\t\treturn {\n\t\t\tused: new Set(this.state.used),\n\t\t\tposition: this.state.position\n\t\t};\n\t}\n\n\tpublic restore(state: ArgumentStream.State) {\n\t\tthis.state = state;\n\t}\n\n\tpublic reset() {\n\t\tthis.restore({ used: new Set(), position: 0 });\n\t}\n}\n\nexport namespace ArgumentStream {\n\texport interface State {\n\t\tused: Set<number>;\n\t\tposition: number;\n\t}\n}\n","export abstract class BaseParameter {\n\tpublic readonly separators: readonly string[];\n\n\tpublic constructor(separators: readonly string[]) {\n\t\tthis.separators = separators;\n\t}\n\n\tpublic get leading(): string {\n\t\treturn this.separators.join('');\n\t}\n\n\tpublic abstract get raw(): string;\n}\n","import type { QuotedToken } from '../raw/TokenStream';\nimport { BaseParameter } from './BaseParameter';\n\nexport class QuotedParameter extends BaseParameter {\n\tpublic readonly value: string;\n\tpublic readonly open: string;\n\tpublic readonly close: string;\n\n\tpublic constructor(separators: readonly string[], part: Omit<QuotedToken, 'type'>) {\n\t\tsuper(separators);\n\t\tthis.value = part.value;\n\t\tthis.open = part.open;\n\t\tthis.close = part.close;\n\t}\n\n\tpublic get raw() {\n\t\treturn `${this.open}${this.value}${this.close}`;\n\t}\n}\n","import type { WordToken } from '../raw/TokenStream';\nimport { BaseParameter } from './BaseParameter';\n\nexport class WordParameter extends BaseParameter {\n\tpublic readonly value: string;\n\n\tpublic constructor(separators: readonly string[], part: Omit<WordToken, 'type'>) {\n\t\tsuper(separators);\n\t\tthis.value = part.value;\n\t}\n\n\tpublic get raw() {\n\t\treturn this.value;\n\t}\n}\n","import type { Lexer } from '../../Lexer';\n\nexport class TokenStream implements Iterable<Token> {\n\tprivate readonly input: string;\n\tprivate readonly quotes: readonly [string, string][];\n\tprivate readonly separator: string;\n\tprivate position = 0;\n\n\tpublic constructor(lexer: Lexer, input: string) {\n\t\tthis.quotes = lexer.quotes;\n\t\tthis.separator = lexer.separator;\n\t\tthis.input = input;\n\t}\n\n\tpublic get finished() {\n\t\treturn this.position >= this.input.length;\n\t}\n\n\tpublic *[Symbol.iterator](): Iterator<Token> {\n\t\twhile (!this.finished) {\n\t\t\tyield this.getPossibleSeparator() ?? this.getPossibleQuotedArgument() ?? this.getParameter();\n\t\t}\n\t}\n\n\tprivate getPossibleSeparator(): SeparatorToken | null {\n\t\tif (this.input.startsWith(this.separator, this.position)) {\n\t\t\tthis.position += this.separator.length;\n\t\t\treturn { type: TokenType.Separator, value: this.separator };\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate getPossibleQuotedArgument(): QuotedToken | null {\n\t\tfor (const [open, close] of this.quotes) {\n\t\t\tif (!this.input.startsWith(open, this.position)) continue;\n\n\t\t\tconst end = this.input.indexOf(close, this.position + open.length);\n\t\t\tif (end === -1) continue;\n\n\t\t\tconst value = this.input.slice(this.position + open.length, end);\n\t\t\tthis.position = end + close.length;\n\n\t\t\treturn { type: TokenType.Quoted, value, open, close };\n\t\t}\n\n\t\treturn null;\n\t}\n\n\tprivate getParameter(): WordToken {\n\t\tconst index = this.input.indexOf(this.separator, this.position);\n\t\tconst value = index === -1 ? this.input.slice(this.position) : this.input.slice(this.position, index);\n\t\tthis.position += value.length;\n\t\treturn { type: TokenType.Parameter, value };\n\t}\n}\n\nexport enum TokenType {\n\tParameter,\n\tQuoted,\n\tSeparator\n}\n\nexport type Token = WordToken | QuotedToken | SeparatorToken;\n\nexport interface WordToken {\n\treadonly type: TokenType.Parameter;\n\treadonly value: string;\n}\n\nexport interface QuotedToken {\n\treadonly type: TokenType.Quoted;\n\treadonly value: string;\n\treadonly open: string;\n\treadonly close: string;\n}\n\nexport interface SeparatorToken {\n\treadonly type: TokenType.Separator;\n\treadonly value: string;\n}\n","import { QuotedParameter } from './parameters/QuotedParameter';\nimport { WordParameter } from './parameters/WordParameter';\nimport { TokenType, type Token } from './raw/TokenStream';\n\nexport class ParameterStream {\n\tprivate readonly stream: Iterable<Token>;\n\tprivate separators: string[] = [];\n\n\tpublic constructor(stream: Iterable<Token>) {\n\t\tthis.stream = stream;\n\t}\n\n\tpublic *[Symbol.iterator](): Iterator<Parameter, string[]> {\n\t\tfor (const part of this.stream) {\n\t\t\tif (part.type === TokenType.Separator) {\n\t\t\t\tthis.separators.push(part.value);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tyield part.type === TokenType.Quoted ? new QuotedParameter(this.separators, part) : new WordParameter(this.separators, part);\n\t\t\tthis.separators = [];\n\t\t}\n\n\t\treturn this.separators;\n\t}\n}\n\nexport type Parameter = QuotedParameter | WordParameter;\n","import { ParameterStream } from './streams/ParameterStream';\nimport { TokenStream } from './streams/raw/TokenStream';\n\nexport class Lexer {\n\tpublic readonly quotes: readonly [open: string, close: string][];\n\tpublic readonly separator: string;\n\n\tpublic constructor(options: Lexer.Options = {}) {\n\t\tthis.quotes = options.quotes ?? [];\n\t\tthis.separator = options.separator ?? ' ';\n\t}\n\n\tpublic run(input: string) {\n\t\treturn new ParameterStream(this.raw(input));\n\t}\n\n\tpublic raw(input: string) {\n\t\treturn new TokenStream(this, input);\n\t}\n}\n\nexport namespace Lexer {\n\texport interface Options {\n\t\tseparator?: string;\n\t\tquotes?: readonly [open: string, close: string][];\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\nimport type { Parser } from './Parser';\nimport type { IUnorderedStrategy } from './strategies/IUnorderedStrategy';\n\nexport class ParserResult {\n\tpublic readonly ordered: Parameter[] = [];\n\tpublic readonly flags = new Set<string>();\n\tpublic readonly options = new Map<string, string[]>();\n\tprivate readonly strategy: IUnorderedStrategy;\n\n\tpublic constructor(parser: Parser) {\n\t\tthis.strategy = parser.strategy;\n\t}\n\n\tpublic parse(parameters: Iterable<Parameter>) {\n\t\tfor (const parameter of parameters) {\n\t\t\tthis.parsePossibleFlag(parameter) || this.parsePossibleOptions(parameter) || this.parseOrdered(parameter);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\tprivate parsePossibleFlag(parameter: Parameter): boolean {\n\t\treturn this.strategy\n\t\t\t.matchFlag(parameter.value)\n\t\t\t.inspect((value) => this.flags.add(value))\n\t\t\t.isSome();\n\t}\n\n\tprivate parsePossibleOptions(parameter: Parameter): boolean {\n\t\treturn this.strategy\n\t\t\t.matchOption(parameter.value)\n\t\t\t.inspect(([key, value]) => {\n\t\t\t\tconst existing = this.options.get(key);\n\t\t\t\tif (existing) existing.push(value);\n\t\t\t\telse this.options.set(key, [value]);\n\t\t\t})\n\t\t\t.isSome();\n\t}\n\n\tprivate parseOrdered(parameter: Parameter): boolean {\n\t\tthis.ordered.push(parameter);\n\t\treturn true;\n\t}\n}\n","import { Option } from '@sapphire/result';\nimport type { IUnorderedStrategy } from './IUnorderedStrategy';\n\nexport class EmptyStrategy implements IUnorderedStrategy {\n\tpublic matchFlag(): Option<string> {\n\t\treturn Option.none;\n\t}\n\n\tpublic matchOption(): Option<readonly [key: string, value: string]> {\n\t\treturn Option.none;\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\nimport type { IUnorderedStrategy } from './strategies/IUnorderedStrategy';\nimport { ParserResult } from './ParserResult';\nimport { EmptyStrategy } from './strategies/EmptyStrategy';\n\nexport class Parser {\n\tpublic strategy: IUnorderedStrategy;\n\n\tpublic constructor(strategy?: IUnorderedStrategy) {\n\t\tthis.strategy = strategy ?? new EmptyStrategy();\n\t}\n\n\tpublic setUnorderedStrategy(strategy: IUnorderedStrategy) {\n\t\tthis.strategy = strategy;\n\t\treturn this;\n\t}\n\n\tpublic run(input: Iterable<Parameter>): ParserResult {\n\t\treturn new ParserResult(this).parse(input);\n\t}\n}\n","import { Option } from '@sapphire/result';\nimport type { IUnorderedStrategy } from './IUnorderedStrategy';\n\nexport class PrefixedStrategy implements IUnorderedStrategy {\n\tpublic readonly prefixes: readonly string[];\n\tpublic readonly separators: readonly string[];\n\n\tpublic constructor(prefixes: readonly string[], separators: readonly string[]) {\n\t\tthis.prefixes = prefixes;\n\t\tthis.separators = separators;\n\t}\n\n\tpublic matchFlag(input: string): Option<string> {\n\t\tconst prefix = this.prefixes.find((x) => input.startsWith(x));\n\n\t\t// If the prefix is missing, return None:\n\t\tif (!prefix) return Option.none;\n\n\t\t// If the separator is present, return None:\n\t\tif (this.separators.some((x) => input.includes(x, prefix.length))) return Option.none;\n\n\t\treturn Option.some(input.slice(prefix.length));\n\t}\n\n\tpublic matchOption(input: string): Option<readonly [key: string, value: string]> {\n\t\tconst prefix = this.prefixes.find((x) => input.startsWith(x));\n\n\t\t// If the prefix is missing, return None:\n\t\tif (!prefix) return Option.none;\n\n\t\tfor (const separator of this.separators) {\n\t\t\tconst index = input.indexOf(separator, prefix.length + 1);\n\n\t\t\t// If the separator is missing, skip:\n\t\t\tif (index === -1) continue;\n\n\t\t\t// If the separator is present, but has no value, return None:\n\t\t\tif (index + separator.length === input.length) return Option.none;\n\n\t\t\tconst key = input.slice(prefix.length, index);\n\t\t\tconst value = input.slice(index + separator.length);\n\t\t\treturn Option.some([key, value] as const);\n\t\t}\n\n\t\treturn Option.none;\n\t}\n}\n","import type { Parameter } from '../lexer/streams/ParameterStream';\n\n/**\n * Joins the parameters by their `leading` value, using the `value` property.\n * @seealso {@link joinRaw} for the version using `raw` instead of `value`.\n * @param parameters The parameters to join.\n * @returns The result of joining the parameters.\n */\nexport function join(parameters: readonly Parameter[]) {\n\tif (parameters.length === 0) return '';\n\tif (parameters.length === 1) return parameters[0].value;\n\n\tlet output = parameters[0].value;\n\tfor (let i = 1; i < parameters.length; i++) {\n\t\tconst parameter = parameters[i];\n\t\toutput += parameter.leading + parameter.value;\n\t}\n\n\treturn output;\n}\n\n/**\n * Joins the parameters by their `leading` value, using the `raw` property.\n * @seealso {@link join} for the version using `value` instead of `raw`.\n * @param parameters The parameters to join.\n * @returns The result of joining the parameters.\n */\nexport function joinRaw(parameters: readonly Parameter[]) {\n\tif (parameters.length === 0) return '';\n\tif (parameters.length === 1) return parameters[0].raw;\n\n\tlet output = parameters[0].raw;\n\tfor (let i = 1; i < parameters.length; i++) {\n\t\tconst parameter = parameters[i];\n\t\toutput += parameter.leading + parameter.raw;\n\t}\n\n\treturn output;\n}\n"]}