@pixerate/editor 0.44.0 → 0.45.0

package/dist/chunk-PQM5W7ZN.js

@@ -0,0 +1,168 @@
+// src/tools/schema.ts
+function typeOf(value) {
+  if (value === null) return "null";
+  if (Array.isArray(value)) return "array";
+  if (typeof value === "number") return Number.isInteger(value) ? "integer" : "number";
+  if (typeof value === "string" || typeof value === "boolean" || typeof value === "object") {
+    return typeof value;
+  }
+  return "undefined";
+}
+function matchesType(value, type) {
+  const actual = typeOf(value);
+  if (type === "number") return actual === "number" || actual === "integer";
+  return actual === type;
+}
+var isEqual = (a, b) => a === b || JSON.stringify(a) === JSON.stringify(b);
+function resolveRef(ref, root) {
+  if (ref === "#") return root;
+  if (!ref.startsWith("#/")) return void 0;
+  let node = root;
+  for (const raw of ref.slice(2).split("/")) {
+    const key = decodeURIComponent(raw).replace(/~1/g, "/").replace(/~0/g, "~");
+    if (!node || typeof node !== "object") return void 0;
+    node = node[key];
+  }
+  return node && typeof node === "object" ? node : void 0;
+}
+var MAX_REF_DEPTH = 32;
+function validateJsonSchema(value, schema, path = "", root = schema, refDepth = 0) {
+  if (!schema || typeof schema !== "object") return [];
+  const errors = [];
+  const at = path || "/";
+  const recurse = (child, childSchema, childPath) => validateJsonSchema(child, childSchema, childPath, root, refDepth);
+  if (typeof schema.$ref === "string") {
+    const target = root ? resolveRef(schema.$ref, root) : void 0;
+    if (!target) {
+      errors.push({ path: at, message: `Unresolvable schema reference ${schema.$ref}.` });
+    } else if (refDepth >= MAX_REF_DEPTH) {
+      errors.push({ path: at, message: `Schema reference ${schema.$ref} is nested too deeply.` });
+    } else {
+      errors.push(...validateJsonSchema(value, target, path, root, refDepth + 1));
+    }
+  }
+  if (schema.allOf) {
+    for (const branch of schema.allOf) errors.push(...recurse(value, branch, path));
+  }
+  if (schema.anyOf || schema.oneOf) {
+    const branches = schema.anyOf ?? schema.oneOf;
+    const results = branches.map((branch) => recurse(value, branch, path));
+    const matching = results.filter((r) => r.length === 0).length;
+    if (matching === 0 && results.length > 0) {
+      const closest = results.reduce((best, r) => r.length < best.length ? r : best);
+      errors.push(
+        { path: at, message: `Does not match any allowed shape (${branches.length} options); closest match failed with:` },
+        ...closest
+      );
+    } else if (schema.oneOf && !schema.anyOf && matching > 1) {
+      errors.push({ path: at, message: `Matches ${matching} shapes; exactly one is allowed.` });
+    }
+  }
+  if (schema.not && recurse(value, schema.not, path).length === 0) {
+    errors.push({ path: at, message: "Matches a disallowed shape." });
+  }
+  if (schema.type !== void 0) {
+    const types = Array.isArray(schema.type) ? schema.type : [schema.type];
+    if (!types.some((t) => matchesType(value, t))) {
+      errors.push({ path: at, message: `Expected ${types.join(" | ")}, got ${typeOf(value)}.` });
+      return errors;
+    }
+  }
+  if (schema.const !== void 0 && !isEqual(value, schema.const)) {
+    errors.push({ path: at, message: `Expected ${JSON.stringify(schema.const)}.` });
+  }
+  if (schema.enum && !schema.enum.some((option) => isEqual(value, option))) {
+    errors.push({
+      path: at,
+      message: `Expected one of ${schema.enum.map((o) => JSON.stringify(o)).join(", ")}, got ${JSON.stringify(value)}.`
+    });
+  }
+  if (typeof value === "string") {
+    if (schema.minLength !== void 0 && value.length < schema.minLength) {
+      errors.push({ path: at, message: `Must be at least ${schema.minLength} characters.` });
+    }
+    if (schema.maxLength !== void 0 && value.length > schema.maxLength) {
+      errors.push({ path: at, message: `Must be at most ${schema.maxLength} characters.` });
+    }
+    if (schema.pattern !== void 0) {
+      let regex = null;
+      try {
+        regex = new RegExp(schema.pattern, "u");
+      } catch {
+      }
+      if (regex && !regex.test(value)) {
+        errors.push({ path: at, message: `Must match pattern ${schema.pattern}.` });
+      }
+    }
+  }
+  if (typeof value === "number") {
+    if (schema.minimum !== void 0 && value < schema.minimum) {
+      errors.push({ path: at, message: `Must be >= ${schema.minimum}.` });
+    }
+    if (schema.maximum !== void 0 && value > schema.maximum) {
+      errors.push({ path: at, message: `Must be <= ${schema.maximum}.` });
+    }
+    if (typeof schema.exclusiveMinimum === "number" && value <= schema.exclusiveMinimum) {
+      errors.push({ path: at, message: `Must be > ${schema.exclusiveMinimum}.` });
+    }
+    if (typeof schema.exclusiveMaximum === "number" && value >= schema.exclusiveMaximum) {
+      errors.push({ path: at, message: `Must be < ${schema.exclusiveMaximum}.` });
+    }
+    if (schema.multipleOf !== void 0 && schema.multipleOf > 0) {
+      const quotient = value / schema.multipleOf;
+      if (Math.abs(quotient - Math.round(quotient)) > 1e-9) {
+        errors.push({ path: at, message: `Must be a multiple of ${schema.multipleOf}.` });
+      }
+    }
+  }
+  if (Array.isArray(value)) {
+    if (schema.minItems !== void 0 && value.length < schema.minItems) {
+      errors.push({ path: at, message: `Must have at least ${schema.minItems} items.` });
+    }
+    if (schema.maxItems !== void 0 && value.length > schema.maxItems) {
+      errors.push({ path: at, message: `Must have at most ${schema.maxItems} items.` });
+    }
+    if (schema.uniqueItems) {
+      const seen = /* @__PURE__ */ new Set();
+      value.forEach((item, index) => {
+        const key = JSON.stringify(item);
+        if (seen.has(key)) errors.push({ path: `${path}/${index}`, message: "Duplicate item; items must be unique." });
+        seen.add(key);
+      });
+    }
+    if (schema.items) {
+      value.forEach((item, index) => {
+        errors.push(...recurse(item, schema.items, `${path}/${index}`));
+      });
+    }
+  }
+  if (typeOf(value) === "object") {
+    const obj = value;
+    for (const key of schema.required ?? []) {
+      if (obj[key] === void 0) {
+        errors.push({ path: `${path}/${key}`, message: `Missing required property "${key}".` });
+      }
+    }
+    const properties = schema.properties ?? {};
+    for (const [key, child] of Object.entries(obj)) {
+      if (child === void 0) continue;
+      if (key in properties) {
+        errors.push(...recurse(child, properties[key], `${path}/${key}`));
+      } else if (schema.additionalProperties === false) {
+        const known = Object.keys(properties);
+        errors.push({
+          path: `${path}/${key}`,
+          message: `Unknown property "${key}".${known.length ? ` Allowed: ${known.join(", ")}.` : ""}`
+        });
+      } else if (typeof schema.additionalProperties === "object") {
+        errors.push(...recurse(child, schema.additionalProperties, `${path}/${key}`));
+      }
+    }
+  }
+  return errors;
+}
+
+export {
+  validateJsonSchema
+};
+//# sourceMappingURL=chunk-PQM5W7ZN.js.map

package/dist/chunk-PQM5W7ZN.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/tools/schema.ts"],"sourcesContent":["/**\n * JSON-Schema-lite: the subset of JSON Schema used by MCP tool `inputSchema`s,\n * plus a small validator for tool-call arguments. Unknown keywords are ignored.\n */\nexport type JsonSchemaType = 'string' | 'number' | 'integer' | 'boolean' | 'object' | 'array' | 'null';\n\nexport interface JsonSchema {\n\ttype?: JsonSchemaType | readonly JsonSchemaType[];\n\tdescription?: string;\n\ttitle?: string;\n\tenum?: readonly unknown[];\n\tconst?: unknown;\n\tdefault?: unknown;\n\tproperties?: { readonly [key: string]: JsonSchema };\n\trequired?: readonly string[];\n\tadditionalProperties?: boolean | JsonSchema;\n\titems?: JsonSchema;\n\tminItems?: number;\n\tmaxItems?: number;\n\tminimum?: number;\n\tmaximum?: number;\n\texclusiveMinimum?: number;\n\texclusiveMaximum?: number;\n\tmultipleOf?: number;\n\tuniqueItems?: boolean;\n\tanyOf?: readonly JsonSchema[];\n\toneOf?: readonly JsonSchema[];\n\tallOf?: readonly JsonSchema[];\n\tnot?: JsonSchema;\n\t/** Local reference only: `#`, `#/$defs/<name>` or `#/definitions/<name>`. */\n\t$ref?: string;\n\t$defs?: { readonly [key: string]: JsonSchema };\n\tdefinitions?: { readonly [key: string]: JsonSchema };\n\tminLength?: number;\n\tmaxLength?: number;\n\tpattern?: string;\n\t[keyword: string]: unknown;\n}\n\nexport interface SchemaValidationError {\n\t/** JSON-pointer-like path to the offending value, e.g. `/node/id` (`\"\"` is the root). */\n\tpath: string;\n\tmessage: string;\n}\n\nfunction typeOf(value: unknown): JsonSchemaType | 'undefined' {\n\tif (value === null) return 'null';\n\tif (Array.isArray(value)) return 'array';\n\tif (typeof value === 'number') return Number.isInteger(value) ? 'integer' : 'number';\n\tif (typeof value === 'string' || typeof value === 'boolean' || typeof value === 'object') {\n\t\treturn typeof value as JsonSchemaType;\n\t}\n\treturn 'undefined';\n}\n\nfunction matchesType(value: unknown, type: JsonSchemaType): boolean {\n\tconst actual = typeOf(value);\n\tif (type === 'number') return actual === 'number' || actual === 'integer';\n\treturn actual === type;\n}\n\nconst isEqual = (a: unknown, b: unknown) => a === b || JSON.stringify(a) === JSON.stringify(b);\n\n/** Resolves a local `$ref` (`#`, `#/$defs/a`, `#/definitions/a/properties/b`, ...) against `root`. */\nfunction resolveRef(ref: string, root: JsonSchema): JsonSchema | undefined {\n\tif (ref === '#') return root;\n\tif (!ref.startsWith('#/')) return undefined;\n\tlet node: unknown = root;\n\tfor (const raw of ref.slice(2).split('/')) {\n\t\tconst key = decodeURIComponent(raw).replace(/~1/g, '/').replace(/~0/g, '~');\n\t\tif (!node || typeof node !== 'object') return undefined;\n\t\tnode = (node as Record<string, unknown>)[key];\n\t}\n\treturn node && typeof node === 'object' ? (node as JsonSchema) : undefined;\n}\n\n/** Most `$ref` hops followed before a reference cycle is reported. */\nconst MAX_REF_DEPTH = 32;\n\n/**\n * Validates `value` against `schema` and returns every error found (an empty\n * array means valid). Supports `type` (incl. arrays of types), `enum`, `const`,\n * `properties`, `required`, `additionalProperties`, `items`, `minItems`,\n * `maxItems`, `uniqueItems`, `minimum`, `maximum`, `exclusiveMinimum`,\n * `exclusiveMaximum`, `multipleOf`, `minLength`, `maxLength`, `pattern`,\n * `anyOf`, `oneOf`, `allOf`, `not` and local `$ref`s (`#/$defs/...`).\n * Other keywords (`format`, `if`/`then`, `patternProperties`, remote refs...)\n * are ignored.\n *\n * When no `anyOf` / `oneOf` branch matches, the errors of the closest branch\n * (the one with the fewest errors) are reported, so a caller sees what to fix\n * rather than only \"no branch matched\".\n */\nexport function validateJsonSchema(\n\tvalue: unknown,\n\tschema: JsonSchema | undefined,\n\tpath = '',\n\troot: JsonSchema | undefined = schema,\n\trefDepth = 0\n): SchemaValidationError[] {\n\tif (!schema || typeof schema !== 'object') return [];\n\tconst errors: SchemaValidationError[] = [];\n\tconst at = path || '/';\n\tconst recurse = (child: unknown, childSchema: JsonSchema | undefined, childPath: string) =>\n\t\tvalidateJsonSchema(child, childSchema, childPath, root, refDepth);\n\n\tif (typeof schema.$ref === 'string') {\n\t\tconst target = root ? resolveRef(schema.$ref, root) : undefined;\n\t\tif (!target) {\n\t\t\terrors.push({ path: at, message: `Unresolvable schema reference ${schema.$ref}.` });\n\t\t} else if (refDepth >= MAX_REF_DEPTH) {\n\t\t\terrors.push({ path: at, message: `Schema reference ${schema.$ref} is nested too deeply.` });\n\t\t} else {\n\t\t\terrors.push(...validateJsonSchema(value, target, path, root, refDepth + 1));\n\t\t}\n\t\t// Sibling keywords still apply (2019-09+ semantics).\n\t}\n\n\tif (schema.allOf) {\n\t\tfor (const branch of schema.allOf) errors.push(...recurse(value, branch, path));\n\t}\n\tif (schema.anyOf || schema.oneOf) {\n\t\tconst branches = (schema.anyOf ?? schema.oneOf)!;\n\t\tconst results = branches.map((branch) => recurse(value, branch, path));\n\t\tconst matching = results.filter((r) => r.length === 0).length;\n\t\tif (matching === 0 && results.length > 0) {\n\t\t\tconst closest = results.reduce((best, r) => (r.length < best.length ? r : best));\n\t\t\terrors.push(\n\t\t\t\t{ path: at, message: `Does not match any allowed shape (${branches.length} options); closest match failed with:` },\n\t\t\t\t...closest\n\t\t\t);\n\t\t} else if (schema.oneOf && !schema.anyOf && matching > 1) {\n\t\t\terrors.push({ path: at, message: `Matches ${matching} shapes; exactly one is allowed.` });\n\t\t}\n\t}\n\tif (schema.not && recurse(value, schema.not, path).length === 0) {\n\t\terrors.push({ path: at, message: 'Matches a disallowed shape.' });\n\t}\n\n\tif (schema.type !== undefined) {\n\t\tconst types = (Array.isArray(schema.type) ? schema.type : [schema.type]) as JsonSchemaType[];\n\t\tif (!types.some((t) => matchesType(value, t))) {\n\t\t\terrors.push({ path: at, message: `Expected ${types.join(' | ')}, got ${typeOf(value)}.` });\n\t\t\treturn errors;\n\t\t}\n\t}\n\tif (schema.const !== undefined && !isEqual(value, schema.const)) {\n\t\terrors.push({ path: at, message: `Expected ${JSON.stringify(schema.const)}.` });\n\t}\n\tif (schema.enum && !schema.enum.some((option) => isEqual(value, option))) {\n\t\terrors.push({\n\t\t\tpath: at,\n\t\t\tmessage: `Expected one of ${schema.enum.map((o) => JSON.stringify(o)).join(', ')}, got ${JSON.stringify(value)}.`\n\t\t});\n\t}\n\n\tif (typeof value === 'string') {\n\t\tif (schema.minLength !== undefined && value.length < schema.minLength) {\n\t\t\terrors.push({ path: at, message: `Must be at least ${schema.minLength} characters.` });\n\t\t}\n\t\tif (schema.maxLength !== undefined && value.length > schema.maxLength) {\n\t\t\terrors.push({ path: at, message: `Must be at most ${schema.maxLength} characters.` });\n\t\t}\n\t\tif (schema.pattern !== undefined) {\n\t\t\tlet regex: RegExp | null = null;\n\t\t\ttry {\n\t\t\t\tregex = new RegExp(schema.pattern, 'u');\n\t\t\t} catch {\n\t\t\t\t// An invalid pattern in the schema is not the caller's fault.\n\t\t\t}\n\t\t\tif (regex && !regex.test(value)) {\n\t\t\t\terrors.push({ path: at, message: `Must match pattern ${schema.pattern}.` });\n\t\t\t}\n\t\t}\n\t}\n\n\tif (typeof value === 'number') {\n\t\tif (schema.minimum !== undefined && value < schema.minimum) {\n\t\t\terrors.push({ path: at, message: `Must be >= ${schema.minimum}.` });\n\t\t}\n\t\tif (schema.maximum !== undefined && value > schema.maximum) {\n\t\t\terrors.push({ path: at, message: `Must be <= ${schema.maximum}.` });\n\t\t}\n\t\tif (typeof schema.exclusiveMinimum === 'number' && value <= schema.exclusiveMinimum) {\n\t\t\terrors.push({ path: at, message: `Must be > ${schema.exclusiveMinimum}.` });\n\t\t}\n\t\tif (typeof schema.exclusiveMaximum === 'number' && value >= schema.exclusiveMaximum) {\n\t\t\terrors.push({ path: at, message: `Must be < ${schema.exclusiveMaximum}.` });\n\t\t}\n\t\tif (schema.multipleOf !== undefined && schema.multipleOf > 0) {\n\t\t\tconst quotient = value / schema.multipleOf;\n\t\t\tif (Math.abs(quotient - Math.round(quotient)) > 1e-9) {\n\t\t\t\terrors.push({ path: at, message: `Must be a multiple of ${schema.multipleOf}.` });\n\t\t\t}\n\t\t}\n\t}\n\n\tif (Array.isArray(value)) {\n\t\tif (schema.minItems !== undefined && value.length < schema.minItems) {\n\t\t\terrors.push({ path: at, message: `Must have at least ${schema.minItems} items.` });\n\t\t}\n\t\tif (schema.maxItems !== undefined && value.length > schema.maxItems) {\n\t\t\terrors.push({ path: at, message: `Must have at most ${schema.maxItems} items.` });\n\t\t}\n\t\tif (schema.uniqueItems) {\n\t\t\tconst seen = new Set<string>();\n\t\t\tvalue.forEach((item, index) => {\n\t\t\t\tconst key = JSON.stringify(item);\n\t\t\t\tif (seen.has(key)) errors.push({ path: `${path}/${index}`, message: 'Duplicate item; items must be unique.' });\n\t\t\t\tseen.add(key);\n\t\t\t});\n\t\t}\n\t\tif (schema.items) {\n\t\t\tvalue.forEach((item, index) => {\n\t\t\t\terrors.push(...recurse(item, schema.items, `${path}/${index}`));\n\t\t\t});\n\t\t}\n\t}\n\n\tif (typeOf(value) === 'object') {\n\t\tconst obj = value as Record<string, unknown>;\n\t\tfor (const key of schema.required ?? []) {\n\t\t\tif (obj[key] === undefined) {\n\t\t\t\terrors.push({ path: `${path}/${key}`, message: `Missing required property \"${key}\".` });\n\t\t\t}\n\t\t}\n\t\tconst properties = schema.properties ?? {};\n\t\tfor (const [key, child] of Object.entries(obj)) {\n\t\t\tif (child === undefined) continue;\n\t\t\tif (key in properties) {\n\t\t\t\terrors.push(...recurse(child, properties[key], `${path}/${key}`));\n\t\t\t} else if (schema.additionalProperties === false) {\n\t\t\t\tconst known = Object.keys(properties);\n\t\t\t\terrors.push({\n\t\t\t\t\tpath: `${path}/${key}`,\n\t\t\t\t\tmessage: `Unknown property \"${key}\".${known.length ? ` Allowed: ${known.join(', ')}.` : ''}`\n\t\t\t\t});\n\t\t\t} else if (typeof schema.additionalProperties === 'object') {\n\t\t\t\terrors.push(...recurse(child, schema.additionalProperties, `${path}/${key}`));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn errors;\n}\n"],"mappings":";AA6CA,SAAS,OAAO,OAA8C;AAC7D,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,UAAU,KAAK,IAAI,YAAY;AAC5E,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,OAAO,UAAU,UAAU;AACzF,WAAO,OAAO;AAAA,EACf;AACA,SAAO;AACR;AAEA,SAAS,YAAY,OAAgB,MAA+B;AACnE,QAAM,SAAS,OAAO,KAAK;AAC3B,MAAI,SAAS,SAAU,QAAO,WAAW,YAAY,WAAW;AAChE,SAAO,WAAW;AACnB;AAEA,IAAM,UAAU,CAAC,GAAY,MAAe,MAAM,KAAK,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC;AAG7F,SAAS,WAAW,KAAa,MAA0C;AAC1E,MAAI,QAAQ,IAAK,QAAO;AACxB,MAAI,CAAC,IAAI,WAAW,IAAI,EAAG,QAAO;AAClC,MAAI,OAAgB;AACpB,aAAW,OAAO,IAAI,MAAM,CAAC,EAAE,MAAM,GAAG,GAAG;AAC1C,UAAM,MAAM,mBAAmB,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC1E,QAAI,CAAC,QAAQ,OAAO,SAAS,SAAU,QAAO;AAC9C,WAAQ,KAAiC,GAAG;AAAA,EAC7C;AACA,SAAO,QAAQ,OAAO,SAAS,WAAY,OAAsB;AAClE;AAGA,IAAM,gBAAgB;AAgBf,SAAS,mBACf,OACA,QACA,OAAO,IACP,OAA+B,QAC/B,WAAW,GACe;AAC1B,MAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO,CAAC;AACnD,QAAM,SAAkC,CAAC;AACzC,QAAM,KAAK,QAAQ;AACnB,QAAM,UAAU,CAAC,OAAgB,aAAqC,cACrE,mBAAmB,OAAO,aAAa,WAAW,MAAM,QAAQ;AAEjE,MAAI,OAAO,OAAO,SAAS,UAAU;AACpC,UAAM,SAAS,OAAO,WAAW,OAAO,MAAM,IAAI,IAAI;AACtD,QAAI,CAAC,QAAQ;AACZ,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,iCAAiC,OAAO,IAAI,IAAI,CAAC;AAAA,IACnF,WAAW,YAAY,eAAe;AACrC,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,oBAAoB,OAAO,IAAI,yBAAyB,CAAC;AAAA,IAC3F,OAAO;AACN,aAAO,KAAK,GAAG,mBAAmB,OAAO,QAAQ,MAAM,MAAM,WAAW,CAAC,CAAC;AAAA,IAC3E;AAAA,EAED;AAEA,MAAI,OAAO,OAAO;AACjB,eAAW,UAAU,OAAO,MAAO,QAAO,KAAK,GAAG,QAAQ,OAAO,QAAQ,IAAI,CAAC;AAAA,EAC/E;AACA,MAAI,OAAO,SAAS,OAAO,OAAO;AACjC,UAAM,WAAY,OAAO,SAAS,OAAO;AACzC,UAAM,UAAU,SAAS,IAAI,CAAC,WAAW,QAAQ,OAAO,QAAQ,IAAI,CAAC;AACrE,UAAM,WAAW,QAAQ,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE;AACvD,QAAI,aAAa,KAAK,QAAQ,SAAS,GAAG;AACzC,YAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,MAAO,EAAE,SAAS,KAAK,SAAS,IAAI,IAAK;AAC/E,aAAO;AAAA,QACN,EAAE,MAAM,IAAI,SAAS,qCAAqC,SAAS,MAAM,wCAAwC;AAAA,QACjH,GAAG;AAAA,MACJ;AAAA,IACD,WAAW,OAAO,SAAS,CAAC,OAAO,SAAS,WAAW,GAAG;AACzD,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,WAAW,QAAQ,mCAAmC,CAAC;AAAA,IACzF;AAAA,EACD;AACA,MAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,KAAK,IAAI,EAAE,WAAW,GAAG;AAChE,WAAO,KAAK,EAAE,MAAM,IAAI,SAAS,8BAA8B,CAAC;AAAA,EACjE;AAEA,MAAI,OAAO,SAAS,QAAW;AAC9B,UAAM,QAAS,MAAM,QAAQ,OAAO,IAAI,IAAI,OAAO,OAAO,CAAC,OAAO,IAAI;AACtE,QAAI,CAAC,MAAM,KAAK,CAAC,MAAM,YAAY,OAAO,CAAC,CAAC,GAAG;AAC9C,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,YAAY,MAAM,KAAK,KAAK,CAAC,SAAS,OAAO,KAAK,CAAC,IAAI,CAAC;AACzF,aAAO;AAAA,IACR;AAAA,EACD;AACA,MAAI,OAAO,UAAU,UAAa,CAAC,QAAQ,OAAO,OAAO,KAAK,GAAG;AAChE,WAAO,KAAK,EAAE,MAAM,IAAI,SAAS,YAAY,KAAK,UAAU,OAAO,KAAK,CAAC,IAAI,CAAC;AAAA,EAC/E;AACA,MAAI,OAAO,QAAQ,CAAC,OAAO,KAAK,KAAK,CAAC,WAAW,QAAQ,OAAO,MAAM,CAAC,GAAG;AACzE,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS,mBAAmB,OAAO,KAAK,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC;AAAA,IAC/G,CAAC;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,OAAO,cAAc,UAAa,MAAM,SAAS,OAAO,WAAW;AACtE,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,oBAAoB,OAAO,SAAS,eAAe,CAAC;AAAA,IACtF;AACA,QAAI,OAAO,cAAc,UAAa,MAAM,SAAS,OAAO,WAAW;AACtE,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,mBAAmB,OAAO,SAAS,eAAe,CAAC;AAAA,IACrF;AACA,QAAI,OAAO,YAAY,QAAW;AACjC,UAAI,QAAuB;AAC3B,UAAI;AACH,gBAAQ,IAAI,OAAO,OAAO,SAAS,GAAG;AAAA,MACvC,QAAQ;AAAA,MAER;AACA,UAAI,SAAS,CAAC,MAAM,KAAK,KAAK,GAAG;AAChC,eAAO,KAAK,EAAE,MAAM,IAAI,SAAS,sBAAsB,OAAO,OAAO,IAAI,CAAC;AAAA,MAC3E;AAAA,IACD;AAAA,EACD;AAEA,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,OAAO,YAAY,UAAa,QAAQ,OAAO,SAAS;AAC3D,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,cAAc,OAAO,OAAO,IAAI,CAAC;AAAA,IACnE;AACA,QAAI,OAAO,YAAY,UAAa,QAAQ,OAAO,SAAS;AAC3D,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,cAAc,OAAO,OAAO,IAAI,CAAC;AAAA,IACnE;AACA,QAAI,OAAO,OAAO,qBAAqB,YAAY,SAAS,OAAO,kBAAkB;AACpF,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,aAAa,OAAO,gBAAgB,IAAI,CAAC;AAAA,IAC3E;AACA,QAAI,OAAO,OAAO,qBAAqB,YAAY,SAAS,OAAO,kBAAkB;AACpF,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,aAAa,OAAO,gBAAgB,IAAI,CAAC;AAAA,IAC3E;AACA,QAAI,OAAO,eAAe,UAAa,OAAO,aAAa,GAAG;AAC7D,YAAM,WAAW,QAAQ,OAAO;AAChC,UAAI,KAAK,IAAI,WAAW,KAAK,MAAM,QAAQ,CAAC,IAAI,MAAM;AACrD,eAAO,KAAK,EAAE,MAAM,IAAI,SAAS,yBAAyB,OAAO,UAAU,IAAI,CAAC;AAAA,MACjF;AAAA,IACD;AAAA,EACD;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,QAAI,OAAO,aAAa,UAAa,MAAM,SAAS,OAAO,UAAU;AACpE,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,sBAAsB,OAAO,QAAQ,UAAU,CAAC;AAAA,IAClF;AACA,QAAI,OAAO,aAAa,UAAa,MAAM,SAAS,OAAO,UAAU;AACpE,aAAO,KAAK,EAAE,MAAM,IAAI,SAAS,qBAAqB,OAAO,QAAQ,UAAU,CAAC;AAAA,IACjF;AACA,QAAI,OAAO,aAAa;AACvB,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,QAAQ,CAAC,MAAM,UAAU;AAC9B,cAAM,MAAM,KAAK,UAAU,IAAI;AAC/B,YAAI,KAAK,IAAI,GAAG,EAAG,QAAO,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,IAAI,SAAS,wCAAwC,CAAC;AAC7G,aAAK,IAAI,GAAG;AAAA,MACb,CAAC;AAAA,IACF;AACA,QAAI,OAAO,OAAO;AACjB,YAAM,QAAQ,CAAC,MAAM,UAAU;AAC9B,eAAO,KAAK,GAAG,QAAQ,MAAM,OAAO,OAAO,GAAG,IAAI,IAAI,KAAK,EAAE,CAAC;AAAA,MAC/D,CAAC;AAAA,IACF;AAAA,EACD;AAEA,MAAI,OAAO,KAAK,MAAM,UAAU;AAC/B,UAAM,MAAM;AACZ,eAAW,OAAO,OAAO,YAAY,CAAC,GAAG;AACxC,UAAI,IAAI,GAAG,MAAM,QAAW;AAC3B,eAAO,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,GAAG,IAAI,SAAS,8BAA8B,GAAG,KAAK,CAAC;AAAA,MACvF;AAAA,IACD;AACA,UAAM,aAAa,OAAO,cAAc,CAAC;AACzC,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC/C,UAAI,UAAU,OAAW;AACzB,UAAI,OAAO,YAAY;AACtB,eAAO,KAAK,GAAG,QAAQ,OAAO,WAAW,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;AAAA,MACjE,WAAW,OAAO,yBAAyB,OAAO;AACjD,cAAM,QAAQ,OAAO,KAAK,UAAU;AACpC,eAAO,KAAK;AAAA,UACX,MAAM,GAAG,IAAI,IAAI,GAAG;AAAA,UACpB,SAAS,qBAAqB,GAAG,KAAK,MAAM,SAAS,aAAa,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE;AAAA,QAC3F,CAAC;AAAA,MACF,WAAW,OAAO,OAAO,yBAAyB,UAAU;AAC3D,eAAO,KAAK,GAAG,QAAQ,OAAO,OAAO,sBAAsB,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;AAAA,MAC7E;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AACR;","names":[]}