@dxos/effect 0.8.4-main.67995b8 → 0.8.4-main.72ec0f3

package/dist/lib/browser/index.mjs

@@ -1,13 +1,19 @@
 import "@dxos/node-std/globals";
 
 // src/ast.ts
-import { Option, pipe, SchemaAST, Schema } from "effect";
-import { isUndefinedKeyword } from "effect/SchemaAST";
+import * as Function from "effect/Function";
+import * as Option from "effect/Option";
+import * as Schema from "effect/Schema";
+import * as SchemaAST from "effect/SchemaAST";
 import { invariant } from "@dxos/invariant";
 import { isNonNullable } from "@dxos/util";
 var __dxlog_file = "/__w/dxos/dxos/packages/common/effect/src/ast.ts";
+var isTupleType2 = (node) => {
+  return SchemaAST.isTupleType(node) && node.elements.length > 0;
+};
 var getSimpleType = (node) => {
-  if (SchemaAST.isDeclaration(node) || SchemaAST.isObjectKeyword(node) || SchemaAST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {
+  if (SchemaAST.isDeclaration(node) || SchemaAST.isObjectKeyword(node) || SchemaAST.isTypeLiteral(node) || // TODO(wittjosiah): Tuples are actually arrays.
+  isTupleType2(node) || isDiscriminatedUnion(node)) {
     return "object";
   }
   if (SchemaAST.isStringKeyword(node)) {
@@ -48,12 +54,12 @@ var isSimpleType = (node) => !!getSimpleType(node);
     }
   };
 })(SimpleType || (SimpleType = {}));
-var VisitResult = /* @__PURE__ */ function(VisitResult2) {
+var VisitResult = /* @__PURE__ */ (function(VisitResult2) {
   VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
   VisitResult2[VisitResult2["SKIP"] = 1] = "SKIP";
   VisitResult2[VisitResult2["EXIT"] = 2] = "EXIT";
   return VisitResult2;
-}({});
+})({});
 var defaultTest = isSimpleType;
 var visit = (node, testOrVisitor, visitor) => {
   if (!visitor) {
@@ -63,8 +69,8 @@ var visit = (node, testOrVisitor, visitor) => {
   }
 };
 var visitNode = (node, test, visitor, path = [], depth = 0) => {
-  const _result = test?.(node, path, depth);
-  const result = _result === void 0 ? 0 : typeof _result === "boolean" ? _result ? 0 : 1 : _result;
+  const $result = test?.(node, path, depth);
+  const result = $result === void 0 ? 0 : typeof $result === "boolean" ? $result ? 0 : 1 : $result;
   if (result === 2) {
     return result;
   }
@@ -117,6 +123,12 @@ var findNode = (node, test) => {
         return child;
       }
     }
+    for (const prop of getIndexSignatures(node)) {
+      const child = findNode(prop.type, test);
+      if (child) {
+        return child;
+      }
+    }
   } else if (SchemaAST.isTupleType(node)) {
     for (const [_, element] of node.elements.entries()) {
       const child = findNode(element.type, test);
@@ -125,12 +137,13 @@ var findNode = (node, test) => {
       }
     }
   } else if (SchemaAST.isUnion(node)) {
-    if (isOption(node)) {
-      for (const type of node.types) {
-        const child = findNode(type, test);
-        if (child) {
-          return child;
-        }
+    if (isLiteralUnion(node)) {
+      return void 0;
+    }
+    for (const type of node.types) {
+      const child = findNode(type, test);
+      if (child) {
+        return child;
       }
     }
   } else if (SchemaAST.isRefinement(node)) {
@@ -143,7 +156,7 @@ var findProperty = (schema, path) => {
     const typeNode = findNode(node, SchemaAST.isTypeLiteral);
     invariant(typeNode, void 0, {
       F: __dxlog_file,
-      L: 247,
+      L: 265,
       S: void 0,
       A: [
         "typeNode",
@@ -168,16 +181,16 @@ var defaultAnnotations = {
   ["NumberKeyword"]: SchemaAST.numberKeyword,
   ["BooleanKeyword"]: SchemaAST.booleanKeyword
 };
-var getAnnotation = (annotationId, noDefault = true) => (node) => {
-  const id = pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);
-  const value = pipe(SchemaAST.getAnnotation(annotationId)(node), Option.getOrUndefined);
+var getAnnotation2 = (annotationId, noDefault = true) => (node) => {
+  const id = Function.pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);
+  const value = Function.pipe(SchemaAST.getAnnotation(annotationId)(node), Option.getOrUndefined);
   if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {
     return void 0;
   }
   return value;
 };
 var findAnnotation = (node, annotationId, noDefault = true) => {
-  const getAnnotationById = getAnnotation(annotationId, noDefault);
+  const getAnnotationById = getAnnotation2(annotationId, noDefault);
   const getBaseAnnotation = (node2) => {
     const value = getAnnotationById(node2);
     if (value !== void 0) {
@@ -203,7 +216,7 @@ var isDiscriminatedUnion = (node) => {
 var getDiscriminatingProps = (node) => {
   invariant(SchemaAST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 344,
+    L: 362,
     S: void 0,
     A: [
       "SchemaAST.isUnion(node)",
@@ -221,7 +234,7 @@ var getDiscriminatingProps = (node) => {
 var getDiscriminatedType = (node, value = {}) => {
   invariant(SchemaAST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 368,
+    L: 386,
     S: void 0,
     A: [
       "SchemaAST.isUnion(node)",
@@ -230,7 +243,7 @@ var getDiscriminatedType = (node, value = {}) => {
   });
   invariant(value, void 0, {
     F: __dxlog_file,
-    L: 369,
+    L: 387,
     S: void 0,
     A: [
       "value",
@@ -245,7 +258,7 @@ var getDiscriminatedType = (node, value = {}) => {
     const match = SchemaAST.getPropertySignatures(type).filter((prop) => props?.includes(prop.name.toString())).every((prop) => {
       invariant(SchemaAST.isLiteral(prop.type), void 0, {
         F: __dxlog_file,
-        L: 380,
+        L: 398,
         S: void 0,
         A: [
           "SchemaAST.isLiteral(prop.type)",
@@ -263,7 +276,7 @@ var getDiscriminatedType = (node, value = {}) => {
       const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop);
       invariant(SchemaAST.isLiteral(literal.type), void 0, {
         F: __dxlog_file,
-        L: 398,
+        L: 416,
         S: void 0,
         A: [
           "SchemaAST.isLiteral(literal.type)",
@@ -283,7 +296,7 @@ var getDiscriminatedType = (node, value = {}) => {
 var mapAst = (ast, f) => {
   switch (ast._tag) {
     case "TypeLiteral": {
-      return new SchemaAST.TypeLiteral(ast.propertySignatures.map((prop) => new SchemaAST.PropertySignature(prop.name, f(prop.type, prop.name), prop.isOptional, prop.isReadonly, prop.annotations)), ast.indexSignatures);
+      return new SchemaAST.TypeLiteral(ast.propertySignatures.map((prop) => new SchemaAST.PropertySignature(prop.name, f(prop.type, prop.name), prop.isOptional, prop.isReadonly, prop.annotations)), ast.indexSignatures, ast.annotations);
     }
     case "Union": {
       return SchemaAST.Union.make(ast.types.map(f), ast.annotations);
@@ -301,12 +314,28 @@ var mapAst = (ast, f) => {
   }
 };
 var isArrayType = (node) => {
-  return SchemaAST.isTupleType(node) || SchemaAST.isUnion(node) && node.types.some(isArrayType) && node.types.some(isUndefinedKeyword) && node.types.length === 2;
+  return SchemaAST.isTupleType(node) || SchemaAST.isUnion(node) && node.types.some(isArrayType) && node.types.some(SchemaAST.isUndefinedKeyword) && node.types.length === 2;
+};
+var getIndexSignatures = (ast) => {
+  const annotation = SchemaAST.getSurrogateAnnotation(ast);
+  if (Option.isSome(annotation)) {
+    return getIndexSignatures(annotation.value);
+  }
+  switch (ast._tag) {
+    case "TypeLiteral":
+      return ast.indexSignatures.slice();
+    case "Suspend":
+      return getIndexSignatures(ast.f());
+    case "Refinement":
+      return getIndexSignatures(ast.from);
+  }
+  return [];
 };
 var SimpleType;
 
 // src/jsonPath.ts
-import { Schema as Schema2, Option as Option2 } from "effect";
+import * as Option2 from "effect/Option";
+import * as Schema2 from "effect/Schema";
 import { JSONPath } from "jsonpath-plus";
 import { invariant as invariant2 } from "@dxos/invariant";
 var __dxlog_file2 = "/__w/dxos/dxos/packages/common/effect/src/jsonPath.ts";
@@ -332,7 +361,7 @@ var createJsonPath = (path) => {
   }).join("");
   invariant2(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`, {
     F: __dxlog_file2,
-    L: 63,
+    L: 65,
     S: void 0,
     A: [
       "isJsonPath(candidatePath)",
@@ -345,7 +374,7 @@ var fromEffectValidationPath = (effectPath) => {
   const jsonPath = effectPath.replace(/\.\[(\d+)\]/g, "[$1]");
   invariant2(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`, {
     F: __dxlog_file2,
-    L: 74,
+    L: 76,
     S: void 0,
     A: [
       "isJsonPath(jsonPath)",
@@ -368,7 +397,9 @@ var getField = (object, path) => {
 };
 
 // src/url.ts
-import { SchemaAST as SchemaAST2, Option as Option3, pipe as pipe2 } from "effect";
+import * as Function2 from "effect/Function";
+import * as Option3 from "effect/Option";
+import * as SchemaAST2 from "effect/SchemaAST";
 import { decamelize } from "@dxos/util";
 var ParamKeyAnnotationId = Symbol.for("@dxos/schema/annotation/ParamKey");
 var getParamKeyAnnotation = SchemaAST2.getAnnotation(ParamKeyAnnotationId);
@@ -376,6 +407,7 @@ var ParamKeyAnnotation = (value) => (self) => self.annotations({
   [ParamKeyAnnotationId]: value
 });
 var UrlParser = class {
+  _schema;
   constructor(_schema) {
     this._schema = _schema;
   }
@@ -410,7 +442,7 @@ var UrlParser = class {
       if (value !== void 0) {
         const field = this._schema.fields[key];
         if (field) {
-          const { key: serializedKey } = pipe2(getParamKeyAnnotation(field.ast), Option3.getOrElse(() => ({
+          const { key: serializedKey } = Function2.pipe(getParamKeyAnnotation(field.ast), Option3.getOrElse(() => ({
             key: decamelize(key)
           })));
           url.searchParams.set(serializedKey, String(value));
@@ -422,20 +454,25 @@ var UrlParser = class {
 };
 
 // src/context.ts
-import { Effect } from "effect";
+import * as Effect from "effect/Effect";
 import { Context } from "@dxos/context";
 var __dxlog_file3 = "/__w/dxos/dxos/packages/common/effect/src/context.ts";
 var contextFromScope = () => Effect.gen(function* () {
   const ctx = new Context(void 0, {
     F: __dxlog_file3,
-    L: 12
+    L: 13
   });
   yield* Effect.addFinalizer(() => Effect.promise(() => ctx.dispose()));
   return ctx;
 });
 
 // src/errors.ts
-import { Cause, Chunk, Effect as Effect2, Exit, GlobalValue, Option as Option4 } from "effect";
+import * as Cause from "effect/Cause";
+import * as Chunk from "effect/Chunk";
+import * as Effect2 from "effect/Effect";
+import * as Exit from "effect/Exit";
+import * as GlobalValue from "effect/GlobalValue";
+import * as Option4 from "effect/Option";
 var spanSymbol = Symbol.for("effect/SpanAnnotation");
 var originalSymbol = Symbol.for("effect/OriginalAnnotation");
 var spanToTrace = GlobalValue.globalValue("effect/Tracer/spanToTrace", () => /* @__PURE__ */ new WeakMap());
@@ -505,19 +542,15 @@ var prettyErrorStack = (error, appendStacks = []) => {
   });
   return error;
 };
-var runAndForwardErrors = async (effect, options) => {
-  const exit = await Effect2.runPromiseExit(effect, options);
-  if (Exit.isSuccess(exit)) {
-    return exit.value;
-  }
-  if (Cause.isEmpty(exit.cause)) {
-    throw new Error("Fiber failed without a cause");
-  } else if (Cause.isInterrupted(exit.cause)) {
-    throw new Error("Fiber was interrupted");
+var causeToError = (cause) => {
+  if (Cause.isEmpty(cause)) {
+    return new Error("Fiber failed without a cause");
+  } else if (Cause.isInterruptedOnly(cause)) {
+    return new Error("Fiber was interrupted");
   } else {
     const errors = [
-      ...Chunk.toArray(Cause.failures(exit.cause)),
-      ...Chunk.toArray(Cause.defects(exit.cause))
+      ...Chunk.toArray(Cause.failures(cause)),
+      ...Chunk.toArray(Cause.defects(cause))
     ];
     const getStackFrames = () => {
       const o = {};
@@ -527,15 +560,37 @@ var runAndForwardErrors = async (effect, options) => {
     const stackFrames = getStackFrames();
     const newErrors = errors.map((error) => prettyErrorStack(error, stackFrames));
     if (newErrors.length === 1) {
-      throw newErrors[0];
+      return newErrors[0];
     } else {
-      throw new AggregateError(newErrors);
+      return new AggregateError(newErrors);
     }
   }
 };
+var throwCause = (cause) => {
+  throw causeToError(cause);
+};
+var unwrapExit = (exit) => {
+  if (Exit.isSuccess(exit)) {
+    return exit.value;
+  }
+  return throwCause(exit.cause);
+};
+var runAndForwardErrors = async (effect, options) => {
+  const exit = await Effect2.runPromiseExit(effect, options);
+  return unwrapExit(exit);
+};
+var promiseWithCauseCapture = (evaluate) => Effect2.promise(async (signal) => {
+  try {
+    const result = await evaluate(signal);
+    return Effect2.succeed(result);
+  } catch (err) {
+    return Effect2.die(err);
+  }
+}).pipe(Effect2.flatten);
 
 // src/testing.ts
-import { Effect as Effect3 } from "effect";
+import * as Context2 from "effect/Context";
+import * as Effect3 from "effect/Effect";
 (function(TestHelpers2) {
   TestHelpers2.runIf = (condition) => (effect, ctx) => Effect3.gen(function* () {
     if (!condition) {
@@ -551,12 +606,22 @@ import { Effect as Effect3 } from "effect";
       return yield* effect;
     }
   });
+  TestHelpers2.taggedTest = (tag) => (effect, ctx) => Effect3.gen(function* () {
+    if (!process.env.DX_TEST_TAGS?.includes(tag)) {
+      ctx.skip();
+    } else {
+      return yield* effect;
+    }
+  });
+  TestHelpers2.provideTestContext = (effect, ctx) => Effect3.provideService(effect, TestContextService, ctx);
 })(TestHelpers || (TestHelpers = {}));
+var TestContextService = class extends Context2.Tag("@dxos/effect/TestContextService")() {
+};
 var TestHelpers;
 
 // src/resource.ts
-import { Effect as Effect4 } from "effect";
-var accuireReleaseResource = (getResource) => Effect4.acquireRelease(Effect4.gen(function* () {
+import * as Effect4 from "effect/Effect";
+var acquireReleaseResource = (getResource) => Effect4.acquireRelease(Effect4.gen(function* () {
   const resource = getResource();
   yield* Effect4.promise(async () => {
     resource.open?.();
@@ -572,17 +637,19 @@ export {
   JsonProp,
   ParamKeyAnnotation,
   SimpleType,
+  TestContextService,
   TestHelpers,
   UrlParser,
   VisitResult,
-  accuireReleaseResource,
+  acquireReleaseResource,
+  causeToError,
   contextFromScope,
   createJsonPath,
   findAnnotation,
   findNode,
   findProperty,
   fromEffectValidationPath,
-  getAnnotation,
+  getAnnotation2 as getAnnotation,
   getDiscriminatedType,
   getDiscriminatingProps,
   getField,
@@ -595,8 +662,11 @@ export {
   isOption,
   isSimpleType,
   mapAst,
+  promiseWithCauseCapture,
   runAndForwardErrors,
   splitJsonPath,
+  throwCause,
+  unwrapExit,
   visit
 };
 //# sourceMappingURL=index.mjs.map

package/dist/lib/browser/index.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/ast.ts", "../../../src/jsonPath.ts", "../../../src/url.ts", "../../../src/context.ts", "../../../src/errors.ts", "../../../src/testing.ts", "../../../src/resource.ts"],
-  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport { Option, pipe, SchemaAST, Schema } from 'effect';\nimport { isUndefinedKeyword } from 'effect/SchemaAST';\n\nimport { invariant } from '@dxos/invariant';\nimport { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/SchemaAST.ts.html\n//\n\nexport type SimpleType = 'object' | 'string' | 'number' | 'boolean' | 'enum' | 'literal';\n\n/**\n * Get the base type; e.g., traverse through refinements.\n */\nexport const getSimpleType = (node: SchemaAST.AST): SimpleType | undefined => {\n  if (\n    SchemaAST.isDeclaration(node) ||\n    SchemaAST.isObjectKeyword(node) ||\n    SchemaAST.isTypeLiteral(node) ||\n    isDiscriminatedUnion(node)\n  ) {\n    return 'object';\n  }\n\n  if (SchemaAST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (SchemaAST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (SchemaAST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (SchemaAST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (SchemaAST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: SchemaAST.AST): boolean => !!getSimpleType(node);\n\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n  CONTINUE = 0,\n  /**\n   * Skip visiting children.\n   */\n  SKIP = 1,\n  /**\n   * Stop traversing immediately.\n   */\n  EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: SchemaAST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: SchemaAST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: TestFn = isSimpleType;\n\n/**\n * Visit leaf nodes.\n * Refs:\n * - https://github.com/syntax-tree/unist-util-visit?tab=readme-ov-file#visitor\n * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test\n */\nexport const visit: {\n  (node: SchemaAST.AST, visitor: VisitorFn): void;\n  (node: SchemaAST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: SchemaAST.AST, testOrVisitor: TestFn | VisitorFn, visitor?: VisitorFn): void => {\n  if (!visitor) {\n    visitNode(node, defaultTest, testOrVisitor);\n  } else {\n    visitNode(node, testOrVisitor as TestFn, visitor);\n  }\n};\n\nconst visitNode = (\n  node: SchemaAST.AST,\n  test: TestFn | undefined,\n  visitor: VisitorFn,\n  path: Path = [],\n  depth = 0,\n): VisitResult | undefined => {\n  const _result = test?.(node, path, depth);\n  const result: VisitResult =\n    _result === undefined\n      ? VisitResult.CONTINUE\n      : typeof _result === 'boolean'\n        ? _result\n          ? VisitResult.CONTINUE\n          : VisitResult.SKIP\n        : _result;\n\n  if (result === VisitResult.EXIT) {\n    return result;\n  }\n  if (result !== VisitResult.SKIP) {\n    visitor(node, path, depth);\n  }\n\n  // Object.\n  if (SchemaAST.isTypeLiteral(node)) {\n    for (const prop of SchemaAST.getPropertySignatures(node)) {\n      const currentPath = [...path, prop.name.toString()];\n      const result = visitNode(prop.type, test, visitor, currentPath, depth + 1);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Array.\n  else if (SchemaAST.isTupleType(node)) {\n    for (const [i, element] of node.elements.entries()) {\n      const currentPath = [...path, i];\n      const result = visitNode(element.type, test, visitor, currentPath, depth);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Branching union (e.g., optional, discriminated unions).\n  else if (SchemaAST.isUnion(node)) {\n    for (const type of node.types) {\n      const result = visitNode(type, test, visitor, path, depth);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Refinement.\n  else if (SchemaAST.isRefinement(node)) {\n    const result = visitNode(node.from, test, visitor, path, depth);\n    if (result === VisitResult.EXIT) {\n      return result;\n    }\n  }\n\n  // TODO(burdon): Transforms?\n};\n\n/**\n * Recursively descend into AST to find first node that passes the test.\n */\n// TODO(burdon): Rewrite using visitNode?\nexport const findNode = (node: SchemaAST.AST, test: (node: SchemaAST.AST) => boolean): SchemaAST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (SchemaAST.isTypeLiteral(node)) {\n    for (const prop of SchemaAST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (SchemaAST.isTupleType(node)) {\n    for (const [_, element] of node.elements.entries()) {\n      const child = findNode(element.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Branching union (e.g., optional, discriminated unions).\n  else if (SchemaAST.isUnion(node)) {\n    if (isOption(node)) {\n      for (const type of node.types) {\n        const child = findNode(type, test);\n        if (child) {\n          return child;\n        }\n      }\n    }\n  }\n\n  // Refinement.\n  else if (SchemaAST.isRefinement(node)) {\n    return findNode(node.from, test);\n  }\n};\n\n/**\n * Get the AST node for the given property (dot-path).\n */\nexport const findProperty = (\n  schema: Schema.Schema.AnyNoContext,\n  path: JsonPath | JsonProp,\n): SchemaAST.AST | undefined => {\n  const getProp = (node: SchemaAST.AST, path: JsonProp[]): SchemaAST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, SchemaAST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of SchemaAST.getPropertySignatures(typeNode)) {\n      if (prop.name === name) {\n        if (rest.length) {\n          return getProp(prop.type, rest);\n        } else {\n          return prop.type;\n        }\n      }\n    }\n  };\n\n  return getProp(schema.ast, path.split('.') as JsonProp[]);\n};\n\n//\n// Annotations\n//\n\nconst defaultAnnotations: Record<string, SchemaAST.Annotated> = {\n  ['ObjectKeyword' as const]: SchemaAST.objectKeyword,\n  ['StringKeyword' as const]: SchemaAST.stringKeyword,\n  ['NumberKeyword' as const]: SchemaAST.numberKeyword,\n  ['BooleanKeyword' as const]: SchemaAST.booleanKeyword,\n};\n\n/**\n * Get annotation or return undefined.\n * @param annotationId\n * @param noDefault If true, then return undefined for effect library defined values.\n */\nexport const getAnnotation =\n  <T>(annotationId: symbol, noDefault = true) =>\n  (node: SchemaAST.AST): T | undefined => {\n    // Title fallback seems to be the identifier.\n    const id = pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = pipe(SchemaAST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: SchemaAST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n  const getBaseAnnotation = (node: SchemaAST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      return value as T;\n    }\n\n    if (SchemaAST.isUnion(node)) {\n      if (isOption(node)) {\n        return getAnnotationById(node.types[0]) as T;\n      }\n    }\n  };\n\n  return getBaseAnnotation(node);\n};\n\n//\n// Unions\n//\n\n/**\n * Effect Schema.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && node.types.length === 2 && SchemaAST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && node.types.every(SchemaAST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: SchemaAST.AST): string[] | undefined => {\n  invariant(SchemaAST.isUnion(node));\n  if (isOption(node)) {\n    return;\n  }\n\n  // Get common literals across all types.\n  return node.types.reduce<string[]>((shared, type) => {\n    const props = SchemaAST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => SchemaAST.isLiteral(p.type))\n      .map((p) => p.name.toString());\n\n    // Return common literals.\n    return shared.length === 0 ? props : shared.filter((prop) => props.includes(prop));\n  }, []);\n};\n\n/**\n * Get the discriminated type for the given value.\n */\nexport const getDiscriminatedType = (\n  node: SchemaAST.AST,\n  value: Record<string, any> = {},\n): SchemaAST.AST | undefined => {\n  invariant(SchemaAST.isUnion(node));\n  invariant(value);\n  const props = getDiscriminatingProps(node);\n  if (!props?.length) {\n    return;\n  }\n\n  // Match provided values.\n  for (const type of node.types) {\n    const match = SchemaAST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(SchemaAST.isLiteral(prop.type));\n        return prop.type.literal === value[prop.name.toString()];\n      });\n\n    if (match) {\n      return type;\n    }\n  }\n\n  // Create union of discriminating properties.\n  // NOTE: This may not work with non-overlapping variants.\n  // TODO(burdon): Iterate through props and knock-out variants that don't match.\n  const fields = Object.fromEntries(\n    props\n      .map((prop) => {\n        const literals = node.types\n          .map((type) => {\n            const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(SchemaAST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(isNonNullable);\n\n        return literals.length ? [prop, Schema.Literal(...literals)] : undefined;\n      })\n      .filter(isNonNullable),\n  );\n\n  const schema = Schema.Struct(fields);\n  return schema.ast;\n};\n\n/**\n * Maps AST nodes.\n * The user is responsible for recursively calling {@link mapAst} on the SchemaAST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (\n  ast: SchemaAST.AST,\n  f: (ast: SchemaAST.AST, key: keyof any | undefined) => SchemaAST.AST,\n): SchemaAST.AST => {\n  switch (ast._tag) {\n    case 'TypeLiteral': {\n      return new SchemaAST.TypeLiteral(\n        ast.propertySignatures.map(\n          (prop) =>\n            new SchemaAST.PropertySignature(\n              prop.name,\n              f(prop.type, prop.name),\n              prop.isOptional,\n              prop.isReadonly,\n              prop.annotations,\n            ),\n        ),\n        ast.indexSignatures,\n      );\n    }\n    case 'Union': {\n      return SchemaAST.Union.make(ast.types.map(f), ast.annotations);\n    }\n    case 'TupleType': {\n      return new SchemaAST.TupleType(\n        ast.elements.map((t, index) => new SchemaAST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new SchemaAST.Type(f(t.type, undefined), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    }\n    case 'Suspend': {\n      const newAst = f(ast.f(), undefined);\n      return new SchemaAST.Suspend(() => newAst, ast.annotations);\n    }\n    default: {\n      // TODO(dmaretskyi): Support more nodes.\n      return ast;\n    }\n  }\n};\n\n/**\n * @returns true if AST is for Array(T) or optional(Array(T)).\n */\nexport const isArrayType = (node: SchemaAST.AST): boolean => {\n  return (\n    SchemaAST.isTupleType(node) ||\n    (SchemaAST.isUnion(node) &&\n      node.types.some(isArrayType) &&\n      node.types.some(isUndefinedKeyword) &&\n      node.types.length === 2)\n  );\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Schema, Option } from 'effect';\nimport { JSONPath } from 'jsonpath-plus';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /^\\w+$/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = Schema.String.pipe(Schema.pattern(PATH_REGEX)).annotations({\n  title: 'JSON path',\n  description: 'JSON path to a property',\n}) as any as Schema.Schema<JsonPath>;\nexport const JsonProp = Schema.NonEmptyString.pipe(\n  Schema.pattern(PROP_REGEX, {\n    message: () => 'Property name must contain only letters, numbers, and underscores',\n  }),\n) as any as Schema.Schema<JsonProp>;\n\nexport const isJsonPath = (value: unknown): value is JsonPath => {\n  return Option.isSome(Schema.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n  const candidatePath = path\n    .map((p, i) => {\n      if (typeof p === 'number') {\n        return `[${p}]`;\n      } else {\n        return i === 0 ? p : `.${p}`;\n      }\n    })\n    .join('');\n\n  invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n  return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g., \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n  // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n  const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n  invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n  return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n  if (!isJsonPath(path)) {\n    return [];\n  }\n\n  return (\n    path\n      .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n      ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n  );\n};\n\n/**\n * Applies a JsonPath to an object.\n */\nexport const getField = (object: any, path: JsonPath): any => {\n  // By default, JSONPath returns an array of results.\n  return JSONPath({ path, json: object })[0];\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { SchemaAST, type Schema, Option, pipe } from 'effect';\n\nimport { decamelize } from '@dxos/util';\n\nconst ParamKeyAnnotationId = Symbol.for('@dxos/schema/annotation/ParamKey');\n\ntype ParamKeyAnnotationValue = { key: string };\n\nexport const getParamKeyAnnotation: (annotated: SchemaAST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  SchemaAST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends Schema.Annotable.All>(self: S): Schema.Annotable.Self<S> =>\n    self.annotations({ [ParamKeyAnnotationId]: value });\n\n/**\n * HTTP params parser.\n * Supports custom key serialization.\n */\nexport class UrlParser<T extends Record<string, any>> {\n  constructor(private readonly _schema: Schema.Struct<T>) {}\n\n  /**\n   * Parse URL params.\n   */\n  parse(_url: string): T {\n    const url = new URL(_url);\n    return Object.entries(this._schema.fields).reduce<Record<string, any>>((params, [key, type]) => {\n      let value = url.searchParams.get(decamelize(key));\n      if (value == null) {\n        value = url.searchParams.get(key);\n      }\n\n      if (value != null) {\n        if (SchemaAST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (SchemaAST.isBooleanKeyword(type.ast)) {\n          params[key] = value === 'true' || value === '1';\n        } else {\n          params[key] = value;\n        }\n      }\n\n      return params;\n    }, {}) as T;\n  }\n\n  /**\n   * Return URL with encoded params.\n   */\n  create(_url: string, params: T): URL {\n    const url = new URL(_url);\n    Object.entries(params).forEach(([key, value]) => {\n      if (value !== undefined) {\n        const field = this._schema.fields[key];\n        if (field) {\n          const { key: serializedKey } = pipe(\n            getParamKeyAnnotation(field.ast),\n            Option.getOrElse(() => ({\n              key: decamelize(key),\n            })),\n          );\n\n          url.searchParams.set(serializedKey, String(value));\n        }\n      }\n    });\n\n    return url;\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect, type Scope } from 'effect';\n\nimport { Context } from '@dxos/context';\n\n// TODO(dmaretskyi): Error handling.\nexport const contextFromScope = (): Effect.Effect<Context, never, Scope.Scope> =>\n  Effect.gen(function* () {\n    const ctx = new Context();\n    yield* Effect.addFinalizer(() => Effect.promise(() => ctx.dispose()));\n    return ctx;\n  });\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Cause, Chunk, Effect, Exit, GlobalValue, Option } from 'effect';\nimport type { AnySpan, Span } from 'effect/Tracer';\n\nconst spanSymbol = Symbol.for('effect/SpanAnnotation');\nconst originalSymbol = Symbol.for('effect/OriginalAnnotation');\nconst spanToTrace = GlobalValue.globalValue('effect/Tracer/spanToTrace', () => new WeakMap());\nconst locationRegex = /\\((.*)\\)/g;\n\n/**\n * Adds effect spans.\n * Removes effect internal functions.\n * Unwraps error proxy.\n */\nconst prettyErrorStack = (error: any, appendStacks: string[] = []): any => {\n  const span = error[spanSymbol];\n\n  const lines = typeof error.stack === 'string' ? error.stack.split('\\n') : [];\n  const out = [];\n\n  let atStack = false;\n  for (let i = 0; i < lines.length; i++) {\n    if (!atStack && !lines[i].startsWith('    at ')) {\n      out.push(lines[i]);\n      continue;\n    }\n    atStack = true;\n\n    if (lines[i].includes(' at new BaseEffectError') || lines[i].includes(' at new YieldableError')) {\n      i++;\n      continue;\n    }\n    if (lines[i].includes('Generator.next')) {\n      break;\n    }\n    if (lines[i].includes('effect_internal_function')) {\n      break;\n    }\n    out.push(\n      lines[i]\n        .replace(/at .*effect_instruction_i.*\\((.*)\\)/, 'at $1')\n        .replace(/EffectPrimitive\\.\\w+/, '<anonymous>')\n        .replace(/at Arguments\\./, 'at '),\n    );\n  }\n\n  if (span) {\n    let current: Span | AnySpan | undefined = span;\n    let i = 0;\n    while (current && current._tag === 'Span' && i < 10) {\n      const stackFn = spanToTrace.get(current);\n      if (typeof stackFn === 'function') {\n        const stack = stackFn();\n        if (typeof stack === 'string') {\n          const locationMatchAll = stack.matchAll(locationRegex);\n          let match = false;\n          for (const [, location] of locationMatchAll) {\n            match = true;\n            out.push(`    at ${current.name} (${location})`);\n          }\n          if (!match) {\n            out.push(`    at ${current.name} (${stack.replace(/^at /, '')})`);\n          }\n        } else {\n          out.push(`    at ${current.name}`);\n        }\n      } else {\n        out.push(`    at ${current.name}`);\n      }\n      current = Option.getOrUndefined(current.parent);\n      i++;\n    }\n  }\n\n  out.push(...appendStacks);\n\n  if (error[originalSymbol]) {\n    error = error[originalSymbol];\n  }\n  if (error.cause) {\n    error.cause = prettyErrorStack(error.cause);\n  }\n\n  Object.defineProperty(error, 'stack', {\n    value: out.join('\\n'),\n    writable: true,\n    enumerable: false,\n    configurable: true,\n  });\n\n  return error;\n};\n\n/**\n * Runs the embedded effect asynchronously and throws any failures and defects as errors.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const runAndForwardErrors = async <A, E>(\n  effect: Effect.Effect<A, E, never>,\n  options?: { signal?: AbortSignal },\n): Promise<A> => {\n  const exit = await Effect.runPromiseExit(effect, options);\n  if (Exit.isSuccess(exit)) {\n    return exit.value;\n  }\n\n  if (Cause.isEmpty(exit.cause)) {\n    throw new Error('Fiber failed without a cause');\n  } else if (Cause.isInterrupted(exit.cause)) {\n    throw new Error('Fiber was interrupted');\n  } else {\n    const errors = [...Chunk.toArray(Cause.failures(exit.cause)), ...Chunk.toArray(Cause.defects(exit.cause))];\n\n    const getStackFrames = (): string[] => {\n      const o: { stack: string } = {} as any;\n      Error.captureStackTrace(o, getStackFrames);\n      return o.stack.split('\\n').slice(1);\n    };\n\n    const stackFrames = getStackFrames();\n    const newErrors = errors.map((error) => prettyErrorStack(error, stackFrames));\n\n    if (newErrors.length === 1) {\n      throw newErrors[0];\n    } else {\n      throw new AggregateError(newErrors);\n    }\n  }\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect } from 'effect';\nimport type { TestContext } from 'vitest';\n\nexport namespace TestHelpers {\n  /**\n   * Skip the test if the condition is false.\n   *\n   * Exmaple:\n   * ```ts\n   * it.effect(\n   *   'should process an agentic loop using Claude',\n   *   Effect.fn(function* ({ expect }) {\n   *     // ...\n   *   }),\n   *   TestHelpers.runIf(process.env.ANTHROPIC_API_KEY),\n   * );\n   * ```\n   */\n  export const runIf =\n    (condition: unknown) =>\n    <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n      Effect.gen(function* () {\n        if (!condition) {\n          ctx.skip();\n        } else {\n          return yield* effect;\n        }\n      });\n\n  /**\n   * Skip the test if the condition is true.\n   *\n   * Exmaple:\n   * ```ts\n   * it.effect(\n   *   'should process an agentic loop using Claude',\n   *   Effect.fn(function* ({ expect }) {\n   *     // ...\n   *   }),\n   *   TestHelpers.skipIf(!process.env.ANTHROPIC_API_KEY),\n   * );\n   * ```\n   */\n  export const skipIf =\n    (condition: unknown) =>\n    <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n      Effect.gen(function* () {\n        if (condition) {\n          ctx.skip();\n        } else {\n          return yield* effect;\n        }\n      });\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport { Effect } from 'effect';\n\nimport type { Lifecycle } from '@dxos/context';\n\n// TODO(dmaretskyi): Extract to effect-utils.\nexport const accuireReleaseResource = <T extends Lifecycle>(getResource: () => T) =>\n  Effect.acquireRelease(\n    Effect.gen(function* () {\n      const resource = getResource();\n      yield* Effect.promise(async () => {\n        resource.open?.();\n        return undefined;\n      });\n      return resource;\n    }),\n    (resource) =>\n      Effect.promise(async () => {\n        resource.close?.();\n        return undefined;\n      }),\n  );\n"],
-  "mappings": ";;;AAIA,SAASA,QAAQC,MAAMC,WAAWC,cAAc;AAChD,SAASC,0BAA0B;AAEnC,SAASC,iBAAiB;AAC1B,SAASC,qBAAqB;;AAgBvB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MACEN,UAAUO,cAAcD,IAAAA,KACxBN,UAAUQ,gBAAgBF,IAAAA,KAC1BN,UAAUS,cAAcH,IAAAA,KACxBI,qBAAqBJ,IAAAA,GACrB;AACA,WAAO;EACT;AAEA,MAAIN,UAAUW,gBAAgBL,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIN,UAAUY,gBAAgBN,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAIN,UAAUa,iBAAiBP,IAAAA,GAAO;AACpC,WAAO;EACT;AAEA,MAAIN,UAAUc,QAAQR,IAAAA,GAAO;AAC3B,WAAO;EACT;AAEA,MAAIN,UAAUe,UAAUT,IAAAA,GAAO;AAC7B,WAAO;EACT;AACF;AAEO,IAAMU,eAAe,CAACV,SAAiC,CAAC,CAACD,cAAcC,IAAAA;UAE7DW,aAAAA;cAKFC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AA8BV,IAAKI,cAAAA,yBAAAA,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;SARSA;;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,QAGT,CAACjB,MAAqBkB,eAAmCC,YAAAA;AAC3D,MAAI,CAACA,SAAS;AACZC,cAAUpB,MAAMgB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUpB,MAAMkB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBpB,MACAqB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOrB,MAAMsB,MAAMC,KAAAA;AACnC,QAAME,SACJD,YAAYE,SAAAA,IAER,OAAOF,YAAY,YACjBA,UAAAA,IAAAA,IAGAA;AAER,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BN,YAAQnB,MAAMsB,MAAMC,KAAAA;EACtB;AAGA,MAAI7B,UAAUS,cAAcH,IAAAA,GAAO;AACjC,eAAW2B,QAAQjC,UAAUkC,sBAAsB5B,IAAAA,GAAO;AACxD,YAAM6B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,UAAUsC,YAAYhC,IAAAA,GAAO;AACpC,eAAW,CAACiC,GAAGC,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQrB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,UAAU2C,QAAQrC,IAAAA,GAAO;AAChC,eAAWa,QAAQb,KAAKsC,OAAO;AAC7B,YAAMb,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,UAAU6C,aAAavC,IAAAA,GAAO;AACrC,UAAMyB,UAASL,UAAUpB,KAAKwC,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAACzC,MAAqBqB,SAAAA;AAC5C,MAAIA,KAAKrB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSN,UAAUS,cAAcH,IAAAA,GAAO;AACtC,eAAW2B,QAAQjC,UAAUkC,sBAAsB5B,IAAAA,GAAO;AACxD,YAAM0C,QAAQD,SAASd,KAAKd,MAAMQ,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGShD,UAAUsC,YAAYhC,IAAAA,GAAO;AACpC,eAAW,CAAC2C,GAAGT,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQrB,MAAMQ,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGShD,UAAU2C,QAAQrC,IAAAA,GAAO;AAChC,QAAI4C,SAAS5C,IAAAA,GAAO;AAClB,iBAAWa,QAAQb,KAAKsC,OAAO;AAC7B,cAAMI,QAAQD,SAAS5B,MAAMQ,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGShD,UAAU6C,aAAavC,IAAAA,GAAO;AACrC,WAAOyC,SAASzC,KAAKwC,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAC1BC,QACAxB,SAAAA;AAEA,QAAMyB,UAAU,CAAC/C,MAAqBsB,UAAAA;AACpC,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAASzC,MAAMN,UAAUS,aAAa;AACvDN,cAAUoD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQjC,UAAUkC,sBAAsBqB,QAAAA,GAAW;AAC5D,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKE,QAAQ;AACf,iBAAOH,QAAQpB,KAAKd,MAAMmC,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOkC,QAAQD,OAAOK,KAAK7B,KAAK8B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAA0D;EAC9D,CAAC,eAAA,GAA2B3D,UAAU4D;EACtC,CAAC,eAAA,GAA2B5D,UAAU6D;EACtC,CAAC,eAAA,GAA2B7D,UAAU8D;EACtC,CAAC,gBAAA,GAA4B9D,UAAU+D;AACzC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC5D,SAAAA;AAEC,QAAM6D,KAAKpE,KAAKC,UAAUoE,wBAAwB9D,IAAAA,GAAOR,OAAOuE,cAAc;AAC9E,QAAMC,QAAQvE,KAAKC,UAAUgE,cAAiBC,YAAAA,EAAc3D,IAAAA,GAAOR,OAAOuE,cAAc;AACxF,MAAIH,cAAcI,UAAUX,mBAAmBrD,KAAKiE,IAAI,GAAGC,YAAYP,YAAAA,KAAiBK,UAAUH,KAAK;AACrG,WAAOnC;EACT;AAEA,SAAOsC;AACT;AAOK,IAAMG,iBAAiB,CAAInE,MAAqB2D,cAAsBC,YAAY,SAAI;AAC3F,QAAMQ,oBAAoBV,cAAcC,cAAcC,SAAAA;AAEtD,QAAMS,oBAAoB,CAACrE,UAAAA;AACzB,UAAMgE,QAAQI,kBAAkBpE,KAAAA;AAChC,QAAIgE,UAAUtC,QAAW;AACvB,aAAOsC;IACT;AAEA,QAAItE,UAAU2C,QAAQrC,KAAAA,GAAO;AAC3B,UAAI4C,SAAS5C,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKsC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO+B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAM4C,WAAW,CAAC5C,SAAAA;AACvB,SAAON,UAAU2C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMY,WAAW,KAAKxD,UAAUE,mBAAmBI,KAAKsC,MAAM,CAAA,CAAE;AACzG;AAKO,IAAMgC,iBAAiB,CAACtE,SAAAA;AAC7B,SAAON,UAAU2C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMiC,MAAM7E,UAAUe,SAAS;AACxE;AAKO,IAAML,uBAAuB,CAACJ,SAAAA;AACnC,SAAON,UAAU2C,QAAQrC,IAAAA,KAAS,CAAC,CAACwE,uBAAuBxE,IAAAA,GAAOkD;AACpE;AAKO,IAAMsB,yBAAyB,CAACxE,SAAAA;AACrCH,YAAUH,UAAU2C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5B,MAAI4C,SAAS5C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKsC,MAAMmC,OAAiB,CAACC,QAAQ7D,SAAAA;AAC1C,UAAM8D,QAAQjF,UAAUkC,sBAAsBf,IAAAA,EAE3C+D,OAAO,CAACC,MAAMnF,UAAUe,UAAUoE,EAAEhE,IAAI,CAAA,EACxCiE,IAAI,CAACD,MAAMA,EAAE/C,KAAKC,SAAQ,CAAA;AAG7B,WAAO2C,OAAOxB,WAAW,IAAIyB,QAAQD,OAAOE,OAAO,CAACjD,SAASgD,MAAMI,SAASpD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMqD,uBAAuB,CAClChF,MACAgE,QAA6B,CAAC,MAAC;AAE/BnE,YAAUH,UAAU2C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5BH,YAAUmE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMW,QAAQH,uBAAuBxE,IAAAA;AACrC,MAAI,CAAC2E,OAAOzB,QAAQ;AAClB;EACF;AAGA,aAAWrC,QAAQb,KAAKsC,OAAO;AAC7B,UAAM2C,QAAQvF,UAAUkC,sBAAsBf,IAAAA,EAC3C+D,OAAO,CAACjD,SAASgD,OAAOI,SAASpD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDwC,MAAM,CAAC5C,SAAAA;AACN9B,gBAAUH,UAAUe,UAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACvC,aAAOc,KAAKd,KAAKqE,YAAYlB,MAAMrC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIkD,OAAO;AACT,aAAOpE;IACT;EACF;AAKA,QAAMsE,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACnD,SAAAA;AACJ,UAAM2D,WAAWtF,KAAKsC,MACnBwC,IAAI,CAACjE,SAAAA;AACJ,YAAMqE,UAAUxF,UAAUkC,sBAAsBf,IAAAA,EAAM0E,KAAK,CAACV,MAAMA,EAAE/C,KAAKC,SAAQ,MAAOJ,IAAAA;AACxF9B,gBAAUH,UAAUe,UAAUyE,QAAQrE,IAAI,GAAA,QAAA;;;;;;;;;AAC1C,aAAOqE,QAAQrE,KAAKqE;IACtB,CAAA,EACCN,OAAO9E,aAAAA;AAEV,WAAOwF,SAASpC,SAAS;MAACvB;MAAMhC,OAAO6F,QAAO,GAAIF,QAAAA;QAAa5D;EACjE,CAAA,EACCkD,OAAO9E,aAAAA,CAAAA;AAGZ,QAAMgD,SAASnD,OAAO8F,OAAON,MAAAA;AAC7B,SAAOrC,OAAOK;AAChB;AAOO,IAAMuC,SAAS,CACpBvC,KACAwC,MAAAA;AAEA,UAAQxC,IAAIc,MAAI;IACd,KAAK,eAAe;AAClB,aAAO,IAAIvE,UAAUkG,YACnBzC,IAAI0C,mBAAmBf,IACrB,CAACnD,SACC,IAAIjC,UAAUoG,kBACZnE,KAAKG,MACL6D,EAAEhE,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAKoE,YACLpE,KAAKqE,YACLrE,KAAKuC,WAAW,CAAA,GAGtBf,IAAI8C,eAAe;IAEvB;IACA,KAAK,SAAS;AACZ,aAAOvG,UAAUwG,MAAMC,KAAKhD,IAAIb,MAAMwC,IAAIa,CAAAA,GAAIxC,IAAIe,WAAW;IAC/D;IACA,KAAK,aAAa;AAChB,aAAO,IAAIxE,UAAU0G,UACnBjD,IAAIhB,SAAS2C,IAAI,CAACuB,GAAGC,UAAU,IAAI5G,UAAU6G,aAAaZ,EAAEU,EAAExF,MAAMyF,KAAAA,GAAQD,EAAEN,YAAYM,EAAEnC,WAAW,CAAA,GACvGf,IAAIH,KAAK8B,IAAI,CAACuB,MAAM,IAAI3G,UAAU8G,KAAKb,EAAEU,EAAExF,MAAMa,MAAAA,GAAY2E,EAAEnC,WAAW,CAAA,GAC1Ef,IAAI6C,YACJ7C,IAAIe,WAAW;IAEnB;IACA,KAAK,WAAW;AACd,YAAMuC,SAASd,EAAExC,IAAIwC,EAAC,GAAIjE,MAAAA;AAC1B,aAAO,IAAIhC,UAAUgH,QAAQ,MAAMD,QAAQtD,IAAIe,WAAW;IAC5D;IACA,SAAS;AAEP,aAAOf;IACT;EACF;AACF;AAKO,IAAMwD,cAAc,CAAC3G,SAAAA;AAC1B,SACEN,UAAUsC,YAAYhC,IAAAA,KACrBN,UAAU2C,QAAQrC,IAAAA,KACjBA,KAAKsC,MAAMsE,KAAKD,WAAAA,KAChB3G,KAAKsC,MAAMsE,KAAKhH,kBAAAA,KAChBI,KAAKsC,MAAMY,WAAW;AAE5B;;;;ACjdA,SAAS2D,UAAAA,SAAQC,UAAAA,eAAc;AAC/B,SAASC,gBAAgB;AAEzB,SAASC,aAAAA,kBAAiB;;AAK1B,IAAMC,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWN,QAAOO,OAAOC,KAAKR,QAAOS,QAAQL,UAAAA,CAAAA,EAAaM,YAAY;EACjFC,OAAO;EACPC,aAAa;AACf,CAAA;AACO,IAAMC,WAAWb,QAAOc,eAAeN,KAC5CR,QAAOS,QAAQJ,YAAY;EACzBU,SAAS,MAAM;AACjB,CAAA,CAAA;AAGK,IAAMC,aAAa,CAACC,UAAAA;AACzB,SAAOhB,QAAOiB,OAAOlB,QAAOmB,eAAeb,QAAAA,EAAUW,KAAAA,CAAAA;AACvD;AAqBO,IAAMG,iBAAiB,CAACC,SAAAA;AAC7B,QAAMC,gBAAgBD,KACnBE,IAAI,CAACC,GAAGC,MAAAA;AACP,QAAI,OAAOD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOC,MAAM,IAAID,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACCE,KAAK,EAAA;AAERvB,EAAAA,WAAUa,WAAWM,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAMK,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpD3B,EAAAA,WAAUa,WAAWa,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAACV,SAAAA;AAC5B,MAAI,CAACL,WAAWK,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACGW,MAAM,2BAAA,GACLT,IAAI,CAACU,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKH,QAAQ,UAAU,EAAA,IAAMG,IAAAA,KAAU,CAAA;AAErF;AAKO,IAAME,WAAW,CAACC,QAAaf,SAAAA;AAEpC,SAAOnB,SAAS;IAAEmB;IAAMgB,MAAMD;EAAO,CAAA,EAAG,CAAA;AAC1C;;;AC/FA,SAASE,aAAAA,YAAwBC,UAAAA,SAAQC,QAAAA,aAAY;AAErD,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,WAAUC,cAAuCL,oBAAAA;AAE5C,IAAMM,qBACX,CAACC,UACD,CAAiCC,SAC/BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACX,YAA6BC,SAA2B;SAA3BA,UAAAA;EAA4B;;;;EAKzDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIf,QAAQO,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAId,SAAS,MAAM;AACjBA,gBAAQO,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAId,SAAS,MAAM;AACjB,YAAIH,WAAUsB,gBAAgBJ,KAAKK,GAAG,GAAG;AACvCP,iBAAOC,GAAAA,IAAOO,SAASrB,KAAAA;QACzB,WAAWH,WAAUyB,iBAAiBP,KAAKK,GAAG,GAAG;AAC/CP,iBAAOC,GAAAA,IAAOd,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLa,iBAAOC,GAAAA,IAAOd;QAChB;MACF;AAEA,aAAOa;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKd,KAAAA,MAAM;AAC1C,UAAIA,UAAUyB,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BhC,sBAAsB8B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOhC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOO;EACT;AACF;;;ACvEA,SAAS0B,cAA0B;AAEnC,SAASC,eAAe;;AAGjB,IAAMC,mBAAmB,MAC9BF,OAAOG,IAAI,aAAA;AACT,QAAMC,MAAM,IAAIH,QAAAA,QAAAA;;;;AAChB,SAAOD,OAAOK,aAAa,MAAML,OAAOM,QAAQ,MAAMF,IAAIG,QAAO,CAAA,CAAA;AACjE,SAAOH;AACT,CAAA;;;ACVF,SAASI,OAAOC,OAAOC,UAAAA,SAAQC,MAAMC,aAAaC,UAAAA,eAAc;AAGhE,IAAMC,aAAaC,OAAOC,IAAI,uBAAA;AAC9B,IAAMC,iBAAiBF,OAAOC,IAAI,2BAAA;AAClC,IAAME,cAAcC,YAAYC,YAAY,6BAA6B,MAAM,oBAAIC,QAAAA,CAAAA;AACnF,IAAMC,gBAAgB;AAOtB,IAAMC,mBAAmB,CAACC,OAAYC,eAAyB,CAAA,MAAE;AAC/D,QAAMC,OAAOF,MAAMV,UAAAA;AAEnB,QAAMa,QAAQ,OAAOH,MAAMI,UAAU,WAAWJ,MAAMI,MAAMC,MAAM,IAAA,IAAQ,CAAA;AAC1E,QAAMC,MAAM,CAAA;AAEZ,MAAIC,UAAU;AACd,WAASC,IAAI,GAAGA,IAAIL,MAAMM,QAAQD,KAAK;AACrC,QAAI,CAACD,WAAW,CAACJ,MAAMK,CAAAA,EAAGE,WAAW,SAAA,GAAY;AAC/CJ,UAAIK,KAAKR,MAAMK,CAAAA,CAAE;AACjB;IACF;AACAD,cAAU;AAEV,QAAIJ,MAAMK,CAAAA,EAAGI,SAAS,yBAAA,KAA8BT,MAAMK,CAAAA,EAAGI,SAAS,wBAAA,GAA2B;AAC/FJ;AACA;IACF;AACA,QAAIL,MAAMK,CAAAA,EAAGI,SAAS,gBAAA,GAAmB;AACvC;IACF;AACA,QAAIT,MAAMK,CAAAA,EAAGI,SAAS,0BAAA,GAA6B;AACjD;IACF;AACAN,QAAIK,KACFR,MAAMK,CAAAA,EACHK,QAAQ,uCAAuC,OAAA,EAC/CA,QAAQ,wBAAwB,aAAA,EAChCA,QAAQ,kBAAkB,KAAA,CAAA;EAEjC;AAEA,MAAIX,MAAM;AACR,QAAIY,UAAsCZ;AAC1C,QAAIM,IAAI;AACR,WAAOM,WAAWA,QAAQC,SAAS,UAAUP,IAAI,IAAI;AACnD,YAAMQ,UAAUtB,YAAYuB,IAAIH,OAAAA;AAChC,UAAI,OAAOE,YAAY,YAAY;AACjC,cAAMZ,QAAQY,QAAAA;AACd,YAAI,OAAOZ,UAAU,UAAU;AAC7B,gBAAMc,mBAAmBd,MAAMe,SAASrB,aAAAA;AACxC,cAAIsB,QAAQ;AACZ,qBAAW,CAAA,EAAGC,QAAAA,KAAaH,kBAAkB;AAC3CE,oBAAQ;AACRd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKD,QAAAA,GAAW;UACjD;AACA,cAAI,CAACD,OAAO;AACVd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKlB,MAAMS,QAAQ,QAAQ,EAAA,CAAA,GAAM;UAClE;QACF,OAAO;AACLP,cAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;QACnC;MACF,OAAO;AACLhB,YAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;MACnC;AACAR,gBAAUS,QAAOC,eAAeV,QAAQW,MAAM;AAC9CjB;IACF;EACF;AAEAF,MAAIK,KAAI,GAAIV,YAAAA;AAEZ,MAAID,MAAMP,cAAAA,GAAiB;AACzBO,YAAQA,MAAMP,cAAAA;EAChB;AACA,MAAIO,MAAM0B,OAAO;AACf1B,UAAM0B,QAAQ3B,iBAAiBC,MAAM0B,KAAK;EAC5C;AAEAC,SAAOC,eAAe5B,OAAO,SAAS;IACpC6B,OAAOvB,IAAIwB,KAAK,IAAA;IAChBC,UAAU;IACVC,YAAY;IACZC,cAAc;EAChB,CAAA;AAEA,SAAOjC;AACT;AAYO,IAAMkC,sBAAsB,OACjCC,QACAC,YAAAA;AAEA,QAAMC,OAAO,MAAMC,QAAOC,eAAeJ,QAAQC,OAAAA;AACjD,MAAII,KAAKC,UAAUJ,IAAAA,GAAO;AACxB,WAAOA,KAAKR;EACd;AAEA,MAAIa,MAAMC,QAAQN,KAAKX,KAAK,GAAG;AAC7B,UAAM,IAAIkB,MAAM,8BAAA;EAClB,WAAWF,MAAMG,cAAcR,KAAKX,KAAK,GAAG;AAC1C,UAAM,IAAIkB,MAAM,uBAAA;EAClB,OAAO;AACL,UAAME,SAAS;SAAIC,MAAMC,QAAQN,MAAMO,SAASZ,KAAKX,KAAK,CAAA;SAAOqB,MAAMC,QAAQN,MAAMQ,QAAQb,KAAKX,KAAK,CAAA;;AAEvG,UAAMyB,iBAAiB,MAAA;AACrB,YAAMC,IAAuB,CAAC;AAC9BR,YAAMS,kBAAkBD,GAAGD,cAAAA;AAC3B,aAAOC,EAAEhD,MAAMC,MAAM,IAAA,EAAMiD,MAAM,CAAA;IACnC;AAEA,UAAMC,cAAcJ,eAAAA;AACpB,UAAMK,YAAYV,OAAOW,IAAI,CAACzD,UAAUD,iBAAiBC,OAAOuD,WAAAA,CAAAA;AAEhE,QAAIC,UAAU/C,WAAW,GAAG;AAC1B,YAAM+C,UAAU,CAAA;IAClB,OAAO;AACL,YAAM,IAAIE,eAAeF,SAAAA;IAC3B;EACF;AACF;;;ACrIA,SAASG,UAAAA,eAAc;UAGNC,cAAAA;eAeFC,QACX,CAACC,cACD,CAAUC,QAAgCC,QACxCC,QAAOC,IAAI,aAAA;AACT,QAAI,CAACJ,WAAW;AACdE,UAAIG,KAAI;IACV,OAAO;AACL,aAAO,OAAOJ;IAChB;EACF,CAAA;eAgBSK,SACX,CAACN,cACD,CAAUC,QAAgCC,QACxCC,QAAOC,IAAI,aAAA;AACT,QAAIJ,WAAW;AACbE,UAAIG,KAAI;IACV,OAAO;AACL,aAAO,OAAOJ;IAChB;EACF,CAAA;AACN,GAlDiBH,gBAAAA,cAAAA,CAAAA,EAAAA;;;;ACHjB,SAASS,UAAAA,eAAc;AAKhB,IAAMC,yBAAyB,CAAsBC,gBAC1DC,QAAOC,eACLD,QAAOE,IAAI,aAAA;AACT,QAAMC,WAAWJ,YAAAA;AACjB,SAAOC,QAAOI,QAAQ,YAAA;AACpBD,aAASE,OAAI;AACb,WAAOC;EACT,CAAA;AACA,SAAOH;AACT,CAAA,GACA,CAACA,aACCH,QAAOI,QAAQ,YAAA;AACbD,WAASI,QAAK;AACd,SAAOD;AACT,CAAA,CAAA;",
-  "names": ["Option", "pipe", "SchemaAST", "Schema", "isUndefinedKeyword", "invariant", "isNonNullable", "getSimpleType", "node", "isDeclaration", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "getIdentifierAnnotation", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "Literal", "Struct", "mapAst", "f", "TypeLiteral", "propertySignatures", "PropertySignature", "isOptional", "isReadonly", "indexSignatures", "Union", "make", "TupleType", "t", "index", "OptionalType", "Type", "newAst", "Suspend", "isArrayType", "some", "Schema", "Option", "JSONPath", "invariant", "PATH_REGEX", "PROP_REGEX", "JsonPath", "String", "pipe", "pattern", "annotations", "title", "description", "JsonProp", "NonEmptyString", "message", "isJsonPath", "value", "isSome", "validateOption", "createJsonPath", "path", "candidatePath", "map", "p", "i", "join", "fromEffectValidationPath", "effectPath", "jsonPath", "replace", "splitJsonPath", "match", "part", "startsWith", "getField", "object", "json", "SchemaAST", "Option", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "SchemaAST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "_schema", "parse", "_url", "url", "URL", "Object", "entries", "fields", "reduce", "params", "key", "type", "searchParams", "get", "decamelize", "isNumberKeyword", "ast", "parseInt", "isBooleanKeyword", "create", "forEach", "undefined", "field", "serializedKey", "pipe", "Option", "getOrElse", "set", "String", "Effect", "Context", "contextFromScope", "gen", "ctx", "addFinalizer", "promise", "dispose", "Cause", "Chunk", "Effect", "Exit", "GlobalValue", "Option", "spanSymbol", "Symbol", "for", "originalSymbol", "spanToTrace", "GlobalValue", "globalValue", "WeakMap", "locationRegex", "prettyErrorStack", "error", "appendStacks", "span", "lines", "stack", "split", "out", "atStack", "i", "length", "startsWith", "push", "includes", "replace", "current", "_tag", "stackFn", "get", "locationMatchAll", "matchAll", "match", "location", "name", "Option", "getOrUndefined", "parent", "cause", "Object", "defineProperty", "value", "join", "writable", "enumerable", "configurable", "runAndForwardErrors", "effect", "options", "exit", "Effect", "runPromiseExit", "Exit", "isSuccess", "Cause", "isEmpty", "Error", "isInterrupted", "errors", "Chunk", "toArray", "failures", "defects", "getStackFrames", "o", "captureStackTrace", "slice", "stackFrames", "newErrors", "map", "AggregateError", "Effect", "TestHelpers", "runIf", "condition", "effect", "ctx", "Effect", "gen", "skip", "skipIf", "Effect", "accuireReleaseResource", "getResource", "Effect", "acquireRelease", "gen", "resource", "promise", "open", "undefined", "close"]
+  "sourcesContent": ["//\n// Copyright 2024 DXOS.org\n//\n\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport * as Schema from 'effect/Schema';\nimport * as SchemaAST from 'effect/SchemaAST';\n\nimport { invariant } from '@dxos/invariant';\nimport { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/SchemaAST.ts.html\n//\n\n// TODO(wittjosiah): What is a \"simple type\"?\nexport type SimpleType = 'object' | 'string' | 'number' | 'boolean' | 'enum' | 'literal';\n\nconst isTupleType = (node: SchemaAST.AST): boolean => {\n  // NOTE: Arrays are represented as tuples with no elements and a rest part.\n  return SchemaAST.isTupleType(node) && node.elements.length > 0;\n};\n\n/**\n * Get the base type; e.g., traverse through refinements.\n */\nexport const getSimpleType = (node: SchemaAST.AST): SimpleType | undefined => {\n  if (\n    SchemaAST.isDeclaration(node) ||\n    SchemaAST.isObjectKeyword(node) ||\n    SchemaAST.isTypeLiteral(node) ||\n    // TODO(wittjosiah): Tuples are actually arrays.\n    isTupleType(node) ||\n    isDiscriminatedUnion(node)\n  ) {\n    return 'object';\n  }\n\n  if (SchemaAST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (SchemaAST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (SchemaAST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (SchemaAST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (SchemaAST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: SchemaAST.AST): boolean => !!getSimpleType(node);\n\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n  CONTINUE = 0,\n  /**\n   * Skip visiting children.\n   */\n  SKIP = 1,\n  /**\n   * Stop traversing immediately.\n   */\n  EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: SchemaAST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: SchemaAST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: TestFn = isSimpleType;\n\n/**\n * Visit leaf nodes.\n * Refs:\n * - https://github.com/syntax-tree/unist-util-visit?tab=readme-ov-file#visitor\n * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test\n */\nexport const visit: {\n  (node: SchemaAST.AST, visitor: VisitorFn): void;\n  (node: SchemaAST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: SchemaAST.AST, testOrVisitor: TestFn | VisitorFn, visitor?: VisitorFn): void => {\n  if (!visitor) {\n    visitNode(node, defaultTest, testOrVisitor);\n  } else {\n    visitNode(node, testOrVisitor as TestFn, visitor);\n  }\n};\n\nconst visitNode = (\n  node: SchemaAST.AST,\n  test: TestFn | undefined,\n  visitor: VisitorFn,\n  path: Path = [],\n  depth = 0,\n): VisitResult | undefined => {\n  const $result = test?.(node, path, depth);\n  const result: VisitResult =\n    $result === undefined\n      ? VisitResult.CONTINUE\n      : typeof $result === 'boolean'\n        ? $result\n          ? VisitResult.CONTINUE\n          : VisitResult.SKIP\n        : $result;\n\n  if (result === VisitResult.EXIT) {\n    return result;\n  }\n  if (result !== VisitResult.SKIP) {\n    visitor(node, path, depth);\n  }\n\n  // Object.\n  if (SchemaAST.isTypeLiteral(node)) {\n    for (const prop of SchemaAST.getPropertySignatures(node)) {\n      const currentPath = [...path, prop.name.toString()];\n      const result = visitNode(prop.type, test, visitor, currentPath, depth + 1);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Array.\n  else if (SchemaAST.isTupleType(node)) {\n    for (const [i, element] of node.elements.entries()) {\n      const currentPath = [...path, i];\n      const result = visitNode(element.type, test, visitor, currentPath, depth);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Branching union (e.g., optional, discriminated unions).\n  else if (SchemaAST.isUnion(node)) {\n    for (const type of node.types) {\n      const result = visitNode(type, test, visitor, path, depth);\n      if (result === VisitResult.EXIT) {\n        return result;\n      }\n    }\n  }\n\n  // Refinement.\n  else if (SchemaAST.isRefinement(node)) {\n    const result = visitNode(node.from, test, visitor, path, depth);\n    if (result === VisitResult.EXIT) {\n      return result;\n    }\n  }\n\n  // TODO(burdon): Transforms?\n};\n\n/**\n * Recursively descend into AST to find first node that passes the test.\n */\n// TODO(burdon): Rewrite using visitNode?\nexport const findNode = (node: SchemaAST.AST, test: (node: SchemaAST.AST) => boolean): SchemaAST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (SchemaAST.isTypeLiteral(node)) {\n    for (const prop of SchemaAST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n    for (const prop of getIndexSignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (SchemaAST.isTupleType(node)) {\n    for (const [_, element] of node.elements.entries()) {\n      const child = findNode(element.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Branching union (e.g., optional, discriminated unions).\n  else if (SchemaAST.isUnion(node)) {\n    if (isLiteralUnion(node)) {\n      return undefined;\n    }\n\n    for (const type of node.types) {\n      const child = findNode(type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Refinement.\n  else if (SchemaAST.isRefinement(node)) {\n    return findNode(node.from, test);\n  }\n};\n\n/**\n * Get the AST node for the given property (dot-path).\n */\nexport const findProperty = (\n  schema: Schema.Schema.AnyNoContext,\n  path: JsonPath | JsonProp,\n): SchemaAST.AST | undefined => {\n  const getProp = (node: SchemaAST.AST, path: JsonProp[]): SchemaAST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, SchemaAST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of SchemaAST.getPropertySignatures(typeNode)) {\n      if (prop.name === name) {\n        if (rest.length) {\n          return getProp(prop.type, rest);\n        } else {\n          return prop.type;\n        }\n      }\n    }\n  };\n\n  return getProp(schema.ast, path.split('.') as JsonProp[]);\n};\n\n//\n// Annotations\n//\n\nconst defaultAnnotations: Record<string, SchemaAST.Annotated> = {\n  ['ObjectKeyword' as const]: SchemaAST.objectKeyword,\n  ['StringKeyword' as const]: SchemaAST.stringKeyword,\n  ['NumberKeyword' as const]: SchemaAST.numberKeyword,\n  ['BooleanKeyword' as const]: SchemaAST.booleanKeyword,\n};\n\n/**\n * Get annotation or return undefined.\n * @param annotationId\n * @param noDefault If true, then return undefined for effect library defined values.\n */\nexport const getAnnotation =\n  <T>(annotationId: symbol, noDefault = true) =>\n  (node: SchemaAST.AST): T | undefined => {\n    // Title fallback seems to be the identifier.\n    const id = Function.pipe(SchemaAST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = Function.pipe(SchemaAST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: SchemaAST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n  const getBaseAnnotation = (node: SchemaAST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      return value as T;\n    }\n\n    if (SchemaAST.isUnion(node)) {\n      if (isOption(node)) {\n        return getAnnotationById(node.types[0]) as T;\n      }\n    }\n  };\n\n  return getBaseAnnotation(node);\n};\n\n//\n// Unions\n//\n\n/**\n * Effect Schema.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && node.types.length === 2 && SchemaAST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && node.types.every(SchemaAST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: SchemaAST.AST): boolean => {\n  return SchemaAST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: SchemaAST.AST): string[] | undefined => {\n  invariant(SchemaAST.isUnion(node));\n  if (isOption(node)) {\n    return;\n  }\n\n  // Get common literals across all types.\n  return node.types.reduce<string[]>((shared, type) => {\n    const props = SchemaAST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => SchemaAST.isLiteral(p.type))\n      .map((p) => p.name.toString());\n\n    // Return common literals.\n    return shared.length === 0 ? props : shared.filter((prop) => props.includes(prop));\n  }, []);\n};\n\n/**\n * Get the discriminated type for the given value.\n */\nexport const getDiscriminatedType = (\n  node: SchemaAST.AST,\n  value: Record<string, any> = {},\n): SchemaAST.AST | undefined => {\n  invariant(SchemaAST.isUnion(node));\n  invariant(value);\n  const props = getDiscriminatingProps(node);\n  if (!props?.length) {\n    return;\n  }\n\n  // Match provided values.\n  for (const type of node.types) {\n    const match = SchemaAST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(SchemaAST.isLiteral(prop.type));\n        return prop.type.literal === value[prop.name.toString()];\n      });\n\n    if (match) {\n      return type;\n    }\n  }\n\n  // Create union of discriminating properties.\n  // NOTE: This may not work with non-overlapping variants.\n  // TODO(burdon): Iterate through props and knock-out variants that don't match.\n  const fields = Object.fromEntries(\n    props\n      .map((prop) => {\n        const literals = node.types\n          .map((type) => {\n            const literal = SchemaAST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(SchemaAST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(isNonNullable);\n\n        return literals.length ? [prop, Schema.Literal(...literals)] : undefined;\n      })\n      .filter(isNonNullable),\n  );\n\n  const schema = Schema.Struct(fields);\n  return schema.ast;\n};\n\n/**\n * Maps AST nodes.\n * The user is responsible for recursively calling {@link mapAst} on the SchemaAST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (\n  ast: SchemaAST.AST,\n  f: (ast: SchemaAST.AST, key: keyof any | undefined) => SchemaAST.AST,\n): SchemaAST.AST => {\n  switch (ast._tag) {\n    case 'TypeLiteral': {\n      return new SchemaAST.TypeLiteral(\n        ast.propertySignatures.map(\n          (prop) =>\n            new SchemaAST.PropertySignature(\n              prop.name,\n              f(prop.type, prop.name),\n              prop.isOptional,\n              prop.isReadonly,\n              prop.annotations,\n            ),\n        ),\n        ast.indexSignatures,\n        ast.annotations,\n      );\n    }\n    case 'Union': {\n      return SchemaAST.Union.make(ast.types.map(f), ast.annotations);\n    }\n    case 'TupleType': {\n      return new SchemaAST.TupleType(\n        ast.elements.map((t, index) => new SchemaAST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new SchemaAST.Type(f(t.type, undefined), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    }\n    case 'Suspend': {\n      const newAst = f(ast.f(), undefined);\n      return new SchemaAST.Suspend(() => newAst, ast.annotations);\n    }\n    default: {\n      // TODO(dmaretskyi): Support more nodes.\n      return ast;\n    }\n  }\n};\n\n/**\n * @returns true if AST is for Array(T) or optional(Array(T)).\n */\nexport const isArrayType = (node: SchemaAST.AST): boolean => {\n  return (\n    SchemaAST.isTupleType(node) ||\n    (SchemaAST.isUnion(node) &&\n      node.types.some(isArrayType) &&\n      node.types.some(SchemaAST.isUndefinedKeyword) &&\n      node.types.length === 2)\n  );\n};\n\nconst getIndexSignatures = (ast: SchemaAST.AST): Array<SchemaAST.IndexSignature> => {\n  const annotation = SchemaAST.getSurrogateAnnotation(ast);\n  if (Option.isSome(annotation)) {\n    return getIndexSignatures(annotation.value);\n  }\n  switch (ast._tag) {\n    case 'TypeLiteral':\n      return ast.indexSignatures.slice();\n    case 'Suspend':\n      return getIndexSignatures(ast.f());\n    case 'Refinement':\n      return getIndexSignatures(ast.from);\n  }\n  return [];\n};\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport * as Option from 'effect/Option';\nimport * as Schema from 'effect/Schema';\nimport { JSONPath } from 'jsonpath-plus';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /^\\w+$/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\n// TODO(burdon): Keys could be arbitrary strings.\nexport const JsonPath = Schema.String.pipe(Schema.pattern(PATH_REGEX)).annotations({\n  title: 'JSON path',\n  description: 'JSON path to a property',\n}) as any as Schema.Schema<JsonPath>;\nexport const JsonProp = Schema.NonEmptyString.pipe(\n  Schema.pattern(PROP_REGEX, {\n    message: () => 'Property name must contain only letters, numbers, and underscores',\n  }),\n) as any as Schema.Schema<JsonProp>;\n\nexport const isJsonPath = (value: unknown): value is JsonPath => {\n  return Option.isSome(Schema.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n  const candidatePath = path\n    .map((p, i) => {\n      if (typeof p === 'number') {\n        return `[${p}]`;\n      } else {\n        return i === 0 ? p : `.${p}`;\n      }\n    })\n    .join('');\n\n  invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n  return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g., \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n  // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n  const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n  invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n  return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n  if (!isJsonPath(path)) {\n    return [];\n  }\n\n  return (\n    path\n      .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n      ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n  );\n};\n\n/**\n * Applies a JsonPath to an object.\n */\nexport const getField = (object: any, path: JsonPath): any => {\n  // By default, JSONPath returns an array of results.\n  return JSONPath({ path, json: object })[0];\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport * as Function from 'effect/Function';\nimport * as Option from 'effect/Option';\nimport type * as Schema from 'effect/Schema';\nimport * as SchemaAST from 'effect/SchemaAST';\n\nimport { decamelize } from '@dxos/util';\n\nconst ParamKeyAnnotationId = Symbol.for('@dxos/schema/annotation/ParamKey');\n\ntype ParamKeyAnnotationValue = { key: string };\n\nexport const getParamKeyAnnotation: (annotated: SchemaAST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  SchemaAST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends Schema.Annotable.All>(self: S): Schema.Annotable.Self<S> =>\n    self.annotations({ [ParamKeyAnnotationId]: value });\n\n/**\n * HTTP params parser.\n * Supports custom key serialization.\n */\nexport class UrlParser<T extends Record<string, any>> {\n  constructor(private readonly _schema: Schema.Struct<T>) {}\n\n  /**\n   * Parse URL params.\n   */\n  parse(_url: string): T {\n    const url = new URL(_url);\n    return Object.entries(this._schema.fields).reduce<Record<string, any>>((params, [key, type]) => {\n      let value = url.searchParams.get(decamelize(key));\n      if (value == null) {\n        value = url.searchParams.get(key);\n      }\n\n      if (value != null) {\n        if (SchemaAST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (SchemaAST.isBooleanKeyword(type.ast)) {\n          params[key] = value === 'true' || value === '1';\n        } else {\n          params[key] = value;\n        }\n      }\n\n      return params;\n    }, {}) as T;\n  }\n\n  /**\n   * Return URL with encoded params.\n   */\n  create(_url: string, params: T): URL {\n    const url = new URL(_url);\n    Object.entries(params).forEach(([key, value]) => {\n      if (value !== undefined) {\n        const field = this._schema.fields[key];\n        if (field) {\n          const { key: serializedKey } = Function.pipe(\n            getParamKeyAnnotation(field.ast),\n            Option.getOrElse(() => ({\n              key: decamelize(key),\n            })),\n          );\n\n          url.searchParams.set(serializedKey, String(value));\n        }\n      }\n    });\n\n    return url;\n  }\n}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport * as Effect from 'effect/Effect';\nimport type * as Scope from 'effect/Scope';\n\nimport { Context } from '@dxos/context';\n\n// TODO(dmaretskyi): Error handling.\nexport const contextFromScope = (): Effect.Effect<Context, never, Scope.Scope> =>\n  Effect.gen(function* () {\n    const ctx = new Context();\n    yield* Effect.addFinalizer(() => Effect.promise(() => ctx.dispose()));\n    return ctx;\n  });\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport * as Cause from 'effect/Cause';\nimport * as Chunk from 'effect/Chunk';\nimport * as Effect from 'effect/Effect';\nimport * as Exit from 'effect/Exit';\nimport * as GlobalValue from 'effect/GlobalValue';\nimport * as Option from 'effect/Option';\nimport type * as Tracer from 'effect/Tracer';\n\nconst spanSymbol = Symbol.for('effect/SpanAnnotation');\nconst originalSymbol = Symbol.for('effect/OriginalAnnotation');\nconst spanToTrace = GlobalValue.globalValue('effect/Tracer/spanToTrace', () => new WeakMap());\nconst locationRegex = /\\((.*)\\)/g;\n\n/**\n * Adds effect spans.\n * Removes effect internal functions.\n * Unwraps error proxy.\n */\nconst prettyErrorStack = (error: any, appendStacks: string[] = []): any => {\n  const span = error[spanSymbol];\n\n  const lines = typeof error.stack === 'string' ? error.stack.split('\\n') : [];\n  const out = [];\n\n  let atStack = false;\n  for (let i = 0; i < lines.length; i++) {\n    if (!atStack && !lines[i].startsWith('    at ')) {\n      out.push(lines[i]);\n      continue;\n    }\n    atStack = true;\n\n    if (lines[i].includes(' at new BaseEffectError') || lines[i].includes(' at new YieldableError')) {\n      i++;\n      continue;\n    }\n    if (lines[i].includes('Generator.next')) {\n      break;\n    }\n    if (lines[i].includes('effect_internal_function')) {\n      break;\n    }\n    out.push(\n      lines[i]\n        .replace(/at .*effect_instruction_i.*\\((.*)\\)/, 'at $1')\n        .replace(/EffectPrimitive\\.\\w+/, '<anonymous>')\n        .replace(/at Arguments\\./, 'at '),\n    );\n  }\n\n  if (span) {\n    let current: Tracer.Span | Tracer.AnySpan | undefined = span;\n    let i = 0;\n    while (current && current._tag === 'Span' && i < 10) {\n      const stackFn = spanToTrace.get(current);\n      if (typeof stackFn === 'function') {\n        const stack = stackFn();\n        if (typeof stack === 'string') {\n          const locationMatchAll = stack.matchAll(locationRegex);\n          let match = false;\n          for (const [, location] of locationMatchAll) {\n            match = true;\n            out.push(`    at ${current.name} (${location})`);\n          }\n          if (!match) {\n            out.push(`    at ${current.name} (${stack.replace(/^at /, '')})`);\n          }\n        } else {\n          out.push(`    at ${current.name}`);\n        }\n      } else {\n        out.push(`    at ${current.name}`);\n      }\n      current = Option.getOrUndefined(current.parent);\n      i++;\n    }\n  }\n\n  out.push(...appendStacks);\n\n  if (error[originalSymbol]) {\n    error = error[originalSymbol];\n  }\n  if (error.cause) {\n    error.cause = prettyErrorStack(error.cause);\n  }\n\n  Object.defineProperty(error, 'stack', {\n    value: out.join('\\n'),\n    writable: true,\n    enumerable: false,\n    configurable: true,\n  });\n\n  return error;\n};\n\n/**\n * Converts a cause to an error.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const causeToError = (cause: Cause.Cause<any>): Error => {\n  if (Cause.isEmpty(cause)) {\n    return new Error('Fiber failed without a cause');\n  } else if (Cause.isInterruptedOnly(cause)) {\n    return new Error('Fiber was interrupted');\n  } else {\n    const errors = [...Chunk.toArray(Cause.failures(cause)), ...Chunk.toArray(Cause.defects(cause))];\n\n    const getStackFrames = (): string[] => {\n      const o: { stack: string } = {} as any;\n      Error.captureStackTrace(o, getStackFrames);\n      return o.stack.split('\\n').slice(1);\n    };\n\n    const stackFrames = getStackFrames();\n    const newErrors = errors.map((error) => prettyErrorStack(error, stackFrames));\n\n    if (newErrors.length === 1) {\n      return newErrors[0];\n    } else {\n      return new AggregateError(newErrors);\n    }\n  }\n};\n\n/**\n * Throws an error based on the cause.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const throwCause = (cause: Cause.Cause<any>): never => {\n  throw causeToError(cause);\n};\n\nexport const unwrapExit = <A>(exit: Exit.Exit<A, any>): A => {\n  if (Exit.isSuccess(exit)) {\n    return exit.value;\n  }\n\n  return throwCause(exit.cause);\n};\n\n/**\n * Runs the embedded effect asynchronously and throws any failures and defects as errors.\n * Inserts effect spans as stack frames.\n * The error will have stack frames of where the effect was run (if stack trace limit allows).\n * Removes effect runtime internal stack frames.\n *\n * To be used in place of `Effect.runPromise`.\n *\n * @throws AggregateError if there are multiple errors.\n */\nexport const runAndForwardErrors = async <A, E>(\n  effect: Effect.Effect<A, E, never>,\n  options?: { signal?: AbortSignal },\n): Promise<A> => {\n  const exit = await Effect.runPromiseExit(effect, options);\n  return unwrapExit(exit);\n};\n\n/**\n * Like `Effect.promise` but also caputes spans for defects.\n * Workaround for: https://github.com/Effect-TS/effect/issues/5436\n */\nexport const promiseWithCauseCapture: <A>(evaluate: (signal: AbortSignal) => PromiseLike<A>) => Effect.Effect<A> = (\n  evaluate,\n) =>\n  Effect.promise(async (signal) => {\n    try {\n      const result = await evaluate(signal);\n      return Effect.succeed(result);\n    } catch (err) {\n      return Effect.die(err);\n    }\n  }).pipe(Effect.flatten);\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport * as Context from 'effect/Context';\nimport * as Effect from 'effect/Effect';\nimport type { TestContext } from 'vitest';\n\n// TODO(dmaretskyi): Add all different test tags here.\nexport type TestTag =\n  | 'flaky' // Flaky tests.\n  | 'llm' // Tests with AI.\n  | 'sync'; // Sync with external services.\n\nexport namespace TestHelpers {\n  /**\n   * Skip the test if the condition is false.\n   *\n   * Exmaple:\n   * ```ts\n   * it.effect(\n   *   'should process an agentic loop using Claude',\n   *   Effect.fn(function* ({ expect }) {\n   *     // ...\n   *   }),\n   *   TestHelpers.runIf(process.env.ANTHROPIC_API_KEY),\n   * );\n   * ```\n   */\n  export const runIf =\n    (condition: unknown) =>\n    <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n      Effect.gen(function* () {\n        if (!condition) {\n          ctx.skip();\n        } else {\n          return yield* effect;\n        }\n      });\n\n  /**\n   * Skip the test if the condition is true.\n   *\n   * Exmaple:\n   * ```ts\n   * it.effect(\n   *   'should process an agentic loop using Claude',\n   *   Effect.fn(function* ({ expect }) {\n   *     // ...\n   *   }),\n   *   TestHelpers.skipIf(!process.env.ANTHROPIC_API_KEY),\n   * );\n   * ```\n   */\n  export const skipIf =\n    (condition: unknown) =>\n    <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n      Effect.gen(function* () {\n        if (condition) {\n          ctx.skip();\n        } else {\n          return yield* effect;\n        }\n      });\n\n  /**\n   * Skips this test if the tag is not in the list of tags to run.\n   * Tags are specified in the `DX_TEST_TAGS` environment variable.\n   *\n   * @param tag\n   * @returns\n   */\n  export const taggedTest =\n    (tag: TestTag) =>\n    <A, E, R>(effect: Effect.Effect<A, E, R>, ctx: TestContext): Effect.Effect<A, E, R> =>\n      Effect.gen(function* () {\n        if (!process.env.DX_TEST_TAGS?.includes(tag)) {\n          ctx.skip();\n        } else {\n          return yield* effect;\n        }\n      });\n\n  /**\n   * Provide TestContext from test parameters.\n   *\n   * Exmaple:\n   * ```ts\n   * it.effect(\n   *   'with context',\n   *   Effect.fn(function* ({ expect }) {\n   *     const ctx = yield* TestContextService;\n   *   }),\n   *   TestHelpers.provideTestContext,\n   * );\n   * ```\n   */\n  export const provideTestContext = <A, E, R>(\n    effect: Effect.Effect<A, E, R>,\n    ctx: TestContext,\n  ): Effect.Effect<A, E, Exclude<R, TestContextService>> => Effect.provideService(effect, TestContextService, ctx);\n}\n\n/**\n * Exposes vitest test context as an effect service.\n */\nexport class TestContextService extends Context.Tag('@dxos/effect/TestContextService')<\n  TestContextService,\n  TestContext\n>() {}\n", "//\n// Copyright 2025 DXOS.org\n//\n\nimport * as Effect from 'effect/Effect';\nimport type * as Scope from 'effect/Scope';\n\nimport type { Lifecycle } from '@dxos/context';\n\n/**\n * Acquires a resource and releases it when the scope is closed.\n */\nexport const acquireReleaseResource = <T extends Lifecycle>(\n  getResource: () => T,\n): Effect.Effect<T, never, Scope.Scope> =>\n  Effect.acquireRelease(\n    Effect.gen(function* () {\n      const resource = getResource();\n      yield* Effect.promise(async () => {\n        resource.open?.();\n        return undefined;\n      });\n      return resource;\n    }),\n    (resource) =>\n      Effect.promise(async () => {\n        resource.close?.();\n        return undefined;\n      }),\n  );\n"],
+  "mappings": ";;;AAIA,YAAYA,cAAc;AAC1B,YAAYC,YAAY;AACxB,YAAYC,YAAY;AACxB,YAAYC,eAAe;AAE3B,SAASC,iBAAiB;AAC1B,SAASC,qBAAqB;;AAc9B,IAAMC,eAAc,CAACC,SAAAA;AAEnB,SAAiBD,sBAAYC,IAAAA,KAASA,KAAKC,SAASC,SAAS;AAC/D;AAKO,IAAMC,gBAAgB,CAACH,SAAAA;AAC5B,MACYI,wBAAcJ,IAAAA,KACdK,0BAAgBL,IAAAA,KAChBM,wBAAcN,IAAAA;EAExBD,aAAYC,IAAAA,KACZO,qBAAqBP,IAAAA,GACrB;AACA,WAAO;EACT;AAEA,MAAcQ,0BAAgBR,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAcS,0BAAgBT,IAAAA,GAAO;AACnC,WAAO;EACT;AACA,MAAcU,2BAAiBV,IAAAA,GAAO;AACpC,WAAO;EACT;AAEA,MAAcW,kBAAQX,IAAAA,GAAO;AAC3B,WAAO;EACT;AAEA,MAAcY,oBAAUZ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACF;AAEO,IAAMa,eAAe,CAACb,SAAiC,CAAC,CAACG,cAAcH,IAAAA;UAE7Dc,aAAAA;cAKFC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AA8BV,IAAKI,cAAAA,0BAAAA,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;SARSA;;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,QAGT,CAACpB,MAAqBqB,eAAmCC,YAAAA;AAC3D,MAAI,CAACA,SAAS;AACZC,cAAUvB,MAAMmB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUvB,MAAMqB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBvB,MACAwB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOxB,MAAMyB,MAAMC,KAAAA;AACnC,QAAME,SACJD,YAAYE,SAAAA,IAER,OAAOF,YAAY,YACjBA,UAAAA,IAAAA,IAGAA;AAER,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BN,YAAQtB,MAAMyB,MAAMC,KAAAA;EACtB;AAGA,MAAcpB,wBAAcN,IAAAA,GAAO;AACjC,eAAW8B,QAAkBC,gCAAsB/B,IAAAA,GAAO;AACxD,YAAMgC,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGmB7B,sBAAYC,IAAAA,GAAO;AACpC,eAAW,CAACmC,GAAGC,OAAAA,KAAYpC,KAAKC,SAASoC,QAAO,GAAI;AAClD,YAAML,cAAc;WAAIP;QAAMU;;AAC9B,YAAMP,UAASL,UAAUa,QAAQpB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGmBU,kBAAQtC,IAAAA,GAAO;AAChC,eAAWgB,QAAQhB,KAAKuC,OAAO;AAC7B,YAAMX,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGmBY,uBAAaxC,IAAAA,GAAO;AACrC,UAAM4B,UAASL,UAAUvB,KAAKyC,MAAMjB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMc,WAAW,CAAC1C,MAAqBwB,SAAAA;AAC5C,MAAIA,KAAKxB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGmBM,wBAAcN,IAAAA,GAAO;AACtC,eAAW8B,QAAkBC,gCAAsB/B,IAAAA,GAAO;AACxD,YAAM2C,QAAQD,SAASZ,KAAKd,MAAMQ,IAAAA;AAClC,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;AACA,eAAWb,QAAQc,mBAAmB5C,IAAAA,GAAO;AAC3C,YAAM2C,QAAQD,SAASZ,KAAKd,MAAMQ,IAAAA;AAClC,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGmB5C,sBAAYC,IAAAA,GAAO;AACpC,eAAW,CAAC6C,GAAGT,OAAAA,KAAYpC,KAAKC,SAASoC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASN,QAAQpB,MAAMQ,IAAAA;AACrC,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGmBL,kBAAQtC,IAAAA,GAAO;AAChC,QAAI8C,eAAe9C,IAAAA,GAAO;AACxB,aAAO6B;IACT;AAEA,eAAWb,QAAQhB,KAAKuC,OAAO;AAC7B,YAAMI,QAAQD,SAAS1B,MAAMQ,IAAAA;AAC7B,UAAImB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGmBH,uBAAaxC,IAAAA,GAAO;AACrC,WAAO0C,SAAS1C,KAAKyC,MAAMjB,IAAAA;EAC7B;AACF;AAKO,IAAMuB,eAAe,CAC1BC,QACAvB,SAAAA;AAEA,QAAMwB,UAAU,CAACjD,MAAqByB,UAAAA;AACpC,UAAM,CAACQ,MAAM,GAAGiB,IAAAA,IAAQzB;AACxB,UAAM0B,WAAWT,SAAS1C,MAAgBM,uBAAa;AACvDT,cAAUsD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWrB,QAAkBC,gCAAsBoB,QAAAA,GAAW;AAC5D,UAAIrB,KAAKG,SAASA,MAAM;AACtB,YAAIiB,KAAKhD,QAAQ;AACf,iBAAO+C,QAAQnB,KAAKd,MAAMkC,IAAAA;QAC5B,OAAO;AACL,iBAAOpB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOiC,QAAQD,OAAOI,KAAK3B,KAAK4B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAA0D;EAC9D,CAAC,eAAA,GAAqCC;EACtC,CAAC,eAAA,GAAqCC;EACtC,CAAC,eAAA,GAAqCC;EACtC,CAAC,gBAAA,GAAsCC;AACzC;AAOO,IAAMC,iBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC7D,SAAAA;AAEC,QAAM8D,KAAcC,cAAeC,kCAAwBhE,IAAAA,GAAciE,qBAAc;AACvF,QAAMC,QAAiBH,cAAeJ,wBAAiBC,YAAAA,EAAc5D,IAAAA,GAAciE,qBAAc;AACjG,MAAIJ,cAAcK,UAAUZ,mBAAmBtD,KAAKmE,IAAI,GAAGC,YAAYR,YAAAA,KAAiBM,UAAUJ,KAAK;AACrG,WAAOjC;EACT;AAEA,SAAOqC;AACT;AAOK,IAAMG,iBAAiB,CAAIrE,MAAqB4D,cAAsBC,YAAY,SAAI;AAC3F,QAAMS,oBAAoBX,eAAcC,cAAcC,SAAAA;AAEtD,QAAMU,oBAAoB,CAACvE,UAAAA;AACzB,UAAMkE,QAAQI,kBAAkBtE,KAAAA;AAChC,QAAIkE,UAAUrC,QAAW;AACvB,aAAOqC;IACT;AAEA,QAAc5B,kBAAQtC,KAAAA,GAAO;AAC3B,UAAIwE,SAASxE,KAAAA,GAAO;AAClB,eAAOsE,kBAAkBtE,MAAKuC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOgC,kBAAkBvE,IAAAA;AAC3B;AASO,IAAMwE,WAAW,CAACxE,SAAAA;AACvB,SAAiBsC,kBAAQtC,IAAAA,KAASA,KAAKuC,MAAMrC,WAAW,KAAeuE,6BAAmBzE,KAAKuC,MAAM,CAAA,CAAE;AACzG;AAKO,IAAMO,iBAAiB,CAAC9C,SAAAA;AAC7B,SAAiBsC,kBAAQtC,IAAAA,KAASA,KAAKuC,MAAMmC,MAAgB9D,mBAAS;AACxE;AAKO,IAAML,uBAAuB,CAACP,SAAAA;AACnC,SAAiBsC,kBAAQtC,IAAAA,KAAS,CAAC,CAAC2E,uBAAuB3E,IAAAA,GAAOE;AACpE;AAKO,IAAMyE,yBAAyB,CAAC3E,SAAAA;AACrCH,YAAoByC,kBAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5B,MAAIwE,SAASxE,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKuC,MAAMqC,OAAiB,CAACC,QAAQ7D,SAAAA;AAC1C,UAAM8D,QAAkB/C,gCAAsBf,IAAAA,EAE3C+D,OAAO,CAACC,MAAgBpE,oBAAUoE,EAAEhE,IAAI,CAAA,EACxCiE,IAAI,CAACD,MAAMA,EAAE/C,KAAKC,SAAQ,CAAA;AAG7B,WAAO2C,OAAO3E,WAAW,IAAI4E,QAAQD,OAAOE,OAAO,CAACjD,SAASgD,MAAMI,SAASpD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMqD,uBAAuB,CAClCnF,MACAkE,QAA6B,CAAC,MAAC;AAE/BrE,YAAoByC,kBAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AAC5BH,YAAUqE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuB3E,IAAAA;AACrC,MAAI,CAAC8E,OAAO5E,QAAQ;AAClB;EACF;AAGA,aAAWc,QAAQhB,KAAKuC,OAAO;AAC7B,UAAM6C,QAAkBrD,gCAAsBf,IAAAA,EAC3C+D,OAAO,CAACjD,SAASgD,OAAOI,SAASpD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDwC,MAAM,CAAC5C,SAAAA;AACNjC,gBAAoBe,oBAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACvC,aAAOc,KAAKd,KAAKqE,YAAYnB,MAAMpC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIkD,OAAO;AACT,aAAOpE;IACT;EACF;AAKA,QAAMsE,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACnD,SAAAA;AACJ,UAAM2D,WAAWzF,KAAKuC,MACnB0C,IAAI,CAACjE,SAAAA;AACJ,YAAMqE,UAAoBtD,gCAAsBf,IAAAA,EAAM0E,KAAK,CAACV,MAAMA,EAAE/C,KAAKC,SAAQ,MAAOJ,IAAAA;AACxFjC,gBAAoBe,oBAAUyE,QAAQrE,IAAI,GAAA,QAAA;;;;;;;;;AAC1C,aAAOqE,QAAQrE,KAAKqE;IACtB,CAAA,EACCN,OAAOjF,aAAAA;AAEV,WAAO2F,SAASvF,SAAS;MAAC4B;MAAa6D,eAAO,GAAIF,QAAAA;QAAa5D;EACjE,CAAA,EACCkD,OAAOjF,aAAAA,CAAAA;AAGZ,QAAMkD,SAAgB4C,cAAON,MAAAA;AAC7B,SAAOtC,OAAOI;AAChB;AAOO,IAAMyC,SAAS,CACpBzC,KACA0C,MAAAA;AAEA,UAAQ1C,IAAIe,MAAI;IACd,KAAK,eAAe;AAClB,aAAO,IAAc4B,sBACnB3C,IAAI4C,mBAAmBf,IACrB,CAACnD,SACC,IAAcmE,4BACZnE,KAAKG,MACL6D,EAAEhE,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAKoE,YACLpE,KAAKqE,YACLrE,KAAKsC,WAAW,CAAA,GAGtBhB,IAAIgD,iBACJhD,IAAIgB,WAAW;IAEnB;IACA,KAAK,SAAS;AACZ,aAAiBiC,gBAAMC,KAAKlD,IAAIb,MAAM0C,IAAIa,CAAAA,GAAI1C,IAAIgB,WAAW;IAC/D;IACA,KAAK,aAAa;AAChB,aAAO,IAAcmC,oBACnBnD,IAAInD,SAASgF,IAAI,CAACuB,GAAGC,UAAU,IAAcC,uBAAaZ,EAAEU,EAAExF,MAAMyF,KAAAA,GAAQD,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACvGhB,IAAIF,KAAK+B,IAAI,CAACuB,MAAM,IAAcG,eAAKb,EAAEU,EAAExF,MAAMa,MAAAA,GAAY2E,EAAEpC,WAAW,CAAA,GAC1EhB,IAAI+C,YACJ/C,IAAIgB,WAAW;IAEnB;IACA,KAAK,WAAW;AACd,YAAMwC,SAASd,EAAE1C,IAAI0C,EAAC,GAAIjE,MAAAA;AAC1B,aAAO,IAAcgF,kBAAQ,MAAMD,QAAQxD,IAAIgB,WAAW;IAC5D;IACA,SAAS;AAEP,aAAOhB;IACT;EACF;AACF;AAKO,IAAM0D,cAAc,CAAC9G,SAAAA;AAC1B,SACYD,sBAAYC,IAAAA,KACXsC,kBAAQtC,IAAAA,KACjBA,KAAKuC,MAAMwE,KAAKD,WAAAA,KAChB9G,KAAKuC,MAAMwE,KAAetC,4BAAkB,KAC5CzE,KAAKuC,MAAMrC,WAAW;AAE5B;AAEA,IAAM0C,qBAAqB,CAACQ,QAAAA;AAC1B,QAAM4D,aAAuBC,iCAAuB7D,GAAAA;AACpD,MAAW8D,cAAOF,UAAAA,GAAa;AAC7B,WAAOpE,mBAAmBoE,WAAW9C,KAAK;EAC5C;AACA,UAAQd,IAAIe,MAAI;IACd,KAAK;AACH,aAAOf,IAAIgD,gBAAgBe,MAAK;IAClC,KAAK;AACH,aAAOvE,mBAAmBQ,IAAI0C,EAAC,CAAA;IACjC,KAAK;AACH,aAAOlD,mBAAmBQ,IAAIX,IAAI;EACtC;AACA,SAAO,CAAA;AACT;;;;ACpfA,YAAY2E,aAAY;AACxB,YAAYC,aAAY;AACxB,SAASC,gBAAgB;AAEzB,SAASC,aAAAA,kBAAiB;;AAK1B,IAAMC,aAAa;AACnB,IAAMC,aAAa;AAMZ,IAAMC,WAAkBC,eAAOC,KAAYC,gBAAQL,UAAAA,CAAAA,EAAaM,YAAY;EACjFC,OAAO;EACPC,aAAa;AACf,CAAA;AACO,IAAMC,WAAkBC,uBAAeN,KACrCC,gBAAQJ,YAAY;EACzBU,SAAS,MAAM;AACjB,CAAA,CAAA;AAGK,IAAMC,aAAa,CAACC,UAAAA;AACzB,SAAcC,eAAcC,uBAAeb,QAAAA,EAAUW,KAAAA,CAAAA;AACvD;AAqBO,IAAMG,iBAAiB,CAACC,SAAAA;AAC7B,QAAMC,gBAAgBD,KACnBE,IAAI,CAACC,GAAGC,MAAAA;AACP,QAAI,OAAOD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOC,MAAM,IAAID,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACCE,KAAK,EAAA;AAERvB,EAAAA,WAAUa,WAAWM,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAMK,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpD3B,EAAAA,WAAUa,WAAWa,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAACV,SAAAA;AAC5B,MAAI,CAACL,WAAWK,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACGW,MAAM,2BAAA,GACLT,IAAI,CAACU,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKH,QAAQ,UAAU,EAAA,IAAMG,IAAAA,KAAU,CAAA;AAErF;AAKO,IAAME,WAAW,CAACC,QAAaf,SAAAA;AAEpC,SAAOnB,SAAS;IAAEmB;IAAMgB,MAAMD;EAAO,CAAA,EAAG,CAAA;AAC1C;;;ACjGA,YAAYE,eAAc;AAC1B,YAAYC,aAAY;AAExB,YAAYC,gBAAe;AAE3B,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACDC,yBAAuCJ,oBAAAA;AAE5C,IAAMK,qBACX,CAACC,UACD,CAAiCC,SAC/BA,KAAKC,YAAY;EAAE,CAACR,oBAAAA,GAAuBM;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;;EACX,YAA6BC,SAA2B;SAA3BA,UAAAA;EAA4B;;;;EAKzDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIf,QAAQO,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAId,SAAS,MAAM;AACjBA,gBAAQO,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAId,SAAS,MAAM;AACjB,YAAcmB,2BAAgBJ,KAAKK,GAAG,GAAG;AACvCP,iBAAOC,GAAAA,IAAOO,SAASrB,KAAAA;QACzB,WAAqBsB,4BAAiBP,KAAKK,GAAG,GAAG;AAC/CP,iBAAOC,GAAAA,IAAOd,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLa,iBAAOC,GAAAA,IAAOd;QAChB;MACF;AAEA,aAAOa;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKd,KAAAA,MAAM;AAC1C,UAAIA,UAAUyB,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAcC,eACtC/B,sBAAsB6B,MAAMN,GAAG,GACxBS,kBAAU,OAAO;YACtBf,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAac,IAAIH,eAAeI,OAAO/B,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOO;EACT;AACF;;;AC1EA,YAAYyB,YAAY;AAGxB,SAASC,eAAe;;AAGjB,IAAMC,mBAAmB,MACvBC,WAAI,aAAA;AACT,QAAMC,MAAM,IAAIH,QAAAA,QAAAA;;;;AAChB,SAAcI,oBAAa,MAAaC,eAAQ,MAAMF,IAAIG,QAAO,CAAA,CAAA;AACjE,SAAOH;AACT,CAAA;;;ACXF,YAAYI,WAAW;AACvB,YAAYC,WAAW;AACvB,YAAYC,aAAY;AACxB,YAAYC,UAAU;AACtB,YAAYC,iBAAiB;AAC7B,YAAYC,aAAY;AAGxB,IAAMC,aAAaC,OAAOC,IAAI,uBAAA;AAC9B,IAAMC,iBAAiBF,OAAOC,IAAI,2BAAA;AAClC,IAAME,cAA0BC,wBAAY,6BAA6B,MAAM,oBAAIC,QAAAA,CAAAA;AACnF,IAAMC,gBAAgB;AAOtB,IAAMC,mBAAmB,CAACC,OAAYC,eAAyB,CAAA,MAAE;AAC/D,QAAMC,OAAOF,MAAMT,UAAAA;AAEnB,QAAMY,QAAQ,OAAOH,MAAMI,UAAU,WAAWJ,MAAMI,MAAMC,MAAM,IAAA,IAAQ,CAAA;AAC1E,QAAMC,MAAM,CAAA;AAEZ,MAAIC,UAAU;AACd,WAASC,IAAI,GAAGA,IAAIL,MAAMM,QAAQD,KAAK;AACrC,QAAI,CAACD,WAAW,CAACJ,MAAMK,CAAAA,EAAGE,WAAW,SAAA,GAAY;AAC/CJ,UAAIK,KAAKR,MAAMK,CAAAA,CAAE;AACjB;IACF;AACAD,cAAU;AAEV,QAAIJ,MAAMK,CAAAA,EAAGI,SAAS,yBAAA,KAA8BT,MAAMK,CAAAA,EAAGI,SAAS,wBAAA,GAA2B;AAC/FJ;AACA;IACF;AACA,QAAIL,MAAMK,CAAAA,EAAGI,SAAS,gBAAA,GAAmB;AACvC;IACF;AACA,QAAIT,MAAMK,CAAAA,EAAGI,SAAS,0BAAA,GAA6B;AACjD;IACF;AACAN,QAAIK,KACFR,MAAMK,CAAAA,EACHK,QAAQ,uCAAuC,OAAA,EAC/CA,QAAQ,wBAAwB,aAAA,EAChCA,QAAQ,kBAAkB,KAAA,CAAA;EAEjC;AAEA,MAAIX,MAAM;AACR,QAAIY,UAAoDZ;AACxD,QAAIM,IAAI;AACR,WAAOM,WAAWA,QAAQC,SAAS,UAAUP,IAAI,IAAI;AACnD,YAAMQ,UAAUrB,YAAYsB,IAAIH,OAAAA;AAChC,UAAI,OAAOE,YAAY,YAAY;AACjC,cAAMZ,QAAQY,QAAAA;AACd,YAAI,OAAOZ,UAAU,UAAU;AAC7B,gBAAMc,mBAAmBd,MAAMe,SAASrB,aAAAA;AACxC,cAAIsB,QAAQ;AACZ,qBAAW,CAAA,EAAGC,QAAAA,KAAaH,kBAAkB;AAC3CE,oBAAQ;AACRd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKD,QAAAA,GAAW;UACjD;AACA,cAAI,CAACD,OAAO;AACVd,gBAAIK,KAAK,UAAUG,QAAQQ,IAAI,KAAKlB,MAAMS,QAAQ,QAAQ,EAAA,CAAA,GAAM;UAClE;QACF,OAAO;AACLP,cAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;QACnC;MACF,OAAO;AACLhB,YAAIK,KAAK,UAAUG,QAAQQ,IAAI,EAAE;MACnC;AACAR,gBAAiBS,uBAAeT,QAAQU,MAAM;AAC9ChB;IACF;EACF;AAEAF,MAAIK,KAAI,GAAIV,YAAAA;AAEZ,MAAID,MAAMN,cAAAA,GAAiB;AACzBM,YAAQA,MAAMN,cAAAA;EAChB;AACA,MAAIM,MAAMyB,OAAO;AACfzB,UAAMyB,QAAQ1B,iBAAiBC,MAAMyB,KAAK;EAC5C;AAEAC,SAAOC,eAAe3B,OAAO,SAAS;IACpC4B,OAAOtB,IAAIuB,KAAK,IAAA;IAChBC,UAAU;IACVC,YAAY;IACZC,cAAc;EAChB,CAAA;AAEA,SAAOhC;AACT;AAYO,IAAMiC,eAAe,CAACR,UAAAA;AAC3B,MAAUS,cAAQT,KAAAA,GAAQ;AACxB,WAAO,IAAIU,MAAM,8BAAA;EACnB,WAAiBC,wBAAkBX,KAAAA,GAAQ;AACzC,WAAO,IAAIU,MAAM,uBAAA;EACnB,OAAO;AACL,UAAME,SAAS;SAAUC,cAAcC,eAASd,KAAAA,CAAAA;SAAkBa,cAAcE,cAAQf,KAAAA,CAAAA;;AAExF,UAAMgB,iBAAiB,MAAA;AACrB,YAAMC,IAAuB,CAAC;AAC9BP,YAAMQ,kBAAkBD,GAAGD,cAAAA;AAC3B,aAAOC,EAAEtC,MAAMC,MAAM,IAAA,EAAMuC,MAAM,CAAA;IACnC;AAEA,UAAMC,cAAcJ,eAAAA;AACpB,UAAMK,YAAYT,OAAOU,IAAI,CAAC/C,UAAUD,iBAAiBC,OAAO6C,WAAAA,CAAAA;AAEhE,QAAIC,UAAUrC,WAAW,GAAG;AAC1B,aAAOqC,UAAU,CAAA;IACnB,OAAO;AACL,aAAO,IAAIE,eAAeF,SAAAA;IAC5B;EACF;AACF;AAYO,IAAMG,aAAa,CAACxB,UAAAA;AACzB,QAAMQ,aAAaR,KAAAA;AACrB;AAEO,IAAMyB,aAAa,CAAIC,SAAAA;AAC5B,MAASC,eAAUD,IAAAA,GAAO;AACxB,WAAOA,KAAKvB;EACd;AAEA,SAAOqB,WAAWE,KAAK1B,KAAK;AAC9B;AAYO,IAAM4B,sBAAsB,OACjCC,QACAC,YAAAA;AAEA,QAAMJ,OAAO,MAAaK,uBAAeF,QAAQC,OAAAA;AACjD,SAAOL,WAAWC,IAAAA;AACpB;AAMO,IAAMM,0BAAsG,CACjHC,aAEOC,gBAAQ,OAAOC,WAAAA;AACpB,MAAI;AACF,UAAMC,SAAS,MAAMH,SAASE,MAAAA;AAC9B,WAAcE,gBAAQD,MAAAA;EACxB,SAASE,KAAK;AACZ,WAAcC,YAAID,GAAAA;EACpB;AACF,CAAA,EAAGE,KAAYC,eAAO;;;AC1LxB,YAAYC,cAAa;AACzB,YAAYC,aAAY;UASPC,cAAAA;eAeFC,QACX,CAACC,cACD,CAAUC,QAAgCC,QACjCC,YAAI,aAAA;AACT,QAAI,CAACH,WAAW;AACdE,UAAIE,KAAI;IACV,OAAO;AACL,aAAO,OAAOH;IAChB;EACF,CAAA;eAgBSI,SACX,CAACL,cACD,CAAUC,QAAgCC,QACjCC,YAAI,aAAA;AACT,QAAIH,WAAW;AACbE,UAAIE,KAAI;IACV,OAAO;AACL,aAAO,OAAOH;IAChB;EACF,CAAA;eASSK,aACX,CAACC,QACD,CAAUN,QAAgCC,QACjCC,YAAI,aAAA;AACT,QAAI,CAACK,QAAQC,IAAIC,cAAcC,SAASJ,GAAAA,GAAM;AAC5CL,UAAIE,KAAI;IACV,OAAO;AACL,aAAO,OAAOH;IAChB;EACF,CAAA;eAgBSW,qBAAqB,CAChCX,QACAC,QAC+DW,uBAAeZ,QAAQa,oBAAoBZ,GAAAA;AAC9G,GAvFiBJ,gBAAAA,cAAAA,CAAAA,EAAAA;AA4FV,IAAMgB,qBAAN,cAAyCC,aAAI,iCAAA,EAAA,EAAA;AAG/C;;;;ACzGL,YAAYC,aAAY;AAQjB,IAAMC,yBAAyB,CACpCC,gBAEOC,uBACEC,YAAI,aAAA;AACT,QAAMC,WAAWH,YAAAA;AACjB,SAAcI,gBAAQ,YAAA;AACpBD,aAASE,OAAI;AACb,WAAOC;EACT,CAAA;AACA,SAAOH;AACT,CAAA,GACA,CAACA,aACQC,gBAAQ,YAAA;AACbD,WAASI,QAAK;AACd,SAAOD;AACT,CAAA,CAAA;",
+  "names": ["Function", "Option", "Schema", "SchemaAST", "invariant", "isNonNullable", "isTupleType", "node", "elements", "length", "getSimpleType", "isDeclaration", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "$result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "i", "element", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "getIndexSignatures", "_", "isLiteralUnion", "findProperty", "schema", "getProp", "rest", "typeNode", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "pipe", "getIdentifierAnnotation", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isOption", "isUndefinedKeyword", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "Literal", "Struct", "mapAst", "f", "TypeLiteral", "propertySignatures", "PropertySignature", "isOptional", "isReadonly", "indexSignatures", "Union", "make", "TupleType", "t", "index", "OptionalType", "Type", "newAst", "Suspend", "isArrayType", "some", "annotation", "getSurrogateAnnotation", "isSome", "slice", "Option", "Schema", "JSONPath", "invariant", "PATH_REGEX", "PROP_REGEX", "JsonPath", "String", "pipe", "pattern", "annotations", "title", "description", "JsonProp", "NonEmptyString", "message", "isJsonPath", "value", "isSome", "validateOption", "createJsonPath", "path", "candidatePath", "map", "p", "i", "join", "fromEffectValidationPath", "effectPath", "jsonPath", "replace", "splitJsonPath", "match", "part", "startsWith", "getField", "object", "json", "Function", "Option", "SchemaAST", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "_schema", "parse", "_url", "url", "URL", "Object", "entries", "fields", "reduce", "params", "key", "type", "searchParams", "get", "decamelize", "isNumberKeyword", "ast", "parseInt", "isBooleanKeyword", "create", "forEach", "undefined", "field", "serializedKey", "pipe", "getOrElse", "set", "String", "Effect", "Context", "contextFromScope", "gen", "ctx", "addFinalizer", "promise", "dispose", "Cause", "Chunk", "Effect", "Exit", "GlobalValue", "Option", "spanSymbol", "Symbol", "for", "originalSymbol", "spanToTrace", "globalValue", "WeakMap", "locationRegex", "prettyErrorStack", "error", "appendStacks", "span", "lines", "stack", "split", "out", "atStack", "i", "length", "startsWith", "push", "includes", "replace", "current", "_tag", "stackFn", "get", "locationMatchAll", "matchAll", "match", "location", "name", "getOrUndefined", "parent", "cause", "Object", "defineProperty", "value", "join", "writable", "enumerable", "configurable", "causeToError", "isEmpty", "Error", "isInterruptedOnly", "errors", "toArray", "failures", "defects", "getStackFrames", "o", "captureStackTrace", "slice", "stackFrames", "newErrors", "map", "AggregateError", "throwCause", "unwrapExit", "exit", "isSuccess", "runAndForwardErrors", "effect", "options", "runPromiseExit", "promiseWithCauseCapture", "evaluate", "promise", "signal", "result", "succeed", "err", "die", "pipe", "flatten", "Context", "Effect", "TestHelpers", "runIf", "condition", "effect", "ctx", "gen", "skip", "skipIf", "taggedTest", "tag", "process", "env", "DX_TEST_TAGS", "includes", "provideTestContext", "provideService", "TestContextService", "Tag", "Effect", "acquireReleaseResource", "getResource", "acquireRelease", "gen", "resource", "promise", "open", "undefined", "close"]
 }