@slicemachine/manager 0.22.2-alpha.dani-snippets.7 → 0.22.2-alpha.dani-repeatable-links-codegen.1

package/dist/_node_modules/fp-ts/es6/Tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tree.js","sources":["../../../../../../node_modules/fp-ts/es6/Tree.js"],"sourcesContent":["import { apFirst as apFirst_, apS as apS_, apSecond as apSecond_ } from './Apply';\nimport * as A from './Array';\nimport { bind as bind_, chainFirst as chainFirst_ } from './Chain';\nimport { fromEquals } from './Eq';\nimport { dual, identity, pipe } from './function';\nimport { bindTo as bindTo_, flap as flap_, let as let__ } from './Functor';\nimport * as _ from './internal';\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport function make(value, forest) {\n    if (forest === void 0) { forest = []; }\n    return {\n        value: value,\n        forest: forest\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getShow(S) {\n    var show = function (t) {\n        return A.isEmpty(t.forest)\n            ? \"make(\".concat(S.show(t.value), \")\")\n            : \"make(\".concat(S.show(t.value), \", [\").concat(t.forest.map(show).join(', '), \"])\");\n    };\n    return {\n        show: show\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getEq(E) {\n    // eslint-disable-next-line prefer-const\n    var SA;\n    var R = fromEquals(function (x, y) { return E.equals(x.value, y.value) && SA.equals(x.forest, y.forest); });\n    SA = A.getEq(R);\n    return R;\n}\nvar draw = function (indentation, forest) {\n    var r = '';\n    var len = forest.length;\n    var tree;\n    for (var i = 0; i < len; i++) {\n        tree = forest[i];\n        var isLast = i === len - 1;\n        r += indentation + (isLast ? '└' : '├') + '─ ' + tree.value;\n        r += draw(indentation + (len > 1 && !isLast ? '│  ' : '   '), tree.forest);\n    }\n    return r;\n};\n/**\n * Neat 2-dimensional drawing of a forest\n *\n * @since 2.0.0\n */\nexport function drawForest(forest) {\n    return draw('\\n', forest);\n}\n/**\n * Neat 2-dimensional drawing of a tree\n *\n * @example\n * import { make, drawTree } from 'fp-ts/Tree'\n *\n * const fa = make('a', [\n *   make('b'),\n *   make('c'),\n *   make('d', [make('e'), make('f')])\n * ])\n *\n * assert.strictEqual(drawTree(fa), `a\n * ├─ b\n * ├─ c\n * └─ d\n *    ├─ e\n *    └─ f`)\n *\n *\n * @since 2.0.0\n */\nexport function drawTree(tree) {\n    return tree.value + drawForest(tree.forest);\n}\n/**\n * Build a (possibly infinite) tree from a seed value in breadth-first order.\n *\n * @category constructors\n * @since 2.0.0\n */\nexport function unfoldTree(b, f) {\n    var _a = f(b), a = _a[0], bs = _a[1];\n    return { value: a, forest: unfoldForest(bs, f) };\n}\n/**\n * Build a (possibly infinite) forest from a list of seed values in breadth-first order.\n *\n * @category constructors\n * @since 2.0.0\n */\nexport function unfoldForest(bs, f) {\n    return bs.map(function (b) { return unfoldTree(b, f); });\n}\nexport function unfoldTreeM(M) {\n    var unfoldForestMM = unfoldForestM(M);\n    return function (b, f) { return M.chain(f(b), function (_a) {\n        var a = _a[0], bs = _a[1];\n        return M.map(unfoldForestMM(bs, f), function (ts) { return ({ value: a, forest: ts }); });\n    }); };\n}\nexport function unfoldForestM(M) {\n    var traverseM = A.traverse(M);\n    return function (bs, f) {\n        return pipe(bs, traverseM(function (b) { return unfoldTreeM(M)(b, f); }));\n    };\n}\n/**\n * Fold a tree into a \"summary\" value in depth-first order.\n *\n * For each node in the tree, apply `f` to the `value` and the result of applying `f` to each `forest`.\n *\n * This is also known as the catamorphism on trees.\n *\n * @example\n * import { fold, make } from 'fp-ts/Tree'\n * import { concatAll } from 'fp-ts/Monoid'\n * import { MonoidSum } from 'fp-ts/number'\n *\n * const t = make(1, [make(2), make(3)])\n *\n * const sum = concatAll(MonoidSum)\n *\n * // Sum the values in a tree:\n * assert.deepStrictEqual(fold((a: number, bs: Array<number>) => a + sum(bs))(t), 6)\n *\n * // Find the maximum value in the tree:\n * assert.deepStrictEqual(fold((a: number, bs: Array<number>) => bs.reduce((b, acc) => Math.max(b, acc), a))(t), 3)\n *\n * // Count the number of leaves in the tree:\n * assert.deepStrictEqual(fold((_: number, bs: Array<number>) => (bs.length === 0 ? 1 : sum(bs)))(t), 2)\n *\n * @category folding\n * @since 2.6.0\n */\nexport function fold(f) {\n    var go = function (tree) { return f(tree.value, tree.forest.map(go)); };\n    return go;\n}\n/* istanbul ignore next */\nvar _map = function (fa, f) { return pipe(fa, map(f)); };\nvar _ap = function (fab, fa) { return flatMap(fab, function (f) { return pipe(fa, map(f)); }); };\n/* istanbul ignore next */\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/* istanbul ignore next */\nvar _foldMap = function (M) {\n    var foldMapM = foldMap(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n};\n/* istanbul ignore next */\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\n/* istanbul ignore next */\nvar _traverse = function (F) {\n    var traverseF = traverse(F);\n    return function (ta, f) { return pipe(ta, traverseF(f)); };\n};\n/**\n * @since 2.0.0\n */\nexport var ap = function (fa) { return function (fab) { return _ap(fab, fa); }; };\n/**\n * @category sequencing\n * @since 2.14.0\n */\nexport var flatMap = /*#__PURE__*/ dual(2, function (ma, f) {\n    var _a = f(ma.value), value = _a.value, forest = _a.forest;\n    var concat = A.getMonoid().concat;\n    return {\n        value: value,\n        forest: concat(forest, ma.forest.map(flatMap(f)))\n    };\n});\n/**\n * @since 2.0.0\n */\nexport var extend = function (f) { return function (wa) { return ({\n    value: f(wa),\n    forest: wa.forest.map(extend(f))\n}); }; };\n/**\n * @since 2.0.0\n */\nexport var duplicate = /*#__PURE__*/ extend(identity);\n/**\n * @category sequencing\n * @since 2.0.0\n */\nexport var flatten = /*#__PURE__*/ flatMap(identity);\n/**\n * `map` can be used to turn functions `(a: A) => B` into functions `(fa: F<A>) => F<B>` whose argument and return types\n * use the type constructor `F` to represent some computational context.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var map = function (f) { return function (fa) { return ({\n    value: f(fa.value),\n    forest: fa.forest.map(map(f))\n}); }; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = function (b, f) {\n    return function (fa) {\n        var r = f(b, fa.value);\n        var len = fa.forest.length;\n        for (var i = 0; i < len; i++) {\n            r = pipe(fa.forest[i], reduce(r, f));\n        }\n        return r;\n    };\n};\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = function (M) { return function (f) {\n    return reduce(M.empty, function (acc, a) { return M.concat(acc, f(a)); });\n}; };\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduceRight = function (b, f) {\n    return function (fa) {\n        var r = b;\n        var len = fa.forest.length;\n        for (var i = len - 1; i >= 0; i--) {\n            r = pipe(fa.forest[i], reduceRight(r, f));\n        }\n        return f(fa.value, r);\n    };\n};\n/**\n * @category Extract\n * @since 2.6.2\n */\nexport var extract = function (wa) { return wa.value; };\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var traverse = function (F) {\n    var traverseF = A.traverse(F);\n    var out = function (f) {\n        return function (ta) {\n            return F.ap(F.map(f(ta.value), function (value) { return function (forest) { return ({\n                value: value,\n                forest: forest\n            }); }; }), pipe(ta.forest, traverseF(out(f))));\n        };\n    };\n    return out;\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var sequence = function (F) { return traverse(F)(identity); };\n/**\n * @category constructors\n * @since 2.7.0\n */\nexport var of = function (a) { return make(a); };\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Tree';\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Pointed = {\n    URI: URI,\n    of: of\n};\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Apply = {\n    URI: URI,\n    map: _map,\n    ap: _ap\n};\n/**\n * Combine two effectful actions, keeping only the result of the first.\n *\n * @since 2.0.0\n */\nexport var apFirst = /*#__PURE__*/ apFirst_(Apply);\n/**\n * Combine two effectful actions, keeping only the result of the second.\n *\n * @since 2.0.0\n */\nexport var apSecond = /*#__PURE__*/ apSecond_(Apply);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Applicative = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of\n};\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var Chain = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    chain: flatMap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Monad = {\n    URI: URI,\n    map: _map,\n    ap: _ap,\n    of: of,\n    chain: flatMap\n};\n/**\n * Composes computations in sequence, using the return value of one computation to determine the next computation and\n * keeping only the result of the first.\n *\n * @since 2.0.0\n */\nexport var chainFirst = /*#__PURE__*/ chainFirst_(Chain);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Comonad = {\n    URI: URI,\n    map: _map,\n    extend: _extend,\n    extract: extract\n};\n// -------------------------------------------------------------------------------------\n// do notation\n// -------------------------------------------------------------------------------------\n/**\n * @category do notation\n * @since 2.9.0\n */\nexport var Do = /*#__PURE__*/ of(_.emptyRecord);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var bindTo = /*#__PURE__*/ bindTo_(Functor);\nvar let_ = /*#__PURE__*/ let__(Functor);\nexport { \n/**\n * @category do notation\n * @since 2.13.0\n */\nlet_ as let };\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var bind = /*#__PURE__*/ bind_(Chain);\n/**\n * @category do notation\n * @since 2.8.0\n */\nexport var apS = /*#__PURE__*/ apS_(Apply);\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.0.0\n */\nexport function elem(E) {\n    var go = function (a, fa) { return E.equals(a, fa.value) || fa.forest.some(function (tree) { return go(a, tree); }); };\n    return go;\n}\n/**\n * @since 2.11.0\n */\nexport var exists = function (predicate) {\n    return function (ma) {\n        return predicate(ma.value) || ma.forest.some(exists(predicate));\n    };\n};\n// -------------------------------------------------------------------------------------\n// legacy\n// -------------------------------------------------------------------------------------\n/**\n * Alias of `flatMap`.\n *\n * @category legacy\n * @since 2.0.0\n */\nexport var chain = flatMap;\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.tree`\n * (where `T` is from `import T from 'fp-ts/Tree'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var tree = {\n    URI: URI,\n    map: _map,\n    of: of,\n    ap: _ap,\n    chain: flatMap,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence,\n    extract: extract,\n    extend: _extend\n};\n"],"names":["A.isEmpty","A.getEq","tree","A.traverse","A.getMonoid","flap_","apFirst_","apSecond_","chainFirst_","_.emptyRecord","bindTo_","let__","bind_","apS_"],"mappings":";;;;;;;AAWO,SAAS,KAAK,OAAO,QAAQ;AAChC,MAAI,WAAW,QAAQ;AAAE,aAAS,CAAE;AAAA,EAAG;AACvC,SAAO;AAAA,IACH;AAAA,IACA;AAAA,EACR;AACA;AAKO,SAAS,QAAQ,GAAG;AACvB,MAAI,OAAO,SAAU,GAAG;AACpB,WAAOA,QAAU,EAAE,MAAM,IACnB,QAAQ,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,GAAG,IACnC,QAAQ,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,KAAK,IAAI,GAAG,IAAI;AAAA,EAC/F;AACI,SAAO;AAAA,IACH;AAAA,EACR;AACA;AAKO,SAAS,MAAM,GAAG;AAErB,MAAI;AACJ,MAAI,IAAI,WAAW,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,KAAK,GAAG,OAAO,EAAE,QAAQ,EAAE,MAAM;AAAA,EAAE,CAAE;AAC1G,OAAKC,QAAQ,CAAC;AACd,SAAO;AACX;AACA,IAAI,OAAO,SAAU,aAAa,QAAQ;AACtC,MAAI,IAAI;AACR,MAAI,MAAM,OAAO;AACjB,MAAIC;AACJ,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,IAAAA,QAAO,OAAO,CAAC;AACf,QAAI,SAAS,MAAM,MAAM;AACzB,SAAK,eAAe,SAAS,MAAM,OAAO,OAAOA,MAAK;AACtD,SAAK,KAAK,eAAe,MAAM,KAAK,CAAC,SAAS,QAAQ,QAAQA,MAAK,MAAM;AAAA,EAC5E;AACD,SAAO;AACX;AAMO,SAAS,WAAW,QAAQ;AAC/B,SAAO,KAAK,MAAM,MAAM;AAC5B;AAuBO,SAAS,SAASA,OAAM;AAC3B,SAAOA,MAAK,QAAQ,WAAWA,MAAK,MAAM;AAC9C;AAOO,SAAS,WAAW,GAAG,GAAG;AAC7B,MAAI,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;AACnC,SAAO,EAAE,OAAO,GAAG,QAAQ,aAAa,IAAI,CAAC;AACjD;AAOO,SAAS,aAAa,IAAI,GAAG;AAChC,SAAO,GAAG,IAAI,SAAU,GAAG;AAAE,WAAO,WAAW,GAAG,CAAC;AAAA,EAAE,CAAE;AAC3D;AACO,SAAS,YAAY,GAAG;AAC3B,MAAI,iBAAiB,cAAc,CAAC;AACpC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,MAAM,EAAE,CAAC,GAAG,SAAU,IAAI;AACxD,UAAI,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;AACxB,aAAO,EAAE,IAAI,eAAe,IAAI,CAAC,GAAG,SAAU,IAAI;AAAE,eAAQ,EAAE,OAAO,GAAG,QAAQ,GAAE;AAAA,MAAI,CAAE;AAAA,IAC3F,CAAA;AAAA,EAAE;AACP;AACO,SAAS,cAAc,GAAG;AAC7B,MAAI,YAAYC,WAAW,CAAC;AAC5B,SAAO,SAAU,IAAI,GAAG;AACpB,WAAO,KAAK,IAAI,UAAU,SAAU,GAAG;AAAE,aAAO,YAAY,CAAC,EAAE,GAAG,CAAC;AAAA,IAAE,CAAE,CAAC;AAAA,EAChF;AACA;AA6BO,SAAS,KAAK,GAAG;AACpB,MAAI,KAAK,SAAUD,OAAM;AAAE,WAAO,EAAEA,MAAK,OAAOA,MAAK,OAAO,IAAI,EAAE,CAAC;AAAA,EAAE;AACrE,SAAO;AACX;AAEA,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,IAAI,CAAC,CAAC;;AACpD,IAAI,MAAM,SAAU,KAAK,IAAI;AAAE,SAAO,QAAQ,KAAK,SAAU,GAAG;AAAE,WAAO,KAAK,IAAI,IAAI,CAAC,CAAC;AAAA,EAAE,CAAE;;AAE5F,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAElE,IAAI,WAAW,SAAU,GAAG;AACxB,MAAI,WAAW,QAAQ,CAAC;AACxB,SAAO,SAAU,IAAI,GAAG;AAAE,WAAO,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;AACzD;AAEA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAE5E,IAAI,UAAU,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE1D,IAAI,YAAY,SAAU,GAAG;AACzB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAO,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AAIU,IAAC,KAAK,SAAU,IAAI;AAAE,SAAO,SAAU,KAAK;AAAE,WAAO,IAAI,KAAK,EAAE;AAAA,EAAI;AAAI;AAKxE,IAAC,UAAwB,qBAAK,GAAG,SAAU,IAAI,GAAG;AACxD,MAAI,KAAK,EAAE,GAAG,KAAK,GAAG,QAAQ,GAAG,OAAO,SAAS,GAAG;AACpD,MAAI,SAASE,UAAa,EAAC;AAC3B,SAAO;AAAA,IACH;AAAA,IACA,QAAQ,OAAO,QAAQ,GAAG,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC;AAAA,EACxD;AACA,CAAC;AAIS,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAQ;AAAA,MAC9D,OAAO,EAAE,EAAE;AAAA,MACX,QAAQ,GAAG,OAAO,IAAI,OAAO,CAAC,CAAC;AAAA,IACnC;AAAA,EAAK;AAAI;AAIC,IAAC,YAA0B,uBAAO,QAAQ;AAK1C,IAAC,UAAwB,wBAAQ,QAAQ;AAQzC,IAAC,MAAM,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAQ;AAAA,MAC3D,OAAO,EAAE,GAAG,KAAK;AAAA,MACjB,QAAQ,GAAG,OAAO,IAAI,IAAI,CAAC,CAAC;AAAA,IAChC;AAAA,EAAK;AAAI;AAKC,IAAC,SAAS,SAAU,GAAG,GAAG;AAChC,SAAO,SAAU,IAAI;AACjB,QAAI,IAAI,EAAE,GAAG,GAAG,KAAK;AACrB,QAAI,MAAM,GAAG,OAAO;AACpB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,UAAI,KAAK,GAAG,OAAO,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC;AAAA,IACtC;AACD,WAAO;AAAA,EACf;AACA;AAKU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,SAAU,GAAG;AACpD,WAAO,OAAO,EAAE,OAAO,SAAU,KAAK,GAAG;AAAE,aAAO,EAAE,OAAO,KAAK,EAAE,CAAC,CAAC;AAAA,IAAI,CAAA;AAAA,EAC5E;AAAK;AAKK,IAAC,cAAc,SAAU,GAAG,GAAG;AACrC,SAAO,SAAU,IAAI;AACjB,QAAI,IAAI;AACR,QAAI,MAAM,GAAG,OAAO;AACpB,aAAS,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK;AAC/B,UAAI,KAAK,GAAG,OAAO,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;AAAA,IAC3C;AACD,WAAO,EAAE,GAAG,OAAO,CAAC;AAAA,EAC5B;AACA;AAKU,IAAC,UAAU,SAAU,IAAI;AAAE,SAAO,GAAG;AAAS;AAK9C,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,YAAYD,WAAW,CAAC;AAC5B,MAAI,MAAM,SAAU,GAAG;AACnB,WAAO,SAAU,IAAI;AACjB,aAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,KAAK,GAAG,SAAU,OAAO;AAAE,eAAO,SAAU,QAAQ;AAAE,iBAAQ;AAAA,YACjF;AAAA,YACA;AAAA,UACH;AAAA;MAAK,CAAE,GAAG,KAAK,GAAG,QAAQ,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IACzD;AAAA,EACA;AACI,SAAO;AACX;AAKU,IAAC,WAAW,SAAU,GAAG;AAAE,SAAO,SAAS,CAAC,EAAE,QAAQ;AAAK;AAK3D,IAAC,KAAK,SAAU,GAAG;AAAE,SAAO,KAAK,CAAC;AAAK;AAKvC,IAAC,MAAM;AAKP,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBE,uBAAM,OAAO;AAKnC,IAAC,UAAU;AAAA,EACjB;AAAA,EACA;AACJ;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AACR;AAMU,IAAC,UAAwBC,0BAAS,KAAK;AAMvC,IAAC,WAAyBC,2BAAU,KAAK;AAKzC,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AACJ;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,OAAO;AACX;AAKU,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,KAAK;AAAA,EACL,IAAI;AAAA,EACJ;AAAA,EACA,OAAO;AACX;AAOU,IAAC,aAA2BC,6BAAY,KAAK;AAK7C,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR;AACJ;AAQU,IAAC,KAAmB,mBAAGC,WAAa;AAKpC,IAAC,SAAuBC,yBAAQ,OAAO;AAC9C,IAAC,OAAqBC,uBAAM,OAAO;AAW5B,IAAC,OAAqBC,uBAAM,KAAK;AAKjC,IAAC,MAAoBC,sBAAK,KAAK;AAOlC,SAAS,KAAK,GAAG;AACpB,MAAI,KAAK,SAAU,GAAG,IAAI;AAAE,WAAO,EAAE,OAAO,GAAG,GAAG,KAAK,KAAK,GAAG,OAAO,KAAK,SAAUX,OAAM;AAAE,aAAO,GAAG,GAAGA,KAAI;AAAA,KAAI;AAAA;AAClH,SAAO;AACX;AAIU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,SAAU,IAAI;AACjB,WAAO,UAAU,GAAG,KAAK,KAAK,GAAG,OAAO,KAAK,OAAO,SAAS,CAAC;AAAA,EACtE;AACA;AAUU,IAAC,QAAQ;AAaT,IAAC,OAAO;AAAA,EACd;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AAAA,EACA;AAAA,EACA,QAAQ;AACZ;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/Tuple.cjs

@@ -0,0 +1,244 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const _function = require("./function.cjs");
+const Functor$1 = require("./Functor.cjs");
+const ReadonlyTuple = require("./ReadonlyTuple.cjs");
+var fst = ReadonlyTuple.fst;
+var snd = ReadonlyTuple.snd;
+var swap = function(ea) {
+  return [snd(ea), fst(ea)];
+};
+function getApply(S) {
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    ap: function(fab, fa) {
+      return [fst(fab)(fst(fa)), S.concat(snd(fab), snd(fa))];
+    }
+  };
+}
+var of = function(M) {
+  return function(a) {
+    return [a, M.empty];
+  };
+};
+function getApplicative(M) {
+  var A = getApply(M);
+  return {
+    URI,
+    _E: void 0,
+    map: A.map,
+    ap: A.ap,
+    of: of(M)
+  };
+}
+function getChain(S) {
+  var A = getApply(S);
+  return {
+    URI,
+    _E: void 0,
+    map: A.map,
+    ap: A.ap,
+    chain: function(ma, f) {
+      var _a = f(fst(ma)), b = _a[0], s = _a[1];
+      return [b, S.concat(snd(ma), s)];
+    }
+  };
+}
+function getMonad(M) {
+  var C = getChain(M);
+  return {
+    URI,
+    _E: void 0,
+    map: C.map,
+    ap: C.ap,
+    chain: C.chain,
+    of: of(M)
+  };
+}
+function getChainRec(M) {
+  var chainRec = function(a, f) {
+    var result = f(a);
+    var acc = M.empty;
+    var s = fst(result);
+    while (s._tag === "Left") {
+      acc = M.concat(acc, snd(result));
+      result = f(s.left);
+      s = fst(result);
+    }
+    return [s.right, M.concat(acc, snd(result))];
+  };
+  var C = getChain(M);
+  return {
+    URI,
+    _E: void 0,
+    map: C.map,
+    ap: C.ap,
+    chain: C.chain,
+    chainRec
+  };
+}
+var _compose = function(bc, ab) {
+  return _function.pipe(bc, compose(ab));
+};
+var _map = function(fa, f) {
+  return _function.pipe(fa, mapFst(f));
+};
+var _bimap = function(fa, f, g) {
+  return _function.pipe(fa, bimap(f, g));
+};
+var _mapLeft = function(fa, f) {
+  return _function.pipe(fa, mapSnd(f));
+};
+var _extend = function(wa, f) {
+  return _function.pipe(wa, extend(f));
+};
+var _reduce = function(fa, b, f) {
+  return _function.pipe(fa, reduce(b, f));
+};
+var _foldMap = function(M) {
+  var foldMapM = foldMap();
+  return function(fa, f) {
+    return _function.pipe(fa, foldMapM(f));
+  };
+};
+var _reduceRight = function(fa, b, f) {
+  return _function.pipe(fa, reduceRight(b, f));
+};
+function _traverse(F) {
+  var traverseF = traverse(F);
+  return function(ta, f) {
+    return _function.pipe(ta, traverseF(f));
+  };
+}
+var bimap = function(f, g) {
+  return function(fa) {
+    return [g(fst(fa)), f(snd(fa))];
+  };
+};
+var mapFst = function(f) {
+  return function(fa) {
+    return [f(fst(fa)), snd(fa)];
+  };
+};
+var mapSnd = function(f) {
+  return function(fa) {
+    return [fst(fa), f(snd(fa))];
+  };
+};
+var compose = function(ab) {
+  return function(bc) {
+    return [fst(bc), snd(ab)];
+  };
+};
+var extend = function(f) {
+  return function(wa) {
+    return [f(wa), snd(wa)];
+  };
+};
+var duplicate = /* @__PURE__ */ extend(_function.identity);
+var extract = ReadonlyTuple.extract;
+var foldMap = ReadonlyTuple.foldMap;
+var reduce = ReadonlyTuple.reduce;
+var reduceRight = ReadonlyTuple.reduceRight;
+var traverse = function(F) {
+  return function(f) {
+    return function(ta) {
+      return F.map(f(fst(ta)), function(b) {
+        return [b, snd(ta)];
+      });
+    };
+  };
+};
+var sequence = function(F) {
+  return function(fas) {
+    return F.map(fst(fas), function(a) {
+      return [a, snd(fas)];
+    });
+  };
+};
+var URI = "Tuple";
+var Functor = {
+  URI,
+  map: _map
+};
+var flap = /* @__PURE__ */ Functor$1.flap(Functor);
+var Bifunctor = {
+  URI,
+  bimap: _bimap,
+  mapLeft: _mapLeft
+};
+var Semigroupoid = {
+  URI,
+  compose: _compose
+};
+var Comonad = {
+  URI,
+  map: _map,
+  extend: _extend,
+  extract
+};
+var Foldable = {
+  URI,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight
+};
+var Traversable = {
+  URI,
+  map: _map,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+var map = mapFst;
+var mapLeft = mapSnd;
+var tuple = {
+  URI,
+  compose: _compose,
+  map: _map,
+  bimap: _bimap,
+  mapLeft: _mapLeft,
+  extract,
+  extend: _extend,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+exports.Bifunctor = Bifunctor;
+exports.Comonad = Comonad;
+exports.Foldable = Foldable;
+exports.Functor = Functor;
+exports.Semigroupoid = Semigroupoid;
+exports.Traversable = Traversable;
+exports.URI = URI;
+exports.bimap = bimap;
+exports.compose = compose;
+exports.duplicate = duplicate;
+exports.extend = extend;
+exports.extract = extract;
+exports.flap = flap;
+exports.foldMap = foldMap;
+exports.fst = fst;
+exports.getApplicative = getApplicative;
+exports.getApply = getApply;
+exports.getChain = getChain;
+exports.getChainRec = getChainRec;
+exports.getMonad = getMonad;
+exports.map = map;
+exports.mapFst = mapFst;
+exports.mapLeft = mapLeft;
+exports.mapSnd = mapSnd;
+exports.reduce = reduce;
+exports.reduceRight = reduceRight;
+exports.sequence = sequence;
+exports.snd = snd;
+exports.swap = swap;
+exports.traverse = traverse;
+exports.tuple = tuple;
+//# sourceMappingURL=Tuple.cjs.map

package/dist/_node_modules/fp-ts/es6/Tuple.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tuple.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Tuple.js"],"sourcesContent":["import { identity, pipe } from './function';\nimport { flap as flap_ } from './Functor';\nimport * as RT from './ReadonlyTuple';\n// -------------------------------------------------------------------------------------\n// model\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.0.0\n */\nexport var fst = RT.fst;\n/**\n * @since 2.0.0\n */\nexport var snd = RT.snd;\n/**\n * @since 2.0.0\n */\nexport var swap = function (ea) { return [snd(ea), fst(ea)]; };\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getApply(S) {\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        ap: function (fab, fa) { return [fst(fab)(fst(fa)), S.concat(snd(fab), snd(fa))]; }\n    };\n}\nvar of = function (M) {\n    return function (a) {\n        return [a, M.empty];\n    };\n};\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getApplicative(M) {\n    var A = getApply(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: A.map,\n        ap: A.ap,\n        of: of(M)\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getChain(S) {\n    var A = getApply(S);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: A.map,\n        ap: A.ap,\n        chain: function (ma, f) {\n            var _a = f(fst(ma)), b = _a[0], s = _a[1];\n            return [b, S.concat(snd(ma), s)];\n        }\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getMonad(M) {\n    var C = getChain(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: C.map,\n        ap: C.ap,\n        chain: C.chain,\n        of: of(M)\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getChainRec(M) {\n    var chainRec = function (a, f) {\n        var result = f(a);\n        var acc = M.empty;\n        var s = fst(result);\n        while (s._tag === 'Left') {\n            acc = M.concat(acc, snd(result));\n            result = f(s.left);\n            s = fst(result);\n        }\n        return [s.right, M.concat(acc, snd(result))];\n    };\n    var C = getChain(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: C.map,\n        ap: C.ap,\n        chain: C.chain,\n        chainRec: chainRec\n    };\n}\n/* istanbul ignore next */\nvar _compose = function (bc, ab) { return pipe(bc, compose(ab)); };\n/* istanbul ignore next */\nvar _map = function (fa, f) { return pipe(fa, mapFst(f)); };\n/* istanbul ignore next */\nvar _bimap = function (fa, f, g) { return pipe(fa, bimap(f, g)); };\n/* istanbul ignore next */\nvar _mapLeft = function (fa, f) { return pipe(fa, mapSnd(f)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\n/* istanbul ignore next */\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/* istanbul ignore next */\nvar _foldMap = function (M) {\n    var foldMapM = foldMap(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n};\n/* istanbul ignore next */\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\n/* istanbul ignore next */\nfunction _traverse(F) {\n    var traverseF = traverse(F);\n    return function (ta, f) { return pipe(ta, traverseF(f)); };\n}\n/**\n * Map a pair of functions over the two type arguments of the bifunctor.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var bimap = function (f, g) { return function (fa) {\n    return [g(fst(fa)), f(snd(fa))];\n}; };\n/**\n * Map a function over the first component of a `Tuple`.\n *\n * This is the `map` operation of the `Functor` instance.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var mapFst = function (f) { return function (fa) { return [f(fst(fa)), snd(fa)]; }; };\n/**\n * Map a function over the second component of a `Tuple`.\n *\n * This is the `mapLeft` operation of the `Bifunctor` instance.\n *\n * @category mapping\n * @since 2.10.0\n */\nexport var mapSnd = function (f) { return function (fa) { return [fst(fa), f(snd(fa))]; }; };\n/**\n * @since 2.0.0\n */\nexport var compose = function (ab) { return function (bc) { return [fst(bc), snd(ab)]; }; };\n/**\n * @since 2.0.0\n */\nexport var extend = function (f) { return function (wa) { return [f(wa), snd(wa)]; }; };\n/**\n * @since 2.0.0\n */\nexport var duplicate = /*#__PURE__*/ extend(identity);\n/**\n * @category Extract\n * @since 2.6.2\n */\nexport var extract = RT.extract;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = RT.foldMap;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = RT.reduce;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduceRight = RT.reduceRight;\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var traverse = function (F) {\n    return function (f) { return function (ta) { return F.map(f(fst(ta)), function (b) { return [b, snd(ta)]; }); }; };\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var sequence = function (F) {\n    return function (fas) {\n        return F.map(fst(fas), function (a) { return [a, snd(fas)]; });\n    };\n};\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Tuple';\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Bifunctor = {\n    URI: URI,\n    bimap: _bimap,\n    mapLeft: _mapLeft\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Semigroupoid = {\n    URI: URI,\n    compose: _compose\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Comonad = {\n    URI: URI,\n    map: _map,\n    extend: _extend,\n    extract: extract\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`mapFst`](#mapfst) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var map = mapFst;\n/**\n * Use [`mapSnd`](#mapsnd) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var mapLeft = mapSnd;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.tuple`\n * (where `T` is from `import T from 'fp-ts/Tuple'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var tuple = {\n    URI: URI,\n    compose: _compose,\n    map: _map,\n    bimap: _bimap,\n    mapLeft: _mapLeft,\n    extract: extract,\n    extend: _extend,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n"],"names":["RT.fst","RT.snd","pipe","identity","RT.extract","RT.foldMap","RT.reduce","RT.reduceRight","flap_"],"mappings":";;;;;AASU,IAAC,MAAMA,cAAO;AAId,IAAC,MAAMC,cAAO;AAId,IAAC,OAAO,SAAU,IAAI;AAAE,SAAO,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC;AAAK;AAKxD,SAAS,SAAS,GAAG;AACxB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,SAAU,KAAK,IAAI;AAAE,aAAO,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC;AAAA,IAAI;AAAA,EAC3F;AACA;AACA,IAAI,KAAK,SAAU,GAAG;AAClB,SAAO,SAAU,GAAG;AAChB,WAAO,CAAC,GAAG,EAAE,KAAK;AAAA,EAC1B;AACA;AAKO,SAAS,eAAe,GAAG;AAC9B,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,IAAI,GAAG,CAAC;AAAA,EAChB;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,SAAU,IAAI,GAAG;AACpB,UAAI,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACxC,aAAO,CAAC,GAAG,EAAE,OAAO,IAAI,EAAE,GAAG,CAAC,CAAC;AAAA,IAClC;AAAA,EACT;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT,IAAI,GAAG,CAAC;AAAA,EAChB;AACA;AAKO,SAAS,YAAY,GAAG;AAC3B,MAAI,WAAW,SAAU,GAAG,GAAG;AAC3B,QAAI,SAAS,EAAE,CAAC;AAChB,QAAI,MAAM,EAAE;AACZ,QAAI,IAAI,IAAI,MAAM;AAClB,WAAO,EAAE,SAAS,QAAQ;AACtB,YAAM,EAAE,OAAO,KAAK,IAAI,MAAM,CAAC;AAC/B,eAAS,EAAE,EAAE,IAAI;AACjB,UAAI,IAAI,MAAM;AAAA,IACjB;AACD,WAAO,CAAC,EAAE,OAAO,EAAE,OAAO,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,EACnD;AACI,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT;AAAA,EACR;AACA;AAEA,IAAI,WAAW,SAAU,IAAI,IAAI;AAAE,SAAOC,UAAAA,KAAK,IAAI,QAAQ,EAAE,CAAC;;AAE9D,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,CAAC,CAAC;;AAEvD,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAEhE,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE3D,IAAI,UAAU,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE1D,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAElE,IAAI,WAAW,SAAU,GAAG;AACxB,MAAI,WAAW,QAAS;AACxB,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;AACzD;AAEA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAE5E,SAAS,UAAU,GAAG;AAClB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAOA,UAAAA,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACtD,WAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;AAAA,EAClC;AAAK;AASK,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC;AAAA,EAAE;AAAM;AASnF,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;AAAA,EAAE;AAAM;AAInF,IAAC,UAAU,SAAU,IAAI;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EAAI;AAAI;AAIlF,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EAAI;AAAI;AAI9E,IAAC,YAA0B,uBAAOC,kBAAQ;AAK1C,IAAC,UAAUC,cAAW;AAKtB,IAAC,UAAUC,cAAW;AAKtB,IAAC,SAASC,cAAU;AAKpB,IAAC,cAAcC,cAAe;AAK9B,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,SAAU,GAAG;AAAE,eAAO,CAAC,GAAG,IAAI,EAAE,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACnH;AAKU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,KAAK;AAClB,WAAO,EAAE,IAAI,IAAI,GAAG,GAAG,SAAU,GAAG;AAAE,aAAO,CAAC,GAAG,IAAI,GAAG,CAAC;AAAA,IAAI,CAAA;AAAA,EACrE;AACA;AAKU,IAAC,MAAM;AAKP,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,0BAAK,KAAC,OAAO;AAKnC,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,OAAO;AAAA,EACP,SAAS;AACb;AAKU,IAAC,eAAe;AAAA,EACtB;AAAA,EACA,SAAS;AACb;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR;AACJ;AAKU,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AAWU,IAAC,MAAM;AAQP,IAAC,UAAU;AAUX,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,SAAS;AAAA,EACT,KAAK;AAAA,EACL,OAAO;AAAA,EACP,SAAS;AAAA,EACT;AAAA,EACA,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/Tuple.js

@@ -0,0 +1,244 @@
+import { pipe, identity } from "./function.js";
+import { flap as flap$1 } from "./Functor.js";
+import { fst as fst$1, snd as snd$1, extract as extract$1, foldMap as foldMap$1, reduce as reduce$1, reduceRight as reduceRight$1 } from "./ReadonlyTuple.js";
+var fst = fst$1;
+var snd = snd$1;
+var swap = function(ea) {
+  return [snd(ea), fst(ea)];
+};
+function getApply(S) {
+  return {
+    URI,
+    _E: void 0,
+    map: _map,
+    ap: function(fab, fa) {
+      return [fst(fab)(fst(fa)), S.concat(snd(fab), snd(fa))];
+    }
+  };
+}
+var of = function(M) {
+  return function(a) {
+    return [a, M.empty];
+  };
+};
+function getApplicative(M) {
+  var A = getApply(M);
+  return {
+    URI,
+    _E: void 0,
+    map: A.map,
+    ap: A.ap,
+    of: of(M)
+  };
+}
+function getChain(S) {
+  var A = getApply(S);
+  return {
+    URI,
+    _E: void 0,
+    map: A.map,
+    ap: A.ap,
+    chain: function(ma, f) {
+      var _a = f(fst(ma)), b = _a[0], s = _a[1];
+      return [b, S.concat(snd(ma), s)];
+    }
+  };
+}
+function getMonad(M) {
+  var C = getChain(M);
+  return {
+    URI,
+    _E: void 0,
+    map: C.map,
+    ap: C.ap,
+    chain: C.chain,
+    of: of(M)
+  };
+}
+function getChainRec(M) {
+  var chainRec = function(a, f) {
+    var result = f(a);
+    var acc = M.empty;
+    var s = fst(result);
+    while (s._tag === "Left") {
+      acc = M.concat(acc, snd(result));
+      result = f(s.left);
+      s = fst(result);
+    }
+    return [s.right, M.concat(acc, snd(result))];
+  };
+  var C = getChain(M);
+  return {
+    URI,
+    _E: void 0,
+    map: C.map,
+    ap: C.ap,
+    chain: C.chain,
+    chainRec
+  };
+}
+var _compose = function(bc, ab) {
+  return pipe(bc, compose(ab));
+};
+var _map = function(fa, f) {
+  return pipe(fa, mapFst(f));
+};
+var _bimap = function(fa, f, g) {
+  return pipe(fa, bimap(f, g));
+};
+var _mapLeft = function(fa, f) {
+  return pipe(fa, mapSnd(f));
+};
+var _extend = function(wa, f) {
+  return pipe(wa, extend(f));
+};
+var _reduce = function(fa, b, f) {
+  return pipe(fa, reduce(b, f));
+};
+var _foldMap = function(M) {
+  var foldMapM = foldMap();
+  return function(fa, f) {
+    return pipe(fa, foldMapM(f));
+  };
+};
+var _reduceRight = function(fa, b, f) {
+  return pipe(fa, reduceRight(b, f));
+};
+function _traverse(F) {
+  var traverseF = traverse(F);
+  return function(ta, f) {
+    return pipe(ta, traverseF(f));
+  };
+}
+var bimap = function(f, g) {
+  return function(fa) {
+    return [g(fst(fa)), f(snd(fa))];
+  };
+};
+var mapFst = function(f) {
+  return function(fa) {
+    return [f(fst(fa)), snd(fa)];
+  };
+};
+var mapSnd = function(f) {
+  return function(fa) {
+    return [fst(fa), f(snd(fa))];
+  };
+};
+var compose = function(ab) {
+  return function(bc) {
+    return [fst(bc), snd(ab)];
+  };
+};
+var extend = function(f) {
+  return function(wa) {
+    return [f(wa), snd(wa)];
+  };
+};
+var duplicate = /* @__PURE__ */ extend(identity);
+var extract = extract$1;
+var foldMap = foldMap$1;
+var reduce = reduce$1;
+var reduceRight = reduceRight$1;
+var traverse = function(F) {
+  return function(f) {
+    return function(ta) {
+      return F.map(f(fst(ta)), function(b) {
+        return [b, snd(ta)];
+      });
+    };
+  };
+};
+var sequence = function(F) {
+  return function(fas) {
+    return F.map(fst(fas), function(a) {
+      return [a, snd(fas)];
+    });
+  };
+};
+var URI = "Tuple";
+var Functor = {
+  URI,
+  map: _map
+};
+var flap = /* @__PURE__ */ flap$1(Functor);
+var Bifunctor = {
+  URI,
+  bimap: _bimap,
+  mapLeft: _mapLeft
+};
+var Semigroupoid = {
+  URI,
+  compose: _compose
+};
+var Comonad = {
+  URI,
+  map: _map,
+  extend: _extend,
+  extract
+};
+var Foldable = {
+  URI,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight
+};
+var Traversable = {
+  URI,
+  map: _map,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+var map = mapFst;
+var mapLeft = mapSnd;
+var tuple = {
+  URI,
+  compose: _compose,
+  map: _map,
+  bimap: _bimap,
+  mapLeft: _mapLeft,
+  extract,
+  extend: _extend,
+  reduce: _reduce,
+  foldMap: _foldMap,
+  reduceRight: _reduceRight,
+  traverse: _traverse,
+  sequence
+};
+export {
+  Bifunctor,
+  Comonad,
+  Foldable,
+  Functor,
+  Semigroupoid,
+  Traversable,
+  URI,
+  bimap,
+  compose,
+  duplicate,
+  extend,
+  extract,
+  flap,
+  foldMap,
+  fst,
+  getApplicative,
+  getApply,
+  getChain,
+  getChainRec,
+  getMonad,
+  map,
+  mapFst,
+  mapLeft,
+  mapSnd,
+  reduce,
+  reduceRight,
+  sequence,
+  snd,
+  swap,
+  traverse,
+  tuple
+};
+//# sourceMappingURL=Tuple.js.map

package/dist/_node_modules/fp-ts/es6/Tuple.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tuple.js","sources":["../../../../../../node_modules/fp-ts/es6/Tuple.js"],"sourcesContent":["import { identity, pipe } from './function';\nimport { flap as flap_ } from './Functor';\nimport * as RT from './ReadonlyTuple';\n// -------------------------------------------------------------------------------------\n// model\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.0.0\n */\nexport var fst = RT.fst;\n/**\n * @since 2.0.0\n */\nexport var snd = RT.snd;\n/**\n * @since 2.0.0\n */\nexport var swap = function (ea) { return [snd(ea), fst(ea)]; };\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getApply(S) {\n    return {\n        URI: URI,\n        _E: undefined,\n        map: _map,\n        ap: function (fab, fa) { return [fst(fab)(fst(fa)), S.concat(snd(fab), snd(fa))]; }\n    };\n}\nvar of = function (M) {\n    return function (a) {\n        return [a, M.empty];\n    };\n};\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getApplicative(M) {\n    var A = getApply(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: A.map,\n        ap: A.ap,\n        of: of(M)\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getChain(S) {\n    var A = getApply(S);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: A.map,\n        ap: A.ap,\n        chain: function (ma, f) {\n            var _a = f(fst(ma)), b = _a[0], s = _a[1];\n            return [b, S.concat(snd(ma), s)];\n        }\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getMonad(M) {\n    var C = getChain(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: C.map,\n        ap: C.ap,\n        chain: C.chain,\n        of: of(M)\n    };\n}\n/**\n * @category instances\n * @since 2.0.0\n */\nexport function getChainRec(M) {\n    var chainRec = function (a, f) {\n        var result = f(a);\n        var acc = M.empty;\n        var s = fst(result);\n        while (s._tag === 'Left') {\n            acc = M.concat(acc, snd(result));\n            result = f(s.left);\n            s = fst(result);\n        }\n        return [s.right, M.concat(acc, snd(result))];\n    };\n    var C = getChain(M);\n    return {\n        URI: URI,\n        _E: undefined,\n        map: C.map,\n        ap: C.ap,\n        chain: C.chain,\n        chainRec: chainRec\n    };\n}\n/* istanbul ignore next */\nvar _compose = function (bc, ab) { return pipe(bc, compose(ab)); };\n/* istanbul ignore next */\nvar _map = function (fa, f) { return pipe(fa, mapFst(f)); };\n/* istanbul ignore next */\nvar _bimap = function (fa, f, g) { return pipe(fa, bimap(f, g)); };\n/* istanbul ignore next */\nvar _mapLeft = function (fa, f) { return pipe(fa, mapSnd(f)); };\n/* istanbul ignore next */\nvar _extend = function (wa, f) { return pipe(wa, extend(f)); };\n/* istanbul ignore next */\nvar _reduce = function (fa, b, f) { return pipe(fa, reduce(b, f)); };\n/* istanbul ignore next */\nvar _foldMap = function (M) {\n    var foldMapM = foldMap(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n};\n/* istanbul ignore next */\nvar _reduceRight = function (fa, b, f) { return pipe(fa, reduceRight(b, f)); };\n/* istanbul ignore next */\nfunction _traverse(F) {\n    var traverseF = traverse(F);\n    return function (ta, f) { return pipe(ta, traverseF(f)); };\n}\n/**\n * Map a pair of functions over the two type arguments of the bifunctor.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var bimap = function (f, g) { return function (fa) {\n    return [g(fst(fa)), f(snd(fa))];\n}; };\n/**\n * Map a function over the first component of a `Tuple`.\n *\n * This is the `map` operation of the `Functor` instance.\n *\n * @category mapping\n * @since 2.0.0\n */\nexport var mapFst = function (f) { return function (fa) { return [f(fst(fa)), snd(fa)]; }; };\n/**\n * Map a function over the second component of a `Tuple`.\n *\n * This is the `mapLeft` operation of the `Bifunctor` instance.\n *\n * @category mapping\n * @since 2.10.0\n */\nexport var mapSnd = function (f) { return function (fa) { return [fst(fa), f(snd(fa))]; }; };\n/**\n * @since 2.0.0\n */\nexport var compose = function (ab) { return function (bc) { return [fst(bc), snd(ab)]; }; };\n/**\n * @since 2.0.0\n */\nexport var extend = function (f) { return function (wa) { return [f(wa), snd(wa)]; }; };\n/**\n * @since 2.0.0\n */\nexport var duplicate = /*#__PURE__*/ extend(identity);\n/**\n * @category Extract\n * @since 2.6.2\n */\nexport var extract = RT.extract;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var foldMap = RT.foldMap;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduce = RT.reduce;\n/**\n * @category folding\n * @since 2.0.0\n */\nexport var reduceRight = RT.reduceRight;\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var traverse = function (F) {\n    return function (f) { return function (ta) { return F.map(f(fst(ta)), function (b) { return [b, snd(ta)]; }); }; };\n};\n/**\n * @category traversing\n * @since 2.6.3\n */\nexport var sequence = function (F) {\n    return function (fas) {\n        return F.map(fst(fas), function (a) { return [a, snd(fas)]; });\n    };\n};\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Tuple';\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * @category mapping\n * @since 2.10.0\n */\nexport var flap = /*#__PURE__*/ flap_(Functor);\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Bifunctor = {\n    URI: URI,\n    bimap: _bimap,\n    mapLeft: _mapLeft\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Semigroupoid = {\n    URI: URI,\n    compose: _compose\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Comonad = {\n    URI: URI,\n    map: _map,\n    extend: _extend,\n    extract: extract\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`mapFst`](#mapfst) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var map = mapFst;\n/**\n * Use [`mapSnd`](#mapsnd) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var mapLeft = mapSnd;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `T.Functor` instead of `T.tuple`\n * (where `T` is from `import T from 'fp-ts/Tuple'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var tuple = {\n    URI: URI,\n    compose: _compose,\n    map: _map,\n    bimap: _bimap,\n    mapLeft: _mapLeft,\n    extract: extract,\n    extend: _extend,\n    reduce: _reduce,\n    foldMap: _foldMap,\n    reduceRight: _reduceRight,\n    traverse: _traverse,\n    sequence: sequence\n};\n"],"names":["RT.fst","RT.snd","RT.extract","RT.foldMap","RT.reduce","RT.reduceRight","flap_"],"mappings":";;;AASU,IAAC,MAAMA;AAIP,IAAC,MAAMC;AAIP,IAAC,OAAO,SAAU,IAAI;AAAE,SAAO,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC;AAAK;AAKxD,SAAS,SAAS,GAAG;AACxB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,IAAI,SAAU,KAAK,IAAI;AAAE,aAAO,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,OAAO,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC;AAAA,IAAI;AAAA,EAC3F;AACA;AACA,IAAI,KAAK,SAAU,GAAG;AAClB,SAAO,SAAU,GAAG;AAChB,WAAO,CAAC,GAAG,EAAE,KAAK;AAAA,EAC1B;AACA;AAKO,SAAS,eAAe,GAAG;AAC9B,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,IAAI,GAAG,CAAC;AAAA,EAChB;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,SAAU,IAAI,GAAG;AACpB,UAAI,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AACxC,aAAO,CAAC,GAAG,EAAE,OAAO,IAAI,EAAE,GAAG,CAAC,CAAC;AAAA,IAClC;AAAA,EACT;AACA;AAKO,SAAS,SAAS,GAAG;AACxB,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT,IAAI,GAAG,CAAC;AAAA,EAChB;AACA;AAKO,SAAS,YAAY,GAAG;AAC3B,MAAI,WAAW,SAAU,GAAG,GAAG;AAC3B,QAAI,SAAS,EAAE,CAAC;AAChB,QAAI,MAAM,EAAE;AACZ,QAAI,IAAI,IAAI,MAAM;AAClB,WAAO,EAAE,SAAS,QAAQ;AACtB,YAAM,EAAE,OAAO,KAAK,IAAI,MAAM,CAAC;AAC/B,eAAS,EAAE,EAAE,IAAI;AACjB,UAAI,IAAI,MAAM;AAAA,IACjB;AACD,WAAO,CAAC,EAAE,OAAO,EAAE,OAAO,KAAK,IAAI,MAAM,CAAC,CAAC;AAAA,EACnD;AACI,MAAI,IAAI,SAAS,CAAC;AAClB,SAAO;AAAA,IACH;AAAA,IACA,IAAI;AAAA,IACJ,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,OAAO,EAAE;AAAA,IACT;AAAA,EACR;AACA;AAEA,IAAI,WAAW,SAAU,IAAI,IAAI;AAAE,SAAO,KAAK,IAAI,QAAQ,EAAE,CAAC;;AAE9D,IAAI,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,CAAC,CAAC;;AAEvD,IAAI,SAAS,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;AAAE;AAEhE,IAAI,WAAW,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE3D,IAAI,UAAU,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,CAAC,CAAC;;AAE1D,IAAI,UAAU,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC;AAAE;AAElE,IAAI,WAAW,SAAU,GAAG;AACxB,MAAI,WAAW,QAAS;AACxB,SAAO,SAAU,IAAI,GAAG;AAAE,WAAO,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;AACzD;AAEA,IAAI,eAAe,SAAU,IAAI,GAAG,GAAG;AAAE,SAAO,KAAK,IAAI,YAAY,GAAG,CAAC,CAAC;AAAE;AAE5E,SAAS,UAAU,GAAG;AAClB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,IAAI,GAAG;AAAE,WAAO,KAAK,IAAI,UAAU,CAAC,CAAC;AAAA;AAC1D;AAOU,IAAC,QAAQ,SAAU,GAAG,GAAG;AAAE,SAAO,SAAU,IAAI;AACtD,WAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;AAAA,EAClC;AAAK;AASK,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC;AAAA,EAAE;AAAM;AASnF,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;AAAA,EAAE;AAAM;AAInF,IAAC,UAAU,SAAU,IAAI;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EAAI;AAAI;AAIlF,IAAC,SAAS,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AAAE,WAAO,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC;AAAA,EAAI;AAAI;AAI9E,IAAC,YAA0B,uBAAO,QAAQ;AAK1C,IAAC,UAAUC;AAKX,IAAC,UAAUC;AAKX,IAAC,SAASC;AAKV,IAAC,cAAcC;AAKf,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,SAAU,GAAG;AAAE,eAAO,CAAC,GAAG,IAAI,EAAE,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACnH;AAKU,IAAC,WAAW,SAAU,GAAG;AAC/B,SAAO,SAAU,KAAK;AAClB,WAAO,EAAE,IAAI,IAAI,GAAG,GAAG,SAAU,GAAG;AAAE,aAAO,CAAC,GAAG,IAAI,GAAG,CAAC;AAAA,IAAI,CAAA;AAAA,EACrE;AACA;AAKU,IAAC,MAAM;AAKP,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAKU,IAAC,OAAqBC,uBAAM,OAAO;AAKnC,IAAC,YAAY;AAAA,EACnB;AAAA,EACA,OAAO;AAAA,EACP,SAAS;AACb;AAKU,IAAC,eAAe;AAAA,EACtB;AAAA,EACA,SAAS;AACb;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR;AACJ;AAKU,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AACjB;AAKU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;AAWU,IAAC,MAAM;AAQP,IAAC,UAAU;AAUX,IAAC,QAAQ;AAAA,EACf;AAAA,EACA,SAAS;AAAA,EACT,KAAK;AAAA,EACL,OAAO;AAAA,EACP,SAAS;AAAA,EACT;AAAA,EACA,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU;AAAA,EACV;AACJ;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/Unfoldable.cjs

@@ -0,0 +1,2 @@
+"use strict";
+//# sourceMappingURL=Unfoldable.cjs.map

package/dist/_node_modules/fp-ts/es6/Unfoldable.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Unfoldable.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/_node_modules/fp-ts/es6/Unfoldable.js

@@ -0,0 +1,2 @@
+
+//# sourceMappingURL=Unfoldable.js.map

package/dist/_node_modules/fp-ts/es6/Unfoldable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Unfoldable.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/_node_modules/fp-ts/es6/ValidationT.cjs

@@ -0,0 +1,27 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const Applicative = require("./Applicative.cjs");
+const Either = require("./Either.cjs");
+const internal = require("./internal.cjs");
+function getValidationM(S, M) {
+  var A = Applicative.getApplicativeComposition(M, Either.getApplicativeValidation(S));
+  return {
+    map: A.map,
+    ap: A.ap,
+    of: A.of,
+    chain: function(ma, f) {
+      return M.chain(ma, function(e) {
+        return internal.isLeft(e) ? M.of(internal.left(e.left)) : f(e.right);
+      });
+    },
+    alt: function(me, that) {
+      return M.chain(me, function(e1) {
+        return internal.isRight(e1) ? M.of(e1) : M.map(that(), function(e2) {
+          return internal.isLeft(e2) ? internal.left(S.concat(e1.left, e2.left)) : e2;
+        });
+      });
+    }
+  };
+}
+exports.getValidationM = getValidationM;
+//# sourceMappingURL=ValidationT.cjs.map

package/dist/_node_modules/fp-ts/es6/ValidationT.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ValidationT.cjs","sources":["../../../../../../node_modules/fp-ts/es6/ValidationT.js"],"sourcesContent":["/**\n * @since 2.0.0\n */\nimport { getApplicativeComposition } from './Applicative';\nimport * as E from './Either';\nimport * as _ from './internal';\n/** @deprecated */\nexport function getValidationM(S, M) {\n    var A = getApplicativeComposition(M, E.getApplicativeValidation(S));\n    return {\n        map: A.map,\n        ap: A.ap,\n        of: A.of,\n        chain: function (ma, f) { return M.chain(ma, function (e) { return (_.isLeft(e) ? M.of(_.left(e.left)) : f(e.right)); }); },\n        alt: function (me, that) {\n            return M.chain(me, function (e1) {\n                return _.isRight(e1) ? M.of(e1) : M.map(that(), function (e2) { return (_.isLeft(e2) ? _.left(S.concat(e1.left, e2.left)) : e2); });\n            });\n        }\n    };\n}\n"],"names":["getApplicativeComposition","E.getApplicativeValidation","_.isLeft","_.left","_.isRight"],"mappings":";;;;;AAOO,SAAS,eAAe,GAAG,GAAG;AACjC,MAAI,IAAIA,YAAAA,0BAA0B,GAAGC,OAAAA,yBAA2B,CAAC,CAAC;AAClE,SAAO;AAAA,IACH,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,IAAI,EAAE;AAAA,IACN,OAAO,SAAU,IAAI,GAAG;AAAE,aAAO,EAAE,MAAM,IAAI,SAAU,GAAG;AAAE,eAAQC,SAAAA,OAAS,CAAC,IAAI,EAAE,GAAGC,cAAO,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK;AAAA,MAAG,CAAE;AAAA,IAAI;AAAA,IAC3H,KAAK,SAAU,IAAI,MAAM;AACrB,aAAO,EAAE,MAAM,IAAI,SAAU,IAAI;AAC7B,eAAOC,iBAAU,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,QAAQ,SAAU,IAAI;AAAE,iBAAQF,gBAAS,EAAE,IAAIC,SAAAA,KAAO,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,IAAI;AAAA,QAAM,CAAA;AAAA,MAClJ,CAAa;AAAA,IACJ;AAAA,EACT;AACA;;","x_google_ignoreList":[0]}

package/dist/_node_modules/fp-ts/es6/ValidationT.js

@@ -0,0 +1,27 @@
+import { getApplicativeComposition } from "./Applicative.js";
+import { getApplicativeValidation } from "./Either.js";
+import { isLeft, left, isRight } from "./internal.js";
+function getValidationM(S, M) {
+  var A = getApplicativeComposition(M, getApplicativeValidation(S));
+  return {
+    map: A.map,
+    ap: A.ap,
+    of: A.of,
+    chain: function(ma, f) {
+      return M.chain(ma, function(e) {
+        return isLeft(e) ? M.of(left(e.left)) : f(e.right);
+      });
+    },
+    alt: function(me, that) {
+      return M.chain(me, function(e1) {
+        return isRight(e1) ? M.of(e1) : M.map(that(), function(e2) {
+          return isLeft(e2) ? left(S.concat(e1.left, e2.left)) : e2;
+        });
+      });
+    }
+  };
+}
+export {
+  getValidationM
+};
+//# sourceMappingURL=ValidationT.js.map

package/dist/_node_modules/fp-ts/es6/ValidationT.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ValidationT.js","sources":["../../../../../../node_modules/fp-ts/es6/ValidationT.js"],"sourcesContent":["/**\n * @since 2.0.0\n */\nimport { getApplicativeComposition } from './Applicative';\nimport * as E from './Either';\nimport * as _ from './internal';\n/** @deprecated */\nexport function getValidationM(S, M) {\n    var A = getApplicativeComposition(M, E.getApplicativeValidation(S));\n    return {\n        map: A.map,\n        ap: A.ap,\n        of: A.of,\n        chain: function (ma, f) { return M.chain(ma, function (e) { return (_.isLeft(e) ? M.of(_.left(e.left)) : f(e.right)); }); },\n        alt: function (me, that) {\n            return M.chain(me, function (e1) {\n                return _.isRight(e1) ? M.of(e1) : M.map(that(), function (e2) { return (_.isLeft(e2) ? _.left(S.concat(e1.left, e2.left)) : e2); });\n            });\n        }\n    };\n}\n"],"names":["E.getApplicativeValidation","_.isLeft","_.left","_.isRight"],"mappings":";;;AAOO,SAAS,eAAe,GAAG,GAAG;AACjC,MAAI,IAAI,0BAA0B,GAAGA,yBAA2B,CAAC,CAAC;AAClE,SAAO;AAAA,IACH,KAAK,EAAE;AAAA,IACP,IAAI,EAAE;AAAA,IACN,IAAI,EAAE;AAAA,IACN,OAAO,SAAU,IAAI,GAAG;AAAE,aAAO,EAAE,MAAM,IAAI,SAAU,GAAG;AAAE,eAAQC,OAAS,CAAC,IAAI,EAAE,GAAGC,KAAO,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK;AAAA,MAAG,CAAE;AAAA,IAAI;AAAA,IAC3H,KAAK,SAAU,IAAI,MAAM;AACrB,aAAO,EAAE,MAAM,IAAI,SAAU,IAAI;AAC7B,eAAOC,QAAU,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,QAAQ,SAAU,IAAI;AAAE,iBAAQF,OAAS,EAAE,IAAIC,KAAO,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,IAAI;AAAA,QAAM,CAAA;AAAA,MAClJ,CAAa;AAAA,IACJ;AAAA,EACT;AACA;","x_google_ignoreList":[0]}