@smthrs/plan 0.0.0-stage → 1.0.0-rc.13

package/dist/cjs/internal/SchemaIdentity.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/internal/SchemaIdentity.ts"],
+  "sourcesContent": ["/**\n * The schema identity projection: the JSON-Schema-shaped document a schema\n * contributes to a step key.\n *\n * A call node folds what its callee accepts and produces into the material a\n * step key is derived from, and a catch node folds its filter the same way. A\n * projection that printed differently under another `effect` release would\n * re-key every recorded step in every journal at once. `effect` is a peer\n * range, so the application picks the release; the projection therefore\n * cannot be the installed `Schema.toJsonSchemaDocument`. `effect@4.0.4`\n * already changed what that emitter prints for `Schema.Int`, `isMinLength`,\n * `isPattern`, repeated bounds, `oneOf` unions and shared definitions.\n *\n * This module owns the bytes instead. It reads the schema through two public\n * functions, `Schema.toCodecJson` and `Schema.toRepresentation`, and prints\n * the result with the emitter and the check fragments fixed below, which\n * reproduce `Schema.toJsonSchemaDocument(schema, options)` of\n * `effect@4.0.0-rc.115` for both values of `onExcessProperty`.\n *\n * It is for identity only. Where a JSON Schema is shown to a model or a\n * person, the installed emitter is the right one.\n *\n * What still moves an identity, by design: a release that changes a schema's\n * JSON codec or its representation changes what the schema accepts on the\n * wire. Three limits follow from what the representation carries:\n *\n * - A built-in check contributes the constraint its id and payload name. A\n *   `toJsonSchema` annotation passed to a built-in check constructor is not\n *   consulted; one on a `makeFilter` check is.\n * - A built-in check this module does not list falls back to the installed\n *   check's own `toJsonSchema` annotation.\n * - `Schema.brand` is not part of the representation from `effect@4.0.4` on.\n *   Under rc.115 a schema that takes a definition (an `identifier` or a\n *   recursive schema) and appeared both branded and unbranded in one document\n *   got two definitions; it now gets one.\n *\n * Provenance: {@link fromRepresentation} and its helpers are adapted from\n * `effect@4.0.0-rc.115` (MIT, Copyright (c) 2023 Effectful Technologies Inc;\n * the notice is in this package's `THIRD_PARTY_NOTICES.md`), files\n * `src/internal/schema/toJsonSchemaDocument.ts`, `src/JsonSchema.ts`\n * (`rewriteRefs`), `src/JsonPointer.ts` and `src/SchemaAST.ts` (`isJson`).\n * Changes: `onExcessProperty` is the only option; one root; a built-in\n * check's fragment comes from {@link builtinChecks}, not from\n * the installed annotation; an approximate check result contributes its\n * schema.\n *\n * @since 1.0.0\n */\n\nimport type * as JsonSchema from \"effect/JsonSchema\"\nimport * as Schema from \"effect/Schema\"\nimport type * as SchemaAST from \"effect/SchemaAST\"\nimport * as SchemaRepresentation from \"effect/SchemaRepresentation\"\n\n/** @private */\ntype Fragment = JsonSchema.JsonSchema\n\n/** @private */\ntype Path = ReadonlyArray<string | number>\n\n/** @private */\ntype Representation = SchemaRepresentation.Representation\n\n/** @private */\ntype Check = SchemaRepresentation.Check\n\n/** @private */\ntype CheckInput = SchemaRepresentation.ToJsonSchema.CheckInput\n\n/**\n * The document a schema's identity is: exactly what rc.115 returned from\n * `Schema.toJsonSchemaDocument`, key order included.\n *\n * @since 1.0.0\n * @private\n */\nexport type Document = JsonSchema.Document<\"draft-2020-12\">\n\n/**\n * How an object schema treats a key it does not declare, which is the one\n * emitter option a declaration's identity is taken under. It has rc.115's\n * meaning and rc.115's default: `\"ignore\"` leaves such keys open, `\"error\"`\n * closes them.\n *\n * @since 1.0.0\n * @private\n */\nexport interface Options {\n  readonly onExcessProperty?: \"ignore\" | \"error\" | undefined\n}\n\n/**\n * A schema a step key cannot be derived from: one with no JSON Schema form or\n * no representation, or one whose built-in check the installed `effect`\n * describes differently from the releases this package supports. The message\n * is the one `effect@4.0.0-rc.115` gave for the same schema, where it gave one.\n *\n * @since 1.0.0\n * @category errors\n */\nexport class SchemaIdentityError extends Schema.TaggedError<SchemaIdentityError>()(\"@smthrs/plan/SchemaIdentityError\", {\n  message: Schema.String\n}) {}\n\n/** @private */\nconst invalid = (message: string, path: Path): SchemaIdentityError =>\n  new SchemaIdentityError({\n    message: path.length === 0\n      ? message\n      : `${message}\\n  at ${path.map((key) => `[${typeof key === \"string\" ? JSON.stringify(key) : key}]`).join(\"\")}`\n  })\n\n/** @private */\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value)\n\n/**\n * Assigns an own property, `__proto__` included: a struct may declare a field\n * by that name, and plain assignment would set the prototype instead.\n *\n * @private\n */\nconst assignProperty = (target: Record<string, unknown>, key: string, value: unknown): void => {\n  if (key === \"__proto__\") {\n    Object.defineProperty(target, key, { value, writable: true, enumerable: true, configurable: true })\n  } else {\n    target[key] = value\n  }\n}\n\n/**\n * Whether a value is JSON: finite numbers, plain objects, no cycles. An\n * annotation that is not JSON never reaches the document.\n *\n * @private\n */\nconst isJson = (value: unknown, path: ReadonlySet<object> = new Set()): boolean => {\n  if (typeof value !== \"object\" || value === null) {\n    return value === null || typeof value === \"string\" || typeof value === \"boolean\" ||\n      (typeof value === \"number\" && Number.isFinite(value))\n  }\n  if (path.has(value)) return false\n  const members = Array.isArray(value) ? Array.from<unknown>(value) : plainValues(value)\n  if (members === undefined) return false\n  const inner = new Set(path).add(value)\n  return members.every((member) => isJson(member, inner))\n}\n\n/** @private */\nconst plainValues = (value: object): ReadonlyArray<unknown> | undefined => {\n  const prototype: unknown = Object.getPrototypeOf(value)\n  // A plain object from another realm has a different `Object.prototype`,\n  // but that prototype still has a null prototype.\n  return prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null\n    ? Object.values(value)\n    : undefined\n}\n\n/**\n * Structural equality of two emitted schemas, ignoring key order. `NaN`\n * equals itself: an author's fragment may carry one, and two definitions that\n * differ in nothing else are one definition.\n *\n * @private\n */\nconst sameJson = (left: unknown, right: unknown): boolean => {\n  if (Array.isArray(left) && Array.isArray(right)) {\n    return left.length === right.length && left.every((member, index) => sameJson(member, right[index]))\n  }\n  if (isObject(left) && isObject(right)) {\n    const keys = Object.keys(left)\n    return keys.length === Object.keys(right).length &&\n      keys.every((key) => Object.hasOwn(right, key) && sameJson(left[key], right[key]))\n  }\n  return left === right || (left !== left && right !== right)\n}\n\n/** @private */\nconst escapeRegExp = (text: string): string => text.replace(/[/\\\\^$*+?.()|[\\]{}]/g, \"\\\\$&\")\n\n/** @private */\nconst unescapeToken = (token: string): string => token.replace(/~1/g, \"/\").replace(/~0/g, \"~\")\n\n/** @private */\nconst definitionReference = (key: string): string =>\n  `#/$defs/${encodeURI(key.replace(/~/g, \"~0\").replace(/\\//g, \"~1\")).replace(/#/g, \"%23\")}`\n\n/**\n * The JSON Pointer a URI fragment names, or `undefined` when it names none.\n *\n * @private\n */\nconst decodeUriFragment = (fragment: string): string | undefined => {\n  if (fragment.length === 0 || fragment === \"#\") return \"\"\n  if (!fragment.startsWith(\"#\")) return undefined\n  const encoded = fragment.slice(1)\n  try {\n    if (encodeURI(encoded).replace(/%25/g, \"%\").replace(/#/g, \"%23\") !== encoded) return undefined\n    const pointer = decodeURIComponent(encoded)\n    return pointer.startsWith(\"/\") && !/~(?:[^01]|$)/.test(pointer) ? pointer : undefined\n  } catch {\n    return undefined\n  }\n}\n\n/**\n * Copies a schema, rewriting every `$ref` and `$dynamicRef` in a schema\n * position. Values that are data (`enum`, `const`, `default`, `examples`) are\n * not walked.\n *\n * @private\n */\nconst rewriteRefs = (node: Fragment, rewrite: (reference: string) => string): Fragment => {\n  const walk = (value: unknown): unknown => isObject(value) ? rewriteRefs(value, rewrite) : value\n  const out: Fragment = {}\n  for (const key of Object.keys(node)) {\n    const value = node[key]\n    let transformed = value\n    switch (key) {\n      case \"$defs\":\n      case \"properties\":\n      case \"patternProperties\":\n      case \"dependentSchemas\":\n        if (isObject(value)) {\n          const mapped: Fragment = {}\n          for (const name of Object.keys(value)) assignProperty(mapped, name, walk(value[name]))\n          transformed = mapped\n        }\n        break\n      case \"allOf\":\n      case \"anyOf\":\n      case \"oneOf\":\n      case \"prefixItems\":\n        if (Array.isArray(value)) transformed = value.map(walk)\n        break\n      case \"not\":\n      case \"additionalProperties\":\n      case \"propertyNames\":\n      case \"unevaluatedProperties\":\n      case \"items\":\n      case \"contains\":\n      case \"unevaluatedItems\":\n      case \"if\":\n      case \"then\":\n      case \"else\":\n      case \"contentSchema\":\n        transformed = walk(value)\n    }\n    assignProperty(out, key, transformed)\n  }\n  if (typeof out[\"$ref\"] === \"string\") out[\"$ref\"] = rewrite(out[\"$ref\"])\n  if (typeof out[\"$dynamicRef\"] === \"string\") out[\"$dynamicRef\"] = rewrite(out[\"$dynamicRef\"])\n  return out\n}\n\n/**\n * The annotations a JSON Schema states, in the order rc.115 printed them.\n *\n * @private\n */\nconst ordinaryAnnotations = (annotations: Schema.Annotations.Annotations | undefined): Fragment | undefined => {\n  if (annotations === undefined) return undefined\n  const out: Fragment = {}\n  if (typeof annotations[\"title\"] === \"string\") out[\"title\"] = annotations[\"title\"]\n  if (typeof annotations[\"description\"] === \"string\") out[\"description\"] = annotations[\"description\"]\n  if (isJson(annotations[\"default\"])) out[\"default\"] = annotations[\"default\"]\n  if (Array.isArray(annotations[\"examples\"]) && isJson(annotations[\"examples\"])) {\n    out[\"examples\"] = annotations[\"examples\"]\n  }\n  if (typeof annotations[\"readOnly\"] === \"boolean\") out[\"readOnly\"] = annotations[\"readOnly\"]\n  if (typeof annotations[\"writeOnly\"] === \"boolean\") out[\"writeOnly\"] = annotations[\"writeOnly\"]\n  if (typeof annotations[\"format\"] === \"string\") out[\"format\"] = annotations[\"format\"]\n  if (typeof annotations[\"contentEncoding\"] === \"string\") out[\"contentEncoding\"] = annotations[\"contentEncoding\"]\n  if (typeof annotations[\"contentMediaType\"] === \"string\") out[\"contentMediaType\"] = annotations[\"contentMediaType\"]\n  if (isJson(annotations[\"contentSchema\"])) out[\"contentSchema\"] = annotations[\"contentSchema\"]\n  return Object.keys(out).length === 0 ? undefined : out\n}\n\n/** @private */\nconst finitePattern = \"[+-]?\\\\d*\\\\.?\\\\d+(?:[Ee][+-]?\\\\d+)?\"\n\n/** @private */\nconst stringPattern = \"[\\\\s\\\\S]*?\"\n\n/** @private */\nconst bigIntPattern = \"^-?\\\\d+$\"\n\n/** @private */\nconst symbolPattern = \"^Symbol\\\\(([\\\\s\\\\S]*)\\\\)$\"\n\n/** @private */\nconst uuidPattern = (version: number | null): string =>\n  version === null\n    ? \"^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-8][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}|\" +\n      \"00000000-0000-0000-0000-000000000000|[fF]{8}-[fF]{4}-[fF]{4}-[fF]{4}-[fF]{12})$\"\n    : `^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-${version}[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12})$`\n\n/**\n * One field of a built-in check's payload. A release that renamed or retyped\n * it would otherwise print `undefined` into an identity, so it is refused.\n *\n * @private\n */\nconst field = <A>(id: string, payload: unknown, name: string, is: (value: unknown) => value is A): A => {\n  const value = isObject(payload) ? payload[name] : undefined\n  if (!is(value)) {\n    throw new SchemaIdentityError({\n      message: `Cannot derive a schema identity: check ${id} carries no usable \"${name}\" in its payload. ` +\n        \"The installed effect release describes this check differently from the releases @smthrs/plan supports.\"\n    })\n  }\n  return value\n}\n\n/** @private */\nconst isNumber = (value: unknown): value is number => typeof value === \"number\"\n\n/** @private */\nconst isString = (value: unknown): value is string => typeof value === \"string\"\n\n/** @private */\nconst isVersion = (value: unknown): value is number | null => value === null || typeof value === \"number\"\n\n/** @private */\nconst isFlag = (value: unknown): value is boolean | undefined => value === undefined || typeof value === \"boolean\"\n\n/**\n * What a built-in check prints: its payload and the JSON type it refines in,\n * a fragment out. `null` is a check that prints nothing.\n *\n * @private\n */\ntype BuiltinCheck = ((id: string, payload: unknown, input: CheckInput) => Fragment) | null\n\n/** @private */\nconst pattern = (source: string): BuiltinCheck => () => ({ pattern: source })\n\n/** @private */\nconst literalPattern = (name: string, source: (escaped: string) => string): BuiltinCheck => (id, payload) => ({\n  pattern: new RegExp(source(escapeRegExp(field(id, payload, name, isString)))).source\n})\n\n/** @private */\nconst bound = (keyword: string, name: string = keyword): BuiltinCheck => (id, payload) => ({\n  [keyword]: field(id, payload, name, isNumber)\n})\n\n/** @private */\nconst length = (name: string, array: string, string: string): BuiltinCheck => (id, payload, input) => ({\n  [input.type === \"array\" ? array : string]: field(id, payload, name, isNumber)\n})\n\n/** @private */\nconst empty: BuiltinCheck = () => ({})\n\n/**\n * Every built-in check, keyed by the id its representation carries, with the\n * fragment `effect@4.0.0-rc.115` printed for it.\n *\n * The three code-point checks did not exist under rc.115; they print what\n * `effect@4.0.4` introduced them with. The date, big integer and size checks\n * print nothing but still carry their own annotations, which is what the\n * empty fragment keeps.\n *\n * @private\n */\nconst builtinChecks: ReadonlyMap<string, BuiltinCheck> = new Map<string, BuiltinCheck>([\n  [\"effect/schema/isTrimmed\", pattern(\"^\\\\S[\\\\s\\\\S]*\\\\S$|^\\\\S$|^$\")],\n  [\"effect/schema/isPattern\", (id, payload) => ({ pattern: field(id, payload, \"source\", isString) })],\n  [\"effect/schema/isStringFinite\", pattern(`^${finitePattern}$`)],\n  [\"effect/schema/isStringBigInt\", pattern(bigIntPattern)],\n  [\"effect/schema/isStringSymbol\", pattern(symbolPattern)],\n  [\"effect/schema/isUUID\", (id, payload) => ({\n    pattern: uuidPattern(field(id, payload, \"version\", isVersion)),\n    format: \"uuid\"\n  })],\n  [\"effect/schema/isGUID\", pattern(\"^([0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12})$\")],\n  [\"effect/schema/isULID\", pattern(\"^[0-9A-HJKMNP-TV-Za-hjkmnp-tv-z]{26}$\")],\n  [\"effect/schema/isBase64\", pattern(\"^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$\")],\n  [\"effect/schema/isBase64Url\", pattern(\"^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$\")],\n  [\"effect/schema/isStartingWith\", literalPattern(\"startsWith\", (escaped) => `^${escaped}`)],\n  [\"effect/schema/isEndingWith\", literalPattern(\"endsWith\", (escaped) => `${escaped}$`)],\n  [\"effect/schema/isIncluding\", literalPattern(\"includes\", (escaped) => escaped)],\n  [\"effect/schema/isUppercased\", pattern(\"^[^a-z]*$\")],\n  [\"effect/schema/isLowercased\", pattern(\"^[^A-Z]*$\")],\n  [\"effect/schema/isCapitalized\", pattern(\"^(?:[^a-z][\\\\s\\\\S]*)?$\")],\n  [\"effect/schema/isUncapitalized\", pattern(\"^(?:[^A-Z][\\\\s\\\\S]*)?$\")],\n  [\"effect/schema/isFinite\", () => ({ type: \"number\" })],\n  [\"effect/schema/isInt\", () => ({ type: \"integer\" })],\n  [\"effect/schema/isGreaterThan\", bound(\"exclusiveMinimum\")],\n  [\"effect/schema/isGreaterThanOrEqualTo\", bound(\"minimum\")],\n  [\"effect/schema/isLessThan\", bound(\"exclusiveMaximum\")],\n  [\"effect/schema/isLessThanOrEqualTo\", bound(\"maximum\")],\n  [\"effect/schema/isBetween\", (id, payload) => ({\n    [field(id, payload, \"exclusiveMinimum\", isFlag) ? \"exclusiveMinimum\" : \"minimum\"]: field(\n      id,\n      payload,\n      \"minimum\",\n      isNumber\n    ),\n    [field(id, payload, \"exclusiveMaximum\", isFlag) ? \"exclusiveMaximum\" : \"maximum\"]: field(\n      id,\n      payload,\n      \"maximum\",\n      isNumber\n    )\n  })],\n  [\"effect/schema/isMultipleOf\", bound(\"multipleOf\", \"divisor\")],\n  [\"effect/schema/isGreaterThanDate\", empty],\n  [\"effect/schema/isGreaterThanOrEqualToDate\", empty],\n  [\"effect/schema/isLessThanDate\", empty],\n  [\"effect/schema/isLessThanOrEqualToDate\", empty],\n  [\"effect/schema/isBetweenDate\", empty],\n  [\"effect/schema/isGreaterThanBigInt\", empty],\n  [\"effect/schema/isGreaterThanOrEqualToBigInt\", empty],\n  [\"effect/schema/isLessThanBigInt\", empty],\n  [\"effect/schema/isLessThanOrEqualToBigInt\", empty],\n  [\"effect/schema/isBetweenBigInt\", empty],\n  [\"effect/schema/isMinLength\", length(\"minLength\", \"minItems\", \"minLength\")],\n  [\"effect/schema/isMaxLength\", length(\"maxLength\", \"maxItems\", \"maxLength\")],\n  [\"effect/schema/isBetweenLength\", (id, payload, input) => {\n    const minimum = field(id, payload, \"minimum\", isNumber)\n    const maximum = field(id, payload, \"maximum\", isNumber)\n    return input.type === \"array\"\n      ? { allOf: [{ minItems: minimum }, { maxItems: maximum }] }\n      : { allOf: [{ minLength: minimum }, { maxLength: maximum }] }\n  }],\n  [\"effect/schema/isMinCodePoints\", bound(\"minLength\", \"minCodePoints\")],\n  [\"effect/schema/isMaxCodePoints\", bound(\"maxLength\", \"maxCodePoints\")],\n  [\"effect/schema/isBetweenCodePoints\", (id, payload) => ({\n    allOf: [\n      { minLength: field(id, payload, \"minimum\", isNumber) },\n      { maxLength: field(id, payload, \"maximum\", isNumber) }\n    ]\n  })],\n  [\"effect/schema/isMinSize\", empty],\n  [\"effect/schema/isMaxSize\", empty],\n  [\"effect/schema/isBetweenSize\", empty],\n  [\"effect/schema/isMinProperties\", bound(\"minProperties\")],\n  [\"effect/schema/isMaxProperties\", bound(\"maxProperties\")],\n  [\"effect/schema/isBetweenProperties\", (id, payload) => ({\n    minProperties: field(id, payload, \"minimum\", isNumber),\n    maxProperties: field(id, payload, \"maximum\", isNumber)\n  })],\n  [\"effect/schema/isPropertyNames\", (_id, _payload, input) => ({ propertyNames: input.schemas[0] })],\n  [\"effect/schema/isUnique\", () => ({ uniqueItems: true })],\n  [\"effect/schema/isUniqueKey\", null]\n])\n\n/**\n * The ids {@link builtinChecks} lists, for the test that holds the list\n * against the checks the installed `effect` can revive.\n *\n * @since 1.0.0\n * @private\n */\nexport const builtinCheckIds: ReadonlyArray<string> = [...builtinChecks.keys()]\n\n/** @private */\nconst isCheckCallback = (value: unknown): value is SchemaRepresentation.ToJsonSchema.Check =>\n  typeof value === \"function\"\n\n/** @private */\nconst isApproximate = (\n  output: SchemaRepresentation.ToJsonSchema.CheckOutput\n): output is readonly [schema: Fragment, approximate: true] => Array.isArray(output)\n\n/**\n * What prints a check, if anything does: the owned fragment for a built-in\n * check, otherwise the author's own `toJsonSchema` annotation.\n *\n * @private\n */\nconst fragmentSource = (check: Check): ((input: CheckInput) => Fragment) | undefined => {\n  const representation = check.representation\n  const builtin = representation === undefined ? undefined : builtinChecks.get(representation.id)\n  if (representation !== undefined && builtin !== undefined) {\n    return builtin === null ? undefined : (input) => builtin(representation.id, representation.payload, input)\n  }\n  const callback = check.annotations?.[\"toJsonSchema\"]\n  if (!isCheckCallback(callback)) return undefined\n  return (input) => {\n    const output = callback(input)\n    return isApproximate(output) ? output[0] : output\n  }\n}\n\n/** @private */\ntype NumberType = \"number\" | \"integer\"\n\n/** @private */\nconst extractNumberType = (schema: Fragment): { readonly type: NumberType | undefined; readonly schema: Fragment } => {\n  let type: NumberType | undefined = schema[\"type\"] === \"number\" || schema[\"type\"] === \"integer\"\n    ? schema[\"type\"]\n    : undefined\n  let out = schema\n  if (type !== undefined) {\n    out = { ...schema }\n    delete out[\"type\"]\n  }\n  const allOf = out[\"allOf\"]\n  if (Array.isArray(allOf)) {\n    const members: Array<Fragment> = []\n    let changed = false\n    for (const member of allOf) {\n      const extracted = extractNumberType(member)\n      if (extracted.type !== undefined) {\n        changed = true\n        if (type === undefined || extracted.type === \"integer\") type = extracted.type\n      }\n      if (Object.keys(extracted.schema).length > 0) members.push(extracted.schema)\n    }\n    if (changed) {\n      const { allOf: _, ...rest } = out\n      out = members.length === 0 ? rest : { ...rest, allOf: members }\n    }\n  }\n  return { type, schema: out }\n}\n\n/** @private */\nconst isNumberEncoding = (schema: Fragment): boolean => {\n  const anyOf = schema[\"anyOf\"]\n  if (!Array.isArray(anyOf) || anyOf.length !== 2 || !isObject(anyOf[0]) || anyOf[0][\"type\"] !== \"number\") return false\n  const special: unknown = anyOf[1]\n  if (!isObject(special) || special[\"type\"] !== \"string\") return false\n  const values = special[\"enum\"]\n  return Array.isArray(values) && values.length === 3 && values.includes(\"NaN\") && values.includes(\"Infinity\") &&\n    values.includes(\"-Infinity\")\n}\n\n// Keep this allowlist closed: applicators and dependent keywords can change meaning when moved across schema objects.\n/** @private */\nconst inlineableCheckKeywords =\n  \"|type|format|pattern|multipleOf|minimum|maximum|exclusiveMinimum|exclusiveMaximum|minLength|maxLength|minItems|maxItems|uniqueItems|minProperties|maxProperties|propertyNames|\"\n\n// `format` and `content*` can affect validation, so they are not treated as pure annotations.\n/** @private */\nconst promotableAnnotationKeywords = \"|title|description|default|examples|readOnly|writeOnly|\"\n\n/** @private */\nconst inlineableAnnotatedCheckKeywords = inlineableCheckKeywords + promotableAnnotationKeywords\n\n/** @private */\nconst hasOnlyKeywords = (schema: Fragment, allowed: string): boolean =>\n  Object.keys(schema).every((key) => allowed.includes(`|${key}|`))\n\n/** @private */\nconst hasNoCollisions = (left: Fragment, rightKeys: ReadonlyArray<string>): boolean =>\n  typeof left[\"$ref\"] !== \"string\" && rightKeys.every((key) => !Object.hasOwn(left, key))\n\n/**\n * Adds a constraint to a schema: inline when no keyword collides, otherwise\n * under `allOf`. A repeated bound is never merged into the tighter one.\n *\n * @private\n */\nconst appendJsonSchema = (left: Fragment, right: Fragment, inlineCheck?: true): Fragment => {\n  if (Object.keys(left).length === 0) return right\n  const rightKeys = Object.keys(right)\n  if (rightKeys.length === 0) return left\n  const leftType = left[\"type\"] === \"number\" || left[\"type\"] === \"integer\" ? left[\"type\"] : undefined\n  const numberEncoding = isNumberEncoding(left)\n  if (leftType !== undefined || numberEncoding) {\n    const extracted = extractNumberType(right)\n    if (extracted.type !== undefined) {\n      const type = leftType === \"integer\" || extracted.type === \"integer\" ? \"integer\" : \"number\"\n      const base: Fragment = { ...left, type }\n      if (numberEncoding) delete base[\"anyOf\"]\n      const extractedKeys = Object.keys(extracted.schema)\n      if (extractedKeys.length === 0) return base\n      return hasOnlyKeywords(extracted.schema, promotableAnnotationKeywords) && hasNoCollisions(base, extractedKeys)\n        ? { ...base, ...extracted.schema }\n        : appendJsonSchema(base, extracted.schema, inlineCheck)\n    }\n  }\n  if (inlineCheck && hasNoCollisions(left, rightKeys)) return { ...left, ...right }\n  const rightAllOf = right[\"allOf\"]\n  const members: ReadonlyArray<unknown> = Array.isArray(rightAllOf) && rightKeys.length === 1 ? rightAllOf : [right]\n  const leftAllOf = left[\"allOf\"]\n  if (Array.isArray(leftAllOf)) return { ...left, allOf: [...leftAllOf, ...members] }\n  if (typeof left[\"$ref\"] === \"string\") return { allOf: [left, ...members] }\n  return { ...left, allOf: members }\n}\n\n/** @private */\nconst jsonSchemaTypes: ReadonlySet<unknown> = new Set([\n  \"string\",\n  \"number\",\n  \"boolean\",\n  \"array\",\n  \"object\",\n  \"null\",\n  \"integer\"\n])\n\n/** @private */\nconst isJsonSchemaType = (input: unknown): input is JsonSchema.Type => jsonSchemaTypes.has(input)\n\n/**\n * Collapses a union of single-type enums into one enum, the way a union of\n * literals reads.\n *\n * @private\n */\nconst compactEnums = (schemas: ReadonlyArray<Fragment>): Fragment | undefined => {\n  let sharedType: unknown = undefined\n  const values: Array<unknown> = []\n  for (const schema of schemas) {\n    const members = schema[\"enum\"]\n    if (\n      Object.keys(schema).length !== 2 || schema[\"type\"] === undefined || !Array.isArray(members) ||\n      members.length === 0\n    ) {\n      return undefined\n    }\n    if (sharedType === undefined) sharedType = schema[\"type\"]\n    else if (schema[\"type\"] !== sharedType) return undefined\n    for (const value of members) {\n      if (values.includes(value)) return undefined\n      values.push(value)\n    }\n  }\n  return { type: sharedType, enum: values }\n}\n\n/** @private */\nconst partPattern = (part: Representation): string => {\n  switch (part._tag) {\n    case \"Literal\":\n      return escapeRegExp(String(part.literal))\n    case \"String\":\n      return stringPattern\n    case \"Number\":\n      return finitePattern\n    case \"TemplateLiteral\":\n      return part.parts.map(partPattern).join(\"\")\n    case \"Union\":\n      return `(?:${part.types.map(partPattern).join(\"|\")})`\n    default:\n      throw invalid(\"Invalid schema representation document\", [])\n  }\n}\n\n/** @private */\nconst neverSchema: Fragment = { not: {} }\n\n/**\n * Refuses a representation kind this module does not print. A later `effect`\n * release that adds one fails here by name, not as a missing property.\n *\n * @private\n */\nconst unsupported = (representation: never, path: Path): never => {\n  throw invalid(`Unsupported schema representation ${(representation as { readonly _tag: string })._tag}`, path)\n}\n\n/**\n * Prints a representation document as the JSON Schema document rc.115\n * printed for it under the same options.\n *\n * Reserved for {@link schemaIdentity} and for the tests that hand it a\n * representation no schema produces.\n *\n * @since 1.0.0\n * @private\n */\nexport const fromRepresentation = (document: SchemaRepresentation.Document, options?: Options): Document => {\n  const closed = options?.onExcessProperty === \"error\"\n  const references = document.references\n  // A key maps to its compiled schema, to the key it is an alias of, or to\n  // `null` while it is compiling.\n  const definitionStates = new Map<string, Fragment | string | null>()\n  const compiledRepresentations = new WeakMap<Representation, Fragment>()\n  const fallbackDefinitions = new Map<string, Array<string>>()\n\n  const compileDefinition = (key: string, path: Path): string => {\n    const compiled = definitionStates.get(key)\n    if (compiled !== undefined) return typeof compiled === \"string\" ? compiled : key\n    const representation = Object.hasOwn(references, key) ? references[key] : undefined\n    if (representation === undefined) throw invalid(`Invalid reference ${key}`, [...path, \"$ref\"])\n\n    definitionStates.set(key, null)\n    const schema = recur(representation, [\"references\", key])\n\n    const fallback = identifierFallback(representation)\n    if (fallback !== undefined) {\n      const candidates = fallbackDefinitions.get(fallback)\n      const match = candidates?.find((candidate) => sameJson(definitionStates.get(candidate), schema))\n      if (match === undefined) {\n        if (candidates === undefined) fallbackDefinitions.set(fallback, [key])\n        else candidates.push(key)\n      } else {\n        definitionStates.set(key, match)\n        return match\n      }\n    }\n    definitionStates.set(key, schema)\n    return key\n  }\n\n  const finalize = (schema: Fragment): Fragment =>\n    rewriteRefs(schema, (reference) => {\n      const pointer = decodeUriFragment(reference)\n      if (pointer === undefined) {\n        if (/^#(?:\\/|%2f)/i.test(reference)) {\n          throw new SchemaIdentityError({ message: `Invalid JSON Pointer URI fragment ${JSON.stringify(reference)}` })\n        }\n        return reference\n      }\n      if (!pointer.startsWith(\"/$defs/\")) return reference\n      const separator = pointer.indexOf(\"/\", 7)\n      const canonical = definitionStates.get(unescapeToken(pointer.slice(7, separator < 0 ? undefined : separator)))\n      if (typeof canonical !== \"string\") return reference\n      // URI-encoded slashes separate pointer tokens; only ~1 represents a slash within a token.\n      return reference.replace(/^#(?:\\/|%2f).*?(?:\\/|%2f).*?(?=\\/|%2f|$)/i, definitionReference(canonical))\n    })\n\n  const identifierFallback = (representation: Representation): string | undefined => {\n    if (representation._tag === \"Reference\") return undefined\n    const last = representation.checks.at(-1)\n    const annotations = last === undefined ? representation.annotations : last.annotations\n    const fallback = annotations?.[\"~identifier\"]\n    return typeof annotations?.[\"identifier\"] !== \"string\" && typeof fallback === \"string\" ? fallback : undefined\n  }\n\n  const compileCheck = (\n    check: Check,\n    type: JsonSchema.Type | undefined,\n    path: Path\n  ): readonly [schema: Fragment, inline?: true] | undefined => {\n    const source = fragmentSource(check)\n    if (source !== undefined) {\n      const schemas = check.representation?.schemas?.map((schema, index) =>\n        recur(schema, [...path, \"representation\", \"schemas\", index])\n      ) ?? []\n      const fragment = source({ type, schemas })\n      const ordinary = ordinaryAnnotations(check.annotations)\n      const schema = ordinary === undefined ? fragment : { ...fragment, ...ordinary }\n      const allowed = ordinary === undefined ? inlineableCheckKeywords : inlineableAnnotatedCheckKeywords\n      return check._tag === \"Filter\" && hasOnlyKeywords(schema, allowed) &&\n          (ordinary === undefined || hasOnlyKeywords(ordinary, promotableAnnotationKeywords))\n        ? [schema, true]\n        : [schema]\n    }\n    if (check._tag === \"Filter\") return undefined\n\n    const allOf: Array<Fragment> = []\n    check.checks.forEach((child, index) => {\n      const compiled = compileCheck(child, type, [...path, \"checks\", index])\n      if (compiled !== undefined) allOf.push(compiled[0])\n    })\n    if (allOf.length === 0) return undefined\n    const ordinary = ordinaryAnnotations(check.annotations)\n    return [ordinary === undefined ? { allOf } : { allOf, ...ordinary }]\n  }\n\n  const recur = (representation: Representation, path: Path): Fragment => {\n    if (representation._tag === \"Reference\") {\n      return { $ref: definitionReference(compileDefinition(representation.$ref, path)) }\n    }\n    const cached = compiledRepresentations.get(representation)\n    if (cached !== undefined) return cached\n\n    let output = on(representation, path)\n    const ordinary = ordinaryAnnotations(representation.annotations)\n    if (ordinary !== undefined) output = { ...output, ...ordinary }\n    representation.checks.forEach((check, index) => {\n      const compiled = compileCheck(\n        check,\n        isJsonSchemaType(output[\"type\"]) ? output[\"type\"] : undefined,\n        [...path, \"checks\", index]\n      )\n      if (compiled !== undefined) output = appendJsonSchema(output, ...compiled)\n    })\n    compiledRepresentations.set(representation, output)\n    return output\n  }\n\n  const annotated = (compiled: Fragment, annotations: Schema.Annotations.Annotations | undefined): Fragment => {\n    const ordinary = ordinaryAnnotations(annotations)\n    return ordinary === undefined ? compiled : appendJsonSchema(compiled, ordinary)\n  }\n\n  const on = (representation: Exclude<Representation, SchemaRepresentation.Reference>, path: Path): Fragment => {\n    switch (representation._tag) {\n      case \"Any\":\n      case \"Unknown\":\n      case \"Declaration\":\n        return {}\n      case \"ObjectKeyword\":\n        return { anyOf: [{ type: \"object\" }, { type: \"array\" }] }\n      case \"Void\":\n      case \"Undefined\":\n      case \"Null\":\n        return { type: \"null\" }\n      case \"BigInt\":\n        return { type: \"string\", allOf: [{ pattern: bigIntPattern }] }\n      case \"Symbol\":\n        return { type: \"string\", allOf: [{ pattern: symbolPattern }] }\n      case \"UniqueSymbol\":\n        return Symbol.keyFor(representation.symbol) === undefined\n          ? { not: {} }\n          : { type: \"string\", enum: [String(representation.symbol)] }\n      case \"Suspend\":\n        return recur(representation.thunk, [...path, \"thunk\"])\n      case \"Never\":\n        return { not: {} }\n      case \"String\":\n        return { type: \"string\" }\n      case \"Number\":\n        return { anyOf: [{ type: \"number\" }, { type: \"string\", enum: [\"NaN\", \"Infinity\", \"-Infinity\"] }] }\n      case \"Boolean\":\n        return { type: \"boolean\" }\n      case \"Literal\": {\n        const literal = representation.literal\n        return typeof literal === \"bigint\"\n          ? { type: \"string\", enum: [String(literal)] }\n          : { type: typeof literal, enum: [literal] }\n      }\n      case \"Enum\": {\n        const types = representation.enums.map(([title, literal], index) => {\n          if (typeof literal === \"number\" && !Number.isFinite(literal)) {\n            throw invalid(`Invalid numeric enum value ${String(literal)}`, [...path, \"enums\", index, 1])\n          }\n          return { type: typeof literal, enum: [literal], title }\n        })\n        return types.length === 0 ? { not: {} } : { anyOf: types }\n      }\n      case \"TemplateLiteral\":\n        return { type: \"string\", pattern: `^${representation.parts.map(partPattern).join(\"\")}$` }\n      case \"Arrays\": {\n        const rest = representation.rest[0]\n        if (representation.rest.length > 1) {\n          throw invalid(\"Invalid schema representation document\", [...path, \"rest\"])\n        }\n        const out: Fragment = { type: \"array\" }\n        let minItems = representation.elements.length\n        const prefixItems = representation.elements.map((element, index) => {\n          if (element.isOptional) minItems--\n          return annotated(recur(element.type, [...path, \"elements\", index, \"type\"]), element.annotations)\n        })\n        if (prefixItems.length > 0) {\n          out[\"prefixItems\"] = prefixItems\n          out[\"maxItems\"] = representation.elements.length\n          if (minItems > 0) out[\"minItems\"] = minItems\n        } else {\n          out[\"items\"] = false\n        }\n        if (rest !== undefined) {\n          delete out[\"maxItems\"]\n          const items = recur(rest, [...path, \"rest\", 0])\n          if (Object.keys(items).length > 0) out[\"items\"] = items\n          else delete out[\"items\"]\n        }\n        return out\n      }\n      case \"Objects\": {\n        if (representation.propertySignatures.length === 0 && representation.indexSignatures.length === 0) {\n          return { not: { type: \"null\" } }\n        }\n        const out: Fragment = { type: \"object\" }\n        const properties: Record<string, Fragment> = {}\n        const required: Array<string> = []\n        representation.propertySignatures.forEach((property, index) => {\n          const name = property.name\n          if (typeof name !== \"string\") {\n            throw invalid(\"Invalid schema representation document\", [...path, \"propertySignatures\", index, \"name\"])\n          }\n          assignProperty(\n            properties,\n            name,\n            annotated(recur(property.type, [...path, \"propertySignatures\", index, \"type\"]), property.annotations)\n          )\n          if (!property.isOptional) required.push(name)\n        })\n        if (representation.propertySignatures.length > 0) out[\"properties\"] = properties\n        if (required.length > 0) out[\"required\"] = required\n        const patternProperties: Record<string, Fragment | false> = {}\n        const additionalPropertySchemas: Array<Fragment | false> = []\n        const indexValueSchemas: Array<Fragment | false> = []\n        let hasUnrepresentableIndexPattern = false\n        representation.indexSignatures.forEach((signature, index) => {\n          const compiled = recur(signature.type, [...path, \"indexSignatures\", index, \"type\"])\n          const type = sameJson(compiled, neverSchema) ? false : compiled\n          indexValueSchemas.push(type)\n          const patterns = parameterPatterns(\n            signature.parameter,\n            [...path, \"indexSignatures\", index, \"parameter\"],\n            new Set()\n          )\n          if (patterns === undefined) {\n            hasUnrepresentableIndexPattern = true\n          } else if (patterns.length === 0) {\n            additionalPropertySchemas.push(type)\n          } else {\n            for (const key of patterns) {\n              const previous = Object.hasOwn(patternProperties, key) ? patternProperties[key] : undefined\n              assignProperty(\n                patternProperties,\n                key,\n                previous === undefined\n                  ? type\n                  : previous === false || type === false\n                  ? false\n                  : appendJsonSchema(previous, type)\n              )\n            }\n          }\n        })\n        const hasPatternProperties = Object.keys(patternProperties).length > 0\n        if (hasPatternProperties) out[\"patternProperties\"] = patternProperties\n        const additional = additionalPropertySchemas.map((type) => ({ type: \"object\", additionalProperties: type }))\n        if (hasUnrepresentableIndexPattern && closed) {\n          const propertyNames: Array<Fragment> = []\n          if (representation.propertySignatures.length > 0) propertyNames.push({ enum: Object.keys(properties) })\n          representation.indexSignatures.forEach((signature, index) => {\n            propertyNames.push(recur(signature.parameter, [...path, \"indexSignatures\", index, \"parameter\"]))\n          })\n          out[\"propertyNames\"] = propertyNames.length === 1 ? propertyNames[0] : { anyOf: propertyNames }\n          out[\"additionalProperties\"] = indexValueSchemas.length === 1\n            ? indexValueSchemas[0]\n            : { anyOf: indexValueSchemas }\n          if (additional.length > 0) out[\"allOf\"] = additional\n        } else if (additional.length === 0) {\n          out[\"additionalProperties\"] = hasUnrepresentableIndexPattern || !closed\n        } else if (\n          additionalPropertySchemas.length === 1 && representation.propertySignatures.length === 0 &&\n          !hasPatternProperties\n        ) {\n          out[\"additionalProperties\"] = additionalPropertySchemas[0]\n        } else {\n          out[\"allOf\"] = additional\n        }\n        const additionalProperties = out[\"additionalProperties\"]\n        if (isObject(additionalProperties) && Object.keys(additionalProperties).length === 0) {\n          delete out[\"additionalProperties\"]\n        }\n        return out\n      }\n      case \"Union\": {\n        const types = representation.types.map((type, index) => recur(type, [...path, \"types\", index]))\n        if (types.length === 0) return { not: {} }\n        const mode = representation.options?.mode ?? \"anyOf\"\n        if (mode === \"anyOf\" && types.length > 1) {\n          const compacted = compactEnums(types)\n          if (compacted !== undefined) return compacted\n        }\n        return mode === \"anyOf\" ? { anyOf: types } : { oneOf: types }\n      }\n      default:\n        return unsupported(representation, path)\n    }\n  }\n\n  const parameterPatterns = (\n    parameter: Representation,\n    path: Path,\n    seenReferences: ReadonlySet<string>\n  ): ReadonlyArray<string> | undefined => {\n    switch (parameter._tag) {\n      case \"Reference\": {\n        const target = Object.hasOwn(references, parameter.$ref) ? references[parameter.$ref] : undefined\n        if (target === undefined) throw invalid(`Invalid reference ${parameter.$ref}`, [...path, \"$ref\"])\n        compileDefinition(parameter.$ref, path)\n        if (seenReferences.has(parameter.$ref)) return undefined\n        return parameterPatterns(target, [\"references\", parameter.$ref], new Set(seenReferences).add(parameter.$ref))\n      }\n      case \"String\": {\n        const check = parameter.checks[0]\n        if (check === undefined) return []\n        if (parameter.checks.length !== 1 || check._tag !== \"Filter\" || fragmentSource(check) === undefined) {\n          return undefined\n        }\n        const schema = recur(parameter, path)\n        const key = schema[\"pattern\"]\n        return schema[\"type\"] === \"string\" && typeof key === \"string\" &&\n            hasOnlyKeywords(schema, \"|type|pattern|title|description|default|examples|readOnly|writeOnly|\")\n          ? [key]\n          : undefined\n      }\n      case \"TemplateLiteral\":\n        return parameter.checks.length === 0 ? [`^${parameter.parts.map(partPattern).join(\"\")}$`] : undefined\n      case \"Union\": {\n        if (parameter.types.length === 0 || parameter.checks.length > 0 || parameter.options?.mode === \"oneOf\") {\n          return undefined\n        }\n        const patterns: Array<string> = []\n        for (const [index, member] of parameter.types.entries()) {\n          const memberPatterns = parameterPatterns(member, [...path, \"types\", index], seenReferences)\n          if (memberPatterns === undefined) return undefined\n          if (memberPatterns.length === 0) return []\n          patterns.push(...memberPatterns)\n        }\n        return patterns\n      }\n      default:\n        throw invalid(\"Invalid schema representation document\", path)\n    }\n  }\n\n  const referenceKeys = Object.keys(references)\n  for (const key of referenceKeys) compileDefinition(key, [\"references\", key])\n  const schema = finalize(recur(document.representation, [\"representation\"]))\n  const definitions: Record<string, Fragment> = {}\n  for (const key of referenceKeys) {\n    const compiled = definitionStates.get(key)\n    if (isObject(compiled)) assignProperty(definitions, key, finalize(compiled))\n  }\n  return { dialect: \"draft-2020-12\", schema, definitions }\n}\n\n/**\n * The identity a schema contributes: a pure function of the schema and the\n * option, and of nothing the installed `effect` release prints. It takes the\n * place of `Schema.toJsonSchemaDocument(schema, options)` wherever the\n * document is hashed, compared or pinned.\n *\n * Throws what rc.115 threw for a schema with no JSON Schema form: more than\n * one rest element, a record key that is neither a string nor a template, a\n * `toJsonSchema` annotation that throws.\n *\n * @since 1.0.0\n * @private\n */\nexport const schemaIdentity = (schema: Schema.Top, options?: Options): Document =>\n  fromRepresentation(Schema.toRepresentation(Schema.toCodecJson(schema)), options)\n\n/**\n * The six built-in checks `effect` renamed after `4.0.0-rc.115`, from the id\n * a later release writes to the id rc.115 wrote. Their payloads and\n * annotations did not change.\n *\n * @private\n */\nconst rc115CheckIds: ReadonlyMap<string, string> = new Map([\n  [\"effect/schema/isStartingWith\", \"effect/schema/isStartsWith\"],\n  [\"effect/schema/isEndingWith\", \"effect/schema/isEndsWith\"],\n  [\"effect/schema/isIncluding\", \"effect/schema/isIncludes\"],\n  [\"effect/schema/isBetweenLength\", \"effect/schema/isLengthBetween\"],\n  [\"effect/schema/isBetweenSize\", \"effect/schema/isSizeBetween\"],\n  [\"effect/schema/isBetweenProperties\", \"effect/schema/isPropertiesLengthBetween\"]\n])\n\n/**\n * A copy of an encoded representation with every renamed check id written\n * back as rc.115 wrote it. Only an element of a `checks` array is a check.\n * `annotations` and `payload` hold an author's data, which may have any\n * shape, so they are copied as they are. Key order is kept, so the bytes\n * match.\n *\n * @private\n */\nconst withRc115CheckIds = (value: Schema.Json, isCheck = false): Schema.Json => {\n  if (Array.isArray(value)) return value.map((member) => withRc115CheckIds(member, isCheck))\n  if (!isObject(value)) return value\n  const out: Record<string, Schema.Json> = {}\n  for (const [key, member] of Object.entries(value as Readonly<Record<string, Schema.Json>>)) {\n    if (key === \"annotations\" || key === \"payload\") {\n      assignProperty(out, key, member)\n      continue\n    }\n    const renamed = isCheck && key === \"representation\" && isObject(member) && typeof member[\"id\"] === \"string\"\n      ? rc115CheckIds.get(member[\"id\"])\n      : undefined\n    assignProperty(\n      out,\n      key,\n      renamed === undefined\n        ? withRc115CheckIds(member, key === \"checks\")\n        : withRc115CheckIds({ ...(member as Readonly<Record<string, Schema.Json>>), id: renamed })\n    )\n  }\n  return out\n}\n\n/**\n * The representation identity of a schema AST: what\n * `SchemaRepresentation.toJson(SchemaRepresentation.toRepresentation(ast))`\n * returned under `effect@4.0.0-rc.115`, key order included. A sealed action's\n * step key hashes it, so it must not move with the installed `effect`.\n *\n * The installed release encodes the representation; this writes back the six\n * check ids renamed after rc.115. One difference cannot be undone: from\n * `effect@4.0.4` on, `Schema.brand` is not part of the AST, so the `brands`\n * annotation rc.115 wrote is absent and a declaration with a brand re-keys\n * once.\n *\n * Throws what rc.115 threw for an AST with no representation, such as one\n * whose check carries no `representation` annotation.\n *\n * @since 1.0.0\n * @private\n */\nexport const representationIdentity = (ast: SchemaAST.AST): Schema.Json =>\n  withRc115CheckIds(SchemaRepresentation.toJson(SchemaRepresentation.toRepresentation(ast)))\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkDA,aAAwB;AAExB,2BAAsC;AAgD/B,MAAM,4BAA4B,OAAO,YAAiC,EAAE,oCAAoC;AAAA,EACrH,SAAS,OAAO;AAClB,CAAC,EAAE;AAAC;AAGJ,MAAM,UAAU,CAAC,SAAiB,SAChC,IAAI,oBAAoB;AAAA,EACtB,SAAS,KAAK,WAAW,IACrB,UACA,GAAG,OAAO;AAAA,OAAU,KAAK,IAAI,CAAC,QAAQ,IAAI,OAAO,QAAQ,WAAW,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC;AAChH,CAAC;AAGH,MAAM,WAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAQrE,MAAM,iBAAiB,CAAC,QAAiC,KAAa,UAAyB;AAC7F,MAAI,QAAQ,aAAa;AACvB,WAAO,eAAe,QAAQ,KAAK,EAAE,OAAO,UAAU,MAAM,YAAY,MAAM,cAAc,KAAK,CAAC;AAAA,EACpG,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAQA,MAAM,SAAS,CAAC,OAAgB,OAA4B,oBAAI,IAAI,MAAe;AACjF,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,WAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,OAAO,UAAU,aACpE,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;AAAA,EACvD;AACA,MAAI,KAAK,IAAI,KAAK,EAAG,QAAO;AAC5B,QAAM,UAAU,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAc,KAAK,IAAI,YAAY,KAAK;AACrF,MAAI,YAAY,OAAW,QAAO;AAClC,QAAM,QAAQ,IAAI,IAAI,IAAI,EAAE,IAAI,KAAK;AACrC,SAAO,QAAQ,MAAM,CAAC,WAAW,OAAO,QAAQ,KAAK,CAAC;AACxD;AAGA,MAAM,cAAc,CAAC,UAAsD;AACzE,QAAM,YAAqB,OAAO,eAAe,KAAK;AAGtD,SAAO,cAAc,QAAQ,cAAc,OAAO,aAAa,OAAO,eAAe,SAAS,MAAM,OAChG,OAAO,OAAO,KAAK,IACnB;AACN;AASA,MAAM,WAAW,CAAC,MAAe,UAA4B;AAC3D,MAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,KAAK,GAAG;AAC/C,WAAO,KAAK,WAAW,MAAM,UAAU,KAAK,MAAM,CAAC,QAAQ,UAAU,SAAS,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,EACrG;AACA,MAAI,SAAS,IAAI,KAAK,SAAS,KAAK,GAAG;AACrC,UAAM,OAAO,OAAO,KAAK,IAAI;AAC7B,WAAO,KAAK,WAAW,OAAO,KAAK,KAAK,EAAE,UACxC,KAAK,MAAM,CAAC,QAAQ,OAAO,OAAO,OAAO,GAAG,KAAK,SAAS,KAAK,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,EACpF;AACA,SAAO,SAAS,SAAU,SAAS,QAAQ,UAAU;AACvD;AAGA,MAAM,eAAe,CAAC,SAAyB,KAAK,QAAQ,wBAAwB,MAAM;AAG1F,MAAM,gBAAgB,CAAC,UAA0B,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AAG7F,MAAM,sBAAsB,CAAC,QAC3B,WAAW,UAAU,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI,CAAC,EAAE,QAAQ,MAAM,KAAK,CAAC;AAOzF,MAAM,oBAAoB,CAAC,aAAyC;AAClE,MAAI,SAAS,WAAW,KAAK,aAAa,IAAK,QAAO;AACtD,MAAI,CAAC,SAAS,WAAW,GAAG,EAAG,QAAO;AACtC,QAAM,UAAU,SAAS,MAAM,CAAC;AAChC,MAAI;AACF,QAAI,UAAU,OAAO,EAAE,QAAQ,QAAQ,GAAG,EAAE,QAAQ,MAAM,KAAK,MAAM,QAAS,QAAO;AACrF,UAAM,UAAU,mBAAmB,OAAO;AAC1C,WAAO,QAAQ,WAAW,GAAG,KAAK,CAAC,eAAe,KAAK,OAAO,IAAI,UAAU;AAAA,EAC9E,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AASA,MAAM,cAAc,CAAC,MAAgB,YAAqD;AACxF,QAAM,OAAO,CAAC,UAA4B,SAAS,KAAK,IAAI,YAAY,OAAO,OAAO,IAAI;AAC1F,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,OAAO,KAAK,IAAI,GAAG;AACnC,UAAM,QAAQ,KAAK,GAAG;AACtB,QAAI,cAAc;AAClB,YAAQ,KAAK;AAAA,MACX,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,YAAI,SAAS,KAAK,GAAG;AACnB,gBAAM,SAAmB,CAAC;AAC1B,qBAAW,QAAQ,OAAO,KAAK,KAAK,EAAG,gBAAe,QAAQ,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC;AACrF,wBAAc;AAAA,QAChB;AACA;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,YAAI,MAAM,QAAQ,KAAK,EAAG,eAAc,MAAM,IAAI,IAAI;AACtD;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,sBAAc,KAAK,KAAK;AAAA,IAC5B;AACA,mBAAe,KAAK,KAAK,WAAW;AAAA,EACtC;AACA,MAAI,OAAO,IAAI,MAAM,MAAM,SAAU,KAAI,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC;AACtE,MAAI,OAAO,IAAI,aAAa,MAAM,SAAU,KAAI,aAAa,IAAI,QAAQ,IAAI,aAAa,CAAC;AAC3F,SAAO;AACT;AAOA,MAAM,sBAAsB,CAAC,gBAAkF;AAC7G,MAAI,gBAAgB,OAAW,QAAO;AACtC,QAAM,MAAgB,CAAC;AACvB,MAAI,OAAO,YAAY,OAAO,MAAM,SAAU,KAAI,OAAO,IAAI,YAAY,OAAO;AAChF,MAAI,OAAO,YAAY,aAAa,MAAM,SAAU,KAAI,aAAa,IAAI,YAAY,aAAa;AAClG,MAAI,OAAO,YAAY,SAAS,CAAC,EAAG,KAAI,SAAS,IAAI,YAAY,SAAS;AAC1E,MAAI,MAAM,QAAQ,YAAY,UAAU,CAAC,KAAK,OAAO,YAAY,UAAU,CAAC,GAAG;AAC7E,QAAI,UAAU,IAAI,YAAY,UAAU;AAAA,EAC1C;AACA,MAAI,OAAO,YAAY,UAAU,MAAM,UAAW,KAAI,UAAU,IAAI,YAAY,UAAU;AAC1F,MAAI,OAAO,YAAY,WAAW,MAAM,UAAW,KAAI,WAAW,IAAI,YAAY,WAAW;AAC7F,MAAI,OAAO,YAAY,QAAQ,MAAM,SAAU,KAAI,QAAQ,IAAI,YAAY,QAAQ;AACnF,MAAI,OAAO,YAAY,iBAAiB,MAAM,SAAU,KAAI,iBAAiB,IAAI,YAAY,iBAAiB;AAC9G,MAAI,OAAO,YAAY,kBAAkB,MAAM,SAAU,KAAI,kBAAkB,IAAI,YAAY,kBAAkB;AACjH,MAAI,OAAO,YAAY,eAAe,CAAC,EAAG,KAAI,eAAe,IAAI,YAAY,eAAe;AAC5F,SAAO,OAAO,KAAK,GAAG,EAAE,WAAW,IAAI,SAAY;AACrD;AAGA,MAAM,gBAAgB;AAGtB,MAAM,gBAAgB;AAGtB,MAAM,gBAAgB;AAGtB,MAAM,gBAAgB;AAGtB,MAAM,cAAc,CAAC,YACnB,YAAY,OACR,+KAEA,mCAAmC,OAAO;AAQhD,MAAM,QAAQ,CAAI,IAAY,SAAkB,MAAc,OAA0C;AACtG,QAAM,QAAQ,SAAS,OAAO,IAAI,QAAQ,IAAI,IAAI;AAClD,MAAI,CAAC,GAAG,KAAK,GAAG;AACd,UAAM,IAAI,oBAAoB;AAAA,MAC5B,SAAS,0CAA0C,EAAE,uBAAuB,IAAI;AAAA,IAElF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,MAAM,WAAW,CAAC,UAAoC,OAAO,UAAU;AAGvE,MAAM,WAAW,CAAC,UAAoC,OAAO,UAAU;AAGvE,MAAM,YAAY,CAAC,UAA2C,UAAU,QAAQ,OAAO,UAAU;AAGjG,MAAM,SAAS,CAAC,UAAiD,UAAU,UAAa,OAAO,UAAU;AAWzG,MAAM,UAAU,CAAC,WAAiC,OAAO,EAAE,SAAS,OAAO;AAG3E,MAAM,iBAAiB,CAAC,MAAc,WAAsD,CAAC,IAAI,aAAa;AAAA,EAC5G,SAAS,IAAI,OAAO,OAAO,aAAa,MAAM,IAAI,SAAS,MAAM,QAAQ,CAAC,CAAC,CAAC,EAAE;AAChF;AAGA,MAAM,QAAQ,CAAC,SAAiB,OAAe,YAA0B,CAAC,IAAI,aAAa;AAAA,EACzF,CAAC,OAAO,GAAG,MAAM,IAAI,SAAS,MAAM,QAAQ;AAC9C;AAGA,MAAM,SAAS,CAAC,MAAc,OAAe,WAAiC,CAAC,IAAI,SAAS,WAAW;AAAA,EACrG,CAAC,MAAM,SAAS,UAAU,QAAQ,MAAM,GAAG,MAAM,IAAI,SAAS,MAAM,QAAQ;AAC9E;AAGA,MAAM,QAAsB,OAAO,CAAC;AAapC,MAAM,gBAAmD,oBAAI,IAA0B;AAAA,EACrF,CAAC,2BAA2B,QAAQ,4BAA4B,CAAC;AAAA,EACjE,CAAC,2BAA2B,CAAC,IAAI,aAAa,EAAE,SAAS,MAAM,IAAI,SAAS,UAAU,QAAQ,EAAE,EAAE;AAAA,EAClG,CAAC,gCAAgC,QAAQ,IAAI,aAAa,GAAG,CAAC;AAAA,EAC9D,CAAC,gCAAgC,QAAQ,aAAa,CAAC;AAAA,EACvD,CAAC,gCAAgC,QAAQ,aAAa,CAAC;AAAA,EACvD,CAAC,wBAAwB,CAAC,IAAI,aAAa;AAAA,IACzC,SAAS,YAAY,MAAM,IAAI,SAAS,WAAW,SAAS,CAAC;AAAA,IAC7D,QAAQ;AAAA,EACV,EAAE;AAAA,EACF,CAAC,wBAAwB,QAAQ,iFAAiF,CAAC;AAAA,EACnH,CAAC,wBAAwB,QAAQ,uCAAuC,CAAC;AAAA,EACzE,CAAC,0BAA0B,QAAQ,kEAAkE,CAAC;AAAA,EACtG,CAAC,6BAA6B,QAAQ,wEAAwE,CAAC;AAAA,EAC/G,CAAC,gCAAgC,eAAe,cAAc,CAAC,YAAY,IAAI,OAAO,EAAE,CAAC;AAAA,EACzF,CAAC,8BAA8B,eAAe,YAAY,CAAC,YAAY,GAAG,OAAO,GAAG,CAAC;AAAA,EACrF,CAAC,6BAA6B,eAAe,YAAY,CAAC,YAAY,OAAO,CAAC;AAAA,EAC9E,CAAC,8BAA8B,QAAQ,WAAW,CAAC;AAAA,EACnD,CAAC,8BAA8B,QAAQ,WAAW,CAAC;AAAA,EACnD,CAAC,+BAA+B,QAAQ,wBAAwB,CAAC;AAAA,EACjE,CAAC,iCAAiC,QAAQ,wBAAwB,CAAC;AAAA,EACnE,CAAC,0BAA0B,OAAO,EAAE,MAAM,SAAS,EAAE;AAAA,EACrD,CAAC,uBAAuB,OAAO,EAAE,MAAM,UAAU,EAAE;AAAA,EACnD,CAAC,+BAA+B,MAAM,kBAAkB,CAAC;AAAA,EACzD,CAAC,wCAAwC,MAAM,SAAS,CAAC;AAAA,EACzD,CAAC,4BAA4B,MAAM,kBAAkB,CAAC;AAAA,EACtD,CAAC,qCAAqC,MAAM,SAAS,CAAC;AAAA,EACtD,CAAC,2BAA2B,CAAC,IAAI,aAAa;AAAA,IAC5C,CAAC,MAAM,IAAI,SAAS,oBAAoB,MAAM,IAAI,qBAAqB,SAAS,GAAG;AAAA,MACjF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,CAAC,MAAM,IAAI,SAAS,oBAAoB,MAAM,IAAI,qBAAqB,SAAS,GAAG;AAAA,MACjF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,EAAE;AAAA,EACF,CAAC,8BAA8B,MAAM,cAAc,SAAS,CAAC;AAAA,EAC7D,CAAC,mCAAmC,KAAK;AAAA,EACzC,CAAC,4CAA4C,KAAK;AAAA,EAClD,CAAC,gCAAgC,KAAK;AAAA,EACtC,CAAC,yCAAyC,KAAK;AAAA,EAC/C,CAAC,+BAA+B,KAAK;AAAA,EACrC,CAAC,qCAAqC,KAAK;AAAA,EAC3C,CAAC,8CAA8C,KAAK;AAAA,EACpD,CAAC,kCAAkC,KAAK;AAAA,EACxC,CAAC,2CAA2C,KAAK;AAAA,EACjD,CAAC,iCAAiC,KAAK;AAAA,EACvC,CAAC,6BAA6B,OAAO,aAAa,YAAY,WAAW,CAAC;AAAA,EAC1E,CAAC,6BAA6B,OAAO,aAAa,YAAY,WAAW,CAAC;AAAA,EAC1E,CAAC,iCAAiC,CAAC,IAAI,SAAS,UAAU;AACxD,UAAM,UAAU,MAAM,IAAI,SAAS,WAAW,QAAQ;AACtD,UAAM,UAAU,MAAM,IAAI,SAAS,WAAW,QAAQ;AACtD,WAAO,MAAM,SAAS,UAClB,EAAE,OAAO,CAAC,EAAE,UAAU,QAAQ,GAAG,EAAE,UAAU,QAAQ,CAAC,EAAE,IACxD,EAAE,OAAO,CAAC,EAAE,WAAW,QAAQ,GAAG,EAAE,WAAW,QAAQ,CAAC,EAAE;AAAA,EAChE,CAAC;AAAA,EACD,CAAC,iCAAiC,MAAM,aAAa,eAAe,CAAC;AAAA,EACrE,CAAC,iCAAiC,MAAM,aAAa,eAAe,CAAC;AAAA,EACrE,CAAC,qCAAqC,CAAC,IAAI,aAAa;AAAA,IACtD,OAAO;AAAA,MACL,EAAE,WAAW,MAAM,IAAI,SAAS,WAAW,QAAQ,EAAE;AAAA,MACrD,EAAE,WAAW,MAAM,IAAI,SAAS,WAAW,QAAQ,EAAE;AAAA,IACvD;AAAA,EACF,EAAE;AAAA,EACF,CAAC,2BAA2B,KAAK;AAAA,EACjC,CAAC,2BAA2B,KAAK;AAAA,EACjC,CAAC,+BAA+B,KAAK;AAAA,EACrC,CAAC,iCAAiC,MAAM,eAAe,CAAC;AAAA,EACxD,CAAC,iCAAiC,MAAM,eAAe,CAAC;AAAA,EACxD,CAAC,qCAAqC,CAAC,IAAI,aAAa;AAAA,IACtD,eAAe,MAAM,IAAI,SAAS,WAAW,QAAQ;AAAA,IACrD,eAAe,MAAM,IAAI,SAAS,WAAW,QAAQ;AAAA,EACvD,EAAE;AAAA,EACF,CAAC,iCAAiC,CAAC,KAAK,UAAU,WAAW,EAAE,eAAe,MAAM,QAAQ,CAAC,EAAE,EAAE;AAAA,EACjG,CAAC,0BAA0B,OAAO,EAAE,aAAa,KAAK,EAAE;AAAA,EACxD,CAAC,6BAA6B,IAAI;AACpC,CAAC;AASM,MAAM,kBAAyC,CAAC,GAAG,cAAc,KAAK,CAAC;AAG9E,MAAM,kBAAkB,CAAC,UACvB,OAAO,UAAU;AAGnB,MAAM,gBAAgB,CACpB,WAC6D,MAAM,QAAQ,MAAM;AAQnF,MAAM,iBAAiB,CAAC,UAAgE;AACtF,QAAM,iBAAiB,MAAM;AAC7B,QAAM,UAAU,mBAAmB,SAAY,SAAY,cAAc,IAAI,eAAe,EAAE;AAC9F,MAAI,mBAAmB,UAAa,YAAY,QAAW;AACzD,WAAO,YAAY,OAAO,SAAY,CAAC,UAAU,QAAQ,eAAe,IAAI,eAAe,SAAS,KAAK;AAAA,EAC3G;AACA,QAAM,WAAW,MAAM,cAAc,cAAc;AACnD,MAAI,CAAC,gBAAgB,QAAQ,EAAG,QAAO;AACvC,SAAO,CAAC,UAAU;AAChB,UAAM,SAAS,SAAS,KAAK;AAC7B,WAAO,cAAc,MAAM,IAAI,OAAO,CAAC,IAAI;AAAA,EAC7C;AACF;AAMA,MAAM,oBAAoB,CAAC,WAA2F;AACpH,MAAI,OAA+B,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YACjF,OAAO,MAAM,IACb;AACJ,MAAI,MAAM;AACV,MAAI,SAAS,QAAW;AACtB,UAAM,EAAE,GAAG,OAAO;AAClB,WAAO,IAAI,MAAM;AAAA,EACnB;AACA,QAAM,QAAQ,IAAI,OAAO;AACzB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,UAA2B,CAAC;AAClC,QAAI,UAAU;AACd,eAAW,UAAU,OAAO;AAC1B,YAAM,YAAY,kBAAkB,MAAM;AAC1C,UAAI,UAAU,SAAS,QAAW;AAChC,kBAAU;AACV,YAAI,SAAS,UAAa,UAAU,SAAS,UAAW,QAAO,UAAU;AAAA,MAC3E;AACA,UAAI,OAAO,KAAK,UAAU,MAAM,EAAE,SAAS,EAAG,SAAQ,KAAK,UAAU,MAAM;AAAA,IAC7E;AACA,QAAI,SAAS;AACX,YAAM,EAAE,OAAO,GAAG,GAAG,KAAK,IAAI;AAC9B,YAAM,QAAQ,WAAW,IAAI,OAAO,EAAE,GAAG,MAAM,OAAO,QAAQ;AAAA,IAChE;AAAA,EACF;AACA,SAAO,EAAE,MAAM,QAAQ,IAAI;AAC7B;AAGA,MAAM,mBAAmB,CAAC,WAA8B;AACtD,QAAM,QAAQ,OAAO,OAAO;AAC5B,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,KAAK,CAAC,SAAS,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,MAAM,SAAU,QAAO;AAChH,QAAM,UAAmB,MAAM,CAAC;AAChC,MAAI,CAAC,SAAS,OAAO,KAAK,QAAQ,MAAM,MAAM,SAAU,QAAO;AAC/D,QAAM,SAAS,QAAQ,MAAM;AAC7B,SAAO,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,SAAS,KAAK,KAAK,OAAO,SAAS,UAAU,KACzG,OAAO,SAAS,WAAW;AAC/B;AAIA,MAAM,0BACJ;AAIF,MAAM,+BAA+B;AAGrC,MAAM,mCAAmC,0BAA0B;AAGnE,MAAM,kBAAkB,CAAC,QAAkB,YACzC,OAAO,KAAK,MAAM,EAAE,MAAM,CAAC,QAAQ,QAAQ,SAAS,IAAI,GAAG,GAAG,CAAC;AAGjE,MAAM,kBAAkB,CAAC,MAAgB,cACvC,OAAO,KAAK,MAAM,MAAM,YAAY,UAAU,MAAM,CAAC,QAAQ,CAAC,OAAO,OAAO,MAAM,GAAG,CAAC;AAQxF,MAAM,mBAAmB,CAAC,MAAgB,OAAiB,gBAAiC;AAC1F,MAAI,OAAO,KAAK,IAAI,EAAE,WAAW,EAAG,QAAO;AAC3C,QAAM,YAAY,OAAO,KAAK,KAAK;AACnC,MAAI,UAAU,WAAW,EAAG,QAAO;AACnC,QAAM,WAAW,KAAK,MAAM,MAAM,YAAY,KAAK,MAAM,MAAM,YAAY,KAAK,MAAM,IAAI;AAC1F,QAAM,iBAAiB,iBAAiB,IAAI;AAC5C,MAAI,aAAa,UAAa,gBAAgB;AAC5C,UAAM,YAAY,kBAAkB,KAAK;AACzC,QAAI,UAAU,SAAS,QAAW;AAChC,YAAM,OAAO,aAAa,aAAa,UAAU,SAAS,YAAY,YAAY;AAClF,YAAM,OAAiB,EAAE,GAAG,MAAM,KAAK;AACvC,UAAI,eAAgB,QAAO,KAAK,OAAO;AACvC,YAAM,gBAAgB,OAAO,KAAK,UAAU,MAAM;AAClD,UAAI,cAAc,WAAW,EAAG,QAAO;AACvC,aAAO,gBAAgB,UAAU,QAAQ,4BAA4B,KAAK,gBAAgB,MAAM,aAAa,IACzG,EAAE,GAAG,MAAM,GAAG,UAAU,OAAO,IAC/B,iBAAiB,MAAM,UAAU,QAAQ,WAAW;AAAA,IAC1D;AAAA,EACF;AACA,MAAI,eAAe,gBAAgB,MAAM,SAAS,EAAG,QAAO,EAAE,GAAG,MAAM,GAAG,MAAM;AAChF,QAAM,aAAa,MAAM,OAAO;AAChC,QAAM,UAAkC,MAAM,QAAQ,UAAU,KAAK,UAAU,WAAW,IAAI,aAAa,CAAC,KAAK;AACjH,QAAM,YAAY,KAAK,OAAO;AAC9B,MAAI,MAAM,QAAQ,SAAS,EAAG,QAAO,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,WAAW,GAAG,OAAO,EAAE;AAClF,MAAI,OAAO,KAAK,MAAM,MAAM,SAAU,QAAO,EAAE,OAAO,CAAC,MAAM,GAAG,OAAO,EAAE;AACzE,SAAO,EAAE,GAAG,MAAM,OAAO,QAAQ;AACnC;AAGA,MAAM,kBAAwC,oBAAI,IAAI;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,MAAM,mBAAmB,CAAC,UAA6C,gBAAgB,IAAI,KAAK;AAQhG,MAAM,eAAe,CAAC,YAA2D;AAC/E,MAAI,aAAsB;AAC1B,QAAM,SAAyB,CAAC;AAChC,aAAW,UAAU,SAAS;AAC5B,UAAM,UAAU,OAAO,MAAM;AAC7B,QACE,OAAO,KAAK,MAAM,EAAE,WAAW,KAAK,OAAO,MAAM,MAAM,UAAa,CAAC,MAAM,QAAQ,OAAO,KAC1F,QAAQ,WAAW,GACnB;AACA,aAAO;AAAA,IACT;AACA,QAAI,eAAe,OAAW,cAAa,OAAO,MAAM;AAAA,aAC/C,OAAO,MAAM,MAAM,WAAY,QAAO;AAC/C,eAAW,SAAS,SAAS;AAC3B,UAAI,OAAO,SAAS,KAAK,EAAG,QAAO;AACnC,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AACA,SAAO,EAAE,MAAM,YAAY,MAAM,OAAO;AAC1C;AAGA,MAAM,cAAc,CAAC,SAAiC;AACpD,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK;AACH,aAAO,aAAa,OAAO,KAAK,OAAO,CAAC;AAAA,IAC1C,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,KAAK,MAAM,IAAI,WAAW,EAAE,KAAK,EAAE;AAAA,IAC5C,KAAK;AACH,aAAO,MAAM,KAAK,MAAM,IAAI,WAAW,EAAE,KAAK,GAAG,CAAC;AAAA,IACpD;AACE,YAAM,QAAQ,0CAA0C,CAAC,CAAC;AAAA,EAC9D;AACF;AAGA,MAAM,cAAwB,EAAE,KAAK,CAAC,EAAE;AAQxC,MAAM,cAAc,CAAC,gBAAuB,SAAsB;AAChE,QAAM,QAAQ,qCAAsC,eAA6C,IAAI,IAAI,IAAI;AAC/G;AAYO,MAAM,qBAAqB,CAAC,UAAyC,YAAgC;AAC1G,QAAM,SAAS,SAAS,qBAAqB;AAC7C,QAAM,aAAa,SAAS;AAG5B,QAAM,mBAAmB,oBAAI,IAAsC;AACnE,QAAM,0BAA0B,oBAAI,QAAkC;AACtE,QAAM,sBAAsB,oBAAI,IAA2B;AAE3D,QAAM,oBAAoB,CAAC,KAAa,SAAuB;AAC7D,UAAM,WAAW,iBAAiB,IAAI,GAAG;AACzC,QAAI,aAAa,OAAW,QAAO,OAAO,aAAa,WAAW,WAAW;AAC7E,UAAM,iBAAiB,OAAO,OAAO,YAAY,GAAG,IAAI,WAAW,GAAG,IAAI;AAC1E,QAAI,mBAAmB,OAAW,OAAM,QAAQ,qBAAqB,GAAG,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC;AAE7F,qBAAiB,IAAI,KAAK,IAAI;AAC9B,UAAMA,UAAS,MAAM,gBAAgB,CAAC,cAAc,GAAG,CAAC;AAExD,UAAM,WAAW,mBAAmB,cAAc;AAClD,QAAI,aAAa,QAAW;AAC1B,YAAM,aAAa,oBAAoB,IAAI,QAAQ;AACnD,YAAM,QAAQ,YAAY,KAAK,CAAC,cAAc,SAAS,iBAAiB,IAAI,SAAS,GAAGA,OAAM,CAAC;AAC/F,UAAI,UAAU,QAAW;AACvB,YAAI,eAAe,OAAW,qBAAoB,IAAI,UAAU,CAAC,GAAG,CAAC;AAAA,YAChE,YAAW,KAAK,GAAG;AAAA,MAC1B,OAAO;AACL,yBAAiB,IAAI,KAAK,KAAK;AAC/B,eAAO;AAAA,MACT;AAAA,IACF;AACA,qBAAiB,IAAI,KAAKA,OAAM;AAChC,WAAO;AAAA,EACT;AAEA,QAAM,WAAW,CAACA,YAChB,YAAYA,SAAQ,CAAC,cAAc;AACjC,UAAM,UAAU,kBAAkB,SAAS;AAC3C,QAAI,YAAY,QAAW;AACzB,UAAI,gBAAgB,KAAK,SAAS,GAAG;AACnC,cAAM,IAAI,oBAAoB,EAAE,SAAS,qCAAqC,KAAK,UAAU,SAAS,CAAC,GAAG,CAAC;AAAA,MAC7G;AACA,aAAO;AAAA,IACT;AACA,QAAI,CAAC,QAAQ,WAAW,SAAS,EAAG,QAAO;AAC3C,UAAM,YAAY,QAAQ,QAAQ,KAAK,CAAC;AACxC,UAAM,YAAY,iBAAiB,IAAI,cAAc,QAAQ,MAAM,GAAG,YAAY,IAAI,SAAY,SAAS,CAAC,CAAC;AAC7G,QAAI,OAAO,cAAc,SAAU,QAAO;AAE1C,WAAO,UAAU,QAAQ,6CAA6C,oBAAoB,SAAS,CAAC;AAAA,EACtG,CAAC;AAEH,QAAM,qBAAqB,CAAC,mBAAuD;AACjF,QAAI,eAAe,SAAS,YAAa,QAAO;AAChD,UAAM,OAAO,eAAe,OAAO,GAAG,EAAE;AACxC,UAAM,cAAc,SAAS,SAAY,eAAe,cAAc,KAAK;AAC3E,UAAM,WAAW,cAAc,aAAa;AAC5C,WAAO,OAAO,cAAc,YAAY,MAAM,YAAY,OAAO,aAAa,WAAW,WAAW;AAAA,EACtG;AAEA,QAAM,eAAe,CACnB,OACA,MACA,SAC2D;AAC3D,UAAM,SAAS,eAAe,KAAK;AACnC,QAAI,WAAW,QAAW;AACxB,YAAM,UAAU,MAAM,gBAAgB,SAAS;AAAA,QAAI,CAACA,SAAQ,UAC1D,MAAMA,SAAQ,CAAC,GAAG,MAAM,kBAAkB,WAAW,KAAK,CAAC;AAAA,MAC7D,KAAK,CAAC;AACN,YAAM,WAAW,OAAO,EAAE,MAAM,QAAQ,CAAC;AACzC,YAAMC,YAAW,oBAAoB,MAAM,WAAW;AACtD,YAAMD,UAASC,cAAa,SAAY,WAAW,EAAE,GAAG,UAAU,GAAGA,UAAS;AAC9E,YAAM,UAAUA,cAAa,SAAY,0BAA0B;AACnE,aAAO,MAAM,SAAS,YAAY,gBAAgBD,SAAQ,OAAO,MAC5DC,cAAa,UAAa,gBAAgBA,WAAU,4BAA4B,KACjF,CAACD,SAAQ,IAAI,IACb,CAACA,OAAM;AAAA,IACb;AACA,QAAI,MAAM,SAAS,SAAU,QAAO;AAEpC,UAAM,QAAyB,CAAC;AAChC,UAAM,OAAO,QAAQ,CAAC,OAAO,UAAU;AACrC,YAAM,WAAW,aAAa,OAAO,MAAM,CAAC,GAAG,MAAM,UAAU,KAAK,CAAC;AACrE,UAAI,aAAa,OAAW,OAAM,KAAK,SAAS,CAAC,CAAC;AAAA,IACpD,CAAC;AACD,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,UAAM,WAAW,oBAAoB,MAAM,WAAW;AACtD,WAAO,CAAC,aAAa,SAAY,EAAE,MAAM,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;AAAA,EACrE;AAEA,QAAM,QAAQ,CAAC,gBAAgC,SAAyB;AACtE,QAAI,eAAe,SAAS,aAAa;AACvC,aAAO,EAAE,MAAM,oBAAoB,kBAAkB,eAAe,MAAM,IAAI,CAAC,EAAE;AAAA,IACnF;AACA,UAAM,SAAS,wBAAwB,IAAI,cAAc;AACzD,QAAI,WAAW,OAAW,QAAO;AAEjC,QAAI,SAAS,GAAG,gBAAgB,IAAI;AACpC,UAAM,WAAW,oBAAoB,eAAe,WAAW;AAC/D,QAAI,aAAa,OAAW,UAAS,EAAE,GAAG,QAAQ,GAAG,SAAS;AAC9D,mBAAe,OAAO,QAAQ,CAAC,OAAO,UAAU;AAC9C,YAAM,WAAW;AAAA,QACf;AAAA,QACA,iBAAiB,OAAO,MAAM,CAAC,IAAI,OAAO,MAAM,IAAI;AAAA,QACpD,CAAC,GAAG,MAAM,UAAU,KAAK;AAAA,MAC3B;AACA,UAAI,aAAa,OAAW,UAAS,iBAAiB,QAAQ,GAAG,QAAQ;AAAA,IAC3E,CAAC;AACD,4BAAwB,IAAI,gBAAgB,MAAM;AAClD,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,CAAC,UAAoB,gBAAsE;AAC3G,UAAM,WAAW,oBAAoB,WAAW;AAChD,WAAO,aAAa,SAAY,WAAW,iBAAiB,UAAU,QAAQ;AAAA,EAChF;AAEA,QAAM,KAAK,CAAC,gBAAyE,SAAyB;AAC5G,YAAQ,eAAe,MAAM;AAAA,MAC3B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,eAAO,CAAC;AAAA,MACV,KAAK;AACH,eAAO,EAAE,OAAO,CAAC,EAAE,MAAM,SAAS,GAAG,EAAE,MAAM,QAAQ,CAAC,EAAE;AAAA,MAC1D,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,eAAO,EAAE,MAAM,OAAO;AAAA,MACxB,KAAK;AACH,eAAO,EAAE,MAAM,UAAU,OAAO,CAAC,EAAE,SAAS,cAAc,CAAC,EAAE;AAAA,MAC/D,KAAK;AACH,eAAO,EAAE,MAAM,UAAU,OAAO,CAAC,EAAE,SAAS,cAAc,CAAC,EAAE;AAAA,MAC/D,KAAK;AACH,eAAO,OAAO,OAAO,eAAe,MAAM,MAAM,SAC5C,EAAE,KAAK,CAAC,EAAE,IACV,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,eAAe,MAAM,CAAC,EAAE;AAAA,MAC9D,KAAK;AACH,eAAO,MAAM,eAAe,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;AAAA,MACvD,KAAK;AACH,eAAO,EAAE,KAAK,CAAC,EAAE;AAAA,MACnB,KAAK;AACH,eAAO,EAAE,MAAM,SAAS;AAAA,MAC1B,KAAK;AACH,eAAO,EAAE,OAAO,CAAC,EAAE,MAAM,SAAS,GAAG,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,YAAY,WAAW,EAAE,CAAC,EAAE;AAAA,MACnG,KAAK;AACH,eAAO,EAAE,MAAM,UAAU;AAAA,MAC3B,KAAK,WAAW;AACd,cAAM,UAAU,eAAe;AAC/B,eAAO,OAAO,YAAY,WACtB,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,OAAO,CAAC,EAAE,IAC1C,EAAE,MAAM,OAAO,SAAS,MAAM,CAAC,OAAO,EAAE;AAAA,MAC9C;AAAA,MACA,KAAK,QAAQ;AACX,cAAM,QAAQ,eAAe,MAAM,IAAI,CAAC,CAAC,OAAO,OAAO,GAAG,UAAU;AAClE,cAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAAG;AAC5D,kBAAM,QAAQ,8BAA8B,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC,CAAC;AAAA,UAC7F;AACA,iBAAO,EAAE,MAAM,OAAO,SAAS,MAAM,CAAC,OAAO,GAAG,MAAM;AAAA,QACxD,CAAC;AACD,eAAO,MAAM,WAAW,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,OAAO,MAAM;AAAA,MAC3D;AAAA,MACA,KAAK;AACH,eAAO,EAAE,MAAM,UAAU,SAAS,IAAI,eAAe,MAAM,IAAI,WAAW,EAAE,KAAK,EAAE,CAAC,IAAI;AAAA,MAC1F,KAAK,UAAU;AACb,cAAM,OAAO,eAAe,KAAK,CAAC;AAClC,YAAI,eAAe,KAAK,SAAS,GAAG;AAClC,gBAAM,QAAQ,0CAA0C,CAAC,GAAG,MAAM,MAAM,CAAC;AAAA,QAC3E;AACA,cAAM,MAAgB,EAAE,MAAM,QAAQ;AACtC,YAAI,WAAW,eAAe,SAAS;AACvC,cAAM,cAAc,eAAe,SAAS,IAAI,CAAC,SAAS,UAAU;AAClE,cAAI,QAAQ,WAAY;AACxB,iBAAO,UAAU,MAAM,QAAQ,MAAM,CAAC,GAAG,MAAM,YAAY,OAAO,MAAM,CAAC,GAAG,QAAQ,WAAW;AAAA,QACjG,CAAC;AACD,YAAI,YAAY,SAAS,GAAG;AAC1B,cAAI,aAAa,IAAI;AACrB,cAAI,UAAU,IAAI,eAAe,SAAS;AAC1C,cAAI,WAAW,EAAG,KAAI,UAAU,IAAI;AAAA,QACtC,OAAO;AACL,cAAI,OAAO,IAAI;AAAA,QACjB;AACA,YAAI,SAAS,QAAW;AACtB,iBAAO,IAAI,UAAU;AACrB,gBAAM,QAAQ,MAAM,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC;AAC9C,cAAI,OAAO,KAAK,KAAK,EAAE,SAAS,EAAG,KAAI,OAAO,IAAI;AAAA,cAC7C,QAAO,IAAI,OAAO;AAAA,QACzB;AACA,eAAO;AAAA,MACT;AAAA,MACA,KAAK,WAAW;AACd,YAAI,eAAe,mBAAmB,WAAW,KAAK,eAAe,gBAAgB,WAAW,GAAG;AACjG,iBAAO,EAAE,KAAK,EAAE,MAAM,OAAO,EAAE;AAAA,QACjC;AACA,cAAM,MAAgB,EAAE,MAAM,SAAS;AACvC,cAAM,aAAuC,CAAC;AAC9C,cAAM,WAA0B,CAAC;AACjC,uBAAe,mBAAmB,QAAQ,CAAC,UAAU,UAAU;AAC7D,gBAAM,OAAO,SAAS;AACtB,cAAI,OAAO,SAAS,UAAU;AAC5B,kBAAM,QAAQ,0CAA0C,CAAC,GAAG,MAAM,sBAAsB,OAAO,MAAM,CAAC;AAAA,UACxG;AACA;AAAA,YACE;AAAA,YACA;AAAA,YACA,UAAU,MAAM,SAAS,MAAM,CAAC,GAAG,MAAM,sBAAsB,OAAO,MAAM,CAAC,GAAG,SAAS,WAAW;AAAA,UACtG;AACA,cAAI,CAAC,SAAS,WAAY,UAAS,KAAK,IAAI;AAAA,QAC9C,CAAC;AACD,YAAI,eAAe,mBAAmB,SAAS,EAAG,KAAI,YAAY,IAAI;AACtE,YAAI,SAAS,SAAS,EAAG,KAAI,UAAU,IAAI;AAC3C,cAAM,oBAAsD,CAAC;AAC7D,cAAM,4BAAqD,CAAC;AAC5D,cAAM,oBAA6C,CAAC;AACpD,YAAI,iCAAiC;AACrC,uBAAe,gBAAgB,QAAQ,CAAC,WAAW,UAAU;AAC3D,gBAAM,WAAW,MAAM,UAAU,MAAM,CAAC,GAAG,MAAM,mBAAmB,OAAO,MAAM,CAAC;AAClF,gBAAM,OAAO,SAAS,UAAU,WAAW,IAAI,QAAQ;AACvD,4BAAkB,KAAK,IAAI;AAC3B,gBAAM,WAAW;AAAA,YACf,UAAU;AAAA,YACV,CAAC,GAAG,MAAM,mBAAmB,OAAO,WAAW;AAAA,YAC/C,oBAAI,IAAI;AAAA,UACV;AACA,cAAI,aAAa,QAAW;AAC1B,6CAAiC;AAAA,UACnC,WAAW,SAAS,WAAW,GAAG;AAChC,sCAA0B,KAAK,IAAI;AAAA,UACrC,OAAO;AACL,uBAAW,OAAO,UAAU;AAC1B,oBAAM,WAAW,OAAO,OAAO,mBAAmB,GAAG,IAAI,kBAAkB,GAAG,IAAI;AAClF;AAAA,gBACE;AAAA,gBACA;AAAA,gBACA,aAAa,SACT,OACA,aAAa,SAAS,SAAS,QAC/B,QACA,iBAAiB,UAAU,IAAI;AAAA,cACrC;AAAA,YACF;AAAA,UACF;AAAA,QACF,CAAC;AACD,cAAM,uBAAuB,OAAO,KAAK,iBAAiB,EAAE,SAAS;AACrE,YAAI,qBAAsB,KAAI,mBAAmB,IAAI;AACrD,cAAM,aAAa,0BAA0B,IAAI,CAAC,UAAU,EAAE,MAAM,UAAU,sBAAsB,KAAK,EAAE;AAC3G,YAAI,kCAAkC,QAAQ;AAC5C,gBAAM,gBAAiC,CAAC;AACxC,cAAI,eAAe,mBAAmB,SAAS,EAAG,eAAc,KAAK,EAAE,MAAM,OAAO,KAAK,UAAU,EAAE,CAAC;AACtG,yBAAe,gBAAgB,QAAQ,CAAC,WAAW,UAAU;AAC3D,0BAAc,KAAK,MAAM,UAAU,WAAW,CAAC,GAAG,MAAM,mBAAmB,OAAO,WAAW,CAAC,CAAC;AAAA,UACjG,CAAC;AACD,cAAI,eAAe,IAAI,cAAc,WAAW,IAAI,cAAc,CAAC,IAAI,EAAE,OAAO,cAAc;AAC9F,cAAI,sBAAsB,IAAI,kBAAkB,WAAW,IACvD,kBAAkB,CAAC,IACnB,EAAE,OAAO,kBAAkB;AAC/B,cAAI,WAAW,SAAS,EAAG,KAAI,OAAO,IAAI;AAAA,QAC5C,WAAW,WAAW,WAAW,GAAG;AAClC,cAAI,sBAAsB,IAAI,kCAAkC,CAAC;AAAA,QACnE,WACE,0BAA0B,WAAW,KAAK,eAAe,mBAAmB,WAAW,KACvF,CAAC,sBACD;AACA,cAAI,sBAAsB,IAAI,0BAA0B,CAAC;AAAA,QAC3D,OAAO;AACL,cAAI,OAAO,IAAI;AAAA,QACjB;AACA,cAAM,uBAAuB,IAAI,sBAAsB;AACvD,YAAI,SAAS,oBAAoB,KAAK,OAAO,KAAK,oBAAoB,EAAE,WAAW,GAAG;AACpF,iBAAO,IAAI,sBAAsB;AAAA,QACnC;AACA,eAAO;AAAA,MACT;AAAA,MACA,KAAK,SAAS;AACZ,cAAM,QAAQ,eAAe,MAAM,IAAI,CAAC,MAAM,UAAU,MAAM,MAAM,CAAC,GAAG,MAAM,SAAS,KAAK,CAAC,CAAC;AAC9F,YAAI,MAAM,WAAW,EAAG,QAAO,EAAE,KAAK,CAAC,EAAE;AACzC,cAAM,OAAO,eAAe,SAAS,QAAQ;AAC7C,YAAI,SAAS,WAAW,MAAM,SAAS,GAAG;AACxC,gBAAM,YAAY,aAAa,KAAK;AACpC,cAAI,cAAc,OAAW,QAAO;AAAA,QACtC;AACA,eAAO,SAAS,UAAU,EAAE,OAAO,MAAM,IAAI,EAAE,OAAO,MAAM;AAAA,MAC9D;AAAA,MACA;AACE,eAAO,YAAY,gBAAgB,IAAI;AAAA,IAC3C;AAAA,EACF;AAEA,QAAM,oBAAoB,CACxB,WACA,MACA,mBACsC;AACtC,YAAQ,UAAU,MAAM;AAAA,MACtB,KAAK,aAAa;AAChB,cAAM,SAAS,OAAO,OAAO,YAAY,UAAU,IAAI,IAAI,WAAW,UAAU,IAAI,IAAI;AACxF,YAAI,WAAW,OAAW,OAAM,QAAQ,qBAAqB,UAAU,IAAI,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC;AAChG,0BAAkB,UAAU,MAAM,IAAI;AACtC,YAAI,eAAe,IAAI,UAAU,IAAI,EAAG,QAAO;AAC/C,eAAO,kBAAkB,QAAQ,CAAC,cAAc,UAAU,IAAI,GAAG,IAAI,IAAI,cAAc,EAAE,IAAI,UAAU,IAAI,CAAC;AAAA,MAC9G;AAAA,MACA,KAAK,UAAU;AACb,cAAM,QAAQ,UAAU,OAAO,CAAC;AAChC,YAAI,UAAU,OAAW,QAAO,CAAC;AACjC,YAAI,UAAU,OAAO,WAAW,KAAK,MAAM,SAAS,YAAY,eAAe,KAAK,MAAM,QAAW;AACnG,iBAAO;AAAA,QACT;AACA,cAAMA,UAAS,MAAM,WAAW,IAAI;AACpC,cAAM,MAAMA,QAAO,SAAS;AAC5B,eAAOA,QAAO,MAAM,MAAM,YAAY,OAAO,QAAQ,YACjD,gBAAgBA,SAAQ,sEAAsE,IAC9F,CAAC,GAAG,IACJ;AAAA,MACN;AAAA,MACA,KAAK;AACH,eAAO,UAAU,OAAO,WAAW,IAAI,CAAC,IAAI,UAAU,MAAM,IAAI,WAAW,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;AAAA,MAC9F,KAAK,SAAS;AACZ,YAAI,UAAU,MAAM,WAAW,KAAK,UAAU,OAAO,SAAS,KAAK,UAAU,SAAS,SAAS,SAAS;AACtG,iBAAO;AAAA,QACT;AACA,cAAM,WAA0B,CAAC;AACjC,mBAAW,CAAC,OAAO,MAAM,KAAK,UAAU,MAAM,QAAQ,GAAG;AACvD,gBAAM,iBAAiB,kBAAkB,QAAQ,CAAC,GAAG,MAAM,SAAS,KAAK,GAAG,cAAc;AAC1F,cAAI,mBAAmB,OAAW,QAAO;AACzC,cAAI,eAAe,WAAW,EAAG,QAAO,CAAC;AACzC,mBAAS,KAAK,GAAG,cAAc;AAAA,QACjC;AACA,eAAO;AAAA,MACT;AAAA,MACA;AACE,cAAM,QAAQ,0CAA0C,IAAI;AAAA,IAChE;AAAA,EACF;AAEA,QAAM,gBAAgB,OAAO,KAAK,UAAU;AAC5C,aAAW,OAAO,cAAe,mBAAkB,KAAK,CAAC,cAAc,GAAG,CAAC;AAC3E,QAAM,SAAS,SAAS,MAAM,SAAS,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;AAC1E,QAAM,cAAwC,CAAC;AAC/C,aAAW,OAAO,eAAe;AAC/B,UAAM,WAAW,iBAAiB,IAAI,GAAG;AACzC,QAAI,SAAS,QAAQ,EAAG,gBAAe,aAAa,KAAK,SAAS,QAAQ,CAAC;AAAA,EAC7E;AACA,SAAO,EAAE,SAAS,iBAAiB,QAAQ,YAAY;AACzD;AAeO,MAAM,iBAAiB,CAAC,QAAoB,YACjD,mBAAmB,OAAO,iBAAiB,OAAO,YAAY,MAAM,CAAC,GAAG,OAAO;AASjF,MAAM,gBAA6C,oBAAI,IAAI;AAAA,EACzD,CAAC,gCAAgC,4BAA4B;AAAA,EAC7D,CAAC,8BAA8B,0BAA0B;AAAA,EACzD,CAAC,6BAA6B,0BAA0B;AAAA,EACxD,CAAC,iCAAiC,+BAA+B;AAAA,EACjE,CAAC,+BAA+B,6BAA6B;AAAA,EAC7D,CAAC,qCAAqC,yCAAyC;AACjF,CAAC;AAWD,MAAM,oBAAoB,CAAC,OAAoB,UAAU,UAAuB;AAC9E,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,WAAW,kBAAkB,QAAQ,OAAO,CAAC;AACzF,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,MAAmC,CAAC;AAC1C,aAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,KAA8C,GAAG;AAC1F,QAAI,QAAQ,iBAAiB,QAAQ,WAAW;AAC9C,qBAAe,KAAK,KAAK,MAAM;AAC/B;AAAA,IACF;AACA,UAAM,UAAU,WAAW,QAAQ,oBAAoB,SAAS,MAAM,KAAK,OAAO,OAAO,IAAI,MAAM,WAC/F,cAAc,IAAI,OAAO,IAAI,CAAC,IAC9B;AACJ;AAAA,MACE;AAAA,MACA;AAAA,MACA,YAAY,SACR,kBAAkB,QAAQ,QAAQ,QAAQ,IAC1C,kBAAkB,EAAE,GAAI,QAAkD,IAAI,QAAQ,CAAC;AAAA,IAC7F;AAAA,EACF;AACA,SAAO;AACT;AAoBO,MAAM,yBAAyB,CAAC,QACrC,kBAAkB,qBAAqB,OAAO,qBAAqB,iBAAiB,GAAG,CAAC,CAAC;",
+  "names": ["schema", "ordinary"]
+}

package/dist/cjs/internal/effects.d.ts

@@ -0,0 +1,245 @@
+/**
+ * Path indexing shared by effect matching and the graph's write-conflict pass.
+ *
+ * The pattern grammar is exhaustive: an entry ending in `*` matches by string
+ * prefix and every other entry matches itself alone. Every path is read a
+ * bounded number of times: once to look for a dot segment, once to detect a
+ * pattern, and once per comparison a binary search needs while the distinct
+ * paths are sorted and each pattern's prefix is located. After that a path is
+ * an integer rank and every match is an integer comparison, so matching two
+ * declarations costs their combined length plus the matches, whatever the
+ * paths' lengths or how many patterns nest. An envelope is prepared once for
+ * every step it encloses: its exact entries go into a set and its covering
+ * patterns collapse to disjoint sorted prefixes, so a step path costs one
+ * lookup and one binary search however wide the envelope is.
+ *
+ * Governing contract: `packages/smithers/flows/plan/docs/api.md`, published as
+ * https://smithers.sh/docs/reference/api/plan.
+ *
+ * @since 1.0.0-rc.0
+ */
+import type * as Effects from "../Effects.ts";
+/**
+ * Whether `path` contains a whole `.` or `..` segment.
+ *
+ * A path with no `.` costs one native search. Otherwise the segments from the
+ * one holding the first `.` onward are scanned once, without allocating.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const hasDotSegment: (path: string) => boolean;
+/**
+ * Whether an entry is a pattern: only a trailing `*` makes one.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const isGlob: (entry: string) => boolean;
+/**
+ * The string prefix a pattern matches by: everything for `*` and `**`,
+ * `prefix/` for `prefix/**`, and `prefix` for `prefix*`.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const globPrefix: (glob: string) => string;
+/**
+ * The distinct paths of one or more declarations in code-unit order, with
+ * what matching needs to know about each: its rank, whether it carries a dot
+ * segment, whether it is a pattern that can cover anything, and for such a
+ * pattern the rank interval its prefix covers.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export interface PathIndex {
+    readonly paths: ReadonlyArray<string>;
+    readonly rank: ReadonlyMap<string, number>;
+    readonly dotted: Uint8Array;
+    readonly glob: Uint8Array;
+    readonly low: Int32Array;
+    readonly high: Int32Array;
+}
+/**
+ * Indexes the union of the given path lists.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const indexPaths: (lists: Iterable<ReadonlyArray<string>>) => PathIndex;
+/**
+ * One declaration's paths as ranks of a {@link PathIndex}: every path in
+ * ascending rank order, and the patterns whose prefix intervals are not
+ * contained in another of the declaration's patterns. Those intervals are
+ * disjoint and ascending, so enumerating them visits each covered rank once.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export interface Ranked {
+    readonly ranks: Int32Array;
+    readonly globs: Int32Array;
+}
+/**
+ * Ranks a declaration's paths against an index that contains them.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const rankPaths: (index: PathIndex, paths: ReadonlyArray<string>) => Ranked;
+/**
+ * The ranks of the paths two write declarations share, ascending: a path of
+ * `b` that `a` names or covers, and a path of `a` that `b` covers unless it is
+ * the same pattern or itself covers that pattern. This is the pairwise
+ * definition, exact paths matched through the merge of two sorted rank lists
+ * and each covering pattern enumerating the ranks of the other declaration
+ * inside its interval. Each of the three passes yields an ascending list, so
+ * the result is their merge and no sort is needed.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const overlapRanks: (index: PathIndex, a: Ranked, b: Ranked) => Array<number>;
+/**
+ * One envelope list prepared for repeated coverage checks: its distinct
+ * entries, matched exactly through a set, and the prefixes of its covering
+ * patterns with every pattern nested under another collapsed into the
+ * outermost. The kept prefixes are disjoint and sorted, so the only prefix
+ * that can cover a path is the greatest one not greater than the path, and
+ * one binary search finds it.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export interface Prepared {
+    readonly exact: ReadonlySet<string>;
+    readonly prefixes: ReadonlyArray<string>;
+}
+/**
+ * Prepares one envelope list. Each entry is read a bounded number of times:
+ * once into the set, once to detect a pattern, and for a pattern once to take
+ * its prefix and once to test that prefix for a dot segment, plus the
+ * comparisons that sort the prefixes and one prefix comparison that collapses
+ * a nested one.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const prepare: (paths: ReadonlyArray<string>) => Prepared;
+/**
+ * Whether a prepared list names or covers `path`. A path carrying a dot
+ * segment is never covered, so the path is scanned once for one and, when
+ * clean, looked up once and compared against at most one prefix.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const covered: (prepared: Prepared, path: string) => boolean;
+/**
+ * The fields of a declaration that narrowing reads. Structural, so this module
+ * needs nothing from the public module built on it.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export interface DeclarationLike {
+    readonly reads: ReadonlyArray<string>;
+    readonly writes: ReadonlyArray<string>;
+    readonly mode: Effects.Mode;
+    readonly tier?: Effects.Tier | undefined;
+}
+/**
+ * An envelope prepared once for every step it encloses.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export interface PreparedEnvelope {
+    readonly reads: Prepared;
+    readonly writes: Prepared;
+    readonly mode: Effects.Mode;
+    readonly tier: Effects.Tier;
+}
+/**
+ * The outcome of narrowing a step against a prepared envelope, shaped as the
+ * public `NarrowResult`.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export type NarrowOutcome = Effects.NarrowResult;
+/**
+ * Prepares both lists of an envelope.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const prepareEnvelope: (envelope: DeclarationLike) => PreparedEnvelope;
+/**
+ * Verifies that a step stays within a prepared envelope: every read and write
+ * path must be covered by the matching list, the mode may only tighten, and
+ * the tier may only narrow. Each step path costs one coverage check.
+ *
+ * @since 1.0.0-rc.0
+ * @private
+ */
+export declare const narrowPrepared: (envelope: PreparedEnvelope, step: DeclarationLike) => NarrowOutcome;
+/**
+ * Maximum length, in UTF-16 code units, of one effect path a graph build
+ * admits before it refuses the plan as too large. 4096 is `PATH_MAX`
+ * on Linux, the longest path a supported host can open, so no path that names
+ * a file is refused. Every per-character cost of a build is bounded by it:
+ * the one dot-segment scan each path gets, the comparisons that sort the
+ * distinct paths, and the comparisons that locate each pattern's prefix. The
+ * length is read before any character is, so an over-long path costs one
+ * property read.
+ *
+ * @category limits
+ * @since 1.0.0-rc.0
+ */
+export declare const maximumPathLength = 4096;
+/**
+ * Maximum number of patterns, entries ending in `*`, one read list or one
+ * write list of an effect declaration may carry before a graph build refuses
+ * the plan as too large. A pattern never costs a match more than a
+ * literal path does: its prefix is located once by binary search, patterns
+ * nested under another collapse into the outermost before the paths they
+ * cover are enumerated, and every match after that is an integer comparison.
+ * What a pattern costs beyond a literal is that search, two binary searches
+ * of at most 16 comparisons each over a plan at the builder's plan-wide path
+ * ceiling,
+ * every comparison reading up to {@link maximumPathLength} code units.
+ * 128 keeps that term, 4,096 comparisons per list, below the sort that admits
+ * a per-declaration list of literal paths, while still letting one
+ * declaration name a subtree per package of a large monorepo. The count is
+ * read from the last character of each path as it is admitted, so a pattern
+ * past the limit costs one character read.
+ *
+ * @category limits
+ * @since 1.0.0-rc.0
+ */
+export declare const maximumGlobs = 128;
+/**
+ * Copies one declaration's paths, refusing before the copy grows past
+ * `limit`. A real array is refused by its length before a member is read; any
+ * other iterable is copied one path at a time and refused as soon as it
+ * exceeds the limit, so a caller-assembled declaration cannot dodge the bound
+ * by hiding its size from `length`. Each path is then refused by its length
+ * before any character is read, and by the count of patterns the list has
+ * carried so far, so an over-long path or a pattern past the limit costs one
+ * property read.
+ *
+ * @private
+ * @since 1.0.0-rc.0
+ */
+export declare const copyPaths: (paths: ReadonlyArray<string>, limit: number, refuse: () => Error) => Array<string>;
+/**
+ * Snapshots a declaration into graph-owned data, copying at most `limit`
+ * paths in total across its reads and writes.
+ *
+ * @private
+ * @since 1.0.0-rc.0
+ */
+export declare const boundedEffects: (declaration: Effects.Declaration, limit: number, refuse: () => Error) => Effects.Declaration;
+//# sourceMappingURL=effects.d.ts.map

package/dist/cjs/internal/effects.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"effects.d.ts","sourceRoot":"","sources":["../../../src/internal/effects.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,KAAK,OAAO,MAAM,eAAe,CAAA;AAM7C;;;;;;;;GAQG;AACH,eAAO,MAAM,aAAa,GAAI,MAAM,MAAM,KAAG,OAc5C,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,MAAM,GAAI,OAAO,MAAM,KAAG,OAAsD,CAAA;AAE7F;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,GAAI,MAAM,MAAM,KAAG,MACyD,CAAA;AAqDnG;;;;;;;;GAQG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC1C,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAA;IACxB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;CAC1B;AAED;;;;;GAKG;AACH,eAAO,MAAM,UAAU,GAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,KAAG,SAyBnE,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;CAC3B;AAED;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,OAAO,SAAS,EAAE,OAAO,aAAa,CAAC,MAAM,CAAC,KAAG,MAoB1E,CAAA;AA4CD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,YAAY,GAAI,OAAO,SAAS,EAAE,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,KAAK,CAAC,MAAM,CAyBjF,CAAA;AAiBD;;;;;;;;;;GAUG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,CAAA;IACnC,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACzC;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,OAAO,GAAI,OAAO,aAAa,CAAC,MAAM,CAAC,KAAG,QAiBtD,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,GAAI,UAAU,QAAQ,EAAE,MAAM,MAAM,KAAG,OAK1D,CAAA;AAED;;;;;;GAMG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACtC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAA;IAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,GAAG,SAAS,CAAA;CACzC;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAA;IACxB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAA;CAC5B;AAED;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,GAAG,OAAO,CAAC,YAAY,CAAA;AAEhD;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAAI,UAAU,eAAe,KAAG,gBAK1D,CAAA;AAOF;;;;;;;GAOG;AACH,eAAO,MAAM,cAAc,GAAI,UAAU,gBAAgB,EAAE,MAAM,eAAe,KAAG,aAYlF,CAAA;AAED;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAA;AAErC;;;;;;;;;;;;;;;;;;;GAmBG;AACH,eAAO,MAAM,YAAY,MAAM,CAAA;AAE/B;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,SAAS,GACpB,OAAO,aAAa,CAAC,MAAM,CAAC,EAC5B,OAAO,MAAM,EACb,QAAQ,MAAM,KAAK,KAClB,KAAK,CAAC,MAAM,CAmBd,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GACzB,aAAa,OAAO,CAAC,WAAW,EAChC,OAAO,MAAM,EACb,QAAQ,MAAM,KAAK,KAClB,OAAO,CAAC,WAUV,CAAA"}