@slicemachine/manager 0.22.2-alpha.dani-repeatable-links-codegen.2 → 0.22.2-alpha.dani-repeatable-links-warning.1

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

@@ -1 +0,0 @@
-{"version":3,"file":"Endomorphism.js","sources":["../../../../../../node_modules/fp-ts/es6/Endomorphism.js"],"sourcesContent":["/**\n * @since 2.11.0\n */\nimport { flow, identity } from './function';\n/**\n * @category type lambdas\n * @since 2.11.0\n */\nexport var URI = 'Endomorphism';\n/**\n * Endomorphism form a `Semigroup` where the `concat` operation is the usual function composition.\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getSemigroup = function () { return ({\n    concat: function (first, second) { return flow(first, second); }\n}); };\n/**\n * Endomorphism form a `Monoid` where the `empty` value is the `identity` function.\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getMonoid = function () { return ({\n    concat: getSemigroup().concat,\n    empty: identity\n}); };\n"],"names":[],"mappings":";AAQU,IAAC,MAAM;AAOP,IAAC,eAAe,WAAY;AAAE,SAAQ;AAAA,IAC5C,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,KAAK,OAAO,MAAM;AAAA,IAAI;AAAA,EACpE;AAAM;AAOI,IAAC,YAAY,WAAY;AAAE,SAAQ;AAAA,IACzC,QAAQ,aAAY,EAAG;AAAA,IACvB,OAAO;AAAA,EACX;AAAG;","x_google_ignoreList":[0]}

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

@@ -1,101 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const _function = require("./function.cjs");
-var fromEquals = function(equals) {
-  return {
-    equals: function(x, y) {
-      return x === y || equals(x, y);
-    }
-  };
-};
-var struct = function(eqs) {
-  return fromEquals(function(first, second) {
-    for (var key in eqs) {
-      if (!eqs[key].equals(first[key], second[key])) {
-        return false;
-      }
-    }
-    return true;
-  });
-};
-var tuple = function() {
-  var eqs = [];
-  for (var _i = 0; _i < arguments.length; _i++) {
-    eqs[_i] = arguments[_i];
-  }
-  return fromEquals(function(first, second) {
-    return eqs.every(function(E, i) {
-      return E.equals(first[i], second[i]);
-    });
-  });
-};
-var contramap_ = function(fa, f) {
-  return _function.pipe(fa, contramap(f));
-};
-var contramap = function(f) {
-  return function(fa) {
-    return fromEquals(function(x, y) {
-      return fa.equals(f(x), f(y));
-    });
-  };
-};
-var URI = "Eq";
-var eqStrict = {
-  equals: function(a, b) {
-    return a === b;
-  }
-};
-var empty = {
-  equals: function() {
-    return true;
-  }
-};
-var getSemigroup = function() {
-  return {
-    concat: function(x, y) {
-      return fromEquals(function(a, b) {
-        return x.equals(a, b) && y.equals(a, b);
-      });
-    }
-  };
-};
-var getMonoid = function() {
-  return {
-    concat: getSemigroup().concat,
-    empty
-  };
-};
-var Contravariant = {
-  URI,
-  contramap: contramap_
-};
-var getTupleEq = tuple;
-var getStructEq = struct;
-var strictEqual = eqStrict.equals;
-var eq = Contravariant;
-var eqBoolean = eqStrict;
-var eqString = eqStrict;
-var eqNumber = eqStrict;
-var eqDate = {
-  equals: function(first, second) {
-    return first.valueOf() === second.valueOf();
-  }
-};
-exports.Contravariant = Contravariant;
-exports.URI = URI;
-exports.contramap = contramap;
-exports.eq = eq;
-exports.eqBoolean = eqBoolean;
-exports.eqDate = eqDate;
-exports.eqNumber = eqNumber;
-exports.eqStrict = eqStrict;
-exports.eqString = eqString;
-exports.fromEquals = fromEquals;
-exports.getMonoid = getMonoid;
-exports.getSemigroup = getSemigroup;
-exports.getStructEq = getStructEq;
-exports.getTupleEq = getTupleEq;
-exports.strictEqual = strictEqual;
-exports.struct = struct;
-exports.tuple = tuple;
-//# sourceMappingURL=Eq.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Eq.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Eq.js"],"sourcesContent":["import { pipe } from './function';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport var fromEquals = function (equals) { return ({\n    equals: function (x, y) { return x === y || equals(x, y); }\n}); };\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var struct = function (eqs) {\n    return fromEquals(function (first, second) {\n        for (var key in eqs) {\n            if (!eqs[key].equals(first[key], second[key])) {\n                return false;\n            }\n        }\n        return true;\n    });\n};\n/**\n * Given a tuple of `Eq`s returns a `Eq` for the tuple\n *\n * @example\n * import { tuple } from 'fp-ts/Eq'\n * import * as S from 'fp-ts/string'\n * import * as N from 'fp-ts/number'\n * import * as B from 'fp-ts/boolean'\n *\n * const E = tuple(S.Eq, N.Eq, B.Eq)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 1, true]), true)\n * assert.strictEqual(E.equals(['a', 1, true], ['b', 1, true]), false)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 2, true]), false)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 1, false]), false)\n *\n * @since 2.10.0\n */\nexport var tuple = function () {\n    var eqs = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        eqs[_i] = arguments[_i];\n    }\n    return fromEquals(function (first, second) { return eqs.every(function (E, i) { return E.equals(first[i], second[i]); }); });\n};\n/* istanbul ignore next */\nvar contramap_ = function (fa, f) { return pipe(fa, contramap(f)); };\n/**\n * A typical use case for `contramap` would be like, given some `User` type, to construct an `Eq<User>`.\n *\n * We can do so with a function from `User -> X` where `X` is some value that we know how to compare\n * for equality (meaning we have an `Eq<X>`)\n *\n * For example, given the following `User` type, we want to construct an `Eq<User>` that just looks at the `key` field\n * for each user (since it's known to be unique).\n *\n * If we have a way of comparing `UUID`s for equality (`eqUUID: Eq<UUID>`) and we know how to go from `User -> UUID`,\n * using `contramap` we can do this\n *\n * @example\n * import { contramap, Eq } from 'fp-ts/Eq'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/string'\n *\n * type UUID = string\n *\n * interface User {\n *   readonly key: UUID\n *   readonly firstName: string\n *   readonly lastName: string\n * }\n *\n * const eqUUID: Eq<UUID> = S.Eq\n *\n * const eqUserByKey: Eq<User> = pipe(\n *   eqUUID,\n *   contramap((user) => user.key)\n * )\n *\n * assert.deepStrictEqual(\n *   eqUserByKey.equals(\n *     { key: 'k1', firstName: 'a1', lastName: 'b1' },\n *     { key: 'k2', firstName: 'a1', lastName: 'b1' }\n *   ),\n *   false\n * )\n * assert.deepStrictEqual(\n *   eqUserByKey.equals(\n *     { key: 'k1', firstName: 'a1', lastName: 'b1' },\n *     { key: 'k1', firstName: 'a2', lastName: 'b1' }\n *   ),\n *   true\n * )\n *\n * @since 2.0.0\n */\nexport var contramap = function (f) { return function (fa) {\n    return fromEquals(function (x, y) { return fa.equals(f(x), f(y)); });\n}; };\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Eq';\n/**\n * @category instances\n * @since 2.5.0\n */\nexport var eqStrict = {\n    equals: function (a, b) { return a === b; }\n};\nvar empty = {\n    equals: function () { return true; }\n};\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var getSemigroup = function () { return ({\n    concat: function (x, y) { return fromEquals(function (a, b) { return x.equals(a, b) && y.equals(a, b); }); }\n}); };\n/**\n * @category instances\n * @since 2.6.0\n */\nexport var getMonoid = function () { return ({\n    concat: getSemigroup().concat,\n    empty: empty\n}); };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Contravariant = {\n    URI: URI,\n    contramap: contramap_\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getTupleEq = tuple;\n/**\n * Use [`struct`](#struct) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getStructEq = struct;\n/**\n * Use [`eqStrict`](#eqstrict) instead\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var strictEqual = eqStrict.equals;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Contravariant` instance, pass `E.Contravariant` instead of `E.eq`\n * (where `E` is from `import E from 'fp-ts/Eq'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eq = Contravariant;\n/**\n * Use [`Eq`](./boolean.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqBoolean = eqStrict;\n/**\n * Use [`Eq`](./string.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqString = eqStrict;\n/**\n * Use [`Eq`](./number.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqNumber = eqStrict;\n/**\n * Use [`Eq`](./Date.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqDate = {\n    equals: function (first, second) { return first.valueOf() === second.valueOf(); }\n};\n"],"names":["pipe"],"mappings":";;;AAQU,IAAC,aAAa,SAAU,QAAQ;AAAE,SAAQ;AAAA,IAChD,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAO,MAAM,KAAK,OAAO,GAAG,CAAC;AAAA,IAAI;AAAA,EAC/D;AAAM;AAOI,IAAC,SAAS,SAAU,KAAK;AAC/B,SAAO,WAAW,SAAU,OAAO,QAAQ;AACvC,aAAS,OAAO,KAAK;AACjB,UAAI,CAAC,IAAI,GAAG,EAAE,OAAO,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG;AAC3C,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf,CAAK;AACL;AAkBU,IAAC,QAAQ,WAAY;AAC3B,MAAI,MAAM,CAAA;AACV,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,QAAI,EAAE,IAAI,UAAU,EAAE;AAAA,EACzB;AACD,SAAO,WAAW,SAAU,OAAO,QAAQ;AAAE,WAAO,IAAI,MAAM,SAAU,GAAG,GAAG;AAAE,aAAO,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,IAAE,CAAE;AAAA,EAAE,CAAE;AAC/H;AAEA,IAAI,aAAa,SAAU,IAAI,GAAG;AAAE,SAAOA,UAAAA,KAAK,IAAI,UAAU,CAAC,CAAC;;AAkDtD,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,WAAW,SAAU,GAAG,GAAG;AAAE,aAAO,GAAG,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,IAAI,CAAA;AAAA,EACvE;AAAK;AAKK,IAAC,MAAM;AAKP,IAAC,WAAW;AAAA,EAClB,QAAQ,SAAU,GAAG,GAAG;AAAE,WAAO,MAAM;AAAA,EAAI;AAC/C;AACA,IAAI,QAAQ;AAAA,EACR,QAAQ,WAAY;AAAE,WAAO;AAAA,EAAO;AACxC;AAKU,IAAC,eAAe,WAAY;AAAE,SAAQ;AAAA,IAC5C,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAO,WAAW,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,OAAO,GAAG,CAAC,KAAK,EAAE,OAAO,GAAG,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA,EAChH;AAAM;AAKI,IAAC,YAAY,WAAY;AAAE,SAAQ;AAAA,IACzC,QAAQ,aAAY,EAAG;AAAA,IACvB;AAAA,EACJ;AAAM;AAKI,IAAC,gBAAgB;AAAA,EACvB;AAAA,EACA,WAAW;AACf;AAWU,IAAC,aAAa;AAQd,IAAC,cAAc;AAQf,IAAC,cAAc,SAAS;AAUxB,IAAC,KAAK;AAQN,IAAC,YAAY;AAQb,IAAC,WAAW;AAQZ,IAAC,WAAW;AAQZ,IAAC,SAAS;AAAA,EAChB,QAAQ,SAAU,OAAO,QAAQ;AAAE,WAAO,MAAM,cAAc,OAAO,QAAO;AAAA,EAAK;AACrF;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}

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

@@ -1,101 +0,0 @@
-import { pipe } from "./function.js";
-var fromEquals = function(equals) {
-  return {
-    equals: function(x, y) {
-      return x === y || equals(x, y);
-    }
-  };
-};
-var struct = function(eqs) {
-  return fromEquals(function(first, second) {
-    for (var key in eqs) {
-      if (!eqs[key].equals(first[key], second[key])) {
-        return false;
-      }
-    }
-    return true;
-  });
-};
-var tuple = function() {
-  var eqs = [];
-  for (var _i = 0; _i < arguments.length; _i++) {
-    eqs[_i] = arguments[_i];
-  }
-  return fromEquals(function(first, second) {
-    return eqs.every(function(E, i) {
-      return E.equals(first[i], second[i]);
-    });
-  });
-};
-var contramap_ = function(fa, f) {
-  return pipe(fa, contramap(f));
-};
-var contramap = function(f) {
-  return function(fa) {
-    return fromEquals(function(x, y) {
-      return fa.equals(f(x), f(y));
-    });
-  };
-};
-var URI = "Eq";
-var eqStrict = {
-  equals: function(a, b) {
-    return a === b;
-  }
-};
-var empty = {
-  equals: function() {
-    return true;
-  }
-};
-var getSemigroup = function() {
-  return {
-    concat: function(x, y) {
-      return fromEquals(function(a, b) {
-        return x.equals(a, b) && y.equals(a, b);
-      });
-    }
-  };
-};
-var getMonoid = function() {
-  return {
-    concat: getSemigroup().concat,
-    empty
-  };
-};
-var Contravariant = {
-  URI,
-  contramap: contramap_
-};
-var getTupleEq = tuple;
-var getStructEq = struct;
-var strictEqual = eqStrict.equals;
-var eq = Contravariant;
-var eqBoolean = eqStrict;
-var eqString = eqStrict;
-var eqNumber = eqStrict;
-var eqDate = {
-  equals: function(first, second) {
-    return first.valueOf() === second.valueOf();
-  }
-};
-export {
-  Contravariant,
-  URI,
-  contramap,
-  eq,
-  eqBoolean,
-  eqDate,
-  eqNumber,
-  eqStrict,
-  eqString,
-  fromEquals,
-  getMonoid,
-  getSemigroup,
-  getStructEq,
-  getTupleEq,
-  strictEqual,
-  struct,
-  tuple
-};
-//# sourceMappingURL=Eq.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Eq.js","sources":["../../../../../../node_modules/fp-ts/es6/Eq.js"],"sourcesContent":["import { pipe } from './function';\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * @category constructors\n * @since 2.0.0\n */\nexport var fromEquals = function (equals) { return ({\n    equals: function (x, y) { return x === y || equals(x, y); }\n}); };\n// -------------------------------------------------------------------------------------\n// combinators\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.10.0\n */\nexport var struct = function (eqs) {\n    return fromEquals(function (first, second) {\n        for (var key in eqs) {\n            if (!eqs[key].equals(first[key], second[key])) {\n                return false;\n            }\n        }\n        return true;\n    });\n};\n/**\n * Given a tuple of `Eq`s returns a `Eq` for the tuple\n *\n * @example\n * import { tuple } from 'fp-ts/Eq'\n * import * as S from 'fp-ts/string'\n * import * as N from 'fp-ts/number'\n * import * as B from 'fp-ts/boolean'\n *\n * const E = tuple(S.Eq, N.Eq, B.Eq)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 1, true]), true)\n * assert.strictEqual(E.equals(['a', 1, true], ['b', 1, true]), false)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 2, true]), false)\n * assert.strictEqual(E.equals(['a', 1, true], ['a', 1, false]), false)\n *\n * @since 2.10.0\n */\nexport var tuple = function () {\n    var eqs = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        eqs[_i] = arguments[_i];\n    }\n    return fromEquals(function (first, second) { return eqs.every(function (E, i) { return E.equals(first[i], second[i]); }); });\n};\n/* istanbul ignore next */\nvar contramap_ = function (fa, f) { return pipe(fa, contramap(f)); };\n/**\n * A typical use case for `contramap` would be like, given some `User` type, to construct an `Eq<User>`.\n *\n * We can do so with a function from `User -> X` where `X` is some value that we know how to compare\n * for equality (meaning we have an `Eq<X>`)\n *\n * For example, given the following `User` type, we want to construct an `Eq<User>` that just looks at the `key` field\n * for each user (since it's known to be unique).\n *\n * If we have a way of comparing `UUID`s for equality (`eqUUID: Eq<UUID>`) and we know how to go from `User -> UUID`,\n * using `contramap` we can do this\n *\n * @example\n * import { contramap, Eq } from 'fp-ts/Eq'\n * import { pipe } from 'fp-ts/function'\n * import * as S from 'fp-ts/string'\n *\n * type UUID = string\n *\n * interface User {\n *   readonly key: UUID\n *   readonly firstName: string\n *   readonly lastName: string\n * }\n *\n * const eqUUID: Eq<UUID> = S.Eq\n *\n * const eqUserByKey: Eq<User> = pipe(\n *   eqUUID,\n *   contramap((user) => user.key)\n * )\n *\n * assert.deepStrictEqual(\n *   eqUserByKey.equals(\n *     { key: 'k1', firstName: 'a1', lastName: 'b1' },\n *     { key: 'k2', firstName: 'a1', lastName: 'b1' }\n *   ),\n *   false\n * )\n * assert.deepStrictEqual(\n *   eqUserByKey.equals(\n *     { key: 'k1', firstName: 'a1', lastName: 'b1' },\n *     { key: 'k1', firstName: 'a2', lastName: 'b1' }\n *   ),\n *   true\n * )\n *\n * @since 2.0.0\n */\nexport var contramap = function (f) { return function (fa) {\n    return fromEquals(function (x, y) { return fa.equals(f(x), f(y)); });\n}; };\n/**\n * @category type lambdas\n * @since 2.0.0\n */\nexport var URI = 'Eq';\n/**\n * @category instances\n * @since 2.5.0\n */\nexport var eqStrict = {\n    equals: function (a, b) { return a === b; }\n};\nvar empty = {\n    equals: function () { return true; }\n};\n/**\n * @category instances\n * @since 2.10.0\n */\nexport var getSemigroup = function () { return ({\n    concat: function (x, y) { return fromEquals(function (a, b) { return x.equals(a, b) && y.equals(a, b); }); }\n}); };\n/**\n * @category instances\n * @since 2.6.0\n */\nexport var getMonoid = function () { return ({\n    concat: getSemigroup().concat,\n    empty: empty\n}); };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Contravariant = {\n    URI: URI,\n    contramap: contramap_\n};\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`tuple`](#tuple) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getTupleEq = tuple;\n/**\n * Use [`struct`](#struct) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var getStructEq = struct;\n/**\n * Use [`eqStrict`](#eqstrict) instead\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var strictEqual = eqStrict.equals;\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Contravariant` instance, pass `E.Contravariant` instead of `E.eq`\n * (where `E` is from `import E from 'fp-ts/Eq'`)\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eq = Contravariant;\n/**\n * Use [`Eq`](./boolean.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqBoolean = eqStrict;\n/**\n * Use [`Eq`](./string.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqString = eqStrict;\n/**\n * Use [`Eq`](./number.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqNumber = eqStrict;\n/**\n * Use [`Eq`](./Date.ts.html#eq) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var eqDate = {\n    equals: function (first, second) { return first.valueOf() === second.valueOf(); }\n};\n"],"names":[],"mappings":";AAQU,IAAC,aAAa,SAAU,QAAQ;AAAE,SAAQ;AAAA,IAChD,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAO,MAAM,KAAK,OAAO,GAAG,CAAC;AAAA,IAAI;AAAA,EAC/D;AAAM;AAOI,IAAC,SAAS,SAAU,KAAK;AAC/B,SAAO,WAAW,SAAU,OAAO,QAAQ;AACvC,aAAS,OAAO,KAAK;AACjB,UAAI,CAAC,IAAI,GAAG,EAAE,OAAO,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG;AAC3C,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf,CAAK;AACL;AAkBU,IAAC,QAAQ,WAAY;AAC3B,MAAI,MAAM,CAAA;AACV,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,QAAI,EAAE,IAAI,UAAU,EAAE;AAAA,EACzB;AACD,SAAO,WAAW,SAAU,OAAO,QAAQ;AAAE,WAAO,IAAI,MAAM,SAAU,GAAG,GAAG;AAAE,aAAO,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,IAAE,CAAE;AAAA,EAAE,CAAE;AAC/H;AAEA,IAAI,aAAa,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,UAAU,CAAC,CAAC;;AAkDtD,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,SAAU,IAAI;AACvD,WAAO,WAAW,SAAU,GAAG,GAAG;AAAE,aAAO,GAAG,OAAO,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,IAAI,CAAA;AAAA,EACvE;AAAK;AAKK,IAAC,MAAM;AAKP,IAAC,WAAW;AAAA,EAClB,QAAQ,SAAU,GAAG,GAAG;AAAE,WAAO,MAAM;AAAA,EAAI;AAC/C;AACA,IAAI,QAAQ;AAAA,EACR,QAAQ,WAAY;AAAE,WAAO;AAAA,EAAO;AACxC;AAKU,IAAC,eAAe,WAAY;AAAE,SAAQ;AAAA,IAC5C,QAAQ,SAAU,GAAG,GAAG;AAAE,aAAO,WAAW,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,OAAO,GAAG,CAAC,KAAK,EAAE,OAAO,GAAG,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA,EAChH;AAAM;AAKI,IAAC,YAAY,WAAY;AAAE,SAAQ;AAAA,IACzC,QAAQ,aAAY,EAAG;AAAA,IACvB;AAAA,EACJ;AAAM;AAKI,IAAC,gBAAgB;AAAA,EACvB;AAAA,EACA,WAAW;AACf;AAWU,IAAC,aAAa;AAQd,IAAC,cAAc;AAQf,IAAC,cAAc,SAAS;AAUxB,IAAC,KAAK;AAQN,IAAC,YAAY;AAQb,IAAC,WAAW;AAQZ,IAAC,WAAW;AAQZ,IAAC,SAAS;AAAA,EAChB,QAAQ,SAAU,OAAO,QAAQ;AAAE,WAAO,MAAM,cAAc,OAAO,QAAO;AAAA,EAAK;AACrF;","x_google_ignoreList":[0]}

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

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

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

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

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

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

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

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

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

@@ -1,42 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-function gcd(E, field) {
-  var zero = field.zero;
-  var f = function(x, y) {
-    return E.equals(y, zero) ? x : f(y, field.mod(x, y));
-  };
-  return f;
-}
-function lcm(E, F) {
-  var zero = F.zero;
-  var gcdSF = gcd(E, F);
-  return function(x, y) {
-    return E.equals(x, zero) || E.equals(y, zero) ? zero : F.div(F.mul(x, y), gcdSF(x, y));
-  };
-}
-var fieldNumber = {
-  add: function(x, y) {
-    return x + y;
-  },
-  zero: 0,
-  mul: function(x, y) {
-    return x * y;
-  },
-  one: 1,
-  sub: function(x, y) {
-    return x - y;
-  },
-  degree: function(_) {
-    return 1;
-  },
-  div: function(x, y) {
-    return x / y;
-  },
-  mod: function(x, y) {
-    return x % y;
-  }
-};
-exports.fieldNumber = fieldNumber;
-exports.gcd = gcd;
-exports.lcm = lcm;
-//# sourceMappingURL=Field.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Field.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Field.js"],"sourcesContent":["// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * The *greatest common divisor* of two values\n *\n * @since 2.0.0\n */\nexport function gcd(E, field) {\n    var zero = field.zero;\n    var f = function (x, y) { return (E.equals(y, zero) ? x : f(y, field.mod(x, y))); };\n    return f;\n}\n/**\n * The *least common multiple* of two values\n *\n * @since 2.0.0\n */\nexport function lcm(E, F) {\n    var zero = F.zero;\n    var gcdSF = gcd(E, F);\n    return function (x, y) { return (E.equals(x, zero) || E.equals(y, zero) ? zero : F.div(F.mul(x, y), gcdSF(x, y))); };\n}\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`Field`](./number.ts.html#field) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var fieldNumber = {\n    add: function (x, y) { return x + y; },\n    zero: 0,\n    mul: function (x, y) { return x * y; },\n    one: 1,\n    sub: function (x, y) { return x - y; },\n    degree: function (_) { return 1; },\n    div: function (x, y) { return x / y; },\n    mod: function (x, y) { return x % y; }\n};\n"],"names":[],"mappings":";;AAQO,SAAS,IAAI,GAAG,OAAO;AAC1B,MAAI,OAAO,MAAM;AACjB,MAAI,IAAI,SAAU,GAAG,GAAG;AAAE,WAAQ,EAAE,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA;AAC9E,SAAO;AACX;AAMO,SAAS,IAAI,GAAG,GAAG;AACtB,MAAI,OAAO,EAAE;AACb,MAAI,QAAQ,IAAI,GAAG,CAAC;AACpB,SAAO,SAAU,GAAG,GAAG;AAAE,WAAQ,EAAE,OAAO,GAAG,IAAI,KAAK,EAAE,OAAO,GAAG,IAAI,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,EAAG;AACtH;AAWU,IAAC,cAAc;AAAA,EACrB,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,MAAM;AAAA,EACN,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,KAAK;AAAA,EACL,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,QAAQ,SAAU,GAAG;AAAE,WAAO;AAAA,EAAI;AAAA,EAClC,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAC1C;;;;","x_google_ignoreList":[0]}

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

@@ -1,42 +0,0 @@
-function gcd(E, field) {
-  var zero = field.zero;
-  var f = function(x, y) {
-    return E.equals(y, zero) ? x : f(y, field.mod(x, y));
-  };
-  return f;
-}
-function lcm(E, F) {
-  var zero = F.zero;
-  var gcdSF = gcd(E, F);
-  return function(x, y) {
-    return E.equals(x, zero) || E.equals(y, zero) ? zero : F.div(F.mul(x, y), gcdSF(x, y));
-  };
-}
-var fieldNumber = {
-  add: function(x, y) {
-    return x + y;
-  },
-  zero: 0,
-  mul: function(x, y) {
-    return x * y;
-  },
-  one: 1,
-  sub: function(x, y) {
-    return x - y;
-  },
-  degree: function(_) {
-    return 1;
-  },
-  div: function(x, y) {
-    return x / y;
-  },
-  mod: function(x, y) {
-    return x % y;
-  }
-};
-export {
-  fieldNumber,
-  gcd,
-  lcm
-};
-//# sourceMappingURL=Field.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Field.js","sources":["../../../../../../node_modules/fp-ts/es6/Field.js"],"sourcesContent":["// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * The *greatest common divisor* of two values\n *\n * @since 2.0.0\n */\nexport function gcd(E, field) {\n    var zero = field.zero;\n    var f = function (x, y) { return (E.equals(y, zero) ? x : f(y, field.mod(x, y))); };\n    return f;\n}\n/**\n * The *least common multiple* of two values\n *\n * @since 2.0.0\n */\nexport function lcm(E, F) {\n    var zero = F.zero;\n    var gcdSF = gcd(E, F);\n    return function (x, y) { return (E.equals(x, zero) || E.equals(y, zero) ? zero : F.div(F.mul(x, y), gcdSF(x, y))); };\n}\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`Field`](./number.ts.html#field) instead.\n *\n * @category zone of death\n * @since 2.0.0\n * @deprecated\n */\nexport var fieldNumber = {\n    add: function (x, y) { return x + y; },\n    zero: 0,\n    mul: function (x, y) { return x * y; },\n    one: 1,\n    sub: function (x, y) { return x - y; },\n    degree: function (_) { return 1; },\n    div: function (x, y) { return x / y; },\n    mod: function (x, y) { return x % y; }\n};\n"],"names":[],"mappings":"AAQO,SAAS,IAAI,GAAG,OAAO;AAC1B,MAAI,OAAO,MAAM;AACjB,MAAI,IAAI,SAAU,GAAG,GAAG;AAAE,WAAQ,EAAE,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;AAAA;AAC9E,SAAO;AACX;AAMO,SAAS,IAAI,GAAG,GAAG;AACtB,MAAI,OAAO,EAAE;AACb,MAAI,QAAQ,IAAI,GAAG,CAAC;AACpB,SAAO,SAAU,GAAG,GAAG;AAAE,WAAQ,EAAE,OAAO,GAAG,IAAI,KAAK,EAAE,OAAO,GAAG,IAAI,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,EAAG;AACtH;AAWU,IAAC,cAAc;AAAA,EACrB,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,MAAM;AAAA,EACN,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,KAAK;AAAA,EACL,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,QAAQ,SAAU,GAAG;AAAE,WAAO;AAAA,EAAI;AAAA,EAClC,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAAA,EACtC,KAAK,SAAU,GAAG,GAAG;AAAE,WAAO,IAAI;AAAA,EAAI;AAC1C;","x_google_ignoreList":[0]}

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

@@ -1,80 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const Compactable = require("./Compactable.cjs");
-const _function = require("./function.cjs");
-const Functor = require("./Functor.cjs");
-const Option = require("./Option.cjs");
-const Predicate = require("./Predicate.cjs");
-const Separated = require("./Separated.cjs");
-function filter(F, G) {
-  return function(predicate) {
-    return function(fga) {
-      return F.map(fga, function(ga) {
-        return G.filter(ga, predicate);
-      });
-    };
-  };
-}
-function filterMap(F, G) {
-  return function(f) {
-    return function(fga) {
-      return F.map(fga, function(ga) {
-        return G.filterMap(ga, f);
-      });
-    };
-  };
-}
-function partition(F, G) {
-  var _filter = filter(F, G);
-  return function(predicate) {
-    var left = _filter(Predicate.not(predicate));
-    var right = _filter(predicate);
-    return function(fgb) {
-      return Separated.separated(left(fgb), right(fgb));
-    };
-  };
-}
-function partitionMap(F, G) {
-  var _filterMap = filterMap(F, G);
-  return function(f) {
-    return function(fga) {
-      return Separated.separated(_function.pipe(fga, _filterMap(function(a) {
-        return Option.getLeft(f(a));
-      })), _function.pipe(fga, _filterMap(function(a) {
-        return Option.getRight(f(a));
-      })));
-    };
-  };
-}
-function getFilterableComposition(F, G) {
-  var map = Functor.getFunctorComposition(F, G).map;
-  var _compact = Compactable.compact(F, G);
-  var _separate = Compactable.separate(F, G, G);
-  var _filter = filter(F, G);
-  var _filterMap = filterMap(F, G);
-  var _partition = partition(F, G);
-  var _partitionMap = partitionMap(F, G);
-  return {
-    map,
-    compact: _compact,
-    separate: _separate,
-    filter: function(fga, f) {
-      return _function.pipe(fga, _filter(f));
-    },
-    filterMap: function(fga, f) {
-      return _function.pipe(fga, _filterMap(f));
-    },
-    partition: function(fga, p) {
-      return _function.pipe(fga, _partition(p));
-    },
-    partitionMap: function(fga, f) {
-      return _function.pipe(fga, _partitionMap(f));
-    }
-  };
-}
-exports.filter = filter;
-exports.filterMap = filterMap;
-exports.getFilterableComposition = getFilterableComposition;
-exports.partition = partition;
-exports.partitionMap = partitionMap;
-//# sourceMappingURL=Filterable.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Filterable.cjs","sources":["../../../../../../node_modules/fp-ts/es6/Filterable.js"],"sourcesContent":["/**\n * `Filterable` represents data structures which can be _partitioned_/_filtered_.\n *\n * Adapted from https://github.com/LiamGoodacre/purescript-filterable/blob/master/src/Data/Filterable.purs\n *\n * @since 2.0.0\n */\nimport { compact, separate } from './Compactable';\nimport { pipe } from './function';\nimport { getFunctorComposition } from './Functor';\nimport { getLeft, getRight } from './Option';\nimport { not } from './Predicate';\nimport { separated } from './Separated';\nexport function filter(F, G) {\n    return function (predicate) { return function (fga) { return F.map(fga, function (ga) { return G.filter(ga, predicate); }); }; };\n}\nexport function filterMap(F, G) {\n    return function (f) { return function (fga) { return F.map(fga, function (ga) { return G.filterMap(ga, f); }); }; };\n}\nexport function partition(F, G) {\n    var _filter = filter(F, G);\n    return function (predicate) {\n        var left = _filter(not(predicate));\n        var right = _filter(predicate);\n        return function (fgb) { return separated(left(fgb), right(fgb)); };\n    };\n}\nexport function partitionMap(F, G) {\n    var _filterMap = filterMap(F, G);\n    return function (f) { return function (fga) {\n        return separated(pipe(fga, _filterMap(function (a) { return getLeft(f(a)); })), pipe(fga, _filterMap(function (a) { return getRight(f(a)); })));\n    }; };\n}\n/** @deprecated */\nexport function getFilterableComposition(F, G) {\n    var map = getFunctorComposition(F, G).map;\n    var _compact = compact(F, G);\n    var _separate = separate(F, G, G);\n    var _filter = filter(F, G);\n    var _filterMap = filterMap(F, G);\n    var _partition = partition(F, G);\n    var _partitionMap = partitionMap(F, G);\n    return {\n        map: map,\n        compact: _compact,\n        separate: _separate,\n        filter: function (fga, f) { return pipe(fga, _filter(f)); },\n        filterMap: function (fga, f) { return pipe(fga, _filterMap(f)); },\n        partition: function (fga, p) { return pipe(fga, _partition(p)); },\n        partitionMap: function (fga, f) { return pipe(fga, _partitionMap(f)); }\n    };\n}\n"],"names":["not","separated","pipe","getLeft","getRight","getFunctorComposition","compact","separate"],"mappings":";;;;;;;;AAaO,SAAS,OAAO,GAAG,GAAG;AACzB,SAAO,SAAU,WAAW;AAAE,WAAO,SAAU,KAAK;AAAE,aAAO,EAAE,IAAI,KAAK,SAAU,IAAI;AAAE,eAAO,EAAE,OAAO,IAAI,SAAS;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACjI;AACO,SAAS,UAAU,GAAG,GAAG;AAC5B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AAAE,aAAO,EAAE,IAAI,KAAK,SAAU,IAAI;AAAE,eAAO,EAAE,UAAU,IAAI,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACpH;AACO,SAAS,UAAU,GAAG,GAAG;AAC5B,MAAI,UAAU,OAAO,GAAG,CAAC;AACzB,SAAO,SAAU,WAAW;AACxB,QAAI,OAAO,QAAQA,cAAI,SAAS,CAAC;AACjC,QAAI,QAAQ,QAAQ,SAAS;AAC7B,WAAO,SAAU,KAAK;AAAE,aAAOC,UAAAA,UAAU,KAAK,GAAG,GAAG,MAAM,GAAG,CAAC;AAAA;EACtE;AACA;AACO,SAAS,aAAa,GAAG,GAAG;AAC/B,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,aAAOA,oBAAUC,UAAAA,KAAK,KAAK,WAAW,SAAU,GAAG;AAAE,eAAOC,eAAQ,EAAE,CAAC,CAAC;AAAA,MAAI,CAAA,CAAC,GAAGD,UAAAA,KAAK,KAAK,WAAW,SAAU,GAAG;AAAE,eAAOE,gBAAS,EAAE,CAAC,CAAC;AAAA,MAAI,CAAA,CAAC,CAAC;AAAA,IACjJ;AAAA;AACL;AAEO,SAAS,yBAAyB,GAAG,GAAG;AAC3C,MAAI,MAAMC,QAAqB,sBAAC,GAAG,CAAC,EAAE;AACtC,MAAI,WAAWC,YAAAA,QAAQ,GAAG,CAAC;AAC3B,MAAI,YAAYC,YAAQ,SAAC,GAAG,GAAG,CAAC;AAChC,MAAI,UAAU,OAAO,GAAG,CAAC;AACzB,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,MAAI,gBAAgB,aAAa,GAAG,CAAC;AACrC,SAAO;AAAA,IACH;AAAA,IACA,SAAS;AAAA,IACT,UAAU;AAAA,IACV,QAAQ,SAAU,KAAK,GAAG;AAAE,aAAOL,eAAK,KAAK,QAAQ,CAAC,CAAC;AAAA,IAAI;AAAA,IAC3D,WAAW,SAAU,KAAK,GAAG;AAAE,aAAOA,eAAK,KAAK,WAAW,CAAC,CAAC;AAAA,IAAI;AAAA,IACjE,WAAW,SAAU,KAAK,GAAG;AAAE,aAAOA,eAAK,KAAK,WAAW,CAAC,CAAC;AAAA,IAAI;AAAA,IACjE,cAAc,SAAU,KAAK,GAAG;AAAE,aAAOA,eAAK,KAAK,cAAc,CAAC,CAAC;AAAA,IAAI;AAAA,EAC/E;AACA;;;;;;","x_google_ignoreList":[0]}

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

@@ -1,80 +0,0 @@
-import { compact, separate } from "./Compactable.js";
-import { pipe } from "./function.js";
-import { getFunctorComposition } from "./Functor.js";
-import { getRight, getLeft } from "./Option.js";
-import { not } from "./Predicate.js";
-import { separated } from "./Separated.js";
-function filter(F, G) {
-  return function(predicate) {
-    return function(fga) {
-      return F.map(fga, function(ga) {
-        return G.filter(ga, predicate);
-      });
-    };
-  };
-}
-function filterMap(F, G) {
-  return function(f) {
-    return function(fga) {
-      return F.map(fga, function(ga) {
-        return G.filterMap(ga, f);
-      });
-    };
-  };
-}
-function partition(F, G) {
-  var _filter = filter(F, G);
-  return function(predicate) {
-    var left = _filter(not(predicate));
-    var right = _filter(predicate);
-    return function(fgb) {
-      return separated(left(fgb), right(fgb));
-    };
-  };
-}
-function partitionMap(F, G) {
-  var _filterMap = filterMap(F, G);
-  return function(f) {
-    return function(fga) {
-      return separated(pipe(fga, _filterMap(function(a) {
-        return getLeft(f(a));
-      })), pipe(fga, _filterMap(function(a) {
-        return getRight(f(a));
-      })));
-    };
-  };
-}
-function getFilterableComposition(F, G) {
-  var map = getFunctorComposition(F, G).map;
-  var _compact = compact(F, G);
-  var _separate = separate(F, G, G);
-  var _filter = filter(F, G);
-  var _filterMap = filterMap(F, G);
-  var _partition = partition(F, G);
-  var _partitionMap = partitionMap(F, G);
-  return {
-    map,
-    compact: _compact,
-    separate: _separate,
-    filter: function(fga, f) {
-      return pipe(fga, _filter(f));
-    },
-    filterMap: function(fga, f) {
-      return pipe(fga, _filterMap(f));
-    },
-    partition: function(fga, p) {
-      return pipe(fga, _partition(p));
-    },
-    partitionMap: function(fga, f) {
-      return pipe(fga, _partitionMap(f));
-    }
-  };
-}
-export {
-  filter,
-  filterMap,
-  getFilterableComposition,
-  partition,
-  partitionMap
-};
-//# sourceMappingURL=Filterable.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Filterable.js","sources":["../../../../../../node_modules/fp-ts/es6/Filterable.js"],"sourcesContent":["/**\n * `Filterable` represents data structures which can be _partitioned_/_filtered_.\n *\n * Adapted from https://github.com/LiamGoodacre/purescript-filterable/blob/master/src/Data/Filterable.purs\n *\n * @since 2.0.0\n */\nimport { compact, separate } from './Compactable';\nimport { pipe } from './function';\nimport { getFunctorComposition } from './Functor';\nimport { getLeft, getRight } from './Option';\nimport { not } from './Predicate';\nimport { separated } from './Separated';\nexport function filter(F, G) {\n    return function (predicate) { return function (fga) { return F.map(fga, function (ga) { return G.filter(ga, predicate); }); }; };\n}\nexport function filterMap(F, G) {\n    return function (f) { return function (fga) { return F.map(fga, function (ga) { return G.filterMap(ga, f); }); }; };\n}\nexport function partition(F, G) {\n    var _filter = filter(F, G);\n    return function (predicate) {\n        var left = _filter(not(predicate));\n        var right = _filter(predicate);\n        return function (fgb) { return separated(left(fgb), right(fgb)); };\n    };\n}\nexport function partitionMap(F, G) {\n    var _filterMap = filterMap(F, G);\n    return function (f) { return function (fga) {\n        return separated(pipe(fga, _filterMap(function (a) { return getLeft(f(a)); })), pipe(fga, _filterMap(function (a) { return getRight(f(a)); })));\n    }; };\n}\n/** @deprecated */\nexport function getFilterableComposition(F, G) {\n    var map = getFunctorComposition(F, G).map;\n    var _compact = compact(F, G);\n    var _separate = separate(F, G, G);\n    var _filter = filter(F, G);\n    var _filterMap = filterMap(F, G);\n    var _partition = partition(F, G);\n    var _partitionMap = partitionMap(F, G);\n    return {\n        map: map,\n        compact: _compact,\n        separate: _separate,\n        filter: function (fga, f) { return pipe(fga, _filter(f)); },\n        filterMap: function (fga, f) { return pipe(fga, _filterMap(f)); },\n        partition: function (fga, p) { return pipe(fga, _partition(p)); },\n        partitionMap: function (fga, f) { return pipe(fga, _partitionMap(f)); }\n    };\n}\n"],"names":[],"mappings":";;;;;;AAaO,SAAS,OAAO,GAAG,GAAG;AACzB,SAAO,SAAU,WAAW;AAAE,WAAO,SAAU,KAAK;AAAE,aAAO,EAAE,IAAI,KAAK,SAAU,IAAI;AAAE,eAAO,EAAE,OAAO,IAAI,SAAS;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACjI;AACO,SAAS,UAAU,GAAG,GAAG;AAC5B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AAAE,aAAO,EAAE,IAAI,KAAK,SAAU,IAAI;AAAE,eAAO,EAAE,UAAU,IAAI,CAAC;AAAA,MAAI,CAAA;AAAA,IAAI;AAAA;AACpH;AACO,SAAS,UAAU,GAAG,GAAG;AAC5B,MAAI,UAAU,OAAO,GAAG,CAAC;AACzB,SAAO,SAAU,WAAW;AACxB,QAAI,OAAO,QAAQ,IAAI,SAAS,CAAC;AACjC,QAAI,QAAQ,QAAQ,SAAS;AAC7B,WAAO,SAAU,KAAK;AAAE,aAAO,UAAU,KAAK,GAAG,GAAG,MAAM,GAAG,CAAC;AAAA;EACtE;AACA;AACO,SAAS,aAAa,GAAG,GAAG;AAC/B,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,aAAO,UAAU,KAAK,KAAK,WAAW,SAAU,GAAG;AAAE,eAAO,QAAQ,EAAE,CAAC,CAAC;AAAA,MAAI,CAAA,CAAC,GAAG,KAAK,KAAK,WAAW,SAAU,GAAG;AAAE,eAAO,SAAS,EAAE,CAAC,CAAC;AAAA,MAAI,CAAA,CAAC,CAAC;AAAA,IACjJ;AAAA;AACL;AAEO,SAAS,yBAAyB,GAAG,GAAG;AAC3C,MAAI,MAAM,sBAAsB,GAAG,CAAC,EAAE;AACtC,MAAI,WAAW,QAAQ,GAAG,CAAC;AAC3B,MAAI,YAAY,SAAS,GAAG,GAAG,CAAC;AAChC,MAAI,UAAU,OAAO,GAAG,CAAC;AACzB,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,MAAI,aAAa,UAAU,GAAG,CAAC;AAC/B,MAAI,gBAAgB,aAAa,GAAG,CAAC;AACrC,SAAO;AAAA,IACH;AAAA,IACA,SAAS;AAAA,IACT,UAAU;AAAA,IACV,QAAQ,SAAU,KAAK,GAAG;AAAE,aAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;AAAA,IAAI;AAAA,IAC3D,WAAW,SAAU,KAAK,GAAG;AAAE,aAAO,KAAK,KAAK,WAAW,CAAC,CAAC;AAAA,IAAI;AAAA,IACjE,WAAW,SAAU,KAAK,GAAG;AAAE,aAAO,KAAK,KAAK,WAAW,CAAC,CAAC;AAAA,IAAI;AAAA,IACjE,cAAc,SAAU,KAAK,GAAG;AAAE,aAAO,KAAK,KAAK,cAAc,CAAC,CAAC;AAAA,IAAI;AAAA,EAC/E;AACA;","x_google_ignoreList":[0]}

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

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

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

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

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

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

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

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

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

@@ -1,113 +0,0 @@
-"use strict";
-Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const _function = require("./function.cjs");
-function reduce(F, G) {
-  return function(b, f) {
-    return function(fga) {
-      return F.reduce(fga, b, function(b2, ga) {
-        return G.reduce(ga, b2, f);
-      });
-    };
-  };
-}
-function foldMap(F, G) {
-  return function(M) {
-    var foldMapF = F.foldMap(M);
-    var foldMapG = G.foldMap(M);
-    return function(f) {
-      return function(fga) {
-        return foldMapF(fga, function(ga) {
-          return foldMapG(ga, f);
-        });
-      };
-    };
-  };
-}
-function reduceRight(F, G) {
-  return function(b, f) {
-    return function(fga) {
-      return F.reduceRight(fga, b, function(ga, b2) {
-        return G.reduceRight(ga, b2, f);
-      });
-    };
-  };
-}
-function reduceM(M, F) {
-  return function(b, f) {
-    return function(fa) {
-      return F.reduce(fa, M.of(b), function(mb, a) {
-        return M.chain(mb, function(b2) {
-          return f(b2, a);
-        });
-      });
-    };
-  };
-}
-function intercalate(M, F) {
-  return function(middle, fm) {
-    var go = function(_a, x) {
-      var init = _a.init, acc = _a.acc;
-      return init ? { init: false, acc: x } : { init: false, acc: M.concat(M.concat(acc, middle), x) };
-    };
-    return F.reduce(fm, { init: true, acc: M.empty }, go).acc;
-  };
-}
-function toReadonlyArray(F) {
-  return function(fa) {
-    return F.reduce(fa, [], function(acc, a) {
-      acc.push(a);
-      return acc;
-    });
-  };
-}
-function traverse_(M, F) {
-  var applyFirst = function(mu2, mb) {
-    return M.ap(M.map(mu2, _function.constant), mb);
-  };
-  var mu = M.of(void 0);
-  return function(fa, f) {
-    return F.reduce(fa, mu, function(mu2, a) {
-      return applyFirst(mu2, f(a));
-    });
-  };
-}
-function foldM(M, F) {
-  return function(fa, b, f) {
-    return F.reduce(fa, M.of(b), function(mb, a) {
-      return M.chain(mb, function(b2) {
-        return f(b2, a);
-      });
-    });
-  };
-}
-var toArray = toReadonlyArray;
-function getFoldableComposition(F, G) {
-  var _reduce = reduce(F, G);
-  var _foldMap = foldMap(F, G);
-  var _reduceRight = reduceRight(F, G);
-  return {
-    reduce: function(fga, b, f) {
-      return _function.pipe(fga, _reduce(b, f));
-    },
-    foldMap: function(M) {
-      var foldMapM = _foldMap(M);
-      return function(fga, f) {
-        return _function.pipe(fga, foldMapM(f));
-      };
-    },
-    reduceRight: function(fga, b, f) {
-      return _function.pipe(fga, _reduceRight(b, f));
-    }
-  };
-}
-exports.foldM = foldM;
-exports.foldMap = foldMap;
-exports.getFoldableComposition = getFoldableComposition;
-exports.intercalate = intercalate;
-exports.reduce = reduce;
-exports.reduceM = reduceM;
-exports.reduceRight = reduceRight;
-exports.toArray = toArray;
-exports.toReadonlyArray = toReadonlyArray;
-exports.traverse_ = traverse_;
-//# sourceMappingURL=Foldable.cjs.map