@_linked/core 2.31.0 → 2.32.0

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

@@ -1 +1 @@
-{"version":3,"file":"syncShapes.js","sourceRoot":"","sources":["../../../src/shapes/syncShapes.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,kBAAkB,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AACzE,OAAO,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AACrC,OAAO,EACL,uBAAuB,GAGxB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAC,aAAa,EAAC,MAAM,6BAA6B,CAAC;AAE1D,OAAO,EAAC,OAAO,EAAC,MAAM,WAAW,CAAC;AAClC,OAAO,EAAC,uBAAuB,EAAC,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAC,2BAA2B,EAAC,MAAM,4BAA4B,CAAC;AAEvE;;;GAGG;AACH,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAE1C;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB,EAAE,QAAgB;IAC5E,MAAM,KAAK,GAAG,GAAG,QAAQ,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IACxC,MAAM,CAAC,GAA4B;QACjC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,uBAAuB,CAAC,EAAE,CAAC,IAAI,CAAC;KACvC,CAAC;IACF,+EAA+E;IAC/E,+EAA+E;IAC/E,sCAAsC;IACtC,EAAE;IACF,8EAA8E;IAC9E,8EAA8E;IAC9E,iFAAiF;IACjF,gFAAgF;IAChF,4EAA4E;IAC5E,iFAAiF;IACjF,iEAAiE;IACjE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,EAAE,CAAC,IAAI;QAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IAC9B,IAAI,EAAE,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACnD,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACrD,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,OAAO,EAAE,CAAC,WAAW,KAAK,QAAQ;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACvE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;QAAE,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,aAAa,CAAC;IACvE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAC,IAAI,EAAE,GAAG,KAAK,KAAK,EAAC,CAAC,CAAC;IACxD,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,uDAAuD;IACvD,IAAI,EAAE,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,CAAC,kBAAkB,KAAK,SAAS;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,kBAAkB,CAAC;IAC5E,IAAI,EAAE,CAAC,UAAU;QAAE,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;IAChD,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iGAAiG;AACjG,SAAS,kBAAkB,CAAC,SAAwB,EAAE,QAAgB;IACpE,MAAM,CAAC,GAA4B,EAAE,CAAC;IACtC,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IACrD,IAAI,SAAS,CAAC,SAAS;QAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS;QAAE,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChE,IAAI,SAAS,CAAC,iBAAiB,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;QACtE,CAAC,CAAC,iBAAiB,GAAG,SAAS,CAAC,iBAAiB,CAAC;IACpD,CAAC;IACD,qFAAqF;IACrF,CAAC,CAAC,UAAU,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAC3D,sBAAsB,CAAC,EAAE,EAAE,QAAQ,CAAC,CACrC,CAAC;IACF,uFAAuF;IACvF,qFAAqF;IACrF,MAAM,SAAS,GAAG,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACnE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAC,GAAG,EAAE,IAAI,EAAC,EAAE,EAAE,CAAC,iBAAE,IAAI,EAAE,GAAG,IAAK,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,cAAc,CAAC,SAAwB,EAAE,GAAW,EAAE,EAAa;IAC1E,OAAO,GAAS,EAAE;QAChB,gFAAgF;QAChF,kBAAkB;QAClB,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,MAAO,SAAS,CAAC,MAAM,CAAC,IAAa,CAAC,CAAC,MAAM,CAAC,GAAG,CAE/C,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC,CAAA,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,SAAS,eAAe,CAAC,SAAwB,EAAE,GAAW;IAC5D,OAAO,2BAA2B,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,6FAA6F;AAC7F,SAAS,6BAA6B,CACpC,SAAwB,EACxB,GAAW,EACX,YAAsC;IAEtC,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;QACxD,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,SAAS,+CAA+C,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAwBD,gGAAgG;AAChG,SAAS,cAAc,CAAC,GAAW;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,UAAgB,UAAU,CAC9B,EAAa,EACb,OAA2B;;;QAE3B,MAAM,WAAW,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,MAAM,CAAC;QACnD,4EAA4E;QAC5E,MAAM,UAAU,GAAmD,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,kBAAkB,EAAE,EAAE,CAAC;YACrD,IAAI,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,KAAK,CAAA;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAI,UAAqC,CAAC,WAAW,CAAC;YAC/D,yFAAyF;YACzF,uEAAuE;YACvE,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB;gBAAE,SAAS;YAChD,UAAU,CAAC,IAAI,CAAC,EAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,KAAK,EAAC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,8FAA8F;QAC9F,wFAAwF;QACxF,yFAAyF;QACzF,qDAAqD;QACrD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC;gBAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzF,CAAC;QACD,iGAAiG;QACjG,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,MAAM,MAAM,GAA+B,EAAE,CAAC;QAE9C,wDAAwD;QACxD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gGAAgG;QAChG,uFAAuF;QACvF,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,CAAC,MAAO,SAE3B,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAwB,CAAC;YAE7C,0FAA0F;YAC1F,8FAA8F;YAC9F,0EAA0E;YAC1E,KAAK,MAAM,EAAC,EAAE,EAAE,GAAG,EAAC,IAAI,YAAY,EAAE,CAAC;gBACrC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACtC,IAAI,WAAW,KAAK,iBAAiB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACnF,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAsB,CAAC,IAAI,CAC1E,GAAG,EAAE,CAAC,SAAS,CAChB,CACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CAAA;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,SAAS,CAAC,MAA6B,EAAE,EAAa;IACpE,iDAAiD;IACjD,MAAM,GAAG,GACP,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,MAAuB,CAAC;IAChF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,0CAA0C,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,KAAK,CAAC;IAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CACb,OAAO,MAAM,KAAK,QAAQ;YACxB,CAAC,CAAC,0CAA0C,MAAM,EAAE;YACpD,CAAC,CAAC,6CAA6C,CAClD,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;IAEzB,+FAA+F;IAC/F,uDAAuD;IACvD,MAAM,GAAG,GAAI,GAA8B,CAAC,WAAW,CAAC;IACxD,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,oDAAoD,GAAG,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;AAC5C,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 {getAllShapeClasses, getShapeClass} from '../utils/ShapeClass.js';\nimport {NodeShape} from './SHACL.js';\nimport {\n  getUniquePropertyShapes,\n  type NodeShapeData,\n  type PropertyShapeData,\n} from './nodeShapeData.js';\nimport {Shape} from './Shape.js';\nimport {DeleteBuilder} from '../queries/DeleteBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport {rdfList} from './List.js';\nimport {serializePathToNodeData} from './serializePathToNodeData.js';\nimport {buildSingleOwnerConstraints} from './singleOwnerConstraint.js';\n\n/**\n * The npm scope of framework shapes (NodeShape/PropertyShape/List/PathNode/Shape) that\n * describe the meta-model itself and must never be synced as user data.\n */\nconst FRAMEWORK_PACKAGE = '@_linked/core';\n\n/**\n * Build the create-pipeline data object for a single PropertyShape (flattened under shapeIri).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport function buildPropertyShapeData(ps: PropertyShapeData, shapeIri: string): Record<string, unknown> {\n  const psIri = `${shapeIri}/${ps.label}`;\n  const d: Record<string, unknown> = {\n    __id: psIri,\n    path: serializePathToNodeData(ps.path),\n  };\n  // `rdfs:label` — the DSL label, i.e. the accessor name the property is reached\n  // by in code (`person.memberships`). It is NOT `sh:name`, written below, which\n  // is a human-readable display string.\n  //\n  // Without this the label is only ever implied by `psIri`, and a reader has to\n  // re-derive one from the path's local part. That works right up until the two\n  // differ — `@_linked/org` declares `memberships` on the path `org:hasMembership`\n  // — at which point the catalog reports `hasMembership`, the query proxy indexes\n  // the shape with it, and the class (which only knows `memberships`) throws.\n  // Readers already prefer a stored label and fall back to the path, so writing it\n  // is the whole fix; old catalogs keep working via that fallback.\n  if (ps.label) d.label = ps.label;\n  if (ps.nodeKind) d.nodeKind = ps.nodeKind;\n  if (ps.datatype) d.datatype = ps.datatype;\n  if (typeof ps.minCount === 'number') d.minCount = ps.minCount;\n  if (typeof ps.maxCount === 'number') d.maxCount = ps.maxCount;\n  if (ps.name) d.name = ps.name;\n  if (ps.description) d.description = ps.description;\n  if (typeof ps.order === 'number') d.order = ps.order;\n  if (ps.group) d.group = ps.group;\n  if (typeof ps.displayRank === 'number') d.displayRank = ps.displayRank;\n  if (ps.displayHidden !== undefined) d.displayHidden = ps.displayHidden;\n  if (ps.class) d.class = ps.class;\n  if (ps.in) d.in = rdfList(ps.in, {base: `${psIri}/in`});\n  if (ps.equalsConstraint) d.equalsConstraint = ps.equalsConstraint;\n  if (ps.disjoint) d.disjoint = ps.disjoint;\n  if (ps.lessThan) d.lessThan = ps.lessThan;\n  if (ps.lessThanOrEquals) d.lessThanOrEquals = ps.lessThanOrEquals;\n  if (ps.minInclusive !== undefined) d.minInclusive = ps.minInclusive;\n  if (ps.maxInclusive !== undefined) d.maxInclusive = ps.maxInclusive;\n  if (ps.minExclusive !== undefined) d.minExclusive = ps.minExclusive;\n  if (ps.maxExclusive !== undefined) d.maxExclusive = ps.maxExclusive;\n  if (typeof ps.minLength === 'number') d.minLength = ps.minLength;\n  if (typeof ps.maxLength === 'number') d.maxLength = ps.maxLength;\n  // sh:pattern is serialized as its regex source string.\n  if (ps.pattern) d.pattern = ps.pattern.source;\n  if (ps.hasValueConstraint !== undefined) d.hasValue = ps.hasValueConstraint;\n  if (ps.valueShape) d.valueShape = ps.valueShape;\n  if (ps.contains) d.contains = true;\n  return d;\n}\n\n/** Build the create-pipeline data object for a NodeShape and its (flattened) property shapes. */\nfunction buildNodeShapeData(nodeShape: NodeShapeData, shapeIri: string): Record<string, unknown> {\n  const d: Record<string, unknown> = {};\n  if (nodeShape.targetClass) d.targetClass = nodeShape.targetClass;\n  if (nodeShape.description) d.description = nodeShape.description;\n  if (nodeShape.extends) d.extends = nodeShape.extends;\n  if (nodeShape.dependent) d.dependent = true;\n  if (nodeShape.closed !== undefined) d.closed = nodeShape.closed;\n  if (nodeShape.ignoredProperties && nodeShape.ignoredProperties.length) {\n    d.ignoredProperties = nodeShape.ignoredProperties;\n  }\n  // Flatten: emit own + inherited property shapes (deduped by label) under this shape.\n  d.properties = getUniquePropertyShapes(nodeShape).map((ps) =>\n    buildPropertyShapeData(ps, shapeIri),\n  );\n  // The single-owner constraints of the shape's own `contains` properties, owned through\n  // `core:generatedShape` and written nested in the same create with their fixed IRIs.\n  const generated = buildSingleOwnerConstraints(nodeShape, shapeIri);\n  if (generated.length > 0) {\n    d.generatedShapes = generated.map(({iri, data}) => ({__id: iri, ...data}));\n  }\n  return d;\n}\n\n/**\n * The per-shape `delete → create` thunk shared by `syncShapes()` and `syncShape()`: exactly two\n * requests. The delete cascade-cleans the shape's old property-shape / list / path subtrees; the\n * create rebuilds them.\n *\n * The single-owner constraints generated from the shape's own `contains` properties\n * (`${iri}/${label}.singleOwner`, see `singleOwnerConstraint.ts`) are owned by the shape through\n * `core:generatedShape` (a `contains` property with value shape NodeShape). The delete removes\n * each one's own triples (the immediate owned-child block) and their property shapes and path\n * nodes (the dependent cascade); the create writes the current ones nested, in the same request\n * as the shape. A removed or renamed accessor therefore loses its constraint on the next sync,\n * and a NodeShape the shape does not own is never touched.\n *\n * `ds` (optional) targets an explicit dataset — both requests run against it instead of the\n * global router. Omitted → today's global behavior.\n */\nfunction buildSyncThunk(nodeShape: NodeShapeData, iri: string, ds?: IDataset): () => Promise<void> {\n  return async () => {\n    // Build the data fresh on each invocation, so every run writes from the current\n    // shape metadata.\n    const data = buildNodeShapeData(nodeShape, iri);\n    await DeleteBuilder.from(NodeShape, {id: iri}).exec(ds);\n    await (NodeShape.create(data as never).withId(iri) as unknown as {\n      exec: (target?: IDataset) => Promise<unknown>;\n    }).exec(ds);\n  };\n}\n\n/** The generated single-owner shape IRIs a code shape writes. */\nfunction generatedIrisOf(nodeShape: NodeShapeData, iri: string): string[] {\n  return buildSingleOwnerConstraints(nodeShape, iri).map((c) => c.iri);\n}\n\n/** Throw when a registered shape IRI equals one of a shape's generated single-owner IRIs. */\nfunction assertNoGeneratedIriCollision(\n  nodeShape: NodeShapeData,\n  iri: string,\n  isRegistered: (iri: string) => boolean,\n): void {\n  for (const generated of generatedIrisOf(nodeShape, iri)) {\n    if (isRegistered(generated)) {\n      throw new Error(`Shape IRI ${generated} collides with a generated single-owner shape`);\n    }\n  }\n}\n\n/** Options controlling how {@link syncShapes} treats store shapes that are not in code. */\nexport interface SyncShapesOptions {\n  /**\n   * How to treat NodeShapes present in the store but not in the current process's code:\n   * - `'none'` (default) — never prune; purely additive (delete→recreate the code shapes, touch\n   *   nothing else). The only mode that is safe when the process has loaded a *subset* of the\n   *   shapes in the dataset, or when the dataset has more than one writer.\n   * - `'all'` — prune every store-only shape as an orphan. Only correct when this process has\n   *   loaded **every** shape the dataset should hold and is its **only** writer; \"not registered\n   *   here\" is then taken to mean \"deleted from code\".\n   * - `'ownedNamespaces'` — prune a store-only shape ONLY if its IRI falls within a namespace\n   *   this process actually writes (the package-namespace of one of its code-registered shapes,\n   *   i.e. the IRI prefix up to the last `/` or `#`). Protects other writers' packages (arch-04:\n   *   one app-data dataset, several writers), but NOT the rest of a package the process only\n   *   partially loaded — the namespace is the whole package, so a deep import of one shape file\n   *   still claims all of it.\n   *\n   * `'all'` and `'ownedNamespaces'` are destructive and must be requested explicitly.\n   */\n  orphanScope?: 'all' | 'ownedNamespaces' | 'none';\n}\n\n/** The owning namespace of a shape IRI — everything up to and including the last `/` or `#`. */\nfunction shapeNamespace(iri: string): string {\n  const cut = Math.max(iri.lastIndexOf('/'), iri.lastIndexOf('#'));\n  return cut >= 0 ? iri.slice(0, cut + 1) : iri;\n}\n\n/**\n * Plan an idempotent sync of all code-registered (non-framework) NodeShapes into the store as\n * SHACL data — the forward (code → graph) materialization of arch-05 \"code is canonical\".\n *\n * Returns built-but-unexecuted thunks; the caller controls execution and batching:\n * ```ts\n * await Promise.all((await syncShapes()).map((run) => run()));\n * ```\n * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old\n * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).\n *\n * **Shapes in the store but not registered in this process are left alone by default**\n * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and\n * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a\n * time, and an app-data dataset also holds shapes other writers materialized (CN's\n * `bindShape` / `enableCapability`). \"Not registered here\" therefore does not mean \"deleted from\n * code\". Measured against a dataset holding the 36 `@_linked/schema` shapes: a process that\n * imported only `@_linked/schema/shapes/Thing` (11 shapes registered) deleted the other 25 under\n * both `'all'` and `'ownedNamespaces'`, and a process that imported no shapes deleted all 36.\n *\n * Pruning is opt-in via `options.orphanScope` (see {@link SyncShapesOptions}): pass `'all'` only\n * from a process that has loaded every shape the dataset should hold and is its sole writer, and\n * `'ownedNamespaces'` only when it has loaded every shape of each package it registers. Pruned\n * orphans are deleted with their owned subtree. Pruning reads the existing shape IRIs first;\n * with `'none'` no read is made.\n *\n * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**\n * parameter: it feeds both the orphan-detection read (so orphans are computed against the same\n * store they'll be pruned from) and every delete/create thunk. Omitted → the global router;\n * the returned thunks stay nullary either way.\n */\nexport async function syncShapes(\n  ds?: IDataset,\n  options?: SyncShapesOptions,\n): Promise<Array<() => Promise<void>>> {\n  const orphanScope = options?.orphanScope ?? 'none';\n  // 1. Enumerate code-registered user shapes (exclude framework/meta shapes).\n  const userShapes: Array<{iri: string; nodeShape: NodeShapeData}> = [];\n  for (const [iri, shapeClass] of getAllShapeClasses()) {\n    if (!shapeClass?.shape) continue;\n    const pkg = (shapeClass as {packageName?: string}).packageName;\n    // Skip framework/meta shapes: the core package, and the base `Shape` which is registered\n    // directly (no applyLinkedShape) and therefore carries no packageName.\n    if (!pkg || pkg === FRAMEWORK_PACKAGE) continue;\n    userShapes.push({iri, nodeShape: shapeClass.shape});\n  }\n  const localShapeIris = new Set(userShapes.map((s) => s.iri));\n  for (const {iri, nodeShape} of userShapes) {\n    assertNoGeneratedIriCollision(nodeShape, iri, (id) => localShapeIris.has(id));\n  }\n  // The generated single-owner shapes of in-code shapes are written by the same thunks, so they\n  // are never orphans. Derived in memory from the same function that builds them; a stale\n  // generated shape (removed accessor or shape) is not protected and goes with its owner's\n  // delete, through the `core:generatedShape` cascade.\n  for (const {iri, nodeShape} of userShapes) {\n    for (const generated of generatedIrisOf(nodeShape, iri)) localShapeIris.add(generated);\n  }\n  // Namespaces this process actually writes — the ownership scope for `'ownedNamespaces'` pruning.\n  const ownedNamespaces = new Set(userShapes.map((s) => shapeNamespace(s.iri)));\n\n  const thunks: Array<() => Promise<void>> = [];\n\n  // 2. Per in-code shape: delete (cascade) then recreate.\n  for (const {iri, nodeShape} of userShapes) {\n    thunks.push(buildSyncThunk(nodeShape, iri, ds));\n  }\n\n  // 3. Orphan sweep (unless disabled). Identity-read existing NodeShape IRIs (ids only). Must hit\n  //    the same `ds` the thunks target, or orphans get computed against the wrong store.\n  if (orphanScope !== 'none') {\n    const existingRows = (await (NodeShape as unknown as {\n      select: () => {exec: (target?: IDataset) => Promise<Array<{id: string}>>};\n    }).select().exec(ds)) as Array<{id: string}>;\n\n    // Orphan shapes (in store, not in code) → delete (cascade cleans their owned subtree). In\n    // `'ownedNamespaces'` mode, only shapes within a namespace this process writes are eligible —\n    // other writers' shapes (different package namespace) are left untouched.\n    for (const {id: iri} of existingRows) {\n      if (localShapeIris.has(iri)) continue;\n      if (orphanScope === 'ownedNamespaces' && !ownedNamespaces.has(shapeNamespace(iri))) {\n        continue;\n      }\n      thunks.push(() =>\n        (DeleteBuilder.from(NodeShape, {id: iri}).exec(ds) as Promise<unknown>).then(\n          () => undefined,\n        ),\n      );\n    }\n  }\n\n  return thunks;\n}\n\n/**\n * Plan an idempotent sync of ONE code-registered NodeShape into the store as SHACL data.\n *\n * Scoped counterpart to {@link syncShapes}: materializes a single shape (delete → recreate, so the\n * delete cascade-cleans the old property-shape / list / path subtrees and the create rebuilds them)\n * and does NOT run the store-wide orphan sweep — other shapes in the store are untouched.\n *\n * @param target a shape class (e.g. `Person`) or its NodeShape IRI string. An IRI is resolved to\n *   its registered class via `getShapeClass`; the shape must be code-registered.\n * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete\n *   and the create run against it instead of the global router. Omitted → global behavior.\n * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch\n *   several together — e.g. a shape plus its referenced object-property shapes:\n *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.\n * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.\n */\nexport function syncShape(target: typeof Shape | string, ds?: IDataset): () => Promise<void> {\n  // Normalize target → its registered shape class.\n  const cls =\n    typeof target === 'string' ? getShapeClass(target) : (target as typeof Shape);\n  if (typeof target === 'string' && !cls) {\n    throw new Error(`syncShape: no registered shape for IRI ${target}`);\n  }\n  const nodeShape = cls?.shape;\n  if (!nodeShape) {\n    throw new Error(\n      typeof target === 'string'\n        ? `syncShape: no registered shape for IRI ${target}`\n        : `syncShape: shape class has no static .shape`,\n    );\n  }\n  const iri = nodeShape.id;\n\n  // Never materialize a framework/meta shape as user data — same invariant syncShapes() enforces\n  // by skipping (the base Shape carries no packageName).\n  const pkg = (cls as {packageName?: string}).packageName;\n  if (!pkg || pkg === FRAMEWORK_PACKAGE) {\n    throw new Error(`syncShape: refusing to sync framework/meta shape ${iri}`);\n  }\n\n  assertNoGeneratedIriCollision(nodeShape, iri, (id) => !!getShapeClass(id));\n  return buildSyncThunk(nodeShape, iri, ds);\n}\n"]}
+{"version":3,"file":"syncShapes.js","sourceRoot":"","sources":["../../../src/shapes/syncShapes.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,kBAAkB,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AACzE,OAAO,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AACrC,OAAO,EACL,uBAAuB,GAGxB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAC,aAAa,EAAC,MAAM,6BAA6B,CAAC;AAE1D,OAAO,EAAC,OAAO,EAAC,MAAM,WAAW,CAAC;AAClC,OAAO,EAAC,uBAAuB,EAAC,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAC,2BAA2B,EAAC,MAAM,4BAA4B,CAAC;AAEvE;;;GAGG;AACH,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAE1C;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB,EAAE,QAAgB;IAC5E,MAAM,KAAK,GAAG,GAAG,QAAQ,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IACxC,MAAM,CAAC,GAA4B;QACjC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,uBAAuB,CAAC,EAAE,CAAC,IAAI,CAAC;KACvC,CAAC;IACF,+EAA+E;IAC/E,+EAA+E;IAC/E,sCAAsC;IACtC,EAAE;IACF,8EAA8E;IAC9E,8EAA8E;IAC9E,iFAAiF;IACjF,gFAAgF;IAChF,4EAA4E;IAC5E,iFAAiF;IACjF,iEAAiE;IACjE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,EAAE,CAAC,IAAI;QAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IAC9B,IAAI,EAAE,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACnD,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACrD,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,OAAO,EAAE,CAAC,WAAW,KAAK,QAAQ;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACvE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;QAAE,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,aAAa,CAAC;IACvE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAC,IAAI,EAAE,GAAG,KAAK,KAAK,EAAC,CAAC,CAAC;IACxD,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,uDAAuD;IACvD,IAAI,EAAE,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,CAAC,kBAAkB,KAAK,SAAS;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,kBAAkB,CAAC;IAC5E,IAAI,EAAE,CAAC,UAAU;QAAE,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;IAChD,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iGAAiG;AACjG,SAAS,kBAAkB,CAAC,SAAwB,EAAE,QAAgB;IACpE,MAAM,CAAC,GAA4B,EAAE,CAAC;IACtC,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IACrD,IAAI,SAAS,CAAC,SAAS;QAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS;QAAE,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChE,IAAI,SAAS,CAAC,iBAAiB,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;QACtE,CAAC,CAAC,iBAAiB,GAAG,SAAS,CAAC,iBAAiB,CAAC;IACpD,CAAC;IACD,qFAAqF;IACrF,CAAC,CAAC,UAAU,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAC3D,sBAAsB,CAAC,EAAE,EAAE,QAAQ,CAAC,CACrC,CAAC;IACF,uFAAuF;IACvF,qFAAqF;IACrF,MAAM,SAAS,GAAG,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACnE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAC,GAAG,EAAE,IAAI,EAAC,EAAE,EAAE,CAAC,iBAAE,IAAI,EAAE,GAAG,IAAK,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,cAAc,CAAC,SAAwB,EAAE,GAAW,EAAE,EAAa;IAC1E,OAAO,GAAS,EAAE;QAChB,gFAAgF;QAChF,kBAAkB;QAClB,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,MAAO,SAAS,CAAC,MAAM,CAAC,IAAa,CAAC,CAAC,MAAM,CAAC,GAAG,CAE/C,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC,CAAA,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,SAAS,eAAe,CAAC,SAAwB,EAAE,GAAW;IAC5D,OAAO,2BAA2B,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,6FAA6F;AAC7F,SAAS,6BAA6B,CACpC,SAAwB,EACxB,GAAW,EACX,YAAsC;IAEtC,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;QACxD,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,SAAS,+CAA+C,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAwBD,gGAAgG;AAChG,SAAS,cAAc,CAAC,GAAW;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,UAAgB,UAAU,CAC9B,EAAa,EACb,OAA2B;;;QAE3B,MAAM,WAAW,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,MAAM,CAAC;QACnD,4EAA4E;QAC5E,MAAM,UAAU,GAAmD,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,kBAAkB,EAAE,EAAE,CAAC;YACrD,IAAI,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,KAAK,CAAA;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAI,UAAqC,CAAC,WAAW,CAAC;YAC/D,yFAAyF;YACzF,uEAAuE;YACvE,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB;gBAAE,SAAS;YAChD,UAAU,CAAC,IAAI,CAAC,EAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,KAAK,EAAC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,8FAA8F;QAC9F,wFAAwF;QACxF,yFAAyF;QACzF,qDAAqD;QACrD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC;gBAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzF,CAAC;QACD,iGAAiG;QACjG,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,MAAM,MAAM,GAA+B,EAAE,CAAC;QAE9C,wDAAwD;QACxD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gGAAgG;QAChG,uFAAuF;QACvF,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,CAAC,MAAO,SAE3B,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAwB,CAAC;YAE7C,0FAA0F;YAC1F,8FAA8F;YAC9F,0EAA0E;YAC1E,KAAK,MAAM,EAAC,EAAE,EAAE,GAAG,EAAC,IAAI,YAAY,EAAE,CAAC;gBACrC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACtC,IAAI,WAAW,KAAK,iBAAiB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACnF,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAsB,CAAC,IAAI,CAC1E,GAAG,EAAE,CAAC,SAAS,CAChB,CACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CAAA;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,SAAS,CAAC,MAA6B,EAAE,EAAa;IACpE,iDAAiD;IACjD,MAAM,GAAG,GACP,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,MAAuB,CAAC;IAChF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,0CAA0C,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,KAAK,CAAC;IAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CACb,OAAO,MAAM,KAAK,QAAQ;YACxB,CAAC,CAAC,0CAA0C,MAAM,EAAE;YACpD,CAAC,CAAC,6CAA6C,CAClD,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;IAEzB,+FAA+F;IAC/F,uDAAuD;IACvD,MAAM,GAAG,GAAI,GAA8B,CAAC,WAAW,CAAC;IACxD,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,oDAAoD,GAAG,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;AAC5C,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 {getAllShapeClasses, getShapeClass} from '../utils/ShapeClass.js';\nimport {NodeShape} from './SHACL.js';\nimport {\n  getUniquePropertyShapes,\n  type NodeShapeData,\n  type PropertyShapeData,\n} from './nodeShapeData.js';\nimport {Shape} from './Shape.js';\nimport {DeleteBuilder} from '../queries/DeleteBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport {rdfList} from './List.js';\nimport {serializePathToNodeData} from './serializePathToNodeData.js';\nimport {buildSingleOwnerConstraints} from './singleOwnerConstraint.js';\n\n/**\n * The npm scope of framework shapes (NodeShape/PropertyShape/List/PathNode/Shape) that\n * describe the meta-model itself and must never be synced as user data.\n */\nconst FRAMEWORK_PACKAGE = '@_linked/core';\n\n/**\n * Build the create-pipeline data object for a single PropertyShape (flattened under shapeIri).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport function buildPropertyShapeData(ps: PropertyShapeData, shapeIri: string): Record<string, unknown> {\n  const psIri = `${shapeIri}/${ps.label}`;\n  const d: Record<string, unknown> = {\n    __id: psIri,\n    path: serializePathToNodeData(ps.path),\n  };\n  // `rdfs:label` — the DSL label, i.e. the accessor name the property is reached\n  // by in code (`person.memberships`). It is NOT `sh:name`, written below, which\n  // is a human-readable display string.\n  //\n  // Without this the label is only ever implied by `psIri`, and a reader has to\n  // re-derive one from the path's local part. That works right up until the two\n  // differ — `@_linked/org` declares `memberships` on the path `org:hasMembership`\n  // — at which point the catalog reports `hasMembership`, the query proxy indexes\n  // the shape with it, and the class (which only knows `memberships`) throws.\n  // Readers already prefer a stored label and fall back to the path, so writing it\n  // is the whole fix; old catalogs keep working via that fallback.\n  if (ps.label) d.label = ps.label;\n  if (ps.nodeKind) d.nodeKind = ps.nodeKind;\n  if (ps.datatype) d.datatype = ps.datatype;\n  if (typeof ps.minCount === 'number') d.minCount = ps.minCount;\n  if (typeof ps.maxCount === 'number') d.maxCount = ps.maxCount;\n  if (ps.name) d.name = ps.name;\n  if (ps.description) d.description = ps.description;\n  if (typeof ps.order === 'number') d.order = ps.order;\n  if (ps.group) d.group = ps.group;\n  if (typeof ps.displayRank === 'number') d.displayRank = ps.displayRank;\n  if (ps.displayHidden !== undefined) d.displayHidden = ps.displayHidden;\n  if (ps.class) d.class = ps.class;\n  if (ps.in) d.in = rdfList(ps.in, {base: `${psIri}/in`});\n  if (ps.equalsConstraint) d.equalsConstraint = ps.equalsConstraint;\n  if (ps.disjoint) d.disjoint = ps.disjoint;\n  if (ps.lessThan) d.lessThan = ps.lessThan;\n  if (ps.lessThanOrEquals) d.lessThanOrEquals = ps.lessThanOrEquals;\n  if (ps.minInclusive !== undefined) d.minInclusive = ps.minInclusive;\n  if (ps.maxInclusive !== undefined) d.maxInclusive = ps.maxInclusive;\n  if (ps.minExclusive !== undefined) d.minExclusive = ps.minExclusive;\n  if (ps.maxExclusive !== undefined) d.maxExclusive = ps.maxExclusive;\n  if (typeof ps.minLength === 'number') d.minLength = ps.minLength;\n  if (typeof ps.maxLength === 'number') d.maxLength = ps.maxLength;\n  // sh:pattern is serialized as its regex source string.\n  if (ps.pattern) d.pattern = ps.pattern.source;\n  if (ps.hasValueConstraint !== undefined) d.hasValue = ps.hasValueConstraint;\n  if (ps.valueShape) d.valueShape = ps.valueShape;\n  if (ps.contains) d.contains = true;\n  return d;\n}\n\n/** Build the create-pipeline data object for a NodeShape and its (flattened) property shapes. */\nfunction buildNodeShapeData(nodeShape: NodeShapeData, shapeIri: string): Record<string, unknown> {\n  const d: Record<string, unknown> = {};\n  if (nodeShape.targetClass) d.targetClass = nodeShape.targetClass;\n  if (nodeShape.description) d.description = nodeShape.description;\n  if (nodeShape.extends) d.extends = nodeShape.extends;\n  if (nodeShape.dependent) d.dependent = true;\n  if (nodeShape.closed !== undefined) d.closed = nodeShape.closed;\n  if (nodeShape.ignoredProperties && nodeShape.ignoredProperties.length) {\n    d.ignoredProperties = nodeShape.ignoredProperties;\n  }\n  // Flatten: emit own + inherited property shapes (deduped by label) under this shape.\n  d.properties = getUniquePropertyShapes(nodeShape).map((ps) =>\n    buildPropertyShapeData(ps, shapeIri),\n  );\n  // The single-owner constraints of the shape's own `contains` properties, owned through\n  // `core:generatedShape` and written nested in the same create with their fixed IRIs.\n  const generated = buildSingleOwnerConstraints(nodeShape, shapeIri);\n  if (generated.length > 0) {\n    d.generatedShapes = generated.map(({iri, data}) => ({__id: iri, ...data}));\n  }\n  return d;\n}\n\n/**\n * The per-shape `delete → create` thunk shared by `syncShapes()` and `syncShape()`: exactly two\n * requests. The delete cascade-cleans the shape's old property-shape / list / path subtrees; the\n * create rebuilds them.\n *\n * The single-owner constraints generated from the shape's own `contains` properties\n * (`${iri}/${label}.singleOwner`, see `singleOwnerConstraint.ts`) are owned by the shape through\n * `core:generatedShape` (a `contains` property with value shape NodeShape). The delete removes\n * them and their property shapes through the owned walk, and their blank path and qualified-shape\n * nodes through the blank-node cascade; the create writes the current ones nested, in the same request\n * as the shape. A removed or renamed accessor therefore loses its constraint on the next sync,\n * and a NodeShape the shape does not own is never touched.\n *\n * `ds` (optional) targets an explicit dataset — both requests run against it instead of the\n * global router. Omitted → today's global behavior.\n */\nfunction buildSyncThunk(nodeShape: NodeShapeData, iri: string, ds?: IDataset): () => Promise<void> {\n  return async () => {\n    // Build the data fresh on each invocation, so every run writes from the current\n    // shape metadata.\n    const data = buildNodeShapeData(nodeShape, iri);\n    await DeleteBuilder.from(NodeShape, {id: iri}).exec(ds);\n    await (NodeShape.create(data as never).withId(iri) as unknown as {\n      exec: (target?: IDataset) => Promise<unknown>;\n    }).exec(ds);\n  };\n}\n\n/** The generated single-owner shape IRIs a code shape writes. */\nfunction generatedIrisOf(nodeShape: NodeShapeData, iri: string): string[] {\n  return buildSingleOwnerConstraints(nodeShape, iri).map((c) => c.iri);\n}\n\n/** Throw when a registered shape IRI equals one of a shape's generated single-owner IRIs. */\nfunction assertNoGeneratedIriCollision(\n  nodeShape: NodeShapeData,\n  iri: string,\n  isRegistered: (iri: string) => boolean,\n): void {\n  for (const generated of generatedIrisOf(nodeShape, iri)) {\n    if (isRegistered(generated)) {\n      throw new Error(`Shape IRI ${generated} collides with a generated single-owner shape`);\n    }\n  }\n}\n\n/** Options controlling how {@link syncShapes} treats store shapes that are not in code. */\nexport interface SyncShapesOptions {\n  /**\n   * How to treat NodeShapes present in the store but not in the current process's code:\n   * - `'none'` (default) — never prune; purely additive (delete→recreate the code shapes, touch\n   *   nothing else). The only mode that is safe when the process has loaded a *subset* of the\n   *   shapes in the dataset, or when the dataset has more than one writer.\n   * - `'all'` — prune every store-only shape as an orphan. Only correct when this process has\n   *   loaded **every** shape the dataset should hold and is its **only** writer; \"not registered\n   *   here\" is then taken to mean \"deleted from code\".\n   * - `'ownedNamespaces'` — prune a store-only shape ONLY if its IRI falls within a namespace\n   *   this process actually writes (the package-namespace of one of its code-registered shapes,\n   *   i.e. the IRI prefix up to the last `/` or `#`). Protects other writers' packages (arch-04:\n   *   one app-data dataset, several writers), but NOT the rest of a package the process only\n   *   partially loaded — the namespace is the whole package, so a deep import of one shape file\n   *   still claims all of it.\n   *\n   * `'all'` and `'ownedNamespaces'` are destructive and must be requested explicitly.\n   */\n  orphanScope?: 'all' | 'ownedNamespaces' | 'none';\n}\n\n/** The owning namespace of a shape IRI — everything up to and including the last `/` or `#`. */\nfunction shapeNamespace(iri: string): string {\n  const cut = Math.max(iri.lastIndexOf('/'), iri.lastIndexOf('#'));\n  return cut >= 0 ? iri.slice(0, cut + 1) : iri;\n}\n\n/**\n * Plan an idempotent sync of all code-registered (non-framework) NodeShapes into the store as\n * SHACL data — the forward (code → graph) materialization of arch-05 \"code is canonical\".\n *\n * Returns built-but-unexecuted thunks; the caller controls execution and batching:\n * ```ts\n * await Promise.all((await syncShapes()).map((run) => run()));\n * ```\n * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old\n * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).\n *\n * **Shapes in the store but not registered in this process are left alone by default**\n * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and\n * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a\n * time, and an app-data dataset also holds shapes other writers materialized (CN's\n * `bindShape` / `enableCapability`). \"Not registered here\" therefore does not mean \"deleted from\n * code\". Measured against a dataset holding the 36 `@_linked/schema` shapes: a process that\n * imported only `@_linked/schema/shapes/Thing` (11 shapes registered) deleted the other 25 under\n * both `'all'` and `'ownedNamespaces'`, and a process that imported no shapes deleted all 36.\n *\n * Pruning is opt-in via `options.orphanScope` (see {@link SyncShapesOptions}): pass `'all'` only\n * from a process that has loaded every shape the dataset should hold and is its sole writer, and\n * `'ownedNamespaces'` only when it has loaded every shape of each package it registers. Pruned\n * orphans are deleted with their owned subtree. Pruning reads the existing shape IRIs first;\n * with `'none'` no read is made.\n *\n * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**\n * parameter: it feeds both the orphan-detection read (so orphans are computed against the same\n * store they'll be pruned from) and every delete/create thunk. Omitted → the global router;\n * the returned thunks stay nullary either way.\n */\nexport async function syncShapes(\n  ds?: IDataset,\n  options?: SyncShapesOptions,\n): Promise<Array<() => Promise<void>>> {\n  const orphanScope = options?.orphanScope ?? 'none';\n  // 1. Enumerate code-registered user shapes (exclude framework/meta shapes).\n  const userShapes: Array<{iri: string; nodeShape: NodeShapeData}> = [];\n  for (const [iri, shapeClass] of getAllShapeClasses()) {\n    if (!shapeClass?.shape) continue;\n    const pkg = (shapeClass as {packageName?: string}).packageName;\n    // Skip framework/meta shapes: the core package, and the base `Shape` which is registered\n    // directly (no applyLinkedShape) and therefore carries no packageName.\n    if (!pkg || pkg === FRAMEWORK_PACKAGE) continue;\n    userShapes.push({iri, nodeShape: shapeClass.shape});\n  }\n  const localShapeIris = new Set(userShapes.map((s) => s.iri));\n  for (const {iri, nodeShape} of userShapes) {\n    assertNoGeneratedIriCollision(nodeShape, iri, (id) => localShapeIris.has(id));\n  }\n  // The generated single-owner shapes of in-code shapes are written by the same thunks, so they\n  // are never orphans. Derived in memory from the same function that builds them; a stale\n  // generated shape (removed accessor or shape) is not protected and goes with its owner's\n  // delete, through the `core:generatedShape` cascade.\n  for (const {iri, nodeShape} of userShapes) {\n    for (const generated of generatedIrisOf(nodeShape, iri)) localShapeIris.add(generated);\n  }\n  // Namespaces this process actually writes — the ownership scope for `'ownedNamespaces'` pruning.\n  const ownedNamespaces = new Set(userShapes.map((s) => shapeNamespace(s.iri)));\n\n  const thunks: Array<() => Promise<void>> = [];\n\n  // 2. Per in-code shape: delete (cascade) then recreate.\n  for (const {iri, nodeShape} of userShapes) {\n    thunks.push(buildSyncThunk(nodeShape, iri, ds));\n  }\n\n  // 3. Orphan sweep (unless disabled). Identity-read existing NodeShape IRIs (ids only). Must hit\n  //    the same `ds` the thunks target, or orphans get computed against the wrong store.\n  if (orphanScope !== 'none') {\n    const existingRows = (await (NodeShape as unknown as {\n      select: () => {exec: (target?: IDataset) => Promise<Array<{id: string}>>};\n    }).select().exec(ds)) as Array<{id: string}>;\n\n    // Orphan shapes (in store, not in code) → delete (cascade cleans their owned subtree). In\n    // `'ownedNamespaces'` mode, only shapes within a namespace this process writes are eligible —\n    // other writers' shapes (different package namespace) are left untouched.\n    for (const {id: iri} of existingRows) {\n      if (localShapeIris.has(iri)) continue;\n      if (orphanScope === 'ownedNamespaces' && !ownedNamespaces.has(shapeNamespace(iri))) {\n        continue;\n      }\n      thunks.push(() =>\n        (DeleteBuilder.from(NodeShape, {id: iri}).exec(ds) as Promise<unknown>).then(\n          () => undefined,\n        ),\n      );\n    }\n  }\n\n  return thunks;\n}\n\n/**\n * Plan an idempotent sync of ONE code-registered NodeShape into the store as SHACL data.\n *\n * Scoped counterpart to {@link syncShapes}: materializes a single shape (delete → recreate, so the\n * delete cascade-cleans the old property-shape / list / path subtrees and the create rebuilds them)\n * and does NOT run the store-wide orphan sweep — other shapes in the store are untouched.\n *\n * @param target a shape class (e.g. `Person`) or its NodeShape IRI string. An IRI is resolved to\n *   its registered class via `getShapeClass`; the shape must be code-registered.\n * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete\n *   and the create run against it instead of the global router. Omitted → global behavior.\n * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch\n *   several together — e.g. a shape plus its referenced object-property shapes:\n *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.\n * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.\n */\nexport function syncShape(target: typeof Shape | string, ds?: IDataset): () => Promise<void> {\n  // Normalize target → its registered shape class.\n  const cls =\n    typeof target === 'string' ? getShapeClass(target) : (target as typeof Shape);\n  if (typeof target === 'string' && !cls) {\n    throw new Error(`syncShape: no registered shape for IRI ${target}`);\n  }\n  const nodeShape = cls?.shape;\n  if (!nodeShape) {\n    throw new Error(\n      typeof target === 'string'\n        ? `syncShape: no registered shape for IRI ${target}`\n        : `syncShape: shape class has no static .shape`,\n    );\n  }\n  const iri = nodeShape.id;\n\n  // Never materialize a framework/meta shape as user data — same invariant syncShapes() enforces\n  // by skipping (the base Shape carries no packageName).\n  const pkg = (cls as {packageName?: string}).packageName;\n  if (!pkg || pkg === FRAMEWORK_PACKAGE) {\n    throw new Error(`syncShape: refusing to sync framework/meta shape ${iri}`);\n  }\n\n  assertNoGeneratedIriCollision(nodeShape, iri, (id) => !!getShapeClass(id));\n  return buildSyncThunk(nodeShape, iri, ds);\n}\n"]}

package/lib/esm/sparql/irToAlgebra.d.ts

@@ -1,5 +1,4 @@
 import type { IRSelectQuery, IRAskQuery, IRCountQuery, IRCreateMutation, IRUpdateMutation, IRUpsertMutation, IRDeleteMutation, IRDeleteAllMutation, IRDeleteWhereMutation, IRUpdateWhereMutation } from '../queries/IntermediateRepresentation.js';
-import type { PropertyShapeData } from '../shapes/nodeShapeData.js';
 import type { NodeReferenceValue } from '../utils/NodeReference.js';
 import type { SparqlSelectPlan, SparqlAskPlan, SparqlInsertDataPlan, SparqlDeleteInsertPlan, SparqlAlgebraNode, SparqlTriple, SparqlTerm } from './SparqlAlgebra.js';
 import { type SparqlOptions } from './sparqlUtils.js';
@@ -27,39 +26,19 @@ export declare function updateToAlgebra(query: IRUpdateMutation, options?: Sparq
  * needs no guard.
  */
 export declare function upsertToAlgebra(query: IRUpsertMutation, options?: SparqlOptions): SparqlDeleteInsertPlan;
-type Containment = {
-    containsPreds: string[];
-    dependentTypes: string[];
-    /** Per dependent targetClass: the blank-capable properties of the shapes targeting it. */
-    dependentBlankProps: Map<string, PropertyShapeData[]>;
-};
-/** Gather contains-predicate IRIs and dependent targetClass IRIs from the registry. */
-export declare function collectContainment(): Containment;
 /**
- * Build DELETE patterns + WHERE OPTIONAL blocks that cascade-delete the owned subtree
- * reachable from `rootTerm` via `contains` edges. `varPrefix` keeps generated variables
- * unique across multiple roots in one query. Returns empty when nothing is owned.
- *
- * `anchor`, when given, leads every block: the triple that binds a variable root, so
- * each block stays correct on its own (as a UNION branch) when no such root exists.
- * `onlyTypes`, when given, restricts the blocks to those dependent types (a subject delete
- * passes the types its shape can reach); by default every registered dependent type gets one.
+ * How many times one walk path may re-enter a shape it already passed through (a cycle through
+ * several shapes, or a sub-shape's edge back into its own kind). Values below are not deleted.
  */
-export declare function buildOwnedCascade(rootTerm: SparqlTerm, varPrefix: string, anchor?: SparqlTriple, keep?: SparqlTerm[], onlyTypes?: string[]): {
-    deletePatterns: SparqlTriple[];
-    whereOptionals: SparqlAlgebraNode[];
-};
+export declare const MAX_OWNED_RECURSION = 4;
+/** Above this many branches for one root shape, lowering warns once (see backlog 055). */
+export declare const OWNED_BRANCH_WARNING = 64;
 /**
  * Build DELETE + WHERE OPTIONAL that removes the *old node's own* one-hop triples when a
  * `contains` edge is replaced, unset, or set-removed. A `contains` edge asserts exclusive
  * ownership, so overwriting it must delete the previously owned child fully — not merely
- * unlink it — or the child orphans (backlog 032). This is `contains`-driven and deliberately
- * does NOT require the child shape to be `dependent`: ownership via the edge is sufficient.
- * Owned descendants *below* the old node are cascaded separately by `buildOwnedCascade`.
- *
- * Callers use it only for a property that declares a value shape. A shape-less `contains`
- * slot (like `sh:path`) may hold a shared IRI, so its old value is left to
- * `buildOwnedCascade`, which deletes it only when it is dependent-typed.
+ * unlink it — or the child orphans (backlog 032). Ownership via the edge is sufficient.
+ * Owned descendants *below* the old node are deleted separately (`ownedSubtreeBlocks`).
  *
  * The owning edge `<subject> <prop> ?old` is re-asserted INSIDE the WHERE group so `?old`
  * is bound there: when no old value exists the group matches nothing and the DELETE is a
@@ -79,19 +58,18 @@ export declare function buildOwnedSelfDelete(subjectTerm: SparqlTerm, propertyTe
  * Converts an IRDeleteMutation to a SparqlDeleteInsertPlan (DELETE + WHERE).
  *
  * The WHERE is the type guard of every id, joined with ONE UNION of independent
- * blocks: per id its own triples, its incoming references and, for a shape that
- * owns something, one block per immediately-owned child (`<s> <p> ?dN . ?dN ?dN_p ?dN_o`,
- * for each of the shape's own and inherited `contains` properties with a value shape and
- * a simple path) and one block per dependent type its owned subtree can reach
- * (`reachableDependentTypes`; none for a shape that owns only non-dependent values). The
+ * blocks: per id its own triples, its incoming references, its blank values and one branch
+ * per owned path, plus that node's blank values (`ownedSubtreeBlocks`: the shape's own and
+ * inherited `contains` properties, their value shapes' in turn, and the extra ones of
+ * registered sub-shapes behind a type guard; none for a shape that owns nothing). The
  * bulk deletes (`deleteAllToAlgebra`, `deleteWhereToAlgebra`) add the same owned blocks,
  * rooted at the subject variable (see `bulkDeleteUnion`).
  *
  * The blocks must not be chained as OPTIONALs. A chain of OPTIONALs is a join, so
  * the solutions multiply: own triples x incoming references x owned triples of each
- * dependent type. Deleting one shape description with the shape sync's cascade
+ * owned path. Deleting one shape description with the shape sync's cascade
  * produced ~27,000 solutions for ~130 triples and took over 30 seconds on Fuseki,
- * which re-evaluates the cascade property path for every left-hand row. A UNION
+ * which re-evaluated the former registry-wide cascade path for every left-hand row. A UNION
  * yields each block's matches once, so the solutions add up instead, and it deletes
  * exactly the same triples: a DELETE template triple whose variables a solution
  * leaves unbound is skipped, as it was for an OPTIONAL that did not match.
@@ -105,7 +83,7 @@ export declare function deleteToAlgebra(query: IRDeleteMutation, _options?: Spar
  *
  * Generates DELETE { ?a0 ?p ?o . [blank-node and owned-cleanup wildcards] }
  *          WHERE  { ?a0 a <Shape> . { ?a0 ?p ?o } UNION [one block per blank node,
- *                   owned child and dependent type] }
+ *                   owned group] }
  * (see `bulkDeleteUnion`). Unlike a delete by id, incoming references are not deleted.
  */
 export declare function deleteAllToAlgebra(query: IRDeleteAllMutation, _options?: SparqlOptions): SparqlDeleteInsertPlan;
@@ -113,7 +91,7 @@ export declare function deleteAllToAlgebra(query: IRDeleteAllMutation, _options?
  * Converts an IRDeleteWhereMutation to a SparqlDeleteInsertPlan.
  *
  * Like deleteAllToAlgebra but adds filter conditions from the where clause. The cleanup
- * UNION (blank nodes, owned children, dependent cascade) is joined with the filtered match,
+ * UNION (blank nodes, owned subtree) is joined with the filtered match,
  * so only the matched subjects' children are deleted.
  */
 export declare function deleteWhereToAlgebra(query: IRDeleteWhereMutation, _options?: SparqlOptions): SparqlDeleteInsertPlan;
@@ -209,4 +187,3 @@ export declare function deleteWhereToSparql(query: IRDeleteWhereMutation, option
  * Converts an IRUpdateWhereMutation to a SPARQL string.
  */
 export declare function updateWhereToSparql(query: IRUpdateWhereMutation, options?: SparqlOptions): string;
-export {};