@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/ReadonlyRecord.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReadonlyRecord.js","sources":["../../../../../../node_modules/fp-ts/es6/ReadonlyRecord.js"],"sourcesContent":["import { fromEquals } from './Eq';\nimport { flow, identity, pipe, SK } from './function';\nimport { flap as flap_ } from './Functor';\nimport * as _ from './internal';\nimport { separated } from './Separated';\nimport * as S from './string';\nimport { wiltDefault, witherDefault } from './Witherable';\n/**\n * Builds a `ReadonlyRecord` by copying a `Record`.\n *\n * @example\n * import { ReadonlyRecord, fromRecord } from \"fp-ts/ReadonlyRecord\"\n *\n * const x: Record<string, number> = { a: 1, b: 2 };\n * const y: ReadonlyRecord<string, number> = fromRecord(x);\n * assert.deepStrictEqual(x,y);\n * // `y.a = 5` gives compiler error\n *\n * @category conversions\n * @since 2.5.0\n */\nexport var fromRecord = function (r) { return Object.assign({}, r); };\n/**\n * Builds a mutable `Record` from a `ReadonlyRecord`.\n *\n * @example\n * import { ReadonlyRecord, toRecord } from \"fp-ts/ReadonlyRecord\"\n *\n * const x: ReadonlyRecord<string, number> = { a: 1, b: 2 };\n * const y: Record<string, number> = toRecord(x);\n * assert.deepStrictEqual(x,y);\n * y.a = 5; // it's ok, y is mutable\n *\n * @category conversions\n * @since 2.5.0\n */\nexport var toRecord = function (r) { return Object.assign({}, r); };\n/**\n * Calculate the number of key/value pairs in a `ReadonlyRecord`,\n *\n * @example\n * import { size } from \"fp-ts/ReadonlyRecord\";\n *\n * assert.deepStrictEqual(size({ a: true, b: 2, c: \"three\" }), 3);\n *\n * @since 2.5.0\n */\nexport var size = function (r) { return Object.keys(r).length; };\n/**\n * Test whether a `ReadonlyRecord` is empty.\n *\n * @example\n * import { isEmpty } from \"fp-ts/ReadonlyRecord\"\n *\n * assert.deepStrictEqual(isEmpty({}), true);\n * assert.deepStrictEqual(isEmpty({ a: 3 }), false);\n * @since 2.5.0\n */\nexport var isEmpty = function (r) {\n    for (var k in r) {\n        if (_.has.call(r, k)) {\n            return false;\n        }\n    }\n    return true;\n};\nvar keys_ = function (O) {\n    return function (r) {\n        return Object.keys(r).sort(O.compare);\n    };\n};\n/**\n * @since 2.5.0\n */\nexport var keys = /*#__PURE__*/ keys_(S.Ord);\nexport function collect(O) {\n    if (typeof O === 'function') {\n        return collect(S.Ord)(O);\n    }\n    var keysO = keys_(O);\n    return function (f) {\n        return function (r) {\n            var out = [];\n            for (var _i = 0, _a = keysO(r); _i < _a.length; _i++) {\n                var key = _a[_i];\n                out.push(f(key, r[key]));\n            }\n            return out;\n        };\n    };\n}\n/**\n * Get a sorted `ReadonlyArray` of the key/value pairs contained in a `ReadonlyRecord`.\n *\n * @example\n * import { toReadonlyArray } from 'fp-ts/ReadonlyRecord'\n *\n * const x = { c: 3, a: \"foo\", b: false };\n * assert.deepStrictEqual(toReadonlyArray(x), [\n *   [\"a\", \"foo\"],\n *   [\"b\", false],\n *   [\"c\", 3],\n * ]);\n *\n * @category conversions\n * @since 2.5.0\n */\nexport var toReadonlyArray = \n/*#__PURE__*/ collect(S.Ord)(function (k, a) { return [k, a]; });\nexport function toUnfoldable(U) {\n    return function (r) {\n        var sas = toReadonlyArray(r);\n        var len = sas.length;\n        return U.unfold(0, function (b) { return (b < len ? _.some([sas[b], b + 1]) : _.none); });\n    };\n}\n/**\n * Insert or replace a key/value pair in a `ReadonlyRecord`.\n *\n * @example\n * import { upsertAt } from 'fp-ts/ReadonlyRecord'\n *\n * assert.deepStrictEqual(upsertAt(\"a\", 5)({ a: 1, b: 2 }), { a: 5, b: 2 });\n * assert.deepStrictEqual(upsertAt(\"c\", 5)({ a: 1, b: 2 }), { a: 1, b: 2, c: 5 });\n *\n * @since 2.10.0\n */\nexport var upsertAt = function (k, a) {\n    return function (r) {\n        if (_.has.call(r, k) && r[k] === a) {\n            return r;\n        }\n        var out = Object.assign({}, r);\n        out[k] = a;\n        return out;\n    };\n};\n/**\n * Test whether or not a key exists in a `ReadonlyRecord`.\n *\n * Note. This function is not pipeable because is a `Refinement`.\n *\n * @example\n * import { has } from 'fp-ts/ReadonlyRecord'\n *\n * assert.deepStrictEqual(has(\"a\", { a: 1, b: 2 }), true);\n * assert.deepStrictEqual(has(\"c\", { a: 1, b: 2 }), false);\n *\n * @since 2.10.0\n */\nexport var has = function (k, r) { return _.has.call(r, k); };\nexport function deleteAt(k) {\n    return function (r) {\n        if (!_.has.call(r, k)) {\n            return r;\n        }\n        var out = Object.assign({}, r);\n        delete out[k];\n        return out;\n    };\n}\n/**\n * Replace a key/value pair in a `ReadonlyRecord`.\n *\n * @returns If the specified key exists it returns an `Option` containing a new `Record`\n * with the entry updated, otherwise it returns `None`\n *\n * @example\n * import { updateAt } from 'fp-ts/ReadonlyRecord'\n * import { option } from 'fp-ts'\n *\n * assert.deepStrictEqual(updateAt(\"a\", 3)({ a: 1, b: 2 }), option.some({ a: 3, b: 2 }));\n * assert.deepStrictEqual(updateAt(\"c\", 3)({ a: 1, b: 2 }), option.none);\n *\n * @since 2.5.0\n */\nexport var updateAt = function (k, a) {\n    return function (r) {\n        if (!has(k, r)) {\n            return _.none;\n        }\n        if (r[k] === a) {\n            return _.some(r);\n        }\n        var out = Object.assign({}, r);\n        out[k] = a;\n        return _.some(out);\n    };\n};\n/**\n * Applies a mapping function to one specific key/value pair in a `ReadonlyRecord`.\n *\n * @returns If the specified key exists it returns an `Option` containing a new `Record`\n * with the entry updated, otherwise it returns `None`\n *\n * @example\n * import { modifyAt } from 'fp-ts/ReadonlyRecord'\n * import { option } from 'fp-ts'\n *\n * assert.deepStrictEqual(modifyAt(\"a\", (x: number) => x * 3)({ a: 1, b: 2 }), option.some({ a: 3, b: 2 }));\n * assert.deepStrictEqual(modifyAt(\"c\", (x: number) => x * 3)({ a: 1, b: 2 }), option.none);\n *\n * @since 2.5.0\n */\nexport var modifyAt = function (k, f) {\n    return function (r) {\n        if (!has(k, r)) {\n            return _.none;\n        }\n        var next = f(r[k]);\n        if (next === r[k]) {\n            return _.some(r);\n        }\n        var out = Object.assign({}, r);\n        out[k] = next;\n        return _.some(out);\n    };\n};\nexport function pop(k) {\n    var deleteAtk = deleteAt(k);\n    return function (r) {\n        var oa = lookup(k, r);\n        return _.isNone(oa) ? _.none : _.some([oa.value, deleteAtk(r)]);\n    };\n}\nexport function isSubrecord(E) {\n    return function (me, that) {\n        if (that === undefined) {\n            var isSubrecordE_1 = isSubrecord(E);\n            return function (that) { return isSubrecordE_1(that, me); };\n        }\n        for (var k in me) {\n            if (!_.has.call(that, k) || !E.equals(me[k], that[k])) {\n                return false;\n            }\n        }\n        return true;\n    };\n}\nexport function lookup(k, r) {\n    if (r === undefined) {\n        return function (r) { return lookup(k, r); };\n    }\n    return _.has.call(r, k) ? _.some(r[k]) : _.none;\n}\n/**\n * @since 2.5.0\n */\nexport var empty = {};\nexport function mapWithIndex(f) {\n    return function (r) {\n        var out = {};\n        for (var k in r) {\n            if (_.has.call(r, k)) {\n                out[k] = f(k, r[k]);\n            }\n        }\n        return out;\n    };\n}\nexport function map(f) {\n    return mapWithIndex(function (_, a) { return f(a); });\n}\nexport function reduceWithIndex() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    if (args.length === 2) {\n        return reduceWithIndex(S.Ord).apply(void 0, args);\n    }\n    var keysO = keys_(args[0]);\n    return function (b, f) { return function (fa) {\n        var out = b;\n        var ks = keysO(fa);\n        var len = ks.length;\n        for (var i = 0; i < len; i++) {\n            var k = ks[i];\n            out = f(k, out, fa[k]);\n        }\n        return out;\n    }; };\n}\nexport function foldMapWithIndex(O) {\n    if ('compare' in O) {\n        var keysO_1 = keys_(O);\n        return function (M) {\n            return function (f) {\n                return function (fa) {\n                    var out = M.empty;\n                    var ks = keysO_1(fa);\n                    var len = ks.length;\n                    for (var i = 0; i < len; i++) {\n                        var k = ks[i];\n                        out = M.concat(out, f(k, fa[k]));\n                    }\n                    return out;\n                };\n            };\n        };\n    }\n    return foldMapWithIndex(S.Ord)(O);\n}\nexport function reduceRightWithIndex() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    if (args.length === 2) {\n        return reduceRightWithIndex(S.Ord).apply(void 0, args);\n    }\n    var keysO = keys_(args[0]);\n    return function (b, f) { return function (fa) {\n        var out = b;\n        var ks = keysO(fa);\n        var len = ks.length;\n        for (var i = len - 1; i >= 0; i--) {\n            var k = ks[i];\n            out = f(k, fa[k], out);\n        }\n        return out;\n    }; };\n}\n/**\n * Create a `ReadonlyRecord` with one key/value pair.\n *\n * @example\n * import { singleton } from \"fp-ts/ReadonlyRecord\";\n *\n * assert.deepStrictEqual(singleton(\"a\", 1), { a: 1 });\n *\n * @category constructors\n * @since 2.5.0\n */\nexport var singleton = function (k, a) {\n    var _a;\n    return (_a = {}, _a[k] = a, _a);\n};\nexport function traverseWithIndex(F) {\n    var traverseWithIndexOF = _traverseWithIndex(S.Ord)(F);\n    return function (f) { return function (ta) { return traverseWithIndexOF(ta, f); }; };\n}\nexport function traverse(F) {\n    var traverseOF = _traverse(S.Ord)(F);\n    return function (f) { return function (ta) { return traverseOF(ta, f); }; };\n}\nexport function sequence(F) {\n    return _sequence(S.Ord)(F);\n}\n/**\n * @category filtering\n * @since 2.6.5\n */\nexport var wither = function (F) {\n    var traverseF = traverse(F);\n    return function (f) { return function (fa) { return F.map(pipe(fa, traverseF(f)), compact); }; };\n};\n/**\n * @category filtering\n * @since 2.6.5\n */\nexport var wilt = function (F) {\n    var traverseF = traverse(F);\n    return function (f) { return function (fa) { return F.map(pipe(fa, traverseF(f)), separate); }; };\n};\nexport function partitionMapWithIndex(f) {\n    return function (r) {\n        var left = {};\n        var right = {};\n        for (var k in r) {\n            if (_.has.call(r, k)) {\n                var e = f(k, r[k]);\n                switch (e._tag) {\n                    case 'Left':\n                        left[k] = e.left;\n                        break;\n                    case 'Right':\n                        right[k] = e.right;\n                        break;\n                }\n            }\n        }\n        return separated(left, right);\n    };\n}\nexport function partitionWithIndex(predicateWithIndex) {\n    return function (r) {\n        var left = {};\n        var right = {};\n        for (var k in r) {\n            if (_.has.call(r, k)) {\n                var a = r[k];\n                if (predicateWithIndex(k, a)) {\n                    right[k] = a;\n                }\n                else {\n                    left[k] = a;\n                }\n            }\n        }\n        return separated(left, right);\n    };\n}\nexport function filterMapWithIndex(f) {\n    return function (r) {\n        var out = {};\n        for (var k in r) {\n            if (_.has.call(r, k)) {\n                var ob = f(k, r[k]);\n                if (_.isSome(ob)) {\n                    out[k] = ob.value;\n                }\n            }\n        }\n        return out;\n    };\n}\nexport function filterWithIndex(predicateWithIndex) {\n    return function (fa) {\n        var out = {};\n        var changed = false;\n        for (var key in fa) {\n            if (_.has.call(fa, key)) {\n                var a = fa[key];\n                if (predicateWithIndex(key, a)) {\n                    out[key] = a;\n                }\n                else {\n                    changed = true;\n                }\n            }\n        }\n        return changed ? out : fa;\n    };\n}\nexport function fromFoldable(M, F) {\n    var fromFoldableMapM = fromFoldableMap(M, F);\n    return function (fka) { return fromFoldableMapM(fka, identity); };\n}\nexport function fromFoldableMap(M, F) {\n    return function (ta, f) {\n        return F.reduce(ta, {}, function (r, a) {\n            var _a = f(a), k = _a[0], b = _a[1];\n            r[k] = _.has.call(r, k) ? M.concat(r[k], b) : b;\n            return r;\n        });\n    };\n}\n/**\n * Alias of [`toReadonlyArray`](#toreadonlyarray).\n *\n * @example\n * import { toEntries } from 'fp-ts/ReadonlyRecord'\n *\n * assert.deepStrictEqual(toEntries({ b: 2, a: 1 }), [['a', 1], ['b', 2]])\n *\n * @category conversions\n * @since 2.12.0\n */\nexport var toEntries = toReadonlyArray;\n/**\n * Converts a `ReadonlyArray` of `[key, value]` tuples into a `ReadonlyRecord`.\n *\n * @example\n * import { fromEntries } from 'fp-ts/ReadonlyRecord'\n *\n * assert.deepStrictEqual(fromEntries([['a', 1], ['b', 2], ['a', 3]]), { b: 2, a: 3 })\n *\n * @since 2.12.0\n * @category conversions\n */\nexport var fromEntries = function (fa) {\n    var out = {};\n    for (var _i = 0, fa_1 = fa; _i < fa_1.length; _i++) {\n        var a = fa_1[_i];\n        out[a[0]] = a[1];\n    }\n    return out;\n};\nexport function every(predicate) {\n    return function (r) {\n        for (var k in r) {\n            if (!predicate(r[k])) {\n                return false;\n            }\n        }\n        return true;\n    };\n}\n/**\n * Test if at least one value in a `ReadonlyRecord` satisfies the predicate.\n *\n * @example\n * import { some } from \"fp-ts/ReadonlyRecord\"\n *\n * assert.deepStrictEqual(some((n: number) => n >= 0)({ a: 1, b: -2 }), true);\n * assert.deepStrictEqual(some((n: number) => n >= 0)({ a: -1, b: -2 }), false);\n *\n * @since 2.5.0\n */\nexport function some(predicate) {\n    return function (r) {\n        for (var k in r) {\n            if (predicate(r[k])) {\n                return true;\n            }\n        }\n        return false;\n    };\n}\nexport function elem(E) {\n    return function (a, fa) {\n        if (fa === undefined) {\n            var elemE_1 = elem(E);\n            return function (fa) { return elemE_1(a, fa); };\n        }\n        for (var k in fa) {\n            if (E.equals(fa[k], a)) {\n                return true;\n            }\n        }\n        return false;\n    };\n}\n/**\n * Union of two `ReadonlyRecord`s.\n * Takes two `ReadonlyRecord`s and produces a `ReadonlyRecord` combining all the\n * entries of the two inputs.\n * It uses the `concat` function of the provided `Magma` to\n * combine the elements with the same key.\n *\n * @example\n * import { union } from \"fp-ts/ReadonlyRecord\";\n * import { Magma } from \"fp-ts/Magma\";\n *\n * const m1: Magma<number> = { concat: (x: number, y: number) => x + y };\n * assert.deepStrictEqual(union(m1)({ a: 3, c: 3 })({ a: 1, b: 2 }), { a: 4, b: 2, c: 3 });\n * const m2: Magma<number> = { concat: (x: number) => x };\n * assert.deepStrictEqual(union(m2)({ a: 3, c: 3 })({ a: 1, b: 2 }), { a: 1, b: 2, c: 3 });\n *\n * @since 2.11.0\n */\nexport var union = function (M) {\n    return function (second) {\n        return function (first) {\n            if (isEmpty(first)) {\n                return second;\n            }\n            if (isEmpty(second)) {\n                return first;\n            }\n            var out = {};\n            for (var k in first) {\n                if (has(k, second)) {\n                    out[k] = M.concat(first[k], second[k]);\n                }\n                else {\n                    out[k] = first[k];\n                }\n            }\n            for (var k in second) {\n                if (!has(k, out)) {\n                    out[k] = second[k];\n                }\n            }\n            return out;\n        };\n    };\n};\n/**\n * Intersection of two `ReadonlyRecord`s.\n * Takes two `ReadonlyRecord`s and produces a `ReadonlyRecord` combining only the\n * entries of the two inputswith the same key.\n * It uses the `concat` function of the provided `Magma` to\n * combine the elements.\n *\n * @example\n * import { intersection } from \"fp-ts/ReadonlyRecord\";\n * import { Magma } from \"fp-ts/Magma\";\n *\n * const m1: Magma<number> = { concat: (x: number, y: number) => x + y };\n * assert.deepStrictEqual(intersection(m1)({ a: 3, c: 3 })({ a: 1, b: 2 }), { a: 4});\n * const m2: Magma<number> = { concat: (x: number) => x };\n * assert.deepStrictEqual(intersection(m2)({ a: 3, c: 3 })({ a: 1, b: 2 }), { a: 1});\n *\n * @since 2.11.0\n */\nexport var intersection = function (M) {\n    return function (second) {\n        return function (first) {\n            if (isEmpty(first) || isEmpty(second)) {\n                return empty;\n            }\n            var out = {};\n            for (var k in first) {\n                if (has(k, second)) {\n                    out[k] = M.concat(first[k], second[k]);\n                }\n            }\n            return out;\n        };\n    };\n};\n/**\n * Difference between two `ReadonlyRecord`s.\n * Takes two `ReadonlyRecord`s and produces a `ReadonlyRecord` composed by the\n * entries of the two inputs, removing the entries with the same\n * key in both inputs.\n *\n * @example\n * import { difference } from \"fp-ts/ReadonlyRecord\";\n *\n * assert.deepStrictEqual(difference({ a: 1 })({ a: 1, b: 2 }), { b: 2 });\n * assert.deepStrictEqual(difference({ a: 3 })({ a: 1, b: 2 }), { b: 2 });\n * assert.deepStrictEqual(difference({ a: 3, c: 3 })({ a: 1, b: 2 }), { b: 2, c: 3 });\n *\n * @since 2.11.0\n */\nexport var difference = function (second) {\n    return function (first) {\n        if (isEmpty(first)) {\n            return second;\n        }\n        if (isEmpty(second)) {\n            return first;\n        }\n        var out = {};\n        for (var k in first) {\n            if (!has(k, second)) {\n                out[k] = first[k];\n            }\n        }\n        for (var k in second) {\n            if (!has(k, first)) {\n                out[k] = second[k];\n            }\n        }\n        return out;\n    };\n};\n/** @internal */\nexport var _map = function (fa, f) { return pipe(fa, map(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _mapWithIndex = function (fa, f) { return pipe(fa, mapWithIndex(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _reduce = function (O) {\n    var reduceO = reduce(O);\n    return function (fa, b, f) { return pipe(fa, reduceO(b, f)); };\n};\n/** @internal */\nexport var _foldMap = function (O) { return function (M) {\n    var foldMapM = foldMap(O)(M);\n    return function (fa, f) { return pipe(fa, foldMapM(f)); };\n}; };\n/** @internal */\n/* istanbul ignore next */\nexport var _reduceRight = function (O) {\n    var reduceRightO = reduceRight(O);\n    return function (fa, b, f) { return pipe(fa, reduceRightO(b, f)); };\n};\n/** @internal */\n/* istanbul ignore next */\nexport var _filter = function (fa, predicate) {\n    return pipe(fa, filter(predicate));\n};\n/** @internal */\n/* istanbul ignore next */\nexport var _filterMap = function (fa, f) { return pipe(fa, filterMap(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _partition = function (fa, predicate) { return pipe(fa, partition(predicate)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _partitionMap = function (fa, f) { return pipe(fa, partitionMap(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _reduceWithIndex = function (O) {\n    var reduceWithIndexO = reduceWithIndex(O);\n    return function (fa, b, f) { return pipe(fa, reduceWithIndexO(b, f)); };\n};\n/** @internal */\nexport var _foldMapWithIndex = function (O) {\n    var foldMapWithIndexO = foldMapWithIndex(O);\n    return function (M) {\n        var foldMapWithIndexM = foldMapWithIndexO(M);\n        return function (fa, f) { return pipe(fa, foldMapWithIndexM(f)); };\n    };\n};\n/** @internal */\n/* istanbul ignore next */\nexport var _reduceRightWithIndex = function (O) {\n    var reduceRightWithIndexO = reduceRightWithIndex(O);\n    return function (fa, b, f) { return pipe(fa, reduceRightWithIndexO(b, f)); };\n};\n/** @internal */\n/* istanbul ignore next */\nexport var _partitionMapWithIndex = function (fa, f) { return pipe(fa, partitionMapWithIndex(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _partitionWithIndex = function (fa, predicateWithIndex) {\n    return pipe(fa, partitionWithIndex(predicateWithIndex));\n};\n/** @internal */\n/* istanbul ignore next */\nexport var _filterMapWithIndex = function (fa, f) { return pipe(fa, filterMapWithIndex(f)); };\n/** @internal */\n/* istanbul ignore next */\nexport var _filterWithIndex = function (fa, predicateWithIndex) { return pipe(fa, filterWithIndex(predicateWithIndex)); };\n/** @internal */\nexport var _traverse = function (O) {\n    var traverseWithIndexO = _traverseWithIndex(O);\n    return function (F) {\n        var traverseWithIndexOF = traverseWithIndexO(F);\n        return function (ta, f) { return traverseWithIndexOF(ta, flow(SK, f)); };\n    };\n};\n/** @internal */\nexport var _sequence = function (O) {\n    var traverseO = _traverse(O);\n    return function (F) {\n        var traverseOF = traverseO(F);\n        return function (ta) { return traverseOF(ta, identity); };\n    };\n};\nvar _traverseWithIndex = function (O) {\n    return function (F) {\n        var keysO = keys_(O);\n        return function (ta, f) {\n            var ks = keysO(ta);\n            if (ks.length === 0) {\n                return F.of(empty);\n            }\n            var fr = F.of({});\n            var _loop_1 = function (key) {\n                fr = F.ap(F.map(fr, function (r) { return function (b) {\n                    var _a;\n                    return Object.assign({}, r, (_a = {}, _a[key] = b, _a));\n                }; }), f(key, ta[key]));\n            };\n            for (var _i = 0, ks_1 = ks; _i < ks_1.length; _i++) {\n                var key = ks_1[_i];\n                _loop_1(key);\n            }\n            return fr;\n        };\n    };\n};\n/**\n * Given a `Predicate`, it produces a new `ReadonlyRecord` keeping only the entries with a\n * value that satisfies the provided predicate.\n *\n * @example\n * import { filter } from \"fp-ts/ReadonlyRecord\"\n *\n * assert.deepStrictEqual(filter((s: string) => s.length < 4)({ a: \"foo\", b: \"bar\", c: \"verylong\" }), {\n *   a: \"foo\",\n *   b: \"bar\",\n * });\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var filter = function (predicate) {\n    return filterWithIndex(function (_, a) { return predicate(a); });\n};\n/**\n * Maps a `ReadonlyRecord` with an iterating function that returns an `Option`\n * and it keeps only the `Some` values discarding the `None`s.\n *\n * @example\n * import { filterMap } from \"fp-ts/ReadonlyRecord\"\n * import { option } from \"fp-ts\"\n *\n * const f = (s: string) => s.length < 4 ? option.some(`${s} is short`): option.none\n * assert.deepStrictEqual(filterMap(f)({ a: \"foo\", b: \"bar\", c: \"verylong\" }), {\n *   a: \"foo is short\",\n *   b: \"bar is short\",\n * });\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var filterMap = function (f) { return filterMapWithIndex(function (_, a) { return f(a); }); };\n/**\n * Partition a `ReadonlyRecord` into two parts according to a `Predicate`.\n *\n * @example\n * import { partition } from \"fp-ts/ReadonlyRecord\"\n *\n * assert.deepStrictEqual(partition((s: string) => s.length < 4)({ a: \"foo\", b: \"bar\", c: \"verylong\" }), {\n *   left:{\n *     c: \"verylong\"\n *   },\n *   right: {\n *     a: \"foo\",\n *     b: \"bar\",\n *   },\n * });\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var partition = function (predicate) {\n    return partitionWithIndex(function (_, a) { return predicate(a); });\n};\n/**\n * Maps a `ReadonlyRecord` with a function returning an `Either` and\n * partitions the resulting `ReadonlyRecord` into `Left`s and `Right`s.\n *\n * @example\n * import { partitionMap } from \"fp-ts/ReadonlyRecord\"\n * import { either } from \"fp-ts\"\n *\n * const f = (s: string) => (s.length < 4 ? either.right(`${s} is short`) : either.left(`${s} is not short`));\n * assert.deepStrictEqual(partitionMap(f)({ a: \"foo\", b: \"bar\", c: \"verylong\" }), {\n *   left: {\n *     c: \"verylong is not short\",\n *   },\n *   right: {\n *     a: \"foo is short\",\n *     b: \"bar is short\",\n *   },\n * });\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var partitionMap = function (f) {\n    return partitionMapWithIndex(function (_, a) { return f(a); });\n};\nexport function reduce() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    if (args.length === 1) {\n        var reduceWithIndexO_1 = reduceWithIndex(args[0]);\n        return function (b, f) { return reduceWithIndexO_1(b, function (_, b, a) { return f(b, a); }); };\n    }\n    return reduce(S.Ord).apply(void 0, args);\n}\nexport function foldMap(O) {\n    if ('compare' in O) {\n        var foldMapWithIndexO_1 = foldMapWithIndex(O);\n        return function (M) {\n            var foldMapWithIndexM = foldMapWithIndexO_1(M);\n            return function (f) { return foldMapWithIndexM(function (_, a) { return f(a); }); };\n        };\n    }\n    return foldMap(S.Ord)(O);\n}\nexport function reduceRight() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    if (args.length === 1) {\n        var reduceRightWithIndexO_1 = reduceRightWithIndex(args[0]);\n        return function (b, f) { return reduceRightWithIndexO_1(b, function (_, b, a) { return f(b, a); }); };\n    }\n    return reduceRight(S.Ord).apply(void 0, args);\n}\n/**\n * Compact a `ReadonlyRecord` of `Option`s discarding the `None` values and\n * keeping the `Some` values.\n *\n * @example\n * import { compact } from 'fp-ts/ReadonlyRecord'\n * import { option } from 'fp-ts'\n *\n * assert.deepStrictEqual(compact({ a: option.some(\"foo\"), b: option.none, c: option.some(\"bar\") }), {\n *   a: \"foo\",\n *   c: \"bar\",\n * });\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var compact = function (r) {\n    var out = {};\n    for (var k in r) {\n        if (_.has.call(r, k)) {\n            var oa = r[k];\n            if (_.isSome(oa)) {\n                out[k] = oa.value;\n            }\n        }\n    }\n    return out;\n};\n/**\n * Separate a `ReadonlyRecord` of `Either`s into `Left`s and `Right`s.\n *\n * @example\n * import { separate } from 'fp-ts/ReadonlyRecord'\n * import { either } from 'fp-ts'\n *\n * assert.deepStrictEqual(\n *   separate({ a: either.right(\"foo\"), b: either.left(\"bar\"), c: either.right(\"baz\") }),\n *   {\n *     right: {\n *       a: \"foo\",\n *       c: \"baz\",\n *     },\n *     left: {\n *       b: \"bar\",\n *     },\n *   }\n * );\n *\n * @category filtering\n * @since 2.5.0\n */\nexport var separate = function (r) {\n    var left = {};\n    var right = {};\n    for (var k in r) {\n        if (_.has.call(r, k)) {\n            var e = r[k];\n            if (_.isLeft(e)) {\n                left[k] = e.left;\n            }\n            else {\n                right[k] = e.right;\n            }\n        }\n    }\n    return separated(left, right);\n};\n/**\n * @category type lambdas\n * @since 2.5.0\n */\nexport var URI = 'ReadonlyRecord';\nexport function getShow(O) {\n    if ('compare' in O) {\n        return function (S) { return ({\n            show: function (r) {\n                var elements = collect(O)(function (k, a) { return \"\".concat(JSON.stringify(k), \": \").concat(S.show(a)); })(r).join(', ');\n                return elements === '' ? '{}' : \"{ \".concat(elements, \" }\");\n            }\n        }); };\n    }\n    return getShow(S.Ord)(O);\n}\nexport function getEq(E) {\n    var isSubrecordE = isSubrecord(E);\n    return fromEquals(function (x, y) { return isSubrecordE(x)(y) && isSubrecordE(y)(x); });\n}\nexport function getMonoid(S) {\n    return {\n        concat: function (first, second) {\n            if (isEmpty(first)) {\n                return second;\n            }\n            if (isEmpty(second)) {\n                return first;\n            }\n            var r = Object.assign({}, first);\n            for (var k in second) {\n                if (_.has.call(second, k)) {\n                    r[k] = _.has.call(first, k) ? S.concat(first[k], second[k]) : second[k];\n                }\n            }\n            return r;\n        },\n        empty: empty\n    };\n}\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Functor = {\n    URI: URI,\n    map: _map\n};\n/**\n * Takes a value and a `ReadonlyRecord` of functions and returns a\n * `ReadonlyRecord` by applying each function to the input value.\n *\n * @example\n * import { flap } from \"fp-ts/ReadonlyRecord\"\n *\n * const fab = { x: (n: number) => `${n} times 2`, y: (n: number) => `${n * 2}` };\n * assert.deepStrictEqual(flap(3)(fab), {\n *   x: \"3 times 2\",\n *   y: \"6\",\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 FunctorWithIndex = {\n    URI: URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex\n};\n/**\n * Produces a `Foldable` instance for a `ReadonlyRecord`, using the\n * provided `Ord` to sort the `ReadonlyRecord`'s entries by key.\n *\n * @category folding\n * @since 2.11.0\n */\nexport var getFoldable = function (O) { return ({\n    URI: URI,\n    reduce: _reduce(O),\n    foldMap: _foldMap(O),\n    reduceRight: _reduceRight(O)\n}); };\n/**\n * Produces a `FoldableWithIndex1` instance for a `ReadonlyRecord`, using the\n * provided `Ord` to sort the `ReadonlyRecord`'s entries by key.\n *\n * @category folding\n * @since 2.11.0\n */\nexport var getFoldableWithIndex = function (O) { return ({\n    URI: URI,\n    reduce: _reduce(O),\n    foldMap: _foldMap(O),\n    reduceRight: _reduceRight(O),\n    reduceWithIndex: _reduceWithIndex(O),\n    foldMapWithIndex: _foldMapWithIndex(O),\n    reduceRightWithIndex: _reduceRightWithIndex(O)\n}); };\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Compactable = {\n    URI: URI,\n    compact: compact,\n    separate: separate\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var Filterable = {\n    URI: URI,\n    map: _map,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap\n};\n/**\n * @category instances\n * @since 2.7.0\n */\nexport var FilterableWithIndex = {\n    URI: URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    filterMapWithIndex: _filterMapWithIndex,\n    filterWithIndex: _filterWithIndex,\n    partitionMapWithIndex: _partitionMapWithIndex,\n    partitionWithIndex: _partitionWithIndex\n};\n/**\n * Produces a `Traversable` instance for a `ReadonlyRecord`, using the\n * provided `Ord` to sort the `ReadonlyRecord`'s entries by key.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var getTraversable = function (O) { return ({\n    URI: URI,\n    map: _map,\n    reduce: _reduce(O),\n    foldMap: _foldMap(O),\n    reduceRight: _reduceRight(O),\n    traverse: _traverse(O),\n    sequence: _sequence(O)\n}); };\n/**\n * Produces a `TraversableWithIndex` instance for a `ReadonlyRecord`, using the\n * provided `Ord` to sort the `ReadonlyRecord`'s entries by key.\n *\n * @category traversing\n * @since 2.11.0\n */\nexport var getTraversableWithIndex = function (O) { return ({\n    URI: URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex,\n    reduce: _reduce(O),\n    foldMap: _foldMap(O),\n    reduceRight: _reduceRight(O),\n    reduceWithIndex: _reduceWithIndex(O),\n    foldMapWithIndex: _foldMapWithIndex(O),\n    reduceRightWithIndex: _reduceRightWithIndex(O),\n    traverse: _traverse(O),\n    sequence: _sequence(O),\n    traverseWithIndex: _traverseWithIndex(O)\n}); };\n/**\n * @category filtering\n * @since 2.11.0\n */\nexport var getWitherable = function (O) {\n    var T = getTraversable(O);\n    return {\n        URI: URI,\n        map: _map,\n        reduce: _reduce(O),\n        foldMap: _foldMap(O),\n        reduceRight: _reduceRight(O),\n        traverse: T.traverse,\n        sequence: T.sequence,\n        compact: compact,\n        separate: separate,\n        filter: _filter,\n        filterMap: _filterMap,\n        partition: _partition,\n        partitionMap: _partitionMap,\n        wither: witherDefault(T, Compactable),\n        wilt: wiltDefault(T, Compactable)\n    };\n};\n/**\n * Given a `Semigroup` in the base type, it produces a `Semigroup`\n * in the `ReadonlyRecord` of the base type.\n * The resulting `Semigroup` concatenates two `ReadonlyRecord`s by\n * `union`.\n *\n * @example\n * import { getUnionSemigroup, ReadonlyRecord } from \"fp-ts/ReadonlyRecord\"\n * import { Semigroup } from \"fp-ts/Semigroup\"\n *\n * const sNumber: Semigroup<number> = { concat: (x, y) => x - y };\n * const sReadonlyRecord: Semigroup<ReadonlyRecord<string, number>> = getUnionSemigroup(sNumber);\n * assert.deepStrictEqual(sReadonlyRecord.concat({ a: 1, b: 2 }, { b: 3, c: 4 }), { a: 1, b: -1, c: 4 });\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionSemigroup = function (S) {\n    var unionS = union(S);\n    return {\n        concat: function (first, second) { return unionS(second)(first); }\n    };\n};\n/**\n * Same as `getMonoid`.\n * Returns a `Monoid` instance for `ReadonlyRecord`s given a `Semigroup`\n * instance for the base type.\n * The `Monoid` makes the union of two `ReadonlyRecord`s combining the\n * entries that have the same key with the provided `Semigroup`.\n *\n * @example\n * import { SemigroupSum } from 'fp-ts/number'\n * import { getUnionMonoid } from 'fp-ts/ReadonlyRecord'\n *\n * const M = getUnionMonoid(SemigroupSum);\n * assert.deepStrictEqual(M.concat({ foo: 123, bar: 234 }, { foo: 456, baz: 567 }), { foo: 579 , bar: 234, baz: 567 });\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionMonoid = function (S) { return ({\n    concat: getUnionSemigroup(S).concat,\n    empty: empty\n}); };\n/**\n * Given a `Semigroup` in the base type, it produces a `Semigroup`\n * in the `ReadonlyRecord` of the base type.\n * The resulting `Semigroup` concatenates two `ReadonlyRecord`s by\n * `intersection`.\n *\n * @example\n * import { getIntersectionSemigroup, ReadonlyRecord } from \"fp-ts/ReadonlyRecord\"\n * import { Semigroup } from \"fp-ts/Semigroup\"\n *\n * const sNumber: Semigroup<number> = { concat: (x, y) => x - y };\n * const sReadonlyRecord: Semigroup<ReadonlyRecord<string, number>> = getIntersectionSemigroup(sNumber);\n * assert.deepStrictEqual(sReadonlyRecord.concat({ a: 1, b: 2 }, { b: 3, c: 4 }), { b: -1 });\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getIntersectionSemigroup = function (S) {\n    var intersectionS = intersection(S);\n    return {\n        concat: function (first, second) { return intersectionS(second)(first); }\n    };\n};\n/**\n * Produces a `Magma` with a `concat` function that combines\n * two `ReadonlyRecord`s by making the `difference`.\n *\n * @example\n * import { getDifferenceMagma, difference, ReadonlyRecord } from \"fp-ts/ReadonlyRecord\"\n * import { Magma } from \"fp-ts/Magma\"\n *\n * const r1 = { a: 3, c: 3 };\n * const r2 = { a: 1, b: 2 };\n * const m: Magma<ReadonlyRecord<string, number>> = getDifferenceMagma<number>();\n * assert.deepStrictEqual(m.concat(r1, r2), difference(r2)(r1));\n * assert.deepStrictEqual(m.concat(r1, r2), { c: 3, b: 2 });\n *\n * @category instances\n * @since 2.11.0\n */\nexport var getDifferenceMagma = function () { return ({\n    concat: function (first, second) { return difference(second)(first); }\n}); };\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use `getFoldable` instead.\n *\n * @category zone of death\n * @since 2.7.0\n * @deprecated\n */\nexport var Foldable = {\n    URI: URI,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord)\n};\n/**\n * Use `getFoldableWithIndex` instead.\n *\n * @category zone of death\n * @since 2.7.0\n * @deprecated\n */\nexport var FoldableWithIndex = {\n    URI: URI,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord),\n    reduceWithIndex: /*#__PURE__*/ _reduceWithIndex(S.Ord),\n    foldMapWithIndex: /*#__PURE__*/ _foldMapWithIndex(S.Ord),\n    reduceRightWithIndex: /*#__PURE__*/ _reduceRightWithIndex(S.Ord)\n};\n/**\n * Use `getTraversable` instead.\n *\n * @category zone of death\n * @since 2.7.0\n * @deprecated\n */\nexport var Traversable = {\n    URI: URI,\n    map: _map,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord),\n    traverse: /*#__PURE__*/ _traverse(S.Ord),\n    sequence: sequence\n};\n/**\n * Use `getTraversableWithIndex` instead.\n *\n * @category zone of death\n * @since 2.7.0\n * @deprecated\n */\nexport var TraversableWithIndex = {\n    URI: URI,\n    map: _map,\n    mapWithIndex: _mapWithIndex,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord),\n    reduceWithIndex: /*#__PURE__*/ _reduceWithIndex(S.Ord),\n    foldMapWithIndex: /*#__PURE__*/ _foldMapWithIndex(S.Ord),\n    reduceRightWithIndex: /*#__PURE__*/ _reduceRightWithIndex(S.Ord),\n    traverse: /*#__PURE__*/ _traverse(S.Ord),\n    sequence: sequence,\n    traverseWithIndex: /*#__PURE__*/ _traverseWithIndex(S.Ord)\n};\nvar _wither = /*#__PURE__*/ witherDefault(Traversable, Compactable);\nvar _wilt = /*#__PURE__*/ wiltDefault(Traversable, Compactable);\n/**\n * Use `getWitherable` instead.\n *\n * @category zone of death\n * @since 2.7.0\n * @deprecated\n */\nexport var Witherable = {\n    URI: URI,\n    map: _map,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord),\n    traverse: /*#__PURE__*/ _traverse(S.Ord),\n    sequence: sequence,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    wither: _wither,\n    wilt: _wilt\n};\n/**\n * Use [`upsertAt`](#upsertat) instead.\n *\n * @category zone of death\n * @since 2.5.0\n * @deprecated\n */\nexport var insertAt = upsertAt;\nexport function hasOwnProperty(k, r) {\n    return _.has.call(r === undefined ? this : r, k);\n}\n/**\n * This instance is deprecated, use small, specific instances instead.\n * For example if a function needs a `Functor` instance, pass `RR.Functor` instead of `RR.readonlyRecord`\n * (where `RR` is from `import RR from 'fp-ts/ReadonlyRecord'`)\n *\n * @category zone of death\n * @since 2.5.0\n * @deprecated\n */\nexport var readonlyRecord = {\n    URI: URI,\n    map: _map,\n    reduce: /*#__PURE__*/ _reduce(S.Ord),\n    foldMap: /*#__PURE__*/ _foldMap(S.Ord),\n    reduceRight: /*#__PURE__*/ _reduceRight(S.Ord),\n    traverse: /*#__PURE__*/ _traverse(S.Ord),\n    sequence: sequence,\n    compact: compact,\n    separate: separate,\n    filter: _filter,\n    filterMap: _filterMap,\n    partition: _partition,\n    partitionMap: _partitionMap,\n    mapWithIndex: _mapWithIndex,\n    reduceWithIndex: /*#__PURE__*/ _reduceWithIndex(S.Ord),\n    foldMapWithIndex: /*#__PURE__*/ _foldMapWithIndex(S.Ord),\n    reduceRightWithIndex: /*#__PURE__*/ _reduceRightWithIndex(S.Ord),\n    filterMapWithIndex: _filterMapWithIndex,\n    filterWithIndex: _filterWithIndex,\n    partitionMapWithIndex: _partitionMapWithIndex,\n    partitionWithIndex: _partitionWithIndex,\n    traverseWithIndex: /*#__PURE__*/ _traverseWithIndex(S.Ord),\n    wither: _wither,\n    wilt: _wilt\n};\n"],"names":["_.has","S.Ord","_.some","_.none","_.isNone","that","r","_.isSome","fa","key","b","_.isLeft","flap_"],"mappings":";;;;;;;AAqBU,IAAC,aAAa,SAAU,GAAG;AAAE,SAAO,OAAO,OAAO,CAAE,GAAE,CAAC;AAAK;AAe5D,IAAC,WAAW,SAAU,GAAG;AAAE,SAAO,OAAO,OAAO,CAAE,GAAE,CAAC;AAAK;AAW1D,IAAC,OAAO,SAAU,GAAG;AAAE,SAAO,OAAO,KAAK,CAAC,EAAE;AAAU;AAWvD,IAAC,UAAU,SAAU,GAAG;AAC9B,WAAS,KAAK,GAAG;AACb,QAAIA,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,aAAO;AAAA,IACV;AAAA,EACJ;AACD,SAAO;AACX;AACA,IAAI,QAAQ,SAAU,GAAG;AACrB,SAAO,SAAU,GAAG;AAChB,WAAO,OAAO,KAAK,CAAC,EAAE,KAAK,EAAE,OAAO;AAAA,EAC5C;AACA;AAIU,IAAC,OAAqB,sBAAMC,GAAK;AACpC,SAAS,QAAQ,GAAG;AACvB,MAAI,OAAO,MAAM,YAAY;AACzB,WAAO,QAAQA,GAAK,EAAE,CAAC;AAAA,EAC1B;AACD,MAAI,QAAQ,MAAM,CAAC;AACnB,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,GAAG;AAChB,UAAI,MAAM,CAAA;AACV,eAAS,KAAK,GAAG,KAAK,MAAM,CAAC,GAAG,KAAK,GAAG,QAAQ,MAAM;AAClD,YAAI,MAAM,GAAG,EAAE;AACf,YAAI,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;AAAA,MAC1B;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAiBU,IAAC,kBACG,wBAAQA,GAAK,EAAE,SAAU,GAAG,GAAG;AAAE,SAAO,CAAC,GAAG,CAAC;CAAI;AACxD,SAAS,aAAa,GAAG;AAC5B,SAAO,SAAU,GAAG;AAChB,QAAI,MAAM,gBAAgB,CAAC;AAC3B,QAAI,MAAM,IAAI;AACd,WAAO,EAAE,OAAO,GAAG,SAAU,GAAG;AAAE,aAAQ,IAAI,MAAMC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAIC;AAAAA,IAAQ,CAAE;AAAA,EAChG;AACA;AAYU,IAAC,WAAW,SAAU,GAAG,GAAG;AAClC,SAAO,SAAU,GAAG;AAChB,QAAIH,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG;AAChC,aAAO;AAAA,IACV;AACD,QAAI,MAAM,OAAO,OAAO,CAAE,GAAE,CAAC;AAC7B,QAAI,CAAC,IAAI;AACT,WAAO;AAAA,EACf;AACA;AAcU,IAAC,MAAM,SAAU,GAAG,GAAG;AAAE,SAAOA,MAAM,KAAK,GAAG,CAAC;AAAK;AACvD,SAAS,SAAS,GAAG;AACxB,SAAO,SAAU,GAAG;AAChB,QAAI,CAACA,MAAM,KAAK,GAAG,CAAC,GAAG;AACnB,aAAO;AAAA,IACV;AACD,QAAI,MAAM,OAAO,OAAO,CAAE,GAAE,CAAC;AAC7B,WAAO,IAAI,CAAC;AACZ,WAAO;AAAA,EACf;AACA;AAgBU,IAAC,WAAW,SAAU,GAAG,GAAG;AAClC,SAAO,SAAU,GAAG;AAChB,QAAI,CAAC,IAAI,GAAG,CAAC,GAAG;AACZ,aAAOG;AAAAA,IACV;AACD,QAAI,EAAE,CAAC,MAAM,GAAG;AACZ,aAAOD,OAAO,CAAC;AAAA,IAClB;AACD,QAAI,MAAM,OAAO,OAAO,CAAE,GAAE,CAAC;AAC7B,QAAI,CAAC,IAAI;AACT,WAAOA,OAAO,GAAG;AAAA,EACzB;AACA;AAgBU,IAAC,WAAW,SAAU,GAAG,GAAG;AAClC,SAAO,SAAU,GAAG;AAChB,QAAI,CAAC,IAAI,GAAG,CAAC,GAAG;AACZ,aAAOC;AAAAA,IACV;AACD,QAAI,OAAO,EAAE,EAAE,CAAC,CAAC;AACjB,QAAI,SAAS,EAAE,CAAC,GAAG;AACf,aAAOD,OAAO,CAAC;AAAA,IAClB;AACD,QAAI,MAAM,OAAO,OAAO,CAAE,GAAE,CAAC;AAC7B,QAAI,CAAC,IAAI;AACT,WAAOA,OAAO,GAAG;AAAA,EACzB;AACA;AACO,SAAS,IAAI,GAAG;AACnB,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,GAAG;AAChB,QAAI,KAAK,OAAO,GAAG,CAAC;AACpB,WAAOE,OAAS,EAAE,IAAID,OAASD,OAAO,CAAC,GAAG,OAAO,UAAU,CAAC,CAAC,CAAC;AAAA,EACtE;AACA;AACO,SAAS,YAAY,GAAG;AAC3B,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,iBAAiB,YAAY,CAAC;AAClC,aAAO,SAAUG,OAAM;AAAE,eAAO,eAAeA,OAAM,EAAE;AAAA;IAC1D;AACD,aAAS,KAAK,IAAI;AACd,UAAI,CAACL,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;AACnD,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,OAAO,GAAG,GAAG;AACzB,MAAI,MAAM,QAAW;AACjB,WAAO,SAAUM,IAAG;AAAE,aAAO,OAAO,GAAGA,EAAC;AAAA;EAC3C;AACD,SAAON,MAAM,KAAK,GAAG,CAAC,IAAIE,OAAO,EAAE,CAAC,CAAC,IAAIC;AAC7C;AAIU,IAAC,QAAQ,CAAG;AACf,SAAS,aAAa,GAAG;AAC5B,SAAO,SAAU,GAAG;AAChB,QAAI,MAAM,CAAA;AACV,aAAS,KAAK,GAAG;AACb,UAAIH,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,YAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,MACrB;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,IAAI,GAAG;AACnB,SAAO,aAAa,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AACxD;AACO,SAAS,kBAAkB;AAC9B,MAAI,OAAO,CAAA;AACX,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,SAAK,EAAE,IAAI,UAAU,EAAE;AAAA,EAC1B;AACD,MAAI,KAAK,WAAW,GAAG;AACnB,WAAO,gBAAgBC,GAAK,EAAE,MAAM,QAAQ,IAAI;AAAA,EACnD;AACD,MAAI,QAAQ,MAAM,KAAK,CAAC,CAAC;AACzB,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAC1C,UAAI,MAAM;AACV,UAAI,KAAK,MAAM,EAAE;AACjB,UAAI,MAAM,GAAG;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,YAAI,IAAI,GAAG,CAAC;AACZ,cAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;AAAA,MACxB;AACD,aAAO;AAAA,IACV;AAAA;AACL;AACO,SAAS,iBAAiB,GAAG;AAChC,MAAI,aAAa,GAAG;AAChB,QAAI,UAAU,MAAM,CAAC;AACrB,WAAO,SAAU,GAAG;AAChB,aAAO,SAAU,GAAG;AAChB,eAAO,SAAU,IAAI;AACjB,cAAI,MAAM,EAAE;AACZ,cAAI,KAAK,QAAQ,EAAE;AACnB,cAAI,MAAM,GAAG;AACb,mBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,gBAAI,IAAI,GAAG,CAAC;AACZ,kBAAM,EAAE,OAAO,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,UAClC;AACD,iBAAO;AAAA,QAC3B;AAAA,MACA;AAAA,IACA;AAAA,EACK;AACD,SAAO,iBAAiBA,GAAK,EAAE,CAAC;AACpC;AACO,SAAS,uBAAuB;AACnC,MAAI,OAAO,CAAA;AACX,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,SAAK,EAAE,IAAI,UAAU,EAAE;AAAA,EAC1B;AACD,MAAI,KAAK,WAAW,GAAG;AACnB,WAAO,qBAAqBA,GAAK,EAAE,MAAM,QAAQ,IAAI;AAAA,EACxD;AACD,MAAI,QAAQ,MAAM,KAAK,CAAC,CAAC;AACzB,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAC1C,UAAI,MAAM;AACV,UAAI,KAAK,MAAM,EAAE;AACjB,UAAI,MAAM,GAAG;AACb,eAAS,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,IAAI,GAAG,CAAC;AACZ,cAAM,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;AAAA,MACxB;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAYU,IAAC,YAAY,SAAU,GAAG,GAAG;AACnC,MAAI;AACJ,SAAQ,KAAK,CAAA,GAAI,GAAG,CAAC,IAAI,GAAG;AAChC;AACO,SAAS,kBAAkB,GAAG;AACjC,MAAI,sBAAsB,mBAAmBA,GAAK,EAAE,CAAC;AACrD,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,oBAAoB,IAAI,CAAC;AAAA,IAAE;AAAA,EAAG;AACtF;AACO,SAAS,SAAS,GAAG;AACxB,MAAI,aAAa,UAAUA,GAAK,EAAE,CAAC;AACnC,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,WAAW,IAAI,CAAC;AAAA,IAAE;AAAA,EAAG;AAC7E;AACO,SAAS,SAAS,GAAG;AACxB,SAAO,UAAUA,GAAK,EAAE,CAAC;AAC7B;AAKU,IAAC,SAAS,SAAU,GAAG;AAC7B,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,EAAE,IAAI,KAAK,IAAI,UAAU,CAAC,CAAC,GAAG,OAAO;AAAA,IAAI;AAAA;AACjG;AAKU,IAAC,OAAO,SAAU,GAAG;AAC3B,MAAI,YAAY,SAAS,CAAC;AAC1B,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,EAAE,IAAI,KAAK,IAAI,UAAU,CAAC,CAAC,GAAG,QAAQ;AAAA,IAAI;AAAA;AAClG;AACO,SAAS,sBAAsB,GAAG;AACrC,SAAO,SAAU,GAAG;AAChB,QAAI,OAAO,CAAA;AACX,QAAI,QAAQ,CAAA;AACZ,aAAS,KAAK,GAAG;AACb,UAAID,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,YAAI,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;AACjB,gBAAQ,EAAE,MAAI;AAAA,UACV,KAAK;AACD,iBAAK,CAAC,IAAI,EAAE;AACZ;AAAA,UACJ,KAAK;AACD,kBAAM,CAAC,IAAI,EAAE;AACb;AAAA,QACP;AAAA,MACJ;AAAA,IACJ;AACD,WAAO,UAAU,MAAM,KAAK;AAAA,EACpC;AACA;AACO,SAAS,mBAAmB,oBAAoB;AACnD,SAAO,SAAU,GAAG;AAChB,QAAI,OAAO,CAAA;AACX,QAAI,QAAQ,CAAA;AACZ,aAAS,KAAK,GAAG;AACb,UAAIA,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,YAAI,IAAI,EAAE,CAAC;AACX,YAAI,mBAAmB,GAAG,CAAC,GAAG;AAC1B,gBAAM,CAAC,IAAI;AAAA,QACd,OACI;AACD,eAAK,CAAC,IAAI;AAAA,QACb;AAAA,MACJ;AAAA,IACJ;AACD,WAAO,UAAU,MAAM,KAAK;AAAA,EACpC;AACA;AACO,SAAS,mBAAmB,GAAG;AAClC,SAAO,SAAU,GAAG;AAChB,QAAI,MAAM,CAAA;AACV,aAAS,KAAK,GAAG;AACb,UAAIA,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,YAAI,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;AAClB,YAAIO,OAAS,EAAE,GAAG;AACd,cAAI,CAAC,IAAI,GAAG;AAAA,QACf;AAAA,MACJ;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,gBAAgB,oBAAoB;AAChD,SAAO,SAAU,IAAI;AACjB,QAAI,MAAM,CAAA;AACV,QAAI,UAAU;AACd,aAAS,OAAO,IAAI;AAChB,UAAIP,MAAM,KAAK,IAAI,GAAG,GAAG;AACrB,YAAI,IAAI,GAAG,GAAG;AACd,YAAI,mBAAmB,KAAK,CAAC,GAAG;AAC5B,cAAI,GAAG,IAAI;AAAA,QACd,OACI;AACD,oBAAU;AAAA,QACb;AAAA,MACJ;AAAA,IACJ;AACD,WAAO,UAAU,MAAM;AAAA,EAC/B;AACA;AACO,SAAS,aAAa,GAAG,GAAG;AAC/B,MAAI,mBAAmB,gBAAgB,GAAG,CAAC;AAC3C,SAAO,SAAU,KAAK;AAAE,WAAO,iBAAiB,KAAK,QAAQ;AAAA;AACjE;AACO,SAAS,gBAAgB,GAAG,GAAG;AAClC,SAAO,SAAU,IAAI,GAAG;AACpB,WAAO,EAAE,OAAO,IAAI,CAAA,GAAI,SAAU,GAAG,GAAG;AACpC,UAAI,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC;AAClC,QAAE,CAAC,IAAIA,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI;AAC9C,aAAO;AAAA,IACnB,CAAS;AAAA,EACT;AACA;AAYU,IAAC,YAAY;AAYb,IAAC,cAAc,SAAU,IAAI;AACnC,MAAI,MAAM,CAAA;AACV,WAAS,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,QAAQ,MAAM;AAChD,QAAI,IAAI,KAAK,EAAE;AACf,QAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAAA,EAClB;AACD,SAAO;AACX;AACO,SAAS,MAAM,WAAW;AAC7B,SAAO,SAAU,GAAG;AAChB,aAAS,KAAK,GAAG;AACb,UAAI,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG;AAClB,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AAYO,SAAS,KAAK,WAAW;AAC5B,SAAO,SAAU,GAAG;AAChB,aAAS,KAAK,GAAG;AACb,UAAI,UAAU,EAAE,CAAC,CAAC,GAAG;AACjB,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,KAAK,GAAG;AACpB,SAAO,SAAU,GAAG,IAAI;AACpB,QAAI,OAAO,QAAW;AAClB,UAAI,UAAU,KAAK,CAAC;AACpB,aAAO,SAAUQ,KAAI;AAAE,eAAO,QAAQ,GAAGA,GAAE;AAAA;IAC9C;AACD,aAAS,KAAK,IAAI;AACd,UAAI,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG;AACpB,eAAO;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AAmBU,IAAC,QAAQ,SAAU,GAAG;AAC5B,SAAO,SAAU,QAAQ;AACrB,WAAO,SAAU,OAAO;AACpB,UAAI,QAAQ,KAAK,GAAG;AAChB,eAAO;AAAA,MACV;AACD,UAAI,QAAQ,MAAM,GAAG;AACjB,eAAO;AAAA,MACV;AACD,UAAI,MAAM,CAAA;AACV,eAAS,KAAK,OAAO;AACjB,YAAI,IAAI,GAAG,MAAM,GAAG;AAChB,cAAI,CAAC,IAAI,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,QACxC,OACI;AACD,cAAI,CAAC,IAAI,MAAM,CAAC;AAAA,QACnB;AAAA,MACJ;AACD,eAAS,KAAK,QAAQ;AAClB,YAAI,CAAC,IAAI,GAAG,GAAG,GAAG;AACd,cAAI,CAAC,IAAI,OAAO,CAAC;AAAA,QACpB;AAAA,MACJ;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAmBU,IAAC,eAAe,SAAU,GAAG;AACnC,SAAO,SAAU,QAAQ;AACrB,WAAO,SAAU,OAAO;AACpB,UAAI,QAAQ,KAAK,KAAK,QAAQ,MAAM,GAAG;AACnC,eAAO;AAAA,MACV;AACD,UAAI,MAAM,CAAA;AACV,eAAS,KAAK,OAAO;AACjB,YAAI,IAAI,GAAG,MAAM,GAAG;AAChB,cAAI,CAAC,IAAI,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,QACxC;AAAA,MACJ;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAgBU,IAAC,aAAa,SAAU,QAAQ;AACtC,SAAO,SAAU,OAAO;AACpB,QAAI,QAAQ,KAAK,GAAG;AAChB,aAAO;AAAA,IACV;AACD,QAAI,QAAQ,MAAM,GAAG;AACjB,aAAO;AAAA,IACV;AACD,QAAI,MAAM,CAAA;AACV,aAAS,KAAK,OAAO;AACjB,UAAI,CAAC,IAAI,GAAG,MAAM,GAAG;AACjB,YAAI,CAAC,IAAI,MAAM,CAAC;AAAA,MACnB;AAAA,IACJ;AACD,aAAS,KAAK,QAAQ;AAClB,UAAI,CAAC,IAAI,GAAG,KAAK,GAAG;AAChB,YAAI,CAAC,IAAI,OAAO,CAAC;AAAA,MACpB;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AAEU,IAAC,OAAO,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,IAAI,CAAC,CAAC;AAAK;AAGtD,IAAC,gBAAgB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,aAAa,CAAC,CAAC;AAAK;AAGxE,IAAC,UAAU,SAAU,GAAG;AAC9B,MAAI,UAAU,OAAO,CAAC;AACtB,SAAO,SAAU,IAAI,GAAG,GAAG;AAAE,WAAO,KAAK,IAAI,QAAQ,GAAG,CAAC,CAAC;AAAA,EAAE;AAChE;AAEU,IAAC,WAAW,SAAU,GAAG;AAAE,SAAO,SAAU,GAAG;AACrD,QAAI,WAAW,QAAQ,CAAC,EAAE,CAAC;AAC3B,WAAO,SAAU,IAAI,GAAG;AAAE,aAAO,KAAK,IAAI,SAAS,CAAC,CAAC;AAAA;EACzD;AAAK;AAGK,IAAC,eAAe,SAAU,GAAG;AACnC,MAAI,eAAe,YAAY,CAAC;AAChC,SAAO,SAAU,IAAI,GAAG,GAAG;AAAE,WAAO,KAAK,IAAI,aAAa,GAAG,CAAC,CAAC;AAAA,EAAE;AACrE;AAGU,IAAC,UAAU,SAAU,IAAI,WAAW;AAC1C,SAAO,KAAK,IAAI,OAAO,SAAS,CAAC;AACrC;AAGU,IAAC,aAAa,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,UAAU,CAAC,CAAC;AAAK;AAGlE,IAAC,aAAa,SAAU,IAAI,WAAW;AAAE,SAAO,KAAK,IAAI,UAAU,SAAS,CAAC;AAAK;AAGlF,IAAC,gBAAgB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,aAAa,CAAC,CAAC;AAAK;AAGxE,IAAC,mBAAmB,SAAU,GAAG;AACvC,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,IAAI,GAAG,GAAG;AAAE,WAAO,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC;AAAA,EAAE;AACzE;AAEU,IAAC,oBAAoB,SAAU,GAAG;AACxC,MAAI,oBAAoB,iBAAiB,CAAC;AAC1C,SAAO,SAAU,GAAG;AAChB,QAAI,oBAAoB,kBAAkB,CAAC;AAC3C,WAAO,SAAU,IAAI,GAAG;AAAE,aAAO,KAAK,IAAI,kBAAkB,CAAC,CAAC;AAAA;EACtE;AACA;AAGU,IAAC,wBAAwB,SAAU,GAAG;AAC5C,MAAI,wBAAwB,qBAAqB,CAAC;AAClD,SAAO,SAAU,IAAI,GAAG,GAAG;AAAE,WAAO,KAAK,IAAI,sBAAsB,GAAG,CAAC,CAAC;AAAA,EAAE;AAC9E;AAGU,IAAC,yBAAyB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,sBAAsB,CAAC,CAAC;AAAK;AAG1F,IAAC,sBAAsB,SAAU,IAAI,oBAAoB;AAC/D,SAAO,KAAK,IAAI,mBAAmB,kBAAkB,CAAC;AAC1D;AAGU,IAAC,sBAAsB,SAAU,IAAI,GAAG;AAAE,SAAO,KAAK,IAAI,mBAAmB,CAAC,CAAC;AAAK;AAGpF,IAAC,mBAAmB,SAAU,IAAI,oBAAoB;AAAE,SAAO,KAAK,IAAI,gBAAgB,kBAAkB,CAAC;AAAK;AAEhH,IAAC,YAAY,SAAU,GAAG;AAChC,MAAI,qBAAqB,mBAAmB,CAAC;AAC7C,SAAO,SAAU,GAAG;AAChB,QAAI,sBAAsB,mBAAmB,CAAC;AAC9C,WAAO,SAAU,IAAI,GAAG;AAAE,aAAO,oBAAoB,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,IAAE;AAAA,EAC9E;AACA;AAEU,IAAC,YAAY,SAAU,GAAG;AAChC,MAAI,YAAY,UAAU,CAAC;AAC3B,SAAO,SAAU,GAAG;AAChB,QAAI,aAAa,UAAU,CAAC;AAC5B,WAAO,SAAU,IAAI;AAAE,aAAO,WAAW,IAAI,QAAQ;AAAA;EAC7D;AACA;AACA,IAAI,qBAAqB,SAAU,GAAG;AAClC,SAAO,SAAU,GAAG;AAChB,QAAI,QAAQ,MAAM,CAAC;AACnB,WAAO,SAAU,IAAI,GAAG;AACpB,UAAI,KAAK,MAAM,EAAE;AACjB,UAAI,GAAG,WAAW,GAAG;AACjB,eAAO,EAAE,GAAG,KAAK;AAAA,MACpB;AACD,UAAI,KAAK,EAAE,GAAG,CAAE,CAAA;AAChB,UAAI,UAAU,SAAUC,MAAK;AACzB,aAAK,EAAE,GAAG,EAAE,IAAI,IAAI,SAAU,GAAG;AAAE,iBAAO,SAAU,GAAG;AACnD,gBAAI;AACJ,mBAAO,OAAO,OAAO,CAAE,GAAE,IAAI,KAAK,IAAI,GAAGA,IAAG,IAAI,GAAG,GAAE;AAAA,UACzE;AAAA,QAAkB,CAAE,GAAG,EAAEA,MAAK,GAAGA,IAAG,CAAC,CAAC;AAAA,MACtC;AACY,eAAS,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,QAAQ,MAAM;AAChD,YAAI,MAAM,KAAK,EAAE;AACjB,gBAAQ,GAAG;AAAA,MACd;AACD,aAAO;AAAA,IACnB;AAAA,EACA;AACA;AAgBU,IAAC,SAAS,SAAU,WAAW;AACrC,SAAO,gBAAgB,SAAU,GAAG,GAAG;AAAE,WAAO,UAAU,CAAC;AAAA,EAAE,CAAE;AACnE;AAkBU,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,mBAAmB,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AAAK;AAoB3F,IAAC,YAAY,SAAU,WAAW;AACxC,SAAO,mBAAmB,SAAU,GAAG,GAAG;AAAE,WAAO,UAAU,CAAC;AAAA,EAAE,CAAE;AACtE;AAuBU,IAAC,eAAe,SAAU,GAAG;AACnC,SAAO,sBAAsB,SAAU,GAAG,GAAG;AAAE,WAAO,EAAE,CAAC;AAAA,EAAE,CAAE;AACjE;AACO,SAAS,SAAS;AACrB,MAAI,OAAO,CAAA;AACX,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,SAAK,EAAE,IAAI,UAAU,EAAE;AAAA,EAC1B;AACD,MAAI,KAAK,WAAW,GAAG;AACnB,QAAI,qBAAqB,gBAAgB,KAAK,CAAC,CAAC;AAChD,WAAO,SAAU,GAAG,GAAG;AAAE,aAAO,mBAAmB,GAAG,SAAU,GAAGC,IAAG,GAAG;AAAE,eAAO,EAAEA,IAAG,CAAC;AAAA,MAAE,CAAE;AAAA;EAC/F;AACD,SAAO,OAAOT,GAAK,EAAE,MAAM,QAAQ,IAAI;AAC3C;AACO,SAAS,QAAQ,GAAG;AACvB,MAAI,aAAa,GAAG;AAChB,QAAI,sBAAsB,iBAAiB,CAAC;AAC5C,WAAO,SAAU,GAAG;AAChB,UAAI,oBAAoB,oBAAoB,CAAC;AAC7C,aAAO,SAAU,GAAG;AAAE,eAAO,kBAAkB,SAAU,GAAG,GAAG;AAAE,iBAAO,EAAE,CAAC;AAAA,QAAI,CAAA;AAAA,MAAE;AAAA,IAC7F;AAAA,EACK;AACD,SAAO,QAAQA,GAAK,EAAE,CAAC;AAC3B;AACO,SAAS,cAAc;AAC1B,MAAI,OAAO,CAAA;AACX,WAAS,KAAK,GAAG,KAAK,UAAU,QAAQ,MAAM;AAC1C,SAAK,EAAE,IAAI,UAAU,EAAE;AAAA,EAC1B;AACD,MAAI,KAAK,WAAW,GAAG;AACnB,QAAI,0BAA0B,qBAAqB,KAAK,CAAC,CAAC;AAC1D,WAAO,SAAU,GAAG,GAAG;AAAE,aAAO,wBAAwB,GAAG,SAAU,GAAGS,IAAG,GAAG;AAAE,eAAO,EAAEA,IAAG,CAAC;AAAA,MAAE,CAAE;AAAA;EACpG;AACD,SAAO,YAAYT,GAAK,EAAE,MAAM,QAAQ,IAAI;AAChD;AAiBU,IAAC,UAAU,SAAU,GAAG;AAC9B,MAAI,MAAM,CAAA;AACV,WAAS,KAAK,GAAG;AACb,QAAID,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,UAAI,KAAK,EAAE,CAAC;AACZ,UAAIO,OAAS,EAAE,GAAG;AACd,YAAI,CAAC,IAAI,GAAG;AAAA,MACf;AAAA,IACJ;AAAA,EACJ;AACD,SAAO;AACX;AAwBU,IAAC,WAAW,SAAU,GAAG;AAC/B,MAAI,OAAO,CAAA;AACX,MAAI,QAAQ,CAAA;AACZ,WAAS,KAAK,GAAG;AACb,QAAIP,MAAM,KAAK,GAAG,CAAC,GAAG;AAClB,UAAI,IAAI,EAAE,CAAC;AACX,UAAIW,OAAS,CAAC,GAAG;AACb,aAAK,CAAC,IAAI,EAAE;AAAA,MACf,OACI;AACD,cAAM,CAAC,IAAI,EAAE;AAAA,MAChB;AAAA,IACJ;AAAA,EACJ;AACD,SAAO,UAAU,MAAM,KAAK;AAChC;AAKU,IAAC,MAAM;AACV,SAAS,QAAQ,GAAG;AACvB,MAAI,aAAa,GAAG;AAChB,WAAO,SAAU,GAAG;AAAE,aAAQ;AAAA,QAC1B,MAAM,SAAU,GAAG;AACf,cAAI,WAAW,QAAQ,CAAC,EAAE,SAAU,GAAG,GAAG;AAAE,mBAAO,GAAG,OAAO,KAAK,UAAU,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAAA,UAAE,CAAE,EAAE,CAAC,EAAE,KAAK,IAAI;AACxH,iBAAO,aAAa,KAAK,OAAO,KAAK,OAAO,UAAU,IAAI;AAAA,QAC7D;AAAA,MACJ;AAAA;EACJ;AACD,SAAO,QAAQV,GAAK,EAAE,CAAC;AAC3B;AACO,SAAS,MAAM,GAAG;AACrB,MAAI,eAAe,YAAY,CAAC;AAChC,SAAO,WAAW,SAAU,GAAG,GAAG;AAAE,WAAO,aAAa,CAAC,EAAE,CAAC,KAAK,aAAa,CAAC,EAAE,CAAC;AAAA,EAAI,CAAA;AAC1F;AACO,SAAS,UAAU,GAAG;AACzB,SAAO;AAAA,IACH,QAAQ,SAAU,OAAO,QAAQ;AAC7B,UAAI,QAAQ,KAAK,GAAG;AAChB,eAAO;AAAA,MACV;AACD,UAAI,QAAQ,MAAM,GAAG;AACjB,eAAO;AAAA,MACV;AACD,UAAI,IAAI,OAAO,OAAO,CAAE,GAAE,KAAK;AAC/B,eAAS,KAAK,QAAQ;AAClB,YAAID,MAAM,KAAK,QAAQ,CAAC,GAAG;AACvB,YAAE,CAAC,IAAIA,MAAM,KAAK,OAAO,CAAC,IAAI,EAAE,OAAO,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC;AAAA,QACzE;AAAA,MACJ;AACD,aAAO;AAAA,IACV;AAAA,IACD;AAAA,EACR;AACA;AAKU,IAAC,UAAU;AAAA,EACjB;AAAA,EACA,KAAK;AACT;AAiBU,IAAC,OAAqBY,uBAAM,OAAO;AAKnC,IAAC,mBAAmB;AAAA,EAC1B;AAAA,EACA,KAAK;AAAA,EACL,cAAc;AAClB;AAQU,IAAC,cAAc,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC5C;AAAA,IACA,QAAQ,QAAQ,CAAC;AAAA,IACjB,SAAS,SAAS,CAAC;AAAA,IACnB,aAAa,aAAa,CAAC;AAAA,EAC/B;AAAM;AAQI,IAAC,uBAAuB,SAAU,GAAG;AAAE,SAAQ;AAAA,IACrD;AAAA,IACA,QAAQ,QAAQ,CAAC;AAAA,IACjB,SAAS,SAAS,CAAC;AAAA,IACnB,aAAa,aAAa,CAAC;AAAA,IAC3B,iBAAiB,iBAAiB,CAAC;AAAA,IACnC,kBAAkB,kBAAkB,CAAC;AAAA,IACrC,sBAAsB,sBAAsB,CAAC;AAAA,EACjD;AAAM;AAKI,IAAC,cAAc;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AACJ;AAKU,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAClB;AAKU,IAAC,sBAAsB;AAAA,EAC7B;AAAA,EACA,KAAK;AAAA,EACL,cAAc;AAAA,EACd;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAAA,EACd,oBAAoB;AAAA,EACpB,iBAAiB;AAAA,EACjB,uBAAuB;AAAA,EACvB,oBAAoB;AACxB;AAQU,IAAC,iBAAiB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC/C;AAAA,IACA,KAAK;AAAA,IACL,QAAQ,QAAQ,CAAC;AAAA,IACjB,SAAS,SAAS,CAAC;AAAA,IACnB,aAAa,aAAa,CAAC;AAAA,IAC3B,UAAU,UAAU,CAAC;AAAA,IACrB,UAAU,UAAU,CAAC;AAAA,EACzB;AAAM;AAQI,IAAC,0BAA0B,SAAU,GAAG;AAAE,SAAQ;AAAA,IACxD;AAAA,IACA,KAAK;AAAA,IACL,cAAc;AAAA,IACd,QAAQ,QAAQ,CAAC;AAAA,IACjB,SAAS,SAAS,CAAC;AAAA,IACnB,aAAa,aAAa,CAAC;AAAA,IAC3B,iBAAiB,iBAAiB,CAAC;AAAA,IACnC,kBAAkB,kBAAkB,CAAC;AAAA,IACrC,sBAAsB,sBAAsB,CAAC;AAAA,IAC7C,UAAU,UAAU,CAAC;AAAA,IACrB,UAAU,UAAU,CAAC;AAAA,IACrB,mBAAmB,mBAAmB,CAAC;AAAA,EAC3C;AAAM;AAKI,IAAC,gBAAgB,SAAU,GAAG;AACpC,MAAI,IAAI,eAAe,CAAC;AACxB,SAAO;AAAA,IACH;AAAA,IACA,KAAK;AAAA,IACL,QAAQ,QAAQ,CAAC;AAAA,IACjB,SAAS,SAAS,CAAC;AAAA,IACnB,aAAa,aAAa,CAAC;AAAA,IAC3B,UAAU,EAAE;AAAA,IACZ,UAAU,EAAE;AAAA,IACZ;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,WAAW;AAAA,IACX,cAAc;AAAA,IACd,QAAQ,cAAc,GAAG,WAAW;AAAA,IACpC,MAAM,YAAY,GAAG,WAAW;AAAA,EACxC;AACA;AAkBU,IAAC,oBAAoB,SAAU,GAAG;AACxC,MAAI,SAAS,MAAM,CAAC;AACpB,SAAO;AAAA,IACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,OAAO,MAAM,EAAE,KAAK;AAAA,IAAI;AAAA,EAC1E;AACA;AAkBU,IAAC,iBAAiB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC/C,QAAQ,kBAAkB,CAAC,EAAE;AAAA,IAC7B;AAAA,EACJ;AAAM;AAkBI,IAAC,2BAA2B,SAAU,GAAG;AAC/C,MAAI,gBAAgB,aAAa,CAAC;AAClC,SAAO;AAAA,IACH,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,cAAc,MAAM,EAAE,KAAK;AAAA,IAAI;AAAA,EACjF;AACA;AAkBU,IAAC,qBAAqB,WAAY;AAAE,SAAQ;AAAA,IAClD,QAAQ,SAAU,OAAO,QAAQ;AAAE,aAAO,WAAW,MAAM,EAAE,KAAK;AAAA,IAAI;AAAA,EAC1E;AAAM;AAWI,IAAC,WAAW;AAAA,EAClB;AAAA,EACA,QAAsB,wBAAQX,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AACjD;AAQU,IAAC,oBAAoB;AAAA,EAC3B;AAAA,EACA,QAAsB,wBAAQA,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AAAA,EAC7C,iBAA+B,iCAAiBA,GAAK;AAAA,EACrD,kBAAgC,kCAAkBA,GAAK;AAAA,EACvD,sBAAoC,sCAAsBA,GAAK;AACnE;AAQU,IAAC,cAAc;AAAA,EACrB;AAAA,EACA,KAAK;AAAA,EACL,QAAsB,wBAAQA,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AAAA,EAC7C,UAAwB,0BAAUA,GAAK;AAAA,EACvC;AACJ;AAQU,IAAC,uBAAuB;AAAA,EAC9B;AAAA,EACA,KAAK;AAAA,EACL,cAAc;AAAA,EACd,QAAsB,wBAAQA,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AAAA,EAC7C,iBAA+B,iCAAiBA,GAAK;AAAA,EACrD,kBAAgC,kCAAkBA,GAAK;AAAA,EACvD,sBAAoC,sCAAsBA,GAAK;AAAA,EAC/D,UAAwB,0BAAUA,GAAK;AAAA,EACvC;AAAA,EACA,mBAAiC,mCAAmBA,GAAK;AAC7D;AACA,IAAI,UAAwB,8BAAc,aAAa,WAAW;AAClE,IAAI,QAAsB,4BAAY,aAAa,WAAW;AAQpD,IAAC,aAAa;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,EACL,QAAsB,wBAAQA,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AAAA,EAC7C,UAAwB,0BAAUA,GAAK;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAAA,EACd,QAAQ;AAAA,EACR,MAAM;AACV;AAQU,IAAC,WAAW;AACf,SAAS,eAAe,GAAG,GAAG;AACjC,SAAOD,MAAM,KAAK,MAAM,SAAY,OAAO,GAAG,CAAC;AACnD;AAUU,IAAC,iBAAiB;AAAA,EACxB;AAAA,EACA,KAAK;AAAA,EACL,QAAsB,wBAAQC,GAAK;AAAA,EACnC,SAAuB,yBAASA,GAAK;AAAA,EACrC,aAA2B,6BAAaA,GAAK;AAAA,EAC7C,UAAwB,0BAAUA,GAAK;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,WAAW;AAAA,EACX,cAAc;AAAA,EACd,cAAc;AAAA,EACd,iBAA+B,iCAAiBA,GAAK;AAAA,EACrD,kBAAgC,kCAAkBA,GAAK;AAAA,EACvD,sBAAoC,sCAAsBA,GAAK;AAAA,EAC/D,oBAAoB;AAAA,EACpB,iBAAiB;AAAA,EACjB,uBAAuB;AAAA,EACvB,oBAAoB;AAAA,EACpB,mBAAiC,mCAAmBA,GAAK;AAAA,EACzD,QAAQ;AAAA,EACR,MAAM;AACV;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,419 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const Eq = require("./Eq.cjs");
+const _function = require("./function.cjs");
+const Predicate = require("./Predicate.cjs");
+const Separated = require("./Separated.cjs");
+var fromSet = function(s) {
+  return new Set(s);
+};
+var singleton = function(a) {
+  return /* @__PURE__ */ new Set([a]);
+};
+var fromReadonlyArray = function(E) {
+  return function(as) {
+    var len = as.length;
+    var out = /* @__PURE__ */ new Set();
+    var has = elem(E);
+    for (var i = 0; i < len; i++) {
+      var a = as[i];
+      if (!has(a, out)) {
+        out.add(a);
+      }
+    }
+    return out;
+  };
+};
+function toSet(s) {
+  return new Set(s);
+}
+function map(E) {
+  var elemE = elem(E);
+  return function(f) {
+    return function(set) {
+      var r = /* @__PURE__ */ new Set();
+      set.forEach(function(e) {
+        var v = f(e);
+        if (!elemE(v, r)) {
+          r.add(v);
+        }
+      });
+      return r;
+    };
+  };
+}
+function chain(E) {
+  var elemE = elem(E);
+  return function(f) {
+    return function(set) {
+      var r = /* @__PURE__ */ new Set();
+      set.forEach(function(e) {
+        f(e).forEach(function(e2) {
+          if (!elemE(e2, r)) {
+            r.add(e2);
+          }
+        });
+      });
+      return r;
+    };
+  };
+}
+function filter(predicate) {
+  return function(set) {
+    var values = set.values();
+    var e;
+    var r = /* @__PURE__ */ new Set();
+    while (!(e = values.next()).done) {
+      var a = e.value;
+      if (predicate(a)) {
+        r.add(a);
+      }
+    }
+    return r;
+  };
+}
+function partition(predicate) {
+  return function(set) {
+    var values = set.values();
+    var e;
+    var right = /* @__PURE__ */ new Set();
+    var left = /* @__PURE__ */ new Set();
+    while (!(e = values.next()).done) {
+      var a = e.value;
+      if (predicate(a)) {
+        right.add(a);
+      } else {
+        left.add(a);
+      }
+    }
+    return Separated.separated(left, right);
+  };
+}
+function union(E) {
+  var elemE = elem(E);
+  return function(me, that) {
+    if (that === void 0) {
+      var unionE_1 = union(E);
+      return function(that2) {
+        return unionE_1(me, that2);
+      };
+    }
+    if (isEmpty(me)) {
+      return that;
+    }
+    if (isEmpty(that)) {
+      return me;
+    }
+    var r = new Set(me);
+    that.forEach(function(e) {
+      if (!elemE(e, r)) {
+        r.add(e);
+      }
+    });
+    return r;
+  };
+}
+function intersection(E) {
+  var elemE = elem(E);
+  return function(me, that) {
+    if (that === void 0) {
+      var intersectionE_1 = intersection(E);
+      return function(that2) {
+        return intersectionE_1(that2, me);
+      };
+    }
+    if (isEmpty(me) || isEmpty(that)) {
+      return empty;
+    }
+    var r = /* @__PURE__ */ new Set();
+    me.forEach(function(e) {
+      if (elemE(e, that)) {
+        r.add(e);
+      }
+    });
+    return r;
+  };
+}
+function partitionMap(EB, EC) {
+  return function(f) {
+    return function(set) {
+      var values = set.values();
+      var e;
+      var left = /* @__PURE__ */ new Set();
+      var right = /* @__PURE__ */ new Set();
+      var hasB = elem(EB);
+      var hasC = elem(EC);
+      while (!(e = values.next()).done) {
+        var v = f(e.value);
+        switch (v._tag) {
+          case "Left":
+            if (!hasB(v.left, left)) {
+              left.add(v.left);
+            }
+            break;
+          case "Right":
+            if (!hasC(v.right, right)) {
+              right.add(v.right);
+            }
+            break;
+        }
+      }
+      return Separated.separated(left, right);
+    };
+  };
+}
+function difference(E) {
+  var elemE = elem(E);
+  return function(me, that) {
+    if (that === void 0) {
+      var differenceE_1 = difference(E);
+      return function(that2) {
+        return differenceE_1(that2, me);
+      };
+    }
+    return filter(function(a) {
+      return !elemE(a, that);
+    })(me);
+  };
+}
+function reduce(O) {
+  var toReadonlyArrayO = toReadonlyArray(O);
+  return function(b, f) {
+    return function(fa) {
+      return toReadonlyArrayO(fa).reduce(f, b);
+    };
+  };
+}
+function foldMap(O, M) {
+  var toReadonlyArrayO = toReadonlyArray(O);
+  return function(f) {
+    return function(fa) {
+      return toReadonlyArrayO(fa).reduce(function(b, a) {
+        return M.concat(b, f(a));
+      }, M.empty);
+    };
+  };
+}
+var reduceRight = function(O) {
+  var toReadonlyArrayO = toReadonlyArray(O);
+  return function(b, f) {
+    return function(fa) {
+      return toReadonlyArrayO(fa).reduceRight(function(b2, a) {
+        return f(a, b2);
+      }, b);
+    };
+  };
+};
+function insert(E) {
+  var elemE = elem(E);
+  return function(a) {
+    return function(set) {
+      if (!elemE(a)(set)) {
+        var r = new Set(set);
+        r.add(a);
+        return r;
+      } else {
+        return set;
+      }
+    };
+  };
+}
+var remove = function(E) {
+  return function(a) {
+    return function(set) {
+      return filter(function(ax) {
+        return !E.equals(a, ax);
+      })(set);
+    };
+  };
+};
+var toggle = function(E) {
+  var elemE = elem(E);
+  var removeE = remove(E);
+  var insertE = insert(E);
+  return function(a) {
+    return function(set) {
+      return (elemE(a, set) ? removeE : insertE)(a)(set);
+    };
+  };
+};
+var compact = function(E) {
+  return filterMap(E)(_function.identity);
+};
+function separate(EE, EA) {
+  return function(fa) {
+    var elemEE = elem(EE);
+    var elemEA = elem(EA);
+    var left = /* @__PURE__ */ new Set();
+    var right = /* @__PURE__ */ new Set();
+    fa.forEach(function(e) {
+      switch (e._tag) {
+        case "Left":
+          if (!elemEE(e.left, left)) {
+            left.add(e.left);
+          }
+          break;
+        case "Right":
+          if (!elemEA(e.right, right)) {
+            right.add(e.right);
+          }
+          break;
+      }
+    });
+    return Separated.separated(left, right);
+  };
+}
+function filterMap(E) {
+  var elemE = elem(E);
+  return function(f) {
+    return function(fa) {
+      var r = /* @__PURE__ */ new Set();
+      fa.forEach(function(a) {
+        var ob = f(a);
+        if (ob._tag === "Some" && !elemE(ob.value, r)) {
+          r.add(ob.value);
+        }
+      });
+      return r;
+    };
+  };
+}
+var empty = /* @__PURE__ */ new Set();
+var isEmpty = function(set) {
+  return set.size === 0;
+};
+var size = function(set) {
+  return set.size;
+};
+var some = function(predicate) {
+  return function(set) {
+    var values = set.values();
+    var e;
+    var found = false;
+    while (!found && !(e = values.next()).done) {
+      found = predicate(e.value);
+    }
+    return found;
+  };
+};
+function every(predicate) {
+  return Predicate.not(some(Predicate.not(predicate)));
+}
+function isSubset(E) {
+  var elemE = elem(E);
+  return function(me, that) {
+    if (that === void 0) {
+      var isSubsetE_1 = isSubset(E);
+      return function(that2) {
+        return isSubsetE_1(that2, me);
+      };
+    }
+    return every(function(a) {
+      return elemE(a, that);
+    })(me);
+  };
+}
+function elem(E) {
+  return function(a, set) {
+    if (set === void 0) {
+      var elemE_1 = elem(E);
+      return function(set2) {
+        return elemE_1(a, set2);
+      };
+    }
+    var values = set.values();
+    var e;
+    var found = false;
+    while (!found && !(e = values.next()).done) {
+      found = E.equals(a, e.value);
+    }
+    return found;
+  };
+}
+var toReadonlyArray = function(O) {
+  return function(set) {
+    var out = [];
+    set.forEach(function(e) {
+      return out.push(e);
+    });
+    return out.sort(O.compare);
+  };
+};
+var URI = "ReadonlySet";
+function getShow(S) {
+  return {
+    show: function(s) {
+      var entries = [];
+      s.forEach(function(a) {
+        entries.push(S.show(a));
+      });
+      return "new Set([".concat(entries.sort().join(", "), "])");
+    }
+  };
+}
+function getEq(E) {
+  var subsetE = isSubset(E);
+  return Eq.fromEquals(function(x, y) {
+    return subsetE(x, y) && subsetE(y, x);
+  });
+}
+var getUnionSemigroup = function(E) {
+  return {
+    concat: union(E)
+  };
+};
+var getUnionMonoid = function(E) {
+  return {
+    concat: getUnionSemigroup(E).concat,
+    empty
+  };
+};
+var getIntersectionSemigroup = function(E) {
+  return {
+    concat: intersection(E)
+  };
+};
+var getDifferenceMagma = function(E) {
+  return {
+    concat: difference(E)
+  };
+};
+var fromArray = fromReadonlyArray;
+exports.URI = URI;
+exports.chain = chain;
+exports.compact = compact;
+exports.difference = difference;
+exports.elem = elem;
+exports.empty = empty;
+exports.every = every;
+exports.filter = filter;
+exports.filterMap = filterMap;
+exports.foldMap = foldMap;
+exports.fromArray = fromArray;
+exports.fromReadonlyArray = fromReadonlyArray;
+exports.fromSet = fromSet;
+exports.getDifferenceMagma = getDifferenceMagma;
+exports.getEq = getEq;
+exports.getIntersectionSemigroup = getIntersectionSemigroup;
+exports.getShow = getShow;
+exports.getUnionMonoid = getUnionMonoid;
+exports.getUnionSemigroup = getUnionSemigroup;
+exports.insert = insert;
+exports.intersection = intersection;
+exports.isEmpty = isEmpty;
+exports.isSubset = isSubset;
+exports.map = map;
+exports.partition = partition;
+exports.partitionMap = partitionMap;
+exports.reduce = reduce;
+exports.reduceRight = reduceRight;
+exports.remove = remove;
+exports.separate = separate;
+exports.singleton = singleton;
+exports.size = size;
+exports.some = some;
+exports.toReadonlyArray = toReadonlyArray;
+exports.toSet = toSet;
+exports.toggle = toggle;
+exports.union = union;
+//# sourceMappingURL=ReadonlySet.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ReadonlySet.cjs","sources":["../../../../../../node_modules/fp-ts/es6/ReadonlySet.js"],"sourcesContent":["import { fromEquals } from './Eq';\nimport { identity } from './function';\nimport { not } from './Predicate';\nimport { separated } from './Separated';\n/**\n * @category conversions\n * @since 2.5.0\n */\nexport var fromSet = function (s) { return new Set(s); };\n// -------------------------------------------------------------------------------------\n// constructors\n// -------------------------------------------------------------------------------------\n/**\n * Create a set with one element\n *\n * @category constructors\n * @since 2.5.0\n */\nexport var singleton = function (a) { return new Set([a]); };\n/**\n * Create a `ReadonlySet` from a `ReadonlyArray`\n *\n * @category conversions\n * @since 2.10.0\n */\nexport var fromReadonlyArray = function (E) {\n    return function (as) {\n        var len = as.length;\n        var out = new Set();\n        var has = elem(E);\n        for (var i = 0; i < len; i++) {\n            var a = as[i];\n            if (!has(a, out)) {\n                out.add(a);\n            }\n        }\n        return out;\n    };\n};\n/**\n * @category conversions\n * @since 2.5.0\n */\nexport function toSet(s) {\n    return new Set(s);\n}\n/**\n * Projects a Set through a function\n *\n * @since 2.5.0\n */\nexport function map(E) {\n    var elemE = elem(E);\n    return function (f) { return function (set) {\n        var r = new Set();\n        set.forEach(function (e) {\n            var v = f(e);\n            if (!elemE(v, r)) {\n                r.add(v);\n            }\n        });\n        return r;\n    }; };\n}\n/**\n * @since 2.5.0\n */\nexport function chain(E) {\n    var elemE = elem(E);\n    return function (f) { return function (set) {\n        var r = new Set();\n        set.forEach(function (e) {\n            f(e).forEach(function (e) {\n                if (!elemE(e, r)) {\n                    r.add(e);\n                }\n            });\n        });\n        return r;\n    }; };\n}\nexport function filter(predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var r = new Set();\n        while (!(e = values.next()).done) {\n            var a = e.value;\n            if (predicate(a)) {\n                r.add(a);\n            }\n        }\n        return r;\n    };\n}\nexport function partition(predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var right = new Set();\n        var left = new Set();\n        while (!(e = values.next()).done) {\n            var a = e.value;\n            if (predicate(a)) {\n                right.add(a);\n            }\n            else {\n                left.add(a);\n            }\n        }\n        return separated(left, right);\n    };\n}\nexport function union(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var unionE_1 = union(E);\n            return function (that) { return unionE_1(me, that); };\n        }\n        if (isEmpty(me)) {\n            return that;\n        }\n        if (isEmpty(that)) {\n            return me;\n        }\n        var r = new Set(me);\n        that.forEach(function (e) {\n            if (!elemE(e, r)) {\n                r.add(e);\n            }\n        });\n        return r;\n    };\n}\nexport function intersection(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var intersectionE_1 = intersection(E);\n            return function (that) { return intersectionE_1(that, me); };\n        }\n        if (isEmpty(me) || isEmpty(that)) {\n            return empty;\n        }\n        var r = new Set();\n        me.forEach(function (e) {\n            if (elemE(e, that)) {\n                r.add(e);\n            }\n        });\n        return r;\n    };\n}\n/**\n * @since 2.5.0\n */\nexport function partitionMap(EB, EC) {\n    return function (f) {\n        return function (set) {\n            var values = set.values();\n            var e;\n            var left = new Set();\n            var right = new Set();\n            var hasB = elem(EB);\n            var hasC = elem(EC);\n            while (!(e = values.next()).done) {\n                var v = f(e.value);\n                switch (v._tag) {\n                    case 'Left':\n                        if (!hasB(v.left, left)) {\n                            left.add(v.left);\n                        }\n                        break;\n                    case 'Right':\n                        if (!hasC(v.right, right)) {\n                            right.add(v.right);\n                        }\n                        break;\n                }\n            }\n            return separated(left, right);\n        };\n    };\n}\nexport function difference(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var differenceE_1 = difference(E);\n            return function (that) { return differenceE_1(that, me); };\n        }\n        return filter(function (a) { return !elemE(a, that); })(me);\n    };\n}\n/**\n * @since 2.5.0\n */\nexport function reduce(O) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (b, f) { return function (fa) { return toReadonlyArrayO(fa).reduce(f, b); }; };\n}\n/**\n * @since 2.5.0\n */\nexport function foldMap(O, M) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (f) { return function (fa) { return toReadonlyArrayO(fa).reduce(function (b, a) { return M.concat(b, f(a)); }, M.empty); }; };\n}\n/**\n * @category folding\n * @since 2.11.0\n */\nexport var reduceRight = function (O) {\n    var toReadonlyArrayO = toReadonlyArray(O);\n    return function (b, f) { return function (fa) { return toReadonlyArrayO(fa).reduceRight(function (b, a) { return f(a, b); }, b); }; };\n};\n/**\n * Insert a value into a set\n *\n * @since 2.5.0\n */\nexport function insert(E) {\n    var elemE = elem(E);\n    return function (a) { return function (set) {\n        if (!elemE(a)(set)) {\n            var r = new Set(set);\n            r.add(a);\n            return r;\n        }\n        else {\n            return set;\n        }\n    }; };\n}\n/**\n * Delete a value from a set\n *\n * @since 2.5.0\n */\nexport var remove = function (E) {\n    return function (a) {\n        return function (set) {\n            return filter(function (ax) { return !E.equals(a, ax); })(set);\n        };\n    };\n};\n/**\n * Checks an element is a member of a set;\n * If yes, removes the value from the set\n * If no, inserts the value to the set\n *\n * @since 2.10.0\n */\nexport var toggle = function (E) {\n    var elemE = elem(E);\n    var removeE = remove(E);\n    var insertE = insert(E);\n    return function (a) { return function (set) { return (elemE(a, set) ? removeE : insertE)(a)(set); }; };\n};\n/**\n * @since 2.5.0\n */\nexport var compact = function (E) { return filterMap(E)(identity); };\n/**\n * @since 2.5.0\n */\nexport function separate(EE, EA) {\n    return function (fa) {\n        var elemEE = elem(EE);\n        var elemEA = elem(EA);\n        var left = new Set();\n        var right = new Set();\n        fa.forEach(function (e) {\n            switch (e._tag) {\n                case 'Left':\n                    if (!elemEE(e.left, left)) {\n                        left.add(e.left);\n                    }\n                    break;\n                case 'Right':\n                    if (!elemEA(e.right, right)) {\n                        right.add(e.right);\n                    }\n                    break;\n            }\n        });\n        return separated(left, right);\n    };\n}\n/**\n * @since 2.5.0\n */\nexport function filterMap(E) {\n    var elemE = elem(E);\n    return function (f) { return function (fa) {\n        var r = new Set();\n        fa.forEach(function (a) {\n            var ob = f(a);\n            if (ob._tag === 'Some' && !elemE(ob.value, r)) {\n                r.add(ob.value);\n            }\n        });\n        return r;\n    }; };\n}\n// -------------------------------------------------------------------------------------\n// utils\n// -------------------------------------------------------------------------------------\n/**\n * @since 2.5.0\n */\nexport var empty = new Set();\n/**\n * Test whether a `ReadonlySet` is empty.\n *\n * @since 2.10.0\n */\nexport var isEmpty = function (set) { return set.size === 0; };\n/**\n * Calculate the number of elements in a `ReadonlySet`.\n *\n * @since 2.10.0\n */\nexport var size = function (set) { return set.size; };\n/**\n * @since 2.5.0\n */\nexport var some = function (predicate) {\n    return function (set) {\n        var values = set.values();\n        var e;\n        var found = false;\n        while (!found && !(e = values.next()).done) {\n            found = predicate(e.value);\n        }\n        return found;\n    };\n};\nexport function every(predicate) {\n    return not(some(not(predicate)));\n}\nexport function isSubset(E) {\n    var elemE = elem(E);\n    return function (me, that) {\n        if (that === undefined) {\n            var isSubsetE_1 = isSubset(E);\n            return function (that) { return isSubsetE_1(that, me); };\n        }\n        return every(function (a) { return elemE(a, that); })(me);\n    };\n}\nexport function elem(E) {\n    return function (a, set) {\n        if (set === undefined) {\n            var elemE_1 = elem(E);\n            return function (set) { return elemE_1(a, set); };\n        }\n        var values = set.values();\n        var e;\n        var found = false;\n        while (!found && !(e = values.next()).done) {\n            found = E.equals(a, e.value);\n        }\n        return found;\n    };\n}\n/**\n * Get a sorted `ReadonlyArray` of the values contained in a `ReadonlySet`.\n *\n * @category conversions\n * @since 2.5.0\n */\nexport var toReadonlyArray = function (O) {\n    return function (set) {\n        var out = [];\n        set.forEach(function (e) { return out.push(e); });\n        return out.sort(O.compare);\n    };\n};\n/**\n * @category type lambdas\n * @since 2.11.0\n */\nexport var URI = 'ReadonlySet';\n/**\n * @category instances\n * @since 2.5.0\n */\nexport function getShow(S) {\n    return {\n        show: function (s) {\n            var entries = [];\n            s.forEach(function (a) {\n                entries.push(S.show(a));\n            });\n            return \"new Set([\".concat(entries.sort().join(', '), \"])\");\n        }\n    };\n}\n/**\n * @category instances\n * @since 2.5.0\n */\nexport function getEq(E) {\n    var subsetE = isSubset(E);\n    return fromEquals(function (x, y) { return subsetE(x, y) && subsetE(y, x); });\n}\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getUnionSemigroup = function (E) { return ({\n    concat: union(E)\n}); };\n/**\n * @category instances\n * @since 2.5.0\n */\nexport var getUnionMonoid = function (E) { return ({\n    concat: getUnionSemigroup(E).concat,\n    empty: empty\n}); };\n/**\n * @category instances\n * @since 2.5.0\n */\nexport var getIntersectionSemigroup = function (E) { return ({\n    concat: intersection(E)\n}); };\n/**\n * @category instances\n * @since 2.11.0\n */\nexport var getDifferenceMagma = function (E) { return ({\n    concat: difference(E)\n}); };\n// -------------------------------------------------------------------------------------\n// deprecated\n// -------------------------------------------------------------------------------------\n/**\n * Use [`fromReadonlyArray`](#fromreadonlyarray) instead.\n *\n * @category zone of death\n * @since 2.5.0\n * @deprecated\n */\nexport var fromArray = fromReadonlyArray;\n"],"names":["e","separated","that","b","identity","not","set","fromEquals"],"mappings":";;;;;;AAQU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,IAAI,IAAI,CAAC;AAAK;AAU/C,IAAC,YAAY,SAAU,GAAG;AAAE,SAAO,oBAAI,IAAI,CAAC,CAAC,CAAC;AAAK;AAOnD,IAAC,oBAAoB,SAAU,GAAG;AACxC,SAAO,SAAU,IAAI;AACjB,QAAI,MAAM,GAAG;AACb,QAAI,MAAM,oBAAI;AACd,QAAI,MAAM,KAAK,CAAC;AAChB,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,UAAI,IAAI,GAAG,CAAC;AACZ,UAAI,CAAC,IAAI,GAAG,GAAG,GAAG;AACd,YAAI,IAAI,CAAC;AAAA,MACZ;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AAKO,SAAS,MAAM,GAAG;AACrB,SAAO,IAAI,IAAI,CAAC;AACpB;AAMO,SAAS,IAAI,GAAG;AACnB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,IAAI,oBAAI;AACZ,UAAI,QAAQ,SAAU,GAAG;AACrB,YAAI,IAAI,EAAE,CAAC;AACX,YAAI,CAAC,MAAM,GAAG,CAAC,GAAG;AACd,YAAE,IAAI,CAAC;AAAA,QACV;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAIO,SAAS,MAAM,GAAG;AACrB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,IAAI,oBAAI;AACZ,UAAI,QAAQ,SAAU,GAAG;AACrB,UAAE,CAAC,EAAE,QAAQ,SAAUA,IAAG;AACtB,cAAI,CAAC,MAAMA,IAAG,CAAC,GAAG;AACd,cAAE,IAAIA,EAAC;AAAA,UACV;AAAA,QACjB,CAAa;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AACO,SAAS,OAAO,WAAW;AAC9B,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,IAAI,oBAAI;AACZ,WAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,UAAI,IAAI,EAAE;AACV,UAAI,UAAU,CAAC,GAAG;AACd,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACJ;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,UAAU,WAAW;AACjC,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ,oBAAI;AAChB,QAAI,OAAO,oBAAI;AACf,WAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,UAAI,IAAI,EAAE;AACV,UAAI,UAAU,CAAC,GAAG;AACd,cAAM,IAAI,CAAC;AAAA,MACd,OACI;AACD,aAAK,IAAI,CAAC;AAAA,MACb;AAAA,IACJ;AACD,WAAOC,UAAS,UAAC,MAAM,KAAK;AAAA,EACpC;AACA;AACO,SAAS,MAAM,GAAG;AACrB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,WAAW,MAAM,CAAC;AACtB,aAAO,SAAUC,OAAM;AAAE,eAAO,SAAS,IAAIA,KAAI;AAAA;IACpD;AACD,QAAI,QAAQ,EAAE,GAAG;AACb,aAAO;AAAA,IACV;AACD,QAAI,QAAQ,IAAI,GAAG;AACf,aAAO;AAAA,IACV;AACD,QAAI,IAAI,IAAI,IAAI,EAAE;AAClB,SAAK,QAAQ,SAAU,GAAG;AACtB,UAAI,CAAC,MAAM,GAAG,CAAC,GAAG;AACd,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACb,CAAS;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,aAAa,GAAG;AAC5B,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,kBAAkB,aAAa,CAAC;AACpC,aAAO,SAAUA,OAAM;AAAE,eAAO,gBAAgBA,OAAM,EAAE;AAAA;IAC3D;AACD,QAAI,QAAQ,EAAE,KAAK,QAAQ,IAAI,GAAG;AAC9B,aAAO;AAAA,IACV;AACD,QAAI,IAAI,oBAAI;AACZ,OAAG,QAAQ,SAAU,GAAG;AACpB,UAAI,MAAM,GAAG,IAAI,GAAG;AAChB,UAAE,IAAI,CAAC;AAAA,MACV;AAAA,IACb,CAAS;AACD,WAAO;AAAA,EACf;AACA;AAIO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,KAAK;AAClB,UAAI,SAAS,IAAI;AACjB,UAAI;AACJ,UAAI,OAAO,oBAAI;AACf,UAAI,QAAQ,oBAAI;AAChB,UAAI,OAAO,KAAK,EAAE;AAClB,UAAI,OAAO,KAAK,EAAE;AAClB,aAAO,EAAE,IAAI,OAAO,KAAI,GAAI,MAAM;AAC9B,YAAI,IAAI,EAAE,EAAE,KAAK;AACjB,gBAAQ,EAAE,MAAI;AAAA,UACV,KAAK;AACD,gBAAI,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG;AACrB,mBAAK,IAAI,EAAE,IAAI;AAAA,YAClB;AACD;AAAA,UACJ,KAAK;AACD,gBAAI,CAAC,KAAK,EAAE,OAAO,KAAK,GAAG;AACvB,oBAAM,IAAI,EAAE,KAAK;AAAA,YACpB;AACD;AAAA,QACP;AAAA,MACJ;AACD,aAAOD,UAAS,UAAC,MAAM,KAAK;AAAA,IACxC;AAAA,EACA;AACA;AACO,SAAS,WAAW,GAAG;AAC1B,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,gBAAgB,WAAW,CAAC;AAChC,aAAO,SAAUC,OAAM;AAAE,eAAO,cAAcA,OAAM,EAAE;AAAA;IACzD;AACD,WAAO,OAAO,SAAU,GAAG;AAAE,aAAO,CAAC,MAAM,GAAG,IAAI;AAAA,KAAI,EAAE,EAAE;AAAA,EAClE;AACA;AAIO,SAAS,OAAO,GAAG;AACtB,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,OAAO,GAAG,CAAC;AAAA,IAAE;AAAA,EAAG;AAChG;AAIO,SAAS,QAAQ,GAAG,GAAG;AAC1B,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,OAAO,SAAU,GAAG,GAAG;AAAE,eAAO,EAAE,OAAO,GAAG,EAAE,CAAC,CAAC;AAAA,MAAI,GAAE,EAAE,KAAK;AAAA,IAAE;AAAA,EAAG;AAC/I;AAKU,IAAC,cAAc,SAAU,GAAG;AAClC,MAAI,mBAAmB,gBAAgB,CAAC;AACxC,SAAO,SAAU,GAAG,GAAG;AAAE,WAAO,SAAU,IAAI;AAAE,aAAO,iBAAiB,EAAE,EAAE,YAAY,SAAUC,IAAG,GAAG;AAAE,eAAO,EAAE,GAAGA,EAAC;AAAA,MAAE,GAAI,CAAC;AAAA,IAAI;AAAA;AACtI;AAMO,SAAS,OAAO,GAAG;AACtB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AACxC,UAAI,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG;AAChB,YAAI,IAAI,IAAI,IAAI,GAAG;AACnB,UAAE,IAAI,CAAC;AACP,eAAO;AAAA,MACV,OACI;AACD,eAAO;AAAA,MACV;AAAA,IACJ;AAAA;AACL;AAMU,IAAC,SAAS,SAAU,GAAG;AAC7B,SAAO,SAAU,GAAG;AAChB,WAAO,SAAU,KAAK;AAClB,aAAO,OAAO,SAAU,IAAI;AAAE,eAAO,CAAC,EAAE,OAAO,GAAG,EAAE;AAAA,OAAI,EAAE,GAAG;AAAA,IACzE;AAAA,EACA;AACA;AAQU,IAAC,SAAS,SAAU,GAAG;AAC7B,MAAI,QAAQ,KAAK,CAAC;AAClB,MAAI,UAAU,OAAO,CAAC;AACtB,MAAI,UAAU,OAAO,CAAC;AACtB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,KAAK;AAAE,cAAQ,MAAM,GAAG,GAAG,IAAI,UAAU,SAAS,CAAC,EAAE,GAAG;AAAA,IAAI;AAAA;AACvG;AAIU,IAAC,UAAU,SAAU,GAAG;AAAE,SAAO,UAAU,CAAC,EAAEC,UAAQ,QAAA;AAAK;AAI9D,SAAS,SAAS,IAAI,IAAI;AAC7B,SAAO,SAAU,IAAI;AACjB,QAAI,SAAS,KAAK,EAAE;AACpB,QAAI,SAAS,KAAK,EAAE;AACpB,QAAI,OAAO,oBAAI;AACf,QAAI,QAAQ,oBAAI;AAChB,OAAG,QAAQ,SAAU,GAAG;AACpB,cAAQ,EAAE,MAAI;AAAA,QACV,KAAK;AACD,cAAI,CAAC,OAAO,EAAE,MAAM,IAAI,GAAG;AACvB,iBAAK,IAAI,EAAE,IAAI;AAAA,UAClB;AACD;AAAA,QACJ,KAAK;AACD,cAAI,CAAC,OAAO,EAAE,OAAO,KAAK,GAAG;AACzB,kBAAM,IAAI,EAAE,KAAK;AAAA,UACpB;AACD;AAAA,MACP;AAAA,IACb,CAAS;AACD,WAAOH,UAAS,UAAC,MAAM,KAAK;AAAA,EACpC;AACA;AAIO,SAAS,UAAU,GAAG;AACzB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,GAAG;AAAE,WAAO,SAAU,IAAI;AACvC,UAAI,IAAI,oBAAI;AACZ,SAAG,QAAQ,SAAU,GAAG;AACpB,YAAI,KAAK,EAAE,CAAC;AACZ,YAAI,GAAG,SAAS,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG;AAC3C,YAAE,IAAI,GAAG,KAAK;AAAA,QACjB;AAAA,MACb,CAAS;AACD,aAAO;AAAA,IACV;AAAA;AACL;AAOU,IAAC,QAAQ,oBAAI,IAAM;AAMnB,IAAC,UAAU,SAAU,KAAK;AAAE,SAAO,IAAI,SAAS;AAAK;AAMrD,IAAC,OAAO,SAAU,KAAK;AAAE,SAAO,IAAI;AAAQ;AAI5C,IAAC,OAAO,SAAU,WAAW;AACnC,SAAO,SAAU,KAAK;AAClB,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ;AACZ,WAAO,CAAC,SAAS,EAAE,IAAI,OAAO,KAAM,GAAE,MAAM;AACxC,cAAQ,UAAU,EAAE,KAAK;AAAA,IAC5B;AACD,WAAO;AAAA,EACf;AACA;AACO,SAAS,MAAM,WAAW;AAC7B,SAAOI,UAAG,IAAC,KAAKA,UAAG,IAAC,SAAS,CAAC,CAAC;AACnC;AACO,SAAS,SAAS,GAAG;AACxB,MAAI,QAAQ,KAAK,CAAC;AAClB,SAAO,SAAU,IAAI,MAAM;AACvB,QAAI,SAAS,QAAW;AACpB,UAAI,cAAc,SAAS,CAAC;AAC5B,aAAO,SAAUH,OAAM;AAAE,eAAO,YAAYA,OAAM,EAAE;AAAA;IACvD;AACD,WAAO,MAAM,SAAU,GAAG;AAAE,aAAO,MAAM,GAAG,IAAI;AAAA,IAAE,CAAE,EAAE,EAAE;AAAA,EAChE;AACA;AACO,SAAS,KAAK,GAAG;AACpB,SAAO,SAAU,GAAG,KAAK;AACrB,QAAI,QAAQ,QAAW;AACnB,UAAI,UAAU,KAAK,CAAC;AACpB,aAAO,SAAUI,MAAK;AAAE,eAAO,QAAQ,GAAGA,IAAG;AAAA;IAChD;AACD,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ;AACZ,WAAO,CAAC,SAAS,EAAE,IAAI,OAAO,KAAM,GAAE,MAAM;AACxC,cAAQ,EAAE,OAAO,GAAG,EAAE,KAAK;AAAA,IAC9B;AACD,WAAO;AAAA,EACf;AACA;AAOU,IAAC,kBAAkB,SAAU,GAAG;AACtC,SAAO,SAAU,KAAK;AAClB,QAAI,MAAM,CAAA;AACV,QAAI,QAAQ,SAAU,GAAG;AAAE,aAAO,IAAI,KAAK,CAAC;AAAA,IAAE,CAAE;AAChD,WAAO,IAAI,KAAK,EAAE,OAAO;AAAA,EACjC;AACA;AAKU,IAAC,MAAM;AAKV,SAAS,QAAQ,GAAG;AACvB,SAAO;AAAA,IACH,MAAM,SAAU,GAAG;AACf,UAAI,UAAU,CAAA;AACd,QAAE,QAAQ,SAAU,GAAG;AACnB,gBAAQ,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,MACtC,CAAa;AACD,aAAO,YAAY,OAAO,QAAQ,KAAM,EAAC,KAAK,IAAI,GAAG,IAAI;AAAA,IAC5D;AAAA,EACT;AACA;AAKO,SAAS,MAAM,GAAG;AACrB,MAAI,UAAU,SAAS,CAAC;AACxB,SAAOC,GAAU,WAAC,SAAU,GAAG,GAAG;AAAE,WAAO,QAAQ,GAAG,CAAC,KAAK,QAAQ,GAAG,CAAC;AAAA,EAAI,CAAA;AAChF;AAKU,IAAC,oBAAoB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAClD,QAAQ,MAAM,CAAC;AAAA,EACnB;AAAM;AAKI,IAAC,iBAAiB,SAAU,GAAG;AAAE,SAAQ;AAAA,IAC/C,QAAQ,kBAAkB,CAAC,EAAE;AAAA,IAC7B;AAAA,EACJ;AAAM;AAKI,IAAC,2BAA2B,SAAU,GAAG;AAAE,SAAQ;AAAA,IACzD,QAAQ,aAAa,CAAC;AAAA,EAC1B;AAAM;AAKI,IAAC,qBAAqB,SAAU,GAAG;AAAE,SAAQ;AAAA,IACnD,QAAQ,WAAW,CAAC;AAAA,EACxB;AAAM;AAWI,IAAC,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}