@dxos/effect 0.7.1 → 0.7.2-staging.6d26b2a

package/dist/lib/browser/index.mjs

@@ -34,14 +34,13 @@ var PATH_REGEX = /[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*)*/;
 var PROP_REGEX = /\w+/;
 var JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX));
 var JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX));
-var getAnnotation = (annotationId) => (node) => pipe(AST.getAnnotation(annotationId)(node), Option.getOrUndefined);
 var VisitResult;
 (function(VisitResult2) {
   VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
   VisitResult2[VisitResult2["SKIP"] = 1] = "SKIP";
   VisitResult2[VisitResult2["EXIT"] = 2] = "EXIT";
 })(VisitResult || (VisitResult = {}));
-var defaultTest = (node) => isSimpleType(node) ? 0 : 1;
+var defaultTest = isSimpleType;
 var visit = (node, testOrVisitor, visitor) => {
   if (!visitor) {
     visitNode(node, defaultTest, testOrVisitor);
@@ -50,7 +49,8 @@ var visit = (node, testOrVisitor, visitor) => {
   }
 };
 var visitNode = (node, test, visitor, path = [], depth = 0) => {
-  const result = test?.(node, path, depth) ?? 0;
+  const _result = test?.(node, path, depth);
+  const result = _result === void 0 ? 0 : typeof _result === "boolean" ? _result ? 0 : 1 : _result;
   if (result === 2) {
     return result;
   }
@@ -129,7 +129,7 @@ var findProperty = (schema, path) => {
     const typeNode = findNode(node, AST.isTypeLiteral);
     invariant(typeNode, void 0, {
       F: __dxlog_file,
-      L: 221,
+      L: 223,
       S: void 0,
       A: [
         "typeNode",
@@ -154,14 +154,18 @@ var defaultAnnotations = {
   ["NumberKeyword"]: AST.numberKeyword,
   ["BooleanKeyword"]: AST.booleanKeyword
 };
-var findAnnotation = (node, annotationId, options) => {
-  const getAnnotationById = getAnnotation(annotationId);
+var getAnnotation = (annotationId, noDefault = true) => (node) => {
+  const value = pipe(AST.getAnnotation(annotationId)(node), Option.getOrUndefined);
+  if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {
+    return void 0;
+  }
+  return value;
+};
+var findAnnotation = (node, annotationId, noDefault = true) => {
+  const getAnnotationById = getAnnotation(annotationId, noDefault);
   const getBaseAnnotation = (node2) => {
     const value = getAnnotationById(node2);
     if (value !== void 0) {
-      if (options?.noDefault && value === defaultAnnotations[node2._tag]?.annotations[annotationId]) {
-        return void 0;
-      }
       return value;
     }
     if (AST.isUnion(node2)) {
@@ -184,7 +188,7 @@ var isDiscriminatedUnion = (node) => {
 var getDiscriminatingProps = (node) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 307,
+    L: 318,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -202,7 +206,7 @@ var getDiscriminatingProps = (node) => {
 var getDiscriminatedType = (node, value = {}) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 328,
+    L: 339,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -211,7 +215,7 @@ var getDiscriminatedType = (node, value = {}) => {
   });
   invariant(value, void 0, {
     F: __dxlog_file,
-    L: 329,
+    L: 340,
     S: void 0,
     A: [
       "value",
@@ -226,7 +230,7 @@ var getDiscriminatedType = (node, value = {}) => {
     const match = AST.getPropertySignatures(type).filter((prop) => props?.includes(prop.name.toString())).every((prop) => {
       invariant(AST.isLiteral(prop.type), void 0, {
         F: __dxlog_file,
-        L: 340,
+        L: 351,
         S: void 0,
         A: [
           "AST.isLiteral(prop.type)",
@@ -244,7 +248,7 @@ var getDiscriminatedType = (node, value = {}) => {
       const literal = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop);
       invariant(AST.isLiteral(literal.type), void 0, {
         F: __dxlog_file,
-        L: 358,
+        L: 369,
         S: void 0,
         A: [
           "AST.isLiteral(literal.type)",
@@ -261,6 +265,22 @@ var getDiscriminatedType = (node, value = {}) => {
   const schema = S.Struct(fields);
   return schema.ast;
 };
+var mapAst = (ast, f) => {
+  switch (ast._tag) {
+    case "TypeLiteral":
+      return new AST.TypeLiteral(ast.propertySignatures.map((prop) => new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations)), ast.indexSignatures);
+    case "Union":
+      return AST.Union.make(ast.types.map(f), ast.annotations);
+    case "TupleType":
+      return new AST.TupleType(ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)), ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)), ast.isReadonly, ast.annotations);
+    case "Suspend": {
+      const newAst = f(ast.f());
+      return new AST.Suspend(() => newAst, ast.annotations);
+    }
+    default:
+      return ast;
+  }
+};
 
 // packages/common/effect/src/url.ts
 import { AST as AST2 } from "@effect/schema";
@@ -337,6 +357,7 @@ export {
   isLiteralUnion,
   isOption,
   isSimpleType,
+  mapAst,
   visit
 };
 //# sourceMappingURL=index.mjs.map

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/index.ts", "../../../src/ast.ts", "../../../src/url.ts"],
-  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\n\n/**\n * Get annotation or return undefined.\n */\nexport const getAnnotation =\n  <T>(annotationId: symbol) =>\n  (node: AST.Annotated): T | undefined =>\n    pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\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 Tester = (node: AST.AST, path: Path, depth: number) => VisitResult | undefined;\nexport type Visitor = (node: AST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: Tester = (node) => (isSimpleType(node) ? VisitResult.CONTINUE : VisitResult.SKIP);\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: AST.AST, visitor: Visitor): void;\n  (node: AST.AST, test: Tester, visitor: Visitor): void;\n} = (node: AST.AST, testOrVisitor: Tester | Visitor, visitor?: Visitor): void => {\n  if (!visitor) {\n    visitNode(node, defaultTest, testOrVisitor);\n  } else {\n    visitNode(node, testOrVisitor as Tester, visitor);\n  }\n};\n\nconst visitNode = (\n  node: AST.AST,\n  test: Tester | undefined,\n  visitor: Visitor,\n  path: Path = [],\n  depth = 0,\n): VisitResult | undefined => {\n  const result = test?.(node, path, depth) ?? VisitResult.CONTINUE;\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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.booleanKeyword,\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 */\nexport const findAnnotation = <T>(\n  node: AST.AST,\n  annotationId: symbol,\n  options?: { noDefault: boolean },\n): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      if (options?.noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\n        return undefined;\n      }\n\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.Struct(fields);\n  return schema.ast;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
-  "mappings": ";;;AAIA,SAASA,OAAAA,MAAKC,YAAYC,UAAUC,UAAS;;;ACA7C,SAASC,KAAKC,UAAUC,SAAS;AACjC,SAASC,QAAQC,YAAY;AAE7B,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;AAcrB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIR,IAAIS,gBAAgBD,IAAAA,KAASR,IAAIU,cAAcF,IAAAA,KAASG,qBAAqBH,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIR,IAAIY,gBAAgBJ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIa,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIc,iBAAiBN,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIR,IAAIe,QAAQP,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIR,IAAIgB,UAAUR,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMS,eAAe,CAACT,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMU,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWlB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQJ,UAAAA,CAAAA;AACjD,IAAMK,WAAWrB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQH,UAAAA,CAAAA;AAKjD,IAAMK,gBACX,CAAIC,iBACJ,CAACjB,SACCJ,KAAKJ,IAAIwB,cAAiBC,YAAAA,EAAcjB,IAAAA,GAAOL,OAAOuB,cAAc;;UAE5DC,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAiBZ,IAAMC,cAAsB,CAACpB,SAAUS,aAAaT,IAAAA,IAAAA,IAAAA;AAQ7C,IAAMqB,QAGT,CAACrB,MAAesB,eAAiCC,YAAAA;AACnD,MAAI,CAACA,SAAS;AACZC,cAAUxB,MAAMoB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUxB,MAAMsB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBxB,MACAyB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,SAASH,OAAOzB,MAAM0B,MAAMC,KAAAA,KAAAA;AAClC,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BL,YAAQvB,MAAM0B,MAAMC,KAAAA;EACtB;AAGA,MAAInC,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAW6B,QAAQrC,IAAIsC,sBAAsB9B,IAAAA,GAAO;AAClD,YAAM+B,cAAc;WAAIL;QAAMG,KAAKG,KAAKC,SAAQ;;AAChD,YAAML,UAASJ,UAAUK,KAAKK,MAAMT,MAAMF,SAASQ,aAAaJ,QAAQ,CAAA;AACxE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAI2C,YAAYnC,IAAAA,GAAO;AAC9B,eAAW,CAACoC,GAAGC,OAAAA,KAAYrC,KAAKsC,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIL;QAAMU;;AAC9B,YAAMR,UAASJ,UAAUa,QAAQH,MAAMT,MAAMF,SAASQ,aAAaJ,KAAAA;AACnE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAIgD,QAAQxC,IAAAA,GAAO;AAC1B,eAAWkC,QAAQlC,KAAKyC,OAAO;AAC7B,YAAMb,UAASJ,UAAUU,MAAMT,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAIkD,aAAa1C,IAAAA,GAAO;AAC/B,UAAM4B,UAASJ,UAAUxB,KAAK2C,MAAMlB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIC,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAAC5C,MAAeyB,SAAAA;AACtC,MAAIA,KAAKzB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAW6B,QAAQrC,IAAIsC,sBAAsB9B,IAAAA,GAAO;AAClD,YAAM6C,QAAQD,SAASf,KAAKK,MAAMT,IAAAA;AAClC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSrD,IAAI2C,YAAYnC,IAAAA,GAAO;AAC9B,eAAW,CAAC8C,GAAGT,OAAAA,KAAYrC,KAAKsC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMT,IAAAA;AACrC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSrD,IAAIgD,QAAQxC,IAAAA,GAAO;AAC1B,QAAI+C,SAAS/C,IAAAA,GAAO;AAClB,iBAAWkC,QAAQlC,KAAKyC,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMT,IAAAA;AAC7B,YAAIoB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSrD,IAAIkD,aAAa1C,IAAAA,GAAO;AAC/B,WAAO4C,SAAS5C,KAAK2C,MAAMlB,IAAAA;EAC7B;AACF;AAKO,IAAMuB,eAAe,CAACC,QAAuBvB,SAAAA;AAClD,QAAMwB,UAAU,CAAClD,MAAe0B,UAAAA;AAC9B,UAAM,CAACM,MAAM,GAAGmB,IAAAA,IAAQzB;AACxB,UAAM0B,WAAWR,SAAS5C,MAAMR,IAAIU,aAAa;AACjDL,cAAUuD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQrC,IAAIsC,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKE,QAAQ;AACf,iBAAOH,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOK,KAAK5B,KAAK6B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2BhE,IAAIiE;EAChC,CAAC,eAAA,GAA2BjE,IAAIkE;EAChC,CAAC,eAAA,GAA2BlE,IAAImE;EAChC,CAAC,gBAAA,GAA4BnE,IAAIoE;AACnC;AAMO,IAAMC,iBAAiB,CAC5B7D,MACAiB,cACA6C,YAAAA;AAEA,QAAMC,oBAAoB/C,cAAcC,YAAAA;AAExC,QAAM+C,oBAAoB,CAAChE,UAAAA;AACzB,UAAMiE,QAAQF,kBAAkB/D,KAAAA;AAChC,QAAIiE,UAAUC,QAAW;AACvB,UAAIJ,SAASK,aAAaF,UAAUT,mBAAmBxD,MAAKoE,IAAI,GAAGC,YAAYpD,YAAAA,GAAe;AAC5F,eAAOiD;MACT;AAEA,aAAOD;IACT;AAEA,QAAIzE,IAAIgD,QAAQxC,KAAAA,GAAO;AACrB,UAAI+C,SAAS/C,KAAAA,GAAO;AAClB,eAAO+D,kBAAkB/D,MAAKyC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOuB,kBAAkBhE,IAAAA;AAC3B;AASO,IAAM+C,WAAW,CAAC/C,SAAAA;AACvB,SAAOR,IAAIgD,QAAQxC,IAAAA,KAASA,KAAKyC,MAAMY,WAAW,KAAK7D,IAAI8E,mBAAmBtE,KAAKyC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAM8B,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOR,IAAIgD,QAAQxC,IAAAA,KAASA,KAAKyC,MAAM+B,MAAMhF,IAAIgB,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAIgD,QAAQxC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOqD;AAC9D;AAKO,IAAMoB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUL,IAAIgD,QAAQxC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI+C,SAAS/C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKyC,MAAMiC,OAAiB,CAACC,QAAQzC,SAAAA;AAC1C,UAAM0C,QAAQpF,IAAIsC,sBAAsBI,IAAAA,EAErC2C,OAAO,CAACC,MAAMtF,IAAIgB,UAAUsE,EAAE5C,IAAI,CAAA,EAClC6C,IAAI,CAACD,MAAMA,EAAE9C,KAAKC,SAAQ,CAAA;AAG7B,WAAO0C,OAAOtB,WAAW,IAAIuB,QAAQD,OAAOE,OAAO,CAAChD,SAAS+C,MAAMI,SAASnD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMoD,uBAAuB,CAACjF,MAAeiE,QAA6B,CAAC,MAAC;AACjFpE,YAAUL,IAAIgD,QAAQxC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUoE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMW,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAOvB,QAAQ;AAClB;EACF;AAGA,aAAWnB,QAAQlC,KAAKyC,OAAO;AAC7B,UAAMyC,QAAQ1F,IAAIsC,sBAAsBI,IAAAA,EACrC2C,OAAO,CAAChD,SAAS+C,OAAOI,SAASnD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDuC,MAAM,CAAC3C,SAAAA;AACNhC,gBAAUL,IAAIgB,UAAUqB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKiD,YAAYlB,MAAMpC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIiD,OAAO;AACT,aAAOhD;IACT;EACF;AAKA,QAAMkD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAAClD,SAAAA;AACJ,UAAM0D,WAAWvF,KAAKyC,MACnBsC,IAAI,CAAC7C,SAAAA;AACJ,YAAMiD,UAAU3F,IAAIsC,sBAAsBI,IAAAA,EAAMsD,KAAK,CAACV,MAAMA,EAAE9C,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFhC,gBAAUL,IAAIgB,UAAU2E,QAAQjD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOiD,QAAQjD,KAAKiD;IACtB,CAAA,EACCN,OAAO/E,WAAAA;AAEV,WAAOyF,SAASlC,SAAS;MAACxB;MAAMnC,EAAE+F,QAAO,GAAIF,QAAAA;QAAarB;EAC5D,CAAA,EACCW,OAAO/E,WAAAA,CAAAA;AAGZ,QAAMmD,SAASvD,EAAEgG,OAAON,MAAAA;AACxB,SAAOnC,OAAOK;AAChB;;;AC7WA,SAASqC,OAAAA,YAA6B;AACtC,SAASC,UAAAA,SAAQC,QAAAA,aAAY;AAE7B,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,KAAIC,cAAuCL,oBAAAA;AAEtC,IAAMM,qBACX,CAACC,UACD,CAA4BC,SAC1BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIhB,QAAQQ,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAIf,SAAS,MAAM;AACjBA,gBAAQQ,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAIf,SAAS,MAAM;AACjB,YAAIH,KAAIuB,gBAAgBJ,KAAKK,GAAG,GAAG;AACjCP,iBAAOC,GAAAA,IAAOO,SAAStB,KAAAA;QACzB,WAAWH,KAAI0B,iBAAiBP,KAAKK,GAAG,GAAG;AACzCP,iBAAOC,GAAAA,IAAOf,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLc,iBAAOC,GAAAA,IAAOf;QAChB;MACF;AAEA,aAAOc;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKf,KAAAA,MAAM;AAC1C,UAAIA,UAAU0B,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BjC,sBAAsB+B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOjC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOQ;EACT;AACF;",
-  "names": ["AST", "JSONSchema", "Schema", "S", "AST", "Schema", "S", "Option", "pipe", "invariant", "nonNullable", "getSimpleType", "node", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "NonEmptyString", "pattern", "JsonProp", "getAnnotation", "annotationId", "getOrUndefined", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "result", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "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", "findAnnotation", "options", "getAnnotationById", "getBaseAnnotation", "value", "undefined", "noDefault", "_tag", "annotations", "isUndefinedKeyword", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "Literal", "Struct", "AST", "Option", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "AST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "constructor", "_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"]
+  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\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: AST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: AST.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: AST.AST, visitor: VisitorFn): void;\n  (node: AST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: AST.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: AST.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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.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: AST.AST): T | undefined => {\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\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: AST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.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 AST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (ast: AST.AST, f: (ast: AST.AST) => AST.AST): AST.AST => {\n  switch (ast._tag) {\n    case 'TypeLiteral':\n      return new AST.TypeLiteral(\n        ast.propertySignatures.map(\n          (prop) =>\n            new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations),\n        ),\n        ast.indexSignatures,\n      );\n    case 'Union':\n      return AST.Union.make(ast.types.map(f), ast.annotations);\n    case 'TupleType':\n      return new AST.TupleType(\n        ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    case 'Suspend': {\n      const newAst = f(ast.f());\n      return new AST.Suspend(() => newAst, ast.annotations);\n    }\n    default:\n      // TODO(dmaretskyi): Support more nodes.\n      return ast;\n  }\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
+  "mappings": ";;;AAIA,SAASA,OAAAA,MAAKC,YAAYC,UAAUC,UAAS;;;ACA7C,SAASC,KAAKC,UAAUC,SAAS;AACjC,SAASC,QAAQC,YAAY;AAE7B,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;AAcrB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIR,IAAIS,gBAAgBD,IAAAA,KAASR,IAAIU,cAAcF,IAAAA,KAASG,qBAAqBH,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIR,IAAIY,gBAAgBJ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIa,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIc,iBAAiBN,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIR,IAAIe,QAAQP,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIR,IAAIgB,UAAUR,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMS,eAAe,CAACT,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMU,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWlB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQJ,UAAAA,CAAAA;AACjD,IAAMK,WAAWrB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQH,UAAAA,CAAAA;;UAE5CK,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAkBZ,IAAMC,cAAsBR;AAQrB,IAAMS,QAGT,CAAClB,MAAemB,eAAmCC,YAAAA;AACrD,MAAI,CAACA,SAAS;AACZC,cAAUrB,MAAMiB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUrB,MAAMmB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBrB,MACAsB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOtB,MAAMuB,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,YAAQpB,MAAMuB,MAAMC,KAAAA;EACtB;AAGA,MAAIhC,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAW4B,QAAQpC,IAAIqC,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM8B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKK,MAAMX,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAI0C,YAAYlC,IAAAA,GAAO;AAC9B,eAAW,CAACmC,GAAGC,OAAAA,KAAYpC,KAAKqC,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIP;QAAMY;;AAC9B,YAAMT,UAASL,UAAUe,QAAQH,MAAMX,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAI+C,QAAQvC,IAAAA,GAAO;AAC1B,eAAWiC,QAAQjC,KAAKwC,OAAO;AAC7B,YAAMd,UAASL,UAAUY,MAAMX,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAIiD,aAAazC,IAAAA,GAAO;AAC/B,UAAM0B,UAASL,UAAUrB,KAAK0C,MAAMpB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMiB,WAAW,CAAC3C,MAAesB,SAAAA;AACtC,MAAIA,KAAKtB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAW4B,QAAQpC,IAAIqC,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM4C,QAAQD,SAASf,KAAKK,MAAMX,IAAAA;AAClC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSpD,IAAI0C,YAAYlC,IAAAA,GAAO;AAC9B,eAAW,CAAC6C,GAAGT,OAAAA,KAAYpC,KAAKqC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMX,IAAAA;AACrC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSpD,IAAI+C,QAAQvC,IAAAA,GAAO;AAC1B,QAAI8C,SAAS9C,IAAAA,GAAO;AAClB,iBAAWiC,QAAQjC,KAAKwC,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMX,IAAAA;AAC7B,YAAIsB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSpD,IAAIiD,aAAazC,IAAAA,GAAO;AAC/B,WAAO2C,SAAS3C,KAAK0C,MAAMpB,IAAAA;EAC7B;AACF;AAKO,IAAMyB,eAAe,CAACC,QAAuBzB,SAAAA;AAClD,QAAM0B,UAAU,CAACjD,MAAeuB,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGmB,IAAAA,IAAQ3B;AACxB,UAAM4B,WAAWR,SAAS3C,MAAMR,IAAIU,aAAa;AACjDL,cAAUsD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQpC,IAAIqC,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKE,QAAQ;AACf,iBAAOH,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOK,KAAK9B,KAAK+B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B/D,IAAIgE;EAChC,CAAC,eAAA,GAA2BhE,IAAIiE;EAChC,CAAC,eAAA,GAA2BjE,IAAIkE;EAChC,CAAC,gBAAA,GAA4BlE,IAAImE;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC9D,SAAAA;AACC,QAAM+D,QAAQnE,KAAKJ,IAAIoE,cAAiBC,YAAAA,EAAc7D,IAAAA,GAAOL,OAAOqE,cAAc;AAClF,MAAIF,aAAaC,UAAUR,mBAAmBvD,KAAKiE,IAAI,GAAGC,YAAYL,YAAAA,GAAe;AACnF,WAAOlC;EACT;AAEA,SAAOoC;AACT;AAOK,IAAMI,iBAAiB,CAAInE,MAAe6D,cAAsBC,YAAY,SAAI;AACrF,QAAMM,oBAAoBR,cAAcC,cAAcC,SAAAA;AAEtD,QAAMO,oBAAoB,CAACrE,UAAAA;AACzB,UAAM+D,QAAQK,kBAAkBpE,KAAAA;AAChC,QAAI+D,UAAUpC,QAAW;AACvB,aAAOoC;IACT;AAEA,QAAIvE,IAAI+C,QAAQvC,KAAAA,GAAO;AACrB,UAAI8C,SAAS9C,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKwC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO6B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAM8C,WAAW,CAAC9C,SAAAA;AACvB,SAAOR,IAAI+C,QAAQvC,IAAAA,KAASA,KAAKwC,MAAMY,WAAW,KAAK5D,IAAI8E,mBAAmBtE,KAAKwC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAM+B,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOR,IAAI+C,QAAQvC,IAAAA,KAASA,KAAKwC,MAAMgC,MAAMhF,IAAIgB,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAI+C,QAAQvC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOoD;AAC9D;AAKO,IAAMqB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUL,IAAI+C,QAAQvC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI8C,SAAS9C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKwC,MAAMkC,OAAiB,CAACC,QAAQ1C,SAAAA;AAC1C,UAAM2C,QAAQpF,IAAIqC,sBAAsBI,IAAAA,EAErC4C,OAAO,CAACC,MAAMtF,IAAIgB,UAAUsE,EAAE7C,IAAI,CAAA,EAClC8C,IAAI,CAACD,MAAMA,EAAE/C,KAAKC,SAAQ,CAAA;AAG7B,WAAO2C,OAAOvB,WAAW,IAAIwB,QAAQD,OAAOE,OAAO,CAACjD,SAASgD,MAAMI,SAASpD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMqD,uBAAuB,CAACjF,MAAe+D,QAA6B,CAAC,MAAC;AACjFlE,YAAUL,IAAI+C,QAAQvC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUkE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMa,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAOxB,QAAQ;AAClB;EACF;AAGA,aAAWnB,QAAQjC,KAAKwC,OAAO;AAC7B,UAAM0C,QAAQ1F,IAAIqC,sBAAsBI,IAAAA,EACrC4C,OAAO,CAACjD,SAASgD,OAAOI,SAASpD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDwC,MAAM,CAAC5C,SAAAA;AACN/B,gBAAUL,IAAIgB,UAAUoB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKkD,YAAYpB,MAAMnC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIkD,OAAO;AACT,aAAOjD;IACT;EACF;AAKA,QAAMmD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACnD,SAAAA;AACJ,UAAM2D,WAAWvF,KAAKwC,MACnBuC,IAAI,CAAC9C,SAAAA;AACJ,YAAMkD,UAAU3F,IAAIqC,sBAAsBI,IAAAA,EAAMuD,KAAK,CAACV,MAAMA,EAAE/C,KAAKC,SAAQ,MAAOJ,IAAAA;AAClF/B,gBAAUL,IAAIgB,UAAU2E,QAAQlD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOkD,QAAQlD,KAAKkD;IACtB,CAAA,EACCN,OAAO/E,WAAAA;AAEV,WAAOyF,SAASnC,SAAS;MAACxB;MAAMlC,EAAE+F,QAAO,GAAIF,QAAAA;QAAa5D;EAC5D,CAAA,EACCkD,OAAO/E,WAAAA,CAAAA;AAGZ,QAAMkD,SAAStD,EAAEgG,OAAON,MAAAA;AACxB,SAAOpC,OAAOK;AAChB;AAOO,IAAMsC,SAAS,CAACtC,KAAcuC,MAAAA;AACnC,UAAQvC,IAAIY,MAAI;IACd,KAAK;AACH,aAAO,IAAIzE,IAAIqG,YACbxC,IAAIyC,mBAAmBf,IACrB,CAACnD,SACC,IAAIpC,IAAIuG,kBAAkBnE,KAAKG,MAAM6D,EAAEhE,KAAKK,IAAI,GAAGL,KAAKoE,YAAYpE,KAAKqE,YAAYrE,KAAKsC,WAAW,CAAA,GAEzGb,IAAI6C,eAAe;IAEvB,KAAK;AACH,aAAO1G,IAAI2G,MAAMC,KAAK/C,IAAIb,MAAMuC,IAAIa,CAAAA,GAAIvC,IAAIa,WAAW;IACzD,KAAK;AACH,aAAO,IAAI1E,IAAI6G,UACbhD,IAAIhB,SAAS0C,IAAI,CAACuB,MAAM,IAAI9G,IAAI+G,aAAaX,EAAEU,EAAErE,IAAI,GAAGqE,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACnFb,IAAIH,KAAK6B,IAAI,CAACuB,MAAM,IAAI9G,IAAIgH,KAAKZ,EAAEU,EAAErE,IAAI,GAAGqE,EAAEpC,WAAW,CAAA,GACzDb,IAAI4C,YACJ5C,IAAIa,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMuC,SAASb,EAAEvC,IAAIuC,EAAC,CAAA;AACtB,aAAO,IAAIpG,IAAIkH,QAAQ,MAAMD,QAAQpD,IAAIa,WAAW;IACtD;IACA;AAEE,aAAOb;EACX;AACF;;;AC1ZA,SAASsD,OAAAA,YAA6B;AACtC,SAASC,UAAAA,SAAQC,QAAAA,aAAY;AAE7B,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,KAAIC,cAAuCL,oBAAAA;AAEtC,IAAMM,qBACX,CAACC,UACD,CAA4BC,SAC1BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIhB,QAAQQ,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAIf,SAAS,MAAM;AACjBA,gBAAQQ,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAIf,SAAS,MAAM;AACjB,YAAIH,KAAIuB,gBAAgBJ,KAAKK,GAAG,GAAG;AACjCP,iBAAOC,GAAAA,IAAOO,SAAStB,KAAAA;QACzB,WAAWH,KAAI0B,iBAAiBP,KAAKK,GAAG,GAAG;AACzCP,iBAAOC,GAAAA,IAAOf,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLc,iBAAOC,GAAAA,IAAOf;QAChB;MACF;AAEA,aAAOc;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKf,KAAAA,MAAM;AAC1C,UAAIA,UAAU0B,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BjC,sBAAsB+B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOjC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOQ;EACT;AACF;",
+  "names": ["AST", "JSONSchema", "Schema", "S", "AST", "Schema", "S", "Option", "pipe", "invariant", "nonNullable", "getSimpleType", "node", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "NonEmptyString", "pattern", "JsonProp", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "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", "value", "getOrUndefined", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isUndefinedKeyword", "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", "OptionalType", "Type", "newAst", "Suspend", "AST", "Option", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "AST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "constructor", "_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"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":33857,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":21747},"packages/common/effect/dist/lib/browser/index.mjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":7227},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":9466}}}
+{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":38855,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":24310},"packages/common/effect/dist/lib/browser/index.mjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","mapAst","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":8099},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":10348}}}

package/dist/lib/node/index.cjs

@@ -38,6 +38,7 @@ __export(node_exports, {
   isLiteralUnion: () => isLiteralUnion,
   isOption: () => isOption,
   isSimpleType: () => isSimpleType,
+  mapAst: () => mapAst,
   visit: () => visit
 });
 module.exports = __toCommonJS(node_exports);
@@ -75,14 +76,13 @@ var PATH_REGEX = /[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*)*/;
 var PROP_REGEX = /\w+/;
 var JsonPath = import_schema2.Schema.NonEmptyString.pipe(import_schema2.Schema.pattern(PATH_REGEX));
 var JsonProp = import_schema2.Schema.NonEmptyString.pipe(import_schema2.Schema.pattern(PROP_REGEX));
-var getAnnotation = (annotationId) => (node) => (0, import_effect.pipe)(import_schema2.AST.getAnnotation(annotationId)(node), import_effect.Option.getOrUndefined);
 var VisitResult;
 (function(VisitResult2) {
   VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
   VisitResult2[VisitResult2["SKIP"] = 1] = "SKIP";
   VisitResult2[VisitResult2["EXIT"] = 2] = "EXIT";
 })(VisitResult || (VisitResult = {}));
-var defaultTest = (node) => isSimpleType(node) ? 0 : 1;
+var defaultTest = isSimpleType;
 var visit = (node, testOrVisitor, visitor) => {
   if (!visitor) {
     visitNode(node, defaultTest, testOrVisitor);
@@ -91,7 +91,8 @@ var visit = (node, testOrVisitor, visitor) => {
   }
 };
 var visitNode = (node, test, visitor, path = [], depth = 0) => {
-  const result = test?.(node, path, depth) ?? 0;
+  const _result = test?.(node, path, depth);
+  const result = _result === void 0 ? 0 : typeof _result === "boolean" ? _result ? 0 : 1 : _result;
   if (result === 2) {
     return result;
   }
@@ -170,7 +171,7 @@ var findProperty = (schema, path) => {
     const typeNode = findNode(node, import_schema2.AST.isTypeLiteral);
     (0, import_invariant.invariant)(typeNode, void 0, {
       F: __dxlog_file,
-      L: 221,
+      L: 223,
       S: void 0,
       A: [
         "typeNode",
@@ -195,14 +196,18 @@ var defaultAnnotations = {
   ["NumberKeyword"]: import_schema2.AST.numberKeyword,
   ["BooleanKeyword"]: import_schema2.AST.booleanKeyword
 };
-var findAnnotation = (node, annotationId, options) => {
-  const getAnnotationById = getAnnotation(annotationId);
+var getAnnotation = (annotationId, noDefault = true) => (node) => {
+  const value = (0, import_effect.pipe)(import_schema2.AST.getAnnotation(annotationId)(node), import_effect.Option.getOrUndefined);
+  if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {
+    return void 0;
+  }
+  return value;
+};
+var findAnnotation = (node, annotationId, noDefault = true) => {
+  const getAnnotationById = getAnnotation(annotationId, noDefault);
   const getBaseAnnotation = (node2) => {
     const value = getAnnotationById(node2);
     if (value !== void 0) {
-      if (options?.noDefault && value === defaultAnnotations[node2._tag]?.annotations[annotationId]) {
-        return void 0;
-      }
       return value;
     }
     if (import_schema2.AST.isUnion(node2)) {
@@ -225,7 +230,7 @@ var isDiscriminatedUnion = (node) => {
 var getDiscriminatingProps = (node) => {
   (0, import_invariant.invariant)(import_schema2.AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 307,
+    L: 318,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -243,7 +248,7 @@ var getDiscriminatingProps = (node) => {
 var getDiscriminatedType = (node, value = {}) => {
   (0, import_invariant.invariant)(import_schema2.AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 328,
+    L: 339,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -252,7 +257,7 @@ var getDiscriminatedType = (node, value = {}) => {
   });
   (0, import_invariant.invariant)(value, void 0, {
     F: __dxlog_file,
-    L: 329,
+    L: 340,
     S: void 0,
     A: [
       "value",
@@ -267,7 +272,7 @@ var getDiscriminatedType = (node, value = {}) => {
     const match = import_schema2.AST.getPropertySignatures(type).filter((prop) => props?.includes(prop.name.toString())).every((prop) => {
       (0, import_invariant.invariant)(import_schema2.AST.isLiteral(prop.type), void 0, {
         F: __dxlog_file,
-        L: 340,
+        L: 351,
         S: void 0,
         A: [
           "AST.isLiteral(prop.type)",
@@ -285,7 +290,7 @@ var getDiscriminatedType = (node, value = {}) => {
       const literal = import_schema2.AST.getPropertySignatures(type).find((p) => p.name.toString() === prop);
       (0, import_invariant.invariant)(import_schema2.AST.isLiteral(literal.type), void 0, {
         F: __dxlog_file,
-        L: 358,
+        L: 369,
         S: void 0,
         A: [
           "AST.isLiteral(literal.type)",
@@ -302,6 +307,22 @@ var getDiscriminatedType = (node, value = {}) => {
   const schema = import_schema2.Schema.Struct(fields);
   return schema.ast;
 };
+var mapAst = (ast, f) => {
+  switch (ast._tag) {
+    case "TypeLiteral":
+      return new import_schema2.AST.TypeLiteral(ast.propertySignatures.map((prop) => new import_schema2.AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations)), ast.indexSignatures);
+    case "Union":
+      return import_schema2.AST.Union.make(ast.types.map(f), ast.annotations);
+    case "TupleType":
+      return new import_schema2.AST.TupleType(ast.elements.map((t) => new import_schema2.AST.OptionalType(f(t.type), t.isOptional, t.annotations)), ast.rest.map((t) => new import_schema2.AST.Type(f(t.type), t.annotations)), ast.isReadonly, ast.annotations);
+    case "Suspend": {
+      const newAst = f(ast.f());
+      return new import_schema2.AST.Suspend(() => newAst, ast.annotations);
+    }
+    default:
+      return ast;
+  }
+};
 var ParamKeyAnnotationId = Symbol.for("@dxos/schema/annotation/ParamKey");
 var getParamKeyAnnotation = import_schema3.AST.getAnnotation(ParamKeyAnnotationId);
 var ParamKeyAnnotation = (value) => (self) => self.annotations({
@@ -374,6 +395,7 @@ var UrlParser = class {
   isLiteralUnion,
   isOption,
   isSimpleType,
+  mapAst,
   visit
 });
 //# sourceMappingURL=index.cjs.map

package/dist/lib/node/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/index.ts", "../../../src/ast.ts", "../../../src/url.ts"],
-  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\n\n/**\n * Get annotation or return undefined.\n */\nexport const getAnnotation =\n  <T>(annotationId: symbol) =>\n  (node: AST.Annotated): T | undefined =>\n    pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\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 Tester = (node: AST.AST, path: Path, depth: number) => VisitResult | undefined;\nexport type Visitor = (node: AST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: Tester = (node) => (isSimpleType(node) ? VisitResult.CONTINUE : VisitResult.SKIP);\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: AST.AST, visitor: Visitor): void;\n  (node: AST.AST, test: Tester, visitor: Visitor): void;\n} = (node: AST.AST, testOrVisitor: Tester | Visitor, visitor?: Visitor): void => {\n  if (!visitor) {\n    visitNode(node, defaultTest, testOrVisitor);\n  } else {\n    visitNode(node, testOrVisitor as Tester, visitor);\n  }\n};\n\nconst visitNode = (\n  node: AST.AST,\n  test: Tester | undefined,\n  visitor: Visitor,\n  path: Path = [],\n  depth = 0,\n): VisitResult | undefined => {\n  const result = test?.(node, path, depth) ?? VisitResult.CONTINUE;\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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.booleanKeyword,\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 */\nexport const findAnnotation = <T>(\n  node: AST.AST,\n  annotationId: symbol,\n  options?: { noDefault: boolean },\n): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      if (options?.noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\n        return undefined;\n      }\n\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.Struct(fields);\n  return schema.ast;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,oBAA6C;ACA7C,IAAAA,iBAAiC;AACjC,oBAA6B;AAE7B,uBAA0B;AAC1B,kBAA4B;ACJ5B,IAAAA,iBAAsC;AACtC,IAAAC,iBAA6B;AAE7B,IAAAC,eAA2B;;ADepB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIC,mBAAIC,gBAAgBF,IAAAA,KAASC,mBAAIE,cAAcH,IAAAA,KAASI,qBAAqBJ,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIC,mBAAII,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIK,gBAAgBN,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIM,iBAAiBP,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIC,mBAAIO,QAAQR,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIC,mBAAIQ,UAAUT,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMU,eAAe,CAACV,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMW,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWC,eAAAA,OAAEC,eAAeC,KAAKF,eAAAA,OAAEG,QAAQN,UAAAA,CAAAA;AACjD,IAAMO,WAAWJ,eAAAA,OAAEC,eAAeC,KAAKF,eAAAA,OAAEG,QAAQL,UAAAA,CAAAA;AAKjD,IAAMO,gBACX,CAAIC,iBACJ,CAACpB,aACCgB,oBAAKf,mBAAIkB,cAAiBC,YAAAA,EAAcpB,IAAAA,GAAOqB,qBAAOC,cAAc;;UAE5DC,cAAAA;;AAITA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIAA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAiBZ,IAAMC,cAAsB,CAACxB,SAAUU,aAAaV,IAAAA,IAAAA,IAAAA;AAQ7C,IAAMyB,QAGT,CAACzB,MAAe0B,eAAiCC,YAAAA;AACnD,MAAI,CAACA,SAAS;AACZC,cAAU5B,MAAMwB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAU5B,MAAM0B,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChB5B,MACA6B,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,SAASH,OAAO7B,MAAM8B,MAAMC,KAAAA,KAAAA;AAClC,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BL,YAAQ3B,MAAM8B,MAAMC,KAAAA;EACtB;AAGA,MAAI9B,mBAAIE,cAAcH,IAAAA,GAAO;AAC3B,eAAWiC,QAAQhC,mBAAIiC,sBAAsBlC,IAAAA,GAAO;AAClD,YAAMmC,cAAc;WAAIL;QAAMG,KAAKG,KAAKC,SAAQ;;AAChD,YAAML,UAASJ,UAAUK,KAAKK,MAAMT,MAAMF,SAASQ,aAAaJ,QAAQ,CAAA;AACxE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,mBAAIsC,YAAYvC,IAAAA,GAAO;AAC9B,eAAW,CAACwC,GAAGC,OAAAA,KAAYzC,KAAK0C,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIL;QAAMU;;AAC9B,YAAMR,UAASJ,UAAUa,QAAQH,MAAMT,MAAMF,SAASQ,aAAaJ,KAAAA;AACnE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,mBAAI2C,QAAQ5C,IAAAA,GAAO;AAC1B,eAAWsC,QAAQtC,KAAK6C,OAAO;AAC7B,YAAMb,UAASJ,UAAUU,MAAMT,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS/B,mBAAI6C,aAAa9C,IAAAA,GAAO;AAC/B,UAAMgC,UAASJ,UAAU5B,KAAK+C,MAAMlB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIC,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAAChD,MAAe6B,SAAAA;AACtC,MAAIA,KAAK7B,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSC,mBAAIE,cAAcH,IAAAA,GAAO;AAChC,eAAWiC,QAAQhC,mBAAIiC,sBAAsBlC,IAAAA,GAAO;AAClD,YAAMiD,QAAQD,SAASf,KAAKK,MAAMT,IAAAA;AAClC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGShD,mBAAIsC,YAAYvC,IAAAA,GAAO;AAC9B,eAAW,CAACkD,GAAGT,OAAAA,KAAYzC,KAAK0C,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMT,IAAAA;AACrC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGShD,mBAAI2C,QAAQ5C,IAAAA,GAAO;AAC1B,QAAImD,SAASnD,IAAAA,GAAO;AAClB,iBAAWsC,QAAQtC,KAAK6C,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMT,IAAAA;AAC7B,YAAIoB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGShD,mBAAI6C,aAAa9C,IAAAA,GAAO;AAC/B,WAAOgD,SAAShD,KAAK+C,MAAMlB,IAAAA;EAC7B;AACF;AAKO,IAAMuB,eAAe,CAACC,QAAuBvB,SAAAA;AAClD,QAAMwB,UAAU,CAACtD,MAAe8B,UAAAA;AAC9B,UAAM,CAACM,MAAM,GAAGmB,IAAAA,IAAQzB;AACxB,UAAM0B,WAAWR,SAAShD,MAAMC,mBAAIE,aAAa;AACjDsD,oCAAUD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQhC,mBAAIiC,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKG,QAAQ;AACf,iBAAOJ,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOM,KAAK7B,KAAK8B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B5D,mBAAI6D;EAChC,CAAC,eAAA,GAA2B7D,mBAAI8D;EAChC,CAAC,eAAA,GAA2B9D,mBAAI+D;EAChC,CAAC,gBAAA,GAA4B/D,mBAAIgE;AACnC;AAMO,IAAMC,iBAAiB,CAC5BlE,MACAoB,cACA+C,YAAAA;AAEA,QAAMC,oBAAoBjD,cAAcC,YAAAA;AAExC,QAAMiD,oBAAoB,CAACrE,UAAAA;AACzB,UAAMsE,QAAQF,kBAAkBpE,KAAAA;AAChC,QAAIsE,UAAUC,QAAW;AACvB,UAAIJ,SAASK,aAAaF,UAAUT,mBAAmB7D,MAAKyE,IAAI,GAAGC,YAAYtD,YAAAA,GAAe;AAC5F,eAAOmD;MACT;AAEA,aAAOD;IACT;AAEA,QAAIrE,mBAAI2C,QAAQ5C,KAAAA,GAAO;AACrB,UAAImD,SAASnD,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAK6C,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOwB,kBAAkBrE,IAAAA;AAC3B;AASO,IAAMmD,WAAW,CAACnD,SAAAA;AACvB,SAAOC,mBAAI2C,QAAQ5C,IAAAA,KAASA,KAAK6C,MAAMa,WAAW,KAAKzD,mBAAI0E,mBAAmB3E,KAAK6C,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAM+B,iBAAiB,CAAC5E,SAAAA;AAC7B,SAAOC,mBAAI2C,QAAQ5C,IAAAA,KAASA,KAAK6C,MAAMgC,MAAM5E,mBAAIQ,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACJ,SAAAA;AACnC,SAAOC,mBAAI2C,QAAQ5C,IAAAA,KAAS,CAAC,CAAC8E,uBAAuB9E,IAAAA,GAAO0D;AAC9D;AAKO,IAAMoB,yBAAyB,CAAC9E,SAAAA;AACrCyD,kCAAUxD,mBAAI2C,QAAQ5C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAImD,SAASnD,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAK6C,MAAMkC,OAAiB,CAACC,QAAQ1C,SAAAA;AAC1C,UAAM2C,QAAQhF,mBAAIiC,sBAAsBI,IAAAA,EAErC4C,OAAO,CAACC,MAAMlF,mBAAIQ,UAAU0E,EAAE7C,IAAI,CAAA,EAClC8C,IAAI,CAACD,MAAMA,EAAE/C,KAAKC,SAAQ,CAAA;AAG7B,WAAO2C,OAAOtB,WAAW,IAAIuB,QAAQD,OAAOE,OAAO,CAACjD,SAASgD,MAAMI,SAASpD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMqD,uBAAuB,CAACtF,MAAesE,QAA6B,CAAC,MAAC;AACjFb,kCAAUxD,mBAAI2C,QAAQ5C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtByD,kCAAUa,OAAAA,QAAAA;;;;;;;;;AACV,QAAMW,QAAQH,uBAAuB9E,IAAAA;AACrC,MAAI,CAACiF,OAAOvB,QAAQ;AAClB;EACF;AAGA,aAAWpB,QAAQtC,KAAK6C,OAAO;AAC7B,UAAM0C,QAAQtF,mBAAIiC,sBAAsBI,IAAAA,EACrC4C,OAAO,CAACjD,SAASgD,OAAOI,SAASpD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDwC,MAAM,CAAC5C,SAAAA;AACNwB,sCAAUxD,mBAAIQ,UAAUwB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKkD,YAAYlB,MAAMrC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIkD,OAAO;AACT,aAAOjD;IACT;EACF;AAKA,QAAMmD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACnD,SAAAA;AACJ,UAAM2D,WAAW5F,KAAK6C,MACnBuC,IAAI,CAAC9C,SAAAA;AACJ,YAAMkD,UAAUvF,mBAAIiC,sBAAsBI,IAAAA,EAAMuD,KAAK,CAACV,MAAMA,EAAE/C,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFwB,sCAAUxD,mBAAIQ,UAAU+E,QAAQlD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOkD,QAAQlD,KAAKkD;IACtB,CAAA,EACCN,OAAOY,uBAAAA;AAEV,WAAOF,SAASlC,SAAS;MAACzB;MAAMnB,eAAAA,OAAEiF,QAAO,GAAIH,QAAAA;QAAarB;EAC5D,CAAA,EACCW,OAAOY,uBAAAA,CAAAA;AAGZ,QAAMzC,SAASvC,eAAAA,OAAEkF,OAAOP,MAAAA;AACxB,SAAOpC,OAAOM;AAChB;ACxWA,IAAMsC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXnG,eAAAA,IAAIkB,cAAuC8E,oBAAAA;AAEtC,IAAMI,qBACX,CAAC/B,UACD,CAA4BgC,SAC1BA,KAAK5B,YAAY;EAAE,CAACuB,oBAAAA,GAAuB3B;AAAM,CAAA;AAM9C,IAAMiC,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOjB,OAAO/C,QAAQ,KAAK8D,QAAQhB,MAAM,EAAEV,OAA4B,CAAC+B,QAAQ,CAACC,KAAKzE,IAAAA,MAAK;AACzF,UAAIgC,QAAQsC,IAAII,aAAaC,QAAIC,yBAAWH,GAAAA,CAAAA;AAC5C,UAAIzC,SAAS,MAAM;AACjBA,gBAAQsC,IAAII,aAAaC,IAAIF,GAAAA;MAC/B;AAEA,UAAIzC,SAAS,MAAM;AACjB,YAAIrE,eAAAA,IAAIK,gBAAgBgC,KAAKqB,GAAG,GAAG;AACjCmD,iBAAOC,GAAAA,IAAOI,SAAS7C,KAAAA;QACzB,WAAWrE,eAAAA,IAAIM,iBAAiB+B,KAAKqB,GAAG,GAAG;AACzCmD,iBAAOC,GAAAA,IAAOzC,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLwC,iBAAOC,GAAAA,IAAOzC;QAChB;MACF;AAEA,aAAOwC;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAM,OAAOT,MAAcG,QAAgB;AACnC,UAAMF,MAAM,IAAIC,IAAIF,IAAAA;AACpBjB,WAAO/C,QAAQmE,MAAAA,EAAQO,QAAQ,CAAC,CAACN,KAAKzC,KAAAA,MAAM;AAC1C,UAAIA,UAAUC,QAAW;AACvB,cAAM+C,QAAQ,KAAKb,QAAQhB,OAAOsB,GAAAA;AAClC,YAAIO,OAAO;AACT,gBAAM,EAAEP,KAAKQ,cAAa,QAAKvG,eAAAA,MAC7BoF,sBAAsBkB,MAAM3D,GAAG,GAC/BtC,eAAAA,OAAOmG,UAAU,OAAO;YACtBT,SAAKG,yBAAWH,GAAAA;UAClB,EAAA,CAAA;AAGFH,cAAII,aAAaS,IAAIF,eAAeG,OAAOpD,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOsC;EACT;AACF;",
-  "names": ["import_schema", "import_effect", "import_util", "getSimpleType", "node", "AST", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "S", "NonEmptyString", "pipe", "pattern", "JsonProp", "getAnnotation", "annotationId", "Option", "getOrUndefined", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "result", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "invariant", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "findAnnotation", "options", "getAnnotationById", "getBaseAnnotation", "value", "undefined", "noDefault", "_tag", "annotations", "isUndefinedKeyword", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "nonNullable", "Literal", "Struct", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "ParamKeyAnnotation", "self", "UrlParser", "constructor", "_schema", "parse", "_url", "url", "URL", "params", "key", "searchParams", "get", "decamelize", "parseInt", "create", "forEach", "field", "serializedKey", "getOrElse", "set", "String"]
+  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\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: AST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: AST.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: AST.AST, visitor: VisitorFn): void;\n  (node: AST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: AST.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: AST.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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.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: AST.AST): T | undefined => {\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\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: AST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.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 AST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (ast: AST.AST, f: (ast: AST.AST) => AST.AST): AST.AST => {\n  switch (ast._tag) {\n    case 'TypeLiteral':\n      return new AST.TypeLiteral(\n        ast.propertySignatures.map(\n          (prop) =>\n            new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations),\n        ),\n        ast.indexSignatures,\n      );\n    case 'Union':\n      return AST.Union.make(ast.types.map(f), ast.annotations);\n    case 'TupleType':\n      return new AST.TupleType(\n        ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    case 'Suspend': {\n      const newAst = f(ast.f());\n      return new AST.Suspend(() => newAst, ast.annotations);\n    }\n    default:\n      // TODO(dmaretskyi): Support more nodes.\n      return ast;\n  }\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,oBAA6C;ACA7C,IAAAA,iBAAiC;AACjC,oBAA6B;AAE7B,uBAA0B;AAC1B,kBAA4B;ACJ5B,IAAAA,iBAAsC;AACtC,IAAAC,iBAA6B;AAE7B,IAAAC,eAA2B;;ADepB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIC,mBAAIC,gBAAgBF,IAAAA,KAASC,mBAAIE,cAAcH,IAAAA,KAASI,qBAAqBJ,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIC,mBAAII,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIK,gBAAgBN,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIM,iBAAiBP,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIC,mBAAIO,QAAQR,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIC,mBAAIQ,UAAUT,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMU,eAAe,CAACV,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMW,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWC,eAAAA,OAAEC,eAAeC,KAAKF,eAAAA,OAAEG,QAAQN,UAAAA,CAAAA;AACjD,IAAMO,WAAWJ,eAAAA,OAAEC,eAAeC,KAAKF,eAAAA,OAAEG,QAAQL,UAAAA,CAAAA;;UAE5CO,cAAAA;;AAITA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIAA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAkBZ,IAAMC,cAAsBV;AAQrB,IAAMW,QAGT,CAACrB,MAAesB,eAAmCC,YAAAA;AACrD,MAAI,CAACA,SAAS;AACZC,cAAUxB,MAAMoB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUxB,MAAMsB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBxB,MACAyB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOzB,MAAM0B,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,YAAQvB,MAAM0B,MAAMC,KAAAA;EACtB;AAGA,MAAI1B,mBAAIE,cAAcH,IAAAA,GAAO;AAC3B,eAAW+B,QAAQ9B,mBAAI+B,sBAAsBhC,IAAAA,GAAO;AAClD,YAAMiC,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKK,MAAMX,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS5B,mBAAIoC,YAAYrC,IAAAA,GAAO;AAC9B,eAAW,CAACsC,GAAGC,OAAAA,KAAYvC,KAAKwC,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIP;QAAMY;;AAC9B,YAAMT,UAASL,UAAUe,QAAQH,MAAMX,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS5B,mBAAIyC,QAAQ1C,IAAAA,GAAO;AAC1B,eAAWoC,QAAQpC,KAAK2C,OAAO;AAC7B,YAAMd,UAASL,UAAUY,MAAMX,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGS5B,mBAAI2C,aAAa5C,IAAAA,GAAO;AAC/B,UAAM6B,UAASL,UAAUxB,KAAK6C,MAAMpB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMiB,WAAW,CAAC9C,MAAeyB,SAAAA;AACtC,MAAIA,KAAKzB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSC,mBAAIE,cAAcH,IAAAA,GAAO;AAChC,eAAW+B,QAAQ9B,mBAAI+B,sBAAsBhC,IAAAA,GAAO;AAClD,YAAM+C,QAAQD,SAASf,KAAKK,MAAMX,IAAAA;AAClC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS9C,mBAAIoC,YAAYrC,IAAAA,GAAO;AAC9B,eAAW,CAACgD,GAAGT,OAAAA,KAAYvC,KAAKwC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMX,IAAAA;AACrC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS9C,mBAAIyC,QAAQ1C,IAAAA,GAAO;AAC1B,QAAIiD,SAASjD,IAAAA,GAAO;AAClB,iBAAWoC,QAAQpC,KAAK2C,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMX,IAAAA;AAC7B,YAAIsB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGS9C,mBAAI2C,aAAa5C,IAAAA,GAAO;AAC/B,WAAO8C,SAAS9C,KAAK6C,MAAMpB,IAAAA;EAC7B;AACF;AAKO,IAAMyB,eAAe,CAACC,QAAuBzB,SAAAA;AAClD,QAAM0B,UAAU,CAACpD,MAAe0B,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGmB,IAAAA,IAAQ3B;AACxB,UAAM4B,WAAWR,SAAS9C,MAAMC,mBAAIE,aAAa;AACjDoD,oCAAUD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQ9B,mBAAI+B,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKG,QAAQ;AACf,iBAAOJ,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOM,KAAK/B,KAAKgC,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B1D,mBAAI2D;EAChC,CAAC,eAAA,GAA2B3D,mBAAI4D;EAChC,CAAC,eAAA,GAA2B5D,mBAAI6D;EAChC,CAAC,gBAAA,GAA4B7D,mBAAI8D;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAClE,SAAAA;AACC,QAAMmE,YAAQnD,oBAAKf,mBAAI+D,cAAiBC,YAAAA,EAAcjE,IAAAA,GAAOoE,qBAAOC,cAAc;AAClF,MAAIH,aAAaC,UAAUR,mBAAmB3D,KAAKsE,IAAI,GAAGC,YAAYN,YAAAA,GAAe;AACnF,WAAOnC;EACT;AAEA,SAAOqC;AACT;AAOK,IAAMK,iBAAiB,CAAIxE,MAAeiE,cAAsBC,YAAY,SAAI;AACrF,QAAMO,oBAAoBT,cAAcC,cAAcC,SAAAA;AAEtD,QAAMQ,oBAAoB,CAAC1E,UAAAA;AACzB,UAAMmE,QAAQM,kBAAkBzE,KAAAA;AAChC,QAAImE,UAAUrC,QAAW;AACvB,aAAOqC;IACT;AAEA,QAAIlE,mBAAIyC,QAAQ1C,KAAAA,GAAO;AACrB,UAAIiD,SAASjD,KAAAA,GAAO;AAClB,eAAOyE,kBAAkBzE,MAAK2C,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO+B,kBAAkB1E,IAAAA;AAC3B;AASO,IAAMiD,WAAW,CAACjD,SAAAA;AACvB,SAAOC,mBAAIyC,QAAQ1C,IAAAA,KAASA,KAAK2C,MAAMa,WAAW,KAAKvD,mBAAI0E,mBAAmB3E,KAAK2C,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAMiC,iBAAiB,CAAC5E,SAAAA;AAC7B,SAAOC,mBAAIyC,QAAQ1C,IAAAA,KAASA,KAAK2C,MAAMkC,MAAM5E,mBAAIQ,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACJ,SAAAA;AACnC,SAAOC,mBAAIyC,QAAQ1C,IAAAA,KAAS,CAAC,CAAC8E,uBAAuB9E,IAAAA,GAAOwD;AAC9D;AAKO,IAAMsB,yBAAyB,CAAC9E,SAAAA;AACrCuD,kCAAUtD,mBAAIyC,QAAQ1C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAIiD,SAASjD,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAK2C,MAAMoC,OAAiB,CAACC,QAAQ5C,SAAAA;AAC1C,UAAM6C,QAAQhF,mBAAI+B,sBAAsBI,IAAAA,EAErC8C,OAAO,CAACC,MAAMlF,mBAAIQ,UAAU0E,EAAE/C,IAAI,CAAA,EAClCgD,IAAI,CAACD,MAAMA,EAAEjD,KAAKC,SAAQ,CAAA;AAG7B,WAAO6C,OAAOxB,WAAW,IAAIyB,QAAQD,OAAOE,OAAO,CAACnD,SAASkD,MAAMI,SAAStD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMuD,uBAAuB,CAACtF,MAAemE,QAA6B,CAAC,MAAC;AACjFZ,kCAAUtD,mBAAIyC,QAAQ1C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBuD,kCAAUY,OAAAA,QAAAA;;;;;;;;;AACV,QAAMc,QAAQH,uBAAuB9E,IAAAA;AACrC,MAAI,CAACiF,OAAOzB,QAAQ;AAClB;EACF;AAGA,aAAWpB,QAAQpC,KAAK2C,OAAO;AAC7B,UAAM4C,QAAQtF,mBAAI+B,sBAAsBI,IAAAA,EACrC8C,OAAO,CAACnD,SAASkD,OAAOI,SAAStD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnD0C,MAAM,CAAC9C,SAAAA;AACNwB,sCAAUtD,mBAAIQ,UAAUsB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKoD,YAAYrB,MAAMpC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIoD,OAAO;AACT,aAAOnD;IACT;EACF;AAKA,QAAMqD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACrD,SAAAA;AACJ,UAAM6D,WAAW5F,KAAK2C,MACnByC,IAAI,CAAChD,SAAAA;AACJ,YAAMoD,UAAUvF,mBAAI+B,sBAAsBI,IAAAA,EAAMyD,KAAK,CAACV,MAAMA,EAAEjD,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFwB,sCAAUtD,mBAAIQ,UAAU+E,QAAQpD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOoD,QAAQpD,KAAKoD;IACtB,CAAA,EACCN,OAAOY,uBAAAA;AAEV,WAAOF,SAASpC,SAAS;MAACzB;MAAMjB,eAAAA,OAAEiF,QAAO,GAAIH,QAAAA;QAAa9D;EAC5D,CAAA,EACCoD,OAAOY,uBAAAA,CAAAA;AAGZ,QAAM3C,SAASrC,eAAAA,OAAEkF,OAAOP,MAAAA;AACxB,SAAOtC,OAAOM;AAChB;AAOO,IAAMwC,SAAS,CAACxC,KAAcyC,MAAAA;AACnC,UAAQzC,IAAIa,MAAI;IACd,KAAK;AACH,aAAO,IAAIrE,mBAAIkG,YACb1C,IAAI2C,mBAAmBhB,IACrB,CAACrD,SACC,IAAI9B,mBAAIoG,kBAAkBtE,KAAKG,MAAMgE,EAAEnE,KAAKK,IAAI,GAAGL,KAAKuE,YAAYvE,KAAKwE,YAAYxE,KAAKwC,WAAW,CAAA,GAEzGd,IAAI+C,eAAe;IAEvB,KAAK;AACH,aAAOvG,mBAAIwG,MAAMC,KAAKjD,IAAId,MAAMyC,IAAIc,CAAAA,GAAIzC,IAAIc,WAAW;IACzD,KAAK;AACH,aAAO,IAAItE,mBAAI0G,UACblD,IAAIjB,SAAS4C,IAAI,CAACwB,MAAM,IAAI3G,mBAAI4G,aAAaX,EAAEU,EAAExE,IAAI,GAAGwE,EAAEN,YAAYM,EAAErC,WAAW,CAAA,GACnFd,IAAIJ,KAAK+B,IAAI,CAACwB,MAAM,IAAI3G,mBAAI6G,KAAKZ,EAAEU,EAAExE,IAAI,GAAGwE,EAAErC,WAAW,CAAA,GACzDd,IAAI8C,YACJ9C,IAAIc,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMwC,SAASb,EAAEzC,IAAIyC,EAAC,CAAA;AACtB,aAAO,IAAIjG,mBAAI+G,QAAQ,MAAMD,QAAQtD,IAAIc,WAAW;IACtD;IACA;AAEE,aAAOd;EACX;AACF;ACrZA,IAAMwD,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXnH,eAAAA,IAAI+D,cAAuCiD,oBAAAA;AAEtC,IAAMI,qBACX,CAAClD,UACD,CAA4BmD,SAC1BA,KAAK/C,YAAY;EAAE,CAAC0C,oBAAAA,GAAuB9C;AAAM,CAAA;AAM9C,IAAMoD,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOjC,OAAOjD,QAAQ,KAAKgF,QAAQhC,MAAM,EAAEV,OAA4B,CAAC+C,QAAQ,CAACC,KAAK3F,IAAAA,MAAK;AACzF,UAAI+B,QAAQyD,IAAII,aAAaC,QAAIC,yBAAWH,GAAAA,CAAAA;AAC5C,UAAI5D,SAAS,MAAM;AACjBA,gBAAQyD,IAAII,aAAaC,IAAIF,GAAAA;MAC/B;AAEA,UAAI5D,SAAS,MAAM;AACjB,YAAIlE,eAAAA,IAAIK,gBAAgB8B,KAAKqB,GAAG,GAAG;AACjCqE,iBAAOC,GAAAA,IAAOI,SAAShE,KAAAA;QACzB,WAAWlE,eAAAA,IAAIM,iBAAiB6B,KAAKqB,GAAG,GAAG;AACzCqE,iBAAOC,GAAAA,IAAO5D,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACL2D,iBAAOC,GAAAA,IAAO5D;QAChB;MACF;AAEA,aAAO2D;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAM,OAAOT,MAAcG,QAAgB;AACnC,UAAMF,MAAM,IAAIC,IAAIF,IAAAA;AACpBjC,WAAOjD,QAAQqF,MAAAA,EAAQO,QAAQ,CAAC,CAACN,KAAK5D,KAAAA,MAAM;AAC1C,UAAIA,UAAUrC,QAAW;AACvB,cAAMwG,QAAQ,KAAKb,QAAQhC,OAAOsC,GAAAA;AAClC,YAAIO,OAAO;AACT,gBAAM,EAAEP,KAAKQ,cAAa,QAAKvH,eAAAA,MAC7BoG,sBAAsBkB,MAAM7E,GAAG,GAC/BW,eAAAA,OAAOoE,UAAU,OAAO;YACtBT,SAAKG,yBAAWH,GAAAA;UAClB,EAAA,CAAA;AAGFH,cAAII,aAAaS,IAAIF,eAAeG,OAAOvE,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOyD;EACT;AACF;",
+  "names": ["import_schema", "import_effect", "import_util", "getSimpleType", "node", "AST", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "S", "NonEmptyString", "pipe", "pattern", "JsonProp", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "invariant", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "value", "Option", "getOrUndefined", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isUndefinedKeyword", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "nonNullable", "Literal", "Struct", "mapAst", "f", "TypeLiteral", "propertySignatures", "PropertySignature", "isOptional", "isReadonly", "indexSignatures", "Union", "make", "TupleType", "t", "OptionalType", "Type", "newAst", "Suspend", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "ParamKeyAnnotation", "self", "UrlParser", "constructor", "_schema", "parse", "_url", "url", "URL", "params", "key", "searchParams", "get", "decamelize", "parseInt", "create", "forEach", "field", "serializedKey", "getOrElse", "set", "String"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":33857,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":21745},"packages/common/effect/dist/lib/node/index.cjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":7227},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":9432}}}
+{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":38855,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":24308},"packages/common/effect/dist/lib/node/index.cjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","mapAst","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":8099},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":10314}}}

package/dist/lib/node-esm/index.mjs

@@ -34,14 +34,13 @@ var PATH_REGEX = /[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*)*/;
 var PROP_REGEX = /\w+/;
 var JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX));
 var JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX));
-var getAnnotation = (annotationId) => (node) => pipe(AST.getAnnotation(annotationId)(node), Option.getOrUndefined);
 var VisitResult;
 (function(VisitResult2) {
   VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
   VisitResult2[VisitResult2["SKIP"] = 1] = "SKIP";
   VisitResult2[VisitResult2["EXIT"] = 2] = "EXIT";
 })(VisitResult || (VisitResult = {}));
-var defaultTest = (node) => isSimpleType(node) ? 0 : 1;
+var defaultTest = isSimpleType;
 var visit = (node, testOrVisitor, visitor) => {
   if (!visitor) {
     visitNode(node, defaultTest, testOrVisitor);
@@ -50,7 +49,8 @@ var visit = (node, testOrVisitor, visitor) => {
   }
 };
 var visitNode = (node, test, visitor, path = [], depth = 0) => {
-  const result = test?.(node, path, depth) ?? 0;
+  const _result = test?.(node, path, depth);
+  const result = _result === void 0 ? 0 : typeof _result === "boolean" ? _result ? 0 : 1 : _result;
   if (result === 2) {
     return result;
   }
@@ -129,7 +129,7 @@ var findProperty = (schema, path) => {
     const typeNode = findNode(node, AST.isTypeLiteral);
     invariant(typeNode, void 0, {
       F: __dxlog_file,
-      L: 221,
+      L: 223,
       S: void 0,
       A: [
         "typeNode",
@@ -154,14 +154,18 @@ var defaultAnnotations = {
   ["NumberKeyword"]: AST.numberKeyword,
   ["BooleanKeyword"]: AST.booleanKeyword
 };
-var findAnnotation = (node, annotationId, options) => {
-  const getAnnotationById = getAnnotation(annotationId);
+var getAnnotation = (annotationId, noDefault = true) => (node) => {
+  const value = pipe(AST.getAnnotation(annotationId)(node), Option.getOrUndefined);
+  if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {
+    return void 0;
+  }
+  return value;
+};
+var findAnnotation = (node, annotationId, noDefault = true) => {
+  const getAnnotationById = getAnnotation(annotationId, noDefault);
   const getBaseAnnotation = (node2) => {
     const value = getAnnotationById(node2);
     if (value !== void 0) {
-      if (options?.noDefault && value === defaultAnnotations[node2._tag]?.annotations[annotationId]) {
-        return void 0;
-      }
       return value;
     }
     if (AST.isUnion(node2)) {
@@ -184,7 +188,7 @@ var isDiscriminatedUnion = (node) => {
 var getDiscriminatingProps = (node) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 307,
+    L: 318,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -202,7 +206,7 @@ var getDiscriminatingProps = (node) => {
 var getDiscriminatedType = (node, value = {}) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 328,
+    L: 339,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -211,7 +215,7 @@ var getDiscriminatedType = (node, value = {}) => {
   });
   invariant(value, void 0, {
     F: __dxlog_file,
-    L: 329,
+    L: 340,
     S: void 0,
     A: [
       "value",
@@ -226,7 +230,7 @@ var getDiscriminatedType = (node, value = {}) => {
     const match = AST.getPropertySignatures(type).filter((prop) => props?.includes(prop.name.toString())).every((prop) => {
       invariant(AST.isLiteral(prop.type), void 0, {
         F: __dxlog_file,
-        L: 340,
+        L: 351,
         S: void 0,
         A: [
           "AST.isLiteral(prop.type)",
@@ -244,7 +248,7 @@ var getDiscriminatedType = (node, value = {}) => {
       const literal = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop);
       invariant(AST.isLiteral(literal.type), void 0, {
         F: __dxlog_file,
-        L: 358,
+        L: 369,
         S: void 0,
         A: [
           "AST.isLiteral(literal.type)",
@@ -261,6 +265,22 @@ var getDiscriminatedType = (node, value = {}) => {
   const schema = S.Struct(fields);
   return schema.ast;
 };
+var mapAst = (ast, f) => {
+  switch (ast._tag) {
+    case "TypeLiteral":
+      return new AST.TypeLiteral(ast.propertySignatures.map((prop) => new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations)), ast.indexSignatures);
+    case "Union":
+      return AST.Union.make(ast.types.map(f), ast.annotations);
+    case "TupleType":
+      return new AST.TupleType(ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)), ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)), ast.isReadonly, ast.annotations);
+    case "Suspend": {
+      const newAst = f(ast.f());
+      return new AST.Suspend(() => newAst, ast.annotations);
+    }
+    default:
+      return ast;
+  }
+};
 
 // packages/common/effect/src/url.ts
 import { AST as AST2 } from "@effect/schema";
@@ -337,6 +357,7 @@ export {
   isLiteralUnion,
   isOption,
   isSimpleType,
+  mapAst,
   visit
 };
 //# sourceMappingURL=index.mjs.map

package/dist/lib/node-esm/index.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/index.ts", "../../../src/ast.ts", "../../../src/url.ts"],
-  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\n\n/**\n * Get annotation or return undefined.\n */\nexport const getAnnotation =\n  <T>(annotationId: symbol) =>\n  (node: AST.Annotated): T | undefined =>\n    pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\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 Tester = (node: AST.AST, path: Path, depth: number) => VisitResult | undefined;\nexport type Visitor = (node: AST.AST, path: Path, depth: number) => void;\n\nconst defaultTest: Tester = (node) => (isSimpleType(node) ? VisitResult.CONTINUE : VisitResult.SKIP);\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: AST.AST, visitor: Visitor): void;\n  (node: AST.AST, test: Tester, visitor: Visitor): void;\n} = (node: AST.AST, testOrVisitor: Tester | Visitor, visitor?: Visitor): void => {\n  if (!visitor) {\n    visitNode(node, defaultTest, testOrVisitor);\n  } else {\n    visitNode(node, testOrVisitor as Tester, visitor);\n  }\n};\n\nconst visitNode = (\n  node: AST.AST,\n  test: Tester | undefined,\n  visitor: Visitor,\n  path: Path = [],\n  depth = 0,\n): VisitResult | undefined => {\n  const result = test?.(node, path, depth) ?? VisitResult.CONTINUE;\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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.booleanKeyword,\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 */\nexport const findAnnotation = <T>(\n  node: AST.AST,\n  annotationId: symbol,\n  options?: { noDefault: boolean },\n): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      if (options?.noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\n        return undefined;\n      }\n\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.Struct(fields);\n  return schema.ast;\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
-  "mappings": ";;;AAIA,SAASA,OAAAA,MAAKC,YAAYC,UAAUC,UAAS;;;ACA7C,SAASC,KAAKC,UAAUC,SAAS;AACjC,SAASC,QAAQC,YAAY;AAE7B,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;AAcrB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIR,IAAIS,gBAAgBD,IAAAA,KAASR,IAAIU,cAAcF,IAAAA,KAASG,qBAAqBH,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIR,IAAIY,gBAAgBJ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIa,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIc,iBAAiBN,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIR,IAAIe,QAAQP,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIR,IAAIgB,UAAUR,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMS,eAAe,CAACT,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMU,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWlB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQJ,UAAAA,CAAAA;AACjD,IAAMK,WAAWrB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQH,UAAAA,CAAAA;AAKjD,IAAMK,gBACX,CAAIC,iBACJ,CAACjB,SACCJ,KAAKJ,IAAIwB,cAAiBC,YAAAA,EAAcjB,IAAAA,GAAOL,OAAOuB,cAAc;;UAE5DC,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAiBZ,IAAMC,cAAsB,CAACpB,SAAUS,aAAaT,IAAAA,IAAAA,IAAAA;AAQ7C,IAAMqB,QAGT,CAACrB,MAAesB,eAAiCC,YAAAA;AACnD,MAAI,CAACA,SAAS;AACZC,cAAUxB,MAAMoB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUxB,MAAMsB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBxB,MACAyB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,SAASH,OAAOzB,MAAM0B,MAAMC,KAAAA,KAAAA;AAClC,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BL,YAAQvB,MAAM0B,MAAMC,KAAAA;EACtB;AAGA,MAAInC,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAW6B,QAAQrC,IAAIsC,sBAAsB9B,IAAAA,GAAO;AAClD,YAAM+B,cAAc;WAAIL;QAAMG,KAAKG,KAAKC,SAAQ;;AAChD,YAAML,UAASJ,UAAUK,KAAKK,MAAMT,MAAMF,SAASQ,aAAaJ,QAAQ,CAAA;AACxE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAI2C,YAAYnC,IAAAA,GAAO;AAC9B,eAAW,CAACoC,GAAGC,OAAAA,KAAYrC,KAAKsC,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIL;QAAMU;;AAC9B,YAAMR,UAASJ,UAAUa,QAAQH,MAAMT,MAAMF,SAASQ,aAAaJ,KAAAA;AACnE,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAIgD,QAAQxC,IAAAA,GAAO;AAC1B,eAAWkC,QAAQlC,KAAKyC,OAAO;AAC7B,YAAMb,UAASJ,UAAUU,MAAMT,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIC,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSpC,IAAIkD,aAAa1C,IAAAA,GAAO;AAC/B,UAAM4B,UAASJ,UAAUxB,KAAK2C,MAAMlB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIC,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAAC5C,MAAeyB,SAAAA;AACtC,MAAIA,KAAKzB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAW6B,QAAQrC,IAAIsC,sBAAsB9B,IAAAA,GAAO;AAClD,YAAM6C,QAAQD,SAASf,KAAKK,MAAMT,IAAAA;AAClC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSrD,IAAI2C,YAAYnC,IAAAA,GAAO;AAC9B,eAAW,CAAC8C,GAAGT,OAAAA,KAAYrC,KAAKsC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMT,IAAAA;AACrC,UAAIoB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSrD,IAAIgD,QAAQxC,IAAAA,GAAO;AAC1B,QAAI+C,SAAS/C,IAAAA,GAAO;AAClB,iBAAWkC,QAAQlC,KAAKyC,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMT,IAAAA;AAC7B,YAAIoB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSrD,IAAIkD,aAAa1C,IAAAA,GAAO;AAC/B,WAAO4C,SAAS5C,KAAK2C,MAAMlB,IAAAA;EAC7B;AACF;AAKO,IAAMuB,eAAe,CAACC,QAAuBvB,SAAAA;AAClD,QAAMwB,UAAU,CAAClD,MAAe0B,UAAAA;AAC9B,UAAM,CAACM,MAAM,GAAGmB,IAAAA,IAAQzB;AACxB,UAAM0B,WAAWR,SAAS5C,MAAMR,IAAIU,aAAa;AACjDL,cAAUuD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQrC,IAAIsC,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKE,QAAQ;AACf,iBAAOH,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOK,KAAK5B,KAAK6B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2BhE,IAAIiE;EAChC,CAAC,eAAA,GAA2BjE,IAAIkE;EAChC,CAAC,eAAA,GAA2BlE,IAAImE;EAChC,CAAC,gBAAA,GAA4BnE,IAAIoE;AACnC;AAMO,IAAMC,iBAAiB,CAC5B7D,MACAiB,cACA6C,YAAAA;AAEA,QAAMC,oBAAoB/C,cAAcC,YAAAA;AAExC,QAAM+C,oBAAoB,CAAChE,UAAAA;AACzB,UAAMiE,QAAQF,kBAAkB/D,KAAAA;AAChC,QAAIiE,UAAUC,QAAW;AACvB,UAAIJ,SAASK,aAAaF,UAAUT,mBAAmBxD,MAAKoE,IAAI,GAAGC,YAAYpD,YAAAA,GAAe;AAC5F,eAAOiD;MACT;AAEA,aAAOD;IACT;AAEA,QAAIzE,IAAIgD,QAAQxC,KAAAA,GAAO;AACrB,UAAI+C,SAAS/C,KAAAA,GAAO;AAClB,eAAO+D,kBAAkB/D,MAAKyC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOuB,kBAAkBhE,IAAAA;AAC3B;AASO,IAAM+C,WAAW,CAAC/C,SAAAA;AACvB,SAAOR,IAAIgD,QAAQxC,IAAAA,KAASA,KAAKyC,MAAMY,WAAW,KAAK7D,IAAI8E,mBAAmBtE,KAAKyC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAM8B,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOR,IAAIgD,QAAQxC,IAAAA,KAASA,KAAKyC,MAAM+B,MAAMhF,IAAIgB,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAIgD,QAAQxC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOqD;AAC9D;AAKO,IAAMoB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUL,IAAIgD,QAAQxC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI+C,SAAS/C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKyC,MAAMiC,OAAiB,CAACC,QAAQzC,SAAAA;AAC1C,UAAM0C,QAAQpF,IAAIsC,sBAAsBI,IAAAA,EAErC2C,OAAO,CAACC,MAAMtF,IAAIgB,UAAUsE,EAAE5C,IAAI,CAAA,EAClC6C,IAAI,CAACD,MAAMA,EAAE9C,KAAKC,SAAQ,CAAA;AAG7B,WAAO0C,OAAOtB,WAAW,IAAIuB,QAAQD,OAAOE,OAAO,CAAChD,SAAS+C,MAAMI,SAASnD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMoD,uBAAuB,CAACjF,MAAeiE,QAA6B,CAAC,MAAC;AACjFpE,YAAUL,IAAIgD,QAAQxC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUoE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMW,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAOvB,QAAQ;AAClB;EACF;AAGA,aAAWnB,QAAQlC,KAAKyC,OAAO;AAC7B,UAAMyC,QAAQ1F,IAAIsC,sBAAsBI,IAAAA,EACrC2C,OAAO,CAAChD,SAAS+C,OAAOI,SAASnD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDuC,MAAM,CAAC3C,SAAAA;AACNhC,gBAAUL,IAAIgB,UAAUqB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKiD,YAAYlB,MAAMpC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIiD,OAAO;AACT,aAAOhD;IACT;EACF;AAKA,QAAMkD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAAClD,SAAAA;AACJ,UAAM0D,WAAWvF,KAAKyC,MACnBsC,IAAI,CAAC7C,SAAAA;AACJ,YAAMiD,UAAU3F,IAAIsC,sBAAsBI,IAAAA,EAAMsD,KAAK,CAACV,MAAMA,EAAE9C,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFhC,gBAAUL,IAAIgB,UAAU2E,QAAQjD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOiD,QAAQjD,KAAKiD;IACtB,CAAA,EACCN,OAAO/E,WAAAA;AAEV,WAAOyF,SAASlC,SAAS;MAACxB;MAAMnC,EAAE+F,QAAO,GAAIF,QAAAA;QAAarB;EAC5D,CAAA,EACCW,OAAO/E,WAAAA,CAAAA;AAGZ,QAAMmD,SAASvD,EAAEgG,OAAON,MAAAA;AACxB,SAAOnC,OAAOK;AAChB;;;AC7WA,SAASqC,OAAAA,YAA6B;AACtC,SAASC,UAAAA,SAAQC,QAAAA,aAAY;AAE7B,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,KAAIC,cAAuCL,oBAAAA;AAEtC,IAAMM,qBACX,CAACC,UACD,CAA4BC,SAC1BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIhB,QAAQQ,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAIf,SAAS,MAAM;AACjBA,gBAAQQ,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAIf,SAAS,MAAM;AACjB,YAAIH,KAAIuB,gBAAgBJ,KAAKK,GAAG,GAAG;AACjCP,iBAAOC,GAAAA,IAAOO,SAAStB,KAAAA;QACzB,WAAWH,KAAI0B,iBAAiBP,KAAKK,GAAG,GAAG;AACzCP,iBAAOC,GAAAA,IAAOf,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLc,iBAAOC,GAAAA,IAAOf;QAChB;MACF;AAEA,aAAOc;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKf,KAAAA,MAAM;AAC1C,UAAIA,UAAU0B,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BjC,sBAAsB+B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOjC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOQ;EACT;AACF;",
-  "names": ["AST", "JSONSchema", "Schema", "S", "AST", "Schema", "S", "Option", "pipe", "invariant", "nonNullable", "getSimpleType", "node", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "NonEmptyString", "pattern", "JsonProp", "getAnnotation", "annotationId", "getOrUndefined", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "result", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "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", "findAnnotation", "options", "getAnnotationById", "getBaseAnnotation", "value", "undefined", "noDefault", "_tag", "annotations", "isUndefinedKeyword", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "Literal", "Struct", "AST", "Option", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "AST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "constructor", "_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"]
+  "sourcesContent": ["//\n// Copyright 2020 DXOS.org\n//\n\nimport { AST, JSONSchema, Schema as S } from '@effect/schema';\nimport type * as Types from 'effect/Types';\n\n// TODO(dmaretskyi): Remove re-exports.\nexport { AST, JSONSchema, S, Types };\n\nexport * from './ast';\nexport * from './url';\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, Schema as S } from '@effect/schema';\nimport { Option, pipe } from 'effect';\n\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\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/AST.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: AST.AST): SimpleType | undefined => {\n  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {\n    return 'object';\n  }\n\n  if (AST.isStringKeyword(node)) {\n    return 'string';\n  }\n  if (AST.isNumberKeyword(node)) {\n    return 'number';\n  }\n  if (AST.isBooleanKeyword(node)) {\n    return 'boolean';\n  }\n\n  if (AST.isEnums(node)) {\n    return 'enum';\n  }\n\n  if (AST.isLiteral(node)) {\n    return 'literal';\n  }\n};\n\nexport const isSimpleType = (node: AST.AST): boolean => !!getSimpleType(node);\n\n//\n// Branded types\n//\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$]*)*/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;\nexport const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;\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: AST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;\n\nexport type VisitorFn = (node: AST.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: AST.AST, visitor: VisitorFn): void;\n  (node: AST.AST, test: TestFn, visitor: VisitorFn): void;\n} = (node: AST.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: AST.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 (AST.isTypeLiteral(node)) {\n    for (const prop of AST.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 (AST.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 (AST.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 (AST.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: AST.AST, test: (node: AST.AST) => boolean): AST.AST | undefined => {\n  if (test(node)) {\n    return node;\n  }\n\n  // Object.\n  else if (AST.isTypeLiteral(node)) {\n    for (const prop of AST.getPropertySignatures(node)) {\n      const child = findNode(prop.type, test);\n      if (child) {\n        return child;\n      }\n    }\n  }\n\n  // Tuple.\n  else if (AST.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 (AST.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 (AST.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 = (schema: S.Schema<any>, path: JsonPath | JsonProp): AST.AST | undefined => {\n  const getProp = (node: AST.AST, path: JsonProp[]): AST.AST | undefined => {\n    const [name, ...rest] = path;\n    const typeNode = findNode(node, AST.isTypeLiteral);\n    invariant(typeNode);\n    for (const prop of AST.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, AST.Annotated> = {\n  ['ObjectKeyword' as const]: AST.objectKeyword,\n  ['StringKeyword' as const]: AST.stringKeyword,\n  ['NumberKeyword' as const]: AST.numberKeyword,\n  ['BooleanKeyword' as const]: AST.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: AST.AST): T | undefined => {\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {\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: AST.AST, annotationId: symbol, noDefault = true): T | undefined => {\n  const getAnnotationById = getAnnotation(annotationId, noDefault);\n\n  const getBaseAnnotation = (node: AST.AST): T | undefined => {\n    const value = getAnnotationById(node);\n    if (value !== undefined) {\n      return value as T;\n    }\n\n    if (AST.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 S.optional creates a union type with undefined as the second type.\n */\nexport const isOption = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.length === 2 && AST.isUndefinedKeyword(node.types[1]);\n};\n\n/**\n * Determines if the node is a union of literal types.\n */\nexport const isLiteralUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && node.types.every(AST.isLiteral);\n};\n\n/**\n * Determines if the node is a discriminated union.\n */\nexport const isDiscriminatedUnion = (node: AST.AST): boolean => {\n  return AST.isUnion(node) && !!getDiscriminatingProps(node)?.length;\n};\n\n/**\n * Get the discriminating properties for the given union type.\n */\nexport const getDiscriminatingProps = (node: AST.AST): string[] | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      // TODO(burdon): Should check each literal is unique.\n      .filter((p) => AST.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 = (node: AST.AST, value: Record<string, any> = {}): AST.AST | undefined => {\n  invariant(AST.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 = AST.getPropertySignatures(type)\n      .filter((prop) => props?.includes(prop.name.toString()))\n      .every((prop) => {\n        invariant(AST.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 = AST.getPropertySignatures(type).find((p) => p.name.toString() === prop)!;\n            invariant(AST.isLiteral(literal.type));\n            return literal.type.literal;\n          })\n          .filter(nonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(nonNullable),\n  );\n\n  const schema = S.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 AST.\n * NOTE: Will evaluate suspended ASTs.\n */\nexport const mapAst = (ast: AST.AST, f: (ast: AST.AST) => AST.AST): AST.AST => {\n  switch (ast._tag) {\n    case 'TypeLiteral':\n      return new AST.TypeLiteral(\n        ast.propertySignatures.map(\n          (prop) =>\n            new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations),\n        ),\n        ast.indexSignatures,\n      );\n    case 'Union':\n      return AST.Union.make(ast.types.map(f), ast.annotations);\n    case 'TupleType':\n      return new AST.TupleType(\n        ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    case 'Suspend': {\n      const newAst = f(ast.f());\n      return new AST.Suspend(() => newAst, ast.annotations);\n    }\n    default:\n      // TODO(dmaretskyi): Support more nodes.\n      return ast;\n  }\n};\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { AST, type Schema as S } from '@effect/schema';\nimport { 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: AST.Annotated) => Option.Option<ParamKeyAnnotationValue> =\n  AST.getAnnotation<ParamKeyAnnotationValue>(ParamKeyAnnotationId);\n\nexport const ParamKeyAnnotation =\n  (value: ParamKeyAnnotationValue) =>\n  <S extends S.Annotable.All>(self: S): S.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: S.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 (AST.isNumberKeyword(type.ast)) {\n          params[key] = parseInt(value);\n        } else if (AST.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"],
+  "mappings": ";;;AAIA,SAASA,OAAAA,MAAKC,YAAYC,UAAUC,UAAS;;;ACA7C,SAASC,KAAKC,UAAUC,SAAS;AACjC,SAASC,QAAQC,YAAY;AAE7B,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;AAcrB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIR,IAAIS,gBAAgBD,IAAAA,KAASR,IAAIU,cAAcF,IAAAA,KAASG,qBAAqBH,IAAAA,GAAO;AACtF,WAAO;EACT;AAEA,MAAIR,IAAIY,gBAAgBJ,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIa,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIc,iBAAiBN,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIR,IAAIe,QAAQP,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIR,IAAIgB,UAAUR,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMS,eAAe,CAACT,SAA2B,CAAC,CAACD,cAAcC,IAAAA;AASxE,IAAMU,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWlB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQJ,UAAAA,CAAAA;AACjD,IAAMK,WAAWrB,EAAEmB,eAAejB,KAAKF,EAAEoB,QAAQH,UAAAA,CAAAA;;UAE5CK,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAkBZ,IAAMC,cAAsBR;AAQrB,IAAMS,QAGT,CAAClB,MAAemB,eAAmCC,YAAAA;AACrD,MAAI,CAACA,SAAS;AACZC,cAAUrB,MAAMiB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUrB,MAAMmB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBrB,MACAsB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOtB,MAAMuB,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,YAAQpB,MAAMuB,MAAMC,KAAAA;EACtB;AAGA,MAAIhC,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAW4B,QAAQpC,IAAIqC,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM8B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKK,MAAMX,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAI0C,YAAYlC,IAAAA,GAAO;AAC9B,eAAW,CAACmC,GAAGC,OAAAA,KAAYpC,KAAKqC,SAASC,QAAO,GAAI;AAClD,YAAMR,cAAc;WAAIP;QAAMY;;AAC9B,YAAMT,UAASL,UAAUe,QAAQH,MAAMX,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAI+C,QAAQvC,IAAAA,GAAO;AAC1B,eAAWiC,QAAQjC,KAAKwC,OAAO;AAC7B,YAAMd,UAASL,UAAUY,MAAMX,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSlC,IAAIiD,aAAazC,IAAAA,GAAO;AAC/B,UAAM0B,UAASL,UAAUrB,KAAK0C,MAAMpB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMiB,WAAW,CAAC3C,MAAesB,SAAAA;AACtC,MAAIA,KAAKtB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAW4B,QAAQpC,IAAIqC,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM4C,QAAQD,SAASf,KAAKK,MAAMX,IAAAA;AAClC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSpD,IAAI0C,YAAYlC,IAAAA,GAAO;AAC9B,eAAW,CAAC6C,GAAGT,OAAAA,KAAYpC,KAAKqC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQH,MAAMX,IAAAA;AACrC,UAAIsB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSpD,IAAI+C,QAAQvC,IAAAA,GAAO;AAC1B,QAAI8C,SAAS9C,IAAAA,GAAO;AAClB,iBAAWiC,QAAQjC,KAAKwC,OAAO;AAC7B,cAAMI,QAAQD,SAASV,MAAMX,IAAAA;AAC7B,YAAIsB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSpD,IAAIiD,aAAazC,IAAAA,GAAO;AAC/B,WAAO2C,SAAS3C,KAAK0C,MAAMpB,IAAAA;EAC7B;AACF;AAKO,IAAMyB,eAAe,CAACC,QAAuBzB,SAAAA;AAClD,QAAM0B,UAAU,CAACjD,MAAeuB,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGmB,IAAAA,IAAQ3B;AACxB,UAAM4B,WAAWR,SAAS3C,MAAMR,IAAIU,aAAa;AACjDL,cAAUsD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWvB,QAAQpC,IAAIqC,sBAAsBsB,QAAAA,GAAW;AACtD,UAAIvB,KAAKG,SAASA,MAAM;AACtB,YAAImB,KAAKE,QAAQ;AACf,iBAAOH,QAAQrB,KAAKK,MAAMiB,IAAAA;QAC5B,OAAO;AACL,iBAAOtB,KAAKK;QACd;MACF;IACF;EACF;AAEA,SAAOgB,QAAQD,OAAOK,KAAK9B,KAAK+B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B/D,IAAIgE;EAChC,CAAC,eAAA,GAA2BhE,IAAIiE;EAChC,CAAC,eAAA,GAA2BjE,IAAIkE;EAChC,CAAC,gBAAA,GAA4BlE,IAAImE;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC9D,SAAAA;AACC,QAAM+D,QAAQnE,KAAKJ,IAAIoE,cAAiBC,YAAAA,EAAc7D,IAAAA,GAAOL,OAAOqE,cAAc;AAClF,MAAIF,aAAaC,UAAUR,mBAAmBvD,KAAKiE,IAAI,GAAGC,YAAYL,YAAAA,GAAe;AACnF,WAAOlC;EACT;AAEA,SAAOoC;AACT;AAOK,IAAMI,iBAAiB,CAAInE,MAAe6D,cAAsBC,YAAY,SAAI;AACrF,QAAMM,oBAAoBR,cAAcC,cAAcC,SAAAA;AAEtD,QAAMO,oBAAoB,CAACrE,UAAAA;AACzB,UAAM+D,QAAQK,kBAAkBpE,KAAAA;AAChC,QAAI+D,UAAUpC,QAAW;AACvB,aAAOoC;IACT;AAEA,QAAIvE,IAAI+C,QAAQvC,KAAAA,GAAO;AACrB,UAAI8C,SAAS9C,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKwC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO6B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAM8C,WAAW,CAAC9C,SAAAA;AACvB,SAAOR,IAAI+C,QAAQvC,IAAAA,KAASA,KAAKwC,MAAMY,WAAW,KAAK5D,IAAI8E,mBAAmBtE,KAAKwC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAM+B,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOR,IAAI+C,QAAQvC,IAAAA,KAASA,KAAKwC,MAAMgC,MAAMhF,IAAIgB,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAI+C,QAAQvC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOoD;AAC9D;AAKO,IAAMqB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUL,IAAI+C,QAAQvC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI8C,SAAS9C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKwC,MAAMkC,OAAiB,CAACC,QAAQ1C,SAAAA;AAC1C,UAAM2C,QAAQpF,IAAIqC,sBAAsBI,IAAAA,EAErC4C,OAAO,CAACC,MAAMtF,IAAIgB,UAAUsE,EAAE7C,IAAI,CAAA,EAClC8C,IAAI,CAACD,MAAMA,EAAE/C,KAAKC,SAAQ,CAAA;AAG7B,WAAO2C,OAAOvB,WAAW,IAAIwB,QAAQD,OAAOE,OAAO,CAACjD,SAASgD,MAAMI,SAASpD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMqD,uBAAuB,CAACjF,MAAe+D,QAA6B,CAAC,MAAC;AACjFlE,YAAUL,IAAI+C,QAAQvC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUkE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMa,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAOxB,QAAQ;AAClB;EACF;AAGA,aAAWnB,QAAQjC,KAAKwC,OAAO;AAC7B,UAAM0C,QAAQ1F,IAAIqC,sBAAsBI,IAAAA,EACrC4C,OAAO,CAACjD,SAASgD,OAAOI,SAASpD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDwC,MAAM,CAAC5C,SAAAA;AACN/B,gBAAUL,IAAIgB,UAAUoB,KAAKK,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOL,KAAKK,KAAKkD,YAAYpB,MAAMnC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIkD,OAAO;AACT,aAAOjD;IACT;EACF;AAKA,QAAMmD,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACnD,SAAAA;AACJ,UAAM2D,WAAWvF,KAAKwC,MACnBuC,IAAI,CAAC9C,SAAAA;AACJ,YAAMkD,UAAU3F,IAAIqC,sBAAsBI,IAAAA,EAAMuD,KAAK,CAACV,MAAMA,EAAE/C,KAAKC,SAAQ,MAAOJ,IAAAA;AAClF/B,gBAAUL,IAAIgB,UAAU2E,QAAQlD,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOkD,QAAQlD,KAAKkD;IACtB,CAAA,EACCN,OAAO/E,WAAAA;AAEV,WAAOyF,SAASnC,SAAS;MAACxB;MAAMlC,EAAE+F,QAAO,GAAIF,QAAAA;QAAa5D;EAC5D,CAAA,EACCkD,OAAO/E,WAAAA,CAAAA;AAGZ,QAAMkD,SAAStD,EAAEgG,OAAON,MAAAA;AACxB,SAAOpC,OAAOK;AAChB;AAOO,IAAMsC,SAAS,CAACtC,KAAcuC,MAAAA;AACnC,UAAQvC,IAAIY,MAAI;IACd,KAAK;AACH,aAAO,IAAIzE,IAAIqG,YACbxC,IAAIyC,mBAAmBf,IACrB,CAACnD,SACC,IAAIpC,IAAIuG,kBAAkBnE,KAAKG,MAAM6D,EAAEhE,KAAKK,IAAI,GAAGL,KAAKoE,YAAYpE,KAAKqE,YAAYrE,KAAKsC,WAAW,CAAA,GAEzGb,IAAI6C,eAAe;IAEvB,KAAK;AACH,aAAO1G,IAAI2G,MAAMC,KAAK/C,IAAIb,MAAMuC,IAAIa,CAAAA,GAAIvC,IAAIa,WAAW;IACzD,KAAK;AACH,aAAO,IAAI1E,IAAI6G,UACbhD,IAAIhB,SAAS0C,IAAI,CAACuB,MAAM,IAAI9G,IAAI+G,aAAaX,EAAEU,EAAErE,IAAI,GAAGqE,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACnFb,IAAIH,KAAK6B,IAAI,CAACuB,MAAM,IAAI9G,IAAIgH,KAAKZ,EAAEU,EAAErE,IAAI,GAAGqE,EAAEpC,WAAW,CAAA,GACzDb,IAAI4C,YACJ5C,IAAIa,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMuC,SAASb,EAAEvC,IAAIuC,EAAC,CAAA;AACtB,aAAO,IAAIpG,IAAIkH,QAAQ,MAAMD,QAAQpD,IAAIa,WAAW;IACtD;IACA;AAEE,aAAOb;EACX;AACF;;;AC1ZA,SAASsD,OAAAA,YAA6B;AACtC,SAASC,UAAAA,SAAQC,QAAAA,aAAY;AAE7B,SAASC,kBAAkB;AAE3B,IAAMC,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXC,KAAIC,cAAuCL,oBAAAA;AAEtC,IAAMM,qBACX,CAACC,UACD,CAA4BC,SAC1BA,KAAKC,YAAY;EAAE,CAACT,oBAAAA,GAAuBO;AAAM,CAAA;AAM9C,IAAMG,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOG,OAAOC,QAAQ,KAAKN,QAAQO,MAAM,EAAEC,OAA4B,CAACC,QAAQ,CAACC,KAAKC,IAAAA,MAAK;AACzF,UAAIhB,QAAQQ,IAAIS,aAAaC,IAAIC,WAAWJ,GAAAA,CAAAA;AAC5C,UAAIf,SAAS,MAAM;AACjBA,gBAAQQ,IAAIS,aAAaC,IAAIH,GAAAA;MAC/B;AAEA,UAAIf,SAAS,MAAM;AACjB,YAAIH,KAAIuB,gBAAgBJ,KAAKK,GAAG,GAAG;AACjCP,iBAAOC,GAAAA,IAAOO,SAAStB,KAAAA;QACzB,WAAWH,KAAI0B,iBAAiBP,KAAKK,GAAG,GAAG;AACzCP,iBAAOC,GAAAA,IAAOf,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLc,iBAAOC,GAAAA,IAAOf;QAChB;MACF;AAEA,aAAOc;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAU,OAAOjB,MAAcO,QAAgB;AACnC,UAAMN,MAAM,IAAIC,IAAIF,IAAAA;AACpBG,WAAOC,QAAQG,MAAAA,EAAQW,QAAQ,CAAC,CAACV,KAAKf,KAAAA,MAAM;AAC1C,UAAIA,UAAU0B,QAAW;AACvB,cAAMC,QAAQ,KAAKtB,QAAQO,OAAOG,GAAAA;AAClC,YAAIY,OAAO;AACT,gBAAM,EAAEZ,KAAKa,cAAa,IAAKC,MAC7BjC,sBAAsB+B,MAAMN,GAAG,GAC/BS,QAAOC,UAAU,OAAO;YACtBhB,KAAKI,WAAWJ,GAAAA;UAClB,EAAA,CAAA;AAGFP,cAAIS,aAAae,IAAIJ,eAAeK,OAAOjC,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOQ;EACT;AACF;",
+  "names": ["AST", "JSONSchema", "Schema", "S", "AST", "Schema", "S", "Option", "pipe", "invariant", "nonNullable", "getSimpleType", "node", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "PATH_REGEX", "PROP_REGEX", "JsonPath", "NonEmptyString", "pattern", "JsonProp", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "type", "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", "value", "getOrUndefined", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isUndefinedKeyword", "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", "OptionalType", "Type", "newAst", "Suspend", "AST", "Option", "pipe", "decamelize", "ParamKeyAnnotationId", "Symbol", "for", "getParamKeyAnnotation", "AST", "getAnnotation", "ParamKeyAnnotation", "value", "self", "annotations", "UrlParser", "constructor", "_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"]
 }

package/dist/lib/node-esm/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":33857,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/node-esm/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":21747},"packages/common/effect/dist/lib/node-esm/index.mjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":7227},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":9525}}}
+{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":38855,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/url.ts":{"bytes":7711,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"format":"esm"},"packages/common/effect/src/index.ts":{"bytes":1150,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"packages/common/effect/src/ast.ts","kind":"import-statement","original":"./ast"},{"path":"packages/common/effect/src/url.ts","kind":"import-statement","original":"./url"}],"format":"esm"}},"outputs":{"packages/common/effect/dist/lib/node-esm/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":24310},"packages/common/effect/dist/lib/node-esm/index.mjs":{"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true}],"exports":["AST","JSONSchema","JsonPath","JsonProp","ParamKeyAnnotation","S","UrlParser","VisitResult","findAnnotation","findNode","findProperty","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isLiteralUnion","isOption","isSimpleType","mapAst","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":8099},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":10407}}}

package/dist/types/src/ast.d.ts

@@ -17,10 +17,6 @@ export type JsonPath = string & {
  */
 export declare const JsonPath: S.Schema<JsonPath>;
 export declare const JsonProp: S.Schema<JsonProp>;
-/**
- * Get annotation or return undefined.
- */
-export declare const getAnnotation: <T>(annotationId: symbol) => (node: AST.Annotated) => T | undefined;
 export declare enum VisitResult {
     CONTINUE = 0,
     /**
@@ -33,8 +29,8 @@ export declare enum VisitResult {
     EXIT = 2
 }
 export type Path = (string | number)[];
-export type Tester = (node: AST.AST, path: Path, depth: number) => VisitResult | undefined;
-export type Visitor = (node: AST.AST, path: Path, depth: number) => void;
+export type TestFn = (node: AST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;
+export type VisitorFn = (node: AST.AST, path: Path, depth: number) => void;
 /**
  * Visit leaf nodes.
  * Refs:
@@ -42,8 +38,8 @@ export type Visitor = (node: AST.AST, path: Path, depth: number) => void;
  * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test
  */
 export declare const visit: {
-    (node: AST.AST, visitor: Visitor): void;
-    (node: AST.AST, test: Tester, visitor: Visitor): void;
+    (node: AST.AST, visitor: VisitorFn): void;
+    (node: AST.AST, test: TestFn, visitor: VisitorFn): void;
 };
 /**
  * Recursively descend into AST to find first node that passes the test.
@@ -53,13 +49,17 @@ export declare const findNode: (node: AST.AST, test: (node: AST.AST) => boolean)
  * Get the AST node for the given property (dot-path).
  */
 export declare const findProperty: (schema: S.Schema<any>, path: JsonPath | JsonProp) => AST.AST | undefined;
+/**
+ * Get annotation or return undefined.
+ * @param annotationId
+ * @param noDefault If true, then return undefined for effect library defined values.
+ */
+export declare const getAnnotation: <T>(annotationId: symbol, noDefault?: boolean) => (node: AST.AST) => T | undefined;
 /**
  * Recursively descend into AST to find first matching annotations.
  * Optionally skips default annotations for basic types (e.g., 'a string').
  */
-export declare const findAnnotation: <T>(node: AST.AST, annotationId: symbol, options?: {
-    noDefault: boolean;
-}) => T | undefined;
+export declare const findAnnotation: <T>(node: AST.AST, annotationId: symbol, noDefault?: boolean) => T | undefined;
 /**
  * Effect S.optional creates a union type with undefined as the second type.
  */
@@ -80,4 +80,10 @@ export declare const getDiscriminatingProps: (node: AST.AST) => string[] | undef
  * Get the discriminated type for the given value.
  */
 export declare const getDiscriminatedType: (node: AST.AST, value?: Record<string, any>) => AST.AST | undefined;
+/**
+ * Maps AST nodes.
+ * The user is responsible for recursively calling {@link mapAst} on the AST.
+ * NOTE: Will evaluate suspended ASTs.
+ */
+export declare const mapAst: (ast: AST.AST, f: (ast: AST.AST) => AST.AST) => AST.AST;
 //# sourceMappingURL=ast.d.ts.map

package/dist/types/src/ast.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../../src/ast.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,GAAG,EAAE,MAAM,IAAI,CAAC,EAAE,MAAM,gBAAgB,CAAC;AAalD,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,CAAC;AAEzF;;GAEG;AACH,eAAO,MAAM,aAAa,SAAU,GAAG,CAAC,GAAG,KAAG,UAAU,GAAG,SAsB1D,CAAC;AAEF,eAAO,MAAM,YAAY,SAAU,GAAG,CAAC,GAAG,KAAG,OAAgC,CAAC;AAM9E,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG;IAAE,UAAU,EAAE,IAAI,CAAC;IAAC,UAAU,EAAE,IAAI,CAAA;CAAE,CAAC;AACvE,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG;IAAE,UAAU,EAAE,IAAI,CAAA;CAAE,CAAC;AAKrD;;GAEG;AACH,eAAO,MAAM,QAAQ,EAA0D,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAClG,eAAO,MAAM,QAAQ,EAA0D,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAElG;;GAEG;AACH,eAAO,MAAM,aAAa,GACvB,CAAC,gBAAgB,MAAM,YACjB,GAAG,CAAC,SAAS,KAAG,CAAC,GAAG,SAC4C,CAAC;AAE1E,oBAAY,WAAW;IACrB,QAAQ,IAAI;IACZ;;OAEG;IACH,IAAI,IAAI;IACR;;OAEG;IACH,IAAI,IAAI;CACT;AAED,MAAM,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;AAEvC,MAAM,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,KAAK,WAAW,GAAG,SAAS,CAAC;AAC3F,MAAM,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;AAIzE;;;;;GAKG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxC,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;CAOvD,CAAC;AA4DF;;GAEG;AAEH,eAAO,MAAM,QAAQ,SAAU,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,KAAK,OAAO,KAAG,GAAG,CAAC,GAAG,GAAG,SAyCpF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,YAAY,WAAY,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,QAAQ,GAAG,QAAQ,KAAG,GAAG,CAAC,GAAG,GAAG,SAiBzF,CAAC;AAaF;;;GAGG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,QACxB,GAAG,CAAC,GAAG,gBACC,MAAM,YACV;IAAE,SAAS,EAAE,OAAO,CAAA;CAAE,KAC/B,CAAC,GAAG,SAqBN,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,QAAQ,SAAU,GAAG,CAAC,GAAG,KAAG,OAExC,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,cAAc,SAAU,GAAG,CAAC,GAAG,KAAG,OAE9C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,SAAU,GAAG,CAAC,GAAG,KAAG,OAEpD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,sBAAsB,SAAU,GAAG,CAAC,GAAG,KAAG,MAAM,EAAE,GAAG,SAgBjE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,SAAU,GAAG,CAAC,GAAG,UAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,KAAQ,GAAG,CAAC,GAAG,GAAG,SA2C/F,CAAC"}
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../../src/ast.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,GAAG,EAAE,MAAM,IAAI,CAAC,EAAE,MAAM,gBAAgB,CAAC;AAalD,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,CAAC;AAEzF;;GAEG;AACH,eAAO,MAAM,aAAa,SAAU,GAAG,CAAC,GAAG,KAAG,UAAU,GAAG,SAsB1D,CAAC;AAEF,eAAO,MAAM,YAAY,SAAU,GAAG,CAAC,GAAG,KAAG,OAAgC,CAAC;AAM9E,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG;IAAE,UAAU,EAAE,IAAI,CAAC;IAAC,UAAU,EAAE,IAAI,CAAA;CAAE,CAAC;AACvE,MAAM,MAAM,QAAQ,GAAG,MAAM,GAAG;IAAE,UAAU,EAAE,IAAI,CAAA;CAAE,CAAC;AAKrD;;GAEG;AACH,eAAO,MAAM,QAAQ,EAA0D,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAClG,eAAO,MAAM,QAAQ,EAA0D,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAElG,oBAAY,WAAW;IACrB,QAAQ,IAAI;IACZ;;OAEG;IACH,IAAI,IAAI;IACR;;OAEG;IACH,IAAI,IAAI;CACT;AAED,MAAM,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;AAEvC,MAAM,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,KAAK,WAAW,GAAG,OAAO,GAAG,SAAS,CAAC;AAErG,MAAM,MAAM,SAAS,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;AAI3E;;;;;GAKG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,GAAG,IAAI,CAAC;IAC1C,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,IAAI,CAAC;CAOzD,CAAC;AAqEF;;GAEG;AAEH,eAAO,MAAM,QAAQ,SAAU,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,KAAK,OAAO,KAAG,GAAG,CAAC,GAAG,GAAG,SAyCpF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,YAAY,WAAY,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,QAAQ,GAAG,QAAQ,KAAG,GAAG,CAAC,GAAG,GAAG,SAiBzF,CAAC;AAaF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GACvB,CAAC,gBAAgB,MAAM,iCACjB,GAAG,CAAC,GAAG,KAAG,CAAC,GAAG,SAOpB,CAAC;AAEJ;;;GAGG;AAEH,eAAO,MAAM,cAAc,GAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,gBAAgB,MAAM,0BAAqB,CAAC,GAAG,SAiB7F,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,QAAQ,SAAU,GAAG,CAAC,GAAG,KAAG,OAExC,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,cAAc,SAAU,GAAG,CAAC,GAAG,KAAG,OAE9C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,SAAU,GAAG,CAAC,GAAG,KAAG,OAEpD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,sBAAsB,SAAU,GAAG,CAAC,GAAG,KAAG,MAAM,EAAE,GAAG,SAgBjE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,SAAU,GAAG,CAAC,GAAG,UAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,KAAQ,GAAG,CAAC,GAAG,GAAG,SA2C/F,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,MAAM,QAAS,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,KAAG,GAAG,CAAC,GA2BvE,CAAC"}

package/dist/types/src/sanity.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=sanity.test.d.ts.map

package/dist/types/src/sanity.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sanity.test.d.ts","sourceRoot":"","sources":["../../../src/sanity.test.ts"],"names":[],"mappings":""}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dxos/effect",
-  "version": "0.7.1",
+  "version": "0.7.2-staging.6d26b2a",
   "description": "Effect utils.",
   "homepage": "https://dxos.org",
   "bugs": "https://github.com/dxos/dxos/issues",
@@ -22,13 +22,14 @@
     "src"
   ],
   "dependencies": {
-    "@dxos/util": "0.7.1",
-    "@dxos/invariant": "0.7.1",
-    "@dxos/node-std": "0.7.1"
+    "@dxos/invariant": "0.7.2-staging.6d26b2a",
+    "@dxos/util": "0.7.2-staging.6d26b2a",
+    "@dxos/node-std": "0.7.2-staging.6d26b2a"
   },
   "devDependencies": {
     "@effect/schema": "^0.75.5",
-    "effect": "^3.9.2"
+    "effect": "^3.9.2",
+    "@dxos/log": "0.7.2-staging.6d26b2a"
   },
   "peerDependencies": {
     "@effect/schema": "^0.75.5",

package/src/ast.test.ts

@@ -114,7 +114,6 @@ describe('AST', () => {
     const annotation = findAnnotation(
       S.String.annotations({ [AST.TitleAnnotationId]: 'test' }).ast,
       AST.TitleAnnotationId,
-      { noDefault: true },
     );
     expect(annotation).to.eq('test');
 
@@ -122,7 +121,7 @@ describe('AST', () => {
     const schemas = [S.Object, S.String, S.Number, S.Boolean];
     for (const schema of schemas) {
       for (const annotationId of annotationIds) {
-        const annotation = findAnnotation(schema.ast, annotationId, { noDefault: true });
+        const annotation = findAnnotation(schema.ast, annotationId);
         expect(annotation, schema.ast._tag).to.eq(undefined);
       }
     }

package/src/ast.ts

@@ -62,14 +62,6 @@ const PROP_REGEX = /\w+/;
 export const JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX)) as any as S.Schema<JsonPath>;
 export const JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX)) as any as S.Schema<JsonProp>;
 
-/**
- * Get annotation or return undefined.
- */
-export const getAnnotation =
-  <T>(annotationId: symbol) =>
-  (node: AST.Annotated): T | undefined =>
-    pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);
-
 export enum VisitResult {
   CONTINUE = 0,
   /**
@@ -84,10 +76,11 @@ export enum VisitResult {
 
 export type Path = (string | number)[];
 
-export type Tester = (node: AST.AST, path: Path, depth: number) => VisitResult | undefined;
-export type Visitor = (node: AST.AST, path: Path, depth: number) => void;
+export type TestFn = (node: AST.AST, path: Path, depth: number) => VisitResult | boolean | undefined;
+
+export type VisitorFn = (node: AST.AST, path: Path, depth: number) => void;
 
-const defaultTest: Tester = (node) => (isSimpleType(node) ? VisitResult.CONTINUE : VisitResult.SKIP);
+const defaultTest: TestFn = isSimpleType;
 
 /**
  * Visit leaf nodes.
@@ -96,24 +89,33 @@ const defaultTest: Tester = (node) => (isSimpleType(node) ? VisitResult.CONTINUE
  * - https://github.com/syntax-tree/unist-util-is?tab=readme-ov-file#test
  */
 export const visit: {
-  (node: AST.AST, visitor: Visitor): void;
-  (node: AST.AST, test: Tester, visitor: Visitor): void;
-} = (node: AST.AST, testOrVisitor: Tester | Visitor, visitor?: Visitor): void => {
+  (node: AST.AST, visitor: VisitorFn): void;
+  (node: AST.AST, test: TestFn, visitor: VisitorFn): void;
+} = (node: AST.AST, testOrVisitor: TestFn | VisitorFn, visitor?: VisitorFn): void => {
   if (!visitor) {
     visitNode(node, defaultTest, testOrVisitor);
   } else {
-    visitNode(node, testOrVisitor as Tester, visitor);
+    visitNode(node, testOrVisitor as TestFn, visitor);
   }
 };
 
 const visitNode = (
   node: AST.AST,
-  test: Tester | undefined,
-  visitor: Visitor,
+  test: TestFn | undefined,
+  visitor: VisitorFn,
   path: Path = [],
   depth = 0,
 ): VisitResult | undefined => {
-  const result = test?.(node, path, depth) ?? VisitResult.CONTINUE;
+  const _result = test?.(node, path, depth);
+  const result: VisitResult =
+    _result === undefined
+      ? VisitResult.CONTINUE
+      : typeof _result === 'boolean'
+        ? _result
+          ? VisitResult.CONTINUE
+          : VisitResult.SKIP
+        : _result;
+
   if (result === VisitResult.EXIT) {
     return result;
   }
@@ -244,24 +246,33 @@ const defaultAnnotations: Record<string, AST.Annotated> = {
   ['BooleanKeyword' as const]: AST.booleanKeyword,
 };
 
+/**
+ * Get annotation or return undefined.
+ * @param annotationId
+ * @param noDefault If true, then return undefined for effect library defined values.
+ */
+export const getAnnotation =
+  <T>(annotationId: symbol, noDefault = true) =>
+  (node: AST.AST): T | undefined => {
+    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);
+    if (noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {
+      return undefined;
+    }
+
+    return value;
+  };
+
 /**
  * Recursively descend into AST to find first matching annotations.
  * Optionally skips default annotations for basic types (e.g., 'a string').
  */
-export const findAnnotation = <T>(
-  node: AST.AST,
-  annotationId: symbol,
-  options?: { noDefault: boolean },
-): T | undefined => {
-  const getAnnotationById = getAnnotation(annotationId);
+// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).
+export const findAnnotation = <T>(node: AST.AST, annotationId: symbol, noDefault = true): T | undefined => {
+  const getAnnotationById = getAnnotation(annotationId, noDefault);
 
   const getBaseAnnotation = (node: AST.AST): T | undefined => {
     const value = getAnnotationById(node);
     if (value !== undefined) {
-      if (options?.noDefault && value === defaultAnnotations[node._tag]?.annotations[annotationId]) {
-        return undefined;
-      }
-
       return value as T;
     }
 
@@ -368,3 +379,37 @@ export const getDiscriminatedType = (node: AST.AST, value: Record<string, any> =
   const schema = S.Struct(fields);
   return schema.ast;
 };
+
+/**
+ * Maps AST nodes.
+ * The user is responsible for recursively calling {@link mapAst} on the AST.
+ * NOTE: Will evaluate suspended ASTs.
+ */
+export const mapAst = (ast: AST.AST, f: (ast: AST.AST) => AST.AST): AST.AST => {
+  switch (ast._tag) {
+    case 'TypeLiteral':
+      return new AST.TypeLiteral(
+        ast.propertySignatures.map(
+          (prop) =>
+            new AST.PropertySignature(prop.name, f(prop.type), prop.isOptional, prop.isReadonly, prop.annotations),
+        ),
+        ast.indexSignatures,
+      );
+    case 'Union':
+      return AST.Union.make(ast.types.map(f), ast.annotations);
+    case 'TupleType':
+      return new AST.TupleType(
+        ast.elements.map((t) => new AST.OptionalType(f(t.type), t.isOptional, t.annotations)),
+        ast.rest.map((t) => new AST.Type(f(t.type), t.annotations)),
+        ast.isReadonly,
+        ast.annotations,
+      );
+    case 'Suspend': {
+      const newAst = f(ast.f());
+      return new AST.Suspend(() => newAst, ast.annotations);
+    }
+    default:
+      // TODO(dmaretskyi): Support more nodes.
+      return ast;
+  }
+};

package/src/sanity.test.ts

@@ -0,0 +1,69 @@
+//
+// Copyright 2024 DXOS.org
+//
+
+import { Effect, pipe } from 'effect';
+import { describe, test } from 'vitest';
+
+import { log } from '@dxos/log';
+
+describe('sanity tests', () => {
+  test('function pipeline', async ({ expect }) => {
+    const result = pipe(
+      10,
+      (value) => value + 3,
+      (value) => value * 2,
+    );
+    expect(result).to.eq(26);
+  });
+
+  test('effect pipeline (mixing types)', async ({ expect }) => {
+    const result = await Effect.runPromise(
+      pipe(
+        Effect.promise(() => Promise.resolve(100)),
+        Effect.tap((value) => log('tap', { value })),
+        Effect.map((value: number) => String(value)),
+        Effect.tap((value) => log('tap', { value })),
+        Effect.map((value: string) => value.length),
+        Effect.tap((value) => log('tap', { value })),
+      ),
+    );
+    expect(result).to.eq(3);
+  });
+
+  test('effect pipeline (mixing sync/async)', async ({ expect }) => {
+    const result = await Effect.runPromise(
+      pipe(
+        Effect.succeed(100),
+        Effect.tap((value) => log('tap', { value })),
+        Effect.flatMap((value) => Effect.promise(() => Promise.resolve(String(value)))),
+        Effect.tap((value) => log('tap', { value })),
+        Effect.map((value) => value.length),
+        Effect.tap((value) => log('tap', { value })),
+      ),
+    );
+    expect(result).to.eq(3);
+  });
+
+  test('error handling', async ({ expect }) => {
+    Effect.runPromise(
+      pipe(
+        Effect.succeed(10),
+        Effect.map((value) => value * 2),
+        Effect.flatMap((value) =>
+          Effect.promise(() => {
+            if (value > 10) {
+              return Promise.reject(new Error('error message'));
+            }
+
+            return Promise.resolve(value);
+          }),
+        ),
+      ),
+    )
+      .then(() => expect.fail())
+      .catch((error) => {
+        expect(error).to.be.instanceOf(Error);
+      });
+  });
+});