@_linked/core 2.32.0 → 2.33.0

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # Changelog
 
+## 2.33.0
+
+### Minor Changes
+
+- [#340](https://github.com/linked-fw/core/pull/340) [`666e74c`](https://github.com/linked-fw/core/commit/666e74c8fc0b92d76c1cbcd4941738cd0c82ab5c) Thanks [@flyon](https://github.com/flyon)! - Shape sync skips unchanged shapes. Each synced NodeShape now stores `core:shapeHash`, a SHA-256 of the canonical data the sync writes for it (property shapes, `sh:in` lists, paths and generated single-owner shapes included). `syncShapes()` reads the stored hashes of all code shapes in one select and returns a delete→create thunk only for shapes whose hash is missing or differs, so syncing an unchanged app writes nothing and the plan length is the number of shapes actually written (plus pruned orphans). `syncShape()` does the same check inside its thunk. Shapes stored by earlier versions have no hash and are rewritten once. New option `force: true` (on `syncShapes` options and as a third `syncShape` argument) rewrites regardless — use it to repair a shape whose stored subtree was changed outside shape sync, which the hash does not detect.
+
 ## 2.32.0
 
 ### Minor Changes

package/lib/esm/index.d.ts

@@ -1,6 +1,7 @@
 import './shapes/index.js';
 import './live.js';
 export { syncShapes, syncShape } from './shapes/syncShapes.js';
+export type { SyncShapesOptions, SyncShapeOptions } from './shapes/syncShapes.js';
 export { singleOwnerShapeIri, singleOwnerProperties, buildSingleOwnerConstraints, } from './shapes/singleOwnerConstraint.js';
 export { rdfList } from './shapes/List.js';
 export { serializePathToNodeData } from './shapes/serializePathToNodeData.js';

package/lib/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,0DAA0D;AAC1D,OAAO,mBAAmB,CAAC;AAC3B,8EAA8E;AAC9E,OAAO,WAAW,CAAC;AACnB,OAAO,EAAC,UAAU,EAAE,SAAS,EAAC,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EACL,mBAAmB,EACnB,qBAAqB,EACrB,2BAA2B,GAC5B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAC,OAAO,EAAC,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAC,uBAAuB,EAAC,MAAM,qCAAqC,CAAC;AAC5E,sEAAsE;AACtE,OAAO,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AACxC,kEAAkE;AAClE,OAAO,EAAC,QAAQ,EAAE,WAAW,EAAE,oBAAoB,EAAC,MAAM,wBAAwB,CAAC;AAQnF,OAAO,EAAC,aAAa,EAAC,MAAM,0BAA0B,CAAC;AACvD,2CAA2C;AAC3C,OAAO,EAAC,aAAa,EAAE,YAAY,EAAC,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAAC,KAAK,EAAC,MAAM,oBAAoB,CAAC;AAEzC,OAAO,EAAC,QAAQ,EAAC,MAAM,uBAAuB,CAAC;AAE/C,OAAO,EACL,eAAe,EACf,eAAe,EACf,qBAAqB,EACrB,mBAAmB,EACnB,sBAAsB,GACvB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAC,sBAAsB,EAAC,MAAM,4BAA4B,CAAC;AAElE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAC,YAAY,EAAE,gBAAgB,EAAC,MAAM,2BAA2B,CAAC;AAEzE,sBAAsB;AACtB,OAAO,EAAC,QAAQ,EAAC,MAAM,uBAAuB,CAAC;AAM/C,+BAA+B;AAC/B,OAAO,EAAC,UAAU,EAAE,UAAU,EAAC,MAAM,yBAAyB,CAAC;AAG/D,OAAO,EAAC,YAAY,EAAE,YAAY,EAAC,MAAM,2BAA2B,CAAC;AAGrE,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AAGzD,8CAA8C;AAC9C,OAAO,EAAC,cAAc,EAAC,MAAM,iCAAiC,CAAC;AAE/D,OAAO,EAAC,IAAI,EAAC,MAAM,uBAAuB,CAAC;AAe3C,sEAAsE;AACtE,OAAO,EACL,cAAc,EACd,WAAW,GACZ,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,cAAc,EACd,iBAAiB,GAClB,MAAM,gCAAgC,CAAC;AAWxC,0FAA0F;AAC1F,OAAO,EAAC,iBAAiB,EAAE,eAAe,EAAC,MAAM,gCAAgC,CAAC;AAElF,OAAO,EAAC,qBAAqB,EAAC,MAAM,2BAA2B,CAAC;AAEhE,mDAAmD;AACnD,OAAO,EAAC,cAAc,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,aAAa,EAAE,UAAU,EAAC,MAAM,0BAA0B,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\n// Registers every shape core defines (side effects only).\nimport './shapes/index.js';\n// Registers the live-query store so `query.live()` works (side effects only).\nimport './live.js';\nexport {syncShapes, syncShape} from './shapes/syncShapes.js';\nexport {\n  singleOwnerShapeIri,\n  singleOwnerProperties,\n  buildSingleOwnerConstraints,\n} from './shapes/singleOwnerConstraint.js';\nexport {rdfList} from './shapes/List.js';\nexport {serializePathToNodeData} from './shapes/serializePathToNodeData.js';\n// Core public API surface (documented as root imports in the README).\nexport {Shape} from './shapes/Shape.js';\n// SHACL-aligned validation of plain data objects against a shape.\nexport {validate, assertValid, ShapeValidationError} from './shapes/validation.js';\nexport type {\n  ValidationReport,\n  ValidationResult,\n  ValidationMode,\n  ValidateOptions,\n  ValidatableShape,\n} from './shapes/validation.js';\nexport {LinkedStorage} from './utils/LinkedStorage.js';\n// New dynamic query building API (Phase 2)\nexport {SelectBuilder, QueryBuilder} from './queries/QueryBuilder.js';\nexport {lower} from './queries/lower.js';\nexport type {LowerableQuery} from './queries/lower.js';\nexport {fromJSON} from './queries/fromJSON.js';\nexport type {QueryJSON} from './queries/fromJSON.js';\nexport {\n  getQueryContext,\n  setQueryContext,\n  subscribeQueryContext,\n  PendingQueryContext,\n  UnresolvedContextError,\n} from './queries/QueryContext.js';\nexport {subscribeQueryDispatch} from './queries/queryDispatch.js';\nexport type {QueryDispatchEvent, QueryDispatchListener} from './queries/queryDispatch.js';\nexport {\n  CONTEXT_REF_KEY,\n  encodeContextRef,\n  isContextRefJSON,\n  resolveContextId,\n} from './queries/ContextRef.js';\nexport type {ContextRefJSON} from './queries/ContextRef.js';\nexport {PropertyPath, walkPropertyPath} from './queries/PropertyPath.js';\n\n// Phase 3a — FieldSet\nexport {FieldSet} from './queries/FieldSet.js';\nexport type {FieldSetEntry, FieldSetInput, FieldSetJSON, FieldSetFieldJSON} from './queries/FieldSet.js';\n\n// Phase 4 — Serialization types\nexport type {QueryBuilderJSON} from './queries/QueryBuilder.js';\n\n// Phase 3b — Mutation builders\nexport {AskBuilder, isAskQuery} from './queries/AskBuilder.js';\nexport type {AskSpec} from './queries/AskBuilder.js';\nexport type {AskQuery, AskQueryJSON, RawAskInput} from './queries/AskQuery.js';\nexport {CountBuilder, isCountQuery} from './queries/CountBuilder.js';\nexport type {CountSpec} from './queries/CountBuilder.js';\nexport type {CountQuery, CountQueryJSON, RawCountInput} from './queries/CountQuery.js';\nexport {CreateBuilder} from './queries/CreateBuilder.js';\nexport {UpdateBuilder} from './queries/UpdateBuilder.js';\nexport {DeleteBuilder} from './queries/DeleteBuilder.js';\nexport type {DeleteId} from './queries/DeleteBuilder.js';\n\n// Expressions — computed fields and functions\nexport {ExpressionNode} from './expressions/ExpressionNode.js';\nexport type {ExpressionInput, PropertyRefMap} from './expressions/ExpressionNode.js';\nexport {Expr} from './expressions/Expr.js';\nexport type {\n  ExpressionUpdateProxy,\n  ExpressionUpdateResult,\n  BaseExpressionMethods,\n  NumericExpressionMethods,\n  StringExpressionMethods,\n  DateExpressionMethods,\n  BooleanExpressionMethods,\n} from './expressions/ExpressionMethods.js';\n\n// Phase 5 — Component query integration\nexport type {LinkedComponentInterface, QueryComponentLike} from './queries/SelectQuery.js';\n\n\n// Mutation DSL-JSON serialization (create/update/delete to/from JSON)\nexport {\n  encodeNodeData,\n  encodeValue,\n} from './queries/MutationSerialization.js';\nexport {\n  decodeNodeData,\n  lowerMutationJSON,\n} from './queries/lowerMutationJSON.js';\nexport type {\n  MutationJSON,\n  CreateMutationJSON,\n  UpdateMutationJSON,\n  DeleteMutationJSON,\n  MutationValueJSON,\n  MutationNodeDataJSON,\n} from './queries/MutationSerialization.js';\n\n\n// Live-query dependency helpers — what a query reads and a mutation writes, as predicates\nexport {queryDependencies, mutationEffects} from './queries/queryDependencies.js';\nexport type {QueryDependencies, MutationEffects} from './queries/queryDependencies.js';\nexport {findPropertyShapeById} from './shapes/nodeShapeData.js';\n\n// Live queries — see documentation/live-queries.md\nexport {LiveQueryStore, getLiveQueryStore, resetLiveQueryStore, publishChange, invalidate} from './live/LiveQueryStore.js';\nexport type {ChangeEvent} from './live/changes.js';\nexport type {\n  LiveQuery,\n  LiveState,\n  LiveStatus,\n  LiveListener,\n  LiveQueryOptions,\n  LiveQueryStoreOptions,\n} from './live/LiveQueryStore.js';\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,0DAA0D;AAC1D,OAAO,mBAAmB,CAAC;AAC3B,8EAA8E;AAC9E,OAAO,WAAW,CAAC;AACnB,OAAO,EAAC,UAAU,EAAE,SAAS,EAAC,MAAM,wBAAwB,CAAC;AAE7D,OAAO,EACL,mBAAmB,EACnB,qBAAqB,EACrB,2BAA2B,GAC5B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAC,OAAO,EAAC,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAC,uBAAuB,EAAC,MAAM,qCAAqC,CAAC;AAC5E,sEAAsE;AACtE,OAAO,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AACxC,kEAAkE;AAClE,OAAO,EAAC,QAAQ,EAAE,WAAW,EAAE,oBAAoB,EAAC,MAAM,wBAAwB,CAAC;AAQnF,OAAO,EAAC,aAAa,EAAC,MAAM,0BAA0B,CAAC;AACvD,2CAA2C;AAC3C,OAAO,EAAC,aAAa,EAAE,YAAY,EAAC,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAAC,KAAK,EAAC,MAAM,oBAAoB,CAAC;AAEzC,OAAO,EAAC,QAAQ,EAAC,MAAM,uBAAuB,CAAC;AAE/C,OAAO,EACL,eAAe,EACf,eAAe,EACf,qBAAqB,EACrB,mBAAmB,EACnB,sBAAsB,GACvB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAC,sBAAsB,EAAC,MAAM,4BAA4B,CAAC;AAElE,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAC,YAAY,EAAE,gBAAgB,EAAC,MAAM,2BAA2B,CAAC;AAEzE,sBAAsB;AACtB,OAAO,EAAC,QAAQ,EAAC,MAAM,uBAAuB,CAAC;AAM/C,+BAA+B;AAC/B,OAAO,EAAC,UAAU,EAAE,UAAU,EAAC,MAAM,yBAAyB,CAAC;AAG/D,OAAO,EAAC,YAAY,EAAE,YAAY,EAAC,MAAM,2BAA2B,CAAC;AAGrE,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAC,aAAa,EAAC,MAAM,4BAA4B,CAAC;AAGzD,8CAA8C;AAC9C,OAAO,EAAC,cAAc,EAAC,MAAM,iCAAiC,CAAC;AAE/D,OAAO,EAAC,IAAI,EAAC,MAAM,uBAAuB,CAAC;AAe3C,sEAAsE;AACtE,OAAO,EACL,cAAc,EACd,WAAW,GACZ,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,cAAc,EACd,iBAAiB,GAClB,MAAM,gCAAgC,CAAC;AAWxC,0FAA0F;AAC1F,OAAO,EAAC,iBAAiB,EAAE,eAAe,EAAC,MAAM,gCAAgC,CAAC;AAElF,OAAO,EAAC,qBAAqB,EAAC,MAAM,2BAA2B,CAAC;AAEhE,mDAAmD;AACnD,OAAO,EAAC,cAAc,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,aAAa,EAAE,UAAU,EAAC,MAAM,0BAA0B,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\n// Registers every shape core defines (side effects only).\nimport './shapes/index.js';\n// Registers the live-query store so `query.live()` works (side effects only).\nimport './live.js';\nexport {syncShapes, syncShape} from './shapes/syncShapes.js';\nexport type {SyncShapesOptions, SyncShapeOptions} from './shapes/syncShapes.js';\nexport {\n  singleOwnerShapeIri,\n  singleOwnerProperties,\n  buildSingleOwnerConstraints,\n} from './shapes/singleOwnerConstraint.js';\nexport {rdfList} from './shapes/List.js';\nexport {serializePathToNodeData} from './shapes/serializePathToNodeData.js';\n// Core public API surface (documented as root imports in the README).\nexport {Shape} from './shapes/Shape.js';\n// SHACL-aligned validation of plain data objects against a shape.\nexport {validate, assertValid, ShapeValidationError} from './shapes/validation.js';\nexport type {\n  ValidationReport,\n  ValidationResult,\n  ValidationMode,\n  ValidateOptions,\n  ValidatableShape,\n} from './shapes/validation.js';\nexport {LinkedStorage} from './utils/LinkedStorage.js';\n// New dynamic query building API (Phase 2)\nexport {SelectBuilder, QueryBuilder} from './queries/QueryBuilder.js';\nexport {lower} from './queries/lower.js';\nexport type {LowerableQuery} from './queries/lower.js';\nexport {fromJSON} from './queries/fromJSON.js';\nexport type {QueryJSON} from './queries/fromJSON.js';\nexport {\n  getQueryContext,\n  setQueryContext,\n  subscribeQueryContext,\n  PendingQueryContext,\n  UnresolvedContextError,\n} from './queries/QueryContext.js';\nexport {subscribeQueryDispatch} from './queries/queryDispatch.js';\nexport type {QueryDispatchEvent, QueryDispatchListener} from './queries/queryDispatch.js';\nexport {\n  CONTEXT_REF_KEY,\n  encodeContextRef,\n  isContextRefJSON,\n  resolveContextId,\n} from './queries/ContextRef.js';\nexport type {ContextRefJSON} from './queries/ContextRef.js';\nexport {PropertyPath, walkPropertyPath} from './queries/PropertyPath.js';\n\n// Phase 3a — FieldSet\nexport {FieldSet} from './queries/FieldSet.js';\nexport type {FieldSetEntry, FieldSetInput, FieldSetJSON, FieldSetFieldJSON} from './queries/FieldSet.js';\n\n// Phase 4 — Serialization types\nexport type {QueryBuilderJSON} from './queries/QueryBuilder.js';\n\n// Phase 3b — Mutation builders\nexport {AskBuilder, isAskQuery} from './queries/AskBuilder.js';\nexport type {AskSpec} from './queries/AskBuilder.js';\nexport type {AskQuery, AskQueryJSON, RawAskInput} from './queries/AskQuery.js';\nexport {CountBuilder, isCountQuery} from './queries/CountBuilder.js';\nexport type {CountSpec} from './queries/CountBuilder.js';\nexport type {CountQuery, CountQueryJSON, RawCountInput} from './queries/CountQuery.js';\nexport {CreateBuilder} from './queries/CreateBuilder.js';\nexport {UpdateBuilder} from './queries/UpdateBuilder.js';\nexport {DeleteBuilder} from './queries/DeleteBuilder.js';\nexport type {DeleteId} from './queries/DeleteBuilder.js';\n\n// Expressions — computed fields and functions\nexport {ExpressionNode} from './expressions/ExpressionNode.js';\nexport type {ExpressionInput, PropertyRefMap} from './expressions/ExpressionNode.js';\nexport {Expr} from './expressions/Expr.js';\nexport type {\n  ExpressionUpdateProxy,\n  ExpressionUpdateResult,\n  BaseExpressionMethods,\n  NumericExpressionMethods,\n  StringExpressionMethods,\n  DateExpressionMethods,\n  BooleanExpressionMethods,\n} from './expressions/ExpressionMethods.js';\n\n// Phase 5 — Component query integration\nexport type {LinkedComponentInterface, QueryComponentLike} from './queries/SelectQuery.js';\n\n\n// Mutation DSL-JSON serialization (create/update/delete to/from JSON)\nexport {\n  encodeNodeData,\n  encodeValue,\n} from './queries/MutationSerialization.js';\nexport {\n  decodeNodeData,\n  lowerMutationJSON,\n} from './queries/lowerMutationJSON.js';\nexport type {\n  MutationJSON,\n  CreateMutationJSON,\n  UpdateMutationJSON,\n  DeleteMutationJSON,\n  MutationValueJSON,\n  MutationNodeDataJSON,\n} from './queries/MutationSerialization.js';\n\n\n// Live-query dependency helpers — what a query reads and a mutation writes, as predicates\nexport {queryDependencies, mutationEffects} from './queries/queryDependencies.js';\nexport type {QueryDependencies, MutationEffects} from './queries/queryDependencies.js';\nexport {findPropertyShapeById} from './shapes/nodeShapeData.js';\n\n// Live queries — see documentation/live-queries.md\nexport {LiveQueryStore, getLiveQueryStore, resetLiveQueryStore, publishChange, invalidate} from './live/LiveQueryStore.js';\nexport type {ChangeEvent} from './live/changes.js';\nexport type {\n  LiveQuery,\n  LiveState,\n  LiveStatus,\n  LiveListener,\n  LiveQueryOptions,\n  LiveQueryStoreOptions,\n} from './live/LiveQueryStore.js';\n"]}

package/lib/esm/ontologies/linked-core.d.ts

@@ -16,4 +16,5 @@ export declare const coreOntology: {
     displayHidden: NodeReferenceValue;
     generated: NodeReferenceValue;
     generatedShape: NodeReferenceValue;
+    shapeHash: NodeReferenceValue;
 };

package/lib/esm/ontologies/linked-core.js

@@ -48,6 +48,10 @@ const generated = ns('generated');
 // single-owner constraint of each `contains` property). It is `contains`, so deleting the
 // shape deletes them, and sync writes them nested in the shape's own create.
 const generatedShape = ns('generatedShape');
+// Content hash of everything shape sync writes for a NodeShape (the shape, its property shapes,
+// lists, paths and generated shapes), stored on the NodeShape. A sync skips a shape whose stored
+// hash equals the hash of what it would write.
+const shapeHash = ns('shapeHash');
 export const coreOntology = {
     Package,
     ShapeClass,
@@ -63,5 +67,6 @@ export const coreOntology = {
     displayHidden,
     generated,
     generatedShape,
+    shapeHash,
 };
 //# sourceMappingURL=linked-core.js.map

package/lib/esm/ontologies/linked-core.js.map

@@ -1 +1 @@
-{"version":3,"file":"linked-core.js","sourceRoot":"","sources":["../../../src/ontologies/linked-core.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,MAAM,EAAC,MAAM,oBAAoB,CAAC;AAE1C,sFAAsF;AACtF,wCAAwC;AACxC,qDAAqD;AACrD,6FAA6F;AAC7F,gGAAgG;AAChG,oEAAoE;AACpE,MAAM,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,6BAA6B,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,KAAK,GAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;AAChD,6FAA6F;AAC7F,0FAA0F;AAC1F,oEAAoE;AACpE,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;AACpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;AAE7B,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AACxC,MAAM,cAAc,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AACpC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AAEtC,sCAAsC;AACtC,0FAA0F;AAC1F,0DAA0D;AAC1D,0FAA0F;AAC1F,iGAAiG;AACjG,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAEhC,oFAAoF;AACpF,oFAAoF;AACpF,mFAAmF;AACnF,oFAAoF;AACpF,mFAAmF;AACnF,0EAA0E;AAC1E,EAAE;AACF,mFAAmF;AACnF,kFAAkF;AAClF,qFAAqF;AACrF,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAE1C,uFAAuF;AACvF,kGAAkG;AAClG,8EAA8E;AAC9E,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAElC,yFAAyF;AACzF,0FAA0F;AAC1F,6EAA6E;AAC7E,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,OAAO;IACP,UAAU;IACV,YAAY;IACZ,MAAM,EAAE,cAAc;IACtB,cAAc;IACd,UAAU;IACV,WAAW;IACX,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,WAAW;IACX,aAAa;IACb,SAAS;IACT,cAAc;CACf,CAAC","sourcesContent":["import type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {createNameSpace} from '../utils/NameSpace.js';\nimport {Prefix} from '../utils/Prefix.js';\n\n// The @_linked/core framework vocabulary. First-party ontology IRIs follow Create Now\n// arch-02 §\"Public ontology namespace\":\n//   https://linked.cm/ont/{ontologySlug}/{localName}\n// where ontologySlug defaults to the owning package's publicSlug (`@_linked/core` -> `core`)\n// and the prefix label equals the ontologySlug. Previously `https://linked.cm/ont/linked-core/`\n// (prefix `linked_core`), a leftover of a reverted slug derivation.\nexport const ns = createNameSpace('https://linked.cm/ont/core/');\nexport const _self: NodeReferenceValue = ns('');\n// @deprecated prefix alias: keeps `linked_core:` prefixed names resolving (to the NEW IRIs).\n// It does not make the old full IRIs match. Registered BEFORE `core` because the last add\n// wins for IRI -> prefix compaction, so output always uses `core:`.\nPrefix.add('linked_core', _self.id);\nPrefix.add('core', _self.id);\n\nconst Package = ns('Package');\nconst ShapeClass = ns('ShapeClass');\nconst definesShape = ns('definesShape');\nconst moduleProperty = ns('module');\nconst usesShapeClass = ns('usesShapeClass');\nconst editInline = ns('editInline');\nconst isExtending = ns('isExtending');\n\n// Containment / lifecycle vocabulary.\n//   contains  — property characteristic: the subject owns the value through this property\n//               (composition); the owned walk follows it.\n//   dependent — shape characteristic, deprecated: no effect (persisted for older shapes).\n//   PathNode  — class for SHACL property-path operator nodes (sh:inversePath/alternativePath/…).\nconst contains = ns('contains');\nconst dependent = ns('dependent');\nconst PathNode = ns('PathNode');\n\n// Display vocabulary. SHACL has `sh:order` and `sh:group`, which say how properties\n// are arranged; it has no way to say how *important* a property is, which is what a\n// renderer needs when it can only show one, three or six of them. `displayRank` is\n// that: a single linear rank per property, lower = more important, from which every\n// truncated context (\"show the top 3\") derives. `displayHidden` removes a property\n// from generic rendering without changing its cardinality or its meaning.\n//\n// Placement is deliberate (backlog-029): this is an ecosystem SHACL extension that\n// materializes onto the pure `sh:NodeShape` and therefore travels with an ejected\n// app — NOT the CN-proprietary `code:` vocab, which describes source-code structure.\nconst displayRank = ns('displayRank');\nconst displayHidden = ns('displayHidden');\n\n// Provenance marker: a NodeShape core generates at sync time from another shape's code\n// (today the `<propertyShape>.singleOwner` constraint derived from `contains`), rather than one a\n// developer declared. Catalog readers skip shapes with `core:generated true`.\nconst generated = ns('generated');\n\n// Ownership edge from a NodeShape to the shapes core generated from it at sync time (the\n// single-owner constraint of each `contains` property). It is `contains`, so deleting the\n// shape deletes them, and sync writes them nested in the shape's own create.\nconst generatedShape = ns('generatedShape');\n\nexport const coreOntology = {\n  Package,\n  ShapeClass,\n  definesShape,\n  module: moduleProperty,\n  usesShapeClass,\n  editInline,\n  isExtending,\n  contains,\n  dependent,\n  PathNode,\n  displayRank,\n  displayHidden,\n  generated,\n  generatedShape,\n};\n"]}
+{"version":3,"file":"linked-core.js","sourceRoot":"","sources":["../../../src/ontologies/linked-core.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AACtD,OAAO,EAAC,MAAM,EAAC,MAAM,oBAAoB,CAAC;AAE1C,sFAAsF;AACtF,wCAAwC;AACxC,qDAAqD;AACrD,6FAA6F;AAC7F,gGAAgG;AAChG,oEAAoE;AACpE,MAAM,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,6BAA6B,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,KAAK,GAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;AAChD,6FAA6F;AAC7F,0FAA0F;AAC1F,oEAAoE;AACpE,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;AACpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;AAE7B,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AACxC,MAAM,cAAc,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AACpC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AAEtC,sCAAsC;AACtC,0FAA0F;AAC1F,0DAA0D;AAC1D,0FAA0F;AAC1F,iGAAiG;AACjG,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAEhC,oFAAoF;AACpF,oFAAoF;AACpF,mFAAmF;AACnF,oFAAoF;AACpF,mFAAmF;AACnF,0EAA0E;AAC1E,EAAE;AACF,mFAAmF;AACnF,kFAAkF;AAClF,qFAAqF;AACrF,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAE1C,uFAAuF;AACvF,kGAAkG;AAClG,8EAA8E;AAC9E,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAElC,yFAAyF;AACzF,0FAA0F;AAC1F,6EAA6E;AAC7E,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAE5C,gGAAgG;AAChG,iGAAiG;AACjG,+CAA+C;AAC/C,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAElC,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,OAAO;IACP,UAAU;IACV,YAAY;IACZ,MAAM,EAAE,cAAc;IACtB,cAAc;IACd,UAAU;IACV,WAAW;IACX,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,WAAW;IACX,aAAa;IACb,SAAS;IACT,cAAc;IACd,SAAS;CACV,CAAC","sourcesContent":["import type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {createNameSpace} from '../utils/NameSpace.js';\nimport {Prefix} from '../utils/Prefix.js';\n\n// The @_linked/core framework vocabulary. First-party ontology IRIs follow Create Now\n// arch-02 §\"Public ontology namespace\":\n//   https://linked.cm/ont/{ontologySlug}/{localName}\n// where ontologySlug defaults to the owning package's publicSlug (`@_linked/core` -> `core`)\n// and the prefix label equals the ontologySlug. Previously `https://linked.cm/ont/linked-core/`\n// (prefix `linked_core`), a leftover of a reverted slug derivation.\nexport const ns = createNameSpace('https://linked.cm/ont/core/');\nexport const _self: NodeReferenceValue = ns('');\n// @deprecated prefix alias: keeps `linked_core:` prefixed names resolving (to the NEW IRIs).\n// It does not make the old full IRIs match. Registered BEFORE `core` because the last add\n// wins for IRI -> prefix compaction, so output always uses `core:`.\nPrefix.add('linked_core', _self.id);\nPrefix.add('core', _self.id);\n\nconst Package = ns('Package');\nconst ShapeClass = ns('ShapeClass');\nconst definesShape = ns('definesShape');\nconst moduleProperty = ns('module');\nconst usesShapeClass = ns('usesShapeClass');\nconst editInline = ns('editInline');\nconst isExtending = ns('isExtending');\n\n// Containment / lifecycle vocabulary.\n//   contains  — property characteristic: the subject owns the value through this property\n//               (composition); the owned walk follows it.\n//   dependent — shape characteristic, deprecated: no effect (persisted for older shapes).\n//   PathNode  — class for SHACL property-path operator nodes (sh:inversePath/alternativePath/…).\nconst contains = ns('contains');\nconst dependent = ns('dependent');\nconst PathNode = ns('PathNode');\n\n// Display vocabulary. SHACL has `sh:order` and `sh:group`, which say how properties\n// are arranged; it has no way to say how *important* a property is, which is what a\n// renderer needs when it can only show one, three or six of them. `displayRank` is\n// that: a single linear rank per property, lower = more important, from which every\n// truncated context (\"show the top 3\") derives. `displayHidden` removes a property\n// from generic rendering without changing its cardinality or its meaning.\n//\n// Placement is deliberate (backlog-029): this is an ecosystem SHACL extension that\n// materializes onto the pure `sh:NodeShape` and therefore travels with an ejected\n// app — NOT the CN-proprietary `code:` vocab, which describes source-code structure.\nconst displayRank = ns('displayRank');\nconst displayHidden = ns('displayHidden');\n\n// Provenance marker: a NodeShape core generates at sync time from another shape's code\n// (today the `<propertyShape>.singleOwner` constraint derived from `contains`), rather than one a\n// developer declared. Catalog readers skip shapes with `core:generated true`.\nconst generated = ns('generated');\n\n// Ownership edge from a NodeShape to the shapes core generated from it at sync time (the\n// single-owner constraint of each `contains` property). It is `contains`, so deleting the\n// shape deletes them, and sync writes them nested in the shape's own create.\nconst generatedShape = ns('generatedShape');\n\n// Content hash of everything shape sync writes for a NodeShape (the shape, its property shapes,\n// lists, paths and generated shapes), stored on the NodeShape. A sync skips a shape whose stored\n// hash equals the hash of what it would write.\nconst shapeHash = ns('shapeHash');\n\nexport const coreOntology = {\n  Package,\n  ShapeClass,\n  definesShape,\n  module: moduleProperty,\n  usesShapeClass,\n  editInline,\n  isExtending,\n  contains,\n  dependent,\n  PathNode,\n  displayRank,\n  displayHidden,\n  generated,\n  generatedShape,\n  shapeHash,\n};\n"]}

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

@@ -7,6 +7,33 @@ import type { IDataset } from '../interfaces/IDataset.js';
  * @internal Exported for tests only — not part of the public API.
  */
 export declare function buildPropertyShapeData(ps: PropertyShapeData, shapeIri: string): Record<string, unknown>;
+/**
+ * Version of the {@link shapeSyncHash} input. Bump it whenever core changes the SHACL it writes
+ * for a shape (a serialization change that the create data itself does not show), so every stored
+ * shape is rewritten once by the next sync. Without a bump, stores keep the old triples: their
+ * stored hashes still match, so the sync skips them.
+ *
+ * Enforced by `shape-sync-output-equivalence.test.ts`: its golden SHACL output is recorded in
+ * `SHAPE_HASH_LEDGER` with the version it was generated for, and regenerating the golden without
+ * bumping this constant fails that test. To change the output: bump this by one, update the
+ * golden, and append `{version, goldenDigest}` to the ledger (never edit an existing entry).
+ *
+ * @internal Exported for tests only — not part of the public API.
+ */
+export declare const SHAPE_HASH_VERSION = 1;
+/**
+ * The content hash shape sync stores on a NodeShape as `core:shapeHash`: SHA-256 (hex) of the
+ * canonical form of the shape IRI and the exact create data the sync writes for it — the
+ * NodeShape, its flattened own + inherited property shapes, their `sh:in` lists and paths, and
+ * the generated single-owner shapes it owns (whose owner classes come from the registered
+ * sub-shapes, so registering a new sub-shape changes the hash of the declaring shape).
+ *
+ * Deterministic across processes, runtimes and Node versions: no blank-node labels, no object key
+ * order, no array order (see {@link canonicalize}).
+ *
+ * @internal Exported for tests only — not part of the public API.
+ */
+export declare function shapeSyncHash(data: Record<string, unknown>, shapeIri: string): string;
 /** Options controlling how {@link syncShapes} treats store shapes that are not in code. */
 export interface SyncShapesOptions {
     /**
@@ -27,6 +54,18 @@ export interface SyncShapesOptions {
      * `'all'` and `'ownedNamespaces'` are destructive and must be requested explicitly.
      */
     orphanScope?: 'all' | 'ownedNamespaces' | 'none';
+    /**
+     * Rewrite every code shape, even one whose stored `core:shapeHash` matches. Default `false`:
+     * a shape is rewritten only when its hash differs or is missing. Use it to repair a shape
+     * whose stored subtree was edited or partly deleted outside shape sync (the hash describes
+     * what sync last wrote, not what is in the store now).
+     */
+    force?: boolean;
+}
+/** Options for {@link syncShape}. */
+export interface SyncShapeOptions {
+    /** Rewrite the shape even when its stored `core:shapeHash` matches. See {@link SyncShapesOptions.force}. */
+    force?: boolean;
 }
 /**
  * Plan an idempotent sync of all code-registered (non-framework) NodeShapes into the store as
@@ -39,6 +78,15 @@ export interface SyncShapesOptions {
  * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old
  * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).
  *
+ * **Unchanged shapes are skipped.** The create stores a content hash of everything it writes for
+ * the shape on the NodeShape (`core:shapeHash`, see {@link shapeSyncHash}). The plan reads the
+ * stored hashes of all code shapes in one select and builds a thunk only for a shape whose hash
+ * is missing (never synced, or synced before hashes existed) or differs. Syncing an unchanged
+ * app therefore returns no write thunks, and the length of the plan is the number of shapes
+ * actually written plus the pruned orphans. The hash records what sync last wrote, not what the
+ * store holds now: a subtree edited or partly deleted by another writer while the NodeShape and
+ * its hash survive is not detected. `options.force` rewrites every code shape.
+ *
  * **Shapes in the store but not registered in this process are left alone by default**
  * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and
  * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a
@@ -55,8 +103,8 @@ export interface SyncShapesOptions {
  * with `'none'` no read is made.
  *
  * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**
- * parameter: it feeds both the orphan-detection read (so orphans are computed against the same
- * store they'll be pruned from) and every delete/create thunk. Omitted → the global router;
+ * parameter: it feeds the stored-hash read and the orphan-detection read (so both are computed
+ * against the same store they'll be written to) and every delete/create thunk. Omitted → the global router;
  * the returned thunks stay nullary either way.
  */
 export declare function syncShapes(ds?: IDataset, options?: SyncShapesOptions): Promise<Array<() => Promise<void>>>;
@@ -71,9 +119,12 @@ export declare function syncShapes(ds?: IDataset, options?: SyncShapesOptions):
  *   its registered class via `getShapeClass`; the shape must be code-registered.
  * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete
  *   and the create run against it instead of the global router. Omitted → global behavior.
+ * @param options `force: true` rewrites the shape even when its stored hash matches.
  * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch
  *   several together — e.g. a shape plus its referenced object-property shapes:
  *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.
+ *   Unless `force` is set, the thunk first reads the shape's stored `core:shapeHash` and writes
+ *   nothing when it equals the hash of what it would write (see {@link syncShapes}).
  * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.
  */
-export declare function syncShape(target: typeof Shape | string, ds?: IDataset): () => Promise<void>;
+export declare function syncShape(target: typeof Shape | string, ds?: IDataset, options?: SyncShapeOptions): () => Promise<void>;

package/lib/esm/shapes/syncShapes.js

@@ -19,6 +19,8 @@ import { DeleteBuilder } from '../queries/DeleteBuilder.js';
 import { rdfList } from './List.js';
 import { serializePathToNodeData } from './serializePathToNodeData.js';
 import { buildSingleOwnerConstraints } from './singleOwnerConstraint.js';
+import { QueryBuilder } from '../queries/QueryBuilder.js';
+import { sha256Hex } from '../utils/sha256.js';
 /**
  * The npm scope of framework shapes (NodeShape/PropertyShape/List/PathNode/Shape) that
  * describe the meta-model itself and must never be synced as user data.
@@ -129,10 +131,106 @@ function buildNodeShapeData(nodeShape, shapeIri) {
     }
     return d;
 }
+/**
+ * Version of the {@link shapeSyncHash} input. Bump it whenever core changes the SHACL it writes
+ * for a shape (a serialization change that the create data itself does not show), so every stored
+ * shape is rewritten once by the next sync. Without a bump, stores keep the old triples: their
+ * stored hashes still match, so the sync skips them.
+ *
+ * Enforced by `shape-sync-output-equivalence.test.ts`: its golden SHACL output is recorded in
+ * `SHAPE_HASH_LEDGER` with the version it was generated for, and regenerating the golden without
+ * bumping this constant fails that test. To change the output: bump this by one, update the
+ * golden, and append `{version, goldenDigest}` to the ledger (never edit an existing entry).
+ *
+ * @internal Exported for tests only — not part of the public API.
+ */
+export const SHAPE_HASH_VERSION = 1;
+/**
+ * A canonical string for create-pipeline data: equal for equal data, independent of object key
+ * order and of the order of array values.
+ *
+ * Arrays are sorted because in create data an array is always a multi-valued property (a set of
+ * RDF values: `properties`, `generatedShapes`, `targetObjectsOf`, …). Ordered `rdf:List`s
+ * (`sh:in`, sequence and alternative paths, `sh:or`) are nested `first`/`rest` objects, so their
+ * order is kept by the structure. A shape class value (`shape: List`) is written as its NodeShape
+ * IRI. Values without ids (blank nodes once written) are compared by structure, so no blank-node
+ * label is ever part of the input.
+ */
+function canonicalize(value) {
+    var _a, _b;
+    if (value === null || value === undefined)
+        return 'null';
+    switch (typeof value) {
+        case 'string':
+            return JSON.stringify(value);
+        case 'number':
+            return `n:${Object.is(value, -0) ? '0' : String(value)}`;
+        case 'boolean':
+            return `b:${value}`;
+        case 'bigint':
+            return `i:${value.toString()}`;
+        case 'function': {
+            const shapeId = (_a = value.shape) === null || _a === void 0 ? void 0 : _a.id;
+            return `c:${JSON.stringify((_b = shapeId !== null && shapeId !== void 0 ? shapeId : value.name) !== null && _b !== void 0 ? _b : '')}`;
+        }
+    }
+    if (Array.isArray(value)) {
+        return `[${value.map(canonicalize).sort().join(',')}]`;
+    }
+    if (value instanceof Date)
+        return `d:${value.toISOString()}`;
+    if (value instanceof RegExp)
+        return `r:${JSON.stringify(value.source)}/${value.flags}`;
+    const record = value;
+    const keys = Object.keys(record)
+        .filter((k) => record[k] !== undefined)
+        .sort();
+    return `{${keys.map((k) => `${JSON.stringify(k)}:${canonicalize(record[k])}`).join(',')}}`;
+}
+/**
+ * The content hash shape sync stores on a NodeShape as `core:shapeHash`: SHA-256 (hex) of the
+ * canonical form of the shape IRI and the exact create data the sync writes for it — the
+ * NodeShape, its flattened own + inherited property shapes, their `sh:in` lists and paths, and
+ * the generated single-owner shapes it owns (whose owner classes come from the registered
+ * sub-shapes, so registering a new sub-shape changes the hash of the declaring shape).
+ *
+ * Deterministic across processes, runtimes and Node versions: no blank-node labels, no object key
+ * order, no array order (see {@link canonicalize}).
+ *
+ * @internal Exported for tests only — not part of the public API.
+ */
+export function shapeSyncHash(data, shapeIri) {
+    return sha256Hex(`linked-shape-sync/${SHAPE_HASH_VERSION}\n${canonicalize({ iri: shapeIri, data })}`);
+}
+/** The create data and its content hash for one shape, as the sync writes it. */
+function buildSyncData(nodeShape, iri) {
+    const data = buildNodeShapeData(nodeShape, iri);
+    return { data, hash: shapeSyncHash(data, iri) };
+}
+/**
+ * The stored `core:shapeHash` of each of `iris` that exists as a NodeShape, in one select. A shape
+ * that is absent, or stored without a hash (written before hashes existed), is missing from the
+ * map. `ds` targets an explicit dataset, as for the writes.
+ */
+function readStoredHashes(iris, ds) {
+    return __awaiter(this, void 0, void 0, function* () {
+        var _a;
+        const stored = new Map();
+        if (iris.length === 0)
+            return stored;
+        const rows = (_a = (yield QueryBuilder.from(NodeShape).select(['shapeHash']).forAll(iris).exec(ds))) !== null && _a !== void 0 ? _a : [];
+        for (const row of rows) {
+            if (row && typeof row.shapeHash === 'string')
+                stored.set(row.id, row.shapeHash);
+        }
+        return stored;
+    });
+}
 /**
  * The per-shape `delete → create` thunk shared by `syncShapes()` and `syncShape()`: exactly two
  * requests. The delete cascade-cleans the shape's old property-shape / list / path subtrees; the
- * create rebuilds them.
+ * create rebuilds them, and stores the content hash (`core:shapeHash`) of what it wrote on the
+ * NodeShape so a later sync can skip the shape while it is unchanged.
  *
  * The single-owner constraints generated from the shape's own `contains` properties
  * (`${iri}/${label}.singleOwner`, see `singleOwnerConstraint.ts`) are owned by the shape through
@@ -146,12 +244,16 @@ function buildNodeShapeData(nodeShape, shapeIri) {
  * global router. Omitted → today's global behavior.
  */
 function buildSyncThunk(nodeShape, iri, ds) {
-    return () => __awaiter(this, void 0, void 0, function* () {
-        // Build the data fresh on each invocation, so every run writes from the current
-        // shape metadata.
-        const data = buildNodeShapeData(nodeShape, iri);
+    // `writeShape` builds the data fresh on each invocation, so every run writes from the current
+    // shape metadata, and the hash stored with it always describes what was written.
+    return () => writeShape(nodeShape, iri, ds);
+}
+/** Delete (cascade) then create one shape, storing the hash of the written data. */
+function writeShape(nodeShape, iri, ds) {
+    return __awaiter(this, void 0, void 0, function* () {
+        const { data, hash } = buildSyncData(nodeShape, iri);
         yield DeleteBuilder.from(NodeShape, { id: iri }).exec(ds);
-        yield NodeShape.create(data).withId(iri).exec(ds);
+        yield NodeShape.create(Object.assign(Object.assign({}, data), { shapeHash: hash })).withId(iri).exec(ds);
     });
 }
 /** The generated single-owner shape IRIs a code shape writes. */
@@ -182,6 +284,15 @@ function shapeNamespace(iri) {
  * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old
  * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).
  *
+ * **Unchanged shapes are skipped.** The create stores a content hash of everything it writes for
+ * the shape on the NodeShape (`core:shapeHash`, see {@link shapeSyncHash}). The plan reads the
+ * stored hashes of all code shapes in one select and builds a thunk only for a shape whose hash
+ * is missing (never synced, or synced before hashes existed) or differs. Syncing an unchanged
+ * app therefore returns no write thunks, and the length of the plan is the number of shapes
+ * actually written plus the pruned orphans. The hash records what sync last wrote, not what the
+ * store holds now: a subtree edited or partly deleted by another writer while the NodeShape and
+ * its hash survive is not detected. `options.force` rewrites every code shape.
+ *
  * **Shapes in the store but not registered in this process are left alone by default**
  * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and
  * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a
@@ -198,8 +309,8 @@ function shapeNamespace(iri) {
  * with `'none'` no read is made.
  *
  * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**
- * parameter: it feeds both the orphan-detection read (so orphans are computed against the same
- * store they'll be pruned from) and every delete/create thunk. Omitted → the global router;
+ * parameter: it feeds the stored-hash read and the orphan-detection read (so both are computed
+ * against the same store they'll be written to) and every delete/create thunk. Omitted → the global router;
  * the returned thunks stay nullary either way.
  */
 export function syncShapes(ds, options) {
@@ -233,8 +344,15 @@ export function syncShapes(ds, options) {
         // Namespaces this process actually writes — the ownership scope for `'ownedNamespaces'` pruning.
         const ownedNamespaces = new Set(userShapes.map((s) => shapeNamespace(s.iri)));
         const thunks = [];
-        // 2. Per in-code shape: delete (cascade) then recreate.
+        // 2. Per in-code shape whose stored content hash is missing or differs: delete (cascade) then
+        //    recreate. An unchanged shape gets no thunk, so syncing an unchanged app writes nothing.
+        //    The stored hashes are read in one select, against the same `ds` the thunks target.
+        const storedHashes = (options === null || options === void 0 ? void 0 : options.force)
+            ? new Map()
+            : yield readStoredHashes(userShapes.map((s) => s.iri), ds);
         for (const { iri, nodeShape } of userShapes) {
+            if (!(options === null || options === void 0 ? void 0 : options.force) && storedHashes.get(iri) === buildSyncData(nodeShape, iri).hash)
+                continue;
             thunks.push(buildSyncThunk(nodeShape, iri, ds));
         }
         // 3. Orphan sweep (unless disabled). Identity-read existing NodeShape IRIs (ids only). Must hit
@@ -267,12 +385,15 @@ export function syncShapes(ds, options) {
  *   its registered class via `getShapeClass`; the shape must be code-registered.
  * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete
  *   and the create run against it instead of the global router. Omitted → global behavior.
+ * @param options `force: true` rewrites the shape even when its stored hash matches.
  * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch
  *   several together — e.g. a shape plus its referenced object-property shapes:
  *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.
+ *   Unless `force` is set, the thunk first reads the shape's stored `core:shapeHash` and writes
+ *   nothing when it equals the hash of what it would write (see {@link syncShapes}).
  * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.
  */
-export function syncShape(target, ds) {
+export function syncShape(target, ds, options) {
     // Normalize target → its registered shape class.
     const cls = typeof target === 'string' ? getShapeClass(target) : target;
     if (typeof target === 'string' && !cls) {
@@ -292,6 +413,13 @@ export function syncShape(target, ds) {
         throw new Error(`syncShape: refusing to sync framework/meta shape ${iri}`);
     }
     assertNoGeneratedIriCollision(nodeShape, iri, (id) => !!getShapeClass(id));
-    return buildSyncThunk(nodeShape, iri, ds);
+    if (options === null || options === void 0 ? void 0 : options.force)
+        return buildSyncThunk(nodeShape, iri, ds);
+    return () => __awaiter(this, void 0, void 0, function* () {
+        const stored = yield readStoredHashes([iri], ds);
+        if (stored.get(iri) === buildSyncData(nodeShape, iri).hash)
+            return;
+        yield writeShape(nodeShape, iri, ds);
+    });
 }
 //# sourceMappingURL=syncShapes.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"syncShapes.js","sourceRoot":"","sources":["../../../src/shapes/syncShapes.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,kBAAkB,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AACzE,OAAO,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AACrC,OAAO,EACL,uBAAuB,GAGxB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAC,aAAa,EAAC,MAAM,6BAA6B,CAAC;AAE1D,OAAO,EAAC,OAAO,EAAC,MAAM,WAAW,CAAC;AAClC,OAAO,EAAC,uBAAuB,EAAC,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAC,2BAA2B,EAAC,MAAM,4BAA4B,CAAC;AAEvE;;;GAGG;AACH,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAE1C;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB,EAAE,QAAgB;IAC5E,MAAM,KAAK,GAAG,GAAG,QAAQ,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IACxC,MAAM,CAAC,GAA4B;QACjC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,uBAAuB,CAAC,EAAE,CAAC,IAAI,CAAC;KACvC,CAAC;IACF,+EAA+E;IAC/E,+EAA+E;IAC/E,sCAAsC;IACtC,EAAE;IACF,8EAA8E;IAC9E,8EAA8E;IAC9E,iFAAiF;IACjF,gFAAgF;IAChF,4EAA4E;IAC5E,iFAAiF;IACjF,iEAAiE;IACjE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,EAAE,CAAC,IAAI;QAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IAC9B,IAAI,EAAE,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACnD,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACrD,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,OAAO,EAAE,CAAC,WAAW,KAAK,QAAQ;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACvE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;QAAE,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,aAAa,CAAC;IACvE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAC,IAAI,EAAE,GAAG,KAAK,KAAK,EAAC,CAAC,CAAC;IACxD,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,uDAAuD;IACvD,IAAI,EAAE,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,CAAC,kBAAkB,KAAK,SAAS;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,kBAAkB,CAAC;IAC5E,IAAI,EAAE,CAAC,UAAU;QAAE,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;IAChD,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iGAAiG;AACjG,SAAS,kBAAkB,CAAC,SAAwB,EAAE,QAAgB;IACpE,MAAM,CAAC,GAA4B,EAAE,CAAC;IACtC,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IACrD,IAAI,SAAS,CAAC,SAAS;QAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS;QAAE,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChE,IAAI,SAAS,CAAC,iBAAiB,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;QACtE,CAAC,CAAC,iBAAiB,GAAG,SAAS,CAAC,iBAAiB,CAAC;IACpD,CAAC;IACD,qFAAqF;IACrF,CAAC,CAAC,UAAU,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAC3D,sBAAsB,CAAC,EAAE,EAAE,QAAQ,CAAC,CACrC,CAAC;IACF,uFAAuF;IACvF,qFAAqF;IACrF,MAAM,SAAS,GAAG,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACnE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAC,GAAG,EAAE,IAAI,EAAC,EAAE,EAAE,CAAC,iBAAE,IAAI,EAAE,GAAG,IAAK,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,cAAc,CAAC,SAAwB,EAAE,GAAW,EAAE,EAAa;IAC1E,OAAO,GAAS,EAAE;QAChB,gFAAgF;QAChF,kBAAkB;QAClB,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,MAAO,SAAS,CAAC,MAAM,CAAC,IAAa,CAAC,CAAC,MAAM,CAAC,GAAG,CAE/C,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC,CAAA,CAAC;AACJ,CAAC;AAED,iEAAiE;AACjE,SAAS,eAAe,CAAC,SAAwB,EAAE,GAAW;IAC5D,OAAO,2BAA2B,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,6FAA6F;AAC7F,SAAS,6BAA6B,CACpC,SAAwB,EACxB,GAAW,EACX,YAAsC;IAEtC,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;QACxD,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,SAAS,+CAA+C,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAwBD,gGAAgG;AAChG,SAAS,cAAc,CAAC,GAAW;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,UAAgB,UAAU,CAC9B,EAAa,EACb,OAA2B;;;QAE3B,MAAM,WAAW,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,MAAM,CAAC;QACnD,4EAA4E;QAC5E,MAAM,UAAU,GAAmD,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,kBAAkB,EAAE,EAAE,CAAC;YACrD,IAAI,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,KAAK,CAAA;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAI,UAAqC,CAAC,WAAW,CAAC;YAC/D,yFAAyF;YACzF,uEAAuE;YACvE,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB;gBAAE,SAAS;YAChD,UAAU,CAAC,IAAI,CAAC,EAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,KAAK,EAAC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,8FAA8F;QAC9F,wFAAwF;QACxF,yFAAyF;QACzF,qDAAqD;QACrD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC;gBAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzF,CAAC;QACD,iGAAiG;QACjG,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,MAAM,MAAM,GAA+B,EAAE,CAAC;QAE9C,wDAAwD;QACxD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gGAAgG;QAChG,uFAAuF;QACvF,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,CAAC,MAAO,SAE3B,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAwB,CAAC;YAE7C,0FAA0F;YAC1F,8FAA8F;YAC9F,0EAA0E;YAC1E,KAAK,MAAM,EAAC,EAAE,EAAE,GAAG,EAAC,IAAI,YAAY,EAAE,CAAC;gBACrC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACtC,IAAI,WAAW,KAAK,iBAAiB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACnF,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAsB,CAAC,IAAI,CAC1E,GAAG,EAAE,CAAC,SAAS,CAChB,CACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CAAA;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,SAAS,CAAC,MAA6B,EAAE,EAAa;IACpE,iDAAiD;IACjD,MAAM,GAAG,GACP,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,MAAuB,CAAC;IAChF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,0CAA0C,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,KAAK,CAAC;IAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CACb,OAAO,MAAM,KAAK,QAAQ;YACxB,CAAC,CAAC,0CAA0C,MAAM,EAAE;YACpD,CAAC,CAAC,6CAA6C,CAClD,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;IAEzB,+FAA+F;IAC/F,uDAAuD;IACvD,MAAM,GAAG,GAAI,GAA8B,CAAC,WAAW,CAAC;IACxD,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,oDAAoD,GAAG,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;AAC5C,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport {getAllShapeClasses, getShapeClass} from '../utils/ShapeClass.js';\nimport {NodeShape} from './SHACL.js';\nimport {\n  getUniquePropertyShapes,\n  type NodeShapeData,\n  type PropertyShapeData,\n} from './nodeShapeData.js';\nimport {Shape} from './Shape.js';\nimport {DeleteBuilder} from '../queries/DeleteBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport {rdfList} from './List.js';\nimport {serializePathToNodeData} from './serializePathToNodeData.js';\nimport {buildSingleOwnerConstraints} from './singleOwnerConstraint.js';\n\n/**\n * The npm scope of framework shapes (NodeShape/PropertyShape/List/PathNode/Shape) that\n * describe the meta-model itself and must never be synced as user data.\n */\nconst FRAMEWORK_PACKAGE = '@_linked/core';\n\n/**\n * Build the create-pipeline data object for a single PropertyShape (flattened under shapeIri).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport function buildPropertyShapeData(ps: PropertyShapeData, shapeIri: string): Record<string, unknown> {\n  const psIri = `${shapeIri}/${ps.label}`;\n  const d: Record<string, unknown> = {\n    __id: psIri,\n    path: serializePathToNodeData(ps.path),\n  };\n  // `rdfs:label` — the DSL label, i.e. the accessor name the property is reached\n  // by in code (`person.memberships`). It is NOT `sh:name`, written below, which\n  // is a human-readable display string.\n  //\n  // Without this the label is only ever implied by `psIri`, and a reader has to\n  // re-derive one from the path's local part. That works right up until the two\n  // differ — `@_linked/org` declares `memberships` on the path `org:hasMembership`\n  // — at which point the catalog reports `hasMembership`, the query proxy indexes\n  // the shape with it, and the class (which only knows `memberships`) throws.\n  // Readers already prefer a stored label and fall back to the path, so writing it\n  // is the whole fix; old catalogs keep working via that fallback.\n  if (ps.label) d.label = ps.label;\n  if (ps.nodeKind) d.nodeKind = ps.nodeKind;\n  if (ps.datatype) d.datatype = ps.datatype;\n  if (typeof ps.minCount === 'number') d.minCount = ps.minCount;\n  if (typeof ps.maxCount === 'number') d.maxCount = ps.maxCount;\n  if (ps.name) d.name = ps.name;\n  if (ps.description) d.description = ps.description;\n  if (typeof ps.order === 'number') d.order = ps.order;\n  if (ps.group) d.group = ps.group;\n  if (typeof ps.displayRank === 'number') d.displayRank = ps.displayRank;\n  if (ps.displayHidden !== undefined) d.displayHidden = ps.displayHidden;\n  if (ps.class) d.class = ps.class;\n  if (ps.in) d.in = rdfList(ps.in, {base: `${psIri}/in`});\n  if (ps.equalsConstraint) d.equalsConstraint = ps.equalsConstraint;\n  if (ps.disjoint) d.disjoint = ps.disjoint;\n  if (ps.lessThan) d.lessThan = ps.lessThan;\n  if (ps.lessThanOrEquals) d.lessThanOrEquals = ps.lessThanOrEquals;\n  if (ps.minInclusive !== undefined) d.minInclusive = ps.minInclusive;\n  if (ps.maxInclusive !== undefined) d.maxInclusive = ps.maxInclusive;\n  if (ps.minExclusive !== undefined) d.minExclusive = ps.minExclusive;\n  if (ps.maxExclusive !== undefined) d.maxExclusive = ps.maxExclusive;\n  if (typeof ps.minLength === 'number') d.minLength = ps.minLength;\n  if (typeof ps.maxLength === 'number') d.maxLength = ps.maxLength;\n  // sh:pattern is serialized as its regex source string.\n  if (ps.pattern) d.pattern = ps.pattern.source;\n  if (ps.hasValueConstraint !== undefined) d.hasValue = ps.hasValueConstraint;\n  if (ps.valueShape) d.valueShape = ps.valueShape;\n  if (ps.contains) d.contains = true;\n  return d;\n}\n\n/** Build the create-pipeline data object for a NodeShape and its (flattened) property shapes. */\nfunction buildNodeShapeData(nodeShape: NodeShapeData, shapeIri: string): Record<string, unknown> {\n  const d: Record<string, unknown> = {};\n  if (nodeShape.targetClass) d.targetClass = nodeShape.targetClass;\n  if (nodeShape.description) d.description = nodeShape.description;\n  if (nodeShape.extends) d.extends = nodeShape.extends;\n  if (nodeShape.dependent) d.dependent = true;\n  if (nodeShape.closed !== undefined) d.closed = nodeShape.closed;\n  if (nodeShape.ignoredProperties && nodeShape.ignoredProperties.length) {\n    d.ignoredProperties = nodeShape.ignoredProperties;\n  }\n  // Flatten: emit own + inherited property shapes (deduped by label) under this shape.\n  d.properties = getUniquePropertyShapes(nodeShape).map((ps) =>\n    buildPropertyShapeData(ps, shapeIri),\n  );\n  // The single-owner constraints of the shape's own `contains` properties, owned through\n  // `core:generatedShape` and written nested in the same create with their fixed IRIs.\n  const generated = buildSingleOwnerConstraints(nodeShape, shapeIri);\n  if (generated.length > 0) {\n    d.generatedShapes = generated.map(({iri, data}) => ({__id: iri, ...data}));\n  }\n  return d;\n}\n\n/**\n * The per-shape `delete → create` thunk shared by `syncShapes()` and `syncShape()`: exactly two\n * requests. The delete cascade-cleans the shape's old property-shape / list / path subtrees; the\n * create rebuilds them.\n *\n * The single-owner constraints generated from the shape's own `contains` properties\n * (`${iri}/${label}.singleOwner`, see `singleOwnerConstraint.ts`) are owned by the shape through\n * `core:generatedShape` (a `contains` property with value shape NodeShape). The delete removes\n * them and their property shapes through the owned walk, and their blank path and qualified-shape\n * nodes through the blank-node cascade; the create writes the current ones nested, in the same request\n * as the shape. A removed or renamed accessor therefore loses its constraint on the next sync,\n * and a NodeShape the shape does not own is never touched.\n *\n * `ds` (optional) targets an explicit dataset — both requests run against it instead of the\n * global router. Omitted → today's global behavior.\n */\nfunction buildSyncThunk(nodeShape: NodeShapeData, iri: string, ds?: IDataset): () => Promise<void> {\n  return async () => {\n    // Build the data fresh on each invocation, so every run writes from the current\n    // shape metadata.\n    const data = buildNodeShapeData(nodeShape, iri);\n    await DeleteBuilder.from(NodeShape, {id: iri}).exec(ds);\n    await (NodeShape.create(data as never).withId(iri) as unknown as {\n      exec: (target?: IDataset) => Promise<unknown>;\n    }).exec(ds);\n  };\n}\n\n/** The generated single-owner shape IRIs a code shape writes. */\nfunction generatedIrisOf(nodeShape: NodeShapeData, iri: string): string[] {\n  return buildSingleOwnerConstraints(nodeShape, iri).map((c) => c.iri);\n}\n\n/** Throw when a registered shape IRI equals one of a shape's generated single-owner IRIs. */\nfunction assertNoGeneratedIriCollision(\n  nodeShape: NodeShapeData,\n  iri: string,\n  isRegistered: (iri: string) => boolean,\n): void {\n  for (const generated of generatedIrisOf(nodeShape, iri)) {\n    if (isRegistered(generated)) {\n      throw new Error(`Shape IRI ${generated} collides with a generated single-owner shape`);\n    }\n  }\n}\n\n/** Options controlling how {@link syncShapes} treats store shapes that are not in code. */\nexport interface SyncShapesOptions {\n  /**\n   * How to treat NodeShapes present in the store but not in the current process's code:\n   * - `'none'` (default) — never prune; purely additive (delete→recreate the code shapes, touch\n   *   nothing else). The only mode that is safe when the process has loaded a *subset* of the\n   *   shapes in the dataset, or when the dataset has more than one writer.\n   * - `'all'` — prune every store-only shape as an orphan. Only correct when this process has\n   *   loaded **every** shape the dataset should hold and is its **only** writer; \"not registered\n   *   here\" is then taken to mean \"deleted from code\".\n   * - `'ownedNamespaces'` — prune a store-only shape ONLY if its IRI falls within a namespace\n   *   this process actually writes (the package-namespace of one of its code-registered shapes,\n   *   i.e. the IRI prefix up to the last `/` or `#`). Protects other writers' packages (arch-04:\n   *   one app-data dataset, several writers), but NOT the rest of a package the process only\n   *   partially loaded — the namespace is the whole package, so a deep import of one shape file\n   *   still claims all of it.\n   *\n   * `'all'` and `'ownedNamespaces'` are destructive and must be requested explicitly.\n   */\n  orphanScope?: 'all' | 'ownedNamespaces' | 'none';\n}\n\n/** The owning namespace of a shape IRI — everything up to and including the last `/` or `#`. */\nfunction shapeNamespace(iri: string): string {\n  const cut = Math.max(iri.lastIndexOf('/'), iri.lastIndexOf('#'));\n  return cut >= 0 ? iri.slice(0, cut + 1) : iri;\n}\n\n/**\n * Plan an idempotent sync of all code-registered (non-framework) NodeShapes into the store as\n * SHACL data — the forward (code → graph) materialization of arch-05 \"code is canonical\".\n *\n * Returns built-but-unexecuted thunks; the caller controls execution and batching:\n * ```ts\n * await Promise.all((await syncShapes()).map((run) => run()));\n * ```\n * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old\n * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).\n *\n * **Shapes in the store but not registered in this process are left alone by default**\n * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and\n * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a\n * time, and an app-data dataset also holds shapes other writers materialized (CN's\n * `bindShape` / `enableCapability`). \"Not registered here\" therefore does not mean \"deleted from\n * code\". Measured against a dataset holding the 36 `@_linked/schema` shapes: a process that\n * imported only `@_linked/schema/shapes/Thing` (11 shapes registered) deleted the other 25 under\n * both `'all'` and `'ownedNamespaces'`, and a process that imported no shapes deleted all 36.\n *\n * Pruning is opt-in via `options.orphanScope` (see {@link SyncShapesOptions}): pass `'all'` only\n * from a process that has loaded every shape the dataset should hold and is its sole writer, and\n * `'ownedNamespaces'` only when it has loaded every shape of each package it registers. Pruned\n * orphans are deleted with their owned subtree. Pruning reads the existing shape IRIs first;\n * with `'none'` no read is made.\n *\n * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**\n * parameter: it feeds both the orphan-detection read (so orphans are computed against the same\n * store they'll be pruned from) and every delete/create thunk. Omitted → the global router;\n * the returned thunks stay nullary either way.\n */\nexport async function syncShapes(\n  ds?: IDataset,\n  options?: SyncShapesOptions,\n): Promise<Array<() => Promise<void>>> {\n  const orphanScope = options?.orphanScope ?? 'none';\n  // 1. Enumerate code-registered user shapes (exclude framework/meta shapes).\n  const userShapes: Array<{iri: string; nodeShape: NodeShapeData}> = [];\n  for (const [iri, shapeClass] of getAllShapeClasses()) {\n    if (!shapeClass?.shape) continue;\n    const pkg = (shapeClass as {packageName?: string}).packageName;\n    // Skip framework/meta shapes: the core package, and the base `Shape` which is registered\n    // directly (no applyLinkedShape) and therefore carries no packageName.\n    if (!pkg || pkg === FRAMEWORK_PACKAGE) continue;\n    userShapes.push({iri, nodeShape: shapeClass.shape});\n  }\n  const localShapeIris = new Set(userShapes.map((s) => s.iri));\n  for (const {iri, nodeShape} of userShapes) {\n    assertNoGeneratedIriCollision(nodeShape, iri, (id) => localShapeIris.has(id));\n  }\n  // The generated single-owner shapes of in-code shapes are written by the same thunks, so they\n  // are never orphans. Derived in memory from the same function that builds them; a stale\n  // generated shape (removed accessor or shape) is not protected and goes with its owner's\n  // delete, through the `core:generatedShape` cascade.\n  for (const {iri, nodeShape} of userShapes) {\n    for (const generated of generatedIrisOf(nodeShape, iri)) localShapeIris.add(generated);\n  }\n  // Namespaces this process actually writes — the ownership scope for `'ownedNamespaces'` pruning.\n  const ownedNamespaces = new Set(userShapes.map((s) => shapeNamespace(s.iri)));\n\n  const thunks: Array<() => Promise<void>> = [];\n\n  // 2. Per in-code shape: delete (cascade) then recreate.\n  for (const {iri, nodeShape} of userShapes) {\n    thunks.push(buildSyncThunk(nodeShape, iri, ds));\n  }\n\n  // 3. Orphan sweep (unless disabled). Identity-read existing NodeShape IRIs (ids only). Must hit\n  //    the same `ds` the thunks target, or orphans get computed against the wrong store.\n  if (orphanScope !== 'none') {\n    const existingRows = (await (NodeShape as unknown as {\n      select: () => {exec: (target?: IDataset) => Promise<Array<{id: string}>>};\n    }).select().exec(ds)) as Array<{id: string}>;\n\n    // Orphan shapes (in store, not in code) → delete (cascade cleans their owned subtree). In\n    // `'ownedNamespaces'` mode, only shapes within a namespace this process writes are eligible —\n    // other writers' shapes (different package namespace) are left untouched.\n    for (const {id: iri} of existingRows) {\n      if (localShapeIris.has(iri)) continue;\n      if (orphanScope === 'ownedNamespaces' && !ownedNamespaces.has(shapeNamespace(iri))) {\n        continue;\n      }\n      thunks.push(() =>\n        (DeleteBuilder.from(NodeShape, {id: iri}).exec(ds) as Promise<unknown>).then(\n          () => undefined,\n        ),\n      );\n    }\n  }\n\n  return thunks;\n}\n\n/**\n * Plan an idempotent sync of ONE code-registered NodeShape into the store as SHACL data.\n *\n * Scoped counterpart to {@link syncShapes}: materializes a single shape (delete → recreate, so the\n * delete cascade-cleans the old property-shape / list / path subtrees and the create rebuilds them)\n * and does NOT run the store-wide orphan sweep — other shapes in the store are untouched.\n *\n * @param target a shape class (e.g. `Person`) or its NodeShape IRI string. An IRI is resolved to\n *   its registered class via `getShapeClass`; the shape must be code-registered.\n * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete\n *   and the create run against it instead of the global router. Omitted → global behavior.\n * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch\n *   several together — e.g. a shape plus its referenced object-property shapes:\n *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.\n * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.\n */\nexport function syncShape(target: typeof Shape | string, ds?: IDataset): () => Promise<void> {\n  // Normalize target → its registered shape class.\n  const cls =\n    typeof target === 'string' ? getShapeClass(target) : (target as typeof Shape);\n  if (typeof target === 'string' && !cls) {\n    throw new Error(`syncShape: no registered shape for IRI ${target}`);\n  }\n  const nodeShape = cls?.shape;\n  if (!nodeShape) {\n    throw new Error(\n      typeof target === 'string'\n        ? `syncShape: no registered shape for IRI ${target}`\n        : `syncShape: shape class has no static .shape`,\n    );\n  }\n  const iri = nodeShape.id;\n\n  // Never materialize a framework/meta shape as user data — same invariant syncShapes() enforces\n  // by skipping (the base Shape carries no packageName).\n  const pkg = (cls as {packageName?: string}).packageName;\n  if (!pkg || pkg === FRAMEWORK_PACKAGE) {\n    throw new Error(`syncShape: refusing to sync framework/meta shape ${iri}`);\n  }\n\n  assertNoGeneratedIriCollision(nodeShape, iri, (id) => !!getShapeClass(id));\n  return buildSyncThunk(nodeShape, iri, ds);\n}\n"]}
+{"version":3,"file":"syncShapes.js","sourceRoot":"","sources":["../../../src/shapes/syncShapes.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,kBAAkB,EAAE,aAAa,EAAC,MAAM,wBAAwB,CAAC;AACzE,OAAO,EAAC,SAAS,EAAC,MAAM,YAAY,CAAC;AACrC,OAAO,EACL,uBAAuB,GAGxB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAC,aAAa,EAAC,MAAM,6BAA6B,CAAC;AAE1D,OAAO,EAAC,OAAO,EAAC,MAAM,WAAW,CAAC;AAClC,OAAO,EAAC,uBAAuB,EAAC,MAAM,8BAA8B,CAAC;AACrE,OAAO,EAAC,2BAA2B,EAAC,MAAM,4BAA4B,CAAC;AACvE,OAAO,EAAC,YAAY,EAAC,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAC,SAAS,EAAC,MAAM,oBAAoB,CAAC;AAE7C;;;GAGG;AACH,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAE1C;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB,EAAE,QAAgB;IAC5E,MAAM,KAAK,GAAG,GAAG,QAAQ,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;IACxC,MAAM,CAAC,GAA4B;QACjC,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,uBAAuB,CAAC,EAAE,CAAC,IAAI,CAAC;KACvC,CAAC;IACF,+EAA+E;IAC/E,+EAA+E;IAC/E,sCAAsC;IACtC,EAAE;IACF,8EAA8E;IAC9E,8EAA8E;IAC9E,iFAAiF;IACjF,gFAAgF;IAChF,4EAA4E;IAC5E,iFAAiF;IACjF,iEAAiE;IACjE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC9D,IAAI,EAAE,CAAC,IAAI;QAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IAC9B,IAAI,EAAE,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACnD,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACrD,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,OAAO,EAAE,CAAC,WAAW,KAAK,QAAQ;QAAE,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW,CAAC;IACvE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;QAAE,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC,aAAa,CAAC;IACvE,IAAI,EAAE,CAAC,KAAK;QAAE,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;IACjC,IAAI,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,EAAC,IAAI,EAAE,GAAG,KAAK,KAAK,EAAC,CAAC,CAAC;IACxD,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;IAC1C,IAAI,EAAE,CAAC,gBAAgB;QAAE,CAAC,CAAC,gBAAgB,GAAG,EAAE,CAAC,gBAAgB,CAAC;IAClE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,EAAE,CAAC,YAAY,KAAK,SAAS;QAAE,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,YAAY,CAAC;IACpE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,IAAI,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ;QAAE,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC;IACjE,uDAAuD;IACvD,IAAI,EAAE,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,CAAC,kBAAkB,KAAK,SAAS;QAAE,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,kBAAkB,CAAC;IAC5E,IAAI,EAAE,CAAC,UAAU;QAAE,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;IAChD,IAAI,EAAE,CAAC,QAAQ;QAAE,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iGAAiG;AACjG,SAAS,kBAAkB,CAAC,SAAwB,EAAE,QAAgB;IACpE,MAAM,CAAC,GAA4B,EAAE,CAAC;IACtC,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,WAAW;QAAE,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC;IACjE,IAAI,SAAS,CAAC,OAAO;QAAE,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IACrD,IAAI,SAAS,CAAC,SAAS;QAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC;IAC5C,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS;QAAE,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChE,IAAI,SAAS,CAAC,iBAAiB,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;QACtE,CAAC,CAAC,iBAAiB,GAAG,SAAS,CAAC,iBAAiB,CAAC;IACpD,CAAC;IACD,qFAAqF;IACrF,CAAC,CAAC,UAAU,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAC3D,sBAAsB,CAAC,EAAE,EAAE,QAAQ,CAAC,CACrC,CAAC;IACF,uFAAuF;IACvF,qFAAqF;IACrF,MAAM,SAAS,GAAG,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACnE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,CAAC,CAAC,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAC,GAAG,EAAE,IAAI,EAAC,EAAE,EAAE,CAAC,iBAAE,IAAI,EAAE,GAAG,IAAK,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CAAC,KAAc;;IAClC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACzD,QAAQ,OAAO,KAAK,EAAE,CAAC;QACrB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/B,KAAK,QAAQ;YACX,OAAO,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3D,KAAK,SAAS;YACZ,OAAO,KAAK,KAAK,EAAE,CAAC;QACtB,KAAK,QAAQ;YACX,OAAO,KAAK,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;QACjC,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,OAAO,GAAG,MAAC,KAAiC,CAAC,KAAK,0CAAE,EAAE,CAAC;YAC7D,OAAO,KAAK,IAAI,CAAC,SAAS,CAAC,MAAA,OAAO,aAAP,OAAO,cAAP,OAAO,GAAK,KAAyB,CAAC,IAAI,mCAAI,EAAE,CAAC,EAAE,CAAC;QACjF,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACzD,CAAC;IACD,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,KAAK,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;IAC7D,IAAI,KAAK,YAAY,MAAM;QAAE,OAAO,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;IACvF,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;SACtC,IAAI,EAAE,CAAC;IACV,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7F,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAAC,IAA6B,EAAE,QAAgB;IAC3E,OAAO,SAAS,CAAC,qBAAqB,kBAAkB,KAAK,YAAY,CAAC,EAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC,EAAE,CAAC,CAAC;AACtG,CAAC;AAED,iFAAiF;AACjF,SAAS,aAAa,CACpB,SAAwB,EACxB,GAAW;IAEX,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAChD,OAAO,EAAC,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,EAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAe,gBAAgB,CAAC,IAAc,EAAE,EAAa;;;QAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QACrC,MAAM,IAAI,GAAG,MAAA,CAAC,MAAO,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAEjF,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,mCAAI,EAAE,CAAC;QACnB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CAAA;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,cAAc,CAAC,SAAwB,EAAE,GAAW,EAAE,EAAa;IAC1E,8FAA8F;IAC9F,iFAAiF;IACjF,OAAO,GAAG,EAAE,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;AAC9C,CAAC;AAED,oFAAoF;AACpF,SAAe,UAAU,CAAC,SAAwB,EAAE,GAAW,EAAE,EAAa;;QAC5E,MAAM,EAAC,IAAI,EAAE,IAAI,EAAC,GAAG,aAAa,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACnD,MAAM,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,MAAO,SAAS,CAAC,MAAM,CAAC,gCAAI,IAAI,KAAE,SAAS,EAAE,IAAI,GAAU,CAAC,CAAC,MAAM,CAAC,GAAG,CAErE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;CAAA;AAED,iEAAiE;AACjE,SAAS,eAAe,CAAC,SAAwB,EAAE,GAAW;IAC5D,OAAO,2BAA2B,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,6FAA6F;AAC7F,SAAS,6BAA6B,CACpC,SAAwB,EACxB,GAAW,EACX,YAAsC;IAEtC,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;QACxD,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,SAAS,+CAA+C,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;AACH,CAAC;AAqCD,gGAAgG;AAChG,SAAS,cAAc,CAAC,GAAW;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AACH,MAAM,UAAgB,UAAU,CAC9B,EAAa,EACb,OAA2B;;;QAE3B,MAAM,WAAW,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,WAAW,mCAAI,MAAM,CAAC;QACnD,4EAA4E;QAC5E,MAAM,UAAU,GAAmD,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,kBAAkB,EAAE,EAAE,CAAC;YACrD,IAAI,CAAC,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,KAAK,CAAA;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAI,UAAqC,CAAC,WAAW,CAAC;YAC/D,yFAAyF;YACzF,uEAAuE;YACvE,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB;gBAAE,SAAS;YAChD,UAAU,CAAC,IAAI,CAAC,EAAC,GAAG,EAAE,SAAS,EAAE,UAAU,CAAC,KAAK,EAAC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,8FAA8F;QAC9F,wFAAwF;QACxF,yFAAyF;QACzF,qDAAqD;QACrD,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC;gBAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzF,CAAC;QACD,iGAAiG;QACjG,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE9E,MAAM,MAAM,GAA+B,EAAE,CAAC;QAE9C,8FAA8F;QAC9F,6FAA6F;QAC7F,wFAAwF;QACxF,MAAM,YAAY,GAAG,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK;YACjC,CAAC,CAAC,IAAI,GAAG,EAAkB;YAC3B,CAAC,CAAC,MAAM,gBAAgB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7D,KAAK,MAAM,EAAC,GAAG,EAAE,SAAS,EAAC,IAAI,UAAU,EAAE,CAAC;YAC1C,IAAI,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,CAAA,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,aAAa,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI;gBAAE,SAAS;YAC9F,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gGAAgG;QAChG,uFAAuF;QACvF,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,CAAC,MAAO,SAE3B,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAwB,CAAC;YAE7C,0FAA0F;YAC1F,8FAA8F;YAC9F,0EAA0E;YAC1E,KAAK,MAAM,EAAC,EAAE,EAAE,GAAG,EAAC,IAAI,YAAY,EAAE,CAAC;gBACrC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACtC,IAAI,WAAW,KAAK,iBAAiB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACnF,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CACd,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,EAAC,EAAE,EAAE,GAAG,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAsB,CAAC,IAAI,CAC1E,GAAG,EAAE,CAAC,SAAS,CAChB,CACF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CAAA;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,SAAS,CACvB,MAA6B,EAC7B,EAAa,EACb,OAA0B;IAE1B,iDAAiD;IACjD,MAAM,GAAG,GACP,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,MAAuB,CAAC;IAChF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,0CAA0C,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,KAAK,CAAC;IAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CACb,OAAO,MAAM,KAAK,QAAQ;YACxB,CAAC,CAAC,0CAA0C,MAAM,EAAE;YACpD,CAAC,CAAC,6CAA6C,CAClD,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,CAAC;IAEzB,+FAA+F;IAC/F,uDAAuD;IACvD,MAAM,GAAG,GAAI,GAA8B,CAAC,WAAW,CAAC;IACxD,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,iBAAiB,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,oDAAoD,GAAG,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,6BAA6B,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,IAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK;QAAE,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IAC9D,OAAO,GAAS,EAAE;QAChB,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,aAAa,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI;YAAE,OAAO;QACnE,MAAM,UAAU,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC,CAAA,CAAC;AACJ,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport {getAllShapeClasses, getShapeClass} from '../utils/ShapeClass.js';\nimport {NodeShape} from './SHACL.js';\nimport {\n  getUniquePropertyShapes,\n  type NodeShapeData,\n  type PropertyShapeData,\n} from './nodeShapeData.js';\nimport {Shape} from './Shape.js';\nimport {DeleteBuilder} from '../queries/DeleteBuilder.js';\nimport type {IDataset} from '../interfaces/IDataset.js';\nimport {rdfList} from './List.js';\nimport {serializePathToNodeData} from './serializePathToNodeData.js';\nimport {buildSingleOwnerConstraints} from './singleOwnerConstraint.js';\nimport {QueryBuilder} from '../queries/QueryBuilder.js';\nimport {sha256Hex} from '../utils/sha256.js';\n\n/**\n * The npm scope of framework shapes (NodeShape/PropertyShape/List/PathNode/Shape) that\n * describe the meta-model itself and must never be synced as user data.\n */\nconst FRAMEWORK_PACKAGE = '@_linked/core';\n\n/**\n * Build the create-pipeline data object for a single PropertyShape (flattened under shapeIri).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport function buildPropertyShapeData(ps: PropertyShapeData, shapeIri: string): Record<string, unknown> {\n  const psIri = `${shapeIri}/${ps.label}`;\n  const d: Record<string, unknown> = {\n    __id: psIri,\n    path: serializePathToNodeData(ps.path),\n  };\n  // `rdfs:label` — the DSL label, i.e. the accessor name the property is reached\n  // by in code (`person.memberships`). It is NOT `sh:name`, written below, which\n  // is a human-readable display string.\n  //\n  // Without this the label is only ever implied by `psIri`, and a reader has to\n  // re-derive one from the path's local part. That works right up until the two\n  // differ — `@_linked/org` declares `memberships` on the path `org:hasMembership`\n  // — at which point the catalog reports `hasMembership`, the query proxy indexes\n  // the shape with it, and the class (which only knows `memberships`) throws.\n  // Readers already prefer a stored label and fall back to the path, so writing it\n  // is the whole fix; old catalogs keep working via that fallback.\n  if (ps.label) d.label = ps.label;\n  if (ps.nodeKind) d.nodeKind = ps.nodeKind;\n  if (ps.datatype) d.datatype = ps.datatype;\n  if (typeof ps.minCount === 'number') d.minCount = ps.minCount;\n  if (typeof ps.maxCount === 'number') d.maxCount = ps.maxCount;\n  if (ps.name) d.name = ps.name;\n  if (ps.description) d.description = ps.description;\n  if (typeof ps.order === 'number') d.order = ps.order;\n  if (ps.group) d.group = ps.group;\n  if (typeof ps.displayRank === 'number') d.displayRank = ps.displayRank;\n  if (ps.displayHidden !== undefined) d.displayHidden = ps.displayHidden;\n  if (ps.class) d.class = ps.class;\n  if (ps.in) d.in = rdfList(ps.in, {base: `${psIri}/in`});\n  if (ps.equalsConstraint) d.equalsConstraint = ps.equalsConstraint;\n  if (ps.disjoint) d.disjoint = ps.disjoint;\n  if (ps.lessThan) d.lessThan = ps.lessThan;\n  if (ps.lessThanOrEquals) d.lessThanOrEquals = ps.lessThanOrEquals;\n  if (ps.minInclusive !== undefined) d.minInclusive = ps.minInclusive;\n  if (ps.maxInclusive !== undefined) d.maxInclusive = ps.maxInclusive;\n  if (ps.minExclusive !== undefined) d.minExclusive = ps.minExclusive;\n  if (ps.maxExclusive !== undefined) d.maxExclusive = ps.maxExclusive;\n  if (typeof ps.minLength === 'number') d.minLength = ps.minLength;\n  if (typeof ps.maxLength === 'number') d.maxLength = ps.maxLength;\n  // sh:pattern is serialized as its regex source string.\n  if (ps.pattern) d.pattern = ps.pattern.source;\n  if (ps.hasValueConstraint !== undefined) d.hasValue = ps.hasValueConstraint;\n  if (ps.valueShape) d.valueShape = ps.valueShape;\n  if (ps.contains) d.contains = true;\n  return d;\n}\n\n/** Build the create-pipeline data object for a NodeShape and its (flattened) property shapes. */\nfunction buildNodeShapeData(nodeShape: NodeShapeData, shapeIri: string): Record<string, unknown> {\n  const d: Record<string, unknown> = {};\n  if (nodeShape.targetClass) d.targetClass = nodeShape.targetClass;\n  if (nodeShape.description) d.description = nodeShape.description;\n  if (nodeShape.extends) d.extends = nodeShape.extends;\n  if (nodeShape.dependent) d.dependent = true;\n  if (nodeShape.closed !== undefined) d.closed = nodeShape.closed;\n  if (nodeShape.ignoredProperties && nodeShape.ignoredProperties.length) {\n    d.ignoredProperties = nodeShape.ignoredProperties;\n  }\n  // Flatten: emit own + inherited property shapes (deduped by label) under this shape.\n  d.properties = getUniquePropertyShapes(nodeShape).map((ps) =>\n    buildPropertyShapeData(ps, shapeIri),\n  );\n  // The single-owner constraints of the shape's own `contains` properties, owned through\n  // `core:generatedShape` and written nested in the same create with their fixed IRIs.\n  const generated = buildSingleOwnerConstraints(nodeShape, shapeIri);\n  if (generated.length > 0) {\n    d.generatedShapes = generated.map(({iri, data}) => ({__id: iri, ...data}));\n  }\n  return d;\n}\n\n/**\n * Version of the {@link shapeSyncHash} input. Bump it whenever core changes the SHACL it writes\n * for a shape (a serialization change that the create data itself does not show), so every stored\n * shape is rewritten once by the next sync. Without a bump, stores keep the old triples: their\n * stored hashes still match, so the sync skips them.\n *\n * Enforced by `shape-sync-output-equivalence.test.ts`: its golden SHACL output is recorded in\n * `SHAPE_HASH_LEDGER` with the version it was generated for, and regenerating the golden without\n * bumping this constant fails that test. To change the output: bump this by one, update the\n * golden, and append `{version, goldenDigest}` to the ledger (never edit an existing entry).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport const SHAPE_HASH_VERSION = 1;\n\n/**\n * A canonical string for create-pipeline data: equal for equal data, independent of object key\n * order and of the order of array values.\n *\n * Arrays are sorted because in create data an array is always a multi-valued property (a set of\n * RDF values: `properties`, `generatedShapes`, `targetObjectsOf`, …). Ordered `rdf:List`s\n * (`sh:in`, sequence and alternative paths, `sh:or`) are nested `first`/`rest` objects, so their\n * order is kept by the structure. A shape class value (`shape: List`) is written as its NodeShape\n * IRI. Values without ids (blank nodes once written) are compared by structure, so no blank-node\n * label is ever part of the input.\n */\nfunction canonicalize(value: unknown): string {\n  if (value === null || value === undefined) return 'null';\n  switch (typeof value) {\n    case 'string':\n      return JSON.stringify(value);\n    case 'number':\n      return `n:${Object.is(value, -0) ? '0' : String(value)}`;\n    case 'boolean':\n      return `b:${value}`;\n    case 'bigint':\n      return `i:${value.toString()}`;\n    case 'function': {\n      const shapeId = (value as {shape?: {id?: string}}).shape?.id;\n      return `c:${JSON.stringify(shapeId ?? (value as {name?: string}).name ?? '')}`;\n    }\n  }\n  if (Array.isArray(value)) {\n    return `[${value.map(canonicalize).sort().join(',')}]`;\n  }\n  if (value instanceof Date) return `d:${value.toISOString()}`;\n  if (value instanceof RegExp) return `r:${JSON.stringify(value.source)}/${value.flags}`;\n  const record = value as Record<string, unknown>;\n  const keys = Object.keys(record)\n    .filter((k) => record[k] !== undefined)\n    .sort();\n  return `{${keys.map((k) => `${JSON.stringify(k)}:${canonicalize(record[k])}`).join(',')}}`;\n}\n\n/**\n * The content hash shape sync stores on a NodeShape as `core:shapeHash`: SHA-256 (hex) of the\n * canonical form of the shape IRI and the exact create data the sync writes for it — the\n * NodeShape, its flattened own + inherited property shapes, their `sh:in` lists and paths, and\n * the generated single-owner shapes it owns (whose owner classes come from the registered\n * sub-shapes, so registering a new sub-shape changes the hash of the declaring shape).\n *\n * Deterministic across processes, runtimes and Node versions: no blank-node labels, no object key\n * order, no array order (see {@link canonicalize}).\n *\n * @internal Exported for tests only — not part of the public API.\n */\nexport function shapeSyncHash(data: Record<string, unknown>, shapeIri: string): string {\n  return sha256Hex(`linked-shape-sync/${SHAPE_HASH_VERSION}\\n${canonicalize({iri: shapeIri, data})}`);\n}\n\n/** The create data and its content hash for one shape, as the sync writes it. */\nfunction buildSyncData(\n  nodeShape: NodeShapeData,\n  iri: string,\n): {data: Record<string, unknown>; hash: string} {\n  const data = buildNodeShapeData(nodeShape, iri);\n  return {data, hash: shapeSyncHash(data, iri)};\n}\n\n/**\n * The stored `core:shapeHash` of each of `iris` that exists as a NodeShape, in one select. A shape\n * that is absent, or stored without a hash (written before hashes existed), is missing from the\n * map. `ds` targets an explicit dataset, as for the writes.\n */\nasync function readStoredHashes(iris: string[], ds?: IDataset): Promise<Map<string, string>> {\n  const stored = new Map<string, string>();\n  if (iris.length === 0) return stored;\n  const rows = (await (QueryBuilder.from(NodeShape).select(['shapeHash']).forAll(iris) as unknown as {\n    exec: (target?: IDataset) => Promise<Array<{id: string; shapeHash?: unknown}> | null>;\n  }).exec(ds)) ?? [];\n  for (const row of rows) {\n    if (row && typeof row.shapeHash === 'string') stored.set(row.id, row.shapeHash);\n  }\n  return stored;\n}\n\n/**\n * The per-shape `delete → create` thunk shared by `syncShapes()` and `syncShape()`: exactly two\n * requests. The delete cascade-cleans the shape's old property-shape / list / path subtrees; the\n * create rebuilds them, and stores the content hash (`core:shapeHash`) of what it wrote on the\n * NodeShape so a later sync can skip the shape while it is unchanged.\n *\n * The single-owner constraints generated from the shape's own `contains` properties\n * (`${iri}/${label}.singleOwner`, see `singleOwnerConstraint.ts`) are owned by the shape through\n * `core:generatedShape` (a `contains` property with value shape NodeShape). The delete removes\n * them and their property shapes through the owned walk, and their blank path and qualified-shape\n * nodes through the blank-node cascade; the create writes the current ones nested, in the same request\n * as the shape. A removed or renamed accessor therefore loses its constraint on the next sync,\n * and a NodeShape the shape does not own is never touched.\n *\n * `ds` (optional) targets an explicit dataset — both requests run against it instead of the\n * global router. Omitted → today's global behavior.\n */\nfunction buildSyncThunk(nodeShape: NodeShapeData, iri: string, ds?: IDataset): () => Promise<void> {\n  // `writeShape` builds the data fresh on each invocation, so every run writes from the current\n  // shape metadata, and the hash stored with it always describes what was written.\n  return () => writeShape(nodeShape, iri, ds);\n}\n\n/** Delete (cascade) then create one shape, storing the hash of the written data. */\nasync function writeShape(nodeShape: NodeShapeData, iri: string, ds?: IDataset): Promise<void> {\n  const {data, hash} = buildSyncData(nodeShape, iri);\n  await DeleteBuilder.from(NodeShape, {id: iri}).exec(ds);\n  await (NodeShape.create({...data, shapeHash: hash} as never).withId(iri) as unknown as {\n    exec: (target?: IDataset) => Promise<unknown>;\n  }).exec(ds);\n}\n\n/** The generated single-owner shape IRIs a code shape writes. */\nfunction generatedIrisOf(nodeShape: NodeShapeData, iri: string): string[] {\n  return buildSingleOwnerConstraints(nodeShape, iri).map((c) => c.iri);\n}\n\n/** Throw when a registered shape IRI equals one of a shape's generated single-owner IRIs. */\nfunction assertNoGeneratedIriCollision(\n  nodeShape: NodeShapeData,\n  iri: string,\n  isRegistered: (iri: string) => boolean,\n): void {\n  for (const generated of generatedIrisOf(nodeShape, iri)) {\n    if (isRegistered(generated)) {\n      throw new Error(`Shape IRI ${generated} collides with a generated single-owner shape`);\n    }\n  }\n}\n\n/** Options controlling how {@link syncShapes} treats store shapes that are not in code. */\nexport interface SyncShapesOptions {\n  /**\n   * How to treat NodeShapes present in the store but not in the current process's code:\n   * - `'none'` (default) — never prune; purely additive (delete→recreate the code shapes, touch\n   *   nothing else). The only mode that is safe when the process has loaded a *subset* of the\n   *   shapes in the dataset, or when the dataset has more than one writer.\n   * - `'all'` — prune every store-only shape as an orphan. Only correct when this process has\n   *   loaded **every** shape the dataset should hold and is its **only** writer; \"not registered\n   *   here\" is then taken to mean \"deleted from code\".\n   * - `'ownedNamespaces'` — prune a store-only shape ONLY if its IRI falls within a namespace\n   *   this process actually writes (the package-namespace of one of its code-registered shapes,\n   *   i.e. the IRI prefix up to the last `/` or `#`). Protects other writers' packages (arch-04:\n   *   one app-data dataset, several writers), but NOT the rest of a package the process only\n   *   partially loaded — the namespace is the whole package, so a deep import of one shape file\n   *   still claims all of it.\n   *\n   * `'all'` and `'ownedNamespaces'` are destructive and must be requested explicitly.\n   */\n  orphanScope?: 'all' | 'ownedNamespaces' | 'none';\n  /**\n   * Rewrite every code shape, even one whose stored `core:shapeHash` matches. Default `false`:\n   * a shape is rewritten only when its hash differs or is missing. Use it to repair a shape\n   * whose stored subtree was edited or partly deleted outside shape sync (the hash describes\n   * what sync last wrote, not what is in the store now).\n   */\n  force?: boolean;\n}\n\n/** Options for {@link syncShape}. */\nexport interface SyncShapeOptions {\n  /** Rewrite the shape even when its stored `core:shapeHash` matches. See {@link SyncShapesOptions.force}. */\n  force?: boolean;\n}\n\n/** The owning namespace of a shape IRI — everything up to and including the last `/` or `#`. */\nfunction shapeNamespace(iri: string): string {\n  const cut = Math.max(iri.lastIndexOf('/'), iri.lastIndexOf('#'));\n  return cut >= 0 ? iri.slice(0, cut + 1) : iri;\n}\n\n/**\n * Plan an idempotent sync of all code-registered (non-framework) NodeShapes into the store as\n * SHACL data — the forward (code → graph) materialization of arch-05 \"code is canonical\".\n *\n * Returns built-but-unexecuted thunks; the caller controls execution and batching:\n * ```ts\n * await Promise.all((await syncShapes()).map((run) => run()));\n * ```\n * Each in-code shape's thunk runs `delete → create` in order (the delete cascade-cleans the old\n * property shapes / list / path subtrees via the containment cascade, the create rebuilds them).\n *\n * **Unchanged shapes are skipped.** The create stores a content hash of everything it writes for\n * the shape on the NodeShape (`core:shapeHash`, see {@link shapeSyncHash}). The plan reads the\n * stored hashes of all code shapes in one select and builds a thunk only for a shape whose hash\n * is missing (never synced, or synced before hashes existed) or differs. Syncing an unchanged\n * app therefore returns no write thunks, and the length of the plan is the number of shapes\n * actually written plus the pruned orphans. The hash records what sync last wrote, not what the\n * store holds now: a subtree edited or partly deleted by another writer while the NodeShape and\n * its hash survive is not detected. `options.force` rewrites every code shape.\n *\n * **Shapes in the store but not registered in this process are left alone by default**\n * (`orphanScope: 'none'`). The registry only holds what this process happened to import, and\n * that is routinely a subset of what the dataset holds: shapes are deep-importable one file at a\n * time, and an app-data dataset also holds shapes other writers materialized (CN's\n * `bindShape` / `enableCapability`). \"Not registered here\" therefore does not mean \"deleted from\n * code\". Measured against a dataset holding the 36 `@_linked/schema` shapes: a process that\n * imported only `@_linked/schema/shapes/Thing` (11 shapes registered) deleted the other 25 under\n * both `'all'` and `'ownedNamespaces'`, and a process that imported no shapes deleted all 36.\n *\n * Pruning is opt-in via `options.orphanScope` (see {@link SyncShapesOptions}): pass `'all'` only\n * from a process that has loaded every shape the dataset should hold and is its sole writer, and\n * `'ownedNamespaces'` only when it has loaded every shape of each package it registers. Pruned\n * orphans are deleted with their owned subtree. Pruning reads the existing shape IRIs first;\n * with `'none'` no read is made.\n *\n * `ds` (optional) targets an explicit dataset instead of the global router. It is a **plan-time**\n * parameter: it feeds the stored-hash read and the orphan-detection read (so both are computed\n * against the same store they'll be written to) and every delete/create thunk. Omitted → the global router;\n * the returned thunks stay nullary either way.\n */\nexport async function syncShapes(\n  ds?: IDataset,\n  options?: SyncShapesOptions,\n): Promise<Array<() => Promise<void>>> {\n  const orphanScope = options?.orphanScope ?? 'none';\n  // 1. Enumerate code-registered user shapes (exclude framework/meta shapes).\n  const userShapes: Array<{iri: string; nodeShape: NodeShapeData}> = [];\n  for (const [iri, shapeClass] of getAllShapeClasses()) {\n    if (!shapeClass?.shape) continue;\n    const pkg = (shapeClass as {packageName?: string}).packageName;\n    // Skip framework/meta shapes: the core package, and the base `Shape` which is registered\n    // directly (no applyLinkedShape) and therefore carries no packageName.\n    if (!pkg || pkg === FRAMEWORK_PACKAGE) continue;\n    userShapes.push({iri, nodeShape: shapeClass.shape});\n  }\n  const localShapeIris = new Set(userShapes.map((s) => s.iri));\n  for (const {iri, nodeShape} of userShapes) {\n    assertNoGeneratedIriCollision(nodeShape, iri, (id) => localShapeIris.has(id));\n  }\n  // The generated single-owner shapes of in-code shapes are written by the same thunks, so they\n  // are never orphans. Derived in memory from the same function that builds them; a stale\n  // generated shape (removed accessor or shape) is not protected and goes with its owner's\n  // delete, through the `core:generatedShape` cascade.\n  for (const {iri, nodeShape} of userShapes) {\n    for (const generated of generatedIrisOf(nodeShape, iri)) localShapeIris.add(generated);\n  }\n  // Namespaces this process actually writes — the ownership scope for `'ownedNamespaces'` pruning.\n  const ownedNamespaces = new Set(userShapes.map((s) => shapeNamespace(s.iri)));\n\n  const thunks: Array<() => Promise<void>> = [];\n\n  // 2. Per in-code shape whose stored content hash is missing or differs: delete (cascade) then\n  //    recreate. An unchanged shape gets no thunk, so syncing an unchanged app writes nothing.\n  //    The stored hashes are read in one select, against the same `ds` the thunks target.\n  const storedHashes = options?.force\n    ? new Map<string, string>()\n    : await readStoredHashes(userShapes.map((s) => s.iri), ds);\n  for (const {iri, nodeShape} of userShapes) {\n    if (!options?.force && storedHashes.get(iri) === buildSyncData(nodeShape, iri).hash) continue;\n    thunks.push(buildSyncThunk(nodeShape, iri, ds));\n  }\n\n  // 3. Orphan sweep (unless disabled). Identity-read existing NodeShape IRIs (ids only). Must hit\n  //    the same `ds` the thunks target, or orphans get computed against the wrong store.\n  if (orphanScope !== 'none') {\n    const existingRows = (await (NodeShape as unknown as {\n      select: () => {exec: (target?: IDataset) => Promise<Array<{id: string}>>};\n    }).select().exec(ds)) as Array<{id: string}>;\n\n    // Orphan shapes (in store, not in code) → delete (cascade cleans their owned subtree). In\n    // `'ownedNamespaces'` mode, only shapes within a namespace this process writes are eligible —\n    // other writers' shapes (different package namespace) are left untouched.\n    for (const {id: iri} of existingRows) {\n      if (localShapeIris.has(iri)) continue;\n      if (orphanScope === 'ownedNamespaces' && !ownedNamespaces.has(shapeNamespace(iri))) {\n        continue;\n      }\n      thunks.push(() =>\n        (DeleteBuilder.from(NodeShape, {id: iri}).exec(ds) as Promise<unknown>).then(\n          () => undefined,\n        ),\n      );\n    }\n  }\n\n  return thunks;\n}\n\n/**\n * Plan an idempotent sync of ONE code-registered NodeShape into the store as SHACL data.\n *\n * Scoped counterpart to {@link syncShapes}: materializes a single shape (delete → recreate, so the\n * delete cascade-cleans the old property-shape / list / path subtrees and the create rebuilds them)\n * and does NOT run the store-wide orphan sweep — other shapes in the store are untouched.\n *\n * @param target a shape class (e.g. `Person`) or its NodeShape IRI string. An IRI is resolved to\n *   its registered class via `getShapeClass`; the shape must be code-registered.\n * @param ds optional explicit dataset to materialize into (a store or a router) — both the delete\n *   and the create run against it instead of the global router. Omitted → global behavior.\n * @param options `force: true` rewrites the shape even when its stored hash matches.\n * @returns a single unexecuted thunk (consistent with {@link syncShapes}), so callers can batch\n *   several together — e.g. a shape plus its referenced object-property shapes:\n *   `await Promise.all([syncShape(Person), syncShape(Address)].map((run) => run()))`.\n *   Unless `force` is set, the thunk first reads the shape's stored `core:shapeHash` and writes\n *   nothing when it equals the hash of what it would write (see {@link syncShapes}).\n * @throws if `target` is a framework/meta shape, is not registered, or has no `.shape`.\n */\nexport function syncShape(\n  target: typeof Shape | string,\n  ds?: IDataset,\n  options?: SyncShapeOptions,\n): () => Promise<void> {\n  // Normalize target → its registered shape class.\n  const cls =\n    typeof target === 'string' ? getShapeClass(target) : (target as typeof Shape);\n  if (typeof target === 'string' && !cls) {\n    throw new Error(`syncShape: no registered shape for IRI ${target}`);\n  }\n  const nodeShape = cls?.shape;\n  if (!nodeShape) {\n    throw new Error(\n      typeof target === 'string'\n        ? `syncShape: no registered shape for IRI ${target}`\n        : `syncShape: shape class has no static .shape`,\n    );\n  }\n  const iri = nodeShape.id;\n\n  // Never materialize a framework/meta shape as user data — same invariant syncShapes() enforces\n  // by skipping (the base Shape carries no packageName).\n  const pkg = (cls as {packageName?: string}).packageName;\n  if (!pkg || pkg === FRAMEWORK_PACKAGE) {\n    throw new Error(`syncShape: refusing to sync framework/meta shape ${iri}`);\n  }\n\n  assertNoGeneratedIriCollision(nodeShape, iri, (id) => !!getShapeClass(id));\n  if (options?.force) return buildSyncThunk(nodeShape, iri, ds);\n  return async () => {\n    const stored = await readStoredHashes([iri], ds);\n    if (stored.get(iri) === buildSyncData(nodeShape, iri).hash) return;\n    await writeShape(nodeShape, iri, ds);\n  };\n}\n"]}

package/lib/esm/utils/Package.js

@@ -459,6 +459,9 @@ 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);
+// NodeShape.shapeHash (core:shapeHash — the content hash shape sync stores on each shape it
+// writes, so the next sync can skip an unchanged shape; see syncShapes.ts).
+createPropertyShape({ path: coreOntology.shapeHash, datatype: xsd.string, maxCount: 1 }, 'shapeHash', shacl.Literal, 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

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;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"]}
+{"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,4FAA4F;AAC5F,4EAA4E;AAC5E,mBAAmB,CACjB,EAAC,IAAI,EAAE,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAC,EACjE,WAAW,EACX,KAAK,CAAC,OAAO,EACb,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// NodeShape.shapeHash (core:shapeHash — the content hash shape sync stores on each shape it\n// writes, so the next sync can skip an unchanged shape; see syncShapes.ts).\ncreatePropertyShape(\n  {path: coreOntology.shapeHash, datatype: xsd.string, maxCount: 1},\n  'shapeHash',\n  shacl.Literal,\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/lib/esm/utils/sha256.d.ts

@@ -0,0 +1,8 @@
+/**
+ * SHA-256 (FIPS 180-4) of a string's UTF-8 bytes, as lowercase hex.
+ *
+ * Pure JS and synchronous, so it gives the same digest in Node and in the browser without
+ * `node:crypto` or the async `SubtleCrypto`. Meant for small inputs such as content hashes of
+ * generated data, not for bulk hashing.
+ */
+export declare function sha256Hex(input: string): string;

package/lib/esm/utils/sha256.js

@@ -0,0 +1,80 @@
+/*
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/.
+ */
+/**
+ * SHA-256 (FIPS 180-4) of a string's UTF-8 bytes, as lowercase hex.
+ *
+ * Pure JS and synchronous, so it gives the same digest in Node and in the browser without
+ * `node:crypto` or the async `SubtleCrypto`. Meant for small inputs such as content hashes of
+ * generated data, not for bulk hashing.
+ */
+export function sha256Hex(input) {
+    const bytes = new TextEncoder().encode(input);
+    const bitLength = bytes.length * 8;
+    // Message + 0x80 + zero padding + 64-bit big-endian length, rounded up to 64-byte blocks.
+    const paddedLength = Math.ceil((bytes.length + 9) / 64) * 64;
+    const padded = new Uint8Array(paddedLength);
+    padded.set(bytes);
+    padded[bytes.length] = 0x80;
+    const view = new DataView(padded.buffer);
+    view.setUint32(paddedLength - 8, Math.floor(bitLength / 0x100000000));
+    view.setUint32(paddedLength - 4, bitLength >>> 0);
+    const h = new Uint32Array([
+        0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
+    ]);
+    const w = new Uint32Array(64);
+    for (let offset = 0; offset < paddedLength; offset += 64) {
+        for (let i = 0; i < 16; i++)
+            w[i] = view.getUint32(offset + i * 4);
+        for (let i = 16; i < 64; i++) {
+            const s0 = rotr(w[i - 15], 7) ^ rotr(w[i - 15], 18) ^ (w[i - 15] >>> 3);
+            const s1 = rotr(w[i - 2], 17) ^ rotr(w[i - 2], 19) ^ (w[i - 2] >>> 10);
+            w[i] = (w[i - 16] + s0 + w[i - 7] + s1) >>> 0;
+        }
+        let a = h[0], b = h[1], c = h[2], d = h[3], e = h[4], f = h[5], g = h[6], k = h[7];
+        for (let i = 0; i < 64; i++) {
+            const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);
+            const ch = (e & f) ^ (~e & g);
+            const t1 = (k + S1 + ch + K[i] + w[i]) >>> 0;
+            const S0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);
+            const maj = (a & b) ^ (a & c) ^ (b & c);
+            const t2 = (S0 + maj) >>> 0;
+            k = g;
+            g = f;
+            f = e;
+            e = (d + t1) >>> 0;
+            d = c;
+            c = b;
+            b = a;
+            a = (t1 + t2) >>> 0;
+        }
+        h[0] += a;
+        h[1] += b;
+        h[2] += c;
+        h[3] += d;
+        h[4] += e;
+        h[5] += f;
+        h[6] += g;
+        h[7] += k;
+    }
+    let hex = '';
+    for (let i = 0; i < 8; i++)
+        hex += h[i].toString(16).padStart(8, '0');
+    return hex;
+}
+function rotr(x, n) {
+    return (x >>> n) | (x << (32 - n));
+}
+const K = new Uint32Array([
+    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+]);
+//# sourceMappingURL=sha256.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sha256.js","sourceRoot":"","sources":["../../../src/utils/sha256.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACnC,0FAA0F;IAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAC7D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC;IAC5C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC;IACtE,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC;IAElD,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC;QACxB,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;KAC/F,CAAC,CAAC;IACH,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC9B,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,YAAY,EAAE,MAAM,IAAI,EAAE,EAAE,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACvE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAClD,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAClD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACZ,CAAC;IACD,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACtE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;IAChC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC;IACxB,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAC9F,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;CAC/F,CAAC,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\n\n/**\n * SHA-256 (FIPS 180-4) of a string's UTF-8 bytes, as lowercase hex.\n *\n * Pure JS and synchronous, so it gives the same digest in Node and in the browser without\n * `node:crypto` or the async `SubtleCrypto`. Meant for small inputs such as content hashes of\n * generated data, not for bulk hashing.\n */\nexport function sha256Hex(input: string): string {\n  const bytes = new TextEncoder().encode(input);\n  const bitLength = bytes.length * 8;\n  // Message + 0x80 + zero padding + 64-bit big-endian length, rounded up to 64-byte blocks.\n  const paddedLength = Math.ceil((bytes.length + 9) / 64) * 64;\n  const padded = new Uint8Array(paddedLength);\n  padded.set(bytes);\n  padded[bytes.length] = 0x80;\n  const view = new DataView(padded.buffer);\n  view.setUint32(paddedLength - 8, Math.floor(bitLength / 0x100000000));\n  view.setUint32(paddedLength - 4, bitLength >>> 0);\n\n  const h = new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n  ]);\n  const w = new Uint32Array(64);\n  for (let offset = 0; offset < paddedLength; offset += 64) {\n    for (let i = 0; i < 16; i++) w[i] = view.getUint32(offset + i * 4);\n    for (let i = 16; i < 64; i++) {\n      const s0 = rotr(w[i - 15], 7) ^ rotr(w[i - 15], 18) ^ (w[i - 15] >>> 3);\n      const s1 = rotr(w[i - 2], 17) ^ rotr(w[i - 2], 19) ^ (w[i - 2] >>> 10);\n      w[i] = (w[i - 16] + s0 + w[i - 7] + s1) >>> 0;\n    }\n    let a = h[0], b = h[1], c = h[2], d = h[3], e = h[4], f = h[5], g = h[6], k = h[7];\n    for (let i = 0; i < 64; i++) {\n      const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);\n      const ch = (e & f) ^ (~e & g);\n      const t1 = (k + S1 + ch + K[i] + w[i]) >>> 0;\n      const S0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);\n      const maj = (a & b) ^ (a & c) ^ (b & c);\n      const t2 = (S0 + maj) >>> 0;\n      k = g;\n      g = f;\n      f = e;\n      e = (d + t1) >>> 0;\n      d = c;\n      c = b;\n      b = a;\n      a = (t1 + t2) >>> 0;\n    }\n    h[0] += a;\n    h[1] += b;\n    h[2] += c;\n    h[3] += d;\n    h[4] += e;\n    h[5] += f;\n    h[6] += g;\n    h[7] += k;\n  }\n  let hex = '';\n  for (let i = 0; i < 8; i++) hex += h[i].toString(16).padStart(8, '0');\n  return hex;\n}\n\nfunction rotr(x: number, n: number): number {\n  return (x >>> n) | (x << (32 - n));\n}\n\nconst K = new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,\n]);\n"]}

package/package.json

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