@_linked/core 2.36.1 → 2.36.3

package/lib/esm/queries/MutationSerialization.js.map

@@ -1 +1 @@
-{"version":3,"file":"MutationSerialization.js","sourceRoot":"","sources":["../../../src/queries/MutationSerialization.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAML,sBAAsB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAC,cAAc,EAAE,gBAAgB,EAAC,MAAM,kCAAkC,CAAC;AAGlF,OAAO,EAAC,mBAAmB,EAAC,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAC,uBAAuB,EAAE,kBAAkB,EAAC,MAAM,wBAAwB,CAAC;AAGnF,OAAO,EACL,eAAe,EACf,eAAe,GAEhB,MAAM,wBAAwB,CAAC;AAsChC,qDAAqD;AACrD,MAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,MAAM,cAAc,GAAG,SAAS,CAAC;AAmDjC,gFAAgF;AAChF,cAAc;AACd,gFAAgF;AAEhF,6FAA6F;AAC7F,MAAM,UAAU,YAAY,CAAC,IAAwB;;IACnD,MAAM,EAAE,GAAG,MAAC,IAA+C,aAA/C,IAAI,uBAAJ,IAAI,CAA6C,UAAU,0CAAE,EAAE,CAAC;IAC5E,OAAO,EAAE,CAAC,CAAC,CAAC,MAAA,kBAAkB,CAAC,EAAE,CAAC,0CAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AACxD,CAAC;AAED,kGAAkG;AAClG,SAAS,iBAAiB,CACxB,KAAgC,EAChC,IAAwB;IAExB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC;IACjD,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,2EAA2E;QAC3E,OAAO,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAsB,CAAC;IACrE,CAAC;IACD,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,WAAW,EAAE,EAAC,CAAC;IACjE,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,yEAAyE;QACzE,oFAAoF;QACpF,IAAI,KAAK,YAAY,mBAAmB,EAAE,CAAC;YACzC,OAAO,EAAC,MAAM,EAAE,KAAK,CAAC,WAAW,EAAC,CAAC;QACrC,CAAC;QACD,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YACtB,qFAAqF;YACrF,OAAO,cAAc,CAAC,KAA6B,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,IAAI,IAAI,KAAK;YAAE,OAAO,EAAC,KAAK,EAAG,KAA4B,CAAC,EAAE,EAAC,CAAC;IACtE,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC/E,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,WAAW,CACzB,KAAsB,EACtB,IAAwB;IAExB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAC,CAAC;IACjE,CAAC;IACD,IAAI,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,KAA6B,CAAC;QAC1C,MAAM,IAAI,GAAyD,EAAE,CAAC;QACtE,IAAI,GAAG,CAAC,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAoB,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1F,IAAI,GAAG,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,iBAAiB,CAAC,KAAkC,EAAE,IAAI,CAAC,CAAC;AACrE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA0B,EAC1B,aAA6B;IAE7B,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,IAAI,IAAI,CAAC,IAAI;QAAE,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IAC7C,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,EAAE,CAAC;QACzD,IAAI,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IACvC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,gEAAgE;AAChE,gFAAgF;AAEhF,iFAAiF;AACjF,sEAAsE;AACtE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,IAAuB,EACvB,YAAuC,EACvC,IAAwB;IAExB,IAAI,EAAE,YAAY,GAAG,gBAAgB,EAAE,CAAC;QACtC,YAAY,GAAG,CAAC,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC;QACH,OAAO,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IACzD,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,IAAuB,EACvB,YAAuC,EACvC,IAAwB;;IAExB,wBAAwB;IACxB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAC;QAC5F,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,sBAAsB;IACjE,MAAM,CAAC,GAAG,IAA+B,CAAC;IAC1C,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACpC,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAW,CAAC,CAAC;IACxD,yEAAyE;IACzE,sEAAsE;IACtE,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAW,CAAC,CAAC;IACrE,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAC,CAAC;IACtC,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAQ,CAAC,CAAC,OAAO,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QAClC,8DAA8D;QAC9D,MAAM,GAAG,GAA+C,EAAE,CAAC;QAC3D,IAAI,CAAC,CAAC,MAAM,CAAC;YAAE,GAAG,CAAC,GAAG,GAAI,CAAC,CAAC,MAAM,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;QAChH,IAAI,CAAC,CAAC,SAAS,CAAC;YAAE,GAAG,CAAC,MAAM,GAAI,CAAC,CAAC,SAAS,CAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,CAAC;QAC9E,OAAO,GAAG,CAAC;IACb,CAAC;IACD,qDAAqD;IACrD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAC;QAC5F,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,mDAAmD;IACnD,OAAO,yBAAyB,CAAC,CAAyB,EAAE,MAAA,YAAY,CAAC,IAAI,CAAC,mCAAI,YAAY,CAAC,CAAC;AAClG,CAAC;AAED;;;;;;GAMG;AACH;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,OAAe;IAC5C,MAAM,UAAU,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CACb,UAAU,OAAO,qGAAqG,CACvH,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,yBAAyB,CAChC,IAA0B,EAC1B,KAAgC;IAEhC,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACrC,IAAI,OAAO,OAAO,KAAK,QAAQ;QAAE,GAAG,CAAC,KAAK,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IAC5E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAgC;IAC3D,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAA0B,EAC1B,KAAqB;IAErB,MAAM,SAAS,GACb,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,QAAQ;QACtC,CAAC,CAAC,qBAAqB,CAAC,IAAI,CAAC,cAAc,CAAW,CAAC,CAAC,KAAK;QAC7D,CAAC,CAAC,KAAK,CAAC;IACZ,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ;QAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IACtE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACjF,+DAA+D;QAC/D,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,aAAa,IAAI,GAAG,KAAK,WAAW;YAAE,SAAS;QAClF,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtE,GAAG,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,GAAwB,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACzE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\n\n/**\n * Lossless JSON (de)serialization for mutations (create / update / delete) — the\n * **IR-free wire codec**. The companion IR side (`decodeNodeData` / `lowerMutationJSON`)\n * lives in `lowerMutationJSON.ts` so this module never pulls the canonical-IR pipeline.\n *\n * The serialization unit is the normalized `NodeDescriptionValue` produced by the\n * IR-free factory base (`MutationQueryFactory.describe()`) — i.e. after `.set()` and\n * after any update-expression callback has been evaluated, but before canonical IR.\n * Property keys are serialized as **labels** (shape-relative, lightweight); decoding\n * resolves them back via the registered shape.\n *\n * Values use the DSL-JSON grammar (documentation/dsl-json.md): a bare scalar is a\n * literal; objects tag the kinds `JSON.stringify` can't represent natively\n * (`{@date}`, `{@id}`, `{@ctx}`, `{@list}`, `{@add,@remove}`, `{@unset}`); and a\n * computed value is an S-expr array via the shared `DslJsonExpression` codec —\n * so the wire carries no IR.\n */\nimport {\n  type NodeDescriptionValue,\n  type NodeReferenceValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  isSetModificationValue,\n} from './QueryFactory.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {ExpressionNode, isExpressionNode} from '../expressions/ExpressionNode.js';\nimport type {WherePathJSON} from './QueryBuilderSerialization.js';\nimport type {ContextRefJSON} from './ContextRef.js';\nimport {PendingQueryContext} from './QueryContext.js';\nimport {resolveShapeConstructor, getQueryShapeClass} from '../utils/ShapeClass.js';\nimport type {ShapeConstructor} from '../shapes/Shape.js';\nimport type {NodeShapeData, PropertyShapeData} from '../shapes/SHACL.js';\nimport {\n  encodeValueExpr,\n  decodeValueExpr,\n  type DslJsonValue,\n} from './DslJsonExpression.js';\n\n// =============================================================================\n// JSON types\n// =============================================================================\n\n/**\n * A mutation field value in the DSL-JSON grammar. A bare scalar is a literal; objects\n * tag the non-JSON-native kinds (`@`-sigiled); a computed value is an S-expr array (no IR); a\n * nested-node create is a bare path-keyed object ({@link MutationNodeDataJSON}),\n * disambiguated from the tagged forms by having no reserved value-key.\n */\nexport type MutationValueJSON =\n  | string\n  | number\n  | boolean\n  | null\n  | {'@date': string}\n  | {'@id': string}\n  | {'@ctx': string}\n  | {'@list': MutationValueJSON[]}\n  | {'@add'?: MutationValueJSON[]; '@remove'?: string[]}\n  | {'@unset': true}\n  | MutationNodeDataJSON // nested-node create (bare, path-keyed)\n  | DslJsonValue; // computed expression (S-expr) / {@path}\n\n/**\n * A node description in **path-keyed** form: `label → value`, plus two reserved\n * keys — `__id` (a fixed/predefined id) and `__shape` (the concrete shape IRI,\n * emitted only when it differs from the shape inferred from context, e.g. a\n * subclass instance under a superclass-typed relation). Whether a nested node is\n * written as a blank node is not on the wire: the lowering decides it from the\n * property's `sh:nodeKind`.\n */\nexport type MutationNodeDataJSON = {\n  [key: string]: MutationValueJSON | undefined;\n};\n\n/** Reserved node-data keys (not property labels). */\nconst NODE_ID_KEY = '__id';\nconst NODE_SHAPE_KEY = '__shape';\n\nexport type CreateMutationJSON = {\n  v?: string;\n  op: 'create';\n  shape: string;\n  data: MutationNodeDataJSON;\n};\n\nexport type UpdateMutationJSON = {\n  v?: string;\n  op: 'update';\n  shape: string;\n  mode: 'for' | 'forAll' | 'where';\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  targetId?: string | ContextRefJSON;\n  where?: WherePathJSON;\n  data: MutationNodeDataJSON;\n};\n\n/**\n * Create-or-replace against a known id.\n *\n * A distinct `op` rather than `op: 'update'` with a new `mode`. An unaware consumer that\n * received `{op: 'update', mode: 'upsert'}` would fall past its `mode === 'for'` and\n * `mode === 'where'` branches into the update-where path with no where clause — an update\n * applied to *every instance of the shape*. A distinct op instead hits `fromJSON`'s\n * existing `default:` and throws \"Unknown query op\": loud, and safe.\n */\nexport type UpsertMutationJSON = {\n  v?: string;\n  op: 'upsert';\n  shape: string;\n  /** Upsert targets one known id; there is no `forAll`/`where` form. */\n  mode: 'for';\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  targetId?: string | ContextRefJSON;\n  data: MutationNodeDataJSON;\n};\n\nexport type DeleteMutationJSON =\n  | {v?: string; op: 'delete'; shape: string; mode: 'ids'; ids: (string | ContextRefJSON)[]}\n  | {v?: string; op: 'delete'; shape: string; mode: 'all'}\n  | {v?: string; op: 'delete'; shape: string; mode: 'where'; where: WherePathJSON};\n\nexport type MutationJSON =\n  | CreateMutationJSON\n  | UpdateMutationJSON\n  | UpsertMutationJSON\n  | DeleteMutationJSON;\n\n// =============================================================================\n// Value codec\n// =============================================================================\n\n/** The shape a nested node is expected to have (a property's value shape), if resolvable. */\nexport function valueShapeOf(prop?: PropertyShapeData): NodeShapeData | undefined {\n  const id = (prop as unknown as {valueShape?: {id: string}})?.valueShape?.id;\n  return id ? getQueryShapeClass(id)?.shape : undefined;\n}\n\n/** Encode a single (non-array, non-setMod) property value. `prop` gives the nested-node shape. */\nfunction encodeSingleValue(\n  value: SinglePropertyUpdateValue,\n  prop?: PropertyShapeData,\n): MutationValueJSON {\n  if (value === undefined) return {'@unset': true};\n  if (isExpressionNode(value)) {\n    // A computed value is an S-expr (or {@path}) via the shared codec — no IR.\n    return encodeValueExpr(value.ir, value._refs) as MutationValueJSON;\n  }\n  if (value instanceof Date) return {'@date': value.toISOString()};\n  if (\n    typeof value === 'string' ||\n    typeof value === 'number' ||\n    typeof value === 'boolean'\n  ) {\n    return value;\n  }\n  if (value && typeof value === 'object') {\n    // Query-context reference — carry the name, resolve at lowering (checked\n    // before the generic `.id` branch since a PendingQueryContext has an `.id` getter).\n    if (value instanceof PendingQueryContext) {\n      return {'@ctx': value.contextName};\n    }\n    if ('fields' in value) {\n      // Nested-node create — bare path-keyed; expected shape = the relation's value shape.\n      return encodeNodeData(value as NodeDescriptionValue, valueShapeOf(prop));\n    }\n    if ('id' in value) return {'@id': (value as NodeReferenceValue).id};\n  }\n  throw new Error(`Cannot serialize mutation value: ${JSON.stringify(value)}`);\n}\n\n/** Encode any property value, including arrays and set modifications. */\nexport function encodeValue(\n  value: PropUpdateValue,\n  prop?: PropertyShapeData,\n): MutationValueJSON {\n  if (value === undefined) return {'@unset': true};\n  if (Array.isArray(value)) {\n    return {'@list': value.map((v) => encodeSingleValue(v, prop))};\n  }\n  if (isSetModificationValue(value)) {\n    const mod = value as SetModificationValue;\n    const json: {'@add'?: MutationValueJSON[]; '@remove'?: string[]} = {};\n    if (mod.$add) json['@add'] = mod.$add.map((v) => encodeValue(v as PropUpdateValue, prop));\n    if (mod.$remove) json['@remove'] = mod.$remove.map((r) => r.id);\n    return json;\n  }\n  return encodeSingleValue(value as SinglePropertyUpdateValue, prop);\n}\n\n/**\n * Encode a normalized node description to path-keyed form. `expectedShape` is the\n * shape inferable from context (the envelope, or the parent relation's value shape);\n * `__shape` is emitted only when the concrete shape differs (a subclass instance).\n */\nexport function encodeNodeData(\n  desc: NodeDescriptionValue,\n  expectedShape?: NodeShapeData,\n): MutationNodeDataJSON {\n  const json: MutationNodeDataJSON = {};\n  if (desc.__id) json[NODE_ID_KEY] = desc.__id;\n  if (!expectedShape || desc.shape.id !== expectedShape.id) {\n    json[NODE_SHAPE_KEY] = desc.shape.id;\n  }\n  for (const f of desc.fields) {\n    json[f.prop.label] = encodeValue(f.val, f.prop);\n  }\n  return json;\n}\n\n// =============================================================================\n// JSON → raw UpdatePartial (for builder rehydration / fromJSON)\n// =============================================================================\n\n// Bound the DSL-JSON decode recursion (rehydration path) against a deeply-nested\n// payload exhausting the stack. Mirrors the cap in lowerMutationJSON.\nconst MAX_DECODE_DEPTH = 128;\nlet _decodeDepth = 0;\n\n/**\n * Decode a DSL-JSON value back to a raw DSL value (the form `.set()` accepts).\n * `currentShape` resolves computed `{@path}`/S-expr; `prop` gives a nested node's shape.\n * Depth-guarded wrapper around {@link decodeValueToRawInner}.\n */\nfunction decodeValueToRaw(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData | undefined,\n  prop?: PropertyShapeData,\n): unknown {\n  if (++_decodeDepth > MAX_DECODE_DEPTH) {\n    _decodeDepth = 0;\n    throw new Error('DSL-JSON value nested too deeply');\n  }\n  try {\n    return decodeValueToRawInner(json, currentShape, prop);\n  } finally {\n    _decodeDepth--;\n  }\n}\n\nfunction decodeValueToRawInner(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData | undefined,\n  prop?: PropertyShapeData,\n): unknown {\n  // S-expr computed value\n  if (Array.isArray(json)) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, requireShapeForExpr(currentShape));\n    return new ExpressionNode(ir, refs);\n  }\n  if (json === null) return null;\n  if (typeof json !== 'object') return json; // bare scalar literal\n  const o = json as Record<string, unknown>;\n  if ('@unset' in o) return undefined;\n  if ('@date' in o) return new Date(o['@date'] as string);\n  // Rehydration path: preserve the live reference so it re-serializes as a\n  // `{@ctx}` marker and resolves at the rebuilt builder's own lowering.\n  if ('@ctx' in o) return new PendingQueryContext(o['@ctx'] as string);\n  if ('@id' in o) return {id: o['@id']};\n  if ('@list' in o) {\n    return (o['@list'] as MutationValueJSON[]).map((i) => decodeValueToRaw(i, currentShape, prop));\n  }\n  if ('@add' in o || '@remove' in o) {\n    // Raw DSL set-modifications use `@add`/`@remove` on the wire.\n    const mod: {add?: unknown[]; remove?: {id: string}[]} = {};\n    if (o['@add']) mod.add = (o['@add'] as MutationValueJSON[]).map((i) => decodeValueToRaw(i, currentShape, prop));\n    if (o['@remove']) mod.remove = (o['@remove'] as string[]).map((id) => ({id}));\n    return mod;\n  }\n  // A computed-path value (`{@path}`) used as a value.\n  if ('@path' in o) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, requireShapeForExpr(currentShape));\n    return new ExpressionNode(ir, refs);\n  }\n  // Otherwise: a bare path-keyed nested-node create.\n  return decodeNestedNodeDataToRaw(o as MutationNodeDataJSON, valueShapeOf(prop) ?? currentShape);\n}\n\n/**\n * Decode a nested node and, when it names its concrete shape (`__shape`), carry that\n * shape as the reserved `shape` key `.set()` accepts on a nested value. Without it the\n * builders validate and lower the value against the property's declared value shape —\n * or none, for a polymorphic slot like `PropertyShape.path` — and reject the fields\n * only the concrete shape has.\n */\n/**\n * The class for a node's `__shape`. Either registry — a project-authored shape exists only\n * as metadata. Throws like `lowerMutationJSON` does, so both decode paths reject an\n * unregistered shape instead of one of them silently validating against another.\n */\nfunction requireNodeShapeClass(shapeId: string): ShapeConstructor {\n  const shapeClass = resolveShapeConstructor(shapeId);\n  if (!shapeClass) {\n    throw new Error(\n      `Shape '${shapeId}' is not registered. The receiving side must have the shape registered to decode mutation DSL-JSON.`,\n    );\n  }\n  return shapeClass;\n}\n\nfunction decodeNestedNodeDataToRaw(\n  json: MutationNodeDataJSON,\n  shape: NodeShapeData | undefined,\n): Record<string, unknown> {\n  const obj = decodeNodeDataToRaw(json, shape);\n  const shapeId = json[NODE_SHAPE_KEY];\n  if (typeof shapeId === 'string') obj.shape = requireNodeShapeClass(shapeId);\n  return obj;\n}\n\nfunction requireShapeForExpr(shape: NodeShapeData | undefined): NodeShapeData {\n  if (!shape) {\n    throw new Error('A shape is required to decode a computed mutation value');\n  }\n  return shape;\n}\n\n/**\n * Decode path-keyed node data into a raw object the mutation builders' `.set()` accepts.\n * `__id` becomes `id`; `__shape` (if present) overrides the inferred `shape`. Mirrors\n * {@link encodeNodeData}.\n */\nexport function decodeNodeDataToRaw(\n  json: MutationNodeDataJSON,\n  shape?: NodeShapeData,\n): Record<string, unknown> {\n  const nodeShape =\n    typeof json[NODE_SHAPE_KEY] === 'string'\n      ? requireNodeShapeClass(json[NODE_SHAPE_KEY] as string).shape\n      : shape;\n  const obj: Record<string, unknown> = {};\n  if (typeof json[NODE_ID_KEY] === 'string') obj.id = json[NODE_ID_KEY];\n  for (const [key, val] of Object.entries(json)) {\n    if (key === NODE_ID_KEY || key === NODE_SHAPE_KEY || val === undefined) continue;\n    // Skip prototype-polluting keys from untrusted DSL-JSON input.\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') continue;\n    const prop = nodeShape ? getPropertyShape(nodeShape, key) : undefined;\n    obj[key] = decodeValueToRaw(val as MutationValueJSON, nodeShape, prop);\n  }\n  return obj;\n}\n"]}
+{"version":3,"file":"MutationSerialization.js","sourceRoot":"","sources":["../../../src/queries/MutationSerialization.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAML,sBAAsB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAC,cAAc,EAAE,gBAAgB,EAAC,MAAM,kCAAkC,CAAC;AAGlF,OAAO,EAAC,mBAAmB,EAAC,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAC,uBAAuB,EAAE,kBAAkB,EAAC,MAAM,wBAAwB,CAAC;AAGnF,OAAO,EACL,eAAe,EACf,eAAe,GAEhB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAC,gBAAgB,EAAC,MAAM,yBAAyB,CAAC;AAsCzD,qDAAqD;AACrD,MAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,MAAM,cAAc,GAAG,SAAS,CAAC;AAmDjC,gFAAgF;AAChF,cAAc;AACd,gFAAgF;AAEhF,6FAA6F;AAC7F,MAAM,UAAU,YAAY,CAAC,IAAwB;;IACnD,MAAM,EAAE,GAAG,MAAC,IAA+C,aAA/C,IAAI,uBAAJ,IAAI,CAA6C,UAAU,0CAAE,EAAE,CAAC;IAC5E,OAAO,EAAE,CAAC,CAAC,CAAC,MAAA,kBAAkB,CAAC,EAAE,CAAC,0CAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AACxD,CAAC;AAED,kGAAkG;AAClG,SAAS,iBAAiB,CACxB,KAAgC,EAChC,IAAwB;IAExB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC;IACjD,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,2EAA2E;QAC3E,OAAO,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAsB,CAAC;IACrE,CAAC;IACD,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,WAAW,EAAE,EAAC,CAAC;IACjE,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS,EAC1B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,yEAAyE;QACzE,oFAAoF;QACpF,IAAI,gBAAgB,CAAC,KAAK,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACjD,OAAO,EAAC,MAAM,EAAE,KAAK,CAAC,WAAW,EAAC,CAAC;QACrC,CAAC;QACD,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YACtB,qFAAqF;YACrF,OAAO,cAAc,CAAC,KAA6B,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,IAAI,IAAI,KAAK;YAAE,OAAO,EAAC,KAAK,EAAG,KAA4B,CAAC,EAAE,EAAC,CAAC;IACtE,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC/E,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,WAAW,CACzB,KAAsB,EACtB,IAAwB;IAExB,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAC,CAAC;IACjE,CAAC;IACD,IAAI,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,KAA6B,CAAC;QAC1C,MAAM,IAAI,GAAyD,EAAE,CAAC;QACtE,IAAI,GAAG,CAAC,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAoB,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1F,IAAI,GAAG,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,iBAAiB,CAAC,KAAkC,EAAE,IAAI,CAAC,CAAC;AACrE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA0B,EAC1B,aAA6B;IAE7B,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,IAAI,IAAI,CAAC,IAAI;QAAE,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IAC7C,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,aAAa,CAAC,EAAE,EAAE,CAAC;QACzD,IAAI,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IACvC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,gEAAgE;AAChE,gFAAgF;AAEhF,iFAAiF;AACjF,sEAAsE;AACtE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,IAAuB,EACvB,YAAuC,EACvC,IAAwB;IAExB,IAAI,EAAE,YAAY,GAAG,gBAAgB,EAAE,CAAC;QACtC,YAAY,GAAG,CAAC,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC;QACH,OAAO,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IACzD,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,IAAuB,EACvB,YAAuC,EACvC,IAAwB;;IAExB,wBAAwB;IACxB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAC;QAC5F,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,sBAAsB;IACjE,MAAM,CAAC,GAAG,IAA+B,CAAC;IAC1C,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACpC,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAW,CAAC,CAAC;IACxD,yEAAyE;IACzE,sEAAsE;IACtE,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAW,CAAC,CAAC;IACrE,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAC,CAAC;IACtC,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAQ,CAAC,CAAC,OAAO,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QAClC,8DAA8D;QAC9D,MAAM,GAAG,GAA+C,EAAE,CAAC;QAC3D,IAAI,CAAC,CAAC,MAAM,CAAC;YAAE,GAAG,CAAC,GAAG,GAAI,CAAC,CAAC,MAAM,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;QAChH,IAAI,CAAC,CAAC,SAAS,CAAC;YAAE,GAAG,CAAC,MAAM,GAAI,CAAC,CAAC,SAAS,CAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,CAAC;QAC9E,OAAO,GAAG,CAAC;IACb,CAAC;IACD,qDAAqD;IACrD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAC;QAC5F,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,mDAAmD;IACnD,OAAO,yBAAyB,CAAC,CAAyB,EAAE,MAAA,YAAY,CAAC,IAAI,CAAC,mCAAI,YAAY,CAAC,CAAC;AAClG,CAAC;AAED;;;;;;GAMG;AACH;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,OAAe;IAC5C,MAAM,UAAU,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CACb,UAAU,OAAO,qGAAqG,CACvH,CAAC;IACJ,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,yBAAyB,CAChC,IAA0B,EAC1B,KAAgC;IAEhC,MAAM,GAAG,GAAG,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACrC,IAAI,OAAO,OAAO,KAAK,QAAQ;QAAE,GAAG,CAAC,KAAK,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IAC5E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAgC;IAC3D,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAA0B,EAC1B,KAAqB;IAErB,MAAM,SAAS,GACb,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,QAAQ;QACtC,CAAC,CAAC,qBAAqB,CAAC,IAAI,CAAC,cAAc,CAAW,CAAC,CAAC,KAAK;QAC7D,CAAC,CAAC,KAAK,CAAC;IACZ,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ;QAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IACtE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,cAAc,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACjF,+DAA+D;QAC/D,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,aAAa,IAAI,GAAG,KAAK,WAAW;YAAE,SAAS;QAClF,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtE,GAAG,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,GAAwB,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACzE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\n\n/**\n * Lossless JSON (de)serialization for mutations (create / update / delete) — the\n * **IR-free wire codec**. The companion IR side (`decodeNodeData` / `lowerMutationJSON`)\n * lives in `lowerMutationJSON.ts` so this module never pulls the canonical-IR pipeline.\n *\n * The serialization unit is the normalized `NodeDescriptionValue` produced by the\n * IR-free factory base (`MutationQueryFactory.describe()`) — i.e. after `.set()` and\n * after any update-expression callback has been evaluated, but before canonical IR.\n * Property keys are serialized as **labels** (shape-relative, lightweight); decoding\n * resolves them back via the registered shape.\n *\n * Values use the DSL-JSON grammar (documentation/dsl-json.md): a bare scalar is a\n * literal; objects tag the kinds `JSON.stringify` can't represent natively\n * (`{@date}`, `{@id}`, `{@ctx}`, `{@list}`, `{@add,@remove}`, `{@unset}`); and a\n * computed value is an S-expr array via the shared `DslJsonExpression` codec —\n * so the wire carries no IR.\n */\nimport {\n  type NodeDescriptionValue,\n  type NodeReferenceValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  isSetModificationValue,\n} from './QueryFactory.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {ExpressionNode, isExpressionNode} from '../expressions/ExpressionNode.js';\nimport type {WherePathJSON} from './QueryBuilderSerialization.js';\nimport type {ContextRefJSON} from './ContextRef.js';\nimport {PendingQueryContext} from './QueryContext.js';\nimport {resolveShapeConstructor, getQueryShapeClass} from '../utils/ShapeClass.js';\nimport type {ShapeConstructor} from '../shapes/Shape.js';\nimport type {NodeShapeData, PropertyShapeData} from '../shapes/SHACL.js';\nimport {\n  encodeValueExpr,\n  decodeValueExpr,\n  type DslJsonValue,\n} from './DslJsonExpression.js';\nimport {isLinkedInstance} from '../utils/linkedError.js';\n\n// =============================================================================\n// JSON types\n// =============================================================================\n\n/**\n * A mutation field value in the DSL-JSON grammar. A bare scalar is a literal; objects\n * tag the non-JSON-native kinds (`@`-sigiled); a computed value is an S-expr array (no IR); a\n * nested-node create is a bare path-keyed object ({@link MutationNodeDataJSON}),\n * disambiguated from the tagged forms by having no reserved value-key.\n */\nexport type MutationValueJSON =\n  | string\n  | number\n  | boolean\n  | null\n  | {'@date': string}\n  | {'@id': string}\n  | {'@ctx': string}\n  | {'@list': MutationValueJSON[]}\n  | {'@add'?: MutationValueJSON[]; '@remove'?: string[]}\n  | {'@unset': true}\n  | MutationNodeDataJSON // nested-node create (bare, path-keyed)\n  | DslJsonValue; // computed expression (S-expr) / {@path}\n\n/**\n * A node description in **path-keyed** form: `label → value`, plus two reserved\n * keys — `__id` (a fixed/predefined id) and `__shape` (the concrete shape IRI,\n * emitted only when it differs from the shape inferred from context, e.g. a\n * subclass instance under a superclass-typed relation). Whether a nested node is\n * written as a blank node is not on the wire: the lowering decides it from the\n * property's `sh:nodeKind`.\n */\nexport type MutationNodeDataJSON = {\n  [key: string]: MutationValueJSON | undefined;\n};\n\n/** Reserved node-data keys (not property labels). */\nconst NODE_ID_KEY = '__id';\nconst NODE_SHAPE_KEY = '__shape';\n\nexport type CreateMutationJSON = {\n  v?: string;\n  op: 'create';\n  shape: string;\n  data: MutationNodeDataJSON;\n};\n\nexport type UpdateMutationJSON = {\n  v?: string;\n  op: 'update';\n  shape: string;\n  mode: 'for' | 'forAll' | 'where';\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  targetId?: string | ContextRefJSON;\n  where?: WherePathJSON;\n  data: MutationNodeDataJSON;\n};\n\n/**\n * Create-or-replace against a known id.\n *\n * A distinct `op` rather than `op: 'update'` with a new `mode`. An unaware consumer that\n * received `{op: 'update', mode: 'upsert'}` would fall past its `mode === 'for'` and\n * `mode === 'where'` branches into the update-where path with no where clause — an update\n * applied to *every instance of the shape*. A distinct op instead hits `fromJSON`'s\n * existing `default:` and throws \"Unknown query op\": loud, and safe.\n */\nexport type UpsertMutationJSON = {\n  v?: string;\n  op: 'upsert';\n  shape: string;\n  /** Upsert targets one known id; there is no `forAll`/`where` form. */\n  mode: 'for';\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  targetId?: string | ContextRefJSON;\n  data: MutationNodeDataJSON;\n};\n\nexport type DeleteMutationJSON =\n  | {v?: string; op: 'delete'; shape: string; mode: 'ids'; ids: (string | ContextRefJSON)[]}\n  | {v?: string; op: 'delete'; shape: string; mode: 'all'}\n  | {v?: string; op: 'delete'; shape: string; mode: 'where'; where: WherePathJSON};\n\nexport type MutationJSON =\n  | CreateMutationJSON\n  | UpdateMutationJSON\n  | UpsertMutationJSON\n  | DeleteMutationJSON;\n\n// =============================================================================\n// Value codec\n// =============================================================================\n\n/** The shape a nested node is expected to have (a property's value shape), if resolvable. */\nexport function valueShapeOf(prop?: PropertyShapeData): NodeShapeData | undefined {\n  const id = (prop as unknown as {valueShape?: {id: string}})?.valueShape?.id;\n  return id ? getQueryShapeClass(id)?.shape : undefined;\n}\n\n/** Encode a single (non-array, non-setMod) property value. `prop` gives the nested-node shape. */\nfunction encodeSingleValue(\n  value: SinglePropertyUpdateValue,\n  prop?: PropertyShapeData,\n): MutationValueJSON {\n  if (value === undefined) return {'@unset': true};\n  if (isExpressionNode(value)) {\n    // A computed value is an S-expr (or {@path}) via the shared codec — no IR.\n    return encodeValueExpr(value.ir, value._refs) as MutationValueJSON;\n  }\n  if (value instanceof Date) return {'@date': value.toISOString()};\n  if (\n    typeof value === 'string' ||\n    typeof value === 'number' ||\n    typeof value === 'boolean'\n  ) {\n    return value;\n  }\n  if (value && typeof value === 'object') {\n    // Query-context reference — carry the name, resolve at lowering (checked\n    // before the generic `.id` branch since a PendingQueryContext has an `.id` getter).\n    if (isLinkedInstance(value, PendingQueryContext)) {\n      return {'@ctx': value.contextName};\n    }\n    if ('fields' in value) {\n      // Nested-node create — bare path-keyed; expected shape = the relation's value shape.\n      return encodeNodeData(value as NodeDescriptionValue, valueShapeOf(prop));\n    }\n    if ('id' in value) return {'@id': (value as NodeReferenceValue).id};\n  }\n  throw new Error(`Cannot serialize mutation value: ${JSON.stringify(value)}`);\n}\n\n/** Encode any property value, including arrays and set modifications. */\nexport function encodeValue(\n  value: PropUpdateValue,\n  prop?: PropertyShapeData,\n): MutationValueJSON {\n  if (value === undefined) return {'@unset': true};\n  if (Array.isArray(value)) {\n    return {'@list': value.map((v) => encodeSingleValue(v, prop))};\n  }\n  if (isSetModificationValue(value)) {\n    const mod = value as SetModificationValue;\n    const json: {'@add'?: MutationValueJSON[]; '@remove'?: string[]} = {};\n    if (mod.$add) json['@add'] = mod.$add.map((v) => encodeValue(v as PropUpdateValue, prop));\n    if (mod.$remove) json['@remove'] = mod.$remove.map((r) => r.id);\n    return json;\n  }\n  return encodeSingleValue(value as SinglePropertyUpdateValue, prop);\n}\n\n/**\n * Encode a normalized node description to path-keyed form. `expectedShape` is the\n * shape inferable from context (the envelope, or the parent relation's value shape);\n * `__shape` is emitted only when the concrete shape differs (a subclass instance).\n */\nexport function encodeNodeData(\n  desc: NodeDescriptionValue,\n  expectedShape?: NodeShapeData,\n): MutationNodeDataJSON {\n  const json: MutationNodeDataJSON = {};\n  if (desc.__id) json[NODE_ID_KEY] = desc.__id;\n  if (!expectedShape || desc.shape.id !== expectedShape.id) {\n    json[NODE_SHAPE_KEY] = desc.shape.id;\n  }\n  for (const f of desc.fields) {\n    json[f.prop.label] = encodeValue(f.val, f.prop);\n  }\n  return json;\n}\n\n// =============================================================================\n// JSON → raw UpdatePartial (for builder rehydration / fromJSON)\n// =============================================================================\n\n// Bound the DSL-JSON decode recursion (rehydration path) against a deeply-nested\n// payload exhausting the stack. Mirrors the cap in lowerMutationJSON.\nconst MAX_DECODE_DEPTH = 128;\nlet _decodeDepth = 0;\n\n/**\n * Decode a DSL-JSON value back to a raw DSL value (the form `.set()` accepts).\n * `currentShape` resolves computed `{@path}`/S-expr; `prop` gives a nested node's shape.\n * Depth-guarded wrapper around {@link decodeValueToRawInner}.\n */\nfunction decodeValueToRaw(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData | undefined,\n  prop?: PropertyShapeData,\n): unknown {\n  if (++_decodeDepth > MAX_DECODE_DEPTH) {\n    _decodeDepth = 0;\n    throw new Error('DSL-JSON value nested too deeply');\n  }\n  try {\n    return decodeValueToRawInner(json, currentShape, prop);\n  } finally {\n    _decodeDepth--;\n  }\n}\n\nfunction decodeValueToRawInner(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData | undefined,\n  prop?: PropertyShapeData,\n): unknown {\n  // S-expr computed value\n  if (Array.isArray(json)) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, requireShapeForExpr(currentShape));\n    return new ExpressionNode(ir, refs);\n  }\n  if (json === null) return null;\n  if (typeof json !== 'object') return json; // bare scalar literal\n  const o = json as Record<string, unknown>;\n  if ('@unset' in o) return undefined;\n  if ('@date' in o) return new Date(o['@date'] as string);\n  // Rehydration path: preserve the live reference so it re-serializes as a\n  // `{@ctx}` marker and resolves at the rebuilt builder's own lowering.\n  if ('@ctx' in o) return new PendingQueryContext(o['@ctx'] as string);\n  if ('@id' in o) return {id: o['@id']};\n  if ('@list' in o) {\n    return (o['@list'] as MutationValueJSON[]).map((i) => decodeValueToRaw(i, currentShape, prop));\n  }\n  if ('@add' in o || '@remove' in o) {\n    // Raw DSL set-modifications use `@add`/`@remove` on the wire.\n    const mod: {add?: unknown[]; remove?: {id: string}[]} = {};\n    if (o['@add']) mod.add = (o['@add'] as MutationValueJSON[]).map((i) => decodeValueToRaw(i, currentShape, prop));\n    if (o['@remove']) mod.remove = (o['@remove'] as string[]).map((id) => ({id}));\n    return mod;\n  }\n  // A computed-path value (`{@path}`) used as a value.\n  if ('@path' in o) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, requireShapeForExpr(currentShape));\n    return new ExpressionNode(ir, refs);\n  }\n  // Otherwise: a bare path-keyed nested-node create.\n  return decodeNestedNodeDataToRaw(o as MutationNodeDataJSON, valueShapeOf(prop) ?? currentShape);\n}\n\n/**\n * Decode a nested node and, when it names its concrete shape (`__shape`), carry that\n * shape as the reserved `shape` key `.set()` accepts on a nested value. Without it the\n * builders validate and lower the value against the property's declared value shape —\n * or none, for a polymorphic slot like `PropertyShape.path` — and reject the fields\n * only the concrete shape has.\n */\n/**\n * The class for a node's `__shape`. Either registry — a project-authored shape exists only\n * as metadata. Throws like `lowerMutationJSON` does, so both decode paths reject an\n * unregistered shape instead of one of them silently validating against another.\n */\nfunction requireNodeShapeClass(shapeId: string): ShapeConstructor {\n  const shapeClass = resolveShapeConstructor(shapeId);\n  if (!shapeClass) {\n    throw new Error(\n      `Shape '${shapeId}' is not registered. The receiving side must have the shape registered to decode mutation DSL-JSON.`,\n    );\n  }\n  return shapeClass;\n}\n\nfunction decodeNestedNodeDataToRaw(\n  json: MutationNodeDataJSON,\n  shape: NodeShapeData | undefined,\n): Record<string, unknown> {\n  const obj = decodeNodeDataToRaw(json, shape);\n  const shapeId = json[NODE_SHAPE_KEY];\n  if (typeof shapeId === 'string') obj.shape = requireNodeShapeClass(shapeId);\n  return obj;\n}\n\nfunction requireShapeForExpr(shape: NodeShapeData | undefined): NodeShapeData {\n  if (!shape) {\n    throw new Error('A shape is required to decode a computed mutation value');\n  }\n  return shape;\n}\n\n/**\n * Decode path-keyed node data into a raw object the mutation builders' `.set()` accepts.\n * `__id` becomes `id`; `__shape` (if present) overrides the inferred `shape`. Mirrors\n * {@link encodeNodeData}.\n */\nexport function decodeNodeDataToRaw(\n  json: MutationNodeDataJSON,\n  shape?: NodeShapeData,\n): Record<string, unknown> {\n  const nodeShape =\n    typeof json[NODE_SHAPE_KEY] === 'string'\n      ? requireNodeShapeClass(json[NODE_SHAPE_KEY] as string).shape\n      : shape;\n  const obj: Record<string, unknown> = {};\n  if (typeof json[NODE_ID_KEY] === 'string') obj.id = json[NODE_ID_KEY];\n  for (const [key, val] of Object.entries(json)) {\n    if (key === NODE_ID_KEY || key === NODE_SHAPE_KEY || val === undefined) continue;\n    // Skip prototype-polluting keys from untrusted DSL-JSON input.\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') continue;\n    const prop = nodeShape ? getPropertyShape(nodeShape, key) : undefined;\n    obj[key] = decodeValueToRaw(val as MutationValueJSON, nodeShape, prop);\n  }\n  return obj;\n}\n"]}

package/lib/esm/queries/PropertyPath.js

@@ -1,6 +1,7 @@
 import { getPropertyShape } from '../shapes/nodeShapeData.js';
 import { getQueryShapeClass } from '../utils/ShapeClass.js';
 import { unresolvedValueShapeError } from '../utils/unresolvedShape.js';
+import { brandLinkedClass } from '../utils/linkedError.js';
 /**
  * A value object representing a sequence of property traversals from a root shape.
  *
@@ -41,6 +42,7 @@ export class PropertyPath {
         return this.segments.every((s, i) => s.id === other.segments[i].id);
     }
 }
+brandLinkedClass(PropertyPath, '@_linked/core', 'PropertyPath');
 /**
  * Resolve a dot-separated property path string into a PropertyPath.
  *

package/lib/esm/queries/PropertyPath.js.map

@@ -1 +1 @@
-{"version":3,"file":"PropertyPath.js","sourceRoot":"","sources":["../../../src/queries/PropertyPath.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAC,kBAAkB,EAAC,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAC,yBAAyB,EAAC,MAAM,6BAA6B,CAAC;AAEtE;;;;;;;;;GASG;AACH,MAAM,OAAO,YAAY;IACvB,YACW,SAAwB,EACxB,QAAsC;QADtC,cAAS,GAAT,SAAS,CAAe;QACxB,aAAQ,GAAR,QAAQ,CAA8B;IAC9C,CAAC;IAEJ,qEAAqE;IACrE,IAAI,CAAC,QAA2B;QAC9B,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,+CAA+C;IAC/C,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,kEAAkE;IAClE,QAAQ;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,8FAA8F;IAC9F,MAAM,CAAC,KAAmB;QACxB,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,KAAK,CAAC,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACjE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtE,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAoB,EAAE,IAAY;IACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,IAAI,YAAY,GAAG,KAAK,CAAC;IAEzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,aAAa,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,aAAa,KAAK,yBAAyB,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,EAAE,2BAA2B,IAAI,GAAG,CACnH,CAAC;QACJ,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAE7B,+DAA+D;QAC/D,IAAI,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CACb,aAAa,KAAK,eAAe,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,EAAE,yDAAyD,IAAI,GAAG,CACvI,CAAC;YACJ,CAAC;YACD,MAAM,UAAU,GAAG,kBAAkB,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAChE,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,yBAAyB,CAC7B,8BAA8B,aAAa,CAAC,UAAU,CAAC,EAAE,mBAAmB,KAAK,cAAc,IAAI,GAAG,EACtG,aAAa,EACb,YAAY,CACb,CAAC;YACJ,CAAC;YACD,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC3C,CAAC","sourcesContent":["import type {PropertyShapeData, NodeShapeData} from '../shapes/SHACL.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {getQueryShapeClass} from '../utils/ShapeClass.js';\nimport {unresolvedValueShapeError} from '../utils/unresolvedShape.js';\n\n/**\n * A value object representing a sequence of property traversals from a root shape.\n *\n * Each segment is a PropertyShapeData representing one hop in the traversal.\n * For example, `friends.name` on PersonShape produces a PropertyPath with\n * two segments: [friendsPropertyShape, namePropertyShape].\n *\n * This is used by FieldSet and QueryBuilder to describe which properties\n * to select/filter, independent of proxy tracing.\n */\nexport class PropertyPath {\n  constructor(\n    readonly rootShape: NodeShapeData,\n    readonly segments: readonly PropertyShapeData[],\n  ) {}\n\n  /** Append a property traversal hop, returning a new PropertyPath. */\n  prop(property: PropertyShapeData): PropertyPath {\n    return new PropertyPath(this.rootShape, [...this.segments, property]);\n  }\n\n  /** The terminal (leaf) property of this path. */\n  get terminal(): PropertyShapeData | undefined {\n    return this.segments[this.segments.length - 1];\n  }\n\n  /** The depth (number of hops) of this path. */\n  get depth(): number {\n    return this.segments.length;\n  }\n\n  /** String representation using property labels joined by dots. */\n  toString(): string {\n    return this.segments.map((s) => s.label).join('.');\n  }\n\n  /** Two PropertyPaths are equal if they have the same root shape and same segment sequence. */\n  equals(other: PropertyPath): boolean {\n    if (this.rootShape.id !== other.rootShape.id) return false;\n    if (this.segments.length !== other.segments.length) return false;\n    return this.segments.every((s, i) => s.id === other.segments[i].id);\n  }\n}\n\n/**\n * Resolve a dot-separated property path string into a PropertyPath.\n *\n * Walks the shape's property shapes by label, following valueShape references\n * to traverse into nested shapes.\n *\n * Example: `walkPropertyPath(PersonShape, 'friends.name')` resolves\n * [friendsPropertyShape, namePropertyShape].\n *\n * @throws If any segment cannot be resolved.\n */\nexport function walkPropertyPath(shape: NodeShapeData, path: string): PropertyPath {\n  const labels = path.split('.');\n  const segments: PropertyShapeData[] = [];\n  let currentShape = shape;\n\n  for (const label of labels) {\n    const propertyShape = getPropertyShape(currentShape, label);\n    if (!propertyShape) {\n      throw new Error(\n        `Property '${label}' not found on shape '${currentShape.label || currentShape.id}' while resolving path '${path}'`,\n      );\n    }\n    segments.push(propertyShape);\n\n    // If there are more segments to resolve, follow the valueShape\n    if (segments.length < labels.length) {\n      if (!propertyShape.valueShape) {\n        throw new Error(\n          `Property '${label}' on shape '${currentShape.label || currentShape.id}' has no valueShape; cannot traverse further in path '${path}'`,\n        );\n      }\n      const shapeClass = getQueryShapeClass(propertyShape.valueShape);\n      if (!shapeClass || !shapeClass.shape) {\n        throw unresolvedValueShapeError(\n          `Cannot resolve valueShape '${propertyShape.valueShape.id}' for property '${label}' in path '${path}'`,\n          propertyShape,\n          currentShape,\n        );\n      }\n      currentShape = shapeClass.shape;\n    }\n  }\n\n  return new PropertyPath(shape, segments);\n}\n"]}
+{"version":3,"file":"PropertyPath.js","sourceRoot":"","sources":["../../../src/queries/PropertyPath.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAC,kBAAkB,EAAC,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAC,yBAAyB,EAAC,MAAM,6BAA6B,CAAC;AACtE,OAAO,EAAC,gBAAgB,EAAC,MAAM,yBAAyB,CAAC;AAEzD;;;;;;;;;GASG;AACH,MAAM,OAAO,YAAY;IACvB,YACW,SAAwB,EACxB,QAAsC;QADtC,cAAS,GAAT,SAAS,CAAe;QACxB,aAAQ,GAAR,QAAQ,CAA8B;IAC9C,CAAC;IAEJ,qEAAqE;IACrE,IAAI,CAAC,QAA2B;QAC9B,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,+CAA+C;IAC/C,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,kEAAkE;IAClE,QAAQ;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,8FAA8F;IAC9F,MAAM,CAAC,KAAmB;QACxB,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,KAAK,CAAC,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACjE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtE,CAAC;CACF;AACD,gBAAgB,CAAC,YAAY,EAAE,eAAe,EAAE,cAAc,CAAC,CAAC;AAGhE;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAoB,EAAE,IAAY;IACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAwB,EAAE,CAAC;IACzC,IAAI,YAAY,GAAG,KAAK,CAAC;IAEzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,aAAa,GAAG,gBAAgB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,aAAa,KAAK,yBAAyB,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,EAAE,2BAA2B,IAAI,GAAG,CACnH,CAAC;QACJ,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAE7B,+DAA+D;QAC/D,IAAI,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CACb,aAAa,KAAK,eAAe,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,EAAE,yDAAyD,IAAI,GAAG,CACvI,CAAC;YACJ,CAAC;YACD,MAAM,UAAU,GAAG,kBAAkB,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAChE,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,yBAAyB,CAC7B,8BAA8B,aAAa,CAAC,UAAU,CAAC,EAAE,mBAAmB,KAAK,cAAc,IAAI,GAAG,EACtG,aAAa,EACb,YAAY,CACb,CAAC;YACJ,CAAC;YACD,YAAY,GAAG,UAAU,CAAC,KAAK,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC3C,CAAC","sourcesContent":["import type {PropertyShapeData, NodeShapeData} from '../shapes/SHACL.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {getQueryShapeClass} from '../utils/ShapeClass.js';\nimport {unresolvedValueShapeError} from '../utils/unresolvedShape.js';\nimport {brandLinkedClass} from '../utils/linkedError.js';\n\n/**\n * A value object representing a sequence of property traversals from a root shape.\n *\n * Each segment is a PropertyShapeData representing one hop in the traversal.\n * For example, `friends.name` on PersonShape produces a PropertyPath with\n * two segments: [friendsPropertyShape, namePropertyShape].\n *\n * This is used by FieldSet and QueryBuilder to describe which properties\n * to select/filter, independent of proxy tracing.\n */\nexport class PropertyPath {\n  constructor(\n    readonly rootShape: NodeShapeData,\n    readonly segments: readonly PropertyShapeData[],\n  ) {}\n\n  /** Append a property traversal hop, returning a new PropertyPath. */\n  prop(property: PropertyShapeData): PropertyPath {\n    return new PropertyPath(this.rootShape, [...this.segments, property]);\n  }\n\n  /** The terminal (leaf) property of this path. */\n  get terminal(): PropertyShapeData | undefined {\n    return this.segments[this.segments.length - 1];\n  }\n\n  /** The depth (number of hops) of this path. */\n  get depth(): number {\n    return this.segments.length;\n  }\n\n  /** String representation using property labels joined by dots. */\n  toString(): string {\n    return this.segments.map((s) => s.label).join('.');\n  }\n\n  /** Two PropertyPaths are equal if they have the same root shape and same segment sequence. */\n  equals(other: PropertyPath): boolean {\n    if (this.rootShape.id !== other.rootShape.id) return false;\n    if (this.segments.length !== other.segments.length) return false;\n    return this.segments.every((s, i) => s.id === other.segments[i].id);\n  }\n}\nbrandLinkedClass(PropertyPath, '@_linked/core', 'PropertyPath');\n\n\n/**\n * Resolve a dot-separated property path string into a PropertyPath.\n *\n * Walks the shape's property shapes by label, following valueShape references\n * to traverse into nested shapes.\n *\n * Example: `walkPropertyPath(PersonShape, 'friends.name')` resolves\n * [friendsPropertyShape, namePropertyShape].\n *\n * @throws If any segment cannot be resolved.\n */\nexport function walkPropertyPath(shape: NodeShapeData, path: string): PropertyPath {\n  const labels = path.split('.');\n  const segments: PropertyShapeData[] = [];\n  let currentShape = shape;\n\n  for (const label of labels) {\n    const propertyShape = getPropertyShape(currentShape, label);\n    if (!propertyShape) {\n      throw new Error(\n        `Property '${label}' not found on shape '${currentShape.label || currentShape.id}' while resolving path '${path}'`,\n      );\n    }\n    segments.push(propertyShape);\n\n    // If there are more segments to resolve, follow the valueShape\n    if (segments.length < labels.length) {\n      if (!propertyShape.valueShape) {\n        throw new Error(\n          `Property '${label}' on shape '${currentShape.label || currentShape.id}' has no valueShape; cannot traverse further in path '${path}'`,\n        );\n      }\n      const shapeClass = getQueryShapeClass(propertyShape.valueShape);\n      if (!shapeClass || !shapeClass.shape) {\n        throw unresolvedValueShapeError(\n          `Cannot resolve valueShape '${propertyShape.valueShape.id}' for property '${label}' in path '${path}'`,\n          propertyShape,\n          currentShape,\n        );\n      }\n      currentShape = shapeClass.shape;\n    }\n  }\n\n  return new PropertyPath(shape, segments);\n}\n"]}

package/lib/esm/queries/ProxiedPathBuilder.js

@@ -1,5 +1,6 @@
 import { createShapeTarget } from '../shapes/Shape.js';
 import { QueryBuilderObject, QueryShape } from './SelectQuery.js';
+import { isLinkedInstance } from '../utils/linkedError.js';
 /**
  * Creates the proxy object used as the `p` parameter in query callbacks.
  *
@@ -12,7 +13,7 @@ import { QueryBuilderObject, QueryShape } from './SelectQuery.js';
  * across the DSL and dynamic query building.
  */
 export function createProxiedPathBuilder(shape) {
-    if (shape instanceof QueryBuilderObject) {
+    if (isLinkedInstance(shape, QueryBuilderObject)) {
         // When a QueryBuilderObject is passed directly (e.g. QueryPrimitives
         // used as the shape for where-clause evaluation), use it as-is.
         return shape;

package/lib/esm/queries/ProxiedPathBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"ProxiedPathBuilder.js","sourceRoot":"","sources":["../../../src/queries/ProxiedPathBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,iBAAiB,EAAwB,MAAM,oBAAoB,CAAC;AACnF,OAAO,EAAC,kBAAkB,EAAE,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEhE;;;;;;;;;;GAUG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAA+C;IAE/C,IAAI,KAAK,YAAY,kBAAkB,EAAE,CAAC;QACxC,qEAAqE;QACrE,gEAAgE;QAChE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2EAA2E;IAC3E,8EAA8E;IAC9E,yEAAyE;IACzE,oCAAoC;IACpC,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AACvC,CAAC","sourcesContent":["import {Shape, createShapeTarget, type ShapeConstructor} from '../shapes/Shape.js';\nimport {QueryBuilderObject, QueryShape} from './SelectQuery.js';\n\n/**\n * Creates the proxy object used as the `p` parameter in query callbacks.\n *\n * Property access on the returned proxy (e.g., `p.name`, `p.friends.name`)\n * creates QueryBuilderObject chains that trace the path of requested properties.\n * This is the shared foundation for both the DSL (`Person.select(p => p.name)`)\n * and the future QueryBuilder API.\n *\n * Originally extracted from SelectQueryFactory.getQueryShape() to enable reuse\n * across the DSL and dynamic query building.\n */\nexport function createProxiedPathBuilder<S extends Shape>(\n  shape: ShapeConstructor<S> | QueryBuilderObject,\n): QueryBuilderObject {\n  if (shape instanceof QueryBuilderObject) {\n    // When a QueryBuilderObject is passed directly (e.g. QueryPrimitives\n    // used as the shape for where-clause evaluation), use it as-is.\n    return shape;\n  }\n  // Create a constructor-less dummy shape target and wrap it in a QueryShape\n  // proxy. The proxy intercepts property access and resolves each property name\n  // to its PropertyShapeData, building a chain of QueryBuilderObjects that\n  // records which path was traversed.\n  const dummyShape = createShapeTarget(shape);\n  return QueryShape.create(dummyShape);\n}\n"]}
+{"version":3,"file":"ProxiedPathBuilder.js","sourceRoot":"","sources":["../../../src/queries/ProxiedPathBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,iBAAiB,EAAwB,MAAM,oBAAoB,CAAC;AACnF,OAAO,EAAC,kBAAkB,EAAE,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAChE,OAAO,EAAC,gBAAgB,EAAC,MAAM,yBAAyB,CAAC;AAEzD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAA+C;IAE/C,IAAI,gBAAgB,CAAC,KAAK,EAAE,kBAAkB,CAAC,EAAE,CAAC;QAChD,qEAAqE;QACrE,gEAAgE;QAChE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2EAA2E;IAC3E,8EAA8E;IAC9E,yEAAyE;IACzE,oCAAoC;IACpC,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;AACvC,CAAC","sourcesContent":["import {Shape, createShapeTarget, type ShapeConstructor} from '../shapes/Shape.js';\nimport {QueryBuilderObject, QueryShape} from './SelectQuery.js';\nimport {isLinkedInstance} from '../utils/linkedError.js';\n\n/**\n * Creates the proxy object used as the `p` parameter in query callbacks.\n *\n * Property access on the returned proxy (e.g., `p.name`, `p.friends.name`)\n * creates QueryBuilderObject chains that trace the path of requested properties.\n * This is the shared foundation for both the DSL (`Person.select(p => p.name)`)\n * and the future QueryBuilder API.\n *\n * Originally extracted from SelectQueryFactory.getQueryShape() to enable reuse\n * across the DSL and dynamic query building.\n */\nexport function createProxiedPathBuilder<S extends Shape>(\n  shape: ShapeConstructor<S> | QueryBuilderObject,\n): QueryBuilderObject {\n  if (isLinkedInstance(shape, QueryBuilderObject)) {\n    // When a QueryBuilderObject is passed directly (e.g. QueryPrimitives\n    // used as the shape for where-clause evaluation), use it as-is.\n    return shape;\n  }\n  // Create a constructor-less dummy shape target and wrap it in a QueryShape\n  // proxy. The proxy intercepts property access and resolves each property name\n  // to its PropertyShapeData, building a chain of QueryBuilderObjects that\n  // records which path was traversed.\n  const dummyShape = createShapeTarget(shape);\n  return QueryShape.create(dummyShape);\n}\n"]}

package/lib/esm/queries/QueryBuilder.js

@@ -22,7 +22,7 @@ import { createProxiedPathBuilder } from './ProxiedPathBuilder.js';
 import { serializeWherePath, serializeSortByPath, serializeRawMinusEntry, deserializeWherePath, deserializeSortByPath, deserializeRawMinusEntry, } from './QueryBuilderSerialization.js';
 import { requireLiveQueryStore } from '../live/registry.js';
 import { captureCatalog, getActiveShapeCatalog, withShapeCatalog } from '../utils/ShapeClass.js';
-import { isLinkedError } from '../utils/linkedError.js';
+import { brandLinkedClass, isLinkedError, isLinkedInstance } from '../utils/linkedError.js';
 /**
  * An immutable, fluent query builder for select queries.
  *
@@ -80,7 +80,7 @@ export class SelectBuilder {
         return new SelectBuilder({ shape: resolved });
     }
     select(fnOrLabelsOrFieldSet) {
-        if (fnOrLabelsOrFieldSet instanceof FieldSet) {
+        if (isLinkedInstance(fnOrLabelsOrFieldSet, FieldSet)) {
             const labels = fnOrLabelsOrFieldSet.labels();
             const selectFn = ((p) => labels.map((label) => p[label]));
             return this.clone({ selectFn, selectAllLabels: undefined, fieldSet: fnOrLabelsOrFieldSet });
@@ -152,7 +152,7 @@ export class SelectBuilder {
     }
     /** Target a single entity by ID. Implies singleResult; unwraps array Result type. */
     for(id) {
-        if (id instanceof PendingQueryContext) {
+        if (isLinkedInstance(id, PendingQueryContext)) {
             // Store the pending context as subject — its .id getter resolves lazily
             // from the global context map when the query is lowered/serialized.
             return this.clone({ subject: id, subjects: undefined, singleResult: true, _nullSubject: false, _pendingContextName: id.contextName });
@@ -345,7 +345,7 @@ export class SelectBuilder {
         // narrowing it to `{id}` here would silently resolve it against THIS process's
         // context map — and the query would then travel as a concrete IRI where the
         // equivalent select travels as `{"@ctx": name}` for the receiver to resolve.
-        const subject = this._subject instanceof PendingQueryContext
+        const subject = isLinkedInstance(this._subject, PendingQueryContext)
             ? this._subject
             : this._subject && typeof this._subject === 'object' && 'id' in this._subject
                 ? { id: this._subject.id }
@@ -770,6 +770,7 @@ export class SelectBuilder {
         return 'SelectBuilder';
     }
 }
+brandLinkedClass(SelectBuilder, '@_linked/core', 'SelectBuilder');
 /** @deprecated Renamed to `SelectBuilder`. This alias will be removed in a future major. */
 export { SelectBuilder as QueryBuilder };
 //# sourceMappingURL=QueryBuilder.js.map

package/lib/esm/queries/QueryBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"QueryBuilder.js","sourceRoot":"","sources":["../../../src/queries/QueryBuilder.ts"],"names":[],"mappings":";;;;;;;;;AACA,OAAO,EAAC,uBAAuB,EAAC,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAC,YAAY,EAAC,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAOL,kBAAkB,EAClB,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EAAC,YAAY,EAAE,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AACjE,OAAO,EAAC,gBAAgB,EAAC,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAC,YAAY,EAAC,MAAM,mBAAmB,CAAC;AAI/C,OAAO,EAAC,iBAAiB,EAAC,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAC,QAAQ,EAA6C,MAAM,eAAe,CAAC;AACnF,OAAO,EAAC,mBAAmB,EAAE,sBAAsB,EAAC,MAAM,mBAAmB,CAAC;AAC9E,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAsB,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAC,wBAAwB,EAAC,MAAM,yBAAyB,CAAC;AACjE,OAAO,EACL,kBAAkB,EAClB,mBAAmB,EACnB,sBAAsB,EACtB,oBAAoB,EACpB,qBAAqB,EACrB,wBAAwB,GAIzB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,qBAAqB,EAAC,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAC,cAAc,EAAE,qBAAqB,EAAE,gBAAgB,EAAC,MAAM,wBAAwB,CAAC;AAE/F,OAAO,EAAC,aAAa,EAAC,MAAM,yBAAyB,CAAC;AA4DtD;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,aAAa;IAyBxB,YAAoB,IAA4B;QA+tBhD,yEAAyE;QAChE,gBAAW,GAAG,QAAiB,CAAC;QA/tBvC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAChD,CAAC;IAED,6CAA6C;IACrC,KAAK,CAA2B,YAA+C,EAAE;QACvF,OAAO,IAAI,aAAa,iBACtB,KAAK,EAAE,IAAI,CAAC,MAAM,EAClB,QAAQ,EAAE,IAAI,CAAC,SAAgB,EAC/B,OAAO,EAAE,IAAI,CAAC,QAAQ,EACtB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,aAAa,EAAE,IAAI,CAAC,cAAc,EAClC,KAAK,EAAE,IAAI,CAAC,MAAM,EAClB,MAAM,EAAE,IAAI,CAAC,OAAO,EACpB,OAAO,EAAE,IAAI,CAAC,QAAQ,EACtB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,YAAY,EAAE,IAAI,CAAC,aAAa,EAChC,eAAe,EAAE,IAAI,CAAC,gBAAgB,EACtC,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,YAAY,EAAE,IAAI,CAAC,aAAa,EAChC,YAAY,EAAE,IAAI,CAAC,YAAY,EAC/B,mBAAmB,EAAE,IAAI,CAAC,mBAAmB,EAC7C,MAAM,EAAE,IAAI,CAAC,MAAM,EACnB,OAAO,EAAE,IAAI,CAAC,OAAO,EACrB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,EACvC,OAAO,EAAE,IAAI,CAAC,QAAQ,IACnB,SAAS,EACZ,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,sBAAsB;IACtB,8EAA8E;IAE9E;;;;;OAKG;IACH,MAAM,CAAC,IAAI,CACT,KAAmC;QAEnC,MAAM,QAAQ,GAAG,YAAY,CAAI,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,aAAa,CAAI,EAAC,KAAK,EAAE,QAAQ,EAAC,CAAC,CAAC;IACjD,CAAC;IAUD,MAAM,CAAW,oBAAsE;QACrF,IAAI,oBAAoB,YAAY,QAAQ,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;YACtE,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,oBAAoB,EAAC,CAAC,CAAC;QACvG,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,oBAAoB,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;YACtE,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC,CAAC;QAC5F,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,oBAA2B,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC,CAAC;IACzH,CAAC;IAED,oDAAoD;IACpD,SAAS;QACP,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,MAAM,cAAc,GAAG,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;aAC9D,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,cAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;QAC9E,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,EAAC,CAAC,CAAC;IACjE,CAAC;IAED,0BAA0B;IAC1B,KAAK,CAAC,EAAkB;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,EAAE,EAAC,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,SAAqE;;QACzE,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,IAAI,OAAO,SAAS,KAAK,UAAU,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YAC5D,kDAAkD;YAClD,KAAK,CAAC,OAAO,GAAG,MAAC,SAAmC,CAAC,KAAK,0CAAE,EAAE,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,KAAK,CAAC,OAAO,GAAG,SAA2B,CAAC;QAC9C,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,EAAE,CAAC;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,YAAY,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,EAAC,CAAC,CAAC;IAC1D,CAAC;IAED,sBAAsB;IACtB,OAAO,CAAK,EAAuB,EAAE,YAA4B,KAAK;QACpE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,EAAS,EAAE,aAAa,EAAE,SAAS,EAAC,CAAC,CAAC;IACrE,CAAC;IAED;;OAEG;IACH,MAAM,CAAK,EAAuB,EAAE,YAA4B,KAAK;QACnE,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,wBAAwB;IACxB,KAAK,CAAC,CAAS;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;IAChC,CAAC;IAED,yBAAyB;IACzB,MAAM,CAAC,CAAS;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,MAAM,EAAE,CAAC,EAAC,CAAC,CAAC;IACjC,CAAC;IAED,qFAAqF;IACrF,GAAG,CAAC,EAAwE;QAC1E,IAAI,EAAE,YAAY,mBAAmB,EAAE,CAAC;YACtC,wEAAwE;YACxE,oEAAoE;YACpE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,EAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,EAAE,CAAC,WAAW,EAAC,CAAQ,CAAC;QACpJ,CAAC;QACD,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YACf,gFAAgF;YAChF,8FAA8F;YAC9F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAQ,CAAC;QAC9I,CAAC;QACD,MAAM,OAAO,GAAuB,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAQ,CAAC;IAC/G,CAAC;IAED;;;OAGG;IACH,iBAAiB;;QACf,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,EAAE,CAAA,CAAC,CAAC;IAC5D,CAAC;IAED,8DAA8D;IAC9D,MAAM,CAAC,GAAqC;QAC1C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAC,CAAC;QACpH,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAC,CAAC;IACzG,CAAC;IAED,wEAAwE;IACxE,GAAG;QACD,OAAO,IAAI,CAAC,KAAK,CAA6C,EAAC,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAC,CAAC,CAAC;IAChG,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2CG;IACG,MAAM,CAAC,MAAiB;;YAC5B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;KAAA;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoDG;IACG,KAAK,CAAC,MAAiB;;YAC3B,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;KAAA;IAED;;;;;;;;;;;;OAYG;IACH,OAAO;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,YAAY,CAAC,EAAE,iBACpB,UAAU,EAAE,IAAI,CAAC,MAAM,EACvB,OAAO,EAAE,IAAI,CAAC,QAAQ,IAGnB,IAAI,CAAC,YAAY,EAAE,EACtB,CAAC;IACL,CAAC;IAED;;;;;;;;;OASG;IACK,YAAY;QAOlB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,KAA4B,CAAC;QACjC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,IAAI,YAAyC,CAAC;QAC9C,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC9C,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACvC,CAAC;QAED,4EAA4E;QAC5E,+EAA+E;QAC/E,4EAA4E;QAC5E,6EAA6E;QAC7E,MAAM,OAAO,GACX,IAAI,CAAC,QAAQ,YAAY,mBAAmB;YAC1C,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAC3E,CAAC,CAAC,EAAC,EAAE,EAAG,IAAI,CAAC,QAA+B,CAAC,EAAE,EAAC;gBAChD,CAAC,CAAC,SAAS,CAAC;QAElB,OAAO;YACL,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,KAAK;YACL,YAAY;YACZ,WAAW,EAAE,IAAI,CAAC,YAAY;SAC/B,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM;QACZ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,UAAU,CAAC,EAAE,iBAClB,UAAU,EAAE,IAAI,CAAC,MAAM,EACvB,OAAO,EAAE,IAAI,CAAC,QAAQ,IAInB,IAAI,CAAC,YAAY,EAAE,EACtB,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,OAAO,CACL,IAAY,EACZ,SAAqC;QAErC,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,EAAC,IAAI,EAAE,SAAS,EAAC,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,WAAW,EAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACH,MAAM;QACJ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;QACD,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,2EAA2E;YAC3E,gEAAgE;YAChE,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAyC,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,8EAA8E;IAC9E,mBAAmB;IACnB,8EAA8E;IAE9E,mEAAmE;IAC3D,mBAAmB;QACzB,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,CAAC,CAAM,EAAE,EAAE;gBAC3B,OAAO,IAAI,CAAC,SAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YACnF,CAAC,CAAC;YACF,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACvD,IAAI,EAAE,EAAE,CAAC;gBACP,EAAE,GAAG,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE;oBACxC,GAAI,EAAE,CAAC,OAA2B;oBAClC,GAAI,SAAS,CAAC,OAA2B;iBAC1C,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,EAAE,GAAG,SAAS,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,wEAAwE;IAChE,qBAAqB;QAC3B,MAAM,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,aAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACvC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAC,CAAC;YAClC,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,MAAM,MAAM,GAAI,KAAK,CAAC,OAAoB,CAAC,KAAK,CAAC,CAAC;gBAElD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;wBAC7C,MAAM,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;wBACxD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAuB,EAAE,CAAC,CAAC,EAAC,eAAe,EAAE,GAAG,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC;oBACjF,CAAC,CAAC,CAAC;oBACH,OAAO,EAAC,aAAa,EAAC,CAAC;gBACzB,CAAC;gBAED,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,UAAU,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;oBACxF,MAAM,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;oBAC1D,OAAO,EAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAuB,EAAE,CAAC,CAAC,EAAC,eAAe,EAAE,GAAG,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC,EAAC,CAAC;gBACpG,CAAC;gBAED,wBAAwB;gBACxB,OAAO,EAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAC,CAAC;YACjE,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,gBAAgB;IAChB,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACH,MAAM;;QACJ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,OAAO,GAAG,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,0CAAE,EAAE,KAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAqB;YAC7B,CAAC,EAAE,YAAY;YACf,KAAK,EAAE,OAAO;SACf,CAAC;QAEF,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,wEAAwE;YACxE,qEAAqE;YACrE,IAAI,CAAC,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC5D,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvF,IAAI,CAAC,OAAO,GAAI,IAAI,CAAC,QAA+B,CAAC,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrG,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,GAAG,mBAAmB,CAC/B,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAuC,EAAE,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,CAC9G,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzD,sBAAsB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC7C,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClD,sBAAsB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC7C,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAA0B,IAAsB;QAC7D,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,OAAO,GAAG,aAAa,CAAC,IAAI,CAAI,IAAI,CAAC,KAAY,CAAC,CAAC;QAEvD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;gBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC;YACH,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAqB,CAAC;QACzD,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAqB,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAqB,CAAC;QAC5D,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,0EAA0E;YAC1E,iEAAiE;YACjE,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC5C,CAAC,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/C,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACjB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAqB,CAAC;QACrD,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAqB,CAAC;QAC9D,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,GAAG,EAAsB,CAAC;QAC9C,CAAC;QAED,qFAAqF;QACrF,MAAM,SAAS,GAAsC,EAAE,CAAC;QACxD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;QAEvC,uBAAuB;QACvB,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,MAAM,GAAG,oBAAoB,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACjE,CAAC;QAED,6EAA6E;QAC7E,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7D,SAAS,CAAC,OAAO,GAAG,MAAM,CAAC;YAC3B,SAAS,CAAC,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,wBAAwB;QACxB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACnE,SAAS,CAAC,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACvD,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,CACvC,CAAC;QACJ,CAAC;QAED,2BAA2B;QAC3B,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,SAAS,CAAC,YAAY,GAAG,IAAI,CAAC;QAChC,CAAC;QAED,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,GAAI,OAAe,CAAC,KAAK,CAAC,SAAS,CAAqB,CAAC;QAClE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;;OAIG;IACH,UAAU;QACR,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,IAAI,CAAC,oBAAoB,EAAE,CAAC;IACrC,CAAC;IAED,2DAA2D;IACnD,oBAAoB;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAErC,IAAI,KAA4B,CAAC;QACjC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,IAAI,MAA8B,CAAC;QACnC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,GAAG,oBAAoB,CAC3B,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,SAAuC,EAC5C,IAAI,CAAC,cAAc,IAAI,KAAK,CAC7B,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACxB,CAAC;QAED,MAAM,KAAK,GAAmB;YAC5B,OAAO;YACP,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,MAAM,EAAE,IAAI,CAAC,OAAO;YACpB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,MAAM;YACN,YAAY,EACV,IAAI,CAAC,aAAa;gBAClB,CAAC,CAAC,CACA,IAAI,CAAC,QAAQ;oBACb,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACjC,IAAI,IAAI,IAAI,CAAC,QAAQ,CACtB;SACJ,CAAC;QAEF,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACpD,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC7C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,mFAAmF;IACnF,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;;;;;OAQG;IACG,IAAI,CAAC,MAAiB;;YAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAoB,CAAC;QACpD,CAAC;KAAA;IAED;;;;;;;OAOG;IACW,IAAI,CAChB,MAA4B,EAC5B,wBAAiC;;;YAEjC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,qFAAqF;gBACrF,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,EAAE,CAAA,EAAE,CAAC;gBACnD,4FAA4F;gBAC5F,OAAO,IAAI,CAAC;YACd,CAAC;YACD,6EAA6E;YAC7E,8FAA8F;YAC9F,MAAM,QAAQ,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,gBAAgB,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,OAAO,MAAM,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC1C,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,wEAAwE;gBACxE,4EAA4E;gBAC5E,4EAA4E;gBAC5E,iEAAiE;gBACjE,IAAI,wBAAwB,IAAI,aAAa,CAAC,GAAG,EAAE,sBAAsB,CAAC,EAAE,CAAC;oBAC3E,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,0EAA0E;gBAC1E,yEAAyE;gBACzE,0EAA0E;gBAC1E,wEAAwE;gBACxE,8DAA8D;gBAC9D,oEAAoE;gBACpE,sEAAsE;gBACtE,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,gCAAiC,GAAa,CAAC,KAAK,qCAAqC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChJ,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE;oBACtC,KAAK,EAAE,GAAG;oBACV,QAAQ,EAAE,IAAI;oBACd,YAAY,EAAE,IAAI;oBAClB,UAAU,EAAE,KAAK;iBAClB,CAAC,CAAC;gBACH,MAAM,OAAO,CAAC;YAChB,CAAC;QACH,CAAC;KAAA;IAGD;;;;;;;OAOG;IACH,IAAI,CAAa,iBAAsD,EAAE,OAA0B;QACjG,MAAM,QAAQ,GAAG,OAAO,iBAAiB,KAAK,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;QACzF,MAAM,IAAI,GAAG,OAAO,iBAAiB,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC;QACnF,OAAO,qBAAqB,EAAE,CAAC,SAAS,CAAI,IAAW,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;IAED,8EAA8E;IAC9E,+BAA+B;IAC/B,8EAA8E;IAE9E,kCAAkC;IAClC,IAAI,CACF,WAA0E,EAC1E,UAAuE;QAEvE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACnD,CAAC;IAED,2EAA2E;IAC3E,KAAK,CACH,UAAqE;QAErE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;IAED,+EAA+E;IAC/E,OAAO,CAAC,SAA+B;QACrC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,eAAe,CAAC;IACzB,CAAC;CACF;AAED,4FAA4F;AAC5F,OAAO,EAAC,aAAa,IAAI,YAAY,EAAC,CAAC","sourcesContent":["import {Shape, type ShapeConstructor} from '../shapes/Shape.js';\nimport {getUniquePropertyShapes} from '../shapes/nodeShapeData.js';\nimport {resolveShape} from './resolveShape.js';\nimport {\n  type QueryBuildFn,\n  type WhereClause,\n  type QResult,\n  type QueryResponseToResultType,\n  type SelectAllQueryResponse,\n  type QueryComponentLike,\n  processWhereClause,\n  evaluateSortCallback,\n} from './SelectQuery.js';\nimport type {SortByPath, WherePath} from './SelectQuery.js';\nimport type {PropertyPathSegment, RawMinusEntry, RawSelectInput} from './IRDesugar.js';\nimport {WIRE_VERSION, assertWireVersion} from './wireVersion.js';\nimport {getQueryDispatch} from './queryDispatch.js';\nimport {AskBuilder} from './AskBuilder.js';\nimport {CountBuilder} from './CountBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport type {NodeShapeData} from '../shapes/SHACL.js';\nimport type {NodeReferenceValue} from './QueryFactory.js';\nimport {resolveUriOrThrow} from '../utils/NodeReference.js';\nimport {FieldSet, type FieldSetFieldJSON, type FieldSetEntry} from './FieldSet.js';\nimport {PendingQueryContext, UnresolvedContextError} from './QueryContext.js';\nimport {encodeContextRef, isContextRefJSON, type ContextRefJSON} from './ContextRef.js';\nimport {createProxiedPathBuilder} from './ProxiedPathBuilder.js';\nimport {\n  serializeWherePath,\n  serializeSortByPath,\n  serializeRawMinusEntry,\n  deserializeWherePath,\n  deserializeSortByPath,\n  deserializeRawMinusEntry,\n  type WherePathJSON,\n  type SortByPathJSON,\n  type RawMinusEntryJSON,\n} from './QueryBuilderSerialization.js';\nimport {requireLiveQueryStore} from '../live/registry.js';\nimport {captureCatalog, getActiveShapeCatalog, withShapeCatalog} from '../utils/ShapeClass.js';\nimport type {ShapeCatalog} from '../utils/ShapeCatalog.js';\nimport {isLinkedError} from '../utils/linkedError.js';\nimport type {LiveListener, LiveQuery, LiveQueryOptions} from '../live/LiveQueryStore.js';\n\n/** JSON representation of a SelectBuilder. */\nexport type QueryBuilderJSON = {\n  /** DSL-JSON wire-format version. */\n  v?: string;\n  shape: string;\n  fields?: FieldSetFieldJSON[];\n  limit?: number;\n  offset?: number;\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  subject?: string | ContextRefJSON;\n  subjects?: string[];\n  /** `.one()` — unwrap a single result. */\n  one?: boolean;\n  where?: WherePathJSON;\n  sortBy?: SortByPathJSON;\n  minusEntries?: RawMinusEntryJSON[];\n  nullSubject?: boolean;\n};\n\n/** A preload entry binding a property path to a component's query. */\ninterface PreloadEntry {\n  path: string;\n  component: QueryComponentLike<any, any>;\n}\n\n/** A MINUS entry — either a shape type exclusion or a WHERE-clause condition. */\ninterface MinusEntry<S extends Shape> {\n  shapeId?: string;\n  whereFn?: WhereClause<S>;\n}\n\n/** Internal state bag for SelectBuilder. */\ninterface QueryBuilderInit<S extends Shape, R> {\n  shape: ShapeConstructor<S>;\n  /** The catalog the builder resolves in; absent = captured from the active one. */\n  catalog?: ShapeCatalog;\n  selectFn?: QueryBuildFn<S, R>;\n  whereFn?: WhereClause<S>;\n  sortByFn?: QueryBuildFn<S, any>;\n  sortDirection?: 'ASC' | 'DESC';\n  limit?: number;\n  offset?: number;\n  subject?: S | QResult<S> | NodeReferenceValue;\n  subjects?: NodeReferenceValue[];\n  singleResult?: boolean;\n  selectAllLabels?: string[];\n  fieldSet?: FieldSet;\n  preloads?: PreloadEntry[];\n  minusEntries?: MinusEntry<S>[];\n  _nullSubject?: boolean;\n  _pendingContextName?: string;\n  // Pre-evaluated data (restored from JSON; used when callbacks are not available)\n  _where?: WherePath;\n  _sortBy?: SortByPath;\n  _rawMinusEntries?: RawMinusEntry[];\n}\n\n/**\n * An immutable, fluent query builder for select queries.\n *\n * Every mutation method (`.select()`, `.where()`, `.limit()`, etc.) returns\n * a **new** SelectBuilder instance — the original is never modified.\n *\n * Implements `PromiseLike` so queries execute on `await`:\n * ```ts\n * const results = await SelectBuilder.from(Person).select(p => p.name);\n * ```\n *\n * Produces a raw select input (`toRawInput()`) that the free `lower()` function\n * turns into IR; the builder itself carries no dependency on the IR pipeline.\n */\nexport class SelectBuilder<S extends Shape = Shape, R = any, Result = any>\n  implements PromiseLike<Result>, Promise<Result>\n{\n  private readonly _shape: ShapeConstructor<S>;\n  private readonly _selectFn?: QueryBuildFn<S, R>;\n  private readonly _whereFn?: WhereClause<S>;\n  private readonly _sortByFn?: QueryBuildFn<S, any>;\n  private readonly _sortDirection?: 'ASC' | 'DESC';\n  private readonly _limit?: number;\n  private readonly _offset?: number;\n  private readonly _subject?: S | QResult<S> | NodeReferenceValue;\n  private readonly _subjects?: NodeReferenceValue[];\n  private readonly _singleResult?: boolean;\n  private readonly _selectAllLabels?: string[];\n  private readonly _fieldSet?: FieldSet;\n  private readonly _preloads?: PreloadEntry[];\n  private readonly _minusEntries?: MinusEntry<S>[];\n  private readonly _nullSubject?: boolean;\n  private readonly _pendingContextName?: string;\n  // Pre-evaluated data (restored from JSON; used when callbacks are not available)\n  private readonly _where?: WherePath;\n  private readonly _sortBy?: SortByPath;\n  private readonly _rawMinusEntries?: RawMinusEntry[];\n  private readonly _catalog: ShapeCatalog | undefined;\n\n  private constructor(init: QueryBuilderInit<S, R>) {\n    this._shape = init.shape;\n    this._catalog = 'catalog' in init ? init.catalog : captureCatalog(init.shape);\n    this._selectFn = init.selectFn;\n    this._whereFn = init.whereFn;\n    this._sortByFn = init.sortByFn;\n    this._sortDirection = init.sortDirection;\n    this._limit = init.limit;\n    this._offset = init.offset;\n    this._subject = init.subject;\n    this._subjects = init.subjects;\n    this._singleResult = init.singleResult;\n    this._selectAllLabels = init.selectAllLabels;\n    this._fieldSet = init.fieldSet;\n    this._preloads = init.preloads;\n    this._minusEntries = init.minusEntries;\n    this._nullSubject = init._nullSubject;\n    this._pendingContextName = init._pendingContextName;\n    this._where = init._where;\n    this._sortBy = init._sortBy;\n    this._rawMinusEntries = init._rawMinusEntries;\n  }\n\n  /** Create a shallow clone with overrides. */\n  private clone<NR = R, NResult = Result>(overrides: Partial<QueryBuilderInit<S, any>> = {}): SelectBuilder<S, NR, NResult> {\n    return new SelectBuilder<S, NR, NResult>({\n      shape: this._shape,\n      selectFn: this._selectFn as any,\n      whereFn: this._whereFn,\n      sortByFn: this._sortByFn,\n      sortDirection: this._sortDirection,\n      limit: this._limit,\n      offset: this._offset,\n      subject: this._subject,\n      subjects: this._subjects,\n      singleResult: this._singleResult,\n      selectAllLabels: this._selectAllLabels,\n      fieldSet: this._fieldSet,\n      preloads: this._preloads,\n      minusEntries: this._minusEntries,\n      _nullSubject: this._nullSubject,\n      _pendingContextName: this._pendingContextName,\n      _where: this._where,\n      _sortBy: this._sortBy,\n      _rawMinusEntries: this._rawMinusEntries,\n      catalog: this._catalog,\n      ...overrides,\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Static constructors\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Create a SelectBuilder for the given shape.\n   *\n   * Accepts a shape class (e.g. `Person`), a NodeShapeData instance,\n   * or a shape IRI string (resolved via the shape registry).\n   */\n  static from<S extends Shape>(\n    shape: ShapeConstructor<S> | string,\n  ): SelectBuilder<S> {\n    const resolved = resolveShape<S>(shape);\n    return new SelectBuilder<S>({shape: resolved});\n  }\n\n  // ---------------------------------------------------------------------------\n  // Fluent API — each returns a new instance\n  // ---------------------------------------------------------------------------\n\n  /** Set the select projection via a callback, labels, or FieldSet. */\n  select<NewR>(fn: QueryBuildFn<S, NewR>): SelectBuilder<S, NewR, QueryResponseToResultType<NewR, S>[]>;\n  select(labels: string[]): SelectBuilder<S>;\n  select<NewR>(fieldSet: FieldSet<NewR>): SelectBuilder<S, NewR, QueryResponseToResultType<NewR, S>[]>;\n  select<NewR = R>(fnOrLabelsOrFieldSet: QueryBuildFn<S, NewR> | string[] | FieldSet<any>): SelectBuilder<S, NewR, any> {\n    if (fnOrLabelsOrFieldSet instanceof FieldSet) {\n      const labels = fnOrLabelsOrFieldSet.labels();\n      const selectFn = ((p: any) =>\n        labels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n      return this.clone<NewR, any>({selectFn, selectAllLabels: undefined, fieldSet: fnOrLabelsOrFieldSet});\n    }\n    if (Array.isArray(fnOrLabelsOrFieldSet)) {\n      const labels = fnOrLabelsOrFieldSet;\n      const selectFn = ((p: any) =>\n        labels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n      return this.clone<NewR, any>({selectFn, selectAllLabels: undefined, fieldSet: undefined});\n    }\n    return this.clone<NewR, any>({selectFn: fnOrLabelsOrFieldSet as any, selectAllLabels: undefined, fieldSet: undefined});\n  }\n\n  /** Select all decorated properties of the shape. */\n  selectAll(): SelectBuilder<S, any, QueryResponseToResultType<SelectAllQueryResponse<S>, S>[]> {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.selectAll());\n    }\n    const propertyLabels = getUniquePropertyShapes(this._shape.shape)\n      .map((ps) => ps.label);\n    const selectFn = ((p: any) =>\n      propertyLabels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n    return this.clone({selectFn, selectAllLabels: propertyLabels});\n  }\n\n  /** Add a where clause. */\n  where(fn: WhereClause<S>): SelectBuilder<S, R, Result> {\n    return this.clone({whereFn: fn});\n  }\n\n  /**\n   * Exclude results matching a MINUS pattern.\n   *\n   * Accepts:\n   * - A shape constructor to exclude by type: `.minus(Employee)`\n   * - A WHERE callback to exclude by condition: `.minus(p => p.hobby.equals('Chess'))`\n   * - A callback returning a property or array of properties for existence exclusion:\n   *   `.minus(p => p.hobby)` or `.minus(p => [p.hobby, p.bestFriend.name])`\n   *\n   * Chainable: `.minus(A).minus(B)` produces two separate `MINUS { }` blocks.\n   */\n  minus(shapeOrFn: ShapeConstructor<any> | WhereClause<S> | ((s: any) => any)): SelectBuilder<S, R, Result> {\n    const entry: MinusEntry<S> = {};\n    if (typeof shapeOrFn === 'function' && 'shape' in shapeOrFn) {\n      // ShapeConstructor — has a static .shape property\n      entry.shapeId = (shapeOrFn as ShapeConstructor<any>).shape?.id;\n    } else {\n      // WhereClause callback\n      entry.whereFn = shapeOrFn as WhereClause<S>;\n    }\n    const existing = this._minusEntries || [];\n    return this.clone({minusEntries: [...existing, entry]});\n  }\n\n  /** Set sort order. */\n  orderBy<OR>(fn: QueryBuildFn<S, OR>, direction: 'ASC' | 'DESC' = 'ASC'): SelectBuilder<S, R, Result> {\n    return this.clone({sortByFn: fn as any, sortDirection: direction});\n  }\n\n  /**\n   * @deprecated Use `orderBy()` instead.\n   */\n  sortBy<OR>(fn: QueryBuildFn<S, OR>, direction: 'ASC' | 'DESC' = 'ASC'): SelectBuilder<S, R, Result> {\n    return this.orderBy(fn, direction);\n  }\n\n  /** Set result limit. */\n  limit(n: number): SelectBuilder<S, R, Result> {\n    return this.clone({limit: n});\n  }\n\n  /** Set result offset. */\n  offset(n: number): SelectBuilder<S, R, Result> {\n    return this.clone({offset: n});\n  }\n\n  /** Target a single entity by ID. Implies singleResult; unwraps array Result type. */\n  for(id: string | NodeReferenceValue | PendingQueryContext | null | undefined): SelectBuilder<S, R, Result extends (infer E)[] ? E : Result> {\n    if (id instanceof PendingQueryContext) {\n      // Store the pending context as subject — its .id getter resolves lazily\n      // from the global context map when the query is lowered/serialized.\n      return this.clone({subject: id as any, subjects: undefined, singleResult: true, _nullSubject: false, _pendingContextName: id.contextName}) as any;\n    }\n    if (id == null) {\n      // Return a builder that resolves to null when executed (no subject = no query).\n      // This commonly happens when getQueryContext() returns null before the user is authenticated.\n      return this.clone({subject: undefined, subjects: undefined, singleResult: true, _nullSubject: true, _pendingContextName: undefined}) as any;\n    }\n    const subject: NodeReferenceValue = typeof id === 'string' ? {id: resolveUriOrThrow(id)} : id;\n    return this.clone({subject, subjects: undefined, singleResult: true, _pendingContextName: undefined}) as any;\n  }\n\n  /**\n   * Whether the query has a pending (lazy) context that hasn't resolved yet.\n   * Returns true when .for() received a PendingQueryContext whose value isn't available yet.\n   */\n  hasPendingContext(): boolean {\n    return !!(this._pendingContextName && !this._subject?.id);\n  }\n\n  /** Target multiple entities by ID, or all if no ids given. */\n  forAll(ids?: (string | NodeReferenceValue)[]): SelectBuilder<S, R, Result> {\n    if (!ids) {\n      return this.clone({subject: undefined, subjects: undefined, singleResult: false, _pendingContextName: undefined});\n    }\n    const subjects = ids.map((id) => typeof id === 'string' ? {id: resolveUriOrThrow(id)} : id);\n    return this.clone({subject: undefined, subjects, singleResult: false, _pendingContextName: undefined});\n  }\n\n  /** Limit to one result. Unwraps array Result type to single element. */\n  one(): SelectBuilder<S, R, Result extends (infer E)[] ? E : Result> {\n    return this.clone<R, Result extends (infer E)[] ? E : Result>({limit: 1, singleResult: true});\n  }\n\n  /**\n   * Whether **any** row matches this query. Executes immediately and resolves to a\n   * real `boolean` — never a row, never `null`, never an array the caller has to\n   * interpret.\n   *\n   * ```ts\n   * await Person.select().where(p => p.name.equals('Semmy')).exists(); // boolean\n   * await Person.exists({id});                                        // the common case\n   * ```\n   *\n   * ### The query is normalised to its cheapest correct form first\n   *\n   * **Dropped** — the projection, preloads, sorting *and pagination* (`limit`/`offset`).\n   * **Kept** — filters, `minus` entries and the subject: those decide whether a match\n   * exists. `LIMIT 1` is then applied.\n   *\n   * So `.select(…).orderBy(…).offset(10).exists()` costs, and answers, exactly the\n   * same as a bare `.exists()`. Against a SPARQL store that goes out as:\n   *\n   * ```sparql\n   * ASK WHERE { ?a0 rdf:type <…> . FILTER(?a0 = <…>) }\n   * ```\n   *\n   * Pagination does not survive, and cannot: `OFFSET` skips rows of a *solution\n   * sequence*, and an ask has none. (Nor is it merely dropped — an\n   * {@link AskBuilder} has nowhere to hold it.) `exists()` answers a question about\n   * the **match set**, not about a page of it.\n   *\n   * ### Errors are not swallowed\n   *\n   * A store, transport or lowering failure rejects the returned promise; it is never\n   * reported as `false`. That includes an unresolved query-context reference in a\n   * where clause, which `exec()` deliberately reports as `null` (\"not ready\") but\n   * which `exists()` must not flatten into a boolean — and a store whose `askQuery`\n   * resolves to something that is not a boolean, which rejects rather than being\n   * coerced into one.\n   *\n   * The one case that does resolve `false` without querying is a query with **no\n   * subject to ask about** — `.for(null)`, `.for(undefined)`, or an unresolved\n   * `PendingQueryContext` *as the subject*. \"Does the node with no id exist?\" has a\n   * correct total answer, and it is `false`.\n   *\n   * @param target Optional explicit dataset, as for {@link exec}.\n   */\n  async exists(target?: IDataset): Promise<boolean> {\n    return this._toAsk().exec(target);\n  }\n\n  /**\n   * **How many** rows match this query — the total of the match set, as a real\n   * `number`.\n   *\n   * ```ts\n   * await Person.select().where(p => p.name.equals('Semmy')).count(); // number\n   * await SelectBuilder.from(shapeIri).where(…).count();              // from an IRI alone\n   * ```\n   *\n   * ### The query is normalised to its cheapest correct form first\n   *\n   * **Dropped** — the projection, preloads, sorting *and pagination*\n   * (`limit`/`offset`). **Kept** — filters, `minus` entries and the subject: those\n   * decide membership of the match set. Against a SPARQL store that goes out as:\n   *\n   * ```sparql\n   * SELECT (COUNT(DISTINCT ?a0) AS ?count)\n   * WHERE { ?a0 rdf:type <…> . ?a0 <…name> ?a0_name . FILTER(?a0_name = \"Semmy\") }\n   * ```\n   *\n   * ### `limit`/`offset` are dropped, not rejected\n   *\n   * A count of a windowed query is meaningless — `OFFSET` skips rows of a *solution\n   * sequence*, and the number a count answers is a property of the whole match set,\n   * not of a page of it. So `.limit(20).offset(40).count()` costs, and answers,\n   * exactly the same as a bare `.count()`.\n   *\n   * Dropping rather than throwing is deliberate: the paging caller holds **one**\n   * builder and wants the page *and* its total from the same filter, so rejecting\n   * the combination would force it to rebuild the builder by hand for no\n   * correctness gain. There is exactly one sensible reading, and it is this one.\n   * `.exists()` already made the same call, so the DSL has one rule — *a\n   * scalar-answering query drops the solution-sequence modifiers* — not two.\n   *\n   * Nor is the drop merely a convention: a {@link CountBuilder} has nowhere to hold\n   * a window, so it cannot be forgotten or half-applied downstream.\n   *\n   * `DISTINCT` is likewise not optional. A filter on a multi-valued property yields\n   * several rows per subject, so the count is of distinct subjects — \"how many\n   * instances match\", which is the question asked.\n   *\n   * ### Errors are not swallowed\n   *\n   * A store, transport or lowering failure **rejects**; it is never reported as `0`.\n   * `0` is a plausible count: it renders an empty table and looks like data. Do not\n   * wrap this in `.catch(() => 0)`.\n   *\n   * The one case that resolves `0` without querying is a query with no subject to\n   * count — `.for(null)`, `.for(undefined)`, or an unresolved `PendingQueryContext`\n   * *as the subject*.\n   *\n   * @param target Optional explicit dataset, as for {@link exec}.\n   */\n  async count(target?: IDataset): Promise<number> {\n    return this.toCount().exec(target);\n  }\n\n  /**\n   * Reduce this select to the count query that answers \"how many match?\".\n   *\n   * Public, unlike the ask equivalent, because a caller may want to **forward**\n   * rather than execute: `builder.toCount().toJSON()` is the `{op: 'count'}` wire\n   * envelope a router or RPC boundary sends on, and `fromJSON` turns it back into a\n   * `CountBuilder` on the other side.\n   *\n   * Only the pattern survives — shape, subject(s), filters, `minus`. The projection,\n   * preloads, sorting and pagination are not so much \"dropped\" as unrepresentable:\n   * {@link CountBuilder} has nowhere to put them. That is the point of it being a\n   * separate builder rather than a mode of this one.\n   */\n  toCount(): CountBuilder {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toCount());\n    }\n    return CountBuilder.of({\n      shapeClass: this._shape,\n      catalog: this._catalog,\n      // `.for(null)` rides along in the spec. An unresolved pending context is\n      // handled by CountBuilder.exec, which answers `0` without querying.\n      ...this._patternSpec(),\n    });\n  }\n\n  /**\n   * The pattern-bearing part of this select: shape-membership, subject(s), filters\n   * and `minus` — everything that decides which nodes are in the match set, and\n   * nothing that shapes or windows the rows describing them.\n   *\n   * Shared by {@link _toAsk} and {@link toCount} rather than written twice. That is\n   * not only about duplication: if the two normalisations drifted, `.exists()` and\n   * `.count()` would disagree about what the match set *is* — a count of 0 next to\n   * an `exists` of `true`, from the same builder.\n   */\n  private _patternSpec(): {\n    subject?: NodeReferenceValue | PendingQueryContext;\n    subjects?: NodeReferenceValue[];\n    where?: WherePath;\n    minusEntries?: RawMinusEntry[];\n    nullSubject?: boolean;\n  } {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this._patternSpec());\n    }\n    let where: WherePath | undefined;\n    if (this._whereFn) {\n      where = processWhereClause(this._whereFn, this._shape);\n    } else if (this._where) {\n      where = this._where;\n    }\n\n    let minusEntries: RawMinusEntry[] | undefined;\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      minusEntries = this._evaluateMinusEntries();\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      minusEntries = this._rawMinusEntries;\n    }\n\n    // A PendingQueryContext must survive as itself. It has an `id` *getter*, so\n    // narrowing it to `{id}` here would silently resolve it against THIS process's\n    // context map — and the query would then travel as a concrete IRI where the\n    // equivalent select travels as `{\"@ctx\": name}` for the receiver to resolve.\n    const subject =\n      this._subject instanceof PendingQueryContext\n        ? this._subject\n        : this._subject && typeof this._subject === 'object' && 'id' in this._subject\n          ? {id: (this._subject as NodeReferenceValue).id}\n          : undefined;\n\n    return {\n      subject,\n      subjects: this._subjects,\n      where,\n      minusEntries,\n      nullSubject: this._nullSubject,\n    };\n  }\n\n  /**\n   * Reduce this select to the ask query that answers the same existence question.\n   *\n   * Only the pattern survives — shape, subject(s), filters, `minus`. The\n   * projection, preloads, sorting and pagination are not \"dropped\" so much as\n   * unrepresentable: {@link AskBuilder} has nowhere to put them. That is the point\n   * of it being a separate builder rather than a mode of this one — the\n   * normalisation cannot be forgotten or half-applied.\n   */\n  private _toAsk(): AskBuilder {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this._toAsk());\n    }\n    return AskBuilder.of({\n      shapeClass: this._shape,\n      catalog: this._catalog,\n      // `.for(null)` rides along in the spec. An unresolved pending context is\n      // handled by AskBuilder.exec, which sees the live context and answers `false`\n      // without querying.\n      ...this._patternSpec(),\n    });\n  }\n\n  /**\n   * Preload a component's query fields at the given property path.\n   *\n   * This merges the component's query paths into this query's selection,\n   * wrapping them in an OPTIONAL block (handled by the IR pipeline).\n   *\n   * Equivalent to the DSL's `.preloadFor()`:\n   * ```ts\n   * // DSL style\n   * Person.select(p => p.bestFriend.preloadFor(PersonCard))\n   * // SelectBuilder style\n   * SelectBuilder.from(Person).select(p => [p.name]).preload('bestFriend', PersonCard)\n   * ```\n   *\n   * NOTE: Preloads hold live component references and are not serializable.\n   * They are merged into the selection when the field set is evaluated\n   * (`_fieldsWithPreloads()`), so changes to preload handling must account for\n   * the selectFn wrapping logic.\n   */\n  preload<CS extends Shape, CR>(\n    path: string,\n    component: QueryComponentLike<CS, CR>,\n  ): SelectBuilder<S, R, Result> {\n    const newPreloads = [...(this._preloads || []), {path, component}];\n    return this.clone({preloads: newPreloads});\n  }\n\n  /**\n   * Returns the current selection as a FieldSet.\n   * If the selection was set via a FieldSet, returns that directly.\n   * If set via selectAll labels, constructs a FieldSet from them.\n   * If set via a callback, eagerly evaluates it through the proxy to produce a FieldSet.\n   */\n  fields(): FieldSet | undefined {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.fields());\n    }\n    if (this._fieldSet) {\n      return this._fieldSet;\n    }\n    if (this._selectAllLabels) {\n      return FieldSet.for(this._shape.shape, this._selectAllLabels);\n    }\n    if (this._selectFn) {\n      // Eagerly evaluate the callback through FieldSet.for(ShapeClass, callback)\n      // The callback is pure — same proxy always produces same paths.\n      return FieldSet.for(this._shape, this._selectFn as unknown as (p: any) => any[]);\n    }\n    return undefined;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Internal helpers\n  // ---------------------------------------------------------------------------\n\n  /** Return the FieldSet with preload entries merged in (if any). */\n  private _fieldsWithPreloads(): FieldSet | undefined {\n    let fs = this.fields();\n    if (this._preloads && this._preloads.length > 0) {\n      const preloadFn = (p: any) => {\n        return this._preloads!.map((entry) => p[entry.path].preloadFor(entry.component));\n      };\n      const preloadFs = FieldSet.for(this._shape, preloadFn);\n      if (fs) {\n        fs = FieldSet.createFromEntries(fs.shape, [\n          ...(fs.entries as FieldSetEntry[]),\n          ...(preloadFs.entries as FieldSetEntry[]),\n        ]);\n      } else {\n        fs = preloadFs;\n      }\n    }\n    return fs;\n  }\n\n  /** Evaluate minus entry callbacks into RawMinusEntry[] (plain data). */\n  private _evaluateMinusEntries(): RawMinusEntry[] {\n    const proxy = createProxiedPathBuilder(this._shape);\n    return this._minusEntries!.map((entry) => {\n      if (entry.shapeId) {\n        return {shapeId: entry.shapeId};\n      }\n      if (entry.whereFn) {\n        const result = (entry.whereFn as Function)(proxy);\n\n        if (Array.isArray(result)) {\n          const propertyPaths = result.map((item: any) => {\n            const segments = FieldSet.collectPropertySegments(item);\n            return segments.map((seg): PropertyPathSegment => ({propertyShapeId: seg.id}));\n          });\n          return {propertyPaths};\n        }\n\n        if (result && typeof result === 'object' && 'property' in result && 'subject' in result) {\n          const segments = FieldSet.collectPropertySegments(result);\n          return {propertyPaths: [segments.map((seg): PropertyPathSegment => ({propertyShapeId: seg.id}))]};\n        }\n\n        // WHERE-based exclusion\n        return {where: processWhereClause(entry.whereFn, this._shape)};\n      }\n      return {};\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Serialization\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Serialize this SelectBuilder to a plain JSON object.\n   *\n   * Selections are serializable regardless of how they were set (FieldSet,\n   * string[], selectAll, or callback). Callback-based selections are eagerly\n   * evaluated through the proxy to produce a FieldSet.\n   *\n   * Where, orderBy, and minus clauses are evaluated through the proxy and\n   * serialized as plain data structures. Preloads are merged into the FieldSet\n   * as subSelect entries, producing identical IR on deserialization.\n   */\n  toJSON(): QueryBuilderJSON {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toJSON());\n    }\n    const shapeId = this._shape.shape?.id || '';\n    const json: QueryBuilderJSON = {\n      v: WIRE_VERSION,\n      shape: shapeId,\n    };\n\n    const fs = this._fieldsWithPreloads();\n    if (fs) {\n      json.fields = fs.toJSON().fields;\n    }\n\n    if (this._limit !== undefined) {\n      json.limit = this._limit;\n    }\n    if (this._offset !== undefined) {\n      json.offset = this._offset;\n    }\n    if (this._pendingContextName) {\n      // Carry the context reference, not its (possibly unresolved) id, so the\n      // receiver resolves it against its own context map at lowering time.\n      json.subject = encodeContextRef(this._pendingContextName);\n    } else if (this._subject && typeof this._subject === 'object' && 'id' in this._subject) {\n      json.subject = (this._subject as NodeReferenceValue).id;\n    }\n    if (this._subjects && this._subjects.length > 0) {\n      json.subjects = this._subjects.map((s) => s.id);\n    }\n    if (this._singleResult) {\n      json.one = true;\n    }\n\n    if (this._whereFn) {\n      json.where = serializeWherePath(processWhereClause(this._whereFn, this._shape), this._shape.shape);\n    } else if (this._where) {\n      json.where = serializeWherePath(this._where, this._shape.shape);\n    }\n\n    if (this._sortByFn) {\n      json.sortBy = serializeSortByPath(\n        evaluateSortCallback(this._shape, this._sortByFn as unknown as (p: any) => any, this._sortDirection || 'ASC'),\n      );\n    } else if (this._sortBy) {\n      json.sortBy = serializeSortByPath(this._sortBy);\n    }\n\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      json.minusEntries = this._evaluateMinusEntries().map((e) =>\n        serializeRawMinusEntry(e, this._shape.shape),\n      );\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      json.minusEntries = this._rawMinusEntries.map((e) =>\n        serializeRawMinusEntry(e, this._shape.shape),\n      );\n    }\n\n    if (this._nullSubject) {\n      json.nullSubject = true;\n    }\n\n    return json;\n  }\n\n  /**\n   * Reconstruct a SelectBuilder from a JSON object.\n   * Resolves shape IRI via getShapeClass() and field paths as label selections.\n   */\n  static fromJSON<S extends Shape = Shape>(json: QueryBuilderJSON): SelectBuilder<S> {\n    assertWireVersion(json.v);\n    let builder = SelectBuilder.from<S>(json.shape as any);\n\n    if (json.fields && json.fields.length > 0) {\n      const fieldSet = FieldSet.fromJSON({\n        shape: json.shape,\n        fields: json.fields,\n      });\n      builder = builder.select(fieldSet) as SelectBuilder<S>;\n    }\n\n    if (json.limit !== undefined) {\n      builder = builder.limit(json.limit) as SelectBuilder<S>;\n    }\n    if (json.offset !== undefined) {\n      builder = builder.offset(json.offset) as SelectBuilder<S>;\n    }\n    if (json.subject) {\n      // A `{@ctx}` subject rehydrates as a pending context (preserving the name\n      // so it re-serializes as a context reference and resolves live).\n      const subject = isContextRefJSON(json.subject)\n        ? new PendingQueryContext(json.subject['@ctx'])\n        : json.subject;\n      builder = builder.for(subject) as SelectBuilder<S>;\n    }\n    if (json.subjects && json.subjects.length > 0) {\n      builder = builder.forAll(json.subjects) as SelectBuilder<S>;\n    }\n    if (json.one && !json.subject) {\n      builder = builder.one() as SelectBuilder<S>;\n    }\n\n    // Restore pre-evaluated data via clone — safe because fromJSON is in the same class.\n    const overrides: Partial<QueryBuilderInit<S, any>> = {};\n    const nodeShape = builder._shape.shape;\n\n    // Restore where clause\n    if (json.where && nodeShape) {\n      overrides._where = deserializeWherePath(nodeShape, json.where);\n    }\n\n    // Restore sort key + direction (direction rides on the ordered sortBy array)\n    if (json.sortBy && json.sortBy.length > 0 && nodeShape) {\n      const sortBy = deserializeSortByPath(nodeShape, json.sortBy);\n      overrides._sortBy = sortBy;\n      overrides.sortDirection = sortBy.directions[0];\n    }\n\n    // Restore minus entries\n    if (json.minusEntries && json.minusEntries.length > 0 && nodeShape) {\n      overrides._rawMinusEntries = json.minusEntries.map((e) =>\n        deserializeRawMinusEntry(nodeShape, e),\n      );\n    }\n\n    // Restore nullSubject flag\n    if (json.nullSubject) {\n      overrides._nullSubject = true;\n    }\n\n    if (Object.keys(overrides).length > 0) {\n      builder = (builder as any).clone(overrides) as SelectBuilder<S>;\n    }\n\n    return builder;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Build & execute\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Get the raw pipeline input.\n   *\n   * Constructs RawSelectInput directly from FieldSet entries.\n   */\n  toRawInput(): RawSelectInput {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toRawInput());\n    }\n    return this._buildDirectRawInput();\n  }\n\n  /** Build RawSelectInput directly from FieldSet entries. */\n  private _buildDirectRawInput(): RawSelectInput {\n    const fs = this._fieldsWithPreloads();\n    const entries = fs ? fs.entries : [];\n\n    let where: WherePath | undefined;\n    if (this._whereFn) {\n      where = processWhereClause(this._whereFn, this._shape);\n    } else if (this._where) {\n      where = this._where;\n    }\n\n    let sortBy: SortByPath | undefined;\n    if (this._sortByFn) {\n      sortBy = evaluateSortCallback(\n        this._shape,\n        this._sortByFn as unknown as (p: any) => any,\n        this._sortDirection || 'ASC',\n      );\n    } else if (this._sortBy) {\n      sortBy = this._sortBy;\n    }\n\n    const input: RawSelectInput = {\n      entries,\n      subject: this._subject,\n      limit: this._limit,\n      offset: this._offset,\n      shape: this._shape,\n      sortBy,\n      singleResult:\n        this._singleResult ||\n        !!(\n          this._subject &&\n          typeof this._subject === 'object' &&\n          'id' in this._subject\n        ),\n    };\n\n    if (where) {\n      input.where = where;\n    }\n    if (this._subjects && this._subjects.length > 0) {\n      input.subjects = this._subjects;\n    }\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      input.minusEntries = this._evaluateMinusEntries();\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      input.minusEntries = this._rawMinusEntries;\n    }\n\n    return input;\n  }\n\n  /** Discriminator for the free `lower()` function and dataset routing. */\n  readonly __queryKind = 'select' as const;\n\n  /** The shape this query targets — the routing key datasets/`LinkedStorage` use. */\n  get shape(): NodeShapeData {\n    return this._shape.shape;\n  }\n\n  /**\n   * The catalog this builder resolves shapes in — captured when it was built, kept by\n   * every derived builder. Undefined = the global registry. Never serialized.\n   */\n  get catalog(): ShapeCatalog | undefined {\n    return this._catalog;\n  }\n\n  /**\n   * Execute the query and return results.\n   *\n   * @param target Optional explicit dataset (a store or a router — a router *is* an\n   *   `IDataset`) to run against. Omitted → the global query dispatch (the router's\n   *   shape-based default). A `target` runs on that dataset only; the global router is\n   *   untouched. `await`ing the builder (the PromiseLike path) always uses the global\n   *   dispatch — only `.exec(target)` overrides.\n   */\n  async exec(target?: IDataset): Promise<Result> {\n    return this._run(target, true) as Promise<Result>;\n  }\n\n  /**\n   * Shared execution path for {@link exec} and {@link exists}.\n   *\n   * @param swallowUnresolvedContext When true (the `exec` path), a where-clause\n   *   context reference that has not resolved yet surfaces as `null` — \"not ready\",\n   *   which a reactive layer re-runs once the context lands. `exists()` passes\n   *   false: it must not turn \"could not ask\" into a boolean.\n   */\n  private async _run(\n    target: IDataset | undefined,\n    swallowUnresolvedContext: boolean,\n  ): Promise<unknown> {\n    if (this._nullSubject) {\n      // .for(null/undefined) was called — return null instead of executing a broken query.\n      return null;\n    }\n    if (this._pendingContextName && !this._subject?.id) {\n      // Pending context hasn't resolved yet — return null rather than querying without a subject.\n      return null;\n    }\n    // Dispatch the live (closed) query; the dataset decides whether to lower it.\n    // `async` ensures a missing global dispatch surfaces as a rejected promise, not a sync throw.\n    const dispatch = target ?? getQueryDispatch();\n    try {\n      return await dispatch.selectQuery(this);\n    } catch (err) {\n      // A where-clause context reference that hasn't resolved yet surfaces as\n      // UnresolvedContextError when the dataset lowers the query. For SELECT this\n      // means \"not ready\" — return null (a reactive layer re-runs once it lands),\n      // mirroring the pending-subject behavior. Mutations still throw.\n      if (swallowUnresolvedContext && isLinkedError(err, UnresolvedContextError)) {\n        return null;\n      }\n      // The message names the query, which is what a human needs. `cause` keeps\n      // the ORIGINAL error reachable as an object, which is what code needs: a\n      // store error's status/endpoint/class is how a caller tells \"this dataset\n      // does not exist\" from \"this query is wrong\", and without the chain the\n      // only way left is to pattern-match this string. Written with\n      // defineProperty rather than `new Error(msg, {cause})` because this\n      // package targets es6, where that overload is not typed; the property\n      // shape (own, non-enumerable) is identical.\n      const wrapped = Error(`Error while executing query: ${(err as Error).stack}.\\n\\nQuery related to this error: ${JSON.stringify(this.toJSON())}`);\n      Object.defineProperty(wrapped, 'cause', {\n        value: err,\n        writable: true,\n        configurable: true,\n        enumerable: false,\n      });\n      throw wrapped;\n    }\n  }\n\n\n  /**\n   * Go live: subscribe to this query and keep its result current.\n   *\n   * Returns a {@link LiveQuery} handle. `await` it for the first result,\n   * `subscribe()` for every later one, `close()` when done. A listener may be\n   * passed directly as the first argument. Requires the live-query store to be\n   * loaded, which importing `@_linked/core` (the package root) does.\n   */\n  live<R = Result>(listenerOrOptions?: LiveListener<R> | LiveQueryOptions, options?: LiveQueryOptions): LiveQuery<R> {\n    const listener = typeof listenerOrOptions === 'function' ? listenerOrOptions : undefined;\n    const opts = typeof listenerOrOptions === 'function' ? options : listenerOrOptions;\n    return requireLiveQueryStore().subscribe<R>(this as any, listener, opts);\n  }\n\n  // ---------------------------------------------------------------------------\n  // Promise-compatible interface\n  // ---------------------------------------------------------------------------\n\n  /** `await` triggers execution. */\n  then<TResult1 = Result, TResult2 = never>(\n    onfulfilled?: ((value: Result) => TResult1 | PromiseLike<TResult1>) | null,\n    onrejected?: ((reason: any) => TResult2 | PromiseLike<TResult2>) | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.exec().then(onfulfilled, onrejected);\n  }\n\n  /** Catch errors from execution. Chain off then() to avoid re-executing. */\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => TResult | PromiseLike<TResult>) | null,\n  ): Promise<Result | TResult> {\n    return this.then().catch(onrejected);\n  }\n\n  /** Finally handler after execution. Chain off then() to avoid re-executing. */\n  finally(onfinally?: (() => void) | null): Promise<Result> {\n    return this.then().finally(onfinally);\n  }\n\n  get [Symbol.toStringTag](): string {\n    return 'SelectBuilder';\n  }\n}\n\n/** @deprecated Renamed to `SelectBuilder`. This alias will be removed in a future major. */\nexport {SelectBuilder as QueryBuilder};\n"]}
+{"version":3,"file":"QueryBuilder.js","sourceRoot":"","sources":["../../../src/queries/QueryBuilder.ts"],"names":[],"mappings":";;;;;;;;;AACA,OAAO,EAAC,uBAAuB,EAAC,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAC,YAAY,EAAC,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAOL,kBAAkB,EAClB,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EAAC,YAAY,EAAE,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AACjE,OAAO,EAAC,gBAAgB,EAAC,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAC,YAAY,EAAC,MAAM,mBAAmB,CAAC;AAI/C,OAAO,EAAC,iBAAiB,EAAC,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAC,QAAQ,EAA6C,MAAM,eAAe,CAAC;AACnF,OAAO,EAAC,mBAAmB,EAAE,sBAAsB,EAAC,MAAM,mBAAmB,CAAC;AAC9E,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAsB,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAC,wBAAwB,EAAC,MAAM,yBAAyB,CAAC;AACjE,OAAO,EACL,kBAAkB,EAClB,mBAAmB,EACnB,sBAAsB,EACtB,oBAAoB,EACpB,qBAAqB,EACrB,wBAAwB,GAIzB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,qBAAqB,EAAC,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAC,cAAc,EAAE,qBAAqB,EAAE,gBAAgB,EAAC,MAAM,wBAAwB,CAAC;AAE/F,OAAO,EAAC,gBAAgB,EAAE,aAAa,EAAE,gBAAgB,EAAC,MAAM,yBAAyB,CAAC;AA4D1F;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,aAAa;IAyBxB,YAAoB,IAA4B;QA+tBhD,yEAAyE;QAChE,gBAAW,GAAG,QAAiB,CAAC;QA/tBvC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAChD,CAAC;IAED,6CAA6C;IACrC,KAAK,CAA2B,YAA+C,EAAE;QACvF,OAAO,IAAI,aAAa,iBACtB,KAAK,EAAE,IAAI,CAAC,MAAM,EAClB,QAAQ,EAAE,IAAI,CAAC,SAAgB,EAC/B,OAAO,EAAE,IAAI,CAAC,QAAQ,EACtB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,aAAa,EAAE,IAAI,CAAC,cAAc,EAClC,KAAK,EAAE,IAAI,CAAC,MAAM,EAClB,MAAM,EAAE,IAAI,CAAC,OAAO,EACpB,OAAO,EAAE,IAAI,CAAC,QAAQ,EACtB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,YAAY,EAAE,IAAI,CAAC,aAAa,EAChC,eAAe,EAAE,IAAI,CAAC,gBAAgB,EACtC,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,QAAQ,EAAE,IAAI,CAAC,SAAS,EACxB,YAAY,EAAE,IAAI,CAAC,aAAa,EAChC,YAAY,EAAE,IAAI,CAAC,YAAY,EAC/B,mBAAmB,EAAE,IAAI,CAAC,mBAAmB,EAC7C,MAAM,EAAE,IAAI,CAAC,MAAM,EACnB,OAAO,EAAE,IAAI,CAAC,OAAO,EACrB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,EACvC,OAAO,EAAE,IAAI,CAAC,QAAQ,IACnB,SAAS,EACZ,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,sBAAsB;IACtB,8EAA8E;IAE9E;;;;;OAKG;IACH,MAAM,CAAC,IAAI,CACT,KAAmC;QAEnC,MAAM,QAAQ,GAAG,YAAY,CAAI,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,aAAa,CAAI,EAAC,KAAK,EAAE,QAAQ,EAAC,CAAC,CAAC;IACjD,CAAC;IAUD,MAAM,CAAW,oBAAsE;QACrF,IAAI,gBAAgB,CAAC,oBAAoB,EAAE,QAAQ,CAAC,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;YACtE,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,oBAAoB,EAAC,CAAC,CAAC;QACvG,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,oBAAoB,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;YACtE,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC,CAAC;QAC5F,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAY,EAAC,QAAQ,EAAE,oBAA2B,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC,CAAC;IACzH,CAAC;IAED,oDAAoD;IACpD,SAAS;QACP,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,MAAM,cAAc,GAAG,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;aAC9D,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAC3B,cAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAoC,CAAC;QAC9E,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,EAAC,CAAC,CAAC;IACjE,CAAC;IAED,0BAA0B;IAC1B,KAAK,CAAC,EAAkB;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,EAAE,EAAC,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,SAAqE;;QACzE,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,IAAI,OAAO,SAAS,KAAK,UAAU,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;YAC5D,kDAAkD;YAClD,KAAK,CAAC,OAAO,GAAG,MAAC,SAAmC,CAAC,KAAK,0CAAE,EAAE,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,KAAK,CAAC,OAAO,GAAG,SAA2B,CAAC;QAC9C,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,EAAE,CAAC;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,YAAY,EAAE,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,EAAC,CAAC,CAAC;IAC1D,CAAC;IAED,sBAAsB;IACtB,OAAO,CAAK,EAAuB,EAAE,YAA4B,KAAK;QACpE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,EAAS,EAAE,aAAa,EAAE,SAAS,EAAC,CAAC,CAAC;IACrE,CAAC;IAED;;OAEG;IACH,MAAM,CAAK,EAAuB,EAAE,YAA4B,KAAK;QACnE,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,wBAAwB;IACxB,KAAK,CAAC,CAAS;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;IAChC,CAAC;IAED,yBAAyB;IACzB,MAAM,CAAC,CAAS;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,MAAM,EAAE,CAAC,EAAC,CAAC,CAAC;IACjC,CAAC;IAED,qFAAqF;IACrF,GAAG,CAAC,EAAwE;QAC1E,IAAI,gBAAgB,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE,CAAC;YAC9C,wEAAwE;YACxE,oEAAoE;YACpE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,EAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,EAAE,CAAC,WAAW,EAAC,CAAQ,CAAC;QACpJ,CAAC;QACD,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YACf,gFAAgF;YAChF,8FAA8F;YAC9F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAQ,CAAC;QAC9I,CAAC;QACD,MAAM,OAAO,GAAuB,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,IAAI,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAQ,CAAC;IAC/G,CAAC;IAED;;;OAGG;IACH,iBAAiB;;QACf,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,EAAE,CAAA,CAAC,CAAC;IAC5D,CAAC;IAED,8DAA8D;IAC9D,MAAM,CAAC,GAAqC;QAC1C,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAC,CAAC;QACpH,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,mBAAmB,EAAE,SAAS,EAAC,CAAC,CAAC;IACzG,CAAC;IAED,wEAAwE;IACxE,GAAG;QACD,OAAO,IAAI,CAAC,KAAK,CAA6C,EAAC,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAC,CAAC,CAAC;IAChG,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2CG;IACG,MAAM,CAAC,MAAiB;;YAC5B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;KAAA;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoDG;IACG,KAAK,CAAC,MAAiB;;YAC3B,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;KAAA;IAED;;;;;;;;;;;;OAYG;IACH,OAAO;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,YAAY,CAAC,EAAE,iBACpB,UAAU,EAAE,IAAI,CAAC,MAAM,EACvB,OAAO,EAAE,IAAI,CAAC,QAAQ,IAGnB,IAAI,CAAC,YAAY,EAAE,EACtB,CAAC;IACL,CAAC;IAED;;;;;;;;;OASG;IACK,YAAY;QAOlB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,KAA4B,CAAC;QACjC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,IAAI,YAAyC,CAAC;QAC9C,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC9C,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACvC,CAAC;QAED,4EAA4E;QAC5E,+EAA+E;QAC/E,4EAA4E;QAC5E,6EAA6E;QAC7E,MAAM,OAAO,GACX,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,mBAAmB,CAAC;YAClD,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ;gBAC3E,CAAC,CAAC,EAAC,EAAE,EAAG,IAAI,CAAC,QAA+B,CAAC,EAAE,EAAC;gBAChD,CAAC,CAAC,SAAS,CAAC;QAElB,OAAO;YACL,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,KAAK;YACL,YAAY;YACZ,WAAW,EAAE,IAAI,CAAC,YAAY;SAC/B,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM;QACZ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,UAAU,CAAC,EAAE,iBAClB,UAAU,EAAE,IAAI,CAAC,MAAM,EACvB,OAAO,EAAE,IAAI,CAAC,QAAQ,IAInB,IAAI,CAAC,YAAY,EAAE,EACtB,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,OAAO,CACL,IAAY,EACZ,SAAqC;QAErC,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,EAAC,IAAI,EAAE,SAAS,EAAC,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,KAAK,CAAC,EAAC,QAAQ,EAAE,WAAW,EAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACH,MAAM;QACJ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;QACD,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,2EAA2E;YAC3E,gEAAgE;YAChE,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAyC,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,8EAA8E;IAC9E,mBAAmB;IACnB,8EAA8E;IAE9E,mEAAmE;IAC3D,mBAAmB;QACzB,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,CAAC,CAAM,EAAE,EAAE;gBAC3B,OAAO,IAAI,CAAC,SAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YACnF,CAAC,CAAC;YACF,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACvD,IAAI,EAAE,EAAE,CAAC;gBACP,EAAE,GAAG,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE;oBACxC,GAAI,EAAE,CAAC,OAA2B;oBAClC,GAAI,SAAS,CAAC,OAA2B;iBAC1C,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,EAAE,GAAG,SAAS,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,wEAAwE;IAChE,qBAAqB;QAC3B,MAAM,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,aAAc,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACvC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,OAAO,EAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAC,CAAC;YAClC,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,MAAM,MAAM,GAAI,KAAK,CAAC,OAAoB,CAAC,KAAK,CAAC,CAAC;gBAElD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE;wBAC7C,MAAM,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;wBACxD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAuB,EAAE,CAAC,CAAC,EAAC,eAAe,EAAE,GAAG,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC;oBACjF,CAAC,CAAC,CAAC;oBACH,OAAO,EAAC,aAAa,EAAC,CAAC;gBACzB,CAAC;gBAED,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,UAAU,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;oBACxF,MAAM,QAAQ,GAAG,QAAQ,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;oBAC1D,OAAO,EAAC,aAAa,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAuB,EAAE,CAAC,CAAC,EAAC,eAAe,EAAE,GAAG,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC,EAAC,CAAC;gBACpG,CAAC;gBAED,wBAAwB;gBACxB,OAAO,EAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAC,CAAC;YACjE,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,gBAAgB;IAChB,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACH,MAAM;;QACJ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,OAAO,GAAG,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,0CAAE,EAAE,KAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAqB;YAC7B,CAAC,EAAE,YAAY;YACf,KAAK,EAAE,OAAO;SACf,CAAC;QAEF,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;QACnC,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,wEAAwE;YACxE,qEAAqE;YACrE,IAAI,CAAC,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC5D,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvF,IAAI,CAAC,OAAO,GAAI,IAAI,CAAC,QAA+B,CAAC,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrG,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,GAAG,mBAAmB,CAC/B,oBAAoB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAuC,EAAE,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,CAC9G,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzD,sBAAsB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC7C,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClD,sBAAsB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAC7C,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAA0B,IAAsB;QAC7D,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,OAAO,GAAG,aAAa,CAAC,IAAI,CAAI,IAAI,CAAC,KAAY,CAAC,CAAC;QAEvD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;gBACjC,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC;YACH,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAqB,CAAC;QACzD,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAqB,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAqB,CAAC;QAC5D,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,0EAA0E;YAC1E,iEAAiE;YACjE,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC5C,CAAC,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/C,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACjB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAqB,CAAC;QACrD,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAqB,CAAC;QAC9D,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,GAAG,EAAsB,CAAC;QAC9C,CAAC;QAED,qFAAqF;QACrF,MAAM,SAAS,GAAsC,EAAE,CAAC;QACxD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;QAEvC,uBAAuB;QACvB,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,MAAM,GAAG,oBAAoB,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACjE,CAAC;QAED,6EAA6E;QAC7E,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7D,SAAS,CAAC,OAAO,GAAG,MAAM,CAAC;YAC3B,SAAS,CAAC,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,wBAAwB;QACxB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACnE,SAAS,CAAC,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACvD,wBAAwB,CAAC,SAAS,EAAE,CAAC,CAAC,CACvC,CAAC;QACJ,CAAC;QAED,2BAA2B;QAC3B,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,SAAS,CAAC,YAAY,GAAG,IAAI,CAAC;QAChC,CAAC;QAED,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,GAAI,OAAe,CAAC,KAAK,CAAC,SAAS,CAAqB,CAAC;QAClE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;;OAIG;IACH,UAAU;QACR,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,IAAI,CAAC,oBAAoB,EAAE,CAAC;IACrC,CAAC;IAED,2DAA2D;IACnD,oBAAoB;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAErC,IAAI,KAA4B,CAAC;QACjC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,CAAC;QAED,IAAI,MAA8B,CAAC;QACnC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,GAAG,oBAAoB,CAC3B,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,SAAuC,EAC5C,IAAI,CAAC,cAAc,IAAI,KAAK,CAC7B,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACxB,CAAC;QAED,MAAM,KAAK,GAAmB;YAC5B,OAAO;YACP,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,MAAM,EAAE,IAAI,CAAC,OAAO;YACpB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,MAAM;YACN,YAAY,EACV,IAAI,CAAC,aAAa;gBAClB,CAAC,CAAC,CACA,IAAI,CAAC,QAAQ;oBACb,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACjC,IAAI,IAAI,IAAI,CAAC,QAAQ,CACtB;SACJ,CAAC;QAEF,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACpD,CAAC;aAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC7C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,mFAAmF;IACnF,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;;;;;OAQG;IACG,IAAI,CAAC,MAAiB;;YAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAoB,CAAC;QACpD,CAAC;KAAA;IAED;;;;;;;OAOG;IACW,IAAI,CAChB,MAA4B,EAC5B,wBAAiC;;;YAEjC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,qFAAqF;gBACrF,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,IAAI,CAAC,mBAAmB,IAAI,CAAC,CAAA,MAAA,IAAI,CAAC,QAAQ,0CAAE,EAAE,CAAA,EAAE,CAAC;gBACnD,4FAA4F;gBAC5F,OAAO,IAAI,CAAC;YACd,CAAC;YACD,6EAA6E;YAC7E,8FAA8F;YAC9F,MAAM,QAAQ,GAAG,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,gBAAgB,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,OAAO,MAAM,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC1C,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,wEAAwE;gBACxE,4EAA4E;gBAC5E,4EAA4E;gBAC5E,iEAAiE;gBACjE,IAAI,wBAAwB,IAAI,aAAa,CAAC,GAAG,EAAE,sBAAsB,CAAC,EAAE,CAAC;oBAC3E,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,0EAA0E;gBAC1E,yEAAyE;gBACzE,0EAA0E;gBAC1E,wEAAwE;gBACxE,8DAA8D;gBAC9D,oEAAoE;gBACpE,sEAAsE;gBACtE,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,gCAAiC,GAAa,CAAC,KAAK,qCAAqC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChJ,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE;oBACtC,KAAK,EAAE,GAAG;oBACV,QAAQ,EAAE,IAAI;oBACd,YAAY,EAAE,IAAI;oBAClB,UAAU,EAAE,KAAK;iBAClB,CAAC,CAAC;gBACH,MAAM,OAAO,CAAC;YAChB,CAAC;QACH,CAAC;KAAA;IAGD;;;;;;;OAOG;IACH,IAAI,CAAa,iBAAsD,EAAE,OAA0B;QACjG,MAAM,QAAQ,GAAG,OAAO,iBAAiB,KAAK,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;QACzF,MAAM,IAAI,GAAG,OAAO,iBAAiB,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC;QACnF,OAAO,qBAAqB,EAAE,CAAC,SAAS,CAAI,IAAW,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;IAED,8EAA8E;IAC9E,+BAA+B;IAC/B,8EAA8E;IAE9E,kCAAkC;IAClC,IAAI,CACF,WAA0E,EAC1E,UAAuE;QAEvE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACnD,CAAC;IAED,2EAA2E;IAC3E,KAAK,CACH,UAAqE;QAErE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;IAED,+EAA+E;IAC/E,OAAO,CAAC,SAA+B;QACrC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,eAAe,CAAC;IACzB,CAAC;CACF;AACD,gBAAgB,CAAC,aAAa,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;AAGlE,4FAA4F;AAC5F,OAAO,EAAC,aAAa,IAAI,YAAY,EAAC,CAAC","sourcesContent":["import {Shape, type ShapeConstructor} from '../shapes/Shape.js';\nimport {getUniquePropertyShapes} from '../shapes/nodeShapeData.js';\nimport {resolveShape} from './resolveShape.js';\nimport {\n  type QueryBuildFn,\n  type WhereClause,\n  type QResult,\n  type QueryResponseToResultType,\n  type SelectAllQueryResponse,\n  type QueryComponentLike,\n  processWhereClause,\n  evaluateSortCallback,\n} from './SelectQuery.js';\nimport type {SortByPath, WherePath} from './SelectQuery.js';\nimport type {PropertyPathSegment, RawMinusEntry, RawSelectInput} from './IRDesugar.js';\nimport {WIRE_VERSION, assertWireVersion} from './wireVersion.js';\nimport {getQueryDispatch} from './queryDispatch.js';\nimport {AskBuilder} from './AskBuilder.js';\nimport {CountBuilder} from './CountBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport type {NodeShapeData} from '../shapes/SHACL.js';\nimport type {NodeReferenceValue} from './QueryFactory.js';\nimport {resolveUriOrThrow} from '../utils/NodeReference.js';\nimport {FieldSet, type FieldSetFieldJSON, type FieldSetEntry} from './FieldSet.js';\nimport {PendingQueryContext, UnresolvedContextError} from './QueryContext.js';\nimport {encodeContextRef, isContextRefJSON, type ContextRefJSON} from './ContextRef.js';\nimport {createProxiedPathBuilder} from './ProxiedPathBuilder.js';\nimport {\n  serializeWherePath,\n  serializeSortByPath,\n  serializeRawMinusEntry,\n  deserializeWherePath,\n  deserializeSortByPath,\n  deserializeRawMinusEntry,\n  type WherePathJSON,\n  type SortByPathJSON,\n  type RawMinusEntryJSON,\n} from './QueryBuilderSerialization.js';\nimport {requireLiveQueryStore} from '../live/registry.js';\nimport {captureCatalog, getActiveShapeCatalog, withShapeCatalog} from '../utils/ShapeClass.js';\nimport type {ShapeCatalog} from '../utils/ShapeCatalog.js';\nimport {brandLinkedClass, isLinkedError, isLinkedInstance} from '../utils/linkedError.js';\nimport type {LiveListener, LiveQuery, LiveQueryOptions} from '../live/LiveQueryStore.js';\n\n/** JSON representation of a SelectBuilder. */\nexport type QueryBuilderJSON = {\n  /** DSL-JSON wire-format version. */\n  v?: string;\n  shape: string;\n  fields?: FieldSetFieldJSON[];\n  limit?: number;\n  offset?: number;\n  /** A node id, or a `{@ctx: name}` context reference resolved at lowering. */\n  subject?: string | ContextRefJSON;\n  subjects?: string[];\n  /** `.one()` — unwrap a single result. */\n  one?: boolean;\n  where?: WherePathJSON;\n  sortBy?: SortByPathJSON;\n  minusEntries?: RawMinusEntryJSON[];\n  nullSubject?: boolean;\n};\n\n/** A preload entry binding a property path to a component's query. */\ninterface PreloadEntry {\n  path: string;\n  component: QueryComponentLike<any, any>;\n}\n\n/** A MINUS entry — either a shape type exclusion or a WHERE-clause condition. */\ninterface MinusEntry<S extends Shape> {\n  shapeId?: string;\n  whereFn?: WhereClause<S>;\n}\n\n/** Internal state bag for SelectBuilder. */\ninterface QueryBuilderInit<S extends Shape, R> {\n  shape: ShapeConstructor<S>;\n  /** The catalog the builder resolves in; absent = captured from the active one. */\n  catalog?: ShapeCatalog;\n  selectFn?: QueryBuildFn<S, R>;\n  whereFn?: WhereClause<S>;\n  sortByFn?: QueryBuildFn<S, any>;\n  sortDirection?: 'ASC' | 'DESC';\n  limit?: number;\n  offset?: number;\n  subject?: S | QResult<S> | NodeReferenceValue;\n  subjects?: NodeReferenceValue[];\n  singleResult?: boolean;\n  selectAllLabels?: string[];\n  fieldSet?: FieldSet;\n  preloads?: PreloadEntry[];\n  minusEntries?: MinusEntry<S>[];\n  _nullSubject?: boolean;\n  _pendingContextName?: string;\n  // Pre-evaluated data (restored from JSON; used when callbacks are not available)\n  _where?: WherePath;\n  _sortBy?: SortByPath;\n  _rawMinusEntries?: RawMinusEntry[];\n}\n\n/**\n * An immutable, fluent query builder for select queries.\n *\n * Every mutation method (`.select()`, `.where()`, `.limit()`, etc.) returns\n * a **new** SelectBuilder instance — the original is never modified.\n *\n * Implements `PromiseLike` so queries execute on `await`:\n * ```ts\n * const results = await SelectBuilder.from(Person).select(p => p.name);\n * ```\n *\n * Produces a raw select input (`toRawInput()`) that the free `lower()` function\n * turns into IR; the builder itself carries no dependency on the IR pipeline.\n */\nexport class SelectBuilder<S extends Shape = Shape, R = any, Result = any>\n  implements PromiseLike<Result>, Promise<Result>\n{\n  private readonly _shape: ShapeConstructor<S>;\n  private readonly _selectFn?: QueryBuildFn<S, R>;\n  private readonly _whereFn?: WhereClause<S>;\n  private readonly _sortByFn?: QueryBuildFn<S, any>;\n  private readonly _sortDirection?: 'ASC' | 'DESC';\n  private readonly _limit?: number;\n  private readonly _offset?: number;\n  private readonly _subject?: S | QResult<S> | NodeReferenceValue;\n  private readonly _subjects?: NodeReferenceValue[];\n  private readonly _singleResult?: boolean;\n  private readonly _selectAllLabels?: string[];\n  private readonly _fieldSet?: FieldSet;\n  private readonly _preloads?: PreloadEntry[];\n  private readonly _minusEntries?: MinusEntry<S>[];\n  private readonly _nullSubject?: boolean;\n  private readonly _pendingContextName?: string;\n  // Pre-evaluated data (restored from JSON; used when callbacks are not available)\n  private readonly _where?: WherePath;\n  private readonly _sortBy?: SortByPath;\n  private readonly _rawMinusEntries?: RawMinusEntry[];\n  private readonly _catalog: ShapeCatalog | undefined;\n\n  private constructor(init: QueryBuilderInit<S, R>) {\n    this._shape = init.shape;\n    this._catalog = 'catalog' in init ? init.catalog : captureCatalog(init.shape);\n    this._selectFn = init.selectFn;\n    this._whereFn = init.whereFn;\n    this._sortByFn = init.sortByFn;\n    this._sortDirection = init.sortDirection;\n    this._limit = init.limit;\n    this._offset = init.offset;\n    this._subject = init.subject;\n    this._subjects = init.subjects;\n    this._singleResult = init.singleResult;\n    this._selectAllLabels = init.selectAllLabels;\n    this._fieldSet = init.fieldSet;\n    this._preloads = init.preloads;\n    this._minusEntries = init.minusEntries;\n    this._nullSubject = init._nullSubject;\n    this._pendingContextName = init._pendingContextName;\n    this._where = init._where;\n    this._sortBy = init._sortBy;\n    this._rawMinusEntries = init._rawMinusEntries;\n  }\n\n  /** Create a shallow clone with overrides. */\n  private clone<NR = R, NResult = Result>(overrides: Partial<QueryBuilderInit<S, any>> = {}): SelectBuilder<S, NR, NResult> {\n    return new SelectBuilder<S, NR, NResult>({\n      shape: this._shape,\n      selectFn: this._selectFn as any,\n      whereFn: this._whereFn,\n      sortByFn: this._sortByFn,\n      sortDirection: this._sortDirection,\n      limit: this._limit,\n      offset: this._offset,\n      subject: this._subject,\n      subjects: this._subjects,\n      singleResult: this._singleResult,\n      selectAllLabels: this._selectAllLabels,\n      fieldSet: this._fieldSet,\n      preloads: this._preloads,\n      minusEntries: this._minusEntries,\n      _nullSubject: this._nullSubject,\n      _pendingContextName: this._pendingContextName,\n      _where: this._where,\n      _sortBy: this._sortBy,\n      _rawMinusEntries: this._rawMinusEntries,\n      catalog: this._catalog,\n      ...overrides,\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Static constructors\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Create a SelectBuilder for the given shape.\n   *\n   * Accepts a shape class (e.g. `Person`), a NodeShapeData instance,\n   * or a shape IRI string (resolved via the shape registry).\n   */\n  static from<S extends Shape>(\n    shape: ShapeConstructor<S> | string,\n  ): SelectBuilder<S> {\n    const resolved = resolveShape<S>(shape);\n    return new SelectBuilder<S>({shape: resolved});\n  }\n\n  // ---------------------------------------------------------------------------\n  // Fluent API — each returns a new instance\n  // ---------------------------------------------------------------------------\n\n  /** Set the select projection via a callback, labels, or FieldSet. */\n  select<NewR>(fn: QueryBuildFn<S, NewR>): SelectBuilder<S, NewR, QueryResponseToResultType<NewR, S>[]>;\n  select(labels: string[]): SelectBuilder<S>;\n  select<NewR>(fieldSet: FieldSet<NewR>): SelectBuilder<S, NewR, QueryResponseToResultType<NewR, S>[]>;\n  select<NewR = R>(fnOrLabelsOrFieldSet: QueryBuildFn<S, NewR> | string[] | FieldSet<any>): SelectBuilder<S, NewR, any> {\n    if (isLinkedInstance(fnOrLabelsOrFieldSet, FieldSet)) {\n      const labels = fnOrLabelsOrFieldSet.labels();\n      const selectFn = ((p: any) =>\n        labels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n      return this.clone<NewR, any>({selectFn, selectAllLabels: undefined, fieldSet: fnOrLabelsOrFieldSet});\n    }\n    if (Array.isArray(fnOrLabelsOrFieldSet)) {\n      const labels = fnOrLabelsOrFieldSet;\n      const selectFn = ((p: any) =>\n        labels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n      return this.clone<NewR, any>({selectFn, selectAllLabels: undefined, fieldSet: undefined});\n    }\n    return this.clone<NewR, any>({selectFn: fnOrLabelsOrFieldSet as any, selectAllLabels: undefined, fieldSet: undefined});\n  }\n\n  /** Select all decorated properties of the shape. */\n  selectAll(): SelectBuilder<S, any, QueryResponseToResultType<SelectAllQueryResponse<S>, S>[]> {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.selectAll());\n    }\n    const propertyLabels = getUniquePropertyShapes(this._shape.shape)\n      .map((ps) => ps.label);\n    const selectFn = ((p: any) =>\n      propertyLabels.map((label) => p[label])) as unknown as QueryBuildFn<S, any>;\n    return this.clone({selectFn, selectAllLabels: propertyLabels});\n  }\n\n  /** Add a where clause. */\n  where(fn: WhereClause<S>): SelectBuilder<S, R, Result> {\n    return this.clone({whereFn: fn});\n  }\n\n  /**\n   * Exclude results matching a MINUS pattern.\n   *\n   * Accepts:\n   * - A shape constructor to exclude by type: `.minus(Employee)`\n   * - A WHERE callback to exclude by condition: `.minus(p => p.hobby.equals('Chess'))`\n   * - A callback returning a property or array of properties for existence exclusion:\n   *   `.minus(p => p.hobby)` or `.minus(p => [p.hobby, p.bestFriend.name])`\n   *\n   * Chainable: `.minus(A).minus(B)` produces two separate `MINUS { }` blocks.\n   */\n  minus(shapeOrFn: ShapeConstructor<any> | WhereClause<S> | ((s: any) => any)): SelectBuilder<S, R, Result> {\n    const entry: MinusEntry<S> = {};\n    if (typeof shapeOrFn === 'function' && 'shape' in shapeOrFn) {\n      // ShapeConstructor — has a static .shape property\n      entry.shapeId = (shapeOrFn as ShapeConstructor<any>).shape?.id;\n    } else {\n      // WhereClause callback\n      entry.whereFn = shapeOrFn as WhereClause<S>;\n    }\n    const existing = this._minusEntries || [];\n    return this.clone({minusEntries: [...existing, entry]});\n  }\n\n  /** Set sort order. */\n  orderBy<OR>(fn: QueryBuildFn<S, OR>, direction: 'ASC' | 'DESC' = 'ASC'): SelectBuilder<S, R, Result> {\n    return this.clone({sortByFn: fn as any, sortDirection: direction});\n  }\n\n  /**\n   * @deprecated Use `orderBy()` instead.\n   */\n  sortBy<OR>(fn: QueryBuildFn<S, OR>, direction: 'ASC' | 'DESC' = 'ASC'): SelectBuilder<S, R, Result> {\n    return this.orderBy(fn, direction);\n  }\n\n  /** Set result limit. */\n  limit(n: number): SelectBuilder<S, R, Result> {\n    return this.clone({limit: n});\n  }\n\n  /** Set result offset. */\n  offset(n: number): SelectBuilder<S, R, Result> {\n    return this.clone({offset: n});\n  }\n\n  /** Target a single entity by ID. Implies singleResult; unwraps array Result type. */\n  for(id: string | NodeReferenceValue | PendingQueryContext | null | undefined): SelectBuilder<S, R, Result extends (infer E)[] ? E : Result> {\n    if (isLinkedInstance(id, PendingQueryContext)) {\n      // Store the pending context as subject — its .id getter resolves lazily\n      // from the global context map when the query is lowered/serialized.\n      return this.clone({subject: id as any, subjects: undefined, singleResult: true, _nullSubject: false, _pendingContextName: id.contextName}) as any;\n    }\n    if (id == null) {\n      // Return a builder that resolves to null when executed (no subject = no query).\n      // This commonly happens when getQueryContext() returns null before the user is authenticated.\n      return this.clone({subject: undefined, subjects: undefined, singleResult: true, _nullSubject: true, _pendingContextName: undefined}) as any;\n    }\n    const subject: NodeReferenceValue = typeof id === 'string' ? {id: resolveUriOrThrow(id)} : id;\n    return this.clone({subject, subjects: undefined, singleResult: true, _pendingContextName: undefined}) as any;\n  }\n\n  /**\n   * Whether the query has a pending (lazy) context that hasn't resolved yet.\n   * Returns true when .for() received a PendingQueryContext whose value isn't available yet.\n   */\n  hasPendingContext(): boolean {\n    return !!(this._pendingContextName && !this._subject?.id);\n  }\n\n  /** Target multiple entities by ID, or all if no ids given. */\n  forAll(ids?: (string | NodeReferenceValue)[]): SelectBuilder<S, R, Result> {\n    if (!ids) {\n      return this.clone({subject: undefined, subjects: undefined, singleResult: false, _pendingContextName: undefined});\n    }\n    const subjects = ids.map((id) => typeof id === 'string' ? {id: resolveUriOrThrow(id)} : id);\n    return this.clone({subject: undefined, subjects, singleResult: false, _pendingContextName: undefined});\n  }\n\n  /** Limit to one result. Unwraps array Result type to single element. */\n  one(): SelectBuilder<S, R, Result extends (infer E)[] ? E : Result> {\n    return this.clone<R, Result extends (infer E)[] ? E : Result>({limit: 1, singleResult: true});\n  }\n\n  /**\n   * Whether **any** row matches this query. Executes immediately and resolves to a\n   * real `boolean` — never a row, never `null`, never an array the caller has to\n   * interpret.\n   *\n   * ```ts\n   * await Person.select().where(p => p.name.equals('Semmy')).exists(); // boolean\n   * await Person.exists({id});                                        // the common case\n   * ```\n   *\n   * ### The query is normalised to its cheapest correct form first\n   *\n   * **Dropped** — the projection, preloads, sorting *and pagination* (`limit`/`offset`).\n   * **Kept** — filters, `minus` entries and the subject: those decide whether a match\n   * exists. `LIMIT 1` is then applied.\n   *\n   * So `.select(…).orderBy(…).offset(10).exists()` costs, and answers, exactly the\n   * same as a bare `.exists()`. Against a SPARQL store that goes out as:\n   *\n   * ```sparql\n   * ASK WHERE { ?a0 rdf:type <…> . FILTER(?a0 = <…>) }\n   * ```\n   *\n   * Pagination does not survive, and cannot: `OFFSET` skips rows of a *solution\n   * sequence*, and an ask has none. (Nor is it merely dropped — an\n   * {@link AskBuilder} has nowhere to hold it.) `exists()` answers a question about\n   * the **match set**, not about a page of it.\n   *\n   * ### Errors are not swallowed\n   *\n   * A store, transport or lowering failure rejects the returned promise; it is never\n   * reported as `false`. That includes an unresolved query-context reference in a\n   * where clause, which `exec()` deliberately reports as `null` (\"not ready\") but\n   * which `exists()` must not flatten into a boolean — and a store whose `askQuery`\n   * resolves to something that is not a boolean, which rejects rather than being\n   * coerced into one.\n   *\n   * The one case that does resolve `false` without querying is a query with **no\n   * subject to ask about** — `.for(null)`, `.for(undefined)`, or an unresolved\n   * `PendingQueryContext` *as the subject*. \"Does the node with no id exist?\" has a\n   * correct total answer, and it is `false`.\n   *\n   * @param target Optional explicit dataset, as for {@link exec}.\n   */\n  async exists(target?: IDataset): Promise<boolean> {\n    return this._toAsk().exec(target);\n  }\n\n  /**\n   * **How many** rows match this query — the total of the match set, as a real\n   * `number`.\n   *\n   * ```ts\n   * await Person.select().where(p => p.name.equals('Semmy')).count(); // number\n   * await SelectBuilder.from(shapeIri).where(…).count();              // from an IRI alone\n   * ```\n   *\n   * ### The query is normalised to its cheapest correct form first\n   *\n   * **Dropped** — the projection, preloads, sorting *and pagination*\n   * (`limit`/`offset`). **Kept** — filters, `minus` entries and the subject: those\n   * decide membership of the match set. Against a SPARQL store that goes out as:\n   *\n   * ```sparql\n   * SELECT (COUNT(DISTINCT ?a0) AS ?count)\n   * WHERE { ?a0 rdf:type <…> . ?a0 <…name> ?a0_name . FILTER(?a0_name = \"Semmy\") }\n   * ```\n   *\n   * ### `limit`/`offset` are dropped, not rejected\n   *\n   * A count of a windowed query is meaningless — `OFFSET` skips rows of a *solution\n   * sequence*, and the number a count answers is a property of the whole match set,\n   * not of a page of it. So `.limit(20).offset(40).count()` costs, and answers,\n   * exactly the same as a bare `.count()`.\n   *\n   * Dropping rather than throwing is deliberate: the paging caller holds **one**\n   * builder and wants the page *and* its total from the same filter, so rejecting\n   * the combination would force it to rebuild the builder by hand for no\n   * correctness gain. There is exactly one sensible reading, and it is this one.\n   * `.exists()` already made the same call, so the DSL has one rule — *a\n   * scalar-answering query drops the solution-sequence modifiers* — not two.\n   *\n   * Nor is the drop merely a convention: a {@link CountBuilder} has nowhere to hold\n   * a window, so it cannot be forgotten or half-applied downstream.\n   *\n   * `DISTINCT` is likewise not optional. A filter on a multi-valued property yields\n   * several rows per subject, so the count is of distinct subjects — \"how many\n   * instances match\", which is the question asked.\n   *\n   * ### Errors are not swallowed\n   *\n   * A store, transport or lowering failure **rejects**; it is never reported as `0`.\n   * `0` is a plausible count: it renders an empty table and looks like data. Do not\n   * wrap this in `.catch(() => 0)`.\n   *\n   * The one case that resolves `0` without querying is a query with no subject to\n   * count — `.for(null)`, `.for(undefined)`, or an unresolved `PendingQueryContext`\n   * *as the subject*.\n   *\n   * @param target Optional explicit dataset, as for {@link exec}.\n   */\n  async count(target?: IDataset): Promise<number> {\n    return this.toCount().exec(target);\n  }\n\n  /**\n   * Reduce this select to the count query that answers \"how many match?\".\n   *\n   * Public, unlike the ask equivalent, because a caller may want to **forward**\n   * rather than execute: `builder.toCount().toJSON()` is the `{op: 'count'}` wire\n   * envelope a router or RPC boundary sends on, and `fromJSON` turns it back into a\n   * `CountBuilder` on the other side.\n   *\n   * Only the pattern survives — shape, subject(s), filters, `minus`. The projection,\n   * preloads, sorting and pagination are not so much \"dropped\" as unrepresentable:\n   * {@link CountBuilder} has nowhere to put them. That is the point of it being a\n   * separate builder rather than a mode of this one.\n   */\n  toCount(): CountBuilder {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toCount());\n    }\n    return CountBuilder.of({\n      shapeClass: this._shape,\n      catalog: this._catalog,\n      // `.for(null)` rides along in the spec. An unresolved pending context is\n      // handled by CountBuilder.exec, which answers `0` without querying.\n      ...this._patternSpec(),\n    });\n  }\n\n  /**\n   * The pattern-bearing part of this select: shape-membership, subject(s), filters\n   * and `minus` — everything that decides which nodes are in the match set, and\n   * nothing that shapes or windows the rows describing them.\n   *\n   * Shared by {@link _toAsk} and {@link toCount} rather than written twice. That is\n   * not only about duplication: if the two normalisations drifted, `.exists()` and\n   * `.count()` would disagree about what the match set *is* — a count of 0 next to\n   * an `exists` of `true`, from the same builder.\n   */\n  private _patternSpec(): {\n    subject?: NodeReferenceValue | PendingQueryContext;\n    subjects?: NodeReferenceValue[];\n    where?: WherePath;\n    minusEntries?: RawMinusEntry[];\n    nullSubject?: boolean;\n  } {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this._patternSpec());\n    }\n    let where: WherePath | undefined;\n    if (this._whereFn) {\n      where = processWhereClause(this._whereFn, this._shape);\n    } else if (this._where) {\n      where = this._where;\n    }\n\n    let minusEntries: RawMinusEntry[] | undefined;\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      minusEntries = this._evaluateMinusEntries();\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      minusEntries = this._rawMinusEntries;\n    }\n\n    // A PendingQueryContext must survive as itself. It has an `id` *getter*, so\n    // narrowing it to `{id}` here would silently resolve it against THIS process's\n    // context map — and the query would then travel as a concrete IRI where the\n    // equivalent select travels as `{\"@ctx\": name}` for the receiver to resolve.\n    const subject =\n      isLinkedInstance(this._subject, PendingQueryContext)\n        ? this._subject\n        : this._subject && typeof this._subject === 'object' && 'id' in this._subject\n          ? {id: (this._subject as NodeReferenceValue).id}\n          : undefined;\n\n    return {\n      subject,\n      subjects: this._subjects,\n      where,\n      minusEntries,\n      nullSubject: this._nullSubject,\n    };\n  }\n\n  /**\n   * Reduce this select to the ask query that answers the same existence question.\n   *\n   * Only the pattern survives — shape, subject(s), filters, `minus`. The\n   * projection, preloads, sorting and pagination are not \"dropped\" so much as\n   * unrepresentable: {@link AskBuilder} has nowhere to put them. That is the point\n   * of it being a separate builder rather than a mode of this one — the\n   * normalisation cannot be forgotten or half-applied.\n   */\n  private _toAsk(): AskBuilder {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this._toAsk());\n    }\n    return AskBuilder.of({\n      shapeClass: this._shape,\n      catalog: this._catalog,\n      // `.for(null)` rides along in the spec. An unresolved pending context is\n      // handled by AskBuilder.exec, which sees the live context and answers `false`\n      // without querying.\n      ...this._patternSpec(),\n    });\n  }\n\n  /**\n   * Preload a component's query fields at the given property path.\n   *\n   * This merges the component's query paths into this query's selection,\n   * wrapping them in an OPTIONAL block (handled by the IR pipeline).\n   *\n   * Equivalent to the DSL's `.preloadFor()`:\n   * ```ts\n   * // DSL style\n   * Person.select(p => p.bestFriend.preloadFor(PersonCard))\n   * // SelectBuilder style\n   * SelectBuilder.from(Person).select(p => [p.name]).preload('bestFriend', PersonCard)\n   * ```\n   *\n   * NOTE: Preloads hold live component references and are not serializable.\n   * They are merged into the selection when the field set is evaluated\n   * (`_fieldsWithPreloads()`), so changes to preload handling must account for\n   * the selectFn wrapping logic.\n   */\n  preload<CS extends Shape, CR>(\n    path: string,\n    component: QueryComponentLike<CS, CR>,\n  ): SelectBuilder<S, R, Result> {\n    const newPreloads = [...(this._preloads || []), {path, component}];\n    return this.clone({preloads: newPreloads});\n  }\n\n  /**\n   * Returns the current selection as a FieldSet.\n   * If the selection was set via a FieldSet, returns that directly.\n   * If set via selectAll labels, constructs a FieldSet from them.\n   * If set via a callback, eagerly evaluates it through the proxy to produce a FieldSet.\n   */\n  fields(): FieldSet | undefined {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.fields());\n    }\n    if (this._fieldSet) {\n      return this._fieldSet;\n    }\n    if (this._selectAllLabels) {\n      return FieldSet.for(this._shape.shape, this._selectAllLabels);\n    }\n    if (this._selectFn) {\n      // Eagerly evaluate the callback through FieldSet.for(ShapeClass, callback)\n      // The callback is pure — same proxy always produces same paths.\n      return FieldSet.for(this._shape, this._selectFn as unknown as (p: any) => any[]);\n    }\n    return undefined;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Internal helpers\n  // ---------------------------------------------------------------------------\n\n  /** Return the FieldSet with preload entries merged in (if any). */\n  private _fieldsWithPreloads(): FieldSet | undefined {\n    let fs = this.fields();\n    if (this._preloads && this._preloads.length > 0) {\n      const preloadFn = (p: any) => {\n        return this._preloads!.map((entry) => p[entry.path].preloadFor(entry.component));\n      };\n      const preloadFs = FieldSet.for(this._shape, preloadFn);\n      if (fs) {\n        fs = FieldSet.createFromEntries(fs.shape, [\n          ...(fs.entries as FieldSetEntry[]),\n          ...(preloadFs.entries as FieldSetEntry[]),\n        ]);\n      } else {\n        fs = preloadFs;\n      }\n    }\n    return fs;\n  }\n\n  /** Evaluate minus entry callbacks into RawMinusEntry[] (plain data). */\n  private _evaluateMinusEntries(): RawMinusEntry[] {\n    const proxy = createProxiedPathBuilder(this._shape);\n    return this._minusEntries!.map((entry) => {\n      if (entry.shapeId) {\n        return {shapeId: entry.shapeId};\n      }\n      if (entry.whereFn) {\n        const result = (entry.whereFn as Function)(proxy);\n\n        if (Array.isArray(result)) {\n          const propertyPaths = result.map((item: any) => {\n            const segments = FieldSet.collectPropertySegments(item);\n            return segments.map((seg): PropertyPathSegment => ({propertyShapeId: seg.id}));\n          });\n          return {propertyPaths};\n        }\n\n        if (result && typeof result === 'object' && 'property' in result && 'subject' in result) {\n          const segments = FieldSet.collectPropertySegments(result);\n          return {propertyPaths: [segments.map((seg): PropertyPathSegment => ({propertyShapeId: seg.id}))]};\n        }\n\n        // WHERE-based exclusion\n        return {where: processWhereClause(entry.whereFn, this._shape)};\n      }\n      return {};\n    });\n  }\n\n  // ---------------------------------------------------------------------------\n  // Serialization\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Serialize this SelectBuilder to a plain JSON object.\n   *\n   * Selections are serializable regardless of how they were set (FieldSet,\n   * string[], selectAll, or callback). Callback-based selections are eagerly\n   * evaluated through the proxy to produce a FieldSet.\n   *\n   * Where, orderBy, and minus clauses are evaluated through the proxy and\n   * serialized as plain data structures. Preloads are merged into the FieldSet\n   * as subSelect entries, producing identical IR on deserialization.\n   */\n  toJSON(): QueryBuilderJSON {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toJSON());\n    }\n    const shapeId = this._shape.shape?.id || '';\n    const json: QueryBuilderJSON = {\n      v: WIRE_VERSION,\n      shape: shapeId,\n    };\n\n    const fs = this._fieldsWithPreloads();\n    if (fs) {\n      json.fields = fs.toJSON().fields;\n    }\n\n    if (this._limit !== undefined) {\n      json.limit = this._limit;\n    }\n    if (this._offset !== undefined) {\n      json.offset = this._offset;\n    }\n    if (this._pendingContextName) {\n      // Carry the context reference, not its (possibly unresolved) id, so the\n      // receiver resolves it against its own context map at lowering time.\n      json.subject = encodeContextRef(this._pendingContextName);\n    } else if (this._subject && typeof this._subject === 'object' && 'id' in this._subject) {\n      json.subject = (this._subject as NodeReferenceValue).id;\n    }\n    if (this._subjects && this._subjects.length > 0) {\n      json.subjects = this._subjects.map((s) => s.id);\n    }\n    if (this._singleResult) {\n      json.one = true;\n    }\n\n    if (this._whereFn) {\n      json.where = serializeWherePath(processWhereClause(this._whereFn, this._shape), this._shape.shape);\n    } else if (this._where) {\n      json.where = serializeWherePath(this._where, this._shape.shape);\n    }\n\n    if (this._sortByFn) {\n      json.sortBy = serializeSortByPath(\n        evaluateSortCallback(this._shape, this._sortByFn as unknown as (p: any) => any, this._sortDirection || 'ASC'),\n      );\n    } else if (this._sortBy) {\n      json.sortBy = serializeSortByPath(this._sortBy);\n    }\n\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      json.minusEntries = this._evaluateMinusEntries().map((e) =>\n        serializeRawMinusEntry(e, this._shape.shape),\n      );\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      json.minusEntries = this._rawMinusEntries.map((e) =>\n        serializeRawMinusEntry(e, this._shape.shape),\n      );\n    }\n\n    if (this._nullSubject) {\n      json.nullSubject = true;\n    }\n\n    return json;\n  }\n\n  /**\n   * Reconstruct a SelectBuilder from a JSON object.\n   * Resolves shape IRI via getShapeClass() and field paths as label selections.\n   */\n  static fromJSON<S extends Shape = Shape>(json: QueryBuilderJSON): SelectBuilder<S> {\n    assertWireVersion(json.v);\n    let builder = SelectBuilder.from<S>(json.shape as any);\n\n    if (json.fields && json.fields.length > 0) {\n      const fieldSet = FieldSet.fromJSON({\n        shape: json.shape,\n        fields: json.fields,\n      });\n      builder = builder.select(fieldSet) as SelectBuilder<S>;\n    }\n\n    if (json.limit !== undefined) {\n      builder = builder.limit(json.limit) as SelectBuilder<S>;\n    }\n    if (json.offset !== undefined) {\n      builder = builder.offset(json.offset) as SelectBuilder<S>;\n    }\n    if (json.subject) {\n      // A `{@ctx}` subject rehydrates as a pending context (preserving the name\n      // so it re-serializes as a context reference and resolves live).\n      const subject = isContextRefJSON(json.subject)\n        ? new PendingQueryContext(json.subject['@ctx'])\n        : json.subject;\n      builder = builder.for(subject) as SelectBuilder<S>;\n    }\n    if (json.subjects && json.subjects.length > 0) {\n      builder = builder.forAll(json.subjects) as SelectBuilder<S>;\n    }\n    if (json.one && !json.subject) {\n      builder = builder.one() as SelectBuilder<S>;\n    }\n\n    // Restore pre-evaluated data via clone — safe because fromJSON is in the same class.\n    const overrides: Partial<QueryBuilderInit<S, any>> = {};\n    const nodeShape = builder._shape.shape;\n\n    // Restore where clause\n    if (json.where && nodeShape) {\n      overrides._where = deserializeWherePath(nodeShape, json.where);\n    }\n\n    // Restore sort key + direction (direction rides on the ordered sortBy array)\n    if (json.sortBy && json.sortBy.length > 0 && nodeShape) {\n      const sortBy = deserializeSortByPath(nodeShape, json.sortBy);\n      overrides._sortBy = sortBy;\n      overrides.sortDirection = sortBy.directions[0];\n    }\n\n    // Restore minus entries\n    if (json.minusEntries && json.minusEntries.length > 0 && nodeShape) {\n      overrides._rawMinusEntries = json.minusEntries.map((e) =>\n        deserializeRawMinusEntry(nodeShape, e),\n      );\n    }\n\n    // Restore nullSubject flag\n    if (json.nullSubject) {\n      overrides._nullSubject = true;\n    }\n\n    if (Object.keys(overrides).length > 0) {\n      builder = (builder as any).clone(overrides) as SelectBuilder<S>;\n    }\n\n    return builder;\n  }\n\n  // ---------------------------------------------------------------------------\n  // Build & execute\n  // ---------------------------------------------------------------------------\n\n  /**\n   * Get the raw pipeline input.\n   *\n   * Constructs RawSelectInput directly from FieldSet entries.\n   */\n  toRawInput(): RawSelectInput {\n    const catalog = this._catalog;\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.toRawInput());\n    }\n    return this._buildDirectRawInput();\n  }\n\n  /** Build RawSelectInput directly from FieldSet entries. */\n  private _buildDirectRawInput(): RawSelectInput {\n    const fs = this._fieldsWithPreloads();\n    const entries = fs ? fs.entries : [];\n\n    let where: WherePath | undefined;\n    if (this._whereFn) {\n      where = processWhereClause(this._whereFn, this._shape);\n    } else if (this._where) {\n      where = this._where;\n    }\n\n    let sortBy: SortByPath | undefined;\n    if (this._sortByFn) {\n      sortBy = evaluateSortCallback(\n        this._shape,\n        this._sortByFn as unknown as (p: any) => any,\n        this._sortDirection || 'ASC',\n      );\n    } else if (this._sortBy) {\n      sortBy = this._sortBy;\n    }\n\n    const input: RawSelectInput = {\n      entries,\n      subject: this._subject,\n      limit: this._limit,\n      offset: this._offset,\n      shape: this._shape,\n      sortBy,\n      singleResult:\n        this._singleResult ||\n        !!(\n          this._subject &&\n          typeof this._subject === 'object' &&\n          'id' in this._subject\n        ),\n    };\n\n    if (where) {\n      input.where = where;\n    }\n    if (this._subjects && this._subjects.length > 0) {\n      input.subjects = this._subjects;\n    }\n    if (this._minusEntries && this._minusEntries.length > 0) {\n      input.minusEntries = this._evaluateMinusEntries();\n    } else if (this._rawMinusEntries && this._rawMinusEntries.length > 0) {\n      input.minusEntries = this._rawMinusEntries;\n    }\n\n    return input;\n  }\n\n  /** Discriminator for the free `lower()` function and dataset routing. */\n  readonly __queryKind = 'select' as const;\n\n  /** The shape this query targets — the routing key datasets/`LinkedStorage` use. */\n  get shape(): NodeShapeData {\n    return this._shape.shape;\n  }\n\n  /**\n   * The catalog this builder resolves shapes in — captured when it was built, kept by\n   * every derived builder. Undefined = the global registry. Never serialized.\n   */\n  get catalog(): ShapeCatalog | undefined {\n    return this._catalog;\n  }\n\n  /**\n   * Execute the query and return results.\n   *\n   * @param target Optional explicit dataset (a store or a router — a router *is* an\n   *   `IDataset`) to run against. Omitted → the global query dispatch (the router's\n   *   shape-based default). A `target` runs on that dataset only; the global router is\n   *   untouched. `await`ing the builder (the PromiseLike path) always uses the global\n   *   dispatch — only `.exec(target)` overrides.\n   */\n  async exec(target?: IDataset): Promise<Result> {\n    return this._run(target, true) as Promise<Result>;\n  }\n\n  /**\n   * Shared execution path for {@link exec} and {@link exists}.\n   *\n   * @param swallowUnresolvedContext When true (the `exec` path), a where-clause\n   *   context reference that has not resolved yet surfaces as `null` — \"not ready\",\n   *   which a reactive layer re-runs once the context lands. `exists()` passes\n   *   false: it must not turn \"could not ask\" into a boolean.\n   */\n  private async _run(\n    target: IDataset | undefined,\n    swallowUnresolvedContext: boolean,\n  ): Promise<unknown> {\n    if (this._nullSubject) {\n      // .for(null/undefined) was called — return null instead of executing a broken query.\n      return null;\n    }\n    if (this._pendingContextName && !this._subject?.id) {\n      // Pending context hasn't resolved yet — return null rather than querying without a subject.\n      return null;\n    }\n    // Dispatch the live (closed) query; the dataset decides whether to lower it.\n    // `async` ensures a missing global dispatch surfaces as a rejected promise, not a sync throw.\n    const dispatch = target ?? getQueryDispatch();\n    try {\n      return await dispatch.selectQuery(this);\n    } catch (err) {\n      // A where-clause context reference that hasn't resolved yet surfaces as\n      // UnresolvedContextError when the dataset lowers the query. For SELECT this\n      // means \"not ready\" — return null (a reactive layer re-runs once it lands),\n      // mirroring the pending-subject behavior. Mutations still throw.\n      if (swallowUnresolvedContext && isLinkedError(err, UnresolvedContextError)) {\n        return null;\n      }\n      // The message names the query, which is what a human needs. `cause` keeps\n      // the ORIGINAL error reachable as an object, which is what code needs: a\n      // store error's status/endpoint/class is how a caller tells \"this dataset\n      // does not exist\" from \"this query is wrong\", and without the chain the\n      // only way left is to pattern-match this string. Written with\n      // defineProperty rather than `new Error(msg, {cause})` because this\n      // package targets es6, where that overload is not typed; the property\n      // shape (own, non-enumerable) is identical.\n      const wrapped = Error(`Error while executing query: ${(err as Error).stack}.\\n\\nQuery related to this error: ${JSON.stringify(this.toJSON())}`);\n      Object.defineProperty(wrapped, 'cause', {\n        value: err,\n        writable: true,\n        configurable: true,\n        enumerable: false,\n      });\n      throw wrapped;\n    }\n  }\n\n\n  /**\n   * Go live: subscribe to this query and keep its result current.\n   *\n   * Returns a {@link LiveQuery} handle. `await` it for the first result,\n   * `subscribe()` for every later one, `close()` when done. A listener may be\n   * passed directly as the first argument. Requires the live-query store to be\n   * loaded, which importing `@_linked/core` (the package root) does.\n   */\n  live<R = Result>(listenerOrOptions?: LiveListener<R> | LiveQueryOptions, options?: LiveQueryOptions): LiveQuery<R> {\n    const listener = typeof listenerOrOptions === 'function' ? listenerOrOptions : undefined;\n    const opts = typeof listenerOrOptions === 'function' ? options : listenerOrOptions;\n    return requireLiveQueryStore().subscribe<R>(this as any, listener, opts);\n  }\n\n  // ---------------------------------------------------------------------------\n  // Promise-compatible interface\n  // ---------------------------------------------------------------------------\n\n  /** `await` triggers execution. */\n  then<TResult1 = Result, TResult2 = never>(\n    onfulfilled?: ((value: Result) => TResult1 | PromiseLike<TResult1>) | null,\n    onrejected?: ((reason: any) => TResult2 | PromiseLike<TResult2>) | null,\n  ): Promise<TResult1 | TResult2> {\n    return this.exec().then(onfulfilled, onrejected);\n  }\n\n  /** Catch errors from execution. Chain off then() to avoid re-executing. */\n  catch<TResult = never>(\n    onrejected?: ((reason: any) => TResult | PromiseLike<TResult>) | null,\n  ): Promise<Result | TResult> {\n    return this.then().catch(onrejected);\n  }\n\n  /** Finally handler after execution. Chain off then() to avoid re-executing. */\n  finally(onfinally?: (() => void) | null): Promise<Result> {\n    return this.then().finally(onfinally);\n  }\n\n  get [Symbol.toStringTag](): string {\n    return 'SelectBuilder';\n  }\n}\nbrandLinkedClass(SelectBuilder, '@_linked/core', 'SelectBuilder');\n\n\n/** @deprecated Renamed to `SelectBuilder`. This alias will be removed in a future major. */\nexport {SelectBuilder as QueryBuilder};\n"]}

package/lib/esm/queries/QueryContext.js

@@ -1,7 +1,17 @@
 import { QueryShape } from './SelectQuery.js';
 import { Shape, createShapeTarget } from '../shapes/Shape.js';
-import { brandLinkedError } from '../utils/linkedError.js';
-const queryContext = new Map();
+import { brandLinkedClass, brandLinkedError, isLinkedInstance } from '../utils/linkedError.js';
+import { sharedState } from '../utils/sharedState.js';
+/**
+ * The context map and its listeners, shared by every copy of core in the runtime: a context
+ * the app sets through one copy must resolve for a query lowered by the other, and a React
+ * layer subscribed through one copy must hear a change made through the other.
+ */
+const contextState = sharedState('@_linked/core', 'QueryContext', () => ({
+    contexts: new Map(),
+    listeners: new Set(),
+}));
+const queryContext = contextState.contexts;
 /**
  * A live reference returned by getQueryContext when the context hasn't been set yet.
  * Its `id` getter resolves lazily from the global context map, so queries built with
@@ -16,6 +26,7 @@ export class PendingQueryContext {
         return (_a = queryContext.get(this.contextName)) === null || _a === void 0 ? void 0 : _a.id;
     }
 }
+brandLinkedClass(PendingQueryContext, '@_linked/core', 'PendingQueryContext');
 /**
  * Thrown when a query carrying a context reference is lowered but the context
  * isn't set in the current process. A context ref is carried in DSL-JSON and
@@ -31,7 +42,7 @@ export class UnresolvedContextError extends Error {
     }
 }
 brandLinkedError(UnresolvedContextError, '@_linked/core', 'UnresolvedContextError');
-const contextListeners = new Set();
+const contextListeners = contextState.listeners;
 /**
  * Subscribe to query-context changes. Returns an unsubscribe function.
  *
@@ -72,7 +83,7 @@ function notifyContextChange(name) {
  */
 export function asContextRef(value) {
     var _a;
-    if (value instanceof PendingQueryContext)
+    if (isLinkedInstance(value, PendingQueryContext))
         return value;
     if (!value || typeof value !== 'object')
         return undefined;
@@ -107,7 +118,7 @@ export function setQueryContext(name, value, shapeType) {
     // Already a QShape — stamp the underlying shape and store as-is. (Checked before
     // the plain-`{id}` branch below: a QueryShape's `.id` getter is also a string, so
     // testing for `{id}` first would wrongly require a shapeType and no-op.)
-    if (value instanceof QueryShape) {
+    if (isLinkedInstance(value, QueryShape)) {
         const orig = value.originalValue;
         if (orig) {
             orig.__queryContextName = name;
@@ -120,7 +131,7 @@ export function setQueryContext(name, value, shapeType) {
     }
     // A Shape-shaped value (e.g. a `createShapeTarget` proxy target) — stamp it and
     // wrap as a QShape. Needs no shapeType (it already carries its shape class).
-    if (value instanceof Shape) {
+    if (isLinkedInstance(value, Shape)) {
         value.__queryContextName = name;
         if (typeof value.id === 'string')
             value.__queryContextId = value.id;