@dxos/effect 0.7.5-main.9d26e3a → 0.7.5-main.b19bfc8

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\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\])*$/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = 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    // Title fallback seems to be the identifier.\n    const id = pipe(AST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: 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;;UAEvDW,aAAAA;AAIdA,cACYC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AAiCjB,IAAMI,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,cAAsBd;AAQrB,IAAMe,QAGT,CAACzB,MAAe0B,eAAmCC,YAAAA;AACrD,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,UAAUH,OAAO7B,MAAM8B,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,YAAQ3B,MAAM8B,MAAMC,KAAAA;EACtB;AAGA,MAAI9B,mBAAIE,cAAcH,IAAAA,GAAO;AAC3B,eAAWmC,QAAQlC,mBAAImC,sBAAsBpC,IAAAA,GAAO;AAClD,YAAMqC,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKtB,MAAMgB,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGShC,mBAAIuC,YAAYxC,IAAAA,GAAO;AAC9B,eAAW,CAACyC,GAAGC,OAAAA,KAAY1C,KAAK2C,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQ7B,MAAMgB,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGShC,mBAAI4C,QAAQ7C,IAAAA,GAAO;AAC1B,eAAWa,QAAQb,KAAK8C,OAAO;AAC7B,YAAMb,UAASL,UAAUf,MAAMgB,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGShC,mBAAI8C,aAAa/C,IAAAA,GAAO;AAC/B,UAAMiC,UAASL,UAAU5B,KAAKgD,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAACjD,MAAe6B,SAAAA;AACtC,MAAIA,KAAK7B,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSC,mBAAIE,cAAcH,IAAAA,GAAO;AAChC,eAAWmC,QAAQlC,mBAAImC,sBAAsBpC,IAAAA,GAAO;AAClD,YAAMkD,QAAQD,SAASd,KAAKtB,MAAMgB,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSjD,mBAAIuC,YAAYxC,IAAAA,GAAO;AAC9B,eAAW,CAACmD,GAAGT,OAAAA,KAAY1C,KAAK2C,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQ7B,MAAMgB,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSjD,mBAAI4C,QAAQ7C,IAAAA,GAAO;AAC1B,QAAIoD,SAASpD,IAAAA,GAAO;AAClB,iBAAWa,QAAQb,KAAK8C,OAAO;AAC7B,cAAMI,QAAQD,SAASpC,MAAMgB,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSjD,mBAAI8C,aAAa/C,IAAAA,GAAO;AAC/B,WAAOiD,SAASjD,KAAKgD,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAACC,QAAuBxB,SAAAA;AAClD,QAAMyB,UAAU,CAACvD,MAAe8B,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAASjD,MAAMC,mBAAIE,aAAa;AACjDuD,oCAAUD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQlC,mBAAImC,sBAAsBqB,QAAAA,GAAW;AACtD,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKG,QAAQ;AACf,iBAAOJ,QAAQpB,KAAKtB,MAAM2C,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKtB;QACd;MACF;IACF;EACF;AAEA,SAAO0C,QAAQD,OAAOM,KAAK9B,KAAK+B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B7D,mBAAI8D;EAChC,CAAC,eAAA,GAA2B9D,mBAAI+D;EAChC,CAAC,eAAA,GAA2B/D,mBAAIgE;EAChC,CAAC,gBAAA,GAA4BhE,mBAAIiE;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAACrE,SAAAA;AAEC,QAAMsE,SAAKlD,oBAAKnB,mBAAIsE,wBAAwBvE,IAAAA,GAAOwE,qBAAOC,cAAc;AACxE,QAAMC,YAAQtD,oBAAKnB,mBAAIkE,cAAiBC,YAAAA,EAAcpE,IAAAA,GAAOwE,qBAAOC,cAAc;AAClF,MAAIJ,cAAcK,UAAUZ,mBAAmB9D,KAAK2E,IAAI,GAAGC,YAAYR,YAAAA,KAAiBM,UAAUJ,KAAK;AACrG,WAAOpC;EACT;AAEA,SAAOwC;AACT;AAOK,IAAMG,iBAAiB,CAAI7E,MAAeoE,cAAsBC,YAAY,SAAI;AACrF,QAAMS,oBAAoBX,cAAcC,cAAcC,SAAAA;AAEtD,QAAMU,oBAAoB,CAAC/E,UAAAA;AACzB,UAAM0E,QAAQI,kBAAkB9E,KAAAA;AAChC,QAAI0E,UAAUxC,QAAW;AACvB,aAAOwC;IACT;AAEA,QAAIzE,mBAAI4C,QAAQ7C,KAAAA,GAAO;AACrB,UAAIoD,SAASpD,KAAAA,GAAO;AAClB,eAAO8E,kBAAkB9E,MAAK8C,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOiC,kBAAkB/E,IAAAA;AAC3B;AASO,IAAMoD,WAAW,CAACpD,SAAAA;AACvB,SAAOC,mBAAI4C,QAAQ7C,IAAAA,KAASA,KAAK8C,MAAMa,WAAW,KAAK1D,mBAAI+E,mBAAmBhF,KAAK8C,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAMmC,iBAAiB,CAACjF,SAAAA;AAC7B,SAAOC,mBAAI4C,QAAQ7C,IAAAA,KAASA,KAAK8C,MAAMoC,MAAMjF,mBAAIQ,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACJ,SAAAA;AACnC,SAAOC,mBAAI4C,QAAQ7C,IAAAA,KAAS,CAAC,CAACmF,uBAAuBnF,IAAAA,GAAO2D;AAC9D;AAKO,IAAMwB,yBAAyB,CAACnF,SAAAA;AACrC0D,kCAAUzD,mBAAI4C,QAAQ7C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAIoD,SAASpD,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAK8C,MAAMsC,OAAiB,CAACC,QAAQxE,SAAAA;AAC1C,UAAMyE,QAAQrF,mBAAImC,sBAAsBvB,IAAAA,EAErC0E,OAAO,CAACC,MAAMvF,mBAAIQ,UAAU+E,EAAE3E,IAAI,CAAA,EAClC4E,IAAI,CAACD,MAAMA,EAAElD,KAAKC,SAAQ,CAAA;AAG7B,WAAO8C,OAAO1B,WAAW,IAAI2B,QAAQD,OAAOE,OAAO,CAACpD,SAASmD,MAAMI,SAASvD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMwD,uBAAuB,CAAC3F,MAAe0E,QAA6B,CAAC,MAAC;AACjFhB,kCAAUzD,mBAAI4C,QAAQ7C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB0D,kCAAUgB,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuBnF,IAAAA;AACrC,MAAI,CAACsF,OAAO3B,QAAQ;AAClB;EACF;AAGA,aAAW9C,QAAQb,KAAK8C,OAAO;AAC7B,UAAM8C,QAAQ3F,mBAAImC,sBAAsBvB,IAAAA,EACrC0E,OAAO,CAACpD,SAASmD,OAAOI,SAASvD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnD2C,MAAM,CAAC/C,SAAAA;AACNuB,sCAAUzD,mBAAIQ,UAAU0B,KAAKtB,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOsB,KAAKtB,KAAKgF,YAAYnB,MAAMvC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIqD,OAAO;AACT,aAAO/E;IACT;EACF;AAKA,QAAMiF,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACtD,SAAAA;AACJ,UAAM8D,WAAWjG,KAAK8C,MACnB2C,IAAI,CAAC5E,SAAAA;AACJ,YAAMgF,UAAU5F,mBAAImC,sBAAsBvB,IAAAA,EAAMqF,KAAK,CAACV,MAAMA,EAAElD,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFuB,sCAAUzD,mBAAIQ,UAAUoF,QAAQhF,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOgF,QAAQhF,KAAKgF;IACtB,CAAA,EACCN,OAAOY,uBAAAA;AAEV,WAAOF,SAAStC,SAAS;MAACxB;MAAMjB,eAAAA,OAAEkF,QAAO,GAAIH,QAAAA;QAAa/D;EAC5D,CAAA,EACCqD,OAAOY,uBAAAA,CAAAA;AAGZ,QAAM7C,SAASpC,eAAAA,OAAEmF,OAAOP,MAAAA;AACxB,SAAOxC,OAAOM;AAChB;AAOO,IAAM0C,SAAS,CAAC1C,KAAc2C,MAAAA;AACnC,UAAQ3C,IAAIe,MAAI;IACd,KAAK;AACH,aAAO,IAAI1E,mBAAIuG,YACb5C,IAAI6C,mBAAmBhB,IACrB,CAACtD,SACC,IAAIlC,mBAAIyG,kBAAkBvE,KAAKG,MAAMiE,EAAEpE,KAAKtB,IAAI,GAAGsB,KAAKwE,YAAYxE,KAAKyE,YAAYzE,KAAKyC,WAAW,CAAA,GAEzGhB,IAAIiD,eAAe;IAEvB,KAAK;AACH,aAAO5G,mBAAI6G,MAAMC,KAAKnD,IAAId,MAAM2C,IAAIc,CAAAA,GAAI3C,IAAIgB,WAAW;IACzD,KAAK;AACH,aAAO,IAAI3E,mBAAI+G,UACbpD,IAAIjB,SAAS8C,IAAI,CAACwB,MAAM,IAAIhH,mBAAIiH,aAAaX,EAAEU,EAAEpG,IAAI,GAAGoG,EAAEN,YAAYM,EAAErC,WAAW,CAAA,GACnFhB,IAAIJ,KAAKiC,IAAI,CAACwB,MAAM,IAAIhH,mBAAIkH,KAAKZ,EAAEU,EAAEpG,IAAI,GAAGoG,EAAErC,WAAW,CAAA,GACzDhB,IAAIgD,YACJhD,IAAIgB,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMwC,SAASb,EAAE3C,IAAI2C,EAAC,CAAA;AACtB,aAAO,IAAItG,mBAAIoH,QAAQ,MAAMD,QAAQxD,IAAIgB,WAAW;IACtD;IACA;AAEE,aAAOhB;EACX;AACF;ACjbA,IAAM0D,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXxH,eAAAA,IAAIkE,cAAuCmD,oBAAAA;AAEtC,IAAMI,qBACX,CAAChD,UACD,CAA4BiD,SAC1BA,KAAK/C,YAAY;EAAE,CAAC0C,oBAAAA,GAAuB5C;AAAM,CAAA;AAM9C,IAAMkD,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOjC,OAAOnD,QAAQ,KAAKkF,QAAQhC,MAAM,EAAEV,OAA4B,CAAC+C,QAAQ,CAACC,KAAKvH,IAAAA,MAAK;AACzF,UAAI6D,QAAQuD,IAAII,aAAaC,QAAIC,yBAAWH,GAAAA,CAAAA;AAC5C,UAAI1D,SAAS,MAAM;AACjBA,gBAAQuD,IAAII,aAAaC,IAAIF,GAAAA;MAC/B;AAEA,UAAI1D,SAAS,MAAM;AACjB,YAAIzE,eAAAA,IAAIK,gBAAgBO,KAAK+C,GAAG,GAAG;AACjCuE,iBAAOC,GAAAA,IAAOI,SAAS9D,KAAAA;QACzB,WAAWzE,eAAAA,IAAIM,iBAAiBM,KAAK+C,GAAG,GAAG;AACzCuE,iBAAOC,GAAAA,IAAO1D,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACLyD,iBAAOC,GAAAA,IAAO1D;QAChB;MACF;AAEA,aAAOyD;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAM,OAAOT,MAAcG,QAAgB;AACnC,UAAMF,MAAM,IAAIC,IAAIF,IAAAA;AACpBjC,WAAOnD,QAAQuF,MAAAA,EAAQO,QAAQ,CAAC,CAACN,KAAK1D,KAAAA,MAAM;AAC1C,UAAIA,UAAUxC,QAAW;AACvB,cAAMyG,QAAQ,KAAKb,QAAQhC,OAAOsC,GAAAA;AAClC,YAAIO,OAAO;AACT,gBAAM,EAAEP,KAAKQ,cAAa,QAAKxH,eAAAA,MAC7BqG,sBAAsBkB,MAAM/E,GAAG,GAC/BY,eAAAA,OAAOqE,UAAU,OAAO;YACtBT,SAAKG,yBAAWH,GAAAA;UAClB,EAAA,CAAA;AAGFH,cAAII,aAAaS,IAAIF,eAAeG,OAAOrE,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAOuD;EACT;AACF;",
-  "names": ["import_schema", "import_effect", "import_util", "getSimpleType", "node", "AST", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "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", "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", "id", "getIdentifierAnnotation", "Option", "getOrUndefined", "value", "_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"]
+  "sources": ["../../../src/index.ts", "../../../src/ast.ts", "../../../src/jsonPath.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 './jsonPath';\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 { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/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) || AST.isDeclaration(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\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n  CONTINUE = 0,\n  /**\n   * Skip visiting children.\n   */\n  SKIP = 1,\n  /**\n   * Stop traversing immediately.\n   */\n  EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: 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    // Title fallback seems to be the identifier.\n    const id = pipe(AST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: 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(isNonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(isNonNullable),\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, key: keyof any | undefined) => 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(\n              prop.name,\n              f(prop.type, prop.name),\n              prop.isOptional,\n              prop.isReadonly,\n              prop.annotations,\n            ),\n        ),\n        ast.indexSignatures,\n      );\n    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, index) => new AST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new AST.Type(f(t.type, undefined), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    case 'Suspend': {\n      const newAst = f(ast.f(), undefined);\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 2025 DXOS.org\n//\n\nimport { Schema as S } from '@effect/schema';\nimport { isSome } from 'effect/Option';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.String.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 const isJsonPath = (value: unknown): value is JsonPath => {\n  return isSome(S.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n  const candidatePath = path\n    .map((p, i) => {\n      if (typeof p === 'number') {\n        return `[${p}]`;\n      } else {\n        return i === 0 ? p : `.${p}`;\n      }\n    })\n    .join('');\n\n  invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n  return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g. \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n  // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n  const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n  invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n  return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n  if (!isJsonPath(path)) {\n    return [];\n  }\n\n  return (\n    path\n      .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n      ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n  );\n};\n", "//\n// 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,kBAA8B;ACJ9B,IAAAA,iBAA4B;AAC5B,oBAAuB;AAEvB,IAAAC,oBAA0B;ACH1B,IAAAD,iBAAsC;AACtC,IAAAE,iBAA6B;AAE7B,IAAAC,eAA2B;;AFiBpB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIC,mBAAIC,gBAAgBF,IAAAA,KAASC,mBAAIE,cAAcH,IAAAA,KAASI,qBAAqBJ,IAAAA,KAASC,mBAAII,cAAcL,IAAAA,GAAO;AACjH,WAAO;EACT;AAEA,MAAIC,mBAAIK,gBAAgBN,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIM,gBAAgBP,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIC,mBAAIO,iBAAiBR,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIC,mBAAIQ,QAAQT,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIC,mBAAIS,UAAUV,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMW,eAAe,CAACX,SAA2B,CAAC,CAACD,cAAcC,IAAAA;;UAEvDY,aAAAA;AAIdA,cACYC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;;UA8BLI,cAAAA;;AAITA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIAA,eAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,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,MAAIvB,mBAAIE,cAAcH,IAAAA,GAAO;AAC3B,eAAW4B,QAAQ3B,mBAAI4B,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM8B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSzB,mBAAIgC,YAAYjC,IAAAA,GAAO;AAC9B,eAAW,CAACkC,GAAGC,OAAAA,KAAYnC,KAAKoC,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQrB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSzB,mBAAIqC,QAAQtC,IAAAA,GAAO;AAC1B,eAAWc,QAAQd,KAAKuC,OAAO;AAC7B,YAAMb,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSzB,mBAAIuC,aAAaxC,IAAAA,GAAO;AAC/B,UAAM0B,UAASL,UAAUrB,KAAKyC,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAAC1C,MAAesB,SAAAA;AACtC,MAAIA,KAAKtB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSC,mBAAIE,cAAcH,IAAAA,GAAO;AAChC,eAAW4B,QAAQ3B,mBAAI4B,sBAAsB7B,IAAAA,GAAO;AAClD,YAAM2C,QAAQD,SAASd,KAAKd,MAAMQ,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS1C,mBAAIgC,YAAYjC,IAAAA,GAAO;AAC9B,eAAW,CAAC4C,GAAGT,OAAAA,KAAYnC,KAAKoC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQrB,MAAMQ,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGS1C,mBAAIqC,QAAQtC,IAAAA,GAAO;AAC1B,QAAI6C,SAAS7C,IAAAA,GAAO;AAClB,iBAAWc,QAAQd,KAAKuC,OAAO;AAC7B,cAAMI,QAAQD,SAAS5B,MAAMQ,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGS1C,mBAAIuC,aAAaxC,IAAAA,GAAO;AAC/B,WAAO0C,SAAS1C,KAAKyC,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAACC,QAAuBxB,SAAAA;AAClD,QAAMyB,UAAU,CAAChD,MAAeuB,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAAS1C,MAAMC,mBAAIE,aAAa;AACjDgD,oCAAUD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQ3B,mBAAI4B,sBAAsBqB,QAAAA,GAAW;AACtD,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKG,QAAQ;AACf,iBAAOJ,QAAQpB,KAAKd,MAAMmC,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOkC,QAAQD,OAAOM,KAAK9B,KAAK+B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2BtD,mBAAIuD;EAChC,CAAC,eAAA,GAA2BvD,mBAAIwD;EAChC,CAAC,eAAA,GAA2BxD,mBAAIyD;EAChC,CAAC,gBAAA,GAA4BzD,mBAAI0D;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC9D,SAAAA;AAEC,QAAM+D,SAAKC,oBAAK/D,mBAAIgE,wBAAwBjE,IAAAA,GAAOkE,qBAAOC,cAAc;AACxE,QAAMC,YAAQJ,oBAAK/D,mBAAI2D,cAAiBC,YAAAA,EAAc7D,IAAAA,GAAOkE,qBAAOC,cAAc;AAClF,MAAIL,cAAcM,UAAUb,mBAAmBvD,KAAKqE,IAAI,GAAGC,YAAYT,YAAAA,KAAiBO,UAAUL,KAAK;AACrG,WAAOpC;EACT;AAEA,SAAOyC;AACT;AAOK,IAAMG,iBAAiB,CAAIvE,MAAe6D,cAAsBC,YAAY,SAAI;AACrF,QAAMU,oBAAoBZ,cAAcC,cAAcC,SAAAA;AAEtD,QAAMW,oBAAoB,CAACzE,UAAAA;AACzB,UAAMoE,QAAQI,kBAAkBxE,KAAAA;AAChC,QAAIoE,UAAUzC,QAAW;AACvB,aAAOyC;IACT;AAEA,QAAInE,mBAAIqC,QAAQtC,KAAAA,GAAO;AACrB,UAAI6C,SAAS7C,KAAAA,GAAO;AAClB,eAAOwE,kBAAkBxE,MAAKuC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAOkC,kBAAkBzE,IAAAA;AAC3B;AASO,IAAM6C,WAAW,CAAC7C,SAAAA;AACvB,SAAOC,mBAAIqC,QAAQtC,IAAAA,KAASA,KAAKuC,MAAMa,WAAW,KAAKnD,mBAAIyE,mBAAmB1E,KAAKuC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAMoC,iBAAiB,CAAC3E,SAAAA;AAC7B,SAAOC,mBAAIqC,QAAQtC,IAAAA,KAASA,KAAKuC,MAAMqC,MAAM3E,mBAAIS,SAAS;AAC5D;AAKO,IAAMN,uBAAuB,CAACJ,SAAAA;AACnC,SAAOC,mBAAIqC,QAAQtC,IAAAA,KAAS,CAAC,CAAC6E,uBAAuB7E,IAAAA,GAAOoD;AAC9D;AAKO,IAAMyB,yBAAyB,CAAC7E,SAAAA;AACrCmD,kCAAUlD,mBAAIqC,QAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI6C,SAAS7C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKuC,MAAMuC,OAAiB,CAACC,QAAQjE,SAAAA;AAC1C,UAAMkE,QAAQ/E,mBAAI4B,sBAAsBf,IAAAA,EAErCmE,OAAO,CAACC,MAAMjF,mBAAIS,UAAUwE,EAAEpE,IAAI,CAAA,EAClCqE,IAAI,CAACD,MAAMA,EAAEnD,KAAKC,SAAQ,CAAA;AAG7B,WAAO+C,OAAO3B,WAAW,IAAI4B,QAAQD,OAAOE,OAAO,CAACrD,SAASoD,MAAMI,SAASxD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMyD,uBAAuB,CAACrF,MAAeoE,QAA6B,CAAC,MAAC;AACjFjB,kCAAUlD,mBAAIqC,QAAQtC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBmD,kCAAUiB,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuB7E,IAAAA;AACrC,MAAI,CAACgF,OAAO5B,QAAQ;AAClB;EACF;AAGA,aAAWtC,QAAQd,KAAKuC,OAAO;AAC7B,UAAM+C,QAAQrF,mBAAI4B,sBAAsBf,IAAAA,EACrCmE,OAAO,CAACrD,SAASoD,OAAOI,SAASxD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnD4C,MAAM,CAAChD,SAAAA;AACNuB,sCAAUlD,mBAAIS,UAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOc,KAAKd,KAAKyE,YAAYnB,MAAMxC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAIsD,OAAO;AACT,aAAOxE;IACT;EACF;AAKA,QAAM0E,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACvD,SAAAA;AACJ,UAAM+D,WAAW3F,KAAKuC,MACnB4C,IAAI,CAACrE,SAAAA;AACJ,YAAMyE,UAAUtF,mBAAI4B,sBAAsBf,IAAAA,EAAM8E,KAAK,CAACV,MAAMA,EAAEnD,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFuB,sCAAUlD,mBAAIS,UAAU6E,QAAQzE,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOyE,QAAQzE,KAAKyE;IACtB,CAAA,EACCN,OAAOY,yBAAAA;AAEV,WAAOF,SAASvC,SAAS;MAACxB;MAAMkE,eAAAA,OAAEC,QAAO,GAAIJ,QAAAA;QAAahE;EAC5D,CAAA,EACCsD,OAAOY,yBAAAA,CAAAA;AAGZ,QAAM9C,SAAS+C,eAAAA,OAAEE,OAAOR,MAAAA;AACxB,SAAOzC,OAAOM;AAChB;AAOO,IAAM4C,SAAS,CAAC5C,KAAc6C,MAAAA;AACnC,UAAQ7C,IAAIgB,MAAI;IACd,KAAK;AACH,aAAO,IAAIpE,mBAAIkG,YACb9C,IAAI+C,mBAAmBjB,IACrB,CAACvD,SACC,IAAI3B,mBAAIoG,kBACNzE,KAAKG,MACLmE,EAAEtE,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAK0E,YACL1E,KAAK2E,YACL3E,KAAK0C,WAAW,CAAA,GAGtBjB,IAAImD,eAAe;IAEvB,KAAK;AACH,aAAOvG,mBAAIwG,MAAMC,KAAKrD,IAAId,MAAM4C,IAAIe,CAAAA,GAAI7C,IAAIiB,WAAW;IACzD,KAAK;AACH,aAAO,IAAIrE,mBAAI0G,UACbtD,IAAIjB,SAAS+C,IAAI,CAACyB,GAAGC,UAAU,IAAI5G,mBAAI6G,aAAaZ,EAAEU,EAAE9F,MAAM+F,KAAAA,GAAQD,EAAEN,YAAYM,EAAEtC,WAAW,CAAA,GACjGjB,IAAIJ,KAAKkC,IAAI,CAACyB,MAAM,IAAI3G,mBAAI8G,KAAKb,EAAEU,EAAE9F,MAAMa,MAAAA,GAAYiF,EAAEtC,WAAW,CAAA,GACpEjB,IAAIkD,YACJlD,IAAIiB,WAAW;IAEnB,KAAK,WAAW;AACd,YAAM0C,SAASd,EAAE7C,IAAI6C,EAAC,GAAIvE,MAAAA;AAC1B,aAAO,IAAI1B,mBAAIgH,QAAQ,MAAMD,QAAQ3D,IAAIiB,WAAW;IACtD;IACA;AAEE,aAAOjB;EACX;AACF;;AC1aA,IAAM6D,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWtB,eAAAA,OAAEuB,OAAOrD,KAAK8B,eAAAA,OAAEwB,QAAQJ,UAAAA,CAAAA;AACzC,IAAMK,WAAWzB,eAAAA,OAAE0B,eAAexD,KAAK8B,eAAAA,OAAEwB,QAAQH,UAAAA,CAAAA;AAEjD,IAAMM,aAAa,CAACrD,UAAAA;AACzB,aAAOsD,sBAAO5B,eAAAA,OAAE6B,eAAeP,QAAAA,EAAUhD,KAAAA,CAAAA;AAC3C;AAqBO,IAAMwD,iBAAiB,CAACrG,SAAAA;AAC7B,QAAMsG,gBAAgBtG,KACnB4D,IAAI,CAACD,GAAGhD,MAAAA;AACP,QAAI,OAAOgD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOhD,MAAM,IAAIgD,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACC4C,KAAK,EAAA;AAER3E,wBAAAA,WAAUsE,WAAWI,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAME,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpD/E,wBAAAA,WAAUsE,WAAWQ,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAAC5G,SAAAA;AAC5B,MAAI,CAACkG,WAAWlG,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACG+D,MAAM,2BAAA,GACLH,IAAI,CAACiD,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKF,QAAQ,UAAU,EAAA,IAAME,IAAAA,KAAU,CAAA;AAErF;AC3EA,IAAME,uBAAuBC,OAAOC,IAAI,kCAAA;AAIjC,IAAMC,wBACXxI,eAAAA,IAAI2D,cAAuC0E,oBAAAA;AAEtC,IAAMI,qBACX,CAACtE,UACD,CAA4BuE,SAC1BA,KAAKrE,YAAY;EAAE,CAACgE,oBAAAA,GAAuBlE;AAAM,CAAA;AAM9C,IAAMwE,YAAN,MAAMA;EACXC,YAA6BC,SAAsB;SAAtBA,UAAAA;EAAuB;;;;EAKpDC,MAAMC,MAAiB;AACrB,UAAMC,MAAM,IAAIC,IAAIF,IAAAA;AACpB,WAAOvD,OAAOpD,QAAQ,KAAKyG,QAAQtD,MAAM,EAAEV,OAA4B,CAACqE,QAAQ,CAACC,KAAKtI,IAAAA,MAAK;AACzF,UAAIsD,QAAQ6E,IAAII,aAAaC,QAAIC,yBAAWH,GAAAA,CAAAA;AAC5C,UAAIhF,SAAS,MAAM;AACjBA,gBAAQ6E,IAAII,aAAaC,IAAIF,GAAAA;MAC/B;AAEA,UAAIhF,SAAS,MAAM;AACjB,YAAInE,eAAAA,IAAIM,gBAAgBO,KAAKuC,GAAG,GAAG;AACjC8F,iBAAOC,GAAAA,IAAOI,SAASpF,KAAAA;QACzB,WAAWnE,eAAAA,IAAIO,iBAAiBM,KAAKuC,GAAG,GAAG;AACzC8F,iBAAOC,GAAAA,IAAOhF,UAAU,UAAUA,UAAU;QAC9C,OAAO;AACL+E,iBAAOC,GAAAA,IAAOhF;QAChB;MACF;AAEA,aAAO+E;IACT,GAAG,CAAC,CAAA;EACN;;;;EAKAM,OAAOT,MAAcG,QAAgB;AACnC,UAAMF,MAAM,IAAIC,IAAIF,IAAAA;AACpBvD,WAAOpD,QAAQ8G,MAAAA,EAAQO,QAAQ,CAAC,CAACN,KAAKhF,KAAAA,MAAM;AAC1C,UAAIA,UAAUzC,QAAW;AACvB,cAAMgI,QAAQ,KAAKb,QAAQtD,OAAO4D,GAAAA;AAClC,YAAIO,OAAO;AACT,gBAAM,EAAEP,KAAKQ,cAAa,QAAK5F,eAAAA,MAC7ByE,sBAAsBkB,MAAMtG,GAAG,GAC/Ba,eAAAA,OAAO2F,UAAU,OAAO;YACtBT,SAAKG,yBAAWH,GAAAA;UAClB,EAAA,CAAA;AAGFH,cAAII,aAAaS,IAAIF,eAAevC,OAAOjD,KAAAA,CAAAA;QAC7C;MACF;IACF,CAAA;AAEA,WAAO6E;EACT;AACF;",
+  "names": ["import_schema", "import_invariant", "import_effect", "import_util", "getSimpleType", "node", "AST", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isDeclaration", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "invariant", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "pipe", "getIdentifierAnnotation", "Option", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "isUndefinedKeyword", "isLiteralUnion", "every", "getDiscriminatingProps", "reduce", "shared", "props", "filter", "p", "map", "includes", "getDiscriminatedType", "match", "literal", "fields", "Object", "fromEntries", "literals", "find", "isNonNullable", "S", "Literal", "Struct", "mapAst", "f", "TypeLiteral", "propertySignatures", "PropertySignature", "isOptional", "isReadonly", "indexSignatures", "Union", "make", "TupleType", "t", "index", "OptionalType", "Type", "newAst", "Suspend", "PATH_REGEX", "PROP_REGEX", "JsonPath", "String", "pattern", "JsonProp", "NonEmptyString", "isJsonPath", "isSome", "validateOption", "createJsonPath", "candidatePath", "join", "fromEffectValidationPath", "effectPath", "jsonPath", "replace", "splitJsonPath", "part", "startsWith", "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"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":41470,"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":25504},"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","SimpleType","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":8657},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":10886}}}
+{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":40604,"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/jsonPath.ts":{"bytes":8452,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"@dxos/invariant","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":1238,"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/jsonPath.ts","kind":"import-statement","original":"./jsonPath"},{"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":29103},"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/Option","kind":"import-statement","external":true},{"path":"@dxos/invariant","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","SimpleType","UrlParser","VisitResult","createJsonPath","findAnnotation","findNode","findProperty","fromEffectValidationPath","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isJsonPath","isLiteralUnion","isOption","isSimpleType","mapAst","splitJsonPath","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":8515},"packages/common/effect/src/jsonPath.ts":{"bytesInOutput":1558},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":12422}}}

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

@@ -1,16 +1,16 @@
 import { createRequire } from 'node:module';const require = createRequire(import.meta.url);
 
 // packages/common/effect/src/index.ts
-import { AST as AST3, JSONSchema, Schema as S2 } from "@effect/schema";
+import { AST as AST3, JSONSchema, Schema as S3 } from "@effect/schema";
 
 // packages/common/effect/src/ast.ts
 import { AST, Schema as S } from "@effect/schema";
 import { Option, pipe } from "effect";
 import { invariant } from "@dxos/invariant";
-import { nonNullable } from "@dxos/util";
+import { isNonNullable } from "@dxos/util";
 var __dxlog_file = "/home/runner/work/dxos/dxos/packages/common/effect/src/ast.ts";
 var getSimpleType = (node) => {
-  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node)) {
+  if (AST.isObjectKeyword(node) || AST.isTypeLiteral(node) || isDiscriminatedUnion(node) || AST.isDeclaration(node)) {
     return "object";
   }
   if (AST.isStringKeyword(node)) {
@@ -52,10 +52,6 @@ var SimpleType;
     }
   };
 })(SimpleType || (SimpleType = {}));
-var PATH_REGEX = /^[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*|\[\d+\])*$/;
-var PROP_REGEX = /\w+/;
-var JsonPath = S.NonEmptyString.pipe(S.pattern(PATH_REGEX));
-var JsonProp = S.NonEmptyString.pipe(S.pattern(PROP_REGEX));
 var VisitResult;
 (function(VisitResult2) {
   VisitResult2[VisitResult2["CONTINUE"] = 0] = "CONTINUE";
@@ -151,7 +147,7 @@ var findProperty = (schema, path) => {
     const typeNode = findNode(node, AST.isTypeLiteral);
     invariant(typeNode, void 0, {
       F: __dxlog_file,
-      L: 249,
+      L: 239,
       S: void 0,
       A: [
         "typeNode",
@@ -211,7 +207,7 @@ var isDiscriminatedUnion = (node) => {
 var getDiscriminatingProps = (node) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 346,
+    L: 336,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -229,7 +225,7 @@ var getDiscriminatingProps = (node) => {
 var getDiscriminatedType = (node, value = {}) => {
   invariant(AST.isUnion(node), void 0, {
     F: __dxlog_file,
-    L: 367,
+    L: 357,
     S: void 0,
     A: [
       "AST.isUnion(node)",
@@ -238,7 +234,7 @@ var getDiscriminatedType = (node, value = {}) => {
   });
   invariant(value, void 0, {
     F: __dxlog_file,
-    L: 368,
+    L: 358,
     S: void 0,
     A: [
       "value",
@@ -253,7 +249,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: 379,
+        L: 369,
         S: void 0,
         A: [
           "AST.isLiteral(prop.type)",
@@ -271,7 +267,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: 397,
+        L: 387,
         S: void 0,
         A: [
           "AST.isLiteral(literal.type)",
@@ -279,25 +275,25 @@ var getDiscriminatedType = (node, value = {}) => {
         ]
       });
       return literal.type.literal;
-    }).filter(nonNullable);
+    }).filter(isNonNullable);
     return literals.length ? [
       prop,
       S.Literal(...literals)
     ] : void 0;
-  }).filter(nonNullable));
+  }).filter(isNonNullable));
   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);
+      return new AST.TypeLiteral(ast.propertySignatures.map((prop) => new AST.PropertySignature(prop.name, f(prop.type, prop.name), 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);
+      return new AST.TupleType(ast.elements.map((t, index) => new AST.OptionalType(f(t.type, index), t.isOptional, t.annotations)), ast.rest.map((t) => new AST.Type(f(t.type, void 0), t.annotations)), ast.isReadonly, ast.annotations);
     case "Suspend": {
-      const newAst = f(ast.f());
+      const newAst = f(ast.f(), void 0);
       return new AST.Suspend(() => newAst, ast.annotations);
     }
     default:
@@ -305,6 +301,57 @@ var mapAst = (ast, f) => {
   }
 };
 
+// packages/common/effect/src/jsonPath.ts
+import { Schema as S2 } from "@effect/schema";
+import { isSome } from "effect/Option";
+import { invariant as invariant2 } from "@dxos/invariant";
+var __dxlog_file2 = "/home/runner/work/dxos/dxos/packages/common/effect/src/jsonPath.ts";
+var PATH_REGEX = /^($|[a-zA-Z_$][\w$]*(?:\.[a-zA-Z_$][\w$]*|\[\d+\](?:\.)?)*$)/;
+var PROP_REGEX = /\w+/;
+var JsonPath = S2.String.pipe(S2.pattern(PATH_REGEX));
+var JsonProp = S2.NonEmptyString.pipe(S2.pattern(PROP_REGEX));
+var isJsonPath = (value) => {
+  return isSome(S2.validateOption(JsonPath)(value));
+};
+var createJsonPath = (path) => {
+  const candidatePath = path.map((p, i) => {
+    if (typeof p === "number") {
+      return `[${p}]`;
+    } else {
+      return i === 0 ? p : `.${p}`;
+    }
+  }).join("");
+  invariant2(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`, {
+    F: __dxlog_file2,
+    L: 56,
+    S: void 0,
+    A: [
+      "isJsonPath(candidatePath)",
+      "`Invalid JsonPath: ${candidatePath}`"
+    ]
+  });
+  return candidatePath;
+};
+var fromEffectValidationPath = (effectPath) => {
+  const jsonPath = effectPath.replace(/\.\[(\d+)\]/g, "[$1]");
+  invariant2(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`, {
+    F: __dxlog_file2,
+    L: 67,
+    S: void 0,
+    A: [
+      "isJsonPath(jsonPath)",
+      "`Invalid JsonPath: ${jsonPath}`"
+    ]
+  });
+  return jsonPath;
+};
+var splitJsonPath = (path) => {
+  if (!isJsonPath(path)) {
+    return [];
+  }
+  return path.match(/[a-zA-Z_$][\w$]*|\[\d+\]/g)?.map((part) => part.startsWith("[") ? part.replace(/[[\]]/g, "") : part) ?? [];
+};
+
 // packages/common/effect/src/url.ts
 import { AST as AST2 } from "@effect/schema";
 import { Option as Option2, pipe as pipe2 } from "effect";
@@ -365,23 +412,27 @@ export {
   JsonPath,
   JsonProp,
   ParamKeyAnnotation,
-  S2 as S,
+  S3 as S,
   SimpleType,
   UrlParser,
   VisitResult,
+  createJsonPath,
   findAnnotation,
   findNode,
   findProperty,
+  fromEffectValidationPath,
   getAnnotation,
   getDiscriminatedType,
   getDiscriminatingProps,
   getParamKeyAnnotation,
   getSimpleType,
   isDiscriminatedUnion,
+  isJsonPath,
   isLiteralUnion,
   isOption,
   isSimpleType,
   mapAst,
+  splitJsonPath,
   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\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\])*$/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = 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    // Title fallback seems to be the identifier.\n    const id = pipe(AST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: 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;;UAEvDU,aAAAA;AAId,EAAAA,YACYC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;AAiCjB,IAAMI,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWtB,EAAEuB,eAAerB,KAAKF,EAAEwB,QAAQJ,UAAAA,CAAAA;AACjD,IAAMK,WAAWzB,EAAEuB,eAAerB,KAAKF,EAAEwB,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,cAAsBZ;AAQrB,IAAMa,QAGT,CAACtB,MAAeuB,eAAmCC,YAAAA;AACrD,MAAI,CAACA,SAAS;AACZC,cAAUzB,MAAMqB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUzB,MAAMuB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBzB,MACA0B,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAO1B,MAAM2B,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,YAAQxB,MAAM2B,MAAMC,KAAAA;EACtB;AAGA,MAAIpC,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAWgC,QAAQxC,IAAIyC,sBAAsBjC,IAAAA,GAAO;AAClD,YAAMkC,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKpB,MAAMc,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGStC,IAAI6C,YAAYrC,IAAAA,GAAO;AAC9B,eAAW,CAACsC,GAAGC,OAAAA,KAAYvC,KAAKwC,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQ3B,MAAMc,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGStC,IAAIkD,QAAQ1C,IAAAA,GAAO;AAC1B,eAAWY,QAAQZ,KAAK2C,OAAO;AAC7B,YAAMb,UAASL,UAAUb,MAAMc,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGStC,IAAIoD,aAAa5C,IAAAA,GAAO;AAC/B,UAAM8B,UAASL,UAAUzB,KAAK6C,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAAC9C,MAAe0B,SAAAA;AACtC,MAAIA,KAAK1B,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAWgC,QAAQxC,IAAIyC,sBAAsBjC,IAAAA,GAAO;AAClD,YAAM+C,QAAQD,SAASd,KAAKpB,MAAMc,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSvD,IAAI6C,YAAYrC,IAAAA,GAAO;AAC9B,eAAW,CAACgD,GAAGT,OAAAA,KAAYvC,KAAKwC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQ3B,MAAMc,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSvD,IAAIkD,QAAQ1C,IAAAA,GAAO;AAC1B,QAAIiD,SAASjD,IAAAA,GAAO;AAClB,iBAAWY,QAAQZ,KAAK2C,OAAO;AAC7B,cAAMI,QAAQD,SAASlC,MAAMc,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSvD,IAAIoD,aAAa5C,IAAAA,GAAO;AAC/B,WAAO8C,SAAS9C,KAAK6C,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAACC,QAAuBxB,SAAAA;AAClD,QAAMyB,UAAU,CAACpD,MAAe2B,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAAS9C,MAAMR,IAAIU,aAAa;AACjDL,cAAUyD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQxC,IAAIyC,sBAAsBqB,QAAAA,GAAW;AACtD,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKE,QAAQ;AACf,iBAAOH,QAAQpB,KAAKpB,MAAMyC,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKpB;QACd;MACF;IACF;EACF;AAEA,SAAOwC,QAAQD,OAAOK,KAAK7B,KAAK8B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2BlE,IAAImE;EAChC,CAAC,eAAA,GAA2BnE,IAAIoE;EAChC,CAAC,eAAA,GAA2BpE,IAAIqE;EAChC,CAAC,gBAAA,GAA4BrE,IAAIsE;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAACjE,SAAAA;AAEC,QAAMkE,KAAKtE,KAAKJ,IAAI2E,wBAAwBnE,IAAAA,GAAOL,OAAOyE,cAAc;AACxE,QAAMC,QAAQzE,KAAKJ,IAAIuE,cAAiBC,YAAAA,EAAchE,IAAAA,GAAOL,OAAOyE,cAAc;AAClF,MAAIH,cAAcI,UAAUX,mBAAmB1D,KAAKsE,IAAI,GAAGC,YAAYP,YAAAA,KAAiBK,UAAUH,KAAK;AACrG,WAAOnC;EACT;AAEA,SAAOsC;AACT;AAOK,IAAMG,iBAAiB,CAAIxE,MAAegE,cAAsBC,YAAY,SAAI;AACrF,QAAMQ,oBAAoBV,cAAcC,cAAcC,SAAAA;AAEtD,QAAMS,oBAAoB,CAAC1E,UAAAA;AACzB,UAAMqE,QAAQI,kBAAkBzE,KAAAA;AAChC,QAAIqE,UAAUtC,QAAW;AACvB,aAAOsC;IACT;AAEA,QAAI7E,IAAIkD,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,SAAOR,IAAIkD,QAAQ1C,IAAAA,KAASA,KAAK2C,MAAMY,WAAW,KAAK/D,IAAImF,mBAAmB3E,KAAK2C,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAMiC,iBAAiB,CAAC5E,SAAAA;AAC7B,SAAOR,IAAIkD,QAAQ1C,IAAAA,KAASA,KAAK2C,MAAMkC,MAAMrF,IAAIgB,SAAS;AAC5D;AAKO,IAAML,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAIkD,QAAQ1C,IAAAA,KAAS,CAAC,CAAC8E,uBAAuB9E,IAAAA,GAAOuD;AAC9D;AAKO,IAAMuB,yBAAyB,CAAC9E,SAAAA;AACrCH,YAAUL,IAAIkD,QAAQ1C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAIiD,SAASjD,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAK2C,MAAMoC,OAAiB,CAACC,QAAQpE,SAAAA;AAC1C,UAAMqE,QAAQzF,IAAIyC,sBAAsBrB,IAAAA,EAErCsE,OAAO,CAACC,MAAM3F,IAAIgB,UAAU2E,EAAEvE,IAAI,CAAA,EAClCwE,IAAI,CAACD,MAAMA,EAAEhD,KAAKC,SAAQ,CAAA;AAG7B,WAAO4C,OAAOzB,WAAW,IAAI0B,QAAQD,OAAOE,OAAO,CAAClD,SAASiD,MAAMI,SAASrD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMsD,uBAAuB,CAACtF,MAAeqE,QAA6B,CAAC,MAAC;AACjFxE,YAAUL,IAAIkD,QAAQ1C,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUwE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuB9E,IAAAA;AACrC,MAAI,CAACiF,OAAO1B,QAAQ;AAClB;EACF;AAGA,aAAW3C,QAAQZ,KAAK2C,OAAO;AAC7B,UAAM4C,QAAQ/F,IAAIyC,sBAAsBrB,IAAAA,EACrCsE,OAAO,CAAClD,SAASiD,OAAOI,SAASrD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDyC,MAAM,CAAC7C,SAAAA;AACNnC,gBAAUL,IAAIgB,UAAUwB,KAAKpB,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOoB,KAAKpB,KAAK4E,YAAYnB,MAAMrC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAImD,OAAO;AACT,aAAO3E;IACT;EACF;AAKA,QAAM6E,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACpD,SAAAA;AACJ,UAAM4D,WAAW5F,KAAK2C,MACnByC,IAAI,CAACxE,SAAAA;AACJ,YAAM4E,UAAUhG,IAAIyC,sBAAsBrB,IAAAA,EAAMiF,KAAK,CAACV,MAAMA,EAAEhD,KAAKC,SAAQ,MAAOJ,IAAAA;AAClFnC,gBAAUL,IAAIgB,UAAUgF,QAAQ5E,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAO4E,QAAQ5E,KAAK4E;IACtB,CAAA,EACCN,OAAOpF,WAAAA;AAEV,WAAO8F,SAASrC,SAAS;MAACvB;MAAMtC,EAAEoG,QAAO,GAAIF,QAAAA;QAAa7D;EAC5D,CAAA,EACCmD,OAAOpF,WAAAA,CAAAA;AAGZ,QAAMqD,SAASzD,EAAEqG,OAAON,MAAAA;AACxB,SAAOtC,OAAOK;AAChB;AAOO,IAAMwC,SAAS,CAACxC,KAAcyC,MAAAA;AACnC,UAAQzC,IAAIc,MAAI;IACd,KAAK;AACH,aAAO,IAAI9E,IAAI0G,YACb1C,IAAI2C,mBAAmBf,IACrB,CAACpD,SACC,IAAIxC,IAAI4G,kBAAkBpE,KAAKG,MAAM8D,EAAEjE,KAAKpB,IAAI,GAAGoB,KAAKqE,YAAYrE,KAAKsE,YAAYtE,KAAKuC,WAAW,CAAA,GAEzGf,IAAI+C,eAAe;IAEvB,KAAK;AACH,aAAO/G,IAAIgH,MAAMC,KAAKjD,IAAIb,MAAMyC,IAAIa,CAAAA,GAAIzC,IAAIe,WAAW;IACzD,KAAK;AACH,aAAO,IAAI/E,IAAIkH,UACblD,IAAIhB,SAAS4C,IAAI,CAACuB,MAAM,IAAInH,IAAIoH,aAAaX,EAAEU,EAAE/F,IAAI,GAAG+F,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACnFf,IAAIH,KAAK+B,IAAI,CAACuB,MAAM,IAAInH,IAAIqH,KAAKZ,EAAEU,EAAE/F,IAAI,GAAG+F,EAAEpC,WAAW,CAAA,GACzDf,IAAI8C,YACJ9C,IAAIe,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMuC,SAASb,EAAEzC,IAAIyC,EAAC,CAAA;AACtB,aAAO,IAAIzG,IAAIuH,QAAQ,MAAMD,QAAQtD,IAAIe,WAAW;IACtD;IACA;AAEE,aAAOf;EACX;AACF;;;ACtbA,SAASwD,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", "SimpleType", "getDefaultValue", "type", "Error", "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", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "getIdentifierAnnotation", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "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"]
+  "sources": ["../../../src/index.ts", "../../../src/ast.ts", "../../../src/jsonPath.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 './jsonPath';\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 { isNonNullable } from '@dxos/util';\n\nimport { type JsonPath, type JsonProp } from './jsonPath';\n\n//\n// Refs\n// https://effect.website/docs/schema/introduction\n// https://www.npmjs.com/package/@effect/schema\n// https://effect-ts.github.io/effect/schema/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) || AST.isDeclaration(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\nexport namespace SimpleType {\n  /**\n   * Returns the default empty value for a given SimpleType.\n   * Used for initializing new array values etc.\n   */\n  export const getDefaultValue = (type: SimpleType): any => {\n    switch (type) {\n      case 'string': {\n        return '';\n      }\n      case 'number': {\n        return 0;\n      }\n      case 'boolean': {\n        return false;\n      }\n      case 'object': {\n        return {};\n      }\n      default: {\n        throw new Error(`Unsupported type for default value: ${type}`);\n      }\n    }\n  };\n}\n\n//\n// Branded types\n//\n\nexport enum VisitResult {\n  CONTINUE = 0,\n  /**\n   * Skip visiting children.\n   */\n  SKIP = 1,\n  /**\n   * Stop traversing immediately.\n   */\n  EXIT = 2,\n}\n\nexport type Path = (string | number)[];\n\nexport type TestFn = (node: 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    // Title fallback seems to be the identifier.\n    const id = pipe(AST.getIdentifierAnnotation(node), Option.getOrUndefined);\n    const value = pipe(AST.getAnnotation<T>(annotationId)(node), Option.getOrUndefined);\n    if (noDefault && (value === defaultAnnotations[node._tag]?.annotations[annotationId] || value === id)) {\n      return undefined;\n    }\n\n    return value;\n  };\n\n/**\n * Recursively descend into AST to find first matching annotations.\n * Optionally skips default annotations for basic types (e.g., 'a string').\n */\n// TODO(burdon): Convert to effect pattern (i.e., return operator like getAnnotation).\nexport const findAnnotation = <T>(node: 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(isNonNullable);\n\n        return literals.length ? [prop, S.Literal(...literals)] : undefined;\n      })\n      .filter(isNonNullable),\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, key: keyof any | undefined) => 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(\n              prop.name,\n              f(prop.type, prop.name),\n              prop.isOptional,\n              prop.isReadonly,\n              prop.annotations,\n            ),\n        ),\n        ast.indexSignatures,\n      );\n    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, index) => new AST.OptionalType(f(t.type, index), t.isOptional, t.annotations)),\n        ast.rest.map((t) => new AST.Type(f(t.type, undefined), t.annotations)),\n        ast.isReadonly,\n        ast.annotations,\n      );\n    case 'Suspend': {\n      const newAst = f(ast.f(), undefined);\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 2025 DXOS.org\n//\n\nimport { Schema as S } from '@effect/schema';\nimport { isSome } from 'effect/Option';\n\nimport { invariant } from '@dxos/invariant';\n\nexport type JsonProp = string & { __JsonPath: true; __JsonProp: true };\nexport type JsonPath = string & { __JsonPath: true };\n\nconst PATH_REGEX = /^($|[a-zA-Z_$][\\w$]*(?:\\.[a-zA-Z_$][\\w$]*|\\[\\d+\\](?:\\.)?)*$)/;\nconst PROP_REGEX = /\\w+/;\n\n/**\n * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html\n */\nexport const JsonPath = S.String.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 const isJsonPath = (value: unknown): value is JsonPath => {\n  return isSome(S.validateOption(JsonPath)(value));\n};\n\n/**\n * Creates a JsonPath from an array of path segments.\n *\n * Currently supports:\n * - Simple property access (e.g., 'foo.bar')\n * - Array indexing with non-negative integers (e.g., 'foo[0]')\n * - Identifiers starting with letters, underscore, or $ (e.g., '$foo', '_bar')\n * - Dot notation for nested properties (e.g., 'foo.bar.baz')\n *\n * Does not support (yet?).\n * - Recursive descent (..)\n * - Wildcards (*)\n * - Array slicing\n * - Filters\n * - Negative indices\n *\n * @param path Array of string or number segments\n * @returns Valid JsonPath or undefined if invalid\n */\nexport const createJsonPath = (path: (string | number)[]): JsonPath => {\n  const candidatePath = path\n    .map((p, i) => {\n      if (typeof p === 'number') {\n        return `[${p}]`;\n      } else {\n        return i === 0 ? p : `.${p}`;\n      }\n    })\n    .join('');\n\n  invariant(isJsonPath(candidatePath), `Invalid JsonPath: ${candidatePath}`);\n  return candidatePath;\n};\n\n/**\n * Converts Effect validation path format (e.g. \"addresses.[0].zip\")\n * to JsonPath format (e.g. \"addresses[0].zip\")\n */\nexport const fromEffectValidationPath = (effectPath: string): JsonPath => {\n  // Handle array notation: convert \"prop.[0]\" to \"prop[0]\"\n  const jsonPath = effectPath.replace(/\\.\\[(\\d+)\\]/g, '[$1]');\n  invariant(isJsonPath(jsonPath), `Invalid JsonPath: ${jsonPath}`);\n  return jsonPath;\n};\n\n/**\n * Splits a JsonPath into its constituent parts.\n * Handles property access and array indexing.\n */\nexport const splitJsonPath = (path: JsonPath): string[] => {\n  if (!isJsonPath(path)) {\n    return [];\n  }\n\n  return (\n    path\n      .match(/[a-zA-Z_$][\\w$]*|\\[\\d+\\]/g)\n      ?.map((part) => (part.startsWith('[') ? part.replace(/[[\\]]/g, '') : part)) ?? []\n  );\n};\n", "//\n// 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,qBAAqB;;AAgBvB,IAAMC,gBAAgB,CAACC,SAAAA;AAC5B,MAAIR,IAAIS,gBAAgBD,IAAAA,KAASR,IAAIU,cAAcF,IAAAA,KAASG,qBAAqBH,IAAAA,KAASR,IAAIY,cAAcJ,IAAAA,GAAO;AACjH,WAAO;EACT;AAEA,MAAIR,IAAIa,gBAAgBL,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIc,gBAAgBN,IAAAA,GAAO;AAC7B,WAAO;EACT;AACA,MAAIR,IAAIe,iBAAiBP,IAAAA,GAAO;AAC9B,WAAO;EACT;AAEA,MAAIR,IAAIgB,QAAQR,IAAAA,GAAO;AACrB,WAAO;EACT;AAEA,MAAIR,IAAIiB,UAAUT,IAAAA,GAAO;AACvB,WAAO;EACT;AACF;AAEO,IAAMU,eAAe,CAACV,SAA2B,CAAC,CAACD,cAAcC,IAAAA;;UAEvDW,aAAAA;AAId,EAAAA,YACYC,kBAAkB,CAACC,SAAAA;AAC9B,YAAQA,MAAAA;MACN,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO;MACT;MACA,KAAK,WAAW;AACd,eAAO;MACT;MACA,KAAK,UAAU;AACb,eAAO,CAAC;MACV;MACA,SAAS;AACP,cAAM,IAAIC,MAAM,uCAAuCD,IAAAA,EAAM;MAC/D;IACF;EACF;AACF,GAxBiBF,eAAAA,aAAAA,CAAAA,EAAAA;;UA8BLI,cAAAA;;AAIT,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;AAIA,EAAAA,aAAAA,aAAA,MAAA,IAAA,CAAA,IAAA;GARSA,gBAAAA,cAAAA,CAAAA,EAAAA;AAkBZ,IAAMC,cAAsBN;AAQrB,IAAMO,QAGT,CAACjB,MAAekB,eAAmCC,YAAAA;AACrD,MAAI,CAACA,SAAS;AACZC,cAAUpB,MAAMgB,aAAaE,aAAAA;EAC/B,OAAO;AACLE,cAAUpB,MAAMkB,eAAyBC,OAAAA;EAC3C;AACF;AAEA,IAAMC,YAAY,CAChBpB,MACAqB,MACAF,SACAG,OAAa,CAAA,GACbC,QAAQ,MAAC;AAET,QAAMC,UAAUH,OAAOrB,MAAMsB,MAAMC,KAAAA;AACnC,QAAME,SACJD,YAAYE,SAAAA,IAER,OAAOF,YAAY,YACjBA,UAAAA,IAAAA,IAGAA;AAER,MAAIC,WAAAA,GAA6B;AAC/B,WAAOA;EACT;AACA,MAAIA,WAAAA,GAA6B;AAC/BN,YAAQnB,MAAMsB,MAAMC,KAAAA;EACtB;AAGA,MAAI/B,IAAIU,cAAcF,IAAAA,GAAO;AAC3B,eAAW2B,QAAQnC,IAAIoC,sBAAsB5B,IAAAA,GAAO;AAClD,YAAM6B,cAAc;WAAIP;QAAMK,KAAKG,KAAKC,SAAQ;;AAChD,YAAMN,UAASL,UAAUO,KAAKd,MAAMQ,MAAMF,SAASU,aAAaN,QAAQ,CAAA;AACxE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSjC,IAAIwC,YAAYhC,IAAAA,GAAO;AAC9B,eAAW,CAACiC,GAAGC,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMP,cAAc;WAAIP;QAAMW;;AAC9B,YAAMR,UAASL,UAAUc,QAAQrB,MAAMQ,MAAMF,SAASU,aAAaN,KAAAA;AACnE,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSjC,IAAI6C,QAAQrC,IAAAA,GAAO;AAC1B,eAAWa,QAAQb,KAAKsC,OAAO;AAC7B,YAAMb,UAASL,UAAUP,MAAMQ,MAAMF,SAASG,MAAMC,KAAAA;AACpD,UAAIE,YAAAA,GAA6B;AAC/B,eAAOA;MACT;IACF;EACF,WAGSjC,IAAI+C,aAAavC,IAAAA,GAAO;AAC/B,UAAMyB,UAASL,UAAUpB,KAAKwC,MAAMnB,MAAMF,SAASG,MAAMC,KAAAA;AACzD,QAAIE,YAAAA,GAA6B;AAC/B,aAAOA;IACT;EACF;AAGF;AAMO,IAAMgB,WAAW,CAACzC,MAAeqB,SAAAA;AACtC,MAAIA,KAAKrB,IAAAA,GAAO;AACd,WAAOA;EACT,WAGSR,IAAIU,cAAcF,IAAAA,GAAO;AAChC,eAAW2B,QAAQnC,IAAIoC,sBAAsB5B,IAAAA,GAAO;AAClD,YAAM0C,QAAQD,SAASd,KAAKd,MAAMQ,IAAAA;AAClC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSlD,IAAIwC,YAAYhC,IAAAA,GAAO;AAC9B,eAAW,CAAC2C,GAAGT,OAAAA,KAAYlC,KAAKmC,SAASC,QAAO,GAAI;AAClD,YAAMM,QAAQD,SAASP,QAAQrB,MAAMQ,IAAAA;AACrC,UAAIqB,OAAO;AACT,eAAOA;MACT;IACF;EACF,WAGSlD,IAAI6C,QAAQrC,IAAAA,GAAO;AAC1B,QAAI4C,SAAS5C,IAAAA,GAAO;AAClB,iBAAWa,QAAQb,KAAKsC,OAAO;AAC7B,cAAMI,QAAQD,SAAS5B,MAAMQ,IAAAA;AAC7B,YAAIqB,OAAO;AACT,iBAAOA;QACT;MACF;IACF;EACF,WAGSlD,IAAI+C,aAAavC,IAAAA,GAAO;AAC/B,WAAOyC,SAASzC,KAAKwC,MAAMnB,IAAAA;EAC7B;AACF;AAKO,IAAMwB,eAAe,CAACC,QAAuBxB,SAAAA;AAClD,QAAMyB,UAAU,CAAC/C,MAAesB,UAAAA;AAC9B,UAAM,CAACQ,MAAM,GAAGkB,IAAAA,IAAQ1B;AACxB,UAAM2B,WAAWR,SAASzC,MAAMR,IAAIU,aAAa;AACjDL,cAAUoD,UAAAA,QAAAA;;;;;;;;;AACV,eAAWtB,QAAQnC,IAAIoC,sBAAsBqB,QAAAA,GAAW;AACtD,UAAItB,KAAKG,SAASA,MAAM;AACtB,YAAIkB,KAAKE,QAAQ;AACf,iBAAOH,QAAQpB,KAAKd,MAAMmC,IAAAA;QAC5B,OAAO;AACL,iBAAOrB,KAAKd;QACd;MACF;IACF;EACF;AAEA,SAAOkC,QAAQD,OAAOK,KAAK7B,KAAK8B,MAAM,GAAA,CAAA;AACxC;AAMA,IAAMC,qBAAoD;EACxD,CAAC,eAAA,GAA2B7D,IAAI8D;EAChC,CAAC,eAAA,GAA2B9D,IAAI+D;EAChC,CAAC,eAAA,GAA2B/D,IAAIgE;EAChC,CAAC,gBAAA,GAA4BhE,IAAIiE;AACnC;AAOO,IAAMC,gBACX,CAAIC,cAAsBC,YAAY,SACtC,CAAC5D,SAAAA;AAEC,QAAM6D,KAAKjE,KAAKJ,IAAIsE,wBAAwB9D,IAAAA,GAAOL,OAAOoE,cAAc;AACxE,QAAMC,QAAQpE,KAAKJ,IAAIkE,cAAiBC,YAAAA,EAAc3D,IAAAA,GAAOL,OAAOoE,cAAc;AAClF,MAAIH,cAAcI,UAAUX,mBAAmBrD,KAAKiE,IAAI,GAAGC,YAAYP,YAAAA,KAAiBK,UAAUH,KAAK;AACrG,WAAOnC;EACT;AAEA,SAAOsC;AACT;AAOK,IAAMG,iBAAiB,CAAInE,MAAe2D,cAAsBC,YAAY,SAAI;AACrF,QAAMQ,oBAAoBV,cAAcC,cAAcC,SAAAA;AAEtD,QAAMS,oBAAoB,CAACrE,UAAAA;AACzB,UAAMgE,QAAQI,kBAAkBpE,KAAAA;AAChC,QAAIgE,UAAUtC,QAAW;AACvB,aAAOsC;IACT;AAEA,QAAIxE,IAAI6C,QAAQrC,KAAAA,GAAO;AACrB,UAAI4C,SAAS5C,KAAAA,GAAO;AAClB,eAAOoE,kBAAkBpE,MAAKsC,MAAM,CAAA,CAAE;MACxC;IACF;EACF;AAEA,SAAO+B,kBAAkBrE,IAAAA;AAC3B;AASO,IAAM4C,WAAW,CAAC5C,SAAAA;AACvB,SAAOR,IAAI6C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMY,WAAW,KAAK1D,IAAI8E,mBAAmBtE,KAAKsC,MAAM,CAAA,CAAE;AAC7F;AAKO,IAAMiC,iBAAiB,CAACvE,SAAAA;AAC7B,SAAOR,IAAI6C,QAAQrC,IAAAA,KAASA,KAAKsC,MAAMkC,MAAMhF,IAAIiB,SAAS;AAC5D;AAKO,IAAMN,uBAAuB,CAACH,SAAAA;AACnC,SAAOR,IAAI6C,QAAQrC,IAAAA,KAAS,CAAC,CAACyE,uBAAuBzE,IAAAA,GAAOkD;AAC9D;AAKO,IAAMuB,yBAAyB,CAACzE,SAAAA;AACrCH,YAAUL,IAAI6C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtB,MAAI4C,SAAS5C,IAAAA,GAAO;AAClB;EACF;AAGA,SAAOA,KAAKsC,MAAMoC,OAAiB,CAACC,QAAQ9D,SAAAA;AAC1C,UAAM+D,QAAQpF,IAAIoC,sBAAsBf,IAAAA,EAErCgE,OAAO,CAACC,MAAMtF,IAAIiB,UAAUqE,EAAEjE,IAAI,CAAA,EAClCkE,IAAI,CAACD,MAAMA,EAAEhD,KAAKC,SAAQ,CAAA;AAG7B,WAAO4C,OAAOzB,WAAW,IAAI0B,QAAQD,OAAOE,OAAO,CAAClD,SAASiD,MAAMI,SAASrD,IAAAA,CAAAA;EAC9E,GAAG,CAAA,CAAE;AACP;AAKO,IAAMsD,uBAAuB,CAACjF,MAAegE,QAA6B,CAAC,MAAC;AACjFnE,YAAUL,IAAI6C,QAAQrC,IAAAA,GAAAA,QAAAA;;;;;;;;;AACtBH,YAAUmE,OAAAA,QAAAA;;;;;;;;;AACV,QAAMY,QAAQH,uBAAuBzE,IAAAA;AACrC,MAAI,CAAC4E,OAAO1B,QAAQ;AAClB;EACF;AAGA,aAAWrC,QAAQb,KAAKsC,OAAO;AAC7B,UAAM4C,QAAQ1F,IAAIoC,sBAAsBf,IAAAA,EACrCgE,OAAO,CAAClD,SAASiD,OAAOI,SAASrD,KAAKG,KAAKC,SAAQ,CAAA,CAAA,EACnDyC,MAAM,CAAC7C,SAAAA;AACN9B,gBAAUL,IAAIiB,UAAUkB,KAAKd,IAAI,GAAA,QAAA;;;;;;;;;AACjC,aAAOc,KAAKd,KAAKsE,YAAYnB,MAAMrC,KAAKG,KAAKC,SAAQ,CAAA;IACvD,CAAA;AAEF,QAAImD,OAAO;AACT,aAAOrE;IACT;EACF;AAKA,QAAMuE,SAASC,OAAOC,YACpBV,MACGG,IAAI,CAACpD,SAAAA;AACJ,UAAM4D,WAAWvF,KAAKsC,MACnByC,IAAI,CAAClE,SAAAA;AACJ,YAAMsE,UAAU3F,IAAIoC,sBAAsBf,IAAAA,EAAM2E,KAAK,CAACV,MAAMA,EAAEhD,KAAKC,SAAQ,MAAOJ,IAAAA;AAClF9B,gBAAUL,IAAIiB,UAAU0E,QAAQtE,IAAI,GAAA,QAAA;;;;;;;;;AACpC,aAAOsE,QAAQtE,KAAKsE;IACtB,CAAA,EACCN,OAAO/E,aAAAA;AAEV,WAAOyF,SAASrC,SAAS;MAACvB;MAAMjC,EAAE+F,QAAO,GAAIF,QAAAA;QAAa7D;EAC5D,CAAA,EACCmD,OAAO/E,aAAAA,CAAAA;AAGZ,QAAMgD,SAASpD,EAAEgG,OAAON,MAAAA;AACxB,SAAOtC,OAAOK;AAChB;AAOO,IAAMwC,SAAS,CAACxC,KAAcyC,MAAAA;AACnC,UAAQzC,IAAIc,MAAI;IACd,KAAK;AACH,aAAO,IAAIzE,IAAIqG,YACb1C,IAAI2C,mBAAmBf,IACrB,CAACpD,SACC,IAAInC,IAAIuG,kBACNpE,KAAKG,MACL8D,EAAEjE,KAAKd,MAAMc,KAAKG,IAAI,GACtBH,KAAKqE,YACLrE,KAAKsE,YACLtE,KAAKuC,WAAW,CAAA,GAGtBf,IAAI+C,eAAe;IAEvB,KAAK;AACH,aAAO1G,IAAI2G,MAAMC,KAAKjD,IAAIb,MAAMyC,IAAIa,CAAAA,GAAIzC,IAAIe,WAAW;IACzD,KAAK;AACH,aAAO,IAAI1E,IAAI6G,UACblD,IAAIhB,SAAS4C,IAAI,CAACuB,GAAGC,UAAU,IAAI/G,IAAIgH,aAAaZ,EAAEU,EAAEzF,MAAM0F,KAAAA,GAAQD,EAAEN,YAAYM,EAAEpC,WAAW,CAAA,GACjGf,IAAIH,KAAK+B,IAAI,CAACuB,MAAM,IAAI9G,IAAIiH,KAAKb,EAAEU,EAAEzF,MAAMa,MAAAA,GAAY4E,EAAEpC,WAAW,CAAA,GACpEf,IAAI8C,YACJ9C,IAAIe,WAAW;IAEnB,KAAK,WAAW;AACd,YAAMwC,SAASd,EAAEzC,IAAIyC,EAAC,GAAIlE,MAAAA;AAC1B,aAAO,IAAIlC,IAAImH,QAAQ,MAAMD,QAAQvD,IAAIe,WAAW;IACtD;IACA;AAEE,aAAOf;EACX;AACF;;;AClbA,SAASyD,UAAUC,UAAS;AAC5B,SAASC,cAAc;AAEvB,SAASC,aAAAA,kBAAiB;;AAK1B,IAAMC,aAAa;AACnB,IAAMC,aAAa;AAKZ,IAAMC,WAAWL,GAAEM,OAAOC,KAAKP,GAAEQ,QAAQL,UAAAA,CAAAA;AACzC,IAAMM,WAAWT,GAAEU,eAAeH,KAAKP,GAAEQ,QAAQJ,UAAAA,CAAAA;AAEjD,IAAMO,aAAa,CAACC,UAAAA;AACzB,SAAOX,OAAOD,GAAEa,eAAeR,QAAAA,EAAUO,KAAAA,CAAAA;AAC3C;AAqBO,IAAME,iBAAiB,CAACC,SAAAA;AAC7B,QAAMC,gBAAgBD,KACnBE,IAAI,CAACC,GAAGC,MAAAA;AACP,QAAI,OAAOD,MAAM,UAAU;AACzB,aAAO,IAAIA,CAAAA;IACb,OAAO;AACL,aAAOC,MAAM,IAAID,IAAI,IAAIA,CAAAA;IAC3B;EACF,CAAA,EACCE,KAAK,EAAA;AAERlB,EAAAA,WAAUS,WAAWK,aAAAA,GAAgB,qBAAqBA,aAAAA,IAAe;;;;;;;;;AACzE,SAAOA;AACT;AAMO,IAAMK,2BAA2B,CAACC,eAAAA;AAEvC,QAAMC,WAAWD,WAAWE,QAAQ,gBAAgB,MAAA;AACpDtB,EAAAA,WAAUS,WAAWY,QAAAA,GAAW,qBAAqBA,QAAAA,IAAU;;;;;;;;;AAC/D,SAAOA;AACT;AAMO,IAAME,gBAAgB,CAACV,SAAAA;AAC5B,MAAI,CAACJ,WAAWI,IAAAA,GAAO;AACrB,WAAO,CAAA;EACT;AAEA,SACEA,KACGW,MAAM,2BAAA,GACLT,IAAI,CAACU,SAAUA,KAAKC,WAAW,GAAA,IAAOD,KAAKH,QAAQ,UAAU,EAAA,IAAMG,IAAAA,KAAU,CAAA;AAErF;;;AChFA,SAASE,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", "isNonNullable", "getSimpleType", "node", "isObjectKeyword", "isTypeLiteral", "isDiscriminatedUnion", "isDeclaration", "isStringKeyword", "isNumberKeyword", "isBooleanKeyword", "isEnums", "isLiteral", "isSimpleType", "SimpleType", "getDefaultValue", "type", "Error", "VisitResult", "defaultTest", "visit", "testOrVisitor", "visitor", "visitNode", "test", "path", "depth", "_result", "result", "undefined", "prop", "getPropertySignatures", "currentPath", "name", "toString", "isTupleType", "i", "element", "elements", "entries", "isUnion", "types", "isRefinement", "from", "findNode", "child", "_", "isOption", "findProperty", "schema", "getProp", "rest", "typeNode", "length", "ast", "split", "defaultAnnotations", "objectKeyword", "stringKeyword", "numberKeyword", "booleanKeyword", "getAnnotation", "annotationId", "noDefault", "id", "getIdentifierAnnotation", "getOrUndefined", "value", "_tag", "annotations", "findAnnotation", "getAnnotationById", "getBaseAnnotation", "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", "index", "OptionalType", "Type", "newAst", "Suspend", "Schema", "S", "isSome", "invariant", "PATH_REGEX", "PROP_REGEX", "JsonPath", "String", "pipe", "pattern", "JsonProp", "NonEmptyString", "isJsonPath", "value", "validateOption", "createJsonPath", "path", "candidatePath", "map", "p", "i", "join", "fromEffectValidationPath", "effectPath", "jsonPath", "replace", "splitJsonPath", "match", "part", "startsWith", "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":41470,"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":25506},"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","SimpleType","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":8657},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":10979}}}
+{"inputs":{"packages/common/effect/src/ast.ts":{"bytes":40604,"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/jsonPath.ts":{"bytes":8452,"imports":[{"path":"@effect/schema","kind":"import-statement","external":true},{"path":"effect/Option","kind":"import-statement","external":true},{"path":"@dxos/invariant","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":1238,"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/jsonPath.ts","kind":"import-statement","original":"./jsonPath"},{"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":29105},"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/Option","kind":"import-statement","external":true},{"path":"@dxos/invariant","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","SimpleType","UrlParser","VisitResult","createJsonPath","findAnnotation","findNode","findProperty","fromEffectValidationPath","getAnnotation","getDiscriminatedType","getDiscriminatingProps","getParamKeyAnnotation","getSimpleType","isDiscriminatedUnion","isJsonPath","isLiteralUnion","isOption","isSimpleType","mapAst","splitJsonPath","visit"],"entryPoint":"packages/common/effect/src/index.ts","inputs":{"packages/common/effect/src/index.ts":{"bytesInOutput":72},"packages/common/effect/src/ast.ts":{"bytesInOutput":8515},"packages/common/effect/src/jsonPath.ts":{"bytesInOutput":1558},"packages/common/effect/src/url.ts":{"bytesInOutput":1624}},"bytes":12515}}}

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

@@ -1,4 +1,5 @@
 import { AST, Schema as S } from '@effect/schema';
+import { type JsonPath, type JsonProp } from './jsonPath';
 export type SimpleType = 'object' | 'string' | 'number' | 'boolean' | 'enum' | 'literal';
 /**
  * Get the base type; e.g., traverse through refinements.
@@ -12,18 +13,6 @@ export declare namespace SimpleType {
      */
     const getDefaultValue: (type: SimpleType) => any;
 }
-export type JsonProp = string & {
-    __JsonPath: true;
-    __JsonProp: true;
-};
-export type JsonPath = string & {
-    __JsonPath: true;
-};
-/**
- * https://www.ietf.org/archive/id/draft-goessner-dispatch-jsonpath-00.html
- */
-export declare const JsonPath: S.Schema<JsonPath>;
-export declare const JsonProp: S.Schema<JsonProp>;
 export declare enum VisitResult {
     CONTINUE = 0,
     /**
@@ -92,5 +81,5 @@ export declare const getDiscriminatedType: (node: AST.AST, value?: Record<string
  * 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;
+export declare const mapAst: (ast: AST.AST, f: (ast: AST.AST, key: keyof any | undefined) => AST.AST) => AST.AST;
 //# sourceMappingURL=ast.d.ts.map