Add files using upload-large-folder tool

backend/node_modules/effect/dist/cjs/Arbitrary.js

@@ -0,0 +1,813 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.makeStringConstraints = exports.makeNumberConstraints = exports.makeLazy = exports.makeDateConstraints = exports.makeBigIntConstraints = exports.makeArrayConstraints = exports.make = exports.getDescription = void 0;
+var Arr = _interopRequireWildcard(require("./Array.js"));
+var FastCheck = _interopRequireWildcard(require("./FastCheck.js"));
+var _GlobalValue = require("./GlobalValue.js");
+var errors_ = _interopRequireWildcard(require("./internal/schema/errors.js"));
+var schemaId_ = _interopRequireWildcard(require("./internal/schema/schemaId.js"));
+var util_ = _interopRequireWildcard(require("./internal/schema/util.js"));
+var Option = _interopRequireWildcard(require("./Option.js"));
+var Predicate = _interopRequireWildcard(require("./Predicate.js"));
+var SchemaAST = _interopRequireWildcard(require("./SchemaAST.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 3.10.0
+ */
+
+/**
+ * Returns a LazyArbitrary for the `A` type of the provided schema.
+ *
+ * @category arbitrary
+ * @since 3.10.0
+ */
+const makeLazy = schema => {
+  const description = getDescription(schema.ast, []);
+  return go(description, {
+    maxDepth: 2
+  });
+};
+/**
+ * Returns a fast-check Arbitrary for the `A` type of the provided schema.
+ *
+ * @category arbitrary
+ * @since 3.10.0
+ */
+exports.makeLazy = makeLazy;
+const make = schema => makeLazy(schema)(FastCheck);
+/** @internal */
+exports.make = make;
+const makeStringConstraints = options => {
+  const out = {
+    _tag: "StringConstraints",
+    constraints: {}
+  };
+  if (Predicate.isNumber(options.minLength)) {
+    out.constraints.minLength = options.minLength;
+  }
+  if (Predicate.isNumber(options.maxLength)) {
+    out.constraints.maxLength = options.maxLength;
+  }
+  if (Predicate.isString(options.pattern)) {
+    out.pattern = options.pattern;
+  }
+  return out;
+};
+/** @internal */
+exports.makeStringConstraints = makeStringConstraints;
+const makeNumberConstraints = options => {
+  const out = {
+    _tag: "NumberConstraints",
+    constraints: {},
+    isInteger: options.isInteger ?? false
+  };
+  if (Predicate.isNumber(options.min)) {
+    out.constraints.min = Math.fround(options.min);
+  }
+  if (Predicate.isBoolean(options.minExcluded)) {
+    out.constraints.minExcluded = options.minExcluded;
+  }
+  if (Predicate.isNumber(options.max)) {
+    out.constraints.max = Math.fround(options.max);
+  }
+  if (Predicate.isBoolean(options.maxExcluded)) {
+    out.constraints.maxExcluded = options.maxExcluded;
+  }
+  if (Predicate.isBoolean(options.noNaN)) {
+    out.constraints.noNaN = options.noNaN;
+  }
+  if (Predicate.isBoolean(options.noDefaultInfinity)) {
+    out.constraints.noDefaultInfinity = options.noDefaultInfinity;
+  }
+  return out;
+};
+/** @internal */
+exports.makeNumberConstraints = makeNumberConstraints;
+const makeBigIntConstraints = options => {
+  const out = {
+    _tag: "BigIntConstraints",
+    constraints: {}
+  };
+  if (Predicate.isBigInt(options.min)) {
+    out.constraints.min = options.min;
+  }
+  if (Predicate.isBigInt(options.max)) {
+    out.constraints.max = options.max;
+  }
+  return out;
+};
+/** @internal */
+exports.makeBigIntConstraints = makeBigIntConstraints;
+const makeArrayConstraints = options => {
+  const out = {
+    _tag: "ArrayConstraints",
+    constraints: {}
+  };
+  if (Predicate.isNumber(options.minLength)) {
+    out.constraints.minLength = options.minLength;
+  }
+  if (Predicate.isNumber(options.maxLength)) {
+    out.constraints.maxLength = options.maxLength;
+  }
+  return out;
+};
+/** @internal */
+exports.makeArrayConstraints = makeArrayConstraints;
+const makeDateConstraints = options => {
+  const out = {
+    _tag: "DateConstraints",
+    constraints: {}
+  };
+  if (Predicate.isDate(options.min)) {
+    out.constraints.min = options.min;
+  }
+  if (Predicate.isDate(options.max)) {
+    out.constraints.max = options.max;
+  }
+  if (Predicate.isBoolean(options.noInvalidDate)) {
+    out.constraints.noInvalidDate = options.noInvalidDate;
+  }
+  return out;
+};
+exports.makeDateConstraints = makeDateConstraints;
+const getArbitraryAnnotation = /*#__PURE__*/SchemaAST.getAnnotation(SchemaAST.ArbitraryAnnotationId);
+const getASTConstraints = ast => {
+  const TypeAnnotationId = ast.annotations[SchemaAST.SchemaIdAnnotationId];
+  if (Predicate.isPropertyKey(TypeAnnotationId)) {
+    const out = ast.annotations[TypeAnnotationId];
+    if (Predicate.isReadonlyRecord(out)) {
+      return out;
+    }
+  }
+};
+const idMemoMap = /*#__PURE__*/(0, _GlobalValue.globalValue)(/*#__PURE__*/Symbol.for("effect/Arbitrary/IdMemoMap"), () => new Map());
+let counter = 0;
+function wrapGetDescription(f, g) {
+  return (ast, path) => f(ast, g(ast, path));
+}
+function parseMeta(ast) {
+  const jsonSchema = SchemaAST.getJSONSchemaAnnotation(ast).pipe(Option.filter(Predicate.isReadonlyRecord), Option.getOrUndefined);
+  const schemaId = Option.getOrElse(SchemaAST.getSchemaIdAnnotation(ast), () => undefined);
+  const schemaParams = Option.fromNullable(schemaId).pipe(Option.map(id => ast.annotations[id]), Option.filter(Predicate.isReadonlyRecord), Option.getOrUndefined);
+  return [schemaId, {
+    ...schemaParams,
+    ...jsonSchema
+  }];
+}
+/** @internal */
+const getDescription = exports.getDescription = /*#__PURE__*/wrapGetDescription((ast, description) => {
+  const annotation = getArbitraryAnnotation(ast);
+  if (Option.isSome(annotation)) {
+    return {
+      ...description,
+      annotations: [...description.annotations, annotation.value]
+    };
+  }
+  return description;
+}, (ast, path) => {
+  const [schemaId, meta] = parseMeta(ast);
+  switch (ast._tag) {
+    case "Refinement":
+      {
+        const from = getDescription(ast.from, path);
+        switch (from._tag) {
+          case "StringKeyword":
+            return {
+              ...from,
+              constraints: [...from.constraints, makeStringConstraints(meta)],
+              refinements: [...from.refinements, ast]
+            };
+          case "NumberKeyword":
+            {
+              const c = schemaId === schemaId_.NonNaNSchemaId ? makeNumberConstraints({
+                noNaN: true
+              }) : schemaId === schemaId_.FiniteSchemaId || schemaId === schemaId_.JsonNumberSchemaId ? makeNumberConstraints({
+                noDefaultInfinity: true,
+                noNaN: true
+              }) : makeNumberConstraints({
+                isInteger: "type" in meta && meta.type === "integer",
+                noNaN: undefined,
+                noDefaultInfinity: undefined,
+                min: meta.exclusiveMinimum ?? meta.minimum,
+                minExcluded: "exclusiveMinimum" in meta ? true : undefined,
+                max: meta.exclusiveMaximum ?? meta.maximum,
+                maxExcluded: "exclusiveMaximum" in meta ? true : undefined
+              });
+              return {
+                ...from,
+                constraints: [...from.constraints, c],
+                refinements: [...from.refinements, ast]
+              };
+            }
+          case "BigIntKeyword":
+            {
+              const c = getASTConstraints(ast);
+              return {
+                ...from,
+                constraints: c !== undefined ? [...from.constraints, makeBigIntConstraints(c)] : from.constraints,
+                refinements: [...from.refinements, ast]
+              };
+            }
+          case "TupleType":
+            return {
+              ...from,
+              constraints: [...from.constraints, makeArrayConstraints({
+                minLength: meta.minItems,
+                maxLength: meta.maxItems
+              })],
+              refinements: [...from.refinements, ast]
+            };
+          case "DateFromSelf":
+            return {
+              ...from,
+              constraints: [...from.constraints, makeDateConstraints(meta)],
+              refinements: [...from.refinements, ast]
+            };
+          default:
+            return {
+              ...from,
+              refinements: [...from.refinements, ast]
+            };
+        }
+      }
+    case "Declaration":
+      {
+        if (schemaId === schemaId_.DateFromSelfSchemaId) {
+          return {
+            _tag: "DateFromSelf",
+            constraints: [makeDateConstraints(meta)],
+            path,
+            refinements: [],
+            annotations: []
+          };
+        }
+        return {
+          _tag: "Declaration",
+          typeParameters: ast.typeParameters.map(ast => getDescription(ast, path)),
+          path,
+          refinements: [],
+          annotations: [],
+          ast
+        };
+      }
+    case "Literal":
+      {
+        return {
+          _tag: "Literal",
+          literal: ast.literal,
+          path,
+          refinements: [],
+          annotations: []
+        };
+      }
+    case "UniqueSymbol":
+      {
+        return {
+          _tag: "UniqueSymbol",
+          symbol: ast.symbol,
+          path,
+          refinements: [],
+          annotations: []
+        };
+      }
+    case "Enums":
+      {
+        return {
+          _tag: "Enums",
+          enums: ast.enums,
+          path,
+          refinements: [],
+          annotations: [],
+          ast
+        };
+      }
+    case "TemplateLiteral":
+      {
+        return {
+          _tag: "TemplateLiteral",
+          head: ast.head,
+          spans: ast.spans.map(span => ({
+            description: getDescription(span.type, path),
+            literal: span.literal
+          })),
+          path,
+          refinements: [],
+          annotations: []
+        };
+      }
+    case "StringKeyword":
+      return {
+        _tag: "StringKeyword",
+        constraints: [],
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "NumberKeyword":
+      return {
+        _tag: "NumberKeyword",
+        constraints: [],
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "BigIntKeyword":
+      return {
+        _tag: "BigIntKeyword",
+        constraints: [],
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "TupleType":
+      return {
+        _tag: "TupleType",
+        constraints: [],
+        elements: ast.elements.map((element, i) => ({
+          isOptional: element.isOptional,
+          description: getDescription(element.type, [...path, i])
+        })),
+        rest: ast.rest.map((element, i) => getDescription(element.type, [...path, i])),
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "TypeLiteral":
+      return {
+        _tag: "TypeLiteral",
+        propertySignatures: ast.propertySignatures.map(ps => ({
+          isOptional: ps.isOptional,
+          name: ps.name,
+          value: getDescription(ps.type, [...path, ps.name])
+        })),
+        indexSignatures: ast.indexSignatures.map(is => ({
+          parameter: getDescription(is.parameter, path),
+          value: getDescription(is.type, path)
+        })),
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "Union":
+      return {
+        _tag: "Union",
+        members: ast.types.map((member, i) => getDescription(member, [...path, i])),
+        path,
+        refinements: [],
+        annotations: []
+      };
+    case "Suspend":
+      {
+        const memoId = idMemoMap.get(ast);
+        if (memoId !== undefined) {
+          return {
+            _tag: "Ref",
+            id: memoId,
+            ast,
+            path,
+            refinements: [],
+            annotations: []
+          };
+        }
+        counter++;
+        const id = `__id-${counter}__`;
+        idMemoMap.set(ast, id);
+        return {
+          _tag: "Suspend",
+          id,
+          ast,
+          description: () => getDescription(ast.f(), path),
+          path,
+          refinements: [],
+          annotations: []
+        };
+      }
+    case "Transformation":
+      return getDescription(ast.to, path);
+    case "NeverKeyword":
+      return {
+        _tag: "NeverKeyword",
+        path,
+        refinements: [],
+        annotations: [],
+        ast
+      };
+    default:
+      {
+        return {
+          _tag: "Keyword",
+          value: ast._tag,
+          path,
+          refinements: [],
+          annotations: []
+        };
+      }
+  }
+});
+function getMax(n1, n2) {
+  return n1 === undefined ? n2 : n2 === undefined ? n1 : n1 <= n2 ? n2 : n1;
+}
+function getMin(n1, n2) {
+  return n1 === undefined ? n2 : n2 === undefined ? n1 : n1 <= n2 ? n1 : n2;
+}
+const getOr = (a, b) => {
+  return a === undefined ? b : b === undefined ? a : a || b;
+};
+function mergePattern(pattern1, pattern2) {
+  if (pattern1 === undefined) {
+    return pattern2;
+  }
+  if (pattern2 === undefined) {
+    return pattern1;
+  }
+  return `(?:${pattern1})|(?:${pattern2})`;
+}
+function mergeStringConstraints(c1, c2) {
+  return makeStringConstraints({
+    minLength: getMax(c1.constraints.minLength, c2.constraints.minLength),
+    maxLength: getMin(c1.constraints.maxLength, c2.constraints.maxLength),
+    pattern: mergePattern(c1.pattern, c2.pattern)
+  });
+}
+function buildStringConstraints(description) {
+  return description.constraints.length === 0 ? undefined : description.constraints.reduce(mergeStringConstraints);
+}
+function mergeNumberConstraints(c1, c2) {
+  return makeNumberConstraints({
+    isInteger: c1.isInteger || c2.isInteger,
+    min: getMax(c1.constraints.min, c2.constraints.min),
+    minExcluded: getOr(c1.constraints.minExcluded, c2.constraints.minExcluded),
+    max: getMin(c1.constraints.max, c2.constraints.max),
+    maxExcluded: getOr(c1.constraints.maxExcluded, c2.constraints.maxExcluded),
+    noNaN: getOr(c1.constraints.noNaN, c2.constraints.noNaN),
+    noDefaultInfinity: getOr(c1.constraints.noDefaultInfinity, c2.constraints.noDefaultInfinity)
+  });
+}
+function buildNumberConstraints(description) {
+  return description.constraints.length === 0 ? undefined : description.constraints.reduce(mergeNumberConstraints);
+}
+function mergeBigIntConstraints(c1, c2) {
+  return makeBigIntConstraints({
+    min: getMax(c1.constraints.min, c2.constraints.min),
+    max: getMin(c1.constraints.max, c2.constraints.max)
+  });
+}
+function buildBigIntConstraints(description) {
+  return description.constraints.length === 0 ? undefined : description.constraints.reduce(mergeBigIntConstraints);
+}
+function mergeDateConstraints(c1, c2) {
+  return makeDateConstraints({
+    min: getMax(c1.constraints.min, c2.constraints.min),
+    max: getMin(c1.constraints.max, c2.constraints.max),
+    noInvalidDate: getOr(c1.constraints.noInvalidDate, c2.constraints.noInvalidDate)
+  });
+}
+function buildDateConstraints(description) {
+  return description.constraints.length === 0 ? undefined : description.constraints.reduce(mergeDateConstraints);
+}
+const constArrayConstraints = /*#__PURE__*/makeArrayConstraints({});
+function mergeArrayConstraints(c1, c2) {
+  return makeArrayConstraints({
+    minLength: getMax(c1.constraints.minLength, c2.constraints.minLength),
+    maxLength: getMin(c1.constraints.maxLength, c2.constraints.maxLength)
+  });
+}
+function buildArrayConstraints(description) {
+  return description.constraints.length === 0 ? undefined : description.constraints.reduce(mergeArrayConstraints);
+}
+const arbitraryMemoMap = /*#__PURE__*/(0, _GlobalValue.globalValue)(/*#__PURE__*/Symbol.for("effect/Arbitrary/arbitraryMemoMap"), () => new WeakMap());
+function applyFilters(filters, arb) {
+  return fc => filters.reduce((arb, filter) => arb.filter(filter), arb(fc));
+}
+function absurd(message) {
+  return () => {
+    throw new Error(message);
+  };
+}
+function getContextConstraints(description) {
+  switch (description._tag) {
+    case "StringKeyword":
+      return buildStringConstraints(description);
+    case "NumberKeyword":
+      return buildNumberConstraints(description);
+    case "BigIntKeyword":
+      return buildBigIntConstraints(description);
+    case "DateFromSelf":
+      return buildDateConstraints(description);
+    case "TupleType":
+      return buildArrayConstraints(description);
+  }
+}
+function wrapGo(f, g) {
+  return (description, ctx) => f(description, ctx, g(description, ctx));
+}
+const go = /*#__PURE__*/wrapGo((description, ctx, lazyArb) => {
+  const annotation = description.annotations[description.annotations.length - 1];
+  // error handling
+  if (annotation === undefined) {
+    switch (description._tag) {
+      case "Declaration":
+      case "NeverKeyword":
+        throw new Error(errors_.getArbitraryMissingAnnotationErrorMessage(description.path, description.ast));
+      case "Enums":
+        if (description.enums.length === 0) {
+          throw new Error(errors_.getArbitraryEmptyEnumErrorMessage(description.path));
+        }
+    }
+  }
+  const filters = description.refinements.map(ast => a => Option.isNone(ast.filter(a, SchemaAST.defaultParseOption, ast)));
+  if (annotation === undefined) {
+    return applyFilters(filters, lazyArb);
+  }
+  const constraints = getContextConstraints(description);
+  if (constraints !== undefined) {
+    ctx = {
+      ...ctx,
+      constraints
+    };
+  }
+  if (description._tag === "Declaration") {
+    return applyFilters(filters, annotation(...description.typeParameters.map(p => go(p, ctx)), ctx));
+  }
+  if (description.refinements.length > 0) {
+    // TODO(4.0): remove the `lazyArb` parameter
+    return applyFilters(filters, annotation(lazyArb, ctx));
+  }
+  return annotation(ctx);
+}, (description, ctx) => {
+  switch (description._tag) {
+    case "DateFromSelf":
+      {
+        const constraints = buildDateConstraints(description);
+        return fc => fc.date(constraints?.constraints);
+      }
+    case "Declaration":
+    case "NeverKeyword":
+      return absurd(`BUG: cannot generate an arbitrary for ${description._tag}`);
+    case "Literal":
+      return fc => fc.constant(description.literal);
+    case "UniqueSymbol":
+      return fc => fc.constant(description.symbol);
+    case "Keyword":
+      {
+        switch (description.value) {
+          case "UndefinedKeyword":
+            return fc => fc.constant(undefined);
+          case "VoidKeyword":
+          case "UnknownKeyword":
+          case "AnyKeyword":
+            return fc => fc.anything();
+          case "BooleanKeyword":
+            return fc => fc.boolean();
+          case "SymbolKeyword":
+            return fc => fc.string().map(s => Symbol.for(s));
+          case "ObjectKeyword":
+            return fc => fc.oneof(fc.object(), fc.array(fc.anything()));
+        }
+      }
+    case "Enums":
+      return fc => fc.oneof(...description.enums.map(([_, value]) => fc.constant(value)));
+    case "TemplateLiteral":
+      {
+        return fc => {
+          const string = fc.string({
+            maxLength: 5
+          });
+          const number = fc.float({
+            noDefaultInfinity: true,
+            noNaN: true
+          });
+          const getTemplateLiteralArb = description => {
+            const components = description.head !== "" ? [fc.constant(description.head)] : [];
+            const getTemplateLiteralSpanTypeArb = description => {
+              switch (description._tag) {
+                case "StringKeyword":
+                  return string;
+                case "NumberKeyword":
+                  return number;
+                case "Literal":
+                  return fc.constant(String(description.literal));
+                case "Union":
+                  return fc.oneof(...description.members.map(getTemplateLiteralSpanTypeArb));
+                case "TemplateLiteral":
+                  return getTemplateLiteralArb(description);
+                default:
+                  return fc.constant("");
+              }
+            };
+            description.spans.forEach(span => {
+              components.push(getTemplateLiteralSpanTypeArb(span.description));
+              if (span.literal !== "") {
+                components.push(fc.constant(span.literal));
+              }
+            });
+            return fc.tuple(...components).map(spans => spans.join(""));
+          };
+          return getTemplateLiteralArb(description);
+        };
+      }
+    case "StringKeyword":
+      {
+        const constraints = buildStringConstraints(description);
+        const pattern = constraints?.pattern;
+        return pattern !== undefined ? fc => fc.stringMatching(new RegExp(pattern)) : fc => fc.string(constraints?.constraints);
+      }
+    case "NumberKeyword":
+      {
+        const constraints = buildNumberConstraints(description);
+        return constraints?.isInteger ? fc => fc.integer(constraints.constraints) : fc => fc.float(constraints?.constraints);
+      }
+    case "BigIntKeyword":
+      {
+        const constraints = buildBigIntConstraints(description);
+        return fc => fc.bigInt(constraints?.constraints ?? {});
+      }
+    case "TupleType":
+      {
+        const elements = [];
+        let hasOptionals = false;
+        for (const element of description.elements) {
+          elements.push(go(element.description, ctx));
+          if (element.isOptional) {
+            hasOptionals = true;
+          }
+        }
+        const rest = description.rest.map(d => go(d, ctx));
+        return fc => {
+          // ---------------------------------------------
+          // handle elements
+          // ---------------------------------------------
+          let output = fc.tuple(...elements.map(arb => arb(fc)));
+          if (hasOptionals) {
+            const indexes = fc.tuple(...description.elements.map(element => element.isOptional ? fc.boolean() : fc.constant(true)));
+            output = output.chain(tuple => indexes.map(booleans => {
+              for (const [i, b] of booleans.reverse().entries()) {
+                if (!b) {
+                  tuple.splice(booleans.length - i, 1);
+                }
+              }
+              return tuple;
+            }));
+          }
+          // ---------------------------------------------
+          // handle rest element
+          // ---------------------------------------------
+          if (Arr.isNonEmptyReadonlyArray(rest)) {
+            const constraints = buildArrayConstraints(description) ?? constArrayConstraints;
+            const [head, ...tail] = rest;
+            const item = head(fc);
+            output = output.chain(as => {
+              const len = as.length;
+              // We must adjust the constraints for the rest element
+              // because the elements might have generated some values
+              const restArrayConstraints = subtractElementsLength(constraints.constraints, len);
+              if (restArrayConstraints.maxLength === 0) {
+                return fc.constant(as);
+              }
+              /*
+                         `getSuspendedArray` is used to generate less values in
+              the context of a recursive schema. Without it, the following schema
+              would generate an big amount of values possibly leading to a stack
+              overflow:
+                         ```ts
+              type A = ReadonlyArray<A | null>
+                         const schema = S.Array(
+                S.NullOr(S.suspend((): S.Schema<A> => schema))
+              )
+              ```
+                       */
+              const arr = ctx.depthIdentifier !== undefined ? getSuspendedArray(fc, ctx.depthIdentifier, ctx.maxDepth, item, restArrayConstraints) : fc.array(item, restArrayConstraints);
+              if (len === 0) {
+                return arr;
+              }
+              return arr.map(rest => [...as, ...rest]);
+            });
+            // ---------------------------------------------
+            // handle post rest elements
+            // ---------------------------------------------
+            for (let j = 0; j < tail.length; j++) {
+              output = output.chain(as => tail[j](fc).map(a => [...as, a]));
+            }
+          }
+          return output;
+        };
+      }
+    case "TypeLiteral":
+      {
+        const propertySignatures = [];
+        const requiredKeys = [];
+        for (const ps of description.propertySignatures) {
+          if (!ps.isOptional) {
+            requiredKeys.push(ps.name);
+          }
+          propertySignatures.push(go(ps.value, ctx));
+        }
+        const indexSignatures = description.indexSignatures.map(is => [go(is.parameter, ctx), go(is.value, ctx)]);
+        return fc => {
+          const pps = {};
+          for (let i = 0; i < propertySignatures.length; i++) {
+            const ps = description.propertySignatures[i];
+            pps[ps.name] = propertySignatures[i](fc);
+          }
+          let output = fc.record(pps, {
+            requiredKeys
+          });
+          // ---------------------------------------------
+          // handle index signatures
+          // ---------------------------------------------
+          for (let i = 0; i < indexSignatures.length; i++) {
+            const key = indexSignatures[i][0](fc);
+            const value = indexSignatures[i][1](fc);
+            output = output.chain(o => {
+              const item = fc.tuple(key, value);
+              /*
+                         `getSuspendedArray` is used to generate less key/value pairs in
+              the context of a recursive schema. Without it, the following schema
+              would generate an big amount of values possibly leading to a stack
+              overflow:
+                         ```ts
+              type A = { [_: string]: A }
+                         const schema = S.Record({ key: S.String, value: S.suspend((): S.Schema<A> => schema) })
+              ```
+                       */
+              const arr = ctx.depthIdentifier !== undefined ? getSuspendedArray(fc, ctx.depthIdentifier, ctx.maxDepth, item, {
+                maxLength: 2
+              }) : fc.array(item);
+              return arr.map(tuples => ({
+                ...Object.fromEntries(tuples),
+                ...o
+              }));
+            });
+          }
+          return output;
+        };
+      }
+    case "Union":
+      {
+        const members = description.members.map(member => go(member, ctx));
+        return fc => fc.oneof(...members.map(arb => arb(fc)));
+      }
+    case "Suspend":
+      {
+        const memo = arbitraryMemoMap.get(description.ast);
+        if (memo) {
+          return memo;
+        }
+        if (ctx.depthIdentifier === undefined) {
+          ctx = {
+            ...ctx,
+            depthIdentifier: description.id
+          };
+        }
+        const get = util_.memoizeThunk(() => {
+          return go(description.description(), ctx);
+        });
+        const out = fc => fc.constant(null).chain(() => get()(fc));
+        arbitraryMemoMap.set(description.ast, out);
+        return out;
+      }
+    case "Ref":
+      {
+        const memo = arbitraryMemoMap.get(description.ast);
+        if (memo) {
+          return memo;
+        }
+        throw new Error(`BUG: Ref ${JSON.stringify(description.id)} not found`);
+      }
+  }
+});
+function subtractElementsLength(constraints, len) {
+  if (len === 0 || constraints.minLength === undefined && constraints.maxLength === undefined) {
+    return constraints;
+  }
+  const out = {
+    ...constraints
+  };
+  if (out.minLength !== undefined) {
+    out.minLength = Math.max(out.minLength - len, 0);
+  }
+  if (out.maxLength !== undefined) {
+    out.maxLength = Math.max(out.maxLength - len, 0);
+  }
+  return out;
+}
+const getSuspendedArray = (fc, depthIdentifier, maxDepth, item, constraints) => {
+  // In the context of a recursive schema, we don't want a `maxLength` greater than 2.
+  // The only exception is when `minLength` is also set, in which case we set
+  // `maxLength` to the minimum value, which is `minLength`.
+  const maxLengthLimit = Math.max(2, constraints.minLength ?? 0);
+  if (constraints.maxLength !== undefined && constraints.maxLength > maxLengthLimit) {
+    constraints = {
+      ...constraints,
+      maxLength: maxLengthLimit
+    };
+  }
+  return fc.oneof({
+    maxDepth,
+    depthIdentifier
+  }, fc.constant([]), fc.array(item, constraints));
+};
+//# sourceMappingURL=Arbitrary.js.map

backend/node_modules/effect/dist/cjs/Array.js

@@ -0,0 +1,2695 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.replaceOption = exports.replace = exports.removeOption = exports.remove = exports.reduceRight = exports.reduce = exports.range = exports.prependAll = exports.prepend = exports.partitionMap = exports.partition = exports.pad = exports.of = exports.modifyOption = exports.modifyNonEmptyLast = exports.modifyNonEmptyHead = exports.modify = exports.min = exports.max = exports.matchRight = exports.matchLeft = exports.match = exports.mapAccum = exports.map = exports.makeBy = exports.make = exports.liftPredicate = exports.liftOption = exports.liftNullable = exports.liftEither = exports.let = exports.length = exports.lastNonEmpty = exports.last = exports.join = exports.isNonEmptyReadonlyArray = exports.isNonEmptyArray = exports.isEmptyReadonlyArray = exports.isEmptyArray = exports.isArray = exports.intersperse = exports.intersectionWith = exports.intersection = exports.insertAt = exports.initNonEmpty = exports.init = exports.headNonEmpty = exports.head = exports.groupWith = exports.groupBy = exports.group = exports.getSomes = exports.getRights = exports.getOrder = exports.getLefts = exports.getEquivalence = exports.get = exports.fromRecord = exports.fromOption = exports.fromNullable = exports.fromIterable = exports.forEach = exports.flatten = exports.flatMapNullable = exports.flatMap = exports.findLastIndex = exports.findLast = exports.findFirstWithIndex = exports.findFirstIndex = exports.findFirst = exports.filterMapWhile = exports.filterMap = exports.filter = exports.extend = exports.every = exports.ensure = exports.empty = exports.dropWhile = exports.dropRight = exports.drop = exports.differenceWith = exports.difference = exports.dedupeWith = exports.dedupeAdjacentWith = exports.dedupeAdjacent = exports.dedupe = exports.countBy = exports.copy = exports.containsWith = exports.contains = exports.chunksOf = exports.chop = exports.cartesianWith = exports.cartesian = exports.bindTo = exports.bind = exports.appendAll = exports.append = exports.allocate = exports.Do = void 0;
+exports.zipWith = exports.zip = exports.window = exports.unzip = exports.unsafeGet = exports.unprepend = exports.unionWith = exports.union = exports.unfold = exports.unappend = exports.takeWhile = exports.takeRight = exports.take = exports.tailNonEmpty = exports.tail = exports.splitWhere = exports.splitNonEmptyAt = exports.splitAt = exports.split = exports.span = exports.sortWith = exports.sortBy = exports.sort = exports.some = exports.setNonEmptyLast = exports.setNonEmptyHead = exports.separate = exports.scanRight = exports.scan = exports.rotate = exports.reverse = exports.replicate = void 0;
+var Either = _interopRequireWildcard(require("./Either.js"));
+var Equal = _interopRequireWildcard(require("./Equal.js"));
+var Equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var internalArray = _interopRequireWildcard(require("./internal/array.js"));
+var internalDoNotation = _interopRequireWildcard(require("./internal/doNotation.js"));
+var moduleIterable = _interopRequireWildcard(require("./Iterable.js"));
+var Option = _interopRequireWildcard(require("./Option.js"));
+var Order = _interopRequireWildcard(require("./Order.js"));
+var Predicate = _interopRequireWildcard(require("./Predicate.js"));
+var Record = _interopRequireWildcard(require("./Record.js"));
+var Tuple = _interopRequireWildcard(require("./Tuple.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This module provides utility functions for working with arrays in TypeScript.
+ *
+ * @since 2.0.0
+ */
+
+/**
+ * Builds a `NonEmptyArray` from an non-empty collection of elements.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.make(1, 2, 3)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const make = (...elements) => elements;
+/**
+ * Creates a new `Array` of the specified length.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.allocate<number>(3)
+ * console.log(result) // [ <3 empty items> ]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.make = make;
+const allocate = n => new Array(n);
+/**
+ * Return a `NonEmptyArray` of length `n` with element `i` initialized with `f(i)`.
+ *
+ * **Note**. `n` is normalized to an integer >= 1.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { makeBy } from "effect/Array"
+ *
+ * const result = makeBy(5, n => n * 2)
+ * console.log(result) // [0, 2, 4, 6, 8]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.allocate = allocate;
+const makeBy = exports.makeBy = /*#__PURE__*/(0, _Function.dual)(2, (n, f) => {
+  const max = Math.max(1, Math.floor(n));
+  const out = new Array(max);
+  for (let i = 0; i < max; i++) {
+    out[i] = f(i);
+  }
+  return out;
+});
+/**
+ * Return a `NonEmptyArray` containing a range of integers, including both endpoints.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { range } from "effect/Array"
+ *
+ * const result = range(1, 3)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const range = (start, end) => start <= end ? makeBy(end - start + 1, i => start + i) : [start];
+/**
+ * Return a `NonEmptyArray` containing a value repeated the specified number of times.
+ *
+ * **Note**. `n` is normalized to an integer >= 1.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.replicate("a", 3)
+ * console.log(result) // ["a", "a", "a"]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.range = range;
+const replicate = exports.replicate = /*#__PURE__*/(0, _Function.dual)(2, (a, n) => makeBy(n, () => a));
+/**
+ * Creates a new `Array` from an iterable collection of values.
+ * If the input is already an array, it returns the input as-is.
+ * Otherwise, it converts the iterable collection to an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.fromIterable(new Set([1, 2, 3]))
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const fromIterable = collection => Array.isArray(collection) ? collection : Array.from(collection);
+/**
+ * Creates a new `Array` from a value that might not be an iterable.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.ensure("a")) // ["a"]
+ * console.log(Array.ensure(["a"])) // ["a"]
+ * console.log(Array.ensure(["a", "b", "c"])) // ["a", "b", "c"]
+ * ```
+ *
+ * @category constructors
+ * @since 3.3.0
+ */
+exports.fromIterable = fromIterable;
+const ensure = self => Array.isArray(self) ? self : [self];
+/**
+ * Takes a record and returns an array of tuples containing its keys and values.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.fromRecord({ a: 1, b: 2, c: 3 })
+ * console.log(result) // [["a", 1], ["b", 2], ["c", 3]]
+ * ```
+ *
+ * @category conversions
+ * @since 2.0.0
+ */
+exports.ensure = ensure;
+const fromRecord = exports.fromRecord = Record.toEntries;
+/**
+ * Converts an `Option` to an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Option } from "effect"
+ *
+ * console.log(Array.fromOption(Option.some(1))) // [1]
+ * console.log(Array.fromOption(Option.none())) // []
+ * ```
+ *
+ * @category conversions
+ * @since 2.0.0
+ */
+const fromOption = exports.fromOption = Option.toArray;
+/**
+ * Matches the elements of an array, applying functions to cases of empty and non-empty arrays.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const match = Array.match({
+ *   onEmpty: () => "empty",
+ *   onNonEmpty: ([head, ...tail]) => `head: ${head}, tail: ${tail.length}`
+ * })
+ * console.log(match([])) // "empty"
+ * console.log(match([1, 2, 3])) // "head: 1, tail: 2"
+ * ```
+ *
+ * @category pattern matching
+ * @since 2.0.0
+ */
+const match = exports.match = /*#__PURE__*/(0, _Function.dual)(2, (self, {
+  onEmpty,
+  onNonEmpty
+}) => isNonEmptyReadonlyArray(self) ? onNonEmpty(self) : onEmpty());
+/**
+ * Matches the elements of an array from the left, applying functions to cases of empty and non-empty arrays.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const matchLeft = Array.matchLeft({
+ *   onEmpty: () => "empty",
+ *   onNonEmpty: (head, tail) => `head: ${head}, tail: ${tail.length}`
+ * })
+ * console.log(matchLeft([])) // "empty"
+ * console.log(matchLeft([1, 2, 3])) // "head: 1, tail: 2"
+ * ```
+ *
+ * @category pattern matching
+ * @since 2.0.0
+ */
+const matchLeft = exports.matchLeft = /*#__PURE__*/(0, _Function.dual)(2, (self, {
+  onEmpty,
+  onNonEmpty
+}) => isNonEmptyReadonlyArray(self) ? onNonEmpty(headNonEmpty(self), tailNonEmpty(self)) : onEmpty());
+/**
+ * Matches the elements of an array from the right, applying functions to cases of empty and non-empty arrays.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const matchRight = Array.matchRight({
+ *   onEmpty: () => "empty",
+ *   onNonEmpty: (init, last) => `init: ${init.length}, last: ${last}`
+ * })
+ * console.log(matchRight([])) // "empty"
+ * console.log(matchRight([1, 2, 3])) // "init: 2, last: 3"
+ * ```
+ *
+ * @category pattern matching
+ * @since 2.0.0
+ */
+const matchRight = exports.matchRight = /*#__PURE__*/(0, _Function.dual)(2, (self, {
+  onEmpty,
+  onNonEmpty
+}) => isNonEmptyReadonlyArray(self) ? onNonEmpty(initNonEmpty(self), lastNonEmpty(self)) : onEmpty());
+/**
+ * Prepend an element to the front of an `Iterable`, creating a new `NonEmptyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.prepend([2, 3, 4], 1)
+ * console.log(result) // [1, 2, 3, 4]
+ * ```
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const prepend = exports.prepend = /*#__PURE__*/(0, _Function.dual)(2, (self, head) => [head, ...self]);
+/**
+ * Prepends the specified prefix array (or iterable) to the beginning of the specified array (or iterable).
+ * If either array is non-empty, the result is also a non-empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.prependAll([2, 3], [0, 1])
+ * console.log(result) // [0, 1, 2, 3]
+ * ```
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const prependAll = exports.prependAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => fromIterable(that).concat(fromIterable(self)));
+/**
+ * Append an element to the end of an `Iterable`, creating a new `NonEmptyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.append([1, 2, 3], 4);
+ * console.log(result) // [1, 2, 3, 4]
+ * ```
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const append = exports.append = /*#__PURE__*/(0, _Function.dual)(2, (self, last) => [...self, last]);
+/**
+ * Concatenates two arrays (or iterables), combining their elements.
+ * If either array is non-empty, the result is also a non-empty array.
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const appendAll = exports.appendAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => fromIterable(self).concat(fromIterable(that)));
+/**
+ * Accumulates values from an `Iterable` starting from the left, storing
+ * each intermediate result in an array. Useful for tracking the progression of
+ * a value through a series of transformations.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect";
+ *
+ * const result = Array.scan([1, 2, 3, 4], 0, (acc, value) => acc + value)
+ * console.log(result) // [0, 1, 3, 6, 10]
+ *
+ * // Explanation:
+ * // This function starts with the initial value (0 in this case)
+ * // and adds each element of the array to this accumulator one by one,
+ * // keeping track of the cumulative sum after each addition.
+ * // Each of these sums is captured in the resulting array.
+ * ```
+ *
+ * @category folding
+ * @since 2.0.0
+ */
+const scan = exports.scan = /*#__PURE__*/(0, _Function.dual)(3, (self, b, f) => {
+  const out = [b];
+  let i = 0;
+  for (const a of self) {
+    out[i + 1] = f(out[i], a);
+    i++;
+  }
+  return out;
+});
+/**
+ * Accumulates values from an `Iterable` starting from the right, storing
+ * each intermediate result in an array. Useful for tracking the progression of
+ * a value through a series of transformations.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect";
+ *
+ * const result = Array.scanRight([1, 2, 3, 4], 0, (acc, value) => acc + value)
+ * console.log(result) // [10, 9, 7, 4, 0]
+ * ```
+ *
+ * @category folding
+ * @since 2.0.0
+ */
+const scanRight = exports.scanRight = /*#__PURE__*/(0, _Function.dual)(3, (self, b, f) => {
+  const input = fromIterable(self);
+  const out = new Array(input.length + 1);
+  out[input.length] = b;
+  for (let i = input.length - 1; i >= 0; i--) {
+    out[i] = f(out[i + 1], input[i]);
+  }
+  return out;
+});
+/**
+ * Determine if `unknown` is an Array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.isArray(null)) // false
+ * console.log(Array.isArray([1, 2, 3])) // true
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isArray = exports.isArray = Array.isArray;
+/**
+ * Determine if an `Array` is empty narrowing down the type to `[]`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.isEmptyArray([])) // true
+ * console.log(Array.isEmptyArray([1, 2, 3])) // false
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isEmptyArray = self => self.length === 0;
+/**
+ * Determine if a `ReadonlyArray` is empty narrowing down the type to `readonly []`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.isEmptyReadonlyArray([])) // true
+ * console.log(Array.isEmptyReadonlyArray([1, 2, 3])) // false
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+exports.isEmptyArray = isEmptyArray;
+const isEmptyReadonlyArray = exports.isEmptyReadonlyArray = isEmptyArray;
+/**
+ * Determine if an `Array` is non empty narrowing down the type to `NonEmptyArray`.
+ *
+ * An `Array` is considered to be a `NonEmptyArray` if it contains at least one element.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.isNonEmptyArray([])) // false
+ * console.log(Array.isNonEmptyArray([1, 2, 3])) // true
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isNonEmptyArray = exports.isNonEmptyArray = internalArray.isNonEmptyArray;
+/**
+ * Determine if a `ReadonlyArray` is non empty narrowing down the type to `NonEmptyReadonlyArray`.
+ *
+ * A `ReadonlyArray` is considered to be a `NonEmptyReadonlyArray` if it contains at least one element.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * console.log(Array.isNonEmptyReadonlyArray([])) // false
+ * console.log(Array.isNonEmptyReadonlyArray([1, 2, 3])) // true
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isNonEmptyReadonlyArray = exports.isNonEmptyReadonlyArray = internalArray.isNonEmptyArray;
+/**
+ * Return the number of elements in a `ReadonlyArray`.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const length = self => self.length;
+exports.length = length;
+const isOutOfBounds = (i, as) => i < 0 || i >= as.length;
+const clamp = (i, as) => Math.floor(Math.min(Math.max(0, i), as.length));
+/**
+ * This function provides a safe way to read a value at a particular index from a `ReadonlyArray`.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const get = exports.get = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => {
+  const i = Math.floor(index);
+  return isOutOfBounds(i, self) ? Option.none() : Option.some(self[i]);
+});
+/**
+ * Gets an element unsafely, will throw on out of bounds.
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+const unsafeGet = exports.unsafeGet = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => {
+  const i = Math.floor(index);
+  if (isOutOfBounds(i, self)) {
+    throw new Error(`Index ${i} out of bounds`);
+  }
+  return self[i];
+});
+/**
+ * Return a tuple containing the first element, and a new `Array` of the remaining elements, if any.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect";
+ *
+ * const result = Array.unprepend([1, 2, 3, 4])
+ * console.log(result) // [1, [2, 3, 4]]
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const unprepend = self => [headNonEmpty(self), tailNonEmpty(self)];
+/**
+ * Return a tuple containing a copy of the `NonEmptyReadonlyArray` without its last element, and that last element.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect";
+ *
+ * const result = Array.unappend([1, 2, 3, 4])
+ * console.log(result) // [[1, 2, 3], 4]
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+exports.unprepend = unprepend;
+const unappend = self => [initNonEmpty(self), lastNonEmpty(self)];
+/**
+ * Get the first element of a `ReadonlyArray`, or `None` if the `ReadonlyArray` is empty.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.unappend = unappend;
+const head = exports.head = /*#__PURE__*/get(0);
+/**
+ * Get the first element of a non empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.headNonEmpty([1, 2, 3, 4])
+ * console.log(result) // 1
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const headNonEmpty = exports.headNonEmpty = /*#__PURE__*/unsafeGet(0);
+/**
+ * Get the last element in a `ReadonlyArray`, or `None` if the `ReadonlyArray` is empty.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const last = self => isNonEmptyReadonlyArray(self) ? Option.some(lastNonEmpty(self)) : Option.none();
+/**
+ * Get the last element of a non empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.lastNonEmpty([1, 2, 3, 4])
+ * console.log(result) // 4
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.last = last;
+const lastNonEmpty = self => self[self.length - 1];
+/**
+ * Get all but the first element of an `Iterable`, creating a new `Array`, or `None` if the `Iterable` is empty.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.lastNonEmpty = lastNonEmpty;
+const tail = self => {
+  const input = fromIterable(self);
+  return isNonEmptyReadonlyArray(input) ? Option.some(tailNonEmpty(input)) : Option.none();
+};
+/**
+ * Get all but the first element of a `NonEmptyReadonlyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.tailNonEmpty([1, 2, 3, 4])
+ * console.log(result) // [2, 3, 4]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.tail = tail;
+const tailNonEmpty = self => self.slice(1);
+/**
+ * Get all but the last element of an `Iterable`, creating a new `Array`, or `None` if the `Iterable` is empty.
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.tailNonEmpty = tailNonEmpty;
+const init = self => {
+  const input = fromIterable(self);
+  return isNonEmptyReadonlyArray(input) ? Option.some(initNonEmpty(input)) : Option.none();
+};
+/**
+ * Get all but the last element of a non empty array, creating a new array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.initNonEmpty([1, 2, 3, 4])
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.init = init;
+const initNonEmpty = self => self.slice(0, -1);
+/**
+ * Keep only a max number of elements from the start of an `Iterable`, creating a new `Array`.
+ *
+ * **Note**. `n` is normalized to a non negative integer.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.take([1, 2, 3, 4, 5], 3)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+exports.initNonEmpty = initNonEmpty;
+const take = exports.take = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  return input.slice(0, clamp(n, input));
+});
+/**
+ * Keep only a max number of elements from the end of an `Iterable`, creating a new `Array`.
+ *
+ * **Note**. `n` is normalized to a non negative integer.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.takeRight([1, 2, 3, 4, 5], 3)
+ * console.log(result) // [3, 4, 5]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const takeRight = exports.takeRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  const i = clamp(n, input);
+  return i === 0 ? [] : input.slice(-i);
+});
+/**
+ * Calculate the longest initial subarray for which all element satisfy the specified predicate, creating a new `Array`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.takeWhile([1, 3, 2, 4, 1, 2], x => x < 4)
+ * console.log(result) // [1, 3, 2]
+ *
+ * // Explanation:
+ * // - The function starts with the first element (`1`), which is less than `4`, so it adds `1` to the result.
+ * // - The next element (`3`) is also less than `4`, so it adds `3`.
+ * // - The next element (`2`) is again less than `4`, so it adds `2`.
+ * // - The function then encounters `4`, which is not less than `4`. At this point, it stops checking further elements and finalizes the result.
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const takeWhile = exports.takeWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  let i = 0;
+  const out = [];
+  for (const a of self) {
+    if (!predicate(a, i)) {
+      break;
+    }
+    out.push(a);
+    i++;
+  }
+  return out;
+});
+const spanIndex = (self, predicate) => {
+  let i = 0;
+  for (const a of self) {
+    if (!predicate(a, i)) {
+      break;
+    }
+    i++;
+  }
+  return i;
+};
+/**
+ * Split an `Iterable` into two parts:
+ *
+ * 1. the longest initial subarray for which all elements satisfy the specified predicate
+ * 2. the remaining elements
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const span = exports.span = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => splitAt(self, spanIndex(self, predicate)));
+/**
+ * Drop a max number of elements from the start of an `Iterable`, creating a new `Array`.
+ *
+ * **Note**. `n` is normalized to a non negative integer.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.drop([1, 2, 3, 4, 5], 2)
+ * console.log(result) // [3, 4, 5]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const drop = exports.drop = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  return input.slice(clamp(n, input), input.length);
+});
+/**
+ * Drop a max number of elements from the end of an `Iterable`, creating a new `Array`.
+ *
+ * **Note**. `n` is normalized to a non negative integer.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.dropRight([1, 2, 3, 4, 5], 2)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const dropRight = exports.dropRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  return input.slice(0, input.length - clamp(n, input));
+});
+/**
+ * Remove the longest initial subarray for which all element satisfy the specified predicate, creating a new `Array`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.dropWhile([1, 2, 3, 4, 5], x => x < 4)
+ * console.log(result) // [4, 5]
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const dropWhile = exports.dropWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => fromIterable(self).slice(spanIndex(self, predicate)));
+/**
+ * Return the first index for which a predicate holds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.findFirstIndex([5, 3, 8, 9], x => x > 5)
+ * console.log(result) // Option.some(2)
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findFirstIndex = exports.findFirstIndex = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  let i = 0;
+  for (const a of self) {
+    if (predicate(a, i)) {
+      return Option.some(i);
+    }
+    i++;
+  }
+  return Option.none();
+});
+/**
+ * Return the last index for which a predicate holds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.findLastIndex([1, 3, 8, 9], x => x < 5)
+ * console.log(result) // Option.some(1)
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findLastIndex = exports.findLastIndex = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  const input = fromIterable(self);
+  for (let i = input.length - 1; i >= 0; i--) {
+    if (predicate(input[i], i)) {
+      return Option.some(i);
+    }
+  }
+  return Option.none();
+});
+/**
+ * Returns the first element that satisfies the specified
+ * predicate, or `None` if no such element exists.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.findFirst([1, 2, 3, 4, 5], x => x > 3)
+ * console.log(result) // Option.some(4)
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findFirst = exports.findFirst = moduleIterable.findFirst;
+/**
+ * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
+ * Returns an `Option` containing the found element, or `Option.none` if no element matches.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.findLast([1, 2, 3, 4, 5], n => n % 2 === 0)
+ * console.log(result) // Option.some(4)
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findLast = exports.findLast = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  const input = fromIterable(self);
+  for (let i = input.length - 1; i >= 0; i--) {
+    const a = input[i];
+    const o = f(a, i);
+    if (Predicate.isBoolean(o)) {
+      if (o) {
+        return Option.some(a);
+      }
+    } else {
+      if (Option.isSome(o)) {
+        return o;
+      }
+    }
+  }
+  return Option.none();
+});
+/**
+ * Returns a tuple of the first element that satisfies the specified
+ * predicate and its index, or `None` if no such element exists.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.findFirstWithIndex([1, 2, 3, 4, 5], x => x > 3)
+ * console.log(result) // Option.some([4, 3])
+ * ```
+ *
+ * @category elements
+ * @since 3.17.0
+ */
+const findFirstWithIndex = exports.findFirstWithIndex = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  let i = 0;
+  for (const a of self) {
+    const o = f(a, i);
+    if (Predicate.isBoolean(o)) {
+      if (o) {
+        return Option.some([a, i]);
+      }
+    } else {
+      if (Option.isSome(o)) {
+        return Option.some([o.value, i]);
+      }
+    }
+    i++;
+  }
+  return Option.none();
+});
+/**
+ * Counts all the element of the given array that pass the given predicate
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.countBy([1, 2, 3, 4, 5], n => n % 2 === 0)
+ * console.log(result) // 2
+ * ```
+ *
+ * @category folding
+ * @since 3.16.0
+ */
+const countBy = exports.countBy = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  let count = 0;
+  const as = fromIterable(self);
+  for (let i = 0; i < as.length; i++) {
+    const a = as[i];
+    if (f(a, i)) {
+      count++;
+    }
+  }
+  return count;
+});
+/**
+ * Insert an element at the specified index, creating a new `NonEmptyArray`,
+ * or return `None` if the index is out of bounds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.insertAt(['a', 'b', 'c', 'e'], 3, 'd')
+ * console.log(result) // Option.some(['a', 'b', 'c', 'd', 'e'])
+ * ```
+ *
+ * @since 2.0.0
+ */
+const insertAt = exports.insertAt = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => {
+  const out = Array.from(self);
+  //             v--- `= self.length` is ok, it means inserting in last position
+  if (i < 0 || i > out.length) {
+    return Option.none();
+  }
+  out.splice(i, 0, b);
+  return Option.some(out);
+});
+/**
+ * Change the element at the specified index, creating a new `Array`,
+ * or return a copy of the input if the index is out of bounds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.replace(['a', 'b', 'c', 'd'], 1, 'z')
+ * console.log(result) // ['a', 'z', 'c', 'd']
+ * ```
+ *
+ * @since 2.0.0
+ */
+const replace = exports.replace = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modify(self, i, () => b));
+/**
+ * Replaces an element in an array with the given value, returning an option of the updated array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.replaceOption([1, 2, 3], 1, 4)
+ * console.log(result) // Option.some([1, 4, 3])
+ * ```
+ *
+ * @since 2.0.0
+ */
+const replaceOption = exports.replaceOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modifyOption(self, i, () => b));
+/**
+ * Apply a function to the element at the specified index, creating a new `Array`,
+ * or return a copy of the input if the index is out of bounds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.modify([1, 2, 3, 4], 2, (n) => n * 2)
+ * console.log(result) // [1, 2, 6, 4]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const modify = exports.modify = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => {
+  const out = Array.from(self);
+  if (isOutOfBounds(i, out)) {
+    return out;
+  }
+  const b = f(out[i]);
+  out[i] = b;
+  return out;
+});
+/**
+ * Apply a function to the element at the specified index, creating a new `Array`,
+ * or return `None` if the index is out of bounds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const input = [1, 2, 3, 4]
+ * const result = Array.modifyOption(input, 2, (n) => n * 2)
+ * console.log(result) // Option.some([1, 2, 6, 4])
+ *
+ * const outOfBoundsResult = Array.modifyOption(input, 5, (n) => n * 2)
+ * console.log(outOfBoundsResult) // Option.none()
+ * ```
+ *
+ * @since 2.0.0
+ */
+const modifyOption = exports.modifyOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => {
+  const arr = fromIterable(self);
+  if (isOutOfBounds(i, arr)) {
+    return Option.none();
+  }
+  const out = Array.isArray(self) ? self.slice() : arr;
+  const b = f(arr[i]);
+  out[i] = b;
+  return Option.some(out);
+});
+/**
+ * Delete the element at the specified index, creating a new `Array`,
+ * or return a copy of the input if the index is out of bounds.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const input = [1, 2, 3, 4]
+ * const result = Array.remove(input, 2)
+ * console.log(result) // [1, 2, 4]
+ *
+ * const outOfBoundsResult = Array.remove(input, 5)
+ * console.log(outOfBoundsResult) // [1, 2, 3, 4]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const remove = exports.remove = /*#__PURE__*/(0, _Function.dual)(2, (self, i) => {
+  const out = Array.from(self);
+  if (isOutOfBounds(i, out)) {
+    return out;
+  }
+  out.splice(i, 1);
+  return out;
+});
+/**
+ * Delete the element at the specified index, creating a new `Array`,
+ * or return `None` if the index is out of bounds.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Array, Option } from "effect"
+ *
+ * const numbers = [1, 2, 3, 4]
+ * const result = Array.removeOption(numbers, 2)
+ * assert.deepStrictEqual(result, Option.some([1, 2, 4]))
+ *
+ * const outOfBoundsResult = Array.removeOption(numbers, 5)
+ * assert.deepStrictEqual(outOfBoundsResult, Option.none())
+ * ```
+ *
+ * @since 3.16.0
+ */
+const removeOption = exports.removeOption = /*#__PURE__*/(0, _Function.dual)(2, (self, i) => {
+  const arr = fromIterable(self);
+  if (isOutOfBounds(i, arr)) {
+    return Option.none();
+  }
+  const out = Array.isArray(self) ? self.slice() : arr;
+  out.splice(i, 1);
+  return Option.some(out);
+});
+/**
+ * Reverse an `Iterable`, creating a new `Array`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.reverse([1, 2, 3, 4])
+ * console.log(result) // [4, 3, 2, 1]
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const reverse = self => Array.from(self).reverse();
+/**
+ * Create a new array with elements sorted in increasing order based on the specified comparator.
+ * If the input is a `NonEmptyReadonlyArray`, the output will also be a `NonEmptyReadonlyArray`.
+ *
+ * @category sorting
+ * @since 2.0.0
+ */
+exports.reverse = reverse;
+const sort = exports.sort = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => {
+  const out = Array.from(self);
+  out.sort(O);
+  return out;
+});
+/**
+ * Sorts an array based on a provided mapping function and order. The mapping
+ * function transforms the elements into a value that can be compared, and the
+ * order defines how those values should be sorted.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Order } from "effect"
+ *
+ * const result = Array.sortWith(["aaa", "b", "cc"], (s) => s.length, Order.number)
+ * console.log(result) // ["b", "cc", "aaa"]
+ *
+ * // Explanation:
+ * // The array of strings is sorted based on their lengths. The mapping function `(s) => s.length`
+ * // converts each string into its length, and the `Order.number` specifies that the lengths should
+ * // be sorted in ascending order.
+ * ```
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const sortWith = exports.sortWith = /*#__PURE__*/(0, _Function.dual)(3, (self, f, order) => Array.from(self).map(a => [a, f(a)]).sort(([, a], [, b]) => order(a, b)).map(([_]) => _));
+/**
+ * Sorts the elements of an `Iterable` in increasing order based on the provided
+ * orders. The elements are compared using the first order in `orders`, then the
+ * second order if the first comparison is equal, and so on.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Order, pipe } from "effect"
+ *
+ * const users = [
+ *   { name: "Alice", age: 30 },
+ *   { name: "Bob", age: 25 },
+ *   { name: "Charlie", age: 30 }
+ * ]
+ *
+ * const result = pipe(
+ *   users,
+ *   Array.sortBy(
+ *     Order.mapInput(Order.number, (user: (typeof users)[number]) => user.age),
+ *     Order.mapInput(Order.string, (user: (typeof users)[number]) => user.name)
+ *   )
+ * )
+ *
+ * console.log(result)
+ * // [
+ * //   { name: "Bob", age: 25 },
+ * //   { name: "Alice", age: 30 },
+ * //   { name: "Charlie", age: 30 }
+ * // ]
+ *
+ * // Explanation:
+ * // The array of users is sorted first by age in ascending order. When ages are equal,
+ * // the users are further sorted by name in ascending order.
+ * ```
+ *
+ * @category sorting
+ * @since 2.0.0
+ */
+const sortBy = (...orders) => {
+  const sortByAll = sort(Order.combineAll(orders));
+  return self => {
+    const input = fromIterable(self);
+    if (isNonEmptyReadonlyArray(input)) {
+      return sortByAll(input);
+    }
+    return [];
+  };
+};
+/**
+ * Takes two `Iterable`s and returns an `Array` of corresponding pairs.
+ * If one input `Iterable` is short, excess elements of the
+ * longer `Iterable` are discarded.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.zip([1, 2, 3], ['a', 'b'])
+ * console.log(result) // [[1, 'a'], [2, 'b']]
+ * ```
+ *
+ * @category zipping
+ * @since 2.0.0
+ */
+exports.sortBy = sortBy;
+const zip = exports.zip = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, Tuple.make));
+/**
+ * Apply a function to pairs of elements at the same index in two `Iterable`s, collecting the results in a new `Array`. If one
+ * input `Iterable` is short, excess elements of the longer `Iterable` are discarded.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.zipWith([1, 2, 3], [4, 5, 6], (a, b) => a + b)
+ * console.log(result) // [5, 7, 9]
+ * ```
+ *
+ * @category zipping
+ * @since 2.0.0
+ */
+const zipWith = exports.zipWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => {
+  const as = fromIterable(self);
+  const bs = fromIterable(that);
+  if (isNonEmptyReadonlyArray(as) && isNonEmptyReadonlyArray(bs)) {
+    const out = [f(headNonEmpty(as), headNonEmpty(bs))];
+    const len = Math.min(as.length, bs.length);
+    for (let i = 1; i < len; i++) {
+      out[i] = f(as[i], bs[i]);
+    }
+    return out;
+  }
+  return [];
+});
+/**
+ * This function is the inverse of `zip`. Takes an `Iterable` of pairs and return two corresponding `Array`s.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.unzip([[1, "a"], [2, "b"], [3, "c"]])
+ * console.log(result) // [[1, 2, 3], ['a', 'b', 'c']]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const unzip = self => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    const fa = [input[0][0]];
+    const fb = [input[0][1]];
+    for (let i = 1; i < input.length; i++) {
+      fa[i] = input[i][0];
+      fb[i] = input[i][1];
+    }
+    return [fa, fb];
+  }
+  return [[], []];
+};
+/**
+ * Places an element in between members of an `Iterable`.
+ * If the input is a non-empty array, the result is also a non-empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.intersperse([1, 2, 3], 0)
+ * console.log(result) // [1, 0, 2, 0, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+exports.unzip = unzip;
+const intersperse = exports.intersperse = /*#__PURE__*/(0, _Function.dual)(2, (self, middle) => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    const out = [headNonEmpty(input)];
+    const tail = tailNonEmpty(input);
+    for (let i = 0; i < tail.length; i++) {
+      if (i < tail.length) {
+        out.push(middle);
+      }
+      out.push(tail[i]);
+    }
+    return out;
+  }
+  return [];
+});
+/**
+ * Apply a function to the head, creating a new `NonEmptyReadonlyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.modifyNonEmptyHead([1, 2, 3], n => n * 10)
+ * console.log(result) // [10, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const modifyNonEmptyHead = exports.modifyNonEmptyHead = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => [f(headNonEmpty(self)), ...tailNonEmpty(self)]);
+/**
+ * Change the head, creating a new `NonEmptyReadonlyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.setNonEmptyHead([1, 2, 3], 10)
+ * console.log(result) // [10, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const setNonEmptyHead = exports.setNonEmptyHead = /*#__PURE__*/(0, _Function.dual)(2, (self, b) => modifyNonEmptyHead(self, () => b));
+/**
+ * Apply a function to the last element, creating a new `NonEmptyReadonlyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.modifyNonEmptyLast([1, 2, 3], n => n * 2)
+ * console.log(result) // [1, 2, 6]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const modifyNonEmptyLast = exports.modifyNonEmptyLast = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => append(initNonEmpty(self), f(lastNonEmpty(self))));
+/**
+ * Change the last element, creating a new `NonEmptyReadonlyArray`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.setNonEmptyLast([1, 2, 3], 4)
+ * console.log(result) // [1, 2, 4]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const setNonEmptyLast = exports.setNonEmptyLast = /*#__PURE__*/(0, _Function.dual)(2, (self, b) => modifyNonEmptyLast(self, () => b));
+/**
+ * Rotate an `Iterable` by `n` steps.
+ * If the input is a non-empty array, the result is also a non-empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.rotate(['a', 'b', 'c', 'd', 'e'], 2)
+ * console.log(result) // [ 'd', 'e', 'a', 'b', 'c' ]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const rotate = exports.rotate = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    const len = input.length;
+    const m = Math.round(n) % len;
+    if (isOutOfBounds(Math.abs(m), input) || m === 0) {
+      return copy(input);
+    }
+    if (m < 0) {
+      const [f, s] = splitNonEmptyAt(input, -m);
+      return appendAll(s, f);
+    } else {
+      return rotate(self, m - len);
+    }
+  }
+  return [];
+});
+/**
+ * Returns a function that checks if a `ReadonlyArray` contains a given value using a provided `isEquivalent` function.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, pipe } from "effect"
+ *
+ * const isEquivalent = (a: number, b: number) => a === b
+ * const containsNumber = Array.containsWith(isEquivalent)
+ * const result = pipe([1, 2, 3, 4], containsNumber(3))
+ * console.log(result) // true
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const containsWith = isEquivalent => (0, _Function.dual)(2, (self, a) => {
+  for (const i of self) {
+    if (isEquivalent(a, i)) {
+      return true;
+    }
+  }
+  return false;
+});
+exports.containsWith = containsWith;
+const _equivalence = /*#__PURE__*/Equal.equivalence();
+/**
+ * Returns a function that checks if a `ReadonlyArray` contains a given value using the default `Equivalence`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, pipe } from "effect"
+ *
+ * const result = pipe(['a', 'b', 'c', 'd'], Array.contains('c'))
+ * console.log(result) // true
+ * ```
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const contains = exports.contains = /*#__PURE__*/containsWith(_equivalence);
+/**
+ * A useful recursion pattern for processing an `Iterable` to produce a new `Array`, often used for "chopping" up the input
+ * `Iterable`. Typically chop is called with some function that will consume an initial prefix of the `Iterable` and produce a
+ * value and the rest of the `Array`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.chop([1, 2, 3, 4, 5], (as): [number, Array<number>] => [as[0] * 2, as.slice(1)])
+ * console.log(result) // [2, 4, 6, 8, 10]
+ *
+ * // Explanation:
+ * // The `chopFunction` takes the first element of the array, doubles it, and then returns it along with the rest of the array.
+ * // The `chop` function applies this `chopFunction` recursively to the input array `[1, 2, 3, 4, 5]`,
+ * // resulting in a new array `[2, 4, 6, 8, 10]`.
+ * ```
+ *
+ * @since 2.0.0
+ */
+const chop = exports.chop = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    const [b, rest] = f(input);
+    const out = [b];
+    let next = rest;
+    while (internalArray.isNonEmptyArray(next)) {
+      const [b, rest] = f(next);
+      out.push(b);
+      next = rest;
+    }
+    return out;
+  }
+  return [];
+});
+/**
+ * Splits an `Iterable` into two segments, with the first segment containing a maximum of `n` elements.
+ * The value of `n` can be `0`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.splitAt([1, 2, 3, 4, 5], 3)
+ * console.log(result) // [[1, 2, 3], [4, 5]]
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const splitAt = exports.splitAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = Array.from(self);
+  const _n = Math.floor(n);
+  if (isNonEmptyReadonlyArray(input)) {
+    if (_n >= 1) {
+      return splitNonEmptyAt(input, _n);
+    }
+    return [[], input];
+  }
+  return [input, []];
+});
+/**
+ * Splits a `NonEmptyReadonlyArray` into two segments, with the first segment containing a maximum of `n` elements.
+ * The value of `n` must be `>= 1`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.splitNonEmptyAt(["a", "b", "c", "d", "e"], 3)
+ * console.log(result) // [["a", "b", "c"], ["d", "e"]]
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const splitNonEmptyAt = exports.splitNonEmptyAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const _n = Math.max(1, Math.floor(n));
+  return _n >= self.length ? [copy(self), []] : [prepend(self.slice(1, _n), headNonEmpty(self)), self.slice(_n)];
+});
+/**
+ * Splits this iterable into `n` equally sized arrays.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.split([1, 2, 3, 4, 5, 6, 7, 8], 3)
+ * console.log(result) // [[1, 2, 3], [4, 5, 6], [7, 8]]
+ * ```
+ *
+ * @since 2.0.0
+ * @category splitting
+ */
+const split = exports.split = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  return chunksOf(input, Math.ceil(input.length / Math.floor(n)));
+});
+/**
+ * Splits this iterable on the first element that matches this predicate.
+ * Returns a tuple containing two arrays: the first one is before the match, and the second one is from the match onward.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.splitWhere([1, 2, 3, 4, 5], n => n > 3)
+ * console.log(result) // [[1, 2, 3], [4, 5]]
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const splitWhere = exports.splitWhere = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => span(self, (a, i) => !predicate(a, i)));
+/**
+ * Copies an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.copy([1, 2, 3])
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const copy = self => self.slice();
+/**
+ * Pads an array.
+ * Returns a new array of length `n` with the elements of `array` followed by `fill` elements if `array` is shorter than `n`.
+ * If `array` is longer than `n`, the returned array will be a slice of `array` containing the `n` first elements of `array`.
+ * If `n` is less than or equal to 0, the returned array will be an empty array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.pad([1, 2, 3], 6, 0)
+ * console.log(result) // [1, 2, 3, 0, 0, 0]
+ * ```
+ *
+ * @since 3.8.4
+ */
+exports.copy = copy;
+const pad = exports.pad = /*#__PURE__*/(0, _Function.dual)(3, (self, n, fill) => {
+  if (self.length >= n) {
+    return take(self, n);
+  }
+  return appendAll(self, makeBy(n - self.length, () => fill));
+});
+/**
+ * Splits an `Iterable` into length-`n` pieces. The last piece will be shorter if `n` does not evenly divide the length of
+ * the `Iterable`. Note that `chunksOf(n)([])` is `[]`, not `[[]]`. This is intentional, and is consistent with a recursive
+ * definition of `chunksOf`; it satisfies the property that
+ *
+ * ```ts skip-type-checking
+ * chunksOf(n)(xs).concat(chunksOf(n)(ys)) == chunksOf(n)(xs.concat(ys)))
+ * ```
+ *
+ * whenever `n` evenly divides the length of `self`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.chunksOf([1, 2, 3, 4, 5], 2)
+ * console.log(result) // [[1, 2], [3, 4], [5]]
+ *
+ * // Explanation:
+ * // The `chunksOf` function takes an array of numbers `[1, 2, 3, 4, 5]` and a number `2`.
+ * // It splits the array into chunks of length 2. Since the array length is not evenly divisible by 2,
+ * // the last chunk contains the remaining elements.
+ * // The result is `[[1, 2], [3, 4], [5]]`.
+ * ```
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const chunksOf = exports.chunksOf = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    return chop(input, splitNonEmptyAt(n));
+  }
+  return [];
+});
+/**
+ * Creates sliding windows of size `n` from an `Iterable`.
+ * If the number of elements is less than `n` or if `n` is not greater than zero,
+ * an empty array is returned.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Array } from "effect"
+ *
+ * const numbers = [1, 2, 3, 4, 5]
+ * assert.deepStrictEqual(Array.window(numbers, 3), [[1, 2, 3], [2, 3, 4], [3, 4, 5]])
+ * assert.deepStrictEqual(Array.window(numbers, 6), [])
+ * ```
+ *
+ * @category splitting
+ * @since 3.13.2
+ */
+const window = exports.window = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const input = fromIterable(self);
+  if (n > 0 && isNonEmptyReadonlyArray(input)) {
+    return Array.from({
+      length: input.length - (n - 1)
+    }, (_, index) => input.slice(index, index + n));
+  }
+  return [];
+});
+/**
+ * Group equal, consecutive elements of a `NonEmptyReadonlyArray` into `NonEmptyArray`s using the provided `isEquivalent` function.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.groupWith(["a", "a", "b", "b", "b", "c", "a"], (x, y) => x === y)
+ * console.log(result) // [["a", "a"], ["b", "b", "b"], ["c"], ["a"]]
+ * ```
+ *
+ * @category grouping
+ * @since 2.0.0
+ */
+const groupWith = exports.groupWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => chop(self, as => {
+  const h = headNonEmpty(as);
+  const out = [h];
+  let i = 1;
+  for (; i < as.length; i++) {
+    const a = as[i];
+    if (isEquivalent(a, h)) {
+      out.push(a);
+    } else {
+      break;
+    }
+  }
+  return [out, as.slice(i)];
+}));
+/**
+ * Group equal, consecutive elements of a `NonEmptyReadonlyArray` into `NonEmptyArray`s.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.group([1, 1, 2, 2, 2, 3, 1])
+ * console.log(result) // [[1, 1], [2, 2, 2], [3], [1]]
+ * ```
+ *
+ * @category grouping
+ * @since 2.0.0
+ */
+const group = exports.group = /*#__PURE__*/groupWith(/*#__PURE__*/Equal.equivalence());
+/**
+ * Splits an `Iterable` into sub-non-empty-arrays stored in an object, based on the result of calling a `string`-returning
+ * function on each element, and grouping the results according to values returned
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const people = [
+ *   { name: "Alice", group: "A" },
+ *   { name: "Bob", group: "B" },
+ *   { name: "Charlie", group: "A" }
+ * ]
+ *
+ * const result = Array.groupBy(people, person => person.group)
+ * console.log(result)
+ * // {
+ * //  A: [{ name: "Alice", group: "A" }, { name: "Charlie", group: "A" }],
+ * //  B: [{ name: "Bob", group: "B" }]
+ * // }
+ * ```
+ *
+ * @category grouping
+ * @since 2.0.0
+ */
+const groupBy = exports.groupBy = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  const out = {};
+  for (const a of self) {
+    const k = f(a);
+    if (Object.prototype.hasOwnProperty.call(out, k)) {
+      out[k].push(a);
+    } else {
+      out[k] = [a];
+    }
+  }
+  return out;
+});
+/**
+ * Calculates the union of two arrays using the provided equivalence relation.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const union = Array.unionWith([1, 2], [2, 3], (a, b) => a === b)
+ * console.log(union) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const unionWith = exports.unionWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, isEquivalent) => {
+  const a = fromIterable(self);
+  const b = fromIterable(that);
+  if (isNonEmptyReadonlyArray(a)) {
+    if (isNonEmptyReadonlyArray(b)) {
+      const dedupe = dedupeWith(isEquivalent);
+      return dedupe(appendAll(a, b));
+    }
+    return a;
+  }
+  return b;
+});
+/**
+ * Creates a union of two arrays, removing duplicates.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.union([1, 2], [2, 3])
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const union = exports.union = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unionWith(self, that, _equivalence));
+/**
+ * Creates an `Array` of unique values that are included in all given `Iterable`s using the provided `isEquivalent` function.
+ * The order and references of result values are determined by the first `Iterable`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const array1 = [{ id: 1 }, { id: 2 }, { id: 3 }]
+ * const array2 = [{ id: 3 }, { id: 4 }, { id: 1 }]
+ * const isEquivalent = (a: { id: number }, b: { id: number }) => a.id === b.id
+ * const result = Array.intersectionWith(isEquivalent)(array2)(array1)
+ * console.log(result) // [{ id: 1 }, { id: 3 }]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const intersectionWith = isEquivalent => {
+  const has = containsWith(isEquivalent);
+  return (0, _Function.dual)(2, (self, that) => {
+    const bs = fromIterable(that);
+    return fromIterable(self).filter(a => has(bs, a));
+  });
+};
+/**
+ * Creates an `Array` of unique values that are included in all given `Iterable`s.
+ * The order and references of result values are determined by the first `Iterable`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.intersection([1, 2, 3], [3, 4, 1])
+ * console.log(result) // [1, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+exports.intersectionWith = intersectionWith;
+const intersection = exports.intersection = /*#__PURE__*/intersectionWith(_equivalence);
+/**
+ * Creates a `Array` of values not included in the other given `Iterable` using the provided `isEquivalent` function.
+ * The order and references of result values are determined by the first `Iterable`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const array1 = [1, 2, 3]
+ * const array2 = [2, 3, 4]
+ * const difference = Array.differenceWith<number>((a, b) => a === b)(array1, array2)
+ * console.log(difference) // [1]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const differenceWith = isEquivalent => {
+  const has = containsWith(isEquivalent);
+  return (0, _Function.dual)(2, (self, that) => {
+    const bs = fromIterable(that);
+    return fromIterable(self).filter(a => !has(bs, a));
+  });
+};
+/**
+ * Creates a `Array` of values not included in the other given `Iterable`.
+ * The order and references of result values are determined by the first `Iterable`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const difference = Array.difference([1, 2, 3], [2, 3, 4])
+ * console.log(difference) // [1]
+ * ```
+ *
+ * @since 2.0.0
+ */
+exports.differenceWith = differenceWith;
+const difference = exports.difference = /*#__PURE__*/differenceWith(_equivalence);
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+const empty = () => [];
+/**
+ * Constructs a new `NonEmptyArray<A>` from the specified value.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.empty = empty;
+const of = a => [a];
+/**
+ * @category mapping
+ * @since 2.0.0
+ */
+exports.of = of;
+const map = exports.map = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => self.map(f));
+/**
+ * Applies a function to each element in an array and returns a new array containing the concatenated mapped elements.
+ *
+ * @category sequencing
+ * @since 2.0.0
+ */
+const flatMap = exports.flatMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  if (isEmptyReadonlyArray(self)) {
+    return [];
+  }
+  const out = [];
+  for (let i = 0; i < self.length; i++) {
+    const inner = f(self[i], i);
+    for (let j = 0; j < inner.length; j++) {
+      out.push(inner[j]);
+    }
+  }
+  return out;
+});
+/**
+ * Combines multiple arrays into a single array by concatenating all elements
+ * from each nested array. This function ensures that the structure of nested
+ * arrays is collapsed into a single, flat array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.flatten([[1, 2], [], [3, 4], [], [5, 6]])
+ * console.log(result) // [1, 2, 3, 4, 5, 6]
+ * ```
+ *
+ * @category sequencing
+ * @since 2.0.0
+ */
+const flatten = exports.flatten = /*#__PURE__*/flatMap(_Function.identity);
+/**
+ * Applies a function to each element of the `Iterable` and filters based on the result, keeping the transformed values where the function returns `Some`.
+ * This method combines filtering and mapping functionalities, allowing transformations and filtering of elements based on a single function pass.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Option } from "effect"
+ *
+ * const evenSquares = (x: number) => x % 2 === 0 ? Option.some(x * x) : Option.none()
+ *
+ * const result = Array.filterMap([1, 2, 3, 4, 5], evenSquares);
+ * console.log(result) // [4, 16]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const filterMap = exports.filterMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  const as = fromIterable(self);
+  const out = [];
+  for (let i = 0; i < as.length; i++) {
+    const o = f(as[i], i);
+    if (Option.isSome(o)) {
+      out.push(o.value);
+    }
+  }
+  return out;
+});
+/**
+ * Applies a function to each element of the array and filters based on the result, stopping when a condition is not met.
+ * This method combines filtering and mapping in a single pass, and short-circuits, i.e., stops processing, as soon as the function returns `None`.
+ * This is useful when you need to transform an array but only up to the point where a certain condition holds true.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Option } from "effect"
+ *
+ * const toSquareTillOdd = (x: number) => x % 2 === 0 ? Option.some(x * x) : Option.none()
+ *
+ * const result = Array.filterMapWhile([2, 4, 5], toSquareTillOdd)
+ * console.log(result) // [4, 16]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const filterMapWhile = exports.filterMapWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  let i = 0;
+  const out = [];
+  for (const a of self) {
+    const b = f(a, i);
+    if (Option.isSome(b)) {
+      out.push(b.value);
+    } else {
+      break;
+    }
+    i++;
+  }
+  return out;
+});
+/**
+ * Applies a function to each element of the `Iterable`, categorizing the results into two separate arrays.
+ * This function is particularly useful for operations where each element can result in two possible types,
+ * and you want to separate these types into different collections. For instance, separating validation results
+ * into successes and failures.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Either } from "effect";
+ *
+ * const isEven = (x: number) => x % 2 === 0
+ *
+ * const result = Array.partitionMap([1, 2, 3, 4, 5], x =>
+ *   isEven(x) ? Either.right(x) : Either.left(x)
+ * )
+ * console.log(result)
+ * // [
+ * //   [1, 3, 5],
+ * //   [2, 4]
+ * // ]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const partitionMap = exports.partitionMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  const left = [];
+  const right = [];
+  const as = fromIterable(self);
+  for (let i = 0; i < as.length; i++) {
+    const e = f(as[i], i);
+    if (Either.isLeft(e)) {
+      left.push(e.left);
+    } else {
+      right.push(e.right);
+    }
+  }
+  return [left, right];
+});
+/**
+ * Retrieves the `Some` values from an `Iterable` of `Option`s, collecting them into an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Option } from "effect"
+ *
+ * const result = Array.getSomes([Option.some(1), Option.none(), Option.some(2)])
+ * console.log(result) // [1, 2]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const getSomes = exports.getSomes = /*#__PURE__*/filterMap(_Function.identity);
+/**
+ * Retrieves the `Left` values from an `Iterable` of `Either`s, collecting them into an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Either } from "effect"
+ *
+ * const result = Array.getLefts([Either.right(1), Either.left("err"), Either.right(2)])
+ * console.log(result) // ["err"]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const getLefts = self => {
+  const out = [];
+  for (const a of self) {
+    if (Either.isLeft(a)) {
+      out.push(a.left);
+    }
+  }
+  return out;
+};
+/**
+ * Retrieves the `Right` values from an `Iterable` of `Either`s, collecting them into an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Either } from "effect"
+ *
+ * const result = Array.getRights([Either.right(1), Either.left("err"), Either.right(2)])
+ * console.log(result) // [1, 2]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+exports.getLefts = getLefts;
+const getRights = self => {
+  const out = [];
+  for (const a of self) {
+    if (Either.isRight(a)) {
+      out.push(a.right);
+    }
+  }
+  return out;
+};
+/**
+ * @category filtering
+ * @since 2.0.0
+ */
+exports.getRights = getRights;
+const filter = exports.filter = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  const as = fromIterable(self);
+  const out = [];
+  for (let i = 0; i < as.length; i++) {
+    if (predicate(as[i], i)) {
+      out.push(as[i]);
+    }
+  }
+  return out;
+});
+/**
+ * Separate elements based on a predicate that also exposes the index of the element.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.partition([1, 2, 3, 4], n => n % 2 === 0)
+ * console.log(result) // [[1, 3], [2, 4]]
+ * ```
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const partition = exports.partition = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  const left = [];
+  const right = [];
+  const as = fromIterable(self);
+  for (let i = 0; i < as.length; i++) {
+    if (predicate(as[i], i)) {
+      right.push(as[i]);
+    } else {
+      left.push(as[i]);
+    }
+  }
+  return [left, right];
+});
+/**
+ * Separates an `Iterable` into two arrays based on a predicate.
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const separate = exports.separate = /*#__PURE__*/partitionMap(_Function.identity);
+/**
+ * Reduces an array from the left.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.reduce([1, 2, 3], 0, (acc, n) => acc + n)
+ * console.log(result) // 6
+ * ```
+ *
+ * @category folding
+ * @since 2.0.0
+ */
+const reduce = exports.reduce = /*#__PURE__*/(0, _Function.dual)(3, (self, b, f) => fromIterable(self).reduce((b, a, i) => f(b, a, i), b));
+/**
+ * Reduces an array from the right.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.reduceRight([1, 2, 3], 0, (acc, n) => acc + n)
+ * console.log(result) // 6
+ * ```
+ *
+ * @category folding
+ * @since 2.0.0
+ */
+const reduceRight = exports.reduceRight = /*#__PURE__*/(0, _Function.dual)(3, (self, b, f) => fromIterable(self).reduceRight((b, a, i) => f(b, a, i), b));
+/**
+ * Lifts a predicate into an array.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const isEven = (n: number) => n % 2 === 0
+ * const to = Array.liftPredicate(isEven)
+ * console.log(to(1)) // []
+ * console.log(to(2)) // [2]
+ * ```
+ *
+ * @category lifting
+ * @since 2.0.0
+ */
+const liftPredicate = predicate => b => predicate(b) ? [b] : [];
+/**
+ * @category lifting
+ * @since 2.0.0
+ */
+exports.liftPredicate = liftPredicate;
+const liftOption = f => (...a) => fromOption(f(...a));
+/**
+ * @category conversions
+ * @since 2.0.0
+ */
+exports.liftOption = liftOption;
+const fromNullable = a => a == null ? empty() : [a];
+/**
+ * @category lifting
+ * @since 2.0.0
+ */
+exports.fromNullable = fromNullable;
+const liftNullable = f => (...a) => fromNullable(f(...a));
+/**
+ * Maps over an array and flattens the result, removing null and undefined values.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.flatMapNullable([1, 2, 3], n => (n % 2 === 0 ? null : n))
+ * console.log(result) // [1, 3]
+ *
+ * // Explanation:
+ * // The array of numbers [1, 2, 3] is mapped with a function that returns null for even numbers
+ * // and the number itself for odd numbers. The resulting array [1, null, 3] is then flattened
+ * // to remove null values, resulting in [1, 3].
+ * ```
+ *
+ * @category sequencing
+ * @since 2.0.0
+ */
+exports.liftNullable = liftNullable;
+const flatMapNullable = exports.flatMapNullable = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => flatMap(self, a => fromNullable(f(a))));
+/**
+ * Lifts a function that returns an `Either` into a function that returns an array.
+ * If the `Either` is a left, it returns an empty array.
+ * If the `Either` is a right, it returns an array with the right value.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Either } from "effect"
+ *
+ * const parseNumber = (s: string): Either.Either<number, Error> =>
+ *   isNaN(Number(s)) ? Either.left(new Error("Not a number")) : Either.right(Number(s))
+ *
+ * const liftedParseNumber = Array.liftEither(parseNumber)
+ *
+ * const result1 = liftedParseNumber("42")
+ * console.log(result1) // [42]
+ *
+ * const result2 = liftedParseNumber("not a number")
+ * console.log(result2) // []
+ *
+ * // Explanation:
+ * // The function parseNumber is lifted to return an array.
+ * // When parsing "42", it returns an Either.left with the number 42, resulting in [42].
+ * // When parsing "not a number", it returns an Either.right with an error, resulting in an empty array [].
+ * ```
+ *
+ * @category lifting
+ * @since 2.0.0
+ */
+const liftEither = f => (...a) => {
+  const e = f(...a);
+  return Either.isLeft(e) ? [] : [e.right];
+};
+/**
+ * Check if a predicate holds true for every `ReadonlyArray` element.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+exports.liftEither = liftEither;
+const every = exports.every = /*#__PURE__*/(0, _Function.dual)(2, (self, refinement) => self.every(refinement));
+/**
+ * Check if a predicate holds true for some `ReadonlyArray` element.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const some = exports.some = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => self.some(predicate));
+/**
+ * Extends an array with a function that maps each subarray to a value.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.extend([1, 2, 3], as => as.length)
+ * console.log(result) // [3, 2, 1]
+ *
+ * // Explanation:
+ * // The function maps each subarray starting from each element to its length.
+ * // The subarrays are: [1, 2, 3], [2, 3], [3].
+ * // The lengths are: 3, 2, 1.
+ * // Therefore, the result is [3, 2, 1].
+ * ```
+ *
+ * @since 2.0.0
+ */
+const extend = exports.extend = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => self.map((_, i, as) => f(as.slice(i))));
+/**
+ * Finds the minimum element in an array based on a comparator.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Order } from "effect"
+ *
+ * const result = Array.min([3, 1, 2], Order.number)
+ * console.log(result) // 1
+ * ```
+ *
+ * @since 2.0.0
+ */
+const min = exports.min = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => self.reduce(Order.min(O)));
+/**
+ * Finds the maximum element in an array based on a comparator.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, Order } from "effect"
+ *
+ * const result = Array.max([3, 1, 2], Order.number)
+ * console.log(result) // 3
+ * ```
+ *
+ * @since 2.0.0
+ */
+const max = exports.max = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => self.reduce(Order.max(O)));
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+const unfold = (b, f) => {
+  const out = [];
+  let next = b;
+  let o;
+  while (Option.isSome(o = f(next))) {
+    const [a, b] = o.value;
+    out.push(a);
+    next = b;
+  }
+  return out;
+};
+/**
+ * This function creates and returns a new `Order` for an array of values based on a given `Order` for the elements of the array.
+ * The returned `Order` compares two arrays by applying the given `Order` to each element in the arrays.
+ * If all elements are equal, the arrays are then compared based on their length.
+ * It is useful when you need to compare two arrays of the same type and you have a specific way of comparing each element of the array.
+ *
+ * @category instances
+ * @since 2.0.0
+ */
+exports.unfold = unfold;
+const getOrder = exports.getOrder = Order.array;
+/**
+ * Creates an equivalence relation for arrays.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const eq = Array.getEquivalence<number>((a, b) => a === b)
+ * console.log(eq([1, 2, 3], [1, 2, 3])) // true
+ * ```
+ *
+ * @category instances
+ * @since 2.0.0
+ */
+const getEquivalence = exports.getEquivalence = Equivalence.array;
+/**
+ * Performs a side-effect for each element of the `Iterable`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * Array.forEach([1, 2, 3], n => console.log(n)) // 1, 2, 3
+ * ```
+ *
+ * @since 2.0.0
+ */
+const forEach = exports.forEach = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => fromIterable(self).forEach((a, i) => f(a, i)));
+/**
+ * Remove duplicates from an `Iterable` using the provided `isEquivalent` function,
+ * preserving the order of the first occurrence of each element.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.dedupeWith([1, 2, 2, 3, 3, 3], (a, b) => a === b)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const dedupeWith = exports.dedupeWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => {
+  const input = fromIterable(self);
+  if (isNonEmptyReadonlyArray(input)) {
+    const out = [headNonEmpty(input)];
+    const rest = tailNonEmpty(input);
+    for (const r of rest) {
+      if (out.every(a => !isEquivalent(r, a))) {
+        out.push(r);
+      }
+    }
+    return out;
+  }
+  return [];
+});
+/**
+ * Remove duplicates from an `Iterable`, preserving the order of the first occurrence of each element.
+ * The equivalence used to compare elements is provided by `Equal.equivalence()` from the `Equal` module.
+ *
+ * @since 2.0.0
+ */
+const dedupe = self => dedupeWith(self, Equal.equivalence());
+/**
+ * Deduplicates adjacent elements that are identical using the provided `isEquivalent` function.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.dedupeAdjacentWith([1, 1, 2, 2, 3, 3], (a, b) => a === b)
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+exports.dedupe = dedupe;
+const dedupeAdjacentWith = exports.dedupeAdjacentWith = /*#__PURE__*/(0, _Function.dual)(2, (self, isEquivalent) => {
+  const out = [];
+  let lastA = Option.none();
+  for (const a of self) {
+    if (Option.isNone(lastA) || !isEquivalent(a, lastA.value)) {
+      out.push(a);
+      lastA = Option.some(a);
+    }
+  }
+  return out;
+});
+/**
+ * Deduplicates adjacent elements that are identical.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.dedupeAdjacent([1, 1, 2, 2, 3, 3])
+ * console.log(result) // [1, 2, 3]
+ * ```
+ *
+ * @since 2.0.0
+ */
+const dedupeAdjacent = exports.dedupeAdjacent = /*#__PURE__*/dedupeAdjacentWith(/*#__PURE__*/Equal.equivalence());
+/**
+ * Joins the elements together with "sep" in the middle.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const strings = ["a", "b", "c"]
+ * const joined = Array.join(strings, "-")
+ * console.log(joined) // "a-b-c"
+ * ```
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const join = exports.join = /*#__PURE__*/(0, _Function.dual)(2, (self, sep) => fromIterable(self).join(sep));
+/**
+ * Statefully maps over the chunk, producing new elements of type `B`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.mapAccum([1, 2, 3], 0, (acc, n) => [acc + n, acc + n])
+ * console.log(result) // [6, [1, 3, 6]]
+ * ```
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const mapAccum = exports.mapAccum = /*#__PURE__*/(0, _Function.dual)(3, (self, s, f) => {
+  let i = 0;
+  let s1 = s;
+  const out = [];
+  for (const a of self) {
+    const r = f(s1, a, i);
+    s1 = r[0];
+    out.push(r[1]);
+    i++;
+  }
+  return [s1, out];
+});
+/**
+ * Zips this chunk crosswise with the specified chunk using the specified combiner.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.cartesianWith([1, 2], ["a", "b"], (a, b) => `${a}-${b}`)
+ * console.log(result) // ["1-a", "1-b", "2-a", "2-b"]
+ * ```
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const cartesianWith = exports.cartesianWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => flatMap(self, a => map(that, b => f(a, b))));
+/**
+ * Zips this chunk crosswise with the specified chunk.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array } from "effect"
+ *
+ * const result = Array.cartesian([1, 2], ["a", "b"])
+ * console.log(result) // [[1, "a"], [1, "b"], [2, "a"], [2, "b"]]
+ * ```
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const cartesian = exports.cartesian = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => cartesianWith(self, that, (a, b) => [a, b]));
+// -------------------------------------------------------------------------------------
+// do notation
+// -------------------------------------------------------------------------------------
+/**
+ * The "do simulation" for array allows you to sequentially apply operations to the elements of arrays, just as nested loops allow you to go through all combinations of elements in an arrays.
+ *
+ * It can be used to simulate "array comprehension".
+ * It's a technique that allows you to create new arrays by iterating over existing ones and applying specific **conditions** or **transformations** to the elements. It's like assembling a new collection from pieces of other collections based on certain rules.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Array` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ * 5. Regular `Array` functions like `map` and `filter` can still be used within the do simulation. These functions will receive the accumulated variables as arguments within the scope
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, pipe } from "effect"
+ *
+ * const doResult = pipe(
+ *   Array.Do,
+ *   Array.bind("x", () => [1, 3, 5]),
+ *   Array.bind("y", () => [2, 4, 6]),
+ *   Array.filter(({ x, y }) => x < y), // condition
+ *   Array.map(({ x, y }) => [x, y] as const) // transformation
+ * )
+ * console.log(doResult) // [[1, 2], [1, 4], [1, 6], [3, 4], [3, 6], [5, 6]]
+ *
+ * // equivalent
+ * const x = [1, 3, 5],
+ *       y = [2, 4, 6],
+ *       result = [];
+ * for(let i = 0; i < x.length; i++) {
+ *   for(let j = 0; j < y.length; j++) {
+ *     const _x = x[i], _y = y[j];
+ *     if(_x < _y) result.push([_x, _y] as const)
+ *   }
+ * }
+ * ```
+ *
+ * @see {@link bindTo}
+ * @see {@link bind}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 3.2.0
+ */
+const Do = exports.Do = /*#__PURE__*/of({});
+/**
+ * The "do simulation" for array allows you to sequentially apply operations to the elements of arrays, just as nested loops allow you to go through all combinations of elements in an arrays.
+ *
+ * It can be used to simulate "array comprehension".
+ * It's a technique that allows you to create new arrays by iterating over existing ones and applying specific **conditions** or **transformations** to the elements. It's like assembling a new collection from pieces of other collections based on certain rules.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Array` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ * 5. Regular `Array` functions like `map` and `filter` can still be used within the do simulation. These functions will receive the accumulated variables as arguments within the scope
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, pipe } from "effect"
+ *
+ * const doResult = pipe(
+ *   Array.Do,
+ *   Array.bind("x", () => [1, 3, 5]),
+ *   Array.bind("y", () => [2, 4, 6]),
+ *   Array.filter(({ x, y }) => x < y), // condition
+ *   Array.map(({ x, y }) => [x, y] as const) // transformation
+ * )
+ * console.log(doResult) // [[1, 2], [1, 4], [1, 6], [3, 4], [3, 6], [5, 6]]
+ *
+ * // equivalent
+ * const x = [1, 3, 5],
+ *       y = [2, 4, 6],
+ *       result = [];
+ * for(let i = 0; i < x.length; i++) {
+ *   for(let j = 0; j < y.length; j++) {
+ *     const _x = x[i], _y = y[j];
+ *     if(_x < _y) result.push([_x, _y] as const)
+ *   }
+ * }
+ * ```
+ *
+ * @see {@link bindTo}
+ * @see {@link Do}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 3.2.0
+ */
+const bind = exports.bind = /*#__PURE__*/internalDoNotation.bind(map, flatMap);
+/**
+ * The "do simulation" for array allows you to sequentially apply operations to the elements of arrays, just as nested loops allow you to go through all combinations of elements in an arrays.
+ *
+ * It can be used to simulate "array comprehension".
+ * It's a technique that allows you to create new arrays by iterating over existing ones and applying specific **conditions** or **transformations** to the elements. It's like assembling a new collection from pieces of other collections based on certain rules.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Array` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ * 5. Regular `Array` functions like `map` and `filter` can still be used within the do simulation. These functions will receive the accumulated variables as arguments within the scope
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Array, pipe } from "effect"
+ *
+ * const doResult = pipe(
+ *   Array.Do,
+ *   Array.bind("x", () => [1, 3, 5]),
+ *   Array.bind("y", () => [2, 4, 6]),
+ *   Array.filter(({ x, y }) => x < y), // condition
+ *   Array.map(({ x, y }) => [x, y] as const) // transformation
+ * )
+ * console.log(doResult) // [[1, 2], [1, 4], [1, 6], [3, 4], [3, 6], [5, 6]]
+ *
+ * // equivalent
+ * const x = [1, 3, 5],
+ *       y = [2, 4, 6],
+ *       result = [];
+ * for(let i = 0; i < x.length; i++) {
+ *   for(let j = 0; j < y.length; j++) {
+ *     const _x = x[i], _y = y[j];
+ *     if(_x < _y) result.push([_x, _y] as const)
+ *   }
+ * }
+ * ```
+ *
+ * @see {@link bindTo}
+ * @see {@link Do}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 3.2.0
+ */
+const bindTo = exports.bindTo = /*#__PURE__*/internalDoNotation.bindTo(map);
+const let_ = exports.let = /*#__PURE__*/internalDoNotation.let_(map);
+//# sourceMappingURL=Array.js.map

backend/node_modules/effect/dist/cjs/BigDecimal.js

@@ -0,0 +1,1116 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unsafeToNumber = exports.unsafeRemainder = exports.unsafeMakeNormalized = exports.unsafeFromString = exports.unsafeFromNumber = exports.unsafeDivide = exports.truncate = exports.toExponential = exports.sumAll = exports.sum = exports.subtract = exports.sign = exports.scale = exports.safeFromNumber = exports.roundTerminal = exports.round = exports.remainder = exports.normalize = exports.negate = exports.multiply = exports.min = exports.max = exports.make = exports.lessThanOrEqualTo = exports.lessThan = exports.isZero = exports.isPositive = exports.isNegative = exports.isInteger = exports.isBigDecimal = exports.greaterThanOrEqualTo = exports.greaterThan = exports.fromString = exports.fromNumber = exports.fromBigInt = exports.format = exports.floor = exports.equals = exports.divide = exports.digitAt = exports.clamp = exports.ceil = exports.between = exports.abs = exports.TypeId = exports.Order = exports.Equivalence = void 0;
+var Equal = _interopRequireWildcard(require("./Equal.js"));
+var equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var Hash = _interopRequireWildcard(require("./Hash.js"));
+var _Inspectable = require("./Inspectable.js");
+var Option = _interopRequireWildcard(require("./Option.js"));
+var order = _interopRequireWildcard(require("./Order.js"));
+var _Pipeable = require("./Pipeable.js");
+var _Predicate = require("./Predicate.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This module provides utility functions and type class instances for working with the `BigDecimal` type in TypeScript.
+ * It includes functions for basic arithmetic operations, as well as type class instances for `Equivalence` and `Order`.
+ *
+ * A `BigDecimal` allows storing any real number to arbitrary precision; which avoids common floating point errors
+ * (such as 0.1 + 0.2 ≠ 0.3) at the cost of complexity.
+ *
+ * Internally, `BigDecimal` uses a `BigInt` object, paired with a 64-bit integer which determines the position of the
+ * decimal point. Therefore, the precision *is not* actually arbitrary, but limited to 2<sup>63</sup> decimal places.
+ *
+ * It is not recommended to convert a floating point number to a decimal directly, as the floating point representation
+ * may be unexpected.
+ *
+ * @module BigDecimal
+ * @since 2.0.0
+ * @see {@link module:BigInt} for more similar operations on `bigint` types
+ * @see {@link module:Number} for more similar operations on `number` types
+ */
+
+const DEFAULT_PRECISION = 100;
+const FINITE_INT_REGEX = /^[+-]?\d+$/;
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const TypeId = exports.TypeId = /*#__PURE__*/Symbol.for("effect/BigDecimal");
+const BigDecimalProto = {
+  [TypeId]: TypeId,
+  [Hash.symbol]() {
+    const normalized = normalize(this);
+    return (0, _Function.pipe)(Hash.hash(normalized.value), Hash.combine(Hash.number(normalized.scale)), Hash.cached(this));
+  },
+  [Equal.symbol](that) {
+    return isBigDecimal(that) && equals(this, that);
+  },
+  toString() {
+    return `BigDecimal(${format(this)})`;
+  },
+  toJSON() {
+    return {
+      _id: "BigDecimal",
+      value: String(this.value),
+      scale: this.scale
+    };
+  },
+  [_Inspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return (0, _Pipeable.pipeArguments)(this, arguments);
+  }
+};
+/**
+ * Checks if a given value is a `BigDecimal`.
+ *
+ * @since 2.0.0
+ * @category guards
+ */
+const isBigDecimal = u => (0, _Predicate.hasProperty)(u, TypeId);
+/**
+ * Creates a `BigDecimal` from a `bigint` value and a scale.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.isBigDecimal = isBigDecimal;
+const make = (value, scale) => {
+  const o = Object.create(BigDecimalProto);
+  o.value = value;
+  o.scale = scale;
+  return o;
+};
+/**
+ * Internal function used to create pre-normalized `BigDecimal`s.
+ *
+ * @internal
+ */
+exports.make = make;
+const unsafeMakeNormalized = (value, scale) => {
+  if (value !== bigint0 && value % bigint10 === bigint0) {
+    throw new RangeError("Value must be normalized");
+  }
+  const o = make(value, scale);
+  o.normalized = o;
+  return o;
+};
+exports.unsafeMakeNormalized = unsafeMakeNormalized;
+const bigint0 = /*#__PURE__*/BigInt(0);
+const bigint1 = /*#__PURE__*/BigInt(1);
+const bigint10 = /*#__PURE__*/BigInt(10);
+const zero = /*#__PURE__*/unsafeMakeNormalized(bigint0, 0);
+/**
+ * Normalizes a given `BigDecimal` by removing trailing zeros.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { normalize, make, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(normalize(unsafeFromString("123.00000")), normalize(make(123n, 0)))
+ * assert.deepStrictEqual(normalize(unsafeFromString("12300000")), normalize(make(123n, -5)))
+ * ```
+ *
+ * @since 2.0.0
+ * @category scaling
+ */
+const normalize = self => {
+  if (self.normalized === undefined) {
+    if (self.value === bigint0) {
+      self.normalized = zero;
+    } else {
+      const digits = `${self.value}`;
+      let trail = 0;
+      for (let i = digits.length - 1; i >= 0; i--) {
+        if (digits[i] === "0") {
+          trail++;
+        } else {
+          break;
+        }
+      }
+      if (trail === 0) {
+        self.normalized = self;
+      }
+      const value = BigInt(digits.substring(0, digits.length - trail));
+      const scale = self.scale - trail;
+      self.normalized = unsafeMakeNormalized(value, scale);
+    }
+  }
+  return self.normalized;
+};
+/**
+ * Scales a given `BigDecimal` to the specified scale.
+ *
+ * If the given scale is smaller than the current scale, the value will be rounded down to
+ * the nearest integer.
+ *
+ * @since 2.0.0
+ * @category scaling
+ */
+exports.normalize = normalize;
+const scale = exports.scale = /*#__PURE__*/(0, _Function.dual)(2, (self, scale) => {
+  if (scale > self.scale) {
+    return make(self.value * bigint10 ** BigInt(scale - self.scale), scale);
+  }
+  if (scale < self.scale) {
+    return make(self.value / bigint10 ** BigInt(self.scale - scale), scale);
+  }
+  return self;
+});
+/**
+ * Provides an addition operation on `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { sum, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(sum(unsafeFromString("2"), unsafeFromString("3")), unsafeFromString("5"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const sum = exports.sum = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (that.value === bigint0) {
+    return self;
+  }
+  if (self.value === bigint0) {
+    return that;
+  }
+  if (self.scale > that.scale) {
+    return make(scale(that, self.scale).value + self.value, self.scale);
+  }
+  if (self.scale < that.scale) {
+    return make(scale(self, that.scale).value + that.value, that.scale);
+  }
+  return make(self.value + that.value, self.scale);
+});
+/**
+ * Provides a multiplication operation on `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { multiply, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(multiply(unsafeFromString("2"), unsafeFromString("3")), unsafeFromString("6"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const multiply = exports.multiply = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (that.value === bigint0 || self.value === bigint0) {
+    return zero;
+  }
+  return make(self.value * that.value, self.scale + that.scale);
+});
+/**
+ * Provides a subtraction operation on `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { subtract, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(subtract(unsafeFromString("2"), unsafeFromString("3")), unsafeFromString("-1"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const subtract = exports.subtract = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (that.value === bigint0) {
+    return self;
+  }
+  if (self.value === bigint0) {
+    return make(-that.value, that.scale);
+  }
+  if (self.scale > that.scale) {
+    return make(self.value - scale(that, self.scale).value, self.scale);
+  }
+  if (self.scale < that.scale) {
+    return make(scale(self, that.scale).value - that.value, that.scale);
+  }
+  return make(self.value - that.value, self.scale);
+});
+/**
+ * Internal function used for arbitrary precision division.
+ */
+const divideWithPrecision = (num, den, scale, precision) => {
+  const numNegative = num < bigint0;
+  const denNegative = den < bigint0;
+  const negateResult = numNegative !== denNegative;
+  num = numNegative ? -num : num;
+  den = denNegative ? -den : den;
+  // Shift digits until numerator is larger than denominator (set scale appropriately).
+  while (num < den) {
+    num *= bigint10;
+    scale++;
+  }
+  // First division.
+  let quotient = num / den;
+  let remainder = num % den;
+  if (remainder === bigint0) {
+    // No remainder, return immediately.
+    return make(negateResult ? -quotient : quotient, scale);
+  }
+  // The quotient is guaranteed to be non-negative at this point. No need to consider sign.
+  let count = `${quotient}`.length;
+  // Shift the remainder by 1 decimal; The quotient will be 1 digit upon next division.
+  remainder *= bigint10;
+  while (remainder !== bigint0 && count < precision) {
+    const q = remainder / den;
+    const r = remainder % den;
+    quotient = quotient * bigint10 + q;
+    remainder = r * bigint10;
+    count++;
+    scale++;
+  }
+  if (remainder !== bigint0) {
+    // Round final number with remainder.
+    quotient += roundTerminal(remainder / den);
+  }
+  return make(negateResult ? -quotient : quotient, scale);
+};
+/**
+ * Internal function used for rounding.
+ *
+ * Returns 1 if the most significant digit is >= 5, otherwise 0.
+ *
+ * This is used after dividing a number by a power of ten and rounding the last digit.
+ *
+ * @internal
+ */
+const roundTerminal = n => {
+  const pos = n >= bigint0 ? 0 : 1;
+  return Number(`${n}`[pos]) < 5 ? bigint0 : bigint1;
+};
+/**
+ * Provides a division operation on `BigDecimal`s.
+ *
+ * If the dividend is not a multiple of the divisor the result will be a `BigDecimal` value
+ * which represents the integer division rounded down to the nearest integer.
+ *
+ * If the divisor is `0`, the result will be `None`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigDecimal.divide(BigDecimal.unsafeFromString("6"), BigDecimal.unsafeFromString("3")), Option.some(BigDecimal.unsafeFromString("2")))
+ * assert.deepStrictEqual(BigDecimal.divide(BigDecimal.unsafeFromString("6"), BigDecimal.unsafeFromString("4")), Option.some(BigDecimal.unsafeFromString("1.5")))
+ * assert.deepStrictEqual(BigDecimal.divide(BigDecimal.unsafeFromString("6"), BigDecimal.unsafeFromString("0")), Option.none())
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+exports.roundTerminal = roundTerminal;
+const divide = exports.divide = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (that.value === bigint0) {
+    return Option.none();
+  }
+  if (self.value === bigint0) {
+    return Option.some(zero);
+  }
+  const scale = self.scale - that.scale;
+  if (self.value === that.value) {
+    return Option.some(make(bigint1, scale));
+  }
+  return Option.some(divideWithPrecision(self.value, that.value, scale, DEFAULT_PRECISION));
+});
+/**
+ * Provides an unsafe division operation on `BigDecimal`s.
+ *
+ * If the dividend is not a multiple of the divisor the result will be a `BigDecimal` value
+ * which represents the integer division rounded down to the nearest integer.
+ *
+ * Throws a `RangeError` if the divisor is `0`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeDivide, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(unsafeDivide(unsafeFromString("6"), unsafeFromString("3")), unsafeFromString("2"))
+ * assert.deepStrictEqual(unsafeDivide(unsafeFromString("6"), unsafeFromString("4")), unsafeFromString("1.5"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const unsafeDivide = exports.unsafeDivide = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (that.value === bigint0) {
+    throw new RangeError("Division by zero");
+  }
+  if (self.value === bigint0) {
+    return zero;
+  }
+  const scale = self.scale - that.scale;
+  if (self.value === that.value) {
+    return make(bigint1, scale);
+  }
+  return divideWithPrecision(self.value, that.value, scale, DEFAULT_PRECISION);
+});
+/**
+ * @since 2.0.0
+ * @category instances
+ */
+const Order = exports.Order = /*#__PURE__*/order.make((self, that) => {
+  const scmp = order.number(sign(self), sign(that));
+  if (scmp !== 0) {
+    return scmp;
+  }
+  if (self.scale > that.scale) {
+    return order.bigint(self.value, scale(that, self.scale).value);
+  }
+  if (self.scale < that.scale) {
+    return order.bigint(scale(self, that.scale).value, that.value);
+  }
+  return order.bigint(self.value, that.value);
+});
+/**
+ * Returns `true` if the first argument is less than the second, otherwise `false`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { lessThan, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(lessThan(unsafeFromString("2"), unsafeFromString("3")), true)
+ * assert.deepStrictEqual(lessThan(unsafeFromString("3"), unsafeFromString("3")), false)
+ * assert.deepStrictEqual(lessThan(unsafeFromString("4"), unsafeFromString("3")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const lessThan = exports.lessThan = /*#__PURE__*/order.lessThan(Order);
+/**
+ * Checks if a given `BigDecimal` is less than or equal to the provided one.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { lessThanOrEqualTo, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(lessThanOrEqualTo(unsafeFromString("2"), unsafeFromString("3")), true)
+ * assert.deepStrictEqual(lessThanOrEqualTo(unsafeFromString("3"), unsafeFromString("3")), true)
+ * assert.deepStrictEqual(lessThanOrEqualTo(unsafeFromString("4"), unsafeFromString("3")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const lessThanOrEqualTo = exports.lessThanOrEqualTo = /*#__PURE__*/order.lessThanOrEqualTo(Order);
+/**
+ * Returns `true` if the first argument is greater than the second, otherwise `false`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { greaterThan, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(greaterThan(unsafeFromString("2"), unsafeFromString("3")), false)
+ * assert.deepStrictEqual(greaterThan(unsafeFromString("3"), unsafeFromString("3")), false)
+ * assert.deepStrictEqual(greaterThan(unsafeFromString("4"), unsafeFromString("3")), true)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const greaterThan = exports.greaterThan = /*#__PURE__*/order.greaterThan(Order);
+/**
+ * Checks if a given `BigDecimal` is greater than or equal to the provided one.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { greaterThanOrEqualTo, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(greaterThanOrEqualTo(unsafeFromString("2"), unsafeFromString("3")), false)
+ * assert.deepStrictEqual(greaterThanOrEqualTo(unsafeFromString("3"), unsafeFromString("3")), true)
+ * assert.deepStrictEqual(greaterThanOrEqualTo(unsafeFromString("4"), unsafeFromString("3")), true)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const greaterThanOrEqualTo = exports.greaterThanOrEqualTo = /*#__PURE__*/order.greaterThanOrEqualTo(Order);
+/**
+ * Checks if a `BigDecimal` is between a `minimum` and `maximum` value (inclusive).
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal } from "effect"
+ *
+ * const between = BigDecimal.between({
+ *   minimum: BigDecimal.unsafeFromString("1"),
+ *   maximum: BigDecimal.unsafeFromString("5") }
+ * )
+ *
+ * assert.deepStrictEqual(between(BigDecimal.unsafeFromString("3")), true)
+ * assert.deepStrictEqual(between(BigDecimal.unsafeFromString("0")), false)
+ * assert.deepStrictEqual(between(BigDecimal.unsafeFromString("6")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const between = exports.between = /*#__PURE__*/order.between(Order);
+/**
+ * Restricts the given `BigDecimal` to be within the range specified by the `minimum` and `maximum` values.
+ *
+ * - If the `BigDecimal` is less than the `minimum` value, the function returns the `minimum` value.
+ * - If the `BigDecimal` is greater than the `maximum` value, the function returns the `maximum` value.
+ * - Otherwise, it returns the original `BigDecimal`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal } from "effect"
+ *
+ * const clamp = BigDecimal.clamp({
+ *   minimum: BigDecimal.unsafeFromString("1"),
+ *   maximum: BigDecimal.unsafeFromString("5") }
+ * )
+ *
+ * assert.deepStrictEqual(clamp(BigDecimal.unsafeFromString("3")), BigDecimal.unsafeFromString("3"))
+ * assert.deepStrictEqual(clamp(BigDecimal.unsafeFromString("0")), BigDecimal.unsafeFromString("1"))
+ * assert.deepStrictEqual(clamp(BigDecimal.unsafeFromString("6")), BigDecimal.unsafeFromString("5"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const clamp = exports.clamp = /*#__PURE__*/order.clamp(Order);
+/**
+ * Returns the minimum between two `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { min, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(min(unsafeFromString("2"), unsafeFromString("3")), unsafeFromString("2"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const min = exports.min = /*#__PURE__*/order.min(Order);
+/**
+ * Returns the maximum between two `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { max, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(max(unsafeFromString("2"), unsafeFromString("3")), unsafeFromString("3"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const max = exports.max = /*#__PURE__*/order.max(Order);
+/**
+ * Determines the sign of a given `BigDecimal`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { sign, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(sign(unsafeFromString("-5")), -1)
+ * assert.deepStrictEqual(sign(unsafeFromString("0")), 0)
+ * assert.deepStrictEqual(sign(unsafeFromString("5")), 1)
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const sign = n => n.value === bigint0 ? 0 : n.value < bigint0 ? -1 : 1;
+/**
+ * Determines the absolute value of a given `BigDecimal`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { abs, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(abs(unsafeFromString("-5")), unsafeFromString("5"))
+ * assert.deepStrictEqual(abs(unsafeFromString("0")), unsafeFromString("0"))
+ * assert.deepStrictEqual(abs(unsafeFromString("5")), unsafeFromString("5"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+exports.sign = sign;
+const abs = n => n.value < bigint0 ? make(-n.value, n.scale) : n;
+/**
+ * Provides a negate operation on `BigDecimal`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { negate, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(negate(unsafeFromString("3")), unsafeFromString("-3"))
+ * assert.deepStrictEqual(negate(unsafeFromString("-6")), unsafeFromString("6"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+exports.abs = abs;
+const negate = n => make(-n.value, n.scale);
+/**
+ * Returns the remainder left over when one operand is divided by a second operand.
+ *
+ * If the divisor is `0`, the result will be `None`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigDecimal.remainder(BigDecimal.unsafeFromString("2"), BigDecimal.unsafeFromString("2")), Option.some(BigDecimal.unsafeFromString("0")))
+ * assert.deepStrictEqual(BigDecimal.remainder(BigDecimal.unsafeFromString("3"), BigDecimal.unsafeFromString("2")), Option.some(BigDecimal.unsafeFromString("1")))
+ * assert.deepStrictEqual(BigDecimal.remainder(BigDecimal.unsafeFromString("-4"), BigDecimal.unsafeFromString("2")), Option.some(BigDecimal.unsafeFromString("0")))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+exports.negate = negate;
+const remainder = exports.remainder = /*#__PURE__*/(0, _Function.dual)(2, (self, divisor) => {
+  if (divisor.value === bigint0) {
+    return Option.none();
+  }
+  const max = Math.max(self.scale, divisor.scale);
+  return Option.some(make(scale(self, max).value % scale(divisor, max).value, max));
+});
+/**
+ * Returns the remainder left over when one operand is divided by a second operand.
+ *
+ * Throws a `RangeError` if the divisor is `0`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeRemainder, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(unsafeRemainder(unsafeFromString("2"), unsafeFromString("2")), unsafeFromString("0"))
+ * assert.deepStrictEqual(unsafeRemainder(unsafeFromString("3"), unsafeFromString("2")), unsafeFromString("1"))
+ * assert.deepStrictEqual(unsafeRemainder(unsafeFromString("-4"), unsafeFromString("2")), unsafeFromString("0"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category math
+ */
+const unsafeRemainder = exports.unsafeRemainder = /*#__PURE__*/(0, _Function.dual)(2, (self, divisor) => {
+  if (divisor.value === bigint0) {
+    throw new RangeError("Division by zero");
+  }
+  const max = Math.max(self.scale, divisor.scale);
+  return make(scale(self, max).value % scale(divisor, max).value, max);
+});
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Equivalence = exports.Equivalence = /*#__PURE__*/equivalence.make((self, that) => {
+  if (self.scale > that.scale) {
+    return scale(that, self.scale).value === self.value;
+  }
+  if (self.scale < that.scale) {
+    return scale(self, that.scale).value === that.value;
+  }
+  return self.value === that.value;
+});
+/**
+ * Checks if two `BigDecimal`s are equal.
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const equals = exports.equals = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => Equivalence(self, that));
+/**
+ * Creates a `BigDecimal` from a `bigint` value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromBigInt = n => make(n, 0);
+/**
+ * Creates a `BigDecimal` from a `number` value.
+ *
+ * It is not recommended to convert a floating point number to a decimal directly,
+ * as the floating point representation may be unexpected.
+ *
+ * Throws a `RangeError` if the number is not finite (`NaN`, `+Infinity` or `-Infinity`).
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeFromNumber, make } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(unsafeFromNumber(123), make(123n, 0))
+ * assert.deepStrictEqual(unsafeFromNumber(123.456), make(123456n, 3))
+ * ```
+ *
+ * @since 3.11.0
+ * @category constructors
+ */
+exports.fromBigInt = fromBigInt;
+const unsafeFromNumber = n => Option.getOrThrowWith(safeFromNumber(n), () => new RangeError(`Number must be finite, got ${n}`));
+/**
+ * Creates a `BigDecimal` from a `number` value.
+ *
+ * It is not recommended to convert a floating point number to a decimal directly,
+ * as the floating point representation may be unexpected.
+ *
+ * Throws a `RangeError` if the number is not finite (`NaN`, `+Infinity` or `-Infinity`).
+ *
+ * @since 2.0.0
+ * @category constructors
+ * @deprecated Use {@link unsafeFromNumber} instead.
+ */
+exports.unsafeFromNumber = unsafeFromNumber;
+const fromNumber = exports.fromNumber = unsafeFromNumber;
+// TODO(4.0): Rename this to `fromNumber` after removing the current, unsafe implementation of `fromNumber`.
+/**
+ * Creates a `BigDecimal` from a `number` value.
+ *
+ * It is not recommended to convert a floating point number to a decimal directly,
+ * as the floating point representation may be unexpected.
+ *
+ * Returns `None` if the number is not finite (`NaN`, `+Infinity` or `-Infinity`).
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigDecimal.safeFromNumber(123), Option.some(BigDecimal.make(123n, 0)))
+ * assert.deepStrictEqual(BigDecimal.safeFromNumber(123.456), Option.some(BigDecimal.make(123456n, 3)))
+ * assert.deepStrictEqual(BigDecimal.safeFromNumber(Infinity), Option.none())
+ * ```
+ *
+ * @since 3.11.0
+ * @category constructors
+ */
+const safeFromNumber = n => {
+  if (!Number.isFinite(n)) {
+    return Option.none();
+  }
+  const string = `${n}`;
+  if (string.includes("e")) {
+    return fromString(string);
+  }
+  const [lead, trail = ""] = string.split(".");
+  return Option.some(make(BigInt(`${lead}${trail}`), trail.length));
+};
+/**
+ * Parses a numerical `string` into a `BigDecimal`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigDecimal, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigDecimal.fromString("123"), Option.some(BigDecimal.make(123n, 0)))
+ * assert.deepStrictEqual(BigDecimal.fromString("123.456"), Option.some(BigDecimal.make(123456n, 3)))
+ * assert.deepStrictEqual(BigDecimal.fromString("123.abc"), Option.none())
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.safeFromNumber = safeFromNumber;
+const fromString = s => {
+  if (s === "") {
+    return Option.some(zero);
+  }
+  let base;
+  let exp;
+  const seperator = s.search(/[eE]/);
+  if (seperator !== -1) {
+    const trail = s.slice(seperator + 1);
+    base = s.slice(0, seperator);
+    exp = Number(trail);
+    if (base === "" || !Number.isSafeInteger(exp) || !FINITE_INT_REGEX.test(trail)) {
+      return Option.none();
+    }
+  } else {
+    base = s;
+    exp = 0;
+  }
+  let digits;
+  let offset;
+  const dot = base.search(/\./);
+  if (dot !== -1) {
+    const lead = base.slice(0, dot);
+    const trail = base.slice(dot + 1);
+    digits = `${lead}${trail}`;
+    offset = trail.length;
+  } else {
+    digits = base;
+    offset = 0;
+  }
+  if (!FINITE_INT_REGEX.test(digits)) {
+    return Option.none();
+  }
+  const scale = offset - exp;
+  if (!Number.isSafeInteger(scale)) {
+    return Option.none();
+  }
+  return Option.some(make(BigInt(digits), scale));
+};
+/**
+ * Parses a numerical `string` into a `BigDecimal`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeFromString, make } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(unsafeFromString("123"), make(123n, 0))
+ * assert.deepStrictEqual(unsafeFromString("123.456"), make(123456n, 3))
+ * assert.throws(() => unsafeFromString("123.abc"))
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.fromString = fromString;
+const unsafeFromString = s => Option.getOrThrowWith(fromString(s), () => new Error("Invalid numerical string"));
+/**
+ * Formats a given `BigDecimal` as a `string`.
+ *
+ * If the scale of the `BigDecimal` is greater than or equal to 16, the `BigDecimal` will
+ * be formatted in scientific notation.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { format, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(format(unsafeFromString("-5")), "-5")
+ * assert.deepStrictEqual(format(unsafeFromString("123.456")), "123.456")
+ * assert.deepStrictEqual(format(unsafeFromString("-0.00000123")), "-0.00000123")
+ * ```
+ *
+ * @since 2.0.0
+ * @category conversions
+ */
+exports.unsafeFromString = unsafeFromString;
+const format = n => {
+  const normalized = normalize(n);
+  if (Math.abs(normalized.scale) >= 16) {
+    return toExponential(normalized);
+  }
+  const negative = normalized.value < bigint0;
+  const absolute = negative ? `${normalized.value}`.substring(1) : `${normalized.value}`;
+  let before;
+  let after;
+  if (normalized.scale >= absolute.length) {
+    before = "0";
+    after = "0".repeat(normalized.scale - absolute.length) + absolute;
+  } else {
+    const location = absolute.length - normalized.scale;
+    if (location > absolute.length) {
+      const zeros = location - absolute.length;
+      before = `${absolute}${"0".repeat(zeros)}`;
+      after = "";
+    } else {
+      after = absolute.slice(location);
+      before = absolute.slice(0, location);
+    }
+  }
+  const complete = after === "" ? before : `${before}.${after}`;
+  return negative ? `-${complete}` : complete;
+};
+/**
+ * Formats a given `BigDecimal` as a `string` in scientific notation.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { toExponential, make } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(toExponential(make(123456n, -5)), "1.23456e+10")
+ * ```
+ *
+ * @since 3.11.0
+ * @category conversions
+ */
+exports.format = format;
+const toExponential = n => {
+  if (isZero(n)) {
+    return "0e+0";
+  }
+  const normalized = normalize(n);
+  const digits = `${abs(normalized).value}`;
+  const head = digits.slice(0, 1);
+  const tail = digits.slice(1);
+  let output = `${isNegative(normalized) ? "-" : ""}${head}`;
+  if (tail !== "") {
+    output += `.${tail}`;
+  }
+  const exp = tail.length - normalized.scale;
+  return `${output}e${exp >= 0 ? "+" : ""}${exp}`;
+};
+/**
+ * Converts a `BigDecimal` to a `number`.
+ *
+ * This function will produce incorrect results if the `BigDecimal` exceeds the 64-bit range of a `number`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeToNumber, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(unsafeToNumber(unsafeFromString("123.456")), 123.456)
+ * ```
+ *
+ * @since 2.0.0
+ * @category conversions
+ */
+exports.toExponential = toExponential;
+const unsafeToNumber = n => Number(format(n));
+/**
+ * Checks if a given `BigDecimal` is an integer.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isInteger, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(isInteger(unsafeFromString("0")), true)
+ * assert.deepStrictEqual(isInteger(unsafeFromString("1")), true)
+ * assert.deepStrictEqual(isInteger(unsafeFromString("1.1")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+exports.unsafeToNumber = unsafeToNumber;
+const isInteger = n => normalize(n).scale <= 0;
+/**
+ * Checks if a given `BigDecimal` is `0`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isZero, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(isZero(unsafeFromString("0")), true)
+ * assert.deepStrictEqual(isZero(unsafeFromString("1")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+exports.isInteger = isInteger;
+const isZero = n => n.value === bigint0;
+/**
+ * Checks if a given `BigDecimal` is negative.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isNegative, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(isNegative(unsafeFromString("-1")), true)
+ * assert.deepStrictEqual(isNegative(unsafeFromString("0")), false)
+ * assert.deepStrictEqual(isNegative(unsafeFromString("1")), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+exports.isZero = isZero;
+const isNegative = n => n.value < bigint0;
+/**
+ * Checks if a given `BigDecimal` is positive.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isPositive, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(isPositive(unsafeFromString("-1")), false)
+ * assert.deepStrictEqual(isPositive(unsafeFromString("0")), false)
+ * assert.deepStrictEqual(isPositive(unsafeFromString("1")), true)
+ * ```
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+exports.isNegative = isNegative;
+const isPositive = n => n.value > bigint0;
+exports.isPositive = isPositive;
+const isBigDecimalArgs = args => isBigDecimal(args[0]);
+/**
+ * Calculate the ceiling of a `BigDecimal` at the given scale.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { ceil, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(ceil(unsafeFromString("145"), -1), unsafeFromString("150"))
+ * assert.deepStrictEqual(ceil(unsafeFromString("-14.5")), unsafeFromString("-14"))
+ * ```
+ *
+ * @since 3.16.0
+ * @category math
+ */
+const ceil = exports.ceil = /*#__PURE__*/(0, _Function.dual)(isBigDecimalArgs, (self, scale = 0) => {
+  const truncated = truncate(self, scale);
+  if (isPositive(self) && lessThan(truncated, self)) {
+    return sum(truncated, make(1n, scale));
+  }
+  return truncated;
+});
+/**
+ * Calculate the floor of a `BigDecimal` at the given scale.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { floor, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(floor(unsafeFromString("145"), -1), unsafeFromString("140"))
+ * assert.deepStrictEqual(floor(unsafeFromString("-14.5")), unsafeFromString("-15"))
+ * ```
+ *
+ * @since 3.16.0
+ * @category math
+ */
+const floor = exports.floor = /*#__PURE__*/(0, _Function.dual)(isBigDecimalArgs, (self, scale = 0) => {
+  const truncated = truncate(self, scale);
+  if (isNegative(self) && greaterThan(truncated, self)) {
+    return sum(truncated, make(-1n, scale));
+  }
+  return truncated;
+});
+/**
+ * Truncate a `BigDecimal` at the given scale. This is the same operation as rounding away from zero.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { truncate, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(truncate(unsafeFromString("145"), -1), unsafeFromString("140"))
+ * assert.deepStrictEqual(truncate(unsafeFromString("-14.5")), unsafeFromString("-14"))
+ * ```
+ *
+ * @since 3.16.0
+ * @category math
+ */
+const truncate = exports.truncate = /*#__PURE__*/(0, _Function.dual)(isBigDecimalArgs, (self, scale = 0) => {
+  if (self.scale <= scale) {
+    return self;
+  }
+  // BigInt division truncates towards zero
+  return make(self.value / 10n ** BigInt(self.scale - scale), scale);
+});
+/**
+ * Internal function used by `round` for `half-even` and `half-odd` rounding modes.
+ *
+ * Returns the digit at the position of the given `scale` within the `BigDecimal`.
+ *
+ * @internal
+ */
+const digitAt = exports.digitAt = /*#__PURE__*/(0, _Function.dual)(2, (self, scale) => {
+  if (self.scale < scale) {
+    return 0n;
+  }
+  const scaled = self.value / 10n ** BigInt(self.scale - scale);
+  return scaled % 10n;
+});
+/**
+ * Rounds a `BigDecimal` at the given scale with the specified rounding mode.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { round, unsafeFromString } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(round(unsafeFromString("145"), { mode: "from-zero", scale: -1 }), unsafeFromString("150"))
+ * assert.deepStrictEqual(round(unsafeFromString("-14.5")), unsafeFromString("-15"))
+ * ```
+ *
+ * @since 3.16.0
+ * @category math
+ */
+const round = exports.round = /*#__PURE__*/(0, _Function.dual)(isBigDecimalArgs, (self, options) => {
+  const mode = options?.mode ?? "half-from-zero";
+  const scale = options?.scale ?? 0;
+  switch (mode) {
+    case "ceil":
+      return ceil(self, scale);
+    case "floor":
+      return floor(self, scale);
+    case "to-zero":
+      return truncate(self, scale);
+    case "from-zero":
+      return isPositive(self) ? ceil(self, scale) : floor(self, scale);
+    case "half-ceil":
+      return floor(sum(self, make(5n, scale + 1)), scale);
+    case "half-floor":
+      return ceil(sum(self, make(-5n, scale + 1)), scale);
+    case "half-to-zero":
+      return isNegative(self) ? floor(sum(self, make(5n, scale + 1)), scale) : ceil(sum(self, make(-5n, scale + 1)), scale);
+    case "half-from-zero":
+      return isNegative(self) ? ceil(sum(self, make(-5n, scale + 1)), scale) : floor(sum(self, make(5n, scale + 1)), scale);
+  }
+  const halfCeil = floor(sum(self, make(5n, scale + 1)), scale);
+  const halfFloor = ceil(sum(self, make(-5n, scale + 1)), scale);
+  const digit = digitAt(halfCeil, scale);
+  switch (mode) {
+    case "half-even":
+      return equals(halfCeil, halfFloor) ? halfCeil : digit % 2n === 0n ? halfCeil : halfFloor;
+    case "half-odd":
+      return equals(halfCeil, halfFloor) ? halfCeil : digit % 2n === 0n ? halfFloor : halfCeil;
+  }
+});
+/**
+ * Takes an `Iterable` of `BigDecimal`s and returns their sum as a single `BigDecimal`
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeFromString, sumAll } from "effect/BigDecimal"
+ *
+ * assert.deepStrictEqual(sumAll([unsafeFromString("2"), unsafeFromString("3"), unsafeFromString("4")]), unsafeFromString("9"))
+ * ```
+ *
+ * @category math
+ * @since 3.16.0
+ */
+const sumAll = collection => {
+  let out = zero;
+  for (const n of collection) {
+    out = sum(out, n);
+  }
+  return out;
+};
+exports.sumAll = sumAll;
+//# sourceMappingURL=BigDecimal.js.map

backend/node_modules/effect/dist/cjs/BigDecimal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BigDecimal.js","names":["Equal","_interopRequireWildcard","require","equivalence","_Function","Hash","_Inspectable","Option","order","_Pipeable","_Predicate","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","DEFAULT_PRECISION","FINITE_INT_REGEX","TypeId","exports","Symbol","for","BigDecimalProto","symbol","normalized","normalize","pipe","hash","value","combine","number","scale","cached","that","isBigDecimal","equals","toString","format","toJSON","_id","String","NodeInspectSymbol","pipeArguments","arguments","u","hasProperty","make","create","unsafeMakeNormalized","bigint0","bigint10","RangeError","BigInt","bigint1","zero","self","undefined","digits","trail","length","substring","dual","sum","multiply","subtract","divideWithPrecision","num","den","precision","numNegative","denNegative","negateResult","quotient","remainder","count","q","roundTerminal","pos","Number","divide","none","some","unsafeDivide","Order","scmp","sign","bigint","lessThan","lessThanOrEqualTo","greaterThan","greaterThanOrEqualTo","between","clamp","min","max","abs","negate","divisor","Math","unsafeRemainder","Equivalence","fromBigInt","unsafeFromNumber","getOrThrowWith","safeFromNumber","fromNumber","isFinite","string","includes","fromString","lead","split","s","base","exp","seperator","search","slice","isSafeInteger","test","offset","dot","unsafeFromString","Error","toExponential","negative","absolute","before","after","repeat","location","zeros","complete","isZero","head","tail","output","isNegative","unsafeToNumber","isInteger","isPositive","isBigDecimalArgs","args","ceil","truncated","truncate","floor","digitAt","scaled","round","options","mode","halfCeil","halfFloor","digit","sumAll","collection","out"],"sources":["../../src/BigDecimal.ts"],"sourcesContent":[null],"mappings":";;;;;;AAmBA,IAAAA,KAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,WAAA,GAAAF,uBAAA,CAAAC,OAAA;AACA,IAAAE,SAAA,GAAAF,OAAA;AACA,IAAAG,IAAA,GAAAJ,uBAAA,CAAAC,OAAA;AACA,IAAAI,YAAA,GAAAJ,OAAA;AACA,IAAAK,MAAA,GAAAN,uBAAA,CAAAC,OAAA;AACA,IAAAM,KAAA,GAAAP,uBAAA,CAAAC,OAAA;AAEA,IAAAO,SAAA,GAAAP,OAAA;AACA,IAAAQ,UAAA,GAAAR,OAAA;AAA4C,SAAAD,wBAAAU,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAZ,uBAAA,YAAAA,CAAAU,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AA5B5C;;;;;;;;;;;;;;;;;;;AA8BA,MAAMkB,iBAAiB,GAAG,GAAG;AAC7B,MAAMC,gBAAgB,GAAG,YAAY;AAErC;;;;AAIO,MAAMC,MAAM,GAAAC,OAAA,CAAAD,MAAA,gBAAkBE,MAAM,CAACC,GAAG,CAAC,mBAAmB,CAAC;AAoBpE,MAAMC,eAAe,GAAuD;EAC1E,CAACJ,MAAM,GAAGA,MAAM;EAChB,CAAC3B,IAAI,CAACgC,MAAM,IAAC;IACX,MAAMC,UAAU,GAAGC,SAAS,CAAC,IAAI,CAAC;IAClC,OAAO,IAAAC,cAAI,EACTnC,IAAI,CAACoC,IAAI,CAACH,UAAU,CAACI,KAAK,CAAC,EAC3BrC,IAAI,CAACsC,OAAO,CAACtC,IAAI,CAACuC,MAAM,CAACN,UAAU,CAACO,KAAK,CAAC,CAAC,EAC3CxC,IAAI,CAACyC,MAAM,CAAC,IAAI,CAAC,CAClB;EACH,CAAC;EACD,CAAC9C,KAAK,CAACqC,MAAM,EAAoBU,IAAa;IAC5C,OAAOC,YAAY,CAACD,IAAI,CAAC,IAAIE,MAAM,CAAC,IAAI,EAAEF,IAAI,CAAC;EACjD,CAAC;EACDG,QAAQA,CAAA;IACN,OAAO,cAAcC,MAAM,CAAC,IAAI,CAAC,GAAG;EACtC,CAAC;EACDC,MAAMA,CAAA;IACJ,OAAO;MACLC,GAAG,EAAE,YAAY;MACjBX,KAAK,EAAEY,MAAM,CAAC,IAAI,CAACZ,KAAK,CAAC;MACzBG,KAAK,EAAE,IAAI,CAACA;KACb;EACH,CAAC;EACD,CAACU,8BAAiB,IAAC;IACjB,OAAO,IAAI,CAACH,MAAM,EAAE;EACtB,CAAC;EACDZ,IAAIA,CAAA;IACF,OAAO,IAAAgB,uBAAa,EAAC,IAAI,EAAEC,SAAS,CAAC;EACvC;CACQ;AAEV;;;;;;AAMO,MAAMT,YAAY,GAAIU,CAAU,IAAsB,IAAAC,sBAAW,EAACD,CAAC,EAAE1B,MAAM,CAAC;AAEnF;;;;;;AAAAC,OAAA,CAAAe,YAAA,GAAAA,YAAA;AAMO,MAAMY,IAAI,GAAGA,CAAClB,KAAa,EAAEG,KAAa,KAAgB;EAC/D,MAAM5B,CAAC,GAAGU,MAAM,CAACkC,MAAM,CAACzB,eAAe,CAAC;EACxCnB,CAAC,CAACyB,KAAK,GAAGA,KAAK;EACfzB,CAAC,CAAC4B,KAAK,GAAGA,KAAK;EACf,OAAO5B,CAAC;AACV,CAAC;AAED;;;;;AAAAgB,OAAA,CAAA2B,IAAA,GAAAA,IAAA;AAKO,MAAME,oBAAoB,GAAGA,CAACpB,KAAa,EAAEG,KAAa,KAAgB;EAC/E,IAAIH,KAAK,KAAKqB,OAAO,IAAIrB,KAAK,GAAGsB,QAAQ,KAAKD,OAAO,EAAE;IACrD,MAAM,IAAIE,UAAU,CAAC,0BAA0B,CAAC;EAClD;EAEA,MAAMhD,CAAC,GAAG2C,IAAI,CAAClB,KAAK,EAAEG,KAAK,CAAC;EAC5B5B,CAAC,CAACqB,UAAU,GAAGrB,CAAC;EAChB,OAAOA,CAAC;AACV,CAAC;AAAAgB,OAAA,CAAA6B,oBAAA,GAAAA,oBAAA;AAED,MAAMC,OAAO,gBAAGG,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMC,OAAO,gBAAGD,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMF,QAAQ,gBAAGE,MAAM,CAAC,EAAE,CAAC;AAC3B,MAAME,IAAI,gBAAGN,oBAAoB,CAACC,OAAO,EAAE,CAAC,CAAC;AAE7C;;;;;;;;;;;;;;;;AAgBO,MAAMxB,SAAS,GAAI8B,IAAgB,IAAgB;EACxD,IAAIA,IAAI,CAAC/B,UAAU,KAAKgC,SAAS,EAAE;IACjC,IAAID,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;MAC1BM,IAAI,CAAC/B,UAAU,GAAG8B,IAAI;IACxB,CAAC,MAAM;MACL,MAAMG,MAAM,GAAG,GAAGF,IAAI,CAAC3B,KAAK,EAAE;MAE9B,IAAI8B,KAAK,GAAG,CAAC;MACb,KAAK,IAAItD,CAAC,GAAGqD,MAAM,CAACE,MAAM,GAAG,CAAC,EAAEvD,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;QAC3C,IAAIqD,MAAM,CAACrD,CAAC,CAAC,KAAK,GAAG,EAAE;UACrBsD,KAAK,EAAE;QACT,CAAC,MAAM;UACL;QACF;MACF;MAEA,IAAIA,KAAK,KAAK,CAAC,EAAE;QACfH,IAAI,CAAC/B,UAAU,GAAG+B,IAAI;MACxB;MAEA,MAAM3B,KAAK,GAAGwB,MAAM,CAACK,MAAM,CAACG,SAAS,CAAC,CAAC,EAAEH,MAAM,CAACE,MAAM,GAAGD,KAAK,CAAC,CAAC;MAChE,MAAM3B,KAAK,GAAGwB,IAAI,CAACxB,KAAK,GAAG2B,KAAK;MAChCH,IAAI,CAAC/B,UAAU,GAAGwB,oBAAoB,CAACpB,KAAK,EAAEG,KAAK,CAAC;IACtD;EACF;EAEA,OAAOwB,IAAI,CAAC/B,UAAU;AACxB,CAAC;AAED;;;;;;;;;AAAAL,OAAA,CAAAM,SAAA,GAAAA,SAAA;AASO,MAAMM,KAAK,GAAAZ,OAAA,CAAAY,KAAA,gBAqBd,IAAA8B,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAExB,KAAa,KAAgB;EAC1D,IAAIA,KAAK,GAAGwB,IAAI,CAACxB,KAAK,EAAE;IACtB,OAAOe,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGsB,QAAQ,IAAIE,MAAM,CAACrB,KAAK,GAAGwB,IAAI,CAACxB,KAAK,CAAC,EAAEA,KAAK,CAAC;EACzE;EAEA,IAAIA,KAAK,GAAGwB,IAAI,CAACxB,KAAK,EAAE;IACtB,OAAOe,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGsB,QAAQ,IAAIE,MAAM,CAACG,IAAI,CAACxB,KAAK,GAAGA,KAAK,CAAC,EAAEA,KAAK,CAAC;EACzE;EAEA,OAAOwB,IAAI;AACb,CAAC,CAAC;AAEF;;;;;;;;;;;;;;AAcO,MAAMO,GAAG,GAAA3C,OAAA,CAAA2C,GAAA,gBA+BZ,IAAAD,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAAgB;EAC7D,IAAIA,IAAI,CAACL,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOM,IAAI;EACb;EAEA,IAAIA,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOhB,IAAI;EACb;EAEA,IAAIsB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOe,IAAI,CAACf,KAAK,CAACE,IAAI,EAAEsB,IAAI,CAACxB,KAAK,CAAC,CAACH,KAAK,GAAG2B,IAAI,CAAC3B,KAAK,EAAE2B,IAAI,CAACxB,KAAK,CAAC;EACrE;EAEA,IAAIwB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOe,IAAI,CAACf,KAAK,CAACwB,IAAI,EAAEtB,IAAI,CAACF,KAAK,CAAC,CAACH,KAAK,GAAGK,IAAI,CAACL,KAAK,EAAEK,IAAI,CAACF,KAAK,CAAC;EACrE;EAEA,OAAOe,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGK,IAAI,CAACL,KAAK,EAAE2B,IAAI,CAACxB,KAAK,CAAC;AAClD,CAAC,CAAC;AAEF;;;;;;;;;;;;;;AAcO,MAAMgC,QAAQ,GAAA5C,OAAA,CAAA4C,QAAA,gBA+BjB,IAAAF,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAAgB;EAC7D,IAAIA,IAAI,CAACL,KAAK,KAAKqB,OAAO,IAAIM,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;IACpD,OAAOK,IAAI;EACb;EAEA,OAAOR,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGK,IAAI,CAACL,KAAK,EAAE2B,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;;;;;;;;AAcO,MAAMiC,QAAQ,GAAA7C,OAAA,CAAA6C,QAAA,gBA+BjB,IAAAH,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAAgB;EAC7D,IAAIA,IAAI,CAACL,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOM,IAAI;EACb;EAEA,IAAIA,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOH,IAAI,CAAC,CAACb,IAAI,CAACL,KAAK,EAAEK,IAAI,CAACF,KAAK,CAAC;EACtC;EAEA,IAAIwB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOe,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGG,KAAK,CAACE,IAAI,EAAEsB,IAAI,CAACxB,KAAK,CAAC,CAACH,KAAK,EAAE2B,IAAI,CAACxB,KAAK,CAAC;EACrE;EAEA,IAAIwB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOe,IAAI,CAACf,KAAK,CAACwB,IAAI,EAAEtB,IAAI,CAACF,KAAK,CAAC,CAACH,KAAK,GAAGK,IAAI,CAACL,KAAK,EAAEK,IAAI,CAACF,KAAK,CAAC;EACrE;EAEA,OAAOe,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAGK,IAAI,CAACL,KAAK,EAAE2B,IAAI,CAACxB,KAAK,CAAC;AAClD,CAAC,CAAC;AAEF;;;AAGA,MAAMkC,mBAAmB,GAAGA,CAC1BC,GAAW,EACXC,GAAW,EACXpC,KAAa,EACbqC,SAAiB,KACH;EACd,MAAMC,WAAW,GAAGH,GAAG,GAAGjB,OAAO;EACjC,MAAMqB,WAAW,GAAGH,GAAG,GAAGlB,OAAO;EACjC,MAAMsB,YAAY,GAAGF,WAAW,KAAKC,WAAW;EAEhDJ,GAAG,GAAGG,WAAW,GAAG,CAACH,GAAG,GAAGA,GAAG;EAC9BC,GAAG,GAAGG,WAAW,GAAG,CAACH,GAAG,GAAGA,GAAG;EAE9B;EACA,OAAOD,GAAG,GAAGC,GAAG,EAAE;IAChBD,GAAG,IAAIhB,QAAQ;IACfnB,KAAK,EAAE;EACT;EAEA;EACA,IAAIyC,QAAQ,GAAGN,GAAG,GAAGC,GAAG;EACxB,IAAIM,SAAS,GAAGP,GAAG,GAAGC,GAAG;EAEzB,IAAIM,SAAS,KAAKxB,OAAO,EAAE;IACzB;IACA,OAAOH,IAAI,CAACyB,YAAY,GAAG,CAACC,QAAQ,GAAGA,QAAQ,EAAEzC,KAAK,CAAC;EACzD;EAEA;EACA,IAAI2C,KAAK,GAAG,GAAGF,QAAQ,EAAE,CAACb,MAAM;EAEhC;EACAc,SAAS,IAAIvB,QAAQ;EACrB,OAAOuB,SAAS,KAAKxB,OAAO,IAAIyB,KAAK,GAAGN,SAAS,EAAE;IACjD,MAAMO,CAAC,GAAGF,SAAS,GAAGN,GAAG;IACzB,MAAMnE,CAAC,GAAGyE,SAAS,GAAGN,GAAG;IACzBK,QAAQ,GAAGA,QAAQ,GAAGtB,QAAQ,GAAGyB,CAAC;IAClCF,SAAS,GAAGzE,CAAC,GAAGkD,QAAQ;IAExBwB,KAAK,EAAE;IACP3C,KAAK,EAAE;EACT;EAEA,IAAI0C,SAAS,KAAKxB,OAAO,EAAE;IACzB;IACAuB,QAAQ,IAAII,aAAa,CAACH,SAAS,GAAGN,GAAG,CAAC;EAC5C;EAEA,OAAOrB,IAAI,CAACyB,YAAY,GAAG,CAACC,QAAQ,GAAGA,QAAQ,EAAEzC,KAAK,CAAC;AACzD,CAAC;AAED;;;;;;;;;AASO,MAAM6C,aAAa,GAAI3E,CAAS,IAAY;EACjD,MAAM4E,GAAG,GAAG5E,CAAC,IAAIgD,OAAO,GAAG,CAAC,GAAG,CAAC;EAChC,OAAO6B,MAAM,CAAC,GAAG7E,CAAC,EAAE,CAAC4E,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG5B,OAAO,GAAGI,OAAO;AACpD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;AAAAlC,OAAA,CAAAyD,aAAA,GAAAA,aAAA;AAqBO,MAAMG,MAAM,GAAA5D,OAAA,CAAA4D,MAAA,gBA6Cf,IAAAlB,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAA+B;EAC5E,IAAIA,IAAI,CAACL,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOxD,MAAM,CAACuF,IAAI,EAAE;EACtB;EAEA,IAAIzB,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOxD,MAAM,CAACwF,IAAI,CAAC3B,IAAI,CAAC;EAC1B;EAEA,MAAMvB,KAAK,GAAGwB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK;EACrC,IAAIwB,IAAI,CAAC3B,KAAK,KAAKK,IAAI,CAACL,KAAK,EAAE;IAC7B,OAAOnC,MAAM,CAACwF,IAAI,CAACnC,IAAI,CAACO,OAAO,EAAEtB,KAAK,CAAC,CAAC;EAC1C;EAEA,OAAOtC,MAAM,CAACwF,IAAI,CAAChB,mBAAmB,CAACV,IAAI,CAAC3B,KAAK,EAAEK,IAAI,CAACL,KAAK,EAAEG,KAAK,EAAEf,iBAAiB,CAAC,CAAC;AAC3F,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMkE,YAAY,GAAA/D,OAAA,CAAA+D,YAAA,gBA2CrB,IAAArB,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAAgB;EAC7D,IAAIA,IAAI,CAACL,KAAK,KAAKqB,OAAO,EAAE;IAC1B,MAAM,IAAIE,UAAU,CAAC,kBAAkB,CAAC;EAC1C;EAEA,IAAII,IAAI,CAAC3B,KAAK,KAAKqB,OAAO,EAAE;IAC1B,OAAOK,IAAI;EACb;EAEA,MAAMvB,KAAK,GAAGwB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK;EACrC,IAAIwB,IAAI,CAAC3B,KAAK,KAAKK,IAAI,CAACL,KAAK,EAAE;IAC7B,OAAOkB,IAAI,CAACO,OAAO,EAAEtB,KAAK,CAAC;EAC7B;EACA,OAAOkC,mBAAmB,CAACV,IAAI,CAAC3B,KAAK,EAAEK,IAAI,CAACL,KAAK,EAAEG,KAAK,EAAEf,iBAAiB,CAAC;AAC9E,CAAC,CAAC;AAEF;;;;AAIO,MAAMmE,KAAK,GAAAhE,OAAA,CAAAgE,KAAA,gBAA4BzF,KAAK,CAACoD,IAAI,CAAC,CAACS,IAAI,EAAEtB,IAAI,KAAI;EACtE,MAAMmD,IAAI,GAAG1F,KAAK,CAACoC,MAAM,CAACuD,IAAI,CAAC9B,IAAI,CAAC,EAAE8B,IAAI,CAACpD,IAAI,CAAC,CAAC;EACjD,IAAImD,IAAI,KAAK,CAAC,EAAE;IACd,OAAOA,IAAI;EACb;EAEA,IAAI7B,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOrC,KAAK,CAAC4F,MAAM,CAAC/B,IAAI,CAAC3B,KAAK,EAAEG,KAAK,CAACE,IAAI,EAAEsB,IAAI,CAACxB,KAAK,CAAC,CAACH,KAAK,CAAC;EAChE;EAEA,IAAI2B,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOrC,KAAK,CAAC4F,MAAM,CAACvD,KAAK,CAACwB,IAAI,EAAEtB,IAAI,CAACF,KAAK,CAAC,CAACH,KAAK,EAAEK,IAAI,CAACL,KAAK,CAAC;EAChE;EAEA,OAAOlC,KAAK,CAAC4F,MAAM,CAAC/B,IAAI,CAAC3B,KAAK,EAAEK,IAAI,CAACL,KAAK,CAAC;AAC7C,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;AAgBO,MAAM2D,QAAQ,GAAApE,OAAA,CAAAoE,QAAA,gBAmCjB7F,KAAK,CAAC6F,QAAQ,CAACJ,KAAK,CAAC;AAEzB;;;;;;;;;;;;;;;;AAgBO,MAAMK,iBAAiB,GAAArE,OAAA,CAAAqE,iBAAA,gBAmC1B9F,KAAK,CAAC8F,iBAAiB,CAACL,KAAK,CAAC;AAElC;;;;;;;;;;;;;;;;AAgBO,MAAMM,WAAW,GAAAtE,OAAA,CAAAsE,WAAA,gBAmCpB/F,KAAK,CAAC+F,WAAW,CAACN,KAAK,CAAC;AAE5B;;;;;;;;;;;;;;;;AAgBO,MAAMO,oBAAoB,GAAAvE,OAAA,CAAAuE,oBAAA,gBAmC7BhG,KAAK,CAACgG,oBAAoB,CAACP,KAAK,CAAC;AAErC;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMQ,OAAO,GAAAxE,OAAA,CAAAwE,OAAA,gBAwDhBjG,KAAK,CAACiG,OAAO,CAACR,KAAK,CAAC;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMS,KAAK,GAAAzE,OAAA,CAAAyE,KAAA,gBAgEdlG,KAAK,CAACkG,KAAK,CAACT,KAAK,CAAC;AAEtB;;;;;;;;;;;;;;AAcO,MAAMU,GAAG,GAAA1E,OAAA,CAAA0E,GAAA,gBA+BZnG,KAAK,CAACmG,GAAG,CAACV,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;AAcO,MAAMW,GAAG,GAAA3E,OAAA,CAAA2E,GAAA,gBA+BZpG,KAAK,CAACoG,GAAG,CAACX,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;;;AAgBO,MAAME,IAAI,GAAIpF,CAAa,IAAeA,CAAC,CAAC2B,KAAK,KAAKqB,OAAO,GAAG,CAAC,GAAGhD,CAAC,CAAC2B,KAAK,GAAGqB,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;AAErG;;;;;;;;;;;;;;;;AAAA9B,OAAA,CAAAkE,IAAA,GAAAA,IAAA;AAgBO,MAAMU,GAAG,GAAI9F,CAAa,IAAiBA,CAAC,CAAC2B,KAAK,GAAGqB,OAAO,GAAGH,IAAI,CAAC,CAAC7C,CAAC,CAAC2B,KAAK,EAAE3B,CAAC,CAAC8B,KAAK,CAAC,GAAG9B,CAAC;AAEjG;;;;;;;;;;;;;;;AAAAkB,OAAA,CAAA4E,GAAA,GAAAA,GAAA;AAeO,MAAMC,MAAM,GAAI/F,CAAa,IAAiB6C,IAAI,CAAC,CAAC7C,CAAC,CAAC2B,KAAK,EAAE3B,CAAC,CAAC8B,KAAK,CAAC;AAE5E;;;;;;;;;;;;;;;;;;AAAAZ,OAAA,CAAA6E,MAAA,GAAAA,MAAA;AAkBO,MAAMvB,SAAS,GAAAtD,OAAA,CAAAsD,SAAA,gBAuClB,IAAAZ,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAE0C,OAAmB,KAA+B;EAC/E,IAAIA,OAAO,CAACrE,KAAK,KAAKqB,OAAO,EAAE;IAC7B,OAAOxD,MAAM,CAACuF,IAAI,EAAE;EACtB;EAEA,MAAMc,GAAG,GAAGI,IAAI,CAACJ,GAAG,CAACvC,IAAI,CAACxB,KAAK,EAAEkE,OAAO,CAAClE,KAAK,CAAC;EAC/C,OAAOtC,MAAM,CAACwF,IAAI,CAACnC,IAAI,CAACf,KAAK,CAACwB,IAAI,EAAEuC,GAAG,CAAC,CAAClE,KAAK,GAAGG,KAAK,CAACkE,OAAO,EAAEH,GAAG,CAAC,CAAClE,KAAK,EAAEkE,GAAG,CAAC,CAAC;AACnF,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;AAkBO,MAAMK,eAAe,GAAAhF,OAAA,CAAAgF,eAAA,gBAuCxB,IAAAtC,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAE0C,OAAmB,KAAgB;EAChE,IAAIA,OAAO,CAACrE,KAAK,KAAKqB,OAAO,EAAE;IAC7B,MAAM,IAAIE,UAAU,CAAC,kBAAkB,CAAC;EAC1C;EAEA,MAAM2C,GAAG,GAAGI,IAAI,CAACJ,GAAG,CAACvC,IAAI,CAACxB,KAAK,EAAEkE,OAAO,CAAClE,KAAK,CAAC;EAC/C,OAAOe,IAAI,CAACf,KAAK,CAACwB,IAAI,EAAEuC,GAAG,CAAC,CAAClE,KAAK,GAAGG,KAAK,CAACkE,OAAO,EAAEH,GAAG,CAAC,CAAClE,KAAK,EAAEkE,GAAG,CAAC;AACtE,CAAC,CAAC;AAEF;;;;AAIO,MAAMM,WAAW,GAAAjF,OAAA,CAAAiF,WAAA,gBAAwC/G,WAAW,CAACyD,IAAI,CAAC,CAACS,IAAI,EAAEtB,IAAI,KAAI;EAC9F,IAAIsB,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOA,KAAK,CAACE,IAAI,EAAEsB,IAAI,CAACxB,KAAK,CAAC,CAACH,KAAK,KAAK2B,IAAI,CAAC3B,KAAK;EACrD;EAEA,IAAI2B,IAAI,CAACxB,KAAK,GAAGE,IAAI,CAACF,KAAK,EAAE;IAC3B,OAAOA,KAAK,CAACwB,IAAI,EAAEtB,IAAI,CAACF,KAAK,CAAC,CAACH,KAAK,KAAKK,IAAI,CAACL,KAAK;EACrD;EAEA,OAAO2B,IAAI,CAAC3B,KAAK,KAAKK,IAAI,CAACL,KAAK;AAClC,CAAC,CAAC;AAEF;;;;;;AAMO,MAAMO,MAAM,GAAAhB,OAAA,CAAAgB,MAAA,gBAef,IAAA0B,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAEtB,IAAgB,KAAcmE,WAAW,CAAC7C,IAAI,EAAEtB,IAAI,CAAC,CAAC;AAErF;;;;;;AAMO,MAAMoE,UAAU,GAAIpG,CAAS,IAAiB6C,IAAI,CAAC7C,CAAC,EAAE,CAAC,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;AAAAkB,OAAA,CAAAkF,UAAA,GAAAA,UAAA;AAoBO,MAAMC,gBAAgB,GAAIrG,CAAS,IACxCR,MAAM,CAAC8G,cAAc,CAACC,cAAc,CAACvG,CAAC,CAAC,EAAE,MAAM,IAAIkD,UAAU,CAAC,8BAA8BlD,CAAC,EAAE,CAAC,CAAC;AAEnG;;;;;;;;;;;;AAAAkB,OAAA,CAAAmF,gBAAA,GAAAA,gBAAA;AAYO,MAAMG,UAAU,GAAAtF,OAAA,CAAAsF,UAAA,GAA8BH,gBAAgB;AAErE;AACA;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAME,cAAc,GAAIvG,CAAS,IAA+B;EACrE,IAAI,CAAC6E,MAAM,CAAC4B,QAAQ,CAACzG,CAAC,CAAC,EAAE;IACvB,OAAOR,MAAM,CAACuF,IAAI,EAAE;EACtB;EAEA,MAAM2B,MAAM,GAAG,GAAG1G,CAAC,EAAE;EACrB,IAAI0G,MAAM,CAACC,QAAQ,CAAC,GAAG,CAAC,EAAE;IACxB,OAAOC,UAAU,CAACF,MAAM,CAAC;EAC3B;EAEA,MAAM,CAACG,IAAI,EAAEpD,KAAK,GAAG,EAAE,CAAC,GAAGiD,MAAM,CAACI,KAAK,CAAC,GAAG,CAAC;EAC5C,OAAOtH,MAAM,CAACwF,IAAI,CAACnC,IAAI,CAACM,MAAM,CAAC,GAAG0D,IAAI,GAAGpD,KAAK,EAAE,CAAC,EAAEA,KAAK,CAACC,MAAM,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;;;;;;;;;;AAAAxC,OAAA,CAAAqF,cAAA,GAAAA,cAAA;AAgBO,MAAMK,UAAU,GAAIG,CAAS,IAA+B;EACjE,IAAIA,CAAC,KAAK,EAAE,EAAE;IACZ,OAAOvH,MAAM,CAACwF,IAAI,CAAC3B,IAAI,CAAC;EAC1B;EAEA,IAAI2D,IAAY;EAChB,IAAIC,GAAW;EACf,MAAMC,SAAS,GAAGH,CAAC,CAACI,MAAM,CAAC,MAAM,CAAC;EAClC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IACpB,MAAMzD,KAAK,GAAGsD,CAAC,CAACK,KAAK,CAACF,SAAS,GAAG,CAAC,CAAC;IACpCF,IAAI,GAAGD,CAAC,CAACK,KAAK,CAAC,CAAC,EAAEF,SAAS,CAAC;IAC5BD,GAAG,GAAGpC,MAAM,CAACpB,KAAK,CAAC;IACnB,IAAIuD,IAAI,KAAK,EAAE,IAAI,CAACnC,MAAM,CAACwC,aAAa,CAACJ,GAAG,CAAC,IAAI,CAACjG,gBAAgB,CAACsG,IAAI,CAAC7D,KAAK,CAAC,EAAE;MAC9E,OAAOjE,MAAM,CAACuF,IAAI,EAAE;IACtB;EACF,CAAC,MAAM;IACLiC,IAAI,GAAGD,CAAC;IACRE,GAAG,GAAG,CAAC;EACT;EAEA,IAAIzD,MAAc;EAClB,IAAI+D,MAAc;EAClB,MAAMC,GAAG,GAAGR,IAAI,CAACG,MAAM,CAAC,IAAI,CAAC;EAC7B,IAAIK,GAAG,KAAK,CAAC,CAAC,EAAE;IACd,MAAMX,IAAI,GAAGG,IAAI,CAACI,KAAK,CAAC,CAAC,EAAEI,GAAG,CAAC;IAC/B,MAAM/D,KAAK,GAAGuD,IAAI,CAACI,KAAK,CAACI,GAAG,GAAG,CAAC,CAAC;IACjChE,MAAM,GAAG,GAAGqD,IAAI,GAAGpD,KAAK,EAAE;IAC1B8D,MAAM,GAAG9D,KAAK,CAACC,MAAM;EACvB,CAAC,MAAM;IACLF,MAAM,GAAGwD,IAAI;IACbO,MAAM,GAAG,CAAC;EACZ;EAEA,IAAI,CAACvG,gBAAgB,CAACsG,IAAI,CAAC9D,MAAM,CAAC,EAAE;IAClC,OAAOhE,MAAM,CAACuF,IAAI,EAAE;EACtB;EAEA,MAAMjD,KAAK,GAAGyF,MAAM,GAAGN,GAAG;EAC1B,IAAI,CAACpC,MAAM,CAACwC,aAAa,CAACvF,KAAK,CAAC,EAAE;IAChC,OAAOtC,MAAM,CAACuF,IAAI,EAAE;EACtB;EAEA,OAAOvF,MAAM,CAACwF,IAAI,CAACnC,IAAI,CAACM,MAAM,CAACK,MAAM,CAAC,EAAE1B,KAAK,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;;;;;;;;;;AAAAZ,OAAA,CAAA0F,UAAA,GAAAA,UAAA;AAgBO,MAAMa,gBAAgB,GAAIV,CAAS,IACxCvH,MAAM,CAAC8G,cAAc,CAACM,UAAU,CAACG,CAAC,CAAC,EAAE,MAAM,IAAIW,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAEnF;;;;;;;;;;;;;;;;;;;AAAAxG,OAAA,CAAAuG,gBAAA,GAAAA,gBAAA;AAmBO,MAAMrF,MAAM,GAAIpC,CAAa,IAAY;EAC9C,MAAMuB,UAAU,GAAGC,SAAS,CAACxB,CAAC,CAAC;EAC/B,IAAIiG,IAAI,CAACH,GAAG,CAACvE,UAAU,CAACO,KAAK,CAAC,IAAI,EAAE,EAAE;IACpC,OAAO6F,aAAa,CAACpG,UAAU,CAAC;EAClC;EAEA,MAAMqG,QAAQ,GAAGrG,UAAU,CAACI,KAAK,GAAGqB,OAAO;EAC3C,MAAM6E,QAAQ,GAAGD,QAAQ,GAAG,GAAGrG,UAAU,CAACI,KAAK,EAAE,CAACgC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAGpC,UAAU,CAACI,KAAK,EAAE;EAEtF,IAAImG,MAAc;EAClB,IAAIC,KAAa;EAEjB,IAAIxG,UAAU,CAACO,KAAK,IAAI+F,QAAQ,CAACnE,MAAM,EAAE;IACvCoE,MAAM,GAAG,GAAG;IACZC,KAAK,GAAG,GAAG,CAACC,MAAM,CAACzG,UAAU,CAACO,KAAK,GAAG+F,QAAQ,CAACnE,MAAM,CAAC,GAAGmE,QAAQ;EACnE,CAAC,MAAM;IACL,MAAMI,QAAQ,GAAGJ,QAAQ,CAACnE,MAAM,GAAGnC,UAAU,CAACO,KAAK;IACnD,IAAImG,QAAQ,GAAGJ,QAAQ,CAACnE,MAAM,EAAE;MAC9B,MAAMwE,KAAK,GAAGD,QAAQ,GAAGJ,QAAQ,CAACnE,MAAM;MACxCoE,MAAM,GAAG,GAAGD,QAAQ,GAAG,GAAG,CAACG,MAAM,CAACE,KAAK,CAAC,EAAE;MAC1CH,KAAK,GAAG,EAAE;IACZ,CAAC,MAAM;MACLA,KAAK,GAAGF,QAAQ,CAACT,KAAK,CAACa,QAAQ,CAAC;MAChCH,MAAM,GAAGD,QAAQ,CAACT,KAAK,CAAC,CAAC,EAAEa,QAAQ,CAAC;IACtC;EACF;EAEA,MAAME,QAAQ,GAAGJ,KAAK,KAAK,EAAE,GAAGD,MAAM,GAAG,GAAGA,MAAM,IAAIC,KAAK,EAAE;EAC7D,OAAOH,QAAQ,GAAG,IAAIO,QAAQ,EAAE,GAAGA,QAAQ;AAC7C,CAAC;AAED;;;;;;;;;;;;;;AAAAjH,OAAA,CAAAkB,MAAA,GAAAA,MAAA;AAcO,MAAMuF,aAAa,GAAI3H,CAAa,IAAY;EACrD,IAAIoI,MAAM,CAACpI,CAAC,CAAC,EAAE;IACb,OAAO,MAAM;EACf;EAEA,MAAMuB,UAAU,GAAGC,SAAS,CAACxB,CAAC,CAAC;EAC/B,MAAMwD,MAAM,GAAG,GAAGsC,GAAG,CAACvE,UAAU,CAAC,CAACI,KAAK,EAAE;EACzC,MAAM0G,IAAI,GAAG7E,MAAM,CAAC4D,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;EAC/B,MAAMkB,IAAI,GAAG9E,MAAM,CAAC4D,KAAK,CAAC,CAAC,CAAC;EAE5B,IAAImB,MAAM,GAAG,GAAGC,UAAU,CAACjH,UAAU,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG8G,IAAI,EAAE;EAC1D,IAAIC,IAAI,KAAK,EAAE,EAAE;IACfC,MAAM,IAAI,IAAID,IAAI,EAAE;EACtB;EAEA,MAAMrB,GAAG,GAAGqB,IAAI,CAAC5E,MAAM,GAAGnC,UAAU,CAACO,KAAK;EAC1C,OAAO,GAAGyG,MAAM,IAAItB,GAAG,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,GAAGA,GAAG,EAAE;AACjD,CAAC;AAED;;;;;;;;;;;;;;;;AAAA/F,OAAA,CAAAyG,aAAA,GAAAA,aAAA;AAgBO,MAAMc,cAAc,GAAIzI,CAAa,IAAa6E,MAAM,CAACzC,MAAM,CAACpC,CAAC,CAAC,CAAC;AAE1E;;;;;;;;;;;;;;;;AAAAkB,OAAA,CAAAuH,cAAA,GAAAA,cAAA;AAgBO,MAAMC,SAAS,GAAI1I,CAAa,IAAcwB,SAAS,CAACxB,CAAC,CAAC,CAAC8B,KAAK,IAAI,CAAC;AAE5E;;;;;;;;;;;;;;;AAAAZ,OAAA,CAAAwH,SAAA,GAAAA,SAAA;AAeO,MAAMN,MAAM,GAAIpI,CAAa,IAAcA,CAAC,CAAC2B,KAAK,KAAKqB,OAAO;AAErE;;;;;;;;;;;;;;;;AAAA9B,OAAA,CAAAkH,MAAA,GAAAA,MAAA;AAgBO,MAAMI,UAAU,GAAIxI,CAAa,IAAcA,CAAC,CAAC2B,KAAK,GAAGqB,OAAO;AAEvE;;;;;;;;;;;;;;;;AAAA9B,OAAA,CAAAsH,UAAA,GAAAA,UAAA;AAgBO,MAAMG,UAAU,GAAI3I,CAAa,IAAcA,CAAC,CAAC2B,KAAK,GAAGqB,OAAO;AAAA9B,OAAA,CAAAyH,UAAA,GAAAA,UAAA;AAEvE,MAAMC,gBAAgB,GAAIC,IAAgB,IAAK5G,YAAY,CAAC4G,IAAI,CAAC,CAAC,CAAC,CAAC;AAEpE;;;;;;;;;;;;;;;AAeO,MAAMC,IAAI,GAAA5H,OAAA,CAAA4H,IAAA,gBAiCb,IAAAlF,cAAI,EAACgF,gBAAgB,EAAE,CAACtF,IAAgB,EAAExB,KAAA,GAAgB,CAAC,KAAgB;EAC7E,MAAMiH,SAAS,GAAGC,QAAQ,CAAC1F,IAAI,EAAExB,KAAK,CAAC;EAEvC,IAAI6G,UAAU,CAACrF,IAAI,CAAC,IAAIgC,QAAQ,CAACyD,SAAS,EAAEzF,IAAI,CAAC,EAAE;IACjD,OAAOO,GAAG,CAACkF,SAAS,EAAElG,IAAI,CAAC,EAAE,EAAEf,KAAK,CAAC,CAAC;EACxC;EAEA,OAAOiH,SAAS;AAClB,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;AAeO,MAAME,KAAK,GAAA/H,OAAA,CAAA+H,KAAA,gBAiCd,IAAArF,cAAI,EAACgF,gBAAgB,EAAE,CAACtF,IAAgB,EAAExB,KAAA,GAAgB,CAAC,KAAgB;EAC7E,MAAMiH,SAAS,GAAGC,QAAQ,CAAC1F,IAAI,EAAExB,KAAK,CAAC;EAEvC,IAAI0G,UAAU,CAAClF,IAAI,CAAC,IAAIkC,WAAW,CAACuD,SAAS,EAAEzF,IAAI,CAAC,EAAE;IACpD,OAAOO,GAAG,CAACkF,SAAS,EAAElG,IAAI,CAAC,CAAC,EAAE,EAAEf,KAAK,CAAC,CAAC;EACzC;EAEA,OAAOiH,SAAS;AAClB,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;AAeO,MAAMC,QAAQ,GAAA9H,OAAA,CAAA8H,QAAA,gBAiCjB,IAAApF,cAAI,EAACgF,gBAAgB,EAAE,CAACtF,IAAgB,EAAExB,KAAA,GAAgB,CAAC,KAAgB;EAC7E,IAAIwB,IAAI,CAACxB,KAAK,IAAIA,KAAK,EAAE;IACvB,OAAOwB,IAAI;EACb;EAEA;EACA,OAAOT,IAAI,CAACS,IAAI,CAAC3B,KAAK,GAAI,GAAG,IAAIwB,MAAM,CAACG,IAAI,CAACxB,KAAK,GAAGA,KAAK,CAAE,EAAEA,KAAK,CAAC;AACtE,CAAC,CAAC;AAEF;;;;;;;AAOO,MAAMoH,OAAO,GAAAhI,OAAA,CAAAgI,OAAA,gBAiBhB,IAAAtF,cAAI,EAAC,CAAC,EAAE,CAACN,IAAgB,EAAExB,KAAa,KAAY;EACtD,IAAIwB,IAAI,CAACxB,KAAK,GAAGA,KAAK,EAAE;IACtB,OAAO,EAAE;EACX;EAEA,MAAMqH,MAAM,GAAG7F,IAAI,CAAC3B,KAAK,GAAI,GAAG,IAAIwB,MAAM,CAACG,IAAI,CAACxB,KAAK,GAAGA,KAAK,CAAE;EAC/D,OAAOqH,MAAM,GAAG,GAAG;AACrB,CAAC,CAAC;AA+BF;;;;;;;;;;;;;;;AAeO,MAAMC,KAAK,GAAAlI,OAAA,CAAAkI,KAAA,gBAiCd,IAAAxF,cAAI,EAACgF,gBAAgB,EAAE,CAACtF,IAAgB,EAAE+F,OAAiD,KAAgB;EAC7G,MAAMC,IAAI,GAAGD,OAAO,EAAEC,IAAI,IAAI,gBAAgB;EAC9C,MAAMxH,KAAK,GAAGuH,OAAO,EAAEvH,KAAK,IAAI,CAAC;EAEjC,QAAQwH,IAAI;IACV,KAAK,MAAM;MACT,OAAOR,IAAI,CAACxF,IAAI,EAAExB,KAAK,CAAC;IAE1B,KAAK,OAAO;MACV,OAAOmH,KAAK,CAAC3F,IAAI,EAAExB,KAAK,CAAC;IAE3B,KAAK,SAAS;MACZ,OAAOkH,QAAQ,CAAC1F,IAAI,EAAExB,KAAK,CAAC;IAE9B,KAAK,WAAW;MACd,OAAQ6G,UAAU,CAACrF,IAAI,CAAC,GAAGwF,IAAI,CAACxF,IAAI,EAAExB,KAAK,CAAC,GAAGmH,KAAK,CAAC3F,IAAI,EAAExB,KAAK,CAAC;IAEnE,KAAK,WAAW;MACd,OAAOmH,KAAK,CAACpF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;IAErD,KAAK,YAAY;MACf,OAAOgH,IAAI,CAACjF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;IAErD,KAAK,cAAc;MACjB,OAAO0G,UAAU,CAAClF,IAAI,CAAC,GACnB2F,KAAK,CAACpF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,GAC5CgH,IAAI,CAACjF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;IAElD,KAAK,gBAAgB;MACnB,OAAO0G,UAAU,CAAClF,IAAI,CAAC,GACnBwF,IAAI,CAACjF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC,GAC5CmH,KAAK,CAACpF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;EACpD;EAEA,MAAMyH,QAAQ,GAAGN,KAAK,CAACpF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;EAC7D,MAAM0H,SAAS,GAAGV,IAAI,CAACjF,GAAG,CAACP,IAAI,EAAET,IAAI,CAAC,CAAC,EAAE,EAAEf,KAAK,GAAG,CAAC,CAAC,CAAC,EAAEA,KAAK,CAAC;EAC9D,MAAM2H,KAAK,GAAGP,OAAO,CAACK,QAAQ,EAAEzH,KAAK,CAAC;EAEtC,QAAQwH,IAAI;IACV,KAAK,WAAW;MACd,OAAOpH,MAAM,CAACqH,QAAQ,EAAEC,SAAS,CAAC,GAAGD,QAAQ,GAAIE,KAAK,GAAG,EAAE,KAAK,EAAE,GAAIF,QAAQ,GAAGC,SAAS;IAE5F,KAAK,UAAU;MACb,OAAOtH,MAAM,CAACqH,QAAQ,EAAEC,SAAS,CAAC,GAAGD,QAAQ,GAAIE,KAAK,GAAG,EAAE,KAAK,EAAE,GAAID,SAAS,GAAGD,QAAQ;EAC9F;AACF,CAAC,CAAC;AAEF;;;;;;;;;;;;;;AAcO,MAAMG,MAAM,GAAIC,UAAgC,IAAgB;EACrE,IAAIC,GAAG,GAAGvG,IAAI;EACd,KAAK,MAAMrD,CAAC,IAAI2J,UAAU,EAAE;IAC1BC,GAAG,GAAG/F,GAAG,CAAC+F,GAAG,EAAE5J,CAAC,CAAC;EACnB;EAEA,OAAO4J,GAAG;AACZ,CAAC;AAAA1I,OAAA,CAAAwI,MAAA,GAAAA,MAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/BigInt.js

@@ -0,0 +1,567 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unsafeSqrt = exports.unsafeDivide = exports.toNumber = exports.sumAll = exports.sum = exports.subtract = exports.sqrt = exports.sign = exports.multiplyAll = exports.multiply = exports.min = exports.max = exports.lessThanOrEqualTo = exports.lessThan = exports.lcm = exports.isBigInt = exports.increment = exports.greaterThanOrEqualTo = exports.greaterThan = exports.gcd = exports.fromString = exports.fromNumber = exports.divide = exports.decrement = exports.clamp = exports.between = exports.abs = exports.Order = exports.Equivalence = void 0;
+var equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var Option = _interopRequireWildcard(require("./Option.js"));
+var order = _interopRequireWildcard(require("./Order.js"));
+var predicate = _interopRequireWildcard(require("./Predicate.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This module provides utility functions and type class instances for working with the `bigint` type in TypeScript.
+ * It includes functions for basic arithmetic operations, as well as type class instances for
+ * `Equivalence` and `Order`.
+ *
+ * @module BigInt
+ * @since 2.0.0
+ * @see {@link module:BigDecimal} for more similar operations on `BigDecimal` types
+ * @see {@link module:Number} for more similar operations on `number` types
+ */
+
+const bigint0 = /*#__PURE__*/BigInt(0);
+const bigint1 = /*#__PURE__*/BigInt(1);
+const bigint2 = /*#__PURE__*/BigInt(2);
+/**
+ * Tests if a value is a `bigint`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isBigInt } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(isBigInt(1n), true)
+ * assert.deepStrictEqual(isBigInt(1), false)
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isBigInt = exports.isBigInt = predicate.isBigInt;
+/**
+ * Provides an addition operation on `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { sum } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(sum(2n, 3n), 5n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const sum = exports.sum = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self + that);
+/**
+ * Provides a multiplication operation on `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { multiply } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(multiply(2n, 3n), 6n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const multiply = exports.multiply = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self * that);
+/**
+ * Provides a subtraction operation on `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { subtract } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(subtract(2n, 3n), -1n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const subtract = exports.subtract = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self - that);
+/**
+ * Provides a division operation on `bigint`s.
+ *
+ * If the dividend is not a multiple of the divisor the result will be a `bigint` value
+ * which represents the integer division rounded down to the nearest integer.
+ *
+ * Returns `None` if the divisor is `0n`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigInt.divide(6n, 3n), Option.some(2n))
+ * assert.deepStrictEqual(BigInt.divide(6n, 0n), Option.none())
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const divide = exports.divide = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => that === bigint0 ? Option.none() : Option.some(self / that));
+/**
+ * Provides a division operation on `bigint`s.
+ *
+ * If the dividend is not a multiple of the divisor the result will be a `bigint` value
+ * which represents the integer division rounded down to the nearest integer.
+ *
+ * Throws a `RangeError` if the divisor is `0n`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeDivide } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(unsafeDivide(6n, 3n), 2n)
+ * assert.deepStrictEqual(unsafeDivide(6n, 4n), 1n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const unsafeDivide = exports.unsafeDivide = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self / that);
+/**
+ * Returns the result of adding `1n` to a given number.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { increment } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(increment(2n), 3n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const increment = n => n + bigint1;
+/**
+ * Decrements a number by `1n`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { decrement } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(decrement(3n), 2n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.increment = increment;
+const decrement = n => n - bigint1;
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+exports.decrement = decrement;
+const Equivalence = exports.Equivalence = equivalence.bigint;
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Order = exports.Order = order.bigint;
+/**
+ * Returns `true` if the first argument is less than the second, otherwise `false`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { lessThan } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(lessThan(2n, 3n), true)
+ * assert.deepStrictEqual(lessThan(3n, 3n), false)
+ * assert.deepStrictEqual(lessThan(4n, 3n), false)
+ * ```
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const lessThan = exports.lessThan = /*#__PURE__*/order.lessThan(Order);
+/**
+ * Returns a function that checks if a given `bigint` is less than or equal to the provided one.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { lessThanOrEqualTo } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(lessThanOrEqualTo(2n, 3n), true)
+ * assert.deepStrictEqual(lessThanOrEqualTo(3n, 3n), true)
+ * assert.deepStrictEqual(lessThanOrEqualTo(4n, 3n), false)
+ * ```
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const lessThanOrEqualTo = exports.lessThanOrEqualTo = /*#__PURE__*/order.lessThanOrEqualTo(Order);
+/**
+ * Returns `true` if the first argument is greater than the second, otherwise `false`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { greaterThan } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(greaterThan(2n, 3n), false)
+ * assert.deepStrictEqual(greaterThan(3n, 3n), false)
+ * assert.deepStrictEqual(greaterThan(4n, 3n), true)
+ * ```
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const greaterThan = exports.greaterThan = /*#__PURE__*/order.greaterThan(Order);
+/**
+ * Returns a function that checks if a given `bigint` is greater than or equal to the provided one.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { greaterThanOrEqualTo } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(greaterThanOrEqualTo(2n, 3n), false)
+ * assert.deepStrictEqual(greaterThanOrEqualTo(3n, 3n), true)
+ * assert.deepStrictEqual(greaterThanOrEqualTo(4n, 3n), true)
+ * ```
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const greaterThanOrEqualTo = exports.greaterThanOrEqualTo = /*#__PURE__*/order.greaterThanOrEqualTo(Order);
+/**
+ * Checks if a `bigint` is between a `minimum` and `maximum` value (inclusive).
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt } from "effect"
+ *
+ * const between = BigInt.between({ minimum: 0n, maximum: 5n })
+ *
+ * assert.deepStrictEqual(between(3n), true)
+ * assert.deepStrictEqual(between(-1n), false)
+ * assert.deepStrictEqual(between(6n), false)
+ * ```
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const between = exports.between = /*#__PURE__*/order.between(Order);
+/**
+ * Restricts the given `bigint` to be within the range specified by the `minimum` and `maximum` values.
+ *
+ * - If the `bigint` is less than the `minimum` value, the function returns the `minimum` value.
+ * - If the `bigint` is greater than the `maximum` value, the function returns the `maximum` value.
+ * - Otherwise, it returns the original `bigint`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt } from "effect"
+ *
+ * const clamp = BigInt.clamp({ minimum: 1n, maximum: 5n })
+ *
+ * assert.equal(clamp(3n), 3n)
+ * assert.equal(clamp(0n), 1n)
+ * assert.equal(clamp(6n), 5n)
+ * ```
+ *
+ * @since 2.0.0
+ */
+const clamp = exports.clamp = /*#__PURE__*/order.clamp(Order);
+/**
+ * Returns the minimum between two `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { min } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(min(2n, 3n), 2n)
+ * ```
+ *
+ * @since 2.0.0
+ */
+const min = exports.min = /*#__PURE__*/order.min(Order);
+/**
+ * Returns the maximum between two `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { max } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(max(2n, 3n), 3n)
+ * ```
+ *
+ * @since 2.0.0
+ */
+const max = exports.max = /*#__PURE__*/order.max(Order);
+/**
+ * Determines the sign of a given `bigint`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { sign } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(sign(-5n), -1)
+ * assert.deepStrictEqual(sign(0n), 0)
+ * assert.deepStrictEqual(sign(5n), 1)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const sign = n => Order(n, bigint0);
+/**
+ * Determines the absolute value of a given `bigint`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { abs } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(abs(-5n), 5n)
+ * assert.deepStrictEqual(abs(0n), 0n)
+ * assert.deepStrictEqual(abs(5n), 5n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.sign = sign;
+const abs = n => n < bigint0 ? -n : n;
+/**
+ * Determines the greatest common divisor of two `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { gcd } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(gcd(2n, 3n), 1n)
+ * assert.deepStrictEqual(gcd(2n, 4n), 2n)
+ * assert.deepStrictEqual(gcd(16n, 24n), 8n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.abs = abs;
+const gcd = exports.gcd = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  while (that !== bigint0) {
+    const t = that;
+    that = self % that;
+    self = t;
+  }
+  return self;
+});
+/**
+ * Determines the least common multiple of two `bigint`s.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { lcm } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(lcm(2n, 3n), 6n)
+ * assert.deepStrictEqual(lcm(2n, 4n), 4n)
+ * assert.deepStrictEqual(lcm(16n, 24n), 48n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const lcm = exports.lcm = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self * that / gcd(self, that));
+/**
+ * Determines the square root of a given `bigint` unsafely. Throws if the given `bigint` is negative.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { unsafeSqrt } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(unsafeSqrt(4n), 2n)
+ * assert.deepStrictEqual(unsafeSqrt(9n), 3n)
+ * assert.deepStrictEqual(unsafeSqrt(16n), 4n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+const unsafeSqrt = n => {
+  if (n < bigint0) {
+    throw new RangeError("Cannot take the square root of a negative number");
+  }
+  if (n < bigint2) {
+    return n;
+  }
+  let x = n / bigint2;
+  while (x * x > n) {
+    x = (n / x + x) / bigint2;
+  }
+  return x;
+};
+/**
+ * Determines the square root of a given `bigint` safely. Returns `none` if the given `bigint` is negative.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BigInt.sqrt(4n), Option.some(2n))
+ * assert.deepStrictEqual(BigInt.sqrt(9n), Option.some(3n))
+ * assert.deepStrictEqual(BigInt.sqrt(16n), Option.some(4n))
+ * assert.deepStrictEqual(BigInt.sqrt(-1n), Option.none())
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.unsafeSqrt = unsafeSqrt;
+const sqrt = n => greaterThanOrEqualTo(n, bigint0) ? Option.some(unsafeSqrt(n)) : Option.none();
+/**
+ * Takes an `Iterable` of `bigint`s and returns their sum as a single `bigint
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { sumAll } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(sumAll([2n, 3n, 4n]), 9n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.sqrt = sqrt;
+const sumAll = collection => {
+  let out = bigint0;
+  for (const n of collection) {
+    out += n;
+  }
+  return out;
+};
+/**
+ * Takes an `Iterable` of `bigint`s and returns their multiplication as a single `number`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { multiplyAll } from "effect/BigInt"
+ *
+ * assert.deepStrictEqual(multiplyAll([2n, 3n, 4n]), 24n)
+ * ```
+ *
+ * @category math
+ * @since 2.0.0
+ */
+exports.sumAll = sumAll;
+const multiplyAll = collection => {
+  let out = bigint1;
+  for (const n of collection) {
+    if (n === bigint0) {
+      return bigint0;
+    }
+    out *= n;
+  }
+  return out;
+};
+/**
+ * Takes a `bigint` and returns an `Option` of `number`.
+ *
+ * If the `bigint` is outside the safe integer range for JavaScript (`Number.MAX_SAFE_INTEGER`
+ * and `Number.MIN_SAFE_INTEGER`), it returns `Option.none()`. Otherwise, it converts the `bigint`
+ * to a number and returns `Option.some(number)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt as BI, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BI.toNumber(BigInt(42)), Option.some(42))
+ * assert.deepStrictEqual(BI.toNumber(BigInt(Number.MAX_SAFE_INTEGER) + BigInt(1)), Option.none())
+ * assert.deepStrictEqual(BI.toNumber(BigInt(Number.MIN_SAFE_INTEGER) - BigInt(1)), Option.none())
+ * ```
+ *
+ * @category conversions
+ * @since 2.0.0
+ */
+exports.multiplyAll = multiplyAll;
+const toNumber = b => {
+  if (b > BigInt(Number.MAX_SAFE_INTEGER) || b < BigInt(Number.MIN_SAFE_INTEGER)) {
+    return Option.none();
+  }
+  return Option.some(Number(b));
+};
+/**
+ * Takes a string and returns an `Option` of `bigint`.
+ *
+ * If the string is empty or contains characters that cannot be converted into a `bigint`,
+ * it returns `Option.none()`, otherwise, it returns `Option.some(bigint)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt as BI, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BI.fromString("42"), Option.some(BigInt(42)))
+ * assert.deepStrictEqual(BI.fromString(" "), Option.none())
+ * assert.deepStrictEqual(BI.fromString("a"), Option.none())
+ * ```
+ *
+ * @category conversions
+ * @since 2.4.12
+ */
+exports.toNumber = toNumber;
+const fromString = s => {
+  try {
+    return s.trim() === "" ? Option.none() : Option.some(BigInt(s));
+  } catch {
+    return Option.none();
+  }
+};
+/**
+ * Takes a number and returns an `Option` of `bigint`.
+ *
+ * If the number is outside the safe integer range for JavaScript (`Number.MAX_SAFE_INTEGER`
+ * and `Number.MIN_SAFE_INTEGER`), it returns `Option.none()`. Otherwise, it attempts to
+ * convert the number to a `bigint` and returns `Option.some(bigint)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { BigInt as BI, Option } from "effect"
+ *
+ * assert.deepStrictEqual(BI.fromNumber(42), Option.some(BigInt(42)))
+ * assert.deepStrictEqual(BI.fromNumber(Number.MAX_SAFE_INTEGER + 1), Option.none())
+ * assert.deepStrictEqual(BI.fromNumber(Number.MIN_SAFE_INTEGER - 1), Option.none())
+ * ```
+ *
+ * @category conversions
+ * @since 2.4.12
+ */
+exports.fromString = fromString;
+const fromNumber = n => {
+  if (n > Number.MAX_SAFE_INTEGER || n < Number.MIN_SAFE_INTEGER) {
+    return Option.none();
+  }
+  try {
+    return Option.some(BigInt(n));
+  } catch {
+    return Option.none();
+  }
+};
+exports.fromNumber = fromNumber;
+//# sourceMappingURL=BigInt.js.map

backend/node_modules/effect/dist/cjs/BigInt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BigInt.js","names":["equivalence","_interopRequireWildcard","require","_Function","Option","order","predicate","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","bigint0","BigInt","bigint1","bigint2","isBigInt","exports","sum","dual","self","that","multiply","subtract","divide","none","some","unsafeDivide","increment","decrement","Equivalence","bigint","Order","lessThan","lessThanOrEqualTo","greaterThan","greaterThanOrEqualTo","between","clamp","min","max","sign","abs","gcd","lcm","unsafeSqrt","RangeError","x","sqrt","sumAll","collection","out","multiplyAll","toNumber","b","Number","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","fromString","s","trim","fromNumber"],"sources":["../../src/BigInt.ts"],"sourcesContent":[null],"mappings":";;;;;;AAWA,IAAAA,WAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,SAAA,GAAAD,OAAA;AACA,IAAAE,MAAA,GAAAH,uBAAA,CAAAC,OAAA;AACA,IAAAG,KAAA,GAAAJ,uBAAA,CAAAC,OAAA;AAEA,IAAAI,SAAA,GAAAL,uBAAA,CAAAC,OAAA;AAA2C,SAAAD,wBAAAM,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAR,uBAAA,YAAAA,CAAAM,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAhB3C;;;;;;;;;;;AAkBA,MAAMkB,OAAO,gBAAGC,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMC,OAAO,gBAAGD,MAAM,CAAC,CAAC,CAAC;AACzB,MAAME,OAAO,gBAAGF,MAAM,CAAC,CAAC,CAAC;AAEzB;;;;;;;;;;;;;;;AAeO,MAAMG,QAAQ,GAAAC,OAAA,CAAAD,QAAA,GAAgCxB,SAAS,CAACwB,QAAQ;AAEvE;;;;;;;;;;;;;;AAcO,MAAME,GAAG,GAAAD,OAAA,CAAAC,GAAA,gBA+BZ,IAAAC,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcO,MAAMC,QAAQ,GAAAL,OAAA,CAAAK,QAAA,gBA+BjB,IAAAH,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcO,MAAME,QAAQ,GAAAN,OAAA,CAAAM,QAAA,gBA+BjB,IAAAJ,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMG,MAAM,GAAAP,OAAA,CAAAO,MAAA,gBA2Cf,IAAAL,cAAI,EACN,CAAC,EACD,CAACC,IAAY,EAAEC,IAAY,KAA4BA,IAAI,KAAKT,OAAO,GAAGtB,MAAM,CAACmC,IAAI,EAAE,GAAGnC,MAAM,CAACoC,IAAI,CAACN,IAAI,GAAGC,IAAI,CAAC,CACnH;AAED;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMM,YAAY,GAAAV,OAAA,CAAAU,YAAA,gBA2CrB,IAAAR,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcO,MAAMO,SAAS,GAAI/B,CAAS,IAAaA,CAAC,GAAGiB,OAAO;AAE3D;;;;;;;;;;;;;;AAAAG,OAAA,CAAAW,SAAA,GAAAA,SAAA;AAcO,MAAMC,SAAS,GAAIhC,CAAS,IAAaA,CAAC,GAAGiB,OAAO;AAE3D;;;;AAAAG,OAAA,CAAAY,SAAA,GAAAA,SAAA;AAIO,MAAMC,WAAW,GAAAb,OAAA,CAAAa,WAAA,GAAoC5C,WAAW,CAAC6C,MAAM;AAE9E;;;;AAIO,MAAMC,KAAK,GAAAf,OAAA,CAAAe,KAAA,GAAwBzC,KAAK,CAACwC,MAAM;AAEtD;;;;;;;;;;;;;;;;AAgBO,MAAME,QAAQ,GAAAhB,OAAA,CAAAgB,QAAA,gBAmCjB1C,KAAK,CAAC0C,QAAQ,CAACD,KAAK,CAAC;AAEzB;;;;;;;;;;;;;;;;AAgBO,MAAME,iBAAiB,GAAAjB,OAAA,CAAAiB,iBAAA,gBAmC1B3C,KAAK,CAAC2C,iBAAiB,CAACF,KAAK,CAAC;AAElC;;;;;;;;;;;;;;;;AAgBO,MAAMG,WAAW,GAAAlB,OAAA,CAAAkB,WAAA,gBAmCpB5C,KAAK,CAAC4C,WAAW,CAACH,KAAK,CAAC;AAE5B;;;;;;;;;;;;;;;;AAgBO,MAAMI,oBAAoB,GAAAnB,OAAA,CAAAmB,oBAAA,gBAmC7B7C,KAAK,CAAC6C,oBAAoB,CAACJ,KAAK,CAAC;AAErC;;;;;;;;;;;;;;;;;;AAkBO,MAAMK,OAAO,GAAApB,OAAA,CAAAoB,OAAA,gBAkDhB9C,KAAK,CAAC8C,OAAO,CAACL,KAAK,CAAC;AAExB;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMM,KAAK,GAAArB,OAAA,CAAAqB,KAAA,gBAwDd/C,KAAK,CAAC+C,KAAK,CAACN,KAAK,CAAC;AAEtB;;;;;;;;;;;;;AAaO,MAAMO,GAAG,GAAAtB,OAAA,CAAAsB,GAAA,gBA6BZhD,KAAK,CAACgD,GAAG,CAACP,KAAK,CAAC;AAEpB;;;;;;;;;;;;;AAaO,MAAMQ,GAAG,GAAAvB,OAAA,CAAAuB,GAAA,gBA6BZjD,KAAK,CAACiD,GAAG,CAACR,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;;;AAgBO,MAAMS,IAAI,GAAI5C,CAAS,IAAemC,KAAK,CAACnC,CAAC,EAAEe,OAAO,CAAC;AAE9D;;;;;;;;;;;;;;;;AAAAK,OAAA,CAAAwB,IAAA,GAAAA,IAAA;AAgBO,MAAMC,GAAG,GAAI7C,CAAS,IAAcA,CAAC,GAAGe,OAAO,GAAG,CAACf,CAAC,GAAGA,CAAE;AAEhE;;;;;;;;;;;;;;;;AAAAoB,OAAA,CAAAyB,GAAA,GAAAA,GAAA;AAgBO,MAAMC,GAAG,GAAA1B,OAAA,CAAA0B,GAAA,gBAmCZ,IAAAxB,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAY;EACjD,OAAOA,IAAI,KAAKT,OAAO,EAAE;IACvB,MAAMlB,CAAC,GAAG2B,IAAI;IACdA,IAAI,GAAGD,IAAI,GAAGC,IAAI;IAClBD,IAAI,GAAG1B,CAAC;EACV;EACA,OAAO0B,IAAI;AACb,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;AAgBO,MAAMwB,GAAG,GAAA3B,OAAA,CAAA2B,GAAA,gBAmCZ,IAAAzB,cAAI,EAAC,CAAC,EAAE,CAACC,IAAY,EAAEC,IAAY,KAAcD,IAAI,GAAGC,IAAI,GAAIsB,GAAG,CAACvB,IAAI,EAAEC,IAAI,CAAC,CAAC;AAEpF;;;;;;;;;;;;;;;;AAgBO,MAAMwB,UAAU,GAAIhD,CAAS,IAAY;EAC9C,IAAIA,CAAC,GAAGe,OAAO,EAAE;IACf,MAAM,IAAIkC,UAAU,CAAC,kDAAkD,CAAC;EAC1E;EACA,IAAIjD,CAAC,GAAGkB,OAAO,EAAE;IACf,OAAOlB,CAAC;EACV;EACA,IAAIkD,CAAC,GAAGlD,CAAC,GAAGkB,OAAO;EACnB,OAAOgC,CAAC,GAAGA,CAAC,GAAGlD,CAAC,EAAE;IAChBkD,CAAC,GAAG,CAAElD,CAAC,GAAGkD,CAAC,GAAIA,CAAC,IAAIhC,OAAO;EAC7B;EACA,OAAOgC,CAAC;AACV,CAAC;AAED;;;;;;;;;;;;;;;;;AAAA9B,OAAA,CAAA4B,UAAA,GAAAA,UAAA;AAiBO,MAAMG,IAAI,GAAInD,CAAS,IAC5BuC,oBAAoB,CAACvC,CAAC,EAAEe,OAAO,CAAC,GAAGtB,MAAM,CAACoC,IAAI,CAACmB,UAAU,CAAChD,CAAC,CAAC,CAAC,GAAGP,MAAM,CAACmC,IAAI,EAAU;AAEvF;;;;;;;;;;;;;;AAAAR,OAAA,CAAA+B,IAAA,GAAAA,IAAA;AAcO,MAAMC,MAAM,GAAIC,UAA4B,IAAY;EAC7D,IAAIC,GAAG,GAAGvC,OAAO;EACjB,KAAK,MAAMf,CAAC,IAAIqD,UAAU,EAAE;IAC1BC,GAAG,IAAItD,CAAC;EACV;EACA,OAAOsD,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;AAAAlC,OAAA,CAAAgC,MAAA,GAAAA,MAAA;AAcO,MAAMG,WAAW,GAAIF,UAA4B,IAAY;EAClE,IAAIC,GAAG,GAAGrC,OAAO;EACjB,KAAK,MAAMjB,CAAC,IAAIqD,UAAU,EAAE;IAC1B,IAAIrD,CAAC,KAAKe,OAAO,EAAE;MACjB,OAAOA,OAAO;IAChB;IACAuC,GAAG,IAAItD,CAAC;EACV;EACA,OAAOsD,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAAAlC,OAAA,CAAAmC,WAAA,GAAAA,WAAA;AAoBO,MAAMC,QAAQ,GAAIC,CAAS,IAA2B;EAC3D,IAAIA,CAAC,GAAGzC,MAAM,CAAC0C,MAAM,CAACC,gBAAgB,CAAC,IAAIF,CAAC,GAAGzC,MAAM,CAAC0C,MAAM,CAACE,gBAAgB,CAAC,EAAE;IAC9E,OAAOnE,MAAM,CAACmC,IAAI,EAAE;EACtB;EACA,OAAOnC,MAAM,CAACoC,IAAI,CAAC6B,MAAM,CAACD,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;;AAAArC,OAAA,CAAAoC,QAAA,GAAAA,QAAA;AAmBO,MAAMK,UAAU,GAAIC,CAAS,IAA2B;EAC7D,IAAI;IACF,OAAOA,CAAC,CAACC,IAAI,EAAE,KAAK,EAAE,GAClBtE,MAAM,CAACmC,IAAI,EAAE,GACbnC,MAAM,CAACoC,IAAI,CAACb,MAAM,CAAC8C,CAAC,CAAC,CAAC;EAC5B,CAAC,CAAC,MAAM;IACN,OAAOrE,MAAM,CAACmC,IAAI,EAAE;EACtB;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAAAR,OAAA,CAAAyC,UAAA,GAAAA,UAAA;AAoBO,MAAMG,UAAU,GAAIhE,CAAS,IAA2B;EAC7D,IAAIA,CAAC,GAAG0D,MAAM,CAACC,gBAAgB,IAAI3D,CAAC,GAAG0D,MAAM,CAACE,gBAAgB,EAAE;IAC9D,OAAOnE,MAAM,CAACmC,IAAI,EAAE;EACtB;EAEA,IAAI;IACF,OAAOnC,MAAM,CAACoC,IAAI,CAACb,MAAM,CAAChB,CAAC,CAAC,CAAC;EAC/B,CAAC,CAAC,MAAM;IACN,OAAOP,MAAM,CAACmC,IAAI,EAAE;EACtB;AACF,CAAC;AAAAR,OAAA,CAAA4C,UAAA,GAAAA,UAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Boolean.js

@@ -0,0 +1,251 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xor = exports.some = exports.or = exports.not = exports.nor = exports.nand = exports.match = exports.isBoolean = exports.implies = exports.every = exports.eqv = exports.and = exports.Order = exports.Equivalence = void 0;
+var equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var order = _interopRequireWildcard(require("./Order.js"));
+var predicate = _interopRequireWildcard(require("./Predicate.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This module provides utility functions and type class instances for working with the `boolean` type in TypeScript.
+ * It includes functions for basic boolean operations, as well as type class instances for
+ * `Equivalence` and `Order`.
+ *
+ * @since 2.0.0
+ */
+
+/**
+ * Tests if a value is a `boolean`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { isBoolean } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(isBoolean(true), true)
+ * assert.deepStrictEqual(isBoolean("true"), false)
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isBoolean = exports.isBoolean = predicate.isBoolean;
+/**
+ * This function returns the result of either of the given functions depending on the value of the boolean parameter.
+ * It is useful when you have to run one of two functions depending on the boolean value.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Boolean } from "effect"
+ *
+ * assert.deepStrictEqual(Boolean.match(true, { onFalse: () => "It's false!", onTrue: () => "It's true!" }), "It's true!")
+ * ```
+ *
+ * @category pattern matching
+ * @since 2.0.0
+ */
+const match = exports.match = /*#__PURE__*/(0, _Function.dual)(2, (value, options) => value ? options.onTrue() : options.onFalse());
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Equivalence = exports.Equivalence = equivalence.boolean;
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Order = exports.Order = order.boolean;
+/**
+ * Negates the given boolean: `!self`
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { not } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(not(true), false)
+ * assert.deepStrictEqual(not(false), true)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const not = self => !self;
+/**
+ * Combines two boolean using AND: `self && that`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { and } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(and(true, true), true)
+ * assert.deepStrictEqual(and(true, false), false)
+ * assert.deepStrictEqual(and(false, true), false)
+ * assert.deepStrictEqual(and(false, false), false)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+exports.not = not;
+const and = exports.and = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self && that);
+/**
+ * Combines two boolean using NAND: `!(self && that)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { nand } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(nand(true, true), false)
+ * assert.deepStrictEqual(nand(true, false), true)
+ * assert.deepStrictEqual(nand(false, true), true)
+ * assert.deepStrictEqual(nand(false, false), true)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const nand = exports.nand = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => !(self && that));
+/**
+ * Combines two boolean using OR: `self || that`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { or } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(or(true, true), true)
+ * assert.deepStrictEqual(or(true, false), true)
+ * assert.deepStrictEqual(or(false, true), true)
+ * assert.deepStrictEqual(or(false, false), false)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const or = exports.or = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self || that);
+/**
+ * Combines two booleans using NOR: `!(self || that)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { nor } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(nor(true, true), false)
+ * assert.deepStrictEqual(nor(true, false), false)
+ * assert.deepStrictEqual(nor(false, true), false)
+ * assert.deepStrictEqual(nor(false, false), true)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const nor = exports.nor = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => !(self || that));
+/**
+ * Combines two booleans using XOR: `(!self && that) || (self && !that)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { xor } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(xor(true, true), false)
+ * assert.deepStrictEqual(xor(true, false), true)
+ * assert.deepStrictEqual(xor(false, true), true)
+ * assert.deepStrictEqual(xor(false, false), false)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const xor = exports.xor = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => !self && that || self && !that);
+/**
+ * Combines two booleans using EQV (aka XNOR): `!xor(self, that)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { eqv } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(eqv(true, true), true)
+ * assert.deepStrictEqual(eqv(true, false), false)
+ * assert.deepStrictEqual(eqv(false, true), false)
+ * assert.deepStrictEqual(eqv(false, false), true)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const eqv = exports.eqv = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => !xor(self, that));
+/**
+ * Combines two booleans using an implication: `(!self || that)`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { implies } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(implies(true, true), true)
+ * assert.deepStrictEqual(implies(true, false), false)
+ * assert.deepStrictEqual(implies(false, true), true)
+ * assert.deepStrictEqual(implies(false, false), true)
+ * ```
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+const implies = exports.implies = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => self ? that : true);
+/**
+ * This utility function is used to check if all the elements in a collection of boolean values are `true`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { every } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(every([true, true, true]), true)
+ * assert.deepStrictEqual(every([true, false, true]), false)
+ * ```
+ *
+ * @since 2.0.0
+ */
+const every = collection => {
+  for (const b of collection) {
+    if (!b) {
+      return false;
+    }
+  }
+  return true;
+};
+/**
+ * This utility function is used to check if at least one of the elements in a collection of boolean values is `true`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { some } from "effect/Boolean"
+ *
+ * assert.deepStrictEqual(some([true, false, true]), true)
+ * assert.deepStrictEqual(some([false, false, false]), false)
+ * ```
+ *
+ * @since 2.0.0
+ */
+exports.every = every;
+const some = collection => {
+  for (const b of collection) {
+    if (b) {
+      return true;
+    }
+  }
+  return false;
+};
+exports.some = some;
+//# sourceMappingURL=Boolean.js.map

backend/node_modules/effect/dist/cjs/Boolean.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Boolean.js","names":["equivalence","_interopRequireWildcard","require","_Function","order","predicate","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","isBoolean","exports","match","dual","value","options","onTrue","onFalse","Equivalence","boolean","Order","not","self","and","that","nand","or","nor","xor","eqv","implies","every","collection","b","some"],"sources":["../../src/Boolean.ts"],"sourcesContent":[null],"mappings":";;;;;;AAOA,IAAAA,WAAA,GAAAC,uBAAA,CAAAC,OAAA;AAEA,IAAAC,SAAA,GAAAD,OAAA;AACA,IAAAE,KAAA,GAAAH,uBAAA,CAAAC,OAAA;AACA,IAAAG,SAAA,GAAAJ,uBAAA,CAAAC,OAAA;AAA2C,SAAAD,wBAAAK,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAP,uBAAA,YAAAA,CAAAK,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAX3C;;;;;;;;AAaA;;;;;;;;;;;;;;;AAeO,MAAMkB,SAAS,GAAAC,OAAA,CAAAD,SAAA,GAAyCpB,SAAS,CAACoB,SAAS;AAElF;;;;;;;;;;;;;;;AAeO,MAAME,KAAK,GAAAD,OAAA,CAAAC,KAAA,gBA4Cd,IAAAC,cAAI,EAAC,CAAC,EAAE,CAAOC,KAAc,EAAEC,OAGlC,KAAYD,KAAK,GAAGC,OAAO,CAACC,MAAM,EAAE,GAAGD,OAAO,CAACE,OAAO,EAAE,CAAC;AAE1D;;;;AAIO,MAAMC,WAAW,GAAAP,OAAA,CAAAO,WAAA,GAAqCjC,WAAW,CAACkC,OAAO;AAEhF;;;;AAIO,MAAMC,KAAK,GAAAT,OAAA,CAAAS,KAAA,GAAyB/B,KAAK,CAAC8B,OAAO;AAExD;;;;;;;;;;;;;;;AAeO,MAAME,GAAG,GAAIC,IAAa,IAAc,CAACA,IAAI;AAEpD;;;;;;;;;;;;;;;;;AAAAX,OAAA,CAAAU,GAAA,GAAAA,GAAA;AAiBO,MAAME,GAAG,GAAAZ,OAAA,CAAAY,GAAA,gBAqCZ,IAAAV,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAcF,IAAI,IAAIE,IAAI,CAAC;AAEpE;;;;;;;;;;;;;;;;;AAiBO,MAAMC,IAAI,GAAAd,OAAA,CAAAc,IAAA,gBAqCb,IAAAZ,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAc,EAAEF,IAAI,IAAIE,IAAI,CAAC,CAAC;AAEvE;;;;;;;;;;;;;;;;;AAiBO,MAAME,EAAE,GAAAf,OAAA,CAAAe,EAAA,gBAqCX,IAAAb,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAcF,IAAI,IAAIE,IAAI,CAAC;AAEpE;;;;;;;;;;;;;;;;;AAiBO,MAAMG,GAAG,GAAAhB,OAAA,CAAAgB,GAAA,gBAqCZ,IAAAd,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAc,EAAEF,IAAI,IAAIE,IAAI,CAAC,CAAC;AAEvE;;;;;;;;;;;;;;;;;AAiBO,MAAMI,GAAG,GAAAjB,OAAA,CAAAiB,GAAA,gBAqCZ,IAAAf,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAe,CAACF,IAAI,IAAIE,IAAI,IAAMF,IAAI,IAAI,CAACE,IAAK,CAAC;AAE1F;;;;;;;;;;;;;;;;;AAiBO,MAAMK,GAAG,GAAAlB,OAAA,CAAAkB,GAAA,gBAqCZ,IAAAhB,cAAI,EAAC,CAAC,EAAE,CAACS,IAAa,EAAEE,IAAa,KAAc,CAACI,GAAG,CAACN,IAAI,EAAEE,IAAI,CAAC,CAAC;AAExE;;;;;;;;;;;;;;;;;AAiBO,MAAMM,OAAO,GAAAnB,OAAA,CAAAmB,OAAA,gBAqChB,IAAAjB,cAAI,EAAC,CAAC,EAAE,CAACS,IAAI,EAAEE,IAAI,KAAKF,IAAI,GAAGE,IAAI,GAAG,IAAI,CAAC;AAE/C;;;;;;;;;;;;;;AAcO,MAAMO,KAAK,GAAIC,UAA6B,IAAa;EAC9D,KAAK,MAAMC,CAAC,IAAID,UAAU,EAAE;IAC1B,IAAI,CAACC,CAAC,EAAE;MACN,OAAO,KAAK;IACd;EACF;EACA,OAAO,IAAI;AACb,CAAC;AAED;;;;;;;;;;;;;;AAAAtB,OAAA,CAAAoB,KAAA,GAAAA,KAAA;AAcO,MAAMG,IAAI,GAAIF,UAA6B,IAAa;EAC7D,KAAK,MAAMC,CAAC,IAAID,UAAU,EAAE;IAC1B,IAAIC,CAAC,EAAE;MACL,OAAO,IAAI;IACb;EACF;EACA,OAAO,KAAK;AACd,CAAC;AAAAtB,OAAA,CAAAuB,IAAA,GAAAA,IAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Brand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Brand.js","names":["Arr","_interopRequireWildcard","require","Either","_Function","Option","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","BrandTypeId","exports","Symbol","for","RefinedConstructorsTypeId","error","message","meta","errors","flatten","refined","args","either","length","unbranded","right","left","match","onNone","onSome","assign","getOrThrowWith","identity","option","getRight","is","isRight","nominal","some","_args","all","brands","result","brand","nextResult","isLeft","onLeft","onRight","unsafeCoerce"],"sources":["../../src/Brand.ts"],"sourcesContent":[null],"mappings":";;;;;;;;AAkBA,IAAAA,GAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,MAAA,GAAAF,uBAAA,CAAAC,OAAA;AACA,IAAAE,SAAA,GAAAF,OAAA;AACA,IAAAG,MAAA,GAAAJ,uBAAA,CAAAC,OAAA;AAAqC,SAAAD,wBAAAK,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAP,uBAAA,YAAAA,CAAAK,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AArBrC;;;;;;;;;;;;;;;;;;;AAyBA;;;;AAIO,MAAMkB,WAAW,GAAAC,OAAA,CAAAD,WAAA,gBAAkBE,MAAM,CAACC,GAAG,CAAC,cAAc,CAAC;AAQpE;;;;AAIO,MAAMC,yBAAyB,GAAAH,OAAA,CAAAG,yBAAA,gBAAkBF,MAAM,CAACC,GAAG,CAAC,sBAAsB,CAAC;AA6H1F;;;;;;AAMO,MAAME,KAAK,GAAGA,CAACC,OAAe,EAAEC,IAAc,KAAwB,CAAC;EAC5ED,OAAO;EACPC;CACD,CAAC;AAEF;;;;;;AAAAN,OAAA,CAAAI,KAAA,GAAAA,KAAA;AAMO,MAAMG,MAAM,GAA+DA,CAChF,GAAGA,MAAgC,KACbjC,GAAG,CAACkC,OAAO,CAACD,MAAM,CAAC;AAAAP,OAAA,CAAAO,MAAA,GAAAA,MAAA;AAsCrC,SAAUE,OAAOA,CACrB,GAAGC,IAGF;EAED,MAAMC,MAAM,GAA2ED,IAAI,CAACE,MAAM,KAAK,CAAC,GACrGC,SAAS,IAAKH,IAAI,CAAC,CAAC,CAAC,CAACG,SAAS,CAAC,GAAGpC,MAAM,CAACqC,KAAK,CAACD,SAAc,CAAC,GAAGpC,MAAM,CAACsC,IAAI,CAACL,IAAI,CAAC,CAAC,CAAC,CAACG,SAAS,CAAC,CAAC,GACjGA,SAAS,IAAI;IACZ,OAAOlC,MAAM,CAACqC,KAAK,CAACN,IAAI,CAAC,CAAC,CAAC,CAACG,SAAS,CAAC,EAAE;MACtCI,MAAM,EAAEA,CAAA,KAAMxC,MAAM,CAACqC,KAAK,CAACD,SAAc,CAAC;MAC1CK,MAAM,EAAEzC,MAAM,CAACsC;KAChB,CAAC;EACJ,CAAC;EACH,OAAOnB,MAAM,CAACuB,MAAM,CAAEN,SAA6B,IAAKpC,MAAM,CAAC2C,cAAc,CAACT,MAAM,CAACE,SAAS,CAAC,EAAEQ,kBAAQ,CAAC,EAAE;IAC1G,CAAClB,yBAAyB,GAAGA,yBAAyB;IACtDmB,MAAM,EAAGZ,IAAS,IAAK/B,MAAM,CAAC4C,QAAQ,CAACZ,MAAM,CAACD,IAAI,CAAC,CAAC;IACpDC,MAAM;IACNa,EAAE,EAAGd,IAAS,IAAqCjC,MAAM,CAACgD,OAAO,CAACd,MAAM,CAACD,IAAI,CAAC;GAC/E,CAAQ;AACX;AAEA;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMgB,OAAO,GAAGA,CAAA,KAEnB;EACF;EACA,OAAO9B,MAAM,CAACuB,MAAM,CAAET,IAAI,IAAKA,IAAI,EAAE;IACnC,CAACP,yBAAyB,GAAGA,yBAAyB;IACtDmB,MAAM,EAAGZ,IAAS,IAAK/B,MAAM,CAACgD,IAAI,CAACjB,IAAI,CAAC;IACxCC,MAAM,EAAGD,IAAS,IAAKjC,MAAM,CAACqC,KAAK,CAACJ,IAAI,CAAC;IACzCc,EAAE,EAAGI,KAAU,IAAsC;GACtD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA5B,OAAA,CAAA0B,OAAA,GAAAA,OAAA;AAgCO,MAAMG,GAAG,GAKZA,CAEF,GAAGC,MAAsC,KAMvC;EACF,MAAMnB,MAAM,GAAID,IAAS,IAA2C;IAClE,IAAIqB,MAAM,GAA0CtD,MAAM,CAACqC,KAAK,CAACJ,IAAI,CAAC;IACtE,KAAK,MAAMsB,KAAK,IAAIF,MAAM,EAAE;MAC1B,MAAMG,UAAU,GAAGD,KAAK,CAACrB,MAAM,CAACD,IAAI,CAAC;MACrC,IAAIjC,MAAM,CAACyD,MAAM,CAACH,MAAM,CAAC,IAAItD,MAAM,CAACyD,MAAM,CAACD,UAAU,CAAC,EAAE;QACtDF,MAAM,GAAGtD,MAAM,CAACsC,IAAI,CAAC,CAAC,GAAGgB,MAAM,CAAChB,IAAI,EAAE,GAAGkB,UAAU,CAAClB,IAAI,CAAC,CAAC;MAC5D,CAAC,MAAM;QACLgB,MAAM,GAAGtD,MAAM,CAACyD,MAAM,CAACH,MAAM,CAAC,GAAGA,MAAM,GAAGE,UAAU;MACtD;IACF;IACA,OAAOF,MAAM;EACf,CAAC;EACD;EACA,OAAOnC,MAAM,CAACuB,MAAM,CAAET,IAAI,IACxBjC,MAAM,CAACuC,KAAK,CAACL,MAAM,CAACD,IAAI,CAAC,EAAE;IACzByB,MAAM,EAAGvD,CAAC,IAAI;MACZ,MAAMA,CAAC;IACT,CAAC;IACDwD,OAAO,EAAEf;GACV,CAAC,EAAE;IACJ,CAAClB,yBAAyB,GAAGA,yBAAyB;IACtDmB,MAAM,EAAGZ,IAAS,IAAK/B,MAAM,CAAC4C,QAAQ,CAACZ,MAAM,CAACD,IAAI,CAAC,CAAC;IACpDC,MAAM;IACNa,EAAE,EAAGd,IAAS,IAAkBjC,MAAM,CAACgD,OAAO,CAACd,MAAM,CAACD,IAAI,CAAC;GAC5D,CAAC;AACJ,CAAC;AAED;;;;;;AAAAV,OAAA,CAAA6B,GAAA,GAAAA,GAAA;AAMO,MAAMhB,SAAS,GAAAb,OAAA,CAAAa,SAAA,GAA6DwB,sBAAY","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Cache.js

@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.makeWith = exports.makeEntryStats = exports.makeCacheStats = exports.make = exports.ConsumerCacheTypeId = exports.CacheTypeId = void 0;
+var internal = _interopRequireWildcard(require("./internal/cache.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const CacheTypeId = exports.CacheTypeId = internal.CacheTypeId;
+/**
+ * @since 3.6.4
+ * @category symbols
+ */
+const ConsumerCacheTypeId = exports.ConsumerCacheTypeId = internal.ConsumerCacheTypeId;
+/**
+ * Constructs a new cache with the specified capacity, time to live, and
+ * lookup function.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = exports.make = internal.make;
+/**
+ * Constructs a new cache with the specified capacity, time to live, and
+ * lookup function, where the time to live can depend on the `Exit` value
+ * returned by the lookup function.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const makeWith = exports.makeWith = internal.makeWith;
+/**
+ * Constructs a new `CacheStats` from the specified values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const makeCacheStats = exports.makeCacheStats = internal.makeCacheStats;
+/**
+ * Constructs a new `EntryStats` from the specified values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const makeEntryStats = exports.makeEntryStats = internal.makeEntryStats;
+//# sourceMappingURL=Cache.js.map

backend/node_modules/effect/dist/cjs/Cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Cache.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","CacheTypeId","exports","ConsumerCacheTypeId","make","makeWith","makeCacheStats","makeEntryStats"],"sources":["../../src/Cache.ts"],"sourcesContent":[null],"mappings":";;;;;;AAOA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAA+C,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAK/C;;;;AAIO,MAAMkB,WAAW,GAAAC,OAAA,CAAAD,WAAA,GAAkBtB,QAAQ,CAACsB,WAAW;AAQ9D;;;;AAIO,MAAME,mBAAmB,GAAAD,OAAA,CAAAC,mBAAA,GAAkBxB,QAAQ,CAACwB,mBAAmB;AAsK9E;;;;;;;AAOO,MAAMC,IAAI,GAAAF,OAAA,CAAAE,IAAA,GAMkDzB,QAAQ,CAACyB,IAAI;AAEhF;;;;;;;;AAQO,MAAMC,QAAQ,GAAAH,OAAA,CAAAG,QAAA,GAM8C1B,QAAQ,CAAC0B,QAAQ;AAepF;;;;;;AAMO,MAAMC,cAAc,GAAAJ,OAAA,CAAAI,cAAA,GAMT3B,QAAQ,CAAC2B,cAAc;AAYzC;;;;;;AAMO,MAAMC,cAAc,GAAAL,OAAA,CAAAK,cAAA,GAAyC5B,QAAQ,CAAC4B,cAAc","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Cause.js

@@ -0,0 +1,1011 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stripSomeDefects = exports.stripFailures = exports.squashWith = exports.squash = exports.size = exports.sequential = exports.reduceWithContext = exports.reduce = exports.prettyErrors = exports.pretty = exports.parallel = exports.originalError = exports.match = exports.map = exports.linearize = exports.keepDefects = exports.isUnknownException = exports.isTimeoutException = exports.isSequentialType = exports.isRuntimeException = exports.isParallelType = exports.isNoSuchElementException = exports.isInterruptedOnly = exports.isInterruptedException = exports.isInterrupted = exports.isInterruptType = exports.isIllegalArgumentException = exports.isFailure = exports.isFailType = exports.isExceededCapacityException = exports.isEmptyType = exports.isEmpty = exports.isDieType = exports.isDie = exports.isCause = exports.interruptors = exports.interruptOption = exports.interrupt = exports.flipCauseOption = exports.flatten = exports.flatMap = exports.find = exports.filter = exports.failures = exports.failureOrCause = exports.failureOption = exports.fail = exports.empty = exports.dieOption = exports.die = exports.defects = exports.contains = exports.as = exports.andThen = exports.YieldableError = exports.UnknownExceptionTypeId = exports.UnknownException = exports.TimeoutExceptionTypeId = exports.TimeoutException = exports.RuntimeExceptionTypeId = exports.RuntimeException = exports.NoSuchElementExceptionTypeId = exports.NoSuchElementException = exports.InvalidPubSubCapacityExceptionTypeId = exports.InterruptedExceptionTypeId = exports.InterruptedException = exports.IllegalArgumentExceptionTypeId = exports.IllegalArgumentException = exports.ExceededCapacityExceptionTypeId = exports.ExceededCapacityException = exports.CauseTypeId = void 0;
+var internal = _interopRequireWildcard(require("./internal/cause.js"));
+var core = _interopRequireWildcard(require("./internal/core.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * A unique symbol identifying the `Cause` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that helps identify instances of the `Cause` data
+ * type. This can be used for advanced operations such as refining types or
+ * building internal utilities that check whether an unknown value is a `Cause`.
+ *
+ * @see {@link isCause} Check if a value is a `Cause`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const CauseTypeId = exports.CauseTypeId = internal.CauseTypeId;
+/**
+ * A unique symbol identifying the `RuntimeException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies a `RuntimeException`. This is
+ * typically used internally by the library to recognize checked exceptions that
+ * occur during runtime.
+ *
+ * @see {@link RuntimeException} Create or work with a `RuntimeException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const RuntimeExceptionTypeId = exports.RuntimeExceptionTypeId = core.RuntimeExceptionTypeId;
+/**
+ * A unique symbol identifying the `InterruptedException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies an `InterruptedException`. This is
+ * typically used internally to recognize when a fiber has been interrupted,
+ * helping the framework handle interruption logic correctly.
+ *
+ * @see {@link InterruptedException} Create or work with an `InterruptedException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const InterruptedExceptionTypeId = exports.InterruptedExceptionTypeId = core.InterruptedExceptionTypeId;
+/**
+ * A unique symbol identifying the `IllegalArgumentException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies an `IllegalArgumentException`. This is
+ * often used in scenarios where invalid arguments are supplied to methods that
+ * expect specific input.
+ *
+ * @see {@link IllegalArgumentException} Create or work with an `IllegalArgumentException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const IllegalArgumentExceptionTypeId = exports.IllegalArgumentExceptionTypeId = core.IllegalArgumentExceptionTypeId;
+/**
+ * A unique symbol identifying the `NoSuchElementException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies a `NoSuchElementException`. It helps
+ * differentiate cases where a required element is missing within a data
+ * structure.
+ *
+ * @see {@link NoSuchElementException} Create or work with a `NoSuchElementException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const NoSuchElementExceptionTypeId = exports.NoSuchElementExceptionTypeId = core.NoSuchElementExceptionTypeId;
+/**
+ * A unique symbol identifying the `InvalidPubSubCapacityException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies an `InvalidPubSubCapacityException`.
+ * It indicates an error related to an invalid capacity passed to a `PubSub`
+ * structure.
+ *
+ * @see {@link InvalidPubSubCapacityException} Create or work with an `InvalidPubSubCapacityException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const InvalidPubSubCapacityExceptionTypeId = exports.InvalidPubSubCapacityExceptionTypeId = core.InvalidPubSubCapacityExceptionTypeId;
+/**
+ * A unique symbol identifying the `ExceededCapacityException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies an `ExceededCapacityException`. It
+ * denotes situations where a resource has exceeded its configured capacity
+ * limit.
+ *
+ * @see {@link ExceededCapacityException} Create or work with an `ExceededCapacityException`
+ *
+ * @since 3.5.0
+ * @category Symbols
+ */
+const ExceededCapacityExceptionTypeId = exports.ExceededCapacityExceptionTypeId = core.ExceededCapacityExceptionTypeId;
+/**
+ * A unique symbol identifying the `TimeoutException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies a `TimeoutException`. It helps the
+ * framework recognize errors related to operations that fail to complete within
+ * a given timeframe.
+ *
+ * @see {@link TimeoutException} Create or work with a `TimeoutException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const TimeoutExceptionTypeId = exports.TimeoutExceptionTypeId = core.TimeoutExceptionTypeId;
+/**
+ * A unique symbol identifying the `UnknownException` type.
+ *
+ * **Details**
+ *
+ * This provides a symbol that identifies an `UnknownException`. It is typically
+ * used for generic or unexpected errors that do not fit other specific
+ * exception categories.
+ *
+ * @see {@link UnknownException} Create or work with an `UnknownException`
+ *
+ * @since 2.0.0
+ * @category Symbols
+ */
+const UnknownExceptionTypeId = exports.UnknownExceptionTypeId = core.UnknownExceptionTypeId;
+/**
+ * Creates an error that occurs at runtime, extendable for other exception
+ * types.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const YieldableError = exports.YieldableError = core.YieldableError;
+/**
+ * Creates an `Empty` cause.
+ *
+ * **Details**
+ *
+ * This function returns a cause that signifies "no error." It's commonly used
+ * to represent an absence of failure conditions.
+ *
+ * @see {@link isEmpty} Check if a `Cause` is empty
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const empty = exports.empty = internal.empty;
+/**
+ * Creates a `Fail` cause from an expected error.
+ *
+ * **Details**
+ *
+ * This function constructs a `Cause` carrying an error of type `E`. It's used
+ * when you want to represent a known or anticipated failure in your effectful
+ * computations.
+ *
+ * @see {@link isFailure} Check if a `Cause` contains a failure
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const fail = exports.fail = internal.fail;
+/**
+ * Creates a `Die` cause from an unexpected error.
+ *
+ * **Details**
+ *
+ * This function wraps an unhandled or unknown defect (like a runtime crash)
+ * into a `Cause`. It's useful for capturing unforeseen issues in a structured
+ * way.
+ *
+ * @see {@link isDie} Check if a `Cause` contains a defect
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const die = exports.die = internal.die;
+/**
+ * Creates an `Interrupt` cause from a `FiberId`.
+ *
+ * **Details**
+ *
+ * This function represents a fiber that has been interrupted. It stores the
+ * identifier of the interrupted fiber, enabling precise tracking of concurrent
+ * cancellations.
+ *
+ * @see {@link isInterrupted} Check if a `Cause` contains an interruption
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const interrupt = exports.interrupt = internal.interrupt;
+/**
+ * Combines two `Cause`s in parallel.
+ *
+ * **Details**
+ *
+ * This function merges two errors that occurred simultaneously. Instead of
+ * discarding one error, both are retained, allowing for richer error reporting
+ * and debugging.
+ *
+ * @see {@link isParallelType} Check if a `Cause` is a `Parallel`
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const parallel = exports.parallel = internal.parallel;
+/**
+ * Combines two `Cause`s sequentially.
+ *
+ * **Details**
+ *
+ * This function merges two errors that occurred in sequence, such as a main
+ * error followed by a finalization error. It preserves both errors for complete
+ * failure information.
+ *
+ * @see {@link isSequentialType} Check if a `Cause` is a `Sequential`
+ *
+ * @since 2.0.0
+ * @category Constructors
+ */
+const sequential = exports.sequential = internal.sequential;
+/**
+ * Checks if a value is a `Cause`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isCause = exports.isCause = internal.isCause;
+/**
+ * Checks if a `Cause` is an `Empty` type.
+ *
+ * @see {@link empty} Create a new `Empty` cause
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isEmptyType = exports.isEmptyType = internal.isEmptyType;
+/**
+ * Checks if a `Cause` is a `Fail` type.
+ *
+ * @see {@link fail} Create a new `Fail` cause
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isFailType = exports.isFailType = internal.isFailType;
+/**
+ * Checks if a `Cause` is a `Die` type.
+ *
+ * @see {@link die} Create a new `Die` cause
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isDieType = exports.isDieType = internal.isDieType;
+/**
+ * Checks if a `Cause` is an `Interrupt` type.
+ *
+ * @see {@link interrupt} Create an `Interrupt` cause
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isInterruptType = exports.isInterruptType = internal.isInterruptType;
+/**
+ * Checks if a `Cause` is a `Sequential` type.
+ *
+ * @see {@link sequential} Combine two `Cause`s sequentially
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isSequentialType = exports.isSequentialType = internal.isSequentialType;
+/**
+ * Checks if a `Cause` is a `Parallel` type.
+ *
+ * @see {@link parallel} Combine two `Cause`s in parallel
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isParallelType = exports.isParallelType = internal.isParallelType;
+/**
+ * Calculates the size of a `Cause`.
+ *
+ * **Details**
+ *
+ * This function returns the total number of `Cause` nodes in the semiring
+ * structure, reflecting how many individual error elements are recorded.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const size = exports.size = internal.size;
+/**
+ * Checks if a `Cause` is entirely empty.
+ *
+ * **Details**
+ *
+ * This function returns `true` if the `Cause` contains no errors, defects, or
+ * interruptions. It's helpful for verifying if a computation truly had no
+ * failures.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const isEmpty = exports.isEmpty = internal.isEmpty;
+/**
+ * Checks if a `Cause` contains a failure.
+ *
+ * **Details**
+ *
+ * This function returns `true` if the `Cause` includes any `Fail` error. It's
+ * commonly used to confirm whether a workflow encountered an anticipated error
+ * versus just defects or interruptions.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const isFailure = exports.isFailure = internal.isFailure;
+/**
+ * Checks if a `Cause` contains a defect.
+ *
+ * **Details**
+ *
+ * This function returns `true` if the `Cause` includes any unexpected or
+ * unhandled errors (`Die`). It's useful for differentiating known failures from
+ * unexpected ones.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const isDie = exports.isDie = internal.isDie;
+/**
+ * Checks if a `Cause` contains an interruption.
+ *
+ * **Details**
+ *
+ * This function returns `true` if the `Cause` includes any fiber interruptions.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const isInterrupted = exports.isInterrupted = internal.isInterrupted;
+/**
+ * Checks if a `Cause` contains only interruptions.
+ *
+ * **Details**
+ *
+ * This function returns `true` if the `Cause` has been interrupted but does not
+ * contain any other failures, such as `Fail` or `Die`. It's helpful for
+ * verifying purely "cancellation" scenarios.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const isInterruptedOnly = exports.isInterruptedOnly = internal.isInterruptedOnly;
+/**
+ * Extracts all recoverable errors of type `E` from a `Cause`.
+ *
+ * **Details**
+ *
+ * This function returns a chunk of errors, providing a list of all `Fail`
+ * values found in the cause. It's useful for collecting all known failures for
+ * logging or combined error handling.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const failures = exports.failures = internal.failures;
+/**
+ * Extracts all unrecoverable defects from a `Cause`.
+ *
+ * **Details**
+ *
+ * This function returns a chunk of values representing unexpected errors
+ * (`Die`). It's handy for capturing or logging unanticipated failures that
+ * might need special handling, such as bug reports.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const defects = exports.defects = internal.defects;
+/**
+ * Collects all `FiberId`s responsible for interrupting a fiber.
+ *
+ * **Details**
+ *
+ * This function returns a set of IDs indicating which fibers caused
+ * interruptions within this `Cause`. It's useful for debugging concurrency
+ * issues or tracing cancellations.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const interruptors = exports.interruptors = internal.interruptors;
+/**
+ * Retrieves the first `Fail` error in a `Cause`, if present.
+ *
+ * **Details**
+ *
+ * This function returns an `Option` containing the first recoverable error
+ * (`E`) from the cause. It's often used to quickly check if there's a primary
+ * error to handle or display.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const failureOption = exports.failureOption = internal.failureOption;
+/**
+ * Splits a `Cause` into either its first `Fail` error or the rest of the cause
+ * (which might only contain `Die` or `Interrupt`).
+ *
+ * **Details**
+ *
+ * This function either returns the checked error (`E`) or the remaining
+ * `Cause<never>` with defects/interruptions. It helps you decide if there's a
+ * recoverable path or if only unhandled issues remain.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const failureOrCause = exports.failureOrCause = internal.failureOrCause;
+/**
+ * Strips out failures with an error of `None` from a `Cause<Option<E>>`.
+ *
+ * **Details**
+ *
+ * This function turns a `Cause<Option<E>>` into an `Option<Cause<E>>`. If the
+ * cause only contains failures of `None`, it becomes `None`; otherwise, it
+ * returns a `Cause` of the remaining errors. It's helpful when working with
+ * optional errors and filtering out certain error paths.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const flipCauseOption = exports.flipCauseOption = internal.flipCauseOption;
+/**
+ * Retrieves the first `Die` defect in a `Cause`, if present.
+ *
+ * **Details**
+ *
+ * This function returns an `Option` containing the first unexpected failure
+ * (`Die`) discovered. It's helpful for diagnosing the primary defect in a chain
+ * of errors.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const dieOption = exports.dieOption = internal.dieOption;
+/**
+ * Retrieves the first `Interrupt` in a `Cause`, if present.
+ *
+ * **Details**
+ *
+ * This function returns an `Option` with the first fiber interruption
+ * discovered. This is particularly useful for concurrency analysis or debugging
+ * cancellations.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const interruptOption = exports.interruptOption = internal.interruptOption;
+/**
+ * Removes all `Fail` and `Interrupt` nodes, keeping only defects (`Die`) in a
+ * `Cause`.
+ *
+ * **Details**
+ *
+ * This function strips a cause of recoverable errors and interruptions, leaving
+ * only unexpected failures. If no defects remain, it returns `None`. It's
+ * valuable for focusing only on unanticipated problems when both known errors
+ * and defects could occur.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const keepDefects = exports.keepDefects = internal.keepDefects;
+// TODO(4.0): remove? what's the point of this API?
+/**
+ * Linearizes a `Cause` into a set of parallel causes, each containing a
+ * sequential chain of failures.
+ *
+ * **Details**
+ *
+ * This function reorganizes the cause structure so that you can analyze each
+ * parallel branch separately, even if they have multiple sequential errors.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const linearize = exports.linearize = internal.linearize;
+/**
+ * Removes `Fail` and `Interrupt` nodes from a `Cause`, keeping only defects
+ * (`Die`).
+ *
+ * **Details**
+ *
+ * This function is similar to `keepDefects` but returns a `Cause<never>`
+ * directly, which can still store `Die` or finalizer-related defects. It's
+ * helpful for analyzing only the irrecoverable portion of the error.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const stripFailures = exports.stripFailures = internal.stripFailures;
+/**
+ * Removes matching defects from a `Cause` using a partial function, returning
+ * the remainder.
+ *
+ * **Details**
+ *
+ * This function applies a user-defined extraction function to each defect
+ * (`Die`). If the function matches the defect, that defect is removed. If all
+ * defects match, the result is `None`. Otherwise, you get a `Cause` with the
+ * unmatched defects.
+ *
+ * @since 2.0.0
+ * @category Getters
+ */
+const stripSomeDefects = exports.stripSomeDefects = internal.stripSomeDefects;
+/**
+ * Replaces any errors in a `Cause` with a provided constant error.
+ *
+ * **Details**
+ *
+ * This function transforms all `Fail` errors into the specified error value,
+ * preserving the structure of the `Cause`. It's useful when you no longer need
+ * the original error details but still want to keep the cause shape.
+ *
+ * @see {@link map} Apply a custom transformation to `Fail` errors
+ *
+ * @since 2.0.0
+ * @category Mapping
+ */
+const as = exports.as = internal.as;
+/**
+ * Transforms the errors in a `Cause` using a user-provided function.
+ *
+ * **Details**
+ *
+ * This function applies `f` to each `Fail` error while leaving defects (`Die`)
+ * and interruptions untouched. It's useful for changing or simplifying error
+ * types in your effectful workflows.
+ *
+ * @see {@link as} Replace errors with a single constant
+ *
+ * @since 2.0.0
+ * @category Mapping
+ */
+const map = exports.map = internal.map;
+/**
+ * Transforms errors in a `Cause` into new causes.
+ *
+ * **Details**
+ *
+ * This function applies a function `f` to each `Fail` error, converting it into
+ * a new `Cause`. This is especially powerful for merging or restructuring error
+ * types while preserving or combining cause information.
+ *
+ * @see {@link map} Apply a simpler transformation to errors
+ *
+ * @since 2.0.0
+ * @category Sequencing
+ */
+const flatMap = exports.flatMap = internal.flatMap;
+/**
+ * Sequences two `Cause`s. The second `Cause` can be dependent on the result of
+ * the first `Cause`.
+ *
+ * @since 2.0.0
+ * @category Sequencing
+ */
+const andThen = exports.andThen = internal.andThen;
+/**
+ * Flattens a nested `Cause` structure.
+ *
+ * **Details**
+ *
+ * This function takes a `Cause<Cause<E>>` and merges the layers into a single
+ * `Cause<E>`. It's useful for eliminating additional nesting created by
+ * repeated transformations or compositions.
+ *
+ * @see {@link flatMap} Compose nested causes
+ *
+ * @since 2.0.0
+ * @category Sequencing
+ */
+const flatten = exports.flatten = internal.flatten;
+/**
+ * Checks if the current `Cause` contains or is equal to another `Cause`.
+ *
+ * **Details**
+ *
+ * This function returns `true` if `that` cause is part of or the same as
+ * the current `Cause`. It's useful when you need to check for specific
+ * error patterns or deduplicate repeated failures.
+ *
+ * @since 2.0.0
+ * @category Elements
+ */
+const contains = exports.contains = internal.contains;
+/**
+ * Extracts the most "important" defect from a `Cause`.
+ *
+ * **Details**
+ *
+ * This function reduces a `Cause` to a single, prioritized defect. It evaluates
+ * the `Cause` in the following order of priority:
+ *
+ * 1. If the `Cause` contains a failure (e.g., from `Effect.fail`), it returns
+ *    the raw error value.
+ * 2. If there is no failure, it looks for the first defect (e.g., from
+ *    `Effect.die`).
+ * 3. If neither of the above is present, and the `Cause` stems from an
+ *    interruption, it creates and returns an `InterruptedException`.
+ *
+ * This function ensures you can always extract a meaningful representation of
+ * the primary issue from a potentially complex `Cause` structure.
+ *
+ * **When to Use**
+ *
+ * Use this function when you need to extract the most relevant error or defect
+ * from a `Cause`, especially in scenarios where multiple errors or defects may
+ * be present. It's particularly useful for simplifying error reporting or
+ * logging.
+ *
+ * @see {@link squashWith} Allows transforming failures into defects when squashing.
+ *
+ * @since 2.0.0
+ * @category Destructors
+ */
+const squash = exports.squash = core.causeSquash;
+/**
+ * Extracts the most "important" defect from a `Cause`, transforming failures
+ * into defects using a provided function.
+ *
+ * **Details**
+ *
+ * This function reduces a `Cause` to a single, prioritized defect, while
+ * allowing you to transform recoverable failures into defects through a custom
+ * function. It processes the `Cause` in the following order:
+ *
+ * 1. If the `Cause` contains a failure (e.g., from `Effect.fail`), it applies
+ *    the provided function `f` to the error to transform it into a defect.
+ * 2. If there is no failure, it looks for the first defect (e.g., from
+ *    `Effect.die`) and returns it.
+ * 3. If neither is present and the `Cause` stems from an interruption, it
+ *    returns an `InterruptedException`.
+ *
+ * This function is particularly useful when you need custom handling or
+ * transformation of errors while processing a `Cause`.
+ *
+ * @see {@link squash} Extracts the most "important" defect without transforming failures.
+ *
+ * @since 2.0.0
+ * @category Destructors
+ */
+const squashWith = exports.squashWith = core.causeSquashWith;
+/**
+ * Searches a `Cause` using a partial function to extract information.
+ *
+ * **Details**
+ *
+ * This function allows you to search through a `Cause` using a custom partial
+ * function. The partial function is applied to the `Cause`, and if it matches,
+ * the result is returned wrapped in a `Some`. If no match is found, the result
+ * is `None`.
+ *
+ * This is particularly useful when you are only interested in specific types of
+ * errors, defects, or interruption causes within a potentially complex `Cause`
+ * structure. By leveraging a partial function, you can focus on extracting only
+ * the relevant information you care about.
+ *
+ * The partial function should return an `Option` indicating whether it matched
+ * and the value it extracted.
+ *
+ * @since 2.0.0
+ * @category Elements
+ */
+const find = exports.find = internal.find;
+/**
+ * Preserves parts of a `Cause` that match a given predicate.
+ *
+ * **Details**
+ *
+ * This function allows you to retain only the parts of a `Cause` structure that
+ * match a specified predicate or refinement. Any parts of the `Cause` that do
+ * not match the provided condition are excluded from the result.
+ *
+ * You can use this function in two ways:
+ * - With a `Predicate`: A function that evaluates whether a `Cause` should be
+ *   retained based on its value.
+ * - With a `Refinement`: A more specific predicate that can refine the type of
+ *   the `Cause`.
+ *
+ * This is useful when you need to extract specific types of errors, defects, or
+ * interruptions from a `Cause` while discarding unrelated parts.
+ *
+ * @since 2.0.0
+ * @category Filtering
+ */
+const filter = exports.filter = internal.filter;
+/**
+ * Transforms a `Cause` into a single value using custom handlers for each
+ * possible case.
+ *
+ * **Details**
+ *
+ * This function processes a `Cause` by applying a set of custom handlers to
+ * each possible type of cause: `Empty`, `Fail`, `Die`, `Interrupt`,
+ * `Sequential`, and `Parallel`. The result of this function is a single value
+ * of type `Z`. This function allows you to define exactly how to handle each
+ * part of a `Cause`, whether it's a failure, defect, interruption, or a
+ * combination of these.
+ *
+ * The options parameter provides handlers for:
+ * - `onEmpty`: Handles the case where the cause is `Empty`, meaning no errors
+ *   occurred.
+ * - `onFail`: Processes a failure with an error of type `E`.
+ * - `onDie`: Processes a defect (unexpected error).
+ * - `onInterrupt`: Handles a fiber interruption, providing the `FiberId` of the
+ *   interruption.
+ * - `onSequential`: Combines two sequential causes into a single value of type
+ *   `Z`.
+ * - `onParallel`: Combines two parallel causes into a single value of type `Z`.
+ *
+ * @since 2.0.0
+ * @category Matching
+ */
+const match = exports.match = internal.match;
+/**
+ * Combines all parts of a `Cause` into a single value by starting with an
+ * initial value.
+ *
+ * **Details**
+ *
+ * This function processes a `Cause` by starting with an initial value (`zero`)
+ * and applying a custom function (`pf`) to combine all elements of the `Cause`
+ * into a single result of type `Z`. The custom function determines how each
+ * part of the `Cause` contributes to the final result. The function can return
+ * an `Option` to either continue combining values or skip specific parts of the
+ * `Cause`.
+ *
+ * This function is useful for tasks such as:
+ * - Aggregating error messages from a `Cause` into a single string.
+ * - Summarizing the structure of a `Cause` into a simplified result.
+ * - Filtering or processing only specific parts of a `Cause`.
+ *
+ * The reduction proceeds in a top-down manner, visiting all nodes in the
+ * `Cause` structure. This gives you complete control over how each part of the
+ * `Cause` contributes to the final result.
+ *
+ * @since 2.0.0
+ * @category Reducing
+ */
+const reduce = exports.reduce = internal.reduce;
+/**
+ * Combines all parts of a `Cause` into a single value using a custom reducer
+ * and a context.
+ *
+ * **Details**
+ *
+ * This function allows you to reduce a `Cause` into a single value of type `Z`
+ * using a custom `CauseReducer`. A `CauseReducer` provides methods to handle
+ * specific parts of the `Cause`, such as failures, defects, or interruptions.
+ * Additionally, this function provides access to a `context` value, which can
+ * be used to carry information or maintain state during the reduction process.
+ *
+ * This is particularly useful when the reduction process needs additional
+ * context or configuration, such as:
+ * - Aggregating error details with dynamic formatting.
+ * - Collecting logs or statistics about the `Cause`.
+ * - Performing stateful transformations based on the `context`.
+ *
+ * @see {@link reduce} To reduce a `Cause` without additional context.
+ *
+ * @since 2.0.0
+ * @category Reducing
+ */
+const reduceWithContext = exports.reduceWithContext = internal.reduceWithContext;
+/**
+ * Creates an error that indicates a `Fiber` was interrupted.
+ *
+ * **Details**
+ *
+ * This function constructs an `InterruptedException` recognized by the Effect
+ * runtime. It is usually thrown or returned when a fiber's execution is
+ * interrupted by external events or by another fiber. This is particularly
+ * helpful in concurrent programs where fibers may halt each other before
+ * completion.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const InterruptedException = exports.InterruptedException = core.InterruptedException;
+/**
+ * Checks if a given unknown value is an `InterruptedException`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isInterruptedException = exports.isInterruptedException = core.isInterruptedException;
+/**
+ * Creates an error indicating an invalid method argument.
+ *
+ * **Details**
+ *
+ * This function constructs an `IllegalArgumentException`. It is typically
+ * thrown or returned when an operation receives improper inputs, such as
+ * out-of-range values or invalid object states.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const IllegalArgumentException = exports.IllegalArgumentException = core.IllegalArgumentException;
+/**
+ * Checks if a given unknown value is an `IllegalArgumentException`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isIllegalArgumentException = exports.isIllegalArgumentException = core.isIllegalArgumentException;
+/**
+ * Creates an error indicating a missing element.
+ *
+ * **Details**
+ *
+ * This function constructs a `NoSuchElementException`. It helps you clearly
+ * communicate that a required element is unavailable.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const NoSuchElementException = exports.NoSuchElementException = core.NoSuchElementException;
+/**
+ * Checks if a given unknown value is a `NoSuchElementException`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isNoSuchElementException = exports.isNoSuchElementException = core.isNoSuchElementException;
+/**
+ * Creates an error for general runtime errors.
+ *
+ * **Details**
+ *
+ * This function constructs a `RuntimeException`, for errors that occur at
+ * runtime but are not specifically typed or categorized as interruptions,
+ * missing elements, or invalid arguments. It helps unify a wide range of
+ * unexpected conditions under a single, recognizable error type.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const RuntimeException = exports.RuntimeException = core.RuntimeException;
+/**
+ * Checks if a given unknown value is a `RuntimeException`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isRuntimeException = exports.isRuntimeException = core.isRuntimeException;
+/**
+ * Creates an error for operations that exceed their expected time.
+ *
+ * **Details**
+ *
+ * This function constructs a `TimeoutException`. It is typically used to signal
+ * that an operation or fiber did not complete within a designated time limit,
+ * allowing you to handle slow or hanging processes.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const TimeoutException = exports.TimeoutException = core.TimeoutException;
+/**
+ * Checks if a given unknown value is a `TimeoutException`.
+ *
+ * @since 3.15.0
+ * @category Guards
+ */
+const isTimeoutException = exports.isTimeoutException = core.isTimeoutException;
+/**
+ * Creates an instance of `UnknownException`, an error object used to handle
+ * unknown errors such as those from rejected promises.
+ *
+ * **Details**
+ *
+ * This function constructs an `UnknownException` with flexible behavior for
+ * managing the error message and cause.
+ *
+ * The required `error` argument is passed as the `cause` to the global `Error`
+ * constructor, ensuring that the original cause is preserved in the error chain
+ * for debugging purposes. This ensures that the origin stack trace is
+ * preserved.
+ *
+ * The `error` argument is always stored in the `error` property of the
+ * `UnknownException` instance for reference, regardless of its type.
+ *
+ * Additionally, if you provide a `message` argument, it is used as the error
+ * message. If no `message` is provided, the error message defaults to `"An
+ * unknown error occurred"`.
+ *
+ * **When to Use**
+ *
+ * Use this function when you need to handle unexpected or unknown errors in
+ * your application, particularly when the source of the error might not provide
+ * a clear message. This is useful for wrapping generic errors thrown from
+ * promises or external APIs.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const UnknownException = exports.UnknownException = core.UnknownException;
+/**
+ * Checks if a given unknown value is an `UnknownException`.
+ *
+ * @since 2.0.0
+ * @category Guards
+ */
+const isUnknownException = exports.isUnknownException = core.isUnknownException;
+/**
+ * Creates an error indicating resource capacity has been exceeded.
+ *
+ * **Details**
+ *
+ * This function constructs an `ExceededCapacityException`, signifying that an
+ * operation or resource usage surpassed established limits. This can be
+ * essential for concurrency or resource management situations, ensuring your
+ * application doesn't go beyond acceptable thresholds.
+ *
+ * @since 3.5.0
+ * @category Errors
+ */
+const ExceededCapacityException = exports.ExceededCapacityException = core.ExceededCapacityException;
+/**
+ * Checks if a given unknown value is an `ExceededCapacityException`.
+ *
+ * @since 3.5.0
+ * @category Guards
+ */
+const isExceededCapacityException = exports.isExceededCapacityException = core.isExceededCapacityException;
+/**
+ * Converts a `Cause` into a human-readable string.
+ *
+ * **Details**
+ *
+ * This function pretty-prints the entire `Cause`, including any failures,
+ * defects, and interruptions. It can be especially helpful for logging,
+ * debugging, or displaying structured errors to users.
+ *
+ * You can optionally pass `options` to configure how the error cause is
+ * rendered. By default, it includes essential details of all errors in the
+ * `Cause`.
+ *
+ * @see {@link prettyErrors} Get a list of `PrettyError` objects instead of a single string.
+ *
+ * @since 2.0.0
+ * @category Formatting
+ */
+const pretty = exports.pretty = internal.pretty;
+/**
+ * Returns a list of prettified errors (`PrettyError`) from a `Cause`.
+ *
+ * **Details**
+ *
+ * This function inspects the entire `Cause` and produces an array of
+ * `PrettyError` objects. Each object may include additional metadata, such as a
+ * `Span`, to provide deeper insights into where and how the error occurred.
+ *
+ * @since 3.2.0
+ * @category Formatting
+ */
+const prettyErrors = exports.prettyErrors = internal.prettyErrors;
+/**
+ * Retrieves the original, unproxied error instance from an error object.
+ *
+ * **Details**
+ *
+ * This function returns the underlying error object without any
+ * library-specific wrapping or proxying that might occur during error handling.
+ * This can be essential if you need direct access to the error's native
+ * properties, such as stack traces or custom data fields, for detailed
+ * debugging or integration with external systems.
+ *
+ * @since 2.0.0
+ * @category Errors
+ */
+const originalError = exports.originalError = core.originalInstance;
+//# sourceMappingURL=Cause.js.map

backend/node_modules/effect/dist/cjs/Cause.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Cause.js","names":["internal","_interopRequireWildcard","require","core","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","CauseTypeId","exports","RuntimeExceptionTypeId","InterruptedExceptionTypeId","IllegalArgumentExceptionTypeId","NoSuchElementExceptionTypeId","InvalidPubSubCapacityExceptionTypeId","ExceededCapacityExceptionTypeId","TimeoutExceptionTypeId","UnknownExceptionTypeId","YieldableError","empty","fail","die","interrupt","parallel","sequential","isCause","isEmptyType","isFailType","isDieType","isInterruptType","isSequentialType","isParallelType","size","isEmpty","isFailure","isDie","isInterrupted","isInterruptedOnly","failures","defects","interruptors","failureOption","failureOrCause","flipCauseOption","dieOption","interruptOption","keepDefects","linearize","stripFailures","stripSomeDefects","as","map","flatMap","andThen","flatten","contains","squash","causeSquash","squashWith","causeSquashWith","find","filter","match","reduce","reduceWithContext","InterruptedException","isInterruptedException","IllegalArgumentException","isIllegalArgumentException","NoSuchElementException","isNoSuchElementException","RuntimeException","isRuntimeException","TimeoutException","isTimeoutException","UnknownException","isUnknownException","ExceededCapacityException","isExceededCapacityException","pretty","prettyErrors","originalError","originalInstance"],"sources":["../../src/Cause.ts"],"sourcesContent":[null],"mappings":";;;;;;AA+BA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,IAAA,GAAAF,uBAAA,CAAAC,OAAA;AAA0C,SAAAD,wBAAAG,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAL,uBAAA,YAAAA,CAAAG,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAS1C;;;;;;;;;;;;;;AAcO,MAAMkB,WAAW,GAAAC,OAAA,CAAAD,WAAA,GAAkBvB,QAAQ,CAACuB,WAAW;AAQ9D;;;;;;;;;;;;;;AAcO,MAAME,sBAAsB,GAAAD,OAAA,CAAAC,sBAAA,GAAkBtB,IAAI,CAACsB,sBAAsB;AAQhF;;;;;;;;;;;;;;AAcO,MAAMC,0BAA0B,GAAAF,OAAA,CAAAE,0BAAA,GAAkBvB,IAAI,CAACuB,0BAA0B;AAQxF;;;;;;;;;;;;;;AAcO,MAAMC,8BAA8B,GAAAH,OAAA,CAAAG,8BAAA,GAAkBxB,IAAI,CAACwB,8BAA8B;AAQhG;;;;;;;;;;;;;;AAcO,MAAMC,4BAA4B,GAAAJ,OAAA,CAAAI,4BAAA,GAAkBzB,IAAI,CAACyB,4BAA4B;AAQ5F;;;;;;;;;;;;;;AAcO,MAAMC,oCAAoC,GAAAL,OAAA,CAAAK,oCAAA,GAAkB1B,IAAI,CAAC0B,oCAAoC;AAQ5G;;;;;;;;;;;;;;AAcO,MAAMC,+BAA+B,GAAAN,OAAA,CAAAM,+BAAA,GAAkB3B,IAAI,CAAC2B,+BAA+B;AAQlG;;;;;;;;;;;;;;AAcO,MAAMC,sBAAsB,GAAAP,OAAA,CAAAO,sBAAA,GAAkB5B,IAAI,CAAC4B,sBAAsB;AAQhF;;;;;;;;;;;;;;AAcO,MAAMC,sBAAsB,GAAAR,OAAA,CAAAQ,sBAAA,GAAkB7B,IAAI,CAAC6B,sBAAsB;AAuFhF;;;;;;;AAOO,MAAMC,cAAc,GAAAT,OAAA,CAAAS,cAAA,GAAwD9B,IAAI,CAAC8B,cAAc;AA4OtG;;;;;;;;;;;;;AAaO,MAAMC,KAAK,GAAAV,OAAA,CAAAU,KAAA,GAAiBlC,QAAQ,CAACkC,KAAK;AAEjD;;;;;;;;;;;;;;AAcO,MAAMC,IAAI,GAAAX,OAAA,CAAAW,IAAA,GAA8BnC,QAAQ,CAACmC,IAAI;AAE5D;;;;;;;;;;;;;;AAcO,MAAMC,GAAG,GAAAZ,OAAA,CAAAY,GAAA,GAAsCpC,QAAQ,CAACoC,GAAG;AAElE;;;;;;;;;;;;;;AAcO,MAAMC,SAAS,GAAAb,OAAA,CAAAa,SAAA,GAA+CrC,QAAQ,CAACqC,SAAS;AAEvF;;;;;;;;;;;;;;AAcO,MAAMC,QAAQ,GAAAd,OAAA,CAAAc,QAAA,GAA+DtC,QAAQ,CAACsC,QAAQ;AAErG;;;;;;;;;;;;;;AAcO,MAAMC,UAAU,GAAAf,OAAA,CAAAe,UAAA,GAA+DvC,QAAQ,CAACuC,UAAU;AAEzG;;;;;;AAMO,MAAMC,OAAO,GAAAhB,OAAA,CAAAgB,OAAA,GAAwCxC,QAAQ,CAACwC,OAAO;AAE5E;;;;;;;;AAQO,MAAMC,WAAW,GAAAjB,OAAA,CAAAiB,WAAA,GAAyCzC,QAAQ,CAACyC,WAAW;AAErF;;;;;;;;AAQO,MAAMC,UAAU,GAAAlB,OAAA,CAAAkB,UAAA,GAA2C1C,QAAQ,CAAC0C,UAAU;AAErF;;;;;;;;AAQO,MAAMC,SAAS,GAAAnB,OAAA,CAAAmB,SAAA,GAAuC3C,QAAQ,CAAC2C,SAAS;AAE/E;;;;;;;;AAQO,MAAMC,eAAe,GAAApB,OAAA,CAAAoB,eAAA,GAA6C5C,QAAQ,CAAC4C,eAAe;AAEjG;;;;;;;;AAQO,MAAMC,gBAAgB,GAAArB,OAAA,CAAAqB,gBAAA,GAAiD7C,QAAQ,CAAC6C,gBAAgB;AAEvG;;;;;;;;AAQO,MAAMC,cAAc,GAAAtB,OAAA,CAAAsB,cAAA,GAA+C9C,QAAQ,CAAC8C,cAAc;AAEjG;;;;;;;;;;;AAWO,MAAMC,IAAI,GAAAvB,OAAA,CAAAuB,IAAA,GAAkC/C,QAAQ,CAAC+C,IAAI;AAEhE;;;;;;;;;;;;AAYO,MAAMC,OAAO,GAAAxB,OAAA,CAAAwB,OAAA,GAAmChD,QAAQ,CAACgD,OAAO;AAEvE;;;;;;;;;;;;AAYO,MAAMC,SAAS,GAAAzB,OAAA,CAAAyB,SAAA,GAAmCjD,QAAQ,CAACiD,SAAS;AAE3E;;;;;;;;;;;;AAYO,MAAMC,KAAK,GAAA1B,OAAA,CAAA0B,KAAA,GAAmClD,QAAQ,CAACkD,KAAK;AAEnE;;;;;;;;;;AAUO,MAAMC,aAAa,GAAA3B,OAAA,CAAA2B,aAAA,GAAmCnD,QAAQ,CAACmD,aAAa;AAEnF;;;;;;;;;;;;AAYO,MAAMC,iBAAiB,GAAA5B,OAAA,CAAA4B,iBAAA,GAAmCpD,QAAQ,CAACoD,iBAAiB;AAE3F;;;;;;;;;;;;AAYO,MAAMC,QAAQ,GAAA7B,OAAA,CAAA6B,QAAA,GAA0CrD,QAAQ,CAACqD,QAAQ;AAEhF;;;;;;;;;;;;AAYO,MAAMC,OAAO,GAAA9B,OAAA,CAAA8B,OAAA,GAAgDtD,QAAQ,CAACsD,OAAO;AAEpF;;;;;;;;;;;;AAYO,MAAMC,YAAY,GAAA/B,OAAA,CAAA+B,YAAA,GAA4DvD,QAAQ,CAACuD,YAAY;AAE1G;;;;;;;;;;;;AAYO,MAAMC,aAAa,GAAAhC,OAAA,CAAAgC,aAAA,GAA4CxD,QAAQ,CAACwD,aAAa;AAE5F;;;;;;;;;;;;;AAaO,MAAMC,cAAc,GAAAjC,OAAA,CAAAiC,cAAA,GAA0DzD,QAAQ,CAACyD,cAAc;AAE5G;;;;;;;;;;;;;AAaO,MAAMC,eAAe,GAAAlC,OAAA,CAAAkC,eAAA,GAAkE1D,QAAQ,CAAC0D,eAAe;AAEtH;;;;;;;;;;;;AAYO,MAAMC,SAAS,GAAAnC,OAAA,CAAAmC,SAAA,GAAkD3D,QAAQ,CAAC2D,SAAS;AAE1F;;;;;;;;;;;;AAYO,MAAMC,eAAe,GAAApC,OAAA,CAAAoC,eAAA,GAA0D5D,QAAQ,CAAC4D,eAAe;AAE9G;;;;;;;;;;;;;;AAcO,MAAMC,WAAW,GAAArC,OAAA,CAAAqC,WAAA,GAAuD7D,QAAQ,CAAC6D,WAAW;AAEnG;AACA;;;;;;;;;;;;AAYO,MAAMC,SAAS,GAAAtC,OAAA,CAAAsC,SAAA,GAAqD9D,QAAQ,CAAC8D,SAAS;AAE7F;;;;;;;;;;;;;AAaO,MAAMC,aAAa,GAAAvC,OAAA,CAAAuC,aAAA,GAAwC/D,QAAQ,CAAC+D,aAAa;AAExF;;;;;;;;;;;;;;AAcO,MAAMC,gBAAgB,GAAAxC,OAAA,CAAAwC,gBAAA,GA+BzBhE,QAAQ,CAACgE,gBAAgB;AAE7B;;;;;;;;;;;;;;AAcO,MAAMC,EAAE,GAAAzC,OAAA,CAAAyC,EAAA,GA+BXjE,QAAQ,CAACiE,EAAE;AAEf;;;;;;;;;;;;;;AAcO,MAAMC,GAAG,GAAA1C,OAAA,CAAA0C,GAAA,GA+BZlE,QAAQ,CAACkE,GAAG;AAEhB;;;;;;;;;;;;;;AAcO,MAAMC,OAAO,GAAA3C,OAAA,CAAA2C,OAAA,GA+BhBnE,QAAQ,CAACmE,OAAO;AAEpB;;;;;;;AAOO,MAAMC,OAAO,GAAA5C,OAAA,CAAA4C,OAAA,GAiChBpE,QAAQ,CAACoE,OAAO;AAEpB;;;;;;;;;;;;;;AAcO,MAAMC,OAAO,GAAA7C,OAAA,CAAA6C,OAAA,GAA2CrE,QAAQ,CAACqE,OAAO;AAE/E;;;;;;;;;;;;AAYO,MAAMC,QAAQ,GAAA9C,OAAA,CAAA8C,QAAA,GA2BjBtE,QAAQ,CAACsE,QAAQ;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,MAAM,GAAA/C,OAAA,CAAA+C,MAAA,GAAmCpE,IAAI,CAACqE,WAAW;AAEtE;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,UAAU,GAAAjD,OAAA,CAAAiD,UAAA,GAqDnBtE,IAAI,CAACuE,eAAe;AAExB;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMC,IAAI,GAAAnD,OAAA,CAAAmD,IAAA,GA6Cb3E,QAAQ,CAAC2E,IAAI;AAEjB;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMC,MAAM,GAAApD,OAAA,CAAAoD,MAAA,GAyFf5E,QAAQ,CAAC4E,MAAM;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAMC,KAAK,GAAArD,OAAA,CAAAqD,KAAA,GA4Ed7E,QAAQ,CAAC6E,KAAK;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,MAAM,GAAAtD,OAAA,CAAAsD,MAAA,GAyDf9E,QAAQ,CAAC8E,MAAM;AAEnB;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMC,iBAAiB,GAAAvD,OAAA,CAAAuD,iBAAA,GAiD1B/E,QAAQ,CAAC+E,iBAAiB;AAE9B;;;;;;;;;;;;;;AAcO,MAAMC,oBAAoB,GAAAxD,OAAA,CAAAwD,oBAAA,GAA8D7E,IAAI,CAAC6E,oBAAoB;AAExH;;;;;;AAMO,MAAMC,sBAAsB,GAAAzD,OAAA,CAAAyD,sBAAA,GAA8C9E,IAAI,CAAC8E,sBAAsB;AAE5G;;;;;;;;;;;;AAYO,MAAMC,wBAAwB,GAAA1D,OAAA,CAAA0D,wBAAA,GACnC/E,IAAI,CAAC+E,wBAAwB;AAE/B;;;;;;AAMO,MAAMC,0BAA0B,GAAA3D,OAAA,CAAA2D,0BAAA,GAAkDhF,IAAI,CAACgF,0BAA0B;AAExH;;;;;;;;;;;AAWO,MAAMC,sBAAsB,GAAA5D,OAAA,CAAA4D,sBAAA,GACjCjF,IAAI,CAACiF,sBAAsB;AAE7B;;;;;;AAMO,MAAMC,wBAAwB,GAAA7D,OAAA,CAAA6D,wBAAA,GAAgDlF,IAAI,CAACkF,wBAAwB;AAElH;;;;;;;;;;;;;AAaO,MAAMC,gBAAgB,GAAA9D,OAAA,CAAA8D,gBAAA,GAA0DnF,IAAI,CAACmF,gBAAgB;AAE5G;;;;;;AAMO,MAAMC,kBAAkB,GAAA/D,OAAA,CAAA+D,kBAAA,GAA0CpF,IAAI,CAACoF,kBAAkB;AAEhG;;;;;;;;;;;;AAYO,MAAMC,gBAAgB,GAAAhE,OAAA,CAAAgE,gBAAA,GAA0DrF,IAAI,CAACqF,gBAAgB;AAE5G;;;;;;AAMO,MAAMC,kBAAkB,GAAAjE,OAAA,CAAAiE,kBAAA,GAA0CtF,IAAI,CAACsF,kBAAkB;AAEhG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BO,MAAMC,gBAAgB,GAAAlE,OAAA,CAAAkE,gBAAA,GAC3BvF,IAAI,CAACuF,gBAAgB;AAEvB;;;;;;AAMO,MAAMC,kBAAkB,GAAAnE,OAAA,CAAAmE,kBAAA,GAA0CxF,IAAI,CAACwF,kBAAkB;AAEhG;;;;;;;;;;;;;AAaO,MAAMC,yBAAyB,GAAApE,OAAA,CAAAoE,yBAAA,GACpCzF,IAAI,CAACyF,yBAAyB;AAEhC;;;;;;AAMO,MAAMC,2BAA2B,GAAArE,OAAA,CAAAqE,2BAAA,GACtC1F,IAAI,CAAC0F,2BAA2B;AAElC;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,MAAM,GAAAtE,OAAA,CAAAsE,MAAA,GAEJ9F,QAAQ,CAAC8F,MAAM;AAY9B;;;;;;;;;;;;AAYO,MAAMC,YAAY,GAAAvE,OAAA,CAAAuE,YAAA,GAA+C/F,QAAQ,CAAC+F,YAAY;AAE7F;;;;;;;;;;;;;;AAcO,MAAMC,aAAa,GAAAxE,OAAA,CAAAwE,aAAA,GAAqB7F,IAAI,CAAC8F,gBAAgB","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Channel.js

@@ -0,0 +1,889 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toSink = exports.toQueue = exports.toPullIn = exports.toPull = exports.toPubSub = exports.sync = exports.suspend = exports.succeed = exports.splitLines = exports.scopedWith = exports.scoped = exports.runScoped = exports.runDrain = exports.runCollect = exports.run = exports.repeated = exports.readWithCause = exports.readWith = exports.readOrFail = exports.read = exports.provideSomeLayer = exports.provideService = exports.provideLayer = exports.provideContext = exports.pipeToOrFail = exports.pipeTo = exports.orElse = exports.orDieWith = exports.orDie = exports.never = exports.mergeWith = exports.mergeOutWith = exports.mergeOut = exports.mergeMap = exports.mergeAllWith = exports.mergeAllUnboundedWith = exports.mergeAllUnbounded = exports.mergeAll = exports.mapOutEffectPar = exports.mapOutEffect = exports.mapOut = exports.mapInputInEffect = exports.mapInputIn = exports.mapInputErrorEffect = exports.mapInputError = exports.mapInputEffect = exports.mapInputContext = exports.mapInput = exports.mapErrorCause = exports.mapError = exports.mapEffect = exports.map = exports.isChannelException = exports.isChannel = exports.interruptWhenDeferred = exports.interruptWhen = exports.identity = exports.fromQueue = exports.fromPubSubScoped = exports.fromPubSub = exports.fromOption = exports.fromInput = exports.fromEither = exports.fromEffect = exports.foldChannel = exports.foldCauseChannel = exports.flatten = exports.flatMap = exports.failSync = exports.failCauseSync = exports.failCause = exports.fail = exports.ensuringWith = exports.ensuring = exports.emitCollect = exports.embedInput = exports.drain = exports.doneCollect = exports.contextWithEffect = exports.contextWithChannel = exports.contextWith = exports.context = exports.concatOut = exports.concatMapWithCustom = exports.concatMapWith = exports.concatMap = exports.concatAllWith = exports.concatAll = exports.collect = exports.catchAllCause = exports.catchAll = exports.bufferChunk = exports.buffer = exports.asVoid = exports.as = exports.acquireUseRelease = exports.acquireReleaseOut = exports.ChannelTypeId = exports.ChannelExceptionTypeId = exports.ChannelException = void 0;
+exports.zipRight = exports.zipLeft = exports.zip = exports.writeChunk = exports.writeAll = exports.write = exports.withSpan = exports.void = exports.updateService = exports.unwrapScopedWith = exports.unwrapScoped = exports.unwrap = exports.toStream = void 0;
+var channel = _interopRequireWildcard(require("./internal/channel.js"));
+var core = _interopRequireWildcard(require("./internal/core-stream.js"));
+var sink = _interopRequireWildcard(require("./internal/sink.js"));
+var stream = _interopRequireWildcard(require("./internal/stream.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ChannelTypeId = exports.ChannelTypeId = core.ChannelTypeId;
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ChannelExceptionTypeId = exports.ChannelExceptionTypeId = channel.ChannelExceptionTypeId;
+/**
+ * @since 3.5.4
+ * @category refinements
+ */
+const isChannel = exports.isChannel = core.isChannel;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const acquireUseRelease = exports.acquireUseRelease = channel.acquireUseRelease;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const acquireReleaseOut = exports.acquireReleaseOut = core.acquireReleaseOut;
+/**
+ * Returns a new channel that is the same as this one, except the terminal
+ * value of the channel is the specified constant value.
+ *
+ * This method produces the same result as mapping this channel to the
+ * specified constant value.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const as = exports.as = channel.as;
+/**
+ * @since 2.0.0
+ * @category mapping
+ */
+const asVoid = exports.asVoid = channel.asVoid;
+/**
+ * Creates a channel backed by a buffer. When the buffer is empty, the channel
+ * will simply passthrough its input as output. However, when the buffer is
+ * non-empty, the value inside the buffer will be passed along as output.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const buffer = exports.buffer = channel.buffer;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const bufferChunk = exports.bufferChunk = channel.bufferChunk;
+/**
+ * Returns a new channel that is the same as this one, except if this channel
+ * errors for any typed error, then the returned channel will switch over to
+ * using the fallback channel returned by the specified error handler.
+ *
+ * @since 2.0.0
+ * @category error handling
+ */
+const catchAll = exports.catchAll = channel.catchAll;
+/**
+ * Returns a new channel that is the same as this one, except if this channel
+ * errors for any typed error, then the returned channel will switch over to
+ * using the fallback channel returned by the specified error handler.
+ *
+ * @since 2.0.0
+ * @category error handling
+ */
+const catchAllCause = exports.catchAllCause = core.catchAllCause;
+/**
+ * Concat sequentially a channel of channels.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const concatAll = exports.concatAll = core.concatAll;
+/**
+ * Concat sequentially a channel of channels.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const concatAllWith = exports.concatAllWith = core.concatAllWith;
+/**
+ * Returns a new channel whose outputs are fed to the specified factory
+ * function, which creates new channels in response. These new channels are
+ * sequentially concatenated together, and all their outputs appear as outputs
+ * of the newly returned channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const concatMap = exports.concatMap = channel.concatMap;
+/**
+ * Returns a new channel whose outputs are fed to the specified factory
+ * function, which creates new channels in response. These new channels are
+ * sequentially concatenated together, and all their outputs appear as outputs
+ * of the newly returned channel. The provided merging function is used to
+ * merge the terminal values of all channels into the single terminal value of
+ * the returned channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const concatMapWith = exports.concatMapWith = core.concatMapWith;
+/**
+ * Returns a new channel whose outputs are fed to the specified factory
+ * function, which creates new channels in response. These new channels are
+ * sequentially concatenated together, and all their outputs appear as outputs
+ * of the newly returned channel. The provided merging function is used to
+ * merge the terminal values of all channels into the single terminal value of
+ * the returned channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const concatMapWithCustom = exports.concatMapWithCustom = core.concatMapWithCustom;
+/**
+ * Returns a new channel, which is the same as this one, except its outputs
+ * are filtered and transformed by the specified partial function.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const collect = exports.collect = channel.collect;
+/**
+ * Returns a new channel, which is the concatenation of all the channels that
+ * are written out by this channel. This method may only be called on channels
+ * that output other channels.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const concatOut = exports.concatOut = channel.concatOut;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * function to the input channel's done value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInput = exports.mapInput = channel.mapInput;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * effectual function to the input channel's done value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInputEffect = exports.mapInputEffect = channel.mapInputEffect;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * function to the input channel's error value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInputError = exports.mapInputError = channel.mapInputError;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * effectual function to the input channel's error value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInputErrorEffect = exports.mapInputErrorEffect = channel.mapInputErrorEffect;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * function to the input channel's output elements.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInputIn = exports.mapInputIn = channel.mapInputIn;
+/**
+ * Returns a new channel which is the same as this one but applies the given
+ * effectual function to the input channel's output elements.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapInputInEffect = exports.mapInputInEffect = channel.mapInputInEffect;
+/**
+ * Returns a new channel, which is the same as this one, except that all the
+ * outputs are collected and bundled into a tuple together with the terminal
+ * value of this channel.
+ *
+ * As the channel returned from this channel collects all of this channel's
+ * output into an in- memory chunk, it is not safe to call this method on
+ * channels that output a large or unbounded number of values.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const doneCollect = exports.doneCollect = channel.doneCollect;
+/**
+ * Returns a new channel which reads all the elements from upstream's output
+ * channel and ignores them, then terminates with the upstream result value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const drain = exports.drain = channel.drain;
+/**
+ * Returns a new channel which connects the given `AsyncInputProducer` as
+ * this channel's input.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const embedInput = exports.embedInput = core.embedInput;
+/**
+ * Returns a new channel that collects the output and terminal value of this
+ * channel, which it then writes as output of the returned channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const emitCollect = exports.emitCollect = channel.emitCollect;
+/**
+ * Returns a new channel with an attached finalizer. The finalizer is
+ * guaranteed to be executed so long as the channel begins execution (and
+ * regardless of whether or not it completes).
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const ensuring = exports.ensuring = channel.ensuring;
+/**
+ * Returns a new channel with an attached finalizer. The finalizer is
+ * guaranteed to be executed so long as the channel begins execution (and
+ * regardless of whether or not it completes).
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const ensuringWith = exports.ensuringWith = core.ensuringWith;
+/**
+ * Accesses the whole context of the channel.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const context = exports.context = channel.context;
+/**
+ * Accesses the context of the channel with the specified function.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const contextWith = exports.contextWith = channel.contextWith;
+/**
+ * Accesses the context of the channel in the context of a channel.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const contextWithChannel = exports.contextWithChannel = channel.contextWithChannel;
+/**
+ * Accesses the context of the channel in the context of an effect.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const contextWithEffect = exports.contextWithEffect = channel.contextWithEffect;
+/**
+ * Constructs a channel that fails immediately with the specified error.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fail = exports.fail = core.fail;
+/**
+ * Constructs a channel that succeeds immediately with the specified lazily
+ * evaluated value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const failSync = exports.failSync = core.failSync;
+/**
+ * Constructs a channel that fails immediately with the specified `Cause`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const failCause = exports.failCause = core.failCause;
+/**
+ * Constructs a channel that succeeds immediately with the specified lazily
+ * evaluated `Cause`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const failCauseSync = exports.failCauseSync = core.failCauseSync;
+/**
+ * Returns a new channel, which sequentially combines this channel, together
+ * with the provided factory function, which creates a second channel based on
+ * the terminal value of this channel. The result is a channel that will first
+ * perform the functions of this channel, before performing the functions of
+ * the created channel (including yielding its terminal value).
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = exports.flatMap = core.flatMap;
+/**
+ * Returns a new channel, which flattens the terminal value of this channel.
+ * This function may only be called if the terminal value of this channel is
+ * another channel of compatible types.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatten = exports.flatten = channel.flatten;
+/**
+ * Folds over the result of this channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const foldChannel = exports.foldChannel = channel.foldChannel;
+/**
+ * Folds over the result of this channel including any cause of termination.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const foldCauseChannel = exports.foldCauseChannel = core.foldCauseChannel;
+/**
+ * Use an effect to end a channel.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromEffect = exports.fromEffect = core.fromEffect;
+/**
+ * Constructs a channel from an `Either`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromEither = exports.fromEither = channel.fromEither;
+/**
+ * Construct a `Channel` from an `AsyncInputConsumer`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromInput = exports.fromInput = channel.fromInput;
+/**
+ * Construct a `Channel` from a `PubSub`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromPubSub = exports.fromPubSub = channel.fromPubSub;
+/**
+ * Construct a `Channel` from a `PubSub` within a scoped effect.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromPubSubScoped = exports.fromPubSubScoped = channel.fromPubSubScoped;
+/**
+ * Construct a `Channel` from an `Option`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromOption = exports.fromOption = channel.fromOption;
+/**
+ * Construct a `Channel` from a `Queue`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromQueue = exports.fromQueue = channel.fromQueue;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const identity = exports.identity = channel.identityChannel;
+/**
+ * Returns a new channel, which is the same as this one, except it will be
+ * interrupted when the specified effect completes. If the effect completes
+ * successfully before the underlying channel is done, then the returned
+ * channel will yield the success value of the effect as its terminal value.
+ * On the other hand, if the underlying channel finishes first, then the
+ * returned channel will yield the success value of the underlying channel as
+ * its terminal value.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const interruptWhen = exports.interruptWhen = channel.interruptWhen;
+/**
+ * Returns a new channel, which is the same as this one, except it will be
+ * interrupted when the specified deferred is completed. If the deferred is
+ * completed before the underlying channel is done, then the returned channel
+ * will yield the value of the deferred. Otherwise, if the underlying channel
+ * finishes first, then the returned channel will yield the value of the
+ * underlying channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const interruptWhenDeferred = exports.interruptWhenDeferred = channel.interruptWhenDeferred;
+/**
+ * Returns a new channel, which is the same as this one, except the terminal
+ * value of the returned channel is created by applying the specified function
+ * to the terminal value of this channel.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = exports.map = channel.map;
+/**
+ * Returns a new channel, which is the same as this one, except the terminal
+ * value of the returned channel is created by applying the specified
+ * effectful function to the terminal value of this channel.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapEffect = exports.mapEffect = channel.mapEffect;
+/**
+ * Returns a new channel, which is the same as this one, except the failure
+ * value of the returned channel is created by applying the specified function
+ * to the failure value of this channel.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapError = exports.mapError = channel.mapError;
+/**
+ * A more powerful version of `mapError` which also surfaces the `Cause`
+ * of the channel failure.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapErrorCause = exports.mapErrorCause = channel.mapErrorCause;
+/**
+ * Maps the output of this channel using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapOut = exports.mapOut = channel.mapOut;
+/**
+ * Creates a channel that is like this channel but the given effectful function
+ * gets applied to each emitted output element.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapOutEffect = exports.mapOutEffect = channel.mapOutEffect;
+/**
+ * Creates a channel that is like this channel but the given Effect function gets
+ * applied to each emitted output element, taking `n` elements at once and
+ * mapping them in parallel.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mapOutEffectPar = exports.mapOutEffectPar = channel.mapOutEffectPar;
+/**
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeAll = exports.mergeAll = channel.mergeAll;
+/**
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeAllUnbounded = exports.mergeAllUnbounded = channel.mergeAllUnbounded;
+/**
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeAllUnboundedWith = exports.mergeAllUnboundedWith = channel.mergeAllUnboundedWith;
+/**
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeAllWith = exports.mergeAllWith = channel.mergeAllWith;
+/**
+ * Returns a new channel which creates a new channel for each emitted element
+ * and merges some of them together. Different merge strategies control what
+ * happens if there are more than the given maximum number of channels gets
+ * created. See `Channel.mergeAll`.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const mergeMap = exports.mergeMap = channel.mergeMap;
+/**
+ * Returns a new channel which merges a number of channels emitted by this
+ * channel using the back pressuring merge strategy. See `Channel.mergeAll`.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeOut = exports.mergeOut = channel.mergeOut;
+/**
+ * Returns a new channel which merges a number of channels emitted by this
+ * channel using the back pressuring merge strategy and uses a given function
+ * to merge each completed subchannel's result value. See
+ * `Channel.mergeAll`.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeOutWith = exports.mergeOutWith = channel.mergeOutWith;
+/**
+ * Returns a new channel, which is the merge of this channel and the specified
+ * channel, where the behavior of the returned channel on left or right early
+ * termination is decided by the specified `leftDone` and `rightDone` merge
+ * decisions.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mergeWith = exports.mergeWith = channel.mergeWith;
+/**
+ * Returns a channel that never completes
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const never = exports.never = channel.never;
+/**
+ * Translates channel failure into death of the fiber, making all failures
+ * unchecked and not a part of the type of the channel.
+ *
+ * @since 2.0.0
+ * @category error handling
+ */
+const orDie = exports.orDie = channel.orDie;
+/**
+ * Keeps none of the errors, and terminates the fiber with them, using the
+ * specified function to convert the `OutErr` into a defect.
+ *
+ * @since 2.0.0
+ * @category error handling
+ */
+const orDieWith = exports.orDieWith = channel.orDieWith;
+/**
+ * Returns a new channel that will perform the operations of this one, until
+ * failure, and then it will switch over to the operations of the specified
+ * fallback channel.
+ *
+ * @since 2.0.0
+ * @category error handling
+ */
+const orElse = exports.orElse = channel.orElse;
+/**
+ * Returns a new channel that pipes the output of this channel into the
+ * specified channel. The returned channel has the input type of this channel,
+ * and the output type of the specified channel, terminating with the value of
+ * the specified channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const pipeTo = exports.pipeTo = core.pipeTo;
+/**
+ * Returns a new channel that pipes the output of this channel into the
+ * specified channel and preserves this channel's failures without providing
+ * them to the other channel for observation.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const pipeToOrFail = exports.pipeToOrFail = channel.pipeToOrFail;
+/**
+ * Provides the channel with its required context, which eliminates its
+ * dependency on `Env`.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const provideContext = exports.provideContext = core.provideContext;
+/**
+ * Provides a layer to the channel, which translates it to another level.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const provideLayer = exports.provideLayer = channel.provideLayer;
+/**
+ * Transforms the context being provided to the channel with the specified
+ * function.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const mapInputContext = exports.mapInputContext = channel.mapInputContext;
+/**
+ * Splits the context into two parts, providing one part using the
+ * specified layer and leaving the remainder `Env0`.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const provideSomeLayer = exports.provideSomeLayer = channel.provideSomeLayer;
+/**
+ * Provides the effect with the single service it requires. If the effect
+ * requires more than one service use `provideContext` instead.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const provideService = exports.provideService = channel.provideService;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const read = exports.read = channel.read;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const readOrFail = exports.readOrFail = core.readOrFail;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const readWith = exports.readWith = core.readWith;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const readWithCause = exports.readWithCause = core.readWithCause;
+/**
+ * Creates a channel which repeatedly runs this channel.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const repeated = exports.repeated = channel.repeated;
+/**
+ * Runs a channel until the end is received.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const run = exports.run = channel.run;
+/**
+ * Run the channel until it finishes with a done value or fails with an error
+ * and collects its emitted output elements.
+ *
+ * The channel must not read any input.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const runCollect = exports.runCollect = channel.runCollect;
+/**
+ * Runs a channel until the end is received.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const runDrain = exports.runDrain = channel.runDrain;
+/**
+ * Run the channel until it finishes with a done value or fails with an error.
+ * The channel must not read any input or write any output.
+ *
+ * Closing the channel, which includes execution of all the finalizers
+ * attached to the channel will be added to the current scope as a finalizer.
+ *
+ * @since 3.11.0
+ * @category destructors
+ */
+const runScoped = exports.runScoped = channel.runScoped;
+/**
+ * Use a scoped effect to emit an output element.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const scoped = exports.scoped = channel.scoped;
+/**
+ * Use a function that receives a scope and returns an effect to emit an output
+ * element. The output element will be the result of the returned effect, if
+ * successful.
+ *
+ * @since 3.11.0
+ * @category constructors
+ */
+const scopedWith = exports.scopedWith = channel.scopedWith;
+/**
+ * Splits strings on newlines. Handles both Windows newlines (`\r\n`) and UNIX
+ * newlines (`\n`).
+ *
+ * @since 2.0.0
+ * @category combinators
+ */
+const splitLines = exports.splitLines = channel.splitLines;
+/**
+ * Constructs a channel that succeeds immediately with the specified value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const succeed = exports.succeed = core.succeed;
+/**
+ * Lazily constructs a channel from the given side effect.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const suspend = exports.suspend = core.suspend;
+/**
+ * Constructs a channel that succeeds immediately with the specified lazy value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const sync = exports.sync = core.sync;
+/**
+ * Converts a `Channel` to a `PubSub`.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const toPubSub = exports.toPubSub = channel.toPubSub;
+/**
+ * Returns a scoped `Effect` that can be used to repeatedly pull elements from
+ * the constructed `Channel`. The pull effect fails with the channel's failure
+ * in case the channel fails, or returns either the channel's done value or an
+ * emitted element.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const toPull = exports.toPull = channel.toPull;
+/**
+ * Returns an `Effect` that can be used to repeatedly pull elements from the
+ * constructed `Channel` within the provided `Scope`. The pull effect fails
+ * with the channel's failure in case the channel fails, or returns either the
+ * channel's done value or an emitted element.
+ *
+ * @since 3.11.0
+ * @category destructors
+ */
+const toPullIn = exports.toPullIn = channel.toPullIn;
+/**
+ * Converts a `Channel` to a `Queue`.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const toQueue = exports.toQueue = channel.toQueue;
+/** Converts this channel to a `Sink`.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const toSink = exports.toSink = sink.channelToSink;
+/**
+ * Converts this channel to a `Stream`.
+ *
+ * @since 2.0.0
+ * @category destructors
+ */
+const toStream = exports.toStream = stream.channelToStream;
+const void_ = exports.void = core.void;
+/**
+ * Constructs a `Channel` from an effect that will result in a `Channel` if
+ * successful.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const unwrap = exports.unwrap = channel.unwrap;
+/**
+ * Constructs a `Channel` from a scoped effect that will result in a
+ * `Channel` if successful.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const unwrapScoped = exports.unwrapScoped = channel.unwrapScoped;
+/**
+ * Constructs a `Channel` from a function which receives a `Scope` and returns
+ * an effect that will result in a `Channel` if successful.
+ *
+ * @since 3.11.0
+ * @category constructors
+ */
+const unwrapScopedWith = exports.unwrapScopedWith = channel.unwrapScopedWith;
+/**
+ * Updates a service in the context of this channel.
+ *
+ * @since 2.0.0
+ * @category context
+ */
+const updateService = exports.updateService = channel.updateService;
+/**
+ * Wraps the channel with a new span for tracing.
+ *
+ * @since 2.0.0
+ * @category tracing
+ */
+const withSpan = exports.withSpan = channel.withSpan;
+/**
+ * Writes a single value to the channel.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const write = exports.write = core.write;
+/**
+ * Writes a sequence of values to the channel.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const writeAll = exports.writeAll = channel.writeAll;
+/**
+ * Writes a `Chunk` of values to the channel.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const writeChunk = exports.writeChunk = channel.writeChunk;
+/**
+ * Returns a new channel that is the sequential composition of this channel
+ * and the specified channel. The returned channel terminates with a tuple of
+ * the terminal values of both channels.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zip = exports.zip = channel.zip;
+/**
+ * Returns a new channel that is the sequential composition of this channel
+ * and the specified channel. The returned channel terminates with the
+ * terminal value of this channel.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zipLeft = exports.zipLeft = channel.zipLeft;
+/**
+ * Returns a new channel that is the sequential composition of this channel
+ * and the specified channel. The returned channel terminates with the
+ * terminal value of that channel.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zipRight = exports.zipRight = channel.zipRight;
+/**
+ * Represents a generic checked exception which occurs when a `Channel` is
+ * executed.
+ *
+ * @since 2.0.0
+ * @category errors
+ */
+const ChannelException = exports.ChannelException = channel.ChannelException;
+/**
+ * Returns `true` if the specified value is an `ChannelException`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isChannelException = exports.isChannelException = channel.isChannelException;
+//# sourceMappingURL=Channel.js.map

backend/node_modules/effect/dist/cjs/ChildExecutorDecision.js

@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.match = exports.isYield = exports.isContinue = exports.isClose = exports.isChildExecutorDecision = exports.Yield = exports.Continue = exports.Close = exports.ChildExecutorDecisionTypeId = void 0;
+var internal = _interopRequireWildcard(require("./internal/channel/childExecutorDecision.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ChildExecutorDecisionTypeId = exports.ChildExecutorDecisionTypeId = internal.ChildExecutorDecisionTypeId;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const Continue = exports.Continue = internal.Continue;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const Close = exports.Close = internal.Close;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const Yield = exports.Yield = internal.Yield;
+/**
+ * Returns `true` if the specified value is a `ChildExecutorDecision`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isChildExecutorDecision = exports.isChildExecutorDecision = internal.isChildExecutorDecision;
+/**
+ * Returns `true` if the specified `ChildExecutorDecision` is a `Continue`,
+ * `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isContinue = exports.isContinue = internal.isContinue;
+/**
+ * Returns `true` if the specified `ChildExecutorDecision` is a `Close`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isClose = exports.isClose = internal.isClose;
+/**
+ * Returns `true` if the specified `ChildExecutorDecision` is a `Yield`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isYield = exports.isYield = internal.isYield;
+/**
+ * Folds over a `ChildExecutorDecision` to produce a value of type `A`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const match = exports.match = internal.match;
+//# sourceMappingURL=ChildExecutorDecision.js.map

backend/node_modules/effect/dist/cjs/ChildExecutorDecision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChildExecutorDecision.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","ChildExecutorDecisionTypeId","exports","Continue","Close","Yield","isChildExecutorDecision","isContinue","isClose","isYield","match"],"sources":["../../src/ChildExecutorDecision.ts"],"sourcesContent":[null],"mappings":";;;;;;AAGA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAuE,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAHvE;;;;AAKA;;;;AAIO,MAAMkB,2BAA2B,GAAAC,OAAA,CAAAD,2BAAA,GAAkBtB,QAAQ,CAACsB,2BAA2B;AA4D9F;;;;AAIO,MAAME,QAAQ,GAAAD,OAAA,CAAAC,QAAA,GAAuCxB,QAAQ,CAACwB,QAAQ;AAE7E;;;;AAIO,MAAMC,KAAK,GAAAF,OAAA,CAAAE,KAAA,GAA8CzB,QAAQ,CAACyB,KAAK;AAE9E;;;;AAIO,MAAMC,KAAK,GAAAH,OAAA,CAAAG,KAAA,GAAuC1B,QAAQ,CAAC0B,KAAK;AAEvE;;;;;;;AAOO,MAAMC,uBAAuB,GAAAJ,OAAA,CAAAI,uBAAA,GAA+C3B,QAAQ,CAAC2B,uBAAuB;AAEnH;;;;;;;AAOO,MAAMC,UAAU,GAAAL,OAAA,CAAAK,UAAA,GAAsD5B,QAAQ,CAAC4B,UAAU;AAEhG;;;;;;;AAOO,MAAMC,OAAO,GAAAN,OAAA,CAAAM,OAAA,GAAmD7B,QAAQ,CAAC6B,OAAO;AAEvF;;;;;;;AAOO,MAAMC,OAAO,GAAAP,OAAA,CAAAO,OAAA,GAAmD9B,QAAQ,CAAC8B,OAAO;AAEvF;;;;;;AAMO,MAAMC,KAAK,GAAAR,OAAA,CAAAQ,KAAA,GA4Bd/B,QAAQ,CAAC+B,KAAK","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Chunk.js

@@ -0,0 +1,1114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zipWith = exports.zip = exports.unzip = exports.unsafeLast = exports.unsafeHead = exports.unsafeGet = exports.unsafeFromNonEmptyArray = exports.unsafeFromArray = exports.union = exports.toReadonlyArray = exports.toArray = exports.takeWhile = exports.takeRight = exports.take = exports.tailNonEmpty = exports.tail = exports.splitWhere = exports.splitNonEmptyAt = exports.splitAt = exports.split = exports.sortWith = exports.sort = exports.some = exports.size = exports.separate = exports.reverse = exports.replaceOption = exports.replace = exports.removeOption = exports.remove = exports.reduceRight = exports.reduce = exports.range = exports.prependAll = exports.prepend = exports.partitionMap = exports.partition = exports.of = exports.modifyOption = exports.modify = exports.mapAccum = exports.map = exports.makeBy = exports.make = exports.lastNonEmpty = exports.last = exports.join = exports.isNonEmpty = exports.isEmpty = exports.isChunk = exports.intersection = exports.headNonEmpty = exports.head = exports.getEquivalence = exports.get = exports.fromIterable = exports.forEach = exports.flatten = exports.flatMap = exports.findLastIndex = exports.findLast = exports.findFirstIndex = exports.findFirst = exports.filterMapWhile = exports.filterMap = exports.filter = exports.every = exports.empty = exports.dropWhile = exports.dropRight = exports.drop = exports.differenceWith = exports.difference = exports.dedupeAdjacent = exports.dedupe = exports.containsWith = exports.contains = exports.compact = exports.chunksOf = exports.appendAll = exports.append = void 0;
+var RA = _interopRequireWildcard(require("./Array.js"));
+var Equal = _interopRequireWildcard(require("./Equal.js"));
+var Equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var Hash = _interopRequireWildcard(require("./Hash.js"));
+var _Inspectable = require("./Inspectable.js");
+var O = _interopRequireWildcard(require("./Option.js"));
+var Order = _interopRequireWildcard(require("./Order.js"));
+var _Pipeable = require("./Pipeable.js");
+var _Predicate = require("./Predicate.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+const TypeId = /*#__PURE__*/Symbol.for("effect/Chunk");
+function copy(src, srcPos, dest, destPos, len) {
+  for (let i = srcPos; i < Math.min(src.length, srcPos + len); i++) {
+    dest[destPos + i - srcPos] = src[i];
+  }
+  return dest;
+}
+const emptyArray = [];
+/**
+ * Compares the two chunks of equal length using the specified function
+ *
+ * @category equivalence
+ * @since 2.0.0
+ */
+const getEquivalence = isEquivalent => Equivalence.make((self, that) => self.length === that.length && toReadonlyArray(self).every((value, i) => isEquivalent(value, unsafeGet(that, i))));
+exports.getEquivalence = getEquivalence;
+const _equivalence = /*#__PURE__*/getEquivalence(Equal.equals);
+const ChunkProto = {
+  [TypeId]: {
+    _A: _ => _
+  },
+  toString() {
+    return (0, _Inspectable.format)(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "Chunk",
+      values: toReadonlyArray(this).map(_Inspectable.toJSON)
+    };
+  },
+  [_Inspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  [Equal.symbol](that) {
+    return isChunk(that) && _equivalence(this, that);
+  },
+  [Hash.symbol]() {
+    return Hash.cached(this, Hash.array(toReadonlyArray(this)));
+  },
+  [Symbol.iterator]() {
+    switch (this.backing._tag) {
+      case "IArray":
+        {
+          return this.backing.array[Symbol.iterator]();
+        }
+      case "IEmpty":
+        {
+          return emptyArray[Symbol.iterator]();
+        }
+      default:
+        {
+          return toReadonlyArray(this)[Symbol.iterator]();
+        }
+    }
+  },
+  pipe() {
+    return (0, _Pipeable.pipeArguments)(this, arguments);
+  }
+};
+const makeChunk = backing => {
+  const chunk = Object.create(ChunkProto);
+  chunk.backing = backing;
+  switch (backing._tag) {
+    case "IEmpty":
+      {
+        chunk.length = 0;
+        chunk.depth = 0;
+        chunk.left = chunk;
+        chunk.right = chunk;
+        break;
+      }
+    case "IConcat":
+      {
+        chunk.length = backing.left.length + backing.right.length;
+        chunk.depth = 1 + Math.max(backing.left.depth, backing.right.depth);
+        chunk.left = backing.left;
+        chunk.right = backing.right;
+        break;
+      }
+    case "IArray":
+      {
+        chunk.length = backing.array.length;
+        chunk.depth = 0;
+        chunk.left = _empty;
+        chunk.right = _empty;
+        break;
+      }
+    case "ISingleton":
+      {
+        chunk.length = 1;
+        chunk.depth = 0;
+        chunk.left = _empty;
+        chunk.right = _empty;
+        break;
+      }
+    case "ISlice":
+      {
+        chunk.length = backing.length;
+        chunk.depth = backing.chunk.depth + 1;
+        chunk.left = _empty;
+        chunk.right = _empty;
+        break;
+      }
+  }
+  return chunk;
+};
+/**
+ * Checks if `u` is a `Chunk<unknown>`
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const isChunk = u => (0, _Predicate.hasProperty)(u, TypeId);
+exports.isChunk = isChunk;
+const _empty = /*#__PURE__*/makeChunk({
+  _tag: "IEmpty"
+});
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+const empty = () => _empty;
+/**
+ * Builds a `NonEmptyChunk` from an non-empty collection of elements.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.empty = empty;
+const make = (...as) => unsafeFromNonEmptyArray(as);
+/**
+ * Builds a `NonEmptyChunk` from a single element.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.make = make;
+const of = a => makeChunk({
+  _tag: "ISingleton",
+  a
+});
+/**
+ * Creates a new `Chunk` from an iterable collection of values.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.of = of;
+const fromIterable = self => isChunk(self) ? self : unsafeFromArray(RA.fromIterable(self));
+exports.fromIterable = fromIterable;
+const copyToArray = (self, array, initial) => {
+  switch (self.backing._tag) {
+    case "IArray":
+      {
+        copy(self.backing.array, 0, array, initial, self.length);
+        break;
+      }
+    case "IConcat":
+      {
+        copyToArray(self.left, array, initial);
+        copyToArray(self.right, array, initial + self.left.length);
+        break;
+      }
+    case "ISingleton":
+      {
+        array[initial] = self.backing.a;
+        break;
+      }
+    case "ISlice":
+      {
+        let i = 0;
+        let j = initial;
+        while (i < self.length) {
+          array[j] = unsafeGet(self, i);
+          i += 1;
+          j += 1;
+        }
+        break;
+      }
+  }
+};
+const toArray_ = self => toReadonlyArray(self).slice();
+/**
+ * Converts a `Chunk` into an `Array`. If the provided `Chunk` is non-empty
+ * (`NonEmptyChunk`), the function will return a `NonEmptyArray`, ensuring the
+ * non-empty property is preserved.
+ *
+ * @category conversions
+ * @since 2.0.0
+ */
+const toArray = exports.toArray = toArray_;
+const toReadonlyArray_ = self => {
+  switch (self.backing._tag) {
+    case "IEmpty":
+      {
+        return emptyArray;
+      }
+    case "IArray":
+      {
+        return self.backing.array;
+      }
+    default:
+      {
+        const arr = new Array(self.length);
+        copyToArray(self, arr, 0);
+        self.backing = {
+          _tag: "IArray",
+          array: arr
+        };
+        self.left = _empty;
+        self.right = _empty;
+        self.depth = 0;
+        return arr;
+      }
+  }
+};
+/**
+ * Converts a `Chunk` into a `ReadonlyArray`. If the provided `Chunk` is
+ * non-empty (`NonEmptyChunk`), the function will return a
+ * `NonEmptyReadonlyArray`, ensuring the non-empty property is preserved.
+ *
+ * @category conversions
+ * @since 2.0.0
+ */
+const toReadonlyArray = exports.toReadonlyArray = toReadonlyArray_;
+const reverseChunk = self => {
+  switch (self.backing._tag) {
+    case "IEmpty":
+    case "ISingleton":
+      return self;
+    case "IArray":
+      {
+        return makeChunk({
+          _tag: "IArray",
+          array: RA.reverse(self.backing.array)
+        });
+      }
+    case "IConcat":
+      {
+        return makeChunk({
+          _tag: "IConcat",
+          left: reverse(self.backing.right),
+          right: reverse(self.backing.left)
+        });
+      }
+    case "ISlice":
+      return unsafeFromArray(RA.reverse(toReadonlyArray(self)));
+  }
+};
+/**
+ * Reverses the order of elements in a `Chunk`.
+ * Importantly, if the input chunk is a `NonEmptyChunk`, the reversed chunk will also be a `NonEmptyChunk`.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Chunk } from "effect"
+ *
+ * const chunk = Chunk.make(1, 2, 3)
+ * const result = Chunk.reverse(chunk)
+ *
+ * console.log(result)
+ * // { _id: 'Chunk', values: [ 3, 2, 1 ] }
+ * ```
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const reverse = exports.reverse = reverseChunk;
+/**
+ * This function provides a safe way to read a value at a particular index from a `Chunk`.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const get = exports.get = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => index < 0 || index >= self.length ? O.none() : O.some(unsafeGet(self, index)));
+/**
+ * Wraps an array into a chunk without copying, unsafe on mutable arrays
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+const unsafeFromArray = self => self.length === 0 ? empty() : self.length === 1 ? of(self[0]) : makeChunk({
+  _tag: "IArray",
+  array: self
+});
+/**
+ * Wraps an array into a chunk without copying, unsafe on mutable arrays
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+exports.unsafeFromArray = unsafeFromArray;
+const unsafeFromNonEmptyArray = self => unsafeFromArray(self);
+/**
+ * Gets an element unsafely, will throw on out of bounds
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+exports.unsafeFromNonEmptyArray = unsafeFromNonEmptyArray;
+const unsafeGet = exports.unsafeGet = /*#__PURE__*/(0, _Function.dual)(2, (self, index) => {
+  switch (self.backing._tag) {
+    case "IEmpty":
+      {
+        throw new Error(`Index out of bounds`);
+      }
+    case "ISingleton":
+      {
+        if (index !== 0) {
+          throw new Error(`Index out of bounds`);
+        }
+        return self.backing.a;
+      }
+    case "IArray":
+      {
+        if (index >= self.length || index < 0) {
+          throw new Error(`Index out of bounds`);
+        }
+        return self.backing.array[index];
+      }
+    case "IConcat":
+      {
+        return index < self.left.length ? unsafeGet(self.left, index) : unsafeGet(self.right, index - self.left.length);
+      }
+    case "ISlice":
+      {
+        return unsafeGet(self.backing.chunk, index + self.backing.offset);
+      }
+  }
+});
+/**
+ * Appends the specified element to the end of the `Chunk`.
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const append = exports.append = /*#__PURE__*/(0, _Function.dual)(2, (self, a) => appendAll(self, of(a)));
+/**
+ * Prepend an element to the front of a `Chunk`, creating a new `NonEmptyChunk`.
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const prepend = exports.prepend = /*#__PURE__*/(0, _Function.dual)(2, (self, elem) => appendAll(of(elem), self));
+/**
+ * Takes the first up to `n` elements from the chunk
+ *
+ * @since 2.0.0
+ */
+const take = exports.take = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  if (n <= 0) {
+    return _empty;
+  } else if (n >= self.length) {
+    return self;
+  } else {
+    switch (self.backing._tag) {
+      case "ISlice":
+        {
+          return makeChunk({
+            _tag: "ISlice",
+            chunk: self.backing.chunk,
+            length: n,
+            offset: self.backing.offset
+          });
+        }
+      case "IConcat":
+        {
+          if (n > self.left.length) {
+            return makeChunk({
+              _tag: "IConcat",
+              left: self.left,
+              right: take(self.right, n - self.left.length)
+            });
+          }
+          return take(self.left, n);
+        }
+      default:
+        {
+          return makeChunk({
+            _tag: "ISlice",
+            chunk: self,
+            offset: 0,
+            length: n
+          });
+        }
+    }
+  }
+});
+/**
+ * Drops the first up to `n` elements from the chunk
+ *
+ * @since 2.0.0
+ */
+const drop = exports.drop = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  if (n <= 0) {
+    return self;
+  } else if (n >= self.length) {
+    return _empty;
+  } else {
+    switch (self.backing._tag) {
+      case "ISlice":
+        {
+          return makeChunk({
+            _tag: "ISlice",
+            chunk: self.backing.chunk,
+            offset: self.backing.offset + n,
+            length: self.backing.length - n
+          });
+        }
+      case "IConcat":
+        {
+          if (n > self.left.length) {
+            return drop(self.right, n - self.left.length);
+          }
+          return makeChunk({
+            _tag: "IConcat",
+            left: drop(self.left, n),
+            right: self.right
+          });
+        }
+      default:
+        {
+          return makeChunk({
+            _tag: "ISlice",
+            chunk: self,
+            offset: n,
+            length: self.length - n
+          });
+        }
+    }
+  }
+});
+/**
+ * Drops the last `n` elements.
+ *
+ * @since 2.0.0
+ */
+const dropRight = exports.dropRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => take(self, Math.max(0, self.length - n)));
+/**
+ * Drops all elements so long as the predicate returns true.
+ *
+ * @since 2.0.0
+ */
+const dropWhile = exports.dropWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  const arr = toReadonlyArray(self);
+  const len = arr.length;
+  let i = 0;
+  while (i < len && predicate(arr[i])) {
+    i++;
+  }
+  return drop(self, i);
+});
+/**
+ * Prepends the specified prefix chunk to the beginning of the specified chunk.
+ * If either chunk is non-empty, the result is also a non-empty chunk.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Chunk } from "effect"
+ *
+ * const result = Chunk.make(1, 2).pipe(Chunk.prependAll(Chunk.make("a", "b")), Chunk.toArray)
+ *
+ * console.log(result)
+ * // [ "a", "b", 1, 2 ]
+ * ```
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const prependAll = exports.prependAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => appendAll(that, self));
+/**
+ * Concatenates two chunks, combining their elements.
+ * If either chunk is non-empty, the result is also a non-empty chunk.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Chunk } from "effect"
+ *
+ * const result = Chunk.make(1, 2).pipe(Chunk.appendAll(Chunk.make("a", "b")), Chunk.toArray)
+ *
+ * console.log(result)
+ * // [ 1, 2, "a", "b" ]
+ * ```
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const appendAll = exports.appendAll = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => {
+  if (self.backing._tag === "IEmpty") {
+    return that;
+  }
+  if (that.backing._tag === "IEmpty") {
+    return self;
+  }
+  const diff = that.depth - self.depth;
+  if (Math.abs(diff) <= 1) {
+    return makeChunk({
+      _tag: "IConcat",
+      left: self,
+      right: that
+    });
+  } else if (diff < -1) {
+    if (self.left.depth >= self.right.depth) {
+      const nr = appendAll(self.right, that);
+      return makeChunk({
+        _tag: "IConcat",
+        left: self.left,
+        right: nr
+      });
+    } else {
+      const nrr = appendAll(self.right.right, that);
+      if (nrr.depth === self.depth - 3) {
+        const nr = makeChunk({
+          _tag: "IConcat",
+          left: self.right.left,
+          right: nrr
+        });
+        return makeChunk({
+          _tag: "IConcat",
+          left: self.left,
+          right: nr
+        });
+      } else {
+        const nl = makeChunk({
+          _tag: "IConcat",
+          left: self.left,
+          right: self.right.left
+        });
+        return makeChunk({
+          _tag: "IConcat",
+          left: nl,
+          right: nrr
+        });
+      }
+    }
+  } else {
+    if (that.right.depth >= that.left.depth) {
+      const nl = appendAll(self, that.left);
+      return makeChunk({
+        _tag: "IConcat",
+        left: nl,
+        right: that.right
+      });
+    } else {
+      const nll = appendAll(self, that.left.left);
+      if (nll.depth === that.depth - 3) {
+        const nl = makeChunk({
+          _tag: "IConcat",
+          left: nll,
+          right: that.left.right
+        });
+        return makeChunk({
+          _tag: "IConcat",
+          left: nl,
+          right: that.right
+        });
+      } else {
+        const nr = makeChunk({
+          _tag: "IConcat",
+          left: that.left.right,
+          right: that.right
+        });
+        return makeChunk({
+          _tag: "IConcat",
+          left: nll,
+          right: nr
+        });
+      }
+    }
+  }
+});
+/**
+ * Returns a filtered and mapped subset of the elements.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filterMap = exports.filterMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => unsafeFromArray(RA.filterMap(self, f)));
+/**
+ * Returns a filtered and mapped subset of the elements.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = exports.filter = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => unsafeFromArray(RA.filter(self, predicate)));
+/**
+ * Transforms all elements of the chunk for as long as the specified function returns some value
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filterMapWhile = exports.filterMapWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => unsafeFromArray(RA.filterMapWhile(self, f)));
+/**
+ * Filter out optional values
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const compact = self => filterMap(self, _Function.identity);
+/**
+ * Applies a function to each element in a chunk and returns a new chunk containing the concatenated mapped elements.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+exports.compact = compact;
+const flatMap = exports.flatMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => {
+  if (self.backing._tag === "ISingleton") {
+    return f(self.backing.a, 0);
+  }
+  let out = _empty;
+  let i = 0;
+  for (const k of self) {
+    out = appendAll(out, f(k, i++));
+  }
+  return out;
+});
+/**
+ * Iterates over each element of a `Chunk` and applies a function to it.
+ *
+ * **Details**
+ *
+ * This function processes every element of the given `Chunk`, calling the
+ * provided function `f` on each element. It does not return a new value;
+ * instead, it is primarily used for side effects, such as logging or
+ * accumulating data in an external variable.
+ *
+ * @since 2.0.0
+ * @category combinators
+ */
+const forEach = exports.forEach = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => toReadonlyArray(self).forEach(f));
+/**
+ * Flattens a chunk of chunks into a single chunk by concatenating all chunks.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatten = exports.flatten = /*#__PURE__*/flatMap(_Function.identity);
+/**
+ * Groups elements in chunks of up to `n` elements.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const chunksOf = exports.chunksOf = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const gr = [];
+  let current = [];
+  toReadonlyArray(self).forEach(a => {
+    current.push(a);
+    if (current.length >= n) {
+      gr.push(unsafeFromArray(current));
+      current = [];
+    }
+  });
+  if (current.length > 0) {
+    gr.push(unsafeFromArray(current));
+  }
+  return unsafeFromArray(gr);
+});
+/**
+ * Creates a Chunk of unique values that are included in all given Chunks.
+ *
+ * The order and references of result values are determined by the Chunk.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const intersection = exports.intersection = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.intersection(toReadonlyArray(self), toReadonlyArray(that))));
+/**
+ * Determines if the chunk is empty.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const isEmpty = self => self.length === 0;
+/**
+ * Determines if the chunk is not empty.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.isEmpty = isEmpty;
+const isNonEmpty = self => self.length > 0;
+/**
+ * Returns the first element of this chunk if it exists.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.isNonEmpty = isNonEmpty;
+const head = exports.head = /*#__PURE__*/get(0);
+/**
+ * Returns the first element of this chunk.
+ *
+ * It will throw an error if the chunk is empty.
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+const unsafeHead = self => unsafeGet(self, 0);
+/**
+ * Returns the first element of this non empty chunk.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.unsafeHead = unsafeHead;
+const headNonEmpty = exports.headNonEmpty = unsafeHead;
+/**
+ * Returns the last element of this chunk if it exists.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const last = self => get(self, self.length - 1);
+/**
+ * Returns the last element of this chunk.
+ *
+ * It will throw an error if the chunk is empty.
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+exports.last = last;
+const unsafeLast = self => unsafeGet(self, self.length - 1);
+/**
+ * Returns the last element of this non empty chunk.
+ *
+ * @since 3.4.0
+ * @category elements
+ */
+exports.unsafeLast = unsafeLast;
+const lastNonEmpty = exports.lastNonEmpty = unsafeLast;
+/**
+ * Transforms the elements of a chunk using the specified mapping function.
+ * If the input chunk is non-empty, the resulting chunk will also be non-empty.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Chunk } from "effect"
+ *
+ * const result = Chunk.map(Chunk.make(1, 2), (n) => n + 1)
+ *
+ * console.log(result)
+ * // { _id: 'Chunk', values: [ 2, 3 ] }
+ * ```
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = exports.map = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => self.backing._tag === "ISingleton" ? of(f(self.backing.a, 0)) : unsafeFromArray((0, _Function.pipe)(toReadonlyArray(self), RA.map((a, i) => f(a, i)))));
+/**
+ * Statefully maps over the chunk, producing new elements of type `B`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const mapAccum = exports.mapAccum = /*#__PURE__*/(0, _Function.dual)(3, (self, s, f) => {
+  const [s1, as] = RA.mapAccum(self, s, f);
+  return [s1, unsafeFromArray(as)];
+});
+/**
+ * Separate elements based on a predicate that also exposes the index of the element.
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const partition = exports.partition = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => (0, _Function.pipe)(RA.partition(toReadonlyArray(self), predicate), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
+/**
+ * Partitions the elements of this chunk into two chunks using f.
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const partitionMap = exports.partitionMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => (0, _Function.pipe)(RA.partitionMap(toReadonlyArray(self), f), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
+/**
+ * Partitions the elements of this chunk into two chunks.
+ *
+ * @category filtering
+ * @since 2.0.0
+ */
+const separate = self => (0, _Function.pipe)(RA.separate(toReadonlyArray(self)), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]);
+/**
+ * Retireves the size of the chunk
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.separate = separate;
+const size = self => self.length;
+/**
+ * Sort the elements of a Chunk in increasing order, creating a new Chunk.
+ *
+ * @since 2.0.0
+ * @category sorting
+ */
+exports.size = size;
+const sort = exports.sort = /*#__PURE__*/(0, _Function.dual)(2, (self, O) => unsafeFromArray(RA.sort(toReadonlyArray(self), O)));
+/**
+ * @since 2.0.0
+ * @category sorting
+ */
+const sortWith = exports.sortWith = /*#__PURE__*/(0, _Function.dual)(3, (self, f, order) => sort(self, Order.mapInput(order, f)));
+/**
+ *  Returns two splits of this chunk at the specified index.
+ *
+ * @since 2.0.0
+ * @category splitting
+ */
+const splitAt = exports.splitAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => [take(self, n), drop(self, n)]);
+/**
+ * Splits a `NonEmptyChunk` into two segments, with the first segment containing a maximum of `n` elements.
+ * The value of `n` must be `>= 1`.
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const splitNonEmptyAt = exports.splitNonEmptyAt = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => {
+  const _n = Math.max(1, Math.floor(n));
+  return _n >= self.length ? [self, empty()] : [take(self, _n), drop(self, _n)];
+});
+/**
+ * Splits this chunk into `n` equally sized chunks.
+ *
+ * @since 2.0.0
+ * @category splitting
+ */
+const split = exports.split = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => chunksOf(self, Math.ceil(self.length / Math.floor(n))));
+/**
+ * Splits this chunk on the first element that matches this predicate.
+ * Returns a tuple containing two chunks: the first one is before the match, and the second one is from the match onward.
+ *
+ * @category splitting
+ * @since 2.0.0
+ */
+const splitWhere = exports.splitWhere = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  let i = 0;
+  for (const a of toReadonlyArray(self)) {
+    if (predicate(a)) {
+      break;
+    } else {
+      i++;
+    }
+  }
+  return splitAt(self, i);
+});
+/**
+ * Returns every elements after the first.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const tail = self => self.length > 0 ? O.some(drop(self, 1)) : O.none();
+/**
+ * Returns every elements after the first.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.tail = tail;
+const tailNonEmpty = self => drop(self, 1);
+/**
+ * Takes the last `n` elements.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.tailNonEmpty = tailNonEmpty;
+const takeRight = exports.takeRight = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => drop(self, self.length - n));
+/**
+ * Takes all elements so long as the predicate returns true.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const takeWhile = exports.takeWhile = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => {
+  const out = [];
+  for (const a of toReadonlyArray(self)) {
+    if (predicate(a)) {
+      out.push(a);
+    } else {
+      break;
+    }
+  }
+  return unsafeFromArray(out);
+});
+/**
+ * Creates a Chunks of unique values, in order, from all given Chunks.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const union = exports.union = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.union(toReadonlyArray(self), toReadonlyArray(that))));
+/**
+ * Remove duplicates from an array, keeping the first occurrence of an element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const dedupe = self => unsafeFromArray(RA.dedupe(toReadonlyArray(self)));
+/**
+ * Deduplicates adjacent elements that are identical.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+exports.dedupe = dedupe;
+const dedupeAdjacent = self => unsafeFromArray(RA.dedupeAdjacent(self));
+/**
+ * Takes a `Chunk` of pairs and return two corresponding `Chunk`s.
+ *
+ * Note: The function is reverse of `zip`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+exports.dedupeAdjacent = dedupeAdjacent;
+const unzip = self => {
+  const [left, right] = RA.unzip(self);
+  return [unsafeFromArray(left), unsafeFromArray(right)];
+};
+/**
+ * Zips this chunk pointwise with the specified chunk using the specified combiner.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+exports.unzip = unzip;
+const zipWith = exports.zipWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => unsafeFromArray(RA.zipWith(self, that, f)));
+/**
+ * Zips this chunk pointwise with the specified chunk.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zip = exports.zip = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, (a, b) => [a, b]));
+/**
+ * Delete the element at the specified index, creating a new `Chunk`.
+ *
+ * @since 2.0.0
+ */
+const remove = exports.remove = /*#__PURE__*/(0, _Function.dual)(2, (self, i) => {
+  if (i < 0 || i >= self.length) return self;
+  return unsafeFromArray(RA.remove(toReadonlyArray(self), i));
+});
+/**
+ * @since 3.16.0
+ */
+const removeOption = exports.removeOption = /*#__PURE__*/(0, _Function.dual)(2, (self, i) => {
+  if (i < 0 || i >= self.length) return O.none();
+  return O.some(unsafeFromArray(RA.remove(toReadonlyArray(self), i)));
+});
+/**
+ * @since 2.0.0
+ */
+const modifyOption = exports.modifyOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => {
+  if (i < 0 || i >= self.length) return O.none();
+  return O.some(unsafeFromArray(RA.modify(toReadonlyArray(self), i, f)));
+});
+/**
+ * Apply a function to the element at the specified index, creating a new `Chunk`,
+ * or returning the input if the index is out of bounds.
+ *
+ * @since 2.0.0
+ */
+const modify = exports.modify = /*#__PURE__*/(0, _Function.dual)(3, (self, i, f) => O.getOrElse(modifyOption(self, i, f), () => self));
+/**
+ * Change the element at the specified index, creating a new `Chunk`,
+ * or returning the input if the index is out of bounds.
+ *
+ * @since 2.0.0
+ */
+const replace = exports.replace = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modify(self, i, () => b));
+/**
+ * @since 2.0.0
+ */
+const replaceOption = exports.replaceOption = /*#__PURE__*/(0, _Function.dual)(3, (self, i, b) => modifyOption(self, i, () => b));
+/**
+ * Return a Chunk of length n with element i initialized with f(i).
+ *
+ * **Note**. `n` is normalized to an integer >= 1.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const makeBy = exports.makeBy = /*#__PURE__*/(0, _Function.dual)(2, (n, f) => fromIterable(RA.makeBy(n, f)));
+/**
+ * Create a non empty `Chunk` containing a range of integers, including both endpoints.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const range = (start, end) => start <= end ? makeBy(end - start + 1, i => start + i) : of(start);
+// -------------------------------------------------------------------------------------
+// re-exports from ReadonlyArray
+// -------------------------------------------------------------------------------------
+/**
+ * Returns a function that checks if a `Chunk` contains a given value using the default `Equivalence`.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+exports.range = range;
+const contains = exports.contains = RA.contains;
+/**
+ * Returns a function that checks if a `Chunk` contains a given value using a provided `isEquivalent` function.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const containsWith = exports.containsWith = RA.containsWith;
+/**
+ * Returns the first element that satisfies the specified
+ * predicate, or `None` if no such element exists.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findFirst = exports.findFirst = RA.findFirst;
+/**
+ * Return the first index for which a predicate holds.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findFirstIndex = exports.findFirstIndex = RA.findFirstIndex;
+/**
+ * Find the last element for which a predicate holds.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findLast = exports.findLast = RA.findLast;
+/**
+ * Return the last index for which a predicate holds.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const findLastIndex = exports.findLastIndex = RA.findLastIndex;
+/**
+ * Check if a predicate holds true for every `Chunk` element.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const every = exports.every = /*#__PURE__*/(0, _Function.dual)(2, (self, refinement) => RA.fromIterable(self).every(refinement));
+/**
+ * Check if a predicate holds true for some `Chunk` element.
+ *
+ * @category elements
+ * @since 2.0.0
+ */
+const some = exports.some = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => RA.fromIterable(self).some(predicate));
+/**
+ * Joins the elements together with "sep" in the middle.
+ *
+ * @category folding
+ * @since 2.0.0
+ */
+const join = exports.join = RA.join;
+/**
+ * @category folding
+ * @since 2.0.0
+ */
+const reduce = exports.reduce = RA.reduce;
+/**
+ * @category folding
+ * @since 2.0.0
+ */
+const reduceRight = exports.reduceRight = RA.reduceRight;
+/**
+ * Creates a `Chunk` of values not included in the other given `Chunk` using the provided `isEquivalent` function.
+ * The order and references of result values are determined by the first `Chunk`.
+ *
+ * @since 3.2.0
+ */
+const differenceWith = isEquivalent => {
+  return (0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.differenceWith(isEquivalent)(that, self)));
+};
+/**
+ * Creates a `Chunk` of values not included in the other given `Chunk`.
+ * The order and references of result values are determined by the first `Chunk`.
+ *
+ * @since 3.2.0
+ */
+exports.differenceWith = differenceWith;
+const difference = exports.difference = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => unsafeFromArray(RA.difference(that, self)));
+//# sourceMappingURL=Chunk.js.map

backend/node_modules/effect/dist/cjs/Clock.js

@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sleep = exports.make = exports.currentTimeNanos = exports.currentTimeMillis = exports.clockWith = exports.ClockTypeId = exports.Clock = void 0;
+var internal = _interopRequireWildcard(require("./internal/clock.js"));
+var defaultServices = _interopRequireWildcard(require("./internal/defaultServices.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ClockTypeId = exports.ClockTypeId = internal.ClockTypeId;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = exports.make = internal.make;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const sleep = exports.sleep = defaultServices.sleep;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const currentTimeMillis = exports.currentTimeMillis = defaultServices.currentTimeMillis;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const currentTimeNanos = exports.currentTimeNanos = defaultServices.currentTimeNanos;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const clockWith = exports.clockWith = defaultServices.clockWith;
+/**
+ * @since 2.0.0
+ * @category context
+ */
+const Clock = exports.Clock = internal.clockTag;
+//# sourceMappingURL=Clock.js.map

backend/node_modules/effect/dist/cjs/Clock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Clock.js","names":["internal","_interopRequireWildcard","require","defaultServices","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","ClockTypeId","exports","make","sleep","currentTimeMillis","currentTimeNanos","clockWith","Clock","clockTag"],"sources":["../../src/Clock.ts"],"sourcesContent":[null],"mappings":";;;;;;AAMA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,eAAA,GAAAF,uBAAA,CAAAC,OAAA;AAAgE,SAAAD,wBAAAG,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAL,uBAAA,YAAAA,CAAAG,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAEhE;;;;AAIO,MAAMkB,WAAW,GAAAC,OAAA,CAAAD,WAAA,GAAkBvB,QAAQ,CAACuB,WAAW;AA8D9D;;;;AAIO,MAAME,IAAI,GAAAD,OAAA,CAAAC,IAAA,GAAuBzB,QAAQ,CAACyB,IAAI;AAErD;;;;AAIO,MAAMC,KAAK,GAAAF,OAAA,CAAAE,KAAA,GAA8DvB,eAAe,CAACuB,KAAK;AAErG;;;;AAIO,MAAMC,iBAAiB,GAAAH,OAAA,CAAAG,iBAAA,GAA0BxB,eAAe,CAACwB,iBAAiB;AAEzF;;;;AAIO,MAAMC,gBAAgB,GAAAJ,OAAA,CAAAI,gBAAA,GAA0BzB,eAAe,CAACyB,gBAAgB;AAEvF;;;;AAIO,MAAMC,SAAS,GAAAL,OAAA,CAAAK,SAAA,GACpB1B,eAAe,CAAC0B,SAAS;AAE3B;;;;AAIO,MAAMC,KAAK,GAAAN,OAAA,CAAAM,KAAA,GAA8B9B,QAAQ,CAAC+B,QAAQ","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Config.js

@@ -0,0 +1,328 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zipWith = exports.zip = exports.withDescription = exports.withDefault = exports.validate = exports.url = exports.unwrap = exports.sync = exports.suspend = exports.succeed = exports.string = exports.secret = exports.repeat = exports.redacted = exports.primitive = exports.port = exports.orElseIf = exports.orElse = exports.option = exports.number = exports.nonEmptyString = exports.nested = exports.mapOrFail = exports.mapAttempt = exports.map = exports.logLevel = exports.literal = exports.isConfig = exports.integer = exports.hashSet = exports.hashMap = exports.fail = exports.duration = exports.date = exports.chunk = exports.branded = exports.boolean = exports.array = exports.all = exports.ConfigTypeId = void 0;
+var internal = _interopRequireWildcard(require("./internal/config.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ConfigTypeId = exports.ConfigTypeId = internal.ConfigTypeId;
+/**
+ * Constructs a config from a tuple / struct / arguments of configs.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const all = exports.all = internal.all;
+/**
+ * Constructs a config for an array of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const array = exports.array = internal.array;
+/**
+ * Constructs a config for a boolean value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const boolean = exports.boolean = internal.boolean;
+/**
+ * Constructs a config for a network port [1, 65535].
+ *
+ * @since 3.16.0
+ * @category constructors
+ */
+const port = exports.port = internal.port;
+/**
+ * Constructs a config for an URL value.
+ *
+ * @since 3.11.0
+ * @category constructors
+ */
+const url = exports.url = internal.url;
+/**
+ * Constructs a config for a sequence of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const chunk = exports.chunk = internal.chunk;
+/**
+ * Constructs a config for a date value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const date = exports.date = internal.date;
+/**
+ * Constructs a config that fails with the specified message.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fail = exports.fail = internal.fail;
+/**
+ * Constructs a config for a float value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const number = exports.number = internal.number;
+/**
+ * Constructs a config for a integer value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const integer = exports.integer = internal.integer;
+/**
+ * Constructs a config for a literal value.
+ *
+ * **Example**
+ *
+ * ```ts
+ * import { Config } from "effect"
+ *
+ * const config = Config.literal("http", "https")("PROTOCOL")
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const literal = exports.literal = internal.literal;
+/**
+ * Constructs a config for a `LogLevel` value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const logLevel = exports.logLevel = internal.logLevel;
+/**
+ * Constructs a config for a duration value.
+ *
+ * @since 2.5.0
+ * @category constructors
+ */
+const duration = exports.duration = internal.duration;
+/**
+ * This function returns `true` if the specified value is an `Config` value,
+ * `false` otherwise.
+ *
+ * This function can be useful for checking the type of a value before
+ * attempting to operate on it as an `Config` value. For example, you could
+ * use `isConfig` to check the type of a value before using it as an
+ * argument to a function that expects an `Config` value.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isConfig = exports.isConfig = internal.isConfig;
+/**
+ * Returns a  config whose structure is the same as this one, but which produces
+ * a different value, constructed using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = exports.map = internal.map;
+/**
+ * Returns a config whose structure is the same as this one, but which may
+ * produce a different value, constructed using the specified function, which
+ * may throw exceptions that will be translated into validation errors.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapAttempt = exports.mapAttempt = internal.mapAttempt;
+/**
+ * Returns a new config whose structure is the samea as this one, but which
+ * may produce a different value, constructed using the specified fallible
+ * function.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const mapOrFail = exports.mapOrFail = internal.mapOrFail;
+/**
+ * Returns a config that has this configuration nested as a property of the
+ * specified name.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const nested = exports.nested = internal.nested;
+/**
+ * Returns a config whose structure is preferentially described by this
+ * config, but which falls back to the specified config if there is an issue
+ * reading from this config.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const orElse = exports.orElse = internal.orElse;
+/**
+ * Returns configuration which reads from this configuration, but which falls
+ * back to the specified configuration if reading from this configuration
+ * fails with an error satisfying the specified predicate.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const orElseIf = exports.orElseIf = internal.orElseIf;
+/**
+ * Returns an optional version of this config, which will be `None` if the
+ * data is missing from configuration, and `Some` otherwise.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const option = exports.option = internal.option;
+/**
+ * Constructs a new primitive config.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const primitive = exports.primitive = internal.primitive;
+/**
+ * Returns a config that describes a sequence of values, each of which has the
+ * structure of this config.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const repeat = exports.repeat = internal.repeat;
+/**
+ * Constructs a config for a secret value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ * @deprecated
+ */
+const secret = exports.secret = internal.secret;
+/**
+ * Constructs a config for a redacted value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const redacted = exports.redacted = internal.redacted;
+/**
+ * Constructs a config for a branded value.
+ *
+ * @since 3.16.0
+ * @category constructors
+ */
+const branded = exports.branded = internal.branded;
+/**
+ * Constructs a config for a sequence of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const hashSet = exports.hashSet = internal.hashSet;
+/**
+ * Constructs a config for a string value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const string = exports.string = internal.string;
+/**
+ * Constructs a config for a non-empty string value.
+ *
+ * @since 3.7.0
+ * @category constructors
+ */
+const nonEmptyString = exports.nonEmptyString = internal.nonEmptyString;
+/**
+ * Constructs a config which contains the specified value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const succeed = exports.succeed = internal.succeed;
+/**
+ * Lazily constructs a config.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const suspend = exports.suspend = internal.suspend;
+/**
+ * Constructs a config which contains the specified lazy value.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const sync = exports.sync = internal.sync;
+/**
+ * Constructs a config for a sequence of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const hashMap = exports.hashMap = internal.hashMap;
+/**
+ * Constructs a config from some configuration wrapped with the `Wrap<A>` utility type.
+ *
+ * For example:
+ *
+ * ```
+ * import { Config, unwrap } from "./Config"
+ *
+ * interface Options { key: string }
+ *
+ * const makeConfig = (config: Config.Wrap<Options>): Config<Options> => unwrap(config)
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const unwrap = exports.unwrap = internal.unwrap;
+/**
+ * Returns a config that describes the same structure as this one, but which
+ * performs validation during loading.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const validate = exports.validate = internal.validate;
+/**
+ * Returns a config that describes the same structure as this one, but has the
+ * specified default value in case the information cannot be found.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const withDefault = exports.withDefault = internal.withDefault;
+/**
+ * Adds a description to this configuration, which is intended for humans.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const withDescription = exports.withDescription = internal.withDescription;
+/**
+ * Returns a config that is the composition of this config and the specified
+ * config.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zip = exports.zip = internal.zip;
+/**
+ * Returns a config that is the composes this config and the specified config
+ * using the provided function.
+ *
+ * @since 2.0.0
+ * @category zipping
+ */
+const zipWith = exports.zipWith = internal.zipWith;
+//# sourceMappingURL=Config.js.map

backend/node_modules/effect/dist/cjs/Config.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Config.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","ConfigTypeId","exports","all","array","boolean","port","url","chunk","date","fail","number","integer","literal","logLevel","duration","isConfig","map","mapAttempt","mapOrFail","nested","orElse","orElseIf","option","primitive","repeat","secret","redacted","branded","hashSet","string","nonEmptyString","succeed","suspend","sync","hashMap","unwrap","validate","withDefault","withDescription","zip","zipWith"],"sources":["../../src/Config.ts"],"sourcesContent":[null],"mappings":";;;;;;AAYA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAgD,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAQhD;;;;AAIO,MAAMkB,YAAY,GAAAC,OAAA,CAAAD,YAAA,GAAkBtB,QAAQ,CAACsB,YAAY;AAwEhE;;;;;;AAMO,MAAME,GAAG,GAAAD,OAAA,CAAAC,GAAA,GAWZxB,QAAQ,CAACwB,GAAG;AAEhB;;;;;;AAMO,MAAMC,KAAK,GAAAF,OAAA,CAAAE,KAAA,GAA8DzB,QAAQ,CAACyB,KAAK;AAE9F;;;;;;AAMO,MAAMC,OAAO,GAAAH,OAAA,CAAAG,OAAA,GAAuC1B,QAAQ,CAAC0B,OAAO;AAE3E;;;;;;AAMO,MAAMC,IAAI,GAAAJ,OAAA,CAAAI,IAAA,GAAsC3B,QAAQ,CAAC2B,IAAI;AAEpE;;;;;;AAMO,MAAMC,GAAG,GAAAL,OAAA,CAAAK,GAAA,GAAmC5B,QAAQ,CAAC4B,GAAG;AAE/D;;;;;;AAMO,MAAMC,KAAK,GAAAN,OAAA,CAAAM,KAAA,GAAoE7B,QAAQ,CAAC6B,KAAK;AAEpG;;;;;;AAMO,MAAMC,IAAI,GAAAP,OAAA,CAAAO,IAAA,GAAoC9B,QAAQ,CAAC8B,IAAI;AAElE;;;;;;AAMO,MAAMC,IAAI,GAAAR,OAAA,CAAAQ,IAAA,GAAuC/B,QAAQ,CAAC+B,IAAI;AAErE;;;;;;AAMO,MAAMC,MAAM,GAAAT,OAAA,CAAAS,MAAA,GAAsChC,QAAQ,CAACgC,MAAM;AAExE;;;;;;AAMO,MAAMC,OAAO,GAAAV,OAAA,CAAAU,OAAA,GAAsCjC,QAAQ,CAACiC,OAAO;AAE1E;;;;;;;;;;;;;;AAcO,MAAMC,OAAO,GAAAX,OAAA,CAAAW,OAAA,GAEYlC,QAAQ,CAACkC,OAAO;AAEhD;;;;;;AAMO,MAAMC,QAAQ,GAAAZ,OAAA,CAAAY,QAAA,GAAiDnC,QAAQ,CAACmC,QAAQ;AAEvF;;;;;;AAMO,MAAMC,QAAQ,GAAAb,OAAA,CAAAa,QAAA,GAAiDpC,QAAQ,CAACoC,QAAQ;AAEvF;;;;;;;;;;;;AAYO,MAAMC,QAAQ,GAAAd,OAAA,CAAAc,QAAA,GAAyCrC,QAAQ,CAACqC,QAAQ;AAE/E;;;;;;;AAOO,MAAMC,GAAG,GAAAf,OAAA,CAAAe,GAAA,GAiBZtC,QAAQ,CAACsC,GAAG;AAEhB;;;;;;;;AAQO,MAAMC,UAAU,GAAAhB,OAAA,CAAAgB,UAAA,GAmBnBvC,QAAQ,CAACuC,UAAU;AAEvB;;;;;;;;AAQO,MAAMC,SAAS,GAAAjB,OAAA,CAAAiB,SAAA,GAmBlBxC,QAAQ,CAACwC,SAAS;AAEtB;;;;;;;AAOO,MAAMC,MAAM,GAAAlB,OAAA,CAAAkB,MAAA,GAiBfzC,QAAQ,CAACyC,MAAM;AAEnB;;;;;;;;AAQO,MAAMC,MAAM,GAAAnB,OAAA,CAAAmB,MAAA,GAmBf1C,QAAQ,CAAC0C,MAAM;AAEnB;;;;;;;;AAQO,MAAMC,QAAQ,GAAApB,OAAA,CAAAoB,QAAA,GA8BjB3C,QAAQ,CAAC2C,QAAQ;AAErB;;;;;;;AAOO,MAAMC,MAAM,GAAArB,OAAA,CAAAqB,MAAA,GAAqD5C,QAAQ,CAAC4C,MAAM;AAEvF;;;;;;AAMO,MAAMC,SAAS,GAAAtB,OAAA,CAAAsB,SAAA,GAGL7C,QAAQ,CAAC6C,SAAS;AAEnC;;;;;;;AAOO,MAAMC,MAAM,GAAAvB,OAAA,CAAAuB,MAAA,GAA6C9C,QAAQ,CAAC8C,MAAM;AAE/E;;;;;;;AAOO,MAAMC,MAAM,GAAAxB,OAAA,CAAAwB,MAAA,GAA6C/C,QAAQ,CAAC+C,MAAM;AAE/E;;;;;;AAMO,MAAMC,QAAQ,GAAAzB,OAAA,CAAAyB,QAAA,GAejBhD,QAAQ,CAACgD,QAAQ;AAErB;;;;;;AAMO,MAAMC,OAAO,GAAA1B,OAAA,CAAA0B,OAAA,GAsBhBjD,QAAQ,CAACiD,OAAO;AAEpB;;;;;;AAMO,MAAMC,OAAO,GAAA3B,OAAA,CAAA2B,OAAA,GAAwElD,QAAQ,CAACkD,OAAO;AAE5G;;;;;;AAMO,MAAMC,MAAM,GAAA5B,OAAA,CAAA4B,MAAA,GAAsCnD,QAAQ,CAACmD,MAAM;AAExE;;;;;;AAMO,MAAMC,cAAc,GAAA7B,OAAA,CAAA6B,cAAA,GAAsCpD,QAAQ,CAACoD,cAAc;AAExF;;;;;;AAMO,MAAMC,OAAO,GAAA9B,OAAA,CAAA8B,OAAA,GAA+BrD,QAAQ,CAACqD,OAAO;AAEnE;;;;;;AAMO,MAAMC,OAAO,GAAA/B,OAAA,CAAA+B,OAAA,GAAiDtD,QAAQ,CAACsD,OAAO;AAErF;;;;;;AAMO,MAAMC,IAAI,GAAAhC,OAAA,CAAAgC,IAAA,GAAwCvD,QAAQ,CAACuD,IAAI;AAEtE;;;;;;AAMO,MAAMC,OAAO,GAAAjC,OAAA,CAAAiC,OAAA,GAAgFxD,QAAQ,CAACwD,OAAO;AAEpH;;;;;;;;;;;;;;;;AAgBO,MAAMC,MAAM,GAAAlC,OAAA,CAAAkC,MAAA,GAA8CzD,QAAQ,CAACyD,MAAM;AAEhF;;;;;;;AAOO,MAAMC,QAAQ,GAAAnC,OAAA,CAAAmC,QAAA,GAuDjB1D,QAAQ,CAAC0D,QAAQ;AAErB;;;;;;;AAOO,MAAMC,WAAW,GAAApC,OAAA,CAAAoC,WAAA,GAiBpB3D,QAAQ,CAAC2D,WAAW;AAExB;;;;;;AAMO,MAAMC,eAAe,GAAArC,OAAA,CAAAqC,eAAA,GAexB5D,QAAQ,CAAC4D,eAAe;AAE5B;;;;;;;AAOO,MAAMC,GAAG,GAAAtC,OAAA,CAAAsC,GAAA,GAiBZ7D,QAAQ,CAAC6D,GAAG;AAEhB;;;;;;;AAOO,MAAMC,OAAO,GAAAvC,OAAA,CAAAuC,OAAA,GAiBhB9D,QAAQ,CAAC8D,OAAO","ignoreList":[]}

backend/node_modules/effect/dist/cjs/ConfigError.js

@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reduceWithContext = exports.prefixed = exports.isUnsupported = exports.isSourceUnavailable = exports.isOr = exports.isMissingDataOnly = exports.isMissingData = exports.isInvalidData = exports.isConfigError = exports.isAnd = exports.Unsupported = exports.SourceUnavailable = exports.Or = exports.MissingData = exports.InvalidData = exports.ConfigErrorTypeId = exports.And = void 0;
+var internal = _interopRequireWildcard(require("./internal/configError.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const ConfigErrorTypeId = exports.ConfigErrorTypeId = internal.ConfigErrorTypeId;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const And = exports.And = internal.And;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const Or = exports.Or = internal.Or;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const MissingData = exports.MissingData = internal.MissingData;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const InvalidData = exports.InvalidData = internal.InvalidData;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const SourceUnavailable = exports.SourceUnavailable = internal.SourceUnavailable;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const Unsupported = exports.Unsupported = internal.Unsupported;
+/**
+ * Returns `true` if the specified value is a `ConfigError`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isConfigError = exports.isConfigError = internal.isConfigError;
+/**
+ * Returns `true` if the specified `ConfigError` is an `And`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isAnd = exports.isAnd = internal.isAnd;
+/**
+ * Returns `true` if the specified `ConfigError` is an `Or`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isOr = exports.isOr = internal.isOr;
+/**
+ * Returns `true` if the specified `ConfigError` is an `InvalidData`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isInvalidData = exports.isInvalidData = internal.isInvalidData;
+/**
+ * Returns `true` if the specified `ConfigError` is an `MissingData`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isMissingData = exports.isMissingData = internal.isMissingData;
+/**
+ * Returns `true` if the specified `ConfigError` contains only `MissingData` errors, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @categer getters
+ */
+const isMissingDataOnly = exports.isMissingDataOnly = internal.isMissingDataOnly;
+/**
+ * Returns `true` if the specified `ConfigError` is a `SourceUnavailable`,
+ * `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isSourceUnavailable = exports.isSourceUnavailable = internal.isSourceUnavailable;
+/**
+ * Returns `true` if the specified `ConfigError` is an `Unsupported`, `false`
+ * otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isUnsupported = exports.isUnsupported = internal.isUnsupported;
+/**
+ * @since 2.0.0
+ * @category utils
+ */
+const prefixed = exports.prefixed = internal.prefixed;
+/**
+ * @since 2.0.0
+ * @category folding
+ */
+const reduceWithContext = exports.reduceWithContext = internal.reduceWithContext;
+//# sourceMappingURL=ConfigError.js.map

backend/node_modules/effect/dist/cjs/ConfigError.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConfigError.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","ConfigErrorTypeId","exports","And","Or","MissingData","InvalidData","SourceUnavailable","Unsupported","isConfigError","isAnd","isOr","isInvalidData","isMissingData","isMissingDataOnly","isSourceUnavailable","isUnsupported","prefixed","reduceWithContext"],"sources":["../../src/ConfigError.ts"],"sourcesContent":[null],"mappings":";;;;;;AAIA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAqD,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAErD;;;;AAIO,MAAMkB,iBAAiB,GAAAC,OAAA,CAAAD,iBAAA,GAAkBtB,QAAQ,CAACsB,iBAAiB;AAmI1E;;;;AAIO,MAAME,GAAG,GAAAD,OAAA,CAAAC,GAAA,GAA0DxB,QAAQ,CAACwB,GAAG;AAEtF;;;;AAIO,MAAMC,EAAE,GAAAF,OAAA,CAAAE,EAAA,GAA0DzB,QAAQ,CAACyB,EAAE;AAEpF;;;;AAIO,MAAMC,WAAW,GAAAH,OAAA,CAAAG,WAAA,GACtB1B,QAAQ,CAAC0B,WAAW;AAEtB;;;;AAIO,MAAMC,WAAW,GAAAJ,OAAA,CAAAI,WAAA,GACtB3B,QAAQ,CAAC2B,WAAW;AAEtB;;;;AAIO,MAAMC,iBAAiB,GAAAL,OAAA,CAAAK,iBAAA,GAKX5B,QAAQ,CAAC4B,iBAAiB;AAE7C;;;;AAIO,MAAMC,WAAW,GAAAN,OAAA,CAAAM,WAAA,GACtB7B,QAAQ,CAAC6B,WAAW;AAEtB;;;;;;AAMO,MAAMC,aAAa,GAAAP,OAAA,CAAAO,aAAA,GAAqC9B,QAAQ,CAAC8B,aAAa;AAErF;;;;;;AAMO,MAAMC,KAAK,GAAAR,OAAA,CAAAQ,KAAA,GAAuC/B,QAAQ,CAAC+B,KAAK;AAEvE;;;;;;AAMO,MAAMC,IAAI,GAAAT,OAAA,CAAAS,IAAA,GAAsChC,QAAQ,CAACgC,IAAI;AAEpE;;;;;;;AAOO,MAAMC,aAAa,GAAAV,OAAA,CAAAU,aAAA,GAA+CjC,QAAQ,CAACiC,aAAa;AAE/F;;;;;;;AAOO,MAAMC,aAAa,GAAAX,OAAA,CAAAW,aAAA,GAA+ClC,QAAQ,CAACkC,aAAa;AAE/F;;;;;;AAMO,MAAMC,iBAAiB,GAAAZ,OAAA,CAAAY,iBAAA,GAAmCnC,QAAQ,CAACmC,iBAAiB;AAE3F;;;;;;;AAOO,MAAMC,mBAAmB,GAAAb,OAAA,CAAAa,mBAAA,GAAqDpC,QAAQ,CAACoC,mBAAmB;AAEjH;;;;;;;AAOO,MAAMC,aAAa,GAAAd,OAAA,CAAAc,aAAA,GAA+CrC,QAAQ,CAACqC,aAAa;AAE/F;;;;AAIO,MAAMC,QAAQ,GAAAf,OAAA,CAAAe,QAAA,GAWjBtC,QAAQ,CAACsC,QAAQ;AAErB;;;;AAIO,MAAMC,iBAAiB,GAAAhB,OAAA,CAAAgB,iBAAA,GAW1BvC,QAAQ,CAACuC,iBAAiB","ignoreList":[]}

backend/node_modules/effect/dist/cjs/ConfigProvider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConfigProvider.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","ConfigProviderTypeId","exports","FlatConfigProviderTypeId","ConfigProvider","configProviderTag","make","makeFlat","fromEnv","fromFlat","fromJson","fromMap","constantCase","mapInputPath","kebabCase","lowerCase","nested","orElse","unnested","snakeCase","upperCase","within"],"sources":["../../src/ConfigProvider.ts"],"sourcesContent":[null],"mappings":";;;;;;AAUA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAwD,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAGxD;;;;AAIO,MAAMkB,oBAAoB,GAAAC,OAAA,CAAAD,oBAAA,GAAkBtB,QAAQ,CAACsB,oBAAoB;AAQhF;;;;AAIO,MAAME,wBAAwB,GAAAD,OAAA,CAAAC,wBAAA,GAAkBxB,QAAQ,CAACwB,wBAAwB;AAuGxF;;;;;;AAMO,MAAMC,cAAc,GAAAF,OAAA,CAAAE,cAAA,GAAgDzB,QAAQ,CAAC0B,iBAAiB;AAErG;;;;;;AAMO,MAAMC,IAAI,GAAAJ,OAAA,CAAAI,IAAA,GAKK3B,QAAQ,CAAC2B,IAAI;AAEnC;;;;;;AAMO,MAAMC,QAAQ,GAAAL,OAAA,CAAAK,QAAA,GAUO5B,QAAQ,CAAC4B,QAAQ;AAE7C;;;;;;;;;;;AAWO,MAAMC,OAAO,GAAAN,OAAA,CAAAM,OAAA,GAAwE7B,QAAQ,CAAC6B,OAAO;AAE5G;;;;;;;AAOO,MAAMC,QAAQ,GAAAP,OAAA,CAAAO,QAAA,GAAkD9B,QAAQ,CAAC8B,QAAQ;AAExF;;;;;;AAMO,MAAMC,QAAQ,GAAAR,OAAA,CAAAQ,QAAA,GAAsC/B,QAAQ,CAAC+B,QAAQ;AAE5E;AACA;;;;;;;AAOO,MAAMC,OAAO,GAAAT,OAAA,CAAAS,OAAA,GAClBhC,QAAQ,CAACgC,OAAO;AAElB;;;;;;;;;AASO,MAAMC,YAAY,GAAAV,OAAA,CAAAU,YAAA,GAA6CjC,QAAQ,CAACiC,YAAY;AAE3F;;;;;;;;;AASO,MAAMC,YAAY,GAAAX,OAAA,CAAAW,YAAA,GAqBrBlC,QAAQ,CAACkC,YAAY;AAEzB;;;;;;;;;AASO,MAAMC,SAAS,GAAAZ,OAAA,CAAAY,SAAA,GAA6CnC,QAAQ,CAACmC,SAAS;AAErF;;;;;;;;;AASO,MAAMC,SAAS,GAAAb,OAAA,CAAAa,SAAA,GAA6CpC,QAAQ,CAACoC,SAAS;AAErF;;;;;;;;;AASO,MAAMC,MAAM,GAAAd,OAAA,CAAAc,MAAA,GAqBfrC,QAAQ,CAACqC,MAAM;AAEnB;;;;;;;;AAQO,MAAMC,MAAM,GAAAf,OAAA,CAAAe,MAAA,GAmBftC,QAAQ,CAACsC,MAAM;AAEnB;;;;;;;;;AASO,MAAMC,QAAQ,GAAAhB,OAAA,CAAAgB,QAAA,GAqBjBvC,QAAQ,CAACuC,QAAQ;AAErB;;;;;;;;;AASO,MAAMC,SAAS,GAAAjB,OAAA,CAAAiB,SAAA,GAA6CxC,QAAQ,CAACwC,SAAS;AAErF;;;;;;;;;AASO,MAAMC,SAAS,GAAAlB,OAAA,CAAAkB,SAAA,GAA6CzC,QAAQ,CAACyC,SAAS;AAErF;;;;;;;AAOO,MAAMC,MAAM,GAAAnB,OAAA,CAAAmB,MAAA,GAqBf1C,QAAQ,CAAC0C,MAAM","ignoreList":[]}

backend/node_modules/effect/dist/cjs/ConfigProviderPathPatch.js

@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unnested = exports.nested = exports.mapName = exports.empty = exports.andThen = void 0;
+var internal = _interopRequireWildcard(require("./internal/configProvider/pathPatch.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = exports.empty = internal.empty;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const andThen = exports.andThen = internal.andThen;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const mapName = exports.mapName = internal.mapName;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const nested = exports.nested = internal.nested;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const unnested = exports.unnested = internal.unnested;
+//# sourceMappingURL=ConfigProviderPathPatch.js.map

backend/node_modules/effect/dist/cjs/ConfigProviderPathPatch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConfigProviderPathPatch.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","empty","exports","andThen","mapName","nested","unnested"],"sources":["../../src/ConfigProviderPathPatch.ts"],"sourcesContent":[null],"mappings":";;;;;;AAGA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAkE,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAHlE;;;;AA2DA;;;;AAIO,MAAMkB,KAAK,GAAAC,OAAA,CAAAD,KAAA,GAActB,QAAQ,CAACsB,KAAK;AAE9C;;;;AAIO,MAAME,OAAO,GAAAD,OAAA,CAAAC,OAAA,GAWhBxB,QAAQ,CAACwB,OAAO;AAEpB;;;;AAIO,MAAMC,OAAO,GAAAF,OAAA,CAAAE,OAAA,GAWhBzB,QAAQ,CAACyB,OAAO;AAEpB;;;;AAIO,MAAMC,MAAM,GAAAH,OAAA,CAAAG,MAAA,GAWf1B,QAAQ,CAAC0B,MAAM;AAEnB;;;;AAIO,MAAMC,QAAQ,GAAAJ,OAAA,CAAAI,QAAA,GAWjB3B,QAAQ,CAAC2B,QAAQ","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Console.js

@@ -0,0 +1,125 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.withTime = exports.withGroup = exports.withConsole = exports.warn = exports.trace = exports.timeLog = exports.time = exports.table = exports.setConsole = exports.log = exports.info = exports.group = exports.error = exports.dirxml = exports.dir = exports.debug = exports.countReset = exports.count = exports.consoleWith = exports.clear = exports.assert = exports.TypeId = exports.Console = void 0;
+var internal = _interopRequireWildcard(require("./internal/console.js"));
+var defaultConsole = _interopRequireWildcard(require("./internal/defaultServices/console.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category type ids
+ */
+const TypeId = exports.TypeId = defaultConsole.TypeId;
+/**
+ * @since 2.0.0
+ * @category context
+ */
+const Console = exports.Console = defaultConsole.consoleTag;
+/**
+ * @since 2.0.0
+ * @category default services
+ */
+const withConsole = exports.withConsole = internal.withConsole;
+/**
+ * @since 2.0.0
+ * @category default services
+ */
+const setConsole = exports.setConsole = internal.setConsole;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const consoleWith = exports.consoleWith = internal.consoleWith;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const assert = exports.assert = internal.assert;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const clear = exports.clear = internal.clear;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const count = exports.count = internal.count;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const countReset = exports.countReset = internal.countReset;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const debug = exports.debug = internal.debug;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const dir = exports.dir = internal.dir;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const dirxml = exports.dirxml = internal.dirxml;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const error = exports.error = internal.error;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const group = exports.group = internal.group;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const info = exports.info = internal.info;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const log = exports.log = internal.log;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const table = exports.table = internal.table;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const time = exports.time = internal.time;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const timeLog = exports.timeLog = internal.timeLog;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const trace = exports.trace = internal.trace;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const warn = exports.warn = internal.warn;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const withGroup = exports.withGroup = internal.withGroup;
+/**
+ * @since 2.0.0
+ * @category accessor
+ */
+const withTime = exports.withTime = internal.withTime;
+//# sourceMappingURL=Console.js.map

backend/node_modules/effect/dist/cjs/Console.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Console.js","names":["internal","_interopRequireWildcard","require","defaultConsole","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","TypeId","exports","Console","consoleTag","withConsole","setConsole","consoleWith","assert","clear","count","countReset","debug","dir","dirxml","error","group","info","log","table","time","timeLog","trace","warn","withGroup","withTime"],"sources":["../../src/Console.ts"],"sourcesContent":[null],"mappings":";;;;;;AAKA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,cAAA,GAAAF,uBAAA,CAAAC,OAAA;AAAuE,SAAAD,wBAAAG,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAL,uBAAA,YAAAA,CAAAG,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAIvE;;;;AAIO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,GAAkBpB,cAAc,CAACoB,MAAM;AAgE1D;;;;AAIO,MAAME,OAAO,GAAAD,OAAA,CAAAC,OAAA,GAAkCtB,cAAc,CAACuB,UAAU;AAE/E;;;;AAIO,MAAMC,WAAW,GAAAH,OAAA,CAAAG,WAAA,GAWpB3B,QAAQ,CAAC2B,WAAW;AAExB;;;;AAIO,MAAMC,UAAU,GAAAJ,OAAA,CAAAI,UAAA,GAA0D5B,QAAQ,CAAC4B,UAAU;AAEpG;;;;AAIO,MAAMC,WAAW,GAAAL,OAAA,CAAAK,WAAA,GAA2E7B,QAAQ,CAAC6B,WAAW;AAEvH;;;;AAIO,MAAMC,MAAM,GAAAN,OAAA,CAAAM,MAAA,GAAsE9B,QAAQ,CAAC8B,MAAM;AAExG;;;;AAIO,MAAMC,KAAK,GAAAP,OAAA,CAAAO,KAAA,GAAiB/B,QAAQ,CAAC+B,KAAK;AAEjD;;;;AAIO,MAAMC,KAAK,GAAAR,OAAA,CAAAQ,KAAA,GAAqChC,QAAQ,CAACgC,KAAK;AAErE;;;;AAIO,MAAMC,UAAU,GAAAT,OAAA,CAAAS,UAAA,GAAqCjC,QAAQ,CAACiC,UAAU;AAE/E;;;;AAIO,MAAMC,KAAK,GAAAV,OAAA,CAAAU,KAAA,GAAkDlC,QAAQ,CAACkC,KAAK;AAElF;;;;AAIO,MAAMC,GAAG,GAAAX,OAAA,CAAAW,GAAA,GAA+CnC,QAAQ,CAACmC,GAAG;AAE3E;;;;AAIO,MAAMC,MAAM,GAAAZ,OAAA,CAAAY,MAAA,GAAkDpC,QAAQ,CAACoC,MAAM;AAEpF;;;;AAIO,MAAMC,KAAK,GAAAb,OAAA,CAAAa,KAAA,GAAkDrC,QAAQ,CAACqC,KAAK;AAElF;;;;AAIO,MAAMC,KAAK,GAAAd,OAAA,CAAAc,KAAA,GAEgBtC,QAAQ,CAACsC,KAAK;AAEhD;;;;AAIO,MAAMC,IAAI,GAAAf,OAAA,CAAAe,IAAA,GAAkDvC,QAAQ,CAACuC,IAAI;AAEhF;;;;AAIO,MAAMC,GAAG,GAAAhB,OAAA,CAAAgB,GAAA,GAAkDxC,QAAQ,CAACwC,GAAG;AAE9E;;;;AAIO,MAAMC,KAAK,GAAAjB,OAAA,CAAAiB,KAAA,GAA2EzC,QAAQ,CAACyC,KAAK;AAE3G;;;;AAIO,MAAMC,IAAI,GAAAlB,OAAA,CAAAkB,IAAA,GAA+D1C,QAAQ,CAAC0C,IAAI;AAE7F;;;;AAIO,MAAMC,OAAO,GAAAnB,OAAA,CAAAmB,OAAA,GAAkE3C,QAAQ,CAAC2C,OAAO;AAEtG;;;;AAIO,MAAMC,KAAK,GAAApB,OAAA,CAAAoB,KAAA,GAAkD5C,QAAQ,CAAC4C,KAAK;AAElF;;;;AAIO,MAAMC,IAAI,GAAArB,OAAA,CAAAqB,IAAA,GAAkD7C,QAAQ,CAAC6C,IAAI;AAEhF;;;;AAIO,MAAMC,SAAS,GAAAtB,OAAA,CAAAsB,SAAA,GAsBlB9C,QAAQ,CAAC8C,SAAS;AAEtB;;;;AAIO,MAAMC,QAAQ,GAAAvB,OAAA,CAAAuB,QAAA,GAWjB/C,QAAQ,CAAC+C,QAAQ","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Cron.js

@@ -0,0 +1,679 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unsafeParse = exports.sequenceReverse = exports.sequence = exports.prev = exports.parse = exports.next = exports.match = exports.make = exports.isParseError = exports.isCron = exports.equals = exports.TypeId = exports.ParseErrorTypeId = exports.ParseError = exports.Equivalence = void 0;
+var Arr = _interopRequireWildcard(require("./Array.js"));
+var Data = _interopRequireWildcard(require("./Data.js"));
+var Either = _interopRequireWildcard(require("./Either.js"));
+var Equal = _interopRequireWildcard(require("./Equal.js"));
+var equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var Hash = _interopRequireWildcard(require("./Hash.js"));
+var _Inspectable = require("./Inspectable.js");
+var dateTime = _interopRequireWildcard(require("./internal/dateTime.js"));
+var N = _interopRequireWildcard(require("./Number.js"));
+var Option = _interopRequireWildcard(require("./Option.js"));
+var _Pipeable = require("./Pipeable.js");
+var _Predicate = require("./Predicate.js");
+var String = _interopRequireWildcard(require("./String.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const TypeId = exports.TypeId = /*#__PURE__*/Symbol.for("effect/Cron");
+const CronProto = {
+  [TypeId]: TypeId,
+  [Equal.symbol](that) {
+    return isCron(that) && equals(this, that);
+  },
+  [Hash.symbol]() {
+    return (0, _Function.pipe)(Hash.hash(this.tz), Hash.combine(Hash.array(Arr.fromIterable(this.seconds))), Hash.combine(Hash.array(Arr.fromIterable(this.minutes))), Hash.combine(Hash.array(Arr.fromIterable(this.hours))), Hash.combine(Hash.array(Arr.fromIterable(this.days))), Hash.combine(Hash.array(Arr.fromIterable(this.months))), Hash.combine(Hash.array(Arr.fromIterable(this.weekdays))), Hash.cached(this));
+  },
+  toString() {
+    return (0, _Inspectable.format)(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "Cron",
+      tz: this.tz,
+      seconds: Arr.fromIterable(this.seconds),
+      minutes: Arr.fromIterable(this.minutes),
+      hours: Arr.fromIterable(this.hours),
+      days: Arr.fromIterable(this.days),
+      months: Arr.fromIterable(this.months),
+      weekdays: Arr.fromIterable(this.weekdays)
+    };
+  },
+  [_Inspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return (0, _Pipeable.pipeArguments)(this, arguments);
+  }
+};
+/**
+ * Checks if a given value is a `Cron` instance.
+ *
+ * @since 2.0.0
+ * @category guards
+ */
+const isCron = u => (0, _Predicate.hasProperty)(u, TypeId);
+/**
+ * Creates a `Cron` instance.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.isCron = isCron;
+const make = values => {
+  const o = Object.create(CronProto);
+  o.seconds = new Set(Arr.sort(values.seconds ?? [0], N.Order));
+  o.minutes = new Set(Arr.sort(values.minutes, N.Order));
+  o.hours = new Set(Arr.sort(values.hours, N.Order));
+  o.days = new Set(Arr.sort(values.days, N.Order));
+  o.months = new Set(Arr.sort(values.months, N.Order));
+  o.weekdays = new Set(Arr.sort(values.weekdays, N.Order));
+  o.tz = Option.fromNullable(values.tz);
+  const seconds = Array.from(o.seconds);
+  const minutes = Array.from(o.minutes);
+  const hours = Array.from(o.hours);
+  const days = Array.from(o.days);
+  const months = Array.from(o.months);
+  const weekdays = Array.from(o.weekdays);
+  o.first = {
+    second: seconds[0] ?? 0,
+    minute: minutes[0] ?? 0,
+    hour: hours[0] ?? 0,
+    day: days[0] ?? 1,
+    month: (months[0] ?? 1) - 1,
+    weekday: weekdays[0] ?? 0
+  };
+  o.last = {
+    second: seconds[seconds.length - 1] ?? 59,
+    minute: minutes[minutes.length - 1] ?? 59,
+    hour: hours[hours.length - 1] ?? 23,
+    day: days[days.length - 1] ?? 31,
+    month: (months[months.length - 1] ?? 12) - 1,
+    weekday: weekdays[weekdays.length - 1] ?? 6
+  };
+  o.next = {
+    second: lookupTable(seconds, 60, "next"),
+    minute: lookupTable(minutes, 60, "next"),
+    hour: lookupTable(hours, 24, "next"),
+    day: lookupTable(days, 32, "next"),
+    month: lookupTable(months, 13, "next"),
+    weekday: lookupTable(weekdays, 7, "next")
+  };
+  o.prev = {
+    second: lookupTable(seconds, 60, "prev"),
+    minute: lookupTable(minutes, 60, "prev"),
+    hour: lookupTable(hours, 24, "prev"),
+    day: lookupTable(days, 32, "prev"),
+    month: lookupTable(months, 13, "prev"),
+    weekday: lookupTable(weekdays, 7, "prev")
+  };
+  return o;
+};
+exports.make = make;
+const lookupTable = (values, size, dir) => {
+  const result = new Array(size).fill(undefined);
+  if (values.length === 0) {
+    return result;
+  }
+  let current = undefined;
+  if (dir === "next") {
+    let index = values.length - 1;
+    for (let i = size - 1; i >= 0; i--) {
+      while (index >= 0 && values[index] >= i) {
+        current = values[index--];
+      }
+      result[i] = current;
+    }
+  } else {
+    let index = 0;
+    for (let i = 0; i < size; i++) {
+      while (index < values.length && values[index] <= i) {
+        current = values[index++];
+      }
+      result[i] = current;
+    }
+  }
+  return result;
+};
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+const ParseErrorTypeId = exports.ParseErrorTypeId = /*#__PURE__*/Symbol.for("effect/Cron/errors/ParseError");
+/**
+ * Represents a checked exception which occurs when decoding fails.
+ *
+ * @since 2.0.0
+ * @category models
+ */
+class ParseError extends /*#__PURE__*/Data.TaggedError("CronParseError") {
+  /**
+   * @since 2.0.0
+   */
+  [ParseErrorTypeId] = ParseErrorTypeId;
+}
+/**
+ * Returns `true` if the specified value is an `ParseError`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category guards
+ */
+exports.ParseError = ParseError;
+const isParseError = u => (0, _Predicate.hasProperty)(u, ParseErrorTypeId);
+/**
+ * Parses a cron expression into a `Cron` instance.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Cron, Either } from "effect"
+ *
+ * // At 04:00 on every day-of-month from 8 through 14.
+ * assert.deepStrictEqual(Cron.parse("0 0 4 8-14 * *"), Either.right(Cron.make({
+ *   seconds: [0],
+ *   minutes: [0],
+ *   hours: [4],
+ *   days: [8, 9, 10, 11, 12, 13, 14],
+ *   months: [],
+ *   weekdays: []
+ * })))
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.isParseError = isParseError;
+const parse = (cron, tz) => {
+  const segments = cron.split(" ").filter(String.isNonEmpty);
+  if (segments.length !== 5 && segments.length !== 6) {
+    return Either.left(new ParseError({
+      message: `Invalid number of segments in cron expression`,
+      input: cron
+    }));
+  }
+  if (segments.length === 5) {
+    segments.unshift("0");
+  }
+  const [seconds, minutes, hours, days, months, weekdays] = segments;
+  const zone = tz === undefined || dateTime.isTimeZone(tz) ? Either.right(tz) : Either.fromOption(dateTime.zoneFromString(tz), () => new ParseError({
+    message: `Invalid time zone in cron expression`,
+    input: tz
+  }));
+  return Either.all({
+    tz: zone,
+    seconds: parseSegment(seconds, secondOptions),
+    minutes: parseSegment(minutes, minuteOptions),
+    hours: parseSegment(hours, hourOptions),
+    days: parseSegment(days, dayOptions),
+    months: parseSegment(months, monthOptions),
+    weekdays: parseSegment(weekdays, weekdayOptions)
+  }).pipe(Either.map(make));
+};
+/**
+ * Parses a cron expression into a `Cron` instance.
+ *
+ * **Details**
+ *
+ * This function takes a cron expression as a string and attempts to parse it
+ * into a `Cron` instance. If the expression is valid, the resulting `Cron`
+ * instance will represent the schedule defined by the cron expression.
+ *
+ * If the expression is invalid, the function throws a `ParseError`.
+ *
+ * You can optionally provide a time zone (`tz`) to interpret the cron
+ * expression in a specific time zone. If no time zone is provided, the cron
+ * expression will use the default time zone.
+ *
+ * @example
+ * ```ts
+ * import { Cron } from "effect"
+ *
+ * // At 04:00 on every day-of-month from 8 through 14.
+ * console.log(Cron.unsafeParse("0 4 8-14 * *"))
+ * // Output:
+ * // {
+ * //   _id: 'Cron',
+ * //   tz: { _id: 'Option', _tag: 'None' },
+ * //   seconds: [ 0 ],
+ * //   minutes: [ 0 ],
+ * //   hours: [ 4 ],
+ * //   days: [
+ * //      8,  9, 10, 11,
+ * //     12, 13, 14
+ * //   ],
+ * //   months: [],
+ * //   weekdays: []
+ * // }
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.parse = parse;
+const unsafeParse = (cron, tz) => Either.getOrThrowWith(parse(cron, tz), _Function.identity);
+/**
+ * Checks if a given `Date` falls within an active `Cron` time window.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Cron, Either } from "effect"
+ *
+ * const cron = Either.getOrThrow(Cron.parse("0 4 8-14 * *"))
+ * assert.deepStrictEqual(Cron.match(cron, new Date("2021-01-08 04:00:00")), true)
+ * assert.deepStrictEqual(Cron.match(cron, new Date("2021-01-08 05:00:00")), false)
+ * ```
+ *
+ * @throws `IllegalArgumentException` if the given `DateTime.Input` is invalid.
+ *
+ * @since 2.0.0
+ */
+exports.unsafeParse = unsafeParse;
+const match = (cron, date) => {
+  const parts = dateTime.unsafeMakeZoned(date, {
+    timeZone: Option.getOrUndefined(cron.tz)
+  }).pipe(dateTime.toParts);
+  if (cron.seconds.size !== 0 && !cron.seconds.has(parts.seconds)) {
+    return false;
+  }
+  if (cron.minutes.size !== 0 && !cron.minutes.has(parts.minutes)) {
+    return false;
+  }
+  if (cron.hours.size !== 0 && !cron.hours.has(parts.hours)) {
+    return false;
+  }
+  if (cron.months.size !== 0 && !cron.months.has(parts.month)) {
+    return false;
+  }
+  if (cron.days.size === 0 && cron.weekdays.size === 0) {
+    return true;
+  }
+  if (cron.weekdays.size === 0) {
+    return cron.days.has(parts.day);
+  }
+  if (cron.days.size === 0) {
+    return cron.weekdays.has(parts.weekDay);
+  }
+  return cron.days.has(parts.day) || cron.weekdays.has(parts.weekDay);
+};
+exports.match = match;
+const daysInMonth = date => new Date(Date.UTC(date.getUTCFullYear(), date.getUTCMonth() + 1, 0)).getUTCDate();
+/**
+ * Returns the next run `Date` for the given `Cron` instance.
+ *
+ * Uses the current time as a starting point if no value is provided for `startFrom`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Cron, Either } from "effect"
+ *
+ * const after = new Date("2021-01-01 00:00:00")
+ * const cron = Either.getOrThrow(Cron.parse("0 4 8-14 * *"))
+ * assert.deepStrictEqual(Cron.next(cron, after), new Date("2021-01-08 04:00:00"))
+ * ```
+ *
+ * @throws `IllegalArgumentException` if the given `DateTime.Input` is invalid.
+ * @throws `Error` if the next run date cannot be found within 10,000 iterations.
+ *
+ * @since 2.0.0
+ */
+const next = (cron, startFrom) => {
+  return stepCron(cron, startFrom, "next");
+};
+/**
+ * Returns the previous run `Date` for the given `Cron` instance.
+ *
+ * Uses the current time as a starting point if no value is provided for `startFrom`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Cron, Either } from "effect"
+ *
+ * const before = new Date("2021-01-15 00:00:00")
+ * const cron = Either.getOrThrow(Cron.parse("0 4 8-14 * *"))
+ * assert.deepStrictEqual(Cron.prev(cron, before), new Date("2021-01-14 04:00:00"))
+ * ```
+ *
+ * @throws `IllegalArgumentException` if the given `DateTime.Input` is invalid.
+ * @throws `Error` if the previous run date cannot be found within 10,000 iterations.
+ *
+ * @since 3.20.0
+ */
+exports.next = next;
+const prev = (cron, startFrom) => {
+  return stepCron(cron, startFrom, "prev");
+};
+/** @internal */
+exports.prev = prev;
+const stepCron = (cron, startFrom, direction) => {
+  const tz = Option.getOrUndefined(cron.tz);
+  const zoned = dateTime.unsafeMakeZoned(startFrom ?? new Date(), {
+    timeZone: tz
+  });
+  const prev = direction === "prev";
+  const tick = prev ? -1 : 1;
+  const table = cron[direction];
+  const boundary = prev ? cron.last : cron.first;
+  const needsStep = prev ? (next, current) => next < current : (next, current) => next > current;
+  const utc = tz !== undefined && dateTime.isTimeZoneNamed(tz) && tz.id === "UTC";
+  const adjustDst = utc ? _Function.constVoid : current => {
+    const adjusted = dateTime.unsafeMakeZoned(current, {
+      timeZone: zoned.zone,
+      adjustForTimeZone: true,
+      disambiguation: prev ? "later" : undefined
+    }).pipe(dateTime.toDate);
+    const drift = current.getTime() - adjusted.getTime();
+    if (prev ? drift !== 0 : drift > 0) {
+      current.setTime(adjusted.getTime());
+    }
+  };
+  const result = dateTime.mutate(zoned, current => {
+    current.setUTCSeconds(current.getUTCSeconds() + tick, 0);
+    for (let i = 0; i < 10_000; i++) {
+      if (cron.seconds.size !== 0) {
+        const currentSecond = current.getUTCSeconds();
+        const nextSecond = table.second[currentSecond];
+        if (nextSecond === undefined) {
+          current.setUTCMinutes(current.getUTCMinutes() + tick, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+        if (needsStep(nextSecond, currentSecond)) {
+          current.setUTCSeconds(nextSecond);
+          adjustDst(current);
+          continue;
+        }
+      }
+      if (cron.minutes.size !== 0) {
+        const currentMinute = current.getUTCMinutes();
+        const nextMinute = table.minute[currentMinute];
+        if (nextMinute === undefined) {
+          current.setUTCHours(current.getUTCHours() + tick, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+        if (needsStep(nextMinute, currentMinute)) {
+          current.setUTCMinutes(nextMinute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+      }
+      if (cron.hours.size !== 0) {
+        const currentHour = current.getUTCHours();
+        const nextHour = table.hour[currentHour];
+        if (nextHour === undefined) {
+          current.setUTCDate(current.getUTCDate() + tick);
+          current.setUTCHours(boundary.hour, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+        if (needsStep(nextHour, currentHour)) {
+          current.setUTCHours(nextHour, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+      }
+      if (cron.weekdays.size !== 0 || cron.days.size !== 0) {
+        let a = prev ? -Infinity : Infinity;
+        let b = prev ? -Infinity : Infinity;
+        if (cron.weekdays.size !== 0) {
+          const currentWeekday = current.getUTCDay();
+          const nextWeekday = table.weekday[currentWeekday];
+          if (nextWeekday === undefined) {
+            a = prev ? currentWeekday - 7 + boundary.weekday : 7 - currentWeekday + boundary.weekday;
+          } else {
+            a = nextWeekday - currentWeekday;
+          }
+        }
+        // Only check day-of-month if weekday constraint not already satisfied (they're OR'd)
+        if (cron.days.size !== 0 && a !== 0) {
+          const currentDay = current.getUTCDate();
+          const nextDay = table.day[currentDay];
+          if (nextDay === undefined) {
+            if (prev) {
+              // When wrapping to previous month, calculate days back:
+              // Current day offset + gap from end of prev month to target day
+              // Example: June 3 → May 20 with boundary.day=20: -(3 + (31 - 20)) = -14
+              const prevMonthDays = daysInMonth(new Date(Date.UTC(current.getUTCFullYear(), current.getUTCMonth(), 0)));
+              b = -(currentDay + (prevMonthDays - boundary.day));
+            } else {
+              b = daysInMonth(current) - currentDay + boundary.day;
+            }
+          } else {
+            b = nextDay - currentDay;
+          }
+        }
+        const addDays = prev ? Math.max(a, b) : Math.min(a, b);
+        if (addDays !== 0) {
+          current.setUTCDate(current.getUTCDate() + addDays);
+          current.setUTCHours(boundary.hour, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+      }
+      if (cron.months.size !== 0) {
+        const currentMonth = current.getUTCMonth() + 1;
+        const nextMonth = table.month[currentMonth];
+        const clampBoundaryDay = targetMonthIndex => {
+          if (cron.days.size !== 0) {
+            return boundary.day;
+          }
+          const maxDayInMonth = daysInMonth(new Date(Date.UTC(current.getUTCFullYear(), targetMonthIndex, 1)));
+          return Math.min(boundary.day, maxDayInMonth);
+        };
+        if (nextMonth === undefined) {
+          current.setUTCFullYear(current.getUTCFullYear() + tick);
+          current.setUTCMonth(boundary.month, clampBoundaryDay(boundary.month));
+          current.setUTCHours(boundary.hour, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+        if (needsStep(nextMonth, currentMonth)) {
+          const targetMonthIndex = nextMonth - 1;
+          current.setUTCMonth(targetMonthIndex, clampBoundaryDay(targetMonthIndex));
+          current.setUTCHours(boundary.hour, boundary.minute, boundary.second);
+          adjustDst(current);
+          continue;
+        }
+      }
+      return;
+    }
+    throw new Error("Unable to find next cron date");
+  });
+  return dateTime.toDateUtc(result);
+};
+/**
+ * Returns an `IterableIterator` which yields the sequence of `Date`s that match the `Cron` instance.
+ *
+ * @since 2.0.0
+ */
+const sequence = function* (cron, startFrom) {
+  while (true) {
+    yield startFrom = next(cron, startFrom);
+  }
+};
+/**
+ * Returns an `IterableIterator` which yields the sequence of `Date`s that match the `Cron` instance,
+ * in reverse direction.
+ *
+ * @since 3.20.0
+ */
+exports.sequence = sequence;
+const sequenceReverse = function* (cron, startFrom) {
+  while (true) {
+    yield startFrom = prev(cron, startFrom);
+  }
+};
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+exports.sequenceReverse = sequenceReverse;
+const Equivalence = exports.Equivalence = /*#__PURE__*/equivalence.make((self, that) => restrictionsEquals(self.seconds, that.seconds) && restrictionsEquals(self.minutes, that.minutes) && restrictionsEquals(self.hours, that.hours) && restrictionsEquals(self.days, that.days) && restrictionsEquals(self.months, that.months) && restrictionsEquals(self.weekdays, that.weekdays));
+const restrictionsArrayEquals = /*#__PURE__*/equivalence.array(equivalence.number);
+const restrictionsEquals = (self, that) => restrictionsArrayEquals(Arr.fromIterable(self), Arr.fromIterable(that));
+/**
+ * Checks if two `Cron`s are equal.
+ *
+ * @since 2.0.0
+ * @category predicates
+ */
+const equals = exports.equals = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => Equivalence(self, that));
+const secondOptions = {
+  min: 0,
+  max: 59
+};
+const minuteOptions = {
+  min: 0,
+  max: 59
+};
+const hourOptions = {
+  min: 0,
+  max: 23
+};
+const dayOptions = {
+  min: 1,
+  max: 31
+};
+const monthOptions = {
+  min: 1,
+  max: 12,
+  aliases: {
+    jan: 1,
+    feb: 2,
+    mar: 3,
+    apr: 4,
+    may: 5,
+    jun: 6,
+    jul: 7,
+    aug: 8,
+    sep: 9,
+    oct: 10,
+    nov: 11,
+    dec: 12
+  }
+};
+const weekdayOptions = {
+  min: 0,
+  max: 6,
+  aliases: {
+    sun: 0,
+    mon: 1,
+    tue: 2,
+    wed: 3,
+    thu: 4,
+    fri: 5,
+    sat: 6
+  }
+};
+const parseSegment = (input, options) => {
+  const capacity = options.max - options.min + 1;
+  const values = new Set();
+  const fields = input.split(",");
+  for (const field of fields) {
+    const [raw, step] = splitStep(field);
+    if (raw === "*" && step === undefined) {
+      return Either.right(new Set());
+    }
+    if (step !== undefined) {
+      if (!Number.isInteger(step)) {
+        return Either.left(new ParseError({
+          message: `Expected step value to be a positive integer`,
+          input
+        }));
+      }
+      if (step < 1) {
+        return Either.left(new ParseError({
+          message: `Expected step value to be greater than 0`,
+          input
+        }));
+      }
+      if (step > options.max) {
+        return Either.left(new ParseError({
+          message: `Expected step value to be less than ${options.max}`,
+          input
+        }));
+      }
+    }
+    if (raw === "*") {
+      for (let i = options.min; i <= options.max; i += step ?? 1) {
+        values.add(i);
+      }
+    } else {
+      const [left, right] = splitRange(raw, options.aliases);
+      if (!Number.isInteger(left)) {
+        return Either.left(new ParseError({
+          message: `Expected a positive integer`,
+          input
+        }));
+      }
+      if (left < options.min || left > options.max) {
+        return Either.left(new ParseError({
+          message: `Expected a value between ${options.min} and ${options.max}`,
+          input
+        }));
+      }
+      if (right === undefined) {
+        values.add(left);
+      } else {
+        if (!Number.isInteger(right)) {
+          return Either.left(new ParseError({
+            message: `Expected a positive integer`,
+            input
+          }));
+        }
+        if (right < options.min || right > options.max) {
+          return Either.left(new ParseError({
+            message: `Expected a value between ${options.min} and ${options.max}`,
+            input
+          }));
+        }
+        if (left > right) {
+          return Either.left(new ParseError({
+            message: `Invalid value range`,
+            input
+          }));
+        }
+        for (let i = left; i <= right; i += step ?? 1) {
+          values.add(i);
+        }
+      }
+    }
+    if (values.size >= capacity) {
+      return Either.right(new Set());
+    }
+  }
+  return Either.right(values);
+};
+const splitStep = input => {
+  const seperator = input.indexOf("/");
+  if (seperator !== -1) {
+    return [input.slice(0, seperator), Number(input.slice(seperator + 1))];
+  }
+  return [input, undefined];
+};
+const splitRange = (input, aliases) => {
+  const seperator = input.indexOf("-");
+  if (seperator !== -1) {
+    return [aliasOrValue(input.slice(0, seperator), aliases), aliasOrValue(input.slice(seperator + 1), aliases)];
+  }
+  return [aliasOrValue(input, aliases), undefined];
+};
+function aliasOrValue(field, aliases) {
+  return aliases?.[field.toLocaleLowerCase()] ?? Number(field);
+}
+//# sourceMappingURL=Cron.js.map

backend/node_modules/effect/dist/cjs/Cron.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Cron.js","names":["Arr","_interopRequireWildcard","require","Data","Either","Equal","equivalence","_Function","Hash","_Inspectable","dateTime","N","Option","_Pipeable","_Predicate","String","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","TypeId","exports","Symbol","for","CronProto","symbol","that","isCron","equals","pipe","hash","tz","combine","array","fromIterable","seconds","minutes","hours","days","months","weekdays","cached","toString","format","toJSON","_id","NodeInspectSymbol","pipeArguments","arguments","u","hasProperty","make","values","create","Set","sort","Order","fromNullable","Array","from","first","second","minute","hour","day","month","weekday","last","length","next","lookupTable","prev","size","dir","result","fill","undefined","current","index","ParseErrorTypeId","ParseError","TaggedError","isParseError","parse","cron","segments","split","filter","isNonEmpty","left","message","input","unshift","zone","isTimeZone","right","fromOption","zoneFromString","all","parseSegment","secondOptions","minuteOptions","hourOptions","dayOptions","monthOptions","weekdayOptions","map","unsafeParse","getOrThrowWith","identity","match","date","parts","unsafeMakeZoned","timeZone","getOrUndefined","toParts","weekDay","daysInMonth","Date","UTC","getUTCFullYear","getUTCMonth","getUTCDate","startFrom","stepCron","direction","zoned","tick","table","boundary","needsStep","utc","isTimeZoneNamed","id","adjustDst","constVoid","adjusted","adjustForTimeZone","disambiguation","toDate","drift","getTime","setTime","mutate","setUTCSeconds","getUTCSeconds","currentSecond","nextSecond","setUTCMinutes","getUTCMinutes","currentMinute","nextMinute","setUTCHours","getUTCHours","currentHour","nextHour","setUTCDate","a","Infinity","b","currentWeekday","getUTCDay","nextWeekday","currentDay","nextDay","prevMonthDays","addDays","Math","max","min","currentMonth","nextMonth","clampBoundaryDay","targetMonthIndex","maxDayInMonth","setUTCFullYear","setUTCMonth","Error","toDateUtc","sequence","sequenceReverse","Equivalence","self","restrictionsEquals","restrictionsArrayEquals","number","dual","aliases","jan","feb","mar","apr","may","jun","jul","aug","sep","oct","nov","dec","sun","mon","tue","wed","thu","fri","sat","options","capacity","fields","field","raw","step","splitStep","Number","isInteger","add","splitRange","seperator","indexOf","slice","aliasOrValue","toLocaleLowerCase"],"sources":["../../src/Cron.ts"],"sourcesContent":[null],"mappings":";;;;;;AAGA,IAAAA,GAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,IAAA,GAAAF,uBAAA,CAAAC,OAAA;AAEA,IAAAE,MAAA,GAAAH,uBAAA,CAAAC,OAAA;AACA,IAAAG,KAAA,GAAAJ,uBAAA,CAAAC,OAAA;AACA,IAAAI,WAAA,GAAAL,uBAAA,CAAAC,OAAA;AACA,IAAAK,SAAA,GAAAL,OAAA;AACA,IAAAM,IAAA,GAAAP,uBAAA,CAAAC,OAAA;AACA,IAAAO,YAAA,GAAAP,OAAA;AACA,IAAAQ,QAAA,GAAAT,uBAAA,CAAAC,OAAA;AACA,IAAAS,CAAA,GAAAV,uBAAA,CAAAC,OAAA;AACA,IAAAU,MAAA,GAAAX,uBAAA,CAAAC,OAAA;AACA,IAAAW,SAAA,GAAAX,OAAA;AACA,IAAAY,UAAA,GAAAZ,OAAA;AACA,IAAAa,MAAA,GAAAd,uBAAA,CAAAC,OAAA;AAAqC,SAAAD,wBAAAe,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAjB,uBAAA,YAAAA,CAAAe,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAjBrC;;;;AAoBA;;;;AAIO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,gBAAkBE,MAAM,CAACC,GAAG,CAAC,aAAa,CAAC;AA2D9D,MAAMC,SAAS,GAAG;EAChB,CAACJ,MAAM,GAAGA,MAAM;EAChB,CAAC9B,KAAK,CAACmC,MAAM,EAAcC,IAAa;IACtC,OAAOC,MAAM,CAACD,IAAI,CAAC,IAAIE,MAAM,CAAC,IAAI,EAAEF,IAAI,CAAC;EAC3C,CAAC;EACD,CAACjC,IAAI,CAACgC,MAAM,IAAC;IACX,OAAO,IAAAI,cAAI,EACTpC,IAAI,CAACqC,IAAI,CAAC,IAAI,CAACC,EAAE,CAAC,EAClBtC,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACC,OAAO,CAAC,CAAC,CAAC,EACxD1C,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACE,OAAO,CAAC,CAAC,CAAC,EACxD3C,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACG,KAAK,CAAC,CAAC,CAAC,EACtD5C,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACI,IAAI,CAAC,CAAC,CAAC,EACrD7C,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACK,MAAM,CAAC,CAAC,CAAC,EACvD9C,IAAI,CAACuC,OAAO,CAACvC,IAAI,CAACwC,KAAK,CAAChD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACM,QAAQ,CAAC,CAAC,CAAC,EACzD/C,IAAI,CAACgD,MAAM,CAAC,IAAI,CAAC,CAClB;EACH,CAAC;EACDC,QAAQA,CAAA;IACN,OAAO,IAAAC,mBAAM,EAAC,IAAI,CAACC,MAAM,EAAE,CAAC;EAC9B,CAAC;EACDA,MAAMA,CAAA;IACJ,OAAO;MACLC,GAAG,EAAE,MAAM;MACXd,EAAE,EAAE,IAAI,CAACA,EAAE;MACXI,OAAO,EAAElD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACC,OAAO,CAAC;MACvCC,OAAO,EAAEnD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACE,OAAO,CAAC;MACvCC,KAAK,EAAEpD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACG,KAAK,CAAC;MACnCC,IAAI,EAAErD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACI,IAAI,CAAC;MACjCC,MAAM,EAAEtD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACK,MAAM,CAAC;MACrCC,QAAQ,EAAEvD,GAAG,CAACiD,YAAY,CAAC,IAAI,CAACM,QAAQ;KACzC;EACH,CAAC;EACD,CAACM,8BAAiB,IAAC;IACjB,OAAO,IAAI,CAACF,MAAM,EAAE;EACtB,CAAC;EACDf,IAAIA,CAAA;IACF,OAAO,IAAAkB,uBAAa,EAAC,IAAI,EAAEC,SAAS,CAAC;EACvC;CACD;AAED;;;;;;AAMO,MAAMrB,MAAM,GAAIsB,CAAU,IAAgB,IAAAC,sBAAW,EAACD,CAAC,EAAE7B,MAAM,CAAC;AAEvE;;;;;;AAAAC,OAAA,CAAAM,MAAA,GAAAA,MAAA;AAMO,MAAMwB,IAAI,GAAIC,MAQpB,IAAU;EACT,MAAM7C,CAAC,GAAkBU,MAAM,CAACoC,MAAM,CAAC7B,SAAS,CAAC;EACjDjB,CAAC,CAAC4B,OAAO,GAAG,IAAImB,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAACjB,OAAO,IAAI,CAAC,CAAC,CAAC,EAAEvC,CAAC,CAAC4D,KAAK,CAAC,CAAC;EAC7DjD,CAAC,CAAC6B,OAAO,GAAG,IAAIkB,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAAChB,OAAO,EAAExC,CAAC,CAAC4D,KAAK,CAAC,CAAC;EACtDjD,CAAC,CAAC8B,KAAK,GAAG,IAAIiB,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAACf,KAAK,EAAEzC,CAAC,CAAC4D,KAAK,CAAC,CAAC;EAClDjD,CAAC,CAAC+B,IAAI,GAAG,IAAIgB,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAACd,IAAI,EAAE1C,CAAC,CAAC4D,KAAK,CAAC,CAAC;EAChDjD,CAAC,CAACgC,MAAM,GAAG,IAAIe,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAACb,MAAM,EAAE3C,CAAC,CAAC4D,KAAK,CAAC,CAAC;EACpDjD,CAAC,CAACiC,QAAQ,GAAG,IAAIc,GAAG,CAACrE,GAAG,CAACsE,IAAI,CAACH,MAAM,CAACZ,QAAQ,EAAE5C,CAAC,CAAC4D,KAAK,CAAC,CAAC;EACxDjD,CAAC,CAACwB,EAAE,GAAGlC,MAAM,CAAC4D,YAAY,CAACL,MAAM,CAACrB,EAAE,CAAC;EAErC,MAAMI,OAAO,GAAGuB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAAC4B,OAAO,CAAC;EACrC,MAAMC,OAAO,GAAGsB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAAC6B,OAAO,CAAC;EACrC,MAAMC,KAAK,GAAGqB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAAC8B,KAAK,CAAC;EACjC,MAAMC,IAAI,GAAGoB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAAC+B,IAAI,CAAC;EAC/B,MAAMC,MAAM,GAAGmB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAACgC,MAAM,CAAC;EACnC,MAAMC,QAAQ,GAAGkB,KAAK,CAACC,IAAI,CAACpD,CAAC,CAACiC,QAAQ,CAAC;EAEvCjC,CAAC,CAACqD,KAAK,GAAG;IACRC,MAAM,EAAE1B,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IACvB2B,MAAM,EAAE1B,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IACvB2B,IAAI,EAAE1B,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACnB2B,GAAG,EAAE1B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjB2B,KAAK,EAAE,CAAC1B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAC3B2B,OAAO,EAAE1B,QAAQ,CAAC,CAAC,CAAC,IAAI;GACzB;EAEDjC,CAAC,CAAC4D,IAAI,GAAG;IACPN,MAAM,EAAE1B,OAAO,CAACA,OAAO,CAACiC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;IACzCN,MAAM,EAAE1B,OAAO,CAACA,OAAO,CAACgC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;IACzCL,IAAI,EAAE1B,KAAK,CAACA,KAAK,CAAC+B,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;IACnCJ,GAAG,EAAE1B,IAAI,CAACA,IAAI,CAAC8B,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE;IAChCH,KAAK,EAAE,CAAC1B,MAAM,CAACA,MAAM,CAAC6B,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;IAC5CF,OAAO,EAAE1B,QAAQ,CAACA,QAAQ,CAAC4B,MAAM,GAAG,CAAC,CAAC,IAAI;GAC3C;EAED7D,CAAC,CAAC8D,IAAI,GAAG;IACPR,MAAM,EAAES,WAAW,CAACnC,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC;IACxC2B,MAAM,EAAEQ,WAAW,CAAClC,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC;IACxC2B,IAAI,EAAEO,WAAW,CAACjC,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC;IACpC2B,GAAG,EAAEM,WAAW,CAAChC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC;IAClC2B,KAAK,EAAEK,WAAW,CAAC/B,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC;IACtC2B,OAAO,EAAEI,WAAW,CAAC9B,QAAQ,EAAE,CAAC,EAAE,MAAM;GACzC;EAEDjC,CAAC,CAACgE,IAAI,GAAG;IACPV,MAAM,EAAES,WAAW,CAACnC,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC;IACxC2B,MAAM,EAAEQ,WAAW,CAAClC,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC;IACxC2B,IAAI,EAAEO,WAAW,CAACjC,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC;IACpC2B,GAAG,EAAEM,WAAW,CAAChC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC;IAClC2B,KAAK,EAAEK,WAAW,CAAC/B,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC;IACtC2B,OAAO,EAAEI,WAAW,CAAC9B,QAAQ,EAAE,CAAC,EAAE,MAAM;GACzC;EAED,OAAOjC,CAAC;AACV,CAAC;AAAAc,OAAA,CAAA8B,IAAA,GAAAA,IAAA;AAED,MAAMmB,WAAW,GAAGA,CAClBlB,MAA6B,EAC7BoB,IAAY,EACZC,GAAoB,KACS;EAC7B,MAAMC,MAAM,GAAG,IAAIhB,KAAK,CAACc,IAAI,CAAC,CAACG,IAAI,CAACC,SAAS,CAAC;EAC9C,IAAIxB,MAAM,CAACgB,MAAM,KAAK,CAAC,EAAE;IACvB,OAAOM,MAAM;EACf;EAEA,IAAIG,OAAO,GAAuBD,SAAS;EAE3C,IAAIH,GAAG,KAAK,MAAM,EAAE;IAClB,IAAIK,KAAK,GAAG1B,MAAM,CAACgB,MAAM,GAAG,CAAC;IAC7B,KAAK,IAAI5D,CAAC,GAAGgE,IAAI,GAAG,CAAC,EAAEhE,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;MAClC,OAAOsE,KAAK,IAAI,CAAC,IAAI1B,MAAM,CAAC0B,KAAK,CAAC,IAAItE,CAAC,EAAE;QACvCqE,OAAO,GAAGzB,MAAM,CAAC0B,KAAK,EAAE,CAAC;MAC3B;MACAJ,MAAM,CAAClE,CAAC,CAAC,GAAGqE,OAAO;IACrB;EACF,CAAC,MAAM;IACL,IAAIC,KAAK,GAAG,CAAC;IACb,KAAK,IAAItE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgE,IAAI,EAAEhE,CAAC,EAAE,EAAE;MAC7B,OAAOsE,KAAK,GAAG1B,MAAM,CAACgB,MAAM,IAAIhB,MAAM,CAAC0B,KAAK,CAAC,IAAItE,CAAC,EAAE;QAClDqE,OAAO,GAAGzB,MAAM,CAAC0B,KAAK,EAAE,CAAC;MAC3B;MACAJ,MAAM,CAAClE,CAAC,CAAC,GAAGqE,OAAO;IACrB;EACF;EAEA,OAAOH,MAAM;AACf,CAAC;AAED;;;;AAIO,MAAMK,gBAAgB,GAAA1D,OAAA,CAAA0D,gBAAA,gBAAkBzD,MAAM,CAACC,GAAG,CAAC,+BAA+B,CAAC;AAQ1F;;;;;;AAMM,MAAOyD,UAAW,sBAAQ5F,IAAI,CAAC6F,WAAW,CAAC,gBAAgB,CAG/D;EACA;;;EAGS,CAACF,gBAAgB,IAAIA,gBAAgB;;AAGhD;;;;;;AAAA1D,OAAA,CAAA2D,UAAA,GAAAA,UAAA;AAMO,MAAME,YAAY,GAAIjC,CAAU,IAAsB,IAAAC,sBAAW,EAACD,CAAC,EAAE8B,gBAAgB,CAAC;AAE7F;;;;;;;;;;;;;;;;;;;;;;AAAA1D,OAAA,CAAA6D,YAAA,GAAAA,YAAA;AAsBO,MAAMC,KAAK,GAAGA,CAACC,IAAY,EAAErD,EAA+B,KAAqC;EACtG,MAAMsD,QAAQ,GAAGD,IAAI,CAACE,KAAK,CAAC,GAAG,CAAC,CAACC,MAAM,CAACvF,MAAM,CAACwF,UAAU,CAAC;EAC1D,IAAIH,QAAQ,CAACjB,MAAM,KAAK,CAAC,IAAIiB,QAAQ,CAACjB,MAAM,KAAK,CAAC,EAAE;IAClD,OAAO/E,MAAM,CAACoG,IAAI,CAChB,IAAIT,UAAU,CAAC;MACbU,OAAO,EAAE,+CAA+C;MACxDC,KAAK,EAAEP;KACR,CAAC,CACH;EACH;EAEA,IAAIC,QAAQ,CAACjB,MAAM,KAAK,CAAC,EAAE;IACzBiB,QAAQ,CAACO,OAAO,CAAC,GAAG,CAAC;EACvB;EAEA,MAAM,CAACzD,OAAO,EAAEC,OAAO,EAAEC,KAAK,EAAEC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,CAAC,GAAG6C,QAAQ;EAClE,MAAMQ,IAAI,GAAG9D,EAAE,KAAK6C,SAAS,IAAIjF,QAAQ,CAACmG,UAAU,CAAC/D,EAAE,CAAC,GACtD1C,MAAM,CAAC0G,KAAK,CAAChE,EAAE,CAAC,GAChB1C,MAAM,CAAC2G,UAAU,CAACrG,QAAQ,CAACsG,cAAc,CAAClE,EAAE,CAAC,EAAE,MAC7C,IAAIiD,UAAU,CAAC;IACbU,OAAO,EAAE,sCAAsC;IAC/CC,KAAK,EAAE5D;GACR,CAAC,CAAC;EAEP,OAAO1C,MAAM,CAAC6G,GAAG,CAAC;IAChBnE,EAAE,EAAE8D,IAAI;IACR1D,OAAO,EAAEgE,YAAY,CAAChE,OAAO,EAAEiE,aAAa,CAAC;IAC7ChE,OAAO,EAAE+D,YAAY,CAAC/D,OAAO,EAAEiE,aAAa,CAAC;IAC7ChE,KAAK,EAAE8D,YAAY,CAAC9D,KAAK,EAAEiE,WAAW,CAAC;IACvChE,IAAI,EAAE6D,YAAY,CAAC7D,IAAI,EAAEiE,UAAU,CAAC;IACpChE,MAAM,EAAE4D,YAAY,CAAC5D,MAAM,EAAEiE,YAAY,CAAC;IAC1ChE,QAAQ,EAAE2D,YAAY,CAAC3D,QAAQ,EAAEiE,cAAc;GAChD,CAAC,CAAC5E,IAAI,CAACxC,MAAM,CAACqH,GAAG,CAACvD,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA9B,OAAA,CAAA8D,KAAA,GAAAA,KAAA;AAwCO,MAAMwB,WAAW,GAAGA,CAACvB,IAAY,EAAErD,EAA+B,KACvE1C,MAAM,CAACuH,cAAc,CAACzB,KAAK,CAACC,IAAI,EAAErD,EAAE,CAAC,EAAE8E,kBAAQ,CAAC;AAElD;;;;;;;;;;;;;;;;;AAAAxF,OAAA,CAAAsF,WAAA,GAAAA,WAAA;AAiBO,MAAMG,KAAK,GAAGA,CAAC1B,IAAU,EAAE2B,IAA6B,KAAa;EAC1E,MAAMC,KAAK,GAAGrH,QAAQ,CAACsH,eAAe,CAACF,IAAI,EAAE;IAC3CG,QAAQ,EAAErH,MAAM,CAACsH,cAAc,CAAC/B,IAAI,CAACrD,EAAE;GACxC,CAAC,CAACF,IAAI,CAAClC,QAAQ,CAACyH,OAAO,CAAC;EAEzB,IAAIhC,IAAI,CAACjD,OAAO,CAACqC,IAAI,KAAK,CAAC,IAAI,CAACY,IAAI,CAACjD,OAAO,CAACvB,GAAG,CAACoG,KAAK,CAAC7E,OAAO,CAAC,EAAE;IAC/D,OAAO,KAAK;EACd;EAEA,IAAIiD,IAAI,CAAChD,OAAO,CAACoC,IAAI,KAAK,CAAC,IAAI,CAACY,IAAI,CAAChD,OAAO,CAACxB,GAAG,CAACoG,KAAK,CAAC5E,OAAO,CAAC,EAAE;IAC/D,OAAO,KAAK;EACd;EAEA,IAAIgD,IAAI,CAAC/C,KAAK,CAACmC,IAAI,KAAK,CAAC,IAAI,CAACY,IAAI,CAAC/C,KAAK,CAACzB,GAAG,CAACoG,KAAK,CAAC3E,KAAK,CAAC,EAAE;IACzD,OAAO,KAAK;EACd;EAEA,IAAI+C,IAAI,CAAC7C,MAAM,CAACiC,IAAI,KAAK,CAAC,IAAI,CAACY,IAAI,CAAC7C,MAAM,CAAC3B,GAAG,CAACoG,KAAK,CAAC/C,KAAK,CAAC,EAAE;IAC3D,OAAO,KAAK;EACd;EAEA,IAAImB,IAAI,CAAC9C,IAAI,CAACkC,IAAI,KAAK,CAAC,IAAIY,IAAI,CAAC5C,QAAQ,CAACgC,IAAI,KAAK,CAAC,EAAE;IACpD,OAAO,IAAI;EACb;EAEA,IAAIY,IAAI,CAAC5C,QAAQ,CAACgC,IAAI,KAAK,CAAC,EAAE;IAC5B,OAAOY,IAAI,CAAC9C,IAAI,CAAC1B,GAAG,CAACoG,KAAK,CAAChD,GAAG,CAAC;EACjC;EAEA,IAAIoB,IAAI,CAAC9C,IAAI,CAACkC,IAAI,KAAK,CAAC,EAAE;IACxB,OAAOY,IAAI,CAAC5C,QAAQ,CAAC5B,GAAG,CAACoG,KAAK,CAACK,OAAO,CAAC;EACzC;EAEA,OAAOjC,IAAI,CAAC9C,IAAI,CAAC1B,GAAG,CAACoG,KAAK,CAAChD,GAAG,CAAC,IAAIoB,IAAI,CAAC5C,QAAQ,CAAC5B,GAAG,CAACoG,KAAK,CAACK,OAAO,CAAC;AACrE,CAAC;AAAAhG,OAAA,CAAAyF,KAAA,GAAAA,KAAA;AAED,MAAMQ,WAAW,GAAIP,IAAU,IAC7B,IAAIQ,IAAI,CAACA,IAAI,CAACC,GAAG,CAACT,IAAI,CAACU,cAAc,EAAE,EAAEV,IAAI,CAACW,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAACC,UAAU,EAAE;AAEnF;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMtD,IAAI,GAAGA,CAACe,IAAU,EAAEwC,SAAmC,KAAU;EAC5E,OAAOC,QAAQ,CAACzC,IAAI,EAAEwC,SAAS,EAAE,MAAM,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAAAvG,OAAA,CAAAgD,IAAA,GAAAA,IAAA;AAoBO,MAAME,IAAI,GAAGA,CAACa,IAAU,EAAEwC,SAAmC,KAAU;EAC5E,OAAOC,QAAQ,CAACzC,IAAI,EAAEwC,SAAS,EAAE,MAAM,CAAC;AAC1C,CAAC;AAED;AAAAvG,OAAA,CAAAkD,IAAA,GAAAA,IAAA;AACA,MAAMsD,QAAQ,GAAGA,CAACzC,IAAU,EAAEwC,SAA8C,EAAEE,SAA0B,KAAU;EAChH,MAAM/F,EAAE,GAAGlC,MAAM,CAACsH,cAAc,CAAC/B,IAAI,CAACrD,EAAE,CAAC;EACzC,MAAMgG,KAAK,GAAGpI,QAAQ,CAACsH,eAAe,CAACW,SAAS,IAAI,IAAIL,IAAI,EAAE,EAAE;IAC9DL,QAAQ,EAAEnF;GACX,CAAC;EAEF,MAAMwC,IAAI,GAAGuD,SAAS,KAAK,MAAM;EACjC,MAAME,IAAI,GAAGzD,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;EAC1B,MAAM0D,KAAK,GAAG7C,IAAI,CAAC0C,SAAS,CAAC;EAC7B,MAAMI,QAAQ,GAAG3D,IAAI,GAAGa,IAAI,CAACjB,IAAI,GAAGiB,IAAI,CAACxB,KAAK;EAE9C,MAAMuE,SAAS,GAAG5D,IAAI,GAClB,CAACF,IAAY,EAAEQ,OAAe,KAAKR,IAAI,GAAGQ,OAAO,GACjD,CAACR,IAAY,EAAEQ,OAAe,KAAKR,IAAI,GAAGQ,OAAO;EAErD,MAAMuD,GAAG,GAAGrG,EAAE,KAAK6C,SAAS,IAAIjF,QAAQ,CAAC0I,eAAe,CAACtG,EAAE,CAAC,IAAIA,EAAE,CAACuG,EAAE,KAAK,KAAK;EAC/E,MAAMC,SAAS,GAAGH,GAAG,GAAGI,mBAAS,GAAI3D,OAAa,IAAI;IACpD,MAAM4D,QAAQ,GAAG9I,QAAQ,CAACsH,eAAe,CAACpC,OAAO,EAAE;MACjDqC,QAAQ,EAAEa,KAAK,CAAClC,IAAI;MACpB6C,iBAAiB,EAAE,IAAI;MACvBC,cAAc,EAAEpE,IAAI,GAAG,OAAO,GAAGK;KAClC,CAAC,CAAC/C,IAAI,CAAClC,QAAQ,CAACiJ,MAAM,CAAC;IAExB,MAAMC,KAAK,GAAGhE,OAAO,CAACiE,OAAO,EAAE,GAAGL,QAAQ,CAACK,OAAO,EAAE;IACpD,IAAIvE,IAAI,GAAGsE,KAAK,KAAK,CAAC,GAAGA,KAAK,GAAG,CAAC,EAAE;MAClChE,OAAO,CAACkE,OAAO,CAACN,QAAQ,CAACK,OAAO,EAAE,CAAC;IACrC;EACF,CAAC;EAED,MAAMpE,MAAM,GAAG/E,QAAQ,CAACqJ,MAAM,CAACjB,KAAK,EAAGlD,OAAO,IAAI;IAChDA,OAAO,CAACoE,aAAa,CAACpE,OAAO,CAACqE,aAAa,EAAE,GAAGlB,IAAI,EAAE,CAAC,CAAC;IAExD,KAAK,IAAIxH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,MAAM,EAAEA,CAAC,EAAE,EAAE;MAC/B,IAAI4E,IAAI,CAACjD,OAAO,CAACqC,IAAI,KAAK,CAAC,EAAE;QAC3B,MAAM2E,aAAa,GAAGtE,OAAO,CAACqE,aAAa,EAAE;QAC7C,MAAME,UAAU,GAAGnB,KAAK,CAACpE,MAAM,CAACsF,aAAa,CAAC;QAC9C,IAAIC,UAAU,KAAKxE,SAAS,EAAE;UAC5BC,OAAO,CAACwE,aAAa,CAACxE,OAAO,CAACyE,aAAa,EAAE,GAAGtB,IAAI,EAAEE,QAAQ,CAACrE,MAAM,CAAC;UACtE0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;QACA,IAAIsD,SAAS,CAACiB,UAAU,EAAED,aAAa,CAAC,EAAE;UACxCtE,OAAO,CAACoE,aAAa,CAACG,UAAU,CAAC;UACjCb,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;MACF;MAEA,IAAIO,IAAI,CAAChD,OAAO,CAACoC,IAAI,KAAK,CAAC,EAAE;QAC3B,MAAM+E,aAAa,GAAG1E,OAAO,CAACyE,aAAa,EAAE;QAC7C,MAAME,UAAU,GAAGvB,KAAK,CAACnE,MAAM,CAACyF,aAAa,CAAC;QAC9C,IAAIC,UAAU,KAAK5E,SAAS,EAAE;UAC5BC,OAAO,CAAC4E,WAAW,CAAC5E,OAAO,CAAC6E,WAAW,EAAE,GAAG1B,IAAI,EAAEE,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UACnF0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;QACA,IAAIsD,SAAS,CAACqB,UAAU,EAAED,aAAa,CAAC,EAAE;UACxC1E,OAAO,CAACwE,aAAa,CAACG,UAAU,EAAEtB,QAAQ,CAACrE,MAAM,CAAC;UAClD0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;MACF;MAEA,IAAIO,IAAI,CAAC/C,KAAK,CAACmC,IAAI,KAAK,CAAC,EAAE;QACzB,MAAMmF,WAAW,GAAG9E,OAAO,CAAC6E,WAAW,EAAE;QACzC,MAAME,QAAQ,GAAG3B,KAAK,CAAClE,IAAI,CAAC4F,WAAW,CAAC;QACxC,IAAIC,QAAQ,KAAKhF,SAAS,EAAE;UAC1BC,OAAO,CAACgF,UAAU,CAAChF,OAAO,CAAC8C,UAAU,EAAE,GAAGK,IAAI,CAAC;UAC/CnD,OAAO,CAAC4E,WAAW,CAACvB,QAAQ,CAACnE,IAAI,EAAEmE,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UACpE0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;QACA,IAAIsD,SAAS,CAACyB,QAAQ,EAAED,WAAW,CAAC,EAAE;UACpC9E,OAAO,CAAC4E,WAAW,CAACG,QAAQ,EAAE1B,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UAC/D0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;MACF;MAEA,IAAIO,IAAI,CAAC5C,QAAQ,CAACgC,IAAI,KAAK,CAAC,IAAIY,IAAI,CAAC9C,IAAI,CAACkC,IAAI,KAAK,CAAC,EAAE;QACpD,IAAIsF,CAAC,GAAWvF,IAAI,GAAG,CAACwF,QAAQ,GAAGA,QAAQ;QAC3C,IAAIC,CAAC,GAAWzF,IAAI,GAAG,CAACwF,QAAQ,GAAGA,QAAQ;QAE3C,IAAI3E,IAAI,CAAC5C,QAAQ,CAACgC,IAAI,KAAK,CAAC,EAAE;UAC5B,MAAMyF,cAAc,GAAGpF,OAAO,CAACqF,SAAS,EAAE;UAC1C,MAAMC,WAAW,GAAGlC,KAAK,CAAC/D,OAAO,CAAC+F,cAAc,CAAC;UACjD,IAAIE,WAAW,KAAKvF,SAAS,EAAE;YAC7BkF,CAAC,GAAGvF,IAAI,GACJ0F,cAAc,GAAG,CAAC,GAAG/B,QAAQ,CAAChE,OAAO,GACrC,CAAC,GAAG+F,cAAc,GAAG/B,QAAQ,CAAChE,OAAO;UAC3C,CAAC,MAAM;YACL4F,CAAC,GAAGK,WAAW,GAAGF,cAAc;UAClC;QACF;QAEA;QACA,IAAI7E,IAAI,CAAC9C,IAAI,CAACkC,IAAI,KAAK,CAAC,IAAIsF,CAAC,KAAK,CAAC,EAAE;UACnC,MAAMM,UAAU,GAAGvF,OAAO,CAAC8C,UAAU,EAAE;UACvC,MAAM0C,OAAO,GAAGpC,KAAK,CAACjE,GAAG,CAACoG,UAAU,CAAC;UACrC,IAAIC,OAAO,KAAKzF,SAAS,EAAE;YACzB,IAAIL,IAAI,EAAE;cACR;cACA;cACA;cACA,MAAM+F,aAAa,GAAGhD,WAAW,CAC/B,IAAIC,IAAI,CAACA,IAAI,CAACC,GAAG,CAAC3C,OAAO,CAAC4C,cAAc,EAAE,EAAE5C,OAAO,CAAC6C,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,CACvE;cACDsC,CAAC,GAAG,EAAEI,UAAU,IAAIE,aAAa,GAAGpC,QAAQ,CAAClE,GAAG,CAAC,CAAC;YACpD,CAAC,MAAM;cACLgG,CAAC,GAAG1C,WAAW,CAACzC,OAAO,CAAC,GAAGuF,UAAU,GAAGlC,QAAQ,CAAClE,GAAG;YACtD;UACF,CAAC,MAAM;YACLgG,CAAC,GAAGK,OAAO,GAAGD,UAAU;UAC1B;QACF;QAEA,MAAMG,OAAO,GAAGhG,IAAI,GAAGiG,IAAI,CAACC,GAAG,CAACX,CAAC,EAAEE,CAAC,CAAC,GAAGQ,IAAI,CAACE,GAAG,CAACZ,CAAC,EAAEE,CAAC,CAAC;QACtD,IAAIO,OAAO,KAAK,CAAC,EAAE;UACjB1F,OAAO,CAACgF,UAAU,CAAChF,OAAO,CAAC8C,UAAU,EAAE,GAAG4C,OAAO,CAAC;UAClD1F,OAAO,CAAC4E,WAAW,CAACvB,QAAQ,CAACnE,IAAI,EAAEmE,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UACpE0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;MACF;MAEA,IAAIO,IAAI,CAAC7C,MAAM,CAACiC,IAAI,KAAK,CAAC,EAAE;QAC1B,MAAMmG,YAAY,GAAG9F,OAAO,CAAC6C,WAAW,EAAE,GAAG,CAAC;QAC9C,MAAMkD,SAAS,GAAG3C,KAAK,CAAChE,KAAK,CAAC0G,YAAY,CAAC;QAC3C,MAAME,gBAAgB,GAAIC,gBAAwB,IAAY;UAC5D,IAAI1F,IAAI,CAAC9C,IAAI,CAACkC,IAAI,KAAK,CAAC,EAAE;YACxB,OAAO0D,QAAQ,CAAClE,GAAG;UACrB;UACA,MAAM+G,aAAa,GAAGzD,WAAW,CAAC,IAAIC,IAAI,CAACA,IAAI,CAACC,GAAG,CAAC3C,OAAO,CAAC4C,cAAc,EAAE,EAAEqD,gBAAgB,EAAE,CAAC,CAAC,CAAC,CAAC;UACpG,OAAON,IAAI,CAACE,GAAG,CAACxC,QAAQ,CAAClE,GAAG,EAAE+G,aAAa,CAAC;QAC9C,CAAC;QACD,IAAIH,SAAS,KAAKhG,SAAS,EAAE;UAC3BC,OAAO,CAACmG,cAAc,CAACnG,OAAO,CAAC4C,cAAc,EAAE,GAAGO,IAAI,CAAC;UACvDnD,OAAO,CAACoG,WAAW,CAAC/C,QAAQ,CAACjE,KAAK,EAAE4G,gBAAgB,CAAC3C,QAAQ,CAACjE,KAAK,CAAC,CAAC;UACrEY,OAAO,CAAC4E,WAAW,CAACvB,QAAQ,CAACnE,IAAI,EAAEmE,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UACpE0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;QACA,IAAIsD,SAAS,CAACyC,SAAS,EAAED,YAAY,CAAC,EAAE;UACtC,MAAMG,gBAAgB,GAAGF,SAAS,GAAG,CAAC;UACtC/F,OAAO,CAACoG,WAAW,CAACH,gBAAgB,EAAED,gBAAgB,CAACC,gBAAgB,CAAC,CAAC;UACzEjG,OAAO,CAAC4E,WAAW,CAACvB,QAAQ,CAACnE,IAAI,EAAEmE,QAAQ,CAACpE,MAAM,EAAEoE,QAAQ,CAACrE,MAAM,CAAC;UACpE0E,SAAS,CAAC1D,OAAO,CAAC;UAClB;QACF;MACF;MAEA;IACF;IAEA,MAAM,IAAIqG,KAAK,CAAC,+BAA+B,CAAC;EAClD,CAAC,CAAC;EAEF,OAAOvL,QAAQ,CAACwL,SAAS,CAACzG,MAAM,CAAC;AACnC,CAAC;AAED;;;;;AAKO,MAAM0G,QAAQ,GAAG,UAAAA,CAAUhG,IAAU,EAAEwC,SAAmC;EAC/E,OAAO,IAAI,EAAE;IACX,MAAMA,SAAS,GAAGvD,IAAI,CAACe,IAAI,EAAEwC,SAAS,CAAC;EACzC;AACF,CAAC;AAED;;;;;;AAAAvG,OAAA,CAAA+J,QAAA,GAAAA,QAAA;AAMO,MAAMC,eAAe,GAAG,UAAAA,CAAUjG,IAAU,EAAEwC,SAAmC;EACtF,OAAO,IAAI,EAAE;IACX,MAAMA,SAAS,GAAGrD,IAAI,CAACa,IAAI,EAAEwC,SAAS,CAAC;EACzC;AACF,CAAC;AAED;;;;AAAAvG,OAAA,CAAAgK,eAAA,GAAAA,eAAA;AAIO,MAAMC,WAAW,GAAAjK,OAAA,CAAAiK,WAAA,gBAAkC/L,WAAW,CAAC4D,IAAI,CAAC,CAACoI,IAAI,EAAE7J,IAAI,KACpF8J,kBAAkB,CAACD,IAAI,CAACpJ,OAAO,EAAET,IAAI,CAACS,OAAO,CAAC,IAC9CqJ,kBAAkB,CAACD,IAAI,CAACnJ,OAAO,EAAEV,IAAI,CAACU,OAAO,CAAC,IAC9CoJ,kBAAkB,CAACD,IAAI,CAAClJ,KAAK,EAAEX,IAAI,CAACW,KAAK,CAAC,IAC1CmJ,kBAAkB,CAACD,IAAI,CAACjJ,IAAI,EAAEZ,IAAI,CAACY,IAAI,CAAC,IACxCkJ,kBAAkB,CAACD,IAAI,CAAChJ,MAAM,EAAEb,IAAI,CAACa,MAAM,CAAC,IAC5CiJ,kBAAkB,CAACD,IAAI,CAAC/I,QAAQ,EAAEd,IAAI,CAACc,QAAQ,CAAC,CACjD;AAED,MAAMiJ,uBAAuB,gBAAGlM,WAAW,CAAC0C,KAAK,CAAC1C,WAAW,CAACmM,MAAM,CAAC;AACrE,MAAMF,kBAAkB,GAAGA,CAACD,IAAyB,EAAE7J,IAAyB,KAC9E+J,uBAAuB,CAACxM,GAAG,CAACiD,YAAY,CAACqJ,IAAI,CAAC,EAAEtM,GAAG,CAACiD,YAAY,CAACR,IAAI,CAAC,CAAC;AAEzE;;;;;;AAMO,MAAME,MAAM,GAAAP,OAAA,CAAAO,MAAA,gBAef,IAAA+J,cAAI,EAAC,CAAC,EAAE,CAACJ,IAAU,EAAE7J,IAAU,KAAc4J,WAAW,CAACC,IAAI,EAAE7J,IAAI,CAAC,CAAC;AAQzE,MAAM0E,aAAa,GAAmB;EACpCsE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE;CACN;AAED,MAAMpE,aAAa,GAAmB;EACpCqE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE;CACN;AAED,MAAMnE,WAAW,GAAmB;EAClCoE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE;CACN;AAED,MAAMlE,UAAU,GAAmB;EACjCmE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE;CACN;AAED,MAAMjE,YAAY,GAAmB;EACnCkE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE,EAAE;EACPmB,OAAO,EAAE;IACPC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,EAAE;IACPC,GAAG,EAAE,EAAE;IACPC,GAAG,EAAE;;CAER;AAED,MAAM/F,cAAc,GAAmB;EACrCiE,GAAG,EAAE,CAAC;EACND,GAAG,EAAE,CAAC;EACNmB,OAAO,EAAE;IACPa,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE,CAAC;IACNC,GAAG,EAAE;;CAER;AAED,MAAM5G,YAAY,GAAGA,CACnBR,KAAa,EACbqH,OAAuB,KAC2B;EAClD,MAAMC,QAAQ,GAAGD,OAAO,CAACvC,GAAG,GAAGuC,OAAO,CAACtC,GAAG,GAAG,CAAC;EAC9C,MAAMtH,MAAM,GAAG,IAAIE,GAAG,EAAU;EAChC,MAAM4J,MAAM,GAAGvH,KAAK,CAACL,KAAK,CAAC,GAAG,CAAC;EAE/B,KAAK,MAAM6H,KAAK,IAAID,MAAM,EAAE;IAC1B,MAAM,CAACE,GAAG,EAAEC,IAAI,CAAC,GAAGC,SAAS,CAACH,KAAK,CAAC;IACpC,IAAIC,GAAG,KAAK,GAAG,IAAIC,IAAI,KAAKzI,SAAS,EAAE;MACrC,OAAOvF,MAAM,CAAC0G,KAAK,CAAC,IAAIzC,GAAG,EAAE,CAAC;IAChC;IAEA,IAAI+J,IAAI,KAAKzI,SAAS,EAAE;MACtB,IAAI,CAAC2I,MAAM,CAACC,SAAS,CAACH,IAAI,CAAC,EAAE;QAC3B,OAAOhO,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;UAAEU,OAAO,EAAE,8CAA8C;UAAEC;QAAK,CAAE,CAAC,CAAC;MACxG;MACA,IAAI0H,IAAI,GAAG,CAAC,EAAE;QACZ,OAAOhO,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;UAAEU,OAAO,EAAE,0CAA0C;UAAEC;QAAK,CAAE,CAAC,CAAC;MACpG;MACA,IAAI0H,IAAI,GAAGL,OAAO,CAACvC,GAAG,EAAE;QACtB,OAAOpL,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;UAAEU,OAAO,EAAE,uCAAuCsH,OAAO,CAACvC,GAAG,EAAE;UAAE9E;QAAK,CAAE,CAAC,CAAC;MAC9G;IACF;IAEA,IAAIyH,GAAG,KAAK,GAAG,EAAE;MACf,KAAK,IAAI5M,CAAC,GAAGwM,OAAO,CAACtC,GAAG,EAAElK,CAAC,IAAIwM,OAAO,CAACvC,GAAG,EAAEjK,CAAC,IAAI6M,IAAI,IAAI,CAAC,EAAE;QAC1DjK,MAAM,CAACqK,GAAG,CAACjN,CAAC,CAAC;MACf;IACF,CAAC,MAAM;MACL,MAAM,CAACiF,IAAI,EAAEM,KAAK,CAAC,GAAG2H,UAAU,CAACN,GAAG,EAAEJ,OAAO,CAACpB,OAAO,CAAC;MACtD,IAAI,CAAC2B,MAAM,CAACC,SAAS,CAAC/H,IAAI,CAAC,EAAE;QAC3B,OAAOpG,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;UAAEU,OAAO,EAAE,6BAA6B;UAAEC;QAAK,CAAE,CAAC,CAAC;MACvF;MACA,IAAIF,IAAI,GAAGuH,OAAO,CAACtC,GAAG,IAAIjF,IAAI,GAAGuH,OAAO,CAACvC,GAAG,EAAE;QAC5C,OAAOpL,MAAM,CAACoG,IAAI,CAChB,IAAIT,UAAU,CAAC;UAAEU,OAAO,EAAE,4BAA4BsH,OAAO,CAACtC,GAAG,QAAQsC,OAAO,CAACvC,GAAG,EAAE;UAAE9E;QAAK,CAAE,CAAC,CACjG;MACH;MAEA,IAAII,KAAK,KAAKnB,SAAS,EAAE;QACvBxB,MAAM,CAACqK,GAAG,CAAChI,IAAI,CAAC;MAClB,CAAC,MAAM;QACL,IAAI,CAAC8H,MAAM,CAACC,SAAS,CAACzH,KAAK,CAAC,EAAE;UAC5B,OAAO1G,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;YAAEU,OAAO,EAAE,6BAA6B;YAAEC;UAAK,CAAE,CAAC,CAAC;QACvF;QACA,IAAII,KAAK,GAAGiH,OAAO,CAACtC,GAAG,IAAI3E,KAAK,GAAGiH,OAAO,CAACvC,GAAG,EAAE;UAC9C,OAAOpL,MAAM,CAACoG,IAAI,CAChB,IAAIT,UAAU,CAAC;YAAEU,OAAO,EAAE,4BAA4BsH,OAAO,CAACtC,GAAG,QAAQsC,OAAO,CAACvC,GAAG,EAAE;YAAE9E;UAAK,CAAE,CAAC,CACjG;QACH;QACA,IAAIF,IAAI,GAAGM,KAAK,EAAE;UAChB,OAAO1G,MAAM,CAACoG,IAAI,CAAC,IAAIT,UAAU,CAAC;YAAEU,OAAO,EAAE,qBAAqB;YAAEC;UAAK,CAAE,CAAC,CAAC;QAC/E;QAEA,KAAK,IAAInF,CAAC,GAAGiF,IAAI,EAAEjF,CAAC,IAAIuF,KAAK,EAAEvF,CAAC,IAAI6M,IAAI,IAAI,CAAC,EAAE;UAC7CjK,MAAM,CAACqK,GAAG,CAACjN,CAAC,CAAC;QACf;MACF;IACF;IAEA,IAAI4C,MAAM,CAACoB,IAAI,IAAIyI,QAAQ,EAAE;MAC3B,OAAO5N,MAAM,CAAC0G,KAAK,CAAC,IAAIzC,GAAG,EAAE,CAAC;IAChC;EACF;EAEA,OAAOjE,MAAM,CAAC0G,KAAK,CAAC3C,MAAM,CAAC;AAC7B,CAAC;AAED,MAAMkK,SAAS,GAAI3H,KAAa,IAAkC;EAChE,MAAMgI,SAAS,GAAGhI,KAAK,CAACiI,OAAO,CAAC,GAAG,CAAC;EACpC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IACpB,OAAO,CAAChI,KAAK,CAACkI,KAAK,CAAC,CAAC,EAAEF,SAAS,CAAC,EAAEJ,MAAM,CAAC5H,KAAK,CAACkI,KAAK,CAACF,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;EACxE;EAEA,OAAO,CAAChI,KAAK,EAAEf,SAAS,CAAC;AAC3B,CAAC;AAED,MAAM8I,UAAU,GAAGA,CAAC/H,KAAa,EAAEiG,OAAgC,KAAkC;EACnG,MAAM+B,SAAS,GAAGhI,KAAK,CAACiI,OAAO,CAAC,GAAG,CAAC;EACpC,IAAID,SAAS,KAAK,CAAC,CAAC,EAAE;IACpB,OAAO,CAACG,YAAY,CAACnI,KAAK,CAACkI,KAAK,CAAC,CAAC,EAAEF,SAAS,CAAC,EAAE/B,OAAO,CAAC,EAAEkC,YAAY,CAACnI,KAAK,CAACkI,KAAK,CAACF,SAAS,GAAG,CAAC,CAAC,EAAE/B,OAAO,CAAC,CAAC;EAC9G;EAEA,OAAO,CAACkC,YAAY,CAACnI,KAAK,EAAEiG,OAAO,CAAC,EAAEhH,SAAS,CAAC;AAClD,CAAC;AAED,SAASkJ,YAAYA,CAACX,KAAa,EAAEvB,OAAgC;EACnE,OAAOA,OAAO,GAAGuB,KAAK,CAACY,iBAAiB,EAAE,CAAC,IAAIR,MAAM,CAACJ,KAAK,CAAC;AAC9D","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Data.js

@@ -0,0 +1,291 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unsafeStruct = exports.unsafeArray = exports.tuple = exports.taggedEnum = exports.tagged = exports.struct = exports.case = exports.array = exports.TaggedError = exports.TaggedClass = exports.Structural = exports.Error = exports.Class = void 0;
+var core = _interopRequireWildcard(require("./internal/core.js"));
+var internal = _interopRequireWildcard(require("./internal/data.js"));
+var _effectable = require("./internal/effectable.js");
+var Predicate = _interopRequireWildcard(require("./Predicate.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data, Equal } from "effect"
+ *
+ * const alice = Data.struct({ name: "Alice", age: 30 })
+ *
+ * const bob = Data.struct({ name: "Bob", age: 40 })
+ *
+ * assert.deepStrictEqual(Equal.equals(alice, alice), true)
+ * assert.deepStrictEqual(Equal.equals(alice, Data.struct({ name: "Alice", age: 30 })), true)
+ *
+ * assert.deepStrictEqual(Equal.equals(alice, { name: "Alice", age: 30 }), false)
+ * assert.deepStrictEqual(Equal.equals(alice, bob), false)
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const struct = exports.struct = internal.struct;
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+const unsafeStruct = as => Object.setPrototypeOf(as, _effectable.StructuralPrototype);
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data, Equal } from "effect"
+ *
+ * const alice = Data.tuple("Alice", 30)
+ *
+ * const bob = Data.tuple("Bob", 40)
+ *
+ * assert.deepStrictEqual(Equal.equals(alice, alice), true)
+ * assert.deepStrictEqual(Equal.equals(alice, Data.tuple("Alice", 30)), true)
+ *
+ * assert.deepStrictEqual(Equal.equals(alice, ["Alice", 30]), false)
+ * assert.deepStrictEqual(Equal.equals(alice, bob), false)
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.unsafeStruct = unsafeStruct;
+const tuple = (...as) => unsafeArray(as);
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data, Equal } from "effect"
+ *
+ * const alice = Data.struct({ name: "Alice", age: 30 })
+ * const bob = Data.struct({ name: "Bob", age: 40 })
+ *
+ * const persons = Data.array([alice, bob])
+ *
+ * assert.deepStrictEqual(
+ *   Equal.equals(
+ *     persons,
+ *     Data.array([
+ *       Data.struct({ name: "Alice", age: 30 }),
+ *       Data.struct({ name: "Bob", age: 40 })
+ *     ])
+ *   ),
+ *   true
+ * )
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.tuple = tuple;
+const array = as => unsafeArray(as.slice(0));
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+exports.array = array;
+const unsafeArray = as => Object.setPrototypeOf(as, internal.ArrayProto);
+exports.unsafeArray = unsafeArray;
+const _case = () => args => args === undefined ? Object.create(_effectable.StructuralPrototype) : struct(args);
+exports.case = _case;
+/**
+ * Provides a tagged constructor for the specified `Case`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data } from "effect"
+ *
+ * interface Person {
+ *   readonly _tag: "Person" // the tag
+ *   readonly name: string
+ * }
+ *
+ * const Person = Data.tagged<Person>("Person")
+ *
+ * const mike = Person({ name: "Mike" })
+ *
+ * assert.deepEqual(mike, { _tag: "Person", name: "Mike" })
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const tagged = tag => args => {
+  const value = args === undefined ? Object.create(_effectable.StructuralPrototype) : struct(args);
+  value._tag = tag;
+  return value;
+};
+/**
+ * Provides a constructor for a Case Class.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data, Equal } from "effect"
+ *
+ * class Person extends Data.Class<{ readonly name: string }> {}
+ *
+ * // Creating instances of Person
+ * const mike1 = new Person({ name: "Mike" })
+ * const mike2 = new Person({ name: "Mike" })
+ * const john = new Person({ name: "John" })
+ *
+ * // Checking equality
+ * assert.deepStrictEqual(Equal.equals(mike1, mike2), true)
+ * assert.deepStrictEqual(Equal.equals(mike1, john), false)
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.tagged = tagged;
+const Class = exports.Class = internal.Structural;
+/**
+ * Provides a Tagged constructor for a Case Class.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Data, Equal } from "effect"
+ *
+ * class Person extends Data.TaggedClass("Person")<{ readonly name: string }> {}
+ *
+ * // Creating instances of Person
+ * const mike1 = new Person({ name: "Mike" })
+ * const mike2 = new Person({ name: "Mike" })
+ * const john = new Person({ name: "John" })
+ *
+ * // Checking equality
+ * assert.deepStrictEqual(Equal.equals(mike1, mike2), true)
+ * assert.deepStrictEqual(Equal.equals(mike1, john), false)
+ *
+ * assert.deepStrictEqual(mike1._tag, "Person")
+ * ```
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const TaggedClass = tag => {
+  class Base extends Class {
+    _tag = tag;
+  }
+  return Base;
+};
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.TaggedClass = TaggedClass;
+const Structural = exports.Structural = internal.Structural;
+/**
+ * Create a constructor for a tagged union of `Data` structs.
+ *
+ * You can also pass a `TaggedEnum.WithGenerics` if you want to add generics to
+ * the constructor.
+ *
+ * @example
+ * ```ts
+ * import { Data } from "effect"
+ *
+ * const { BadRequest, NotFound } = Data.taggedEnum<
+ *   | { readonly _tag: "BadRequest"; readonly status: 400; readonly message: string }
+ *   | { readonly _tag: "NotFound"; readonly status: 404; readonly message: string }
+ * >()
+ *
+ * const notFound = NotFound({ status: 404, message: "Not Found" })
+ * ```
+ *
+ * @example
+ * import { Data } from "effect"
+ *
+ * type MyResult<E, A> = Data.TaggedEnum<{
+ *   Failure: { readonly error: E }
+ *   Success: { readonly value: A }
+ * }>
+ * interface MyResultDefinition extends Data.TaggedEnum.WithGenerics<2> {
+ *   readonly taggedEnum: MyResult<this["A"], this["B"]>
+ * }
+ * const { Failure, Success } = Data.taggedEnum<MyResultDefinition>()
+ *
+ * const success = Success({ value: 1 })
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const taggedEnum = () => new Proxy({}, {
+  get(_target, tag, _receiver) {
+    if (tag === "$is") {
+      return Predicate.isTagged;
+    } else if (tag === "$match") {
+      return taggedMatch;
+    }
+    return tagged(tag);
+  }
+});
+exports.taggedEnum = taggedEnum;
+function taggedMatch() {
+  if (arguments.length === 1) {
+    const cases = arguments[0];
+    return function (value) {
+      return cases[value._tag](value);
+    };
+  }
+  const value = arguments[0];
+  const cases = arguments[1];
+  return cases[value._tag](value);
+}
+/**
+ * Provides a constructor for a Case Class.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const Error = exports.Error = /*#__PURE__*/function () {
+  const plainArgsSymbol = /*#__PURE__*/Symbol.for("effect/Data/Error/plainArgs");
+  const O = {
+    BaseEffectError: class extends core.YieldableError {
+      constructor(args) {
+        super(args?.message, args?.cause ? {
+          cause: args.cause
+        } : undefined);
+        if (args) {
+          Object.assign(this, args);
+          // @effect-diagnostics-next-line floatingEffect:off
+          Object.defineProperty(this, plainArgsSymbol, {
+            value: args,
+            enumerable: false
+          });
+        }
+      }
+      toJSON() {
+        return {
+          ...this[plainArgsSymbol],
+          ...this
+        };
+      }
+    }
+  };
+  return O.BaseEffectError;
+}();
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const TaggedError = tag => {
+  const O = {
+    BaseEffectError: class extends Error {
+      _tag = tag;
+    }
+  };
+  O.BaseEffectError.prototype.name = tag;
+  return O.BaseEffectError;
+};
+exports.TaggedError = TaggedError;
+//# sourceMappingURL=Data.js.map

backend/node_modules/effect/dist/cjs/Data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Data.js","names":["core","_interopRequireWildcard","require","internal","_effectable","Predicate","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","struct","exports","unsafeStruct","as","setPrototypeOf","StructuralPrototype","tuple","unsafeArray","array","slice","ArrayProto","_case","args","undefined","create","case","tagged","tag","value","_tag","Class","Structural","TaggedClass","Base","taggedEnum","Proxy","_target","_receiver","isTagged","taggedMatch","arguments","length","cases","Error","plainArgsSymbol","Symbol","for","O","BaseEffectError","YieldableError","constructor","message","cause","assign","enumerable","toJSON","TaggedError","prototype","name"],"sources":["../../src/Data.ts"],"sourcesContent":[null],"mappings":";;;;;;AAIA,IAAAA,IAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,QAAA,GAAAF,uBAAA,CAAAC,OAAA;AACA,IAAAE,WAAA,GAAAF,OAAA;AACA,IAAAG,SAAA,GAAAJ,uBAAA,CAAAC,OAAA;AAA2C,SAAAD,wBAAAK,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAP,uBAAA,YAAAA,CAAAK,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAmB3C;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,GAA+EtB,QAAQ,CAACsB,MAAM;AAEjH;;;;AAIO,MAAME,YAAY,GAAmCC,EAAK,IAC/DN,MAAM,CAACO,cAAc,CAACD,EAAE,EAAEE,+BAAmB,CAAC;AAEhD;;;;;;;;;;;;;;;;;;;;AAAAJ,OAAA,CAAAC,YAAA,GAAAA,YAAA;AAoBO,MAAMI,KAAK,GAAGA,CAAgC,GAAGH,EAAM,KAAmBI,WAAW,CAACJ,EAAE,CAAC;AAEhG;;;;;;;;;;;;;;;;;;;;;;;;;;AAAAF,OAAA,CAAAK,KAAA,GAAAA,KAAA;AA0BO,MAAME,KAAK,GAAmCL,EAAM,IAAmBI,WAAW,CAACJ,EAAE,CAACM,KAAK,CAAC,CAAC,CAAkB,CAAC;AAEvH;;;;AAAAR,OAAA,CAAAO,KAAA,GAAAA,KAAA;AAIO,MAAMD,WAAW,GAAmCJ,EAAM,IAC/DN,MAAM,CAACO,cAAc,CAACD,EAAE,EAAEzB,QAAQ,CAACgC,UAAU,CAAC;AAAAT,OAAA,CAAAM,WAAA,GAAAA,WAAA;AAEhD,MAAMI,KAAK,GAAGA,CAAA,KAA+BC,IAAI,IAC9CA,IAAI,KAAKC,SAAS,GAAGhB,MAAM,CAACiB,MAAM,CAACT,+BAAmB,CAAC,GAAGL,MAAM,CAACY,IAAI,CAAS;AAAAX,OAAA,CAAAc,IAAA,GAAAJ,KAAA;AAkCjF;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMK,MAAM,GACjBC,GAAc,IAEfL,IAAI,IAAI;EACP,MAAMM,KAAK,GAAGN,IAAI,KAAKC,SAAS,GAAGhB,MAAM,CAACiB,MAAM,CAACT,+BAAmB,CAAC,GAAGL,MAAM,CAACY,IAAI,CAAC;EACpFM,KAAK,CAACC,IAAI,GAAGF,GAAG;EAChB,OAAOC,KAAK;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;AAAAjB,OAAA,CAAAe,MAAA,GAAAA,MAAA;AAuBO,MAAMI,KAAK,GAAAnB,OAAA,CAAAmB,KAAA,GAEC1C,QAAQ,CAAC2C,UAAiB;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,WAAW,GACtBL,GAAQ,IAGkC;EAC1C,MAAMM,IAAK,SAAQH,KAAU;IAClBD,IAAI,GAAGF,GAAG;;EAErB,OAAOM,IAAW;AACpB,CAAC;AAED;;;;AAAAtB,OAAA,CAAAqB,WAAA,GAAAA,WAAA;AAIO,MAAMD,UAAU,GAAApB,OAAA,CAAAoB,UAAA,GAEb3C,QAAQ,CAAC2C,UAAiB;AA6KpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCO,MAAMG,UAAU,GAiOnBA,CAAA,KACF,IAAIC,KAAK,CAAC,EAAE,EAAE;EACZhC,GAAGA,CAACiC,OAAO,EAAET,GAAG,EAAEU,SAAS;IACzB,IAAIV,GAAG,KAAK,KAAK,EAAE;MACjB,OAAOrC,SAAS,CAACgD,QAAQ;IAC3B,CAAC,MAAM,IAAIX,GAAG,KAAK,QAAQ,EAAE;MAC3B,OAAOY,WAAW;IACpB;IACA,OAAOb,MAAM,CAACC,GAAa,CAAC;EAC9B;CACD,CAAQ;AAAAhB,OAAA,CAAAuB,UAAA,GAAAA,UAAA;AAcX,SAASK,WAAWA,CAAA;EAMlB,IAAIC,SAAS,CAACC,MAAM,KAAK,CAAC,EAAE;IAC1B,MAAMC,KAAK,GAAGF,SAAS,CAAC,CAAC,CAAU;IACnC,OAAO,UAASZ,KAAQ;MACtB,OAAOc,KAAK,CAACd,KAAK,CAACC,IAAiB,CAAC,CAACD,KAAY,CAAC;IACrD,CAAC;EACH;EACA,MAAMA,KAAK,GAAGY,SAAS,CAAC,CAAC,CAAM;EAC/B,MAAME,KAAK,GAAGF,SAAS,CAAC,CAAC,CAAU;EACnC,OAAOE,KAAK,CAACd,KAAK,CAACC,IAAiB,CAAC,CAACD,KAAY,CAAC;AACrD;AAEA;;;;;;AAMO,MAAMe,KAAK,GAAAhC,OAAA,CAAAgC,KAAA,gBAEyB;EACzC,MAAMC,eAAe,gBAAGC,MAAM,CAACC,GAAG,CAAC,6BAA6B,CAAC;EACjE,MAAMC,CAAC,GAAG;IACRC,eAAe,EAAE,cAAc/D,IAAI,CAACgE,cAAc;MAChDC,YAAY5B,IAAS;QACnB,KAAK,CAACA,IAAI,EAAE6B,OAAO,EAAE7B,IAAI,EAAE8B,KAAK,GAAG;UAAEA,KAAK,EAAE9B,IAAI,CAAC8B;QAAK,CAAE,GAAG7B,SAAS,CAAC;QACrE,IAAID,IAAI,EAAE;UACRf,MAAM,CAAC8C,MAAM,CAAC,IAAI,EAAE/B,IAAI,CAAC;UACzB;UACAf,MAAM,CAACC,cAAc,CAAC,IAAI,EAAEoC,eAAe,EAAE;YAAEhB,KAAK,EAAEN,IAAI;YAAEgC,UAAU,EAAE;UAAK,CAAE,CAAC;QAClF;MACF;MACAC,MAAMA,CAAA;QACJ,OAAO;UAAE,GAAI,IAAY,CAACX,eAAe,CAAC;UAAE,GAAG;QAAI,CAAE;MACvD;;GAEH;EACD,OAAOG,CAAC,CAACC,eAAe;AAC1B,CAAC,CAAC,CAAE;AAEJ;;;;AAIO,MAAMQ,WAAW,GAAwB7B,GAAQ,IAEW;EACjE,MAAMoB,CAAC,GAAG;IACRC,eAAe,EAAE,cAAcL,KAAS;MAC7Bd,IAAI,GAAGF,GAAG;;GAEtB;EACCoB,CAAC,CAACC,eAAe,CAACS,SAAiB,CAACC,IAAI,GAAG/B,GAAG;EAChD,OAAOoB,CAAC,CAACC,eAAsB;AACjC,CAAC;AAAArC,OAAA,CAAA6C,WAAA,GAAAA,WAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/DateTime.js

@@ -0,0 +1,1084 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zonedOffsetIso = exports.zonedOffset = exports.zoneUnsafeMakeNamed = exports.zoneToString = exports.zoneMakeOffset = exports.zoneMakeNamedEffect = exports.zoneMakeNamed = exports.zoneMakeLocal = exports.zoneFromString = exports.withDateUtc = exports.withDate = exports.withCurrentZoneOffset = exports.withCurrentZoneNamed = exports.withCurrentZoneLocal = exports.withCurrentZone = exports.unsafeSetZoneNamed = exports.unsafeNow = exports.unsafeMakeZoned = exports.unsafeMake = exports.unsafeIsPast = exports.unsafeIsFuture = exports.unsafeFromDate = exports.toUtc = exports.toPartsUtc = exports.toParts = exports.toEpochMillis = exports.toDateUtc = exports.toDate = exports.subtractDuration = exports.subtract = exports.startOf = exports.setZoneOffset = exports.setZoneNamed = exports.setZoneCurrent = exports.setZone = exports.setPartsUtc = exports.setParts = exports.removeTime = exports.nowInCurrentZone = exports.nowAsDate = exports.now = exports.nearest = exports.mutateUtc = exports.mutate = exports.min = exports.max = exports.match = exports.mapEpochMillis = exports.makeZonedFromString = exports.makeZoned = exports.make = exports.lessThanOrEqualTo = exports.lessThan = exports.layerCurrentZoneOffset = exports.layerCurrentZoneNamed = exports.layerCurrentZoneLocal = exports.layerCurrentZone = exports.isZoned = exports.isUtc = exports.isTimeZoneOffset = exports.isTimeZoneNamed = exports.isTimeZone = exports.isPast = exports.isFuture = exports.isDateTime = exports.greaterThanOrEqualTo = exports.greaterThan = exports.getPartUtc = exports.getPart = exports.formatUtc = exports.formatLocal = exports.formatIsoZoned = exports.formatIsoOffset = exports.formatIsoDateUtc = exports.formatIsoDate = exports.formatIso = exports.formatIntl = exports.format = exports.endOf = exports.distanceDurationEither = exports.distanceDuration = exports.distance = exports.clamp = exports.between = exports.addDuration = exports.add = exports.TypeId = exports.TimeZoneTypeId = exports.Order = exports.Equivalence = exports.CurrentTimeZone = void 0;
+var Context = _interopRequireWildcard(require("./Context.js"));
+var Effect = _interopRequireWildcard(require("./Effect.js"));
+var _Function = require("./Function.js");
+var Internal = _interopRequireWildcard(require("./internal/dateTime.js"));
+var Layer = _interopRequireWildcard(require("./Layer.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 3.6.0
+ * @category type ids
+ */
+const TypeId = exports.TypeId = Internal.TypeId;
+/**
+ * @since 3.6.0
+ * @category type ids
+ */
+const TimeZoneTypeId = exports.TimeZoneTypeId = Internal.TimeZoneTypeId;
+// =============================================================================
+// guards
+// =============================================================================
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isDateTime = exports.isDateTime = Internal.isDateTime;
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isTimeZone = exports.isTimeZone = Internal.isTimeZone;
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isTimeZoneOffset = exports.isTimeZoneOffset = Internal.isTimeZoneOffset;
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isTimeZoneNamed = exports.isTimeZoneNamed = Internal.isTimeZoneNamed;
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isUtc = exports.isUtc = Internal.isUtc;
+/**
+ * @since 3.6.0
+ * @category guards
+ */
+const isZoned = exports.isZoned = Internal.isZoned;
+// =============================================================================
+// instances
+// =============================================================================
+/**
+ * @since 3.6.0
+ * @category instances
+ */
+const Equivalence = exports.Equivalence = Internal.Equivalence;
+/**
+ * @since 3.6.0
+ * @category instances
+ */
+const Order = exports.Order = Internal.Order;
+/**
+ * @since 3.6.0
+ */
+const clamp = exports.clamp = Internal.clamp;
+// =============================================================================
+// constructors
+// =============================================================================
+/**
+ * Create a `DateTime` from a `Date`.
+ *
+ * If the `Date` is invalid, an `IllegalArgumentException` will be thrown.
+ *
+ * @since 3.6.0
+ * @category constructors
+ */
+const unsafeFromDate = exports.unsafeFromDate = Internal.unsafeFromDate;
+/**
+ * Create a `DateTime` from one of the following:
+ *
+ * - A `DateTime`
+ * - A `Date` instance (invalid dates will throw an `IllegalArgumentException`)
+ * - The `number` of milliseconds since the Unix epoch
+ * - An object with the parts of a date
+ * - A `string` that can be parsed by `Date.parse`
+ *
+ * @since 3.6.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // from Date
+ * DateTime.unsafeMake(new Date())
+ *
+ * // from parts
+ * DateTime.unsafeMake({ year: 2024 })
+ *
+ * // from string
+ * DateTime.unsafeMake("2024-01-01")
+ * ```
+ */
+const unsafeMake = exports.unsafeMake = Internal.unsafeMake;
+/**
+ * Create a `DateTime.Zoned` using `DateTime.unsafeMake` and a time zone.
+ *
+ * The input is treated as UTC and then the time zone is attached, unless
+ * `adjustForTimeZone` is set to `true`. In that case, the input is treated as
+ * already in the time zone.
+ *
+ * When `adjustForTimeZone` is true and ambiguous times occur during DST transitions,
+ * the `disambiguation` option controls how to resolve the ambiguity:
+ * - `compatible` (default): Choose earlier time for repeated times, later for gaps
+ * - `earlier`: Always choose the earlier of two possible times
+ * - `later`: Always choose the later of two possible times
+ * - `reject`: Throw an error when ambiguous times are encountered
+ *
+ * @since 3.6.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * DateTime.unsafeMakeZoned(new Date(), { timeZone: "Europe/London" })
+ * ```
+ */
+const unsafeMakeZoned = exports.unsafeMakeZoned = Internal.unsafeMakeZoned;
+/**
+ * Create a `DateTime.Zoned` using `DateTime.make` and a time zone.
+ *
+ * The input is treated as UTC and then the time zone is attached, unless
+ * `adjustForTimeZone` is set to `true`. In that case, the input is treated as
+ * already in the time zone.
+ *
+ * When `adjustForTimeZone` is true and ambiguous times occur during DST transitions,
+ * the `disambiguation` option controls how to resolve the ambiguity:
+ * - `compatible` (default): Choose earlier time for repeated times, later for gaps
+ * - `earlier`: Always choose the earlier of two possible times
+ * - `later`: Always choose the later of two possible times
+ * - `reject`: Throw an error when ambiguous times are encountered
+ *
+ * If the date time input or time zone is invalid, `None` will be returned.
+ *
+ * @since 3.6.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * DateTime.makeZoned(new Date(), { timeZone: "Europe/London" })
+ * ```
+ */
+const makeZoned = exports.makeZoned = Internal.makeZoned;
+/**
+ * Create a `DateTime` from one of the following:
+ *
+ * - A `DateTime`
+ * - A `Date` instance (invalid dates will throw an `IllegalArgumentException`)
+ * - The `number` of milliseconds since the Unix epoch
+ * - An object with the parts of a date
+ * - A `string` that can be parsed by `Date.parse`
+ *
+ * If the input is invalid, `None` will be returned.
+ *
+ * @since 3.6.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // from Date
+ * DateTime.make(new Date())
+ *
+ * // from parts
+ * DateTime.make({ year: 2024 })
+ *
+ * // from string
+ * DateTime.make("2024-01-01")
+ * ```
+ */
+const make = exports.make = Internal.make;
+/**
+ * Create a `DateTime.Zoned` from a string.
+ *
+ * It uses the format: `YYYY-MM-DDTHH:mm:ss.sss+HH:MM[Time/Zone]`.
+ *
+ * @since 3.6.0
+ * @category constructors
+ */
+const makeZonedFromString = exports.makeZonedFromString = Internal.makeZonedFromString;
+/**
+ * Get the current time using the `Clock` service and convert it to a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ * })
+ * ```
+ */
+const now = exports.now = Internal.now;
+/**
+ * Get the current time using the `Clock` service.
+ *
+ * @since 3.14.0
+ * @category constructors
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.nowAsDate
+ * })
+ * ```
+ */
+const nowAsDate = exports.nowAsDate = Internal.nowAsDate;
+/**
+ * Get the current time using `Date.now`.
+ *
+ * @since 3.6.0
+ * @category constructors
+ */
+const unsafeNow = exports.unsafeNow = Internal.unsafeNow;
+// =============================================================================
+// time zones
+// =============================================================================
+/**
+ * For a `DateTime` returns a new `DateTime.Utc`.
+ *
+ * @since 3.13.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * const now = DateTime.unsafeMakeZoned({ year: 2024 }, { timeZone: "Europe/London" })
+ *
+ * // set as UTC
+ * const utc: DateTime.Utc = DateTime.toUtc(now)
+ * ```
+ */
+const toUtc = exports.toUtc = Internal.toUtc;
+/**
+ * Set the time zone of a `DateTime`, returning a new `DateTime.Zoned`.
+ *
+ * @since 3.6.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   const zone = DateTime.zoneUnsafeMakeNamed("Europe/London")
+ *
+ *   // set the time zone
+ *   const zoned: DateTime.Zoned = DateTime.setZone(now, zone)
+ * })
+ * ```
+ */
+const setZone = exports.setZone = Internal.setZone;
+/**
+ * Add a fixed offset time zone to a `DateTime`.
+ *
+ * The offset is in milliseconds.
+ *
+ * @since 3.6.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *
+ *   // set the offset time zone in milliseconds
+ *   const zoned: DateTime.Zoned = DateTime.setZoneOffset(now, 3 * 60 * 60 * 1000)
+ * })
+ * ```
+ */
+const setZoneOffset = exports.setZoneOffset = Internal.setZoneOffset;
+/**
+ * Attempt to create a named time zone from a IANA time zone identifier.
+ *
+ * If the time zone is invalid, an `IllegalArgumentException` will be thrown.
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneUnsafeMakeNamed = exports.zoneUnsafeMakeNamed = Internal.zoneUnsafeMakeNamed;
+/**
+ * Create a fixed offset time zone.
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneMakeOffset = exports.zoneMakeOffset = Internal.zoneMakeOffset;
+/**
+ * Create a named time zone from a IANA time zone identifier. If the time zone
+ * is invalid, `None` will be returned.
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneMakeNamed = exports.zoneMakeNamed = Internal.zoneMakeNamed;
+/**
+ * Create a named time zone from a IANA time zone identifier. If the time zone
+ * is invalid, it will fail with an `IllegalArgumentException`.
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneMakeNamedEffect = exports.zoneMakeNamedEffect = Internal.zoneMakeNamedEffect;
+/**
+ * Create a named time zone from the system's local time zone.
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneMakeLocal = exports.zoneMakeLocal = Internal.zoneMakeLocal;
+/**
+ * Try parse a TimeZone from a string
+ *
+ * @since 3.6.0
+ * @category time zones
+ */
+const zoneFromString = exports.zoneFromString = Internal.zoneFromString;
+/**
+ * Format a `TimeZone` as a string.
+ *
+ * @since 3.6.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * // Outputs "+03:00"
+ * DateTime.zoneToString(DateTime.zoneMakeOffset(3 * 60 * 60 * 1000))
+ *
+ * // Outputs "Europe/London"
+ * DateTime.zoneToString(DateTime.zoneUnsafeMakeNamed("Europe/London"))
+ * ```
+ */
+const zoneToString = exports.zoneToString = Internal.zoneToString;
+/**
+ * Set the time zone of a `DateTime` from an IANA time zone identifier. If the
+ * time zone is invalid, `None` will be returned.
+ *
+ * @since 3.6.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   // set the time zone, returns an Option
+ *   DateTime.setZoneNamed(now, "Europe/London")
+ * })
+ * ```
+ */
+const setZoneNamed = exports.setZoneNamed = Internal.setZoneNamed;
+/**
+ * Set the time zone of a `DateTime` from an IANA time zone identifier. If the
+ * time zone is invalid, an `IllegalArgumentException` will be thrown.
+ *
+ * @since 3.6.0
+ * @category time zones
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   // set the time zone
+ *   DateTime.unsafeSetZoneNamed(now, "Europe/London")
+ * })
+ * ```
+ */
+const unsafeSetZoneNamed = exports.unsafeSetZoneNamed = Internal.unsafeSetZoneNamed;
+// =============================================================================
+// comparisons
+// =============================================================================
+/**
+ * Calulate the difference between two `DateTime` values, returning the number
+ * of milliseconds the `other` DateTime is from `self`.
+ *
+ * If `other` is *after* `self`, the result will be a positive number.
+ *
+ * @since 3.6.0
+ * @category comparisons
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   const other = DateTime.add(now, { minutes: 1 })
+ *
+ *   // returns 60000
+ *   DateTime.distance(now, other)
+ * })
+ * ```
+ */
+const distance = exports.distance = Internal.distance;
+/**
+ * Calulate the difference between two `DateTime` values.
+ *
+ * If the `other` DateTime is before `self`, the result will be a negative
+ * `Duration`, returned as a `Left`.
+ *
+ * If the `other` DateTime is after `self`, the result will be a positive
+ * `Duration`, returned as a `Right`.
+ *
+ * @since 3.6.0
+ * @category comparisons
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   const other = DateTime.add(now, { minutes: 1 })
+ *
+ *   // returns Either.right(Duration.minutes(1))
+ *   DateTime.distanceDurationEither(now, other)
+ *
+ *   // returns Either.left(Duration.minutes(1))
+ *   DateTime.distanceDurationEither(other, now)
+ * })
+ * ```
+ */
+const distanceDurationEither = exports.distanceDurationEither = Internal.distanceDurationEither;
+/**
+ * Calulate the distance between two `DateTime` values.
+ *
+ * @since 3.6.0
+ * @category comparisons
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *   const other = DateTime.add(now, { minutes: 1 })
+ *
+ *   // returns Duration.minutes(1)
+ *   DateTime.distanceDuration(now, other)
+ * })
+ * ```
+ */
+const distanceDuration = exports.distanceDuration = Internal.distanceDuration;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const min = exports.min = Internal.min;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const max = exports.max = Internal.max;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const greaterThan = exports.greaterThan = Internal.greaterThan;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const greaterThanOrEqualTo = exports.greaterThanOrEqualTo = Internal.greaterThanOrEqualTo;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const lessThan = exports.lessThan = Internal.lessThan;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const lessThanOrEqualTo = exports.lessThanOrEqualTo = Internal.lessThanOrEqualTo;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const between = exports.between = Internal.between;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const isFuture = exports.isFuture = Internal.isFuture;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const unsafeIsFuture = exports.unsafeIsFuture = Internal.unsafeIsFuture;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const isPast = exports.isPast = Internal.isPast;
+/**
+ * @since 3.6.0
+ * @category comparisons
+ */
+const unsafeIsPast = exports.unsafeIsPast = Internal.unsafeIsPast;
+// =============================================================================
+// conversions
+// =============================================================================
+/**
+ * Get the UTC `Date` of a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category conversions
+ */
+const toDateUtc = exports.toDateUtc = Internal.toDateUtc;
+/**
+ * Convert a `DateTime` to a `Date`, applying the time zone first.
+ *
+ * @since 3.6.0
+ * @category conversions
+ */
+const toDate = exports.toDate = Internal.toDate;
+/**
+ * Calculate the time zone offset of a `DateTime.Zoned` in milliseconds.
+ *
+ * @since 3.6.0
+ * @category conversions
+ */
+const zonedOffset = exports.zonedOffset = Internal.zonedOffset;
+/**
+ * Calculate the time zone offset of a `DateTime` in milliseconds.
+ *
+ * The offset is formatted as "±HH:MM".
+ *
+ * @since 3.6.0
+ * @category conversions
+ */
+const zonedOffsetIso = exports.zonedOffsetIso = Internal.zonedOffsetIso;
+/**
+ * Get the milliseconds since the Unix epoch of a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category conversions
+ */
+const toEpochMillis = exports.toEpochMillis = Internal.toEpochMillis;
+/**
+ * Remove the time aspect of a `DateTime`, first adjusting for the time
+ * zone. It will return a `DateTime.Utc` only containing the date.
+ *
+ * @since 3.6.0
+ * @category conversions
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // returns "2024-01-01T00:00:00Z"
+ * DateTime.unsafeMakeZoned("2024-01-01T05:00:00Z", {
+ *   timeZone: "Pacific/Auckland",
+ *   adjustForTimeZone: true
+ * }).pipe(
+ *   DateTime.removeTime,
+ *   DateTime.formatIso
+ * )
+ * ```
+ */
+const removeTime = exports.removeTime = Internal.removeTime;
+// =============================================================================
+// parts
+// =============================================================================
+/**
+ * Get the different parts of a `DateTime` as an object.
+ *
+ * The parts will be time zone adjusted.
+ *
+ * @since 3.6.0
+ * @category parts
+ */
+const toParts = exports.toParts = Internal.toParts;
+/**
+ * Get the different parts of a `DateTime` as an object.
+ *
+ * The parts will be in UTC.
+ *
+ * @since 3.6.0
+ * @category parts
+ */
+const toPartsUtc = exports.toPartsUtc = Internal.toPartsUtc;
+/**
+ * Get a part of a `DateTime` as a number.
+ *
+ * The part will be in the UTC time zone.
+ *
+ * @since 3.6.0
+ * @category parts
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { DateTime } from "effect"
+ *
+ * const now = DateTime.unsafeMake({ year: 2024 })
+ * const year = DateTime.getPartUtc(now, "year")
+ * assert.strictEqual(year, 2024)
+ * ```
+ */
+const getPartUtc = exports.getPartUtc = Internal.getPartUtc;
+/**
+ * Get a part of a `DateTime` as a number.
+ *
+ * The part will be time zone adjusted.
+ *
+ * @since 3.6.0
+ * @category parts
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { DateTime } from "effect"
+ *
+ * const now = DateTime.unsafeMakeZoned({ year: 2024 }, { timeZone: "Europe/London" })
+ * const year = DateTime.getPart(now, "year")
+ * assert.strictEqual(year, 2024)
+ * ```
+ */
+const getPart = exports.getPart = Internal.getPart;
+/**
+ * Set the different parts of a `DateTime` as an object.
+ *
+ * The Date will be time zone adjusted.
+ *
+ * @since 3.6.0
+ * @category parts
+ */
+const setParts = exports.setParts = Internal.setParts;
+/**
+ * Set the different parts of a `DateTime` as an object.
+ *
+ * @since 3.6.0
+ * @category parts
+ */
+const setPartsUtc = exports.setPartsUtc = Internal.setPartsUtc;
+// =============================================================================
+// current time zone
+// =============================================================================
+/**
+ * @since 3.11.0
+ * @category current time zone
+ */
+class CurrentTimeZone extends /*#__PURE__*/Context.Tag("effect/DateTime/CurrentTimeZone")() {}
+/**
+ * Set the time zone of a `DateTime` to the current time zone, which is
+ * determined by the `CurrentTimeZone` service.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.now
+ *
+ *   // set the time zone to "Europe/London"
+ *   const zoned = yield* DateTime.setZoneCurrent(now)
+ * }).pipe(DateTime.withCurrentZoneNamed("Europe/London"))
+ * ```
+ */
+exports.CurrentTimeZone = CurrentTimeZone;
+const setZoneCurrent = self => Effect.map(CurrentTimeZone, zone => setZone(self, zone));
+/**
+ * Provide the `CurrentTimeZone` to an effect.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * const zone = DateTime.zoneUnsafeMakeNamed("Europe/London")
+ *
+ * Effect.gen(function* () {
+ *   const now = yield* DateTime.nowInCurrentZone
+ * }).pipe(DateTime.withCurrentZone(zone))
+ * ```
+ */
+exports.setZoneCurrent = setZoneCurrent;
+const withCurrentZone = exports.withCurrentZone = /*#__PURE__*/(0, _Function.dual)(2, (effect, zone) => Effect.provideService(effect, CurrentTimeZone, zone));
+/**
+ * Provide the `CurrentTimeZone` to an effect, using the system's local time
+ * zone.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   // will use the system's local time zone
+ *   const now = yield* DateTime.nowInCurrentZone
+ * }).pipe(DateTime.withCurrentZoneLocal)
+ * ```
+ */
+const withCurrentZoneLocal = effect => Effect.provideServiceEffect(effect, CurrentTimeZone, Effect.sync(zoneMakeLocal));
+/**
+ * Provide the `CurrentTimeZone` to an effect, using a offset.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   // will use the system's local time zone
+ *   const now = yield* DateTime.nowInCurrentZone
+ * }).pipe(DateTime.withCurrentZoneOffset(3 * 60 * 60 * 1000))
+ * ```
+ */
+exports.withCurrentZoneLocal = withCurrentZoneLocal;
+const withCurrentZoneOffset = exports.withCurrentZoneOffset = /*#__PURE__*/(0, _Function.dual)(2, (effect, offset) => Effect.provideService(effect, CurrentTimeZone, zoneMakeOffset(offset)));
+/**
+ * Provide the `CurrentTimeZone` to an effect using an IANA time zone
+ * identifier.
+ *
+ * If the time zone is invalid, it will fail with an `IllegalArgumentException`.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   // will use the "Europe/London" time zone
+ *   const now = yield* DateTime.nowInCurrentZone
+ * }).pipe(DateTime.withCurrentZoneNamed("Europe/London"))
+ * ```
+ */
+const withCurrentZoneNamed = exports.withCurrentZoneNamed = /*#__PURE__*/(0, _Function.dual)(2, (effect, zone) => Effect.provideServiceEffect(effect, CurrentTimeZone, zoneMakeNamedEffect(zone)));
+/**
+ * Get the current time as a `DateTime.Zoned`, using the `CurrentTimeZone`.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ * @example
+ * ```ts
+ * import { DateTime, Effect } from "effect"
+ *
+ * Effect.gen(function* () {
+ *   // will use the "Europe/London" time zone
+ *   const now = yield* DateTime.nowInCurrentZone
+ * }).pipe(DateTime.withCurrentZoneNamed("Europe/London"))
+ * ```
+ */
+const nowInCurrentZone = exports.nowInCurrentZone = /*#__PURE__*/Effect.flatMap(now, setZoneCurrent);
+// =============================================================================
+// mapping
+// =============================================================================
+/**
+ * Modify a `DateTime` by applying a function to a cloned `Date` instance.
+ *
+ * The `Date` will first have the time zone applied if possible, and then be
+ * converted back to a `DateTime` within the same time zone.
+ *
+ * Supports `disambiguation` when the new wall clock time is ambiguous.
+ *
+ * @since 3.6.0
+ * @category mapping
+ */
+const mutate = exports.mutate = Internal.mutate;
+/**
+ * Modify a `DateTime` by applying a function to a cloned UTC `Date` instance.
+ *
+ * @since 3.6.0
+ * @category mapping
+ */
+const mutateUtc = exports.mutateUtc = Internal.mutateUtc;
+/**
+ * Transform a `DateTime` by applying a function to the number of milliseconds
+ * since the Unix epoch.
+ *
+ * @since 3.6.0
+ * @category mapping
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // add 10 milliseconds
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.mapEpochMillis((millis) => millis + 10)
+ * )
+ * ```
+ */
+const mapEpochMillis = exports.mapEpochMillis = Internal.mapEpochMillis;
+/**
+ * Using the time zone adjusted `Date`, apply a function to the `Date` and
+ * return the result.
+ *
+ * @since 3.6.0
+ * @category mapping
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // get the time zone adjusted date in milliseconds
+ * DateTime.unsafeMakeZoned(0, { timeZone: "Europe/London" }).pipe(
+ *   DateTime.withDate((date) => date.getTime())
+ * )
+ * ```
+ */
+const withDate = exports.withDate = Internal.withDate;
+/**
+ * Using the time zone adjusted `Date`, apply a function to the `Date` and
+ * return the result.
+ *
+ * @since 3.6.0
+ * @category mapping
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // get the date in milliseconds
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.withDateUtc((date) => date.getTime())
+ * )
+ * ```
+ */
+const withDateUtc = exports.withDateUtc = Internal.withDateUtc;
+/**
+ * @since 3.6.0
+ * @category mapping
+ */
+const match = exports.match = Internal.match;
+// =============================================================================
+// math
+// =============================================================================
+/**
+ * Add the given `Duration` to a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // add 5 minutes
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.addDuration("5 minutes")
+ * )
+ * ```
+ */
+const addDuration = exports.addDuration = Internal.addDuration;
+/**
+ * Subtract the given `Duration` from a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // subtract 5 minutes
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.subtractDuration("5 minutes")
+ * )
+ * ```
+ */
+const subtractDuration = exports.subtractDuration = Internal.subtractDuration;
+/**
+ * Add the given `amount` of `unit`'s to a `DateTime`.
+ *
+ * The time zone is taken into account when adding days, weeks, months, and
+ * years.
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // add 5 minutes
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.add({ minutes: 5 })
+ * )
+ * ```
+ */
+const add = exports.add = Internal.add;
+/**
+ * Subtract the given `amount` of `unit`'s from a `DateTime`.
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // subtract 5 minutes
+ * DateTime.unsafeMake(0).pipe(
+ *   DateTime.subtract({ minutes: 5 })
+ * )
+ * ```
+ */
+const subtract = exports.subtract = Internal.subtract;
+/**
+ * Converts a `DateTime` to the start of the given `part`.
+ *
+ * If the part is `week`, the `weekStartsOn` option can be used to specify the
+ * day of the week that the week starts on. The default is 0 (Sunday).
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // returns "2024-01-01T00:00:00Z"
+ * DateTime.unsafeMake("2024-01-01T12:00:00Z").pipe(
+ *   DateTime.startOf("day"),
+ *   DateTime.formatIso
+ * )
+ * ```
+ */
+const startOf = exports.startOf = Internal.startOf;
+/**
+ * Converts a `DateTime` to the end of the given `part`.
+ *
+ * If the part is `week`, the `weekStartsOn` option can be used to specify the
+ * day of the week that the week starts on. The default is 0 (Sunday).
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // returns "2024-01-01T23:59:59.999Z"
+ * DateTime.unsafeMake("2024-01-01T12:00:00Z").pipe(
+ *   DateTime.endOf("day"),
+ *   DateTime.formatIso
+ * )
+ * ```
+ */
+const endOf = exports.endOf = Internal.endOf;
+/**
+ * Converts a `DateTime` to the nearest given `part`.
+ *
+ * If the part is `week`, the `weekStartsOn` option can be used to specify the
+ * day of the week that the week starts on. The default is 0 (Sunday).
+ *
+ * @since 3.6.0
+ * @category math
+ * @example
+ * ```ts
+ * import { DateTime } from "effect"
+ *
+ * // returns "2024-01-02T00:00:00Z"
+ * DateTime.unsafeMake("2024-01-01T12:01:00Z").pipe(
+ *   DateTime.nearest("day"),
+ *   DateTime.formatIso
+ * )
+ * ```
+ */
+const nearest = exports.nearest = Internal.nearest;
+// =============================================================================
+// formatting
+// =============================================================================
+/**
+ * Format a `DateTime` as a string using the `DateTimeFormat` API.
+ *
+ * The `timeZone` option is set to the offset of the time zone.
+ *
+ * Note: On Node versions < 22, fixed "Offset" zones will set the time zone to
+ * "UTC" and use the adjusted `Date`.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const format = exports.format = Internal.format;
+/**
+ * Format a `DateTime` as a string using the `DateTimeFormat` API.
+ *
+ * It will use the system's local time zone & locale.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatLocal = exports.formatLocal = Internal.formatLocal;
+/**
+ * Format a `DateTime` as a string using the `DateTimeFormat` API.
+ *
+ * This forces the time zone to be UTC.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatUtc = exports.formatUtc = Internal.formatUtc;
+/**
+ * Format a `DateTime` as a string using the `DateTimeFormat` API.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIntl = exports.formatIntl = Internal.formatIntl;
+/**
+ * Format a `DateTime` as a UTC ISO string.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIso = exports.formatIso = Internal.formatIso;
+/**
+ * Format a `DateTime` as a time zone adjusted ISO date string.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIsoDate = exports.formatIsoDate = Internal.formatIsoDate;
+/**
+ * Format a `DateTime` as a UTC ISO date string.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIsoDateUtc = exports.formatIsoDateUtc = Internal.formatIsoDateUtc;
+/**
+ * Format a `DateTime.Zoned` as a ISO string with an offset.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIsoOffset = exports.formatIsoOffset = Internal.formatIsoOffset;
+/**
+ * Format a `DateTime.Zoned` as a string.
+ *
+ * It uses the format: `YYYY-MM-DDTHH:mm:ss.sss+HH:MM[Time/Zone]`.
+ *
+ * @since 3.6.0
+ * @category formatting
+ */
+const formatIsoZoned = exports.formatIsoZoned = Internal.formatIsoZoned;
+/**
+ * Create a Layer from the given time zone.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ */
+const layerCurrentZone = zone => Layer.succeed(CurrentTimeZone, zone);
+/**
+ * Create a Layer from the given time zone offset.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ */
+exports.layerCurrentZone = layerCurrentZone;
+const layerCurrentZoneOffset = offset => Layer.succeed(CurrentTimeZone, Internal.zoneMakeOffset(offset));
+/**
+ * Create a Layer from the given IANA time zone identifier.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ */
+exports.layerCurrentZoneOffset = layerCurrentZoneOffset;
+const layerCurrentZoneNamed = zoneId => Layer.effect(CurrentTimeZone, Internal.zoneMakeNamedEffect(zoneId));
+/**
+ * Create a Layer from the systems local time zone.
+ *
+ * @since 3.6.0
+ * @category current time zone
+ */
+exports.layerCurrentZoneNamed = layerCurrentZoneNamed;
+const layerCurrentZoneLocal = exports.layerCurrentZoneLocal = /*#__PURE__*/Layer.sync(CurrentTimeZone, zoneMakeLocal);
+//# sourceMappingURL=DateTime.js.map

backend/node_modules/effect/dist/cjs/DateTime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DateTime.js","names":["Context","_interopRequireWildcard","require","Effect","_Function","Internal","Layer","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","TypeId","exports","TimeZoneTypeId","isDateTime","isTimeZone","isTimeZoneOffset","isTimeZoneNamed","isUtc","isZoned","Equivalence","Order","clamp","unsafeFromDate","unsafeMake","unsafeMakeZoned","makeZoned","make","makeZonedFromString","now","nowAsDate","unsafeNow","toUtc","setZone","setZoneOffset","zoneUnsafeMakeNamed","zoneMakeOffset","zoneMakeNamed","zoneMakeNamedEffect","zoneMakeLocal","zoneFromString","zoneToString","setZoneNamed","unsafeSetZoneNamed","distance","distanceDurationEither","distanceDuration","min","max","greaterThan","greaterThanOrEqualTo","lessThan","lessThanOrEqualTo","between","isFuture","unsafeIsFuture","isPast","unsafeIsPast","toDateUtc","toDate","zonedOffset","zonedOffsetIso","toEpochMillis","removeTime","toParts","toPartsUtc","getPartUtc","getPart","setParts","setPartsUtc","CurrentTimeZone","Tag","setZoneCurrent","self","map","zone","withCurrentZone","dual","effect","provideService","withCurrentZoneLocal","provideServiceEffect","sync","withCurrentZoneOffset","offset","withCurrentZoneNamed","nowInCurrentZone","flatMap","mutate","mutateUtc","mapEpochMillis","withDate","withDateUtc","match","addDuration","subtractDuration","add","subtract","startOf","endOf","nearest","format","formatLocal","formatUtc","formatIntl","formatIso","formatIsoDate","formatIsoDateUtc","formatIsoOffset","formatIsoZoned","layerCurrentZone","succeed","layerCurrentZoneOffset","layerCurrentZoneNamed","zoneId","layerCurrentZoneLocal"],"sources":["../../src/DateTime.ts"],"sourcesContent":[null],"mappings":";;;;;;AAIA,IAAAA,OAAA,GAAAC,uBAAA,CAAAC,OAAA;AAEA,IAAAC,MAAA,GAAAF,uBAAA,CAAAC,OAAA;AAGA,IAAAE,SAAA,GAAAF,OAAA;AAEA,IAAAG,QAAA,GAAAJ,uBAAA,CAAAC,OAAA;AACA,IAAAI,KAAA,GAAAL,uBAAA,CAAAC,OAAA;AAAmC,SAAAD,wBAAAM,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAR,uBAAA,YAAAA,CAAAM,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAKnC;;;;AAIO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,GAAkBrB,QAAQ,CAACqB,MAAM;AAgJpD;;;;AAIO,MAAME,cAAc,GAAAD,OAAA,CAAAC,cAAA,GAAkBvB,QAAQ,CAACuB,cAAc;AA8FpE;AACA;AACA;AAEA;;;;AAIO,MAAMC,UAAU,GAAAF,OAAA,CAAAE,UAAA,GAAkCxB,QAAQ,CAACwB,UAAU;AAE5E;;;;AAIO,MAAMC,UAAU,GAAAH,OAAA,CAAAG,UAAA,GAAkCzB,QAAQ,CAACyB,UAAU;AAE5E;;;;AAIO,MAAMC,gBAAgB,GAAAJ,OAAA,CAAAI,gBAAA,GAAyC1B,QAAQ,CAAC0B,gBAAgB;AAE/F;;;;AAIO,MAAMC,eAAe,GAAAL,OAAA,CAAAK,eAAA,GAAwC3B,QAAQ,CAAC2B,eAAe;AAE5F;;;;AAIO,MAAMC,KAAK,GAAAN,OAAA,CAAAM,KAAA,GAAoC5B,QAAQ,CAAC4B,KAAK;AAEpE;;;;AAIO,MAAMC,OAAO,GAAAP,OAAA,CAAAO,OAAA,GAAsC7B,QAAQ,CAAC6B,OAAO;AAE1E;AACA;AACA;AAEA;;;;AAIO,MAAMC,WAAW,GAAAR,OAAA,CAAAQ,WAAA,GAAsC9B,QAAQ,CAAC8B,WAAW;AAElF;;;;AAIO,MAAMC,KAAK,GAAAT,OAAA,CAAAS,KAAA,GAA0B/B,QAAQ,CAAC+B,KAAK;AAE1D;;;AAGO,MAAMC,KAAK,GAAAV,OAAA,CAAAU,KAAA,GASdhC,QAAQ,CAACgC,KAAK;AAElB;AACA;AACA;AAEA;;;;;;;;AAQO,MAAMC,cAAc,GAAAX,OAAA,CAAAW,cAAA,GAAwBjC,QAAQ,CAACiC,cAAc;AAE1E;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,UAAU,GAAAZ,OAAA,CAAAY,UAAA,GAAqElC,QAAQ,CAACkC,UAAU;AAE/G;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMC,eAAe,GAAAb,OAAA,CAAAa,eAAA,GAIdnC,QAAQ,CAACmC,eAAe;AAEtC;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,SAAS,GAAAd,OAAA,CAAAc,SAAA,GAOMpC,QAAQ,CAACoC,SAAS;AAE9C;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAMC,IAAI,GAAAf,OAAA,CAAAe,IAAA,GAAoFrC,QAAQ,CAACqC,IAAI;AAElH;;;;;;;;AAQO,MAAMC,mBAAmB,GAAAhB,OAAA,CAAAgB,mBAAA,GAA4CtC,QAAQ,CAACsC,mBAAmB;AAExG;;;;;;;;;;;;;;AAcO,MAAMC,GAAG,GAAAjB,OAAA,CAAAiB,GAAA,GAAuBvC,QAAQ,CAACuC,GAAG;AAEnD;;;;;;;;;;;;;;AAcO,MAAMC,SAAS,GAAAlB,OAAA,CAAAkB,SAAA,GAAwBxC,QAAQ,CAACwC,SAAS;AAEhE;;;;;;AAMO,MAAMC,SAAS,GAAAnB,OAAA,CAAAmB,SAAA,GAAiBzC,QAAQ,CAACyC,SAAS;AAEzD;AACA;AACA;AAEA;;;;;;;;;;;;;;;AAeO,MAAMC,KAAK,GAAApB,OAAA,CAAAoB,KAAA,GAA4B1C,QAAQ,CAAC0C,KAAK;AAE5D;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,OAAO,GAAArB,OAAA,CAAAqB,OAAA,GAoDhB3C,QAAQ,CAAC2C,OAAO;AAEpB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,aAAa,GAAAtB,OAAA,CAAAsB,aAAA,GAsDtB5C,QAAQ,CAAC4C,aAAa;AAE1B;;;;;;;;AAQO,MAAMC,mBAAmB,GAAAvB,OAAA,CAAAuB,mBAAA,GAAuC7C,QAAQ,CAAC6C,mBAAmB;AAEnG;;;;;;AAMO,MAAMC,cAAc,GAAAxB,OAAA,CAAAwB,cAAA,GAAwC9C,QAAQ,CAAC8C,cAAc;AAE1F;;;;;;;AAOO,MAAMC,aAAa,GAAAzB,OAAA,CAAAyB,aAAA,GAAsD/C,QAAQ,CAAC+C,aAAa;AAEtG;;;;;;;AAOO,MAAMC,mBAAmB,GAAA1B,OAAA,CAAA0B,mBAAA,GAC9BhD,QAAQ,CAACgD,mBAAmB;AAE9B;;;;;;AAMO,MAAMC,aAAa,GAAA3B,OAAA,CAAA2B,aAAA,GAAyBjD,QAAQ,CAACiD,aAAa;AAEzE;;;;;;AAMO,MAAMC,cAAc,GAAA5B,OAAA,CAAA4B,cAAA,GAA8ClD,QAAQ,CAACkD,cAAc;AAEhG;;;;;;;;;;;;;;;;AAgBO,MAAMC,YAAY,GAAA7B,OAAA,CAAA6B,YAAA,GAA+BnD,QAAQ,CAACmD,YAAY;AAE7E;;;;;;;;;;;;;;;;;AAiBO,MAAMC,YAAY,GAAA9B,OAAA,CAAA8B,YAAA,GAkDrBpD,QAAQ,CAACoD,YAAY;AAEzB;;;;;;;;;;;;;;;;;AAiBO,MAAMC,kBAAkB,GAAA/B,OAAA,CAAA+B,kBAAA,GAkD3BrD,QAAQ,CAACqD,kBAAkB;AAE/B;AACA;AACA;AAEA;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMC,QAAQ,GAAAhC,OAAA,CAAAgC,QAAA,GAqDjBtD,QAAQ,CAACsD,QAAQ;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAMC,sBAAsB,GAAAjC,OAAA,CAAAiC,sBAAA,GAyD/BvD,QAAQ,CAACuD,sBAAsB;AAEnC;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,gBAAgB,GAAAlC,OAAA,CAAAkC,gBAAA,GAuCzBxD,QAAQ,CAACwD,gBAAgB;AAE7B;;;;AAIO,MAAMC,GAAG,GAAAnC,OAAA,CAAAmC,GAAA,GAWZzD,QAAQ,CAACyD,GAAG;AAEhB;;;;AAIO,MAAMC,GAAG,GAAApC,OAAA,CAAAoC,GAAA,GAWZ1D,QAAQ,CAAC0D,GAAG;AAEhB;;;;AAIO,MAAMC,WAAW,GAAArC,OAAA,CAAAqC,WAAA,GAWpB3D,QAAQ,CAAC2D,WAAW;AAExB;;;;AAIO,MAAMC,oBAAoB,GAAAtC,OAAA,CAAAsC,oBAAA,GAW7B5D,QAAQ,CAAC4D,oBAAoB;AAEjC;;;;AAIO,MAAMC,QAAQ,GAAAvC,OAAA,CAAAuC,QAAA,GAWjB7D,QAAQ,CAAC6D,QAAQ;AAErB;;;;AAIO,MAAMC,iBAAiB,GAAAxC,OAAA,CAAAwC,iBAAA,GAW1B9D,QAAQ,CAAC8D,iBAAiB;AAE9B;;;;AAIO,MAAMC,OAAO,GAAAzC,OAAA,CAAAyC,OAAA,GAWhB/D,QAAQ,CAAC+D,OAAO;AAEpB;;;;AAIO,MAAMC,QAAQ,GAAA1C,OAAA,CAAA0C,QAAA,GAA+ChE,QAAQ,CAACgE,QAAQ;AAErF;;;;AAIO,MAAMC,cAAc,GAAA3C,OAAA,CAAA2C,cAAA,GAAgCjE,QAAQ,CAACiE,cAAc;AAElF;;;;AAIO,MAAMC,MAAM,GAAA5C,OAAA,CAAA4C,MAAA,GAA+ClE,QAAQ,CAACkE,MAAM;AAEjF;;;;AAIO,MAAMC,YAAY,GAAA7C,OAAA,CAAA6C,YAAA,GAAgCnE,QAAQ,CAACmE,YAAY;AAE9E;AACA;AACA;AAEA;;;;;;AAMO,MAAMC,SAAS,GAAA9C,OAAA,CAAA8C,SAAA,GAA6BpE,QAAQ,CAACoE,SAAS;AAErE;;;;;;AAMO,MAAMC,MAAM,GAAA/C,OAAA,CAAA+C,MAAA,GAA6BrE,QAAQ,CAACqE,MAAM;AAE/D;;;;;;AAMO,MAAMC,WAAW,GAAAhD,OAAA,CAAAgD,WAAA,GAA4BtE,QAAQ,CAACsE,WAAW;AAExE;;;;;;;;AAQO,MAAMC,cAAc,GAAAjD,OAAA,CAAAiD,cAAA,GAA4BvE,QAAQ,CAACuE,cAAc;AAE9E;;;;;;AAMO,MAAMC,aAAa,GAAAlD,OAAA,CAAAkD,aAAA,GAA+BxE,QAAQ,CAACwE,aAAa;AAE/E;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMC,UAAU,GAAAnD,OAAA,CAAAmD,UAAA,GAA4BzE,QAAQ,CAACyE,UAAU;AAEtE;AACA;AACA;AAEA;;;;;;;;AAQO,MAAMC,OAAO,GAAApD,OAAA,CAAAoD,OAAA,GAAkD1E,QAAQ,CAAC0E,OAAO;AAEtF;;;;;;;;AAQO,MAAMC,UAAU,GAAArD,OAAA,CAAAqD,UAAA,GAAkD3E,QAAQ,CAAC2E,UAAU;AAE5F;;;;;;;;;;;;;;;;;AAiBO,MAAMC,UAAU,GAAAtD,OAAA,CAAAsD,UAAA,GAqCnB5E,QAAQ,CAAC4E,UAAU;AAEvB;;;;;;;;;;;;;;;;;AAiBO,MAAMC,OAAO,GAAAvD,OAAA,CAAAuD,OAAA,GAqChB7E,QAAQ,CAAC6E,OAAO;AAEpB;;;;;;;;AAQO,MAAMC,QAAQ,GAAAxD,OAAA,CAAAwD,QAAA,GAmBjB9E,QAAQ,CAAC8E,QAAQ;AAErB;;;;;;AAMO,MAAMC,WAAW,GAAAzD,OAAA,CAAAyD,WAAA,GAepB/E,QAAQ,CAAC+E,WAAW;AAExB;AACA;AACA;AAEA;;;;AAIM,MAAOC,eAAgB,sBAAQrF,OAAO,CAACsF,GAAG,CAAC,iCAAiC,CAAC,EAA6B;AAEhH;;;;;;;;;;;;;;;;;;AAAA3D,OAAA,CAAA0D,eAAA,GAAAA,eAAA;AAkBO,MAAME,cAAc,GAAIC,IAAc,IAC3CrF,MAAM,CAACsF,GAAG,CAACJ,eAAe,EAAGK,IAAI,IAAK1C,OAAO,CAACwC,IAAI,EAAEE,IAAI,CAAC,CAAC;AAE5D;;;;;;;;;;;;;;;;AAAA/D,OAAA,CAAA4D,cAAA,GAAAA,cAAA;AAgBO,MAAMI,eAAe,GAAAhE,OAAA,CAAAgE,eAAA,gBAmCxB,IAAAC,cAAI,EACN,CAAC,EACD,CACEC,MAA8B,EAC9BH,IAAc,KACuCvF,MAAM,CAAC2F,cAAc,CAACD,MAAM,EAAER,eAAe,EAAEK,IAAI,CAAC,CAC5G;AAED;;;;;;;;;;;;;;;;AAgBO,MAAMK,oBAAoB,GAC/BF,MAA8B,IAE9B1F,MAAM,CAAC6F,oBAAoB,CAACH,MAAM,EAAER,eAAe,EAAElF,MAAM,CAAC8F,IAAI,CAAC3C,aAAa,CAAC,CAAC;AAElF;;;;;;;;;;;;;;;AAAA3B,OAAA,CAAAoE,oBAAA,GAAAA,oBAAA;AAeO,MAAMG,qBAAqB,GAAAvE,OAAA,CAAAuE,qBAAA,gBAmC9B,IAAAN,cAAI,EACN,CAAC,EACD,CAAUC,MAA8B,EAAEM,MAAc,KACtDhG,MAAM,CAAC2F,cAAc,CAACD,MAAM,EAAER,eAAe,EAAElC,cAAc,CAACgD,MAAM,CAAC,CAAC,CACzE;AAED;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,oBAAoB,GAAAzE,OAAA,CAAAyE,oBAAA,gBAyC7B,IAAAR,cAAI,EACN,CAAC,EACD,CACEC,MAA8B,EAC9BH,IAAY,KAEZvF,MAAM,CAAC6F,oBAAoB,CAACH,MAAM,EAAER,eAAe,EAAEhC,mBAAmB,CAACqC,IAAI,CAAC,CAAC,CAClF;AAED;;;;;;;;;;;;;;;AAeO,MAAMW,gBAAgB,GAAA1E,OAAA,CAAA0E,gBAAA,gBAAiDlG,MAAM,CAACmG,OAAO,CAAC1D,GAAG,EAAE2C,cAAc,CAAC;AAEjH;AACA;AACA;AAEA;;;;;;;;;;;AAWO,MAAMgB,MAAM,GAAA5E,OAAA,CAAA4E,MAAA,GA4CflG,QAAQ,CAACkG,MAAM;AAEnB;;;;;;AAMO,MAAMC,SAAS,GAAA7E,OAAA,CAAA6E,SAAA,GAelBnG,QAAQ,CAACmG,SAAS;AAEtB;;;;;;;;;;;;;;;;AAgBO,MAAMC,cAAc,GAAA9E,OAAA,CAAA8E,cAAA,GAmCvBpG,QAAQ,CAACoG,cAAc;AAE3B;;;;;;;;;;;;;;;;AAgBO,MAAMC,QAAQ,GAAA/E,OAAA,CAAA+E,QAAA,GAmCjBrG,QAAQ,CAACqG,QAAQ;AAErB;;;;;;;;;;;;;;;;AAgBO,MAAMC,WAAW,GAAAhF,OAAA,CAAAgF,WAAA,GAmCpBtG,QAAQ,CAACsG,WAAW;AAExB;;;;AAIO,MAAMC,KAAK,GAAAjF,OAAA,CAAAiF,KAAA,GAsBdvG,QAAQ,CAACuG,KAAK;AAElB;AACA;AACA;AAEA;;;;;;;;;;;;;;;AAeO,MAAMC,WAAW,GAAAlF,OAAA,CAAAkF,WAAA,GAyCpBxG,QAAQ,CAACwG,WAAW;AAExB;;;;;;;;;;;;;;;AAeO,MAAMC,gBAAgB,GAAAnF,OAAA,CAAAmF,gBAAA,GAiCzBzG,QAAQ,CAACyG,gBAAgB;AAE7B;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,GAAG,GAAApF,OAAA,CAAAoF,GAAA,GAuCZ1G,QAAQ,CAAC0G,GAAG;AAEhB;;;;;;;;;;;;;;;AAeO,MAAMC,QAAQ,GAAArF,OAAA,CAAAqF,QAAA,GAiCjB3G,QAAQ,CAAC2G,QAAQ;AAErB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,OAAO,GAAAtF,OAAA,CAAAsF,OAAA,GAgDhB5G,QAAQ,CAAC4G,OAAO;AAEpB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,KAAK,GAAAvF,OAAA,CAAAuF,KAAA,GAgDd7G,QAAQ,CAAC6G,KAAK;AAElB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,OAAO,GAAAxF,OAAA,CAAAwF,OAAA,GAgDhB9G,QAAQ,CAAC8G,OAAO;AAEpB;AACA;AACA;AAEA;;;;;;;;;;;AAWO,MAAMC,MAAM,GAAAzF,OAAA,CAAAyF,MAAA,GA8Cf/G,QAAQ,CAAC+G,MAAM;AAEnB;;;;;;;;AAQO,MAAMC,WAAW,GAAA1F,OAAA,CAAA0F,WAAA,GAgCpBhH,QAAQ,CAACgH,WAAW;AAExB;;;;;;;;AAQO,MAAMC,SAAS,GAAA3F,OAAA,CAAA2F,SAAA,GAgClBjH,QAAQ,CAACiH,SAAS;AAEtB;;;;;;AAMO,MAAMC,UAAU,GAAA5F,OAAA,CAAA4F,UAAA,GAenBlH,QAAQ,CAACkH,UAAU;AAEvB;;;;;;AAMO,MAAMC,SAAS,GAAA7F,OAAA,CAAA6F,SAAA,GAA+BnH,QAAQ,CAACmH,SAAS;AAEvE;;;;;;AAMO,MAAMC,aAAa,GAAA9F,OAAA,CAAA8F,aAAA,GAA+BpH,QAAQ,CAACoH,aAAa;AAE/E;;;;;;AAMO,MAAMC,gBAAgB,GAAA/F,OAAA,CAAA+F,gBAAA,GAA+BrH,QAAQ,CAACqH,gBAAgB;AAErF;;;;;;AAMO,MAAMC,eAAe,GAAAhG,OAAA,CAAAgG,eAAA,GAA+BtH,QAAQ,CAACsH,eAAe;AAEnF;;;;;;;;AAQO,MAAMC,cAAc,GAAAjG,OAAA,CAAAiG,cAAA,GAA4BvH,QAAQ,CAACuH,cAAc;AAE9E;;;;;;AAMO,MAAMC,gBAAgB,GAAInC,IAAc,IAAmCpF,KAAK,CAACwH,OAAO,CAACzC,eAAe,EAAEK,IAAI,CAAC;AAEtH;;;;;;AAAA/D,OAAA,CAAAkG,gBAAA,GAAAA,gBAAA;AAMO,MAAME,sBAAsB,GAAI5B,MAAc,IACnD7F,KAAK,CAACwH,OAAO,CAACzC,eAAe,EAAEhF,QAAQ,CAAC8C,cAAc,CAACgD,MAAM,CAAC,CAAC;AAEjE;;;;;;AAAAxE,OAAA,CAAAoG,sBAAA,GAAAA,sBAAA;AAMO,MAAMC,qBAAqB,GAChCC,MAAc,IAEd3H,KAAK,CAACuF,MAAM,CAACR,eAAe,EAAEhF,QAAQ,CAACgD,mBAAmB,CAAC4E,MAAM,CAAC,CAAC;AAErE;;;;;;AAAAtG,OAAA,CAAAqG,qBAAA,GAAAA,qBAAA;AAMO,MAAME,qBAAqB,GAAAvG,OAAA,CAAAuG,qBAAA,gBAAiC5H,KAAK,CAAC2F,IAAI,CAACZ,eAAe,EAAE/B,aAAa,CAAC","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Deferred.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Deferred.js","names":["core","_interopRequireWildcard","require","internal","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","DeferredTypeId","exports","make","deferredMake","makeAs","deferredMakeAs","_await","await","deferredAwait","complete","deferredComplete","completeWith","deferredCompleteWith","done","deferredDone","fail","deferredFail","failSync","deferredFailSync","failCause","deferredFailCause","failCauseSync","deferredFailCauseSync","die","deferredDie","dieSync","deferredDieSync","interrupt","deferredInterrupt","interruptWith","deferredInterruptWith","isDone","deferredIsDone","poll","deferredPoll","succeed","deferredSucceed","sync","deferredSync","unsafeMake","deferredUnsafeMake","unsafeDone","deferredUnsafeDone"],"sources":["../../src/Deferred.ts"],"sourcesContent":[null],"mappings":";;;;;;AAQA,IAAAA,IAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,QAAA,GAAAF,uBAAA,CAAAC,OAAA;AAAkD,SAAAD,wBAAAG,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAL,uBAAA,YAAAA,CAAAG,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAMlD;;;;AAIO,MAAMkB,cAAc,GAAAC,OAAA,CAAAD,cAAA,GAAkBpB,QAAQ,CAACoB,cAAc;AA8DpE;;;;;;AAMO,MAAME,IAAI,GAAAD,OAAA,CAAAC,IAAA,GAAsDzB,IAAI,CAAC0B,YAAY;AAExF;;;;;;AAMO,MAAMC,MAAM,GAAAH,OAAA,CAAAG,MAAA,GAA8E3B,IAAI,CAAC4B,cAAc;AAEpH,MAAMC,MAAM,GAAAL,OAAA,CAAAM,KAAA,GAAwD9B,IAAI,CAAC+B,aAAa;AAatF;;;;;;;;;;AAUO,MAAMC,QAAQ,GAAAR,OAAA,CAAAQ,QAAA,GAuBjBhC,IAAI,CAACiC,gBAAgB;AAEzB;;;;;;;AAOO,MAAMC,YAAY,GAAAV,OAAA,CAAAU,YAAA,GAiBrBlC,IAAI,CAACmC,oBAAoB;AAE7B;;;;;;;AAOO,MAAMC,IAAI,GAAAZ,OAAA,CAAAY,IAAA,GAiBbpC,IAAI,CAACqC,YAAY;AAErB;;;;;;;AAOO,MAAMC,IAAI,GAAAd,OAAA,CAAAc,IAAA,GAiBbtC,IAAI,CAACuC,YAAY;AAErB;;;;;;;AAOO,MAAMC,QAAQ,GAAAhB,OAAA,CAAAgB,QAAA,GAiBjBxC,IAAI,CAACyC,gBAAgB;AAEzB;;;;;;;AAOO,MAAMC,SAAS,GAAAlB,OAAA,CAAAkB,SAAA,GAiBlB1C,IAAI,CAAC2C,iBAAiB;AAE1B;;;;;;;AAOO,MAAMC,aAAa,GAAApB,OAAA,CAAAoB,aAAA,GAiBtB5C,IAAI,CAAC6C,qBAAqB;AAE9B;;;;;;;AAOO,MAAMC,GAAG,GAAAtB,OAAA,CAAAsB,GAAA,GAiBZ9C,IAAI,CAAC+C,WAAW;AAEpB;;;;;;;AAOO,MAAMC,OAAO,GAAAxB,OAAA,CAAAwB,OAAA,GAiBhBhD,IAAI,CAACiD,eAAe;AAExB;;;;;;;;AAQO,MAAMC,SAAS,GAAA1B,OAAA,CAAA0B,SAAA,GAA2DlD,IAAI,CAACmD,iBAAiB;AAEvG;;;;;;;AAOO,MAAMC,aAAa,GAAA5B,OAAA,CAAA4B,aAAA,GAiBtBpD,IAAI,CAACqD,qBAAqB;AAE9B;;;;;;;AAOO,MAAMC,MAAM,GAAA9B,OAAA,CAAA8B,MAAA,GAA2DtD,IAAI,CAACuD,cAAc;AAEjG;;;;;;;AAOO,MAAMC,IAAI,GAAAhC,OAAA,CAAAgC,IAAA,GAEwCxD,IAAI,CAACyD,YAAY;AAE1E;;;;;;AAMO,MAAMC,OAAO,GAAAlC,OAAA,CAAAkC,OAAA,GAehB1D,IAAI,CAAC2D,eAAe;AAExB;;;;;;AAMO,MAAMC,IAAI,GAAApC,OAAA,CAAAoC,IAAA,GAeb5D,IAAI,CAAC6D,YAAY;AAErB;;;;;;AAMO,MAAMC,UAAU,GAAAtC,OAAA,CAAAsC,UAAA,GAA+D9D,IAAI,CAAC+D,kBAAkB;AAE7G;;;;;;;AAOO,MAAMC,UAAU,GAAAxC,OAAA,CAAAwC,UAAA,GAAsEhE,IAAI,CAACiE,kBAAkB","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Differ.js

@@ -0,0 +1,140 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zip = exports.updateWith = exports.update = exports.transform = exports.readonlyArray = exports.patch = exports.orElseEither = exports.make = exports.hashSet = exports.hashMap = exports.environment = exports.empty = exports.diff = exports.combine = exports.chunk = exports.TypeId = void 0;
+var Dual = _interopRequireWildcard(require("./Function.js"));
+var internal = _interopRequireWildcard(require("./internal/differ.js"));
+var ChunkPatch = _interopRequireWildcard(require("./internal/differ/chunkPatch.js"));
+var ContextPatch = _interopRequireWildcard(require("./internal/differ/contextPatch.js"));
+var HashMapPatch = _interopRequireWildcard(require("./internal/differ/hashMapPatch.js"));
+var HashSetPatch = _interopRequireWildcard(require("./internal/differ/hashSetPatch.js"));
+var OrPatch = _interopRequireWildcard(require("./internal/differ/orPatch.js"));
+var ReadonlyArrayPatch = _interopRequireWildcard(require("./internal/differ/readonlyArrayPatch.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+const TypeId = exports.TypeId = internal.DifferTypeId;
+const ChunkPatchTypeId = ChunkPatch.ChunkPatchTypeId;
+const ContextPatchTypeId = ContextPatch.ContextPatchTypeId;
+const HashMapPatchTypeId = HashMapPatch.HashMapPatchTypeId;
+const HashSetPatchTypeId = HashSetPatch.HashSetPatchTypeId;
+const OrPatchTypeId = OrPatch.OrPatchTypeId;
+const ReadonlyArrayPatchTypeId = ReadonlyArrayPatch.ReadonlyArrayPatchTypeId;
+/**
+ * An empty patch that describes no changes.
+ *
+ * @since 2.0.0
+ * @category patch
+ */
+const empty = self => self.empty;
+/**
+ * @since 2.0.0
+ * @category patch
+ */
+exports.empty = empty;
+const diff = exports.diff = /*#__PURE__*/Dual.dual(3, (self, oldValue, newValue) => self.diff(oldValue, newValue));
+/**
+ * Combines two patches to produce a new patch that describes the updates of
+ * the first patch and then the updates of the second patch. The combine
+ * operation should be associative. In addition, if the combine operation is
+ * commutative then joining multiple fibers concurrently will result in
+ * deterministic `FiberRef` values.
+ *
+ * @since 2.0.0
+ * @category patch
+ */
+const combine = exports.combine = /*#__PURE__*/Dual.dual(3, (self, first, second) => self.combine(first, second));
+/**
+ * Applies a patch to an old value to produce a new value that is equal to the
+ * old value with the updates described by the patch.
+ *
+ * @since 2.0.0
+ * @category patch
+ */
+const patch = exports.patch = /*#__PURE__*/Dual.dual(3, (self, patch, oldValue) => self.patch(patch, oldValue));
+/**
+ * Constructs a new `Differ`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = exports.make = internal.make;
+/**
+ * Constructs a differ that knows how to diff `Env` values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const environment = exports.environment = internal.environment;
+/**
+ * Constructs a differ that knows how to diff a `Chunk` of values given a
+ * differ that knows how to diff the values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const chunk = exports.chunk = internal.chunk;
+/**
+ * Constructs a differ that knows how to diff a `HashMap` of keys and values given
+ * a differ that knows how to diff the values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const hashMap = exports.hashMap = internal.hashMap;
+/**
+ * Constructs a differ that knows how to diff a `HashSet` of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const hashSet = exports.hashSet = internal.hashSet;
+/**
+ * Combines this differ and the specified differ to produce a differ that
+ * knows how to diff the sum of their values.
+ *
+ * @since 2.0.0
+ */
+const orElseEither = exports.orElseEither = internal.orElseEither;
+/**
+ * Constructs a differ that knows how to diff a `ReadonlyArray` of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const readonlyArray = exports.readonlyArray = internal.readonlyArray;
+/**
+ * Transforms the type of values that this differ knows how to differ using
+ * the specified functions that map the new and old value types to each other.
+ *
+ * @since 2.0.0
+ */
+const transform = exports.transform = internal.transform;
+/**
+ * Constructs a differ that just diffs two values by returning a function that
+ * sets the value to the new value. This differ does not support combining
+ * multiple updates to the value compositionally and should only be used when
+ * there is no compositional way to update them.
+ *
+ * @since 2.0.0
+ */
+const update = exports.update = internal.update;
+/**
+ * A variant of `update` that allows specifying the function that will be used
+ * to combine old values with new values.
+ *
+ * @since 2.0.0
+ */
+const updateWith = exports.updateWith = internal.updateWith;
+/**
+ * Combines this differ and the specified differ to produce a new differ that
+ * knows how to diff the product of their values.
+ *
+ * @since 2.0.0
+ */
+const zip = exports.zip = internal.zip;
+//# sourceMappingURL=Differ.js.map

backend/node_modules/effect/dist/cjs/Duration.js

@@ -0,0 +1,737 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zero = exports.weeks = exports.unsafeToNanos = exports.unsafeFormatIso = exports.unsafeDivide = exports.toWeeks = exports.toSeconds = exports.toNanos = exports.toMinutes = exports.toMillis = exports.toHrTime = exports.toHours = exports.toDays = exports.times = exports.sum = exports.subtract = exports.seconds = exports.parts = exports.nanos = exports.minutes = exports.min = exports.millis = exports.micros = exports.max = exports.matchWith = exports.match = exports.lessThanOrEqualTo = exports.lessThan = exports.isZero = exports.isFinite = exports.isDuration = exports.infinity = exports.hours = exports.greaterThanOrEqualTo = exports.greaterThan = exports.fromIso = exports.formatIso = exports.format = exports.equals = exports.divide = exports.decodeUnknown = exports.decode = exports.days = exports.clamp = exports.between = exports.Order = exports.Equivalence = void 0;
+var Equal = _interopRequireWildcard(require("./Equal.js"));
+var _Function = require("./Function.js");
+var Hash = _interopRequireWildcard(require("./Hash.js"));
+var _Inspectable = require("./Inspectable.js");
+var Option = _interopRequireWildcard(require("./Option.js"));
+var order = _interopRequireWildcard(require("./Order.js"));
+var _Pipeable = require("./Pipeable.js");
+var _Predicate = require("./Predicate.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+const TypeId = /*#__PURE__*/Symbol.for("effect/Duration");
+const bigint0 = /*#__PURE__*/BigInt(0);
+const bigint24 = /*#__PURE__*/BigInt(24);
+const bigint60 = /*#__PURE__*/BigInt(60);
+const bigint1e3 = /*#__PURE__*/BigInt(1_000);
+const bigint1e6 = /*#__PURE__*/BigInt(1_000_000);
+const bigint1e9 = /*#__PURE__*/BigInt(1_000_000_000);
+const DURATION_REGEX = /^(-?\d+(?:\.\d+)?)\s+(nanos?|micros?|millis?|seconds?|minutes?|hours?|days?|weeks?)$/;
+/**
+ * @since 2.0.0
+ */
+const decode = input => {
+  if (isDuration(input)) {
+    return input;
+  } else if ((0, _Predicate.isNumber)(input)) {
+    return millis(input);
+  } else if ((0, _Predicate.isBigInt)(input)) {
+    return nanos(input);
+  } else if (Array.isArray(input) && input.length === 2 && input.every(_Predicate.isNumber)) {
+    if (input[0] === -Infinity || input[1] === -Infinity || Number.isNaN(input[0]) || Number.isNaN(input[1])) {
+      return zero;
+    }
+    if (input[0] === Infinity || input[1] === Infinity) {
+      return infinity;
+    }
+    return nanos(BigInt(Math.round(input[0] * 1_000_000_000)) + BigInt(Math.round(input[1])));
+  } else if ((0, _Predicate.isString)(input)) {
+    const match = DURATION_REGEX.exec(input);
+    if (match) {
+      const [_, valueStr, unit] = match;
+      const value = Number(valueStr);
+      switch (unit) {
+        case "nano":
+        case "nanos":
+          return nanos(BigInt(valueStr));
+        case "micro":
+        case "micros":
+          return micros(BigInt(valueStr));
+        case "milli":
+        case "millis":
+          return millis(value);
+        case "second":
+        case "seconds":
+          return seconds(value);
+        case "minute":
+        case "minutes":
+          return minutes(value);
+        case "hour":
+        case "hours":
+          return hours(value);
+        case "day":
+        case "days":
+          return days(value);
+        case "week":
+        case "weeks":
+          return weeks(value);
+      }
+    }
+  }
+  throw new Error("Invalid DurationInput");
+};
+/**
+ * @since 2.5.0
+ */
+exports.decode = decode;
+const decodeUnknown = exports.decodeUnknown = /*#__PURE__*/Option.liftThrowable(decode);
+const zeroValue = {
+  _tag: "Millis",
+  millis: 0
+};
+const infinityValue = {
+  _tag: "Infinity"
+};
+const DurationProto = {
+  [TypeId]: TypeId,
+  [Hash.symbol]() {
+    return Hash.cached(this, Hash.structure(this.value));
+  },
+  [Equal.symbol](that) {
+    return isDuration(that) && equals(this, that);
+  },
+  toString() {
+    return `Duration(${format(this)})`;
+  },
+  toJSON() {
+    switch (this.value._tag) {
+      case "Millis":
+        return {
+          _id: "Duration",
+          _tag: "Millis",
+          millis: this.value.millis
+        };
+      case "Nanos":
+        return {
+          _id: "Duration",
+          _tag: "Nanos",
+          hrtime: toHrTime(this)
+        };
+      case "Infinity":
+        return {
+          _id: "Duration",
+          _tag: "Infinity"
+        };
+    }
+  },
+  [_Inspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return (0, _Pipeable.pipeArguments)(this, arguments);
+  }
+};
+const make = input => {
+  const duration = Object.create(DurationProto);
+  if ((0, _Predicate.isNumber)(input)) {
+    if (isNaN(input) || input <= 0) {
+      duration.value = zeroValue;
+    } else if (!Number.isFinite(input)) {
+      duration.value = infinityValue;
+    } else if (!Number.isInteger(input)) {
+      duration.value = {
+        _tag: "Nanos",
+        nanos: BigInt(Math.round(input * 1_000_000))
+      };
+    } else {
+      duration.value = {
+        _tag: "Millis",
+        millis: input
+      };
+    }
+  } else if (input <= bigint0) {
+    duration.value = zeroValue;
+  } else {
+    duration.value = {
+      _tag: "Nanos",
+      nanos: input
+    };
+  }
+  return duration;
+};
+/**
+ * @since 2.0.0
+ * @category guards
+ */
+const isDuration = u => (0, _Predicate.hasProperty)(u, TypeId);
+/**
+ * @since 2.0.0
+ * @category guards
+ */
+exports.isDuration = isDuration;
+const isFinite = self => self.value._tag !== "Infinity";
+/**
+ * @since 3.5.0
+ * @category guards
+ */
+exports.isFinite = isFinite;
+const isZero = self => {
+  switch (self.value._tag) {
+    case "Millis":
+      {
+        return self.value.millis === 0;
+      }
+    case "Nanos":
+      {
+        return self.value.nanos === bigint0;
+      }
+    case "Infinity":
+      {
+        return false;
+      }
+  }
+};
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.isZero = isZero;
+const zero = exports.zero = /*#__PURE__*/make(0);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const infinity = exports.infinity = /*#__PURE__*/make(Infinity);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const nanos = nanos => make(nanos);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.nanos = nanos;
+const micros = micros => make(micros * bigint1e3);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.micros = micros;
+const millis = millis => make(millis);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.millis = millis;
+const seconds = seconds => make(seconds * 1000);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.seconds = seconds;
+const minutes = minutes => make(minutes * 60_000);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.minutes = minutes;
+const hours = hours => make(hours * 3_600_000);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.hours = hours;
+const days = days => make(days * 86_400_000);
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.days = days;
+const weeks = weeks => make(weeks * 604_800_000);
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+exports.weeks = weeks;
+const toMillis = self => match(self, {
+  onMillis: millis => millis,
+  onNanos: nanos => Number(nanos) / 1_000_000
+});
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+exports.toMillis = toMillis;
+const toSeconds = self => match(self, {
+  onMillis: millis => millis / 1_000,
+  onNanos: nanos => Number(nanos) / 1_000_000_000
+});
+/**
+ * @since 3.8.0
+ * @category getters
+ */
+exports.toSeconds = toSeconds;
+const toMinutes = self => match(self, {
+  onMillis: millis => millis / 60_000,
+  onNanos: nanos => Number(nanos) / 60_000_000_000
+});
+/**
+ * @since 3.8.0
+ * @category getters
+ */
+exports.toMinutes = toMinutes;
+const toHours = self => match(self, {
+  onMillis: millis => millis / 3_600_000,
+  onNanos: nanos => Number(nanos) / 3_600_000_000_000
+});
+/**
+ * @since 3.8.0
+ * @category getters
+ */
+exports.toHours = toHours;
+const toDays = self => match(self, {
+  onMillis: millis => millis / 86_400_000,
+  onNanos: nanos => Number(nanos) / 86_400_000_000_000
+});
+/**
+ * @since 3.8.0
+ * @category getters
+ */
+exports.toDays = toDays;
+const toWeeks = self => match(self, {
+  onMillis: millis => millis / 604_800_000,
+  onNanos: nanos => Number(nanos) / 604_800_000_000_000
+});
+/**
+ * Get the duration in nanoseconds as a bigint.
+ *
+ * If the duration is infinite, returns `Option.none()`
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+exports.toWeeks = toWeeks;
+const toNanos = self => {
+  const _self = decode(self);
+  switch (_self.value._tag) {
+    case "Infinity":
+      return Option.none();
+    case "Nanos":
+      return Option.some(_self.value.nanos);
+    case "Millis":
+      return Option.some(BigInt(Math.round(_self.value.millis * 1_000_000)));
+  }
+};
+/**
+ * Get the duration in nanoseconds as a bigint.
+ *
+ * If the duration is infinite, it throws an error.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+exports.toNanos = toNanos;
+const unsafeToNanos = self => {
+  const _self = decode(self);
+  switch (_self.value._tag) {
+    case "Infinity":
+      throw new Error("Cannot convert infinite duration to nanos");
+    case "Nanos":
+      return _self.value.nanos;
+    case "Millis":
+      return BigInt(Math.round(_self.value.millis * 1_000_000));
+  }
+};
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+exports.unsafeToNanos = unsafeToNanos;
+const toHrTime = self => {
+  const _self = decode(self);
+  switch (_self.value._tag) {
+    case "Infinity":
+      return [Infinity, 0];
+    case "Nanos":
+      return [Number(_self.value.nanos / bigint1e9), Number(_self.value.nanos % bigint1e9)];
+    case "Millis":
+      return [Math.floor(_self.value.millis / 1000), Math.round(_self.value.millis % 1000 * 1_000_000)];
+  }
+};
+/**
+ * @since 2.0.0
+ * @category pattern matching
+ */
+exports.toHrTime = toHrTime;
+const match = exports.match = /*#__PURE__*/(0, _Function.dual)(2, (self, options) => {
+  const _self = decode(self);
+  switch (_self.value._tag) {
+    case "Nanos":
+      return options.onNanos(_self.value.nanos);
+    case "Infinity":
+      return options.onMillis(Infinity);
+    case "Millis":
+      return options.onMillis(_self.value.millis);
+  }
+});
+/**
+ * @since 2.0.0
+ * @category pattern matching
+ */
+const matchWith = exports.matchWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, options) => {
+  const _self = decode(self);
+  const _that = decode(that);
+  if (_self.value._tag === "Infinity" || _that.value._tag === "Infinity") {
+    return options.onMillis(toMillis(_self), toMillis(_that));
+  } else if (_self.value._tag === "Nanos" || _that.value._tag === "Nanos") {
+    const selfNanos = _self.value._tag === "Nanos" ? _self.value.nanos : BigInt(Math.round(_self.value.millis * 1_000_000));
+    const thatNanos = _that.value._tag === "Nanos" ? _that.value.nanos : BigInt(Math.round(_that.value.millis * 1_000_000));
+    return options.onNanos(selfNanos, thatNanos);
+  }
+  return options.onMillis(_self.value.millis, _that.value.millis);
+});
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Order = exports.Order = /*#__PURE__*/order.make((self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self < that ? -1 : self > that ? 1 : 0,
+  onNanos: (self, that) => self < that ? -1 : self > that ? 1 : 0
+}));
+/**
+ * Checks if a `Duration` is between a `minimum` and `maximum` value.
+ *
+ * @category predicates
+ * @since 2.0.0
+ */
+const between = exports.between = /*#__PURE__*/order.between(/*#__PURE__*/order.mapInput(Order, decode));
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Equivalence = (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self === that,
+  onNanos: (self, that) => self === that
+});
+exports.Equivalence = Equivalence;
+const _min = /*#__PURE__*/order.min(Order);
+/**
+ * @since 2.0.0
+ */
+const min = exports.min = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => _min(decode(self), decode(that)));
+const _max = /*#__PURE__*/order.max(Order);
+/**
+ * @since 2.0.0
+ * @category order
+ */
+const max = exports.max = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => _max(decode(self), decode(that)));
+const _clamp = /*#__PURE__*/order.clamp(Order);
+/**
+ * @since 2.0.0
+ * @category order
+ */
+const clamp = exports.clamp = /*#__PURE__*/(0, _Function.dual)(2, (self, options) => _clamp(decode(self), {
+  minimum: decode(options.minimum),
+  maximum: decode(options.maximum)
+}));
+/**
+ * @since 2.4.19
+ * @category math
+ */
+const divide = exports.divide = /*#__PURE__*/(0, _Function.dual)(2, (self, by) => match(self, {
+  onMillis: millis => {
+    if (by === 0 || isNaN(by) || !Number.isFinite(by)) {
+      return Option.none();
+    }
+    return Option.some(make(millis / by));
+  },
+  onNanos: nanos => {
+    if (isNaN(by) || by <= 0 || !Number.isFinite(by)) {
+      return Option.none();
+    }
+    try {
+      return Option.some(make(nanos / BigInt(by)));
+    } catch {
+      return Option.none();
+    }
+  }
+}));
+/**
+ * @since 2.4.19
+ * @category math
+ */
+const unsafeDivide = exports.unsafeDivide = /*#__PURE__*/(0, _Function.dual)(2, (self, by) => match(self, {
+  onMillis: millis => make(millis / by),
+  onNanos: nanos => {
+    if (isNaN(by) || by < 0 || Object.is(by, -0)) {
+      return zero;
+    } else if (Object.is(by, 0) || !Number.isFinite(by)) {
+      return infinity;
+    }
+    return make(nanos / BigInt(by));
+  }
+}));
+/**
+ * @since 2.0.0
+ * @category math
+ */
+const times = exports.times = /*#__PURE__*/(0, _Function.dual)(2, (self, times) => match(self, {
+  onMillis: millis => make(millis * times),
+  onNanos: nanos => make(nanos * BigInt(times))
+}));
+/**
+ * @since 2.0.0
+ * @category math
+ */
+const subtract = exports.subtract = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => make(self - that),
+  onNanos: (self, that) => make(self - that)
+}));
+/**
+ * @since 2.0.0
+ * @category math
+ */
+const sum = exports.sum = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => make(self + that),
+  onNanos: (self, that) => make(self + that)
+}));
+/**
+ * @since 2.0.0
+ * @category predicates
+ */
+const lessThan = exports.lessThan = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self < that,
+  onNanos: (self, that) => self < that
+}));
+/**
+ * @since 2.0.0
+ * @category predicates
+ */
+const lessThanOrEqualTo = exports.lessThanOrEqualTo = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self <= that,
+  onNanos: (self, that) => self <= that
+}));
+/**
+ * @since 2.0.0
+ * @category predicates
+ */
+const greaterThan = exports.greaterThan = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self > that,
+  onNanos: (self, that) => self > that
+}));
+/**
+ * @since 2.0.0
+ * @category predicates
+ */
+const greaterThanOrEqualTo = exports.greaterThanOrEqualTo = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => matchWith(self, that, {
+  onMillis: (self, that) => self >= that,
+  onNanos: (self, that) => self >= that
+}));
+/**
+ * @since 2.0.0
+ * @category predicates
+ */
+const equals = exports.equals = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => Equivalence(decode(self), decode(that)));
+/**
+ * Converts a `Duration` to its parts.
+ *
+ * @since 3.8.0
+ * @category conversions
+ */
+const parts = self => {
+  const duration = decode(self);
+  if (duration.value._tag === "Infinity") {
+    return {
+      days: Infinity,
+      hours: Infinity,
+      minutes: Infinity,
+      seconds: Infinity,
+      millis: Infinity,
+      nanos: Infinity
+    };
+  }
+  const nanos = unsafeToNanos(duration);
+  const ms = nanos / bigint1e6;
+  const sec = ms / bigint1e3;
+  const min = sec / bigint60;
+  const hr = min / bigint60;
+  const days = hr / bigint24;
+  return {
+    days: Number(days),
+    hours: Number(hr % bigint24),
+    minutes: Number(min % bigint60),
+    seconds: Number(sec % bigint60),
+    millis: Number(ms % bigint1e3),
+    nanos: Number(nanos % bigint1e6)
+  };
+};
+/**
+ * Converts a `Duration` to a human readable string.
+ *
+ * @since 2.0.0
+ * @category conversions
+ * @example
+ * ```ts
+ * import { Duration } from "effect"
+ *
+ * Duration.format(Duration.millis(1000)) // "1s"
+ * Duration.format(Duration.millis(1001)) // "1s 1ms"
+ * ```
+ */
+exports.parts = parts;
+const format = self => {
+  const duration = decode(self);
+  if (duration.value._tag === "Infinity") {
+    return "Infinity";
+  }
+  if (isZero(duration)) {
+    return "0";
+  }
+  const fragments = parts(duration);
+  const pieces = [];
+  if (fragments.days !== 0) {
+    pieces.push(`${fragments.days}d`);
+  }
+  if (fragments.hours !== 0) {
+    pieces.push(`${fragments.hours}h`);
+  }
+  if (fragments.minutes !== 0) {
+    pieces.push(`${fragments.minutes}m`);
+  }
+  if (fragments.seconds !== 0) {
+    pieces.push(`${fragments.seconds}s`);
+  }
+  if (fragments.millis !== 0) {
+    pieces.push(`${fragments.millis}ms`);
+  }
+  if (fragments.nanos !== 0) {
+    pieces.push(`${fragments.nanos}ns`);
+  }
+  return pieces.join(" ");
+};
+/**
+ * Formats a Duration into an ISO8601 duration string.
+ *
+ * Months are assumed to be 30 days and years are assumed to be 365 days.
+ *
+ * Milliseconds and nanoseconds are expressed as fractional seconds.
+ *
+ * @example
+ * ```ts
+ * import { Duration } from "effect"
+ *
+ * Duration.unsafeFormatIso(Duration.days(1)) // => "P1D"
+ * Duration.unsafeFormatIso(Duration.minutes(90)) // => "PT1H30M"
+ * Duration.unsafeFormatIso(Duration.millis(1500)) // => "PT1.5S"
+ * ```
+ *
+ * @throws `RangeError` If the duration is not finite.
+ *
+ * @since 3.13.0
+ * @category conversions
+ */
+exports.format = format;
+const unsafeFormatIso = self => {
+  const duration = decode(self);
+  if (!isFinite(duration)) {
+    throw new RangeError("Cannot format infinite duration");
+  }
+  const fragments = [];
+  const {
+    days,
+    hours,
+    millis,
+    minutes,
+    nanos,
+    seconds
+  } = parts(duration);
+  let rest = days;
+  if (rest >= 365) {
+    const years = Math.floor(rest / 365);
+    rest %= 365;
+    fragments.push(`${years}Y`);
+  }
+  if (rest >= 30) {
+    const months = Math.floor(rest / 30);
+    rest %= 30;
+    fragments.push(`${months}M`);
+  }
+  if (rest >= 7) {
+    const weeks = Math.floor(rest / 7);
+    rest %= 7;
+    fragments.push(`${weeks}W`);
+  }
+  if (rest > 0) {
+    fragments.push(`${rest}D`);
+  }
+  if (hours !== 0 || minutes !== 0 || seconds !== 0 || millis !== 0 || nanos !== 0) {
+    fragments.push("T");
+    if (hours !== 0) {
+      fragments.push(`${hours}H`);
+    }
+    if (minutes !== 0) {
+      fragments.push(`${minutes}M`);
+    }
+    if (seconds !== 0 || millis !== 0 || nanos !== 0) {
+      const total = BigInt(seconds) * bigint1e9 + BigInt(millis) * bigint1e6 + BigInt(nanos);
+      const str = (Number(total) / 1e9).toFixed(9).replace(/\.?0+$/, "");
+      fragments.push(`${str}S`);
+    }
+  }
+  return `P${fragments.join("") || "T0S"}`;
+};
+/**
+ * Formats a Duration into an ISO8601 duration string.
+ *
+ * Months are assumed to be 30 days and years are assumed to be 365 days.
+ *
+ * Returns `Option.none()` if the duration is infinite.
+ *
+ * @example
+ * ```ts
+ * import { Duration, Option } from "effect"
+ *
+ * Duration.formatIso(Duration.days(1)) // => Option.some("P1D")
+ * Duration.formatIso(Duration.minutes(90)) // => Option.some("PT1H30M")
+ * Duration.formatIso(Duration.millis(1500)) // => Option.some("PT1.5S")
+ * Duration.formatIso(Duration.infinity) // => Option.none()
+ * ```
+ *
+ * @since 3.13.0
+ * @category conversions
+ */
+exports.unsafeFormatIso = unsafeFormatIso;
+const formatIso = self => {
+  const duration = decode(self);
+  return isFinite(duration) ? Option.some(unsafeFormatIso(duration)) : Option.none();
+};
+/**
+ * Parses an ISO8601 duration string into a `Duration`.
+ *
+ * Months are assumed to be 30 days and years are assumed to be 365 days.
+ *
+ * @example
+ * ```ts
+ * import { Duration, Option } from "effect"
+ *
+ * Duration.fromIso("P1D") // => Option.some(Duration.days(1))
+ * Duration.fromIso("PT1H") // => Option.some(Duration.hours(1))
+ * Duration.fromIso("PT1M") // => Option.some(Duration.minutes(1))
+ * Duration.fromIso("PT1.5S") // => Option.some(Duration.seconds(1.5))
+ * ```
+ *
+ * @since 3.13.0
+ * @category conversions
+ */
+exports.formatIso = formatIso;
+const fromIso = iso => {
+  const result = DURATION_ISO_REGEX.exec(iso);
+  if (result == null) {
+    return Option.none();
+  }
+  const [years, months, weeks, days, hours, mins, secs] = result.slice(1, 8).map(_ => _ ? Number(_) : 0);
+  const value = years * 365 * 24 * 60 * 60 + months * 30 * 24 * 60 * 60 + weeks * 7 * 24 * 60 * 60 + days * 24 * 60 * 60 + hours * 60 * 60 + mins * 60 + secs;
+  return Option.some(seconds(value));
+};
+exports.fromIso = fromIso;
+const DURATION_ISO_REGEX = /^P(?!$)(?:(\d+)Y)?(?:(\d+)M)?(?:(\d+)W)?(?:(\d+)D)?(?:T(?!$)(?:(\d+)H)?(?:(\d+)M)?(?:(\d+(?:\.\d+)?)S)?)?$/;
+//# sourceMappingURL=Duration.js.map

backend/node_modules/effect/dist/cjs/Duration.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Duration.js","names":["Equal","_interopRequireWildcard","require","_Function","Hash","_Inspectable","Option","order","_Pipeable","_Predicate","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","TypeId","Symbol","for","bigint0","BigInt","bigint24","bigint60","bigint1e3","bigint1e6","bigint1e9","DURATION_REGEX","decode","input","isDuration","isNumber","millis","isBigInt","nanos","Array","isArray","length","every","Infinity","Number","isNaN","zero","infinity","Math","round","isString","match","exec","_","valueStr","unit","value","micros","seconds","minutes","hours","days","weeks","Error","exports","decodeUnknown","liftThrowable","zeroValue","_tag","infinityValue","DurationProto","symbol","cached","structure","that","equals","toString","format","toJSON","_id","hrtime","toHrTime","NodeInspectSymbol","pipe","pipeArguments","arguments","make","duration","create","isFinite","isInteger","u","hasProperty","self","isZero","toMillis","onMillis","onNanos","toSeconds","toMinutes","toHours","toDays","toWeeks","toNanos","_self","none","some","unsafeToNanos","floor","dual","options","matchWith","_that","selfNanos","thatNanos","Order","between","mapInput","Equivalence","_min","min","_max","max","_clamp","clamp","minimum","maximum","divide","by","unsafeDivide","is","times","subtract","sum","lessThan","lessThanOrEqualTo","greaterThan","greaterThanOrEqualTo","parts","ms","sec","hr","fragments","pieces","push","join","unsafeFormatIso","RangeError","rest","years","months","total","str","toFixed","replace","formatIso","fromIso","iso","result","DURATION_ISO_REGEX","mins","secs","slice","map"],"sources":["../../src/Duration.ts"],"sourcesContent":[null],"mappings":";;;;;;AAGA,IAAAA,KAAA,GAAAC,uBAAA,CAAAC,OAAA;AAEA,IAAAC,SAAA,GAAAD,OAAA;AACA,IAAAE,IAAA,GAAAH,uBAAA,CAAAC,OAAA;AAEA,IAAAG,YAAA,GAAAH,OAAA;AACA,IAAAI,MAAA,GAAAL,uBAAA,CAAAC,OAAA;AACA,IAAAK,KAAA,GAAAN,uBAAA,CAAAC,OAAA;AAEA,IAAAM,SAAA,GAAAN,OAAA;AACA,IAAAO,UAAA,GAAAP,OAAA;AAA0E,SAAAD,wBAAAS,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAX,uBAAA,YAAAA,CAAAS,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAb1E;;;;AAeA,MAAMkB,MAAM,gBAAkBC,MAAM,CAACC,GAAG,CAAC,iBAAiB,CAAC;AAE3D,MAAMC,OAAO,gBAAGC,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMC,QAAQ,gBAAGD,MAAM,CAAC,EAAE,CAAC;AAC3B,MAAME,QAAQ,gBAAGF,MAAM,CAAC,EAAE,CAAC;AAC3B,MAAMG,SAAS,gBAAGH,MAAM,CAAC,KAAK,CAAC;AAC/B,MAAMI,SAAS,gBAAGJ,MAAM,CAAC,SAAS,CAAC;AACnC,MAAMK,SAAS,gBAAGL,MAAM,CAAC,aAAa,CAAC;AAkEvC,MAAMM,cAAc,GAAG,sFAAsF;AAE7G;;;AAGO,MAAMC,MAAM,GAAIC,KAAoB,IAAc;EACvD,IAAIC,UAAU,CAACD,KAAK,CAAC,EAAE;IACrB,OAAOA,KAAK;EACd,CAAC,MAAM,IAAI,IAAAE,mBAAQ,EAACF,KAAK,CAAC,EAAE;IAC1B,OAAOG,MAAM,CAACH,KAAK,CAAC;EACtB,CAAC,MAAM,IAAI,IAAAI,mBAAQ,EAACJ,KAAK,CAAC,EAAE;IAC1B,OAAOK,KAAK,CAACL,KAAK,CAAC;EACrB,CAAC,MAAM,IAAIM,KAAK,CAACC,OAAO,CAACP,KAAK,CAAC,IAAIA,KAAK,CAACQ,MAAM,KAAK,CAAC,IAAIR,KAAK,CAACS,KAAK,CAACP,mBAAQ,CAAC,EAAE;IAC9E,IAAIF,KAAK,CAAC,CAAC,CAAC,KAAK,CAACU,QAAQ,IAAIV,KAAK,CAAC,CAAC,CAAC,KAAK,CAACU,QAAQ,IAAIC,MAAM,CAACC,KAAK,CAACZ,KAAK,CAAC,CAAC,CAAC,CAAC,IAAIW,MAAM,CAACC,KAAK,CAACZ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;MACxG,OAAOa,IAAI;IACb;IAEA,IAAIb,KAAK,CAAC,CAAC,CAAC,KAAKU,QAAQ,IAAIV,KAAK,CAAC,CAAC,CAAC,KAAKU,QAAQ,EAAE;MAClD,OAAOI,QAAQ;IACjB;IAEA,OAAOT,KAAK,CAACb,MAAM,CAACuB,IAAI,CAACC,KAAK,CAAChB,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,GAAGR,MAAM,CAACuB,IAAI,CAACC,KAAK,CAAChB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;EAC3F,CAAC,MAAM,IAAI,IAAAiB,mBAAQ,EAACjB,KAAK,CAAC,EAAE;IAC1B,MAAMkB,KAAK,GAAGpB,cAAc,CAACqB,IAAI,CAACnB,KAAK,CAAC;IACxC,IAAIkB,KAAK,EAAE;MACT,MAAM,CAACE,CAAC,EAAEC,QAAQ,EAAEC,IAAI,CAAC,GAAGJ,KAAK;MACjC,MAAMK,KAAK,GAAGZ,MAAM,CAACU,QAAQ,CAAC;MAC9B,QAAQC,IAAI;QACV,KAAK,MAAM;QACX,KAAK,OAAO;UACV,OAAOjB,KAAK,CAACb,MAAM,CAAC6B,QAAQ,CAAC,CAAC;QAChC,KAAK,OAAO;QACZ,KAAK,QAAQ;UACX,OAAOG,MAAM,CAAChC,MAAM,CAAC6B,QAAQ,CAAC,CAAC;QACjC,KAAK,OAAO;QACZ,KAAK,QAAQ;UACX,OAAOlB,MAAM,CAACoB,KAAK,CAAC;QACtB,KAAK,QAAQ;QACb,KAAK,SAAS;UACZ,OAAOE,OAAO,CAACF,KAAK,CAAC;QACvB,KAAK,QAAQ;QACb,KAAK,SAAS;UACZ,OAAOG,OAAO,CAACH,KAAK,CAAC;QACvB,KAAK,MAAM;QACX,KAAK,OAAO;UACV,OAAOI,KAAK,CAACJ,KAAK,CAAC;QACrB,KAAK,KAAK;QACV,KAAK,MAAM;UACT,OAAOK,IAAI,CAACL,KAAK,CAAC;QACpB,KAAK,MAAM;QACX,KAAK,OAAO;UACV,OAAOM,KAAK,CAACN,KAAK,CAAC;MACvB;IACF;EACF;EACA,MAAM,IAAIO,KAAK,CAAC,uBAAuB,CAAC;AAC1C,CAAC;AAED;;;AAAAC,OAAA,CAAAhC,MAAA,GAAAA,MAAA;AAGO,MAAMiC,aAAa,GAAAD,OAAA,CAAAC,aAAA,gBAA4CnE,MAAM,CAACoE,aAAa,CAAClC,MAAM,CAAQ;AAEzG,MAAMmC,SAAS,GAAkB;EAAEC,IAAI,EAAE,QAAQ;EAAEhC,MAAM,EAAE;AAAC,CAAE;AAC9D,MAAMiC,aAAa,GAAkB;EAAED,IAAI,EAAE;AAAU,CAAE;AAEzD,MAAME,aAAa,GAA4B;EAC7C,CAACjD,MAAM,GAAGA,MAAM;EAChB,CAACzB,IAAI,CAAC2E,MAAM,IAAC;IACX,OAAO3E,IAAI,CAAC4E,MAAM,CAAC,IAAI,EAAE5E,IAAI,CAAC6E,SAAS,CAAC,IAAI,CAACjB,KAAK,CAAC,CAAC;EACtD,CAAC;EACD,CAAChE,KAAK,CAAC+E,MAAM,EAAkBG,IAAa;IAC1C,OAAOxC,UAAU,CAACwC,IAAI,CAAC,IAAIC,MAAM,CAAC,IAAI,EAAED,IAAI,CAAC;EAC/C,CAAC;EACDE,QAAQA,CAAA;IACN,OAAO,YAAYC,MAAM,CAAC,IAAI,CAAC,GAAG;EACpC,CAAC;EACDC,MAAMA,CAAA;IACJ,QAAQ,IAAI,CAACtB,KAAK,CAACY,IAAI;MACrB,KAAK,QAAQ;QACX,OAAO;UAAEW,GAAG,EAAE,UAAU;UAAEX,IAAI,EAAE,QAAQ;UAAEhC,MAAM,EAAE,IAAI,CAACoB,KAAK,CAACpB;QAAM,CAAE;MACvE,KAAK,OAAO;QACV,OAAO;UAAE2C,GAAG,EAAE,UAAU;UAAEX,IAAI,EAAE,OAAO;UAAEY,MAAM,EAAEC,QAAQ,CAAC,IAAI;QAAC,CAAE;MACnE,KAAK,UAAU;QACb,OAAO;UAAEF,GAAG,EAAE,UAAU;UAAEX,IAAI,EAAE;QAAU,CAAE;IAChD;EACF,CAAC;EACD,CAACc,8BAAiB,IAAC;IACjB,OAAO,IAAI,CAACJ,MAAM,EAAE;EACtB,CAAC;EACDK,IAAIA,CAAA;IACF,OAAO,IAAAC,uBAAa,EAAC,IAAI,EAAEC,SAAS,CAAC;EACvC;CACQ;AAEV,MAAMC,IAAI,GAAIrD,KAAsB,IAAc;EAChD,MAAMsD,QAAQ,GAAGrE,MAAM,CAACsE,MAAM,CAAClB,aAAa,CAAC;EAC7C,IAAI,IAAAnC,mBAAQ,EAACF,KAAK,CAAC,EAAE;IACnB,IAAIY,KAAK,CAACZ,KAAK,CAAC,IAAIA,KAAK,IAAI,CAAC,EAAE;MAC9BsD,QAAQ,CAAC/B,KAAK,GAAGW,SAAS;IAC5B,CAAC,MAAM,IAAI,CAACvB,MAAM,CAAC6C,QAAQ,CAACxD,KAAK,CAAC,EAAE;MAClCsD,QAAQ,CAAC/B,KAAK,GAAGa,aAAa;IAChC,CAAC,MAAM,IAAI,CAACzB,MAAM,CAAC8C,SAAS,CAACzD,KAAK,CAAC,EAAE;MACnCsD,QAAQ,CAAC/B,KAAK,GAAG;QAAEY,IAAI,EAAE,OAAO;QAAE9B,KAAK,EAAEb,MAAM,CAACuB,IAAI,CAACC,KAAK,CAAChB,KAAK,GAAG,SAAS,CAAC;MAAC,CAAE;IAClF,CAAC,MAAM;MACLsD,QAAQ,CAAC/B,KAAK,GAAG;QAAEY,IAAI,EAAE,QAAQ;QAAEhC,MAAM,EAAEH;MAAK,CAAE;IACpD;EACF,CAAC,MAAM,IAAIA,KAAK,IAAIT,OAAO,EAAE;IAC3B+D,QAAQ,CAAC/B,KAAK,GAAGW,SAAS;EAC5B,CAAC,MAAM;IACLoB,QAAQ,CAAC/B,KAAK,GAAG;MAAEY,IAAI,EAAE,OAAO;MAAE9B,KAAK,EAAEL;IAAK,CAAE;EAClD;EACA,OAAOsD,QAAQ;AACjB,CAAC;AAED;;;;AAIO,MAAMrD,UAAU,GAAIyD,CAAU,IAAoB,IAAAC,sBAAW,EAACD,CAAC,EAAEtE,MAAM,CAAC;AAE/E;;;;AAAA2C,OAAA,CAAA9B,UAAA,GAAAA,UAAA;AAIO,MAAMuD,QAAQ,GAAII,IAAc,IAAcA,IAAI,CAACrC,KAAK,CAACY,IAAI,KAAK,UAAU;AAEnF;;;;AAAAJ,OAAA,CAAAyB,QAAA,GAAAA,QAAA;AAIO,MAAMK,MAAM,GAAID,IAAc,IAAa;EAChD,QAAQA,IAAI,CAACrC,KAAK,CAACY,IAAI;IACrB,KAAK,QAAQ;MAAE;QACb,OAAOyB,IAAI,CAACrC,KAAK,CAACpB,MAAM,KAAK,CAAC;MAChC;IACA,KAAK,OAAO;MAAE;QACZ,OAAOyD,IAAI,CAACrC,KAAK,CAAClB,KAAK,KAAKd,OAAO;MACrC;IACA,KAAK,UAAU;MAAE;QACf,OAAO,KAAK;MACd;EACF;AACF,CAAC;AAED;;;;AAAAwC,OAAA,CAAA8B,MAAA,GAAAA,MAAA;AAIO,MAAMhD,IAAI,GAAAkB,OAAA,CAAAlB,IAAA,gBAAawC,IAAI,CAAC,CAAC,CAAC;AAErC;;;;AAIO,MAAMvC,QAAQ,GAAAiB,OAAA,CAAAjB,QAAA,gBAAauC,IAAI,CAAC3C,QAAQ,CAAC;AAEhD;;;;AAIO,MAAML,KAAK,GAAIA,KAAa,IAAegD,IAAI,CAAChD,KAAK,CAAC;AAE7D;;;;AAAA0B,OAAA,CAAA1B,KAAA,GAAAA,KAAA;AAIO,MAAMmB,MAAM,GAAIA,MAAc,IAAe6B,IAAI,CAAC7B,MAAM,GAAG7B,SAAS,CAAC;AAE5E;;;;AAAAoC,OAAA,CAAAP,MAAA,GAAAA,MAAA;AAIO,MAAMrB,MAAM,GAAIA,MAAc,IAAekD,IAAI,CAAClD,MAAM,CAAC;AAEhE;;;;AAAA4B,OAAA,CAAA5B,MAAA,GAAAA,MAAA;AAIO,MAAMsB,OAAO,GAAIA,OAAe,IAAe4B,IAAI,CAAC5B,OAAO,GAAG,IAAI,CAAC;AAE1E;;;;AAAAM,OAAA,CAAAN,OAAA,GAAAA,OAAA;AAIO,MAAMC,OAAO,GAAIA,OAAe,IAAe2B,IAAI,CAAC3B,OAAO,GAAG,MAAM,CAAC;AAE5E;;;;AAAAK,OAAA,CAAAL,OAAA,GAAAA,OAAA;AAIO,MAAMC,KAAK,GAAIA,KAAa,IAAe0B,IAAI,CAAC1B,KAAK,GAAG,SAAS,CAAC;AAEzE;;;;AAAAI,OAAA,CAAAJ,KAAA,GAAAA,KAAA;AAIO,MAAMC,IAAI,GAAIA,IAAY,IAAeyB,IAAI,CAACzB,IAAI,GAAG,UAAU,CAAC;AAEvE;;;;AAAAG,OAAA,CAAAH,IAAA,GAAAA,IAAA;AAIO,MAAMC,KAAK,GAAIA,KAAa,IAAewB,IAAI,CAACxB,KAAK,GAAG,WAAW,CAAC;AAE3E;;;;AAAAE,OAAA,CAAAF,KAAA,GAAAA,KAAA;AAIO,MAAMiC,QAAQ,GAAIF,IAAmB,IAC1C1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM;EAC5B6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;AAAA0B,OAAA,CAAA+B,QAAA,GAAAA,QAAA;AAIO,MAAMG,SAAS,GAAIL,IAAmB,IAC3C1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM,GAAG,KAAK;EACpC6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;AAAA0B,OAAA,CAAAkC,SAAA,GAAAA,SAAA;AAIO,MAAMC,SAAS,GAAIN,IAAmB,IAC3C1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM,GAAG,MAAM;EACrC6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;AAAA0B,OAAA,CAAAmC,SAAA,GAAAA,SAAA;AAIO,MAAMC,OAAO,GAAIP,IAAmB,IACzC1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM,GAAG,SAAS;EACxC6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;AAAA0B,OAAA,CAAAoC,OAAA,GAAAA,OAAA;AAIO,MAAMC,MAAM,GAAIR,IAAmB,IACxC1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM,GAAG,UAAU;EACzC6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;AAAA0B,OAAA,CAAAqC,MAAA,GAAAA,MAAA;AAIO,MAAMC,OAAO,GAAIT,IAAmB,IACzC1C,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKA,MAAM,GAAG,WAAW;EAC1C6D,OAAO,EAAG3D,KAAK,IAAKM,MAAM,CAACN,KAAK,CAAC,GAAG;CACrC,CAAC;AAEJ;;;;;;;;AAAA0B,OAAA,CAAAsC,OAAA,GAAAA,OAAA;AAQO,MAAMC,OAAO,GAAIV,IAAmB,IAA2B;EACpE,MAAMW,KAAK,GAAGxE,MAAM,CAAC6D,IAAI,CAAC;EAC1B,QAAQW,KAAK,CAAChD,KAAK,CAACY,IAAI;IACtB,KAAK,UAAU;MACb,OAAOtE,MAAM,CAAC2G,IAAI,EAAE;IACtB,KAAK,OAAO;MACV,OAAO3G,MAAM,CAAC4G,IAAI,CAACF,KAAK,CAAChD,KAAK,CAAClB,KAAK,CAAC;IACvC,KAAK,QAAQ;MACX,OAAOxC,MAAM,CAAC4G,IAAI,CAACjF,MAAM,CAACuB,IAAI,CAACC,KAAK,CAACuD,KAAK,CAAChD,KAAK,CAACpB,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC;EAC1E;AACF,CAAC;AAED;;;;;;;;AAAA4B,OAAA,CAAAuC,OAAA,GAAAA,OAAA;AAQO,MAAMI,aAAa,GAAId,IAAmB,IAAY;EAC3D,MAAMW,KAAK,GAAGxE,MAAM,CAAC6D,IAAI,CAAC;EAC1B,QAAQW,KAAK,CAAChD,KAAK,CAACY,IAAI;IACtB,KAAK,UAAU;MACb,MAAM,IAAIL,KAAK,CAAC,2CAA2C,CAAC;IAC9D,KAAK,OAAO;MACV,OAAOyC,KAAK,CAAChD,KAAK,CAAClB,KAAK;IAC1B,KAAK,QAAQ;MACX,OAAOb,MAAM,CAACuB,IAAI,CAACC,KAAK,CAACuD,KAAK,CAAChD,KAAK,CAACpB,MAAM,GAAG,SAAS,CAAC,CAAC;EAC7D;AACF,CAAC;AAED;;;;AAAA4B,OAAA,CAAA2C,aAAA,GAAAA,aAAA;AAIO,MAAM1B,QAAQ,GAAIY,IAAmB,IAAsC;EAChF,MAAMW,KAAK,GAAGxE,MAAM,CAAC6D,IAAI,CAAC;EAC1B,QAAQW,KAAK,CAAChD,KAAK,CAACY,IAAI;IACtB,KAAK,UAAU;MACb,OAAO,CAACzB,QAAQ,EAAE,CAAC,CAAC;IACtB,KAAK,OAAO;MACV,OAAO,CACLC,MAAM,CAAC4D,KAAK,CAAChD,KAAK,CAAClB,KAAK,GAAGR,SAAS,CAAC,EACrCc,MAAM,CAAC4D,KAAK,CAAChD,KAAK,CAAClB,KAAK,GAAGR,SAAS,CAAC,CACtC;IACH,KAAK,QAAQ;MACX,OAAO,CACLkB,IAAI,CAAC4D,KAAK,CAACJ,KAAK,CAAChD,KAAK,CAACpB,MAAM,GAAG,IAAI,CAAC,EACrCY,IAAI,CAACC,KAAK,CAAEuD,KAAK,CAAChD,KAAK,CAACpB,MAAM,GAAG,IAAI,GAAI,SAAS,CAAC,CACpD;EACL;AACF,CAAC;AAED;;;;AAAA4B,OAAA,CAAAiB,QAAA,GAAAA,QAAA;AAIO,MAAM9B,KAAK,GAAAa,OAAA,CAAAb,KAAA,gBAsBd,IAAA0D,cAAI,EAAC,CAAC,EAAE,CACVhB,IAAmB,EACnBiB,OAGC,KACQ;EACT,MAAMN,KAAK,GAAGxE,MAAM,CAAC6D,IAAI,CAAC;EAC1B,QAAQW,KAAK,CAAChD,KAAK,CAACY,IAAI;IACtB,KAAK,OAAO;MACV,OAAO0C,OAAO,CAACb,OAAO,CAACO,KAAK,CAAChD,KAAK,CAAClB,KAAK,CAAC;IAC3C,KAAK,UAAU;MACb,OAAOwE,OAAO,CAACd,QAAQ,CAACrD,QAAQ,CAAC;IACnC,KAAK,QAAQ;MACX,OAAOmE,OAAO,CAACd,QAAQ,CAACQ,KAAK,CAAChD,KAAK,CAACpB,MAAM,CAAC;EAC/C;AACF,CAAC,CAAC;AAEF;;;;AAIO,MAAM2E,SAAS,GAAA/C,OAAA,CAAA+C,SAAA,gBAwBlB,IAAAF,cAAI,EAAC,CAAC,EAAE,CACVhB,IAAmB,EACnBnB,IAAmB,EACnBoC,OAGC,KACQ;EACT,MAAMN,KAAK,GAAGxE,MAAM,CAAC6D,IAAI,CAAC;EAC1B,MAAMmB,KAAK,GAAGhF,MAAM,CAAC0C,IAAI,CAAC;EAC1B,IAAI8B,KAAK,CAAChD,KAAK,CAACY,IAAI,KAAK,UAAU,IAAI4C,KAAK,CAACxD,KAAK,CAACY,IAAI,KAAK,UAAU,EAAE;IACtE,OAAO0C,OAAO,CAACd,QAAQ,CACrBD,QAAQ,CAACS,KAAK,CAAC,EACfT,QAAQ,CAACiB,KAAK,CAAC,CAChB;EACH,CAAC,MAAM,IAAIR,KAAK,CAAChD,KAAK,CAACY,IAAI,KAAK,OAAO,IAAI4C,KAAK,CAACxD,KAAK,CAACY,IAAI,KAAK,OAAO,EAAE;IACvE,MAAM6C,SAAS,GAAGT,KAAK,CAAChD,KAAK,CAACY,IAAI,KAAK,OAAO,GAC5CoC,KAAK,CAAChD,KAAK,CAAClB,KAAK,GACjBb,MAAM,CAACuB,IAAI,CAACC,KAAK,CAACuD,KAAK,CAAChD,KAAK,CAACpB,MAAM,GAAG,SAAS,CAAC,CAAC;IACpD,MAAM8E,SAAS,GAAGF,KAAK,CAACxD,KAAK,CAACY,IAAI,KAAK,OAAO,GAC5C4C,KAAK,CAACxD,KAAK,CAAClB,KAAK,GACjBb,MAAM,CAACuB,IAAI,CAACC,KAAK,CAAC+D,KAAK,CAACxD,KAAK,CAACpB,MAAM,GAAG,SAAS,CAAC,CAAC;IACpD,OAAO0E,OAAO,CAACb,OAAO,CAACgB,SAAS,EAAEC,SAAS,CAAC;EAC9C;EAEA,OAAOJ,OAAO,CAACd,QAAQ,CACrBQ,KAAK,CAAChD,KAAK,CAACpB,MAAM,EAClB4E,KAAK,CAACxD,KAAK,CAACpB,MAAM,CACnB;AACH,CAAC,CAAC;AAEF;;;;AAIO,MAAM+E,KAAK,GAAAnD,OAAA,CAAAmD,KAAA,gBAA0BpH,KAAK,CAACuF,IAAI,CAAC,CAACO,IAAI,EAAEnB,IAAI,KAChEqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAMmB,IAAI,GAAGnB,IAAI,GAAG,CAAC,CAAC,GAAGmB,IAAI,GAAGnB,IAAI,GAAG,CAAC,GAAG,CAAE;EAClEuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAMmB,IAAI,GAAGnB,IAAI,GAAG,CAAC,CAAC,GAAGmB,IAAI,GAAGnB,IAAI,GAAG,CAAC,GAAG;CAChE,CAAC,CACH;AAED;;;;;;AAMO,MAAM0C,OAAO,GAAApD,OAAA,CAAAoD,OAAA,gBA0BhBrH,KAAK,CAACqH,OAAO,cAACrH,KAAK,CAACsH,QAAQ,CAACF,KAAK,EAAEnF,MAAM,CAAC,CAAC;AAEhD;;;;AAIO,MAAMsF,WAAW,GAAsCA,CAACzB,IAAI,EAAEnB,IAAI,KACvEqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,KAAKnB,IAAI;EACvCuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,KAAKnB;CACnC,CAAC;AAAAV,OAAA,CAAAsD,WAAA,GAAAA,WAAA;AAEJ,MAAMC,IAAI,gBAAGxH,KAAK,CAACyH,GAAG,CAACL,KAAK,CAAC;AAE7B;;;AAGO,MAAMK,GAAG,GAAAxD,OAAA,CAAAwD,GAAA,gBASZ,IAAAX,cAAI,EAAC,CAAC,EAAE,CAAChB,IAAmB,EAAEnB,IAAmB,KAAe6C,IAAI,CAACvF,MAAM,CAAC6D,IAAI,CAAC,EAAE7D,MAAM,CAAC0C,IAAI,CAAC,CAAC,CAAC;AAErG,MAAM+C,IAAI,gBAAG1H,KAAK,CAAC2H,GAAG,CAACP,KAAK,CAAC;AAE7B;;;;AAIO,MAAMO,GAAG,GAAA1D,OAAA,CAAA0D,GAAA,gBAWZ,IAAAb,cAAI,EAAC,CAAC,EAAE,CAAChB,IAAmB,EAAEnB,IAAmB,KAAe+C,IAAI,CAACzF,MAAM,CAAC6D,IAAI,CAAC,EAAE7D,MAAM,CAAC0C,IAAI,CAAC,CAAC,CAAC;AAErG,MAAMiD,MAAM,gBAAG5H,KAAK,CAAC6H,KAAK,CAACT,KAAK,CAAC;AAEjC;;;;AAIO,MAAMS,KAAK,GAAA5D,OAAA,CAAA4D,KAAA,gBAsBd,IAAAf,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEiB,OAGrB,KACCa,MAAM,CAAC3F,MAAM,CAAC6D,IAAI,CAAC,EAAE;EACnBgC,OAAO,EAAE7F,MAAM,CAAC8E,OAAO,CAACe,OAAO,CAAC;EAChCC,OAAO,EAAE9F,MAAM,CAAC8E,OAAO,CAACgB,OAAO;CAChC,CAAC,CACL;AAED;;;;AAIO,MAAMC,MAAM,GAAA/D,OAAA,CAAA+D,MAAA,gBAWf,IAAAlB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEmC,EAAU,KAC9B7E,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAI;IACnB,IAAI4F,EAAE,KAAK,CAAC,IAAInF,KAAK,CAACmF,EAAE,CAAC,IAAI,CAACpF,MAAM,CAAC6C,QAAQ,CAACuC,EAAE,CAAC,EAAE;MACjD,OAAOlI,MAAM,CAAC2G,IAAI,EAAE;IACtB;IACA,OAAO3G,MAAM,CAAC4G,IAAI,CAACpB,IAAI,CAAClD,MAAM,GAAG4F,EAAE,CAAC,CAAC;EACvC,CAAC;EACD/B,OAAO,EAAG3D,KAAK,IAAI;IACjB,IAAIO,KAAK,CAACmF,EAAE,CAAC,IAAIA,EAAE,IAAI,CAAC,IAAI,CAACpF,MAAM,CAAC6C,QAAQ,CAACuC,EAAE,CAAC,EAAE;MAChD,OAAOlI,MAAM,CAAC2G,IAAI,EAAE;IACtB;IACA,IAAI;MACF,OAAO3G,MAAM,CAAC4G,IAAI,CAACpB,IAAI,CAAChD,KAAK,GAAGb,MAAM,CAACuG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,MAAM;MACN,OAAOlI,MAAM,CAAC2G,IAAI,EAAE;IACtB;EACF;CACD,CAAC,CACL;AAED;;;;AAIO,MAAMwB,YAAY,GAAAjE,OAAA,CAAAiE,YAAA,gBAWrB,IAAApB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEmC,EAAU,KAC9B7E,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKkD,IAAI,CAAClD,MAAM,GAAG4F,EAAE,CAAC;EACvC/B,OAAO,EAAG3D,KAAK,IAAI;IACjB,IAAIO,KAAK,CAACmF,EAAE,CAAC,IAAIA,EAAE,GAAG,CAAC,IAAI9G,MAAM,CAACgH,EAAE,CAACF,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;MAC5C,OAAOlF,IAAI;IACb,CAAC,MAAM,IAAI5B,MAAM,CAACgH,EAAE,CAACF,EAAE,EAAE,CAAC,CAAC,IAAI,CAACpF,MAAM,CAAC6C,QAAQ,CAACuC,EAAE,CAAC,EAAE;MACnD,OAAOjF,QAAQ;IACjB;IACA,OAAOuC,IAAI,CAAChD,KAAK,GAAGb,MAAM,CAACuG,EAAE,CAAC,CAAC;EACjC;CACD,CAAC,CACL;AAED;;;;AAIO,MAAMG,KAAK,GAAAnE,OAAA,CAAAmE,KAAA,gBAWd,IAAAtB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEsC,KAAa,KACjChF,KAAK,CAAC0C,IAAI,EAAE;EACVG,QAAQ,EAAG5D,MAAM,IAAKkD,IAAI,CAAClD,MAAM,GAAG+F,KAAK,CAAC;EAC1ClC,OAAO,EAAG3D,KAAK,IAAKgD,IAAI,CAAChD,KAAK,GAAGb,MAAM,CAAC0G,KAAK,CAAC;CAC/C,CAAC,CACL;AAED;;;;AAIO,MAAMC,QAAQ,GAAApE,OAAA,CAAAoE,QAAA,gBAWjB,IAAAvB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKY,IAAI,CAACO,IAAI,GAAGnB,IAAI,CAAC;EAC3CuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKY,IAAI,CAACO,IAAI,GAAGnB,IAAI;CAC1C,CAAC,CACL;AAED;;;;AAIO,MAAM2D,GAAG,GAAArE,OAAA,CAAAqE,GAAA,gBAWZ,IAAAxB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKY,IAAI,CAACO,IAAI,GAAGnB,IAAI,CAAC;EAC3CuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKY,IAAI,CAACO,IAAI,GAAGnB,IAAI;CAC1C,CAAC,CACL;AAED;;;;AAIO,MAAM4D,QAAQ,GAAAtE,OAAA,CAAAsE,QAAA,gBAWjB,IAAAzB,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,GAAGnB,IAAI;EACrCuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,GAAGnB;CACjC,CAAC,CACL;AAED;;;;AAIO,MAAM6D,iBAAiB,GAAAvE,OAAA,CAAAuE,iBAAA,gBAW1B,IAAA1B,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,IAAInB,IAAI;EACtCuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,IAAInB;CAClC,CAAC,CACL;AAED;;;;AAIO,MAAM8D,WAAW,GAAAxE,OAAA,CAAAwE,WAAA,gBAWpB,IAAA3B,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,GAAGnB,IAAI;EACrCuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,GAAGnB;CACjC,CAAC,CACL;AAED;;;;AAIO,MAAM+D,oBAAoB,GAAAzE,OAAA,CAAAyE,oBAAA,gBAW7B,IAAA5B,cAAI,EACN,CAAC,EACD,CAAChB,IAAmB,EAAEnB,IAAmB,KACvCqC,SAAS,CAAClB,IAAI,EAAEnB,IAAI,EAAE;EACpBsB,QAAQ,EAAEA,CAACH,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,IAAInB,IAAI;EACtCuB,OAAO,EAAEA,CAACJ,IAAI,EAAEnB,IAAI,KAAKmB,IAAI,IAAInB;CAClC,CAAC,CACL;AAED;;;;AAIO,MAAMC,MAAM,GAAAX,OAAA,CAAAW,MAAA,gBAWf,IAAAkC,cAAI,EAAC,CAAC,EAAE,CAAChB,IAAmB,EAAEnB,IAAmB,KAAc4C,WAAW,CAACtF,MAAM,CAAC6D,IAAI,CAAC,EAAE7D,MAAM,CAAC0C,IAAI,CAAC,CAAC,CAAC;AAE3G;;;;;;AAMO,MAAMgE,KAAK,GAAI7C,IAAmB,IAOrC;EACF,MAAMN,QAAQ,GAAGvD,MAAM,CAAC6D,IAAI,CAAC;EAC7B,IAAIN,QAAQ,CAAC/B,KAAK,CAACY,IAAI,KAAK,UAAU,EAAE;IACtC,OAAO;MACLP,IAAI,EAAElB,QAAQ;MACdiB,KAAK,EAAEjB,QAAQ;MACfgB,OAAO,EAAEhB,QAAQ;MACjBe,OAAO,EAAEf,QAAQ;MACjBP,MAAM,EAAEO,QAAQ;MAChBL,KAAK,EAAEK;KACR;EACH;EAEA,MAAML,KAAK,GAAGqE,aAAa,CAACpB,QAAQ,CAAC;EACrC,MAAMoD,EAAE,GAAGrG,KAAK,GAAGT,SAAS;EAC5B,MAAM+G,GAAG,GAAGD,EAAE,GAAG/G,SAAS;EAC1B,MAAM4F,GAAG,GAAGoB,GAAG,GAAGjH,QAAQ;EAC1B,MAAMkH,EAAE,GAAGrB,GAAG,GAAG7F,QAAQ;EACzB,MAAMkC,IAAI,GAAGgF,EAAE,GAAGnH,QAAQ;EAE1B,OAAO;IACLmC,IAAI,EAAEjB,MAAM,CAACiB,IAAI,CAAC;IAClBD,KAAK,EAAEhB,MAAM,CAACiG,EAAE,GAAGnH,QAAQ,CAAC;IAC5BiC,OAAO,EAAEf,MAAM,CAAC4E,GAAG,GAAG7F,QAAQ,CAAC;IAC/B+B,OAAO,EAAEd,MAAM,CAACgG,GAAG,GAAGjH,QAAQ,CAAC;IAC/BS,MAAM,EAAEQ,MAAM,CAAC+F,EAAE,GAAG/G,SAAS,CAAC;IAC9BU,KAAK,EAAEM,MAAM,CAACN,KAAK,GAAGT,SAAS;GAChC;AACH,CAAC;AAED;;;;;;;;;;;;;AAAAmC,OAAA,CAAA0E,KAAA,GAAAA,KAAA;AAaO,MAAM7D,MAAM,GAAIgB,IAAmB,IAAY;EACpD,MAAMN,QAAQ,GAAGvD,MAAM,CAAC6D,IAAI,CAAC;EAC7B,IAAIN,QAAQ,CAAC/B,KAAK,CAACY,IAAI,KAAK,UAAU,EAAE;IACtC,OAAO,UAAU;EACnB;EACA,IAAI0B,MAAM,CAACP,QAAQ,CAAC,EAAE;IACpB,OAAO,GAAG;EACZ;EAEA,MAAMuD,SAAS,GAAGJ,KAAK,CAACnD,QAAQ,CAAC;EACjC,MAAMwD,MAAM,GAAG,EAAE;EACjB,IAAID,SAAS,CAACjF,IAAI,KAAK,CAAC,EAAE;IACxBkF,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAACjF,IAAI,GAAG,CAAC;EACnC;EAEA,IAAIiF,SAAS,CAAClF,KAAK,KAAK,CAAC,EAAE;IACzBmF,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAAClF,KAAK,GAAG,CAAC;EACpC;EAEA,IAAIkF,SAAS,CAACnF,OAAO,KAAK,CAAC,EAAE;IAC3BoF,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAACnF,OAAO,GAAG,CAAC;EACtC;EAEA,IAAImF,SAAS,CAACpF,OAAO,KAAK,CAAC,EAAE;IAC3BqF,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAACpF,OAAO,GAAG,CAAC;EACtC;EAEA,IAAIoF,SAAS,CAAC1G,MAAM,KAAK,CAAC,EAAE;IAC1B2G,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAAC1G,MAAM,IAAI,CAAC;EACtC;EAEA,IAAI0G,SAAS,CAACxG,KAAK,KAAK,CAAC,EAAE;IACzByG,MAAM,CAACC,IAAI,CAAC,GAAGF,SAAS,CAACxG,KAAK,IAAI,CAAC;EACrC;EAEA,OAAOyG,MAAM,CAACE,IAAI,CAAC,GAAG,CAAC;AACzB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;AAAAjF,OAAA,CAAAa,MAAA,GAAAA,MAAA;AAqBO,MAAMqE,eAAe,GAAIrD,IAAmB,IAAY;EAC7D,MAAMN,QAAQ,GAAGvD,MAAM,CAAC6D,IAAI,CAAC;EAC7B,IAAI,CAACJ,QAAQ,CAACF,QAAQ,CAAC,EAAE;IACvB,MAAM,IAAI4D,UAAU,CAAC,iCAAiC,CAAC;EACzD;EAEA,MAAML,SAAS,GAAG,EAAE;EACpB,MAAM;IACJjF,IAAI;IACJD,KAAK;IACLxB,MAAM;IACNuB,OAAO;IACPrB,KAAK;IACLoB;EAAO,CACR,GAAGgF,KAAK,CAACnD,QAAQ,CAAC;EAEnB,IAAI6D,IAAI,GAAGvF,IAAI;EACf,IAAIuF,IAAI,IAAI,GAAG,EAAE;IACf,MAAMC,KAAK,GAAGrG,IAAI,CAAC4D,KAAK,CAACwC,IAAI,GAAG,GAAG,CAAC;IACpCA,IAAI,IAAI,GAAG;IACXN,SAAS,CAACE,IAAI,CAAC,GAAGK,KAAK,GAAG,CAAC;EAC7B;EAEA,IAAID,IAAI,IAAI,EAAE,EAAE;IACd,MAAME,MAAM,GAAGtG,IAAI,CAAC4D,KAAK,CAACwC,IAAI,GAAG,EAAE,CAAC;IACpCA,IAAI,IAAI,EAAE;IACVN,SAAS,CAACE,IAAI,CAAC,GAAGM,MAAM,GAAG,CAAC;EAC9B;EAEA,IAAIF,IAAI,IAAI,CAAC,EAAE;IACb,MAAMtF,KAAK,GAAGd,IAAI,CAAC4D,KAAK,CAACwC,IAAI,GAAG,CAAC,CAAC;IAClCA,IAAI,IAAI,CAAC;IACTN,SAAS,CAACE,IAAI,CAAC,GAAGlF,KAAK,GAAG,CAAC;EAC7B;EAEA,IAAIsF,IAAI,GAAG,CAAC,EAAE;IACZN,SAAS,CAACE,IAAI,CAAC,GAAGI,IAAI,GAAG,CAAC;EAC5B;EAEA,IAAIxF,KAAK,KAAK,CAAC,IAAID,OAAO,KAAK,CAAC,IAAID,OAAO,KAAK,CAAC,IAAItB,MAAM,KAAK,CAAC,IAAIE,KAAK,KAAK,CAAC,EAAE;IAChFwG,SAAS,CAACE,IAAI,CAAC,GAAG,CAAC;IAEnB,IAAIpF,KAAK,KAAK,CAAC,EAAE;MACfkF,SAAS,CAACE,IAAI,CAAC,GAAGpF,KAAK,GAAG,CAAC;IAC7B;IAEA,IAAID,OAAO,KAAK,CAAC,EAAE;MACjBmF,SAAS,CAACE,IAAI,CAAC,GAAGrF,OAAO,GAAG,CAAC;IAC/B;IAEA,IAAID,OAAO,KAAK,CAAC,IAAItB,MAAM,KAAK,CAAC,IAAIE,KAAK,KAAK,CAAC,EAAE;MAChD,MAAMiH,KAAK,GAAG9H,MAAM,CAACiC,OAAO,CAAC,GAAG5B,SAAS,GAAGL,MAAM,CAACW,MAAM,CAAC,GAAGP,SAAS,GAAGJ,MAAM,CAACa,KAAK,CAAC;MACtF,MAAMkH,GAAG,GAAG,CAAC5G,MAAM,CAAC2G,KAAK,CAAC,GAAG,GAAG,EAAEE,OAAO,CAAC,CAAC,CAAC,CAACC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;MAClEZ,SAAS,CAACE,IAAI,CAAC,GAAGQ,GAAG,GAAG,CAAC;IAC3B;EACF;EAEA,OAAO,IAAIV,SAAS,CAACG,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAAAjF,OAAA,CAAAkF,eAAA,GAAAA,eAAA;AAoBO,MAAMS,SAAS,GAAI9D,IAAmB,IAA2B;EACtE,MAAMN,QAAQ,GAAGvD,MAAM,CAAC6D,IAAI,CAAC;EAC7B,OAAOJ,QAAQ,CAACF,QAAQ,CAAC,GAAGzF,MAAM,CAAC4G,IAAI,CAACwC,eAAe,CAAC3D,QAAQ,CAAC,CAAC,GAAGzF,MAAM,CAAC2G,IAAI,EAAE;AACpF,CAAC;AAED;;;;;;;;;;;;;;;;;;AAAAzC,OAAA,CAAA2F,SAAA,GAAAA,SAAA;AAkBO,MAAMC,OAAO,GAAIC,GAAW,IAA6B;EAC9D,MAAMC,MAAM,GAAGC,kBAAkB,CAAC3G,IAAI,CAACyG,GAAG,CAAC;EAC3C,IAAIC,MAAM,IAAI,IAAI,EAAE;IAClB,OAAOhK,MAAM,CAAC2G,IAAI,EAAE;EACtB;EAEA,MAAM,CAAC4C,KAAK,EAAEC,MAAM,EAAExF,KAAK,EAAED,IAAI,EAAED,KAAK,EAAEoG,IAAI,EAAEC,IAAI,CAAC,GAAGH,MAAM,CAACI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAACC,GAAG,CAAE9G,CAAC,IAAKA,CAAC,GAAGT,MAAM,CAACS,CAAC,CAAC,GAAG,CAAC,CAAC;EACxG,MAAMG,KAAK,GAAG6F,KAAK,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GACtCC,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAC1BxF,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GACxBD,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GACnBD,KAAK,GAAG,EAAE,GAAG,EAAE,GACfoG,IAAI,GAAG,EAAE,GACTC,IAAI;EAEN,OAAOnK,MAAM,CAAC4G,IAAI,CAAChD,OAAO,CAACF,KAAK,CAAC,CAAC;AACpC,CAAC;AAAAQ,OAAA,CAAA4F,OAAA,GAAAA,OAAA;AAED,MAAMG,kBAAkB,GACtB,4GAA4G","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Effect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Effect.js","names":["_Function","require","internalCause","_interopRequireWildcard","console_","_context","effect","core","defaultServices","circular","internalExecutionPlan","fiberRuntime","layer","option_","query","runtime_","schedule_","internalTracer","Random","Request","Scheduler","_Utils","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","EffectTypeId","exports","isEffect","cachedWithTTL","cached","cachedInvalidateWithTTL","memoize","cachedFunction","once","all","allWith","allSuccesses","dropUntil","dropWhile","takeUntil","takeWhile","every","exists","filter","filterMap","findFirst","forEach","head","mergeAll","partition","reduce","reduceWhile","reduceRight","reduceEffect","replicate","replicateEffect","validateAll","validateFirst","async","asyncEffect","custom","withFiberRuntime","fail","failSync","failCause","failCauseSync","die","dieMessage","dieSync","gen","never","none","promise","succeed","succeedNone","succeedSome","suspend","sync","_void","void","yieldNow","_catch","catch","catchAll","catchAllCause","catchAllDefect","catchIf","catchSome","catchSomeCause","catchSomeDefect","catchTag","catchTags","cause","eventually","ignore","ignoreLogged","parallelErrors","sandbox","retry","retry_combined","withExecutionPlan","retryOrElse","retryOrElse_Effect","try_","try","tryMap","tryMapPromise","tryPromise","unsandbox","allowInterrupt","checkInterruptible","disconnect","interrupt","interruptWith","interruptible","interruptibleMask","onInterrupt","uninterruptible","uninterruptibleMask","liftPredicate","as","asSome","asSomeError","asVoid","flip","flipWith","map","mapAccum","mapBoth","mapError","mapErrorCause","merge","negate","acquireRelease","acquireReleaseInterruptible","acquireUseRelease","addFinalizer","ensuring","onError","onExit","parallelFinalizers","sequentialFinalizers","finalizersMask","scope","scopeWith","scopedWith","scoped","scopedEffect","using","withEarlyRelease","awaitAllChildren","daemonChildren","descriptor","descriptorWith","diffFiberRefs","ensuringChild","ensuringChildren","fiberId","fiberIdWith","fork","forkDaemon","forkAll","forkIn","forkScoped","forkWithErrorHandler","fromFiber","fromFiberEffect","supervised","transplant","withConcurrency","withScheduler","withSchedulingPriority","withMaxOpsBeforeYield","clock","clockWith","withClockScoped","withClock","console","consoleWith","withConsoleScoped","withConsole","delay","sleep","timed","timedWith","timeout","timeoutOption","timeoutFail","timeoutFailCause","timeoutTo","configProviderWith","withConfigProvider","withConfigProviderScoped","context","contextWith","contextWithEffect","mapInputContext","provide","effect_provide","provideService","provideServiceEffect","serviceFunction","serviceFunctionEffect","serviceFunctions","serviceConstants","serviceMembers","serviceOption","serviceOptional","updateService","Do","bind","bindAll","bindTo","let_","let","option","either","exit","intoDeferred","if_","if","filterOrDie","filterOrDieMessage","filterOrElse","filterOrFail","filterEffectOrElse","filterEffectOrFail","unless","unlessEffect","when","whenEffect","whenFiberRef","whenRef","flatMap","andThen","flatten","race","raceAll","raceFirst","raceWith","summarized","tap","tapBoth","tapDefect","tapError","tapErrorTag","tapErrorCause","forever","iterate","loop","repeat","repeat_combined","repeatN","repeatOrElse","repeatOrElse_Effect","schedule","schedule_Effect","scheduleForked","scheduleFrom","scheduleFrom_Effect","whileLoop","getFiberRefs","fiberRefs","inheritFiberRefs","locally","fiberRefLocally","locallyWith","fiberRefLocallyWith","locallyScoped","fiberRefLocallyScoped","locallyScopedWith","fiberRefLocallyScopedWith","patchFiberRefs","setFiberRefs","updateFiberRefs","isFailure","isSuccess","match","matchCause","matchCauseEffect","matchEffect","log","logWithLevel","level","message","logTrace","logDebug","logInfo","logWarning","logError","logFatal","withLogSpan","annotateLogs","annotateLogsScoped","logAnnotations","withUnhandledErrorLogLevel","whenLogLevel","orDie","orDieWith","orElse","orElseFail","orElseSucceed","firstSuccessOf","random","randomWith","withRandom","withRandomFixed","dual","values","fixed","withRandomScoped","runtime","getRuntimeFlags","runtimeFlags","patchRuntimeFlags","updateRuntimeFlags","withRuntimeFlagsPatch","withRuntimeFlags","withRuntimeFlagsPatchScoped","withRuntimeFlagsScoped","tagMetrics","labelMetrics","tagMetricsScoped","labelMetricsScoped","metricLabels","withMetric","unsafeMakeSemaphore","makeSemaphore","unsafeMakeLatch","makeLatch","runFork","unsafeForkEffect","runCallback","unsafeRunEffect","runPromise","unsafeRunPromiseEffect","runPromiseExit","unsafeRunPromiseExitEffect","runSync","unsafeRunSyncEffect","runSyncExit","unsafeRunSyncExitEffect","validate","validateWith","zip","zipOptions","zipLeft","zipLeftOptions","zipRight","zipRightOptions","zipWith","zipWithOptions","ap","self","that","a","blocked","runRequestBlock","step","request","args","isRequest","fromRequest","cacheRequestResult","cacheRequest","withRequestBatching","withRequestCaching","withRequestCache","tracer","tracerWith","withTracer","withTracerScoped","withTracerEnabled","withTracerTiming","annotateSpans","annotateCurrentSpan","currentSpan","currentPropagatedSpan","currentParentSpan","spanAnnotations","spanLinks","linkSpans","linkSpanCurrent","makeSpan","makeSpanScoped","useSpan","withSpan","functionWithSpan","withSpanScoped","withParentSpan","fromNullable","optionFromOptional","transposeOption","isNone","value","some","transposeMapOption","makeTagProxy","TagClass","cache","Map","Proxy","target","prop","receiver","Reflect","fn","s","cn","assign","apply","proto","setPrototypeOf","getPrototypeOf","Tag","id","limit","Error","stackTraceLimit","creationError","TagProto","key","body","stack","Service","maker","arguments","proxy","patchState","service","prototype","selfProto","_tag","hasDeps","dependencies","length","layerName","layerCache","isFunction","fromEffect","_","layerWithDepsCache","DefaultWithoutDependencies","nameOrBody","pipeables","errorDef","defineLength","errorCall","fnApply","spanName","spanOptions","DisablePropagation","name","options","configurable","fnError","undefined","isGeneratorFunction","fromIterator","error","x","sequential","captureStackTrace","stackDef","trim","split","stackCall","endStackDef","slice","join","includes","replace","endStackCall","opts","fnUntraced","ensureSuccessType","ensureErrorType","ensureRequirementsType"],"sources":["../../src/Effect.ts"],"sourcesContent":[null],"mappings":";;;;;;;;;AAwBA,IAAAA,SAAA,GAAAC,OAAA;AAIA,IAAAC,aAAA,GAAAC,uBAAA,CAAAF,OAAA;AACA,IAAAG,QAAA,GAAAD,uBAAA,CAAAF,OAAA;AACA,IAAAI,QAAA,GAAAJ,OAAA;AACA,IAAAK,MAAA,GAAAH,uBAAA,CAAAF,OAAA;AACA,IAAAM,IAAA,GAAAJ,uBAAA,CAAAF,OAAA;AACA,IAAAO,eAAA,GAAAL,uBAAA,CAAAF,OAAA;AACA,IAAAQ,QAAA,GAAAN,uBAAA,CAAAF,OAAA;AACA,IAAAS,qBAAA,GAAAP,uBAAA,CAAAF,OAAA;AACA,IAAAU,YAAA,GAAAR,uBAAA,CAAAF,OAAA;AACA,IAAAW,KAAA,GAAAT,uBAAA,CAAAF,OAAA;AACA,IAAAY,OAAA,GAAAV,uBAAA,CAAAF,OAAA;AACA,IAAAa,KAAA,GAAAX,uBAAA,CAAAF,OAAA;AACA,IAAAc,QAAA,GAAAZ,uBAAA,CAAAF,OAAA;AACA,IAAAe,SAAA,GAAAb,uBAAA,CAAAF,OAAA;AACA,IAAAgB,cAAA,GAAAd,uBAAA,CAAAF,OAAA;AASA,IAAAiB,MAAA,GAAAf,uBAAA,CAAAF,OAAA;AAEA,IAAAkB,OAAA,GAAAhB,uBAAA,CAAAF,OAAA;AAOA,IAAAmB,SAAA,GAAAjB,uBAAA,CAAAF,OAAA;AAcA,IAAAoB,MAAA,GAAApB,OAAA;AAAgE,SAAAE,wBAAAmB,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAArB,uBAAA,YAAAA,CAAAmB,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAEhE;;;;AAIO,MAAMkB,YAAY,GAAAC,OAAA,CAAAD,YAAA,GAAkBlC,IAAI,CAACkC,YAAY;AA4L5D;;;;;;;;;;;;;AAaO,MAAME,QAAQ,GAAAD,OAAA,CAAAC,QAAA,GAA2DpC,IAAI,CAACoC,QAAQ;AAE7F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmEO,MAAMC,aAAa,GAAAF,OAAA,CAAAE,aAAA,GAyItBnC,QAAQ,CAACoC,MAAM;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsEO,MAAMC,uBAAuB,GAAAJ,OAAA,CAAAI,uBAAA,GAiJhCrC,QAAQ,CAACqC,uBAAuB;AAEpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgEO,MAAMD,MAAM,GAAAH,OAAA,CAAAG,MAAA,GAAgEvC,MAAM,CAACyC,OAAO;AAEjG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,cAAc,GAAAN,OAAA,CAAAM,cAAA,GAGcvC,QAAQ,CAACuC,cAAc;AAEhE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,IAAI,GAAAP,OAAA,CAAAO,IAAA,GAAmE3C,MAAM,CAAC2C,IAAI;AAE/F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2NO,MAAMC,GAAG,GAAAR,OAAA,CAAAQ,GAAA,GASiCvC,YAAY,CAACuC,GAAG;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,OAAO,GAAAT,OAAA,CAAAS,OAAA,GAYMxC,YAAY,CAACwC,OAAO;AAsG9C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CO,MAAMC,YAAY,GAAAV,OAAA,CAAAU,YAAA,GASyCzC,YAAY,CAACyC,YAAY;AAE3F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,SAAS,GAAAX,OAAA,CAAAW,SAAA,GAkGlB/C,MAAM,CAAC+C,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,MAAMC,SAAS,GAAAZ,OAAA,CAAAY,SAAA,GAgGlBhD,MAAM,CAACgD,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDO,MAAMC,SAAS,GAAAb,OAAA,CAAAa,SAAA,GAwGlBjD,MAAM,CAACiD,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCO,MAAMC,SAAS,GAAAd,OAAA,CAAAc,SAAA,GAkFlBlD,MAAM,CAACkD,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CO,MAAMC,KAAK,GAAAf,OAAA,CAAAe,KAAA,GA8FdnD,MAAM,CAACmD,KAAK;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,MAAMC,MAAM,GAAAhB,OAAA,CAAAgB,MAAA,GAgHf/C,YAAY,CAAC+C,MAAM;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CO,MAAMC,MAAM,GAAAjB,OAAA,CAAAiB,MAAA,GA4GfhD,YAAY,CAACgD,MAAM;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,SAAS,GAAAlB,OAAA,CAAAkB,SAAA,GA2ElBtD,MAAM,CAACsD,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CO,MAAMC,SAAS,GAAAnB,OAAA,CAAAmB,SAAA,GA0FlBvD,MAAM,CAACuD,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoEO,MAAMC,OAAO,GAAApB,OAAA,CAAAoB,OAAA,GAyThBnD,YAAY,CAACmD,OAAO;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,IAAI,GAAArB,OAAA,CAAAqB,IAAA,GACfzD,MAAM,CAACyD,IAAI;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,QAAQ,GAAAtB,OAAA,CAAAsB,QAAA,GA0GjBrD,YAAY,CAACqD,QAAQ;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,SAAS,GAAAvB,OAAA,CAAAuB,SAAA,GA0HlBtD,YAAY,CAACsD,SAAS;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDO,MAAMC,MAAM,GAAAxB,OAAA,CAAAwB,MAAA,GA6Gf5D,MAAM,CAAC4D,MAAM;AAEjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDO,MAAMC,WAAW,GAAAzB,OAAA,CAAAyB,WAAA,GAgHpB7D,MAAM,CAAC6D,WAAW;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,WAAW,GAAA1B,OAAA,CAAA0B,WAAA,GA2GpB9D,MAAM,CAAC8D,WAAW;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CO,MAAMC,YAAY,GAAA3B,OAAA,CAAA2B,YAAA,GA8GrB1D,YAAY,CAAC0D,YAAY;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,SAAS,GAAA5B,OAAA,CAAA4B,SAAA,GA2ElB3D,YAAY,CAAC2D,SAAS;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDO,MAAMC,eAAe,GAAA7B,OAAA,CAAA6B,eAAA,GAuOxB5D,YAAY,CAAC4D,eAAe;AAEhC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DO,MAAMC,WAAW,GAAA9B,OAAA,CAAA8B,WAAA,GAuRpB7D,YAAY,CAAC6D,WAAW;AAE5B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CO,MAAMC,aAAa,GAAA/B,OAAA,CAAA+B,aAAA,GA0GtB9D,YAAY,CAAC8D,aAAa;AAE9B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8HO,MAAMC,KAAK,GAAAhC,OAAA,CAAAgC,KAAA,GAGKnE,IAAI,CAACmE,KAAK;AAEjC;;;;;;AAMO,MAAMC,WAAW,GAAAjC,OAAA,CAAAiC,WAAA,GAEc5D,QAAQ,CAAC4D,WAAW;AAE1D;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMC,MAAM,GAAAlC,OAAA,CAAAkC,MAAA,GAyEfrE,IAAI,CAACqE,MAAM;AAEf;;;;AAIO,MAAMC,gBAAgB,GAAAnC,OAAA,CAAAmC,gBAAA,GAKNtE,IAAI,CAACsE,gBAAgB;AAE5C;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BO,MAAMC,IAAI,GAAApC,OAAA,CAAAoC,IAAA,GAAsCvE,IAAI,CAACuE,IAAI;AAEhE;;;;;;AAMO,MAAMC,QAAQ,GAAArC,OAAA,CAAAqC,QAAA,GAAkDxE,IAAI,CAACwE,QAAQ;AAEpF;;;;;;AAMO,MAAMC,SAAS,GAAAtC,OAAA,CAAAsC,SAAA,GAAmDzE,IAAI,CAACyE,SAAS;AAEvF;;;;;;AAMO,MAAMC,aAAa,GAAAvC,OAAA,CAAAuC,aAAA,GAA+D1E,IAAI,CAAC0E,aAAa;AAE3G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,GAAG,GAAAxC,OAAA,CAAAwC,GAAA,GAAuC3E,IAAI,CAAC2E,GAAG;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,MAAMC,UAAU,GAAAzC,OAAA,CAAAyC,UAAA,GAAuC5E,IAAI,CAAC4E,UAAU;AAE7E;;;;;;;;;;;;;AAaO,MAAMC,OAAO,GAAA1C,OAAA,CAAA0C,OAAA,GAAkD7E,IAAI,CAAC6E,OAAO;AAElF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDO,MAAMC,GAAG,GAAA3C,OAAA,CAAA2C,GAAA,GAgHZ9E,IAAI,CAAC8E,GAAG;AA4QZ;;;;;;;;;;;;;;AAcO,MAAMC,KAAK,GAAA5C,OAAA,CAAA4C,KAAA,GAAkB/E,IAAI,CAAC+E,KAAK;AAE9C;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,IAAI,GAAA7C,OAAA,CAAA6C,IAAA,GAEwCjF,MAAM,CAACiF,IAAI;AAEpE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDO,MAAMC,OAAO,GAAA9C,OAAA,CAAA8C,OAAA,GAEHlF,MAAM,CAACkF,OAAO;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,OAAO,GAAA/C,OAAA,CAAA+C,OAAA,GAA+BlF,IAAI,CAACkF,OAAO;AAE/D;;;;;;;;;;;;;;;AAeO,MAAMC,WAAW,GAAAhD,OAAA,CAAAgD,WAAA,GAAiCpF,MAAM,CAACoF,WAAW;AAE3E;;;;;;;;AAQO,MAAMC,WAAW,GAAAjD,OAAA,CAAAiD,WAAA,GAA8CrF,MAAM,CAACqF,WAAW;AAExF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkGO,MAAMC,OAAO,GAAAlD,OAAA,CAAAkD,OAAA,GAAmErF,IAAI,CAACqF,OAAO;AAEnG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,IAAI,GAAAnD,OAAA,CAAAmD,IAAA,GAAwCtF,IAAI,CAACsF,IAAI;AAElE,MAAMC,KAAK,GAAApD,OAAA,CAAAqD,IAAA,GAAiBxF,IAAI,CAACwF,IAAI;AAoBrC;;;;AAIO,MAAMC,QAAQ,GAAAtD,OAAA,CAAAsD,QAAA,GAEAzF,IAAI,CAACyF,QAAQ;AAElC,MAAMC,MAAM,GAAAvD,OAAA,CAAAwD,KAAA,GAUR5F,MAAM,CAAC2F,MAAM;AAmDjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuDO,MAAME,QAAQ,GAAAzD,OAAA,CAAAyD,QAAA,GAiHjB5F,IAAI,CAAC4F,QAAQ;AAEjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,aAAa,GAAA1D,OAAA,CAAA0D,aAAA,GAqFtB7F,IAAI,CAAC6F,aAAa;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDO,MAAMC,cAAc,GAAA3D,OAAA,CAAA2D,cAAA,GA+GvB/F,MAAM,CAAC+F,cAAc;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoDO,MAAMC,OAAO,GAAA5D,OAAA,CAAA4D,OAAA,GA6NhB/F,IAAI,CAAC+F,OAAO;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0DO,MAAMC,SAAS,GAAA7D,OAAA,CAAA6D,SAAA,GA0HlBhG,IAAI,CAACgG,SAAS;AAElB;;;;;;;;;AASO,MAAMC,cAAc,GAAA9D,OAAA,CAAA8D,cAAA,GAwBvBlG,MAAM,CAACkG,cAAc;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+DO,MAAMC,eAAe,GAAA/D,OAAA,CAAA+D,eAAA,GAoIxBnG,MAAM,CAACmG,eAAe;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyDO,MAAMC,QAAQ,GAAAhE,OAAA,CAAAgE,QAAA,GA0HjBpG,MAAM,CAACoG,QAAQ;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,SAAS,GAAAjE,OAAA,CAAAiE,SAAA,GA2JlBrG,MAAM,CAACqG,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,KAAK,GAAAlE,OAAA,CAAAkE,KAAA,GAAyEtG,MAAM,CAACsG,KAAK;AAEvG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,UAAU,GAAAnE,OAAA,CAAAmE,UAAA,GAA4DvG,MAAM,CAACuG,UAAU;AAEpG;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BO,MAAMC,MAAM,GAAApE,OAAA,CAAAoE,MAAA,GAA+DxG,MAAM,CAACwG,MAAM;AAE/F;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,YAAY,GAAArE,OAAA,CAAAqE,YAAA,GAA+DzG,MAAM,CAACyG,YAAY;AAE3G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CO,MAAMC,cAAc,GAAAtE,OAAA,CAAAsE,cAAA,GAA+D1G,MAAM,CAAC0G,cAAc;AAE/G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6DO,MAAMC,OAAO,GAAAvE,OAAA,CAAAuE,OAAA,GAAqE3G,MAAM,CAAC2G,OAAO;AAoCvG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsHO,MAAMC,KAAK,GAAAxE,OAAA,CAAAwE,KAAA,GA6ddlG,SAAS,CAACmG,cAAc;AAE5B;;;;;;;;AAQO,MAAMC,iBAAiB,GAAA1E,OAAA,CAAA0E,iBAAA,GAwB1B1G,qBAAqB,CAAC0G,iBAAiB;AAE3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DO,MAAMC,WAAW,GAAA3E,OAAA,CAAA2E,WAAA,GAkIpBrG,SAAS,CAACsG,kBAAkB;AAEhC,MAAMC,IAAI,GAAA7E,OAAA,CAAA8E,GAAA,GAGNlH,MAAM,CAACiH,IAAI;AAiEf;;;;;;;;;;AAUO,MAAME,MAAM,GAAA/E,OAAA,CAAA+E,MAAA,GA+BfnH,MAAM,CAACmH,MAAM;AAEjB;;;;;;;;;;;;;AAaO,MAAMC,aAAa,GAAAhF,OAAA,CAAAgF,aAAA,GAkCtBpH,MAAM,CAACoH,aAAa;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgEO,MAAMC,UAAU,GAAAjF,OAAA,CAAAiF,UAAA,GAwInBrH,MAAM,CAACqH,UAAU;AAErB;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,SAAS,GAAAlF,OAAA,CAAAkF,SAAA,GAAqEtH,MAAM,CAACsH,SAAS;AAE3G;;;;;;;;;;;;;;;;;AAiBO,MAAMC,cAAc,GAAAnF,OAAA,CAAAmF,cAAA,GAAiBvH,MAAM,CAACuH,cAAc;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,kBAAkB,GAAApF,OAAA,CAAAoF,kBAAA,GAC7BvH,IAAI,CAACuH,kBAAkB;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+DO,MAAMC,UAAU,GAAArF,OAAA,CAAAqF,UAAA,GAAwDpH,YAAY,CAACoH,UAAU;AAEtG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,SAAS,GAAAtF,OAAA,CAAAsF,SAAA,GAAkBzH,IAAI,CAACyH,SAAS;AAEtD;;;;AAIO,MAAMC,aAAa,GAAAvF,OAAA,CAAAuF,aAAA,GAAgD1H,IAAI,CAAC0H,aAAa;AAE5F;;;;;;AAMO,MAAMC,aAAa,GAAAxF,OAAA,CAAAwF,aAAA,GAAwD3H,IAAI,CAAC2H,aAAa;AAEpG;;;;;;;;AAQO,MAAMC,iBAAiB,GAAAzF,OAAA,CAAAyF,iBAAA,GAEP5H,IAAI,CAAC4H,iBAAiB;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,WAAW,GAAA1F,OAAA,CAAA0F,WAAA,GAwFpB7H,IAAI,CAAC6H,WAAW;AAEpB;;;;;;AAMO,MAAMC,eAAe,GAAA3F,OAAA,CAAA2F,eAAA,GAAwD9H,IAAI,CAAC8H,eAAe;AAExG;;;;;;;;AAQO,MAAMC,mBAAmB,GAAA5F,OAAA,CAAA4F,mBAAA,GAET/H,IAAI,CAAC+H,mBAAmB;AAE/C;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMC,aAAa,GAAA7F,OAAA,CAAA6F,aAAA,GAoDtBjI,MAAM,CAACiI,aAAa;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,EAAE,GAAA9F,OAAA,CAAA8F,EAAA,GA+DXjI,IAAI,CAACiI,EAAE;AAEX;;;;;;;;AAQO,MAAMC,MAAM,GAAA/F,OAAA,CAAA+F,MAAA,GAAuEnI,MAAM,CAACmI,MAAM;AAEvG;;;;;;;;AAQO,MAAMC,WAAW,GAAAhG,OAAA,CAAAgG,WAAA,GAAuEpI,MAAM,CAACoI,WAAW;AAEjH;;;;;;;;;AASO,MAAMC,MAAM,GAAAjG,OAAA,CAAAiG,MAAA,GAA2DpI,IAAI,CAACoI,MAAM;AAEzF;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BO,MAAMC,IAAI,GAAAlG,OAAA,CAAAkG,IAAA,GAAwDrI,IAAI,CAACqI,IAAI;AAElF;;;;;;;AAOO,MAAMC,QAAQ,GAAAnG,OAAA,CAAAmG,QAAA,GAiBjBvI,MAAM,CAACuI,QAAQ;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CO,MAAMC,GAAG,GAAApG,OAAA,CAAAoG,GAAA,GAiGZvI,IAAI,CAACuI,GAAG;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,MAAMC,QAAQ,GAAArG,OAAA,CAAAqG,QAAA,GAoGjBzI,MAAM,CAACyI,QAAQ;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCO,MAAMC,OAAO,GAAAtG,OAAA,CAAAsG,OAAA,GA0EhBzI,IAAI,CAACyI,OAAO;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCO,MAAMC,QAAQ,GAAAvG,OAAA,CAAAuG,QAAA,GAyEjB1I,IAAI,CAAC0I,QAAQ;AAEjB;;;;;;;;;AASO,MAAMC,aAAa,GAAAxG,OAAA,CAAAwG,aAAA,GAqBtB5I,MAAM,CAAC4I,aAAa;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,KAAK,GAAAzG,OAAA,CAAAyG,KAAA,GAAgE7I,MAAM,CAAC6I,KAAK;AAE9F;;;;;;AAMO,MAAMC,MAAM,GAAA1G,OAAA,CAAA0G,MAAA,GAAiE9I,MAAM,CAAC8I,MAAM;AAEjG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkFO,MAAMC,cAAc,GAAA3G,OAAA,CAAA2G,cAAA,GA0KvB1I,YAAY,CAAC0I,cAAc;AAE/B;;;;;;;;;;;;;AAaO,MAAMC,2BAA2B,GAAA5G,OAAA,CAAA4G,2BAAA,GAgCpC3I,YAAY,CAAC2I,2BAA2B;AAE5C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgEO,MAAMC,iBAAiB,GAAA7G,OAAA,CAAA6G,iBAAA,GA0I1BhJ,IAAI,CAACgJ,iBAAiB;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuHO,MAAMC,YAAY,GAAA9G,OAAA,CAAA8G,YAAA,GAEmB7I,YAAY,CAAC6I,YAAY;AAErE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsEO,MAAMC,QAAQ,GAAA/G,OAAA,CAAA+G,QAAA,GA+IjB9I,YAAY,CAAC8I,QAAQ;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2EO,MAAMC,OAAO,GAAAhH,OAAA,CAAAgH,OAAA,GA4JhBnJ,IAAI,CAACmJ,OAAO;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgEO,MAAMC,MAAM,GAAAjH,OAAA,CAAAiH,MAAA,GAsIfpJ,IAAI,CAACoJ,MAAM;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,kBAAkB,GAAAlH,OAAA,CAAAkH,kBAAA,GAAwDjJ,YAAY,CAACiJ,kBAAkB;AAEtH;;;;;;;;;;;;;;;;;AAiBO,MAAMC,oBAAoB,GAAAnH,OAAA,CAAAmH,oBAAA,GAC/BlJ,YAAY,CAACkJ,oBAAoB;AAEnC;;;;;;;;;;;;;;;AAeO,MAAMC,cAAc,GAAApH,OAAA,CAAAoH,cAAA,GAIJnJ,YAAY,CAACmJ,cAAc;AAElD;;;;;;AAMO,MAAMC,KAAK,GAAArH,OAAA,CAAAqH,KAAA,GAA4CpJ,YAAY,CAACoJ,KAAK;AAEhF;;;;;;AAMO,MAAMC,SAAS,GAAAtH,OAAA,CAAAsH,SAAA,GACpBrJ,YAAY,CAACqJ,SAAS;AAExB;;;;;;;;AAQO,MAAMC,UAAU,GAAAvH,OAAA,CAAAuH,UAAA,GACrBtJ,YAAY,CAACsJ,UAAU;AAEzB;;;;;;;;;;;;;AAaO,MAAMC,MAAM,GAAAxH,OAAA,CAAAwH,MAAA,GACjBvJ,YAAY,CAACwJ,YAAY;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,KAAK,GAAA1H,OAAA,CAAA0H,KAAA,GA2EdzJ,YAAY,CAACyJ,KAAK;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,gBAAgB,GAAA3H,OAAA,CAAA2H,gBAAA,GAE2C1J,YAAY,CAAC0J,gBAAgB;AAErG;;;;;;;AAOO,MAAMC,gBAAgB,GAAA5H,OAAA,CAAA4H,gBAAA,GAAwD7J,QAAQ,CAAC6J,gBAAgB;AAE9G;;;;;;;AAOO,MAAMC,cAAc,GAAA7H,OAAA,CAAA6H,cAAA,GAAwD5J,YAAY,CAAC4J,cAAc;AAE9G;;;;;;AAMO,MAAMC,UAAU,GAAA9H,OAAA,CAAA8H,UAAA,GAAmClK,MAAM,CAACkK,UAAU;AAE3E;;;;;;AAMO,MAAMC,cAAc,GAAA/H,OAAA,CAAA+H,cAAA,GACzBnK,MAAM,CAACmK,cAAc;AAEvB;;;;;;;AAOO,MAAMC,aAAa,GAAAhI,OAAA,CAAAgI,aAAA,GAE8BpK,MAAM,CAACoK,aAAa;AAE5E;;;;;;;;AAQO,MAAMC,aAAa,GAAAjI,OAAA,CAAAiI,aAAA,GAwBtBlK,QAAQ,CAACkK,aAAa;AAE1B;;;;;;;AAOO,MAAMC,gBAAgB,GAAAlI,OAAA,CAAAkI,gBAAA,GAsBzBnK,QAAQ,CAACmK,gBAAgB;AAE7B;;;;AAIO,MAAMC,OAAO,GAAAnI,OAAA,CAAAmI,OAAA,GAA4BtK,IAAI,CAACsK,OAAO;AAE5D;;;;AAIO,MAAMC,WAAW,GAAApI,OAAA,CAAAoI,WAAA,GACtBvK,IAAI,CAACuK,WAAW;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CO,MAAMC,IAAI,GAAArI,OAAA,CAAAqI,IAAA,GAAmFpK,YAAY,CAACoK,IAAI;AAErH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDO,MAAMC,UAAU,GAAAtI,OAAA,CAAAsI,UAAA,GACrBrK,YAAY,CAACqK,UAAU;AAEzB;;;;;;;AAOO,MAAMC,OAAO,GAAAvI,OAAA,CAAAuI,OAAA,GAsChBxK,QAAQ,CAACwK,OAAO;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsEO,MAAMC,MAAM,GAAAxI,OAAA,CAAAwI,MAAA,GA+IfzK,QAAQ,CAACyK,MAAM;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoEO,MAAMC,UAAU,GAAAzI,OAAA,CAAAyI,UAAA,GACrB1K,QAAQ,CAAC0K,UAAU;AAErB;;;;;;AAMO,MAAMC,oBAAoB,GAAA1I,OAAA,CAAA0I,oBAAA,GAe7BzK,YAAY,CAACyK,oBAAoB;AAErC;;;;;;;;;AASO,MAAMC,SAAS,GAAA3I,OAAA,CAAA2I,SAAA,GAAqD5K,QAAQ,CAAC4K,SAAS;AAE7F;;;;;;;;;AASO,MAAMC,eAAe,GAAA5I,OAAA,CAAA4I,eAAA,GAC1B7K,QAAQ,CAAC6K,eAAe;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4GO,MAAMC,UAAU,GAAA7I,OAAA,CAAA6I,UAAA,GA2NnB9K,QAAQ,CAAC8K,UAAU;AAEvB;;;;;;;;;;;AAWO,MAAMC,UAAU,GAAA9I,OAAA,CAAA8I,UAAA,GAEAjL,IAAI,CAACiL,UAAU;AAEtC;;;;AAIO,MAAMC,eAAe,GAAA/I,OAAA,CAAA+I,eAAA,GAWxBlL,IAAI,CAACkL,eAAe;AAExB;;;;;;AAMO,MAAMC,aAAa,GAAAhJ,OAAA,CAAAgJ,aAAA,GAetBtK,SAAS,CAACsK,aAAa;AAE3B;;;;;;AAMO,MAAMC,sBAAsB,GAAAjJ,OAAA,CAAAiJ,sBAAA,GAe/BpL,IAAI,CAACoL,sBAAsB;AAE/B;;;;;;AAMO,MAAMC,qBAAqB,GAAAlJ,OAAA,CAAAkJ,qBAAA,GAe9BrL,IAAI,CAACqL,qBAAqB;AAE9B;;;;;;;;;;;;;;;;;;;;;;AAsBO,MAAMC,KAAK,GAAAnJ,OAAA,CAAAmJ,KAAA,GAAwBvL,MAAM,CAACuL,KAAK;AAEtD;;;;;;;;;;;;;;;;;;;;;;;;AAwBO,MAAMC,SAAS,GAAApJ,OAAA,CAAAoJ,SAAA,GAA6ExL,MAAM,CAACwL,SAAS;AAEnH;;;;;;;AAOO,MAAMC,eAAe,GAAArJ,OAAA,CAAAqJ,eAAA,GAC1BpL,YAAY,CAACoL,eAAe;AAE9B;;;;;;;AAOO,MAAMC,SAAS,GAAAtJ,OAAA,CAAAsJ,SAAA,GAiBlBxL,eAAe,CAACwL,SAAS;AAE7B;;;;;;AAMO,MAAMC,OAAO,GAAAvJ,OAAA,CAAAuJ,OAAA,GAAoB7L,QAAQ,CAAC6L,OAAO;AAExD;;;;;;;AAOO,MAAMC,WAAW,GAAAxJ,OAAA,CAAAwJ,WAAA,GAA2E9L,QAAQ,CAAC8L,WAAW;AAEvH;;;;;;;AAOO,MAAMC,iBAAiB,GAAAzJ,OAAA,CAAAyJ,iBAAA,GAC5B/L,QAAQ,CAAC+L,iBAAiB;AAE5B;;;;;;;AAOO,MAAMC,WAAW,GAAA1J,OAAA,CAAA0J,WAAA,GAiBpBhM,QAAQ,CAACgM,WAAW;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCO,MAAMC,KAAK,GAAA3J,OAAA,CAAA2J,KAAA,GAyEd/L,MAAM,CAAC+L,KAAK;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCO,MAAMC,KAAK,GAAA5J,OAAA,CAAA4J,KAAA,GAAuDhM,MAAM,CAACgM,KAAK;AAErF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,KAAK,GAAA7J,OAAA,CAAA6J,KAAA,GAChBjM,MAAM,CAACiM,KAAK;AAEd;;;;;;;;;;;;;;AAcO,MAAMC,SAAS,GAAA9J,OAAA,CAAA8J,SAAA,GA+BlBlM,MAAM,CAACkM,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuDO,MAAMC,OAAO,GAAA/J,OAAA,CAAA+J,OAAA,GAiHhBhM,QAAQ,CAACgM,OAAO;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,aAAa,GAAAhK,OAAA,CAAAgK,aAAA,GAmHtBjM,QAAQ,CAACiM,aAAa;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiEO,MAAMC,WAAW,GAAAjK,OAAA,CAAAiK,WAAA,GA0IpBlM,QAAQ,CAACkM,WAAW;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DO,MAAMC,gBAAgB,GAAAlK,OAAA,CAAAkK,gBAAA,GA8HzBnM,QAAQ,CAACmM,gBAAgB;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DO,MAAMC,SAAS,GAAAnK,OAAA,CAAAmK,SAAA,GAwIlBpM,QAAQ,CAACoM,SAAS;AAEtB;;;;;;;;;;;;;AAaO,MAAMC,kBAAkB,GAAApK,OAAA,CAAAoK,kBAAA,GAC7BtM,eAAe,CAACsM,kBAAkB;AAEpC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCO,MAAMC,kBAAkB,GAAArK,OAAA,CAAAqK,kBAAA,GA+E3BvM,eAAe,CAACuM,kBAAkB;AAEtC;;;;;;;;;;;AAWO,MAAMC,wBAAwB,GAAAtK,OAAA,CAAAsK,wBAAA,GACnCrM,YAAY,CAACqM,wBAAwB;AAEvC;;;;;;;;;;;;;AAaO,MAAMC,OAAO,GAAAvK,OAAA,CAAAuK,OAAA,GAAkD1M,IAAI,CAAC0M,OAAO;AAElF;;;;;;;;;;;;;;AAcO,MAAMC,WAAW,GAAAxK,OAAA,CAAAwK,WAAA,GAAyE5M,MAAM,CAAC4M,WAAW;AAEnH;;;;;;;;;;;;;;AAcO,MAAMC,iBAAiB,GAAAzK,OAAA,CAAAyK,iBAAA,GAEF5M,IAAI,CAAC4M,iBAAiB;AAElD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,MAAMC,eAAe,GAAA1K,OAAA,CAAA0K,eAAA,GAgGxB7M,IAAI,CAAC6M,eAAe;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,OAAO,GAAA3K,OAAA,CAAA2K,OAAA,GAukBhBzM,KAAK,CAAC0M,cAAc;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDO,MAAMC,cAAc,GAAA7K,OAAA,CAAA6K,cAAA,GA6GvBjN,MAAM,CAACiN,cAAc;AAEzB;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,oBAAoB,GAAA9K,OAAA,CAAA8K,oBAAA,GA2C7BlN,MAAM,CAACkN,oBAAoB;AAE/B;;;;;;;;AAQO,MAAMC,eAAe,GAAA/K,OAAA,CAAA+K,eAAA,GAG4CnN,MAAM,CAACmN,eAAe;AAE9F;;;;;;;;AAQO,MAAMC,qBAAqB,GAAAhL,OAAA,CAAAgL,qBAAA,GAG8CpN,MAAM,CAACoN,qBAAqB;AAE5G;;;;AAIO,MAAMC,gBAAgB,GAAAjL,OAAA,CAAAiL,gBAAA,GAMzBrN,MAAM,CAACqN,gBAAuB;AAElC;;;;AAIO,MAAMC,gBAAgB,GAAAlL,OAAA,CAAAkL,gBAAA,GAKzBtN,MAAM,CAACsN,gBAAgB;AAE3B;;;;AAIO,MAAMC,cAAc,GAAAnL,OAAA,CAAAmL,cAAA,GAYvBvN,MAAM,CAACuN,cAAqB;AAEhC;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMC,aAAa,GAAApL,OAAA,CAAAoL,aAAA,GAA+DxN,MAAM,CAACwN,aAAa;AAE7G;;;;;;;;;;;;;;;;AAgBO,MAAMC,eAAe,GAAArL,OAAA,CAAAqL,eAAA,GAC1BzN,MAAM,CAACyN,eAAe;AAExB;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,aAAa,GAAAtL,OAAA,CAAAsL,aAAA,GA2CtB1N,MAAM,CAAC0N,aAAa;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,EAAE,GAAAvL,OAAA,CAAAuL,EAAA,GAAe3N,MAAM,CAAC2N,EAAE;AAEvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,IAAI,GAAAxL,OAAA,CAAAwL,IAAA,GAuEb5N,MAAM,CAAC4N,IAAI;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,OAAO,GAAAzL,OAAA,CAAAyL,OAAA,GAmGhB1N,QAAQ,CAAC0N,OAAO;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,MAAM,GAAA1L,OAAA,CAAA0L,MAAA,GAmEf9N,MAAM,CAAC8N,MAAM;AAEjB,MAAMC,IAAI,GAAA3L,OAAA,CAAA4L,GAAA,GAUNhO,MAAM,CAAC+N,IAAI;AAuCf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyDO,MAAME,MAAM,GAAA7L,OAAA,CAAA6L,MAAA,GAA2EjO,MAAM,CAACiO,MAAM;AAE3G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqEO,MAAMC,MAAM,GAAA9L,OAAA,CAAA8L,MAAA,GAA8EjO,IAAI,CAACiO,MAAM;AAE5G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6DO,MAAMC,IAAI,GAAA/L,OAAA,CAAA+L,IAAA,GAA0ElO,IAAI,CAACkO,IAAI;AAEpG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,YAAY,GAAAhM,OAAA,CAAAgM,YAAA,GAqFrBnO,IAAI,CAACmO,YAAY;AAErB,MAAMC,GAAG,GAAAjM,OAAA,CAAAkM,EAAA,GAQLrO,IAAI,CAACoO,GAAG;AA6BZ;;;;;;;;;;;;;;;;;AAiBO,MAAME,WAAW,GAAAnM,OAAA,CAAAmM,WAAA,GAoFpBvO,MAAM,CAACuO,WAAW;AAEtB;;;;;;;;;;;;AAYO,MAAMC,kBAAkB,GAAApM,OAAA,CAAAoM,kBAAA,GAqD3BxO,MAAM,CAACwO,kBAAkB;AAE7B;;;;;;;;;;;;;AAaO,MAAMC,YAAY,GAAArM,OAAA,CAAAqM,YAAA,GAuErBzO,MAAM,CAACyO,YAAY;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,YAAY,GAAAtM,OAAA,CAAAsM,YAAA,GAgarB1O,MAAM,CAAC0O,YAAY;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,kBAAkB,GAAAvM,OAAA,CAAAuM,kBAAA,GAwF3B1O,IAAI,CAAC0O,kBAAkB;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,kBAAkB,GAAAxM,OAAA,CAAAwM,kBAAA,GA8F3B3O,IAAI,CAAC2O,kBAAkB;AAE3B;;;;;;;;;AASO,MAAMC,MAAM,GAAAzM,OAAA,CAAAyM,MAAA,GAqBf7O,MAAM,CAAC6O,MAAM;AAEjB;;;;;;;;;AASO,MAAMC,YAAY,GAAA1M,OAAA,CAAA0M,YAAA,GAqBrB9O,MAAM,CAAC8O,YAAY;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDO,MAAMC,IAAI,GAAA3M,OAAA,CAAA2M,IAAA,GAyGb/O,MAAM,CAAC+O,IAAI;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,UAAU,GAAA5M,OAAA,CAAA4M,UAAA,GA6EnB/O,IAAI,CAAC+O,UAAU;AAEnB;;;;;;;;;;;;;;;;AAgBO,MAAMC,YAAY,GAAA7M,OAAA,CAAA6M,YAAA,GAuCrBjP,MAAM,CAACiP,YAAY;AAEvB;;;;;;;;;;;;;;;;AAgBO,MAAMC,OAAO,GAAA9M,OAAA,CAAA8M,OAAA,GAmChBlP,MAAM,CAACkP,OAAO;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8DO,MAAMC,OAAO,GAAA/M,OAAA,CAAA+M,OAAA,GA+HhBlP,IAAI,CAACkP,OAAO;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2EO,MAAMC,OAAO,GAAAhN,OAAA,CAAAgN,OAAA,GA6ThBnP,IAAI,CAACmP,OAAO;AAEhB;;;;AAIO,MAAMC,OAAO,GAAAjN,OAAA,CAAAiN,OAAA,GAClBpP,IAAI,CAACoP,OAAO;AAEd;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyIO,MAAMC,IAAI,GAAAlN,OAAA,CAAAkN,IAAA,GAqRbjP,YAAY,CAACiP,IAAI;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsHO,MAAMC,OAAO,GAAAnN,OAAA,CAAAmN,OAAA,GAEuDlP,YAAY,CAACkP,OAAO;AAE/F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwIO,MAAMC,SAAS,GAAApN,OAAA,CAAAoN,SAAA,GAmRlBrP,QAAQ,CAACqP,SAAS;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DO,MAAMC,QAAQ,GAAArN,OAAA,CAAAqN,QAAA,GAwIjBpP,YAAY,CAACoP,QAAQ;AAEzB;;;;;;;;AAQO,MAAMC,UAAU,GAAAtN,OAAA,CAAAsN,UAAA,GAuBnB1P,MAAM,CAAC0P,UAAU;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDO,MAAMC,GAAG,GAAAvN,OAAA,CAAAuN,GAAA,GA6cZ1P,IAAI,CAAC0P,GAAG;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,OAAO,GAAAxN,OAAA,CAAAwN,OAAA,GA0GhB5P,MAAM,CAAC4P,OAAO;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDO,MAAMC,SAAS,GAAAzN,OAAA,CAAAyN,SAAA,GAyGlB7P,MAAM,CAAC6P,SAAS;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,QAAQ,GAAA1N,OAAA,CAAA0N,QAAA,GA2EjB9P,MAAM,CAAC8P,QAAQ;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,WAAW,GAAA3N,OAAA,CAAA2N,WAAA,GAmGpB/P,MAAM,CAAC+P,WAAW;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDO,MAAMC,aAAa,GAAA5N,OAAA,CAAA4N,aAAA,GAqGtBhQ,MAAM,CAACgQ,aAAa;AAExB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,OAAO,GAAA7N,OAAA,CAAA6N,OAAA,GAA4DjQ,MAAM,CAACiQ,OAAO;AAE9F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyDO,MAAMC,OAAO,GAAA9N,OAAA,CAAA8N,OAAA,GAiIhBlQ,MAAM,CAACkQ,OAAO;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiGO,MAAMC,IAAI,GAAA/N,OAAA,CAAA+N,IAAA,GAyabnQ,MAAM,CAACmQ,IAAI;AAoCf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8DO,MAAMC,MAAM,GAAAhO,OAAA,CAAAgO,MAAA,GA+Pf1P,SAAS,CAAC2P,eAAe;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,OAAO,GAAAlO,OAAA,CAAAkO,OAAA,GAmEhBtQ,MAAM,CAACsQ,OAAO;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDO,MAAMC,YAAY,GAAAnO,OAAA,CAAAmO,YAAA,GAsHrB7P,SAAS,CAAC8P,mBAAmB;AAEjC;;;;;;;;;;;;;;;;;;;;;;AAsBO,MAAMC,QAAQ,GAAArO,OAAA,CAAAqO,QAAA,GA+CjB/P,SAAS,CAACgQ,eAAe;AAE7B;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMC,cAAc,GAAAvO,OAAA,CAAAuO,cAAA,GAiDvBjQ,SAAS,CAACiQ,cAAc;AAE5B;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,YAAY,GAAAxO,OAAA,CAAAwO,YAAA,GA2CrBlQ,SAAS,CAACmQ,mBAAmB;AAEjC;;;;AAIO,MAAMC,SAAS,GAAA1O,OAAA,CAAA0O,SAAA,GAMI7Q,IAAI,CAAC6Q,SAAS;AAExC;;;;;;;AAOO,MAAMC,YAAY,GAAA3O,OAAA,CAAA2O,YAAA,GAAgC/Q,MAAM,CAACgR,SAAS;AAEzE;;;;;;AAMO,MAAMC,gBAAgB,GAAA7O,OAAA,CAAA6O,gBAAA,GAA0DjR,MAAM,CAACiR,gBAAgB;AAE9G;;;;AAIO,MAAMC,OAAO,GAAA9O,OAAA,CAAA8O,OAAA,GAWhBjR,IAAI,CAACkR,eAAe;AAExB;;;;AAIO,MAAMC,WAAW,GAAAhP,OAAA,CAAAgP,WAAA,GAWpBnR,IAAI,CAACoR,mBAAmB;AAE5B;;;;AAIO,MAAMC,aAAa,GAAAlP,OAAA,CAAAkP,aAAA,GAWtBjR,YAAY,CAACkR,qBAAqB;AAEtC;;;;AAIO,MAAMC,iBAAiB,GAAApP,OAAA,CAAAoP,iBAAA,GAW1BnR,YAAY,CAACoR,yBAAyB;AAE1C;;;;;;;AAOO,MAAMC,cAAc,GAAAtP,OAAA,CAAAsP,cAAA,GAA2D1R,MAAM,CAAC0R,cAAc;AAE3G;;;;;;;AAOO,MAAMC,YAAY,GAAAvP,OAAA,CAAAuP,YAAA,GAAqD3R,MAAM,CAAC2R,YAAY;AAEjG;;;;;;;AAOO,MAAMC,eAAe,GAAAxP,OAAA,CAAAwP,eAAA,GAER5R,MAAM,CAAC4R,eAAe;AAE1C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BO,MAAMC,SAAS,GAAAzP,OAAA,CAAAyP,SAAA,GAAkE7R,MAAM,CAAC6R,SAAS;AAExG;;;;;;;;;;;;;;;AAeO,MAAMC,SAAS,GAAA1P,OAAA,CAAA0P,SAAA,GAAkE9R,MAAM,CAAC8R,SAAS;AAExG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDO,MAAMC,KAAK,GAAA3P,OAAA,CAAA2P,KAAA,GAoHd/R,MAAM,CAAC+R,KAAK;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDO,MAAMC,UAAU,GAAA5P,OAAA,CAAA4P,UAAA,GAwHnB/R,IAAI,CAAC+R,UAAU;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,gBAAgB,GAAA7P,OAAA,CAAA6P,gBAAA,GAkHzBhS,IAAI,CAACgS,gBAAgB;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DO,MAAMC,WAAW,GAAA9P,OAAA,CAAA8P,WAAA,GAoIpBjS,IAAI,CAACiS,WAAW;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,GAAG,GAAA/P,OAAA,CAAA+P,GAAA,GAAmEnS,MAAM,CAACmS,GAAG;AAE7F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BO,MAAMC,YAAY,GAAGA,CAC1BC,KAAwB,EACxB,GAAGC,OAA2B,KACbtS,MAAM,CAACoS,YAAY,CAACC,KAAK,CAAC,CAAC,GAAGC,OAAO,CAAC;AAEzD;;;;;;;;;;;;;;;;;;;;;;;;;AAAAlQ,OAAA,CAAAgQ,YAAA,GAAAA,YAAA;AAyBO,MAAMG,QAAQ,GAAAnQ,OAAA,CAAAmQ,QAAA,GAAmEvS,MAAM,CAACuS,QAAQ;AAEvG;;;;;;;;;;;;;;;;;;;;;;;;AAwBO,MAAMC,QAAQ,GAAApQ,OAAA,CAAAoQ,QAAA,GAAmExS,MAAM,CAACwS,QAAQ;AAEvG;;;;;;;;;;;;AAYO,MAAMC,OAAO,GAAArQ,OAAA,CAAAqQ,OAAA,GAAmEzS,MAAM,CAACyS,OAAO;AAErG;;;;;;;;;;;;;AAaO,MAAMC,UAAU,GAAAtQ,OAAA,CAAAsQ,UAAA,GAAmE1S,MAAM,CAAC0S,UAAU;AAE3G;;;;;;;;;;;;AAYO,MAAMC,QAAQ,GAAAvQ,OAAA,CAAAuQ,QAAA,GAAmE3S,MAAM,CAAC2S,QAAQ;AAEvG;;;;;;;;;;;;;AAaO,MAAMC,QAAQ,GAAAxQ,OAAA,CAAAwQ,QAAA,GAAmE5S,MAAM,CAAC4S,QAAQ;AAEvG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,WAAW,GAAAzQ,OAAA,CAAAyQ,WAAA,GAmEpB7S,MAAM,CAAC6S,WAAW;AAEtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCO,MAAMC,YAAY,GAAA1Q,OAAA,CAAA0Q,YAAA,GA6JrB9S,MAAM,CAAC8S,YAAY;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,kBAAkB,GAAA3Q,OAAA,CAAA2Q,kBAAA,GAmF3B1S,YAAY,CAAC0S,kBAAkB;AAEnC;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMC,cAAc,GAAA5Q,OAAA,CAAA4Q,cAAA,GAA6ChT,MAAM,CAACgT,cAAc;AAE7F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCO,MAAMC,0BAA0B,GAAA7Q,OAAA,CAAA6Q,0BAAA,GAyEnChT,IAAI,CAACgT,0BAA0B;AAEnC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,YAAY,GAAA9Q,OAAA,CAAA8Q,YAAA,GAmErB7S,YAAY,CAAC6S,YAAY;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CO,MAAMC,KAAK,GAAA/Q,OAAA,CAAA+Q,KAAA,GAA4DlT,IAAI,CAACkT,KAAK;AAExF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CO,MAAMC,SAAS,GAAAhR,OAAA,CAAAgR,SAAA,GAyFlBnT,IAAI,CAACmT,SAAS;AAElB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCO,MAAMC,MAAM,GAAAjR,OAAA,CAAAiR,MAAA,GAiFfpT,IAAI,CAACoT,MAAM;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiDO,MAAMC,UAAU,GAAAlR,OAAA,CAAAkR,UAAA,GAqGnBtT,MAAM,CAACsT,UAAU;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CO,MAAMC,aAAa,GAAAnR,OAAA,CAAAmR,aAAA,GA2FtBvT,MAAM,CAACuT,aAAa;AAExB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+EO,MAAMC,cAAc,GAAApR,OAAA,CAAAoR,cAAA,GAEgDxT,MAAM,CAACwT,cAAc;AAEhG;;;;;;AAMO,MAAMC,MAAM,GAAArR,OAAA,CAAAqR,MAAA,GAA0BzT,MAAM,CAACyT,MAAM;AAE1D;;;;;;;AAOO,MAAMC,UAAU,GAAAtR,OAAA,CAAAsR,UAAA,GACrBxT,eAAe,CAACwT,UAAU;AAE5B;;;;;;;AAOO,MAAMC,UAAU,GAAAvR,OAAA,CAAAuR,UAAA,GAiBnBzT,eAAe,CAACyT,UAAU;AAE9B;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,eAAe,GAAAxR,OAAA,CAAAwR,eAAA,gBAuCxB,IAAAC,cAAI,EACN,CAAC,EACD,CAA2C7T,MAAuB,EAAE8T,MAAS,KAC3EH,UAAU,CAAC3T,MAAM,EAAEY,MAAM,CAACmT,KAAK,CAACD,MAAM,CAAC,CAAC,CAC3C;AAED;;;;;;;AAOO,MAAME,gBAAgB,GAAA5R,OAAA,CAAA4R,gBAAA,GAC3B3T,YAAY,CAAC2T,gBAAgB;AAE/B;;;;;;;;;;;;AAYO,MAAMC,OAAO,GAAA7R,OAAA,CAAA6R,OAAA,GAA0DxT,QAAQ,CAACwT,OAAO;AAE9F;;;;;;;AAOO,MAAMC,eAAe,GAAA9R,OAAA,CAAA8R,eAAA,GAAsCjU,IAAI,CAACkU,YAAY;AAEnF;;;;AAIO,MAAMC,iBAAiB,GAAAhS,OAAA,CAAAgS,iBAAA,GAAiEnU,IAAI,CAACoU,kBAAkB;AAEtH;;;;AAIO,MAAMC,qBAAqB,GAAAlS,OAAA,CAAAkS,qBAAA,GAW9BrU,IAAI,CAACsU,gBAAgB;AAEzB;;;;AAIO,MAAMC,2BAA2B,GAAApS,OAAA,CAAAoS,2BAAA,GAEAnU,YAAY,CAACoU,sBAAsB;AAE3E;;;;;;;;;;;;;;AAcO,MAAMC,UAAU,GAAAtS,OAAA,CAAAsS,UAAA,GA6DnB1U,MAAM,CAAC0U,UAAU;AAErB;;;;;;;;;;;;;AAaO,MAAMC,YAAY,GAAAvS,OAAA,CAAAuS,YAAA,GA6BrB3U,MAAM,CAAC2U,YAAY;AAEvB;;;;;;;;;;;;;AAaO,MAAMC,gBAAgB,GAAAxS,OAAA,CAAAwS,gBAAA,GAC3BvU,YAAY,CAACuU,gBAAgB;AAE/B;;;;;;;;;;;;;;;AAeO,MAAMC,kBAAkB,GAAAzS,OAAA,CAAAyS,kBAAA,GAESxU,YAAY,CAACwU,kBAAkB;AAEvE;;;;;;AAMO,MAAMC,YAAY,GAAA1S,OAAA,CAAA0S,YAAA,GAAmD7U,IAAI,CAAC6U,YAAY;AAE7F;;;;;;AAMO,MAAMC,UAAU,GAAA3S,OAAA,CAAA2S,UAAA,GAenB/U,MAAM,CAAC+U,UAAU;AA0ErB;;;;;;AAMO,MAAMC,mBAAmB,GAAA5S,OAAA,CAAA4S,mBAAA,GAAmC7U,QAAQ,CAAC6U,mBAAmB;AAE/F;;;;;;;;;;;;;;;;;;;;;AAqBO,MAAMC,aAAa,GAAA7S,OAAA,CAAA6S,aAAA,GAA2C9U,QAAQ,CAAC8U,aAAa;AAiH3F;;;;AAIO,MAAMC,eAAe,GAAA9S,OAAA,CAAA8S,eAAA,GAA0C/U,QAAQ,CAAC+U,eAAe;AAE9F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCO,MAAMC,SAAS,GAAA/S,OAAA,CAAA+S,SAAA,GAAgEhV,QAAQ,CAACgV,SAAS;AAExG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDO,MAAMC,OAAO,GAAAhT,OAAA,CAAAgT,OAAA,GAGY3U,QAAQ,CAAC4U,gBAAgB;AAEzD;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,WAAW,GAAAlT,OAAA,CAAAkT,WAAA,GAGI7U,QAAQ,CAAC8U,eAAe;AAEpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CO,MAAMC,UAAU,GAAApT,OAAA,CAAAoT,UAAA,GAGL/U,QAAQ,CAACgV,sBAAsB;AAEjD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,cAAc,GAAAtT,OAAA,CAAAsT,cAAA,GAGKjV,QAAQ,CAACkV,0BAA0B;AAEnE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6EO,MAAMC,OAAO,GAAAxT,OAAA,CAAAwT,OAAA,GAAsCnV,QAAQ,CAACoV,mBAAmB;AAEtF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4EO,MAAMC,WAAW,GAAA1T,OAAA,CAAA0T,WAAA,GAAoDrV,QAAQ,CAACsV,uBAAuB;AAE5G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoDO,MAAMC,QAAQ,GAAA5T,OAAA,CAAA4T,QAAA,GA4HjB3V,YAAY,CAAC2V,QAAQ;AAEzB;;;;;;;;;;;;;;;;;;;AAmBO,MAAMC,YAAY,GAAA7T,OAAA,CAAA6T,YAAA,GA8DrB5V,YAAY,CAAC4V,YAAY;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyEO,MAAMC,GAAG,GAAA9T,OAAA,CAAA8T,GAAA,GAwKZ7V,YAAY,CAAC8V,UAAU;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,OAAO,GAAAhU,OAAA,CAAAgU,OAAA,GA0HhB/V,YAAY,CAACgW,cAAc;AAE/B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkDO,MAAMC,QAAQ,GAAAlU,OAAA,CAAAkU,QAAA,GAsHjBjW,YAAY,CAACkW,eAAe;AAEhC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CO,MAAMC,OAAO,GAAApU,OAAA,CAAAoU,OAAA,GA0GhBnW,YAAY,CAACoW,cAAc;AAE/B;;;;;;;;;;;;;AAaO,MAAMC,EAAE,GAAAtU,OAAA,CAAAsU,EAAA,gBA6BX,IAAA7C,cAAI,EACN,CAAC,EACD,CAAqB8C,IAA+B,EAAEC,IAAuB,KAC3EJ,OAAO,CAACG,IAAI,EAAEC,IAAI,EAAE,CAACpV,CAAC,EAAEqV,CAAC,KAAKrV,CAAC,CAACqV,CAAC,CAAC,CAAC,CACtC;AAED;;;;AAIO,MAAMC,OAAO,GAAA1U,OAAA,CAAA0U,OAAA,GAAoF7W,IAAI,CAAC6W,OAAO;AAEpH;;;;AAIO,MAAMC,eAAe,GAAA3U,OAAA,CAAA2U,eAAA,GAAoD9W,IAAI,CAAC8W,eAAe;AAEpG;;;;AAIO,MAAMC,IAAI,GAAA5U,OAAA,CAAA4U,IAAA,GAA0F/W,IAAI,CAAC+W,IAAI;AAEpH;;;;AAIO,MAAMC,OAAO,GAAA7U,OAAA,CAAA6U,OAAA,gBAwBhB,IAAApD,cAAI,EAAEqD,IAAI,IAAKrW,OAAO,CAACsW,SAAS,CAACD,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE1W,KAAK,CAAC4W,WAAW,CAAC;AAEjE;;;;AAIO,MAAMC,kBAAkB,GAAAjV,OAAA,CAAAiV,kBAAA,GAGX7W,KAAK,CAAC8W,YAAY;AAEtC;;;;AAIO,MAAMC,mBAAmB,GAAAnV,OAAA,CAAAmV,mBAAA,GAW5BtX,IAAI,CAACsX,mBAAmB;AAE5B;;;;AAIO,MAAMC,kBAAkB,GAAApV,OAAA,CAAAoV,kBAAA,GAW3BhX,KAAK,CAACgX,kBAAkB;AAE5B;;;;AAIO,MAAMC,gBAAgB,GAAArV,OAAA,CAAAqV,gBAAA,GAWzBjX,KAAK,CAACiX,gBAAgB;AAE1B;;;;AAIO,MAAMC,MAAM,GAAAtV,OAAA,CAAAsV,MAAA,GAA0B1X,MAAM,CAAC0X,MAAM;AAE1D;;;;AAIO,MAAMC,UAAU,GAAAvV,OAAA,CAAAuV,UAAA,GACrBzX,eAAe,CAACyX,UAAU;AAE5B;;;;AAIO,MAAMC,UAAU,GAAAxV,OAAA,CAAAwV,UAAA,GAWnB1X,eAAe,CAAC0X,UAAU;AAE9B;;;;AAIO,MAAMC,gBAAgB,GAAAzV,OAAA,CAAAyV,gBAAA,GAC3BxX,YAAY,CAACwX,gBAAgB;AAE/B;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,iBAAiB,GAAA1V,OAAA,CAAA0V,iBAAA,GAuC1B7X,IAAI,CAAC6X,iBAAiB;AAE1B;;;;AAIO,MAAMC,gBAAgB,GAAA3V,OAAA,CAAA2V,gBAAA,GAWzB9X,IAAI,CAAC8X,gBAAgB;AAEzB;;;;;;;;;;;;;;;;;AAiBO,MAAMC,aAAa,GAAA5V,OAAA,CAAA4V,aAAA,GAyEtBhY,MAAM,CAACgY,aAAa;AAExB;;;;;;;;;;;;;;;;;;AAkBO,MAAMC,mBAAmB,GAAA7V,OAAA,CAAA6V,mBAAA,GAuC5BjY,MAAM,CAACiY,mBAAmB;AAE9B;;;;AAIO,MAAMC,WAAW,GAAA9V,OAAA,CAAA8V,WAAA,GAAsDlY,MAAM,CAACkY,WAAW;AAEhG;;;;AAIO,MAAMC,qBAAqB,GAAA/V,OAAA,CAAA+V,qBAAA,GAAsDnY,MAAM,CAACmY,qBAAqB;AAEpH;;;;AAIO,MAAMC,iBAAiB,GAAAhW,OAAA,CAAAgW,iBAAA,GAAyDpY,MAAM,CAACoY,iBAAiB;AAE/G;;;;AAIO,MAAMC,eAAe,GAAAjW,OAAA,CAAAiW,eAAA,GAA6CrY,MAAM,CAACqY,eAAe;AAE/F;;;;AAIO,MAAMC,SAAS,GAAAlW,OAAA,CAAAkW,SAAA,GAAyCtY,MAAM,CAACsY,SAAS;AAE/E;;;;;;AAMO,MAAMC,SAAS,GAAAnW,OAAA,CAAAmW,SAAA,GAmBlBvY,MAAM,CAACuY,SAAS;AAEpB;;;;;;AAMO,MAAMC,eAAe,GAAApW,OAAA,CAAAoW,eAAA,GAkBxBxY,MAAM,CAACwY,eAAe;AAE1B;;;;;;AAMO,MAAMC,QAAQ,GAAArW,OAAA,CAAAqW,QAAA,GAGMzY,MAAM,CAACyY,QAAQ;AAE1C;;;;;;;;;;AAUO,MAAMC,cAAc,GAAAtW,OAAA,CAAAsW,cAAA,GAGoBrY,YAAY,CAACqY,cAAc;AAE1E;;;;;;;;;;AAUO,MAAMC,OAAO,GAAAvW,OAAA,CAAAuW,OAAA,GA2BhB3Y,MAAM,CAAC2Y,OAAO;AAElB;;;;;;AAMO,MAAMC,QAAQ,GAAAxW,OAAA,CAAAwW,QAAA,GAmBjB5Y,MAAM,CAAC4Y,QAAQ;AAkBnB;;;;;;;;;;;;;;;;;;;;AAoBO,MAAMC,gBAAgB,GAAAzW,OAAA,CAAAyW,gBAAA,GAMc7Y,MAAM,CAAC6Y,gBAAgB;AAElE;;;;;;;;AAQO,MAAMC,cAAc,GAAA1W,OAAA,CAAA0W,cAAA,GAmBvBzY,YAAY,CAACyY,cAAc;AAE/B;;;;;;AAMO,MAAMC,cAAc,GAAA3W,OAAA,CAAA2W,cAAA,GAevB/Y,MAAM,CAAC+Y,cAAc;AAEzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwDO,MAAMC,YAAY,GAAA5W,OAAA,CAAA4W,YAAA,GAA0EhZ,MAAM,CAACgZ,YAAY;AAEtH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDO,MAAMC,kBAAkB,GAAA7W,OAAA,CAAA6W,kBAAA,GAE8CjZ,MAAM,CAACiZ,kBAAkB;AAEtG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,eAAe,GAC1BvC,IAAoC,IACF;EAClC,OAAOpW,OAAO,CAAC4Y,MAAM,CAACxC,IAAI,CAAC,GAAGvR,WAAW,GAAGoD,GAAG,CAACmO,IAAI,CAACyC,KAAK,EAAE7Y,OAAO,CAAC8Y,IAAI,CAAC;AAC3E,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAAjX,OAAA,CAAA8W,eAAA,GAAAA,eAAA;AAkCO,MAAMI,kBAAkB,GAAAlX,OAAA,CAAAkX,kBAAA,gBAAG,IAAAzF,cAAI,EAuEpC,CAAC,EAAE,CAAC8C,IAAI,EAAEnV,CAAC,KAAKjB,OAAO,CAAC4Y,MAAM,CAACxC,IAAI,CAAC,GAAGvR,WAAW,GAAGoD,GAAG,CAAChH,CAAC,CAACmV,IAAI,CAACyC,KAAK,CAAC,EAAE7Y,OAAO,CAAC8Y,IAAI,CAAC,CAAC;AAkDxF,MAAME,YAAY,GAAIC,QAA0D,IAAI;EAClF,MAAMC,KAAK,GAAG,IAAIC,GAAG,EAAE;EACvB,OAAO,IAAIC,KAAK,CAACH,QAAQ,EAAE;IACzB5X,GAAGA,CAACgY,MAAW,EAAEC,IAAS,EAAEC,QAAQ;MAClC,IAAID,IAAI,IAAID,MAAM,EAAE;QAClB,OAAOG,OAAO,CAACnY,GAAG,CAACgY,MAAM,EAAEC,IAAI,EAAEC,QAAQ,CAAC;MAC5C;MACA,IAAIL,KAAK,CAAC9X,GAAG,CAACkY,IAAI,CAAC,EAAE;QACnB,OAAOJ,KAAK,CAAC7X,GAAG,CAACiY,IAAI,CAAC;MACxB;MACA,MAAMG,EAAE,GAAGA,CAAC,GAAG9C,IAAgB,KAC7BjX,IAAI,CAACmP,OAAO,CAACwK,MAAM,EAAGK,CAAM,IAAI;QAC9B,IAAI,OAAOA,CAAC,CAACJ,IAAI,CAAC,KAAK,UAAU,EAAE;UACjCJ,KAAK,CAAC5X,GAAG,CAACgY,IAAI,EAAE,CAAC,GAAG3C,IAAgB,KAAKjX,IAAI,CAACmP,OAAO,CAACwK,MAAM,EAAGK,CAAM,IAAKA,CAAC,CAACJ,IAAI,CAAC,CAAC,GAAG3C,IAAI,CAAC,CAAC,CAAC;UAC5F,OAAO+C,CAAC,CAACJ,IAAI,CAAC,CAAC,GAAG3C,IAAI,CAAC;QACzB;QACAuC,KAAK,CAAC5X,GAAG,CAACgY,IAAI,EAAE5Z,IAAI,CAACmP,OAAO,CAACwK,MAAM,EAAGK,CAAM,IAAKA,CAAC,CAACJ,IAAI,CAAC,CAAC,CAAC;QAC1D,OAAOI,CAAC,CAACJ,IAAI,CAAC;MAChB,CAAC,CAAC;MACJ,MAAMK,EAAE,GAAGja,IAAI,CAACmP,OAAO,CAACwK,MAAM,EAAGK,CAAM,IAAKA,CAAC,CAACJ,IAAI,CAAC,CAAC;MACpD;MACA7X,MAAM,CAACmY,MAAM,CAACH,EAAE,EAAEE,EAAE,CAAC;MACrB,MAAME,KAAK,GAAGJ,EAAE,CAACI,KAAK;MACtB,MAAMxM,IAAI,GAAGoM,EAAE,CAACpM,IAAI;MACpB,MAAM7L,IAAI,GAAGiY,EAAE,CAACjY,IAAI;MACpB,MAAMsY,KAAK,GAAGrY,MAAM,CAACsY,cAAc,CAAC,EAAE,EAAEtY,MAAM,CAACuY,cAAc,CAACL,EAAE,CAAC,CAAC;MAClEG,KAAK,CAACD,KAAK,GAAGA,KAAK;MACnBC,KAAK,CAACzM,IAAI,GAAGA,IAAI;MACjByM,KAAK,CAACtY,IAAI,GAAGA,IAAI;MACjBC,MAAM,CAACsY,cAAc,CAACN,EAAE,EAAEK,KAAK,CAAC;MAChCZ,KAAK,CAAC5X,GAAG,CAACgY,IAAI,EAAEG,EAAE,CAAC;MACnB,OAAOA,EAAE;IACX;GACD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCO,MAAMQ,GAAG,GAYTC,EAAE,IAAK,MAAK;EACf,MAAMC,KAAK,GAAGC,KAAK,CAACC,eAAe;EACnCD,KAAK,CAACC,eAAe,GAAG,CAAC;EACzB,MAAMC,aAAa,GAAG,IAAIF,KAAK,EAAE;EACjCA,KAAK,CAACC,eAAe,GAAGF,KAAK;EAC7B,SAASlB,QAAQA,CAAA,GAAI;EACrBxX,MAAM,CAACsY,cAAc,CAACd,QAAQ,EAAEsB,iBAAQ,CAAC;EACzCtB,QAAQ,CAACuB,GAAG,GAAGN,EAAE;EACjBzY,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,KAAK,EAAE;IACrC5X,GAAGA,CAAA;MACD,OAAQoZ,IAAqB,IAAK/a,IAAI,CAACmP,OAAO,CAAC,IAAI,EAAE4L,IAAI,CAAC;IAC5D;GACD,CAAC;EACFhZ,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,OAAO,EAAE;IACvC5X,GAAGA,CAAA;MACD,OAAOiZ,aAAa,CAACI,KAAK;IAC5B;GACD,CAAC;EACF,OAAO1B,YAAY,CAACC,QAAe,CAAC;AACtC,CAAC;AAIH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAApX,OAAA,CAAAoY,GAAA,GAAAA,GAAA;AA6CO,MAAMU,OAAO,GAwFhB,SAAAA,CAAA;EACF,OAAO;IACL,MAAM,CAACT,EAAE,EAAEU,KAAK,CAAC,GAAGC,SAAS;IAC7B,MAAMC,KAAK,GAAG,WAAW,IAAIF,KAAK,GAAGA,KAAK,CAAC,WAAW,CAAC,GAAG,KAAK;IAC/D,MAAMT,KAAK,GAAGC,KAAK,CAACC,eAAe;IACnCD,KAAK,CAACC,eAAe,GAAG,CAAC;IACzB,MAAMC,aAAa,GAAG,IAAIF,KAAK,EAAE;IACjCA,KAAK,CAACC,eAAe,GAAGF,KAAK;IAE7B,IAAIY,UAAU,GAAsC,WAAW;IAC/D,MAAM9B,QAAQ,GAAQ,SAAAA,CAAoB+B,OAAY;MACpD,IAAID,UAAU,KAAK,WAAW,EAAE;QAC9B,MAAMjB,KAAK,GAAGrY,MAAM,CAACuY,cAAc,CAACgB,OAAO,CAAC;QAC5C,IAAIlB,KAAK,KAAKrY,MAAM,CAACwZ,SAAS,IAAInB,KAAK,KAAK,IAAI,EAAE;UAChDiB,UAAU,GAAG,OAAO;QACtB,CAAC,MAAM;UACL,MAAMG,SAAS,GAAGzZ,MAAM,CAACuY,cAAc,CAAC,IAAI,CAAC;UAC7CvY,MAAM,CAACsY,cAAc,CAACmB,SAAS,EAAEpB,KAAK,CAAC;UACvCiB,UAAU,GAAG,SAAS;QACxB;MACF;MACA,IAAIA,UAAU,KAAK,OAAO,EAAE;QAC1BtZ,MAAM,CAACmY,MAAM,CAAC,IAAI,EAAEoB,OAAO,CAAC;MAC9B,CAAC,MAAM,IAAID,UAAU,KAAK,SAAS,EAAE;QACnCtZ,MAAM,CAACsY,cAAc,CAACiB,OAAO,EAAEvZ,MAAM,CAACuY,cAAc,CAAC,IAAI,CAAC,CAAC;QAC3D,OAAOgB,OAAO;MAChB;IACF,CAAC;IAED/B,QAAQ,CAACgC,SAAS,CAACE,IAAI,GAAGjB,EAAE;IAC5BzY,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,MAAM,EAAE;MACtC5X,GAAGA,CAAA;QACD,OAAQ2Z,OAAY,IAAK,IAAI,IAAI,CAACA,OAAO,CAAC;MAC5C;KACD,CAAC;IACFvZ,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,KAAK,EAAE;MACrC5X,GAAGA,CAAA;QACD,OAAQoZ,IAAS,IAAK/a,IAAI,CAACmP,OAAO,CAAC,IAAI,EAAE4L,IAAI,CAAC;MAChD;KACD,CAAC;IACFxB,QAAQ,CAACuB,GAAG,GAAGN,EAAE;IAEjBzY,MAAM,CAACmY,MAAM,CAACX,QAAQ,EAAEsB,iBAAQ,CAAC;IAEjC9Y,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,OAAO,EAAE;MACvC5X,GAAGA,CAAA;QACD,OAAOiZ,aAAa,CAACI,KAAK;MAC5B;KACD,CAAC;IAEF,MAAMU,OAAO,GAAG,cAAc,IAAIR,KAAK,IAAIA,KAAK,CAACS,YAAY,CAACC,MAAM,GAAG,CAAC;IACxE,MAAMC,SAAS,GAAGH,OAAO,GAAG,4BAA4B,GAAG,SAAS;IACpE,IAAII,UAAuC;IAC3C,IAAIC,UAAU,GAAG,KAAK;IACtB,IAAI,QAAQ,IAAIb,KAAK,EAAE;MACrBa,UAAU,GAAG,OAAOb,KAAK,CAACnb,MAAM,KAAK,UAAU;MAC/CgC,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAEsC,SAAS,EAAE;QACzCla,GAAGA,CAAA;UACD,IAAIoa,UAAU,EAAE;YACd,OAAO;cACL,OAAO1b,KAAK,CAAC2b,UAAU,CAACzC,QAAQ,EAAEhR,GAAG,CAAC2S,KAAK,CAACnb,MAAM,CAACoa,KAAK,CAAC,IAAI,EAAEgB,SAAS,CAAC,EAAGc,CAAC,IAAK,IAAI,IAAI,CAACA,CAAC,CAAC,CAAC,CAAC;YACjG,CAAC,CAACtO,IAAI,CAAC,IAAI,CAAC;UACd;UACA,OAAOmO,UAAU,KAAKzb,KAAK,CAAC2b,UAAU,CAACzC,QAAQ,EAAEhR,GAAG,CAAC2S,KAAK,CAACnb,MAAM,EAAGkc,CAAC,IAAK,IAAI,IAAI,CAACA,CAAC,CAAC,CAAC,CAAC;QACzF;OACD,CAAC;IACJ,CAAC,MAAM,IAAI,QAAQ,IAAIf,KAAK,EAAE;MAC5Ba,UAAU,GAAG,OAAOb,KAAK,CAACvR,MAAM,KAAK,UAAU;MAC/C5H,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAEsC,SAAS,EAAE;QACzCla,GAAGA,CAAA;UACD,IAAIoa,UAAU,EAAE;YACd,OAAO;cACL,OAAO1b,KAAK,CAACsJ,MAAM,CAAC4P,QAAQ,EAAEhR,GAAG,CAAC2S,KAAK,CAACvR,MAAM,CAACwQ,KAAK,CAAC,IAAI,EAAEgB,SAAS,CAAC,EAAGc,CAAC,IAAK,IAAI,IAAI,CAACA,CAAC,CAAC,CAAC,CAAC;YAC7F,CAAC,CAACtO,IAAI,CAAC,IAAI,CAAC;UACd;UACA,OAAOmO,UAAU,KAAKzb,KAAK,CAACsJ,MAAM,CAAC4P,QAAQ,EAAEhR,GAAG,CAAC2S,KAAK,CAACvR,MAAM,EAAGsS,CAAC,IAAK,IAAI,IAAI,CAACA,CAAC,CAAC,CAAC,CAAC;QACrF;OACD,CAAC;IACJ,CAAC,MAAM,IAAI,MAAM,IAAIf,KAAK,EAAE;MAC1BnZ,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAEsC,SAAS,EAAE;QACzCla,GAAGA,CAAA;UACD,OAAOma,UAAU,KAAKzb,KAAK,CAACiF,IAAI,CAACiU,QAAQ,EAAE,MAAM,IAAI,IAAI,CAAC2B,KAAK,CAAC5V,IAAI,EAAE,CAAC,CAAC;QAC1E;OACD,CAAC;IACJ,CAAC,MAAM;MACLvD,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAEsC,SAAS,EAAE;QACzCla,GAAGA,CAAA;UACD,OAAOma,UAAU,KAAKzb,KAAK,CAAC6E,OAAO,CAACqU,QAAQ,EAAE,IAAI,IAAI,CAAC2B,KAAK,CAAChW,OAAO,CAAC,CAAC;QACxE;OACD,CAAC;IACJ;IAEA,IAAIwW,OAAO,EAAE;MACX,IAAIQ,kBAA+C;MACnDna,MAAM,CAACC,cAAc,CAACuX,QAAQ,EAAE,SAAS,EAAE;QACzC5X,GAAGA,CAAA;UACD,IAAIoa,UAAU,EAAE;YACd,OAAO;cACL,OAAO1b,KAAK,CAACyM,OAAO,CAClB,IAAI,CAACqP,0BAA0B,CAAChC,KAAK,CAAC,IAAI,EAAEgB,SAAS,CAAC,EACtDD,KAAK,CAACS,YAAY,CACnB;YACH,CAAC;UACH;UACA,OAAOO,kBAAkB,KAAK7b,KAAK,CAACyM,OAAO,CACzC,IAAI,CAACqP,0BAA0B,EAC/BjB,KAAK,CAACS,YAAY,CACnB;QACH;OACD,CAAC;IACJ;IAEA,OAAOP,KAAK,KAAK,IAAI,GAAG9B,YAAY,CAACC,QAAQ,CAAC,GAAGA,QAAQ;EAC3D,CAAC;AACH,CAAQ;AAisBR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAApX,OAAA,CAAA8Y,OAAA,GAAAA,OAAA;AA0IO,MAAMlB,EAAE,GAMc,SAAAA,CAASqC,UAA6B,EAAE,GAAGC,SAAqB;EACzF,MAAM5B,KAAK,GAAGC,KAAK,CAACC,eAAe;EACnCD,KAAK,CAACC,eAAe,GAAG,CAAC;EACzB,MAAM2B,QAAQ,GAAG,IAAI5B,KAAK,EAAE;EAC5BA,KAAK,CAACC,eAAe,GAAGF,KAAK;EAC7B,IAAI,OAAO2B,UAAU,KAAK,QAAQ,EAAE;IAClC,OAAOG,YAAY,CAACH,UAAU,CAACR,MAAM,EAAE,UAAoB,GAAG3E,IAAgB;MAC5E,MAAMwD,KAAK,GAAGC,KAAK,CAACC,eAAe;MACnCD,KAAK,CAACC,eAAe,GAAG,CAAC;MACzB,MAAM6B,SAAS,GAAG,IAAI9B,KAAK,EAAE;MAC7BA,KAAK,CAACC,eAAe,GAAGF,KAAK;MAC7B,OAAOgC,OAAO,CAAC;QACb/F,IAAI,EAAE,IAAI;QACVqE,IAAI,EAAEqB,UAAU;QAChBnF,IAAI;QACJoF,SAAS;QACTK,QAAQ,EAAE,aAAa;QACvBC,WAAW,EAAE;UACXjQ,OAAO,EAAEhM,cAAc,CAACkc,kBAAkB,CAAClQ,OAAO,CAAC,IAAI;SACxD;QACD4P,QAAQ;QACRE;OACD,CAAC;IACJ,CAAC,CAAQ;EACX;EACA,MAAMK,IAAI,GAAGT,UAAU;EACvB,MAAMU,OAAO,GAAGT,SAAS,CAAC,CAAC,CAAC;EAC5B,OAAO,CAACtB,IAAc,EAAE,GAAGsB,SAAqB,KAC9CE,YAAY,CACVxB,IAAI,CAACa,MAAM,EACV;IACC,CAACiB,IAAI,EAAa,GAAG5F,IAAgB;MACnC,MAAMwD,KAAK,GAAGC,KAAK,CAACC,eAAe;MACnCD,KAAK,CAACC,eAAe,GAAG,CAAC;MACzB,MAAM6B,SAAS,GAAG,IAAI9B,KAAK,EAAE;MAC7BA,KAAK,CAACC,eAAe,GAAGF,KAAK;MAC7B,OAAOgC,OAAO,CAAC;QACb/F,IAAI,EAAE,IAAI;QACVqE,IAAI;QACJ9D,IAAI;QACJoF,SAAS;QACTK,QAAQ,EAAEG,IAAI;QACdF,WAAW,EAAEG,OAAO;QACpBR,QAAQ;QACRE;OACD,CAAC;IACJ;GACD,CAAEK,IAAI,CAAC,CACT;AACL,CAAC;AAAA1a,OAAA,CAAA4X,EAAA,GAAAA,EAAA;AAEH,SAASwC,YAAYA,CAAqBX,MAAc,EAAE7B,EAAK;EAC7D,OAAOhY,MAAM,CAACC,cAAc,CAAC+X,EAAE,EAAE,QAAQ,EAAE;IACzCZ,KAAK,EAAEyC,MAAM;IACbmB,YAAY,EAAE;GACf,CAAC;AACJ;AAEA,SAASN,OAAOA,CAACK,OAShB;EACC,IAAI/c,MAA6B;EACjC,IAAIid,OAAO,GAAQC,SAAS;EAC5B,IAAI,IAAAC,0BAAmB,EAACJ,OAAO,CAAC/B,IAAI,CAAC,EAAE;IACrChb,MAAM,GAAGC,IAAI,CAACmd,YAAY,CAAC,MAAML,OAAO,CAAC/B,IAAI,CAACZ,KAAK,CAAC2C,OAAO,CAACpG,IAAI,EAAEoG,OAAO,CAAC7F,IAAI,CAAC,CAAC;EAClF,CAAC,MAAM;IACL,IAAI;MACFlX,MAAM,GAAG+c,OAAO,CAAC/B,IAAI,CAACZ,KAAK,CAAC2C,OAAO,CAACpG,IAAI,EAAEoG,OAAO,CAAC7F,IAAI,CAAC;IACzD,CAAC,CAAC,OAAOmG,KAAK,EAAE;MACdJ,OAAO,GAAGI,KAAK;MACfrd,MAAM,GAAG4E,GAAG,CAACyY,KAAK,CAAC;IACrB;EACF;EACA,IAAIN,OAAO,CAACT,SAAS,CAACT,MAAM,GAAG,CAAC,EAAE;IAChC,IAAI;MACF,KAAK,MAAMyB,CAAC,IAAIP,OAAO,CAACT,SAAS,EAAE;QACjCtc,MAAM,GAAGsd,CAAC,CAACtd,MAAM,EAAE,GAAG+c,OAAO,CAAC7F,IAAI,CAAC;MACrC;IACF,CAAC,CAAC,OAAOmG,KAAK,EAAE;MACdrd,MAAM,GAAGid,OAAO,GACZvY,SAAS,CAAC9E,aAAa,CAAC2d,UAAU,CAClC3d,aAAa,CAACgF,GAAG,CAACqY,OAAO,CAAC,EAC1Brd,aAAa,CAACgF,GAAG,CAACyY,KAAK,CAAC,CACzB,CAAC,GACAzY,GAAG,CAACyY,KAAK,CAAC;IAChB;EACF;EAEA,IAAI5D,KAAK,GAAmB,KAAK;EACjC,MAAM+D,iBAAiB,GAAGA,CAAA,KAAK;IAC7B,IAAI/D,KAAK,KAAK,KAAK,EAAE;MACnB,OAAOA,KAAK;IACd;IACA,IAAIsD,OAAO,CAACN,SAAS,CAACxB,KAAK,EAAE;MAC3B,MAAMwC,QAAQ,GAAGV,OAAO,CAACR,QAAQ,CAACtB,KAAM,CAACyC,IAAI,EAAE,CAACC,KAAK,CAAC,IAAI,CAAC;MAC3D,MAAMC,SAAS,GAAGb,OAAO,CAACN,SAAS,CAACxB,KAAK,CAACyC,IAAI,EAAE,CAACC,KAAK,CAAC,IAAI,CAAC;MAC5D,IAAIE,WAAW,GAAGJ,QAAQ,CAACK,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC,CAACL,IAAI,EAAE;MACrD,IAAI,CAACG,WAAW,CAACG,QAAQ,CAAC,GAAG,CAAC,EAAE;QAC9BH,WAAW,GAAGA,WAAW,CAACI,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC;MACzD;MACA,IAAIC,YAAY,GAAGN,SAAS,CAACE,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,IAAI,CAAC,CAACL,IAAI,EAAE;MACvD,IAAI,CAACQ,YAAY,CAACF,QAAQ,CAAC,GAAG,CAAC,EAAE;QAC/BE,YAAY,GAAGA,YAAY,CAACD,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC;MAC3D;MACAxE,KAAK,GAAG,GAAGoE,WAAW,KAAKK,YAAY,EAAE;MACzC,OAAOzE,KAAK;IACd;EACF,CAAC;EACD,MAAM0E,IAAI,GAASpB,OAAO,CAACH,WAAW,IAAI,mBAAmB,IAAIG,OAAO,CAACH,WAAW,GAChFG,OAAO,CAACH,WAAW,GACnB;IAAEY,iBAAiB;IAAE,GAAGT,OAAO,CAACH;EAAW,CAAE;EACjD,OAAOhE,QAAQ,CAAC5Y,MAAM,EAAE+c,OAAO,CAACJ,QAAQ,EAAEwB,IAAI,CAAC;AACjD;AAEA;;;;;;;;AAQO,MAAMC,UAAU,GAAAhc,OAAA,CAAAgc,UAAA,GAAgBne,IAAI,CAACme,UAAU;AAEtD;AACA;AACA;AAEA;;;;;;;;;;;;;AAaO,MAAMC,iBAAiB,GAAGA,CAAA,KAA8Bre,MAAwB,IAAuBA,MAAM;AAEpH;;;;;;;;;;;;;AAAAoC,OAAA,CAAAic,iBAAA,GAAAA,iBAAA;AAaO,MAAMC,eAAe,GAAGA,CAAA,KAA8Bte,MAAwB,IAAuBA,MAAM;AAElH;;;;;;;;;;;;;AAAAoC,OAAA,CAAAkc,eAAA,GAAAA,eAAA;AAaO,MAAMC,sBAAsB,GAAGA,CAAA,KAA8Bve,MAAwB,IAC1FA,MAAM;AAAAoC,OAAA,CAAAmc,sBAAA,GAAAA,sBAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Effectable.js

@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.StructuralCommitPrototype = exports.StructuralClass = exports.StreamTypeId = exports.SinkTypeId = exports.EffectTypeId = exports.EffectPrototype = exports.CommitPrototype = exports.Class = exports.ChannelTypeId = void 0;
+var internal = _interopRequireWildcard(require("./internal/effectable.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category type ids
+ */
+const EffectTypeId = exports.EffectTypeId = internal.EffectTypeId;
+/**
+ * @since 2.0.0
+ * @category type ids
+ */
+const StreamTypeId = exports.StreamTypeId = internal.StreamTypeId;
+/**
+ * @since 2.0.0
+ * @category type ids
+ */
+const SinkTypeId = exports.SinkTypeId = internal.SinkTypeId;
+/**
+ * @since 2.0.0
+ * @category type ids
+ */
+const ChannelTypeId = exports.ChannelTypeId = internal.ChannelTypeId;
+/**
+ * @since 2.0.0
+ * @category prototypes
+ */
+const EffectPrototype = exports.EffectPrototype = internal.EffectPrototype;
+/**
+ * @since 2.0.0
+ * @category prototypes
+ */
+const CommitPrototype = exports.CommitPrototype = internal.CommitPrototype;
+/**
+ * @since 2.0.0
+ * @category prototypes
+ */
+const StructuralCommitPrototype = exports.StructuralCommitPrototype = internal.StructuralCommitPrototype;
+const Base = internal.Base;
+const StructuralBase = internal.StructuralBase;
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+class Class extends Base {}
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+exports.Class = Class;
+class StructuralClass extends StructuralBase {}
+exports.StructuralClass = StructuralClass;
+//# sourceMappingURL=Effectable.js.map

backend/node_modules/effect/dist/cjs/Effectable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Effectable.js","names":["internal","_interopRequireWildcard","require","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","EffectTypeId","exports","StreamTypeId","SinkTypeId","ChannelTypeId","EffectPrototype","CommitPrototype","StructuralCommitPrototype","Base","StructuralBase","Class","StructuralClass"],"sources":["../../src/Effectable.ts"],"sourcesContent":[null],"mappings":";;;;;;AAKA,IAAAA,QAAA,GAAAC,uBAAA,CAAAC,OAAA;AAAoD,SAAAD,wBAAAE,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAJ,uBAAA,YAAAA,CAAAE,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAIpD;;;;AAIO,MAAMkB,YAAY,GAAAC,OAAA,CAAAD,YAAA,GAAwBtB,QAAQ,CAACsB,YAAY;AAQtE;;;;AAIO,MAAME,YAAY,GAAAD,OAAA,CAAAC,YAAA,GAAwBxB,QAAQ,CAACwB,YAAY;AAQtE;;;;AAIO,MAAMC,UAAU,GAAAF,OAAA,CAAAE,UAAA,GAAoBzB,QAAQ,CAACyB,UAAU;AAQ9D;;;;AAIO,MAAMC,aAAa,GAAAH,OAAA,CAAAG,aAAA,GAA0B1B,QAAQ,CAAC0B,aAAa;AAgB1E;;;;AAIO,MAAMC,eAAe,GAAAJ,OAAA,CAAAI,eAAA,GAAyB3B,QAAQ,CAAC2B,eAAe;AAE7E;;;;AAIO,MAAMC,eAAe,GAAAL,OAAA,CAAAK,eAAA,GAAyB5B,QAAQ,CAAC4B,eAAe;AAE7E;;;;AAIO,MAAMC,yBAAyB,GAAAN,OAAA,CAAAM,yBAAA,GAAyB7B,QAAQ,CAAC6B,yBAAyB;AAEjG,MAAMC,IAAI,GAAoB9B,QAAQ,CAAC8B,IAAI;AAC3C,MAAMC,cAAc,GAAoB/B,QAAQ,CAAC+B,cAAc;AAE/D;;;;AAIM,MAAgBC,KAA+B,SAAQF,IAAa;AAO1E;;;;AAAAP,OAAA,CAAAS,KAAA,GAAAA,KAAA;AAIM,MAAgBC,eAAyC,SAAQF,cAAuB;AAAAR,OAAA,CAAAU,eAAA,GAAAA,eAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Either.js

@@ -0,0 +1,654 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zipWith = exports.void = exports.try = exports.transposeOption = exports.transposeMapOption = exports.right = exports.orElse = exports.merge = exports.match = exports.mapLeft = exports.mapBoth = exports.map = exports.liftPredicate = exports.let = exports.left = exports.isRight = exports.isLeft = exports.isEither = exports.getRight = exports.getOrUndefined = exports.getOrThrowWith = exports.getOrThrow = exports.getOrNull = exports.getOrElse = exports.getLeft = exports.getEquivalence = exports.gen = exports.fromOption = exports.fromNullable = exports.flip = exports.flatMap = exports.filterOrLeft = exports.bindTo = exports.bind = exports.ap = exports.andThen = exports.all = exports.TypeId = exports.Do = void 0;
+var Equivalence = _interopRequireWildcard(require("./Equivalence.js"));
+var _Function = require("./Function.js");
+var doNotation = _interopRequireWildcard(require("./internal/doNotation.js"));
+var either = _interopRequireWildcard(require("./internal/either.js"));
+var option_ = _interopRequireWildcard(require("./internal/option.js"));
+var _Predicate = require("./Predicate.js");
+var Gen = _interopRequireWildcard(require("./Utils.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @category symbols
+ * @since 2.0.0
+ */
+const TypeId = exports.TypeId = either.TypeId;
+/**
+ * Constructs a new `Either` holding a `Right` value. This usually represents a successful value due to the right bias
+ * of this structure.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const right = exports.right = either.right;
+const void_ = exports.void = /*#__PURE__*/right(void 0);
+/**
+ * Constructs a new `Either` holding a `Left` value. This usually represents a failure, due to the right-bias of this
+ * structure.
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const left = exports.left = either.left;
+/**
+ * Takes a lazy default and a nullable value, if the value is not nully (`null` or `undefined`), turn it into a `Right`, if the value is nully use
+ * the provided default as a `Left`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.fromNullable(1, () => 'fallback'), Either.right(1))
+ * assert.deepStrictEqual(Either.fromNullable(null, () => 'fallback'), Either.left('fallback'))
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const fromNullable = exports.fromNullable = /*#__PURE__*/(0, _Function.dual)(2, (self, onNullable) => self == null ? left(onNullable(self)) : right(self));
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, Option } from "effect"
+ *
+ * assert.deepStrictEqual(Either.fromOption(Option.some(1), () => 'error'), Either.right(1))
+ * assert.deepStrictEqual(Either.fromOption(Option.none(), () => 'error'), Either.left('error'))
+ * ```
+ *
+ * @category constructors
+ * @since 2.0.0
+ */
+const fromOption = exports.fromOption = either.fromOption;
+const try_ = evaluate => {
+  if ((0, _Predicate.isFunction)(evaluate)) {
+    try {
+      return right(evaluate());
+    } catch (e) {
+      return left(e);
+    }
+  } else {
+    try {
+      return right(evaluate.try());
+    } catch (e) {
+      return left(evaluate.catch(e));
+    }
+  }
+};
+exports.try = try_;
+/**
+ * Tests if a value is a `Either`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.isEither(Either.right(1)), true)
+ * assert.deepStrictEqual(Either.isEither(Either.left("a")), true)
+ * assert.deepStrictEqual(Either.isEither({ right: 1 }), false)
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isEither = exports.isEither = either.isEither;
+/**
+ * Determine if a `Either` is a `Left`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.isLeft(Either.right(1)), false)
+ * assert.deepStrictEqual(Either.isLeft(Either.left("a")), true)
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isLeft = exports.isLeft = either.isLeft;
+/**
+ * Determine if a `Either` is a `Right`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.isRight(Either.right(1)), true)
+ * assert.deepStrictEqual(Either.isRight(Either.left("a")), false)
+ * ```
+ *
+ * @category guards
+ * @since 2.0.0
+ */
+const isRight = exports.isRight = either.isRight;
+/**
+ * Converts a `Either` to an `Option` discarding the `Left`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, Option } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getRight(Either.right('ok')), Option.some('ok'))
+ * assert.deepStrictEqual(Either.getRight(Either.left('err')), Option.none())
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getRight = exports.getRight = either.getRight;
+/**
+ * Converts a `Either` to an `Option` discarding the value.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, Option } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getLeft(Either.right('ok')), Option.none())
+ * assert.deepStrictEqual(Either.getLeft(Either.left('err')), Option.some('err'))
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getLeft = exports.getLeft = either.getLeft;
+/**
+ * @category equivalence
+ * @since 2.0.0
+ */
+const getEquivalence = ({
+  left,
+  right
+}) => Equivalence.make((x, y) => isLeft(x) ? isLeft(y) && left(x.left, y.left) : isRight(y) && right(x.right, y.right));
+/**
+ * @category mapping
+ * @since 2.0.0
+ */
+exports.getEquivalence = getEquivalence;
+const mapBoth = exports.mapBoth = /*#__PURE__*/(0, _Function.dual)(2, (self, {
+  onLeft,
+  onRight
+}) => isLeft(self) ? left(onLeft(self.left)) : right(onRight(self.right)));
+/**
+ * Maps the `Left` side of an `Either` value to a new `Either` value.
+ *
+ * @category mapping
+ * @since 2.0.0
+ */
+const mapLeft = exports.mapLeft = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => isLeft(self) ? left(f(self.left)) : right(self.right));
+/**
+ * Maps the `Right` side of an `Either` value to a new `Either` value.
+ *
+ * @category mapping
+ * @since 2.0.0
+ */
+const map = exports.map = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => isRight(self) ? right(f(self.right)) : left(self.left));
+/**
+ * Takes two functions and an `Either` value, if the value is a `Left` the inner value is applied to the `onLeft function,
+ * if the value is a `Right` the inner value is applied to the `onRight` function.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { pipe, Either } from "effect"
+ *
+ * const onLeft  = (strings: ReadonlyArray<string>): string => `strings: ${strings.join(', ')}`
+ *
+ * const onRight = (value: number): string => `Ok: ${value}`
+ *
+ * assert.deepStrictEqual(pipe(Either.right(1), Either.match({ onLeft, onRight })), 'Ok: 1')
+ * assert.deepStrictEqual(
+ *   pipe(Either.left(['string 1', 'string 2']), Either.match({ onLeft, onRight })),
+ *   'strings: string 1, string 2'
+ * )
+ * ```
+ *
+ * @category pattern matching
+ * @since 2.0.0
+ */
+const match = exports.match = /*#__PURE__*/(0, _Function.dual)(2, (self, {
+  onLeft,
+  onRight
+}) => isLeft(self) ? onLeft(self.left) : onRight(self.right));
+/**
+ * Transforms a `Predicate` function into a `Right` of the input value if the predicate returns `true`
+ * or `Left` of the result of the provided function if the predicate returns false
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { pipe, Either } from "effect"
+ *
+ * const isPositive = (n: number): boolean => n > 0
+ * const isPositiveEither = Either.liftPredicate(isPositive, n => `${n} is not positive`)
+ *
+ * assert.deepStrictEqual(
+ *   isPositiveEither(1),
+ *   Either.right(1)
+ * )
+ * assert.deepStrictEqual(
+ *   isPositiveEither(0),
+ *   Either.left("0 is not positive")
+ * )
+ * ```
+ *
+ * @category lifting
+ * @since 3.4.0
+ */
+const liftPredicate = exports.liftPredicate = /*#__PURE__*/(0, _Function.dual)(3, (a, predicate, orLeftWith) => predicate(a) ? right(a) : left(orLeftWith(a)));
+/**
+ * Filter the right value with the provided function.
+ * If the predicate fails, set the left value with the result of the provided function.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { pipe, Either } from "effect"
+ *
+ * const isPositive = (n: number): boolean => n > 0
+ *
+ * assert.deepStrictEqual(
+ *   pipe(
+ *     Either.right(1),
+ *     Either.filterOrLeft(isPositive, n => `${n} is not positive`)
+ *   ),
+ *   Either.right(1)
+ * )
+ * assert.deepStrictEqual(
+ *   pipe(
+ *     Either.right(0),
+ *     Either.filterOrLeft(isPositive, n => `${n} is not positive`)
+ *   ),
+ *   Either.left("0 is not positive")
+ * )
+ * ```
+ *
+ * @since 2.0.0
+ * @category filtering & conditionals
+ */
+const filterOrLeft = exports.filterOrLeft = /*#__PURE__*/(0, _Function.dual)(3, (self, predicate, orLeftWith) => flatMap(self, r => predicate(r) ? right(r) : left(orLeftWith(r))));
+/**
+ * @category getters
+ * @since 2.0.0
+ */
+const merge = exports.merge = /*#__PURE__*/match({
+  onLeft: _Function.identity,
+  onRight: _Function.identity
+});
+/**
+ * Returns the wrapped value if it's a `Right` or a default value if is a `Left`.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getOrElse(Either.right(1), (error) => error + "!"), 1)
+ * assert.deepStrictEqual(Either.getOrElse(Either.left("not a number"), (error) => error + "!"), "not a number!")
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getOrElse = exports.getOrElse = /*#__PURE__*/(0, _Function.dual)(2, (self, onLeft) => isLeft(self) ? onLeft(self.left) : self.right);
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getOrNull(Either.right(1)), 1)
+ * assert.deepStrictEqual(Either.getOrNull(Either.left("a")), null)
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getOrNull = exports.getOrNull = /*#__PURE__*/getOrElse(_Function.constNull);
+/**
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getOrUndefined(Either.right(1)), 1)
+ * assert.deepStrictEqual(Either.getOrUndefined(Either.left("a")), undefined)
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getOrUndefined = exports.getOrUndefined = /*#__PURE__*/getOrElse(_Function.constUndefined);
+/**
+ * Extracts the value of an `Either` or throws if the `Either` is `Left`.
+ *
+ * If a default error is sufficient for your use case and you don't need to configure the thrown error, see {@link getOrThrow}.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(
+ *   Either.getOrThrowWith(Either.right(1), () => new Error('Unexpected Left')),
+ *   1
+ * )
+ * assert.throws(() => Either.getOrThrowWith(Either.left("error"), () => new Error('Unexpected Left')))
+ * ```
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getOrThrowWith = exports.getOrThrowWith = /*#__PURE__*/(0, _Function.dual)(2, (self, onLeft) => {
+  if (isRight(self)) {
+    return self.right;
+  }
+  throw onLeft(self.left);
+});
+// TODO(4.0): by default should throw `L` (i.e getOrThrowWith with the identity function)
+/**
+ * Extracts the value of an `Either` or throws if the `Either` is `Left`.
+ *
+ * The thrown error is a default error. To configure the error thrown, see  {@link getOrThrowWith}.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.getOrThrow(Either.right(1)), 1)
+ * assert.throws(() => Either.getOrThrow(Either.left("error")))
+ * ```
+ *
+ * @throws `Error("getOrThrow called on a Left")`
+ *
+ * @category getters
+ * @since 2.0.0
+ */
+const getOrThrow = exports.getOrThrow = /*#__PURE__*/getOrThrowWith(() => new Error("getOrThrow called on a Left"));
+/**
+ * Returns `self` if it is a `Right` or `that` otherwise.
+ *
+ * @category error handling
+ * @since 2.0.0
+ */
+const orElse = exports.orElse = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => isLeft(self) ? that(self.left) : right(self.right));
+/**
+ * @category sequencing
+ * @since 2.0.0
+ */
+const flatMap = exports.flatMap = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => isLeft(self) ? left(self.left) : f(self.right));
+/**
+ * Executes a sequence of two `Either`s. The second `Either` can be dependent on the result of the first `Either`.
+ *
+ * @category sequencing
+ * @since 2.0.0
+ */
+const andThen = exports.andThen = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => flatMap(self, a => {
+  const b = (0, _Predicate.isFunction)(f) ? f(a) : f;
+  return isEither(b) ? b : right(b);
+}));
+/**
+ * @category zipping
+ * @since 2.0.0
+ */
+const zipWith = exports.zipWith = /*#__PURE__*/(0, _Function.dual)(3, (self, that, f) => flatMap(self, r => map(that, r2 => f(r, r2))));
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const ap = exports.ap = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => zipWith(self, that, (f, a) => f(a)));
+/**
+ * Takes a structure of `Either`s and returns an `Either` of values with the same structure.
+ *
+ * - If a tuple is supplied, then the returned `Either` will contain a tuple with the same length.
+ * - If a struct is supplied, then the returned `Either` will contain a struct with the same keys.
+ * - If an iterable is supplied, then the returned `Either` will contain an array.
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either } from "effect"
+ *
+ * assert.deepStrictEqual(Either.all([Either.right(1), Either.right(2)]), Either.right([1, 2]))
+ * assert.deepStrictEqual(Either.all({ right: Either.right(1), b: Either.right("hello") }), Either.right({ right: 1, b: "hello" }))
+ * assert.deepStrictEqual(Either.all({ right: Either.right(1), b: Either.left("error") }), Either.left("error"))
+ * ```
+ *
+ * @category combining
+ * @since 2.0.0
+ */
+// @ts-expect-error
+const all = input => {
+  if (Symbol.iterator in input) {
+    const out = [];
+    for (const e of input) {
+      if (isLeft(e)) {
+        return e;
+      }
+      out.push(e.right);
+    }
+    return right(out);
+  }
+  const out = {};
+  for (const key of Object.keys(input)) {
+    const e = input[key];
+    if (isLeft(e)) {
+      return e;
+    }
+    out[key] = e.right;
+  }
+  return right(out);
+};
+/**
+ * Returns an `Either` that swaps the error/success cases. This allows you to
+ * use all methods on the error channel, possibly before flipping back.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+exports.all = all;
+const flip = self => isLeft(self) ? right(self.left) : left(self.right);
+exports.flip = flip;
+const adapter = /*#__PURE__*/Gen.adapter();
+/**
+ * @category generators
+ * @since 2.0.0
+ */
+const gen = (...args) => {
+  const f = args.length === 1 ? args[0] : args[1].bind(args[0]);
+  const iterator = f(adapter);
+  let state = iterator.next();
+  while (!state.done) {
+    const current = Gen.isGenKind(state.value) ? state.value.value : Gen.yieldWrapGet(state.value);
+    if (isLeft(current)) {
+      return current;
+    }
+    state = iterator.next(current.right);
+  }
+  return right(state.value);
+};
+// -------------------------------------------------------------------------------------
+// do notation
+// -------------------------------------------------------------------------------------
+/**
+ * The "do simulation" in Effect allows you to write code in a more declarative style, similar to the "do notation" in other programming languages. It provides a way to define variables and perform operations on them using functions like `bind` and `let`.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Either` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, pipe } from "effect"
+ *
+ * const result = pipe(
+ *   Either.Do,
+ *   Either.bind("x", () => Either.right(2)),
+ *   Either.bind("y", () => Either.right(3)),
+ *   Either.let("sum", ({ x, y }) => x + y)
+ * )
+ * assert.deepStrictEqual(result, Either.right({ x: 2, y: 3, sum: 5 }))
+ * ```
+ *
+ * @see {@link bind}
+ * @see {@link bindTo}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 2.0.0
+ */
+exports.gen = gen;
+const Do = exports.Do = /*#__PURE__*/right({});
+/**
+ * The "do simulation" in Effect allows you to write code in a more declarative style, similar to the "do notation" in other programming languages. It provides a way to define variables and perform operations on them using functions like `bind` and `let`.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Either` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, pipe } from "effect"
+ *
+ * const result = pipe(
+ *   Either.Do,
+ *   Either.bind("x", () => Either.right(2)),
+ *   Either.bind("y", () => Either.right(3)),
+ *   Either.let("sum", ({ x, y }) => x + y)
+ * )
+ * assert.deepStrictEqual(result, Either.right({ x: 2, y: 3, sum: 5 }))
+ * ```
+ *
+ * @see {@link Do}
+ * @see {@link bindTo}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 2.0.0
+ */
+const bind = exports.bind = /*#__PURE__*/doNotation.bind(map, flatMap);
+/**
+ * The "do simulation" in Effect allows you to write code in a more declarative style, similar to the "do notation" in other programming languages. It provides a way to define variables and perform operations on them using functions like `bind` and `let`.
+ *
+ * Here's how the do simulation works:
+ *
+ * 1. Start the do simulation using the `Do` value
+ * 2. Within the do simulation scope, you can use the `bind` function to define variables and bind them to `Either` values
+ * 3. You can accumulate multiple `bind` statements to define multiple variables within the scope
+ * 4. Inside the do simulation scope, you can also use the `let` function to define variables and bind them to simple values
+ *
+ * @example
+ * ```ts
+ * import * as assert from "node:assert"
+ * import { Either, pipe } from "effect"
+ *
+ * const result = pipe(
+ *   Either.Do,
+ *   Either.bind("x", () => Either.right(2)),
+ *   Either.bind("y", () => Either.right(3)),
+ *   Either.let("sum", ({ x, y }) => x + y)
+ * )
+ * assert.deepStrictEqual(result, Either.right({ x: 2, y: 3, sum: 5 }))
+ * ```
+ *
+ * @see {@link Do}
+ * @see {@link bind}
+ * @see {@link let_ let}
+ *
+ * @category do notation
+ * @since 2.0.0
+ */
+const bindTo = exports.bindTo = /*#__PURE__*/doNotation.bindTo(map);
+const let_ = exports.let = /*#__PURE__*/doNotation.let_(map);
+/**
+ * Converts an `Option` of an `Either` into an `Either` of an `Option`.
+ *
+ * **Details**
+ *
+ * This function transforms an `Option<Either<A, E>>` into an
+ * `Either<Option<A>, E>`. If the `Option` is `None`, the resulting `Either`
+ * will be a `Right` with a `None` value. If the `Option` is `Some`, the
+ * inner `Either` will be executed, and its result wrapped in a `Some`.
+ *
+ * @example
+ * ```ts
+ * import { Effect, Either, Option } from "effect"
+ *
+ * //      ┌─── Option<Either<number, never>>
+ * //      ▼
+ * const maybe = Option.some(Either.right(42))
+ *
+ * //      ┌─── Either<Option<number>, never, never>
+ * //      ▼
+ * const result = Either.transposeOption(maybe)
+ *
+ * console.log(Effect.runSync(result))
+ * // Output: { _id: 'Option', _tag: 'Some', value: 42 }
+ * ```
+ *
+ * @since 3.14.0
+ * @category Optional Wrapping & Unwrapping
+ */
+const transposeOption = self => {
+  return option_.isNone(self) ? right(option_.none) : map(self.value, option_.some);
+};
+/**
+ * Applies an `Either` on an `Option` and transposes the result.
+ *
+ * **Details**
+ *
+ * If the `Option` is `None`, the resulting `Either` will immediately succeed with a `Right` value of `None`.
+ * If the `Option` is `Some`, the transformation function will be applied to the inner value, and its result wrapped in a `Some`.
+ *
+ * @example
+ * ```ts
+ * import { Either, Option, pipe } from "effect"
+ *
+ * //          ┌─── Either<Option<number>, never>>
+ * //          ▼
+ * const noneResult = pipe(
+ *   Option.none(),
+ *   Either.transposeMapOption(() => Either.right(42)) // will not be executed
+ * )
+ * console.log(noneResult)
+ * // Output: { _id: 'Either', _tag: 'Right', right: { _id: 'Option', _tag: 'None' } }
+ *
+ * //          ┌─── Either<Option<number>, never>>
+ * //          ▼
+ * const someRightResult = pipe(
+ *   Option.some(42),
+ *   Either.transposeMapOption((value) => Either.right(value * 2))
+ * )
+ * console.log(someRightResult)
+ * // Output: { _id: 'Either', _tag: 'Right', right: { _id: 'Option', _tag: 'Some', value: 84 } }
+ * ```
+ *
+ * @since 3.15.0
+ * @category Optional Wrapping & Unwrapping
+ */
+exports.transposeOption = transposeOption;
+const transposeMapOption = exports.transposeMapOption = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => option_.isNone(self) ? right(option_.none) : map(f(self.value), option_.some));
+//# sourceMappingURL=Either.js.map

backend/node_modules/effect/dist/cjs/Encoding.js

@@ -0,0 +1,155 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isEncodeException = exports.isDecodeException = exports.encodeUriComponent = exports.encodeHex = exports.encodeBase64Url = exports.encodeBase64 = exports.decodeUriComponent = exports.decodeHexString = exports.decodeHex = exports.decodeBase64UrlString = exports.decodeBase64Url = exports.decodeBase64String = exports.decodeBase64 = exports.EncodeExceptionTypeId = exports.EncodeException = exports.DecodeExceptionTypeId = exports.DecodeException = void 0;
+var Either = _interopRequireWildcard(require("./Either.js"));
+var Base64 = _interopRequireWildcard(require("./internal/encoding/base64.js"));
+var Base64Url = _interopRequireWildcard(require("./internal/encoding/base64Url.js"));
+var Common = _interopRequireWildcard(require("./internal/encoding/common.js"));
+var Hex = _interopRequireWildcard(require("./internal/encoding/hex.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This module provides encoding & decoding functionality for:
+ *
+ * - base64 (RFC4648)
+ * - base64 (URL)
+ * - hex
+ *
+ * @since 2.0.0
+ */
+
+/**
+ * Encodes the given value into a base64 (RFC4648) `string`.
+ *
+ * @category encoding
+ * @since 2.0.0
+ */
+const encodeBase64 = input => typeof input === "string" ? Base64.encode(Common.encoder.encode(input)) : Base64.encode(input);
+/**
+ * Decodes a base64 (RFC4648) encoded `string` into a `Uint8Array`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.encodeBase64 = encodeBase64;
+const decodeBase64 = str => Base64.decode(str);
+/**
+ * Decodes a base64 (RFC4648) encoded `string` into a UTF-8 `string`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.decodeBase64 = decodeBase64;
+const decodeBase64String = str => Either.map(decodeBase64(str), _ => Common.decoder.decode(_));
+/**
+ * Encodes the given value into a base64 (URL) `string`.
+ *
+ * @category encoding
+ * @since 2.0.0
+ */
+exports.decodeBase64String = decodeBase64String;
+const encodeBase64Url = input => typeof input === "string" ? Base64Url.encode(Common.encoder.encode(input)) : Base64Url.encode(input);
+/**
+ * Decodes a base64 (URL) encoded `string` into a `Uint8Array`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.encodeBase64Url = encodeBase64Url;
+const decodeBase64Url = str => Base64Url.decode(str);
+/**
+ * Decodes a base64 (URL) encoded `string` into a UTF-8 `string`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.decodeBase64Url = decodeBase64Url;
+const decodeBase64UrlString = str => Either.map(decodeBase64Url(str), _ => Common.decoder.decode(_));
+/**
+ * Encodes the given value into a hex `string`.
+ *
+ * @category encoding
+ * @since 2.0.0
+ */
+exports.decodeBase64UrlString = decodeBase64UrlString;
+const encodeHex = input => typeof input === "string" ? Hex.encode(Common.encoder.encode(input)) : Hex.encode(input);
+/**
+ * Decodes a hex encoded `string` into a `Uint8Array`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.encodeHex = encodeHex;
+const decodeHex = str => Hex.decode(str);
+/**
+ * Decodes a hex encoded `string` into a UTF-8 `string`.
+ *
+ * @category decoding
+ * @since 2.0.0
+ */
+exports.decodeHex = decodeHex;
+const decodeHexString = str => Either.map(decodeHex(str), _ => Common.decoder.decode(_));
+/**
+ * Encodes a UTF-8 `string` into a URI component `string`.
+ *
+ * @category encoding
+ * @since 3.12.0
+ */
+exports.decodeHexString = decodeHexString;
+const encodeUriComponent = str => Either.try({
+  try: () => encodeURIComponent(str),
+  catch: e => EncodeException(str, e instanceof Error ? e.message : "Invalid input")
+});
+/**
+ * Decodes a URI component `string` into a UTF-8 `string`.
+ *
+ * @category decoding
+ * @since 3.12.0
+ */
+exports.encodeUriComponent = encodeUriComponent;
+const decodeUriComponent = str => Either.try({
+  try: () => decodeURIComponent(str),
+  catch: e => DecodeException(str, e instanceof Error ? e.message : "Invalid input")
+});
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+exports.decodeUriComponent = decodeUriComponent;
+const DecodeExceptionTypeId = exports.DecodeExceptionTypeId = Common.DecodeExceptionTypeId;
+/**
+ * Creates a checked exception which occurs when decoding fails.
+ *
+ * @since 2.0.0
+ * @category errors
+ */
+const DecodeException = exports.DecodeException = Common.DecodeException;
+/**
+ * Returns `true` if the specified value is an `DecodeException`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isDecodeException = exports.isDecodeException = Common.isDecodeException;
+/**
+ * @since 3.12.0
+ * @category symbols
+ */
+const EncodeExceptionTypeId = exports.EncodeExceptionTypeId = Common.EncodeExceptionTypeId;
+/**
+ * Creates a checked exception which occurs when encoding fails.
+ *
+ * @since 3.12.0
+ * @category errors
+ */
+const EncodeException = exports.EncodeException = Common.EncodeException;
+/**
+ * Returns `true` if the specified value is an `EncodeException`, `false` otherwise.
+ *
+ * @since 3.12.0
+ * @category refinements
+ */
+const isEncodeException = exports.isEncodeException = Common.isEncodeException;
+//# sourceMappingURL=Encoding.js.map

backend/node_modules/effect/dist/cjs/Encoding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Encoding.js","names":["Either","_interopRequireWildcard","require","Base64","Base64Url","Common","Hex","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","encodeBase64","input","encode","encoder","exports","decodeBase64","str","decode","decodeBase64String","map","_","decoder","encodeBase64Url","decodeBase64Url","decodeBase64UrlString","encodeHex","decodeHex","decodeHexString","encodeUriComponent","try","encodeURIComponent","catch","EncodeException","Error","message","decodeUriComponent","decodeURIComponent","DecodeException","DecodeExceptionTypeId","isDecodeException","EncodeExceptionTypeId","isEncodeException"],"sources":["../../src/Encoding.ts"],"sourcesContent":[null],"mappings":";;;;;;AASA,IAAAA,MAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,MAAA,GAAAF,uBAAA,CAAAC,OAAA;AACA,IAAAE,SAAA,GAAAH,uBAAA,CAAAC,OAAA;AACA,IAAAG,MAAA,GAAAJ,uBAAA,CAAAC,OAAA;AACA,IAAAI,GAAA,GAAAL,uBAAA,CAAAC,OAAA;AAAiD,SAAAD,wBAAAM,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAR,uBAAA,YAAAA,CAAAM,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAbjD;;;;;;;;;;AAeA;;;;;;AAMO,MAAMkB,YAAY,GAA4CC,KAAK,IACxE,OAAOA,KAAK,KAAK,QAAQ,GAAGxB,MAAM,CAACyB,MAAM,CAACvB,MAAM,CAACwB,OAAO,CAACD,MAAM,CAACD,KAAK,CAAC,CAAC,GAAGxB,MAAM,CAACyB,MAAM,CAACD,KAAK,CAAC;AAEhG;;;;;;AAAAG,OAAA,CAAAJ,YAAA,GAAAA,YAAA;AAMO,MAAMK,YAAY,GAAIC,GAAW,IAAiD7B,MAAM,CAAC8B,MAAM,CAACD,GAAG,CAAC;AAE3G;;;;;;AAAAF,OAAA,CAAAC,YAAA,GAAAA,YAAA;AAMO,MAAMG,kBAAkB,GAAIF,GAAW,IAAKhC,MAAM,CAACmC,GAAG,CAACJ,YAAY,CAACC,GAAG,CAAC,EAAGI,CAAC,IAAK/B,MAAM,CAACgC,OAAO,CAACJ,MAAM,CAACG,CAAC,CAAC,CAAC;AAEjH;;;;;;AAAAN,OAAA,CAAAI,kBAAA,GAAAA,kBAAA;AAMO,MAAMI,eAAe,GAA4CX,KAAK,IAC3E,OAAOA,KAAK,KAAK,QAAQ,GAAGvB,SAAS,CAACwB,MAAM,CAACvB,MAAM,CAACwB,OAAO,CAACD,MAAM,CAACD,KAAK,CAAC,CAAC,GAAGvB,SAAS,CAACwB,MAAM,CAACD,KAAK,CAAC;AAEtG;;;;;;AAAAG,OAAA,CAAAQ,eAAA,GAAAA,eAAA;AAMO,MAAMC,eAAe,GAAIP,GAAW,IAAiD5B,SAAS,CAAC6B,MAAM,CAACD,GAAG,CAAC;AAEjH;;;;;;AAAAF,OAAA,CAAAS,eAAA,GAAAA,eAAA;AAMO,MAAMC,qBAAqB,GAAIR,GAAW,IAAKhC,MAAM,CAACmC,GAAG,CAACI,eAAe,CAACP,GAAG,CAAC,EAAGI,CAAC,IAAK/B,MAAM,CAACgC,OAAO,CAACJ,MAAM,CAACG,CAAC,CAAC,CAAC;AAEvH;;;;;;AAAAN,OAAA,CAAAU,qBAAA,GAAAA,qBAAA;AAMO,MAAMC,SAAS,GAA4Cd,KAAK,IACrE,OAAOA,KAAK,KAAK,QAAQ,GAAGrB,GAAG,CAACsB,MAAM,CAACvB,MAAM,CAACwB,OAAO,CAACD,MAAM,CAACD,KAAK,CAAC,CAAC,GAAGrB,GAAG,CAACsB,MAAM,CAACD,KAAK,CAAC;AAE1F;;;;;;AAAAG,OAAA,CAAAW,SAAA,GAAAA,SAAA;AAMO,MAAMC,SAAS,GAAIV,GAAW,IAAiD1B,GAAG,CAAC2B,MAAM,CAACD,GAAG,CAAC;AAErG;;;;;;AAAAF,OAAA,CAAAY,SAAA,GAAAA,SAAA;AAMO,MAAMC,eAAe,GAAIX,GAAW,IAAKhC,MAAM,CAACmC,GAAG,CAACO,SAAS,CAACV,GAAG,CAAC,EAAGI,CAAC,IAAK/B,MAAM,CAACgC,OAAO,CAACJ,MAAM,CAACG,CAAC,CAAC,CAAC;AAE3G;;;;;;AAAAN,OAAA,CAAAa,eAAA,GAAAA,eAAA;AAMO,MAAMC,kBAAkB,GAAIZ,GAAW,IAC5ChC,MAAM,CAAC6C,GAAG,CAAC;EACTA,GAAG,EAAEA,CAAA,KAAMC,kBAAkB,CAACd,GAAG,CAAC;EAClCe,KAAK,EAAGxC,CAAC,IAAKyC,eAAe,CAAChB,GAAG,EAAEzB,CAAC,YAAY0C,KAAK,GAAG1C,CAAC,CAAC2C,OAAO,GAAG,eAAe;CACpF,CAAC;AAEJ;;;;;;AAAApB,OAAA,CAAAc,kBAAA,GAAAA,kBAAA;AAMO,MAAMO,kBAAkB,GAAInB,GAAW,IAC5ChC,MAAM,CAAC6C,GAAG,CAAC;EACTA,GAAG,EAAEA,CAAA,KAAMO,kBAAkB,CAACpB,GAAG,CAAC;EAClCe,KAAK,EAAGxC,CAAC,IAAK8C,eAAe,CAACrB,GAAG,EAAEzB,CAAC,YAAY0C,KAAK,GAAG1C,CAAC,CAAC2C,OAAO,GAAG,eAAe;CACpF,CAAC;AAEJ;;;;AAAApB,OAAA,CAAAqB,kBAAA,GAAAA,kBAAA;AAIO,MAAMG,qBAAqB,GAAAxB,OAAA,CAAAwB,qBAAA,GAAkBjD,MAAM,CAACiD,qBAAqB;AAqBhF;;;;;;AAMO,MAAMD,eAAe,GAAAvB,OAAA,CAAAuB,eAAA,GAAyDhD,MAAM,CAACgD,eAAe;AAE3G;;;;;;AAMO,MAAME,iBAAiB,GAAAzB,OAAA,CAAAyB,iBAAA,GAAyClD,MAAM,CAACkD,iBAAiB;AAE/F;;;;AAIO,MAAMC,qBAAqB,GAAA1B,OAAA,CAAA0B,qBAAA,GAAkBnD,MAAM,CAACmD,qBAAqB;AAqBhF;;;;;;AAMO,MAAMR,eAAe,GAAAlB,OAAA,CAAAkB,eAAA,GAAyD3C,MAAM,CAAC2C,eAAe;AAE3G;;;;;;AAMO,MAAMS,iBAAiB,GAAA3B,OAAA,CAAA2B,iBAAA,GAAyCpD,MAAM,CAACoD,iBAAiB","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Equal.js

@@ -0,0 +1,84 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equals = equals;
+exports.symbol = exports.isEqual = exports.equivalence = void 0;
+var Hash = _interopRequireWildcard(require("./Hash.js"));
+var _Predicate = require("./Predicate.js");
+var _Utils = require("./Utils.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const symbol = exports.symbol = /*#__PURE__*/Symbol.for("effect/Equal");
+function equals() {
+  if (arguments.length === 1) {
+    return self => compareBoth(self, arguments[0]);
+  }
+  return compareBoth(arguments[0], arguments[1]);
+}
+function compareBoth(self, that) {
+  if (self === that) {
+    return true;
+  }
+  const selfType = typeof self;
+  if (selfType !== typeof that) {
+    return false;
+  }
+  if (selfType === "object" || selfType === "function") {
+    if (self !== null && that !== null) {
+      if (isEqual(self) && isEqual(that)) {
+        if (Hash.hash(self) === Hash.hash(that) && self[symbol](that)) {
+          return true;
+        } else {
+          return _Utils.structuralRegionState.enabled && _Utils.structuralRegionState.tester ? _Utils.structuralRegionState.tester(self, that) : false;
+        }
+      } else if (self instanceof Date && that instanceof Date) {
+        const t1 = self.getTime();
+        const t2 = that.getTime();
+        return t1 === t2 || Number.isNaN(t1) && Number.isNaN(t2);
+      } else if (self instanceof URL && that instanceof URL) {
+        return self.href === that.href;
+      }
+    }
+    if (_Utils.structuralRegionState.enabled) {
+      if (self === null || that === null) {
+        return false;
+      }
+      if (Array.isArray(self) && Array.isArray(that)) {
+        return self.length === that.length && self.every((v, i) => compareBoth(v, that[i]));
+      }
+      if (Object.getPrototypeOf(self) === Object.prototype && Object.getPrototypeOf(that) === Object.prototype) {
+        const keysSelf = Object.keys(self);
+        const keysThat = Object.keys(that);
+        if (keysSelf.length === keysThat.length) {
+          for (const key of keysSelf) {
+            // @ts-expect-error
+            if (!(key in that && compareBoth(self[key], that[key]))) {
+              return _Utils.structuralRegionState.tester ? _Utils.structuralRegionState.tester(self, that) : false;
+            }
+          }
+          return true;
+        }
+      }
+      return _Utils.structuralRegionState.tester ? _Utils.structuralRegionState.tester(self, that) : false;
+    }
+  }
+  return _Utils.structuralRegionState.enabled && _Utils.structuralRegionState.tester ? _Utils.structuralRegionState.tester(self, that) : false;
+}
+/**
+ * @since 2.0.0
+ * @category guards
+ */
+const isEqual = u => (0, _Predicate.hasProperty)(u, symbol);
+/**
+ * @since 2.0.0
+ * @category instances
+ */
+exports.isEqual = isEqual;
+const equivalence = () => equals;
+exports.equivalence = equivalence;
+//# sourceMappingURL=Equal.js.map

backend/node_modules/effect/dist/cjs/Equal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Equal.js","names":["Hash","_interopRequireWildcard","require","_Predicate","_Utils","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","symbol","exports","Symbol","for","equals","arguments","length","self","compareBoth","that","selfType","isEqual","hash","structuralRegionState","enabled","tester","Date","t1","getTime","t2","Number","isNaN","URL","href","Array","isArray","every","v","getPrototypeOf","prototype","keysSelf","keys","keysThat","key","u","hasProperty","equivalence"],"sources":["../../src/Equal.ts"],"sourcesContent":[null],"mappings":";;;;;;;AAIA,IAAAA,IAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,UAAA,GAAAD,OAAA;AACA,IAAAE,MAAA,GAAAF,OAAA;AAAkD,SAAAD,wBAAAI,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAN,uBAAA,YAAAA,CAAAI,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAElD;;;;AAIO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,gBAAkBE,MAAM,CAACC,GAAG,CAAC,cAAc,CAAC;AAgBzD,SAAUC,MAAMA,CAAA;EACpB,IAAIC,SAAS,CAACC,MAAM,KAAK,CAAC,EAAE;IAC1B,OAAQC,IAAa,IAAKC,WAAW,CAACD,IAAI,EAAEF,SAAS,CAAC,CAAC,CAAC,CAAC;EAC3D;EACA,OAAOG,WAAW,CAACH,SAAS,CAAC,CAAC,CAAC,EAAEA,SAAS,CAAC,CAAC,CAAC,CAAC;AAChD;AAEA,SAASG,WAAWA,CAACD,IAAa,EAAEE,IAAa;EAC/C,IAAIF,IAAI,KAAKE,IAAI,EAAE;IACjB,OAAO,IAAI;EACb;EACA,MAAMC,QAAQ,GAAG,OAAOH,IAAI;EAC5B,IAAIG,QAAQ,KAAK,OAAOD,IAAI,EAAE;IAC5B,OAAO,KAAK;EACd;EACA,IAAIC,QAAQ,KAAK,QAAQ,IAAIA,QAAQ,KAAK,UAAU,EAAE;IACpD,IAAIH,IAAI,KAAK,IAAI,IAAIE,IAAI,KAAK,IAAI,EAAE;MAClC,IAAIE,OAAO,CAACJ,IAAI,CAAC,IAAII,OAAO,CAACF,IAAI,CAAC,EAAE;QAClC,IAAIjC,IAAI,CAACoC,IAAI,CAACL,IAAI,CAAC,KAAK/B,IAAI,CAACoC,IAAI,CAACH,IAAI,CAAC,IAAIF,IAAI,CAACP,MAAM,CAAC,CAACS,IAAI,CAAC,EAAE;UAC7D,OAAO,IAAI;QACb,CAAC,MAAM;UACL,OAAOI,4BAAqB,CAACC,OAAO,IAAID,4BAAqB,CAACE,MAAM,GAChEF,4BAAqB,CAACE,MAAM,CAACR,IAAI,EAAEE,IAAI,CAAC,GACxC,KAAK;QACX;MACF,CAAC,MAAM,IAAIF,IAAI,YAAYS,IAAI,IAAIP,IAAI,YAAYO,IAAI,EAAE;QACvD,MAAMC,EAAE,GAAGV,IAAI,CAACW,OAAO,EAAE;QACzB,MAAMC,EAAE,GAAGV,IAAI,CAACS,OAAO,EAAE;QACzB,OAAOD,EAAE,KAAKE,EAAE,IAAKC,MAAM,CAACC,KAAK,CAACJ,EAAE,CAAC,IAAIG,MAAM,CAACC,KAAK,CAACF,EAAE,CAAE;MAC5D,CAAC,MAAM,IAAIZ,IAAI,YAAYe,GAAG,IAAIb,IAAI,YAAYa,GAAG,EAAE;QACrD,OAAOf,IAAI,CAACgB,IAAI,KAAKd,IAAI,CAACc,IAAI;MAChC;IACF;IACA,IAAIV,4BAAqB,CAACC,OAAO,EAAE;MACjC,IAAIP,IAAI,KAAK,IAAI,IAAIE,IAAI,KAAK,IAAI,EAAE;QAClC,OAAO,KAAK;MACd;MACA,IAAIe,KAAK,CAACC,OAAO,CAAClB,IAAI,CAAC,IAAIiB,KAAK,CAACC,OAAO,CAAChB,IAAI,CAAC,EAAE;QAC9C,OAAOF,IAAI,CAACD,MAAM,KAAKG,IAAI,CAACH,MAAM,IAAIC,IAAI,CAACmB,KAAK,CAAC,CAACC,CAAC,EAAEvC,CAAC,KAAKoB,WAAW,CAACmB,CAAC,EAAElB,IAAI,CAACrB,CAAC,CAAC,CAAC,CAAC;MACrF;MACA,IAAIS,MAAM,CAAC+B,cAAc,CAACrB,IAAI,CAAC,KAAKV,MAAM,CAACgC,SAAS,IAAIhC,MAAM,CAAC+B,cAAc,CAACnB,IAAI,CAAC,KAAKZ,MAAM,CAACgC,SAAS,EAAE;QACxG,MAAMC,QAAQ,GAAGjC,MAAM,CAACkC,IAAI,CAACxB,IAAW,CAAC;QACzC,MAAMyB,QAAQ,GAAGnC,MAAM,CAACkC,IAAI,CAACtB,IAAW,CAAC;QACzC,IAAIqB,QAAQ,CAACxB,MAAM,KAAK0B,QAAQ,CAAC1B,MAAM,EAAE;UACvC,KAAK,MAAM2B,GAAG,IAAIH,QAAQ,EAAE;YAC1B;YACA,IAAI,EAAEG,GAAG,IAAIxB,IAAI,IAAID,WAAW,CAACD,IAAI,CAAC0B,GAAG,CAAC,EAAExB,IAAI,CAACwB,GAAG,CAAC,CAAC,CAAC,EAAE;cACvD,OAAOpB,4BAAqB,CAACE,MAAM,GAAGF,4BAAqB,CAACE,MAAM,CAACR,IAAI,EAAEE,IAAI,CAAC,GAAG,KAAK;YACxF;UACF;UACA,OAAO,IAAI;QACb;MACF;MACA,OAAOI,4BAAqB,CAACE,MAAM,GAAGF,4BAAqB,CAACE,MAAM,CAACR,IAAI,EAAEE,IAAI,CAAC,GAAG,KAAK;IACxF;EACF;EAEA,OAAOI,4BAAqB,CAACC,OAAO,IAAID,4BAAqB,CAACE,MAAM,GAChEF,4BAAqB,CAACE,MAAM,CAACR,IAAI,EAAEE,IAAI,CAAC,GACxC,KAAK;AACX;AAEA;;;;AAIO,MAAME,OAAO,GAAIuB,CAAU,IAAiB,IAAAC,sBAAW,EAACD,CAAC,EAAElC,MAAM,CAAC;AAEzE;;;;AAAAC,OAAA,CAAAU,OAAA,GAAAA,OAAA;AAIO,MAAMyB,WAAW,GAA4BA,CAAA,KAAMhC,MAAM;AAAAH,OAAA,CAAAmC,WAAA,GAAAA,WAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/Equivalence.js

@@ -0,0 +1,181 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tuple = exports.symbol = exports.struct = exports.string = exports.strict = exports.productMany = exports.product = exports.number = exports.mapInput = exports.make = exports.combineMany = exports.combineAll = exports.combine = exports.boolean = exports.bigint = exports.array = exports.all = exports.Date = void 0;
+var _Function = require("./Function.js");
+/**
+ * This module provides an implementation of the `Equivalence` type class, which defines a binary relation
+ * that is reflexive, symmetric, and transitive. In other words, it defines a notion of equivalence between values of a certain type.
+ * These properties are also known in mathematics as an "equivalence relation".
+ *
+ * @since 2.0.0
+ */
+
+/**
+ * @category constructors
+ * @since 2.0.0
+ */
+const make = isEquivalent => (self, that) => self === that || isEquivalent(self, that);
+exports.make = make;
+const isStrictEquivalent = (x, y) => x === y;
+/**
+ * Return an `Equivalence` that uses strict equality (===) to compare values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const strict = () => isStrictEquivalent;
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+exports.strict = strict;
+const string = exports.string = /*#__PURE__*/strict();
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const number = exports.number = /*#__PURE__*/strict();
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const boolean = exports.boolean = /*#__PURE__*/strict();
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const bigint = exports.bigint = /*#__PURE__*/strict();
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const symbol = exports.symbol = /*#__PURE__*/strict();
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const combine = exports.combine = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => make((x, y) => self(x, y) && that(x, y)));
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const combineMany = exports.combineMany = /*#__PURE__*/(0, _Function.dual)(2, (self, collection) => make((x, y) => {
+  if (!self(x, y)) {
+    return false;
+  }
+  for (const equivalence of collection) {
+    if (!equivalence(x, y)) {
+      return false;
+    }
+  }
+  return true;
+}));
+const isAlwaysEquivalent = (_x, _y) => true;
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const combineAll = collection => combineMany(isAlwaysEquivalent, collection);
+/**
+ * @category mapping
+ * @since 2.0.0
+ */
+exports.combineAll = combineAll;
+const mapInput = exports.mapInput = /*#__PURE__*/(0, _Function.dual)(2, (self, f) => make((x, y) => self(f(x), f(y))));
+/**
+ * @category instances
+ * @since 2.0.0
+ */
+const Date = exports.Date = /*#__PURE__*/mapInput(number, date => date.getTime());
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const product = exports.product = /*#__PURE__*/(0, _Function.dual)(2, (self, that) => make(([xa, xb], [ya, yb]) => self(xa, ya) && that(xb, yb)));
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+const all = collection => {
+  return make((x, y) => {
+    const len = Math.min(x.length, y.length);
+    let collectionLength = 0;
+    for (const equivalence of collection) {
+      if (collectionLength >= len) {
+        break;
+      }
+      if (!equivalence(x[collectionLength], y[collectionLength])) {
+        return false;
+      }
+      collectionLength++;
+    }
+    return true;
+  });
+};
+/**
+ * @category combining
+ * @since 2.0.0
+ */
+exports.all = all;
+const productMany = (self, collection) => {
+  const equivalence = all(collection);
+  return make((x, y) => !self(x[0], y[0]) ? false : equivalence(x.slice(1), y.slice(1)));
+};
+/**
+ * Similar to `Promise.all` but operates on `Equivalence`s.
+ *
+ * ```ts skip-type-checking
+ * [Equivalence<A>, Equivalence<B>, ...] -> Equivalence<[A, B, ...]>
+ * ```
+ *
+ * Given a tuple of `Equivalence`s returns a new `Equivalence` that compares values of a tuple
+ * by applying each `Equivalence` to the corresponding element of the tuple.
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+exports.productMany = productMany;
+const tuple = (...elements) => all(elements);
+/**
+ * Creates a new `Equivalence` for an array of values based on a given `Equivalence` for the elements of the array.
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+exports.tuple = tuple;
+const array = item => make((self, that) => {
+  if (self.length !== that.length) {
+    return false;
+  }
+  for (let i = 0; i < self.length; i++) {
+    const isEq = item(self[i], that[i]);
+    if (!isEq) {
+      return false;
+    }
+  }
+  return true;
+});
+/**
+ * Given a struct of `Equivalence`s returns a new `Equivalence` that compares values of a struct
+ * by applying each `Equivalence` to the corresponding property of the struct.
+ *
+ * @category combinators
+ * @since 2.0.0
+ */
+exports.array = array;
+const struct = fields => {
+  const keys = Object.keys(fields);
+  return make((self, that) => {
+    for (const key of keys) {
+      if (!fields[key](self[key], that[key])) {
+        return false;
+      }
+    }
+    return true;
+  });
+};
+exports.struct = struct;
+//# sourceMappingURL=Equivalence.js.map

backend/node_modules/effect/dist/cjs/ExecutionPlan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionPlan.js","names":["Effect","_interopRequireWildcard","require","internal","Layer","_Pipeable","e","t","WeakMap","r","n","__esModule","o","i","f","__proto__","default","has","get","set","hasOwnProperty","call","Object","defineProperty","getOwnPropertyDescriptor","TypeId","exports","isExecutionPlan","make","steps","makeProto","map","options","attempts","Error","schedule","while","input","suspend","result","succeed","undefined","provide","Proto","withRequirements","self","contextWith","context","step","isLayer","succeedContext","pipe","pipeArguments","arguments","create","merge","plans","flatMap","plan"],"sources":["../../src/ExecutionPlan.ts"],"sourcesContent":[null],"mappings":";;;;;;AAMA,IAAAA,MAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,QAAA,GAAAF,uBAAA,CAAAC,OAAA;AACA,IAAAE,KAAA,GAAAH,uBAAA,CAAAC,OAAA;AAEA,IAAAG,SAAA,GAAAH,OAAA;AAA6C,SAAAD,wBAAAK,CAAA,EAAAC,CAAA,6BAAAC,OAAA,MAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAP,uBAAA,YAAAA,CAAAK,CAAA,EAAAC,CAAA,SAAAA,CAAA,IAAAD,CAAA,IAAAA,CAAA,CAAAK,UAAA,SAAAL,CAAA,MAAAM,CAAA,EAAAC,CAAA,EAAAC,CAAA,KAAAC,SAAA,QAAAC,OAAA,EAAAV,CAAA,iBAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,SAAAQ,CAAA,MAAAF,CAAA,GAAAL,CAAA,GAAAG,CAAA,GAAAD,CAAA,QAAAG,CAAA,CAAAK,GAAA,CAAAX,CAAA,UAAAM,CAAA,CAAAM,GAAA,CAAAZ,CAAA,GAAAM,CAAA,CAAAO,GAAA,CAAAb,CAAA,EAAAQ,CAAA,gBAAAP,CAAA,IAAAD,CAAA,gBAAAC,CAAA,OAAAa,cAAA,CAAAC,IAAA,CAAAf,CAAA,EAAAC,CAAA,OAAAM,CAAA,IAAAD,CAAA,GAAAU,MAAA,CAAAC,cAAA,KAAAD,MAAA,CAAAE,wBAAA,CAAAlB,CAAA,EAAAC,CAAA,OAAAM,CAAA,CAAAK,GAAA,IAAAL,CAAA,CAAAM,GAAA,IAAAP,CAAA,CAAAE,CAAA,EAAAP,CAAA,EAAAM,CAAA,IAAAC,CAAA,CAAAP,CAAA,IAAAD,CAAA,CAAAC,CAAA,WAAAO,CAAA,KAAAR,CAAA,EAAAC,CAAA;AAG7C;;;;;AAKO,MAAMkB,MAAM,GAAAC,OAAA,CAAAD,MAAA,GAAkBtB,QAAQ,CAACsB,MAAM;AASpD;;;;;AAKO,MAAME,eAAe,GAAAD,OAAA,CAAAC,eAAA,GAA4CxB,QAAQ,CAACwB,eAAe;AA6FhG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CO,MAAMC,IAAI,GAAGA,CAClB,GAAGC,KAAgD,KAanDC,SAAS,CAACD,KAAK,CAACE,GAAG,CAAC,CAACC,OAAO,EAAEnB,CAAC,KAAI;EACjC,IAAImB,OAAO,CAACC,QAAQ,IAAID,OAAO,CAACC,QAAQ,GAAG,CAAC,EAAE;IAC5C,MAAM,IAAIC,KAAK,CAAC,4BAA4BrB,CAAC,mCAAmC,CAAC;EACnF;EACA,OAAO;IACLsB,QAAQ,EAAEH,OAAO,CAACG,QAAQ;IAC1BF,QAAQ,EAAED,OAAO,CAACC,QAAQ;IAC1BG,KAAK,EAAEJ,OAAO,CAACI,KAAK,GACfC,KAAU,IACXrC,MAAM,CAACsC,OAAO,CAAC,MAAK;MAClB,MAAMC,MAAM,GAAGP,OAAO,CAACI,KAAM,CAACC,KAAK,CAAC;MACpC,OAAO,OAAOE,MAAM,KAAK,SAAS,GAAGvC,MAAM,CAACwC,OAAO,CAACD,MAAM,CAAC,GAAGA,MAAM;IACtE,CAAC,CAAC,GACFE,SAAS;IACbC,OAAO,EAAEV,OAAO,CAACU;GAClB;AACH,CAAC,CAAQ,CAAC;AAAAhB,OAAA,CAAAE,IAAA,GAAAA,IAAA;AAmEZ,MAAMe,KAAK,GAAsC;EAC/C,CAAClB,MAAM,GAAGA,MAAM;EAChB,IAAImB,gBAAgBA,CAAA;IAClB,MAAMC,IAAI,GAAG,IAAiC;IAC9C,OAAO7C,MAAM,CAAC8C,WAAW,CAAEC,OAA6B,IACtDjB,SAAS,CAACe,IAAI,CAAChB,KAAK,CAACE,GAAG,CAAEiB,IAAI,KAAM;MAClC,GAAGA,IAAI;MACPN,OAAO,EAAEtC,KAAK,CAAC6C,OAAO,CAACD,IAAI,CAACN,OAAO,CAAC,GAAGtC,KAAK,CAACsC,OAAO,CAACM,IAAI,CAACN,OAAO,EAAEtC,KAAK,CAAC8C,cAAc,CAACH,OAAO,CAAC,CAAC,GAAGC,IAAI,CAACN;KAC1G,CAAC,CAAQ,CAAC,CACZ;EACH,CAAC;EACDS,IAAIA,CAAA;IACF,OAAO,IAAAC,uBAAa,EAAC,IAAI,EAAEC,SAAS,CAAC;EACvC;CACD;AAED,MAAMvB,SAAS,GACbD,KAKW,IACT;EACF,MAAMgB,IAAI,GAAGvB,MAAM,CAACgC,MAAM,CAACX,KAAK,CAAC;EACjCE,IAAI,CAAChB,KAAK,GAAGA,KAAK;EAClB,OAAOgB,IAAI;AACb,CAAC;AAED;;;;;AAKO,MAAMU,KAAK,GAAGA,CACnB,GAAGC,KAAY,KAMX1B,SAAS,CAAC0B,KAAK,CAACC,OAAO,CAAEC,IAAI,IAAKA,IAAI,CAAC7B,KAAK,CAAQ,CAAC;AAAAH,OAAA,CAAA6B,KAAA,GAAAA,KAAA","ignoreList":[]}

backend/node_modules/effect/dist/cjs/ExecutionStrategy.js

@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sequential = exports.parallelN = exports.parallel = exports.match = exports.isSequential = exports.isParallelN = exports.isParallel = void 0;
+var internal = _interopRequireWildcard(require("./internal/executionStrategy.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * Execute effects sequentially.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const sequential = exports.sequential = internal.sequential;
+/**
+ * Execute effects in parallel.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const parallel = exports.parallel = internal.parallel;
+/**
+ * Execute effects in parallel, up to the specified number of concurrent fibers.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const parallelN = exports.parallelN = internal.parallelN;
+/**
+ * Returns `true` if the specified `ExecutionStrategy` is an instance of
+ * `Sequential`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isSequential = exports.isSequential = internal.isSequential;
+/**
+ * Returns `true` if the specified `ExecutionStrategy` is an instance of
+ * `Sequential`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isParallel = exports.isParallel = internal.isParallel;
+/**
+ * Returns `true` if the specified `ExecutionStrategy` is an instance of
+ * `Sequential`, `false` otherwise.
+ *
+ * @since 2.0.0
+ * @category refinements
+ */
+const isParallelN = exports.isParallelN = internal.isParallelN;
+/**
+ * Folds over the specified `ExecutionStrategy` using the provided case
+ * functions.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const match = exports.match = internal.match;
+//# sourceMappingURL=ExecutionStrategy.js.map