@slicemachine/init 1.1.19 → 2.0.1

package/dist/_node_modules/fill-range/index.cjs

@@ -0,0 +1,210 @@
+"use strict";
+const require$$0 = require("util");
+const index = require("../to-regex-range/index.cjs");
+/*!
+ * fill-range <https://github.com/jonschlinkert/fill-range>
+ *
+ * Copyright (c) 2014-present, Jon Schlinkert.
+ * Licensed under the MIT License.
+ */
+const util = require$$0;
+const toRegexRange = index;
+const isObject = (val) => val !== null && typeof val === "object" && !Array.isArray(val);
+const transform = (toNumber) => {
+  return (value) => toNumber === true ? Number(value) : String(value);
+};
+const isValidValue = (value) => {
+  return typeof value === "number" || typeof value === "string" && value !== "";
+};
+const isNumber = (num) => Number.isInteger(+num);
+const zeros = (input) => {
+  let value = `${input}`;
+  let index2 = -1;
+  if (value[0] === "-")
+    value = value.slice(1);
+  if (value === "0")
+    return false;
+  while (value[++index2] === "0")
+    ;
+  return index2 > 0;
+};
+const stringify = (start, end, options) => {
+  if (typeof start === "string" || typeof end === "string") {
+    return true;
+  }
+  return options.stringify === true;
+};
+const pad = (input, maxLength, toNumber) => {
+  if (maxLength > 0) {
+    let dash = input[0] === "-" ? "-" : "";
+    if (dash)
+      input = input.slice(1);
+    input = dash + input.padStart(dash ? maxLength - 1 : maxLength, "0");
+  }
+  if (toNumber === false) {
+    return String(input);
+  }
+  return input;
+};
+const toMaxLen = (input, maxLength) => {
+  let negative = input[0] === "-" ? "-" : "";
+  if (negative) {
+    input = input.slice(1);
+    maxLength--;
+  }
+  while (input.length < maxLength)
+    input = "0" + input;
+  return negative ? "-" + input : input;
+};
+const toSequence = (parts, options) => {
+  parts.negatives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  parts.positives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  let prefix = options.capture ? "" : "?:";
+  let positives = "";
+  let negatives = "";
+  let result;
+  if (parts.positives.length) {
+    positives = parts.positives.join("|");
+  }
+  if (parts.negatives.length) {
+    negatives = `-(${prefix}${parts.negatives.join("|")})`;
+  }
+  if (positives && negatives) {
+    result = `${positives}|${negatives}`;
+  } else {
+    result = positives || negatives;
+  }
+  if (options.wrap) {
+    return `(${prefix}${result})`;
+  }
+  return result;
+};
+const toRange = (a, b, isNumbers, options) => {
+  if (isNumbers) {
+    return toRegexRange(a, b, { wrap: false, ...options });
+  }
+  let start = String.fromCharCode(a);
+  if (a === b)
+    return start;
+  let stop = String.fromCharCode(b);
+  return `[${start}-${stop}]`;
+};
+const toRegex = (start, end, options) => {
+  if (Array.isArray(start)) {
+    let wrap = options.wrap === true;
+    let prefix = options.capture ? "" : "?:";
+    return wrap ? `(${prefix}${start.join("|")})` : start.join("|");
+  }
+  return toRegexRange(start, end, options);
+};
+const rangeError = (...args) => {
+  return new RangeError("Invalid range arguments: " + util.inspect(...args));
+};
+const invalidRange = (start, end, options) => {
+  if (options.strictRanges === true)
+    throw rangeError([start, end]);
+  return [];
+};
+const invalidStep = (step, options) => {
+  if (options.strictRanges === true) {
+    throw new TypeError(`Expected step "${step}" to be a number`);
+  }
+  return [];
+};
+const fillNumbers = (start, end, step = 1, options = {}) => {
+  let a = Number(start);
+  let b = Number(end);
+  if (!Number.isInteger(a) || !Number.isInteger(b)) {
+    if (options.strictRanges === true)
+      throw rangeError([start, end]);
+    return [];
+  }
+  if (a === 0)
+    a = 0;
+  if (b === 0)
+    b = 0;
+  let descending = a > b;
+  let startString = String(start);
+  let endString = String(end);
+  let stepString = String(step);
+  step = Math.max(Math.abs(step), 1);
+  let padded = zeros(startString) || zeros(endString) || zeros(stepString);
+  let maxLen = padded ? Math.max(startString.length, endString.length, stepString.length) : 0;
+  let toNumber = padded === false && stringify(start, end, options) === false;
+  let format = options.transform || transform(toNumber);
+  if (options.toRegex && step === 1) {
+    return toRange(toMaxLen(start, maxLen), toMaxLen(end, maxLen), true, options);
+  }
+  let parts = { negatives: [], positives: [] };
+  let push = (num) => parts[num < 0 ? "negatives" : "positives"].push(Math.abs(num));
+  let range = [];
+  let index2 = 0;
+  while (descending ? a >= b : a <= b) {
+    if (options.toRegex === true && step > 1) {
+      push(a);
+    } else {
+      range.push(pad(format(a, index2), maxLen, toNumber));
+    }
+    a = descending ? a - step : a + step;
+    index2++;
+  }
+  if (options.toRegex === true) {
+    return step > 1 ? toSequence(parts, options) : toRegex(range, null, { wrap: false, ...options });
+  }
+  return range;
+};
+const fillLetters = (start, end, step = 1, options = {}) => {
+  if (!isNumber(start) && start.length > 1 || !isNumber(end) && end.length > 1) {
+    return invalidRange(start, end, options);
+  }
+  let format = options.transform || ((val) => String.fromCharCode(val));
+  let a = `${start}`.charCodeAt(0);
+  let b = `${end}`.charCodeAt(0);
+  let descending = a > b;
+  let min = Math.min(a, b);
+  let max = Math.max(a, b);
+  if (options.toRegex && step === 1) {
+    return toRange(min, max, false, options);
+  }
+  let range = [];
+  let index2 = 0;
+  while (descending ? a >= b : a <= b) {
+    range.push(format(a, index2));
+    a = descending ? a - step : a + step;
+    index2++;
+  }
+  if (options.toRegex === true) {
+    return toRegex(range, null, { wrap: false, options });
+  }
+  return range;
+};
+const fill = (start, end, step, options = {}) => {
+  if (end == null && isValidValue(start)) {
+    return [start];
+  }
+  if (!isValidValue(start) || !isValidValue(end)) {
+    return invalidRange(start, end, options);
+  }
+  if (typeof step === "function") {
+    return fill(start, end, 1, { transform: step });
+  }
+  if (isObject(step)) {
+    return fill(start, end, 0, step);
+  }
+  let opts = { ...options };
+  if (opts.capture === true)
+    opts.wrap = true;
+  step = step || opts.step || 1;
+  if (!isNumber(step)) {
+    if (step != null && !isObject(step))
+      return invalidStep(step, opts);
+    return fill(start, end, 1, step);
+  }
+  if (isNumber(start) && isNumber(end)) {
+    return fillNumbers(start, end, step, opts);
+  }
+  return fillLetters(start, end, Math.max(Math.abs(step), 1), opts);
+};
+var fillRange = fill;
+module.exports = fillRange;
+//# sourceMappingURL=index.cjs.map

package/dist/_node_modules/fill-range/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/fill-range/index.js"],"sourcesContent":["/*!\n * fill-range <https://github.com/jonschlinkert/fill-range>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n'use strict';\n\nconst util = require('util');\nconst toRegexRange = require('to-regex-range');\n\nconst isObject = val => val !== null && typeof val === 'object' && !Array.isArray(val);\n\nconst transform = toNumber => {\n  return value => toNumber === true ? Number(value) : String(value);\n};\n\nconst isValidValue = value => {\n  return typeof value === 'number' || (typeof value === 'string' && value !== '');\n};\n\nconst isNumber = num => Number.isInteger(+num);\n\nconst zeros = input => {\n  let value = `${input}`;\n  let index = -1;\n  if (value[0] === '-') value = value.slice(1);\n  if (value === '0') return false;\n  while (value[++index] === '0');\n  return index > 0;\n};\n\nconst stringify = (start, end, options) => {\n  if (typeof start === 'string' || typeof end === 'string') {\n    return true;\n  }\n  return options.stringify === true;\n};\n\nconst pad = (input, maxLength, toNumber) => {\n  if (maxLength > 0) {\n    let dash = input[0] === '-' ? '-' : '';\n    if (dash) input = input.slice(1);\n    input = (dash + input.padStart(dash ? maxLength - 1 : maxLength, '0'));\n  }\n  if (toNumber === false) {\n    return String(input);\n  }\n  return input;\n};\n\nconst toMaxLen = (input, maxLength) => {\n  let negative = input[0] === '-' ? '-' : '';\n  if (negative) {\n    input = input.slice(1);\n    maxLength--;\n  }\n  while (input.length < maxLength) input = '0' + input;\n  return negative ? ('-' + input) : input;\n};\n\nconst toSequence = (parts, options) => {\n  parts.negatives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);\n  parts.positives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);\n\n  let prefix = options.capture ? '' : '?:';\n  let positives = '';\n  let negatives = '';\n  let result;\n\n  if (parts.positives.length) {\n    positives = parts.positives.join('|');\n  }\n\n  if (parts.negatives.length) {\n    negatives = `-(${prefix}${parts.negatives.join('|')})`;\n  }\n\n  if (positives && negatives) {\n    result = `${positives}|${negatives}`;\n  } else {\n    result = positives || negatives;\n  }\n\n  if (options.wrap) {\n    return `(${prefix}${result})`;\n  }\n\n  return result;\n};\n\nconst toRange = (a, b, isNumbers, options) => {\n  if (isNumbers) {\n    return toRegexRange(a, b, { wrap: false, ...options });\n  }\n\n  let start = String.fromCharCode(a);\n  if (a === b) return start;\n\n  let stop = String.fromCharCode(b);\n  return `[${start}-${stop}]`;\n};\n\nconst toRegex = (start, end, options) => {\n  if (Array.isArray(start)) {\n    let wrap = options.wrap === true;\n    let prefix = options.capture ? '' : '?:';\n    return wrap ? `(${prefix}${start.join('|')})` : start.join('|');\n  }\n  return toRegexRange(start, end, options);\n};\n\nconst rangeError = (...args) => {\n  return new RangeError('Invalid range arguments: ' + util.inspect(...args));\n};\n\nconst invalidRange = (start, end, options) => {\n  if (options.strictRanges === true) throw rangeError([start, end]);\n  return [];\n};\n\nconst invalidStep = (step, options) => {\n  if (options.strictRanges === true) {\n    throw new TypeError(`Expected step \"${step}\" to be a number`);\n  }\n  return [];\n};\n\nconst fillNumbers = (start, end, step = 1, options = {}) => {\n  let a = Number(start);\n  let b = Number(end);\n\n  if (!Number.isInteger(a) || !Number.isInteger(b)) {\n    if (options.strictRanges === true) throw rangeError([start, end]);\n    return [];\n  }\n\n  // fix negative zero\n  if (a === 0) a = 0;\n  if (b === 0) b = 0;\n\n  let descending = a > b;\n  let startString = String(start);\n  let endString = String(end);\n  let stepString = String(step);\n  step = Math.max(Math.abs(step), 1);\n\n  let padded = zeros(startString) || zeros(endString) || zeros(stepString);\n  let maxLen = padded ? Math.max(startString.length, endString.length, stepString.length) : 0;\n  let toNumber = padded === false && stringify(start, end, options) === false;\n  let format = options.transform || transform(toNumber);\n\n  if (options.toRegex && step === 1) {\n    return toRange(toMaxLen(start, maxLen), toMaxLen(end, maxLen), true, options);\n  }\n\n  let parts = { negatives: [], positives: [] };\n  let push = num => parts[num < 0 ? 'negatives' : 'positives'].push(Math.abs(num));\n  let range = [];\n  let index = 0;\n\n  while (descending ? a >= b : a <= b) {\n    if (options.toRegex === true && step > 1) {\n      push(a);\n    } else {\n      range.push(pad(format(a, index), maxLen, toNumber));\n    }\n    a = descending ? a - step : a + step;\n    index++;\n  }\n\n  if (options.toRegex === true) {\n    return step > 1\n      ? toSequence(parts, options)\n      : toRegex(range, null, { wrap: false, ...options });\n  }\n\n  return range;\n};\n\nconst fillLetters = (start, end, step = 1, options = {}) => {\n  if ((!isNumber(start) && start.length > 1) || (!isNumber(end) && end.length > 1)) {\n    return invalidRange(start, end, options);\n  }\n\n\n  let format = options.transform || (val => String.fromCharCode(val));\n  let a = `${start}`.charCodeAt(0);\n  let b = `${end}`.charCodeAt(0);\n\n  let descending = a > b;\n  let min = Math.min(a, b);\n  let max = Math.max(a, b);\n\n  if (options.toRegex && step === 1) {\n    return toRange(min, max, false, options);\n  }\n\n  let range = [];\n  let index = 0;\n\n  while (descending ? a >= b : a <= b) {\n    range.push(format(a, index));\n    a = descending ? a - step : a + step;\n    index++;\n  }\n\n  if (options.toRegex === true) {\n    return toRegex(range, null, { wrap: false, options });\n  }\n\n  return range;\n};\n\nconst fill = (start, end, step, options = {}) => {\n  if (end == null && isValidValue(start)) {\n    return [start];\n  }\n\n  if (!isValidValue(start) || !isValidValue(end)) {\n    return invalidRange(start, end, options);\n  }\n\n  if (typeof step === 'function') {\n    return fill(start, end, 1, { transform: step });\n  }\n\n  if (isObject(step)) {\n    return fill(start, end, 0, step);\n  }\n\n  let opts = { ...options };\n  if (opts.capture === true) opts.wrap = true;\n  step = step || opts.step || 1;\n\n  if (!isNumber(step)) {\n    if (step != null && !isObject(step)) return invalidStep(step, opts);\n    return fill(start, end, 1, step);\n  }\n\n  if (isNumber(start) && isNumber(end)) {\n    return fillNumbers(start, end, step, opts);\n  }\n\n  return fillLetters(start, end, Math.max(Math.abs(step), 1), opts);\n};\n\nmodule.exports = fill;\n"],"names":["require$$1","index"],"mappings":";;;;;;;;;AASA,MAAM,OAAO;AACb,MAAM,eAAeA;AAErB,MAAM,WAAW,SAAO,QAAQ,QAAQ,OAAO,QAAQ,YAAY,CAAC,MAAM,QAAQ,GAAG;AAErF,MAAM,YAAY,cAAY;AAC5B,SAAO,WAAS,aAAa,OAAO,OAAO,KAAK,IAAI,OAAO,KAAK;AAClE;AAEA,MAAM,eAAe,WAAS;AAC5B,SAAO,OAAO,UAAU,YAAa,OAAO,UAAU,YAAY,UAAU;AAC9E;AAEA,MAAM,WAAW,SAAO,OAAO,UAAU,CAAC,GAAG;AAE7C,MAAM,QAAQ,WAAS;AACrB,MAAI,QAAQ,GAAG;AACf,MAAIC,SAAQ;AACZ,MAAI,MAAM,CAAC,MAAM;AAAK,YAAQ,MAAM,MAAM,CAAC;AAC3C,MAAI,UAAU;AAAK,WAAO;AAC1B,SAAO,MAAM,EAAEA,MAAK,MAAM;AAAI;AAC9B,SAAOA,SAAQ;AACjB;AAEA,MAAM,YAAY,CAAC,OAAO,KAAK,YAAY;AACzC,MAAI,OAAO,UAAU,YAAY,OAAO,QAAQ,UAAU;AACxD,WAAO;AAAA,EACR;AACD,SAAO,QAAQ,cAAc;AAC/B;AAEA,MAAM,MAAM,CAAC,OAAO,WAAW,aAAa;AAC1C,MAAI,YAAY,GAAG;AACjB,QAAI,OAAO,MAAM,CAAC,MAAM,MAAM,MAAM;AACpC,QAAI;AAAM,cAAQ,MAAM,MAAM,CAAC;AAC/B,YAAS,OAAO,MAAM,SAAS,OAAO,YAAY,IAAI,WAAW,GAAG;AAAA,EACrE;AACD,MAAI,aAAa,OAAO;AACtB,WAAO,OAAO,KAAK;AAAA,EACpB;AACD,SAAO;AACT;AAEA,MAAM,WAAW,CAAC,OAAO,cAAc;AACrC,MAAI,WAAW,MAAM,CAAC,MAAM,MAAM,MAAM;AACxC,MAAI,UAAU;AACZ,YAAQ,MAAM,MAAM,CAAC;AACrB;AAAA,EACD;AACD,SAAO,MAAM,SAAS;AAAW,YAAQ,MAAM;AAC/C,SAAO,WAAY,MAAM,QAAS;AACpC;AAEA,MAAM,aAAa,CAAC,OAAO,YAAY;AACrC,QAAM,UAAU,KAAK,CAAC,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC;AACzD,QAAM,UAAU,KAAK,CAAC,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC;AAEzD,MAAI,SAAS,QAAQ,UAAU,KAAK;AACpC,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI;AAEJ,MAAI,MAAM,UAAU,QAAQ;AAC1B,gBAAY,MAAM,UAAU,KAAK,GAAG;AAAA,EACrC;AAED,MAAI,MAAM,UAAU,QAAQ;AAC1B,gBAAY,KAAK,SAAS,MAAM,UAAU,KAAK,GAAG;AAAA,EACnD;AAED,MAAI,aAAa,WAAW;AAC1B,aAAS,GAAG,aAAa;AAAA,EAC7B,OAAS;AACL,aAAS,aAAa;AAAA,EACvB;AAED,MAAI,QAAQ,MAAM;AAChB,WAAO,IAAI,SAAS;AAAA,EACrB;AAED,SAAO;AACT;AAEA,MAAM,UAAU,CAAC,GAAG,GAAG,WAAW,YAAY;AAC5C,MAAI,WAAW;AACb,WAAO,aAAa,GAAG,GAAG,EAAE,MAAM,OAAO,GAAG,QAAO,CAAE;AAAA,EACtD;AAED,MAAI,QAAQ,OAAO,aAAa,CAAC;AACjC,MAAI,MAAM;AAAG,WAAO;AAEpB,MAAI,OAAO,OAAO,aAAa,CAAC;AAChC,SAAO,IAAI,SAAS;AACtB;AAEA,MAAM,UAAU,CAAC,OAAO,KAAK,YAAY;AACvC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,OAAO,QAAQ,SAAS;AAC5B,QAAI,SAAS,QAAQ,UAAU,KAAK;AACpC,WAAO,OAAO,IAAI,SAAS,MAAM,KAAK,GAAG,OAAO,MAAM,KAAK,GAAG;AAAA,EAC/D;AACD,SAAO,aAAa,OAAO,KAAK,OAAO;AACzC;AAEA,MAAM,aAAa,IAAI,SAAS;AAC9B,SAAO,IAAI,WAAW,8BAA8B,KAAK,QAAQ,GAAG,IAAI,CAAC;AAC3E;AAEA,MAAM,eAAe,CAAC,OAAO,KAAK,YAAY;AAC5C,MAAI,QAAQ,iBAAiB;AAAM,UAAM,WAAW,CAAC,OAAO,GAAG,CAAC;AAChE,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,MAAM,YAAY;AACrC,MAAI,QAAQ,iBAAiB,MAAM;AACjC,UAAM,IAAI,UAAU,kBAAkB,sBAAsB;AAAA,EAC7D;AACD,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,OAAO,KAAK,OAAO,GAAG,UAAU,OAAO;AAC1D,MAAI,IAAI,OAAO,KAAK;AACpB,MAAI,IAAI,OAAO,GAAG;AAElB,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,GAAG;AAChD,QAAI,QAAQ,iBAAiB;AAAM,YAAM,WAAW,CAAC,OAAO,GAAG,CAAC;AAChE,WAAO;EACR;AAGD,MAAI,MAAM;AAAG,QAAI;AACjB,MAAI,MAAM;AAAG,QAAI;AAEjB,MAAI,aAAa,IAAI;AACrB,MAAI,cAAc,OAAO,KAAK;AAC9B,MAAI,YAAY,OAAO,GAAG;AAC1B,MAAI,aAAa,OAAO,IAAI;AAC5B,SAAO,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AAEjC,MAAI,SAAS,MAAM,WAAW,KAAK,MAAM,SAAS,KAAK,MAAM,UAAU;AACvE,MAAI,SAAS,SAAS,KAAK,IAAI,YAAY,QAAQ,UAAU,QAAQ,WAAW,MAAM,IAAI;AAC1F,MAAI,WAAW,WAAW,SAAS,UAAU,OAAO,KAAK,OAAO,MAAM;AACtE,MAAI,SAAS,QAAQ,aAAa,UAAU,QAAQ;AAEpD,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,WAAO,QAAQ,SAAS,OAAO,MAAM,GAAG,SAAS,KAAK,MAAM,GAAG,MAAM,OAAO;AAAA,EAC7E;AAED,MAAI,QAAQ,EAAE,WAAW,CAAE,GAAE,WAAW,CAAE,EAAA;AAC1C,MAAI,OAAO,SAAO,MAAM,MAAM,IAAI,cAAc,WAAW,EAAE,KAAK,KAAK,IAAI,GAAG,CAAC;AAC/E,MAAI,QAAQ,CAAA;AACZ,MAAIA,SAAQ;AAEZ,SAAO,aAAa,KAAK,IAAI,KAAK,GAAG;AACnC,QAAI,QAAQ,YAAY,QAAQ,OAAO,GAAG;AACxC,WAAK,CAAC;AAAA,IACZ,OAAW;AACL,YAAM,KAAK,IAAI,OAAO,GAAGA,MAAK,GAAG,QAAQ,QAAQ,CAAC;AAAA,IACnD;AACD,QAAI,aAAa,IAAI,OAAO,IAAI;AAChC,IAAAA;AAAA,EACD;AAED,MAAI,QAAQ,YAAY,MAAM;AAC5B,WAAO,OAAO,IACV,WAAW,OAAO,OAAO,IACzB,QAAQ,OAAO,MAAM,EAAE,MAAM,OAAO,GAAG,QAAO,CAAE;AAAA,EACrD;AAED,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,OAAO,KAAK,OAAO,GAAG,UAAU,OAAO;AAC1D,MAAK,CAAC,SAAS,KAAK,KAAK,MAAM,SAAS,KAAO,CAAC,SAAS,GAAG,KAAK,IAAI,SAAS,GAAI;AAChF,WAAO,aAAa,OAAO,KAAK,OAAO;AAAA,EACxC;AAGD,MAAI,SAAS,QAAQ,cAAc,SAAO,OAAO,aAAa,GAAG;AACjE,MAAI,IAAI,GAAG,QAAQ,WAAW,CAAC;AAC/B,MAAI,IAAI,GAAG,MAAM,WAAW,CAAC;AAE7B,MAAI,aAAa,IAAI;AACrB,MAAI,MAAM,KAAK,IAAI,GAAG,CAAC;AACvB,MAAI,MAAM,KAAK,IAAI,GAAG,CAAC;AAEvB,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,WAAO,QAAQ,KAAK,KAAK,OAAO,OAAO;AAAA,EACxC;AAED,MAAI,QAAQ,CAAA;AACZ,MAAIA,SAAQ;AAEZ,SAAO,aAAa,KAAK,IAAI,KAAK,GAAG;AACnC,UAAM,KAAK,OAAO,GAAGA,MAAK,CAAC;AAC3B,QAAI,aAAa,IAAI,OAAO,IAAI;AAChC,IAAAA;AAAA,EACD;AAED,MAAI,QAAQ,YAAY,MAAM;AAC5B,WAAO,QAAQ,OAAO,MAAM,EAAE,MAAM,OAAO,QAAO,CAAE;AAAA,EACrD;AAED,SAAO;AACT;AAEA,MAAM,OAAO,CAAC,OAAO,KAAK,MAAM,UAAU,CAAA,MAAO;AAC/C,MAAI,OAAO,QAAQ,aAAa,KAAK,GAAG;AACtC,WAAO,CAAC,KAAK;AAAA,EACd;AAED,MAAI,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,GAAG,GAAG;AAC9C,WAAO,aAAa,OAAO,KAAK,OAAO;AAAA,EACxC;AAED,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO,KAAK,OAAO,KAAK,GAAG,EAAE,WAAW,KAAI,CAAE;AAAA,EAC/C;AAED,MAAI,SAAS,IAAI,GAAG;AAClB,WAAO,KAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EAChC;AAED,MAAI,OAAO,EAAE,GAAG;AAChB,MAAI,KAAK,YAAY;AAAM,SAAK,OAAO;AACvC,SAAO,QAAQ,KAAK,QAAQ;AAE5B,MAAI,CAAC,SAAS,IAAI,GAAG;AACnB,QAAI,QAAQ,QAAQ,CAAC,SAAS,IAAI;AAAG,aAAO,YAAY,MAAM,IAAI;AAClE,WAAO,KAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EAChC;AAED,MAAI,SAAS,KAAK,KAAK,SAAS,GAAG,GAAG;AACpC,WAAO,YAAY,OAAO,KAAK,MAAM,IAAI;AAAA,EAC1C;AAED,SAAO,YAAY,OAAO,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI;AAClE;AAEA,IAAA,YAAiB;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fill-range/index.js

@@ -0,0 +1,211 @@
+import require$$0 from "util";
+import toRegexRange_1 from "../to-regex-range/index.js";
+/*!
+ * fill-range <https://github.com/jonschlinkert/fill-range>
+ *
+ * Copyright (c) 2014-present, Jon Schlinkert.
+ * Licensed under the MIT License.
+ */
+const util = require$$0;
+const toRegexRange = toRegexRange_1;
+const isObject = (val) => val !== null && typeof val === "object" && !Array.isArray(val);
+const transform = (toNumber) => {
+  return (value) => toNumber === true ? Number(value) : String(value);
+};
+const isValidValue = (value) => {
+  return typeof value === "number" || typeof value === "string" && value !== "";
+};
+const isNumber = (num) => Number.isInteger(+num);
+const zeros = (input) => {
+  let value = `${input}`;
+  let index = -1;
+  if (value[0] === "-")
+    value = value.slice(1);
+  if (value === "0")
+    return false;
+  while (value[++index] === "0")
+    ;
+  return index > 0;
+};
+const stringify = (start, end, options) => {
+  if (typeof start === "string" || typeof end === "string") {
+    return true;
+  }
+  return options.stringify === true;
+};
+const pad = (input, maxLength, toNumber) => {
+  if (maxLength > 0) {
+    let dash = input[0] === "-" ? "-" : "";
+    if (dash)
+      input = input.slice(1);
+    input = dash + input.padStart(dash ? maxLength - 1 : maxLength, "0");
+  }
+  if (toNumber === false) {
+    return String(input);
+  }
+  return input;
+};
+const toMaxLen = (input, maxLength) => {
+  let negative = input[0] === "-" ? "-" : "";
+  if (negative) {
+    input = input.slice(1);
+    maxLength--;
+  }
+  while (input.length < maxLength)
+    input = "0" + input;
+  return negative ? "-" + input : input;
+};
+const toSequence = (parts, options) => {
+  parts.negatives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  parts.positives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);
+  let prefix = options.capture ? "" : "?:";
+  let positives = "";
+  let negatives = "";
+  let result;
+  if (parts.positives.length) {
+    positives = parts.positives.join("|");
+  }
+  if (parts.negatives.length) {
+    negatives = `-(${prefix}${parts.negatives.join("|")})`;
+  }
+  if (positives && negatives) {
+    result = `${positives}|${negatives}`;
+  } else {
+    result = positives || negatives;
+  }
+  if (options.wrap) {
+    return `(${prefix}${result})`;
+  }
+  return result;
+};
+const toRange = (a, b, isNumbers, options) => {
+  if (isNumbers) {
+    return toRegexRange(a, b, { wrap: false, ...options });
+  }
+  let start = String.fromCharCode(a);
+  if (a === b)
+    return start;
+  let stop = String.fromCharCode(b);
+  return `[${start}-${stop}]`;
+};
+const toRegex = (start, end, options) => {
+  if (Array.isArray(start)) {
+    let wrap = options.wrap === true;
+    let prefix = options.capture ? "" : "?:";
+    return wrap ? `(${prefix}${start.join("|")})` : start.join("|");
+  }
+  return toRegexRange(start, end, options);
+};
+const rangeError = (...args) => {
+  return new RangeError("Invalid range arguments: " + util.inspect(...args));
+};
+const invalidRange = (start, end, options) => {
+  if (options.strictRanges === true)
+    throw rangeError([start, end]);
+  return [];
+};
+const invalidStep = (step, options) => {
+  if (options.strictRanges === true) {
+    throw new TypeError(`Expected step "${step}" to be a number`);
+  }
+  return [];
+};
+const fillNumbers = (start, end, step = 1, options = {}) => {
+  let a = Number(start);
+  let b = Number(end);
+  if (!Number.isInteger(a) || !Number.isInteger(b)) {
+    if (options.strictRanges === true)
+      throw rangeError([start, end]);
+    return [];
+  }
+  if (a === 0)
+    a = 0;
+  if (b === 0)
+    b = 0;
+  let descending = a > b;
+  let startString = String(start);
+  let endString = String(end);
+  let stepString = String(step);
+  step = Math.max(Math.abs(step), 1);
+  let padded = zeros(startString) || zeros(endString) || zeros(stepString);
+  let maxLen = padded ? Math.max(startString.length, endString.length, stepString.length) : 0;
+  let toNumber = padded === false && stringify(start, end, options) === false;
+  let format = options.transform || transform(toNumber);
+  if (options.toRegex && step === 1) {
+    return toRange(toMaxLen(start, maxLen), toMaxLen(end, maxLen), true, options);
+  }
+  let parts = { negatives: [], positives: [] };
+  let push = (num) => parts[num < 0 ? "negatives" : "positives"].push(Math.abs(num));
+  let range = [];
+  let index = 0;
+  while (descending ? a >= b : a <= b) {
+    if (options.toRegex === true && step > 1) {
+      push(a);
+    } else {
+      range.push(pad(format(a, index), maxLen, toNumber));
+    }
+    a = descending ? a - step : a + step;
+    index++;
+  }
+  if (options.toRegex === true) {
+    return step > 1 ? toSequence(parts, options) : toRegex(range, null, { wrap: false, ...options });
+  }
+  return range;
+};
+const fillLetters = (start, end, step = 1, options = {}) => {
+  if (!isNumber(start) && start.length > 1 || !isNumber(end) && end.length > 1) {
+    return invalidRange(start, end, options);
+  }
+  let format = options.transform || ((val) => String.fromCharCode(val));
+  let a = `${start}`.charCodeAt(0);
+  let b = `${end}`.charCodeAt(0);
+  let descending = a > b;
+  let min = Math.min(a, b);
+  let max = Math.max(a, b);
+  if (options.toRegex && step === 1) {
+    return toRange(min, max, false, options);
+  }
+  let range = [];
+  let index = 0;
+  while (descending ? a >= b : a <= b) {
+    range.push(format(a, index));
+    a = descending ? a - step : a + step;
+    index++;
+  }
+  if (options.toRegex === true) {
+    return toRegex(range, null, { wrap: false, options });
+  }
+  return range;
+};
+const fill = (start, end, step, options = {}) => {
+  if (end == null && isValidValue(start)) {
+    return [start];
+  }
+  if (!isValidValue(start) || !isValidValue(end)) {
+    return invalidRange(start, end, options);
+  }
+  if (typeof step === "function") {
+    return fill(start, end, 1, { transform: step });
+  }
+  if (isObject(step)) {
+    return fill(start, end, 0, step);
+  }
+  let opts = { ...options };
+  if (opts.capture === true)
+    opts.wrap = true;
+  step = step || opts.step || 1;
+  if (!isNumber(step)) {
+    if (step != null && !isObject(step))
+      return invalidStep(step, opts);
+    return fill(start, end, 1, step);
+  }
+  if (isNumber(start) && isNumber(end)) {
+    return fillNumbers(start, end, step, opts);
+  }
+  return fillLetters(start, end, Math.max(Math.abs(step), 1), opts);
+};
+var fillRange = fill;
+export {
+  fillRange as default
+};
+//# sourceMappingURL=index.js.map

package/dist/_node_modules/fill-range/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/fill-range/index.js"],"sourcesContent":["/*!\n * fill-range <https://github.com/jonschlinkert/fill-range>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n'use strict';\n\nconst util = require('util');\nconst toRegexRange = require('to-regex-range');\n\nconst isObject = val => val !== null && typeof val === 'object' && !Array.isArray(val);\n\nconst transform = toNumber => {\n  return value => toNumber === true ? Number(value) : String(value);\n};\n\nconst isValidValue = value => {\n  return typeof value === 'number' || (typeof value === 'string' && value !== '');\n};\n\nconst isNumber = num => Number.isInteger(+num);\n\nconst zeros = input => {\n  let value = `${input}`;\n  let index = -1;\n  if (value[0] === '-') value = value.slice(1);\n  if (value === '0') return false;\n  while (value[++index] === '0');\n  return index > 0;\n};\n\nconst stringify = (start, end, options) => {\n  if (typeof start === 'string' || typeof end === 'string') {\n    return true;\n  }\n  return options.stringify === true;\n};\n\nconst pad = (input, maxLength, toNumber) => {\n  if (maxLength > 0) {\n    let dash = input[0] === '-' ? '-' : '';\n    if (dash) input = input.slice(1);\n    input = (dash + input.padStart(dash ? maxLength - 1 : maxLength, '0'));\n  }\n  if (toNumber === false) {\n    return String(input);\n  }\n  return input;\n};\n\nconst toMaxLen = (input, maxLength) => {\n  let negative = input[0] === '-' ? '-' : '';\n  if (negative) {\n    input = input.slice(1);\n    maxLength--;\n  }\n  while (input.length < maxLength) input = '0' + input;\n  return negative ? ('-' + input) : input;\n};\n\nconst toSequence = (parts, options) => {\n  parts.negatives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);\n  parts.positives.sort((a, b) => a < b ? -1 : a > b ? 1 : 0);\n\n  let prefix = options.capture ? '' : '?:';\n  let positives = '';\n  let negatives = '';\n  let result;\n\n  if (parts.positives.length) {\n    positives = parts.positives.join('|');\n  }\n\n  if (parts.negatives.length) {\n    negatives = `-(${prefix}${parts.negatives.join('|')})`;\n  }\n\n  if (positives && negatives) {\n    result = `${positives}|${negatives}`;\n  } else {\n    result = positives || negatives;\n  }\n\n  if (options.wrap) {\n    return `(${prefix}${result})`;\n  }\n\n  return result;\n};\n\nconst toRange = (a, b, isNumbers, options) => {\n  if (isNumbers) {\n    return toRegexRange(a, b, { wrap: false, ...options });\n  }\n\n  let start = String.fromCharCode(a);\n  if (a === b) return start;\n\n  let stop = String.fromCharCode(b);\n  return `[${start}-${stop}]`;\n};\n\nconst toRegex = (start, end, options) => {\n  if (Array.isArray(start)) {\n    let wrap = options.wrap === true;\n    let prefix = options.capture ? '' : '?:';\n    return wrap ? `(${prefix}${start.join('|')})` : start.join('|');\n  }\n  return toRegexRange(start, end, options);\n};\n\nconst rangeError = (...args) => {\n  return new RangeError('Invalid range arguments: ' + util.inspect(...args));\n};\n\nconst invalidRange = (start, end, options) => {\n  if (options.strictRanges === true) throw rangeError([start, end]);\n  return [];\n};\n\nconst invalidStep = (step, options) => {\n  if (options.strictRanges === true) {\n    throw new TypeError(`Expected step \"${step}\" to be a number`);\n  }\n  return [];\n};\n\nconst fillNumbers = (start, end, step = 1, options = {}) => {\n  let a = Number(start);\n  let b = Number(end);\n\n  if (!Number.isInteger(a) || !Number.isInteger(b)) {\n    if (options.strictRanges === true) throw rangeError([start, end]);\n    return [];\n  }\n\n  // fix negative zero\n  if (a === 0) a = 0;\n  if (b === 0) b = 0;\n\n  let descending = a > b;\n  let startString = String(start);\n  let endString = String(end);\n  let stepString = String(step);\n  step = Math.max(Math.abs(step), 1);\n\n  let padded = zeros(startString) || zeros(endString) || zeros(stepString);\n  let maxLen = padded ? Math.max(startString.length, endString.length, stepString.length) : 0;\n  let toNumber = padded === false && stringify(start, end, options) === false;\n  let format = options.transform || transform(toNumber);\n\n  if (options.toRegex && step === 1) {\n    return toRange(toMaxLen(start, maxLen), toMaxLen(end, maxLen), true, options);\n  }\n\n  let parts = { negatives: [], positives: [] };\n  let push = num => parts[num < 0 ? 'negatives' : 'positives'].push(Math.abs(num));\n  let range = [];\n  let index = 0;\n\n  while (descending ? a >= b : a <= b) {\n    if (options.toRegex === true && step > 1) {\n      push(a);\n    } else {\n      range.push(pad(format(a, index), maxLen, toNumber));\n    }\n    a = descending ? a - step : a + step;\n    index++;\n  }\n\n  if (options.toRegex === true) {\n    return step > 1\n      ? toSequence(parts, options)\n      : toRegex(range, null, { wrap: false, ...options });\n  }\n\n  return range;\n};\n\nconst fillLetters = (start, end, step = 1, options = {}) => {\n  if ((!isNumber(start) && start.length > 1) || (!isNumber(end) && end.length > 1)) {\n    return invalidRange(start, end, options);\n  }\n\n\n  let format = options.transform || (val => String.fromCharCode(val));\n  let a = `${start}`.charCodeAt(0);\n  let b = `${end}`.charCodeAt(0);\n\n  let descending = a > b;\n  let min = Math.min(a, b);\n  let max = Math.max(a, b);\n\n  if (options.toRegex && step === 1) {\n    return toRange(min, max, false, options);\n  }\n\n  let range = [];\n  let index = 0;\n\n  while (descending ? a >= b : a <= b) {\n    range.push(format(a, index));\n    a = descending ? a - step : a + step;\n    index++;\n  }\n\n  if (options.toRegex === true) {\n    return toRegex(range, null, { wrap: false, options });\n  }\n\n  return range;\n};\n\nconst fill = (start, end, step, options = {}) => {\n  if (end == null && isValidValue(start)) {\n    return [start];\n  }\n\n  if (!isValidValue(start) || !isValidValue(end)) {\n    return invalidRange(start, end, options);\n  }\n\n  if (typeof step === 'function') {\n    return fill(start, end, 1, { transform: step });\n  }\n\n  if (isObject(step)) {\n    return fill(start, end, 0, step);\n  }\n\n  let opts = { ...options };\n  if (opts.capture === true) opts.wrap = true;\n  step = step || opts.step || 1;\n\n  if (!isNumber(step)) {\n    if (step != null && !isObject(step)) return invalidStep(step, opts);\n    return fill(start, end, 1, step);\n  }\n\n  if (isNumber(start) && isNumber(end)) {\n    return fillNumbers(start, end, step, opts);\n  }\n\n  return fillLetters(start, end, Math.max(Math.abs(step), 1), opts);\n};\n\nmodule.exports = fill;\n"],"names":["require$$1"],"mappings":";;;;;;;;AASA,MAAM,OAAO;AACb,MAAM,eAAeA;AAErB,MAAM,WAAW,SAAO,QAAQ,QAAQ,OAAO,QAAQ,YAAY,CAAC,MAAM,QAAQ,GAAG;AAErF,MAAM,YAAY,cAAY;AAC5B,SAAO,WAAS,aAAa,OAAO,OAAO,KAAK,IAAI,OAAO,KAAK;AAClE;AAEA,MAAM,eAAe,WAAS;AAC5B,SAAO,OAAO,UAAU,YAAa,OAAO,UAAU,YAAY,UAAU;AAC9E;AAEA,MAAM,WAAW,SAAO,OAAO,UAAU,CAAC,GAAG;AAE7C,MAAM,QAAQ,WAAS;AACrB,MAAI,QAAQ,GAAG;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM,CAAC,MAAM;AAAK,YAAQ,MAAM,MAAM,CAAC;AAC3C,MAAI,UAAU;AAAK,WAAO;AAC1B,SAAO,MAAM,EAAE,KAAK,MAAM;AAAI;AAC9B,SAAO,QAAQ;AACjB;AAEA,MAAM,YAAY,CAAC,OAAO,KAAK,YAAY;AACzC,MAAI,OAAO,UAAU,YAAY,OAAO,QAAQ,UAAU;AACxD,WAAO;AAAA,EACR;AACD,SAAO,QAAQ,cAAc;AAC/B;AAEA,MAAM,MAAM,CAAC,OAAO,WAAW,aAAa;AAC1C,MAAI,YAAY,GAAG;AACjB,QAAI,OAAO,MAAM,CAAC,MAAM,MAAM,MAAM;AACpC,QAAI;AAAM,cAAQ,MAAM,MAAM,CAAC;AAC/B,YAAS,OAAO,MAAM,SAAS,OAAO,YAAY,IAAI,WAAW,GAAG;AAAA,EACrE;AACD,MAAI,aAAa,OAAO;AACtB,WAAO,OAAO,KAAK;AAAA,EACpB;AACD,SAAO;AACT;AAEA,MAAM,WAAW,CAAC,OAAO,cAAc;AACrC,MAAI,WAAW,MAAM,CAAC,MAAM,MAAM,MAAM;AACxC,MAAI,UAAU;AACZ,YAAQ,MAAM,MAAM,CAAC;AACrB;AAAA,EACD;AACD,SAAO,MAAM,SAAS;AAAW,YAAQ,MAAM;AAC/C,SAAO,WAAY,MAAM,QAAS;AACpC;AAEA,MAAM,aAAa,CAAC,OAAO,YAAY;AACrC,QAAM,UAAU,KAAK,CAAC,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC;AACzD,QAAM,UAAU,KAAK,CAAC,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC;AAEzD,MAAI,SAAS,QAAQ,UAAU,KAAK;AACpC,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI;AAEJ,MAAI,MAAM,UAAU,QAAQ;AAC1B,gBAAY,MAAM,UAAU,KAAK,GAAG;AAAA,EACrC;AAED,MAAI,MAAM,UAAU,QAAQ;AAC1B,gBAAY,KAAK,SAAS,MAAM,UAAU,KAAK,GAAG;AAAA,EACnD;AAED,MAAI,aAAa,WAAW;AAC1B,aAAS,GAAG,aAAa;AAAA,EAC7B,OAAS;AACL,aAAS,aAAa;AAAA,EACvB;AAED,MAAI,QAAQ,MAAM;AAChB,WAAO,IAAI,SAAS;AAAA,EACrB;AAED,SAAO;AACT;AAEA,MAAM,UAAU,CAAC,GAAG,GAAG,WAAW,YAAY;AAC5C,MAAI,WAAW;AACb,WAAO,aAAa,GAAG,GAAG,EAAE,MAAM,OAAO,GAAG,QAAO,CAAE;AAAA,EACtD;AAED,MAAI,QAAQ,OAAO,aAAa,CAAC;AACjC,MAAI,MAAM;AAAG,WAAO;AAEpB,MAAI,OAAO,OAAO,aAAa,CAAC;AAChC,SAAO,IAAI,SAAS;AACtB;AAEA,MAAM,UAAU,CAAC,OAAO,KAAK,YAAY;AACvC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,OAAO,QAAQ,SAAS;AAC5B,QAAI,SAAS,QAAQ,UAAU,KAAK;AACpC,WAAO,OAAO,IAAI,SAAS,MAAM,KAAK,GAAG,OAAO,MAAM,KAAK,GAAG;AAAA,EAC/D;AACD,SAAO,aAAa,OAAO,KAAK,OAAO;AACzC;AAEA,MAAM,aAAa,IAAI,SAAS;AAC9B,SAAO,IAAI,WAAW,8BAA8B,KAAK,QAAQ,GAAG,IAAI,CAAC;AAC3E;AAEA,MAAM,eAAe,CAAC,OAAO,KAAK,YAAY;AAC5C,MAAI,QAAQ,iBAAiB;AAAM,UAAM,WAAW,CAAC,OAAO,GAAG,CAAC;AAChE,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,MAAM,YAAY;AACrC,MAAI,QAAQ,iBAAiB,MAAM;AACjC,UAAM,IAAI,UAAU,kBAAkB,sBAAsB;AAAA,EAC7D;AACD,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,OAAO,KAAK,OAAO,GAAG,UAAU,OAAO;AAC1D,MAAI,IAAI,OAAO,KAAK;AACpB,MAAI,IAAI,OAAO,GAAG;AAElB,MAAI,CAAC,OAAO,UAAU,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,GAAG;AAChD,QAAI,QAAQ,iBAAiB;AAAM,YAAM,WAAW,CAAC,OAAO,GAAG,CAAC;AAChE,WAAO;EACR;AAGD,MAAI,MAAM;AAAG,QAAI;AACjB,MAAI,MAAM;AAAG,QAAI;AAEjB,MAAI,aAAa,IAAI;AACrB,MAAI,cAAc,OAAO,KAAK;AAC9B,MAAI,YAAY,OAAO,GAAG;AAC1B,MAAI,aAAa,OAAO,IAAI;AAC5B,SAAO,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC;AAEjC,MAAI,SAAS,MAAM,WAAW,KAAK,MAAM,SAAS,KAAK,MAAM,UAAU;AACvE,MAAI,SAAS,SAAS,KAAK,IAAI,YAAY,QAAQ,UAAU,QAAQ,WAAW,MAAM,IAAI;AAC1F,MAAI,WAAW,WAAW,SAAS,UAAU,OAAO,KAAK,OAAO,MAAM;AACtE,MAAI,SAAS,QAAQ,aAAa,UAAU,QAAQ;AAEpD,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,WAAO,QAAQ,SAAS,OAAO,MAAM,GAAG,SAAS,KAAK,MAAM,GAAG,MAAM,OAAO;AAAA,EAC7E;AAED,MAAI,QAAQ,EAAE,WAAW,CAAE,GAAE,WAAW,CAAE,EAAA;AAC1C,MAAI,OAAO,SAAO,MAAM,MAAM,IAAI,cAAc,WAAW,EAAE,KAAK,KAAK,IAAI,GAAG,CAAC;AAC/E,MAAI,QAAQ,CAAA;AACZ,MAAI,QAAQ;AAEZ,SAAO,aAAa,KAAK,IAAI,KAAK,GAAG;AACnC,QAAI,QAAQ,YAAY,QAAQ,OAAO,GAAG;AACxC,WAAK,CAAC;AAAA,IACZ,OAAW;AACL,YAAM,KAAK,IAAI,OAAO,GAAG,KAAK,GAAG,QAAQ,QAAQ,CAAC;AAAA,IACnD;AACD,QAAI,aAAa,IAAI,OAAO,IAAI;AAChC;AAAA,EACD;AAED,MAAI,QAAQ,YAAY,MAAM;AAC5B,WAAO,OAAO,IACV,WAAW,OAAO,OAAO,IACzB,QAAQ,OAAO,MAAM,EAAE,MAAM,OAAO,GAAG,QAAO,CAAE;AAAA,EACrD;AAED,SAAO;AACT;AAEA,MAAM,cAAc,CAAC,OAAO,KAAK,OAAO,GAAG,UAAU,OAAO;AAC1D,MAAK,CAAC,SAAS,KAAK,KAAK,MAAM,SAAS,KAAO,CAAC,SAAS,GAAG,KAAK,IAAI,SAAS,GAAI;AAChF,WAAO,aAAa,OAAO,KAAK,OAAO;AAAA,EACxC;AAGD,MAAI,SAAS,QAAQ,cAAc,SAAO,OAAO,aAAa,GAAG;AACjE,MAAI,IAAI,GAAG,QAAQ,WAAW,CAAC;AAC/B,MAAI,IAAI,GAAG,MAAM,WAAW,CAAC;AAE7B,MAAI,aAAa,IAAI;AACrB,MAAI,MAAM,KAAK,IAAI,GAAG,CAAC;AACvB,MAAI,MAAM,KAAK,IAAI,GAAG,CAAC;AAEvB,MAAI,QAAQ,WAAW,SAAS,GAAG;AACjC,WAAO,QAAQ,KAAK,KAAK,OAAO,OAAO;AAAA,EACxC;AAED,MAAI,QAAQ,CAAA;AACZ,MAAI,QAAQ;AAEZ,SAAO,aAAa,KAAK,IAAI,KAAK,GAAG;AACnC,UAAM,KAAK,OAAO,GAAG,KAAK,CAAC;AAC3B,QAAI,aAAa,IAAI,OAAO,IAAI;AAChC;AAAA,EACD;AAED,MAAI,QAAQ,YAAY,MAAM;AAC5B,WAAO,QAAQ,OAAO,MAAM,EAAE,MAAM,OAAO,QAAO,CAAE;AAAA,EACrD;AAED,SAAO;AACT;AAEA,MAAM,OAAO,CAAC,OAAO,KAAK,MAAM,UAAU,CAAA,MAAO;AAC/C,MAAI,OAAO,QAAQ,aAAa,KAAK,GAAG;AACtC,WAAO,CAAC,KAAK;AAAA,EACd;AAED,MAAI,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,GAAG,GAAG;AAC9C,WAAO,aAAa,OAAO,KAAK,OAAO;AAAA,EACxC;AAED,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO,KAAK,OAAO,KAAK,GAAG,EAAE,WAAW,KAAI,CAAE;AAAA,EAC/C;AAED,MAAI,SAAS,IAAI,GAAG;AAClB,WAAO,KAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EAChC;AAED,MAAI,OAAO,EAAE,GAAG;AAChB,MAAI,KAAK,YAAY;AAAM,SAAK,OAAO;AACvC,SAAO,QAAQ,KAAK,QAAQ;AAE5B,MAAI,CAAC,SAAS,IAAI,GAAG;AACnB,QAAI,QAAQ,QAAQ,CAAC,SAAS,IAAI;AAAG,aAAO,YAAY,MAAM,IAAI;AAClE,WAAO,KAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EAChC;AAED,MAAI,SAAS,KAAK,KAAK,SAAS,GAAG,GAAG;AACpC,WAAO,YAAY,OAAO,KAAK,MAAM,IAAI;AAAA,EAC1C;AAED,SAAO,YAAY,OAAO,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI;AAClE;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}

package/dist/_node_modules/function-bind/implementation.cjs

@@ -0,0 +1,46 @@
+"use strict";
+var ERROR_MESSAGE = "Function.prototype.bind called on incompatible ";
+var slice = Array.prototype.slice;
+var toStr = Object.prototype.toString;
+var funcType = "[object Function]";
+var implementation = function bind(that) {
+  var target = this;
+  if (typeof target !== "function" || toStr.call(target) !== funcType) {
+    throw new TypeError(ERROR_MESSAGE + target);
+  }
+  var args = slice.call(arguments, 1);
+  var bound;
+  var binder = function() {
+    if (this instanceof bound) {
+      var result = target.apply(
+        this,
+        args.concat(slice.call(arguments))
+      );
+      if (Object(result) === result) {
+        return result;
+      }
+      return this;
+    } else {
+      return target.apply(
+        that,
+        args.concat(slice.call(arguments))
+      );
+    }
+  };
+  var boundLength = Math.max(0, target.length - args.length);
+  var boundArgs = [];
+  for (var i = 0; i < boundLength; i++) {
+    boundArgs.push("$" + i);
+  }
+  bound = Function("binder", "return function (" + boundArgs.join(",") + "){ return binder.apply(this,arguments); }")(binder);
+  if (target.prototype) {
+    var Empty = function Empty2() {
+    };
+    Empty.prototype = target.prototype;
+    bound.prototype = new Empty();
+    Empty.prototype = null;
+  }
+  return bound;
+};
+module.exports = implementation;
+//# sourceMappingURL=implementation.cjs.map

package/dist/_node_modules/function-bind/implementation.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"implementation.cjs","sources":["../../../../../node_modules/function-bind/implementation.js"],"sourcesContent":["'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slice.call(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                args.concat(slice.call(arguments))\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        } else {\n            return target.apply(\n                that,\n                args.concat(slice.call(arguments))\n            );\n        }\n    };\n\n    var boundLength = Math.max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs.push('$' + i);\n    }\n\n    bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n"],"names":["Empty"],"mappings":";AAIA,IAAI,gBAAgB;AACpB,IAAI,QAAQ,MAAM,UAAU;AAC5B,IAAI,QAAQ,OAAO,UAAU;AAC7B,IAAI,WAAW;AAEf,IAAA,iBAAiB,SAAS,KAAK,MAAM;AACjC,MAAI,SAAS;AACb,MAAI,OAAO,WAAW,cAAc,MAAM,KAAK,MAAM,MAAM,UAAU;AACjE,UAAM,IAAI,UAAU,gBAAgB,MAAM;AAAA,EAC7C;AACD,MAAI,OAAO,MAAM,KAAK,WAAW,CAAC;AAElC,MAAI;AACJ,MAAI,SAAS,WAAY;AACrB,QAAI,gBAAgB,OAAO;AACvB,UAAI,SAAS,OAAO;AAAA,QAChB;AAAA,QACA,KAAK,OAAO,MAAM,KAAK,SAAS,CAAC;AAAA,MACjD;AACY,UAAI,OAAO,MAAM,MAAM,QAAQ;AAC3B,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACnB,OAAe;AACH,aAAO,OAAO;AAAA,QACV;AAAA,QACA,KAAK,OAAO,MAAM,KAAK,SAAS,CAAC;AAAA,MACjD;AAAA,IACS;AAAA,EACT;AAEI,MAAI,cAAc,KAAK,IAAI,GAAG,OAAO,SAAS,KAAK,MAAM;AACzD,MAAI,YAAY,CAAA;AAChB,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AAClC,cAAU,KAAK,MAAM,CAAC;AAAA,EACzB;AAED,UAAQ,SAAS,UAAU,sBAAsB,UAAU,KAAK,GAAG,IAAI,2CAA2C,EAAE,MAAM;AAE1H,MAAI,OAAO,WAAW;AAClB,QAAI,QAAQ,SAASA,SAAQ;AAAA;AAC7B,UAAM,YAAY,OAAO;AACzB,UAAM,YAAY,IAAI;AACtB,UAAM,YAAY;AAAA,EACrB;AAED,SAAO;AACX;;","x_google_ignoreList":[0]}

package/dist/_node_modules/function-bind/implementation.js

@@ -0,0 +1,47 @@
+var ERROR_MESSAGE = "Function.prototype.bind called on incompatible ";
+var slice = Array.prototype.slice;
+var toStr = Object.prototype.toString;
+var funcType = "[object Function]";
+var implementation = function bind(that) {
+  var target = this;
+  if (typeof target !== "function" || toStr.call(target) !== funcType) {
+    throw new TypeError(ERROR_MESSAGE + target);
+  }
+  var args = slice.call(arguments, 1);
+  var bound;
+  var binder = function() {
+    if (this instanceof bound) {
+      var result = target.apply(
+        this,
+        args.concat(slice.call(arguments))
+      );
+      if (Object(result) === result) {
+        return result;
+      }
+      return this;
+    } else {
+      return target.apply(
+        that,
+        args.concat(slice.call(arguments))
+      );
+    }
+  };
+  var boundLength = Math.max(0, target.length - args.length);
+  var boundArgs = [];
+  for (var i = 0; i < boundLength; i++) {
+    boundArgs.push("$" + i);
+  }
+  bound = Function("binder", "return function (" + boundArgs.join(",") + "){ return binder.apply(this,arguments); }")(binder);
+  if (target.prototype) {
+    var Empty = function Empty2() {
+    };
+    Empty.prototype = target.prototype;
+    bound.prototype = new Empty();
+    Empty.prototype = null;
+  }
+  return bound;
+};
+export {
+  implementation as default
+};
+//# sourceMappingURL=implementation.js.map

package/dist/_node_modules/function-bind/implementation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"implementation.js","sources":["../../../../../node_modules/function-bind/implementation.js"],"sourcesContent":["'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slice.call(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                args.concat(slice.call(arguments))\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        } else {\n            return target.apply(\n                that,\n                args.concat(slice.call(arguments))\n            );\n        }\n    };\n\n    var boundLength = Math.max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs.push('$' + i);\n    }\n\n    bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n"],"names":["Empty"],"mappings":"AAIA,IAAI,gBAAgB;AACpB,IAAI,QAAQ,MAAM,UAAU;AAC5B,IAAI,QAAQ,OAAO,UAAU;AAC7B,IAAI,WAAW;AAEf,IAAA,iBAAiB,SAAS,KAAK,MAAM;AACjC,MAAI,SAAS;AACb,MAAI,OAAO,WAAW,cAAc,MAAM,KAAK,MAAM,MAAM,UAAU;AACjE,UAAM,IAAI,UAAU,gBAAgB,MAAM;AAAA,EAC7C;AACD,MAAI,OAAO,MAAM,KAAK,WAAW,CAAC;AAElC,MAAI;AACJ,MAAI,SAAS,WAAY;AACrB,QAAI,gBAAgB,OAAO;AACvB,UAAI,SAAS,OAAO;AAAA,QAChB;AAAA,QACA,KAAK,OAAO,MAAM,KAAK,SAAS,CAAC;AAAA,MACjD;AACY,UAAI,OAAO,MAAM,MAAM,QAAQ;AAC3B,eAAO;AAAA,MACV;AACD,aAAO;AAAA,IACnB,OAAe;AACH,aAAO,OAAO;AAAA,QACV;AAAA,QACA,KAAK,OAAO,MAAM,KAAK,SAAS,CAAC;AAAA,MACjD;AAAA,IACS;AAAA,EACT;AAEI,MAAI,cAAc,KAAK,IAAI,GAAG,OAAO,SAAS,KAAK,MAAM;AACzD,MAAI,YAAY,CAAA;AAChB,WAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AAClC,cAAU,KAAK,MAAM,CAAC;AAAA,EACzB;AAED,UAAQ,SAAS,UAAU,sBAAsB,UAAU,KAAK,GAAG,IAAI,2CAA2C,EAAE,MAAM;AAE1H,MAAI,OAAO,WAAW;AAClB,QAAI,QAAQ,SAASA,SAAQ;AAAA;AAC7B,UAAM,YAAY,OAAO;AACzB,UAAM,YAAY,IAAI;AACtB,UAAM,YAAY;AAAA,EACrB;AAED,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/_node_modules/function-bind/index.cjs

@@ -0,0 +1,6 @@
+"use strict";
+const implementation$1 = require("./implementation.cjs");
+var implementation = implementation$1;
+var functionBind = Function.prototype.bind || implementation;
+module.exports = functionBind;
+//# sourceMappingURL=index.cjs.map

package/dist/_node_modules/function-bind/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/function-bind/index.js"],"sourcesContent":["'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n"],"names":["require$$0"],"mappings":";;AAEA,IAAI,iBAAiBA;AAErB,IAAA,eAAiB,SAAS,UAAU,QAAQ;;","x_google_ignoreList":[0]}

package/dist/_node_modules/function-bind/index.js

@@ -0,0 +1,7 @@
+import implementation$1 from "./implementation.js";
+var implementation = implementation$1;
+var functionBind = Function.prototype.bind || implementation;
+export {
+  functionBind as default
+};
+//# sourceMappingURL=index.js.map

package/dist/_node_modules/function-bind/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/function-bind/index.js"],"sourcesContent":["'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n"],"names":["require$$0"],"mappings":";AAEA,IAAI,iBAAiBA;AAErB,IAAA,eAAiB,SAAS,UAAU,QAAQ;","x_google_ignoreList":[0]}

package/dist/_node_modules/hard-rejection/index.cjs

@@ -0,0 +1,22 @@
+"use strict";
+const index = require("../../_virtual/index.cjs");
+const require$$0 = require("util");
+const util = require$$0;
+let installed = false;
+const hardRejection = (log = console.error) => {
+  if (installed) {
+    return;
+  }
+  installed = true;
+  process.on("unhandledRejection", (error) => {
+    if (!(error instanceof Error)) {
+      error = new Error(`Promise rejected with value: ${util.inspect(error)}`);
+    }
+    log(error.stack);
+    process.exit(1);
+  });
+};
+index.__module.exports = hardRejection;
+index.exports.default = hardRejection;
+module.exports = index.exports;
+//# sourceMappingURL=index.cjs.map

package/dist/_node_modules/hard-rejection/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/hard-rejection/index.js"],"sourcesContent":["'use strict';\nconst util = require('util');\n\nlet installed = false;\n\nconst hardRejection = (log = console.error) => {\n\tif (installed) {\n\t\treturn;\n\t}\n\n\tinstalled = true;\n\n\tprocess.on('unhandledRejection', error => {\n\t\tif (!(error instanceof Error)) {\n\t\t\terror = new Error(`Promise rejected with value: ${util.inspect(error)}`);\n\t\t}\n\n\t\tlog(error.stack);\n\t\tprocess.exit(1);\n\t});\n};\n\nmodule.exports = hardRejection;\n// TODO: Remove this for the next major release\nmodule.exports.default = hardRejection;\n"],"names":["hardRejectionModule","hardRejection_1"],"mappings":";;;AACA,MAAM,OAAO;AAEb,IAAI,YAAY;AAEhB,MAAM,gBAAgB,CAAC,MAAM,QAAQ,UAAU;AAC9C,MAAI,WAAW;AACd;AAAA,EACA;AAED,cAAY;AAEZ,UAAQ,GAAG,sBAAsB,WAAS;AACzC,QAAI,EAAE,iBAAiB,QAAQ;AAC9B,cAAQ,IAAI,MAAM,gCAAgC,KAAK,QAAQ,KAAK,GAAG;AAAA,IACvE;AAED,QAAI,MAAM,KAAK;AACf,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAE;AACF;AAEAA,MAAAA,SAAc,UAAG;AAEjBC,MAAA,QAAA,UAAyB;;","x_google_ignoreList":[0]}

package/dist/_node_modules/hard-rejection/index.js

@@ -0,0 +1,23 @@
+import { exports as hardRejectionExports, __module as hardRejection$1 } from "../../_virtual/index.js";
+import require$$0 from "util";
+const util = require$$0;
+let installed = false;
+const hardRejection = (log = console.error) => {
+  if (installed) {
+    return;
+  }
+  installed = true;
+  process.on("unhandledRejection", (error) => {
+    if (!(error instanceof Error)) {
+      error = new Error(`Promise rejected with value: ${util.inspect(error)}`);
+    }
+    log(error.stack);
+    process.exit(1);
+  });
+};
+hardRejection$1.exports = hardRejection;
+hardRejectionExports.default = hardRejection;
+export {
+  hardRejectionExports as default
+};
+//# sourceMappingURL=index.js.map

package/dist/_node_modules/hard-rejection/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/hard-rejection/index.js"],"sourcesContent":["'use strict';\nconst util = require('util');\n\nlet installed = false;\n\nconst hardRejection = (log = console.error) => {\n\tif (installed) {\n\t\treturn;\n\t}\n\n\tinstalled = true;\n\n\tprocess.on('unhandledRejection', error => {\n\t\tif (!(error instanceof Error)) {\n\t\t\terror = new Error(`Promise rejected with value: ${util.inspect(error)}`);\n\t\t}\n\n\t\tlog(error.stack);\n\t\tprocess.exit(1);\n\t});\n};\n\nmodule.exports = hardRejection;\n// TODO: Remove this for the next major release\nmodule.exports.default = hardRejection;\n"],"names":["hardRejectionModule","hardRejection_1"],"mappings":";;AACA,MAAM,OAAO;AAEb,IAAI,YAAY;AAEhB,MAAM,gBAAgB,CAAC,MAAM,QAAQ,UAAU;AAC9C,MAAI,WAAW;AACd;AAAA,EACA;AAED,cAAY;AAEZ,UAAQ,GAAG,sBAAsB,WAAS;AACzC,QAAI,EAAE,iBAAiB,QAAQ;AAC9B,cAAQ,IAAI,MAAM,gCAAgC,KAAK,QAAQ,KAAK,GAAG;AAAA,IACvE;AAED,QAAI,MAAM,KAAK;AACf,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAE;AACF;AAEAA,gBAAc,UAAG;AAEjBC,qBAAA,UAAyB;","x_google_ignoreList":[0]}