@osdk/client 2.4.2 → 2.5.0-beta.10

package/build/browser/observable/internal/base-list/removeDuplicates.js

@@ -0,0 +1,36 @@
+/*
+ * Copyright 2025 Palantir Technologies, Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+/**
+ * Removes duplicate object cache keys from an array while maintaining order.
+ * Also reads each key from the batch context (for side effects).
+ *
+ * @param objectCacheKeys Array of object cache keys that may contain duplicates
+ * @param batch The batch context used to read cache entries
+ * @returns Array with duplicates removed, maintaining the original order
+ */
+export function removeDuplicates(objectCacheKeys, batch) {
+  const visited = new Set();
+  return objectCacheKeys.filter(key => {
+    batch.read(key);
+    if (visited.has(key)) {
+      return false;
+    }
+    visited.add(key);
+    return true;
+  });
+}
+//# sourceMappingURL=removeDuplicates.js.map

package/build/browser/observable/internal/base-list/removeDuplicates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"removeDuplicates.js","names":["removeDuplicates","objectCacheKeys","batch","visited","Set","filter","key","read","has","add"],"sources":["removeDuplicates.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { BatchContext } from \"../BatchContext.js\";\nimport type { ObjectCacheKey } from \"../object/ObjectCacheKey.js\";\n\n/**\n * Removes duplicate object cache keys from an array while maintaining order.\n * Also reads each key from the batch context (for side effects).\n *\n * @param objectCacheKeys Array of object cache keys that may contain duplicates\n * @param batch The batch context used to read cache entries\n * @returns Array with duplicates removed, maintaining the original order\n */\nexport function removeDuplicates(\n  objectCacheKeys: ObjectCacheKey[],\n  batch: BatchContext,\n): ObjectCacheKey[] {\n  const visited = new Set<ObjectCacheKey>();\n  return objectCacheKeys.filter((key) => {\n    batch.read(key);\n    if (visited.has(key)) {\n      return false;\n    }\n    visited.add(key);\n    return true;\n  });\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,gBAAgBA,CAC9BC,eAAiC,EACjCC,KAAmB,EACD;EAClB,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAiB,CAAC;EACzC,OAAOH,eAAe,CAACI,MAAM,CAAEC,GAAG,IAAK;IACrCJ,KAAK,CAACK,IAAI,CAACD,GAAG,CAAC;IACf,IAAIH,OAAO,CAACK,GAAG,CAACF,GAAG,CAAC,EAAE;MACpB,OAAO,KAAK;IACd;IACAH,OAAO,CAACM,GAAG,CAACH,GAAG,CAAC;IAChB,OAAO,IAAI;EACb,CAAC,CAAC;AACJ","ignoreList":[]}

package/build/browser/observable/internal/createInitEntry.js

@@ -0,0 +1,25 @@
+/*
+ * Copyright 2025 Palantir Technologies, Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+export function createInitEntry(cacheKey) {
+  return {
+    cacheKey,
+    status: "init",
+    value: undefined,
+    lastUpdated: 0
+  };
+}
+//# sourceMappingURL=createInitEntry.js.map

package/build/browser/observable/internal/createInitEntry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInitEntry.js","names":["createInitEntry","cacheKey","status","value","undefined","lastUpdated"],"sources":["createInitEntry.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { KnownCacheKey } from \"./KnownCacheKey.js\";\nimport type { Entry } from \"./Layer.js\";\n\nexport function createInitEntry(cacheKey: KnownCacheKey): Entry<any> {\n  return {\n    cacheKey,\n    status: \"init\",\n    value: undefined,\n    lastUpdated: 0,\n  };\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,OAAO,SAASA,eAAeA,CAACC,QAAuB,EAAc;EACnE,OAAO;IACLA,QAAQ;IACRC,MAAM,EAAE,MAAM;IACdC,KAAK,EAAEC,SAAS;IAChBC,WAAW,EAAE;EACf,CAAC;AACH","ignoreList":[]}

package/build/browser/observable/internal/getObjectTypesThatInvalidate.js

@@ -0,0 +1,216 @@
+/*
+ * Copyright 2025 Palantir Technologies, Inc. All rights reserved.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import invariant from "tiny-invariant";
+// Suppose we did an object set that is basically
+// A.where()
+//  pivot(B).where()
+//  pivot(C).where()
+//  pivot(A).where()
+//
+// Any change to A needs to invalidate the chain because of the inner most A.
+//
+// But B.pivotTo(A) does not need all A's to invalidate the chain.
+//
+// For now we are keeping things conservative and just invalidating A either way,
+// but we can make this better.
+
+export async function getObjectTypesThatInvalidate(mc, objectSet) {
+  const counts = {};
+  const resultType = await calcObjectSet(objectSet, {
+    counts,
+    methodInput: undefined,
+    ontologyProvider: mc.ontologyProvider
+  });
+
+  // we need to uncount the final result type
+  const tweaked = {
+    ...counts,
+    [resultType.apiName]: counts[resultType.apiName] - 1
+  };
+  return {
+    resultType,
+    counts,
+    invalidationSet: new Set(Object.entries(tweaked).filter(([, v]) => v > 0).map(([k]) => k))
+  };
+}
+async function calcObjectSet(os, ctx) {
+  const op = ctx.ontologyProvider;
+  async function bumpObject(apiName) {
+    const objectType = await op.getObjectDefinition(apiName);
+    ctx.counts[apiName] = (ctx.counts[apiName] ?? 0) + 1;
+    return objectType;
+  }
+  async function bumpInterface(apiName) {
+    const interfaceDef = await op.getInterfaceDefinition(apiName);
+    for (const s of interfaceDef.implementedBy ?? []) {
+      ctx.counts[s] = (ctx.counts[s] ?? 0) + 1;
+    }
+    return interfaceDef;
+  }
+  switch (os.type) {
+    case "base":
+      return await bumpObject(os.objectType);
+    case "interfaceBase":
+      return await bumpInterface(os.interfaceType);
+    case "interfaceLinkSearchAround":
+      {
+        const srcDef = await calcObjectSet(os.objectSet, ctx);
+        !(srcDef.type === "interface") ? process.env.NODE_ENV !== "production" ? invariant(false) : invariant(false) : void 0;
+        for (const [k, v] of Object.entries(srcDef.links)) {
+          if (k === os.interfaceLink) {
+            if (v.targetType === "object") {
+              return await bumpObject(v.targetType);
+            }
+            return await bumpInterface(v.targetType);
+          }
+        }
+
+        // if we got here then we did not find the link and something is wrong.
+        throw new Error(`Could not find link ${os.interfaceLink} in object set ${JSON.stringify(os.objectSet)}`);
+      }
+    case "searchAround":
+      {
+        const contextDef = await calcObjectSet(os.objectSet, ctx);
+        !(contextDef.type === "object") ? process.env.NODE_ENV !== "production" ? invariant(false) : invariant(false) : void 0;
+        for (const [k, v] of Object.entries(contextDef.links)) {
+          if (k === os.link) {
+            return await bumpObject(v.targetType);
+          }
+        }
+
+        // if we got here then we did not find the link and something is wrong.
+        throw new Error(`Could not find link ${os.link} in object set ${JSON.stringify(os.objectSet)}`);
+      }
+    case "filter":
+      // for the simple version of this, we can ignore the filter being based on any RDPs because
+      // our RDP handling will ensure we invalidate based on those.
+      return calcObjectSet(os.objectSet, ctx);
+    case "union":
+    case "subtract":
+    case "intersect":
+      // all of these entries need their counts to be merged as the max of each
+
+      // suppose you have a simple `Union(A, A)`. We would end up with A:2
+      // but we only need A:1.
+
+      // suppose you have `Union(A->B, A->B)`. Now you end up with A:2, B:2,
+      // but we only want A:1, B:1.
+
+      // suppose you have `Union(A->B->A->B, A->B)`. Now you end up with A:3, B:2,
+      // but we only want A:2, B:2.
+
+      const returnTypes = await Promise.all(os.objectSets.map(async os => {
+        const counts = {};
+        const r = await calcObjectSet(os, {
+          ...ctx,
+          counts
+        });
+        return {
+          r,
+          counts
+        };
+      }));
+      for (const {
+        counts
+      } of returnTypes) {
+        for (const [k, v] of Object.entries(counts)) {
+          ctx.counts[k] = Math.max(ctx.counts[k] ?? 0, v);
+        }
+      }
+      if (returnTypes.length === 0) {
+        throw new Error(`Could not find any context types for set operation`);
+      }
+      const allMatch = returnTypes.every(({
+        r
+      }) => r.apiName === returnTypes[0].r.apiName);
+      if (!allMatch) {
+        throw new Error(`Incompatible context types found for set operation`);
+      }
+      return returnTypes[0].r;
+    case "withProperties":
+      // Everything in an RDP chain needs to invalidate us for now
+      for (const [, v] of Object.entries(os.derivedProperties)) {
+        await calcRdp(v, {
+          ...ctx,
+          methodInput: os.objectSet
+        });
+      }
+      return calcObjectSet(os.objectSet, {
+        ...ctx,
+        methodInput: os.objectSet
+      });
+
+    // used by rdps
+    case "methodInput":
+      !ctx.methodInput ? process.env.NODE_ENV !== "production" ? invariant(false, "methodInput must be provided") : invariant(false) : void 0;
+
+      // we only call this to get the context type, so we give it a new ctx
+      // otherwise it will double count everything
+      return await calcObjectSet(ctx.methodInput, {
+        ...ctx,
+        counts: {}
+      });
+    case "asType":
+    // we don't currently support this anywhere.
+    case "asBaseObjectTypes":
+    // We don't currently support this because it could return multiple object types conceptually
+    // internally, we actually use it this way but we shouldn't be finding that object sets.
+    case "reference":
+    // reference is particularly problematic because we cannot answer the question about
+    // which types without loading the object set definition (and it can change).
+    case "static":
+      // static is also a problem as we cannot know what the types are without loading them
+      throw new Error(`Unsupported ObjectSet type ${os.type}`);
+    case "nearestNeighbors":
+      return calcObjectSet(os.objectSet, ctx);
+    default:
+      throw new Error(`Unhandled ObjectSet type ${os.type}`);
+  }
+}
+async function calcRdp(dpd, ctx) {
+  switch (dpd.type) {
+    // Operates on object sets
+    case "selection":
+      return await calcObjectSet(dpd.objectSet, ctx);
+
+    // Operates on single property
+    case "negate":
+    case "extract":
+    case "absoluteValue":
+      return await calcRdp(dpd.property, ctx);
+
+    // Operates on many (unordered) properties
+    case "least":
+    case "greatest":
+    case "add":
+    case "multiply":
+      return await Promise.all(dpd.properties.map(innerDpd => calcRdp(innerDpd, ctx)));
+
+    // Operates on 2 ordered properties
+    case "subtract":
+    case "divide":
+      return await Promise.all([calcRdp(dpd.left, ctx), calcRdp(dpd.right, ctx)]);
+
+    // Operates on a single property name
+    case "property":
+      // noop
+      return;
+    default:
+      throw new Error(`Unhandled DerivedPropertyDefinition type ${dpd.type}`);
+  }
+}
+//# sourceMappingURL=getObjectTypesThatInvalidate.js.map

package/build/browser/observable/internal/getObjectTypesThatInvalidate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getObjectTypesThatInvalidate.js","names":["invariant","getObjectTypesThatInvalidate","mc","objectSet","counts","resultType","calcObjectSet","methodInput","undefined","ontologyProvider","tweaked","apiName","invalidationSet","Set","Object","entries","filter","v","map","k","os","ctx","op","bumpObject","objectType","getObjectDefinition","bumpInterface","interfaceDef","getInterfaceDefinition","s","implementedBy","type","interfaceType","srcDef","process","env","NODE_ENV","links","interfaceLink","targetType","Error","JSON","stringify","contextDef","link","returnTypes","Promise","all","objectSets","r","Math","max","length","allMatch","every","derivedProperties","calcRdp","dpd","property","properties","innerDpd","left","right"],"sources":["getObjectTypesThatInvalidate.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { InterfaceMetadata } from \"@osdk/api\";\nimport type {\n  DerivedPropertyDefinition,\n  ObjectSet as WireObjectSet,\n} from \"@osdk/foundry.ontologies\";\nimport invariant from \"tiny-invariant\";\nimport type { MinimalClient } from \"../../MinimalClientContext.js\";\nimport type {\n  FetchedObjectTypeDefinition,\n  OntologyProvider,\n} from \"../../ontology/OntologyProvider.js\";\n\n// Suppose we did an object set that is basically\n// A.where()\n//  pivot(B).where()\n//  pivot(C).where()\n//  pivot(A).where()\n//\n// Any change to A needs to invalidate the chain because of the inner most A.\n//\n// But B.pivotTo(A) does not need all A's to invalidate the chain.\n//\n// For now we are keeping things conservative and just invalidating A either way,\n// but we can make this better.\n\nexport async function getObjectTypesThatInvalidate(\n  mc: MinimalClient,\n  objectSet: WireObjectSet,\n): Promise<{\n  resultType: FetchedObjectTypeDefinition | InterfaceMetadata;\n  counts: Record<string, number>;\n  invalidationSet: Set<string>;\n}> {\n  const counts: Record<string, number> = {};\n\n  const resultType = await calcObjectSet(\n    objectSet,\n    { counts, methodInput: undefined, ontologyProvider: mc.ontologyProvider },\n  );\n\n  // we need to uncount the final result type\n  const tweaked = {\n    ...counts,\n    [resultType.apiName]: (counts[resultType.apiName]) - 1,\n  };\n\n  return {\n    resultType,\n    counts,\n    invalidationSet: new Set(\n      Object.entries(tweaked).filter(([, v]) => v > 0).map(([k]) => k),\n    ),\n  };\n}\n\ninterface Ctx {\n  counts: Record<string, number>;\n  methodInput: WireObjectSet | undefined;\n  ontologyProvider: OntologyProvider;\n}\n\nasync function calcObjectSet(\n  os: WireObjectSet,\n  ctx: Ctx,\n): Promise<FetchedObjectTypeDefinition | InterfaceMetadata> {\n  const op = ctx.ontologyProvider;\n\n  async function bumpObject(apiName: string) {\n    const objectType = await op.getObjectDefinition(apiName);\n    ctx.counts[apiName] = (ctx.counts[apiName] ?? 0) + 1;\n\n    return objectType;\n  }\n\n  async function bumpInterface(apiName: string) {\n    const interfaceDef = await op.getInterfaceDefinition(apiName);\n    for (const s of interfaceDef.implementedBy ?? []) {\n      ctx.counts[s] = (ctx.counts[s] ?? 0) + 1;\n    }\n    return interfaceDef;\n  }\n\n  switch (os.type) {\n    case \"base\":\n      return await bumpObject(os.objectType);\n\n    case \"interfaceBase\":\n      return await bumpInterface(os.interfaceType);\n\n    case \"interfaceLinkSearchAround\": {\n      const srcDef = await calcObjectSet(os.objectSet, ctx);\n      invariant(srcDef.type === \"interface\");\n\n      for (const [k, v] of Object.entries(srcDef.links)) {\n        if (k === os.interfaceLink) {\n          if (v.targetType === \"object\") {\n            return await bumpObject(v.targetType);\n          }\n          return await bumpInterface(v.targetType);\n        }\n      }\n\n      // if we got here then we did not find the link and something is wrong.\n      throw new Error(\n        `Could not find link ${os.interfaceLink} in object set ${\n          JSON.stringify(os.objectSet)\n        }`,\n      );\n    }\n\n    case \"searchAround\": {\n      const contextDef = await calcObjectSet(os.objectSet, ctx);\n      invariant(contextDef.type === \"object\");\n\n      for (const [k, v] of Object.entries(contextDef.links)) {\n        if (k === os.link) {\n          return await bumpObject(v.targetType);\n        }\n      }\n\n      // if we got here then we did not find the link and something is wrong.\n      throw new Error(\n        `Could not find link ${os.link} in object set ${\n          JSON.stringify(os.objectSet)\n        }`,\n      );\n    }\n\n    case \"filter\":\n      // for the simple version of this, we can ignore the filter being based on any RDPs because\n      // our RDP handling will ensure we invalidate based on those.\n      return calcObjectSet(os.objectSet, ctx);\n\n    case \"union\":\n    case \"subtract\":\n    case \"intersect\":\n      // all of these entries need their counts to be merged as the max of each\n\n      // suppose you have a simple `Union(A, A)`. We would end up with A:2\n      // but we only need A:1.\n\n      // suppose you have `Union(A->B, A->B)`. Now you end up with A:2, B:2,\n      // but we only want A:1, B:1.\n\n      // suppose you have `Union(A->B->A->B, A->B)`. Now you end up with A:3, B:2,\n      // but we only want A:2, B:2.\n\n      const returnTypes = await Promise.all(\n        os.objectSets.map(async (os) => {\n          const counts: Record<string, number> = {};\n          const r = await calcObjectSet(os, { ...ctx, counts });\n          return { r, counts };\n        }),\n      );\n\n      for (const { counts } of returnTypes) {\n        for (const [k, v] of Object.entries(counts)) {\n          ctx.counts[k] = Math.max(ctx.counts[k] ?? 0, v);\n        }\n      }\n\n      if (returnTypes.length === 0) {\n        throw new Error(\n          `Could not find any context types for set operation`,\n        );\n      }\n\n      const allMatch = returnTypes.every(({ r }) =>\n        r.apiName === returnTypes[0].r.apiName\n      );\n\n      if (!allMatch) {\n        throw new Error(\n          `Incompatible context types found for set operation`,\n        );\n      }\n\n      return returnTypes[0].r;\n\n    case \"withProperties\":\n      // Everything in an RDP chain needs to invalidate us for now\n      for (const [, v] of Object.entries(os.derivedProperties)) {\n        await calcRdp(v, { ...ctx, methodInput: os.objectSet });\n      }\n      return calcObjectSet(os.objectSet, { ...ctx, methodInput: os.objectSet });\n\n    // used by rdps\n    case \"methodInput\":\n      invariant(ctx.methodInput, \"methodInput must be provided\");\n\n      // we only call this to get the context type, so we give it a new ctx\n      // otherwise it will double count everything\n      return (await calcObjectSet(ctx.methodInput, { ...ctx, counts: {} }));\n\n    case \"asType\":\n      // we don't currently support this anywhere.\n    case \"asBaseObjectTypes\":\n      // We don't currently support this because it could return multiple object types conceptually\n      // internally, we actually use it this way but we shouldn't be finding that object sets.\n    case \"reference\":\n    // reference is particularly problematic because we cannot answer the question about\n    // which types without loading the object set definition (and it can change).\n    case \"static\":\n      // static is also a problem as we cannot know what the types are without loading them\n      throw new Error(`Unsupported ObjectSet type ${os.type}`);\n\n    case \"nearestNeighbors\":\n      return calcObjectSet(os.objectSet, ctx);\n\n    default:\n      throw new Error(\n        `Unhandled ObjectSet type ${(os as any).type}`,\n      );\n  }\n}\n\nasync function calcRdp(\n  dpd: DerivedPropertyDefinition,\n  ctx: Ctx,\n): Promise<unknown> {\n  switch (dpd.type) {\n    // Operates on object sets\n    case \"selection\":\n      return await calcObjectSet(dpd.objectSet, ctx);\n\n    // Operates on single property\n    case \"negate\":\n    case \"extract\":\n    case \"absoluteValue\":\n      return await calcRdp(dpd.property, ctx);\n\n    // Operates on many (unordered) properties\n    case \"least\":\n    case \"greatest\":\n    case \"add\":\n    case \"multiply\":\n      return await Promise.all(\n        dpd.properties.map(innerDpd => calcRdp(innerDpd, ctx)),\n      );\n\n    // Operates on 2 ordered properties\n    case \"subtract\":\n    case \"divide\":\n      return await Promise.all([\n        calcRdp(dpd.left, ctx),\n        calcRdp(dpd.right, ctx),\n      ]);\n\n    // Operates on a single property name\n    case \"property\":\n      // noop\n      return;\n\n    default:\n      throw new Error(\n        `Unhandled DerivedPropertyDefinition type ${(dpd as any).type}`,\n      );\n  }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAOA,OAAOA,SAAS,MAAM,gBAAgB;AAOtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO,eAAeC,4BAA4BA,CAChDC,EAAiB,EACjBC,SAAwB,EAKvB;EACD,MAAMC,MAA8B,GAAG,CAAC,CAAC;EAEzC,MAAMC,UAAU,GAAG,MAAMC,aAAa,CACpCH,SAAS,EACT;IAAEC,MAAM;IAAEG,WAAW,EAAEC,SAAS;IAAEC,gBAAgB,EAAEP,EAAE,CAACO;EAAiB,CAC1E,CAAC;;EAED;EACA,MAAMC,OAAO,GAAG;IACd,GAAGN,MAAM;IACT,CAACC,UAAU,CAACM,OAAO,GAAIP,MAAM,CAACC,UAAU,CAACM,OAAO,CAAC,GAAI;EACvD,CAAC;EAED,OAAO;IACLN,UAAU;IACVD,MAAM;IACNQ,eAAe,EAAE,IAAIC,GAAG,CACtBC,MAAM,CAACC,OAAO,CAACL,OAAO,CAAC,CAACM,MAAM,CAAC,CAAC,GAAGC,CAAC,CAAC,KAAKA,CAAC,GAAG,CAAC,CAAC,CAACC,GAAG,CAAC,CAAC,CAACC,CAAC,CAAC,KAAKA,CAAC,CACjE;EACF,CAAC;AACH;AAQA,eAAeb,aAAaA,CAC1Bc,EAAiB,EACjBC,GAAQ,EACkD;EAC1D,MAAMC,EAAE,GAAGD,GAAG,CAACZ,gBAAgB;EAE/B,eAAec,UAAUA,CAACZ,OAAe,EAAE;IACzC,MAAMa,UAAU,GAAG,MAAMF,EAAE,CAACG,mBAAmB,CAACd,OAAO,CAAC;IACxDU,GAAG,CAACjB,MAAM,CAACO,OAAO,CAAC,GAAG,CAACU,GAAG,CAACjB,MAAM,CAACO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;IAEpD,OAAOa,UAAU;EACnB;EAEA,eAAeE,aAAaA,CAACf,OAAe,EAAE;IAC5C,MAAMgB,YAAY,GAAG,MAAML,EAAE,CAACM,sBAAsB,CAACjB,OAAO,CAAC;IAC7D,KAAK,MAAMkB,CAAC,IAAIF,YAAY,CAACG,aAAa,IAAI,EAAE,EAAE;MAChDT,GAAG,CAACjB,MAAM,CAACyB,CAAC,CAAC,GAAG,CAACR,GAAG,CAACjB,MAAM,CAACyB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1C;IACA,OAAOF,YAAY;EACrB;EAEA,QAAQP,EAAE,CAACW,IAAI;IACb,KAAK,MAAM;MACT,OAAO,MAAMR,UAAU,CAACH,EAAE,CAACI,UAAU,CAAC;IAExC,KAAK,eAAe;MAClB,OAAO,MAAME,aAAa,CAACN,EAAE,CAACY,aAAa,CAAC;IAE9C,KAAK,2BAA2B;MAAE;QAChC,MAAMC,MAAM,GAAG,MAAM3B,aAAa,CAACc,EAAE,CAACjB,SAAS,EAAEkB,GAAG,CAAC;QACrD,EAAUY,MAAM,CAACF,IAAI,KAAK,WAAW,IAAAG,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAArCpC,SAAS,UAATA,SAAS;QAET,KAAK,MAAM,CAACmB,CAAC,EAAEF,CAAC,CAAC,IAAIH,MAAM,CAACC,OAAO,CAACkB,MAAM,CAACI,KAAK,CAAC,EAAE;UACjD,IAAIlB,CAAC,KAAKC,EAAE,CAACkB,aAAa,EAAE;YAC1B,IAAIrB,CAAC,CAACsB,UAAU,KAAK,QAAQ,EAAE;cAC7B,OAAO,MAAMhB,UAAU,CAACN,CAAC,CAACsB,UAAU,CAAC;YACvC;YACA,OAAO,MAAMb,aAAa,CAACT,CAAC,CAACsB,UAAU,CAAC;UAC1C;QACF;;QAEA;QACA,MAAM,IAAIC,KAAK,CACb,uBAAuBpB,EAAE,CAACkB,aAAa,kBACrCG,IAAI,CAACC,SAAS,CAACtB,EAAE,CAACjB,SAAS,CAAC,EAEhC,CAAC;MACH;IAEA,KAAK,cAAc;MAAE;QACnB,MAAMwC,UAAU,GAAG,MAAMrC,aAAa,CAACc,EAAE,CAACjB,SAAS,EAAEkB,GAAG,CAAC;QACzD,EAAUsB,UAAU,CAACZ,IAAI,KAAK,QAAQ,IAAAG,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAAtCpC,SAAS,UAATA,SAAS;QAET,KAAK,MAAM,CAACmB,CAAC,EAAEF,CAAC,CAAC,IAAIH,MAAM,CAACC,OAAO,CAAC4B,UAAU,CAACN,KAAK,CAAC,EAAE;UACrD,IAAIlB,CAAC,KAAKC,EAAE,CAACwB,IAAI,EAAE;YACjB,OAAO,MAAMrB,UAAU,CAACN,CAAC,CAACsB,UAAU,CAAC;UACvC;QACF;;QAEA;QACA,MAAM,IAAIC,KAAK,CACb,uBAAuBpB,EAAE,CAACwB,IAAI,kBAC5BH,IAAI,CAACC,SAAS,CAACtB,EAAE,CAACjB,SAAS,CAAC,EAEhC,CAAC;MACH;IAEA,KAAK,QAAQ;MACX;MACA;MACA,OAAOG,aAAa,CAACc,EAAE,CAACjB,SAAS,EAAEkB,GAAG,CAAC;IAEzC,KAAK,OAAO;IACZ,KAAK,UAAU;IACf,KAAK,WAAW;MACd;;MAEA;MACA;;MAEA;MACA;;MAEA;MACA;;MAEA,MAAMwB,WAAW,GAAG,MAAMC,OAAO,CAACC,GAAG,CACnC3B,EAAE,CAAC4B,UAAU,CAAC9B,GAAG,CAAC,MAAOE,EAAE,IAAK;QAC9B,MAAMhB,MAA8B,GAAG,CAAC,CAAC;QACzC,MAAM6C,CAAC,GAAG,MAAM3C,aAAa,CAACc,EAAE,EAAE;UAAE,GAAGC,GAAG;UAAEjB;QAAO,CAAC,CAAC;QACrD,OAAO;UAAE6C,CAAC;UAAE7C;QAAO,CAAC;MACtB,CAAC,CACH,CAAC;MAED,KAAK,MAAM;QAAEA;MAAO,CAAC,IAAIyC,WAAW,EAAE;QACpC,KAAK,MAAM,CAAC1B,CAAC,EAAEF,CAAC,CAAC,IAAIH,MAAM,CAACC,OAAO,CAACX,MAAM,CAAC,EAAE;UAC3CiB,GAAG,CAACjB,MAAM,CAACe,CAAC,CAAC,GAAG+B,IAAI,CAACC,GAAG,CAAC9B,GAAG,CAACjB,MAAM,CAACe,CAAC,CAAC,IAAI,CAAC,EAAEF,CAAC,CAAC;QACjD;MACF;MAEA,IAAI4B,WAAW,CAACO,MAAM,KAAK,CAAC,EAAE;QAC5B,MAAM,IAAIZ,KAAK,CACb,oDACF,CAAC;MACH;MAEA,MAAMa,QAAQ,GAAGR,WAAW,CAACS,KAAK,CAAC,CAAC;QAAEL;MAAE,CAAC,KACvCA,CAAC,CAACtC,OAAO,KAAKkC,WAAW,CAAC,CAAC,CAAC,CAACI,CAAC,CAACtC,OACjC,CAAC;MAED,IAAI,CAAC0C,QAAQ,EAAE;QACb,MAAM,IAAIb,KAAK,CACb,oDACF,CAAC;MACH;MAEA,OAAOK,WAAW,CAAC,CAAC,CAAC,CAACI,CAAC;IAEzB,KAAK,gBAAgB;MACnB;MACA,KAAK,MAAM,GAAGhC,CAAC,CAAC,IAAIH,MAAM,CAACC,OAAO,CAACK,EAAE,CAACmC,iBAAiB,CAAC,EAAE;QACxD,MAAMC,OAAO,CAACvC,CAAC,EAAE;UAAE,GAAGI,GAAG;UAAEd,WAAW,EAAEa,EAAE,CAACjB;QAAU,CAAC,CAAC;MACzD;MACA,OAAOG,aAAa,CAACc,EAAE,CAACjB,SAAS,EAAE;QAAE,GAAGkB,GAAG;QAAEd,WAAW,EAAEa,EAAE,CAACjB;MAAU,CAAC,CAAC;;IAE3E;IACA,KAAK,aAAa;MAChB,CAAUkB,GAAG,CAACd,WAAW,GAAA2B,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAAzBpC,SAAS,QAAkB,8BAA8B,IAAzDA,SAAS;;MAET;MACA;MACA,OAAQ,MAAMM,aAAa,CAACe,GAAG,CAACd,WAAW,EAAE;QAAE,GAAGc,GAAG;QAAEjB,MAAM,EAAE,CAAC;MAAE,CAAC,CAAC;IAEtE,KAAK,QAAQ;IACX;IACF,KAAK,mBAAmB;IACtB;IACA;IACF,KAAK,WAAW;IAChB;IACA;IACA,KAAK,QAAQ;MACX;MACA,MAAM,IAAIoC,KAAK,CAAC,8BAA8BpB,EAAE,CAACW,IAAI,EAAE,CAAC;IAE1D,KAAK,kBAAkB;MACrB,OAAOzB,aAAa,CAACc,EAAE,CAACjB,SAAS,EAAEkB,GAAG,CAAC;IAEzC;MACE,MAAM,IAAImB,KAAK,CACb,4BAA6BpB,EAAE,CAASW,IAAI,EAC9C,CAAC;EACL;AACF;AAEA,eAAeyB,OAAOA,CACpBC,GAA8B,EAC9BpC,GAAQ,EACU;EAClB,QAAQoC,GAAG,CAAC1B,IAAI;IACd;IACA,KAAK,WAAW;MACd,OAAO,MAAMzB,aAAa,CAACmD,GAAG,CAACtD,SAAS,EAAEkB,GAAG,CAAC;;IAEhD;IACA,KAAK,QAAQ;IACb,KAAK,SAAS;IACd,KAAK,eAAe;MAClB,OAAO,MAAMmC,OAAO,CAACC,GAAG,CAACC,QAAQ,EAAErC,GAAG,CAAC;;IAEzC;IACA,KAAK,OAAO;IACZ,KAAK,UAAU;IACf,KAAK,KAAK;IACV,KAAK,UAAU;MACb,OAAO,MAAMyB,OAAO,CAACC,GAAG,CACtBU,GAAG,CAACE,UAAU,CAACzC,GAAG,CAAC0C,QAAQ,IAAIJ,OAAO,CAACI,QAAQ,EAAEvC,GAAG,CAAC,CACvD,CAAC;;IAEH;IACA,KAAK,UAAU;IACf,KAAK,QAAQ;MACX,OAAO,MAAMyB,OAAO,CAACC,GAAG,CAAC,CACvBS,OAAO,CAACC,GAAG,CAACI,IAAI,EAAExC,GAAG,CAAC,EACtBmC,OAAO,CAACC,GAAG,CAACK,KAAK,EAAEzC,GAAG,CAAC,CACxB,CAAC;;IAEJ;IACA,KAAK,UAAU;MACb;MACA;IAEF;MACE,MAAM,IAAImB,KAAK,CACb,4CAA6CiB,GAAG,CAAS1B,IAAI,EAC/D,CAAC;EACL;AACF","ignoreList":[]}