@smartbills/sdk 0.0.2-alpha.11 → 0.0.2-alpha.14

package/dist/cjs/node_modules/.store/node-html-parser-npm-6.1.13-47030d47d6/package/dist/void-tag.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"void-tag.cjs","sources":["../../../../../../../../../node_modules/.store/node-html-parser-npm-6.1.13-47030d47d6/package/dist/void-tag.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar VoidTag = /** @class */ (function () {\n    function VoidTag(addClosingSlash, tags) {\n        if (addClosingSlash === void 0) { addClosingSlash = false; }\n        this.addClosingSlash = addClosingSlash;\n        if (Array.isArray(tags)) {\n            this.voidTags = tags.reduce(function (set, tag) {\n                return set.add(tag.toLowerCase()).add(tag.toUpperCase()).add(tag);\n            }, new Set());\n        }\n        else {\n            this.voidTags = ['area', 'base', 'br', 'col', 'embed', 'hr', 'img', 'input', 'link', 'meta', 'param', 'source', 'track', 'wbr'].reduce(function (set, tag) {\n                return set.add(tag.toLowerCase()).add(tag.toUpperCase()).add(tag);\n            }, new Set());\n        }\n    }\n    VoidTag.prototype.formatNode = function (tag, attrs, innerHTML) {\n        var addClosingSlash = this.addClosingSlash;\n        var closingSpace = (addClosingSlash && attrs && !attrs.endsWith(' ')) ? ' ' : '';\n        var closingSlash = addClosingSlash ? \"\".concat(closingSpace, \"/\") : '';\n        return this.isVoidElement(tag.toLowerCase()) ? \"<\".concat(tag).concat(attrs).concat(closingSlash, \">\") : \"<\".concat(tag).concat(attrs, \">\").concat(innerHTML, \"</\").concat(tag, \">\");\n    };\n    VoidTag.prototype.isVoidElement = function (tag) {\n        return this.voidTags.has(tag);\n    };\n    return VoidTag;\n}());\nexports.default = VoidTag;\n"],"names":["Object","defineProperty","voidTag","value","VoidTag","addClosingSlash","tags","Array","isArray","voidTags","reduce","set","tag","add","toLowerCase","toUpperCase","Set","prototype","formatNode","attrs","innerHTML","closingSpace","endsWith","closingSlash","concat","isVoidElement","has","default"],"mappings":";;;;AACAA,MAAM,CAACC,cAAc,CAACC,iBAAO,EAAE,YAAY,EAAE;AAAEC,EAAAA,KAAK,EAAE,IAAA;AAAI,CAAE,CAAC,CAAA;AAC7D,IAAIC,OAAO,gBAAkB,YAAY;AACrC,EAAA,SAASA,OAAOA,CAACC,eAAe,EAAEC,IAAI,EAAE;AACpC,IAAA,IAAID,eAAe,KAAK,KAAK,CAAC,EAAE;AAAEA,MAAAA,eAAe,GAAG,KAAK,CAAA;AAAG,KAAA;IAC5D,IAAI,CAACA,eAAe,GAAGA,eAAe,CAAA;AACtC,IAAA,IAAIE,KAAK,CAACC,OAAO,CAACF,IAAI,CAAC,EAAE;MACrB,IAAI,CAACG,QAAQ,GAAGH,IAAI,CAACI,MAAM,CAAC,UAAUC,GAAG,EAAEC,GAAG,EAAE;QAC5C,OAAOD,GAAG,CAACE,GAAG,CAACD,GAAG,CAACE,WAAW,EAAE,CAAC,CAACD,GAAG,CAACD,GAAG,CAACG,WAAW,EAAE,CAAC,CAACF,GAAG,CAACD,GAAG,CAAC,CAAA;AACjF,OAAa,EAAE,IAAII,GAAG,EAAE,CAAC,CAAA;AAChB,KAAA,MACI;AACD,MAAA,IAAI,CAACP,QAAQ,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAACC,MAAM,CAAC,UAAUC,GAAG,EAAEC,GAAG,EAAE;QACvJ,OAAOD,GAAG,CAACE,GAAG,CAACD,GAAG,CAACE,WAAW,EAAE,CAAC,CAACD,GAAG,CAACD,GAAG,CAACG,WAAW,EAAE,CAAC,CAACF,GAAG,CAACD,GAAG,CAAC,CAAA;AACjF,OAAa,EAAE,IAAII,GAAG,EAAE,CAAC,CAAA;AAChB,KAAA;AACJ,GAAA;EACDZ,OAAO,CAACa,SAAS,CAACC,UAAU,GAAG,UAAUN,GAAG,EAAEO,KAAK,EAAEC,SAAS,EAAE;AAC5D,IAAA,IAAIf,eAAe,GAAG,IAAI,CAACA,eAAe,CAAA;AAC1C,IAAA,IAAIgB,YAAY,GAAIhB,eAAe,IAAIc,KAAK,IAAI,CAACA,KAAK,CAACG,QAAQ,CAAC,GAAG,CAAC,GAAI,GAAG,GAAG,EAAE,CAAA;AAChF,IAAA,IAAIC,YAAY,GAAGlB,eAAe,GAAG,EAAE,CAACmB,MAAM,CAACH,YAAY,EAAE,GAAG,CAAC,GAAG,EAAE,CAAA;IACtE,OAAO,IAAI,CAACI,aAAa,CAACb,GAAG,CAACE,WAAW,EAAE,CAAC,GAAG,GAAG,CAACU,MAAM,CAACZ,GAAG,CAAC,CAACY,MAAM,CAACL,KAAK,CAAC,CAACK,MAAM,CAACD,YAAY,EAAE,GAAG,CAAC,GAAG,GAAG,CAACC,MAAM,CAACZ,GAAG,CAAC,CAACY,MAAM,CAACL,KAAK,EAAE,GAAG,CAAC,CAACK,MAAM,CAACJ,SAAS,EAAE,IAAI,CAAC,CAACI,MAAM,CAACZ,GAAG,EAAE,GAAG,CAAC,CAAA;GACvL,CAAA;AACDR,EAAAA,OAAO,CAACa,SAAS,CAACQ,aAAa,GAAG,UAAUb,GAAG,EAAE;AAC7C,IAAA,OAAO,IAAI,CAACH,QAAQ,CAACiB,GAAG,CAACd,GAAG,CAAC,CAAA;GAChC,CAAA;AACD,EAAA,OAAOR,OAAO,CAAA;AAClB,CAAC,EAAG,CAAA;AACJF,iBAAA,CAAAyB,OAAe,GAAGvB;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/compile.cjs

@@ -1,143 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var _commonjsHelpers = require('../../../../../_virtual/_commonjsHelpers.cjs');
-var compile$1 = require('../../../../../_virtual/compile2.cjs');
-var index = require('../../../boolbase-npm-1.0.0-965fe9af6d/package/index.cjs');
-
-var __importDefault = _commonjsHelpers.commonjsGlobal && _commonjsHelpers.commonjsGlobal.__importDefault || function (mod) {
-  return mod && mod.__esModule ? mod : {
-    "default": mod
-  };
-};
-Object.defineProperty(compile$1.__exports, "__esModule", {
-  value: true
-});
-compile$1.__exports.generate = compile$1.__exports.compile = void 0;
-var boolbase_1 = __importDefault(index._package);
-/**
- * Returns a function that checks if an elements index matches the given rule
- * highly optimized to return the fastest solution.
- *
- * @param parsed A tuple [a, b], as returned by `parse`.
- * @returns A highly optimized function that returns whether an index matches the nth-check.
- * @example
- *
- * ```js
- * const check = nthCheck.compile([2, 3]);
- *
- * check(0); // `false`
- * check(1); // `false`
- * check(2); // `true`
- * check(3); // `false`
- * check(4); // `true`
- * check(5); // `false`
- * check(6); // `true`
- * ```
- */
-function compile(parsed) {
-  var a = parsed[0];
-  // Subtract 1 from `b`, to convert from one- to zero-indexed.
-  var b = parsed[1] - 1;
-  /*
-   * When `b <= 0`, `a * n` won't be lead to any matches for `a < 0`.
-   * Besides, the specification states that no elements are
-   * matched when `a` and `b` are 0.
-   *
-   * `b < 0` here as we subtracted 1 from `b` above.
-   */
-  if (b < 0 && a <= 0) return boolbase_1.default.falseFunc;
-  // When `a` is in the range -1..1, it matches any element (so only `b` is checked).
-  if (a === -1) return function (index) {
-    return index <= b;
-  };
-  if (a === 0) return function (index) {
-    return index === b;
-  };
-  // When `b <= 0` and `a === 1`, they match any element.
-  if (a === 1) return b < 0 ? boolbase_1.default.trueFunc : function (index) {
-    return index >= b;
-  };
-  /*
-   * Otherwise, modulo can be used to check if there is a match.
-   *
-   * Modulo doesn't care about the sign, so let's use `a`s absolute value.
-   */
-  var absA = Math.abs(a);
-  // Get `b mod a`, + a if this is negative.
-  var bMod = (b % absA + absA) % absA;
-  return a > 1 ? function (index) {
-    return index >= b && index % absA === bMod;
-  } : function (index) {
-    return index <= b && index % absA === bMod;
-  };
-}
-compile$1.__exports.compile = compile;
-/**
- * Returns a function that produces a monotonously increasing sequence of indices.
- *
- * If the sequence has an end, the returned function will return `null` after
- * the last index in the sequence.
- *
- * @param parsed A tuple [a, b], as returned by `parse`.
- * @returns A function that produces a sequence of indices.
- * @example <caption>Always increasing (2n+3)</caption>
- *
- * ```js
- * const gen = nthCheck.generate([2, 3])
- *
- * gen() // `1`
- * gen() // `3`
- * gen() // `5`
- * gen() // `8`
- * gen() // `11`
- * ```
- *
- * @example <caption>With end value (-2n+10)</caption>
- *
- * ```js
- *
- * const gen = nthCheck.generate([-2, 5]);
- *
- * gen() // 0
- * gen() // 2
- * gen() // 4
- * gen() // null
- * ```
- */
-function generate(parsed) {
-  var a = parsed[0];
-  // Subtract 1 from `b`, to convert from one- to zero-indexed.
-  var b = parsed[1] - 1;
-  var n = 0;
-  // Make sure to always return an increasing sequence
-  if (a < 0) {
-    var aPos_1 = -a;
-    // Get `b mod a`
-    var minValue_1 = (b % aPos_1 + aPos_1) % aPos_1;
-    return function () {
-      var val = minValue_1 + aPos_1 * n++;
-      return val > b ? null : val;
-    };
-  }
-  if (a === 0) return b < 0 ?
-  // There are no result — always return `null`
-  function () {
-    return null;
-  } :
-  // Return `b` exactly once
-  function () {
-    return n++ === 0 ? b : null;
-  };
-  if (b < 0) {
-    b += a * Math.ceil(-b / a);
-  }
-  return function () {
-    return a * n++ + b;
-  };
-}
-compile$1.__exports.generate = generate;
-
-exports.default = compile$1.__exports;
-//# sourceMappingURL=compile.cjs.map

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/compile.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"compile.cjs","sources":["../../../../../../../../../node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/compile.js"],"sourcesContent":["\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.generate = exports.compile = void 0;\nvar boolbase_1 = __importDefault(require(\"boolbase\"));\n/**\n * Returns a function that checks if an elements index matches the given rule\n * highly optimized to return the fastest solution.\n *\n * @param parsed A tuple [a, b], as returned by `parse`.\n * @returns A highly optimized function that returns whether an index matches the nth-check.\n * @example\n *\n * ```js\n * const check = nthCheck.compile([2, 3]);\n *\n * check(0); // `false`\n * check(1); // `false`\n * check(2); // `true`\n * check(3); // `false`\n * check(4); // `true`\n * check(5); // `false`\n * check(6); // `true`\n * ```\n */\nfunction compile(parsed) {\n    var a = parsed[0];\n    // Subtract 1 from `b`, to convert from one- to zero-indexed.\n    var b = parsed[1] - 1;\n    /*\n     * When `b <= 0`, `a * n` won't be lead to any matches for `a < 0`.\n     * Besides, the specification states that no elements are\n     * matched when `a` and `b` are 0.\n     *\n     * `b < 0` here as we subtracted 1 from `b` above.\n     */\n    if (b < 0 && a <= 0)\n        return boolbase_1.default.falseFunc;\n    // When `a` is in the range -1..1, it matches any element (so only `b` is checked).\n    if (a === -1)\n        return function (index) { return index <= b; };\n    if (a === 0)\n        return function (index) { return index === b; };\n    // When `b <= 0` and `a === 1`, they match any element.\n    if (a === 1)\n        return b < 0 ? boolbase_1.default.trueFunc : function (index) { return index >= b; };\n    /*\n     * Otherwise, modulo can be used to check if there is a match.\n     *\n     * Modulo doesn't care about the sign, so let's use `a`s absolute value.\n     */\n    var absA = Math.abs(a);\n    // Get `b mod a`, + a if this is negative.\n    var bMod = ((b % absA) + absA) % absA;\n    return a > 1\n        ? function (index) { return index >= b && index % absA === bMod; }\n        : function (index) { return index <= b && index % absA === bMod; };\n}\nexports.compile = compile;\n/**\n * Returns a function that produces a monotonously increasing sequence of indices.\n *\n * If the sequence has an end, the returned function will return `null` after\n * the last index in the sequence.\n *\n * @param parsed A tuple [a, b], as returned by `parse`.\n * @returns A function that produces a sequence of indices.\n * @example <caption>Always increasing (2n+3)</caption>\n *\n * ```js\n * const gen = nthCheck.generate([2, 3])\n *\n * gen() // `1`\n * gen() // `3`\n * gen() // `5`\n * gen() // `8`\n * gen() // `11`\n * ```\n *\n * @example <caption>With end value (-2n+10)</caption>\n *\n * ```js\n *\n * const gen = nthCheck.generate([-2, 5]);\n *\n * gen() // 0\n * gen() // 2\n * gen() // 4\n * gen() // null\n * ```\n */\nfunction generate(parsed) {\n    var a = parsed[0];\n    // Subtract 1 from `b`, to convert from one- to zero-indexed.\n    var b = parsed[1] - 1;\n    var n = 0;\n    // Make sure to always return an increasing sequence\n    if (a < 0) {\n        var aPos_1 = -a;\n        // Get `b mod a`\n        var minValue_1 = ((b % aPos_1) + aPos_1) % aPos_1;\n        return function () {\n            var val = minValue_1 + aPos_1 * n++;\n            return val > b ? null : val;\n        };\n    }\n    if (a === 0)\n        return b < 0\n            ? // There are no result — always return `null`\n                function () { return null; }\n            : // Return `b` exactly once\n                function () { return (n++ === 0 ? b : null); };\n    if (b < 0) {\n        b += a * Math.ceil(-b / a);\n    }\n    return function () { return a * n++ + b; };\n}\nexports.generate = generate;\n//# sourceMappingURL=compile.js.map"],"names":["compile","parsed","b","a","boolbase_1","default","falseFunc","index","absA","Math","abs","bMod","generate","n","aPos_1","minValue_1","val","ceil"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkBA;;;;AAOAA,SAAAA,OAAAA,CAAAC,MAAA,EAAA;;;;;;;;;;;MAUAC,CAAA,GAAA,CAAA,IAAAC,CAAA,IACA,CAAA,EAAA,OAAAC,UAAA,CAAAC,OAAA,CAAAC,SAAA,CAAA;;AACA,EAAA,IAAAH,CAAA,KAAA,CAAA,CAAA,EACQ,OAAS,UAAAI,KAAA,EAAA;IAAA,OAAAA,KAAA,IAAAL,CAAA,CAAA;AAAA,GAAA,CAAA;MAAAC,CAAA,KAAA,CAAM,EAEvB,OAAA,UAAAI,KAAA,EAAA;IAAA,OAAAA,KAAA,KAAAL,CAAA,CAAA;AAAA,GAAA,CAAA;;;;;;;;;;AAUAM,EAAAA,IAAAA,IAAA,GAAAC,IAAA,CAAAC,GAAA,CAAAP,CAAA,CAAA,CAAA;;EAEA,IAAAQ,IAAA,IAAAT,CAAA,GAAAM,IAAA,GAAAA,IAAA,IAAAA,IAAA,CAAA;EAlCA,OAAAL,CAAA,GAoCA,CAAA,GAAA,UAAAI,KAAA,EAAA;IAAA,OAAAA,KAAA,IAAAL,CAAA,IAAAK,KAAA,GAAAC,IAAA,KAAAG,IAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA;;;;AAKAC,SAAAA,QAAAA,CAAAX,MAAA,EAAA;EAES,IAAAE,CAAA,GAAAF,MAAA,CAAA,CAAA,CAAA,CAAA;AACL;MACJC,CAAA,GAAAD,MAAA,CAAA,CAAA,CAAA,GAAA,CAAA,CAAA;MACQY,CAAA,GAAA,CAAA,CAAA;;AAERV,EAAAA,IAAAA,CAAA,GAAA,CAAA,EAAA;QACYW,MAAG,GAAA,CAAAX,CAAA,CAAA;;IAGP,IAAIY,UAAA,IAAAb,CAAA,GAAAY,MAAA,GAAAA,MAAA,IAAAA,MAAA,CAAA;AACZ,IAAA,OAAA,YAAA;AAEY,MAAA,IAAAE,GAAA,GAAAD,UAAA,GAAAD,MAAA,GAAAD,CAAA,EAAA,CAAA;AACZ,MAAA,OAAUG,GAAA,GAAAd,CAAA,GAAA,IAAA,GAAAc,GAAA,CAAA;;;AAGF,EAAA,IAAA,CAAA,KAAA,CAAA,SACR,CAAA,GAAA,CAAA;AAEA;EACA,YAA4B;IAAA,OAAU,IAAA,CAAA;AAAA,GAAA;AAC9B;EAEH,YAAA;AAAA,IAAA,OAAAH,CAAA,EAAA,KAAA,CAAA,GAAAX,CAAA,GAAA,IAAA,CAAA;AAAA,GAAA,CAAA;AACL,EAAA,IAAAA,CAAA,GAAA,CAAA,EAAA;IA/BAA,CAAA,IAAAC,CAAA,GAAAM,IAAA,CAAAQ,IAAA,CAAA,CA+BAf,CAAA,GAAAC,CAAA,CAAA,CAAA;;;;;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/index.cjs

@@ -1,97 +0,0 @@
-'use strict';
-
-var index = require('../../../../../_virtual/index9.cjs');
-require('./parse.cjs');
-require('./compile.cjs');
-var parse = require('../../../../../_virtual/parse2.cjs');
-var compile = require('../../../../../_virtual/compile2.cjs');
-
-(function (exports) {
-
-  Object.defineProperty(exports, "__esModule", {
-    value: true
-  });
-  exports.sequence = exports.generate = exports.compile = exports.parse = void 0;
-  var parse_js_1 = parse.__exports;
-  Object.defineProperty(exports, "parse", {
-    enumerable: true,
-    get: function () {
-      return parse_js_1.parse;
-    }
-  });
-  var compile_js_1 = compile.__exports;
-  Object.defineProperty(exports, "compile", {
-    enumerable: true,
-    get: function () {
-      return compile_js_1.compile;
-    }
-  });
-  Object.defineProperty(exports, "generate", {
-    enumerable: true,
-    get: function () {
-      return compile_js_1.generate;
-    }
-  });
-  /**
-   * Parses and compiles a formula to a highly optimized function.
-   * Combination of {@link parse} and {@link compile}.
-   *
-   * If the formula doesn't match any elements,
-   * it returns [`boolbase`](https://github.com/fb55/boolbase)'s `falseFunc`.
-   * Otherwise, a function accepting an _index_ is returned, which returns
-   * whether or not the passed _index_ matches the formula.
-   *
-   * Note: The nth-rule starts counting at `1`, the returned function at `0`.
-   *
-   * @param formula The formula to compile.
-   * @example
-   * const check = nthCheck("2n+3");
-   *
-   * check(0); // `false`
-   * check(1); // `false`
-   * check(2); // `true`
-   * check(3); // `false`
-   * check(4); // `true`
-   * check(5); // `false`
-   * check(6); // `true`
-   */
-  function nthCheck(formula) {
-    return (0, compile_js_1.compile)((0, parse_js_1.parse)(formula));
-  }
-  exports.default = nthCheck;
-  /**
-   * Parses and compiles a formula to a generator that produces a sequence of indices.
-   * Combination of {@link parse} and {@link generate}.
-   *
-   * @param formula The formula to compile.
-   * @returns A function that produces a sequence of indices.
-   * @example <caption>Always increasing</caption>
-   *
-   * ```js
-   * const gen = nthCheck.sequence('2n+3')
-   *
-   * gen() // `1`
-   * gen() // `3`
-   * gen() // `5`
-   * gen() // `8`
-   * gen() // `11`
-   * ```
-   *
-   * @example <caption>With end value</caption>
-   *
-   * ```js
-   *
-   * const gen = nthCheck.sequence('-2n+5');
-   *
-   * gen() // 0
-   * gen() // 2
-   * gen() // 4
-   * gen() // null
-   * ```
-   */
-  function sequence(formula) {
-    return (0, compile_js_1.generate)((0, parse_js_1.parse)(formula));
-  }
-  exports.sequence = sequence;
-})(index.__exports);
-//# sourceMappingURL=index.cjs.map

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../../../../node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/index.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.sequence = exports.generate = exports.compile = exports.parse = void 0;\nvar parse_js_1 = require(\"./parse.js\");\nObject.defineProperty(exports, \"parse\", { enumerable: true, get: function () { return parse_js_1.parse; } });\nvar compile_js_1 = require(\"./compile.js\");\nObject.defineProperty(exports, \"compile\", { enumerable: true, get: function () { return compile_js_1.compile; } });\nObject.defineProperty(exports, \"generate\", { enumerable: true, get: function () { return compile_js_1.generate; } });\n/**\n * Parses and compiles a formula to a highly optimized function.\n * Combination of {@link parse} and {@link compile}.\n *\n * If the formula doesn't match any elements,\n * it returns [`boolbase`](https://github.com/fb55/boolbase)'s `falseFunc`.\n * Otherwise, a function accepting an _index_ is returned, which returns\n * whether or not the passed _index_ matches the formula.\n *\n * Note: The nth-rule starts counting at `1`, the returned function at `0`.\n *\n * @param formula The formula to compile.\n * @example\n * const check = nthCheck(\"2n+3\");\n *\n * check(0); // `false`\n * check(1); // `false`\n * check(2); // `true`\n * check(3); // `false`\n * check(4); // `true`\n * check(5); // `false`\n * check(6); // `true`\n */\nfunction nthCheck(formula) {\n    return (0, compile_js_1.compile)((0, parse_js_1.parse)(formula));\n}\nexports.default = nthCheck;\n/**\n * Parses and compiles a formula to a generator that produces a sequence of indices.\n * Combination of {@link parse} and {@link generate}.\n *\n * @param formula The formula to compile.\n * @returns A function that produces a sequence of indices.\n * @example <caption>Always increasing</caption>\n *\n * ```js\n * const gen = nthCheck.sequence('2n+3')\n *\n * gen() // `1`\n * gen() // `3`\n * gen() // `5`\n * gen() // `8`\n * gen() // `11`\n * ```\n *\n * @example <caption>With end value</caption>\n *\n * ```js\n *\n * const gen = nthCheck.sequence('-2n+5');\n *\n * gen() // 0\n * gen() // 2\n * gen() // 4\n * gen() // null\n * ```\n */\nfunction sequence(formula) {\n    return (0, compile_js_1.generate)((0, parse_js_1.parse)(formula));\n}\nexports.sequence = sequence;\n//# sourceMappingURL=index.js.map"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA;;AAEA;AAFA;AAIA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA;;AAEA;AAFA;;;;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/parse.cjs

@@ -1,81 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var parse$1 = require('../../../../../_virtual/parse2.cjs');
-
-// Following http://www.w3.org/TR/css3-selectors/#nth-child-pseudo
-Object.defineProperty(parse$1.__exports, "__esModule", {
-  value: true
-});
-parse$1.__exports.parse = void 0;
-// Whitespace as per https://www.w3.org/TR/selectors-3/#lex is " \t\r\n\f"
-var whitespace = new Set([9, 10, 12, 13, 32]);
-var ZERO = "0".charCodeAt(0);
-var NINE = "9".charCodeAt(0);
-/**
- * Parses an expression.
- *
- * @throws An `Error` if parsing fails.
- * @returns An array containing the integer step size and the integer offset of the nth rule.
- * @example nthCheck.parse("2n+3"); // returns [2, 3]
- */
-function parse(formula) {
-  formula = formula.trim().toLowerCase();
-  if (formula === "even") {
-    return [2, 0];
-  } else if (formula === "odd") {
-    return [2, 1];
-  }
-  // Parse [ ['-'|'+']? INTEGER? {N} [ S* ['-'|'+'] S* INTEGER ]?
-  var idx = 0;
-  var a = 0;
-  var sign = readSign();
-  var number = readNumber();
-  if (idx < formula.length && formula.charAt(idx) === "n") {
-    idx++;
-    a = sign * (number !== null && number !== void 0 ? number : 1);
-    skipWhitespace();
-    if (idx < formula.length) {
-      sign = readSign();
-      skipWhitespace();
-      number = readNumber();
-    } else {
-      sign = number = 0;
-    }
-  }
-  // Throw if there is anything else
-  if (number === null || idx < formula.length) {
-    throw new Error("n-th rule couldn't be parsed ('".concat(formula, "')"));
-  }
-  return [a, sign * number];
-  function readSign() {
-    if (formula.charAt(idx) === "-") {
-      idx++;
-      return -1;
-    }
-    if (formula.charAt(idx) === "+") {
-      idx++;
-    }
-    return 1;
-  }
-  function readNumber() {
-    var start = idx;
-    var value = 0;
-    while (idx < formula.length && formula.charCodeAt(idx) >= ZERO && formula.charCodeAt(idx) <= NINE) {
-      value = value * 10 + (formula.charCodeAt(idx) - ZERO);
-      idx++;
-    }
-    // Return `null` if we didn't read anything.
-    return idx === start ? null : value;
-  }
-  function skipWhitespace() {
-    while (idx < formula.length && whitespace.has(formula.charCodeAt(idx))) {
-      idx++;
-    }
-  }
-}
-parse$1.__exports.parse = parse;
-
-exports.default = parse$1.__exports;
-//# sourceMappingURL=parse.cjs.map

package/dist/cjs/node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/parse.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse.cjs","sources":["../../../../../../../../../node_modules/.store/nth-check-npm-2.1.1-f97afc8169/package/lib/parse.js"],"sourcesContent":["\"use strict\";\n// Following http://www.w3.org/TR/css3-selectors/#nth-child-pseudo\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.parse = void 0;\n// Whitespace as per https://www.w3.org/TR/selectors-3/#lex is \" \\t\\r\\n\\f\"\nvar whitespace = new Set([9, 10, 12, 13, 32]);\nvar ZERO = \"0\".charCodeAt(0);\nvar NINE = \"9\".charCodeAt(0);\n/**\n * Parses an expression.\n *\n * @throws An `Error` if parsing fails.\n * @returns An array containing the integer step size and the integer offset of the nth rule.\n * @example nthCheck.parse(\"2n+3\"); // returns [2, 3]\n */\nfunction parse(formula) {\n    formula = formula.trim().toLowerCase();\n    if (formula === \"even\") {\n        return [2, 0];\n    }\n    else if (formula === \"odd\") {\n        return [2, 1];\n    }\n    // Parse [ ['-'|'+']? INTEGER? {N} [ S* ['-'|'+'] S* INTEGER ]?\n    var idx = 0;\n    var a = 0;\n    var sign = readSign();\n    var number = readNumber();\n    if (idx < formula.length && formula.charAt(idx) === \"n\") {\n        idx++;\n        a = sign * (number !== null && number !== void 0 ? number : 1);\n        skipWhitespace();\n        if (idx < formula.length) {\n            sign = readSign();\n            skipWhitespace();\n            number = readNumber();\n        }\n        else {\n            sign = number = 0;\n        }\n    }\n    // Throw if there is anything else\n    if (number === null || idx < formula.length) {\n        throw new Error(\"n-th rule couldn't be parsed ('\".concat(formula, \"')\"));\n    }\n    return [a, sign * number];\n    function readSign() {\n        if (formula.charAt(idx) === \"-\") {\n            idx++;\n            return -1;\n        }\n        if (formula.charAt(idx) === \"+\") {\n            idx++;\n        }\n        return 1;\n    }\n    function readNumber() {\n        var start = idx;\n        var value = 0;\n        while (idx < formula.length &&\n            formula.charCodeAt(idx) >= ZERO &&\n            formula.charCodeAt(idx) <= NINE) {\n            value = value * 10 + (formula.charCodeAt(idx) - ZERO);\n            idx++;\n        }\n        // Return `null` if we didn't read anything.\n        return idx === start ? null : value;\n    }\n    function skipWhitespace() {\n        while (idx < formula.length &&\n            whitespace.has(formula.charCodeAt(idx))) {\n            idx++;\n        }\n    }\n}\nexports.parse = parse;\n//# sourceMappingURL=parse.js.map"],"names":["Object","defineProperty","parse_1","value","parse","whitespace","Set","formula","trim","toLowerCase","idx","a","sign","readSign","number","readNumber","length","charAt","Error","concat","start","charCodeAt","ZERO","NINE"],"mappings":";;;;;;;AAAAA,MAAA,CAAAC,cAAa,CAAAC,iBAAA,EAAA,YAAA,EAAA;EAAAC,KAAA,EAAA,IAAA;AAAA,CAAA,CAAA,CAAA;AACbD,iBAAA,CAAAE,KAAA,GAAA,KAAA,EAAA;AACA;AAEA,IAAAC,UAAA,OAAAC,GAAA,CAAA,CAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CAAA,CAAA,CAAA;;;;;;;AAOA;;;AAISF,SAAAA,KAAAA,CAAMG,OAAO,EAAA;AAClB,EAAA,OAAA,GAAAA,OAAA,CAAAC,IAAA,EAAA,CAAAC,WAAA,EAAA,CAAA;AAAiB,EAAA,IAAA,OAAA,KAAC,MAAM,EAAA;AACpB,IAAA,OAAO,CAAK,CAAA,EAAA,CAAA,CAAA,CAAA;AACpB,GAAA,MAEA,IAAAF,OAAA,KAAA,KAAA,EAAA;AAEK,IAAA,OAAA,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA;AAED,GAAA;AACA;AACA,EAAA,IAAIG,GAAA,GAAO,CAAA,CAAA;AAEX,EAAA,IAAIC,CAAA,GAAG,CAAA,CAAA;AACHC,EAAAA,IAAAA,IAAG,GAAGC,QAAA,EAAA,CAAA;AACNC,EAAAA,IAAAA,MAAI,GAAIC,UAAU,EAAA,CAAA;MAElBL,GAAA,GAAAH,OAAA,CAAiBS,MAAA,IAAAT,OAAA,CAAAU,MAAA,CAAAP,GAAA,CAAA,KAAA,GAAA,EAAA;AAEbA,IAAAA,GAAA,EAAA,CAAA;AACAE,IAAAA,CAAAA,GAAAA,IAAM,IAAAE,MAAA,KAAa,IAAAA,IAAAA,MAAA,cAAAA,MAAA,GAAA,CAAA,CAAA,CAAA;AACtB,IAAA,cAAA,EAAA,CAAA;AACIJ,IAAAA,IAAAA,GAAA,GAAAH,OAAA,CAAAS,MAAA,EAAA;AACbJ,MAAAA,IAAA,GAAAC,QAAA,EAAA,CAAA;AAAgB,MAAA,cAAA,EAAA,CAAA;AACPC,MAAAA,MAAA,GAAAC,UAAA,EAAA,CAAA;KACJ,MACL;AAEAH,MAAAA,IAAA,GAAAE,MAAA,GAAA,CAAA,CAAA;AACK,KAAA;;;EAIO,IAAAA,MAAA,KAAM,IAAA,IAAAJ,GAAA,GAAAH,OAAA,CAAAS,MAAA,EAAA;AAET,IAAA,MAAA,IAAAE,KAAA,CAAAC,iCAAAA,CAAAA,MAAA,CAAAZ,OAAA,EAAA,IAAA,CAAA,CAAA,CAAA;;UAEGI,CAAA,EAAGC,IAAG,GAAAE,MAAA,CAAA,CAAA;AACTD,EAAAA,SAAAA,QAAAA,GAAA;QACDN,OAAA,CAAAU,MAAA,CAAAP,GAAA,CAAA,KAAA,GAAA,EAAA;MAEJA,GAAA,EAAA,CAAA;MACQ,OAAQ,CAAA,CAAA,CAAA;;AAGpB,IAAA,IAAAH;MACYG,GAAA,EAAA,CAAA;AAEA,KAAA;IACH,OAAA,CAAA,CAAA;;AAGJK,EAAAA,SAAAA;AAEUK,IAAAA,IAAAA,KAAA,GAAMV,GAAA,CAAA;AACTP,IAAAA,IAAAA,KAAA,GAAA,CAAA,CAAA;AAEHO,IAAAA,OAAAA,GAAA,GAAAH,OAAA,CAAAS,MAAA,IACJT,OAAA,CAAAc,UAAA,CAAAX,GAAA,CAAAY,IAAAA,IAAA,IACJf,OAAA,CAAAc,UAAA,CAAAX,GAAA,KAAAa,IAAA,EAAA;MAEDpB,KAAA,GAAAA,KAAA,GAAAI,EAAAA,IAAAA,OAAA,CAAAc,UAAA,CAAAX,GAAA,CAAA,GAAAY,IAAA,CAAA,CAAA;;;;;;;;;AAjEA,KAAA;;;;;;;","x_google_ignoreList":[0]}