@_linked/core 2.30.1 → 2.32.0

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

@@ -7,14 +7,12 @@
  * ImageObject — would later be deleted with it. Nothing validates `sh:class` on write, so the
  * SPARQL dataset checks it here, before the update is sent.
  *
- * A field is checked when it owns its value by the same rule the replace delete applies: its
- * predicate is a `contains` predicate anywhere in the registry (`collectContainment`), and the
- * property declares a value shape. That includes a plain property of one shape that shares a
- * predicate another shape declares `contains`, since a replace through it deletes the old
- * value just the same. A node is refused only
- * when the store holds at least one `rdf:type` for it and none of them is accepted; an id that
- * does not exist yet, or has no type, is allowed (`rdf:nil`, a node another request creates,
- * an untyped IRI). Collecting the links is a pure walk over the lowered IR; the dataset sends
+ * A field is checked when it owns its value by the same rule the replace delete applies: the
+ * property itself is `contains`, declares a value shape and has a simple path. A plain property
+ * on a predicate another shape declares `contains` owns nothing and is not checked. A node is
+ * refused only when the store holds at least one `rdf:type` for it and none of them is accepted;
+ * an id that does not exist yet, or has no type, is allowed (`rdf:nil`, a node another request
+ * creates, an untyped IRI). Collecting the links is a pure walk over the lowered IR; the dataset sends
  * one SELECT for all distinct ids, and none when there is nothing to check.
  */
 import type { IRCreateMutation, IRUpdateMutation, IRUpdateWhereMutation, IRUpsertMutation } from '../queries/IntermediateRepresentation.js';
@@ -32,8 +30,6 @@ export type OwnedLink = {
     expectedClass: string;
     /** `expectedClass`, every registered sub-shape's targetClass, and `sh:class` if declared. */
     acceptedClasses: string[];
-    /** Set when the property is not `contains` itself but shares this `contains` predicate. */
-    sharedPredicate?: string;
 };
 type OwnedLinkMutation = IRCreateMutation | IRUpdateMutation | IRUpsertMutation | IRUpdateWhereMutation;
 /** Every owned link in a create, update, upsert or update-where mutation. Pure; no I/O. */

package/lib/esm/sparql/ownedLinkCheck.js

@@ -2,7 +2,7 @@ import { findPropertyShapeById } from '../shapes/nodeShapeData.js';
 import { getSubShapes, getTargetClassId } from '../utils/ShapeClass.js';
 import { rdf } from '../ontologies/rdf.js';
 import { assertSafeIri } from './sparqlUtils.js';
-import { collectContainment, isBareNodeReference } from './irToAlgebra.js';
+import { isBareNodeReference } from './irToAlgebra.js';
 import { getSimplePathId } from '../paths/normalizePropertyPath.js';
 import { isSparqlSelectResults } from './resultMapping.js';
 const RDF_NIL = rdf.nil.id;
@@ -39,10 +39,7 @@ function ownedRuleFor(propertyId, fallbackShape, cache) {
 }
 function buildRule(ps, fallbackShape) {
     var _a, _b, _c;
-    if (!(ps === null || ps === void 0 ? void 0 : ps.valueShape))
-        return null;
-    const predicate = getSimplePathId(ps.path);
-    if (!predicate || !collectContainment().containsPreds.includes(predicate))
+    if (!(ps === null || ps === void 0 ? void 0 : ps.contains) || !ps.valueShape || !getSimplePathId(ps.path))
         return null;
     const expectedClass = getTargetClassId(ps.valueShape.id);
     if (!expectedClass)
@@ -55,7 +52,13 @@ function buildRule(ps, fallbackShape) {
     }
     if ((_a = ps.class) === null || _a === void 0 ? void 0 : _a.id)
         accepted.add(ps.class.id);
-    return Object.assign({ property: ps.id, label: ps.label, shape: (_c = (_b = ps.parentNodeShape) === null || _b === void 0 ? void 0 : _b.id) !== null && _c !== void 0 ? _c : fallbackShape, expectedClass, acceptedClasses: [...accepted] }, (ps.contains ? {} : { sharedPredicate: predicate }));
+    return {
+        property: ps.id,
+        label: ps.label,
+        shape: (_c = (_b = ps.parentNodeShape) === null || _b === void 0 ? void 0 : _b.id) !== null && _c !== void 0 ? _c : fallbackShape,
+        expectedClass,
+        acceptedClasses: [...accepted],
+    };
 }
 function walk(data, cache, out) {
     for (const field of data.fields) {
@@ -127,11 +130,7 @@ export function assertOwnedLinkTypes(links, typesById) {
         const alsoAccepted = others.length
             ? ` (or of ${others.map((c) => `<${c}>`).join(', ')}, a registered sub-shape or sh:class)`
             : '';
-        const slot = link.sharedPredicate
-            ? `the property "${link.label}" of <${link.shape}>, whose predicate <${link.sharedPredicate}> ` +
-                'is a contains predicate (another shape owns its values through it)'
-            : `the contains property "${link.label}" of <${link.shape}>`;
-        messages.push(`Cannot link <${link.id}> into ${slot}: ` +
+        messages.push(`Cannot link <${link.id}> into the contains property "${link.label}" of <${link.shape}>: ` +
             `it is typed ${typed}, but "${link.label}" only owns instances of ` +
             `<${link.expectedClass}>${alsoAccepted}. An owner deletes what it contains when the ` +
             'value is replaced or removed, or when the owner is deleted.');

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

@@ -1 +1 @@
-{"version":3,"file":"ownedLinkCheck.js","sourceRoot":"","sources":["../../../src/sparql/ownedLinkCheck.ts"],"names":[],"mappings":"AAgCA,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,kBAAkB,EAAE,mBAAmB,EAAC,MAAM,kBAAkB,CAAC;AACzE,OAAO,EAAC,eAAe,EAAC,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAC,qBAAqB,EAA0B,MAAM,oBAAoB,CAAC;AA2BlF,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,UAAU,CAAA;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,SAAS,GAAG,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,CAAC,SAAS,IAAI,CAAC,kBAAkB,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACvF,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,uBACE,QAAQ,EAAE,EAAE,CAAC,EAAE,EACf,KAAK,EAAE,EAAE,CAAC,KAAK,EACf,KAAK,EAAE,MAAA,MAAA,EAAE,CAAC,eAAe,0CAAE,EAAE,mCAAI,aAAa,EAC9C,aAAa,EACb,eAAe,EAAE,CAAC,GAAG,QAAQ,CAAC,IAC3B,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,eAAe,EAAE,SAAS,EAAC,CAAC,EACpD;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,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe;YAC/B,CAAC,CAAC,iBAAiB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,uBAAuB,IAAI,CAAC,eAAe,IAAI;gBAC7F,oEAAoE;YACtE,CAAC,CAAC,0BAA0B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,GAAG,CAAC;QAC/D,QAAQ,CAAC,IAAI,CACX,gBAAgB,IAAI,CAAC,EAAE,UAAU,IAAI,IAAI;YACvC,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: its\n * predicate is a `contains` predicate anywhere in the registry (`collectContainment`), and the\n * property declares a value shape. That includes a plain property of one shape that shares a\n * predicate another shape declares `contains`, since a replace through it deletes the old\n * value just the same. A node is refused only\n * when the store holds at least one `rdf:type` for it and none of them is accepted; an id that\n * does not exist yet, or has no type, is allowed (`rdf:nil`, a node another request creates,\n * 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 {collectContainment, 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  /** Set when the property is not `contains` itself but shares this `contains` predicate. */\n  sharedPredicate?: 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?.valueShape) return null;\n  const predicate = getSimplePathId(ps.path);\n  if (!predicate || !collectContainment().containsPreds.includes(predicate)) 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    ...(ps.contains ? {} : {sharedPredicate: predicate}),\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    const slot = link.sharedPredicate\n      ? `the property \"${link.label}\" of <${link.shape}>, whose predicate <${link.sharedPredicate}> ` +\n        'is a contains predicate (another shape owns its values through it)'\n      : `the contains property \"${link.label}\" of <${link.shape}>`;\n    messages.push(\n      `Cannot link <${link.id}> into ${slot}: ` +\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,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"]}

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

@@ -25,8 +25,9 @@ export type ShapeConfig = {
      */
     description?: string;
     /**
-     * Marks this shape's instances as *dependent* (composition / no independent existence):
-     * they may be cascade-deleted when reached through a `contains` property.
+     * @deprecated No effect on deletes. Ownership is per property: every node a `contains`
+     * property reaches is deleted with its owner, whether or not its shape is
+     * `dependent`. Still accepted and persisted (`core:dependent`) by shape sync.
      */
     dependent?: boolean;
     /**

package/lib/esm/utils/Package.js

@@ -299,16 +299,14 @@ corePackage.linkedShape({
 corePackage.linkedShape({
     name: 'PropertyShape',
     description: 'Represents a SHACL PropertyShape; specifies rules for one property of a NodeShape (path, datatype, cardinality). (validation rule, property constraint)',
-    // A property shape has no independent existence — it is owned by its NodeShape via the
-    // `contains` sh:property edge, so deleting the NodeShape cascade-deletes it.
-    dependent: true,
+    // Owned by its NodeShape through the `contains` sh:property edge: deleting the NodeShape
+    // deletes it.
 })(PropertyShape);
 // List is registered here, by value, because PropertyShape.in below uses it as its value
 // shape. Naming it by string instead would leave it unregistered for anyone who loads the
 // SHACL metamodel without importing shapes/List (backlog 045).
 corePackage.linkedShape({
     name: 'List',
-    dependent: true,
 })(List);
 // ValidationReport / ValidationResult removed in core metadata rewrite
 //ALL the following is to support Shape having get/set methods with property shapes
@@ -359,12 +357,15 @@ createPropertyShape({
 //currently path accepts multiple values, so its a multi-value property
 //these values will be consequent properties that follow each other. Other property paths are not supported yet.
 createPropertyShape({
-    // No fixed valueShape: sh:path is polymorphic (a predicate IRI, an rdf:List for a
+    // No fixed valueShape: sh:path is polymorphic (a predicate IRI, a PathList for a
     // sequence, or a PathNode for inverse/alt/cardinality). Omitting valueShape lets the
     // create pipeline use each value's own shape. Simple paths are passed as
-    // {id} node references, complex paths as List/PathNode node-data.
+    // {id} node references, complex paths as PathList/PathNode node-data.
     path: shacl.path,
-    contains: true, // a property shape owns its complex path structure (List/PathNode)
+    // Not `contains`: a predicate path is a shared IRI. A complex path's operator node or
+    // sequence list is written without an id, so it becomes a blank node, as SHACL requires,
+    // and the blank-node cascade deletes it with the property shape.
+    nodeKind: shacl.BlankNodeOrIRI,
 }, 'path', shacl.IRI, PropertyShape);
 createPropertyShape({
     path: shacl.node,
@@ -446,7 +447,7 @@ createPropertyShape({ path: coreOntology.displayRank, datatype: xsd.integer, max
 createPropertyShape({ path: coreOntology.displayHidden, datatype: xsd.boolean, maxCount: 1 }, 'displayHidden', shacl.Literal, PropertyShape);
 // PropertyShape.contains (core:contains — persists the composition flag)
 createPropertyShape({ path: coreOntology.contains, datatype: xsd.boolean, maxCount: 1 }, 'contains', shacl.Literal, PropertyShape);
-// NodeShape.closed / ignoredProperties / dependent
+// NodeShape.closed / ignoredProperties / dependent (deprecated, persisted only)
 createPropertyShape({ path: shacl.closed, datatype: xsd.boolean, maxCount: 1 }, 'closed', shacl.Literal, NodeShape);
 createPropertyShape({ path: shacl.ignoredProperties, shape: Shape }, 'ignoredProperties', shacl.IRI, NodeShape);
 createPropertyShape({ path: coreOntology.dependent, datatype: xsd.boolean, maxCount: 1 }, 'dependent', shacl.Literal, NodeShape);
@@ -458,4 +459,16 @@ createPropertyShape({ path: coreOntology.dependent, datatype: xsd.boolean, maxCo
 createPropertyShape({ path: shacl.targetObjectsOf, shape: Shape }, 'targetObjectsOf', shacl.IRI, NodeShape);
 createPropertyShape({ path: coreOntology.generated, datatype: xsd.boolean, maxCount: 1 }, 'generated', shacl.Literal, NodeShape);
 createPropertyShape({ path: coreOntology.generatedShape, shape: NodeShape, contains: true }, 'generatedShapes', shacl.IRI, NodeShape);
+// The terms of the generated single-owner constraint (`singleOwnerConstraint.ts`):
+// `sh:qualifiedValueShape [ sh:or ( [ sh:class A ] [ sh:class B ] ) ]` and
+// `sh:qualifiedMaxCount`. The qualified shape and the `sh:or` list are written without ids, so
+// they are blank nodes, deleted with their property shape by the blank-node cascade. The list
+// cells are `PathList`s (blank-capable `rdf:List` cells); like `sh:path`, `orShapes` declares no
+// value shape (`PathList.ts` imports `package.js`, which loads this module), so the create uses each value's own shape.
+createPropertyShape({ path: shacl.qualifiedValueShape, shape: NodeShape, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI }, 'qualifiedValueShape', shacl.BlankNodeOrIRI, PropertyShape);
+createPropertyShape({ path: shacl.qualifiedMaxCount, datatype: xsd.integer, maxCount: 1 }, 'qualifiedMaxCount', shacl.Literal, PropertyShape);
+createPropertyShape({ path: shacl.class, shape: Shape, maxCount: 1 }, 'class', shacl.IRI, NodeShape);
+createPropertyShape({ path: shacl.or, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI }, 
+// `or` is reserved (a DSL-JSON combinator), so the accessor is `orShapes`.
+'orShapes', shacl.BlankNodeOrIRI, NodeShape);
 //# sourceMappingURL=Package.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"Package.js","sourceRoot":"","sources":["../../../src/utils/Package.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,aAAa,EACb,uBAAuB,EACvB,SAAS,EACT,aAAa,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAC,mBAAmB,EAAqB,MAAM,4BAA4B,CAAC;AACnF,OAAO,EAAC,KAAK,EAAwB,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAC,IAAI,EAAC,MAAM,yBAAyB,CAAC;AAC7C,OAAO,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACnC,OAAO,EAAC,YAAY,EAAC,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,wBAAwB,EAAC,aAAa,EAAC,MAAM,iBAAiB,CAAC;AACvE,OAAO,EAAC,KAAK,EAAC,MAAM,wBAAwB,CAAC;AAC7C,OAAO,EAAC,IAAI,EAAC,MAAM,uBAAuB,CAAC;AAC3C,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AASzC,kEAAkE;AAClE,kDAAkD;AAClD,IAAI,UAAU,GAAa,IAAI,GAAG,EAAE,CAAC;AACrC,IAAI,qBAAqB,GAAG,KAAK,CAAC;AA8KlC,MAAM,CAAC,IAAI,aAAa,GAAG,EAAE,CAAC;AAE9B,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAE/C,aAAa,GAAG,KAAK,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAc;IAEjD,qBAAqB,GAAG,KAAK,CAAC;IAC9B,qEAAqE;IACrE,IAAI,qBAAqB,EACzB,CAAC;QACC,0EAA0E;QAC1E,UAAU,CAAC,OAAO,CAAC,CAAC,cAAc,EAAE,EAAE;YACpC,iFAAiF;YACjF,IAAI,cAAc,CAAC,OAAO,CAAC,EAC3B,CAAC;gBACC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAGD,MAAM,UAAU,aAAa,CAC3B,WAAmB,EACnB,OAA4B;IAG5B,6EAA6E;IAC7E,8EAA8E;IAC9E,6EAA6E;IAC7E,wBAAwB;IACxB,uBAAuB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAC9C,IAAI,eAAe,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;IAC3D,IAAI,iBAAiB,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAE3D,qCAAqC;IACrC,IAAI,qBAAqB,GAAG,UAAS,MAAM;QACzC,sEAAsE;QACtE,qEAAqE;QACrE,mEAAmE;QACnE,kEAAkE;QAClE,0DAA0D;QAC1D,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;IAC1C,CAAC,CAAC;IAEF,IAAI,qBAAqB,GAAG,UAAS,UAAU,EAAC,cAAc;QAC5D,iBAAiB,CAAC,UAAU,CAAC,GAAG,cAAc,CAAC;IACjD,CAAC,CAAC;IAEF,SAAS,qBAAqB,CAAC,OAAO;QAEpC,KAAK,IAAI,GAAG,IAAI,OAAO,CAAC,OAAO,EAC/B,CAAC;YACC,6EAA6E;YAC7E,oDAAoD;YACpD,IACE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI;gBAC1B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,mBAAmB,EAEnD,CAAC;gBACC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAC,MAAM,EAAC,EAAC,KAAK,EAAE,GAAG,EAAC,CAAC,CAAC;gBAChE,wDAAwD;gBACxD,IACE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;oBAChC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAE3C,CAAC;oBACC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,EAAC,MAAM,EAAC;wBAC5D,KAAK,EAAE,GAAG,GAAG,iBAAiB;qBAC/B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,qBAAqB,CAAC,GAAG,EAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,gIAAgI;IAChI,IAAI,UAAU,GAAG,UAAS,WAAW;QACnC,2DAA2D;QAC3D,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAEnC,iDAAiD;QACjD,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC;IAEF,4FAA4F;IAC5F,SAAS,gBAAgB,CACvB,WAAc,EACd,OAAqB;;QAGrB,IAAG,CAAC,WAAW,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,mDAAmD,IAAC,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,GAAG,SAAS,CAAC,CAAC,EAAC,GAAG,CAAC,CAAA,GAAC,GAAG,GAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1I,OAAO;QACT,CAAC;QACD,4DAA4D;QAC5D,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAEnC,uCAAuC;QACvC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAElC,sEAAsE;QACtE,wEAAwE;QACxE,uEAAuE;QACvE,gEAAgE;QAChE,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACpE,WAAmB,CAAC,WAAW,GAAG,WAAW,CAAC;QACjD,CAAC;QAED,0DAA0D;QAC1D,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAC9D,CAAC;YACC,yEAAyE;YACzE,gDAAgD;YAChD,MAAM,SAAS,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,mCAAI,WAAW,CAAC,IAAI,CAAC;YAEpD,yEAAyE;YACzE,wEAAwE;YACxE,uEAAuE;YACvE,yEAAyE;YACzE,wEAAwE;YACxE,yBAAyB;YACzB,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,CAAA,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnD,OAAO,CAAC,IAAI,CACV,mBAAmB,WAAW,CAAC,IAAI,SAAS,WAAW,kCAAkC;oBACvF,iFAAiF;oBACjF,2EAA2E;oBAC3E,qDAAqD,CACxD,CAAC;YACJ,CAAC;YAED,sEAAsE;YACtE,MAAM,SAAS,GAAkB,mBAAmB,CAClD,eAAe,CAAC,WAAW,EAAE,SAAS,CAAC,CACxC,CAAC;YACF,gDAAgD;YAChD,WAAW,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,eAAe;YACf,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;YAE5B,IAAI,OAAO,EACX,CAAC;gBACC,IAAI,OAAO,CAAC,WAAW,EACvB,CAAC;oBACC,SAAS,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;gBAC9C,CAAC;gBACD,IAAI,OAAO,CAAC,SAAS,EACrB,CAAC;oBACC,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;gBAC7B,CAAC;gBACD,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAChC,CAAC;oBACC,SAAS,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;gBACpC,CAAC;gBACD,IAAI,OAAO,CAAC,iBAAiB,EAC7B,CAAC;oBACC,SAAS,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAC;gBAC1D,CAAC;YACH,CAAC;YAED,gEAAgE;YAChE,wBAAwB,CAAC,SAAS,EAAC,WAAW,CAAC,CAAC;YAEhD,2CAA2C;YAC3C,MAAM,mBAAmB,GAAG,MAAM,CAAC,cAAc,CAC/C,WAAW,CACI,CAAC;YAClB,MAAM,cAAc,GAAG,mBAAmB,CAAC,KAAK,CAAC;YACjD,6DAA6D;YAC7D,IAAI,cAAc,IAAI,CAAC,CAAC,mBAAmB,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvD,8CAA8C;gBAC9C,SAAS,CAAC,OAAO,GAAG,EAAC,EAAE,EAAE,cAAc,CAAC,EAAE,EAAC,CAAC;YAC9C,CAAC;YAGD,kDAAkD;YAClD,IAAI,WAAW,CAAC,gBAAgB,CAAC,EACjC,CAAC;gBACC,WAAW,CAAC,gBAAgB,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;oBACjD,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACtB,CAAC,CAAC,CAAC;gBACH,MAAM,aAAa,GAAG,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACzD,IAAG,aAAa,EAAE,CAAC;oBACjB,aAAa,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;wBACjC,QAAQ,CAAC,SAAS,CAAC,CAAC;oBACtB,CAAC,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,WAAW,CAAC,gBAAgB,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;aAED,CAAC;YACC,OAAO,CAAC,IAAI,CAAC,uCAAuC,EAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,WAAW,CAAC,WAAW,EAC3B,CAAC;YACE,WAAW,CAAC,KAAuB,CAAC,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC;QAC7E,CAAC;QAED,kDAAkD;QAClD,sBAAsB;IACxB,CAAC;IAOD,SAAS,WAAW,CAAC,GAAS;QAE5B,wBAAwB;QACxB,IAAI,OAAO,GAAG,KAAK,UAAU,EAC7B,CAAC;YACC,gBAAgB,CAAC,GAAG,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QACD,iDAAiD;QACjD,MAAM,OAAO,GAA4B,GAAG,CAAC;QAC7C,OAAO,UAAkC,WAAc;YACrD,gBAAgB,CAAC,WAAW,EAAC,OAAO,CAAC,CAAC;QACxC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,IAAI,cAAc,GAAG,UACnB,OAAO,EACP,SAA+C,EAC/C,iBAAyB,EACzB,QAAS,EACT,UAA8B;QAE9B,IAAI,WAAW,qBAAO,OAAO,CAAC,CAAC;QAC/B,mFAAmF;QACnF,WAAW,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAC/B,WAAW,CAAC,SAAS,CAAC,GAAG,iBAAiB,CAAC;QAC3C,WAAW,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;QAChC,WAAW,CAAC,OAAO,CAAC,GAAG,UAAU,CAAC;QAElC,iHAAiH;QACjH,IAAI,iBAAiB,EACrB,CAAC;YACC,uJAAuJ;YACvJ,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC5B,mGAAmG;QACnG,qBAAqB,CAAC,iBAAiB,EAAC,WAAW,CAAC,CAAC;QACrD,MAAM;QAEN,IAAI,qBAAqB,EACzB,CAAC;YACC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;gBACvB,OAAO,CAAC,IAAI,CACV,yEAAyE;oBACzE,iBAAiB;oBACjB,YAAY,EACZ,GAAG,CACJ,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC;IAEF;;;;OAIG;IACH,IAAI,eAAe,GAAG,CAAC,IAAY,EAAgC,EAAE;QACnE,6CAA6C;QAC7C,uDAAuD;QACvD,OAAO,aAAa,CAClB,eAAe,CAAC,WAAW,EAAE,IAAI,CAAC,CACnC,CAAC;IACJ,CAAC,CAAC;IAEF,mDAAmD;IACnD,OAAO;QACL,WAAW;QACX,UAAU;QACV,cAAc;QACd,qBAAqB;QACrB,qBAAqB;QACrB,eAAe;QACf,cAAc,EAAE,iBAAiB;QACjC,WAAW,EAAE,WAAW;QACxB,eAAe;KACO,CAAC;AAC3B,CAAC;AAED,SAAS,qBAAqB,CAAC,WAAW,EAAC,cAAe;IAExD,mEAAmE;IACnE,IAAI,WAAW,IAAI,OAAO,CAAC,QAAQ,EACnC,CAAC;QACC,sEAAsE;QACtE,oEAAoE;QACpE,sEAAsE;QACtE,gEAAgE;QAChE,wDAAwD;QACxD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAC,cAAc,CAAC,CAAC;IAC9D,CAAC;SAED,CAAC;QACC,6DAA6D;QAC7D,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,cAAc,IAAI,EAAE,CAAC;IACvD,CAAC;IACD,OAAO,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,uBAAuB,CAAC,WAAmB;IAElD,IAAI,CAAC,OAAO,CAAC,SAAS,EACtB,CAAC;QACC,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC;IACzB,CAAC;IACD,IAAI,WAAW,IAAI,OAAO,CAAC,SAAS,EACpC,CAAC;QACC,OAAO,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,eAAe,GAAoB;QACvC,EAAE,EAAE,aAAa,CAAC,WAAW,CAAC;QAC9B,WAAW;QACX,IAAI,EAAE,YAAY,CAAC,OAAO;KAC3B,CAAC;IACF,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,eAAe,CAAC;IACjD,OAAO,eAAe,CAAC;AACzB,CAAC;AAGD,MAAM,UAAU,QAAQ;IAEtB,IAAI,YAAY,GACd,OAAO,MAAM,KAAK,WAAW;QAC3B,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,OAAO,MAAM,KAAK,WAAW;YAC7B,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,SAAS,CAAC;IAClB,uEAAuE;IACvE,wEAAwE;IACxE,uEAAuE;IACvE,sEAAsE;IACtE,kEAAkE;IAClE,uCAAuC;IACvC,EAAE;IACF,sEAAsE;IACtE,uEAAuE;IACvE,2CAA2C;IAC3C,IAAI,CAAC,CAAC,SAAS,IAAI,YAAY,CAAC,EAChC,CAAC;QACC,YAAY,CAAC,SAAS,CAAC,GAAG,EAAC,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,QAAQ,EAAE,CAAC;AAEX,mFAAmF;AACnF,MAAM,CAAC,MAAM,WAAW,GAAG,aAAa,CAAC,eAAe,CAAC,CAAC;AAC1D,4FAA4F;AAC5F,2FAA2F;AAC3F,kCAAkC;AAClC,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,WAAW;IACjB,WAAW,EACT,sJAAsJ;CACzJ,CAAC,CAAC,SAAS,CAAC,CAAC;AACd,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,WAAW,EACT,yJAAyJ;IAC3J,uFAAuF;IACvF,6EAA6E;IAC7E,SAAS,EAAE,IAAI;CAChB,CAAC,CAAC,aAAa,CAAC,CAAC;AAClB,yFAAyF;AACzF,0FAA0F;AAC1F,+DAA+D;AAC/D,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,IAAI;CAChB,CAAC,CAAC,IAAI,CAAC,CAAC;AACT,uEAAuE;AAEvE,mFAAmF;AACnF,qCAAqC;AACrC,8FAA8F;AAC9F,oEAAoE;AACpE,+EAA+E;AAC/E,KAAK,CAAC,KAAK,GAAG,mBAAmB,CAC/B,eAAe,CAAC,eAAe,EAAE,OAAO,CAAC,CAC1C,CAAC;AACF,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAC,KAAK,CAAC,CAAC;AAE5C,+DAA+D;AAC/D,+EAA+E;AAC/E,mBAAmB,CAAC;IAChB,IAAI,EAAE,IAAI,CAAC,KAAK;IAChB,0CAA0C;IAC1C,QAAQ,EAAE,CAAC,EAAC,6DAA6D;CAC1E,EACD,OAAO,EACP,KAAK,CAAC,OAAO,EACb,KAAK,CACN,CAAC;AACF,mBAAmB,CACjB;IACE,IAAI,EAAE,GAAG,CAAC,IAAI;IACd,KAAK,EAAE,KAAK;CACb,EACD,MAAM,EACN,KAAK,CAAC,GAAG,EACT,KAAK,CACN,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,aAAa;IACpB,QAAQ,EAAE,IAAI,EAAE,2DAA2D;CAC5E,EACD,YAAY,EACZ,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AAEF,mBAAmB,CAAC;IACd,IAAI,EAAE,IAAI,CAAC,OAAO;IAClB,QAAQ,EAAE,CAAC;CACZ,EAAC,aAAa,EAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;AAE9C,mBAAmB,CAAC;IAClB,IAAI,EAAE,GAAG,CAAC,IAAI;IACd,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,KAAK;CACb,EAAC,MAAM,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAE/B,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,WAAW;IACvB,KAAK,EAAE,KAAK,EAAE,qIAAqI;IACnJ,QAAQ,EAAE,CAAC;CACZ,EACD,aAAa,EACb,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AAEF,mBAAmB,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC,UAAU;IACtB,KAAK,EAAE,KAAK,EAAC,+HAA+H;CAC7I,EAAC,YAAY,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAErC,mBAAmB,CAAC;IAClB,IAAI,EAAE,YAAY,CAAC,WAAW;IAC9B,KAAK,EAAE,SAAS;CACjB,EAAC,SAAS,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAElC,uEAAuE;AACvE,gHAAgH;AAChH,mBAAmB,CACjB;IACE,kFAAkF;IAClF,qFAAqF;IACrF,yEAAyE;IACzE,kEAAkE;IAClE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,QAAQ,EAAE,IAAI,EAAE,mEAAmE;CACpF,EACD,MAAM,EACN,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,KAAK,EAAE,SAAS;IAChB,QAAQ,EAAE,CAAC;CACZ,EACD,YAAY,EACZ,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,KAAK,EAAE,0FAA0F;CACzG,EACD,UAAU,EACV,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,KAAK;IACZ,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,wBAAwB;AACxB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,QAAQ,EAAE,GAAG,CAAC,OAAO;IACrB,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,wBAAwB;AACxB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,QAAQ,EAAE,GAAG,CAAC,OAAO;IACrB,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,oBAAoB;AACpB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,QAAQ,EAAE,CAAC;CACZ,EACD,MAAM,EACN,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,2BAA2B;AAC3B,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,WAAW;IACvB,QAAQ,EAAE,CAAC;CACZ,EACD,aAAa,EACb,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,8EAA8E;AAC9E,gEAAgE;AAChE,gFAAgF;AAChF,yFAAyF;AACzF,8EAA8E;AAE9E,sBAAsB;AACtB,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC9C,OAAO,EACP,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,yCAAyC;AACzC,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,EAC1D,IAAI,EACJ,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,4DAA4D;AAC5D,sFAAsF;AACtF,wFAAwF;AACxF,wEAAwE;AACxE,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,kBAAkB,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AACnH,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC7G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC7G,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,gBAAgB,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EACzD,kBAAkB,EAClB,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,oDAAoD;AACpD,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AAE1F,2EAA2E;AAC3E,8EAA8E;AAC9E,gFAAgF;AAChF,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AAElG,uFAAuF;AACvF,yFAAyF;AACzF,6FAA6F;AAC7F,sCAAsC;AACtC,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC3D,WAAW,EACX,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC3D,WAAW,EACX,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAC,EACxD,SAAS,EACT,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,8BAA8B;AAC9B,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACvD,OAAO,EACP,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAE7F,wEAAwE;AACxE,kFAAkF;AAClF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,WAAW,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACpE,aAAa,EACb,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,aAAa,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACtE,eAAe,EACf,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,yEAAyE;AACzE,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACjE,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,mDAAmD;AACnD,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACxD,QAAQ,EACR,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,iBAAiB,EAAE,KAAK,EAAE,KAAK,EAAC,EAC7C,mBAAmB,EACnB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAClE,WAAW,EACX,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AAEF,8EAA8E;AAC9E,mFAAmF;AACnF,yFAAyF;AACzF,4FAA4F;AAC5F,uDAAuD;AACvD,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,KAAK,EAAC,EAC3C,iBAAiB,EACjB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAClE,WAAW,EACX,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,cAAc,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAC,EACrE,iBAAiB,EACjB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport {\n  createPropertyShape,\n  getAndClearCallbacks,\n  getNodeShapeUri,\n  getPackageUri,\n  setPackagePublishConfig,\n  NodeShape,\n  PropertyShape,\n} from '../shapes/SHACL.js';\nimport {createNodeShapeData, type NodeShapeData} from '../shapes/nodeShapeData.js';\nimport {Shape, type ShapeConstructor} from '../shapes/Shape.js';\nimport {List} from '../shapes/List.class.js';\nimport {Prefix} from './Prefix.js';\nimport {coreOntology} from '../ontologies/linked-core.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {addNodeShapeToShapeClass,getShapeClass} from './ShapeClass.js';\nimport {shacl} from '../ontologies/shacl.js';\nimport {rdfs} from '../ontologies/rdfs.js';\nimport {xsd} from '../ontologies/xsd.js';\nimport type {NodeReferenceValue} from './NodeReference.js';\n\n//global tree\ndeclare var _linked: any;\ndeclare var window;\ndeclare var global;\n\n\n// var packageParsePromises: Map<string,Promise<any>> = new Map();\n// var loadedPackages: Set<NamedNode> = new Set();\nlet ontologies: Set<any> = new Set();\nlet _autoLoadOntologyData = false;\n/**\n * a map of requested property shapes for specific nodes\n * The value is a promise if it's still loading, or true if it is fully loaded\n */\n// type ClassDecorator = <T extends {new (...args: any[]): {}}>(\n//   constructor: T,\n// ) => T;\n\nexport type ShapeConfig = {\n  /**\n   * The name this shape is identified by, overriding the class name.\n   *\n   * A shape's IRI is `<baseUri>shape/<package>/<name>`, and `Server.call`\n   * routes on it — so the name is persisted data, not a label. Taking it from\n   * `constructor.name` couples that data to how the code was compiled: a\n   * minifier renames the class, and so does a plain name collision, because a\n   * shape and the ontology term it targets deliberately share a name. Either\n   * one silently changes what the shape *is*.\n   *\n   * Optional, and defaults to `constructor.name`, so existing shapes are\n   * unaffected. Set it where the identity has to outlive the build.\n   */\n  name?: string;\n  /**\n   * A short description of the shape, what it represents and what it is used for.\n   * will be stored as rdfs:comment on the shape node\n   */\n  description?: string;\n  /**\n   * Marks this shape's instances as *dependent* (composition / no independent existence):\n   * they may be cascade-deleted when reached through a `contains` property.\n   */\n  dependent?: boolean;\n  /**\n   * Close the shape (sh:closed): target nodes with properties outside this shape are invalid.\n   */\n  closed?: boolean;\n  /**\n   * Properties permitted in addition to the declared ones when the shape is closed\n   * (sh:ignoredProperties).\n   */\n  ignoredProperties?: NodeReferenceValue[];\n};\n\nexport type PackageMetadata = {\n  id: string;\n  packageName: string;\n  type: NodeReferenceValue;\n};\n\n/**\n * This object, returned by [linkedPackage()](/docs/lincd.js/modules/utils_Module#linkedPackage),\n * contains the decorators to link different parts of a LINCD module.\n */\nexport interface LinkedPackageObject\n{\n  /**\n   * Links a typescript class to a SHACL shape.\n   * This decorator creates a SHACL shape and looks at the static property [targetClass](/docs/lincd.js/classes/shapes_Shape.Shape#targetclass)\n   * The rest of the shape is typically 'shaped' by methods that use [property decorators](/docs/lincd.js/modules/utils_ShapeDecorators).\n   *\n   * @example\n   * Example of a typescript class using the \\@linkedShape decorator:\n   * ```tsx\n   * @linkedShape\n   * export class Person extends Shape { ... }\n   * ```\n   * Or with options:\n   * ```tsx\n   * @linkedShape({ description: \"...\" })\n   * export class Person extends Shape { ... }\n   * ```\n   */\n  linkedShape: {\n    <T extends typeof Shape>(constructor: T): void;\n    <T extends typeof Shape>(config?: ShapeConfig): (constructor: T) => void;\n  };\n  /**\n   * Use this decorator to make any other classes or functions available on demand to other LINCD modules.\n   * It does not change the object it is applied on.\n   * This is specifically required for their use in an open-ended LINCD application.\n   *\n   * @example\n   * An example helper utility using the \\@linkedUtil decorator:\n   * ```tsx\n   * @linkedUtil\n   * export class Sort {\n   *   static byName(persons:Person[]) {\n   *     return persons.sort((p1,p2) => p1.name < p2.name ? -1 : 1)\n   *   }\n   * ```\n   */\n  linkedUtil: (constructor: any) => any;\n  /**\n   * Used to notify LINCD.js of an ontology.\n   * See also the [Ontology guides](/docs/guides/linked-code/ontologies).\n   *\n   * @param allFileExports - all the objects that are exported by the ontology file (use `import * as _this from \"./path-to-this-file\")`)\n   * @param nameSpace - the result of [createNameSpace](/docs/lincd.js/modules/utils_NameSpace#createnamespace). This allows consumers to generate NamedNodes that may not be listed in this ontology if needed\n   * @param prefixAndFileName - a suggested prefix chosen by you. Make sure the suggestedPrefix matches the file name and the name of the exported object that groups all entities together\n   * @param loadDataFunction - a method that loads _and parses_ the raw ontology data. This means the ontology will be loaded into the local graph. The returned result is mostly a JSONLDParsePromise (from lincd-jsonld/JSONLD, not bundled in LINCD.js)\n   * @param dataSource - the relative path to the raw data of the ontology\n   * @example\n   * Example of an Ontology File that used linkedOntology()\n   * ```tsx\n   * import {NamedNode} from 'lincd/models';\n   * import {JSONLD} from 'lincd-jsonld/JSONLD';\n   * import {createNameSpace} from 'lincd/utils/NameSpace';\n   * import {linkedOntology} from '../package.js';\n   * import * as _this from './my.js-ontology';\n   *\n   * let dataFile = '../data/my.js-ontology.json';\n   * export var loadData = () => JSONLD.parsePromise(import(dataFile));\n   *\n   * export var ns = createNameSpace('http://www.my-ontology.com/');\n   *\n   * export var _self: NamedNode = ns('');\n   *\n   * // Classes\n   * export var ExampleClass: NamedNode = ns('ExampleClass');\n   *\n   * // Properties\n   * export var exampleProperty: NamedNode = ns('exampleProperty');\n   *\n   * export const myOntology = {\n   *   ExampleClass,\n   *   exampleProperty,\n   * };\n   *\n   * linkedOntology(_this, ns, 'myOntology', loadData, dataFile);\n   * ```\n   */\n  linkedOntology: (\n    allFileExports,\n    nameSpace: (term: string) => NodeReferenceValue,\n    suggestedPrefixAndFileName: string,\n    loadDataFunction?: () => Promise<any>,\n    dataSource?: string | string[],\n  ) => void;\n  /**\n   * Low level method used by other decorators to write to the modules' object in the LINCD tree.\n   * You should typically not need this.\n   * @param exportFileName - the file name that this exported object is available under. Needs to be unique across the module.\n   * @param exportedObject - the exported object (the class, constant, function, etc)\n   */\n  registerPackageExport: (exportedObject: any) => void;\n\n  /**\n   * Get a Shape subclass registered in this package by name.\n   * Returns undefined if the shape is not registered or bundled.\n   *\n   * Useful for avoiding circular dependencies between shapes.\n   * E.g. `getOneAs(..., getPackageShape('ImageObject'))` in Thing.ts\n   * avoids importing ImageObject (which extends Thing).\n   */\n  getPackageShape: (name: string) => ShapeConstructor | undefined;\n  /**\n   * A reference to the modules' object in the LINCD tree.\n   * Contains all linked components of the module.\n   */\n  packageExports: any;\n  packageName: string;\n  packageMetadata: PackageMetadata;\n\n  /**\n   * Register a file (a javascript module) and all its exported objects.\n   * Specifically helpful for registering multiple functional components if you declare them without a function name\n   * @param _this\n   * @param _module\n   */\n  registerPackageModule(_module): void;\n}\n\nexport var DEFAULT_LIMIT = 12;\n\nexport function setDefaultPageLimit(limit: number)\n{\n  DEFAULT_LIMIT = limit;\n}\n\nexport function autoLoadOntologyData(value: boolean)\n{\n  _autoLoadOntologyData = value;\n  //this may be set to true after some ontologies have already indexed,\n  if (_autoLoadOntologyData)\n  {\n    // so in that case we load all data of ontologies that are already indexed\n    ontologies.forEach((ontologyExport) => {\n      //see linkedOntology() where we store the data loading method under the _load key\n      if (ontologyExport['_load'])\n      {\n        ontologyExport['_load']();\n      }\n    });\n  }\n}\n\n\nexport function linkedPackage(\n  packageName: string,\n  options?: {baseUri?: string},\n): LinkedPackageObject\n{\n  // Declare the package's publish root before any shape/metadata IRI is built.\n  // The slug is derived from `packageName`; only `baseUri` is configurable — CN\n  // injects a workspace-scoped root for private packages, first-party packages\n  // default to linked.cm.\n  setPackagePublishConfig(packageName, options);\n  let packageMetadata = registerPackageMetadata(packageName);\n  let packageTreeObject = registerPackageInTree(packageName);\n\n  //#Create declarators for this module\n  let registerPackageExport = function(object) {\n    // Plan-011 §I2 interim — \"Key X was already defined\" warning silenced\n    // until the duplicate-instance root cause is investigated. With Vite\n    // SSR resolving workspace packages from src/, package.ts evaluates\n    // twice and every export key trips this warning. The overwrite is\n    // safe because the second registration is the same class.\n    packageTreeObject[object.name] = object;\n  };\n\n  let registerInPackageTree = function(exportName,exportedObject) {\n    packageTreeObject[exportName] = exportedObject;\n  };\n\n  function registerPackageModule(_module): void\n  {\n    for (var key in _module.exports)\n    {\n      //if the exported object itself is not named or its name is _wrappedComponent\n      //then we give it the same name as it's export name.\n      if (\n        !_module.exports[key].name ||\n        _module.exports[key].name === '_wrappedComponent'\n      )\n      {\n        Object.defineProperty(_module.exports[key],'name',{value: key});\n        //manual 'hack' to set the name of the original function\n        if (\n          _module.exports[key]['original'] &&\n          !_module.exports[key]['original']['name']\n        )\n        {\n          Object.defineProperty(_module.exports[key]['original'],'name',{\n            value: key + '_implementation',\n          });\n        }\n      }\n      registerInPackageTree(key,_module.exports[key]);\n    }\n  }\n\n  //create a declarator function which Components of this module can use register themselves and add themselves to the global tree\n  let linkedUtil = function(constructor) {\n    //add the component class of this module to the global tree\n    registerPackageExport(constructor);\n\n    //return the original class without modifications\n    return constructor;\n  };\n\n  // helper that contains the previous body; applies the decorator work to a given constructor\n  function applyLinkedShape<T extends typeof Shape>(\n    constructor: T,\n    options?: ShapeConfig,\n  ): void\n  {\n    if(!constructor) {\n      throw new Error('Constructor is undefined, skipping registration: '+constructor?.toString().substring(0,100)+' '+JSON.stringify(options));\n      return;\n    }\n    // add the component class of this module to the global tree\n    registerPackageExport(constructor);\n\n    // register the component and its shape\n    Shape.registerByType(constructor);\n\n    // Track the un-sanitized package name on the constructor so consumers\n    // (e.g. LincdServerProxy) can route backend calls using the real module\n    // specifier (e.g. '@_linked/server'), not the lossy URI-sanitized form\n    // ('-_linked-server' — non-recoverable via decodeURIComponent).\n    if (!Object.getOwnPropertyNames(constructor).includes('packageName')) {\n      (constructor as any).packageName = packageName;\n    }\n\n    // if no shape object has been attached to the constructor\n    if (!Object.getOwnPropertyNames(constructor).includes('shape'))\n    {\n      // The shape's identity. An explicit name wins; otherwise the class name,\n      // which is what every existing shape relies on.\n      const shapeName = options?.name ?? constructor.name;\n\n      // A class name ending in a digit, with no explicit name given, is almost\n      // always a bundler disambiguating a collision — `BackendAPIStore2` when\n      // the ontology term of the same name took the binding first. The shape\n      // then registers under an IRI the rest of the system will never ask for,\n      // and the only symptom is a 501 several layers away. Say so here, where\n      // it is cheap and early.\n      if (!options?.name && /\\d$/.test(constructor.name)) {\n        console.warn(\n          `[linked] Shape '${constructor.name}' in '${packageName}' has a name ending in a digit, ` +\n            `which usually means a bundler renamed it to avoid a collision — often with the ` +\n            `ontology term it targets. Its IRI will not match what consumers ask for. ` +\n            `Pass an explicit name: @linkedShape({name: '...'}).`,\n        );\n      }\n\n      // create a new node shape (plain metadata object) for this shapeClass\n      const nodeShape: NodeShapeData = createNodeShapeData(\n        getNodeShapeUri(packageName, shapeName),\n      );\n      // connect the typescript class to its NodeShape\n      constructor.shape = nodeShape;\n      // set the name\n      nodeShape.label = shapeName;\n\n      if (options)\n      {\n        if (options.description)\n        {\n          nodeShape.description = options.description;\n        }\n        if (options.dependent)\n        {\n          nodeShape.dependent = true;\n        }\n        if (options.closed !== undefined)\n        {\n          nodeShape.closed = options.closed;\n        }\n        if (options.ignoredProperties)\n        {\n          nodeShape.ignoredProperties = options.ignoredProperties;\n        }\n      }\n\n      // also keep track of the reverse: nodeShape to typescript class\n      addNodeShapeToShapeClass(nodeShape,constructor);\n\n      //track what extends what (nodeShape level)\n      const extendingShapeClass = Object.getPrototypeOf(\n        constructor,\n      ) as typeof Shape;\n      const extendingShape = extendingShapeClass.shape;\n      //if this shape class is extending something other then Shape\n      if (extendingShape && !(extendingShapeClass === Shape)) {\n        //store which nodeShape this nodeShape extends\n        nodeShape.extends = {id: extendingShape.id};\n      }\n      \n\n      // run deferred callbacks from property decorators\n      if (constructor['shapeCallbacks'])\n      {\n        constructor['shapeCallbacks'].forEach((callback) => {\n          callback(nodeShape);\n        });\n        const nodeCallbacks = getAndClearCallbacks(nodeShape.id);\n        if(nodeCallbacks) {\n          nodeCallbacks.forEach((callback) => {\n            callback(nodeShape);\n          });\n        }\n        delete constructor['shapeCallbacks'];\n      }\n    }\n    else\n    {\n      console.warn('This ShapeClass already has a shape: ',constructor.shape);\n    }\n\n    if (constructor.targetClass)\n    {\n      (constructor.shape as NodeShapeData).targetClass = constructor.targetClass;\n    }\n\n    // return the original class without modifications\n    // return constructor;\n  }\n\n  // Overloaded signatures to support both usages\n  function linkedShape<T extends typeof Shape>(constructor: T): void;\n  function linkedShape<T extends typeof Shape>(\n    options?: ShapeConfig,\n  ): (constructor: T) => void;\n  function linkedShape(arg?: any): void | ((constructor: any) => void)\n  {\n    // usage as @linkedShape\n    if (typeof arg === 'function')\n    {\n      applyLinkedShape(arg);\n      return;\n    }\n    // usage as @linkedShape({...}) or @linkedShape()\n    const options: ShapeConfig | undefined = arg;\n    return function <T extends typeof Shape>(constructor: T): void {\n      applyLinkedShape(constructor,options);\n    };\n  }\n\n  /**\n   *\n   * @param exports all exports of the file, simply provide \"this\" as value!\n   * @param dataSource the path leading to the ontology's data file\n   * @param nameSpace the base URI of the ontology\n   * @param prefixAndFileName the file name MUST match the prefix for this ontology\n   */\n  let linkedOntology = function(\n    exports,\n    nameSpace: (term: string) => NodeReferenceValue,\n    prefixAndFileName: string,\n    loadData?,\n    dataSource?: string | string[],\n  ) {\n    let exportsCopy = {...exports};\n    //store specifics in exports. And make sure we can detect this as an ontology later\n    exportsCopy['_ns'] = nameSpace;\n    exportsCopy['_prefix'] = prefixAndFileName;\n    exportsCopy['_load'] = loadData;\n    exportsCopy['_data'] = dataSource;\n\n    //register the prefix here (so just calling linkedOntology with a prefix will automatically register that prefix)\n    if (prefixAndFileName)\n    {\n      //run the namespace without any term name, this will give back a named node with just the namespace as URI, then get that URI to provide it as full URI\n      Prefix.add(prefixAndFileName,nameSpace('').id);\n    }\n\n    ontologies.add(exportsCopy);\n    //register all the exports under the prefix. NOTE: this means the file name HAS to match the prefix\n    registerInPackageTree(prefixAndFileName,exportsCopy);\n    // });\n\n    if (_autoLoadOntologyData)\n    {\n      loadData().catch((err) => {\n        console.warn(\n          'Could not load ontology data. Do you need to rebuild the module of the ' +\n          prefixAndFileName +\n          ' ontology?',\n          err,\n        );\n      });\n    }\n  };\n\n  /**\n   * This method is used to get a shape class in this package by its name.\n   * This can be used to avoid circular dependencies between shapes.\n   * @param name\n   */\n  let getPackageShape = (name: string): ShapeConstructor | undefined => {\n    //get the named node of the node shape first,\n    //then get the shape class that defines this node shape\n    return getShapeClass(\n      getNodeShapeUri(packageName, name),\n    );\n  };\n\n  //return the declarators so the module can use them\n  return {\n    linkedShape,\n    linkedUtil,\n    linkedOntology,\n    registerPackageExport,\n    registerPackageModule,\n    getPackageShape,\n    packageExports: packageTreeObject,\n    packageName: packageName,\n    packageMetadata,\n  } as LinkedPackageObject;\n}\n\nfunction registerPackageInTree(packageName,packageExports?)\n{\n  //if something with this name already registered in the global tree\n  if (packageName in _linked._modules)\n  {\n    // Plan-011 §I2 interim — silenced until the duplicate-Linked-instance\n    // root cause is investigated. Vite SSR resolving workspace packages\n    // from src/ for HMR causes each package.ts to evaluate twice, so this\n    // warning fired ~80x per boot. Same package, same exports — the\n    // Object.assign below preserves the registry correctly.\n    Object.assign(_linked._modules[packageName],packageExports);\n  }\n  else\n  {\n    //initiate an empty object for this module in the global tree\n    _linked._modules[packageName] = packageExports || {};\n  }\n  return _linked._modules[packageName];\n}\n\nfunction registerPackageMetadata(packageName: string): PackageMetadata\n{\n  if (!_linked._packages)\n  {\n    _linked._packages = {};\n  }\n  if (packageName in _linked._packages)\n  {\n    return _linked._packages[packageName];\n  }\n  const packageMetadata: PackageMetadata = {\n    id: getPackageUri(packageName),\n    packageName,\n    type: coreOntology.Package,\n  };\n  _linked._packages[packageName] = packageMetadata;\n  return packageMetadata;\n}\n\n\nexport function initTree()\n{\n  let globalObject =\n    typeof window !== 'undefined'\n      ? window\n      : typeof global !== 'undefined'\n        ? global\n        : undefined;\n  // Idempotent: if the global tree is already set up (by another copy of\n  // this Package.ts in the same Node process — structural under Vite SSR,\n  // which evaluates the file once for its own SSR transform AND once via\n  // Node's resolver when a non-Vite import path reaches @_linked/core),\n  // attach to it instead of throwing. Both instances write the same\n  // _modules / _packages registry shape.\n  //\n  // Legacy `lincd` package's Package.ts (separate file) still throws on\n  // dup — that throw signals a REAL problem (legacy `lincd` should never\n  // load in a clean post-eradication state).\n  if (!('_linked' in globalObject))\n  {\n    globalObject['_linked'] = {_modules: {}, _packages: {}};\n  }\n}\n\n//when this file is used, make sure the tree is initialized\ninitTree();\n\n//now that this file is set up, we can link linked shapes in the core module itself\nexport const corePackage = linkedPackage('@_linked/core');\n// NodeShape, PropertyShape and List share their names with ontology terms (shacl.NodeShape,\n// shacl.PropertyShape, rdf.List), so a bundler may rename the classes. Explicit names keep\n// their IRIs independent of that.\ncorePackage.linkedShape({\n  name: 'NodeShape',\n  description:\n    'Represents a SHACL NodeShape; defines constraints for a class of RDF nodes. Links to multiple PropertyShapes. (schema, constraint, class validation)',\n})(NodeShape);\ncorePackage.linkedShape({\n  name: 'PropertyShape',\n  description:\n    'Represents a SHACL PropertyShape; specifies rules for one property of a NodeShape (path, datatype, cardinality). (validation rule, property constraint)',\n  // A property shape has no independent existence — it is owned by its NodeShape via the\n  // `contains` sh:property edge, so deleting the NodeShape cascade-deletes it.\n  dependent: true,\n})(PropertyShape);\n// List is registered here, by value, because PropertyShape.in below uses it as its value\n// shape. Naming it by string instead would leave it unregistered for anyone who loads the\n// SHACL metamodel without importing shapes/List (backlog 045).\ncorePackage.linkedShape({\n  name: 'List',\n  dependent: true,\n})(List);\n// ValidationReport / ValidationResult removed in core metadata rewrite\n\n//ALL the following is to support Shape having get/set methods with property shapes\n//and Shape itself having a nodeShape\n//if we dont need Shape to have get/set methods (like label and type) then this can be removed\n// Base Shape IRI follows the same scheme as every other core shape:\n// https://linked.cm/shape/core/Shape (corePackage above declared slug 'core').\nShape.shape = createNodeShapeData(\n  getNodeShapeUri('@_linked/core', 'Shape'),\n);\naddNodeShapeToShapeClass(Shape.shape,Shape);\n\n//Here we can register the properties of the Shape class itself\n//We can't do that inside of Shape because it would cause circular dependencies\ncreatePropertyShape({\n    path: rdfs.label,\n    //TODO: multiple labels should be possible\n    maxCount: 1,//currently get label is implemented to return a single value\n  },\n  'label',\n  shacl.Literal,\n  Shape,\n);\ncreatePropertyShape(\n  {\n    path: rdf.type,\n    shape: Shape,\n  },\n  'type',\n  shacl.IRI,\n  Shape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.property,\n    shape: PropertyShape,\n    contains: true, // a NodeShape owns its property shapes (cascade on delete)\n  },\n  'properties',\n  shacl.IRI,\n  NodeShape,\n);\n\ncreatePropertyShape({\n      path: rdfs.comment,\n      maxCount: 1,\n    },'description',shacl.Literal, NodeShape);\n\ncreatePropertyShape({\n  path: rdf.type,\n  maxCount: 1,\n  shape: Shape,\n},'type',shacl.IRI, NodeShape);\n\ncreatePropertyShape(\n  {\n    path: shacl.targetClass,\n    shape: Shape, //should be rdfs Class, but that's currently not available in LINCD. So queries currently cannot continue after accessing targetClass\n    maxCount: 1,\n  },\n  'targetClass',\n  shacl.IRI,\n  NodeShape,\n);\n\ncreatePropertyShape({\n  path: shacl.targetNode,\n  shape: Shape,//actually returns a NamedNode... is this correct then? Should we define or use a rdfs Class that matches the potential values?\n},'targetNode',shacl.IRI, NodeShape);\n\ncreatePropertyShape({\n  path: coreOntology.isExtending,\n  shape: NodeShape,\n},'extends',shacl.IRI, NodeShape);\n\n//currently path accepts multiple values, so its a multi-value property\n//these values will be consequent properties that follow each other. Other property paths are not supported yet.\ncreatePropertyShape(\n  {\n    // No fixed valueShape: sh:path is polymorphic (a predicate IRI, an rdf:List for a\n    // sequence, or a PathNode for inverse/alt/cardinality). Omitting valueShape lets the\n    // create pipeline use each value's own shape. Simple paths are passed as\n    // {id} node references, complex paths as List/PathNode node-data.\n    path: shacl.path,\n    contains: true, // a property shape owns its complex path structure (List/PathNode)\n  },\n  'path',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.node,\n    shape: NodeShape,\n    maxCount: 1,\n  },\n  'valueShape',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    maxCount: 1,\n    path: shacl.nodeKind,\n    shape: Shape, //actually returns a NamedNode. Queries currently cannot continue after accessing nodeKind\n  },\n  'nodeKind',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.datatype,\n    shape: Shape,\n    maxCount: 1,\n  },\n  'datatype',\n  shacl.IRI,\n  PropertyShape,\n);\n\n//PropertyShape.maxCount\ncreatePropertyShape(\n  {\n    path: shacl.maxCount,\n    datatype: xsd.integer,\n    maxCount: 1,\n  },\n  'maxCount',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.minCount\ncreatePropertyShape(\n  {\n    path: shacl.minCount,\n    datatype: xsd.integer,\n    maxCount: 1,\n  },\n  'minCount',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.name\ncreatePropertyShape(\n  {\n    path: shacl.name,\n    maxCount: 1,\n  },\n  'name',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.description\ncreatePropertyShape(\n  {\n    path: shacl.description,\n    maxCount: 1,\n  },\n  'description',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// ---------------------------------------------------------------------------\n// Remaining SHACL meta-model accessors for shape serialization.\n// Labels match the PropertyShapeData / NodeShapeData fields so syncShapes() can\n// build the create-pipeline data directly. `sh:in` is owned (contains, valueShape List).\n// ---------------------------------------------------------------------------\n\n// PropertyShape.class\ncreatePropertyShape(\n  {path: shacl.class, shape: Shape, maxCount: 1},\n  'class',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape.in → an rdf:List (owned)\ncreatePropertyShape(\n  {path: shacl.in, shape: List, maxCount: 1, contains: true},\n  'in',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape pair constraints (values are property IRIs)\n// Labelled `equalsConstraint`, not `equals`: `equals` is a query-builder method, so a\n// property under that label is unreachable through the DSL (backlog 041). The name also\n// matches the `PropertyShapeData` field. The predicate stays sh:equals.\ncreatePropertyShape({path: shacl.equals, shape: Shape, maxCount: 1}, 'equalsConstraint', shacl.IRI, PropertyShape);\ncreatePropertyShape({path: shacl.disjoint, shape: Shape, maxCount: 1}, 'disjoint', shacl.IRI, PropertyShape);\ncreatePropertyShape({path: shacl.lessThan, shape: Shape, maxCount: 1}, 'lessThan', shacl.IRI, PropertyShape);\ncreatePropertyShape(\n  {path: shacl.lessThanOrEquals, shape: Shape, maxCount: 1},\n  'lessThanOrEquals',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape.hasValue (literal or IRI — generic)\ncreatePropertyShape({path: shacl.hasValue, maxCount: 1}, 'hasValue', null, PropertyShape);\n\n// PropertyShape.defaultValue (literal or IRI — generic, mirrors hasValue).\n// getResult() already emits `defaultValue`, but without this registration the\n// property is not queryable and a query referencing it throws before executing.\ncreatePropertyShape({path: shacl.defaultValue, maxCount: 1}, 'defaultValue', null, PropertyShape);\n\n// PropertyShape value-range / string-length / pattern constraints (report 021 §3, G5).\n// The range constraints carry no fixed datatype — the literal is typed from the JS value\n// (integer/double), mirroring the constrained property's own datatype. Length is an integer;\n// pattern is the regex source string.\ncreatePropertyShape({path: shacl.minInclusive, maxCount: 1}, 'minInclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.maxInclusive, maxCount: 1}, 'maxInclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.minExclusive, maxCount: 1}, 'minExclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.maxExclusive, maxCount: 1}, 'maxExclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape(\n  {path: shacl.minLength, datatype: xsd.integer, maxCount: 1},\n  'minLength',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.maxLength, datatype: xsd.integer, maxCount: 1},\n  'maxLength',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.pattern, datatype: xsd.string, maxCount: 1},\n  'pattern',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// PropertyShape.order / group\ncreatePropertyShape(\n  {path: shacl.order, datatype: xsd.integer, maxCount: 1},\n  'order',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape({path: shacl.group, maxCount: 1}, 'group', shacl.Literal, PropertyShape);\n\n// PropertyShape.displayRank / displayHidden (core: display vocabulary).\n// These materialize onto the pure sh:NodeShape and so travel with an ejected app.\ncreatePropertyShape(\n  {path: coreOntology.displayRank, datatype: xsd.integer, maxCount: 1},\n  'displayRank',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.displayHidden, datatype: xsd.boolean, maxCount: 1},\n  'displayHidden',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// PropertyShape.contains (core:contains — persists the composition flag)\ncreatePropertyShape(\n  {path: coreOntology.contains, datatype: xsd.boolean, maxCount: 1},\n  'contains',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// NodeShape.closed / ignoredProperties / dependent\ncreatePropertyShape(\n  {path: shacl.closed, datatype: xsd.boolean, maxCount: 1},\n  'closed',\n  shacl.Literal,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: shacl.ignoredProperties, shape: Shape},\n  'ignoredProperties',\n  shacl.IRI,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.dependent, datatype: xsd.boolean, maxCount: 1},\n  'dependent',\n  shacl.Literal,\n  NodeShape,\n);\n\n// NodeShape.targetObjectsOf (sh:targetObjectsOf — values are predicate IRIs),\n// NodeShape.generated (core:generated — marks a shape core generates at sync time,\n// e.g. the `<propertyShape>.singleOwner` constraint, so catalog readers can skip it) and\n// NodeShape.generatedShapes (core:generatedShape — the shape owns the shapes generated from\n// it: `contains`, so deleting the shape deletes them).\ncreatePropertyShape(\n  {path: shacl.targetObjectsOf, shape: Shape},\n  'targetObjectsOf',\n  shacl.IRI,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.generated, datatype: xsd.boolean, maxCount: 1},\n  'generated',\n  shacl.Literal,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.generatedShape, shape: NodeShape, contains: true},\n  'generatedShapes',\n  shacl.IRI,\n  NodeShape,\n);\n"]}
+{"version":3,"file":"Package.js","sourceRoot":"","sources":["../../../src/utils/Package.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,eAAe,EACf,aAAa,EACb,uBAAuB,EACvB,SAAS,EACT,aAAa,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAC,mBAAmB,EAAqB,MAAM,4BAA4B,CAAC;AACnF,OAAO,EAAC,KAAK,EAAwB,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAC,IAAI,EAAC,MAAM,yBAAyB,CAAC;AAC7C,OAAO,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACnC,OAAO,EAAC,YAAY,EAAC,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AACzC,OAAO,EAAC,wBAAwB,EAAC,aAAa,EAAC,MAAM,iBAAiB,CAAC;AACvE,OAAO,EAAC,KAAK,EAAC,MAAM,wBAAwB,CAAC;AAC7C,OAAO,EAAC,IAAI,EAAC,MAAM,uBAAuB,CAAC;AAC3C,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AASzC,kEAAkE;AAClE,kDAAkD;AAClD,IAAI,UAAU,GAAa,IAAI,GAAG,EAAE,CAAC;AACrC,IAAI,qBAAqB,GAAG,KAAK,CAAC;AA+KlC,MAAM,CAAC,IAAI,aAAa,GAAG,EAAE,CAAC;AAE9B,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAE/C,aAAa,GAAG,KAAK,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAc;IAEjD,qBAAqB,GAAG,KAAK,CAAC;IAC9B,qEAAqE;IACrE,IAAI,qBAAqB,EACzB,CAAC;QACC,0EAA0E;QAC1E,UAAU,CAAC,OAAO,CAAC,CAAC,cAAc,EAAE,EAAE;YACpC,iFAAiF;YACjF,IAAI,cAAc,CAAC,OAAO,CAAC,EAC3B,CAAC;gBACC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAGD,MAAM,UAAU,aAAa,CAC3B,WAAmB,EACnB,OAA4B;IAG5B,6EAA6E;IAC7E,8EAA8E;IAC9E,6EAA6E;IAC7E,wBAAwB;IACxB,uBAAuB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAC9C,IAAI,eAAe,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;IAC3D,IAAI,iBAAiB,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAE3D,qCAAqC;IACrC,IAAI,qBAAqB,GAAG,UAAS,MAAM;QACzC,sEAAsE;QACtE,qEAAqE;QACrE,mEAAmE;QACnE,kEAAkE;QAClE,0DAA0D;QAC1D,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;IAC1C,CAAC,CAAC;IAEF,IAAI,qBAAqB,GAAG,UAAS,UAAU,EAAC,cAAc;QAC5D,iBAAiB,CAAC,UAAU,CAAC,GAAG,cAAc,CAAC;IACjD,CAAC,CAAC;IAEF,SAAS,qBAAqB,CAAC,OAAO;QAEpC,KAAK,IAAI,GAAG,IAAI,OAAO,CAAC,OAAO,EAC/B,CAAC;YACC,6EAA6E;YAC7E,oDAAoD;YACpD,IACE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI;gBAC1B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,mBAAmB,EAEnD,CAAC;gBACC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAC,MAAM,EAAC,EAAC,KAAK,EAAE,GAAG,EAAC,CAAC,CAAC;gBAChE,wDAAwD;gBACxD,IACE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;oBAChC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,EAE3C,CAAC;oBACC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,EAAC,MAAM,EAAC;wBAC5D,KAAK,EAAE,GAAG,GAAG,iBAAiB;qBAC/B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,qBAAqB,CAAC,GAAG,EAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,gIAAgI;IAChI,IAAI,UAAU,GAAG,UAAS,WAAW;QACnC,2DAA2D;QAC3D,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAEnC,iDAAiD;QACjD,OAAO,WAAW,CAAC;IACrB,CAAC,CAAC;IAEF,4FAA4F;IAC5F,SAAS,gBAAgB,CACvB,WAAc,EACd,OAAqB;;QAGrB,IAAG,CAAC,WAAW,EAAE,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,mDAAmD,IAAC,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,GAAG,SAAS,CAAC,CAAC,EAAC,GAAG,CAAC,CAAA,GAAC,GAAG,GAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1I,OAAO;QACT,CAAC;QACD,4DAA4D;QAC5D,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAEnC,uCAAuC;QACvC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAElC,sEAAsE;QACtE,wEAAwE;QACxE,uEAAuE;QACvE,gEAAgE;QAChE,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACpE,WAAmB,CAAC,WAAW,GAAG,WAAW,CAAC;QACjD,CAAC;QAED,0DAA0D;QAC1D,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAC9D,CAAC;YACC,yEAAyE;YACzE,gDAAgD;YAChD,MAAM,SAAS,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,mCAAI,WAAW,CAAC,IAAI,CAAC;YAEpD,yEAAyE;YACzE,wEAAwE;YACxE,uEAAuE;YACvE,yEAAyE;YACzE,wEAAwE;YACxE,yBAAyB;YACzB,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,CAAA,IAAI,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnD,OAAO,CAAC,IAAI,CACV,mBAAmB,WAAW,CAAC,IAAI,SAAS,WAAW,kCAAkC;oBACvF,iFAAiF;oBACjF,2EAA2E;oBAC3E,qDAAqD,CACxD,CAAC;YACJ,CAAC;YAED,sEAAsE;YACtE,MAAM,SAAS,GAAkB,mBAAmB,CAClD,eAAe,CAAC,WAAW,EAAE,SAAS,CAAC,CACxC,CAAC;YACF,gDAAgD;YAChD,WAAW,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,eAAe;YACf,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC;YAE5B,IAAI,OAAO,EACX,CAAC;gBACC,IAAI,OAAO,CAAC,WAAW,EACvB,CAAC;oBACC,SAAS,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;gBAC9C,CAAC;gBACD,IAAI,OAAO,CAAC,SAAS,EACrB,CAAC;oBACC,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;gBAC7B,CAAC;gBACD,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAChC,CAAC;oBACC,SAAS,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;gBACpC,CAAC;gBACD,IAAI,OAAO,CAAC,iBAAiB,EAC7B,CAAC;oBACC,SAAS,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAC;gBAC1D,CAAC;YACH,CAAC;YAED,gEAAgE;YAChE,wBAAwB,CAAC,SAAS,EAAC,WAAW,CAAC,CAAC;YAEhD,2CAA2C;YAC3C,MAAM,mBAAmB,GAAG,MAAM,CAAC,cAAc,CAC/C,WAAW,CACI,CAAC;YAClB,MAAM,cAAc,GAAG,mBAAmB,CAAC,KAAK,CAAC;YACjD,6DAA6D;YAC7D,IAAI,cAAc,IAAI,CAAC,CAAC,mBAAmB,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvD,8CAA8C;gBAC9C,SAAS,CAAC,OAAO,GAAG,EAAC,EAAE,EAAE,cAAc,CAAC,EAAE,EAAC,CAAC;YAC9C,CAAC;YAGD,kDAAkD;YAClD,IAAI,WAAW,CAAC,gBAAgB,CAAC,EACjC,CAAC;gBACC,WAAW,CAAC,gBAAgB,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;oBACjD,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACtB,CAAC,CAAC,CAAC;gBACH,MAAM,aAAa,GAAG,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACzD,IAAG,aAAa,EAAE,CAAC;oBACjB,aAAa,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;wBACjC,QAAQ,CAAC,SAAS,CAAC,CAAC;oBACtB,CAAC,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,WAAW,CAAC,gBAAgB,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;aAED,CAAC;YACC,OAAO,CAAC,IAAI,CAAC,uCAAuC,EAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,WAAW,CAAC,WAAW,EAC3B,CAAC;YACE,WAAW,CAAC,KAAuB,CAAC,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC;QAC7E,CAAC;QAED,kDAAkD;QAClD,sBAAsB;IACxB,CAAC;IAOD,SAAS,WAAW,CAAC,GAAS;QAE5B,wBAAwB;QACxB,IAAI,OAAO,GAAG,KAAK,UAAU,EAC7B,CAAC;YACC,gBAAgB,CAAC,GAAG,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QACD,iDAAiD;QACjD,MAAM,OAAO,GAA4B,GAAG,CAAC;QAC7C,OAAO,UAAkC,WAAc;YACrD,gBAAgB,CAAC,WAAW,EAAC,OAAO,CAAC,CAAC;QACxC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,IAAI,cAAc,GAAG,UACnB,OAAO,EACP,SAA+C,EAC/C,iBAAyB,EACzB,QAAS,EACT,UAA8B;QAE9B,IAAI,WAAW,qBAAO,OAAO,CAAC,CAAC;QAC/B,mFAAmF;QACnF,WAAW,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAC/B,WAAW,CAAC,SAAS,CAAC,GAAG,iBAAiB,CAAC;QAC3C,WAAW,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;QAChC,WAAW,CAAC,OAAO,CAAC,GAAG,UAAU,CAAC;QAElC,iHAAiH;QACjH,IAAI,iBAAiB,EACrB,CAAC;YACC,uJAAuJ;YACvJ,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC5B,mGAAmG;QACnG,qBAAqB,CAAC,iBAAiB,EAAC,WAAW,CAAC,CAAC;QACrD,MAAM;QAEN,IAAI,qBAAqB,EACzB,CAAC;YACC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;gBACvB,OAAO,CAAC,IAAI,CACV,yEAAyE;oBACzE,iBAAiB;oBACjB,YAAY,EACZ,GAAG,CACJ,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC;IAEF;;;;OAIG;IACH,IAAI,eAAe,GAAG,CAAC,IAAY,EAAgC,EAAE;QACnE,6CAA6C;QAC7C,uDAAuD;QACvD,OAAO,aAAa,CAClB,eAAe,CAAC,WAAW,EAAE,IAAI,CAAC,CACnC,CAAC;IACJ,CAAC,CAAC;IAEF,mDAAmD;IACnD,OAAO;QACL,WAAW;QACX,UAAU;QACV,cAAc;QACd,qBAAqB;QACrB,qBAAqB;QACrB,eAAe;QACf,cAAc,EAAE,iBAAiB;QACjC,WAAW,EAAE,WAAW;QACxB,eAAe;KACO,CAAC;AAC3B,CAAC;AAED,SAAS,qBAAqB,CAAC,WAAW,EAAC,cAAe;IAExD,mEAAmE;IACnE,IAAI,WAAW,IAAI,OAAO,CAAC,QAAQ,EACnC,CAAC;QACC,sEAAsE;QACtE,oEAAoE;QACpE,sEAAsE;QACtE,gEAAgE;QAChE,wDAAwD;QACxD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAC,cAAc,CAAC,CAAC;IAC9D,CAAC;SAED,CAAC;QACC,6DAA6D;QAC7D,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,cAAc,IAAI,EAAE,CAAC;IACvD,CAAC;IACD,OAAO,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,uBAAuB,CAAC,WAAmB;IAElD,IAAI,CAAC,OAAO,CAAC,SAAS,EACtB,CAAC;QACC,OAAO,CAAC,SAAS,GAAG,EAAE,CAAC;IACzB,CAAC;IACD,IAAI,WAAW,IAAI,OAAO,CAAC,SAAS,EACpC,CAAC;QACC,OAAO,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,eAAe,GAAoB;QACvC,EAAE,EAAE,aAAa,CAAC,WAAW,CAAC;QAC9B,WAAW;QACX,IAAI,EAAE,YAAY,CAAC,OAAO;KAC3B,CAAC;IACF,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,eAAe,CAAC;IACjD,OAAO,eAAe,CAAC;AACzB,CAAC;AAGD,MAAM,UAAU,QAAQ;IAEtB,IAAI,YAAY,GACd,OAAO,MAAM,KAAK,WAAW;QAC3B,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,OAAO,MAAM,KAAK,WAAW;YAC7B,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,SAAS,CAAC;IAClB,uEAAuE;IACvE,wEAAwE;IACxE,uEAAuE;IACvE,sEAAsE;IACtE,kEAAkE;IAClE,uCAAuC;IACvC,EAAE;IACF,sEAAsE;IACtE,uEAAuE;IACvE,2CAA2C;IAC3C,IAAI,CAAC,CAAC,SAAS,IAAI,YAAY,CAAC,EAChC,CAAC;QACC,YAAY,CAAC,SAAS,CAAC,GAAG,EAAC,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,QAAQ,EAAE,CAAC;AAEX,mFAAmF;AACnF,MAAM,CAAC,MAAM,WAAW,GAAG,aAAa,CAAC,eAAe,CAAC,CAAC;AAC1D,4FAA4F;AAC5F,2FAA2F;AAC3F,kCAAkC;AAClC,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,WAAW;IACjB,WAAW,EACT,sJAAsJ;CACzJ,CAAC,CAAC,SAAS,CAAC,CAAC;AACd,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,eAAe;IACrB,WAAW,EACT,yJAAyJ;IAC3J,yFAAyF;IACzF,cAAc;CACf,CAAC,CAAC,aAAa,CAAC,CAAC;AAClB,yFAAyF;AACzF,0FAA0F;AAC1F,+DAA+D;AAC/D,WAAW,CAAC,WAAW,CAAC;IACtB,IAAI,EAAE,MAAM;CACb,CAAC,CAAC,IAAI,CAAC,CAAC;AACT,uEAAuE;AAEvE,mFAAmF;AACnF,qCAAqC;AACrC,8FAA8F;AAC9F,oEAAoE;AACpE,+EAA+E;AAC/E,KAAK,CAAC,KAAK,GAAG,mBAAmB,CAC/B,eAAe,CAAC,eAAe,EAAE,OAAO,CAAC,CAC1C,CAAC;AACF,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAC,KAAK,CAAC,CAAC;AAE5C,+DAA+D;AAC/D,+EAA+E;AAC/E,mBAAmB,CAAC;IAChB,IAAI,EAAE,IAAI,CAAC,KAAK;IAChB,0CAA0C;IAC1C,QAAQ,EAAE,CAAC,EAAC,6DAA6D;CAC1E,EACD,OAAO,EACP,KAAK,CAAC,OAAO,EACb,KAAK,CACN,CAAC;AACF,mBAAmB,CACjB;IACE,IAAI,EAAE,GAAG,CAAC,IAAI;IACd,KAAK,EAAE,KAAK;CACb,EACD,MAAM,EACN,KAAK,CAAC,GAAG,EACT,KAAK,CACN,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,aAAa;IACpB,QAAQ,EAAE,IAAI,EAAE,2DAA2D;CAC5E,EACD,YAAY,EACZ,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AAEF,mBAAmB,CAAC;IACd,IAAI,EAAE,IAAI,CAAC,OAAO;IAClB,QAAQ,EAAE,CAAC;CACZ,EAAC,aAAa,EAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;AAE9C,mBAAmB,CAAC;IAClB,IAAI,EAAE,GAAG,CAAC,IAAI;IACd,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,KAAK;CACb,EAAC,MAAM,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAE/B,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,WAAW;IACvB,KAAK,EAAE,KAAK,EAAE,qIAAqI;IACnJ,QAAQ,EAAE,CAAC;CACZ,EACD,aAAa,EACb,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AAEF,mBAAmB,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC,UAAU;IACtB,KAAK,EAAE,KAAK,EAAC,+HAA+H;CAC7I,EAAC,YAAY,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAErC,mBAAmB,CAAC;IAClB,IAAI,EAAE,YAAY,CAAC,WAAW;IAC9B,KAAK,EAAE,SAAS;CACjB,EAAC,SAAS,EAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;AAElC,uEAAuE;AACvE,gHAAgH;AAChH,mBAAmB,CACjB;IACE,iFAAiF;IACjF,qFAAqF;IACrF,yEAAyE;IACzE,sEAAsE;IACtE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,sFAAsF;IACtF,yFAAyF;IACzF,iEAAiE;IACjE,QAAQ,EAAE,KAAK,CAAC,cAAc;CAC/B,EACD,MAAM,EACN,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,KAAK,EAAE,SAAS;IAChB,QAAQ,EAAE,CAAC;CACZ,EACD,YAAY,EACZ,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,QAAQ,EAAE,CAAC;IACX,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,KAAK,EAAE,0FAA0F;CACzG,EACD,UAAU,EACV,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,KAAK,EAAE,KAAK;IACZ,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,wBAAwB;AACxB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,QAAQ,EAAE,GAAG,CAAC,OAAO;IACrB,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,wBAAwB;AACxB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,QAAQ;IACpB,QAAQ,EAAE,GAAG,CAAC,OAAO;IACrB,QAAQ,EAAE,CAAC;CACZ,EACD,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,oBAAoB;AACpB,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,IAAI;IAChB,QAAQ,EAAE,CAAC;CACZ,EACD,MAAM,EACN,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,2BAA2B;AAC3B,mBAAmB,CACjB;IACE,IAAI,EAAE,KAAK,CAAC,WAAW;IACvB,QAAQ,EAAE,CAAC;CACZ,EACD,aAAa,EACb,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,8EAA8E;AAC9E,gEAAgE;AAChE,gFAAgF;AAChF,yFAAyF;AACzF,8EAA8E;AAE9E,sBAAsB;AACtB,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC9C,OAAO,EACP,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,yCAAyC;AACzC,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAC,EAC1D,IAAI,EACJ,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,4DAA4D;AAC5D,sFAAsF;AACtF,wFAAwF;AACxF,wEAAwE;AACxE,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,kBAAkB,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AACnH,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC7G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC7G,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,gBAAgB,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EACzD,kBAAkB,EAClB,KAAK,CAAC,GAAG,EACT,aAAa,CACd,CAAC;AAEF,oDAAoD;AACpD,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,UAAU,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AAE1F,2EAA2E;AAC3E,8EAA8E;AAC9E,gFAAgF;AAChF,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AAElG,uFAAuF;AACvF,yFAAyF;AACzF,6FAA6F;AAC7F,sCAAsC;AACtC,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,cAAc,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAC3G,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC3D,WAAW,EACX,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC3D,WAAW,EACX,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAC,EACxD,SAAS,EACT,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,8BAA8B;AAC9B,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACvD,OAAO,EACP,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CAAC,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AAE7F,wEAAwE;AACxE,kFAAkF;AAClF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,WAAW,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACpE,aAAa,EACb,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,aAAa,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACtE,eAAe,EACf,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,yEAAyE;AACzE,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACjE,UAAU,EACV,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AAEF,gFAAgF;AAChF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACxD,QAAQ,EACR,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,iBAAiB,EAAE,KAAK,EAAE,KAAK,EAAC,EAC7C,mBAAmB,EACnB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAClE,WAAW,EACX,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AAEF,8EAA8E;AAC9E,mFAAmF;AACnF,yFAAyF;AACzF,4FAA4F;AAC5F,uDAAuD;AACvD,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,KAAK,EAAC,EAC3C,iBAAiB,EACjB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EAClE,WAAW,EACX,KAAK,CAAC,OAAO,EACb,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,cAAc,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAC,EACrE,iBAAiB,EACjB,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AAEF,mFAAmF;AACnF,2EAA2E;AAC3E,+FAA+F;AAC/F,8FAA8F;AAC9F,iGAAiG;AACjG,wHAAwH;AACxH,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,mBAAmB,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,cAAc,EAAC,EAChG,qBAAqB,EACrB,KAAK,CAAC,cAAc,EACpB,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,iBAAiB,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAC,EACnE,mBAAmB,EACnB,KAAK,CAAC,OAAO,EACb,aAAa,CACd,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,EAC9C,OAAO,EACP,KAAK,CAAC,GAAG,EACT,SAAS,CACV,CAAC;AACF,mBAAmB,CACjB,EAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,cAAc,EAAC;AAC7D,2EAA2E;AAC3E,UAAU,EACV,KAAK,CAAC,cAAc,EACpB,SAAS,CACV,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport {\n  createPropertyShape,\n  getAndClearCallbacks,\n  getNodeShapeUri,\n  getPackageUri,\n  setPackagePublishConfig,\n  NodeShape,\n  PropertyShape,\n} from '../shapes/SHACL.js';\nimport {createNodeShapeData, type NodeShapeData} from '../shapes/nodeShapeData.js';\nimport {Shape, type ShapeConstructor} from '../shapes/Shape.js';\nimport {List} from '../shapes/List.class.js';\nimport {Prefix} from './Prefix.js';\nimport {coreOntology} from '../ontologies/linked-core.js';\nimport {rdf} from '../ontologies/rdf.js';\nimport {addNodeShapeToShapeClass,getShapeClass} from './ShapeClass.js';\nimport {shacl} from '../ontologies/shacl.js';\nimport {rdfs} from '../ontologies/rdfs.js';\nimport {xsd} from '../ontologies/xsd.js';\nimport type {NodeReferenceValue} from './NodeReference.js';\n\n//global tree\ndeclare var _linked: any;\ndeclare var window;\ndeclare var global;\n\n\n// var packageParsePromises: Map<string,Promise<any>> = new Map();\n// var loadedPackages: Set<NamedNode> = new Set();\nlet ontologies: Set<any> = new Set();\nlet _autoLoadOntologyData = false;\n/**\n * a map of requested property shapes for specific nodes\n * The value is a promise if it's still loading, or true if it is fully loaded\n */\n// type ClassDecorator = <T extends {new (...args: any[]): {}}>(\n//   constructor: T,\n// ) => T;\n\nexport type ShapeConfig = {\n  /**\n   * The name this shape is identified by, overriding the class name.\n   *\n   * A shape's IRI is `<baseUri>shape/<package>/<name>`, and `Server.call`\n   * routes on it — so the name is persisted data, not a label. Taking it from\n   * `constructor.name` couples that data to how the code was compiled: a\n   * minifier renames the class, and so does a plain name collision, because a\n   * shape and the ontology term it targets deliberately share a name. Either\n   * one silently changes what the shape *is*.\n   *\n   * Optional, and defaults to `constructor.name`, so existing shapes are\n   * unaffected. Set it where the identity has to outlive the build.\n   */\n  name?: string;\n  /**\n   * A short description of the shape, what it represents and what it is used for.\n   * will be stored as rdfs:comment on the shape node\n   */\n  description?: string;\n  /**\n   * @deprecated No effect on deletes. Ownership is per property: every node a `contains`\n   * property reaches is deleted with its owner, whether or not its shape is\n   * `dependent`. Still accepted and persisted (`core:dependent`) by shape sync.\n   */\n  dependent?: boolean;\n  /**\n   * Close the shape (sh:closed): target nodes with properties outside this shape are invalid.\n   */\n  closed?: boolean;\n  /**\n   * Properties permitted in addition to the declared ones when the shape is closed\n   * (sh:ignoredProperties).\n   */\n  ignoredProperties?: NodeReferenceValue[];\n};\n\nexport type PackageMetadata = {\n  id: string;\n  packageName: string;\n  type: NodeReferenceValue;\n};\n\n/**\n * This object, returned by [linkedPackage()](/docs/lincd.js/modules/utils_Module#linkedPackage),\n * contains the decorators to link different parts of a LINCD module.\n */\nexport interface LinkedPackageObject\n{\n  /**\n   * Links a typescript class to a SHACL shape.\n   * This decorator creates a SHACL shape and looks at the static property [targetClass](/docs/lincd.js/classes/shapes_Shape.Shape#targetclass)\n   * The rest of the shape is typically 'shaped' by methods that use [property decorators](/docs/lincd.js/modules/utils_ShapeDecorators).\n   *\n   * @example\n   * Example of a typescript class using the \\@linkedShape decorator:\n   * ```tsx\n   * @linkedShape\n   * export class Person extends Shape { ... }\n   * ```\n   * Or with options:\n   * ```tsx\n   * @linkedShape({ description: \"...\" })\n   * export class Person extends Shape { ... }\n   * ```\n   */\n  linkedShape: {\n    <T extends typeof Shape>(constructor: T): void;\n    <T extends typeof Shape>(config?: ShapeConfig): (constructor: T) => void;\n  };\n  /**\n   * Use this decorator to make any other classes or functions available on demand to other LINCD modules.\n   * It does not change the object it is applied on.\n   * This is specifically required for their use in an open-ended LINCD application.\n   *\n   * @example\n   * An example helper utility using the \\@linkedUtil decorator:\n   * ```tsx\n   * @linkedUtil\n   * export class Sort {\n   *   static byName(persons:Person[]) {\n   *     return persons.sort((p1,p2) => p1.name < p2.name ? -1 : 1)\n   *   }\n   * ```\n   */\n  linkedUtil: (constructor: any) => any;\n  /**\n   * Used to notify LINCD.js of an ontology.\n   * See also the [Ontology guides](/docs/guides/linked-code/ontologies).\n   *\n   * @param allFileExports - all the objects that are exported by the ontology file (use `import * as _this from \"./path-to-this-file\")`)\n   * @param nameSpace - the result of [createNameSpace](/docs/lincd.js/modules/utils_NameSpace#createnamespace). This allows consumers to generate NamedNodes that may not be listed in this ontology if needed\n   * @param prefixAndFileName - a suggested prefix chosen by you. Make sure the suggestedPrefix matches the file name and the name of the exported object that groups all entities together\n   * @param loadDataFunction - a method that loads _and parses_ the raw ontology data. This means the ontology will be loaded into the local graph. The returned result is mostly a JSONLDParsePromise (from lincd-jsonld/JSONLD, not bundled in LINCD.js)\n   * @param dataSource - the relative path to the raw data of the ontology\n   * @example\n   * Example of an Ontology File that used linkedOntology()\n   * ```tsx\n   * import {NamedNode} from 'lincd/models';\n   * import {JSONLD} from 'lincd-jsonld/JSONLD';\n   * import {createNameSpace} from 'lincd/utils/NameSpace';\n   * import {linkedOntology} from '../package.js';\n   * import * as _this from './my.js-ontology';\n   *\n   * let dataFile = '../data/my.js-ontology.json';\n   * export var loadData = () => JSONLD.parsePromise(import(dataFile));\n   *\n   * export var ns = createNameSpace('http://www.my-ontology.com/');\n   *\n   * export var _self: NamedNode = ns('');\n   *\n   * // Classes\n   * export var ExampleClass: NamedNode = ns('ExampleClass');\n   *\n   * // Properties\n   * export var exampleProperty: NamedNode = ns('exampleProperty');\n   *\n   * export const myOntology = {\n   *   ExampleClass,\n   *   exampleProperty,\n   * };\n   *\n   * linkedOntology(_this, ns, 'myOntology', loadData, dataFile);\n   * ```\n   */\n  linkedOntology: (\n    allFileExports,\n    nameSpace: (term: string) => NodeReferenceValue,\n    suggestedPrefixAndFileName: string,\n    loadDataFunction?: () => Promise<any>,\n    dataSource?: string | string[],\n  ) => void;\n  /**\n   * Low level method used by other decorators to write to the modules' object in the LINCD tree.\n   * You should typically not need this.\n   * @param exportFileName - the file name that this exported object is available under. Needs to be unique across the module.\n   * @param exportedObject - the exported object (the class, constant, function, etc)\n   */\n  registerPackageExport: (exportedObject: any) => void;\n\n  /**\n   * Get a Shape subclass registered in this package by name.\n   * Returns undefined if the shape is not registered or bundled.\n   *\n   * Useful for avoiding circular dependencies between shapes.\n   * E.g. `getOneAs(..., getPackageShape('ImageObject'))` in Thing.ts\n   * avoids importing ImageObject (which extends Thing).\n   */\n  getPackageShape: (name: string) => ShapeConstructor | undefined;\n  /**\n   * A reference to the modules' object in the LINCD tree.\n   * Contains all linked components of the module.\n   */\n  packageExports: any;\n  packageName: string;\n  packageMetadata: PackageMetadata;\n\n  /**\n   * Register a file (a javascript module) and all its exported objects.\n   * Specifically helpful for registering multiple functional components if you declare them without a function name\n   * @param _this\n   * @param _module\n   */\n  registerPackageModule(_module): void;\n}\n\nexport var DEFAULT_LIMIT = 12;\n\nexport function setDefaultPageLimit(limit: number)\n{\n  DEFAULT_LIMIT = limit;\n}\n\nexport function autoLoadOntologyData(value: boolean)\n{\n  _autoLoadOntologyData = value;\n  //this may be set to true after some ontologies have already indexed,\n  if (_autoLoadOntologyData)\n  {\n    // so in that case we load all data of ontologies that are already indexed\n    ontologies.forEach((ontologyExport) => {\n      //see linkedOntology() where we store the data loading method under the _load key\n      if (ontologyExport['_load'])\n      {\n        ontologyExport['_load']();\n      }\n    });\n  }\n}\n\n\nexport function linkedPackage(\n  packageName: string,\n  options?: {baseUri?: string},\n): LinkedPackageObject\n{\n  // Declare the package's publish root before any shape/metadata IRI is built.\n  // The slug is derived from `packageName`; only `baseUri` is configurable — CN\n  // injects a workspace-scoped root for private packages, first-party packages\n  // default to linked.cm.\n  setPackagePublishConfig(packageName, options);\n  let packageMetadata = registerPackageMetadata(packageName);\n  let packageTreeObject = registerPackageInTree(packageName);\n\n  //#Create declarators for this module\n  let registerPackageExport = function(object) {\n    // Plan-011 §I2 interim — \"Key X was already defined\" warning silenced\n    // until the duplicate-instance root cause is investigated. With Vite\n    // SSR resolving workspace packages from src/, package.ts evaluates\n    // twice and every export key trips this warning. The overwrite is\n    // safe because the second registration is the same class.\n    packageTreeObject[object.name] = object;\n  };\n\n  let registerInPackageTree = function(exportName,exportedObject) {\n    packageTreeObject[exportName] = exportedObject;\n  };\n\n  function registerPackageModule(_module): void\n  {\n    for (var key in _module.exports)\n    {\n      //if the exported object itself is not named or its name is _wrappedComponent\n      //then we give it the same name as it's export name.\n      if (\n        !_module.exports[key].name ||\n        _module.exports[key].name === '_wrappedComponent'\n      )\n      {\n        Object.defineProperty(_module.exports[key],'name',{value: key});\n        //manual 'hack' to set the name of the original function\n        if (\n          _module.exports[key]['original'] &&\n          !_module.exports[key]['original']['name']\n        )\n        {\n          Object.defineProperty(_module.exports[key]['original'],'name',{\n            value: key + '_implementation',\n          });\n        }\n      }\n      registerInPackageTree(key,_module.exports[key]);\n    }\n  }\n\n  //create a declarator function which Components of this module can use register themselves and add themselves to the global tree\n  let linkedUtil = function(constructor) {\n    //add the component class of this module to the global tree\n    registerPackageExport(constructor);\n\n    //return the original class without modifications\n    return constructor;\n  };\n\n  // helper that contains the previous body; applies the decorator work to a given constructor\n  function applyLinkedShape<T extends typeof Shape>(\n    constructor: T,\n    options?: ShapeConfig,\n  ): void\n  {\n    if(!constructor) {\n      throw new Error('Constructor is undefined, skipping registration: '+constructor?.toString().substring(0,100)+' '+JSON.stringify(options));\n      return;\n    }\n    // add the component class of this module to the global tree\n    registerPackageExport(constructor);\n\n    // register the component and its shape\n    Shape.registerByType(constructor);\n\n    // Track the un-sanitized package name on the constructor so consumers\n    // (e.g. LincdServerProxy) can route backend calls using the real module\n    // specifier (e.g. '@_linked/server'), not the lossy URI-sanitized form\n    // ('-_linked-server' — non-recoverable via decodeURIComponent).\n    if (!Object.getOwnPropertyNames(constructor).includes('packageName')) {\n      (constructor as any).packageName = packageName;\n    }\n\n    // if no shape object has been attached to the constructor\n    if (!Object.getOwnPropertyNames(constructor).includes('shape'))\n    {\n      // The shape's identity. An explicit name wins; otherwise the class name,\n      // which is what every existing shape relies on.\n      const shapeName = options?.name ?? constructor.name;\n\n      // A class name ending in a digit, with no explicit name given, is almost\n      // always a bundler disambiguating a collision — `BackendAPIStore2` when\n      // the ontology term of the same name took the binding first. The shape\n      // then registers under an IRI the rest of the system will never ask for,\n      // and the only symptom is a 501 several layers away. Say so here, where\n      // it is cheap and early.\n      if (!options?.name && /\\d$/.test(constructor.name)) {\n        console.warn(\n          `[linked] Shape '${constructor.name}' in '${packageName}' has a name ending in a digit, ` +\n            `which usually means a bundler renamed it to avoid a collision — often with the ` +\n            `ontology term it targets. Its IRI will not match what consumers ask for. ` +\n            `Pass an explicit name: @linkedShape({name: '...'}).`,\n        );\n      }\n\n      // create a new node shape (plain metadata object) for this shapeClass\n      const nodeShape: NodeShapeData = createNodeShapeData(\n        getNodeShapeUri(packageName, shapeName),\n      );\n      // connect the typescript class to its NodeShape\n      constructor.shape = nodeShape;\n      // set the name\n      nodeShape.label = shapeName;\n\n      if (options)\n      {\n        if (options.description)\n        {\n          nodeShape.description = options.description;\n        }\n        if (options.dependent)\n        {\n          nodeShape.dependent = true;\n        }\n        if (options.closed !== undefined)\n        {\n          nodeShape.closed = options.closed;\n        }\n        if (options.ignoredProperties)\n        {\n          nodeShape.ignoredProperties = options.ignoredProperties;\n        }\n      }\n\n      // also keep track of the reverse: nodeShape to typescript class\n      addNodeShapeToShapeClass(nodeShape,constructor);\n\n      //track what extends what (nodeShape level)\n      const extendingShapeClass = Object.getPrototypeOf(\n        constructor,\n      ) as typeof Shape;\n      const extendingShape = extendingShapeClass.shape;\n      //if this shape class is extending something other then Shape\n      if (extendingShape && !(extendingShapeClass === Shape)) {\n        //store which nodeShape this nodeShape extends\n        nodeShape.extends = {id: extendingShape.id};\n      }\n      \n\n      // run deferred callbacks from property decorators\n      if (constructor['shapeCallbacks'])\n      {\n        constructor['shapeCallbacks'].forEach((callback) => {\n          callback(nodeShape);\n        });\n        const nodeCallbacks = getAndClearCallbacks(nodeShape.id);\n        if(nodeCallbacks) {\n          nodeCallbacks.forEach((callback) => {\n            callback(nodeShape);\n          });\n        }\n        delete constructor['shapeCallbacks'];\n      }\n    }\n    else\n    {\n      console.warn('This ShapeClass already has a shape: ',constructor.shape);\n    }\n\n    if (constructor.targetClass)\n    {\n      (constructor.shape as NodeShapeData).targetClass = constructor.targetClass;\n    }\n\n    // return the original class without modifications\n    // return constructor;\n  }\n\n  // Overloaded signatures to support both usages\n  function linkedShape<T extends typeof Shape>(constructor: T): void;\n  function linkedShape<T extends typeof Shape>(\n    options?: ShapeConfig,\n  ): (constructor: T) => void;\n  function linkedShape(arg?: any): void | ((constructor: any) => void)\n  {\n    // usage as @linkedShape\n    if (typeof arg === 'function')\n    {\n      applyLinkedShape(arg);\n      return;\n    }\n    // usage as @linkedShape({...}) or @linkedShape()\n    const options: ShapeConfig | undefined = arg;\n    return function <T extends typeof Shape>(constructor: T): void {\n      applyLinkedShape(constructor,options);\n    };\n  }\n\n  /**\n   *\n   * @param exports all exports of the file, simply provide \"this\" as value!\n   * @param dataSource the path leading to the ontology's data file\n   * @param nameSpace the base URI of the ontology\n   * @param prefixAndFileName the file name MUST match the prefix for this ontology\n   */\n  let linkedOntology = function(\n    exports,\n    nameSpace: (term: string) => NodeReferenceValue,\n    prefixAndFileName: string,\n    loadData?,\n    dataSource?: string | string[],\n  ) {\n    let exportsCopy = {...exports};\n    //store specifics in exports. And make sure we can detect this as an ontology later\n    exportsCopy['_ns'] = nameSpace;\n    exportsCopy['_prefix'] = prefixAndFileName;\n    exportsCopy['_load'] = loadData;\n    exportsCopy['_data'] = dataSource;\n\n    //register the prefix here (so just calling linkedOntology with a prefix will automatically register that prefix)\n    if (prefixAndFileName)\n    {\n      //run the namespace without any term name, this will give back a named node with just the namespace as URI, then get that URI to provide it as full URI\n      Prefix.add(prefixAndFileName,nameSpace('').id);\n    }\n\n    ontologies.add(exportsCopy);\n    //register all the exports under the prefix. NOTE: this means the file name HAS to match the prefix\n    registerInPackageTree(prefixAndFileName,exportsCopy);\n    // });\n\n    if (_autoLoadOntologyData)\n    {\n      loadData().catch((err) => {\n        console.warn(\n          'Could not load ontology data. Do you need to rebuild the module of the ' +\n          prefixAndFileName +\n          ' ontology?',\n          err,\n        );\n      });\n    }\n  };\n\n  /**\n   * This method is used to get a shape class in this package by its name.\n   * This can be used to avoid circular dependencies between shapes.\n   * @param name\n   */\n  let getPackageShape = (name: string): ShapeConstructor | undefined => {\n    //get the named node of the node shape first,\n    //then get the shape class that defines this node shape\n    return getShapeClass(\n      getNodeShapeUri(packageName, name),\n    );\n  };\n\n  //return the declarators so the module can use them\n  return {\n    linkedShape,\n    linkedUtil,\n    linkedOntology,\n    registerPackageExport,\n    registerPackageModule,\n    getPackageShape,\n    packageExports: packageTreeObject,\n    packageName: packageName,\n    packageMetadata,\n  } as LinkedPackageObject;\n}\n\nfunction registerPackageInTree(packageName,packageExports?)\n{\n  //if something with this name already registered in the global tree\n  if (packageName in _linked._modules)\n  {\n    // Plan-011 §I2 interim — silenced until the duplicate-Linked-instance\n    // root cause is investigated. Vite SSR resolving workspace packages\n    // from src/ for HMR causes each package.ts to evaluate twice, so this\n    // warning fired ~80x per boot. Same package, same exports — the\n    // Object.assign below preserves the registry correctly.\n    Object.assign(_linked._modules[packageName],packageExports);\n  }\n  else\n  {\n    //initiate an empty object for this module in the global tree\n    _linked._modules[packageName] = packageExports || {};\n  }\n  return _linked._modules[packageName];\n}\n\nfunction registerPackageMetadata(packageName: string): PackageMetadata\n{\n  if (!_linked._packages)\n  {\n    _linked._packages = {};\n  }\n  if (packageName in _linked._packages)\n  {\n    return _linked._packages[packageName];\n  }\n  const packageMetadata: PackageMetadata = {\n    id: getPackageUri(packageName),\n    packageName,\n    type: coreOntology.Package,\n  };\n  _linked._packages[packageName] = packageMetadata;\n  return packageMetadata;\n}\n\n\nexport function initTree()\n{\n  let globalObject =\n    typeof window !== 'undefined'\n      ? window\n      : typeof global !== 'undefined'\n        ? global\n        : undefined;\n  // Idempotent: if the global tree is already set up (by another copy of\n  // this Package.ts in the same Node process — structural under Vite SSR,\n  // which evaluates the file once for its own SSR transform AND once via\n  // Node's resolver when a non-Vite import path reaches @_linked/core),\n  // attach to it instead of throwing. Both instances write the same\n  // _modules / _packages registry shape.\n  //\n  // Legacy `lincd` package's Package.ts (separate file) still throws on\n  // dup — that throw signals a REAL problem (legacy `lincd` should never\n  // load in a clean post-eradication state).\n  if (!('_linked' in globalObject))\n  {\n    globalObject['_linked'] = {_modules: {}, _packages: {}};\n  }\n}\n\n//when this file is used, make sure the tree is initialized\ninitTree();\n\n//now that this file is set up, we can link linked shapes in the core module itself\nexport const corePackage = linkedPackage('@_linked/core');\n// NodeShape, PropertyShape and List share their names with ontology terms (shacl.NodeShape,\n// shacl.PropertyShape, rdf.List), so a bundler may rename the classes. Explicit names keep\n// their IRIs independent of that.\ncorePackage.linkedShape({\n  name: 'NodeShape',\n  description:\n    'Represents a SHACL NodeShape; defines constraints for a class of RDF nodes. Links to multiple PropertyShapes. (schema, constraint, class validation)',\n})(NodeShape);\ncorePackage.linkedShape({\n  name: 'PropertyShape',\n  description:\n    'Represents a SHACL PropertyShape; specifies rules for one property of a NodeShape (path, datatype, cardinality). (validation rule, property constraint)',\n  // Owned by its NodeShape through the `contains` sh:property edge: deleting the NodeShape\n  // deletes it.\n})(PropertyShape);\n// List is registered here, by value, because PropertyShape.in below uses it as its value\n// shape. Naming it by string instead would leave it unregistered for anyone who loads the\n// SHACL metamodel without importing shapes/List (backlog 045).\ncorePackage.linkedShape({\n  name: 'List',\n})(List);\n// ValidationReport / ValidationResult removed in core metadata rewrite\n\n//ALL the following is to support Shape having get/set methods with property shapes\n//and Shape itself having a nodeShape\n//if we dont need Shape to have get/set methods (like label and type) then this can be removed\n// Base Shape IRI follows the same scheme as every other core shape:\n// https://linked.cm/shape/core/Shape (corePackage above declared slug 'core').\nShape.shape = createNodeShapeData(\n  getNodeShapeUri('@_linked/core', 'Shape'),\n);\naddNodeShapeToShapeClass(Shape.shape,Shape);\n\n//Here we can register the properties of the Shape class itself\n//We can't do that inside of Shape because it would cause circular dependencies\ncreatePropertyShape({\n    path: rdfs.label,\n    //TODO: multiple labels should be possible\n    maxCount: 1,//currently get label is implemented to return a single value\n  },\n  'label',\n  shacl.Literal,\n  Shape,\n);\ncreatePropertyShape(\n  {\n    path: rdf.type,\n    shape: Shape,\n  },\n  'type',\n  shacl.IRI,\n  Shape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.property,\n    shape: PropertyShape,\n    contains: true, // a NodeShape owns its property shapes (cascade on delete)\n  },\n  'properties',\n  shacl.IRI,\n  NodeShape,\n);\n\ncreatePropertyShape({\n      path: rdfs.comment,\n      maxCount: 1,\n    },'description',shacl.Literal, NodeShape);\n\ncreatePropertyShape({\n  path: rdf.type,\n  maxCount: 1,\n  shape: Shape,\n},'type',shacl.IRI, NodeShape);\n\ncreatePropertyShape(\n  {\n    path: shacl.targetClass,\n    shape: Shape, //should be rdfs Class, but that's currently not available in LINCD. So queries currently cannot continue after accessing targetClass\n    maxCount: 1,\n  },\n  'targetClass',\n  shacl.IRI,\n  NodeShape,\n);\n\ncreatePropertyShape({\n  path: shacl.targetNode,\n  shape: Shape,//actually returns a NamedNode... is this correct then? Should we define or use a rdfs Class that matches the potential values?\n},'targetNode',shacl.IRI, NodeShape);\n\ncreatePropertyShape({\n  path: coreOntology.isExtending,\n  shape: NodeShape,\n},'extends',shacl.IRI, NodeShape);\n\n//currently path accepts multiple values, so its a multi-value property\n//these values will be consequent properties that follow each other. Other property paths are not supported yet.\ncreatePropertyShape(\n  {\n    // No fixed valueShape: sh:path is polymorphic (a predicate IRI, a PathList for a\n    // sequence, or a PathNode for inverse/alt/cardinality). Omitting valueShape lets the\n    // create pipeline use each value's own shape. Simple paths are passed as\n    // {id} node references, complex paths as PathList/PathNode node-data.\n    path: shacl.path,\n    // Not `contains`: a predicate path is a shared IRI. A complex path's operator node or\n    // sequence list is written without an id, so it becomes a blank node, as SHACL requires,\n    // and the blank-node cascade deletes it with the property shape.\n    nodeKind: shacl.BlankNodeOrIRI,\n  },\n  'path',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.node,\n    shape: NodeShape,\n    maxCount: 1,\n  },\n  'valueShape',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    maxCount: 1,\n    path: shacl.nodeKind,\n    shape: Shape, //actually returns a NamedNode. Queries currently cannot continue after accessing nodeKind\n  },\n  'nodeKind',\n  shacl.IRI,\n  PropertyShape,\n);\n\ncreatePropertyShape(\n  {\n    path: shacl.datatype,\n    shape: Shape,\n    maxCount: 1,\n  },\n  'datatype',\n  shacl.IRI,\n  PropertyShape,\n);\n\n//PropertyShape.maxCount\ncreatePropertyShape(\n  {\n    path: shacl.maxCount,\n    datatype: xsd.integer,\n    maxCount: 1,\n  },\n  'maxCount',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.minCount\ncreatePropertyShape(\n  {\n    path: shacl.minCount,\n    datatype: xsd.integer,\n    maxCount: 1,\n  },\n  'minCount',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.name\ncreatePropertyShape(\n  {\n    path: shacl.name,\n    maxCount: 1,\n  },\n  'name',\n  shacl.Literal,\n  PropertyShape,\n);\n\n//PropertyShape.description\ncreatePropertyShape(\n  {\n    path: shacl.description,\n    maxCount: 1,\n  },\n  'description',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// ---------------------------------------------------------------------------\n// Remaining SHACL meta-model accessors for shape serialization.\n// Labels match the PropertyShapeData / NodeShapeData fields so syncShapes() can\n// build the create-pipeline data directly. `sh:in` is owned (contains, valueShape List).\n// ---------------------------------------------------------------------------\n\n// PropertyShape.class\ncreatePropertyShape(\n  {path: shacl.class, shape: Shape, maxCount: 1},\n  'class',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape.in → an rdf:List (owned)\ncreatePropertyShape(\n  {path: shacl.in, shape: List, maxCount: 1, contains: true},\n  'in',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape pair constraints (values are property IRIs)\n// Labelled `equalsConstraint`, not `equals`: `equals` is a query-builder method, so a\n// property under that label is unreachable through the DSL (backlog 041). The name also\n// matches the `PropertyShapeData` field. The predicate stays sh:equals.\ncreatePropertyShape({path: shacl.equals, shape: Shape, maxCount: 1}, 'equalsConstraint', shacl.IRI, PropertyShape);\ncreatePropertyShape({path: shacl.disjoint, shape: Shape, maxCount: 1}, 'disjoint', shacl.IRI, PropertyShape);\ncreatePropertyShape({path: shacl.lessThan, shape: Shape, maxCount: 1}, 'lessThan', shacl.IRI, PropertyShape);\ncreatePropertyShape(\n  {path: shacl.lessThanOrEquals, shape: Shape, maxCount: 1},\n  'lessThanOrEquals',\n  shacl.IRI,\n  PropertyShape,\n);\n\n// PropertyShape.hasValue (literal or IRI — generic)\ncreatePropertyShape({path: shacl.hasValue, maxCount: 1}, 'hasValue', null, PropertyShape);\n\n// PropertyShape.defaultValue (literal or IRI — generic, mirrors hasValue).\n// getResult() already emits `defaultValue`, but without this registration the\n// property is not queryable and a query referencing it throws before executing.\ncreatePropertyShape({path: shacl.defaultValue, maxCount: 1}, 'defaultValue', null, PropertyShape);\n\n// PropertyShape value-range / string-length / pattern constraints (report 021 §3, G5).\n// The range constraints carry no fixed datatype — the literal is typed from the JS value\n// (integer/double), mirroring the constrained property's own datatype. Length is an integer;\n// pattern is the regex source string.\ncreatePropertyShape({path: shacl.minInclusive, maxCount: 1}, 'minInclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.maxInclusive, maxCount: 1}, 'maxInclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.minExclusive, maxCount: 1}, 'minExclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape({path: shacl.maxExclusive, maxCount: 1}, 'maxExclusive', shacl.Literal, PropertyShape);\ncreatePropertyShape(\n  {path: shacl.minLength, datatype: xsd.integer, maxCount: 1},\n  'minLength',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.maxLength, datatype: xsd.integer, maxCount: 1},\n  'maxLength',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.pattern, datatype: xsd.string, maxCount: 1},\n  'pattern',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// PropertyShape.order / group\ncreatePropertyShape(\n  {path: shacl.order, datatype: xsd.integer, maxCount: 1},\n  'order',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape({path: shacl.group, maxCount: 1}, 'group', shacl.Literal, PropertyShape);\n\n// PropertyShape.displayRank / displayHidden (core: display vocabulary).\n// These materialize onto the pure sh:NodeShape and so travel with an ejected app.\ncreatePropertyShape(\n  {path: coreOntology.displayRank, datatype: xsd.integer, maxCount: 1},\n  'displayRank',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.displayHidden, datatype: xsd.boolean, maxCount: 1},\n  'displayHidden',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// PropertyShape.contains (core:contains — persists the composition flag)\ncreatePropertyShape(\n  {path: coreOntology.contains, datatype: xsd.boolean, maxCount: 1},\n  'contains',\n  shacl.Literal,\n  PropertyShape,\n);\n\n// NodeShape.closed / ignoredProperties / dependent (deprecated, persisted only)\ncreatePropertyShape(\n  {path: shacl.closed, datatype: xsd.boolean, maxCount: 1},\n  'closed',\n  shacl.Literal,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: shacl.ignoredProperties, shape: Shape},\n  'ignoredProperties',\n  shacl.IRI,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.dependent, datatype: xsd.boolean, maxCount: 1},\n  'dependent',\n  shacl.Literal,\n  NodeShape,\n);\n\n// NodeShape.targetObjectsOf (sh:targetObjectsOf — values are predicate IRIs),\n// NodeShape.generated (core:generated — marks a shape core generates at sync time,\n// e.g. the `<propertyShape>.singleOwner` constraint, so catalog readers can skip it) and\n// NodeShape.generatedShapes (core:generatedShape — the shape owns the shapes generated from\n// it: `contains`, so deleting the shape deletes them).\ncreatePropertyShape(\n  {path: shacl.targetObjectsOf, shape: Shape},\n  'targetObjectsOf',\n  shacl.IRI,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.generated, datatype: xsd.boolean, maxCount: 1},\n  'generated',\n  shacl.Literal,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: coreOntology.generatedShape, shape: NodeShape, contains: true},\n  'generatedShapes',\n  shacl.IRI,\n  NodeShape,\n);\n\n// The terms of the generated single-owner constraint (`singleOwnerConstraint.ts`):\n// `sh:qualifiedValueShape [ sh:or ( [ sh:class A ] [ sh:class B ] ) ]` and\n// `sh:qualifiedMaxCount`. The qualified shape and the `sh:or` list are written without ids, so\n// they are blank nodes, deleted with their property shape by the blank-node cascade. The list\n// cells are `PathList`s (blank-capable `rdf:List` cells); like `sh:path`, `orShapes` declares no\n// value shape (`PathList.ts` imports `package.js`, which loads this module), so the create uses each value's own shape.\ncreatePropertyShape(\n  {path: shacl.qualifiedValueShape, shape: NodeShape, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI},\n  'qualifiedValueShape',\n  shacl.BlankNodeOrIRI,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.qualifiedMaxCount, datatype: xsd.integer, maxCount: 1},\n  'qualifiedMaxCount',\n  shacl.Literal,\n  PropertyShape,\n);\ncreatePropertyShape(\n  {path: shacl.class, shape: Shape, maxCount: 1},\n  'class',\n  shacl.IRI,\n  NodeShape,\n);\ncreatePropertyShape(\n  {path: shacl.or, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI},\n  // `or` is reserved (a DSL-JSON combinator), so the accessor is `orShapes`.\n  'orShapes',\n  shacl.BlankNodeOrIRI,\n  NodeShape,\n);\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@_linked/core",
-  "version": "2.30.1",
+  "version": "2.32.0",
   "packageManager": "npm@12.2.0",
   "license": "MIT",
   "linkedPackage": true,