@decocms/bindings 0.2.4 → 1.0.0

package/dist/core/client/proxy.js

@@ -1,104 +0,0 @@
-import { convertJsonSchemaToZod } from "zod-from-json-schema";
-import { createServerClient } from "./mcp-client";
-const safeParse = (content) => {
-  try {
-    return JSON.parse(content);
-  } catch {
-    return content;
-  }
-};
-const toolsMap = /* @__PURE__ */ new Map();
-function createMCPClientProxy(options) {
-  return new Proxy({}, {
-    get(_, name) {
-      if (name === "toJSON") {
-        return null;
-      }
-      if (typeof name !== "string") {
-        throw new Error("Name must be a string");
-      }
-      async function callToolFn(args) {
-        const debugId = options?.debugId?.();
-        const extraHeaders = debugId ? { "x-trace-debug-id": debugId } : void 0;
-        const { client, callStreamableTool } = await createServerClient(
-          { connection: options.connection },
-          void 0,
-          extraHeaders
-        );
-        if (options?.streamable?.[String(name)]) {
-          return callStreamableTool(String(name), args);
-        }
-        const { structuredContent, isError, content } = await client.callTool(
-          {
-            name: String(name),
-            arguments: args
-          },
-          void 0,
-          {
-            timeout: 3e6
-          }
-        );
-        if (isError) {
-          const maybeErrorMessage = content?.[0]?.text;
-          const error = typeof maybeErrorMessage === "string" ? safeParse(maybeErrorMessage) : null;
-          const throwableError = error?.code && typeof options?.getErrorByStatusCode === "function" ? options.getErrorByStatusCode(
-            error.code,
-            error.message,
-            error.traceId
-          ) : null;
-          if (throwableError) {
-            throw throwableError;
-          }
-          throw new Error(
-            `Tool ${String(name)} returned an error: ${JSON.stringify(
-              structuredContent ?? content
-            )}`
-          );
-        }
-        return structuredContent;
-      }
-      const listToolsFn = async () => {
-        const { client } = await createServerClient({
-          connection: options.connection
-        });
-        const { tools } = await client.listTools();
-        return tools;
-      };
-      async function listToolsOnce() {
-        const conn = options.connection;
-        const key = JSON.stringify(conn);
-        try {
-          if (!toolsMap.has(key)) {
-            toolsMap.set(key, listToolsFn());
-          }
-          return await toolsMap.get(key);
-        } catch (error) {
-          console.error("Failed to list tools", error);
-          toolsMap.delete(key);
-          return;
-        }
-      }
-      callToolFn.asTool = async () => {
-        const tools = await listToolsOnce() ?? [];
-        const tool = tools.find((t) => t.name === name);
-        if (!tool) {
-          throw new Error(`Tool ${name} not found`);
-        }
-        return {
-          ...tool,
-          id: tool.name,
-          inputSchema: tool.inputSchema ? convertJsonSchemaToZod(tool.inputSchema) : void 0,
-          outputSchema: tool.outputSchema ? convertJsonSchemaToZod(tool.outputSchema) : void 0,
-          execute: (input) => {
-            return callToolFn(input.context);
-          }
-        };
-      };
-      return callToolFn;
-    }
-  });
-}
-export {
-  createMCPClientProxy
-};
-//# sourceMappingURL=proxy.js.map

package/dist/core/client/proxy.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../src/core/client/proxy.ts"],"sourcesContent":["/* oxlint-disable no-explicit-any */\nimport { convertJsonSchemaToZod } from \"zod-from-json-schema\";\nimport type { CreateStubAPIOptions } from \"./mcp\";\nimport { createServerClient } from \"./mcp-client\";\n\nconst safeParse = (content: string) => {\n  try {\n    return JSON.parse(content as string);\n  } catch {\n    return content;\n  }\n};\n\nconst toolsMap = new Map<\n  string,\n  Promise<\n    Array<{\n      name: string;\n      inputSchema: any;\n      outputSchema?: any;\n      description: string;\n    }>\n  >\n>();\n\n/**\n * The base fetcher used to fetch the MCP from API.\n */\nexport function createMCPClientProxy<T extends Record<string, unknown>>(\n  options: CreateStubAPIOptions,\n): T {\n  return new Proxy<T>({} as T, {\n    get(_, name) {\n      if (name === \"toJSON\") {\n        return null;\n      }\n      if (typeof name !== \"string\") {\n        throw new Error(\"Name must be a string\");\n      }\n      async function callToolFn(args: unknown) {\n        const debugId = options?.debugId?.();\n        const extraHeaders = debugId\n          ? { \"x-trace-debug-id\": debugId }\n          : undefined;\n\n        const { client, callStreamableTool } = await createServerClient(\n          { connection: options.connection },\n          undefined,\n          extraHeaders,\n        );\n\n        if (options?.streamable?.[String(name)]) {\n          return callStreamableTool(String(name), args);\n        }\n\n        const { structuredContent, isError, content } = await client.callTool(\n          {\n            name: String(name),\n            arguments: args as Record<string, unknown>,\n          },\n          undefined,\n          {\n            timeout: 3000000,\n          },\n        );\n\n        if (isError) {\n          const maybeErrorMessage = (content as { text: string }[])?.[0]?.text;\n          const error =\n            typeof maybeErrorMessage === \"string\"\n              ? safeParse(maybeErrorMessage)\n              : null;\n\n          const throwableError =\n            error?.code && typeof options?.getErrorByStatusCode === \"function\"\n              ? options.getErrorByStatusCode(\n                  error.code,\n                  error.message,\n                  error.traceId,\n                )\n              : null;\n\n          if (throwableError) {\n            throw throwableError;\n          }\n\n          throw new Error(\n            `Tool ${String(name)} returned an error: ${JSON.stringify(\n              structuredContent ?? content,\n            )}`,\n          );\n        }\n        return structuredContent;\n      }\n\n      const listToolsFn = async () => {\n        const { client } = await createServerClient({\n          connection: options.connection,\n        });\n        const { tools } = await client.listTools();\n\n        return tools as {\n          name: string;\n          inputSchema: any;\n          outputSchema?: any;\n          description: string;\n        }[];\n      };\n\n      async function listToolsOnce() {\n        const conn = options.connection;\n        const key = JSON.stringify(conn);\n\n        try {\n          if (!toolsMap.has(key)) {\n            toolsMap.set(key, listToolsFn());\n          }\n\n          return await toolsMap.get(key)!;\n        } catch (error) {\n          console.error(\"Failed to list tools\", error);\n\n          toolsMap.delete(key);\n          return;\n        }\n      }\n      callToolFn.asTool = async () => {\n        const tools = (await listToolsOnce()) ?? [];\n        const tool = tools.find((t) => t.name === name);\n        if (!tool) {\n          throw new Error(`Tool ${name} not found`);\n        }\n\n        return {\n          ...tool,\n          id: tool.name,\n          inputSchema: tool.inputSchema\n            ? convertJsonSchemaToZod(tool.inputSchema)\n            : undefined,\n          outputSchema: tool.outputSchema\n            ? convertJsonSchemaToZod(tool.outputSchema)\n            : undefined,\n          execute: (input: any) => {\n            return callToolFn(input.context);\n          },\n        };\n      };\n      return callToolFn;\n    },\n  });\n}\n"],"mappings":"AACA,SAAS,8BAA8B;AAEvC,SAAS,0BAA0B;AAEnC,MAAM,YAAY,CAAC,YAAoB;AACrC,MAAI;AACF,WAAO,KAAK,MAAM,OAAiB;AAAA,EACrC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,MAAM,WAAW,oBAAI,IAUnB;AAKK,SAAS,qBACd,SACG;AACH,SAAO,IAAI,MAAS,CAAC,GAAQ;AAAA,IAC3B,IAAI,GAAG,MAAM;AACX,UAAI,SAAS,UAAU;AACrB,eAAO;AAAA,MACT;AACA,UAAI,OAAO,SAAS,UAAU;AAC5B,cAAM,IAAI,MAAM,uBAAuB;AAAA,MACzC;AACA,qBAAe,WAAW,MAAe;AACvC,cAAM,UAAU,SAAS,UAAU;AACnC,cAAM,eAAe,UACjB,EAAE,oBAAoB,QAAQ,IAC9B;AAEJ,cAAM,EAAE,QAAQ,mBAAmB,IAAI,MAAM;AAAA,UAC3C,EAAE,YAAY,QAAQ,WAAW;AAAA,UACjC;AAAA,UACA;AAAA,QACF;AAEA,YAAI,SAAS,aAAa,OAAO,IAAI,CAAC,GAAG;AACvC,iBAAO,mBAAmB,OAAO,IAAI,GAAG,IAAI;AAAA,QAC9C;AAEA,cAAM,EAAE,mBAAmB,SAAS,QAAQ,IAAI,MAAM,OAAO;AAAA,UAC3D;AAAA,YACE,MAAM,OAAO,IAAI;AAAA,YACjB,WAAW;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,YACE,SAAS;AAAA,UACX;AAAA,QACF;AAEA,YAAI,SAAS;AACX,gBAAM,oBAAqB,UAAiC,CAAC,GAAG;AAChE,gBAAM,QACJ,OAAO,sBAAsB,WACzB,UAAU,iBAAiB,IAC3B;AAEN,gBAAM,iBACJ,OAAO,QAAQ,OAAO,SAAS,yBAAyB,aACpD,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM;AAAA,UACR,IACA;AAEN,cAAI,gBAAgB;AAClB,kBAAM;AAAA,UACR;AAEA,gBAAM,IAAI;AAAA,YACR,QAAQ,OAAO,IAAI,CAAC,uBAAuB,KAAK;AAAA,cAC9C,qBAAqB;AAAA,YACvB,CAAC;AAAA,UACH;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,YAAM,cAAc,YAAY;AAC9B,cAAM,EAAE,OAAO,IAAI,MAAM,mBAAmB;AAAA,UAC1C,YAAY,QAAQ;AAAA,QACtB,CAAC;AACD,cAAM,EAAE,MAAM,IAAI,MAAM,OAAO,UAAU;AAEzC,eAAO;AAAA,MAMT;AAEA,qBAAe,gBAAgB;AAC7B,cAAM,OAAO,QAAQ;AACrB,cAAM,MAAM,KAAK,UAAU,IAAI;AAE/B,YAAI;AACF,cAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACtB,qBAAS,IAAI,KAAK,YAAY,CAAC;AAAA,UACjC;AAEA,iBAAO,MAAM,SAAS,IAAI,GAAG;AAAA,QAC/B,SAAS,OAAO;AACd,kBAAQ,MAAM,wBAAwB,KAAK;AAE3C,mBAAS,OAAO,GAAG;AACnB;AAAA,QACF;AAAA,MACF;AACA,iBAAW,SAAS,YAAY;AAC9B,cAAM,QAAS,MAAM,cAAc,KAAM,CAAC;AAC1C,cAAM,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI;AAC9C,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI,MAAM,QAAQ,IAAI,YAAY;AAAA,QAC1C;AAEA,eAAO;AAAA,UACL,GAAG;AAAA,UACH,IAAI,KAAK;AAAA,UACT,aAAa,KAAK,cACd,uBAAuB,KAAK,WAAW,IACvC;AAAA,UACJ,cAAc,KAAK,eACf,uBAAuB,KAAK,YAAY,IACxC;AAAA,UACJ,SAAS,CAAC,UAAe;AACvB,mBAAO,WAAW,MAAM,OAAO;AAAA,UACjC;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;","names":[]}

package/dist/core/connection.d.ts

@@ -1,30 +0,0 @@
-type SSEConnection = {
-    type: "SSE";
-    url: string;
-    token?: string;
-    headers?: Record<string, string>;
-};
-type WebsocketConnection = {
-    type: "Websocket";
-    url: string;
-    token?: string;
-};
-type DecoConnection = {
-    type: "Deco";
-    tenant: string;
-    token?: string;
-};
-type InnateConnection = {
-    type: "INNATE";
-    name: string;
-    workspace?: string;
-};
-type HTTPConnection = {
-    type: "HTTP";
-    url: string;
-    headers?: Record<string, string>;
-    token?: string;
-};
-type MCPConnection = SSEConnection | WebsocketConnection | InnateConnection | DecoConnection | HTTPConnection;
-
-export type { DecoConnection, HTTPConnection, InnateConnection, MCPConnection, SSEConnection, WebsocketConnection };

package/dist/core/connection.js

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

package/dist/core/connection.js.map

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

package/dist/core/subset.d.ts

@@ -1,17 +0,0 @@
-/**
- * Structural JSON Schema Subset Check
- *
- * This module implements an algorithm to determine if one JSON Schema (A)
- * is a subset of another (B). A ⊆ B means every value valid under A is also
- * valid under B (A is more restrictive or equally restrictive).
- *
- * Core Axiom: A ⊆ B ⟺ Constraints(A) ⊇ Constraints(B)
- */
-type JSONSchema = Record<string, any>;
-/**
- * Main subset check: isSubset(A, B)
- * Returns true if A ⊆ B (every value valid under A is valid under B)
- */
-declare function isSubset(schemaA: JSONSchema | boolean, schemaB: JSONSchema | boolean): boolean;
-
-export { isSubset };

package/dist/core/subset.js

@@ -1,319 +0,0 @@
-function deepEqual(x, y) {
-  if (x === y) return true;
-  if (typeof x !== typeof y) return false;
-  if (x === null || y === null) return x === y;
-  if (typeof x !== "object") return false;
-  if (Array.isArray(x)) {
-    if (!Array.isArray(y)) return false;
-    if (x.length !== y.length) return false;
-    for (let i = 0; i < x.length; i++) {
-      if (!deepEqual(x[i], y[i])) return false;
-    }
-    return true;
-  }
-  if (Array.isArray(y)) return false;
-  const xObj = x;
-  const yObj = y;
-  const xKeys = Object.keys(xObj);
-  const yKeys = Object.keys(yObj);
-  if (xKeys.length !== yKeys.length) return false;
-  for (const key of xKeys) {
-    if (!Object.prototype.hasOwnProperty.call(yObj, key)) return false;
-    if (!deepEqual(xObj[key], yObj[key])) return false;
-  }
-  return true;
-}
-function normalize(schema) {
-  if (schema === true) return {};
-  if (schema === false) return { not: {} };
-  const s = { ...schema };
-  if (Array.isArray(s.type)) {
-    const types = s.type;
-    if (types.length === 1) {
-      s.type = types[0];
-    } else {
-      const { type: _type, ...rest } = s;
-      return {
-        anyOf: types.map((t) => normalize({ ...rest, type: t }))
-      };
-    }
-  }
-  if (s.type === "integer") {
-    s.type = "number";
-    if (s.multipleOf === void 0) {
-      s.multipleOf = 1;
-    }
-  }
-  return s;
-}
-function isSetSubset(a, b) {
-  const setB = new Set(b);
-  return a.every((item) => setB.has(item));
-}
-function getEffectiveMin(schema) {
-  const min = schema.minimum ?? -Infinity;
-  const exMin = schema.exclusiveMinimum;
-  if (typeof exMin === "number") {
-    return Math.max(min, exMin);
-  }
-  if (exMin === true && typeof schema.minimum === "number") {
-    return schema.minimum;
-  }
-  return min;
-}
-function getEffectiveMax(schema) {
-  const max = schema.maximum ?? Infinity;
-  const exMax = schema.exclusiveMaximum;
-  if (typeof exMax === "number") {
-    return Math.min(max, exMax);
-  }
-  if (exMax === true && typeof schema.maximum === "number") {
-    return schema.maximum;
-  }
-  return max;
-}
-function isMultipleOf(a, b) {
-  if (b === 0) return false;
-  const ratio = a / b;
-  return Math.abs(ratio - Math.round(ratio)) < 1e-10;
-}
-function isEnumSubset(enumA, schemaB) {
-  if (schemaB.enum) {
-    return enumA.every(
-      (val) => schemaB.enum.some((bVal) => deepEqual(val, bVal))
-    );
-  }
-  if (schemaB.const !== void 0) {
-    return enumA.length === 1 && deepEqual(enumA[0], schemaB.const);
-  }
-  return true;
-}
-function isSubset(schemaA, schemaB) {
-  const a = normalize(schemaA);
-  const b = normalize(schemaB);
-  if (Object.keys(b).length === 0) return true;
-  if (a.not && Object.keys(a.not).length === 0) return true;
-  if (deepEqual(a, b)) return true;
-  if (a.anyOf) {
-    return a.anyOf.every((optA) => isSubset(optA, b));
-  }
-  if (a.oneOf) {
-    return a.oneOf.every((optA) => isSubset(optA, b));
-  }
-  if (b.anyOf) {
-    return b.anyOf.some((optB) => isSubset(a, optB));
-  }
-  if (b.oneOf) {
-    return b.oneOf.some((optB) => isSubset(a, optB));
-  }
-  if (b.allOf) {
-    return b.allOf.every((optB) => isSubset(a, optB));
-  }
-  if (a.allOf) {
-    return a.allOf.some((optA) => isSubset(optA, b));
-  }
-  if (a.const !== void 0) {
-    if (b.const !== void 0) {
-      return deepEqual(a.const, b.const);
-    }
-    if (b.enum) {
-      return b.enum.some((v) => deepEqual(a.const, v));
-    }
-    return isValueValidForType(a.const, b);
-  }
-  if (a.enum) {
-    return isEnumSubset(a.enum, b);
-  }
-  if (a.type && b.type && a.type !== b.type) {
-    return false;
-  }
-  if (b.type && !a.type) {
-    if (!a.enum && a.const === void 0) {
-      return false;
-    }
-  }
-  const type = a.type || b.type;
-  switch (type) {
-    case "object":
-      return isObjectSubset(a, b);
-    case "array":
-      return isArraySubset(a, b);
-    case "number":
-      return isNumberSubset(a, b);
-    case "string":
-      return isStringSubset(a, b);
-    case "boolean":
-    case "null":
-      return true;
-    default:
-      return true;
-  }
-}
-function isValueValidForType(value, schema) {
-  if (!schema.type) return true;
-  const valueType = typeof value;
-  switch (schema.type) {
-    case "string":
-      return valueType === "string";
-    case "number":
-      return valueType === "number";
-    case "boolean":
-      return valueType === "boolean";
-    case "null":
-      return value === null;
-    case "object":
-      return valueType === "object" && value !== null && !Array.isArray(value);
-    case "array":
-      return Array.isArray(value);
-    default:
-      return true;
-  }
-}
-function isObjectSubset(a, b) {
-  const aRequired = a.required || [];
-  const bRequired = b.required || [];
-  if (!isSetSubset(bRequired, aRequired)) {
-    return false;
-  }
-  const aProps = a.properties || {};
-  const bProps = b.properties || {};
-  for (const key of Object.keys(bProps)) {
-    if (key in aProps) {
-      if (!isSubset(aProps[key], bProps[key])) {
-        return false;
-      }
-    } else {
-      if (a.additionalProperties === false) {
-        if (bRequired.includes(key)) {
-          return false;
-        }
-      } else {
-        const aAdditional = a.additionalProperties;
-        if (aAdditional && typeof aAdditional === "object") {
-          if (!isSubset(aAdditional, bProps[key])) {
-            return false;
-          }
-        }
-      }
-    }
-  }
-  for (const key of aRequired) {
-    if (key in aProps && !(key in bProps)) {
-      if (b.additionalProperties === false) {
-        return false;
-      } else if (b.additionalProperties && typeof b.additionalProperties === "object") {
-        if (!isSubset(aProps[key], b.additionalProperties)) {
-          return false;
-        }
-      }
-    }
-  }
-  if (b.additionalProperties === false) {
-    const aHasExtraProps = Object.keys(aProps).some((key) => !(key in bProps));
-    if (aHasExtraProps) {
-      return false;
-    }
-    if (a.additionalProperties !== false) {
-      return false;
-    }
-  } else if (b.additionalProperties && typeof b.additionalProperties === "object") {
-    const aAdditional = a.additionalProperties;
-    if (aAdditional && typeof aAdditional === "object") {
-      if (!isSubset(aAdditional, b.additionalProperties)) {
-        return false;
-      }
-    }
-  }
-  return true;
-}
-function isArraySubset(a, b) {
-  if (a.items && b.items) {
-    if (Array.isArray(a.items) && Array.isArray(b.items)) {
-      if (a.items.length !== b.items.length) {
-        return false;
-      }
-      for (let i = 0; i < a.items.length; i++) {
-        if (!isSubset(a.items[i], b.items[i])) {
-          return false;
-        }
-      }
-    } else if (Array.isArray(a.items) && !Array.isArray(b.items)) {
-      for (const itemSchema of a.items) {
-        if (!isSubset(itemSchema, b.items)) {
-          return false;
-        }
-      }
-    } else if (!Array.isArray(a.items) && Array.isArray(b.items)) {
-      return false;
-    } else {
-      if (!isSubset(a.items, b.items)) {
-        return false;
-      }
-    }
-  } else if (b.items && !a.items) {
-    return false;
-  }
-  const aMinItems = a.minItems ?? 0;
-  const bMinItems = b.minItems ?? 0;
-  if (aMinItems < bMinItems) {
-    return false;
-  }
-  const aMaxItems = a.maxItems ?? Infinity;
-  const bMaxItems = b.maxItems ?? Infinity;
-  if (aMaxItems > bMaxItems) {
-    return false;
-  }
-  if (b.uniqueItems && !a.uniqueItems) {
-    return false;
-  }
-  return true;
-}
-function isNumberSubset(a, b) {
-  const aMin = getEffectiveMin(a);
-  const bMin = getEffectiveMin(b);
-  if (aMin < bMin) {
-    return false;
-  }
-  const aMax = getEffectiveMax(a);
-  const bMax = getEffectiveMax(b);
-  if (aMax > bMax) {
-    return false;
-  }
-  if (b.multipleOf !== void 0) {
-    if (a.multipleOf === void 0) {
-      return false;
-    }
-    if (!isMultipleOf(a.multipleOf, b.multipleOf)) {
-      return false;
-    }
-  }
-  return true;
-}
-function isStringSubset(a, b) {
-  const aMinLength = a.minLength ?? 0;
-  const bMinLength = b.minLength ?? 0;
-  if (aMinLength < bMinLength) {
-    return false;
-  }
-  const aMaxLength = a.maxLength ?? Infinity;
-  const bMaxLength = b.maxLength ?? Infinity;
-  if (aMaxLength > bMaxLength) {
-    return false;
-  }
-  if (b.pattern) {
-    if (!a.pattern) {
-      return false;
-    }
-    if (a.pattern !== b.pattern) {
-      return false;
-    }
-  }
-  if (b.format && a.format !== b.format) {
-    return false;
-  }
-  return true;
-}
-export {
-  isSubset
-};
-//# sourceMappingURL=subset.js.map

package/dist/core/subset.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/core/subset.ts"],"sourcesContent":["/**\n * Structural JSON Schema Subset Check\n *\n * This module implements an algorithm to determine if one JSON Schema (A)\n * is a subset of another (B). A ⊆ B means every value valid under A is also\n * valid under B (A is more restrictive or equally restrictive).\n *\n * Core Axiom: A ⊆ B ⟺ Constraints(A) ⊇ Constraints(B)\n */\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ntype JSONSchema = Record<string, any>;\n\n/**\n * Deep equality check for JSON values (for const/enum comparison)\n */\nfunction deepEqual(x: unknown, y: unknown): boolean {\n  if (x === y) return true;\n  if (typeof x !== typeof y) return false;\n  if (x === null || y === null) return x === y;\n  if (typeof x !== \"object\") return false;\n\n  if (Array.isArray(x)) {\n    if (!Array.isArray(y)) return false;\n    if (x.length !== y.length) return false;\n    for (let i = 0; i < x.length; i++) {\n      if (!deepEqual(x[i], y[i])) return false;\n    }\n    return true;\n  }\n\n  if (Array.isArray(y)) return false;\n\n  const xObj = x as Record<string, unknown>;\n  const yObj = y as Record<string, unknown>;\n  const xKeys = Object.keys(xObj);\n  const yKeys = Object.keys(yObj);\n\n  if (xKeys.length !== yKeys.length) return false;\n\n  for (const key of xKeys) {\n    if (!Object.prototype.hasOwnProperty.call(yObj, key)) return false;\n    if (!deepEqual(xObj[key], yObj[key])) return false;\n  }\n\n  return true;\n}\n\n/**\n * Phase 1: Normalization\n * Convert syntactic sugar to canonical form\n */\nfunction normalize(schema: JSONSchema | boolean): JSONSchema {\n  // Boolean schemas\n  if (schema === true) return {};\n  if (schema === false) return { not: {} };\n\n  // Already an object\n  const s = { ...schema };\n\n  // Type arrays -> anyOf\n  if (Array.isArray(s.type)) {\n    const types = s.type as string[];\n    if (types.length === 1) {\n      s.type = types[0];\n    } else {\n      const { type: _type, ...rest } = s;\n      return {\n        anyOf: types.map((t) => normalize({ ...rest, type: t })),\n      };\n    }\n  }\n\n  // Integer is number with multipleOf: 1\n  if (s.type === \"integer\") {\n    s.type = \"number\";\n    if (s.multipleOf === undefined) {\n      s.multipleOf = 1;\n    }\n  }\n\n  return s;\n}\n\n/**\n * Check if set A is a subset of set B (for required fields)\n */\nfunction isSetSubset(a: string[], b: string[]): boolean {\n  const setB = new Set(b);\n  return a.every((item) => setB.has(item));\n}\n\n/**\n * Get effective minimum value from schema\n */\nfunction getEffectiveMin(schema: JSONSchema): number {\n  const min = schema.minimum ?? -Infinity;\n  const exMin = schema.exclusiveMinimum;\n\n  if (typeof exMin === \"number\") {\n    return Math.max(min, exMin);\n  }\n  if (exMin === true && typeof schema.minimum === \"number\") {\n    return schema.minimum;\n  }\n  return min;\n}\n\n/**\n * Get effective maximum value from schema\n */\nfunction getEffectiveMax(schema: JSONSchema): number {\n  const max = schema.maximum ?? Infinity;\n  const exMax = schema.exclusiveMaximum;\n\n  if (typeof exMax === \"number\") {\n    return Math.min(max, exMax);\n  }\n  if (exMax === true && typeof schema.maximum === \"number\") {\n    return schema.maximum;\n  }\n  return max;\n}\n\n/**\n * Check if multipleOfA is a multiple of multipleOfB\n * (i.e., A's constraint is tighter)\n */\nfunction isMultipleOf(a: number, b: number): boolean {\n  if (b === 0) return false;\n  // Handle floating point precision\n  const ratio = a / b;\n  return Math.abs(ratio - Math.round(ratio)) < 1e-10;\n}\n\n/**\n * Check if A's enum values are all valid in B\n */\nfunction isEnumSubset(enumA: unknown[], schemaB: JSONSchema): boolean {\n  // If B has enum, check set inclusion\n  if (schemaB.enum) {\n    return enumA.every((val) =>\n      schemaB.enum.some((bVal: unknown) => deepEqual(val, bVal)),\n    );\n  }\n\n  // If B has const, check if A's enum only contains that value\n  if (schemaB.const !== undefined) {\n    return enumA.length === 1 && deepEqual(enumA[0], schemaB.const);\n  }\n\n  // Otherwise, enum values must match B's type constraints\n  // This is a simplified check - full validation would require more\n  return true;\n}\n\n/**\n * Main subset check: isSubset(A, B)\n * Returns true if A ⊆ B (every value valid under A is valid under B)\n */\nexport function isSubset(\n  schemaA: JSONSchema | boolean,\n  schemaB: JSONSchema | boolean,\n): boolean {\n  // Phase 1: Normalize\n  const a = normalize(schemaA);\n  const b = normalize(schemaB);\n\n  // Phase 2: Meta Logic - Universal Terminators\n\n  // If B is {} (Any), everything is a subset\n  if (Object.keys(b).length === 0) return true;\n\n  // If A is false (Never), empty set is subset of everything\n  if (a.not && Object.keys(a.not).length === 0) return true;\n\n  // Deep equality check\n  if (deepEqual(a, b)) return true;\n\n  // Phase 2: Unions and Intersections\n\n  // Left-side union (anyOf in A): all options must fit in B\n  if (a.anyOf) {\n    return (a.anyOf as JSONSchema[]).every((optA) => isSubset(optA, b));\n  }\n\n  // Left-side union (oneOf in A): all options must fit in B\n  if (a.oneOf) {\n    return (a.oneOf as JSONSchema[]).every((optA) => isSubset(optA, b));\n  }\n\n  // Right-side union (anyOf in B): A must fit in at least one option\n  if (b.anyOf) {\n    return (b.anyOf as JSONSchema[]).some((optB) => isSubset(a, optB));\n  }\n\n  // Right-side union (oneOf in B): A must fit in at least one option\n  if (b.oneOf) {\n    return (b.oneOf as JSONSchema[]).some((optB) => isSubset(a, optB));\n  }\n\n  // Right-side intersection (allOf in B): A must satisfy all\n  if (b.allOf) {\n    return (b.allOf as JSONSchema[]).every((optB) => isSubset(a, optB));\n  }\n\n  // Left-side intersection (allOf in A): merge and compare\n  if (a.allOf) {\n    // Simplified: check if any single branch satisfies B\n    return (a.allOf as JSONSchema[]).some((optA) => isSubset(optA, b));\n  }\n\n  // Phase 3: Type-specific logic\n\n  // Handle const in A\n  if (a.const !== undefined) {\n    if (b.const !== undefined) {\n      return deepEqual(a.const, b.const);\n    }\n    if (b.enum) {\n      return b.enum.some((v: unknown) => deepEqual(a.const, v));\n    }\n    // const must match B's type constraints\n    return isValueValidForType(a.const, b);\n  }\n\n  // Handle enum in A\n  if (a.enum) {\n    return isEnumSubset(a.enum, b);\n  }\n\n  // Type mismatch check\n  if (a.type && b.type && a.type !== b.type) {\n    return false;\n  }\n\n  // If B has a type but A doesn't, A might allow more types\n  if (b.type && !a.type) {\n    // A is more permissive (no type restriction) so it's not a subset\n    // unless A has other constraints that limit it\n    if (!a.enum && a.const === undefined) {\n      return false;\n    }\n  }\n\n  const type = a.type || b.type;\n\n  switch (type) {\n    case \"object\":\n      return isObjectSubset(a, b);\n    case \"array\":\n      return isArraySubset(a, b);\n    case \"number\":\n      return isNumberSubset(a, b);\n    case \"string\":\n      return isStringSubset(a, b);\n    case \"boolean\":\n    case \"null\":\n      // These types have no additional constraints\n      return true;\n    default:\n      // Unknown type or no type specified\n      return true;\n  }\n}\n\n/**\n * Check if a value would be valid for a schema's type\n */\nfunction isValueValidForType(value: unknown, schema: JSONSchema): boolean {\n  if (!schema.type) return true;\n\n  const valueType = typeof value;\n  switch (schema.type) {\n    case \"string\":\n      return valueType === \"string\";\n    case \"number\":\n      return valueType === \"number\";\n    case \"boolean\":\n      return valueType === \"boolean\";\n    case \"null\":\n      return value === null;\n    case \"object\":\n      return valueType === \"object\" && value !== null && !Array.isArray(value);\n    case \"array\":\n      return Array.isArray(value);\n    default:\n      return true;\n  }\n}\n\n/**\n * Object subset check\n */\nfunction isObjectSubset(a: JSONSchema, b: JSONSchema): boolean {\n  // Required keys: A must require at least everything B requires\n  const aRequired = (a.required as string[]) || [];\n  const bRequired = (b.required as string[]) || [];\n\n  if (!isSetSubset(bRequired, aRequired)) {\n    return false;\n  }\n\n  // Property compatibility\n  const aProps = (a.properties as Record<string, JSONSchema>) || {};\n  const bProps = (b.properties as Record<string, JSONSchema>) || {};\n\n  // Check all properties defined in B\n  for (const key of Object.keys(bProps)) {\n    if (key in aProps) {\n      // Both have the property, check recursively\n      if (!isSubset(aProps[key], bProps[key])) {\n        return false;\n      }\n    } else {\n      // Property missing in A\n      // If A is closed (additionalProperties: false), A won't produce this key\n      // which means A values won't have this property, potentially violating B if B requires it\n      if (a.additionalProperties === false) {\n        // A is closed and doesn't have this property\n        // If B requires this property, A can't satisfy it\n        if (bRequired.includes(key)) {\n          return false;\n        }\n        // Otherwise, A just won't have this optional property, which is fine\n      } else {\n        // A is open, check if additionalProperties schema satisfies B's property\n        const aAdditional = a.additionalProperties;\n        if (aAdditional && typeof aAdditional === \"object\") {\n          if (!isSubset(aAdditional, bProps[key])) {\n            return false;\n          }\n        }\n        // If additionalProperties is true or undefined, any value is allowed\n        // which might not satisfy B's property schema\n      }\n    }\n  }\n\n  // Check all properties defined in A (that A requires)\n  // If A requires a property, B must also define it (or have compatible additionalProperties)\n  for (const key of aRequired) {\n    if (key in aProps && !(key in bProps)) {\n      // A requires and defines this property, but B doesn't define it\n      // B must have additionalProperties that accepts A's property schema\n      if (b.additionalProperties === false) {\n        // B doesn't allow additional properties, so A's required property would be rejected\n        return false;\n      } else if (\n        b.additionalProperties &&\n        typeof b.additionalProperties === \"object\"\n      ) {\n        // B has a schema for additional properties, check compatibility\n        if (!isSubset(aProps[key], b.additionalProperties)) {\n          return false;\n        }\n      }\n      // If B's additionalProperties is true or undefined, any value is allowed\n    }\n  }\n\n  // Additional properties constraint\n  if (b.additionalProperties === false) {\n    // B is closed, A must also be closed or not have extra properties\n    const aHasExtraProps = Object.keys(aProps).some((key) => !(key in bProps));\n    if (aHasExtraProps) {\n      return false;\n    }\n    // If A is open and B is closed, A could produce extra properties\n    if (a.additionalProperties !== false) {\n      return false;\n    }\n  } else if (\n    b.additionalProperties &&\n    typeof b.additionalProperties === \"object\"\n  ) {\n    // B has a schema for additional properties\n    const aAdditional = a.additionalProperties;\n    if (aAdditional && typeof aAdditional === \"object\") {\n      if (!isSubset(aAdditional, b.additionalProperties)) {\n        return false;\n      }\n    }\n  }\n\n  return true;\n}\n\n/**\n * Array subset check\n */\nfunction isArraySubset(a: JSONSchema, b: JSONSchema): boolean {\n  // Items schema\n  if (a.items && b.items) {\n    if (Array.isArray(a.items) && Array.isArray(b.items)) {\n      // Both are tuples\n      if (a.items.length !== b.items.length) {\n        return false;\n      }\n      for (let i = 0; i < a.items.length; i++) {\n        if (!isSubset(a.items[i], b.items[i])) {\n          return false;\n        }\n      }\n    } else if (Array.isArray(a.items) && !Array.isArray(b.items)) {\n      // A is tuple, B is list\n      for (const itemSchema of a.items) {\n        if (!isSubset(itemSchema, b.items)) {\n          return false;\n        }\n      }\n    } else if (!Array.isArray(a.items) && Array.isArray(b.items)) {\n      // A is list, B is tuple - A is more permissive\n      return false;\n    } else {\n      // Both are lists\n      if (!isSubset(a.items, b.items)) {\n        return false;\n      }\n    }\n  } else if (b.items && !a.items) {\n    // B has items constraint but A doesn't\n    return false;\n  }\n\n  // Length constraints\n  const aMinItems = a.minItems ?? 0;\n  const bMinItems = b.minItems ?? 0;\n  if (aMinItems < bMinItems) {\n    return false;\n  }\n\n  const aMaxItems = a.maxItems ?? Infinity;\n  const bMaxItems = b.maxItems ?? Infinity;\n  if (aMaxItems > bMaxItems) {\n    return false;\n  }\n\n  // Uniqueness\n  if (b.uniqueItems && !a.uniqueItems) {\n    return false;\n  }\n\n  return true;\n}\n\n/**\n * Number subset check\n */\nfunction isNumberSubset(a: JSONSchema, b: JSONSchema): boolean {\n  // Minimum\n  const aMin = getEffectiveMin(a);\n  const bMin = getEffectiveMin(b);\n  if (aMin < bMin) {\n    return false;\n  }\n\n  // Maximum\n  const aMax = getEffectiveMax(a);\n  const bMax = getEffectiveMax(b);\n  if (aMax > bMax) {\n    return false;\n  }\n\n  // MultipleOf\n  if (b.multipleOf !== undefined) {\n    if (a.multipleOf === undefined) {\n      // A doesn't have multipleOf constraint, so it's more permissive\n      return false;\n    }\n    if (!isMultipleOf(a.multipleOf, b.multipleOf)) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * String subset check\n */\nfunction isStringSubset(a: JSONSchema, b: JSONSchema): boolean {\n  // Length constraints\n  const aMinLength = a.minLength ?? 0;\n  const bMinLength = b.minLength ?? 0;\n  if (aMinLength < bMinLength) {\n    return false;\n  }\n\n  const aMaxLength = a.maxLength ?? Infinity;\n  const bMaxLength = b.maxLength ?? Infinity;\n  if (aMaxLength > bMaxLength) {\n    return false;\n  }\n\n  // Pattern (regex)\n  if (b.pattern) {\n    if (!a.pattern) {\n      // A has no pattern constraint, more permissive\n      return false;\n    }\n    // Exact match only (full regex subset check is computationally expensive)\n    if (a.pattern !== b.pattern) {\n      return false;\n    }\n  }\n\n  // Format (treat as informational, exact match required)\n  if (b.format && a.format !== b.format) {\n    return false;\n  }\n\n  return true;\n}\n"],"mappings":"AAgBA,SAAS,UAAU,GAAY,GAAqB;AAClD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,OAAO,MAAM,OAAO,EAAG,QAAO;AAClC,MAAI,MAAM,QAAQ,MAAM,KAAM,QAAO,MAAM;AAC3C,MAAI,OAAO,MAAM,SAAU,QAAO;AAElC,MAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,QAAI,CAAC,MAAM,QAAQ,CAAC,EAAG,QAAO;AAC9B,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,IACrC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,CAAC,EAAG,QAAO;AAE7B,QAAM,OAAO;AACb,QAAM,OAAO;AACb,QAAM,QAAQ,OAAO,KAAK,IAAI;AAC9B,QAAM,QAAQ,OAAO,KAAK,IAAI;AAE9B,MAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAE1C,aAAW,OAAO,OAAO;AACvB,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,GAAG,EAAG,QAAO;AAC7D,QAAI,CAAC,UAAU,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,EAAG,QAAO;AAAA,EAC/C;AAEA,SAAO;AACT;AAMA,SAAS,UAAU,QAA0C;AAE3D,MAAI,WAAW,KAAM,QAAO,CAAC;AAC7B,MAAI,WAAW,MAAO,QAAO,EAAE,KAAK,CAAC,EAAE;AAGvC,QAAM,IAAI,EAAE,GAAG,OAAO;AAGtB,MAAI,MAAM,QAAQ,EAAE,IAAI,GAAG;AACzB,UAAM,QAAQ,EAAE;AAChB,QAAI,MAAM,WAAW,GAAG;AACtB,QAAE,OAAO,MAAM,CAAC;AAAA,IAClB,OAAO;AACL,YAAM,EAAE,MAAM,OAAO,GAAG,KAAK,IAAI;AACjC,aAAO;AAAA,QACL,OAAO,MAAM,IAAI,CAAC,MAAM,UAAU,EAAE,GAAG,MAAM,MAAM,EAAE,CAAC,CAAC;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAGA,MAAI,EAAE,SAAS,WAAW;AACxB,MAAE,OAAO;AACT,QAAI,EAAE,eAAe,QAAW;AAC9B,QAAE,aAAa;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,YAAY,GAAa,GAAsB;AACtD,QAAM,OAAO,IAAI,IAAI,CAAC;AACtB,SAAO,EAAE,MAAM,CAAC,SAAS,KAAK,IAAI,IAAI,CAAC;AACzC;AAKA,SAAS,gBAAgB,QAA4B;AACnD,QAAM,MAAM,OAAO,WAAW;AAC9B,QAAM,QAAQ,OAAO;AAErB,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,KAAK,IAAI,KAAK,KAAK;AAAA,EAC5B;AACA,MAAI,UAAU,QAAQ,OAAO,OAAO,YAAY,UAAU;AACxD,WAAO,OAAO;AAAA,EAChB;AACA,SAAO;AACT;AAKA,SAAS,gBAAgB,QAA4B;AACnD,QAAM,MAAM,OAAO,WAAW;AAC9B,QAAM,QAAQ,OAAO;AAErB,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,KAAK,IAAI,KAAK,KAAK;AAAA,EAC5B;AACA,MAAI,UAAU,QAAQ,OAAO,OAAO,YAAY,UAAU;AACxD,WAAO,OAAO;AAAA,EAChB;AACA,SAAO;AACT;AAMA,SAAS,aAAa,GAAW,GAAoB;AACnD,MAAI,MAAM,EAAG,QAAO;AAEpB,QAAM,QAAQ,IAAI;AAClB,SAAO,KAAK,IAAI,QAAQ,KAAK,MAAM,KAAK,CAAC,IAAI;AAC/C;AAKA,SAAS,aAAa,OAAkB,SAA8B;AAEpE,MAAI,QAAQ,MAAM;AAChB,WAAO,MAAM;AAAA,MAAM,CAAC,QAClB,QAAQ,KAAK,KAAK,CAAC,SAAkB,UAAU,KAAK,IAAI,CAAC;AAAA,IAC3D;AAAA,EACF;AAGA,MAAI,QAAQ,UAAU,QAAW;AAC/B,WAAO,MAAM,WAAW,KAAK,UAAU,MAAM,CAAC,GAAG,QAAQ,KAAK;AAAA,EAChE;AAIA,SAAO;AACT;AAMO,SAAS,SACd,SACA,SACS;AAET,QAAM,IAAI,UAAU,OAAO;AAC3B,QAAM,IAAI,UAAU,OAAO;AAK3B,MAAI,OAAO,KAAK,CAAC,EAAE,WAAW,EAAG,QAAO;AAGxC,MAAI,EAAE,OAAO,OAAO,KAAK,EAAE,GAAG,EAAE,WAAW,EAAG,QAAO;AAGrD,MAAI,UAAU,GAAG,CAAC,EAAG,QAAO;AAK5B,MAAI,EAAE,OAAO;AACX,WAAQ,EAAE,MAAuB,MAAM,CAAC,SAAS,SAAS,MAAM,CAAC,CAAC;AAAA,EACpE;AAGA,MAAI,EAAE,OAAO;AACX,WAAQ,EAAE,MAAuB,MAAM,CAAC,SAAS,SAAS,MAAM,CAAC,CAAC;AAAA,EACpE;AAGA,MAAI,EAAE,OAAO;AACX,WAAQ,EAAE,MAAuB,KAAK,CAAC,SAAS,SAAS,GAAG,IAAI,CAAC;AAAA,EACnE;AAGA,MAAI,EAAE,OAAO;AACX,WAAQ,EAAE,MAAuB,KAAK,CAAC,SAAS,SAAS,GAAG,IAAI,CAAC;AAAA,EACnE;AAGA,MAAI,EAAE,OAAO;AACX,WAAQ,EAAE,MAAuB,MAAM,CAAC,SAAS,SAAS,GAAG,IAAI,CAAC;AAAA,EACpE;AAGA,MAAI,EAAE,OAAO;AAEX,WAAQ,EAAE,MAAuB,KAAK,CAAC,SAAS,SAAS,MAAM,CAAC,CAAC;AAAA,EACnE;AAKA,MAAI,EAAE,UAAU,QAAW;AACzB,QAAI,EAAE,UAAU,QAAW;AACzB,aAAO,UAAU,EAAE,OAAO,EAAE,KAAK;AAAA,IACnC;AACA,QAAI,EAAE,MAAM;AACV,aAAO,EAAE,KAAK,KAAK,CAAC,MAAe,UAAU,EAAE,OAAO,CAAC,CAAC;AAAA,IAC1D;AAEA,WAAO,oBAAoB,EAAE,OAAO,CAAC;AAAA,EACvC;AAGA,MAAI,EAAE,MAAM;AACV,WAAO,aAAa,EAAE,MAAM,CAAC;AAAA,EAC/B;AAGA,MAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM;AACzC,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,QAAQ,CAAC,EAAE,MAAM;AAGrB,QAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,QAAW;AACpC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,OAAO,EAAE,QAAQ,EAAE;AAEzB,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,eAAe,GAAG,CAAC;AAAA,IAC5B,KAAK;AACH,aAAO,cAAc,GAAG,CAAC;AAAA,IAC3B,KAAK;AACH,aAAO,eAAe,GAAG,CAAC;AAAA,IAC5B,KAAK;AACH,aAAO,eAAe,GAAG,CAAC;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AAEH,aAAO;AAAA,IACT;AAEE,aAAO;AAAA,EACX;AACF;AAKA,SAAS,oBAAoB,OAAgB,QAA6B;AACxE,MAAI,CAAC,OAAO,KAAM,QAAO;AAEzB,QAAM,YAAY,OAAO;AACzB,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AACH,aAAO,cAAc;AAAA,IACvB,KAAK;AACH,aAAO,cAAc;AAAA,IACvB,KAAK;AACH,aAAO,cAAc;AAAA,IACvB,KAAK;AACH,aAAO,UAAU;AAAA,IACnB,KAAK;AACH,aAAO,cAAc,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAAA,IACzE,KAAK;AACH,aAAO,MAAM,QAAQ,KAAK;AAAA,IAC5B;AACE,aAAO;AAAA,EACX;AACF;AAKA,SAAS,eAAe,GAAe,GAAwB;AAE7D,QAAM,YAAa,EAAE,YAAyB,CAAC;AAC/C,QAAM,YAAa,EAAE,YAAyB,CAAC;AAE/C,MAAI,CAAC,YAAY,WAAW,SAAS,GAAG;AACtC,WAAO;AAAA,EACT;AAGA,QAAM,SAAU,EAAE,cAA6C,CAAC;AAChE,QAAM,SAAU,EAAE,cAA6C,CAAC;AAGhE,aAAW,OAAO,OAAO,KAAK,MAAM,GAAG;AACrC,QAAI,OAAO,QAAQ;AAEjB,UAAI,CAAC,SAAS,OAAO,GAAG,GAAG,OAAO,GAAG,CAAC,GAAG;AACvC,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AAIL,UAAI,EAAE,yBAAyB,OAAO;AAGpC,YAAI,UAAU,SAAS,GAAG,GAAG;AAC3B,iBAAO;AAAA,QACT;AAAA,MAEF,OAAO;AAEL,cAAM,cAAc,EAAE;AACtB,YAAI,eAAe,OAAO,gBAAgB,UAAU;AAClD,cAAI,CAAC,SAAS,aAAa,OAAO,GAAG,CAAC,GAAG;AACvC,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MAGF;AAAA,IACF;AAAA,EACF;AAIA,aAAW,OAAO,WAAW;AAC3B,QAAI,OAAO,UAAU,EAAE,OAAO,SAAS;AAGrC,UAAI,EAAE,yBAAyB,OAAO;AAEpC,eAAO;AAAA,MACT,WACE,EAAE,wBACF,OAAO,EAAE,yBAAyB,UAClC;AAEA,YAAI,CAAC,SAAS,OAAO,GAAG,GAAG,EAAE,oBAAoB,GAAG;AAClD,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IAEF;AAAA,EACF;AAGA,MAAI,EAAE,yBAAyB,OAAO;AAEpC,UAAM,iBAAiB,OAAO,KAAK,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,OAAO,OAAO;AACzE,QAAI,gBAAgB;AAClB,aAAO;AAAA,IACT;AAEA,QAAI,EAAE,yBAAyB,OAAO;AACpC,aAAO;AAAA,IACT;AAAA,EACF,WACE,EAAE,wBACF,OAAO,EAAE,yBAAyB,UAClC;AAEA,UAAM,cAAc,EAAE;AACtB,QAAI,eAAe,OAAO,gBAAgB,UAAU;AAClD,UAAI,CAAC,SAAS,aAAa,EAAE,oBAAoB,GAAG;AAClD,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,cAAc,GAAe,GAAwB;AAE5D,MAAI,EAAE,SAAS,EAAE,OAAO;AACtB,QAAI,MAAM,QAAQ,EAAE,KAAK,KAAK,MAAM,QAAQ,EAAE,KAAK,GAAG;AAEpD,UAAI,EAAE,MAAM,WAAW,EAAE,MAAM,QAAQ;AACrC,eAAO;AAAA,MACT;AACA,eAAS,IAAI,GAAG,IAAI,EAAE,MAAM,QAAQ,KAAK;AACvC,YAAI,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG;AACrC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,WAAW,MAAM,QAAQ,EAAE,KAAK,KAAK,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG;AAE5D,iBAAW,cAAc,EAAE,OAAO;AAChC,YAAI,CAAC,SAAS,YAAY,EAAE,KAAK,GAAG;AAClC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,WAAW,CAAC,MAAM,QAAQ,EAAE,KAAK,KAAK,MAAM,QAAQ,EAAE,KAAK,GAAG;AAE5D,aAAO;AAAA,IACT,OAAO;AAEL,UAAI,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG;AAC/B,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,WAAW,EAAE,SAAS,CAAC,EAAE,OAAO;AAE9B,WAAO;AAAA,EACT;AAGA,QAAM,YAAY,EAAE,YAAY;AAChC,QAAM,YAAY,EAAE,YAAY;AAChC,MAAI,YAAY,WAAW;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,EAAE,YAAY;AAChC,QAAM,YAAY,EAAE,YAAY;AAChC,MAAI,YAAY,WAAW;AACzB,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,eAAe,CAAC,EAAE,aAAa;AACnC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAKA,SAAS,eAAe,GAAe,GAAwB;AAE7D,QAAM,OAAO,gBAAgB,CAAC;AAC9B,QAAM,OAAO,gBAAgB,CAAC;AAC9B,MAAI,OAAO,MAAM;AACf,WAAO;AAAA,EACT;AAGA,QAAM,OAAO,gBAAgB,CAAC;AAC9B,QAAM,OAAO,gBAAgB,CAAC;AAC9B,MAAI,OAAO,MAAM;AACf,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,eAAe,QAAW;AAC9B,QAAI,EAAE,eAAe,QAAW;AAE9B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,aAAa,EAAE,YAAY,EAAE,UAAU,GAAG;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,eAAe,GAAe,GAAwB;AAE7D,QAAM,aAAa,EAAE,aAAa;AAClC,QAAM,aAAa,EAAE,aAAa;AAClC,MAAI,aAAa,YAAY;AAC3B,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,EAAE,aAAa;AAClC,QAAM,aAAa,EAAE,aAAa;AAClC,MAAI,aAAa,YAAY;AAC3B,WAAO;AAAA,EACT;AAGA,MAAI,EAAE,SAAS;AACb,QAAI,CAAC,EAAE,SAAS;AAEd,aAAO;AAAA,IACT;AAEA,QAAI,EAAE,YAAY,EAAE,SAAS;AAC3B,aAAO;AAAA,IACT;AAAA,EACF;AAGA,MAAI,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ;AACrC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;","names":[]}