@_linked/core 2.33.0 → 2.35.0

package/lib/esm/sparql/ownedLinkCheck.js

@@ -1,5 +1,5 @@
 import { findPropertyShapeById } from '../shapes/nodeShapeData.js';
-import { getSubShapes, getTargetClassId } from '../utils/ShapeClass.js';
+import { catalogOf, getActiveShapeCatalog, getSubShapes, getTargetClassId, withShapeCatalog, } from '../utils/ShapeClass.js';
 import { rdf } from '../ontologies/rdf.js';
 import { assertSafeIri } from './sparqlUtils.js';
 import { isBareNodeReference } from './irToAlgebra.js';
@@ -77,6 +77,11 @@ function walk(data, cache, out) {
 }
 /** Every owned link in a create, update, upsert or update-where mutation. Pure; no I/O. */
 export function collectOwnedLinks(ir) {
+    // Resolves the rules in the catalog the IR was lowered in.
+    const catalog = catalogOf(ir);
+    if (catalog !== undefined && catalog !== getActiveShapeCatalog()) {
+        return withShapeCatalog(catalog, () => collectOwnedLinks(ir));
+    }
     const out = [];
     walk(ir.data, new Map(), out);
     return out;

package/lib/esm/sparql/ownedLinkCheck.js.map

@@ -1 +1 @@
-{"version":3,"file":"ownedLinkCheck.js","sourceRoot":"","sources":["../../../src/sparql/ownedLinkCheck.ts"],"names":[],"mappings":"AA8BA,OAAO,EAAC,qBAAqB,EAAyB,MAAM,4BAA4B,CAAC;AACzF,OAAO,EAAC,YAAY,EAAE,gBAAgB,EAAC,MAAM,wBAAwB,CAAC;AACtE,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,aAAa,EAAC,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAC,mBAAmB,EAAC,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAC,eAAe,EAAC,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAC,qBAAqB,EAA0B,MAAM,oBAAoB,CAAC;AAyBlF,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;AAC3B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAE7B,SAAS,UAAU,CAAC,KAAc;IAChC,OAAO,CAAC,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC;AACvF,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAmB;;IACxC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,IACE,KAAK;QACL,OAAO,KAAK,KAAK,QAAQ;QACzB,CAAC,CAAC,KAAK,YAAY,IAAI,CAAC;QACxB,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC;QAChB,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC;QACnB,CAAC,KAAK,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,EACrC,CAAC;QACD,OAAO,MAAC,KAAgC,CAAC,GAAG,mCAAI,EAAE,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CACnB,UAAkB,EAClB,aAAqB,EACrB,KAAoC;;IAEpC,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,MAAA,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,mCAAI,IAAI,CAAC;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,qBAAqB,CAAC,UAAU,CAAC,EAAE,aAAa,CAAC,CAAC;IACzE,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,EAAiC,EAAE,aAAqB;;IACzE,IAAI,CAAC,CAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAA,IAAI,CAAC,EAAE,CAAC,UAAU,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9E,MAAM,aAAa,GAAG,gBAAgB,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACzD,IAAI,CAAC,aAAa;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,aAAa,CAAC,CAAC,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,MAAA,EAAE,CAAC,KAAK,0CAAE,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5C,OAAO;QACL,QAAQ,EAAE,EAAE,CAAC,EAAE;QACf,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,KAAK,EAAE,MAAA,MAAA,EAAE,CAAC,eAAe,0CAAE,EAAE,mCAAI,aAAa;QAC9C,aAAa;QACb,eAAe,EAAE,CAAC,GAAG,QAAQ,CAAC;KAC/B,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,IAAgB,EAAE,KAAoC,EAAE,GAAgB;IACpF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,gFAAgF;gBAChF,uBAAuB;gBACvB,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACzB,CAAC;iBAAM,IAAI,IAAI,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;gBACpE,GAAG,CAAC,IAAI,iBAAE,EAAE,EAAE,IAAI,CAAC,EAAE,IAAK,IAAI,EAAE,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,iBAAiB,CAAC,EAAqB;IACrD,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,mBAAmB,CAAC,GAAa;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,QAAQ;QAAE,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzD,OAAO,yCAAyC,MAAM,WAAW,QAAQ,WAAW,CAAC;AACvF,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,yBAAyB,CACvC,IAAwB;;IAExB,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CACb,yFAAyF,CAC1F,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,MAAA,OAAO,CAAC,EAAE,0CAAE,KAAK,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,0CAAE,KAAK,CAAC;QACjC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;YAAE,SAAS;QAC3B,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAkB,EAClB,SAAmD;IAEnD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACzC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7D,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,CAAC;QAC5E,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM;YAChC,CAAC,CAAC,WAAW,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,uCAAuC;YAC1F,CAAC,CAAC,EAAE,CAAC;QACP,QAAQ,CAAC,IAAI,CACX,gBAAgB,IAAI,CAAC,EAAE,iCAAiC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK;YACxF,eAAe,KAAK,UAAU,IAAI,CAAC,KAAK,2BAA2B;YACnE,IAAI,IAAI,CAAC,aAAa,IAAI,YAAY,+CAA+C;YACrF,6DAA6D,CAChE,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAChE,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 * The class check for nodes linked by `{id}` into a `contains` property.\n *\n * An owner deletes what it contains: on replace, on set-remove and when the owner itself is\n * deleted. Linking an existing node into a `contains` slot is allowed (upload, then attach),\n * so a node of the wrong kind — a Person linked into an `image` slot whose value shape is\n * ImageObject — would later be deleted with it. Nothing validates `sh:class` on write, so the\n * SPARQL dataset checks it here, before the update is sent.\n *\n * A field is checked when it owns its value by the same rule the replace delete applies: the\n * property itself is `contains`, declares a value shape and has a simple path. A plain property\n * on a predicate another shape declares `contains` owns nothing and is not checked. A node is\n * refused only when the store holds at least one `rdf:type` for it and none of them is accepted;\n * an id that does not exist yet, or has no type, is allowed (`rdf:nil`, a node another request\n * creates, an untyped IRI). Collecting the links is a pure walk over the lowered IR; the dataset sends\n * one SELECT for all distinct ids, and none when there is nothing to check.\n */\nimport type {\n  IRCreateMutation,\n  IRFieldValue,\n  IRNodeData,\n  IRUpdateMutation,\n  IRUpdateWhereMutation,\n  IRUpsertMutation,\n} from '../queries/IntermediateRepresentation.js';\nimport {findPropertyShapeById, type PropertyShapeData} from '../shapes/nodeShapeData.js';\nimport {getSubShapes, getTargetClassId} from '../utils/ShapeClass.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {assertSafeIri} from './sparqlUtils.js';\nimport {isBareNodeReference} from './irToAlgebra.js';\nimport {getSimplePathId} from '../paths/normalizePropertyPath.js';\nimport {isSparqlSelectResults, type SparqlQueryResults} from './resultMapping.js';\n\n/** One bare `{id}` linked into a `contains` field that declares a value shape. */\nexport type OwnedLink = {\n  id: string;\n  /** Property-shape id. */\n  property: string;\n  /** Property label, for the message. */\n  label: string;\n  /** The node shape that declares the property. */\n  shape: string;\n  /** The value shape's targetClass — the class the message names. */\n  expectedClass: string;\n  /** `expectedClass`, every registered sub-shape's targetClass, and `sh:class` if declared. */\n  acceptedClasses: string[];\n};\n\ntype OwnedLinkMutation =\n  | IRCreateMutation\n  | IRUpdateMutation\n  | IRUpsertMutation\n  | IRUpdateWhereMutation;\n\ntype OwnedRule = Omit<OwnedLink, 'id'>;\n\nconst RDF_NIL = rdf.nil.id;\nconst RDF_TYPE = rdf.type.id;\n\nfunction isNodeData(value: unknown): value is IRNodeData {\n  return !!value && typeof value === 'object' && 'shape' in value && 'fields' in value;\n}\n\n/**\n * The values a field writes: the items of an array overwrite, the `add` items of a set\n * modification (`remove` items unlink, they never link), or the single value.\n */\nfunction writtenValues(value: IRFieldValue): unknown[] {\n  if (Array.isArray(value)) return value;\n  if (\n    value &&\n    typeof value === 'object' &&\n    !(value instanceof Date) &&\n    !('id' in value) &&\n    !('shape' in value) &&\n    ('add' in value || 'remove' in value)\n  ) {\n    return (value as {add?: IRFieldValue[]}).add ?? [];\n  }\n  return [value];\n}\n\n/** The check for a property, or null when the property is not checked. */\nfunction ownedRuleFor(\n  propertyId: string,\n  fallbackShape: string,\n  cache: Map<string, OwnedRule | null>,\n): OwnedRule | null {\n  if (cache.has(propertyId)) return cache.get(propertyId) ?? null;\n  const rule = buildRule(findPropertyShapeById(propertyId), fallbackShape);\n  cache.set(propertyId, rule);\n  return rule;\n}\n\nfunction buildRule(ps: PropertyShapeData | undefined, fallbackShape: string): OwnedRule | null {\n  if (!ps?.contains || !ps.valueShape || !getSimplePathId(ps.path)) return null;\n  const expectedClass = getTargetClassId(ps.valueShape.id);\n  if (!expectedClass) return null;\n  const accepted = new Set<string>([expectedClass]);\n  for (const sub of getSubShapes(ps.valueShape.id)) {\n    const subClass = getTargetClassId(sub);\n    if (subClass) accepted.add(subClass);\n  }\n  if (ps.class?.id) accepted.add(ps.class.id);\n  return {\n    property: ps.id,\n    label: ps.label,\n    shape: ps.parentNodeShape?.id ?? fallbackShape,\n    expectedClass,\n    acceptedClasses: [...accepted],\n  };\n}\n\nfunction walk(data: IRNodeData, cache: Map<string, OwnedRule | null>, out: OwnedLink[]): void {\n  for (const field of data.fields) {\n    const rule = ownedRuleFor(field.property, data.shape, cache);\n    for (const item of writtenValues(field.value)) {\n      if (isNodeData(item)) {\n        // A nested create is not a link — the mutation writes its type itself — but its\n        // own fields can link.\n        walk(item, cache, out);\n      } else if (rule && isBareNodeReference(item) && item.id !== RDF_NIL) {\n        out.push({id: item.id, ...rule});\n      }\n    }\n  }\n}\n\n/** Every owned link in a create, update, upsert or update-where mutation. Pure; no I/O. */\nexport function collectOwnedLinks(ir: OwnedLinkMutation): OwnedLink[] {\n  const out: OwnedLink[] = [];\n  walk(ir.data, new Map(), out);\n  return out;\n}\n\n/** `SELECT ?id ?type WHERE { VALUES ?id { … } ?id rdf:type ?type }` for the distinct ids. */\nexport function ownedLinkTypesQuery(ids: string[]): string {\n  const distinct = [...new Set(ids)];\n  for (const id of distinct) assertSafeIri(id);\n  const values = distinct.map((id) => `<${id}>`).join(' ');\n  return `SELECT ?id ?type WHERE { VALUES ?id { ${values} } ?id <${RDF_TYPE}> ?type }`;\n}\n\n/** The `rdf:type`s per id from the answer to {@link ownedLinkTypesQuery}. */\nexport function ownedLinkTypesFromResults(\n  json: SparqlQueryResults,\n): Map<string, Set<string>> {\n  if (!isSparqlSelectResults(json)) {\n    throw new Error(\n      'Expected a SPARQL SELECT result set for the owned-link type check, got an ASK response.',\n    );\n  }\n  const types = new Map<string, Set<string>>();\n  for (const binding of json.results.bindings) {\n    const id = binding.id?.value;\n    const type = binding.type?.value;\n    if (!id || !type) continue;\n    let set = types.get(id);\n    if (!set) types.set(id, (set = new Set()));\n    set.add(type);\n  }\n  return types;\n}\n\n/**\n * Throws when a linked id is typed and none of its types is accepted. Every violation is\n * listed in the one error. An id with no types is allowed.\n */\nexport function assertOwnedLinkTypes(\n  links: OwnedLink[],\n  typesById: ReadonlyMap<string, ReadonlySet<string>>,\n): void {\n  const messages: string[] = [];\n  const seen = new Set<string>();\n  for (const link of links) {\n    const types = typesById.get(link.id);\n    if (!types || types.size === 0) continue;\n    if (link.acceptedClasses.some((c) => types.has(c))) continue;\n    const key = `${link.property} ${link.id}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    const typed = [...types].map((t) => `<${t}>`).join(', ');\n    const others = link.acceptedClasses.filter((c) => c !== link.expectedClass);\n    const alsoAccepted = others.length\n      ? ` (or of ${others.map((c) => `<${c}>`).join(', ')}, a registered sub-shape or sh:class)`\n      : '';\n    messages.push(\n      `Cannot link <${link.id}> into the contains property \"${link.label}\" of <${link.shape}>: ` +\n        `it is typed ${typed}, but \"${link.label}\" only owns instances of ` +\n        `<${link.expectedClass}>${alsoAccepted}. An owner deletes what it contains when the ` +\n        'value is replaced or removed, or when the owner is deleted.',\n    );\n  }\n  if (messages.length > 0) throw new Error(messages.join('\\n'));\n}\n"]}
+{"version":3,"file":"ownedLinkCheck.js","sourceRoot":"","sources":["../../../src/sparql/ownedLinkCheck.ts"],"names":[],"mappings":"AA8BA,OAAO,EAAC,qBAAqB,EAAyB,MAAM,4BAA4B,CAAC;AACzF,OAAO,EACL,SAAS,EACT,qBAAqB,EACrB,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,aAAa,EAAC,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAC,mBAAmB,EAAC,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAC,eAAe,EAAC,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAC,qBAAqB,EAA0B,MAAM,oBAAoB,CAAC;AAyBlF,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;AAC3B,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAE7B,SAAS,UAAU,CAAC,KAAc;IAChC,OAAO,CAAC,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC;AACvF,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAmB;;IACxC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,IACE,KAAK;QACL,OAAO,KAAK,KAAK,QAAQ;QACzB,CAAC,CAAC,KAAK,YAAY,IAAI,CAAC;QACxB,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC;QAChB,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC;QACnB,CAAC,KAAK,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,EACrC,CAAC;QACD,OAAO,MAAC,KAAgC,CAAC,GAAG,mCAAI,EAAE,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CACnB,UAAkB,EAClB,aAAqB,EACrB,KAAoC;;IAEpC,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,MAAA,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,mCAAI,IAAI,CAAC;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,qBAAqB,CAAC,UAAU,CAAC,EAAE,aAAa,CAAC,CAAC;IACzE,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,EAAiC,EAAE,aAAqB;;IACzE,IAAI,CAAC,CAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAA,IAAI,CAAC,EAAE,CAAC,UAAU,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9E,MAAM,aAAa,GAAG,gBAAgB,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACzD,IAAI,CAAC,aAAa;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,aAAa,CAAC,CAAC,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,MAAA,EAAE,CAAC,KAAK,0CAAE,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5C,OAAO;QACL,QAAQ,EAAE,EAAE,CAAC,EAAE;QACf,KAAK,EAAE,EAAE,CAAC,KAAK;QACf,KAAK,EAAE,MAAA,MAAA,EAAE,CAAC,eAAe,0CAAE,EAAE,mCAAI,aAAa;QAC9C,aAAa;QACb,eAAe,EAAE,CAAC,GAAG,QAAQ,CAAC;KAC/B,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,IAAgB,EAAE,KAAoC,EAAE,GAAgB;IACpF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,gFAAgF;gBAChF,uBAAuB;gBACvB,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACzB,CAAC;iBAAM,IAAI,IAAI,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;gBACpE,GAAG,CAAC,IAAI,iBAAE,EAAE,EAAE,IAAI,CAAC,EAAE,IAAK,IAAI,EAAE,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,iBAAiB,CAAC,EAAqB;IACrD,2DAA2D;IAC3D,MAAM,OAAO,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;QACjE,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,mBAAmB,CAAC,GAAa;IAC/C,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,QAAQ;QAAE,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzD,OAAO,yCAAyC,MAAM,WAAW,QAAQ,WAAW,CAAC;AACvF,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,yBAAyB,CACvC,IAAwB;;IAExB,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CACb,yFAAyF,CAC1F,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,MAAA,OAAO,CAAC,EAAE,0CAAE,KAAK,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,0CAAE,KAAK,CAAC;QACjC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;YAAE,SAAS;QAC3B,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAkB,EAClB,SAAmD;IAEnD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACzC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7D,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,CAAC;QAC5E,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM;YAChC,CAAC,CAAC,WAAW,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,uCAAuC;YAC1F,CAAC,CAAC,EAAE,CAAC;QACP,QAAQ,CAAC,IAAI,CACX,gBAAgB,IAAI,CAAC,EAAE,iCAAiC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK;YACxF,eAAe,KAAK,UAAU,IAAI,CAAC,KAAK,2BAA2B;YACnE,IAAI,IAAI,CAAC,aAAa,IAAI,YAAY,+CAA+C;YACrF,6DAA6D,CAChE,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAChE,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 * The class check for nodes linked by `{id}` into a `contains` property.\n *\n * An owner deletes what it contains: on replace, on set-remove and when the owner itself is\n * deleted. Linking an existing node into a `contains` slot is allowed (upload, then attach),\n * so a node of the wrong kind — a Person linked into an `image` slot whose value shape is\n * ImageObject — would later be deleted with it. Nothing validates `sh:class` on write, so the\n * SPARQL dataset checks it here, before the update is sent.\n *\n * A field is checked when it owns its value by the same rule the replace delete applies: the\n * property itself is `contains`, declares a value shape and has a simple path. A plain property\n * on a predicate another shape declares `contains` owns nothing and is not checked. A node is\n * refused only when the store holds at least one `rdf:type` for it and none of them is accepted;\n * an id that does not exist yet, or has no type, is allowed (`rdf:nil`, a node another request\n * creates, an untyped IRI). Collecting the links is a pure walk over the lowered IR; the dataset sends\n * one SELECT for all distinct ids, and none when there is nothing to check.\n */\nimport type {\n  IRCreateMutation,\n  IRFieldValue,\n  IRNodeData,\n  IRUpdateMutation,\n  IRUpdateWhereMutation,\n  IRUpsertMutation,\n} from '../queries/IntermediateRepresentation.js';\nimport {findPropertyShapeById, type PropertyShapeData} from '../shapes/nodeShapeData.js';\nimport {\n  catalogOf,\n  getActiveShapeCatalog,\n  getSubShapes,\n  getTargetClassId,\n  withShapeCatalog,\n} from '../utils/ShapeClass.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {assertSafeIri} from './sparqlUtils.js';\nimport {isBareNodeReference} from './irToAlgebra.js';\nimport {getSimplePathId} from '../paths/normalizePropertyPath.js';\nimport {isSparqlSelectResults, type SparqlQueryResults} from './resultMapping.js';\n\n/** One bare `{id}` linked into a `contains` field that declares a value shape. */\nexport type OwnedLink = {\n  id: string;\n  /** Property-shape id. */\n  property: string;\n  /** Property label, for the message. */\n  label: string;\n  /** The node shape that declares the property. */\n  shape: string;\n  /** The value shape's targetClass — the class the message names. */\n  expectedClass: string;\n  /** `expectedClass`, every registered sub-shape's targetClass, and `sh:class` if declared. */\n  acceptedClasses: string[];\n};\n\ntype OwnedLinkMutation =\n  | IRCreateMutation\n  | IRUpdateMutation\n  | IRUpsertMutation\n  | IRUpdateWhereMutation;\n\ntype OwnedRule = Omit<OwnedLink, 'id'>;\n\nconst RDF_NIL = rdf.nil.id;\nconst RDF_TYPE = rdf.type.id;\n\nfunction isNodeData(value: unknown): value is IRNodeData {\n  return !!value && typeof value === 'object' && 'shape' in value && 'fields' in value;\n}\n\n/**\n * The values a field writes: the items of an array overwrite, the `add` items of a set\n * modification (`remove` items unlink, they never link), or the single value.\n */\nfunction writtenValues(value: IRFieldValue): unknown[] {\n  if (Array.isArray(value)) return value;\n  if (\n    value &&\n    typeof value === 'object' &&\n    !(value instanceof Date) &&\n    !('id' in value) &&\n    !('shape' in value) &&\n    ('add' in value || 'remove' in value)\n  ) {\n    return (value as {add?: IRFieldValue[]}).add ?? [];\n  }\n  return [value];\n}\n\n/** The check for a property, or null when the property is not checked. */\nfunction ownedRuleFor(\n  propertyId: string,\n  fallbackShape: string,\n  cache: Map<string, OwnedRule | null>,\n): OwnedRule | null {\n  if (cache.has(propertyId)) return cache.get(propertyId) ?? null;\n  const rule = buildRule(findPropertyShapeById(propertyId), fallbackShape);\n  cache.set(propertyId, rule);\n  return rule;\n}\n\nfunction buildRule(ps: PropertyShapeData | undefined, fallbackShape: string): OwnedRule | null {\n  if (!ps?.contains || !ps.valueShape || !getSimplePathId(ps.path)) return null;\n  const expectedClass = getTargetClassId(ps.valueShape.id);\n  if (!expectedClass) return null;\n  const accepted = new Set<string>([expectedClass]);\n  for (const sub of getSubShapes(ps.valueShape.id)) {\n    const subClass = getTargetClassId(sub);\n    if (subClass) accepted.add(subClass);\n  }\n  if (ps.class?.id) accepted.add(ps.class.id);\n  return {\n    property: ps.id,\n    label: ps.label,\n    shape: ps.parentNodeShape?.id ?? fallbackShape,\n    expectedClass,\n    acceptedClasses: [...accepted],\n  };\n}\n\nfunction walk(data: IRNodeData, cache: Map<string, OwnedRule | null>, out: OwnedLink[]): void {\n  for (const field of data.fields) {\n    const rule = ownedRuleFor(field.property, data.shape, cache);\n    for (const item of writtenValues(field.value)) {\n      if (isNodeData(item)) {\n        // A nested create is not a link — the mutation writes its type itself — but its\n        // own fields can link.\n        walk(item, cache, out);\n      } else if (rule && isBareNodeReference(item) && item.id !== RDF_NIL) {\n        out.push({id: item.id, ...rule});\n      }\n    }\n  }\n}\n\n/** Every owned link in a create, update, upsert or update-where mutation. Pure; no I/O. */\nexport function collectOwnedLinks(ir: OwnedLinkMutation): OwnedLink[] {\n  // Resolves the rules in the catalog the IR was lowered in.\n  const catalog = catalogOf(ir);\n  if (catalog !== undefined && catalog !== getActiveShapeCatalog()) {\n    return withShapeCatalog(catalog, () => collectOwnedLinks(ir));\n  }\n  const out: OwnedLink[] = [];\n  walk(ir.data, new Map(), out);\n  return out;\n}\n\n/** `SELECT ?id ?type WHERE { VALUES ?id { … } ?id rdf:type ?type }` for the distinct ids. */\nexport function ownedLinkTypesQuery(ids: string[]): string {\n  const distinct = [...new Set(ids)];\n  for (const id of distinct) assertSafeIri(id);\n  const values = distinct.map((id) => `<${id}>`).join(' ');\n  return `SELECT ?id ?type WHERE { VALUES ?id { ${values} } ?id <${RDF_TYPE}> ?type }`;\n}\n\n/** The `rdf:type`s per id from the answer to {@link ownedLinkTypesQuery}. */\nexport function ownedLinkTypesFromResults(\n  json: SparqlQueryResults,\n): Map<string, Set<string>> {\n  if (!isSparqlSelectResults(json)) {\n    throw new Error(\n      'Expected a SPARQL SELECT result set for the owned-link type check, got an ASK response.',\n    );\n  }\n  const types = new Map<string, Set<string>>();\n  for (const binding of json.results.bindings) {\n    const id = binding.id?.value;\n    const type = binding.type?.value;\n    if (!id || !type) continue;\n    let set = types.get(id);\n    if (!set) types.set(id, (set = new Set()));\n    set.add(type);\n  }\n  return types;\n}\n\n/**\n * Throws when a linked id is typed and none of its types is accepted. Every violation is\n * listed in the one error. An id with no types is allowed.\n */\nexport function assertOwnedLinkTypes(\n  links: OwnedLink[],\n  typesById: ReadonlyMap<string, ReadonlySet<string>>,\n): void {\n  const messages: string[] = [];\n  const seen = new Set<string>();\n  for (const link of links) {\n    const types = typesById.get(link.id);\n    if (!types || types.size === 0) continue;\n    if (link.acceptedClasses.some((c) => types.has(c))) continue;\n    const key = `${link.property} ${link.id}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    const typed = [...types].map((t) => `<${t}>`).join(', ');\n    const others = link.acceptedClasses.filter((c) => c !== link.expectedClass);\n    const alsoAccepted = others.length\n      ? ` (or of ${others.map((c) => `<${c}>`).join(', ')}, a registered sub-shape or sh:class)`\n      : '';\n    messages.push(\n      `Cannot link <${link.id}> into the contains property \"${link.label}\" of <${link.shape}>: ` +\n        `it is typed ${typed}, but \"${link.label}\" only owns instances of ` +\n        `<${link.expectedClass}>${alsoAccepted}. An owner deletes what it contains when the ` +\n        'value is replaced or removed, or when the owner is deleted.',\n    );\n  }\n  if (messages.length > 0) throw new Error(messages.join('\\n'));\n}\n"]}

package/lib/esm/utils/LinkedStorage.d.ts

@@ -66,6 +66,13 @@ export declare abstract class LinkedStorage {
      * reached after an identity lookup has already failed.
      */
     private static findPinByShapeUri;
+    /**
+     * The dataset a query routes to, resolved in the catalog the query captured. Only the
+     * routing runs in that catalog: the caller then calls the dataset in the scope it was
+     * called in, so a router's own queries (CN's `BranchDataFork` lookups) never run inside
+     * a project's catalog. The dataset re-enters from the query or its IR where it lowers.
+     */
+    private static resolveDatasetForQuery;
     private static resolveDatasetForQueryShape;
     /**
      * Route a select query — **and a count**, which is a select.

package/lib/esm/utils/LinkedStorage.js

@@ -10,7 +10,7 @@ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, ge
 var _a, _b, _c;
 import { CoreSet } from '../collections/CoreSet.js';
 import { setQueryDispatch, resolveExistence } from '../queries/queryDispatch.js';
-import { getShapeClass } from './ShapeClass.js';
+import { catalogOf, getActiveShapeCatalog, getShapeClass, outsideShapeCatalog, withShapeCatalog, } from './ShapeClass.js';
 // plan-011 — count physical evaluations of THIS module on the one shared
 // global object. With the single-loader fix there should be exactly one copy;
 // the single-instance guard in backend.ts reports this count if storage config
@@ -211,6 +211,19 @@ export class LinkedStorage {
         }
         return undefined;
     }
+    /**
+     * The dataset a query routes to, resolved in the catalog the query captured. Only the
+     * routing runs in that catalog: the caller then calls the dataset in the scope it was
+     * called in, so a router's own queries (CN's `BranchDataFork` lookups) never run inside
+     * a project's catalog. The dataset re-enters from the query or its IR where it lowers.
+     */
+    static resolveDatasetForQuery(query) {
+        const catalog = catalogOf(query);
+        if (catalog !== getActiveShapeCatalog()) {
+            return withShapeCatalog(catalog, () => this.resolveDatasetForQuery(query));
+        }
+        return this.resolveDatasetForQueryShape(query.shape);
+    }
     static resolveDatasetForQueryShape(shape) {
         if (!shape) {
             return routingState.defaultDataset;
@@ -247,11 +260,14 @@ export class LinkedStorage {
         if (!(query === null || query === void 0 ? void 0 : query.shape)) {
             return Promise.reject(new Error('Invalid select query passed to LinkedStorage.selectQuery(): missing shape.'));
         }
-        const dataset = this.resolveDatasetForQueryShape(query.shape);
+        const dataset = this.resolveDatasetForQuery(query);
         if (!(dataset === null || dataset === void 0 ? void 0 : dataset.selectQuery)) {
             return Promise.reject(new Error('No query dataset configured. Call LinkedStorage.setDefaultDataset().'));
         }
-        return dataset.selectQuery(query);
+        // Called outside any catalog: a router's own queries never run in the query's catalog.
+        return (getActiveShapeCatalog() === undefined
+            ? dataset.selectQuery(query)
+            : outsideShapeCatalog(() => dataset.selectQuery(query)));
     }
     /**
      * Route an ask query.
@@ -277,11 +293,13 @@ export class LinkedStorage {
             if (!(query === null || query === void 0 ? void 0 : query.shape)) {
                 return this.askAnyDataset(query);
             }
-            const dataset = this.resolveDatasetForQueryShape(query.shape);
+            const dataset = this.resolveDatasetForQuery(query);
             if (!dataset) {
                 throw new Error('No query dataset configured. Call LinkedStorage.setDefaultDataset().');
             }
-            return resolveExistence(dataset, query);
+            return getActiveShapeCatalog() === undefined
+                ? resolveExistence(dataset, query)
+                : outsideShapeCatalog(() => resolveExistence(dataset, query));
         });
     }
     /**
@@ -300,7 +318,10 @@ export class LinkedStorage {
                 throw new Error('No query dataset configured. Call LinkedStorage.setDefaultDataset().');
             }
             for (const dataset of datasets) {
-                if (yield resolveExistence(dataset, query))
+                const exists = getActiveShapeCatalog() === undefined
+                    ? resolveExistence(dataset, query)
+                    : outsideShapeCatalog(() => resolveExistence(dataset, query));
+                if (yield exists)
                     return true;
             }
             return false;
@@ -310,31 +331,37 @@ export class LinkedStorage {
         if (!(query === null || query === void 0 ? void 0 : query.shape)) {
             return Promise.reject(new Error('Invalid update query passed to LinkedStorage.updateQuery(): missing shape.'));
         }
-        const dataset = this.resolveDatasetForQueryShape(query.shape);
+        const dataset = this.resolveDatasetForQuery(query);
         if (!(dataset === null || dataset === void 0 ? void 0 : dataset.updateQuery)) {
             return Promise.reject(new Error('No update handler configured on the query dataset.'));
         }
-        return dataset.updateQuery(query);
+        return (getActiveShapeCatalog() === undefined
+            ? dataset.updateQuery(query)
+            : outsideShapeCatalog(() => dataset.updateQuery(query)));
     }
     static createQuery(query) {
         if (!(query === null || query === void 0 ? void 0 : query.shape)) {
             return Promise.reject(new Error('Invalid create query passed to LinkedStorage.createQuery(): missing shape.'));
         }
-        const dataset = this.resolveDatasetForQueryShape(query.shape);
+        const dataset = this.resolveDatasetForQuery(query);
         if (!(dataset === null || dataset === void 0 ? void 0 : dataset.createQuery)) {
             return Promise.reject(new Error('No create handler configured on the query dataset.'));
         }
-        return dataset.createQuery(query);
+        return (getActiveShapeCatalog() === undefined
+            ? dataset.createQuery(query)
+            : outsideShapeCatalog(() => dataset.createQuery(query)));
     }
     static deleteQuery(query) {
         if (!(query === null || query === void 0 ? void 0 : query.shape)) {
             return Promise.reject(new Error('Invalid delete query passed to LinkedStorage.deleteQuery(): missing shape.'));
         }
-        const dataset = this.resolveDatasetForQueryShape(query.shape);
+        const dataset = this.resolveDatasetForQuery(query);
         if (!(dataset === null || dataset === void 0 ? void 0 : dataset.deleteQuery)) {
             return Promise.reject(new Error('No delete handler configured on the query dataset.'));
         }
-        return dataset.deleteQuery(query);
+        return getActiveShapeCatalog() === undefined
+            ? dataset.deleteQuery(query)
+            : outsideShapeCatalog(() => dataset.deleteQuery(query));
     }
 }
 //# sourceMappingURL=LinkedStorage.js.map

package/lib/esm/utils/LinkedStorage.js.map

@@ -1 +1 @@
-{"version":3,"file":"LinkedStorage.js","sourceRoot":"","sources":["../../../src/utils/LinkedStorage.ts"],"names":[],"mappings":";;;;;;;;;;AAAA,OAAO,EAAC,OAAO,EAAC,MAAM,2BAA2B,CAAC;AAQlD,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAC,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EAAC,aAAa,EAAC,MAAM,iBAAiB,CAAC;AAG9C,yEAAyE;AACzE,8EAA8E;AAC9E,+EAA+E;AAC/E,uEAAuE;AACvE,0DAA0D;AAC1D,MAAM,mBAAmB,GACvB,OAAO,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAE,EAAU,CAAC;AAC/D,mBAAmB,CAAC,4BAA4B;IAC9C,CAAC,MAAA,mBAAmB,CAAC,4BAA4B,mCAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAE9D;;;;;;;;;GASG;AACH;;;;;;;;GAQG;AACH,MAAM,YAAY,GAId,OAAC,mBAAmB,CAAC,sBAAsB,oCAA1C,mBAAmB,CAAC,sBAAsB,GAAK;IAClD,cAAc,EAAE,SAAS;IACzB,cAAc,EAAE,IAAI,GAAG,EAAE;IACzB,SAAS,EAAE,IAAI,GAAG,EAAE;CACrB,EAAC,CAAC;AACH,8EAA8E;AAC9E,MAAA,YAAY,CAAC,SAAS,oCAAtB,YAAY,CAAC,SAAS,GAAK,IAAI,GAAG,EAAE,EAAC;AAErC,+EAA+E;AAC/E,SAAS,oBAAoB;IAC3B,KAAK,MAAM,QAAQ,IAAI,CAAC,GAAG,YAAY,CAAC,SAAU,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC;YACH,QAAQ,EAAE,CAAC;QACb,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,yCAAyC,EAAE,GAAG,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;AACH,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,GAAG,CAAC,UAA4B,EAAsB,EAAE;;IACtE,MAAM,GAAG,GAAG,MAAC,UAA0D,aAA1D,UAAU,uBAAV,UAAU,CAAkD,KAAK,0CAAE,EAAE,CAAC;IACnF,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,OAAgB,aAAa;IAEjC,yEAAyE;IACzE,MAAM,CAAC,sBAAsB;;QAC3B,OAAO,MAAA,mBAAmB,CAAC,4BAA4B,mCAAI,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,aAAa;QAClB,OAAO,CAAC,CAAC,YAAY,CAAC,cAAc,CAAC;IACvC,CAAC;IAED,kEAAkE;IAClE,MAAM,CAAC,iBAAiB;QACtB,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED,gFAAgF;IAChF,MAAM,CAAC,iBAAiB,CAAC,OAAiB;;QACxC,YAAY,CAAC,cAAc,GAAG,OAAO,CAAC;QACtC,IAAI,MAAA,YAAY,CAAC,cAAc,0CAAE,IAAI,EAAE,CAAC;YACtC,YAAY,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;QACrC,CAAC;QACD,gBAAgB,CAAC;YACf,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;SACxC,CAAC,CAAC;QACH,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,gBAAgB,CAAC,QAAoB;QAC1C,YAAY,CAAC,SAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,SAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,CAAC;IAED,wEAAwE;IACxE,MAAM,CAAC,mBAAmB,CAAC,OAAiB,EAAE,GAAG,YAAwB;QACvE,YAAY,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE;YAClC,8EAA8E;YAC9E,2EAA2E;YAC3E,gFAAgF;YAChF,sDAAsD;YACtD,MAAM,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YACnC,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;oBAC7D,IAAI,MAAM,KAAK,UAAU,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;wBAChF,OAAO,CAAC,IAAI,CACV,iDAAiD,GAAG,mBAAmB;4BACrE,sEAAsE;4BACtE,2EAA2E,CAC9E,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,YAAY,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,oBAAoB,CAAC,KAAwB;QAClD,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClE,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,KAAiB,CAAC,CAAC;QACtD,IAAI,GAAG,EAAE,CAAC;YACR,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,YAAY,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC7D,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC;oBAC/B,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,WAAW;QAChB,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAY,CAAC;QACzC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAChC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;QAC5C,CAAC;QACD,YAAY,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACxE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,oBAAoB;QACzB,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,uBAAuB,CAAC,UAA4B;;QACzD,IAAI,OAAO,GAAoB,UAAU,aAAV,UAAU,cAAV,UAAU,GAAI,IAAI,CAAC;QAClD,OAAO,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,MAAM,KAAK,QAAQ,CAAC,SAAS,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM;YAC5D,OAAO,GAAG,MAAM,CAAC;QACnB,CAAC;QACD,kFAAkF;QAClF,4EAA4E;QAC5E,OAAO,MAAA,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,mCAAI,YAAY,CAAC,cAAc,CAAC;IAC3E,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACK,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC3D,MAAM,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAC5D,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC/B,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,2BAA2B,CACxC,KAAgD;QAEhD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,YAAY,CAAC,cAAc,CAAC;QACrC,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAClD,CAAC;QACD,6EAA6E;QAC7E,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YAC/C,MAAM,UAAU,GAAG,aAAa,CAAE,KAAsB,CAAC,EAAE,CAAC,CAAC;YAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,WAAW,CAChB,KAA+B;QAE/B,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAClF,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,WAAW,CAAC,KAAK,CAAwB,CAAC;IAC3D,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,MAAM,CAAO,QAAQ,CAAC,KAAe;;YACnC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;gBAClB,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9D,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CACb,sEAAsE,CACvE,CAAC;YACJ,CAAC;YACD,OAAO,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;KAAA;IAED;;;;;;;;OAQG;IACK,MAAM,CAAO,aAAa,CAAC,KAAe;;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,KAAK,CACb,sEAAsE,CACvE,CAAC;YACJ,CAAC;YACD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,MAAM,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC1D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;KAAA;IAED,MAAM,CAAC,WAAW,CAAe,KAAkB;QACjD,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,WAAW,CAAC,KAAK,CAA0B,CAAC;IAC7D,CAAC;IAED,MAAM,CAAC,WAAW,CAAe,KAAkB;QACjD,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,WAAW,CAAC,KAAK,CAA0B,CAAC;IAC7D,CAAC;IAED,MAAM,CAAC,WAAW,CAAC,KAAkB;QACnC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;CACF","sourcesContent":["import {CoreSet} from '../collections/CoreSet.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport type {SelectQuery} from '../queries/SelectQuery.js';\nimport type {AskQuery} from '../queries/AskQuery.js';\nimport type {CountQuery} from '../queries/CountQuery.js';\nimport type {CreateQuery} from '../queries/CreateQuery.js';\nimport type {UpdateQuery} from '../queries/UpdateQuery.js';\nimport type {DeleteQuery, DeleteResponse} from '../queries/DeleteQuery.js';\nimport {setQueryDispatch, resolveExistence} from '../queries/queryDispatch.js';\nimport {getShapeClass} from './ShapeClass.js';\nimport type {NodeShapeData} from '../shapes/SHACL.js';\n\n// plan-011 — count physical evaluations of THIS module on the one shared\n// global object. With the single-loader fix there should be exactly one copy;\n// the single-instance guard in backend.ts reports this count if storage config\n// ever lands on a different copy. Deliberately avoids Date/Math.random\n// (unavailable / non-deterministic per repo constraints).\nconst linkedStorageGlobal: any =\n  typeof globalThis !== 'undefined' ? globalThis : ({} as any);\nlinkedStorageGlobal.__linkedStorageInstanceCount =\n  (linkedStorageGlobal.__linkedStorageInstanceCount ?? 0) + 1;\n\n/**\n * Primary routing layer (arch-04 §The IDataset abstraction).\n *\n * Resolves an incoming Linked Query to the IDataset that should handle it,\n * based on the query's target shape. Composite IDatasets (gateways, routers,\n * forwarders, resolvers) plug in here just like storage IDatasets do.\n *\n * The \"Dataset\" naming aligns with the IDataset contract. Earlier \"Store\"\n * names were renamed in phase-1 — see docs/plans/002-phase-1-create-user-project-flow.md.\n */\n/**\n * The routing table lives on the shared global, beside the shape registries.\n *\n * It has to, for the same reason they do: a module can evaluate more than once in a\n * process, and a class static then exists once per copy. Leaving these two here while\n * the registries were shared was worse than either extreme — a second copy answered\n * `isInitialised()` with false and `getDatasetForShapeClass()` with the default, while\n * reporting a fully populated shape registry.\n */\nconst routingState: {\n  defaultDataset?: IDataset;\n  shapeToDataset: Map<Function, IDataset>;\n  listeners?: Set<() => void>;\n} = (linkedStorageGlobal.__linkedStorageRouting ??= {\n  defaultDataset: undefined,\n  shapeToDataset: new Map(),\n  listeners: new Set(),\n});\n// An older copy of this module may have created the record without listeners.\nroutingState.listeners ??= new Set();\n\n/** Tell routing-change listeners that the set of datasets may have changed. */\nfunction notifyRoutingChanged(): void {\n  for (const listener of [...routingState.listeners!]) {\n    try {\n      listener();\n    } catch (err) {\n      console.error('[linked] routing-change listener failed', err);\n    }\n  }\n}\n\n/** A shape class's IRI, or undefined for anything that is not a registered shape. */\nconst shapeUriOf = (shapeClass?: Function | null): string | undefined => {\n  const uri = (shapeClass as {shape?: {id?: unknown}} | null | undefined)?.shape?.id;\n  return typeof uri === 'string' && uri ? uri : undefined;\n};\n\nexport abstract class LinkedStorage {\n\n  /** plan-011 — how many physical copies of this module have evaluated. */\n  static getLoadedInstanceCount(): number {\n    return linkedStorageGlobal.__linkedStorageInstanceCount ?? 0;\n  }\n\n  static isInitialised() {\n    return !!routingState.defaultDataset;\n  }\n\n  /** The catch-all IDataset for shapes with no explicit mapping. */\n  static getDefaultDataset() {\n    return routingState.defaultDataset;\n  }\n\n  /** Set the default IDataset (catch-all for shapes with no explicit mapping). */\n  static setDefaultDataset(dataset: IDataset) {\n    routingState.defaultDataset = dataset;\n    if (routingState.defaultDataset?.init) {\n      routingState.defaultDataset.init();\n    }\n    setQueryDispatch({\n      selectQuery: (q) => this.selectQuery(q),\n      askQuery: (q) => this.askQuery(q),\n      createQuery: (q) => this.createQuery(q),\n      updateQuery: (q) => this.updateQuery(q),\n      deleteQuery: (q) => this.deleteQuery(q),\n    });\n    notifyRoutingChanged();\n  }\n\n  /**\n   * Be told whenever the set of datasets changes (`setDefaultDataset`,\n   * `setDatasetForShapes`, `unsetDatasetForShape`). The live-query store uses\n   * this to pick up a dataset's change feed. Returns the unsubscribe function.\n   */\n  static onRoutingChanged(listener: () => void): () => void {\n    routingState.listeners!.add(listener);\n    return () => routingState.listeners!.delete(listener);\n  }\n\n  /** Pin one or more shape classes to a specific IDataset implementer. */\n  static setDatasetForShapes(dataset: IDataset, ...shapeClasses: Function[]) {\n    shapeClasses.forEach((shapeClass) => {\n      // A shape's IRI is its identity, so two classes claiming the same IRI are the\n      // same shape and must not route to different datasets. That situation is a\n      // duplicate-registration bug elsewhere; say so here rather than resolving it by\n      // Map insertion order, which is silent and arbitrary.\n      const uri = shapeUriOf(shapeClass);\n      if (uri) {\n        for (const [pinned, existing] of routingState.shapeToDataset) {\n          if (pinned !== shapeClass && shapeUriOf(pinned) === uri && existing !== dataset) {\n            console.warn(\n              `[linked] Two different classes are pinned to '${uri}' with different ` +\n                `datasets. They are the same shape by identity, so one of these pins ` +\n                `will be ignored. This usually means the shape class was registered twice.`,\n            );\n          }\n        }\n      }\n      routingState.shapeToDataset.set(shapeClass, dataset);\n    });\n    notifyRoutingChanged();\n  }\n\n  /**\n   * Remove the pin for a shape, by class or by IRI.\n   *\n   * Removes **every** entry sharing that IRI, not just the one class object handed in.\n   * Deleting by class identity alone is not enough: resolution falls back to matching\n   * on IRI, so another class claiming the same shape would silently resurrect the pin\n   * the caller believed they had removed.\n   */\n  static unsetDatasetForShape(shape: Function | string): void {\n    const uri = typeof shape === 'string' ? shape : shapeUriOf(shape);\n    routingState.shapeToDataset.delete(shape as Function);\n    if (uri) {\n      for (const pinned of [...routingState.shapeToDataset.keys()]) {\n        if (shapeUriOf(pinned) === uri) {\n          routingState.shapeToDataset.delete(pinned);\n        }\n      }\n    }\n    notifyRoutingChanged();\n  }\n\n  /** Every IDataset known to the primary router (default + all pinned). */\n  static getDatasets(): CoreSet<IDataset> {\n    const datasets = new CoreSet<IDataset>();\n    if (routingState.defaultDataset) {\n      datasets.add(routingState.defaultDataset);\n    }\n    routingState.shapeToDataset.forEach((dataset) => datasets.add(dataset));\n    return datasets;\n  }\n\n  /**\n   * The live shape→IDataset map — not a copy.\n   *\n   * Mutating it works but is not the supported way to remove a pin: deleting a key\n   * here removes one class object, and resolution falls back to matching on shape IRI,\n   * so another class claiming the same shape resurrects the pin. Use\n   * `unsetDatasetForShape`, which removes every entry for that identity.\n   */\n  static getShapeToDatasetMap(): Map<Function, IDataset> {\n    return routingState.shapeToDataset;\n  }\n\n  /** Resolve the IDataset for a given shape class. Walks the prototype chain. */\n  static getDatasetForShapeClass(shapeClass?: Function | null): IDataset | undefined {\n    let current: Function | null = shapeClass ?? null;\n    while (typeof current === 'function') {\n      const dataset = routingState.shapeToDataset.get(current);\n      if (dataset) {\n        return dataset;\n      }\n      const parent = Object.getPrototypeOf(current);\n      if (parent === Function.prototype || parent === null) break;\n      current = parent;\n    }\n    // Only once the identity walk has failed. `static shape` is inherited, so running\n    // this at every level of the chain repeated the same scan for the same IRI.\n    return this.findPinByShapeUri(shapeClass) ?? routingState.defaultDataset;\n  }\n\n  /**\n   * The same pins, matched on shape IRI rather than on class identity.\n   *\n   * A class object is only a usable key while exactly one copy of the module\n   * that declares it has evaluated, and in a built app there is not: the\n   * backend runs from `lib/`, while `linked.backend.storage` is loaded from the\n   * app root and imports the app's shapes from `src/`. The pin lands on one\n   * copy of a shape class and the query resolves the other. The two are `!==`,\n   * the lookup misses, and the query silently falls through to the default\n   * dataset — which is how a shape that IS pinned reaches the app-data router\n   * and fails there. Dev loads both halves from `src`, so it only breaks in\n   * production.\n   *\n   * A shape's IRI does not have that problem: it is the shape's identity, it is\n   * what the query already carries on the wire, and every copy derives the same\n   * one. So it is the key that survives duplication.\n   *\n   * Deliberately a scan of the one map rather than a second map kept alongside it:\n   * one source of truth, over a map holding a few dozen entries, on a path only\n   * reached after an identity lookup has already failed.\n   */\n  private static findPinByShapeUri(shapeClass?: Function | null): IDataset | undefined {\n    const uri = shapeUriOf(shapeClass);\n    if (!uri) return undefined;\n    for (const [pinned, dataset] of routingState.shapeToDataset) {\n      if (shapeUriOf(pinned) === uri) {\n        return dataset;\n      }\n    }\n    return undefined;\n  }\n\n  private static resolveDatasetForQueryShape(\n    shape?: string | Function | NodeShapeData | null,\n  ): IDataset | undefined {\n    if (!shape) {\n      return routingState.defaultDataset;\n    }\n    if (typeof shape === 'function') {\n      return this.getDatasetForShapeClass(shape);\n    }\n    if (typeof shape === 'string') {\n      const shapeClass = getShapeClass(shape);\n      return this.getDatasetForShapeClass(shapeClass);\n    }\n    // NodeShapeData (the closed query's `shape` accessor) — resolve via its IRI.\n    if (typeof shape === 'object' && 'id' in shape) {\n      const shapeClass = getShapeClass((shape as {id: string}).id);\n      return this.getDatasetForShapeClass(shapeClass);\n    }\n    return routingState.defaultDataset;\n  }\n\n  /**\n   * Route a select query — **and a count**, which is a select.\n   *\n   * A count is not a separate query form (an ask is: `ASK WHERE { … }`); it is\n   * `SELECT (COUNT(DISTINCT ?s) AS ?count) WHERE { … }`, routed by the same shape to\n   * the same dataset and answered over the same channel. So it needs no arm of its\n   * own here — which is the point: when it had one, this router was missing it, and\n   * `.count()` failed on every path that went through the router while passing\n   * against a store held directly.\n   *\n   * The count contract — a real, non-negative integer, a failure never flattened\n   * into `0` — belongs to `resolveCount`, which the builder goes through. None of it\n   * is re-implemented here, exactly as none of `resolveExistence` is.\n   */\n  static selectQuery<ResultType>(\n    query: SelectQuery | CountQuery,\n  ): Promise<ResultType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid select query passed to LinkedStorage.selectQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQueryShape(query.shape);\n    if (!dataset?.selectQuery) {\n      return Promise.reject(\n        new Error('No query dataset configured. Call LinkedStorage.setDefaultDataset().'),\n      );\n    }\n    return dataset.selectQuery(query) as Promise<ResultType>;\n  }\n\n  /**\n   * Route an ask query.\n   *\n   * A **shaped** ask routes like every other query — by its shape, to one dataset.\n   *\n   * A **shapeless** ask (\"does a node with this IRI exist at all\") has no shape,\n   * and therefore no routing key. Asking only the default dataset would answer\n   * `false` for a node that exists in a pinned one — a wrong answer, quietly. So a\n   * router must ask every dataset it knows and OR the results. That is cheap\n   * precisely because the answers are booleans: the fan-out short-circuits on the\n   * first `true`, where the same sweep for rows could not.\n   *\n   * Any other router implementing `IDataset` inherits this obligation: a shapeless\n   * ask means \"anywhere I can reach\", not \"in my default store\".\n   *\n   * The contract itself — a real boolean, errors never flattened to `false` —\n   * belongs to `resolveExistence`, which the builder also goes through. None of it\n   * is re-implemented here.\n   */\n  static async askQuery(query: AskQuery): Promise<boolean> {\n    if (!query?.shape) {\n      return this.askAnyDataset(query);\n    }\n    const dataset = this.resolveDatasetForQueryShape(query.shape);\n    if (!dataset) {\n      throw new Error(\n        'No query dataset configured. Call LinkedStorage.setDefaultDataset().',\n      );\n    }\n    return resolveExistence(dataset, query);\n  }\n\n  /**\n   * Fan a shapeless ask out across every known dataset, resolving `true` as soon\n   * as one answers `true`.\n   *\n   * Sequential rather than parallel: the common case is a single dataset, and an\n   * early `true` should not have already cost a query against every other store.\n   * A failure from any dataset propagates — an unreachable store makes the answer\n   * unknown, and \"unknown\" is not `false`.\n   */\n  private static async askAnyDataset(query: AskQuery): Promise<boolean> {\n    const datasets = this.getDatasets();\n    if (datasets.size === 0) {\n      throw new Error(\n        'No query dataset configured. Call LinkedStorage.setDefaultDataset().',\n      );\n    }\n    for (const dataset of datasets) {\n      if (await resolveExistence(dataset, query)) return true;\n    }\n    return false;\n  }\n\n  static updateQuery<ResponseType>(query: UpdateQuery): Promise<ResponseType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid update query passed to LinkedStorage.updateQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQueryShape(query.shape);\n    if (!dataset?.updateQuery) {\n      return Promise.reject(\n        new Error('No update handler configured on the query dataset.'),\n      );\n    }\n    return dataset.updateQuery(query) as Promise<ResponseType>;\n  }\n\n  static createQuery<ResponseType>(query: CreateQuery): Promise<ResponseType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid create query passed to LinkedStorage.createQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQueryShape(query.shape);\n    if (!dataset?.createQuery) {\n      return Promise.reject(\n        new Error('No create handler configured on the query dataset.'),\n      );\n    }\n    return dataset.createQuery(query) as Promise<ResponseType>;\n  }\n\n  static deleteQuery(query: DeleteQuery): Promise<DeleteResponse> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid delete query passed to LinkedStorage.deleteQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQueryShape(query.shape);\n    if (!dataset?.deleteQuery) {\n      return Promise.reject(\n        new Error('No delete handler configured on the query dataset.'),\n      );\n    }\n    return dataset.deleteQuery(query);\n  }\n}\n"]}
+{"version":3,"file":"LinkedStorage.js","sourceRoot":"","sources":["../../../src/utils/LinkedStorage.ts"],"names":[],"mappings":";;;;;;;;;;AAAA,OAAO,EAAC,OAAO,EAAC,MAAM,2BAA2B,CAAC;AAQlD,OAAO,EAAC,gBAAgB,EAAE,gBAAgB,EAAC,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EACL,SAAS,EACT,qBAAqB,EACrB,aAAa,EACb,mBAAmB,EACnB,gBAAgB,GACjB,MAAM,iBAAiB,CAAC;AAGzB,yEAAyE;AACzE,8EAA8E;AAC9E,+EAA+E;AAC/E,uEAAuE;AACvE,0DAA0D;AAC1D,MAAM,mBAAmB,GACvB,OAAO,UAAU,KAAK,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAE,EAAU,CAAC;AAC/D,mBAAmB,CAAC,4BAA4B;IAC9C,CAAC,MAAA,mBAAmB,CAAC,4BAA4B,mCAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAE9D;;;;;;;;;GASG;AACH;;;;;;;;GAQG;AACH,MAAM,YAAY,GAId,OAAC,mBAAmB,CAAC,sBAAsB,oCAA1C,mBAAmB,CAAC,sBAAsB,GAAK;IAClD,cAAc,EAAE,SAAS;IACzB,cAAc,EAAE,IAAI,GAAG,EAAE;IACzB,SAAS,EAAE,IAAI,GAAG,EAAE;CACrB,EAAC,CAAC;AACH,8EAA8E;AAC9E,MAAA,YAAY,CAAC,SAAS,oCAAtB,YAAY,CAAC,SAAS,GAAK,IAAI,GAAG,EAAE,EAAC;AAErC,+EAA+E;AAC/E,SAAS,oBAAoB;IAC3B,KAAK,MAAM,QAAQ,IAAI,CAAC,GAAG,YAAY,CAAC,SAAU,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC;YACH,QAAQ,EAAE,CAAC;QACb,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,yCAAyC,EAAE,GAAG,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;AACH,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,GAAG,CAAC,UAA4B,EAAsB,EAAE;;IACtE,MAAM,GAAG,GAAG,MAAC,UAA0D,aAA1D,UAAU,uBAAV,UAAU,CAAkD,KAAK,0CAAE,EAAE,CAAC;IACnF,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,OAAgB,aAAa;IAEjC,yEAAyE;IACzE,MAAM,CAAC,sBAAsB;;QAC3B,OAAO,MAAA,mBAAmB,CAAC,4BAA4B,mCAAI,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,CAAC,aAAa;QAClB,OAAO,CAAC,CAAC,YAAY,CAAC,cAAc,CAAC;IACvC,CAAC;IAED,kEAAkE;IAClE,MAAM,CAAC,iBAAiB;QACtB,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED,gFAAgF;IAChF,MAAM,CAAC,iBAAiB,CAAC,OAAiB;;QACxC,YAAY,CAAC,cAAc,GAAG,OAAO,CAAC;QACtC,IAAI,MAAA,YAAY,CAAC,cAAc,0CAAE,IAAI,EAAE,CAAC;YACtC,YAAY,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;QACrC,CAAC;QACD,gBAAgB,CAAC;YACf,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACvC,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;SACxC,CAAC,CAAC;QACH,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,gBAAgB,CAAC,QAAoB;QAC1C,YAAY,CAAC,SAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,SAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxD,CAAC;IAED,wEAAwE;IACxE,MAAM,CAAC,mBAAmB,CAAC,OAAiB,EAAE,GAAG,YAAwB;QACvE,YAAY,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE;YAClC,8EAA8E;YAC9E,2EAA2E;YAC3E,gFAAgF;YAChF,sDAAsD;YACtD,MAAM,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;YACnC,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;oBAC7D,IAAI,MAAM,KAAK,UAAU,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;wBAChF,OAAO,CAAC,IAAI,CACV,iDAAiD,GAAG,mBAAmB;4BACrE,sEAAsE;4BACtE,2EAA2E,CAC9E,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,YAAY,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,oBAAoB,CAAC,KAAwB;QAClD,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClE,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,KAAiB,CAAC,CAAC;QACtD,IAAI,GAAG,EAAE,CAAC;YACR,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,YAAY,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC7D,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC;oBAC/B,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,oBAAoB,EAAE,CAAC;IACzB,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,WAAW;QAChB,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAY,CAAC;QACzC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAChC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;QAC5C,CAAC;QACD,YAAY,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACxE,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,oBAAoB;QACzB,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,uBAAuB,CAAC,UAA4B;;QACzD,IAAI,OAAO,GAAoB,UAAU,aAAV,UAAU,cAAV,UAAU,GAAI,IAAI,CAAC;QAClD,OAAO,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,YAAY,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,MAAM,KAAK,QAAQ,CAAC,SAAS,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM;YAC5D,OAAO,GAAG,MAAM,CAAC;QACnB,CAAC;QACD,kFAAkF;QAClF,4EAA4E;QAC5E,OAAO,MAAA,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,mCAAI,YAAY,CAAC,cAAc,CAAC;IAC3E,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACK,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC3D,MAAM,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAC5D,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC/B,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAwB;QAC5D,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,OAAO,KAAK,qBAAqB,EAAE,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,IAAI,CAAC,2BAA2B,CACrC,KAAK,CAAC,KAA6D,CACpE,CAAC;IACJ,CAAC;IAEO,MAAM,CAAC,2BAA2B,CACxC,KAAgD;QAEhD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,YAAY,CAAC,cAAc,CAAC;QACrC,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAClD,CAAC;QACD,6EAA6E;QAC7E,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YAC/C,MAAM,UAAU,GAAG,aAAa,CAAE,KAAsB,CAAC,EAAE,CAAC,CAAC;YAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,YAAY,CAAC,cAAc,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,WAAW,CAChB,KAA+B;QAE/B,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAClF,CAAC;QACJ,CAAC;QACD,uFAAuF;QACvF,OAAO,CAAC,qBAAqB,EAAE,KAAK,SAAS;YAC3C,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC;YAC5B,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAwB,CAAC;IACpF,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,MAAM,CAAO,QAAQ,CAAC,KAAe;;YACnC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;gBAClB,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,KAAK,CACb,sEAAsE,CACvE,CAAC;YACJ,CAAC;YACD,OAAO,qBAAqB,EAAE,KAAK,SAAS;gBAC1C,CAAC,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC;gBAClC,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QAClE,CAAC;KAAA;IAED;;;;;;;;OAQG;IACK,MAAM,CAAO,aAAa,CAAC,KAAe;;YAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,KAAK,CACb,sEAAsE,CACvE,CAAC;YACJ,CAAC;YACD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,qBAAqB,EAAE,KAAK,SAAS;oBAClD,CAAC,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC;oBAClC,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;gBAChE,IAAI,MAAM,MAAM;oBAAE,OAAO,IAAI,CAAC;YAChC,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;KAAA;IAED,MAAM,CAAC,WAAW,CAAe,KAAkB;QACjD,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,qBAAqB,EAAE,KAAK,SAAS;YAC3C,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC;YAC5B,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAA0B,CAAC;IACtF,CAAC;IAED,MAAM,CAAC,WAAW,CAAe,KAAkB;QACjD,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,qBAAqB,EAAE,KAAK,SAAS;YAC3C,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC;YAC5B,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAA0B,CAAC;IACtF,CAAC;IAED,MAAM,CAAC,WAAW,CAAC,KAAkB;QACnC,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,KAAK,CAAA,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CACP,4EAA4E,CAC7E,CACF,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,CAAA,EAAE,CAAC;YAC1B,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAChE,CAAC;QACJ,CAAC;QACD,OAAO,qBAAqB,EAAE,KAAK,SAAS;YAC1C,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC;YAC5B,CAAC,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF","sourcesContent":["import {CoreSet} from '../collections/CoreSet.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport type {SelectQuery} from '../queries/SelectQuery.js';\nimport type {AskQuery} from '../queries/AskQuery.js';\nimport type {CountQuery} from '../queries/CountQuery.js';\nimport type {CreateQuery} from '../queries/CreateQuery.js';\nimport type {UpdateQuery} from '../queries/UpdateQuery.js';\nimport type {DeleteQuery, DeleteResponse} from '../queries/DeleteQuery.js';\nimport {setQueryDispatch, resolveExistence} from '../queries/queryDispatch.js';\nimport {\n  catalogOf,\n  getActiveShapeCatalog,\n  getShapeClass,\n  outsideShapeCatalog,\n  withShapeCatalog,\n} from './ShapeClass.js';\nimport type {NodeShapeData} from '../shapes/SHACL.js';\n\n// plan-011 — count physical evaluations of THIS module on the one shared\n// global object. With the single-loader fix there should be exactly one copy;\n// the single-instance guard in backend.ts reports this count if storage config\n// ever lands on a different copy. Deliberately avoids Date/Math.random\n// (unavailable / non-deterministic per repo constraints).\nconst linkedStorageGlobal: any =\n  typeof globalThis !== 'undefined' ? globalThis : ({} as any);\nlinkedStorageGlobal.__linkedStorageInstanceCount =\n  (linkedStorageGlobal.__linkedStorageInstanceCount ?? 0) + 1;\n\n/**\n * Primary routing layer (arch-04 §The IDataset abstraction).\n *\n * Resolves an incoming Linked Query to the IDataset that should handle it,\n * based on the query's target shape. Composite IDatasets (gateways, routers,\n * forwarders, resolvers) plug in here just like storage IDatasets do.\n *\n * The \"Dataset\" naming aligns with the IDataset contract. Earlier \"Store\"\n * names were renamed in phase-1 — see docs/plans/002-phase-1-create-user-project-flow.md.\n */\n/**\n * The routing table lives on the shared global, beside the shape registries.\n *\n * It has to, for the same reason they do: a module can evaluate more than once in a\n * process, and a class static then exists once per copy. Leaving these two here while\n * the registries were shared was worse than either extreme — a second copy answered\n * `isInitialised()` with false and `getDatasetForShapeClass()` with the default, while\n * reporting a fully populated shape registry.\n */\nconst routingState: {\n  defaultDataset?: IDataset;\n  shapeToDataset: Map<Function, IDataset>;\n  listeners?: Set<() => void>;\n} = (linkedStorageGlobal.__linkedStorageRouting ??= {\n  defaultDataset: undefined,\n  shapeToDataset: new Map(),\n  listeners: new Set(),\n});\n// An older copy of this module may have created the record without listeners.\nroutingState.listeners ??= new Set();\n\n/** Tell routing-change listeners that the set of datasets may have changed. */\nfunction notifyRoutingChanged(): void {\n  for (const listener of [...routingState.listeners!]) {\n    try {\n      listener();\n    } catch (err) {\n      console.error('[linked] routing-change listener failed', err);\n    }\n  }\n}\n\n/** A shape class's IRI, or undefined for anything that is not a registered shape. */\nconst shapeUriOf = (shapeClass?: Function | null): string | undefined => {\n  const uri = (shapeClass as {shape?: {id?: unknown}} | null | undefined)?.shape?.id;\n  return typeof uri === 'string' && uri ? uri : undefined;\n};\n\nexport abstract class LinkedStorage {\n\n  /** plan-011 — how many physical copies of this module have evaluated. */\n  static getLoadedInstanceCount(): number {\n    return linkedStorageGlobal.__linkedStorageInstanceCount ?? 0;\n  }\n\n  static isInitialised() {\n    return !!routingState.defaultDataset;\n  }\n\n  /** The catch-all IDataset for shapes with no explicit mapping. */\n  static getDefaultDataset() {\n    return routingState.defaultDataset;\n  }\n\n  /** Set the default IDataset (catch-all for shapes with no explicit mapping). */\n  static setDefaultDataset(dataset: IDataset) {\n    routingState.defaultDataset = dataset;\n    if (routingState.defaultDataset?.init) {\n      routingState.defaultDataset.init();\n    }\n    setQueryDispatch({\n      selectQuery: (q) => this.selectQuery(q),\n      askQuery: (q) => this.askQuery(q),\n      createQuery: (q) => this.createQuery(q),\n      updateQuery: (q) => this.updateQuery(q),\n      deleteQuery: (q) => this.deleteQuery(q),\n    });\n    notifyRoutingChanged();\n  }\n\n  /**\n   * Be told whenever the set of datasets changes (`setDefaultDataset`,\n   * `setDatasetForShapes`, `unsetDatasetForShape`). The live-query store uses\n   * this to pick up a dataset's change feed. Returns the unsubscribe function.\n   */\n  static onRoutingChanged(listener: () => void): () => void {\n    routingState.listeners!.add(listener);\n    return () => routingState.listeners!.delete(listener);\n  }\n\n  /** Pin one or more shape classes to a specific IDataset implementer. */\n  static setDatasetForShapes(dataset: IDataset, ...shapeClasses: Function[]) {\n    shapeClasses.forEach((shapeClass) => {\n      // A shape's IRI is its identity, so two classes claiming the same IRI are the\n      // same shape and must not route to different datasets. That situation is a\n      // duplicate-registration bug elsewhere; say so here rather than resolving it by\n      // Map insertion order, which is silent and arbitrary.\n      const uri = shapeUriOf(shapeClass);\n      if (uri) {\n        for (const [pinned, existing] of routingState.shapeToDataset) {\n          if (pinned !== shapeClass && shapeUriOf(pinned) === uri && existing !== dataset) {\n            console.warn(\n              `[linked] Two different classes are pinned to '${uri}' with different ` +\n                `datasets. They are the same shape by identity, so one of these pins ` +\n                `will be ignored. This usually means the shape class was registered twice.`,\n            );\n          }\n        }\n      }\n      routingState.shapeToDataset.set(shapeClass, dataset);\n    });\n    notifyRoutingChanged();\n  }\n\n  /**\n   * Remove the pin for a shape, by class or by IRI.\n   *\n   * Removes **every** entry sharing that IRI, not just the one class object handed in.\n   * Deleting by class identity alone is not enough: resolution falls back to matching\n   * on IRI, so another class claiming the same shape would silently resurrect the pin\n   * the caller believed they had removed.\n   */\n  static unsetDatasetForShape(shape: Function | string): void {\n    const uri = typeof shape === 'string' ? shape : shapeUriOf(shape);\n    routingState.shapeToDataset.delete(shape as Function);\n    if (uri) {\n      for (const pinned of [...routingState.shapeToDataset.keys()]) {\n        if (shapeUriOf(pinned) === uri) {\n          routingState.shapeToDataset.delete(pinned);\n        }\n      }\n    }\n    notifyRoutingChanged();\n  }\n\n  /** Every IDataset known to the primary router (default + all pinned). */\n  static getDatasets(): CoreSet<IDataset> {\n    const datasets = new CoreSet<IDataset>();\n    if (routingState.defaultDataset) {\n      datasets.add(routingState.defaultDataset);\n    }\n    routingState.shapeToDataset.forEach((dataset) => datasets.add(dataset));\n    return datasets;\n  }\n\n  /**\n   * The live shape→IDataset map — not a copy.\n   *\n   * Mutating it works but is not the supported way to remove a pin: deleting a key\n   * here removes one class object, and resolution falls back to matching on shape IRI,\n   * so another class claiming the same shape resurrects the pin. Use\n   * `unsetDatasetForShape`, which removes every entry for that identity.\n   */\n  static getShapeToDatasetMap(): Map<Function, IDataset> {\n    return routingState.shapeToDataset;\n  }\n\n  /** Resolve the IDataset for a given shape class. Walks the prototype chain. */\n  static getDatasetForShapeClass(shapeClass?: Function | null): IDataset | undefined {\n    let current: Function | null = shapeClass ?? null;\n    while (typeof current === 'function') {\n      const dataset = routingState.shapeToDataset.get(current);\n      if (dataset) {\n        return dataset;\n      }\n      const parent = Object.getPrototypeOf(current);\n      if (parent === Function.prototype || parent === null) break;\n      current = parent;\n    }\n    // Only once the identity walk has failed. `static shape` is inherited, so running\n    // this at every level of the chain repeated the same scan for the same IRI.\n    return this.findPinByShapeUri(shapeClass) ?? routingState.defaultDataset;\n  }\n\n  /**\n   * The same pins, matched on shape IRI rather than on class identity.\n   *\n   * A class object is only a usable key while exactly one copy of the module\n   * that declares it has evaluated, and in a built app there is not: the\n   * backend runs from `lib/`, while `linked.backend.storage` is loaded from the\n   * app root and imports the app's shapes from `src/`. The pin lands on one\n   * copy of a shape class and the query resolves the other. The two are `!==`,\n   * the lookup misses, and the query silently falls through to the default\n   * dataset — which is how a shape that IS pinned reaches the app-data router\n   * and fails there. Dev loads both halves from `src`, so it only breaks in\n   * production.\n   *\n   * A shape's IRI does not have that problem: it is the shape's identity, it is\n   * what the query already carries on the wire, and every copy derives the same\n   * one. So it is the key that survives duplication.\n   *\n   * Deliberately a scan of the one map rather than a second map kept alongside it:\n   * one source of truth, over a map holding a few dozen entries, on a path only\n   * reached after an identity lookup has already failed.\n   */\n  private static findPinByShapeUri(shapeClass?: Function | null): IDataset | undefined {\n    const uri = shapeUriOf(shapeClass);\n    if (!uri) return undefined;\n    for (const [pinned, dataset] of routingState.shapeToDataset) {\n      if (shapeUriOf(pinned) === uri) {\n        return dataset;\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * The dataset a query routes to, resolved in the catalog the query captured. Only the\n   * routing runs in that catalog: the caller then calls the dataset in the scope it was\n   * called in, so a router's own queries (CN's `BranchDataFork` lookups) never run inside\n   * a project's catalog. The dataset re-enters from the query or its IR where it lowers.\n   */\n  private static resolveDatasetForQuery(query: {shape?: unknown}): IDataset | undefined {\n    const catalog = catalogOf(query);\n    if (catalog !== getActiveShapeCatalog()) {\n      return withShapeCatalog(catalog, () => this.resolveDatasetForQuery(query));\n    }\n    return this.resolveDatasetForQueryShape(\n      query.shape as string | Function | NodeShapeData | null | undefined,\n    );\n  }\n\n  private static resolveDatasetForQueryShape(\n    shape?: string | Function | NodeShapeData | null,\n  ): IDataset | undefined {\n    if (!shape) {\n      return routingState.defaultDataset;\n    }\n    if (typeof shape === 'function') {\n      return this.getDatasetForShapeClass(shape);\n    }\n    if (typeof shape === 'string') {\n      const shapeClass = getShapeClass(shape);\n      return this.getDatasetForShapeClass(shapeClass);\n    }\n    // NodeShapeData (the closed query's `shape` accessor) — resolve via its IRI.\n    if (typeof shape === 'object' && 'id' in shape) {\n      const shapeClass = getShapeClass((shape as {id: string}).id);\n      return this.getDatasetForShapeClass(shapeClass);\n    }\n    return routingState.defaultDataset;\n  }\n\n  /**\n   * Route a select query — **and a count**, which is a select.\n   *\n   * A count is not a separate query form (an ask is: `ASK WHERE { … }`); it is\n   * `SELECT (COUNT(DISTINCT ?s) AS ?count) WHERE { … }`, routed by the same shape to\n   * the same dataset and answered over the same channel. So it needs no arm of its\n   * own here — which is the point: when it had one, this router was missing it, and\n   * `.count()` failed on every path that went through the router while passing\n   * against a store held directly.\n   *\n   * The count contract — a real, non-negative integer, a failure never flattened\n   * into `0` — belongs to `resolveCount`, which the builder goes through. None of it\n   * is re-implemented here, exactly as none of `resolveExistence` is.\n   */\n  static selectQuery<ResultType>(\n    query: SelectQuery | CountQuery,\n  ): Promise<ResultType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid select query passed to LinkedStorage.selectQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQuery(query);\n    if (!dataset?.selectQuery) {\n      return Promise.reject(\n        new Error('No query dataset configured. Call LinkedStorage.setDefaultDataset().'),\n      );\n    }\n    // Called outside any catalog: a router's own queries never run in the query's catalog.\n    return (getActiveShapeCatalog() === undefined\n      ? dataset.selectQuery(query)\n      : outsideShapeCatalog(() => dataset.selectQuery(query))) as Promise<ResultType>;\n  }\n\n  /**\n   * Route an ask query.\n   *\n   * A **shaped** ask routes like every other query — by its shape, to one dataset.\n   *\n   * A **shapeless** ask (\"does a node with this IRI exist at all\") has no shape,\n   * and therefore no routing key. Asking only the default dataset would answer\n   * `false` for a node that exists in a pinned one — a wrong answer, quietly. So a\n   * router must ask every dataset it knows and OR the results. That is cheap\n   * precisely because the answers are booleans: the fan-out short-circuits on the\n   * first `true`, where the same sweep for rows could not.\n   *\n   * Any other router implementing `IDataset` inherits this obligation: a shapeless\n   * ask means \"anywhere I can reach\", not \"in my default store\".\n   *\n   * The contract itself — a real boolean, errors never flattened to `false` —\n   * belongs to `resolveExistence`, which the builder also goes through. None of it\n   * is re-implemented here.\n   */\n  static async askQuery(query: AskQuery): Promise<boolean> {\n    if (!query?.shape) {\n      return this.askAnyDataset(query);\n    }\n    const dataset = this.resolveDatasetForQuery(query);\n    if (!dataset) {\n      throw new Error(\n        'No query dataset configured. Call LinkedStorage.setDefaultDataset().',\n      );\n    }\n    return getActiveShapeCatalog() === undefined\n      ? resolveExistence(dataset, query)\n      : outsideShapeCatalog(() => resolveExistence(dataset, query));\n  }\n\n  /**\n   * Fan a shapeless ask out across every known dataset, resolving `true` as soon\n   * as one answers `true`.\n   *\n   * Sequential rather than parallel: the common case is a single dataset, and an\n   * early `true` should not have already cost a query against every other store.\n   * A failure from any dataset propagates — an unreachable store makes the answer\n   * unknown, and \"unknown\" is not `false`.\n   */\n  private static async askAnyDataset(query: AskQuery): Promise<boolean> {\n    const datasets = this.getDatasets();\n    if (datasets.size === 0) {\n      throw new Error(\n        'No query dataset configured. Call LinkedStorage.setDefaultDataset().',\n      );\n    }\n    for (const dataset of datasets) {\n      const exists = getActiveShapeCatalog() === undefined\n        ? resolveExistence(dataset, query)\n        : outsideShapeCatalog(() => resolveExistence(dataset, query));\n      if (await exists) return true;\n    }\n    return false;\n  }\n\n  static updateQuery<ResponseType>(query: UpdateQuery): Promise<ResponseType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid update query passed to LinkedStorage.updateQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQuery(query);\n    if (!dataset?.updateQuery) {\n      return Promise.reject(\n        new Error('No update handler configured on the query dataset.'),\n      );\n    }\n    return (getActiveShapeCatalog() === undefined\n      ? dataset.updateQuery(query)\n      : outsideShapeCatalog(() => dataset.updateQuery(query))) as Promise<ResponseType>;\n  }\n\n  static createQuery<ResponseType>(query: CreateQuery): Promise<ResponseType> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid create query passed to LinkedStorage.createQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQuery(query);\n    if (!dataset?.createQuery) {\n      return Promise.reject(\n        new Error('No create handler configured on the query dataset.'),\n      );\n    }\n    return (getActiveShapeCatalog() === undefined\n      ? dataset.createQuery(query)\n      : outsideShapeCatalog(() => dataset.createQuery(query))) as Promise<ResponseType>;\n  }\n\n  static deleteQuery(query: DeleteQuery): Promise<DeleteResponse> {\n    if (!query?.shape) {\n      return Promise.reject(\n        new Error(\n          'Invalid delete query passed to LinkedStorage.deleteQuery(): missing shape.',\n        ),\n      );\n    }\n    const dataset = this.resolveDatasetForQuery(query);\n    if (!dataset?.deleteQuery) {\n      return Promise.reject(\n        new Error('No delete handler configured on the query dataset.'),\n      );\n    }\n    return getActiveShapeCatalog() === undefined\n      ? dataset.deleteQuery(query)\n      : outsideShapeCatalog(() => dataset.deleteQuery(query));\n  }\n}\n"]}

package/lib/esm/utils/ShapeCatalog.d.ts

@@ -0,0 +1,57 @@
+/**
+ * A set of shapes a query resolves against without registering them.
+ *
+ * The global registry is process-wide and last-wins: two projects (or two branches of
+ * one) that hold the same shape IRI with different properties cannot both be registered.
+ * A `ShapeCatalog` is an immutable object holding one such set; `withShapeCatalog(catalog,
+ * fn)` makes it the shapes every registry accessor reads while `fn` runs. Builders, field
+ * sets and IRs capture the catalog they were made in and re-enter it wherever they are
+ * picked up later, so a query built in a scope lowers, compiles and live-tracks against
+ * that catalog after the scope has closed.
+ *
+ * The catalog is never serialized: DSL-JSON carries IRIs only, and each side of a wire
+ * supplies its own catalog (`fromJSON(json, {catalog})`).
+ *
+ * See docs/architecture/runtime-instances.md.
+ */
+import type { Shape } from '../shapes/Shape.js';
+import type { NodeShapeData } from '../shapes/nodeShapeData.js';
+import { type NodeShapeWire } from '../shapes/nodeShapeWire.js';
+import '../shapes/PathNode.js';
+export { withShapeCatalog, getActiveShapeCatalog, catalogOf, shapeCatalogKey, } from './ShapeClass.js';
+/** The IRIs of core's six built-in shapes, which every catalog holds. */
+export declare function builtInShapeIris(): string[];
+export declare class ShapeCatalog {
+    /** For log lines only, e.g. `"<projectId>#<branch>"`. */
+    readonly name?: string;
+    /**
+     * Every shape the catalog holds, its own and core's built-ins, by IRI. Read by the
+     * registry accessors. A plain field rather than a private one, so a catalog built by
+     * one copy of core is readable by another.
+     * @internal
+     */
+    readonly nodeShapes: ReadonlyMap<string, NodeShapeData>;
+    /** Core's built-in classes by IRI — the only classes a catalog holds. @internal */
+    readonly shapeClasses: ReadonlyMap<string, typeof Shape>;
+    private constructor();
+    /**
+     * Build a catalog from shape metadata or its wire form. Wires are converted as
+     * `registerRuntimeShape` converts them (`fromWire`, the reserved-label warning). Unlike the
+     * global registry, a row for an IRI that has a compiled class elsewhere is kept: inside a
+     * catalog the data is the authority.
+     *
+     * Core's six built-in shapes always come from core's code, with their classes. `syncShapes`
+     * writes them into datasets too, but a row for one of their IRIs is ignored here: the
+     * metamodel (its cascades, its routing pins) must not depend on how faithfully a catalog was
+     * read, or on which core version last synced the dataset.
+     */
+    static from(shapes: Iterable<NodeShapeData | NodeShapeWire> | Record<string, NodeShapeData | NodeShapeWire>, options?: {
+        name?: string;
+    }): ShapeCatalog;
+    /** How many shapes the catalog holds, core's built-ins included. */
+    get size(): number;
+    get(iri: string): NodeShapeData | undefined;
+    has(iri: string): boolean;
+    /** Every shape the catalog holds, core's built-ins included. */
+    values(): IterableIterator<NodeShapeData>;
+}

package/lib/esm/utils/ShapeCatalog.js

@@ -0,0 +1,86 @@
+/*
+ * 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 { fromWire, isNodeShapeWire } from '../shapes/nodeShapeWire.js';
+import { getNodeShapeUri } from '../shapes/SHACL.js';
+import { warnOnReservedPropertyLabel } from '../queries/reservedQueryNames.js';
+import { getRegisteredShapeClass } from './ShapeClass.js';
+// Registers PathNode and PathList (PathNode imports PathList), two of the built-ins.
+import '../shapes/PathNode.js';
+export { withShapeCatalog, getActiveShapeCatalog, catalogOf, shapeCatalogKey, } from './ShapeClass.js';
+/**
+ * Core's own shapes, which every catalog holds from core's code, with their classes.
+ *
+ * `syncShapes` writes them into a dataset like any package's shapes, but a catalog ignores
+ * those rows: inside a catalog the built-ins resolve from code. Data-only shapes depend
+ * on them: a property shape's `type` points at `Shape`, and the shape metamodel itself
+ * (`NodeShape`, `PropertyShape`, their `sh:in` lists and complex paths) is how a shape
+ * sync reads and writes shapes.
+ */
+const BUILT_IN_NAMES = ['Shape', 'NodeShape', 'PropertyShape', 'List', 'PathNode', 'PathList'];
+/** The IRIs of core's six built-in shapes, which every catalog holds. */
+export function builtInShapeIris() {
+    return BUILT_IN_NAMES.map((name) => getNodeShapeUri('@_linked/core', name));
+}
+export class ShapeCatalog {
+    constructor(nodeShapes, shapeClasses, name) {
+        this.nodeShapes = nodeShapes;
+        this.shapeClasses = shapeClasses;
+        if (name !== undefined)
+            this.name = name;
+        Object.freeze(this);
+    }
+    /**
+     * Build a catalog from shape metadata or its wire form. Wires are converted as
+     * `registerRuntimeShape` converts them (`fromWire`, the reserved-label warning). Unlike the
+     * global registry, a row for an IRI that has a compiled class elsewhere is kept: inside a
+     * catalog the data is the authority.
+     *
+     * Core's six built-in shapes always come from core's code, with their classes. `syncShapes`
+     * writes them into datasets too, but a row for one of their IRIs is ignored here: the
+     * metamodel (its cascades, its routing pins) must not depend on how faithfully a catalog was
+     * read, or on which core version last synced the dataset.
+     */
+    static from(shapes, options) {
+        var _a;
+        const list = shapes && typeof shapes[Symbol.iterator] === 'function'
+            ? shapes
+            : Object.values(shapes);
+        const nodeShapes = new Map();
+        const shapeClasses = new Map();
+        for (const iri of builtInShapeIris()) {
+            const shapeClass = getRegisteredShapeClass(iri);
+            if (!(shapeClass === null || shapeClass === void 0 ? void 0 : shapeClass.shape))
+                continue;
+            shapeClasses.set(iri, shapeClass);
+            nodeShapes.set(iri, shapeClass.shape);
+        }
+        for (const shape of list) {
+            if (!(shape === null || shape === void 0 ? void 0 : shape.id) || shapeClasses.has(shape.id))
+                continue;
+            const data = isNodeShapeWire(shape) ? fromWire(shape) : shape;
+            for (const ps of (_a = data.propertyShapes) !== null && _a !== void 0 ? _a : []) {
+                warnOnReservedPropertyLabel(ps.label, data.label, data.id);
+            }
+            nodeShapes.set(data.id, data);
+        }
+        return new ShapeCatalog(nodeShapes, shapeClasses, options === null || options === void 0 ? void 0 : options.name);
+    }
+    /** How many shapes the catalog holds, core's built-ins included. */
+    get size() {
+        return this.nodeShapes.size;
+    }
+    get(iri) {
+        return this.nodeShapes.get(iri);
+    }
+    has(iri) {
+        return this.nodeShapes.has(iri);
+    }
+    /** Every shape the catalog holds, core's built-ins included. */
+    values() {
+        return this.nodeShapes.values();
+    }
+}
+//# sourceMappingURL=ShapeCatalog.js.map

package/lib/esm/utils/ShapeCatalog.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShapeCatalog.js","sourceRoot":"","sources":["../../../src/utils/ShapeCatalog.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAqBH,OAAO,EAAC,QAAQ,EAAE,eAAe,EAAqB,MAAM,4BAA4B,CAAC;AACzF,OAAO,EAAC,eAAe,EAAC,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAC,2BAA2B,EAAC,MAAM,kCAAkC,CAAC;AAC7E,OAAO,EAAC,uBAAuB,EAAC,MAAM,iBAAiB,CAAC;AACxD,qFAAqF;AACrF,OAAO,uBAAuB,CAAC;AAE/B,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,SAAS,EACT,eAAe,GAChB,MAAM,iBAAiB,CAAC;AAEzB;;;;;;;;GAQG;AACH,MAAM,cAAc,GAAG,CAAC,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAE/F,yEAAyE;AACzE,MAAM,UAAU,gBAAgB;IAC9B,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,MAAM,OAAO,YAAY;IAavB,YACE,UAAsC,EACtC,YAAuC,EACvC,IAAa;QAEb,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,IAAI,CACT,MAEiD,EACjD,OAAyB;;QAEzB,MAAM,IAAI,GACR,MAAM,IAAI,OAAQ,MAA4B,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU;YAC5E,CAAC,CAAE,MAAkD;YACrD,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAuD,CAAC,CAAC;QAE7E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;QACpD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAwB,CAAC;QACrD,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,EAAE,CAAC;YACrC,MAAM,UAAU,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAC;YAChD,IAAI,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,KAAK,CAAA;gBAAE,SAAS;YACjC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YAClC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,EAAE,CAAA,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YACvD,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAuB,CAAC;YACjF,KAAK,MAAM,EAAE,IAAI,MAAA,IAAI,CAAC,cAAc,mCAAI,EAAE,EAAE,CAAC;gBAC3C,2BAA2B,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7D,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,YAAY,CAAC,UAAU,EAAE,YAAY,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,CAAC,CAAC;IACnE,CAAC;IAED,oEAAoE;IACpE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,gEAAgE;IAChE,MAAM;QACJ,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAqC,CAAC;IACrE,CAAC;CACF","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 * A set of shapes a query resolves against without registering them.\n *\n * The global registry is process-wide and last-wins: two projects (or two branches of\n * one) that hold the same shape IRI with different properties cannot both be registered.\n * A `ShapeCatalog` is an immutable object holding one such set; `withShapeCatalog(catalog,\n * fn)` makes it the shapes every registry accessor reads while `fn` runs. Builders, field\n * sets and IRs capture the catalog they were made in and re-enter it wherever they are\n * picked up later, so a query built in a scope lowers, compiles and live-tracks against\n * that catalog after the scope has closed.\n *\n * The catalog is never serialized: DSL-JSON carries IRIs only, and each side of a wire\n * supplies its own catalog (`fromJSON(json, {catalog})`).\n *\n * See docs/architecture/runtime-instances.md.\n */\n\nimport type {Shape} from '../shapes/Shape.js';\nimport type {NodeShapeData} from '../shapes/nodeShapeData.js';\nimport {fromWire, isNodeShapeWire, type NodeShapeWire} from '../shapes/nodeShapeWire.js';\nimport {getNodeShapeUri} from '../shapes/SHACL.js';\nimport {warnOnReservedPropertyLabel} from '../queries/reservedQueryNames.js';\nimport {getRegisteredShapeClass} from './ShapeClass.js';\n// Registers PathNode and PathList (PathNode imports PathList), two of the built-ins.\nimport '../shapes/PathNode.js';\n\nexport {\n  withShapeCatalog,\n  getActiveShapeCatalog,\n  catalogOf,\n  shapeCatalogKey,\n} from './ShapeClass.js';\n\n/**\n * Core's own shapes, which every catalog holds from core's code, with their classes.\n *\n * `syncShapes` writes them into a dataset like any package's shapes, but a catalog ignores\n * those rows: inside a catalog the built-ins resolve from code. Data-only shapes depend\n * on them: a property shape's `type` points at `Shape`, and the shape metamodel itself\n * (`NodeShape`, `PropertyShape`, their `sh:in` lists and complex paths) is how a shape\n * sync reads and writes shapes.\n */\nconst BUILT_IN_NAMES = ['Shape', 'NodeShape', 'PropertyShape', 'List', 'PathNode', 'PathList'];\n\n/** The IRIs of core's six built-in shapes, which every catalog holds. */\nexport function builtInShapeIris(): string[] {\n  return BUILT_IN_NAMES.map((name) => getNodeShapeUri('@_linked/core', name));\n}\n\nexport class ShapeCatalog {\n  /** For log lines only, e.g. `\"<projectId>#<branch>\"`. */\n  readonly name?: string;\n  /**\n   * Every shape the catalog holds, its own and core's built-ins, by IRI. Read by the\n   * registry accessors. A plain field rather than a private one, so a catalog built by\n   * one copy of core is readable by another.\n   * @internal\n   */\n  readonly nodeShapes: ReadonlyMap<string, NodeShapeData>;\n  /** Core's built-in classes by IRI — the only classes a catalog holds. @internal */\n  readonly shapeClasses: ReadonlyMap<string, typeof Shape>;\n\n  private constructor(\n    nodeShapes: Map<string, NodeShapeData>,\n    shapeClasses: Map<string, typeof Shape>,\n    name?: string,\n  ) {\n    this.nodeShapes = nodeShapes;\n    this.shapeClasses = shapeClasses;\n    if (name !== undefined) this.name = name;\n    Object.freeze(this);\n  }\n\n  /**\n   * Build a catalog from shape metadata or its wire form. Wires are converted as\n   * `registerRuntimeShape` converts them (`fromWire`, the reserved-label warning). Unlike the\n   * global registry, a row for an IRI that has a compiled class elsewhere is kept: inside a\n   * catalog the data is the authority.\n   *\n   * Core's six built-in shapes always come from core's code, with their classes. `syncShapes`\n   * writes them into datasets too, but a row for one of their IRIs is ignored here: the\n   * metamodel (its cascades, its routing pins) must not depend on how faithfully a catalog was\n   * read, or on which core version last synced the dataset.\n   */\n  static from(\n    shapes:\n      | Iterable<NodeShapeData | NodeShapeWire>\n      | Record<string, NodeShapeData | NodeShapeWire>,\n    options?: {name?: string},\n  ): ShapeCatalog {\n    const list: Iterable<NodeShapeData | NodeShapeWire> =\n      shapes && typeof (shapes as Iterable<unknown>)[Symbol.iterator] === 'function'\n        ? (shapes as Iterable<NodeShapeData | NodeShapeWire>)\n        : Object.values(shapes as Record<string, NodeShapeData | NodeShapeWire>);\n\n    const nodeShapes = new Map<string, NodeShapeData>();\n    const shapeClasses = new Map<string, typeof Shape>();\n    for (const iri of builtInShapeIris()) {\n      const shapeClass = getRegisteredShapeClass(iri);\n      if (!shapeClass?.shape) continue;\n      shapeClasses.set(iri, shapeClass);\n      nodeShapes.set(iri, shapeClass.shape);\n    }\n    for (const shape of list) {\n      if (!shape?.id || shapeClasses.has(shape.id)) continue;\n      const data = isNodeShapeWire(shape) ? fromWire(shape) : (shape as NodeShapeData);\n      for (const ps of data.propertyShapes ?? []) {\n        warnOnReservedPropertyLabel(ps.label, data.label, data.id);\n      }\n      nodeShapes.set(data.id, data);\n    }\n    return new ShapeCatalog(nodeShapes, shapeClasses, options?.name);\n  }\n\n  /** How many shapes the catalog holds, core's built-ins included. */\n  get size(): number {\n    return this.nodeShapes.size;\n  }\n\n  get(iri: string): NodeShapeData | undefined {\n    return this.nodeShapes.get(iri);\n  }\n\n  has(iri: string): boolean {\n    return this.nodeShapes.has(iri);\n  }\n\n  /** Every shape the catalog holds, core's built-ins included. */\n  values(): IterableIterator<NodeShapeData> {\n    return this.nodeShapes.values() as IterableIterator<NodeShapeData>;\n  }\n}\n"]}

package/lib/esm/utils/ShapeClass.d.ts

@@ -3,8 +3,65 @@ import { type NodeShapeData, type PropertyShapeData } from '../shapes/nodeShapeD
 import type { NodeShapeWire } from '../shapes/nodeShapeWire.js';
 import type { ICoreIterable } from '../interfaces/ICoreIterable.js';
 import type { NodeReferenceValue } from './NodeReference.js';
+import type { ShapeCatalog } from './ShapeCatalog.js';
+import { RegistryCache } from './registryCache.js';
+export { RegistryCache };
 /** How many distinct copies of this module are loaded. One is expected. */
 export declare function getShapeRegistryInstanceCount(): number;
+/**
+ * Run `fn` with `catalog` as the shapes every registry accessor reads; `undefined` means
+ * the global registry (explicitly — it does not inherit an outer catalog).
+ *
+ * Synchronous on purpose: it works the same in the browser and in Node, with no
+ * AsyncLocalStorage. Scopes nest, the previous catalog is restored in `finally`, and fn's
+ * value is returned unchanged. A promise returned by fn is not awaited, so its
+ * continuation runs outside the scope. That is why builders and IRs capture their catalog
+ * and every place that picks one up later re-enters it (see docs/architecture/runtime-instances.md).
+ */
+export declare function withShapeCatalog<T>(catalog: ShapeCatalog | undefined, fn: () => T): T;
+/**
+ * Run `fn` with no catalog active, without the promise warning: for core's own calls into a
+ * dataset, whose asynchronous continuation is meant to run outside any catalog. @internal
+ */
+export declare function outsideShapeCatalog<T>(fn: () => T): T;
+/** The catalog of the current `withShapeCatalog` scope, or undefined for the global registry. */
+export declare function getActiveShapeCatalog(): ShapeCatalog | undefined;
+/**
+ * The catalog a builder, a FieldSet or an IR captured — undefined means the global registry.
+ * Reads the object's `catalog` field, which builders keep as a getter and IRs as a
+ * non-enumerable property, so neither appears in `toJSON` or a JSON round trip.
+ */
+export declare function catalogOf(queryOrIr: object | null | undefined): ShapeCatalog | undefined;
+/**
+ * Record `catalog` on an IR object as a non-enumerable `catalog` field, so the code that
+ * compiles it later (often after an `await`) re-enters the catalog it was lowered in.
+ * Nothing is written for the global registry: an IR without the field compiles globally.
+ * @internal
+ */
+export declare function attachCatalog<T extends object>(ir: T, catalog?: ShapeCatalog | undefined): T;
+/** 0 for the global registry, else a process-unique id for the catalog. */
+export declare function shapeCatalogKey(catalog: ShapeCatalog | undefined): number;
+/**
+ * The catalog a builder made from `shape` captures.
+ *
+ * Inside a scope: the active catalog when the root is an IRI (`shape` undefined) or a
+ * shape the catalog holds; otherwise none. A class the active catalog does not hold is
+ * authored code (CN's own shapes, built by CN code while a project scope is active) and
+ * must lower against the global registry. Outside a scope: the catalog that built the
+ * adapter class, if it is one, else none.
+ * @internal
+ */
+export declare function captureCatalog(shape?: {
+    shape?: {
+        id?: string;
+    };
+} | Function | null): ShapeCatalog | undefined;
+/**
+ * Throw when a registry write is attempted inside a catalog scope. A catalog is
+ * immutable, and a write meant for it would land in the global registry instead.
+ * @internal
+ */
+export declare function assertNoActiveCatalog(): void;
 /**
  * The current registration version — a monotonic counter, bumped on every write.
  *
@@ -31,15 +88,11 @@ export declare function registerNodeShape(nodeShape: NodeShapeData): void;
 export declare function getNodeShape(nodeShape: NodeReferenceValue | {
     id: string;
 } | string): NodeShapeData | undefined;
-/** Every registered shape's metadata, keyed by node-shape IRI. */
-export declare function getAllNodeShapes(): ReadonlyMap<string, NodeShapeData>;
 /**
- * A constructor for a shape known only as data, created on first use.
- *
- * Returns undefined when the IRI is not registered at all. Prefer `getShapeClass` when
- * you specifically need an authored class; use this when you need *something*
- * constructor-shaped to drive the query builders.
+ * Every registered shape's metadata, keyed by node-shape IRI. Inside a catalog scope:
+ * exactly the catalog's shapes plus core's built-ins.
  */
+export declare function getAllNodeShapes(): ReadonlyMap<string, NodeShapeData>;
 export declare function getOrCreateShapeAdapter(nodeShape: NodeShapeData | string): typeof Shape | undefined;
 /** Anything that can identify a shape: its metadata, its class, or its IRI. */
 export type ShapeLike = NodeShapeData | typeof Shape | Function | string;
@@ -115,11 +168,23 @@ export declare function addNodeShapeToShapeClass(nodeShape: NodeShapeData, shape
 export declare function resolveShapeConstructor(nodeShape: NodeReferenceValue | {
     id: string;
 } | string): ShapeConstructor | undefined;
+/**
+ * The constructor the query layer resolves an IRI to. In the global registry it is
+ * `getShapeClass` (authored classes only, as always). Inside a catalog, where every shape
+ * but core's built-ins is data, it is the catalog's constructor for any shape it holds.
+ * @internal
+ */
+export declare function getQueryShapeClass(nodeShape: NodeReferenceValue | {
+    id: string;
+} | string): ShapeConstructor | undefined;
 export declare function getShapeClass(nodeShape: NodeReferenceValue | {
     id: string;
 } | string): ShapeConstructor | undefined;
+/** The class registered globally for an IRI, whatever catalog is active. @internal */
+export declare function getRegisteredShapeClass(id: string): typeof Shape | undefined;
 /**
- * Returns all registered shape classes (keyed by NodeShape URI).
+ * Returns all registered shape classes (keyed by NodeShape URI). Inside a catalog scope:
+ * core's built-in classes only — a catalog holds no other class.
  */
 export declare function getAllShapeClasses(): Map<string, typeof Shape>;
 /**