@_linked/core 2.30.1 → 2.31.0

package/lib/esm/queries/QueryFactory.d.ts

@@ -64,12 +64,6 @@ export type NodeDescriptionValue = {
      * Optional, if not provided a new id will be generated.
      */
     __id?: string;
-    /**
-     * Write this nested node as a fresh blank node carrying only its field triples (no
-     * `rdf:type`). For RDF syntax structures whose meaning comes from the triple that
-     * references them, like a SHACL property path. Create-only and never with `__id`.
-     */
-    __blank?: true;
 };
 export type UpdateNodePropertyValue = {
     prop: PropertyShapeData;

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

@@ -1 +1 @@
-{"version":3,"file":"QueryFactory.js","sourceRoot":"","sources":["../../../src/queries/QueryFactory.ts"],"names":[],"mappings":"AAyKA,OAAO,EAAC,eAAe,EAAC,MAAM,2BAA2B,CAAC;AAG1D,MAAM,OAAgB,YAAY;CAAG;AAErC,MAAM,UAAU,sBAAsB,CACpC,KAAU;IAEV,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE9D,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;IAC3B,IAAI,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC;IACjC,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACxC,mBAAmB;IACnB,OAAO,CACL,CAAC,SAAS,IAAI,YAAY,IAAI,OAAO,KAAK,CAAC,CAAC;QAC5C,CAAC,SAAS,IAAI,OAAO,KAAK,CAAC,CAAC;QAC5B,CAAC,YAAY,IAAI,OAAO,KAAK,CAAC,CAAC,CAChC,CAAC;AACJ,CAAC","sourcesContent":["import type {NodeShapeData, PropertyShapeData} from '../shapes/SHACL.js';\nimport {Shape} from '../shapes/Shape.js';\nimport {ShapeSet} from '../collections/ShapeSet.js';\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {ExpressionNode} from '../expressions/ExpressionNode.js';\n\nexport type Prettify<T> = T extends infer R\n  ? {\n      [K in keyof R]: R[K];\n    }\n  : never;\n\n/**\n * Recursively adds an id property to all objects in the object.\n * Also makes all keys optional.\n */\ntype _AddId<U> = U extends string | number | boolean | Date | null | undefined\n  ? U\n  : U extends Array<infer T>\n    ? Array<_AddId<T>>\n    : WithId<U>;\n\ntype RemoveId<U> = Omit<U, 'id'>;\n\ntype WithId<U> = U & {id: string};\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (\n  k: infer I,\n) => void\n  ? I\n  : never;\n\ntype CombineTypes<T> = {\n  [K in keyof UnionToIntersection<T>]: T extends {[P in K]?: infer V}\n    ? _AddId<V>\n    : never;\n};\n\ntype IsPlainObject<T> = T extends object\n  ? T extends any[]\n    ? false\n    : T extends Function\n      ? false\n      : T extends Date\n        ? false\n        : T extends RegExp\n          ? false\n          : T extends Error\n            ? false\n            : T extends null\n              ? false\n              : T extends undefined\n                ? false\n                : T extends object\n                  ? true\n                  : false\n  : false;\n\ntype RecursiveTransform<T, IsCreate = false> = T extends\n  | string\n  | number\n  | boolean\n  | Date\n  | null\n  | undefined\n  ? T\n  : T extends Array<infer U>\n    ? UpdatedSet<Prettify<RecursiveTransform<U>>, IsCreate>\n    : IsSetModification<T> extends true\n      ? ModifiedSet<T, IsCreate>\n      : IsPlainObject<T> extends true\n        ? // ? WithId<{ [K in keyof T]-?: Prettify<RecursiveTransform<T[K]>> }>\n          WithId<{[K in keyof T]: Prettify<RecursiveTransform<T[K], IsCreate>>}>\n        : T;\n\n//for update() we use {updatedTo} but for create() we actually just return the array of new values;\ntype UpdatedSet<U, IsCreate> = IsCreate extends true\n  ? U[]\n  : {\n      updatedTo: U[];\n    };\ntype IsSetModification<T> = T extends {add?: any; remove?: any} ? true : false;\ntype AddedType<T> = T extends {add: (infer U)[]}\n  ? U\n  : T extends {add: infer U}\n    ? U\n    : never;\n\ntype RemovedType<T> = T extends {remove: (infer U)[]}\n  ? U\n  : T extends {remove: infer U}\n    ? U\n    : never;\n\ntype ModifiedSet<T, IsCreate = false> = {\n  added: AddId<AddedType<T>, IsCreate>[];\n  removed: AddId<RemovedType<T>, IsCreate>[];\n};\n\nexport type AddId<T, IsCreate = false> = Prettify<\n  RecursiveTransform<T, IsCreate>\n>;\n\nexport type UpdatePartial<S = Shape> =\n  | UpdateNodeDescription<S>\n  | NodeReferenceValue;\ntype UpdateNodeDescription<Shape> = Partial<\n  Omit<\n    {\n      [P in KeysWithoutFunctions<Shape>]: ShapePropValueToUpdatePartial<\n        Shape[P]\n      >;\n    },\n    'node' | 'nodeShape' | 'namedNode' | 'targetClass'\n  >\n>;\ntype KeysWithoutFunctions<T> = {\n  [K in keyof T]: T[K] extends Function ? never : K;\n}[keyof T];\n\ntype ShapePropValueToUpdatePartial<ShapeProperty> = ShapeProperty extends Shape\n  ? UpdatePartial<ShapeProperty>\n  : ShapeProperty extends ShapeSet<infer SSType>\n    ? SetUpdateValue<SSType>\n    : ShapeProperty | ExpressionNode;\n\ntype SetUpdateValue<SSType> = UpdatePartial<SSType>[] | SetModification<SSType>;\n\nexport type SetModification<SSType> = {\n  add?: UpdatePartial<SSType>[] | UpdatePartial<SSType>;\n  remove?: UpdatePartial<SSType>[] | UpdatePartial<SSType>;\n};\n\nexport type SetModificationValue = {\n  $add?: UpdatePartial[];\n  $remove?: NodeReferenceValue[];\n};\n\ntype UnsetValue = undefined;\nexport type LiteralUpdateValue = string | number | boolean | Date;\nexport type PropUpdateValue =\n  | SinglePropertyUpdateValue\n  | SinglePropertyUpdateValue[]\n  | SetModificationValue;\nexport type SinglePropertyUpdateValue =\n  | NodeDescriptionValue\n  | NodeReferenceValue\n  | LiteralUpdateValue\n  | UnsetValue;\nexport type NodeDescriptionValue = {\n  shape: NodeShapeData;\n  fields: UpdateNodePropertyValue[];\n  /**\n   * The id of the node to be created.\n   * Optional, if not provided a new id will be generated.\n   */\n  __id?: string;\n  /**\n   * Write this nested node as a fresh blank node carrying only its field triples (no\n   * `rdf:type`). For RDF syntax structures whose meaning comes from the triple that\n   * references them, like a SHACL property path. Create-only and never with `__id`.\n   */\n  __blank?: true;\n};\nexport type UpdateNodePropertyValue = {\n  prop: PropertyShapeData;\n  val: PropUpdateValue;\n};\nexport type ShapeReferenceValue = {id: string; shape: NodeReferenceValue};\nexport {toNodeReference} from '../utils/NodeReference.js';\nexport type {NodeReferenceValue};\n\nexport abstract class QueryFactory {}\n\nexport function isSetModificationValue(\n  value: any,\n): value is SetModificationValue {\n  if (value === null || typeof value !== 'object') return false;\n\n  let hasAddKey = value.$add;\n  let hasRemoveKey = value.$remove;\n  let numKeys = Object.keys(value).length;\n  //has no other keys\n  return (\n    (hasAddKey && hasRemoveKey && numKeys === 2) ||\n    (hasAddKey && numKeys === 1) ||\n    (hasRemoveKey && numKeys === 1)\n  );\n}\n\n"]}
+{"version":3,"file":"QueryFactory.js","sourceRoot":"","sources":["../../../src/queries/QueryFactory.ts"],"names":[],"mappings":"AAmKA,OAAO,EAAC,eAAe,EAAC,MAAM,2BAA2B,CAAC;AAG1D,MAAM,OAAgB,YAAY;CAAG;AAErC,MAAM,UAAU,sBAAsB,CACpC,KAAU;IAEV,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE9D,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;IAC3B,IAAI,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC;IACjC,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACxC,mBAAmB;IACnB,OAAO,CACL,CAAC,SAAS,IAAI,YAAY,IAAI,OAAO,KAAK,CAAC,CAAC;QAC5C,CAAC,SAAS,IAAI,OAAO,KAAK,CAAC,CAAC;QAC5B,CAAC,YAAY,IAAI,OAAO,KAAK,CAAC,CAAC,CAChC,CAAC;AACJ,CAAC","sourcesContent":["import type {NodeShapeData, PropertyShapeData} from '../shapes/SHACL.js';\nimport {Shape} from '../shapes/Shape.js';\nimport {ShapeSet} from '../collections/ShapeSet.js';\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {ExpressionNode} from '../expressions/ExpressionNode.js';\n\nexport type Prettify<T> = T extends infer R\n  ? {\n      [K in keyof R]: R[K];\n    }\n  : never;\n\n/**\n * Recursively adds an id property to all objects in the object.\n * Also makes all keys optional.\n */\ntype _AddId<U> = U extends string | number | boolean | Date | null | undefined\n  ? U\n  : U extends Array<infer T>\n    ? Array<_AddId<T>>\n    : WithId<U>;\n\ntype RemoveId<U> = Omit<U, 'id'>;\n\ntype WithId<U> = U & {id: string};\n\ntype UnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (\n  k: infer I,\n) => void\n  ? I\n  : never;\n\ntype CombineTypes<T> = {\n  [K in keyof UnionToIntersection<T>]: T extends {[P in K]?: infer V}\n    ? _AddId<V>\n    : never;\n};\n\ntype IsPlainObject<T> = T extends object\n  ? T extends any[]\n    ? false\n    : T extends Function\n      ? false\n      : T extends Date\n        ? false\n        : T extends RegExp\n          ? false\n          : T extends Error\n            ? false\n            : T extends null\n              ? false\n              : T extends undefined\n                ? false\n                : T extends object\n                  ? true\n                  : false\n  : false;\n\ntype RecursiveTransform<T, IsCreate = false> = T extends\n  | string\n  | number\n  | boolean\n  | Date\n  | null\n  | undefined\n  ? T\n  : T extends Array<infer U>\n    ? UpdatedSet<Prettify<RecursiveTransform<U>>, IsCreate>\n    : IsSetModification<T> extends true\n      ? ModifiedSet<T, IsCreate>\n      : IsPlainObject<T> extends true\n        ? // ? WithId<{ [K in keyof T]-?: Prettify<RecursiveTransform<T[K]>> }>\n          WithId<{[K in keyof T]: Prettify<RecursiveTransform<T[K], IsCreate>>}>\n        : T;\n\n//for update() we use {updatedTo} but for create() we actually just return the array of new values;\ntype UpdatedSet<U, IsCreate> = IsCreate extends true\n  ? U[]\n  : {\n      updatedTo: U[];\n    };\ntype IsSetModification<T> = T extends {add?: any; remove?: any} ? true : false;\ntype AddedType<T> = T extends {add: (infer U)[]}\n  ? U\n  : T extends {add: infer U}\n    ? U\n    : never;\n\ntype RemovedType<T> = T extends {remove: (infer U)[]}\n  ? U\n  : T extends {remove: infer U}\n    ? U\n    : never;\n\ntype ModifiedSet<T, IsCreate = false> = {\n  added: AddId<AddedType<T>, IsCreate>[];\n  removed: AddId<RemovedType<T>, IsCreate>[];\n};\n\nexport type AddId<T, IsCreate = false> = Prettify<\n  RecursiveTransform<T, IsCreate>\n>;\n\nexport type UpdatePartial<S = Shape> =\n  | UpdateNodeDescription<S>\n  | NodeReferenceValue;\ntype UpdateNodeDescription<Shape> = Partial<\n  Omit<\n    {\n      [P in KeysWithoutFunctions<Shape>]: ShapePropValueToUpdatePartial<\n        Shape[P]\n      >;\n    },\n    'node' | 'nodeShape' | 'namedNode' | 'targetClass'\n  >\n>;\ntype KeysWithoutFunctions<T> = {\n  [K in keyof T]: T[K] extends Function ? never : K;\n}[keyof T];\n\ntype ShapePropValueToUpdatePartial<ShapeProperty> = ShapeProperty extends Shape\n  ? UpdatePartial<ShapeProperty>\n  : ShapeProperty extends ShapeSet<infer SSType>\n    ? SetUpdateValue<SSType>\n    : ShapeProperty | ExpressionNode;\n\ntype SetUpdateValue<SSType> = UpdatePartial<SSType>[] | SetModification<SSType>;\n\nexport type SetModification<SSType> = {\n  add?: UpdatePartial<SSType>[] | UpdatePartial<SSType>;\n  remove?: UpdatePartial<SSType>[] | UpdatePartial<SSType>;\n};\n\nexport type SetModificationValue = {\n  $add?: UpdatePartial[];\n  $remove?: NodeReferenceValue[];\n};\n\ntype UnsetValue = undefined;\nexport type LiteralUpdateValue = string | number | boolean | Date;\nexport type PropUpdateValue =\n  | SinglePropertyUpdateValue\n  | SinglePropertyUpdateValue[]\n  | SetModificationValue;\nexport type SinglePropertyUpdateValue =\n  | NodeDescriptionValue\n  | NodeReferenceValue\n  | LiteralUpdateValue\n  | UnsetValue;\nexport type NodeDescriptionValue = {\n  shape: NodeShapeData;\n  fields: UpdateNodePropertyValue[];\n  /**\n   * The id of the node to be created.\n   * Optional, if not provided a new id will be generated.\n   */\n  __id?: string;\n};\nexport type UpdateNodePropertyValue = {\n  prop: PropertyShapeData;\n  val: PropUpdateValue;\n};\nexport type ShapeReferenceValue = {id: string; shape: NodeReferenceValue};\nexport {toNodeReference} from '../utils/NodeReference.js';\nexport type {NodeReferenceValue};\n\nexport abstract class QueryFactory {}\n\nexport function isSetModificationValue(\n  value: any,\n): value is SetModificationValue {\n  if (value === null || typeof value !== 'object') return false;\n\n  let hasAddKey = value.$add;\n  let hasRemoveKey = value.$remove;\n  let numKeys = Object.keys(value).length;\n  //has no other keys\n  return (\n    (hasAddKey && hasRemoveKey && numKeys === 2) ||\n    (hasAddKey && numKeys === 1) ||\n    (hasRemoveKey && numKeys === 1)\n  );\n}\n\n"]}

package/lib/esm/queries/lowerMutationJSON.js

@@ -98,7 +98,7 @@ export function decodeNodeData(json, shape) {
     const nodeShape = typeof json.__shape === 'string' ? requireShape(json.__shape) : shape;
     const fields = [];
     for (const [key, val] of Object.entries(json)) {
-        if (key === '__id' || key === '__shape' || key === '__blank' || val === undefined)
+        if (key === '__id' || key === '__shape' || val === undefined)
             continue;
         const prop = getPropertyShape(nodeShape, key);
         if (!prop) {
@@ -109,11 +109,6 @@ export function decodeNodeData(json, shape) {
     const desc = { shape: nodeShape, fields };
     if (typeof json.__id === 'string')
         desc.__id = json.__id;
-    if (json.__blank !== undefined) {
-        if (json.__blank !== true)
-            throw new Error(`__blank must be true when given, got ${JSON.stringify(json.__blank)}`);
-        desc.__blank = true;
-    }
     return desc;
 }
 function lowerWhere(shape, json) {

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

@@ -1 +1 @@
-{"version":3,"file":"lowerMutationJSON.js","sourceRoot":"","sources":["../../../src/queries/lowerMutationJSON.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAYH,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAQ5D,OAAO,EAAC,cAAc,EAAC,MAAM,kCAAkC,CAAC;AAChE,OAAO,EAAC,YAAY,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AAEnE,OAAO,EACL,oBAAoB,GAErB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,OAAO,EAAC,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAC,cAAc,EAAC,MAAM,cAAc,CAAC;AAC5C,OAAO,EACL,8BAA8B,EAC9B,8BAA8B,EAC9B,8BAA8B,EAC9B,mCAAmC,EACnC,8BAA8B,EAC9B,iCAAiC,EACjC,mCAAmC,GACpC,MAAM,iBAAiB,CAAC;AAIzB,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAC,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAC,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,YAAY,GAIb,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAC,WAAW,EAAsB,MAAM,yBAAyB,CAAC;AACzE,OAAO,EAAC,eAAe,EAAoB,MAAM,wBAAwB,CAAC;AAG1E,SAAS,YAAY,CAAC,OAAe;;IACnC,mFAAmF;IACnF,+EAA+E;IAC/E,MAAM,KAAK,GAAG,MAAA,MAAA,aAAa,CAAC,OAAO,CAAC,0CAAE,KAAK,mCAAI,YAAY,CAAC,OAAO,CAAC,CAAC;IACrE,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CACb,UAAU,OAAO,oGAAoG,CACtH,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,+EAA+E;AAC/E,mEAAmE;AACnE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB;;;;GAIG;AACH,SAAS,WAAW,CAClB,IAAuB,EACvB,YAA2B,EAC3B,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,gBAAgB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAuB,EACvB,YAA2B,EAC3B,IAAwB;;IAExB,4CAA4C;IAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,YAAY,CAAC,CAAC;QACvE,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAA+B,CAAC;IACpE,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAkC,CAAC;IAC7D,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAuB,CAAC,CAAC,sBAAsB;IACpF,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,CAA+B,CAAC;IACtF,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,qEAAqE;QACrE,yCAAyC;QACzC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,CAAW,EAAE,IAAI,CAAE,CAAC;QACxD,OAAO,EAAC,EAAE,EAAoB,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAoB,CAAC;IACzD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAQ,CAAC,CAAC,OAAO,CAAyB,CAAC,GAAG,CAC5C,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAA8B,CAC7E,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,GAAG,GAAyB,EAAE,CAAC;QACrC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACd,GAAG,CAAC,IAAI,GAAI,CAAC,CAAC,MAAM,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACtD,WAAW,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CACH,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,CAAC;YAAE,GAAG,CAAC,OAAO,GAAI,CAAC,CAAC,SAAS,CAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,CAAC;QAC/E,OAAO,GAAsB,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,YAAY,CAAC,CAAC;QACvE,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAA+B,CAAC;IACpE,CAAC;IACD,mDAAmD;IACnD,OAAO,cAAc,CACnB,CAAyB,EACzB,MAAA,YAAY,CAAC,IAAI,CAAC,mCAAI,YAAY,CACL,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA0B,EAC1B,KAAqB;IAErB,MAAM,SAAS,GACb,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC;IACzE,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAC5F,MAAM,IAAI,GAAG,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CACb,aAAa,GAAG,yBAAyB,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE,GAAG,CAC5E,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,GAAwB,EAAE,SAAS,EAAE,IAAI,CAAC,EAA4B,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,IAAI,GAAyB,EAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAC,CAAC;IAC9D,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACzD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnH,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CACjB,KAAoB,EACpB,IAAmB;IAEnB,MAAM,SAAS,GAAG,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpD,OAAO,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH;;;;;;;;;;GAUG;AACH,SAAS,sBAAsB,CAC7B,IAA0B,EAC1B,KAAoB,EACpB,IAAoB;IAEpB,WAAW,CAAC,KAAK,EAAE,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAC,IAAI,EAAC,CAAC,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,IAAkB;IAElB,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YACrD,OAAO,8BAA8B,CAAC;gBACpC,KAAK;gBACL,WAAW,EAAE,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACxC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;gBAC/C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAClB,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,8BAA8B,CAAC,EAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAC,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,yEAAyE;gBACzE,gEAAgE;gBAChE,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;oBACxC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;oBAC/C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAClB,IAAI,CAAC,EAAE,EAAE,CAAC;oBACR,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAC3D,CAAC;gBACD,OAAO,8BAA8B,CAAC,EAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAC,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,KAA+B,CAAC;YACpC,IAAI,aAA2C,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,KAAK;oBAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;gBAChF,CAAC,EAAC,KAAK,EAAE,aAAa,EAAC,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3D,CAAC;YACD,OAAO,mCAAmC,CAAC,EAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,EAAC,CAAC,CAAC;QACrF,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,8BAA8B,CAAC;oBACpC,KAAK;oBACL,mEAAmE;oBACnE,kDAAkD;oBAClD,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACvB,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,gBAAgB,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,CAAE,EAAC,CAAC,CAAC,CAAC,EAAC,EAAE,EAAC,CACxE;iBACF,CAAC,CAAC;YACL,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,iCAAiC,CAAC,EAAC,KAAK,EAAC,CAAC,CAAC;YACpD,CAAC;YACD,MAAM,EAAC,KAAK,EAAE,aAAa,EAAC,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7D,OAAO,mCAAmC,CAAC,EAAC,KAAK,EAAE,KAAK,EAAE,aAAa,EAAC,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,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 * Lower mutation DSL-JSON to canonical IR.\n *\n * This is the **IR side** of mutation (de)serialization, kept deliberately\n * separate from the IR-free wire codec in `MutationSerialization.ts`. The\n * canonical-IR builders (`IRMutation` / `IRLower` / …) are reachable only from\n * here and from `lower()`, so a client that serializes mutations to JSON and\n * forwards them (without ever lowering) tree-shakes the whole IR pipeline away.\n */\nimport type {NodeShapeData} from '../shapes/SHACL.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {\n  type NodeDescriptionValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  type UpdateNodePropertyValue,\n} from './QueryFactory.js';\nimport {ExpressionNode} from '../expressions/ExpressionNode.js';\nimport {getNodeShape, getShapeClass} from '../utils/ShapeClass.js';\nimport type {IRExpression, IRGraphPattern} from './IntermediateRepresentation.js';\nimport {\n  deserializeWherePath,\n  type WherePathJSON,\n} from './QueryBuilderSerialization.js';\nimport {toWhere} from './IRDesugar.js';\nimport {lowerWhereToIR} from './IRLower.js';\nimport {\n  buildCanonicalCreateMutationIR,\n  buildCanonicalUpdateMutationIR,\n  buildCanonicalUpsertMutationIR,\n  buildCanonicalUpdateWhereMutationIR,\n  buildCanonicalDeleteMutationIR,\n  buildCanonicalDeleteAllMutationIR,\n  buildCanonicalDeleteWhereMutationIR,\n} from './IRMutation.js';\nimport type {IRCreateQuery} from './CreateQuery.js';\nimport type {IRUpdateQuery} from './UpdateQuery.js';\nimport type {IRDeleteQuery} from './DeleteQuery.js';\nimport {isContextRefJSON, resolveContextId} from './ContextRef.js';\nimport {assertWireVersion} from './wireVersion.js';\nimport {\n  decodeNodeDataToRaw,\n  valueShapeOf,\n  type MutationJSON,\n  type MutationNodeDataJSON,\n  type MutationValueJSON,\n} from './MutationSerialization.js';\nimport {assertValid, type ValidationMode} from '../shapes/validation.js';\nimport {decodeValueExpr, type DslJsonValue} from './DslJsonExpression.js';\nimport type {PropertyShapeData} from '../shapes/SHACL.js';\n\nfunction requireShape(shapeId: string): NodeShapeData {\n  // Either registry: a project-authored shape arrives as metadata with no class, and\n  // requiring a class here made every mutation against one fail at the boundary.\n  const shape = getShapeClass(shapeId)?.shape ?? getNodeShape(shapeId);\n  if (!shape) {\n    throw new Error(\n      `Shape '${shapeId}' is not registered. The receiving side must have the shape registered to lower mutation DSL-JSON.`,\n    );\n  }\n  return shape;\n}\n\n// Bound the DSL-JSON decode recursion so a deeply-nested payload from\n// `fromJSON()` cannot exhaust the stack (RangeError DoS). Normal mutation data\n// nests only a handful of levels; 128 is far above any real query.\nconst MAX_DECODE_DEPTH = 128;\nlet _decodeDepth = 0;\n\n/**\n * Decode a DSL-JSON value to the normalized form the canonical-IR builders consume.\n * `currentShape` resolves computed `{@path}`/S-expr; `prop` gives a nested node's shape.\n * Depth-guarded wrapper around {@link decodeValueInner}.\n */\nfunction decodeValue(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData,\n  prop?: PropertyShapeData,\n): PropUpdateValue {\n  if (++_decodeDepth > MAX_DECODE_DEPTH) {\n    _decodeDepth = 0;\n    throw new Error('DSL-JSON value nested too deeply');\n  }\n  try {\n    return decodeValueInner(json, currentShape, prop);\n  } finally {\n    _decodeDepth--;\n  }\n}\n\nfunction decodeValueInner(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData,\n  prop?: PropertyShapeData,\n): PropUpdateValue {\n  // S-expr computed value (no IR on the wire)\n  if (Array.isArray(json)) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, currentShape);\n    return new ExpressionNode(ir, refs) as unknown as PropUpdateValue;\n  }\n  if (json === null) return null as unknown as PropUpdateValue;\n  if (typeof json !== 'object') return json as PropUpdateValue; // 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) as unknown as PropUpdateValue;\n  if ('@ctx' in o) {\n    // Lowering path: a mutation must hit a concrete node, so resolve the\n    // context now and throw if it isn't set.\n    const id = resolveContextId(o['@ctx'] as string, true)!;\n    return {id} as PropUpdateValue;\n  }\n  if ('@id' in o) return {id: o['@id']} as PropUpdateValue;\n  if ('@list' in o) {\n    return (o['@list'] as MutationValueJSON[]).map(\n      (item) => decodeValue(item, currentShape, prop) as SinglePropertyUpdateValue,\n    );\n  }\n  if ('@add' in o || '@remove' in o) {\n    const mod: SetModificationValue = {};\n    if (o['@add']) {\n      mod.$add = (o['@add'] as MutationValueJSON[]).map((v) =>\n        decodeValue(v, currentShape, prop),\n      ) as SetModificationValue['$add'];\n    }\n    if (o['@remove']) mod.$remove = (o['@remove'] as string[]).map((id) => ({id}));\n    return mod as PropUpdateValue;\n  }\n  if ('@path' in o) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, currentShape);\n    return new ExpressionNode(ir, refs) as unknown as PropUpdateValue;\n  }\n  // Otherwise: a bare path-keyed nested-node create.\n  return decodeNodeData(\n    o as MutationNodeDataJSON,\n    valueShapeOf(prop) ?? currentShape,\n  ) as unknown as PropUpdateValue;\n}\n\n/**\n * Rebuild a normalized node description from path-keyed JSON, resolving labels via the\n * shape. `shape` is the shape inferred from context; `__shape` overrides it.\n */\nexport function decodeNodeData(\n  json: MutationNodeDataJSON,\n  shape?: NodeShapeData,\n): NodeDescriptionValue {\n  const nodeShape =\n    typeof json.__shape === 'string' ? requireShape(json.__shape) : shape!;\n  const fields: UpdateNodePropertyValue[] = [];\n  for (const [key, val] of Object.entries(json)) {\n    if (key === '__id' || key === '__shape' || key === '__blank' || val === undefined) continue;\n    const prop = getPropertyShape(nodeShape, key);\n    if (!prop) {\n      throw new Error(\n        `Property '${key}' not found on shape '${nodeShape.label || nodeShape.id}'`,\n      );\n    }\n    fields.push({prop, val: decodeValue(val as MutationValueJSON, nodeShape, prop)} as UpdateNodePropertyValue);\n  }\n  const desc: NodeDescriptionValue = {shape: nodeShape, fields};\n  if (typeof json.__id === 'string') desc.__id = json.__id;\n  if (json.__blank !== undefined) {\n    if (json.__blank !== true) throw new Error(`__blank must be true when given, got ${JSON.stringify(json.__blank)}`);\n    desc.__blank = true;\n  }\n  return desc;\n}\n\nfunction lowerWhere(\n  shape: NodeShapeData,\n  json: WherePathJSON,\n): {where: IRExpression; wherePatterns: IRGraphPattern[]} {\n  const wherePath = deserializeWherePath(shape, json);\n  return lowerWhereToIR(toWhere(wherePath));\n}\n\n/**\n * Lower a mutation DSL-JSON envelope to the canonical IR mutation the dataset\n * expects. Mirrors the IR that `lower()` produces from the live builder.\n */\n/**\n * Validate inbound node data against its shape before it becomes IR.\n *\n * The builders validate through `describe()`, which sees raw DSL data. This path\n * never touches a builder, so without this an inbound mutation would be held to\n * a weaker standard than a locally-built one — on the *less* trusted input, at\n * that. `decodeNodeDataToRaw` produces exactly the raw form `describe()` would\n * have validated (it is what `CreateBuilder.fromJSON` feeds through `.set()`),\n * so both paths run the same checks. The second decode is the cost of validating\n * at a boundary; it happens once per inbound mutation.\n */\nfunction assertInboundDataValid(\n  json: MutationNodeDataJSON,\n  shape: NodeShapeData,\n  mode: ValidationMode,\n): void {\n  assertValid(shape, decodeNodeDataToRaw(json, shape), {mode});\n}\n\nexport function lowerMutationJSON(\n  json: MutationJSON,\n): IRCreateQuery | IRUpdateQuery | IRDeleteQuery {\n  assertWireVersion(json.v);\n  switch (json.op) {\n    case 'create': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'complete');\n      return buildCanonicalCreateMutationIR({\n        shape,\n        description: decodeNodeData(json.data, shape),\n      });\n    }\n    case 'upsert': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'partial');\n      const updates = decodeNodeData(json.data, shape);\n      const id = isContextRefJSON(json.targetId)\n        ? resolveContextId(json.targetId['@ctx'], true)\n        : json.targetId;\n      if (!id) {\n        throw new Error('upsert requires a targetId');\n      }\n      return buildCanonicalUpsertMutationIR({id, shape, updates});\n    }\n    case 'update': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'partial');\n      const updates = decodeNodeData(json.data, shape);\n      if (json.mode === 'for') {\n        // A `{@ctx}` target resolves against the current context map; a mutation\n        // must hit a concrete subject, so an unresolved context throws.\n        const id = isContextRefJSON(json.targetId)\n          ? resolveContextId(json.targetId['@ctx'], true)\n          : json.targetId;\n        if (!id) {\n          throw new Error('update mode \"for\" requires a targetId');\n        }\n        return buildCanonicalUpdateMutationIR({id, shape, updates});\n      }\n      let where: IRExpression | undefined;\n      let wherePatterns: IRGraphPattern[] | undefined;\n      if (json.mode === 'where') {\n        if (!json.where) throw new Error('update mode \"where\" requires a where clause');\n        ({where, wherePatterns} = lowerWhere(shape, json.where));\n      }\n      return buildCanonicalUpdateWhereMutationIR({shape, updates, where, wherePatterns});\n    }\n    case 'delete': {\n      const shape = requireShape(json.shape);\n      if (json.mode === 'ids') {\n        return buildCanonicalDeleteMutationIR({\n          shape,\n          // A `{@ctx}` id resolves against the live map; a delete must hit a\n          // concrete node, so an unresolved context throws.\n          ids: json.ids.map((id) =>\n            isContextRefJSON(id) ? {id: resolveContextId(id['@ctx'], true)!} : {id},\n          ),\n        });\n      }\n      if (json.mode === 'all') {\n        return buildCanonicalDeleteAllMutationIR({shape});\n      }\n      const {where, wherePatterns} = lowerWhere(shape, json.where);\n      return buildCanonicalDeleteWhereMutationIR({shape, where, wherePatterns});\n    }\n  }\n}\n"]}
+{"version":3,"file":"lowerMutationJSON.js","sourceRoot":"","sources":["../../../src/queries/lowerMutationJSON.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAYH,OAAO,EAAC,gBAAgB,EAAC,MAAM,4BAA4B,CAAC;AAQ5D,OAAO,EAAC,cAAc,EAAC,MAAM,kCAAkC,CAAC;AAChE,OAAO,EAAC,YAAY,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AAEnE,OAAO,EACL,oBAAoB,GAErB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,OAAO,EAAC,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAC,cAAc,EAAC,MAAM,cAAc,CAAC;AAC5C,OAAO,EACL,8BAA8B,EAC9B,8BAA8B,EAC9B,8BAA8B,EAC9B,mCAAmC,EACnC,8BAA8B,EAC9B,iCAAiC,EACjC,mCAAmC,GACpC,MAAM,iBAAiB,CAAC;AAIzB,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAC,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAC,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,YAAY,GAIb,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAC,WAAW,EAAsB,MAAM,yBAAyB,CAAC;AACzE,OAAO,EAAC,eAAe,EAAoB,MAAM,wBAAwB,CAAC;AAG1E,SAAS,YAAY,CAAC,OAAe;;IACnC,mFAAmF;IACnF,+EAA+E;IAC/E,MAAM,KAAK,GAAG,MAAA,MAAA,aAAa,CAAC,OAAO,CAAC,0CAAE,KAAK,mCAAI,YAAY,CAAC,OAAO,CAAC,CAAC;IACrE,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CACb,UAAU,OAAO,oGAAoG,CACtH,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,+EAA+E;AAC/E,mEAAmE;AACnE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB;;;;GAIG;AACH,SAAS,WAAW,CAClB,IAAuB,EACvB,YAA2B,EAC3B,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,gBAAgB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAC;IACjB,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAuB,EACvB,YAA2B,EAC3B,IAAwB;;IAExB,4CAA4C;IAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,YAAY,CAAC,CAAC;QACvE,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAA+B,CAAC;IACpE,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAkC,CAAC;IAC7D,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAuB,CAAC,CAAC,sBAAsB;IACpF,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,CAA+B,CAAC;IACtF,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,qEAAqE;QACrE,yCAAyC;QACzC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,MAAM,CAAW,EAAE,IAAI,CAAE,CAAC;QACxD,OAAO,EAAC,EAAE,EAAoB,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAoB,CAAC;IACzD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAQ,CAAC,CAAC,OAAO,CAAyB,CAAC,GAAG,CAC5C,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAA8B,CAC7E,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,GAAG,GAAyB,EAAE,CAAC;QACrC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACd,GAAG,CAAC,IAAI,GAAI,CAAC,CAAC,MAAM,CAAyB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACtD,WAAW,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CACH,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,CAAC;YAAE,GAAG,CAAC,OAAO,GAAI,CAAC,CAAC,SAAS,CAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,CAAC;QAC/E,OAAO,GAAsB,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,MAAM,EAAC,EAAE,EAAE,IAAI,EAAC,GAAG,eAAe,CAAC,IAAoB,EAAE,YAAY,CAAC,CAAC;QACvE,OAAO,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAA+B,CAAC;IACpE,CAAC;IACD,mDAAmD;IACnD,OAAO,cAAc,CACnB,CAAyB,EACzB,MAAA,YAAY,CAAC,IAAI,CAAC,mCAAI,YAAY,CACL,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA0B,EAC1B,KAAqB;IAErB,MAAM,SAAS,GACb,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAM,CAAC;IACzE,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QACvE,MAAM,IAAI,GAAG,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CACb,aAAa,GAAG,yBAAyB,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE,GAAG,CAC5E,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,GAAwB,EAAE,SAAS,EAAE,IAAI,CAAC,EAA4B,CAAC,CAAC;IAC9G,CAAC;IACD,MAAM,IAAI,GAAyB,EAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAC,CAAC;IAC9D,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACzD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CACjB,KAAoB,EACpB,IAAmB;IAEnB,MAAM,SAAS,GAAG,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpD,OAAO,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH;;;;;;;;;;GAUG;AACH,SAAS,sBAAsB,CAC7B,IAA0B,EAC1B,KAAoB,EACpB,IAAoB;IAEpB,WAAW,CAAC,KAAK,EAAE,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAC,IAAI,EAAC,CAAC,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,IAAkB;IAElB,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YACrD,OAAO,8BAA8B,CAAC;gBACpC,KAAK;gBACL,WAAW,EAAE,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACxC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;gBAC/C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAClB,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAChD,CAAC;YACD,OAAO,8BAA8B,CAAC,EAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAC,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,yEAAyE;gBACzE,gEAAgE;gBAChE,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;oBACxC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;oBAC/C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAClB,IAAI,CAAC,EAAE,EAAE,CAAC;oBACR,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAC3D,CAAC;gBACD,OAAO,8BAA8B,CAAC,EAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAC,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,KAA+B,CAAC;YACpC,IAAI,aAA2C,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,KAAK;oBAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;gBAChF,CAAC,EAAC,KAAK,EAAE,aAAa,EAAC,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3D,CAAC;YACD,OAAO,mCAAmC,CAAC,EAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,aAAa,EAAC,CAAC,CAAC;QACrF,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,8BAA8B,CAAC;oBACpC,KAAK;oBACL,mEAAmE;oBACnE,kDAAkD;oBAClD,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACvB,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,gBAAgB,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,CAAE,EAAC,CAAC,CAAC,CAAC,EAAC,EAAE,EAAC,CACxE;iBACF,CAAC,CAAC;YACL,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,iCAAiC,CAAC,EAAC,KAAK,EAAC,CAAC,CAAC;YACpD,CAAC;YACD,MAAM,EAAC,KAAK,EAAE,aAAa,EAAC,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7D,OAAO,mCAAmC,CAAC,EAAC,KAAK,EAAE,KAAK,EAAE,aAAa,EAAC,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,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 * Lower mutation DSL-JSON to canonical IR.\n *\n * This is the **IR side** of mutation (de)serialization, kept deliberately\n * separate from the IR-free wire codec in `MutationSerialization.ts`. The\n * canonical-IR builders (`IRMutation` / `IRLower` / …) are reachable only from\n * here and from `lower()`, so a client that serializes mutations to JSON and\n * forwards them (without ever lowering) tree-shakes the whole IR pipeline away.\n */\nimport type {NodeShapeData} from '../shapes/SHACL.js';\nimport {getPropertyShape} from '../shapes/nodeShapeData.js';\nimport {\n  type NodeDescriptionValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  type UpdateNodePropertyValue,\n} from './QueryFactory.js';\nimport {ExpressionNode} from '../expressions/ExpressionNode.js';\nimport {getNodeShape, getShapeClass} from '../utils/ShapeClass.js';\nimport type {IRExpression, IRGraphPattern} from './IntermediateRepresentation.js';\nimport {\n  deserializeWherePath,\n  type WherePathJSON,\n} from './QueryBuilderSerialization.js';\nimport {toWhere} from './IRDesugar.js';\nimport {lowerWhereToIR} from './IRLower.js';\nimport {\n  buildCanonicalCreateMutationIR,\n  buildCanonicalUpdateMutationIR,\n  buildCanonicalUpsertMutationIR,\n  buildCanonicalUpdateWhereMutationIR,\n  buildCanonicalDeleteMutationIR,\n  buildCanonicalDeleteAllMutationIR,\n  buildCanonicalDeleteWhereMutationIR,\n} from './IRMutation.js';\nimport type {IRCreateQuery} from './CreateQuery.js';\nimport type {IRUpdateQuery} from './UpdateQuery.js';\nimport type {IRDeleteQuery} from './DeleteQuery.js';\nimport {isContextRefJSON, resolveContextId} from './ContextRef.js';\nimport {assertWireVersion} from './wireVersion.js';\nimport {\n  decodeNodeDataToRaw,\n  valueShapeOf,\n  type MutationJSON,\n  type MutationNodeDataJSON,\n  type MutationValueJSON,\n} from './MutationSerialization.js';\nimport {assertValid, type ValidationMode} from '../shapes/validation.js';\nimport {decodeValueExpr, type DslJsonValue} from './DslJsonExpression.js';\nimport type {PropertyShapeData} from '../shapes/SHACL.js';\n\nfunction requireShape(shapeId: string): NodeShapeData {\n  // Either registry: a project-authored shape arrives as metadata with no class, and\n  // requiring a class here made every mutation against one fail at the boundary.\n  const shape = getShapeClass(shapeId)?.shape ?? getNodeShape(shapeId);\n  if (!shape) {\n    throw new Error(\n      `Shape '${shapeId}' is not registered. The receiving side must have the shape registered to lower mutation DSL-JSON.`,\n    );\n  }\n  return shape;\n}\n\n// Bound the DSL-JSON decode recursion so a deeply-nested payload from\n// `fromJSON()` cannot exhaust the stack (RangeError DoS). Normal mutation data\n// nests only a handful of levels; 128 is far above any real query.\nconst MAX_DECODE_DEPTH = 128;\nlet _decodeDepth = 0;\n\n/**\n * Decode a DSL-JSON value to the normalized form the canonical-IR builders consume.\n * `currentShape` resolves computed `{@path}`/S-expr; `prop` gives a nested node's shape.\n * Depth-guarded wrapper around {@link decodeValueInner}.\n */\nfunction decodeValue(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData,\n  prop?: PropertyShapeData,\n): PropUpdateValue {\n  if (++_decodeDepth > MAX_DECODE_DEPTH) {\n    _decodeDepth = 0;\n    throw new Error('DSL-JSON value nested too deeply');\n  }\n  try {\n    return decodeValueInner(json, currentShape, prop);\n  } finally {\n    _decodeDepth--;\n  }\n}\n\nfunction decodeValueInner(\n  json: MutationValueJSON,\n  currentShape: NodeShapeData,\n  prop?: PropertyShapeData,\n): PropUpdateValue {\n  // S-expr computed value (no IR on the wire)\n  if (Array.isArray(json)) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, currentShape);\n    return new ExpressionNode(ir, refs) as unknown as PropUpdateValue;\n  }\n  if (json === null) return null as unknown as PropUpdateValue;\n  if (typeof json !== 'object') return json as PropUpdateValue; // 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) as unknown as PropUpdateValue;\n  if ('@ctx' in o) {\n    // Lowering path: a mutation must hit a concrete node, so resolve the\n    // context now and throw if it isn't set.\n    const id = resolveContextId(o['@ctx'] as string, true)!;\n    return {id} as PropUpdateValue;\n  }\n  if ('@id' in o) return {id: o['@id']} as PropUpdateValue;\n  if ('@list' in o) {\n    return (o['@list'] as MutationValueJSON[]).map(\n      (item) => decodeValue(item, currentShape, prop) as SinglePropertyUpdateValue,\n    );\n  }\n  if ('@add' in o || '@remove' in o) {\n    const mod: SetModificationValue = {};\n    if (o['@add']) {\n      mod.$add = (o['@add'] as MutationValueJSON[]).map((v) =>\n        decodeValue(v, currentShape, prop),\n      ) as SetModificationValue['$add'];\n    }\n    if (o['@remove']) mod.$remove = (o['@remove'] as string[]).map((id) => ({id}));\n    return mod as PropUpdateValue;\n  }\n  if ('@path' in o) {\n    const {ir, refs} = decodeValueExpr(json as DslJsonValue, currentShape);\n    return new ExpressionNode(ir, refs) as unknown as PropUpdateValue;\n  }\n  // Otherwise: a bare path-keyed nested-node create.\n  return decodeNodeData(\n    o as MutationNodeDataJSON,\n    valueShapeOf(prop) ?? currentShape,\n  ) as unknown as PropUpdateValue;\n}\n\n/**\n * Rebuild a normalized node description from path-keyed JSON, resolving labels via the\n * shape. `shape` is the shape inferred from context; `__shape` overrides it.\n */\nexport function decodeNodeData(\n  json: MutationNodeDataJSON,\n  shape?: NodeShapeData,\n): NodeDescriptionValue {\n  const nodeShape =\n    typeof json.__shape === 'string' ? requireShape(json.__shape) : shape!;\n  const fields: UpdateNodePropertyValue[] = [];\n  for (const [key, val] of Object.entries(json)) {\n    if (key === '__id' || key === '__shape' || val === undefined) continue;\n    const prop = getPropertyShape(nodeShape, key);\n    if (!prop) {\n      throw new Error(\n        `Property '${key}' not found on shape '${nodeShape.label || nodeShape.id}'`,\n      );\n    }\n    fields.push({prop, val: decodeValue(val as MutationValueJSON, nodeShape, prop)} as UpdateNodePropertyValue);\n  }\n  const desc: NodeDescriptionValue = {shape: nodeShape, fields};\n  if (typeof json.__id === 'string') desc.__id = json.__id;\n  return desc;\n}\n\nfunction lowerWhere(\n  shape: NodeShapeData,\n  json: WherePathJSON,\n): {where: IRExpression; wherePatterns: IRGraphPattern[]} {\n  const wherePath = deserializeWherePath(shape, json);\n  return lowerWhereToIR(toWhere(wherePath));\n}\n\n/**\n * Lower a mutation DSL-JSON envelope to the canonical IR mutation the dataset\n * expects. Mirrors the IR that `lower()` produces from the live builder.\n */\n/**\n * Validate inbound node data against its shape before it becomes IR.\n *\n * The builders validate through `describe()`, which sees raw DSL data. This path\n * never touches a builder, so without this an inbound mutation would be held to\n * a weaker standard than a locally-built one — on the *less* trusted input, at\n * that. `decodeNodeDataToRaw` produces exactly the raw form `describe()` would\n * have validated (it is what `CreateBuilder.fromJSON` feeds through `.set()`),\n * so both paths run the same checks. The second decode is the cost of validating\n * at a boundary; it happens once per inbound mutation.\n */\nfunction assertInboundDataValid(\n  json: MutationNodeDataJSON,\n  shape: NodeShapeData,\n  mode: ValidationMode,\n): void {\n  assertValid(shape, decodeNodeDataToRaw(json, shape), {mode});\n}\n\nexport function lowerMutationJSON(\n  json: MutationJSON,\n): IRCreateQuery | IRUpdateQuery | IRDeleteQuery {\n  assertWireVersion(json.v);\n  switch (json.op) {\n    case 'create': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'complete');\n      return buildCanonicalCreateMutationIR({\n        shape,\n        description: decodeNodeData(json.data, shape),\n      });\n    }\n    case 'upsert': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'partial');\n      const updates = decodeNodeData(json.data, shape);\n      const id = isContextRefJSON(json.targetId)\n        ? resolveContextId(json.targetId['@ctx'], true)\n        : json.targetId;\n      if (!id) {\n        throw new Error('upsert requires a targetId');\n      }\n      return buildCanonicalUpsertMutationIR({id, shape, updates});\n    }\n    case 'update': {\n      const shape = requireShape(json.shape);\n      assertInboundDataValid(json.data, shape, 'partial');\n      const updates = decodeNodeData(json.data, shape);\n      if (json.mode === 'for') {\n        // A `{@ctx}` target resolves against the current context map; a mutation\n        // must hit a concrete subject, so an unresolved context throws.\n        const id = isContextRefJSON(json.targetId)\n          ? resolveContextId(json.targetId['@ctx'], true)\n          : json.targetId;\n        if (!id) {\n          throw new Error('update mode \"for\" requires a targetId');\n        }\n        return buildCanonicalUpdateMutationIR({id, shape, updates});\n      }\n      let where: IRExpression | undefined;\n      let wherePatterns: IRGraphPattern[] | undefined;\n      if (json.mode === 'where') {\n        if (!json.where) throw new Error('update mode \"where\" requires a where clause');\n        ({where, wherePatterns} = lowerWhere(shape, json.where));\n      }\n      return buildCanonicalUpdateWhereMutationIR({shape, updates, where, wherePatterns});\n    }\n    case 'delete': {\n      const shape = requireShape(json.shape);\n      if (json.mode === 'ids') {\n        return buildCanonicalDeleteMutationIR({\n          shape,\n          // A `{@ctx}` id resolves against the live map; a delete must hit a\n          // concrete node, so an unresolved context throws.\n          ids: json.ids.map((id) =>\n            isContextRefJSON(id) ? {id: resolveContextId(id['@ctx'], true)!} : {id},\n          ),\n        });\n      }\n      if (json.mode === 'all') {\n        return buildCanonicalDeleteAllMutationIR({shape});\n      }\n      const {where, wherePatterns} = lowerWhere(shape, json.where);\n      return buildCanonicalDeleteWhereMutationIR({shape, where, wherePatterns});\n    }\n  }\n}\n"]}

package/lib/esm/shapes/List.d.ts

@@ -11,7 +11,6 @@ export type RdfListNodeData = {
     first: unknown;
     rest: RdfListNodeData;
     __id?: string;
-    __blank?: true;
 };
 /**
  * Build the nested `List` node-data chain for an ordered `rdf:List`, terminating at `rdf:nil`.

package/lib/esm/shapes/List.js.map

@@ -1 +1 @@
-{"version":3,"file":"List.js","sourceRoot":"","sources":["../../../src/shapes/List.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,2FAA2F;AAC3F,yFAAyF;AACzF,wFAAwF;AACxF,OAAO,qBAAqB,CAAC;AAC7B,OAAO,EAAC,IAAI,EAAC,MAAM,iBAAiB,CAAC;AACrC,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AAEzC,OAAO,EAAC,IAAI,EAAC,CAAC;AASd;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CACrB,KAAU,EACV,IAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC;IACxB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAmB,EAAE;QAC3C,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACtB,OAAO,EAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,CAAC;QAC1B,CAAC;QACD,MAAM,IAAI,GAAoB;YAC5B,KAAK,EAAE,IAAI;YACX,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB,CAAC;QACF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,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// Registers List (together with the rest of the SHACL metamodel), so importing this module\n// on its own is enough to make List resolvable. The class lives in List.class.ts because\n// utils/Package.ts needs it by value and cannot import this module's registration path.\nimport '../utils/Package.js';\nimport {List} from './List.class.js';\nimport {rdf} from '../ontologies/rdf.js';\n\nexport {List};\n\n/**\n * Node-data for a single cell / the `rdf:nil` terminal. Accepted by the create pipeline.\n */\nexport type RdfListNodeData =\n  | {id: string}\n  | {shape: typeof List; first: unknown; rest: RdfListNodeData; __id?: string; __blank?: true};\n\n/**\n * Build the nested `List` node-data chain for an ordered `rdf:List`, terminating at `rdf:nil`.\n * Pass `opts.base` to mint deterministic cell ids (`{base}/0`, `{base}/1`, …); otherwise the\n * create pipeline mints ids. The empty list serializes to `rdf:nil`.\n *\n * @example Playlist.create({ tracks: rdfList([t1, t2, t3]) })\n */\nexport function rdfList<T>(\n  items: T[],\n  opts?: {base?: string},\n): RdfListNodeData {\n  const base = opts?.base;\n  const build = (i: number): RdfListNodeData => {\n    if (i >= items.length) {\n      return {id: rdf.nil.id};\n    }\n    const cell: RdfListNodeData = {\n      shape: List,\n      first: items[i],\n      rest: build(i + 1),\n    };\n    if (base !== undefined) {\n      cell.__id = `${base}/${i}`;\n    }\n    return cell;\n  };\n  return build(0);\n}\n"]}
+{"version":3,"file":"List.js","sourceRoot":"","sources":["../../../src/shapes/List.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,2FAA2F;AAC3F,yFAAyF;AACzF,wFAAwF;AACxF,OAAO,qBAAqB,CAAC;AAC7B,OAAO,EAAC,IAAI,EAAC,MAAM,iBAAiB,CAAC;AACrC,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AAEzC,OAAO,EAAC,IAAI,EAAC,CAAC;AASd;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CACrB,KAAU,EACV,IAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC;IACxB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAmB,EAAE;QAC3C,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACtB,OAAO,EAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,CAAC;QAC1B,CAAC;QACD,MAAM,IAAI,GAAoB;YAC5B,KAAK,EAAE,IAAI;YACX,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB,CAAC;QACF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,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// Registers List (together with the rest of the SHACL metamodel), so importing this module\n// on its own is enough to make List resolvable. The class lives in List.class.ts because\n// utils/Package.ts needs it by value and cannot import this module's registration path.\nimport '../utils/Package.js';\nimport {List} from './List.class.js';\nimport {rdf} from '../ontologies/rdf.js';\n\nexport {List};\n\n/**\n * Node-data for a single cell / the `rdf:nil` terminal. Accepted by the create pipeline.\n */\nexport type RdfListNodeData =\n  | {id: string}\n  | {shape: typeof List; first: unknown; rest: RdfListNodeData; __id?: string};\n\n/**\n * Build the nested `List` node-data chain for an ordered `rdf:List`, terminating at `rdf:nil`.\n * Pass `opts.base` to mint deterministic cell ids (`{base}/0`, `{base}/1`, …); otherwise the\n * create pipeline mints ids. The empty list serializes to `rdf:nil`.\n *\n * @example Playlist.create({ tracks: rdfList([t1, t2, t3]) })\n */\nexport function rdfList<T>(\n  items: T[],\n  opts?: {base?: string},\n): RdfListNodeData {\n  const base = opts?.base;\n  const build = (i: number): RdfListNodeData => {\n    if (i >= items.length) {\n      return {id: rdf.nil.id};\n    }\n    const cell: RdfListNodeData = {\n      shape: List,\n      first: items[i],\n      rest: build(i + 1),\n    };\n    if (base !== undefined) {\n      cell.__id = `${base}/${i}`;\n    }\n    return cell;\n  };\n  return build(0);\n}\n"]}

package/lib/esm/shapes/PathList.d.ts

@@ -0,0 +1,27 @@
+import { Shape } from './Shape.js';
+/**
+ * A cell of the `rdf:List` inside a SHACL property path: the members of a sequence path, or the
+ * operand of `sh:alternativePath`.
+ *
+ * Both properties are `sh:BlankNodeOrIRI`, so a cell written without an id is a blank node, and so
+ * is an operator node (`PathNode`) held by `first`. That keeps a sequence path a blank list, which
+ * SHACL §2.3.1 needs: an IRI as the `sh:path` value is a predicate path.
+ *
+ * It is a separate shape from `List` on purpose. `List.first` also holds literals (`sh:in`), so it
+ * cannot be declared node-only, and making `List.rest` blank-capable would turn the tail cells of
+ * every list built without ids into blank nodes. Both shapes target `rdf:List`; `List` is
+ * registered first, so a lookup by `rdf:List` still returns `List`.
+ *
+ * `dependent` and the `contains` on `rest` keep removing the IRI-named, typed list cells of
+ * versions before 2.30 through the typed cascade.
+ */
+export declare class PathList extends Shape {
+    static targetClass: import("../utils/NodeReference.js").NodeReferenceValue;
+    /**
+     * A predicate IRI, or an operator node (`PathNode`). Not `contains`: ownership is decided per
+     * predicate across the registry, and `rdf:first` of every other list holds values the list
+     * does not own. The blank-node cascade follows it anyway, because it is blank-capable.
+     */
+    get first(): unknown;
+    get rest(): PathList;
+}

package/lib/esm/shapes/PathList.js

@@ -0,0 +1,63 @@
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+/*
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/.
+ */
+import { linkedShape } from '../package.js';
+import { Shape } from './Shape.js';
+import { objectProperty } from './SHACL.js';
+import { shacl } from '../ontologies/shacl.js';
+import { rdf } from '../ontologies/rdf.js';
+/**
+ * A cell of the `rdf:List` inside a SHACL property path: the members of a sequence path, or the
+ * operand of `sh:alternativePath`.
+ *
+ * Both properties are `sh:BlankNodeOrIRI`, so a cell written without an id is a blank node, and so
+ * is an operator node (`PathNode`) held by `first`. That keeps a sequence path a blank list, which
+ * SHACL §2.3.1 needs: an IRI as the `sh:path` value is a predicate path.
+ *
+ * It is a separate shape from `List` on purpose. `List.first` also holds literals (`sh:in`), so it
+ * cannot be declared node-only, and making `List.rest` blank-capable would turn the tail cells of
+ * every list built without ids into blank nodes. Both shapes target `rdf:List`; `List` is
+ * registered first, so a lookup by `rdf:List` still returns `List`.
+ *
+ * `dependent` and the `contains` on `rest` keep removing the IRI-named, typed list cells of
+ * versions before 2.30 through the typed cascade.
+ */
+let PathList = class PathList extends Shape {
+    /**
+     * A predicate IRI, or an operator node (`PathNode`). Not `contains`: ownership is decided per
+     * predicate across the registry, and `rdf:first` of every other list holds values the list
+     * does not own. The blank-node cascade follows it anyway, because it is blank-capable.
+     */
+    get first() {
+        return null;
+    }
+    get rest() {
+        return null;
+    }
+};
+PathList.targetClass = rdf.List;
+__decorate([
+    objectProperty({ path: rdf.first, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI })
+], PathList.prototype, "first", null);
+__decorate([
+    objectProperty({
+        path: rdf.rest,
+        maxCount: 1,
+        shape: PathList,
+        contains: true,
+        nodeKind: shacl.BlankNodeOrIRI,
+    })
+], PathList.prototype, "rest", null);
+PathList = __decorate([
+    linkedShape({ name: 'PathList', dependent: true })
+], PathList);
+export { PathList };
+//# sourceMappingURL=PathList.js.map

package/lib/esm/shapes/PathList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PathList.js","sourceRoot":"","sources":["../../../src/shapes/PathList.ts"],"names":[],"mappings":";;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,WAAW,EAAC,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,cAAc,EAAC,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,wBAAwB,CAAC;AAC7C,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AAEzC;;;;;;;;;;;;;;;GAeG;AAEI,IAAM,QAAQ,GAAd,MAAM,QAAS,SAAQ,KAAK;IAGjC;;;;OAIG;IAEH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IASD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC;IACd,CAAC;;AArBM,oBAAW,GAAG,GAAG,CAAC,IAAI,AAAX,CAAY;AAQ9B;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,cAAc,EAAC,CAAC;qCAG9E;AASD;IAPC,cAAc,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,IAAI;QACd,QAAQ,EAAE,KAAK,CAAC,cAAc;KAC/B,CAAC;oCAGD;AAtBU,QAAQ;IADpB,WAAW,CAAC,EAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,EAAC,CAAC;GACpC,QAAQ,CAuBpB","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 */\nimport {linkedShape} from '../package.js';\nimport {Shape} from './Shape.js';\nimport {objectProperty} from './SHACL.js';\nimport {shacl} from '../ontologies/shacl.js';\nimport {rdf} from '../ontologies/rdf.js';\n\n/**\n * A cell of the `rdf:List` inside a SHACL property path: the members of a sequence path, or the\n * operand of `sh:alternativePath`.\n *\n * Both properties are `sh:BlankNodeOrIRI`, so a cell written without an id is a blank node, and so\n * is an operator node (`PathNode`) held by `first`. That keeps a sequence path a blank list, which\n * SHACL §2.3.1 needs: an IRI as the `sh:path` value is a predicate path.\n *\n * It is a separate shape from `List` on purpose. `List.first` also holds literals (`sh:in`), so it\n * cannot be declared node-only, and making `List.rest` blank-capable would turn the tail cells of\n * every list built without ids into blank nodes. Both shapes target `rdf:List`; `List` is\n * registered first, so a lookup by `rdf:List` still returns `List`.\n *\n * `dependent` and the `contains` on `rest` keep removing the IRI-named, typed list cells of\n * versions before 2.30 through the typed cascade.\n */\n@linkedShape({name: 'PathList', dependent: true})\nexport class PathList extends Shape {\n  static targetClass = rdf.List;\n\n  /**\n   * A predicate IRI, or an operator node (`PathNode`). Not `contains`: ownership is decided per\n   * predicate across the registry, and `rdf:first` of every other list holds values the list\n   * does not own. The blank-node cascade follows it anyway, because it is blank-capable.\n   */\n  @objectProperty({path: rdf.first, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI})\n  get first(): unknown {\n    return null;\n  }\n\n  @objectProperty({\n    path: rdf.rest,\n    maxCount: 1,\n    shape: PathList,\n    contains: true,\n    nodeKind: shacl.BlankNodeOrIRI,\n  })\n  get rest(): PathList {\n    return null;\n  }\n}\n"]}

package/lib/esm/shapes/PathNode.d.ts

@@ -1,22 +1,23 @@
 import { Shape } from './Shape.js';
-import { List } from './List.js';
+import { PathList } from './PathList.js';
 /**
  * Operator node for SHACL property paths that are NOT a simple predicate or a sequence:
  * inverse (`sh:inversePath`), alternative (`sh:alternativePath` → an `rdf:List`), and the
  * cardinality forms (`sh:zeroOrMorePath`/`sh:oneOrMorePath`/`sh:zeroOrOnePath`).
  *
- * Shape sync writes these as untyped blank nodes (`__blank`, see `serializePathToNodeData`): the
- * only form SHACL §2.3.1 defines, a blank node that is the subject of exactly one triple. Each
- * operator edge is `contains`, so the blank-node block of the containment cascade removes the
- * structure on delete/replace. The class stays `dependent` with its `core:PathNode` type for the
- * IRI-named, typed nodes earlier versions wrote: the typed cascade removes those on the next sync.
- * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `List`), so no fixed
- * `valueShape` is declared except for `alternativePath`, which is always an `rdf:List`.
+ * Every slot is `sh:BlankNodeOrIRI`, as is `PropertyShape.path`, so an operator node written
+ * without an id is an untyped blank node: the only form SHACL §2.3.1 defines, a blank node that is
+ * the subject of exactly one triple (see `serializePathToNodeData`). The blank-node cascade
+ * follows these blank-capable slots on delete / replace. The class stays `dependent`, with
+ * `contains` slots and its `core:PathNode` type, for the IRI-named, typed nodes versions before
+ * 2.30 wrote: the typed cascade removes those on the next sync.
+ * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `PathList`), so no fixed
+ * `valueShape` is declared except for `alternativePath`, which is always a `PathList`.
  */
 export declare class PathNode extends Shape {
     static targetClass: import("../utils/NodeReference.js").NodeReferenceValue;
     get inversePath(): unknown;
-    get alternativePath(): List;
+    get alternativePath(): PathList;
     get zeroOrMorePath(): unknown;
     get oneOrMorePath(): unknown;
     get zeroOrOnePath(): unknown;

package/lib/esm/shapes/PathNode.js

@@ -14,19 +14,21 @@ import { Shape } from './Shape.js';
 import { objectProperty } from './SHACL.js';
 import { shacl } from '../ontologies/shacl.js';
 import { coreOntology } from '../ontologies/linked-core.js';
-import { List } from './List.js';
+import { PathList } from './PathList.js';
+const BLANK_OR_IRI = shacl.BlankNodeOrIRI;
 /**
  * Operator node for SHACL property paths that are NOT a simple predicate or a sequence:
  * inverse (`sh:inversePath`), alternative (`sh:alternativePath` → an `rdf:List`), and the
  * cardinality forms (`sh:zeroOrMorePath`/`sh:oneOrMorePath`/`sh:zeroOrOnePath`).
  *
- * Shape sync writes these as untyped blank nodes (`__blank`, see `serializePathToNodeData`): the
- * only form SHACL §2.3.1 defines, a blank node that is the subject of exactly one triple. Each
- * operator edge is `contains`, so the blank-node block of the containment cascade removes the
- * structure on delete/replace. The class stays `dependent` with its `core:PathNode` type for the
- * IRI-named, typed nodes earlier versions wrote: the typed cascade removes those on the next sync.
- * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `List`), so no fixed
- * `valueShape` is declared except for `alternativePath`, which is always an `rdf:List`.
+ * Every slot is `sh:BlankNodeOrIRI`, as is `PropertyShape.path`, so an operator node written
+ * without an id is an untyped blank node: the only form SHACL §2.3.1 defines, a blank node that is
+ * the subject of exactly one triple (see `serializePathToNodeData`). The blank-node cascade
+ * follows these blank-capable slots on delete / replace. The class stays `dependent`, with
+ * `contains` slots and its `core:PathNode` type, for the IRI-named, typed nodes versions before
+ * 2.30 wrote: the typed cascade removes those on the next sync.
+ * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `PathList`), so no fixed
+ * `valueShape` is declared except for `alternativePath`, which is always a `PathList`.
  */
 // Named explicitly: the class shares its name with the ontology term coreOntology.PathNode,
 // and a bundler resolving that collision renames the class (PathNode2), which would change
@@ -50,19 +52,25 @@ let PathNode = class PathNode extends Shape {
 };
 PathNode.targetClass = coreOntology.PathNode;
 __decorate([
-    objectProperty({ path: shacl.inversePath, maxCount: 1, contains: true })
+    objectProperty({ path: shacl.inversePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI })
 ], PathNode.prototype, "inversePath", null);
 __decorate([
-    objectProperty({ path: shacl.alternativePath, maxCount: 1, shape: List, contains: true })
+    objectProperty({
+        path: shacl.alternativePath,
+        maxCount: 1,
+        shape: PathList,
+        contains: true,
+        nodeKind: BLANK_OR_IRI,
+    })
 ], PathNode.prototype, "alternativePath", null);
 __decorate([
-    objectProperty({ path: shacl.zeroOrMorePath, maxCount: 1, contains: true })
+    objectProperty({ path: shacl.zeroOrMorePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI })
 ], PathNode.prototype, "zeroOrMorePath", null);
 __decorate([
-    objectProperty({ path: shacl.oneOrMorePath, maxCount: 1, contains: true })
+    objectProperty({ path: shacl.oneOrMorePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI })
 ], PathNode.prototype, "oneOrMorePath", null);
 __decorate([
-    objectProperty({ path: shacl.zeroOrOnePath, maxCount: 1, contains: true })
+    objectProperty({ path: shacl.zeroOrOnePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI })
 ], PathNode.prototype, "zeroOrOnePath", null);
 PathNode = __decorate([
     linkedShape({ name: 'PathNode', dependent: true })

package/lib/esm/shapes/PathNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"PathNode.js","sourceRoot":"","sources":["../../../src/shapes/PathNode.ts"],"names":[],"mappings":";;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,WAAW,EAAC,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,cAAc,EAAC,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,wBAAwB,CAAC;AAC7C,OAAO,EAAC,YAAY,EAAC,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AAE/B;;;;;;;;;;;;GAYG;AACH,4FAA4F;AAC5F,2FAA2F;AAC3F,mBAAmB;AAEZ,IAAM,QAAQ,GAAd,MAAM,QAAS,SAAQ,KAAK;IAIjC,IAAI,WAAW;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,cAAc;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,aAAa;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,aAAa;QACf,OAAO,IAAI,CAAC;IACd,CAAC;;AAzBM,oBAAW,GAAG,YAAY,CAAC,QAAQ,AAAxB,CAAyB;AAG3C;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;2CAGtE;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,eAAe,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;+CAGvF;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;8CAGzE;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;6CAGxE;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;6CAGxE;AA1BU,QAAQ;IADpB,WAAW,CAAC,EAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,EAAC,CAAC;GACpC,QAAQ,CA2BpB","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 */\nimport {linkedShape} from '../package.js';\nimport {Shape} from './Shape.js';\nimport {objectProperty} from './SHACL.js';\nimport {shacl} from '../ontologies/shacl.js';\nimport {coreOntology} from '../ontologies/linked-core.js';\nimport {List} from './List.js';\n\n/**\n * Operator node for SHACL property paths that are NOT a simple predicate or a sequence:\n * inverse (`sh:inversePath`), alternative (`sh:alternativePath` → an `rdf:List`), and the\n * cardinality forms (`sh:zeroOrMorePath`/`sh:oneOrMorePath`/`sh:zeroOrOnePath`).\n *\n * Shape sync writes these as untyped blank nodes (`__blank`, see `serializePathToNodeData`): the\n * only form SHACL §2.3.1 defines, a blank node that is the subject of exactly one triple. Each\n * operator edge is `contains`, so the blank-node block of the containment cascade removes the\n * structure on delete/replace. The class stays `dependent` with its `core:PathNode` type for the\n * IRI-named, typed nodes earlier versions wrote: the typed cascade removes those on the next sync.\n * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `List`), so no fixed\n * `valueShape` is declared except for `alternativePath`, which is always an `rdf:List`.\n */\n// Named explicitly: the class shares its name with the ontology term coreOntology.PathNode,\n// and a bundler resolving that collision renames the class (PathNode2), which would change\n// the shape's IRI.\n@linkedShape({name: 'PathNode', dependent: true})\nexport class PathNode extends Shape {\n  static targetClass = coreOntology.PathNode;\n\n  @objectProperty({path: shacl.inversePath, maxCount: 1, contains: true})\n  get inversePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({path: shacl.alternativePath, maxCount: 1, shape: List, contains: true})\n  get alternativePath(): List {\n    return null;\n  }\n\n  @objectProperty({path: shacl.zeroOrMorePath, maxCount: 1, contains: true})\n  get zeroOrMorePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({path: shacl.oneOrMorePath, maxCount: 1, contains: true})\n  get oneOrMorePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({path: shacl.zeroOrOnePath, maxCount: 1, contains: true})\n  get zeroOrOnePath(): unknown {\n    return null;\n  }\n}\n"]}
+{"version":3,"file":"PathNode.js","sourceRoot":"","sources":["../../../src/shapes/PathNode.ts"],"names":[],"mappings":";;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,WAAW,EAAC,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,cAAc,EAAC,MAAM,YAAY,CAAC;AAC1C,OAAO,EAAC,KAAK,EAAC,MAAM,wBAAwB,CAAC;AAC7C,OAAO,EAAC,YAAY,EAAC,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAEvC,MAAM,YAAY,GAAG,KAAK,CAAC,cAAc,CAAC;AAE1C;;;;;;;;;;;;;GAaG;AACH,4FAA4F;AAC5F,2FAA2F;AAC3F,mBAAmB;AAEZ,IAAM,QAAQ,GAAd,MAAM,QAAS,SAAQ,KAAK;IAIjC,IAAI,WAAW;QACb,OAAO,IAAI,CAAC;IACd,CAAC;IASD,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,cAAc;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,aAAa;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,aAAa;QACf,OAAO,IAAI,CAAC;IACd,CAAC;;AA/BM,oBAAW,GAAG,YAAY,CAAC,QAAQ,AAAxB,CAAyB;AAG3C;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAC,CAAC;2CAG9F;AASD;IAPC,cAAc,CAAC;QACd,IAAI,EAAE,KAAK,CAAC,eAAe;QAC3B,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,IAAI;QACd,QAAQ,EAAE,YAAY;KACvB,CAAC;+CAGD;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAC,CAAC;8CAGjG;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAC,CAAC;6CAGhG;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAC,CAAC;6CAGhG;AAhCU,QAAQ;IADpB,WAAW,CAAC,EAAC,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,EAAC,CAAC;GACpC,QAAQ,CAiCpB","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 */\nimport {linkedShape} from '../package.js';\nimport {Shape} from './Shape.js';\nimport {objectProperty} from './SHACL.js';\nimport {shacl} from '../ontologies/shacl.js';\nimport {coreOntology} from '../ontologies/linked-core.js';\nimport {PathList} from './PathList.js';\n\nconst BLANK_OR_IRI = shacl.BlankNodeOrIRI;\n\n/**\n * Operator node for SHACL property paths that are NOT a simple predicate or a sequence:\n * inverse (`sh:inversePath`), alternative (`sh:alternativePath` → an `rdf:List`), and the\n * cardinality forms (`sh:zeroOrMorePath`/`sh:oneOrMorePath`/`sh:zeroOrOnePath`).\n *\n * Every slot is `sh:BlankNodeOrIRI`, as is `PropertyShape.path`, so an operator node written\n * without an id is an untyped blank node: the only form SHACL §2.3.1 defines, a blank node that is\n * the subject of exactly one triple (see `serializePathToNodeData`). The blank-node cascade\n * follows these blank-capable slots on delete / replace. The class stays `dependent`, with\n * `contains` slots and its `core:PathNode` type, for the IRI-named, typed nodes versions before\n * 2.30 wrote: the typed cascade removes those on the next sync.\n * Operands are polymorphic (a predicate IRI, a nested `PathNode`, or a `PathList`), so no fixed\n * `valueShape` is declared except for `alternativePath`, which is always a `PathList`.\n */\n// Named explicitly: the class shares its name with the ontology term coreOntology.PathNode,\n// and a bundler resolving that collision renames the class (PathNode2), which would change\n// the shape's IRI.\n@linkedShape({name: 'PathNode', dependent: true})\nexport class PathNode extends Shape {\n  static targetClass = coreOntology.PathNode;\n\n  @objectProperty({path: shacl.inversePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI})\n  get inversePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({\n    path: shacl.alternativePath,\n    maxCount: 1,\n    shape: PathList,\n    contains: true,\n    nodeKind: BLANK_OR_IRI,\n  })\n  get alternativePath(): PathList {\n    return null;\n  }\n\n  @objectProperty({path: shacl.zeroOrMorePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI})\n  get zeroOrMorePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({path: shacl.oneOrMorePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI})\n  get oneOrMorePath(): unknown {\n    return null;\n  }\n\n  @objectProperty({path: shacl.zeroOrOnePath, maxCount: 1, contains: true, nodeKind: BLANK_OR_IRI})\n  get zeroOrOnePath(): unknown {\n    return null;\n  }\n}\n"]}

package/lib/esm/shapes/index.d.ts

@@ -1,3 +1,4 @@
 import './SHACL.js';
 import './List.js';
+import './PathList.js';
 import './PathNode.js';

package/lib/esm/shapes/index.js

@@ -10,5 +10,6 @@
 // SHACL metamodel cannot decorate itself. List.js loads it; SHACL.js alone does not.
 import './SHACL.js';
 import './List.js';
+import './PathList.js';
 import './PathNode.js';
 //# sourceMappingURL=index.js.map

package/lib/esm/shapes/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/shapes/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,qFAAqF;AACrF,mFAAmF;AACnF,EAAE;AACF,2FAA2F;AAC3F,qFAAqF;AACrF,OAAO,YAAY,CAAC;AACpB,OAAO,WAAW,CAAC;AACnB,OAAO,eAAe,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// Loads every shape @_linked/core defines, for their registration side effects only.\n// Consumers: `import '@_linked/core/shapes/index'`. Nothing is exported from here.\n//\n// Shape, NodeShape, PropertyShape and List are registered by utils/Package.ts, because the\n// SHACL metamodel cannot decorate itself. List.js loads it; SHACL.js alone does not.\nimport './SHACL.js';\nimport './List.js';\nimport './PathNode.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/shapes/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,qFAAqF;AACrF,mFAAmF;AACnF,EAAE;AACF,2FAA2F;AAC3F,qFAAqF;AACrF,OAAO,YAAY,CAAC;AACpB,OAAO,WAAW,CAAC;AACnB,OAAO,eAAe,CAAC;AACvB,OAAO,eAAe,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// Loads every shape @_linked/core defines, for their registration side effects only.\n// Consumers: `import '@_linked/core/shapes/index'`. Nothing is exported from here.\n//\n// Shape, NodeShape, PropertyShape and List are registered by utils/Package.ts, because the\n// SHACL metamodel cannot decorate itself. List.js loads it; SHACL.js alone does not.\nimport './SHACL.js';\nimport './List.js';\nimport './PathList.js';\nimport './PathNode.js';\n"]}

package/lib/esm/shapes/serializePathToNodeData.d.ts

@@ -1,34 +1,35 @@
 import type { PathExpr } from '../paths/PropertyPathExpr.js';
 import type { NodeReferenceValue } from '../utils/NodeReference.js';
-import { List } from './List.js';
+import { PathList } from './PathList.js';
 import { PathNode } from './PathNode.js';
 /**
  * Node-data the create pipeline accepts for a `sh:path` value: an IRI reference (simple path),
- * an `rdf:List` (sequence / alternative members), or a `PathNode` operator node.
+ * a `PathList` (sequence / alternative members), or a `PathNode` operator node.
  */
 export type PathNodeData = NodeReferenceValue | {
-    shape: typeof List | typeof PathNode;
-    __blank: true;
+    shape: typeof PathList | typeof PathNode;
     [k: string]: unknown;
 };
 /**
  * Translate a `PathExpr` into create-pipeline node-data for `sh:path`.
  *
  * - simple `PathRef` → `{id}` (a shared predicate IRI; NOT owned)
- * - sequence → an `rdf:List` of segments
- * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is an `rdf:List`)
+ * - sequence → a `PathList` (an `rdf:List`) of segments
+ * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is a `PathList`)
  *
- * Every operator node and list cell is written as an untyped blank node (`__blank`), the only
- * form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path, and an inverse,
- * alternative or cardinality path is a blank node that is the subject of exactly one triple.
+ * Operator nodes and list cells carry no id. `PropertyShape.path`, the `PathNode` slots and
+ * `PathList.first` / `.rest` are `sh:BlankNodeOrIRI`, so the create writes each of them as an
+ * untyped blank node, the only form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path,
+ * and an inverse, alternative or cardinality path is a blank node that is the subject of exactly
+ * one triple.
  *
  * ```turtle
  * <ps> sh:path [ sh:inversePath schema:image ] .
  * <ps> sh:path ( schema:knows [ sh:zeroOrMorePath schema:parent ] ) .
  * ```
  *
- * The structure is owned through `contains` edges, so a re-sync's delete removes it (the
- * blank-node block of the containment cascade) before the create writes it again.
+ * A re-sync's delete removes the structure (the blank-node cascade follows the blank-capable
+ * properties) before the create writes it again.
  *
  * @param _base ignored. It seeded the IRIs of the nodes this used to mint (`{base}/inv`, …);
  *   blank nodes have none. Kept so existing two-argument calls still compile.

package/lib/esm/shapes/serializePathToNodeData.js

@@ -1,25 +1,27 @@
 import { isPathRef } from '../paths/PropertyPathExpr.js';
-import { List } from './List.js';
+import { PathList } from './PathList.js';
 import { rdf } from '../ontologies/rdf.js';
 import { PathNode } from './PathNode.js';
 /**
  * Translate a `PathExpr` into create-pipeline node-data for `sh:path`.
  *
  * - simple `PathRef` → `{id}` (a shared predicate IRI; NOT owned)
- * - sequence → an `rdf:List` of segments
- * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is an `rdf:List`)
+ * - sequence → a `PathList` (an `rdf:List`) of segments
+ * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is a `PathList`)
  *
- * Every operator node and list cell is written as an untyped blank node (`__blank`), the only
- * form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path, and an inverse,
- * alternative or cardinality path is a blank node that is the subject of exactly one triple.
+ * Operator nodes and list cells carry no id. `PropertyShape.path`, the `PathNode` slots and
+ * `PathList.first` / `.rest` are `sh:BlankNodeOrIRI`, so the create writes each of them as an
+ * untyped blank node, the only form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path,
+ * and an inverse, alternative or cardinality path is a blank node that is the subject of exactly
+ * one triple.
  *
  * ```turtle
  * <ps> sh:path [ sh:inversePath schema:image ] .
  * <ps> sh:path ( schema:knows [ sh:zeroOrMorePath schema:parent ] ) .
  * ```
  *
- * The structure is owned through `contains` edges, so a re-sync's delete removes it (the
- * blank-node block of the containment cascade) before the create writes it again.
+ * A re-sync's delete removes the structure (the blank-node cascade follows the blank-capable
+ * properties) before the create writes it again.
  *
  * @param _base ignored. It seeded the IRIs of the nodes this used to mint (`{base}/inv`, …);
  *   blank nodes have none. Kept so existing two-argument calls still compile.
@@ -27,7 +29,6 @@ import { PathNode } from './PathNode.js';
 export function serializePathToNodeData(path, _base) {
     const operator = (key, operand) => ({
         shape: PathNode,
-        __blank: true,
         [key]: operand,
     });
     const serialize = (e) => {
@@ -71,8 +72,8 @@ export function serializePathToNodeData(path, _base) {
     };
     return serialize(path);
 }
-/** An `rdf:List` of blank cells (`rdf:first`/`rdf:rest` only), terminated by `rdf:nil`. */
+/** A `PathList` of cells without ids (blank once written), terminated by `rdf:nil`. */
 function blankList(items) {
-    return items.reduceRight((rest, first) => ({ shape: List, __blank: true, first, rest }), { id: rdf.nil.id });
+    return items.reduceRight((rest, first) => ({ shape: PathList, first, rest }), { id: rdf.nil.id });
 }
 //# sourceMappingURL=serializePathToNodeData.js.map

package/lib/esm/shapes/serializePathToNodeData.js.map

@@ -1 +1 @@
-{"version":3,"file":"serializePathToNodeData.js","sourceRoot":"","sources":["../../../src/shapes/serializePathToNodeData.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,SAAS,EAAC,MAAM,8BAA8B,CAAC;AAEvD,OAAO,EAAC,IAAI,EAAuB,MAAM,WAAW,CAAC;AACrD,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAUvC;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAc,EAAE,KAAc;IACpE,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,OAAgB,EAAgB,EAAE,CAAC,CAAC;QACjE,KAAK,EAAE,QAAQ;QACf,OAAO,EAAE,IAAI;QACb,CAAC,GAAG,CAAC,EAAE,OAAO;KACf,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,CAAC,CAAW,EAAgB,EAAE;QAC9C,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,EAAC,EAAE,EAAE,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,CAAC;QAChD,CAAC;QACD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,yEAAyE;YACzE,yEAAyE;YACzE,wEAAwE;YACxE,yEAAyE;YACzE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAiB,CAAC;QACzD,CAAC;QACD,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,4EAA4E;YAC5E,4EAA4E;YAC5E,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,YAAY,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAClF,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/E,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/E,IAAI,oBAAoB,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CACb,qFAAqF,CACtF,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC,CAAC;IACF,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED,2FAA2F;AAC3F,SAAS,SAAS,CAAC,KAAqB;IACtC,OAAO,KAAK,CAAC,WAAW,CACtB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC,EAC5D,EAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,CACjB,CAAC;AACJ,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 */\nimport type {PathExpr} from '../paths/PropertyPathExpr.js';\nimport {isPathRef} from '../paths/PropertyPathExpr.js';\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {List, type RdfListNodeData} from './List.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {PathNode} from './PathNode.js';\n\n/**\n * Node-data the create pipeline accepts for a `sh:path` value: an IRI reference (simple path),\n * an `rdf:List` (sequence / alternative members), or a `PathNode` operator node.\n */\nexport type PathNodeData =\n  | NodeReferenceValue\n  | {shape: typeof List | typeof PathNode; __blank: true; [k: string]: unknown};\n\n/**\n * Translate a `PathExpr` into create-pipeline node-data for `sh:path`.\n *\n * - simple `PathRef` → `{id}` (a shared predicate IRI; NOT owned)\n * - sequence → an `rdf:List` of segments\n * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is an `rdf:List`)\n *\n * Every operator node and list cell is written as an untyped blank node (`__blank`), the only\n * form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path, and an inverse,\n * alternative or cardinality path is a blank node that is the subject of exactly one triple.\n *\n * ```turtle\n * <ps> sh:path [ sh:inversePath schema:image ] .\n * <ps> sh:path ( schema:knows [ sh:zeroOrMorePath schema:parent ] ) .\n * ```\n *\n * The structure is owned through `contains` edges, so a re-sync's delete removes it (the\n * blank-node block of the containment cascade) before the create writes it again.\n *\n * @param _base ignored. It seeded the IRIs of the nodes this used to mint (`{base}/inv`, …);\n *   blank nodes have none. Kept so existing two-argument calls still compile.\n */\nexport function serializePathToNodeData(path: PathExpr, _base?: string): PathNodeData {\n  const operator = (key: string, operand: unknown): PathNodeData => ({\n    shape: PathNode,\n    __blank: true,\n    [key]: operand,\n  });\n  const serialize = (e: PathExpr): PathNodeData => {\n    if (isPathRef(e)) {\n      return {id: typeof e === 'string' ? e : e.id};\n    }\n    if ('seq' in e) {\n      // SHACL §2.3.1: a sequence path is a list with **at least two** members.\n      // A 0/1-member sequence is not a list — collapse a singleton to its bare\n      // member, reject an empty one. (normalizePropertyPath already collapses\n      // these upstream; this keeps the serializer independently spec-correct.)\n      if (e.seq.length === 0) {\n        throw new Error('Cannot serialize an empty sequence path to SHACL sh:path.');\n      }\n      if (e.seq.length === 1) return serialize(e.seq[0]);\n      return blankList(e.seq.map(serialize)) as PathNodeData;\n    }\n    if ('inv' in e) return operator('inversePath', serialize(e.inv));\n    if ('alt' in e) {\n      // SHACL §2.3.2: sh:alternativePath is a list with **at least two** members.\n      // Collapse a singleton alternative to its bare member, reject an empty one.\n      if (e.alt.length === 0) {\n        throw new Error('Cannot serialize an empty alternative path to SHACL sh:path.');\n      }\n      if (e.alt.length === 1) return serialize(e.alt[0]);\n      return operator('alternativePath', blankList(e.alt.map(serialize)));\n    }\n    if ('zeroOrMore' in e) return operator('zeroOrMorePath', serialize(e.zeroOrMore));\n    if ('oneOrMore' in e) return operator('oneOrMorePath', serialize(e.oneOrMore));\n    if ('zeroOrOne' in e) return operator('zeroOrOnePath', serialize(e.zeroOrOne));\n    if ('negatedPropertySet' in e) {\n      throw new Error(\n        'negatedPropertySet cannot be serialized to SHACL sh:path — no SHACL representation.',\n      );\n    }\n    throw new Error(`Unknown PathExpr shape: ${JSON.stringify(e)}`);\n  };\n  return serialize(path);\n}\n\n/** An `rdf:List` of blank cells (`rdf:first`/`rdf:rest` only), terminated by `rdf:nil`. */\nfunction blankList(items: PathNodeData[]): RdfListNodeData {\n  return items.reduceRight<RdfListNodeData>(\n    (rest, first) => ({shape: List, __blank: true, first, rest}),\n    {id: rdf.nil.id},\n  );\n}\n"]}
+{"version":3,"file":"serializePathToNodeData.js","sourceRoot":"","sources":["../../../src/shapes/serializePathToNodeData.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,SAAS,EAAC,MAAM,8BAA8B,CAAC;AAEvD,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AACvC,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAUvC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAc,EAAE,KAAc;IACpE,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,OAAgB,EAAgB,EAAE,CAAC,CAAC;QACjE,KAAK,EAAE,QAAQ;QACf,CAAC,GAAG,CAAC,EAAE,OAAO;KACf,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,CAAC,CAAW,EAAgB,EAAE;QAC9C,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,EAAC,EAAE,EAAE,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAC,CAAC;QAChD,CAAC;QACD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,yEAAyE;YACzE,yEAAyE;YACzE,wEAAwE;YACxE,yEAAyE;YACzE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,4EAA4E;YAC5E,4EAA4E;YAC5E,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,YAAY,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAClF,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/E,IAAI,WAAW,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/E,IAAI,oBAAoB,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CACb,qFAAqF,CACtF,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC,CAAC;IACF,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED,uFAAuF;AACvF,SAAS,SAAS,CAAC,KAAqB;IACtC,OAAO,KAAK,CAAC,WAAW,CACtB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC,EACjD,EAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,CACjB,CAAC;AACJ,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 */\nimport type {PathExpr} from '../paths/PropertyPathExpr.js';\nimport {isPathRef} from '../paths/PropertyPathExpr.js';\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {PathList} from './PathList.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {PathNode} from './PathNode.js';\n\n/**\n * Node-data the create pipeline accepts for a `sh:path` value: an IRI reference (simple path),\n * a `PathList` (sequence / alternative members), or a `PathNode` operator node.\n */\nexport type PathNodeData =\n  | NodeReferenceValue\n  | {shape: typeof PathList | typeof PathNode; [k: string]: unknown};\n\n/**\n * Translate a `PathExpr` into create-pipeline node-data for `sh:path`.\n *\n * - simple `PathRef` → `{id}` (a shared predicate IRI; NOT owned)\n * - sequence → a `PathList` (an `rdf:List`) of segments\n * - inverse / alternative / cardinality → a `PathNode` operator node (alt's operand is a `PathList`)\n *\n * Operator nodes and list cells carry no id. `PropertyShape.path`, the `PathNode` slots and\n * `PathList.first` / `.rest` are `sh:BlankNodeOrIRI`, so the create writes each of them as an\n * untyped blank node, the only form SHACL §2.3.1 defines: an IRI in `sh:path` is a predicate path,\n * and an inverse, alternative or cardinality path is a blank node that is the subject of exactly\n * one triple.\n *\n * ```turtle\n * <ps> sh:path [ sh:inversePath schema:image ] .\n * <ps> sh:path ( schema:knows [ sh:zeroOrMorePath schema:parent ] ) .\n * ```\n *\n * A re-sync's delete removes the structure (the blank-node cascade follows the blank-capable\n * properties) before the create writes it again.\n *\n * @param _base ignored. It seeded the IRIs of the nodes this used to mint (`{base}/inv`, …);\n *   blank nodes have none. Kept so existing two-argument calls still compile.\n */\nexport function serializePathToNodeData(path: PathExpr, _base?: string): PathNodeData {\n  const operator = (key: string, operand: unknown): PathNodeData => ({\n    shape: PathNode,\n    [key]: operand,\n  });\n  const serialize = (e: PathExpr): PathNodeData => {\n    if (isPathRef(e)) {\n      return {id: typeof e === 'string' ? e : e.id};\n    }\n    if ('seq' in e) {\n      // SHACL §2.3.1: a sequence path is a list with **at least two** members.\n      // A 0/1-member sequence is not a list — collapse a singleton to its bare\n      // member, reject an empty one. (normalizePropertyPath already collapses\n      // these upstream; this keeps the serializer independently spec-correct.)\n      if (e.seq.length === 0) {\n        throw new Error('Cannot serialize an empty sequence path to SHACL sh:path.');\n      }\n      if (e.seq.length === 1) return serialize(e.seq[0]);\n      return blankList(e.seq.map(serialize));\n    }\n    if ('inv' in e) return operator('inversePath', serialize(e.inv));\n    if ('alt' in e) {\n      // SHACL §2.3.2: sh:alternativePath is a list with **at least two** members.\n      // Collapse a singleton alternative to its bare member, reject an empty one.\n      if (e.alt.length === 0) {\n        throw new Error('Cannot serialize an empty alternative path to SHACL sh:path.');\n      }\n      if (e.alt.length === 1) return serialize(e.alt[0]);\n      return operator('alternativePath', blankList(e.alt.map(serialize)));\n    }\n    if ('zeroOrMore' in e) return operator('zeroOrMorePath', serialize(e.zeroOrMore));\n    if ('oneOrMore' in e) return operator('oneOrMorePath', serialize(e.oneOrMore));\n    if ('zeroOrOne' in e) return operator('zeroOrOnePath', serialize(e.zeroOrOne));\n    if ('negatedPropertySet' in e) {\n      throw new Error(\n        'negatedPropertySet cannot be serialized to SHACL sh:path — no SHACL representation.',\n      );\n    }\n    throw new Error(`Unknown PathExpr shape: ${JSON.stringify(e)}`);\n  };\n  return serialize(path);\n}\n\n/** A `PathList` of cells without ids (blank once written), terminated by `rdf:nil`. */\nfunction blankList(items: PathNodeData[]): PathNodeData {\n  return items.reduceRight<PathNodeData>(\n    (rest, first) => ({shape: PathList, first, rest}),\n    {id: rdf.nil.id},\n  );\n}\n"]}

package/lib/esm/shapes/validation.js

@@ -55,10 +55,10 @@ export class ShapeValidationError extends Error {
 }
 /**
  * Keys that carry metadata about the node rather than a property value: `id` /
- * `__id` name it, `__blank` asks for an anonymous node, and `shape` names the shape of a nested value when the
+ * `__id` name it, and `shape` names the shape of a nested value when the
  * property shape itself doesn't declare one (see `convertUpdateValue`).
  */
-const RESERVED_KEYS = new Set(['id', '__id', '__blank', 'shape']);
+const RESERVED_KEYS = new Set(['id', '__id', 'shape']);
 /**
  * The message for an undeclared property key. Shared with the normalization path
  * in `MutationQuery`, which needs the same guard to build a field at all.