@_linked/core 2.31.0 → 2.33.0

package/CHANGELOG.md

@@ -1,5 +1,43 @@
 # 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
+
+- [#338](https://github.com/linked-fw/core/pull/338) [`83e9a51`](https://github.com/linked-fw/core/commit/83e9a519593c92448bb1492af92a3701d46d9750) Thanks [@flyon](https://github.com/flyon)! - Ownership of `contains` values is now decided **per property**, everywhere. Until now a property owned its values when *any* registered shape declared its predicate `contains`, so a plain property on such a predicate (say a user shape's `schema:image`, which `@_linked/schema` declares `contains` on `Thing.image`) deleted its old value on replace and class-checked links.
+  
+  **A plain property on a predicate another shape declares `contains` no longer deletes or class-checks.** Replacing, unsetting or set-removing its value only changes the edge; deleting its subject leaves the value in place; linking any `{id}` through it is allowed. To keep the old behaviour for such a property, declare `contains: true` (with a `shape`) on it.
+  
+  **Deleting an owner deletes everything it owns.** The cleanup walks shapes, not predicates: from the owner's shape it follows that shape's `contains` properties to their value shapes, then their `contains` properties, and so on. Deeper owned values now go with their owner even when their shape is not `dependent` (before, only `dependent`-typed descendants were deleted below the first level). When a value is typed with a registered sub-shape of the declared value shape, the `contains` properties that sub-shape adds are followed too, from nodes of that class only. Such a property is not followed through the parent (warned once with the cause) when the sub-shape has no `targetClass`, shares it with a super-shape, or shares it with another shape that holds the same predicate as a plain property through a simple path. A copy of a sub-shape that adds nothing (same class, or no `targetClass`) is skipped silently.
+  
+  Recursion: a shape owning its own kind (list cells, replies) is followed to any depth; any other cycle is followed hop by hop, each hop checked against the declaring class, for at most `MAX_OWNED_RECURSION` (4) re-entries per path — deeper values are left in place. `rdf:nil` is never deleted. A delete whose owned walk exceeds `OWNED_BRANCH_WARNING` (64) branches logs a warning. Both constants are exported from `@_linked/core/sparql/irToAlgebra`.
+  
+  **`contains` without a `shape` now throws** when the class is decorated: the walk needs a value shape to follow. Add the value's `shape`, or drop `contains` — a blank value is deleted through a blank-capable `nodeKind` without it. Core's own `PropertyShape.path` and the shape-less `PathNode` slots no longer declare `contains`.
+  
+  **`dependent` is deprecated** and has no effect. It is still accepted, and shape sync still persists it as `core:dependent`. Core's own shapes no longer declare it.
+  
+  **The generated single-owner constraint counts only owners of the declaring class.** `sh:maxCount 1` (every subject counted) becomes a qualified count over the declaring `targetClass` and every registered sub-shape's class, so a plain reference from another class conforms:
+  
+  ```turtle
+  <…/Thing/image.singleOwner/owners> sh:path [ sh:inversePath schema:image ] ;
+      sh:qualifiedValueShape [ sh:or ( [ sh:class schema:Thing ] [ sh:class ex:Project ] ) ] ;
+      sh:qualifiedMaxCount 1 .
+  ```
+  
+  With one class the qualified shape is `[ sh:class C ]`. A declaring shape without `targetClass` gets no constraint (sync warns once). Re-sync to rewrite stored constraints. New metamodel accessors: `PropertyShape.qualifiedValueShape`, `PropertyShape.qualifiedMaxCount`, `NodeShape.class`, `NodeShape.orShapes` (`sh:or`), and the `shacl.qualifiedValueShape` / `qualifiedMaxCount` / `or` terms.
+  
+  **Removed:** `collectContainment` and `buildOwnedCascade` (exported from `@_linked/core/sparql/irToAlgebra`), which implemented the predicate rule, and the `sharedPredicate` field of `OwnedLink`. Nothing replaces them; to ask whether a property owns its value, read its own `contains`.
+  
+  **No longer done:** the next sync no longer deletes the IRI-named path nodes versions before 2.30 wrote; it leaves them unreferenced.
+  
+  See README "Owned properties" and `docs/architecture/owned-values.md`.
+
 ## 2.31.0
 
 ### Minor Changes

package/README.md

@@ -252,6 +252,11 @@ value. Whenever that edge goes away, the owned node is deleted with it:
   orphaned.
 - `update({ownedProp: {remove: [x]}})` deletes `x` itself, not just the link.
 
+Ownership belongs to the property, not to its predicate. A plain property of another shape on
+the same predicate (say `ex:avatar` without `contains`) is a reference: replacing it or deleting
+its subject never deletes the value, and it is not class-checked. A `contains` property needs a
+`shape`; declaring one without it throws when the class is decorated.
+
 ```typescript
 @linkedShape
 export class Person extends Shape {
@@ -287,12 +292,10 @@ patch: it deletes all of that node's triples and writes the new ones.
 `{avatar: {id: uploadedId}}`. The link transfers ownership: the linked node is deleted when it is
 replaced, removed, or when the owner is deleted.
 
-Because of that, core checks the class of every id linked into a property that owns its value and
-declares a `shape`. Ownership is decided per predicate: a property owns its value when any
-registered shape declares its predicate `contains`, so a plain property that shares such a
-predicate is checked too (a replace through it deletes the old value just the same). A link is
-refused, and nothing is written, when the store already types the node and none of its types is
-the shape's `targetClass`, a registered sub-shape's `targetClass`, or the property's `sh:class`:
+Because of that, core checks the class of every id linked into a `contains` property that
+declares a `shape`. A link is refused, and nothing is written, when the store already types the
+node and none of its types is the shape's `targetClass`, a registered sub-shape's `targetClass`, or
+the property's `sh:class`:
 
 ```
 Cannot link <https://my.app/alice> into the contains property "avatar" of <…/shape/my-pkg/Person>:
@@ -301,7 +304,7 @@ it is typed <https://example.org/Person>, but "avatar" only owns instances of <h
 
 Ids that do not exist yet, or have no `rdf:type`, are allowed, so upload-then-attach works in
 either write order. The check runs in `SparqlDataset` (one `SELECT` per mutation that links owned
-ids, none otherwise). Plain references on predicates no shape owns are never checked. A node
+ids, none otherwise). Plain references are never checked. A node
 whose type comes from a subclass that has no registered shape is refused unless the store also
 holds the expected type (an RDFS-inferring store adds it); register a shape for that class, or
 declare `sh:class`, to accept it.
@@ -311,24 +314,31 @@ Nor is a node typed by another request between the check's `SELECT` and the `UPD
 follows it: the two are separate requests, not one transaction. Raw SPARQL updates bypass the
 check altogether. SHACL validation of `sh:class` is the backstop for all three.
 
-**What a delete removes.** `parent.delete()` deletes the immediately-owned children of every
-`contains` property that declares a `shape`; `dependent` extends the cascade further down. The bulk
-deletes (`.all()`, `.where(...)`) remove the same owned children and cascade for every matched
-subject (they do not delete incoming references to the subjects, which a delete by id does). A
-`contains` property *without* a `shape` (a polymorphic slot such as `sh:path`, whose value may be a
-shared predicate IRI) only ever deletes `dependent`-typed values; a non-dependent old value is
-left in place.
-
-Subject deletes and replaces decide ownership differently. A subject delete (by id or in bulk)
-uses the deleted shape's *own* `contains` properties. Replace, set-remove and the class check use
-the registry-wide predicate rule above. So a plain property on a predicate that another shape
-declares `contains` deletes its old value on replace, but not when its subject is deleted.
-Whether ownership should be decided per property everywhere is an open design question. The
-cascade into `dependent` descendants only emits blocks for the dependent shapes the deleted
-shape can reach through its owned properties, so deleting a shape that owns only non-dependent
-values costs one extra block per owned property. The walk follows only the `contains` properties
-the reached shapes declare: an owned edge that none of those shapes declares is not followed,
-and the node behind it is left in place rather than deleted.
+**What a delete removes.** Deleting an owner deletes everything it owns (see the recursion
+limit below): the values of its `contains` properties (own and inherited), the values *their* shapes own, and so on. A
+replace or set-remove does the same below the old value. The walk follows the shapes, not the
+predicates: from the owner's shape it follows that shape's `contains` properties to their value
+shapes, then those shapes' `contains` properties. When a value is typed with a registered
+sub-shape of the declared value shape, the `contains` properties the sub-shape adds are followed
+too, but only from nodes of that sub-shape's class (`?img a ex:Photo . ?img ex:thumbnail ?t`).
+The class must tell those nodes apart: an added property is not followed through the parent
+(core warns once) when the sub-shape has no `targetClass`, shares it with one of its
+super-shapes, or shares it with another shape that holds the same predicate as a plain property
+(through a simple path). Another shape that merely shares the class, without that predicate,
+changes nothing. A copy of a sub-shape that adds nothing of its own, with the same class (a
+"profile") or with no `targetClass` at all, is skipped silently: its parent's entry covers it.
+When a sub-shape redeclares an inherited `contains` property without `contains`, the inherited
+ownership still applies.
+
+Recursion has a limit. A shape that owns its own kind (a list cell owning the next cell through
+`rdf:rest`, a comment owning its replies) is followed to any depth (`rdf:rest*`). Any other cycle
+(A owns B owns A, or a sub-shape's property leading back into its own kind) is followed hop by
+hop, each hop checked against the class that declares it, for at most `MAX_OWNED_RECURSION` (4)
+re-entries per path; values deeper than that are left in place, and so is anything behind an
+untyped node on such a cycle. `rdf:nil`, the end of every list, is never deleted.
+
+The bulk deletes (`.all()`, `.where(...)`) remove the same subtree for every matched subject; they
+do not delete incoming references to the subjects, which a delete by id does.
 
 Non-owning references to an owned node, through other properties or from other subjects, are
 allowed. They are not cleaned up: after the owner is deleted they dangle. The same holds when two
@@ -336,12 +346,13 @@ subjects own one node (an `{id}` linked into a second owner, which breaks the si
 below): deleting either owner deletes the node, and the other owner's edge dangles.
 
 **The single-owner constraint.** An owned node has at most one owner. Shape sync persists this as
-one generated SHACL NodeShape per `contains` property that declares a `shape` (simple paths only;
-a shape-less slot may hold a shared IRI, so it is left out). It is written only by the class that
-declares the property, at the property shape's IRI plus `.singleOwner`: `Thing.image` gets one
-constraint at `Thing`, not one per subclass. It is marked `core:generated true` and has no
-`sh:targetClass`, so catalog readers can skip it, and it is never registered in memory. For
-`Thing.image`:
+one generated SHACL NodeShape per `contains` property (simple paths only). It is written only by
+the class that declares the property, at the property shape's IRI plus `.singleOwner`:
+`Thing.image` gets one constraint at `Thing`, not one per subclass. It is marked `core:generated
+true` and has no `sh:targetClass`, so catalog readers can skip it, and it is never registered in
+memory. It counts only subjects of the declaring class and of every registered sub-shape's class,
+so a plain reference through the same predicate from another class is allowed. For `Thing.image`,
+with a registered `Project extends Thing`:
 
 ```turtle
 <…/shape/my-pkg/Thing/image.singleOwner> a sh:NodeShape ;
@@ -351,23 +362,24 @@ constraint at `Thing`, not one per subclass. It is marked `core:generated true`
 
 <…/Thing/image.singleOwner/owners> a sh:PropertyShape ;
     rdfs:label "owners" ;
-    sh:maxCount 1 ;
-    sh:path [ sh:inversePath schema:image ] .
+    sh:path [ sh:inversePath schema:image ] ;
+    sh:qualifiedValueShape [ sh:or ( [ sh:class schema:Thing ] [ sh:class ex:Project ] ) ] ;
+    sh:qualifiedMaxCount 1 .
 ```
 
+The classes are listed because `sh:class` matches a subclass instance only through
+`rdfs:subClassOf` triples, which a dataset without inference lacks. With one class the qualified
+shape is `[ sh:class C ]`. Sub-shapes registered only in another process are missing until a
+process that knows them syncs; a declaring shape without `targetClass` gets no constraint (sync
+logs it once). Versions before this one wrote `sh:maxCount 1` (every subject counted); the next
+sync rewrites the constraint.
+
 The inverse path is stored as an untyped blank node, as is every complex `sh:path` shape sync
 writes (inverse, alternative, sequence, `*`/`+`/`?`): an IRI in `sh:path` is a predicate path to a
 SHACL validator. Nothing marks them: `PropertyShape.path` and the path operator slots are
-declared `sh:BlankNodeOrIRI`, see [Blank-node values](#blank-node-values-nodekind). Versions before 2.30 wrote IRI-named nodes (`…/owners/inv`); the next sync
-replaces them, except an operator node inside a sequence (`…/seq/0/inv`), which is left
-unreferenced. To remove those:
-
-```sparql
-DELETE { ?n ?p ?o } WHERE {
-  ?n a <https://linked.cm/ont/core/PathNode> ; ?p ?o .
-  FILTER(isIRI(?n)) FILTER NOT EXISTS { ?x ?y ?n }
-}
-```
+declared `sh:BlankNodeOrIRI`, see [Blank-node values](#blank-node-values-nodekind). Versions before 2.30 wrote IRI-named, typed path nodes (`…/owners/inv`, `…/region/seq/0`). The
+next sync writes blank nodes and leaves those behind, unreferenced; re-create the dataset, or
+delete them by IRI prefix (`…/owners/inv`, `…/seq/…`), to remove them.
 
 Read a stored path's structure in the same query that finds it (`?ps sh:path ?p .
 ?p sh:inversePath ?x`): a blank node's label is not stable across queries.
@@ -375,7 +387,7 @@ Read a stored path's structure in the same query that finds it (`?ps sh:path ?p
 The declaring shape owns its generated shapes through `core:generatedShape`, a `contains` edge:
 `<…/Thing> core:generatedShape <…/Thing/image.singleOwner>`. Syncing a shape is still two
 requests: deleting the shape deletes the generated shapes with it (their own triples, property
-shapes and blank path nodes, never the predicate IRI), and the create writes the current ones nested in
+shapes and their blank path and qualified-shape nodes, never the predicate IRI), and the create writes the current ones nested in
 the same request. A removed or renamed accessor therefore loses its constraint, a pruned shape
 takes its constraints with it, and a NodeShape the shape does not own is never touched.
 `singleOwnerShapeIri`, `singleOwnerProperties` and `buildSingleOwnerConstraints` are exported if
@@ -391,21 +403,9 @@ typed link.
 > write either: a dataset exposes only query, update and graph-store services. Run a SHACL
 > validator (Jena SHACL, pySHACL, …) against the persisted shapes to enforce them.
 
-**`dependent: true` on a shape** — marks the shape's *instances* as having no independent
-existence, so they are cascade-deleted when reached through a `contains` edge from a parent
-being deleted. Use it for structural nodes that are only ever owned (e.g. list cells, path
-nodes). It is **not** required for the replace/remove cleanup above — a `contains` edge alone
-is sufficient for the immediately-owned node; `dependent` extends the cascade to owned
-*descendants* several hops deep.
-
-```typescript
-@linkedShape({dependent: true})
-export class ListCell extends Shape { /* ... */ }
-```
-
-> Rule of thumb: put `contains` on the **property** that owns the value; put `dependent` on the
-> **shape** whose instances never stand alone. They are separate mechanisms — `contains` decides
-> *what to follow*, `dependent` decides *what may be deleted when reached*.
+**`dependent: true` on a shape** is deprecated and has no effect: every node a `contains` property
+reaches is deleted with its owner, whether or not its shape is `dependent`. It is still accepted,
+and shape sync still persists it (`core:dependent`).
 
 ### Blank-node values (`nodeKind`)
 
@@ -440,8 +440,8 @@ from its own copy of the shape. Core uses this for SHACL paths: `PropertyShape.p
 `{id}`) stays an IRI and every operator node and list cell becomes a blank node.
 
 A blank value goes with what holds it. Deleting the subject (by id, `.all()`, `.where()`),
-replacing or unsetting the property, deleting or replacing an owned (`contains`) child, and the
-containment cascade (a dependent node it deletes) delete the blank value and the blank nodes below it, following only blank-capable properties.
+replacing or unsetting the property, and deleting or replacing an owned (`contains`) value at any
+depth delete the blank value and the blank nodes below it, following only blank-capable properties.
 Only blank nodes are deleted: an IRI the structure refers to (`schema:image` in
 `[ sh:inversePath schema:image ]`, an entity a list lists) is never touched, nor is a blank node
 reached through one. `contains` is not needed for this.

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

@@ -21,8 +21,9 @@ const usesShapeClass = ns('usesShapeClass');
 const editInline = ns('editInline');
 const isExtending = ns('isExtending');
 // Containment / lifecycle vocabulary.
-//   contains  — property characteristic: the cascade follows this edge (composition).
-//   dependent — shape characteristic: instances may be deleted when reached via a `contains` edge.
+//   contains  — property characteristic: the subject owns the value through this property
+//               (composition); the owned walk follows it.
+//   dependent — shape characteristic, deprecated: no effect (persisted for older shapes).
 //   PathNode  — class for SHACL property-path operator nodes (sh:inversePath/alternativePath/…).
 const contains = ns('contains');
 const dependent = ns('dependent');
@@ -47,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,
@@ -62,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,sFAAsF;AACtF,mGAAmG;AACnG,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 cascade follows this edge (composition).\n//   dependent — shape characteristic: instances may be deleted when reached via a `contains` edge.\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/ontologies/shacl.d.ts

@@ -69,6 +69,9 @@ export declare const shacl: {
     targetClass: NodeReferenceValue;
     targetNode: NodeReferenceValue;
     targetObjectsOf: NodeReferenceValue;
+    qualifiedValueShape: NodeReferenceValue;
+    qualifiedMaxCount: NodeReferenceValue;
+    or: NodeReferenceValue;
     BlankNode: NodeReferenceValue;
     IRI: NodeReferenceValue;
     Literal: NodeReferenceValue;

package/lib/esm/ontologies/shacl.js

@@ -25,6 +25,9 @@ const PropertyShape = ns('PropertyShape');
 const targetClass = ns('targetClass');
 const targetNode = ns('targetNode');
 const targetObjectsOf = ns('targetObjectsOf');
+const qualifiedValueShape = ns('qualifiedValueShape');
+const qualifiedMaxCount = ns('qualifiedMaxCount');
+const or = ns('or');
 const node = ns('node');
 const nodeKind = ns('nodeKind');
 const Shape = ns('Shape');
@@ -116,6 +119,9 @@ export const shacl = {
     targetClass,
     targetNode,
     targetObjectsOf,
+    qualifiedValueShape,
+    qualifiedMaxCount,
+    or,
     BlankNode,
     IRI,
     Literal,

package/lib/esm/ontologies/shacl.js.map

@@ -1 +1 @@
-{"version":3,"file":"shacl.js","sourceRoot":"","sources":["../../../src/ontologies/shacl.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,MAAM,EAAC,MAAM,oBAAoB,CAAC;AAC1C,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAEtD,MAAM,IAAI,GAAG,6BAA6B,CAAC;AAC3C,MAAM,CAAC,MAAM,iBAAiB,GAAuB,EAAC,EAAE,EAAE,IAAI,EAAC,CAAC;AAChE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAE1B,MAAM,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;AAExC,8BAA8B;AAC9B,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC3B,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;AACrB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,iBAAiB,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AAClD,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,eAAe,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;AAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAE1B,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AACxC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC1B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,iBAAiB,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AAElD,MAAM,eAAe,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;AAC9C,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAC1C,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAE1C,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;AACtB,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,kBAAkB,GAAG,EAAE,CAAC,oBAAoB,CAAC,CAAC;AACpD,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAExC,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AACjC,yEAAyE;AACzE,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,uEAAuE;AACvE,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AACjD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AACnC,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC,2BAA2B,CAAC,CAAC;AACzE,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC,0BAA0B,CAAC,CAAC;AACvE,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC,yBAAyB,CAAC,CAAC;AACrE,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC,8BAA8B,CAAC,CAAC;AAC/E,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC,8BAA8B,CAAC,CAAC;AAC/E,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,0BAA0B,GAAG,EAAE,CAAC,4BAA4B,CAAC,CAAC;AAC3E,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC,uBAAuB,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC,2BAA2B,CAAC,CAAC;AACzE,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,MAAM,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAEnC,4CAA4C;AAC5C,MAAM,CAAC,MAAM,KAAK,GAAG;IACnB,KAAK,EAAE,MAAM;IACb,QAAQ;IACR,OAAO;IACP,EAAE,EAAE,GAAG;IACP,QAAQ;IACR,QAAQ;IACR,IAAI;IACJ,WAAW;IACX,IAAI;IACJ,SAAS;IACT,QAAQ;IACR,SAAS;IACT,iBAAiB;IACjB,IAAI;IACJ,MAAM;IACN,QAAQ;IACR,aAAa;IACb,KAAK;IACL,WAAW;IACX,UAAU;IACV,eAAe;IACf,SAAS;IACT,GAAG;IACH,OAAO;IACP,cAAc;IACd,kBAAkB;IAClB,YAAY;IACZ,QAAQ;IACR,MAAM;IACN,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,YAAY;IACZ,KAAK;IACL,KAAK;IACL,MAAM;IACN,iBAAiB;IACjB,UAAU;IACV,QAAQ;IACR,gBAAgB;IAChB,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,OAAO;IACP,UAAU;IACV,gBAAgB;IAChB,QAAQ;IACR,gBAAgB;IAChB,SAAS;IACT,WAAW;IACX,cAAc;IACd,UAAU;IACV,KAAK;IACL,OAAO;IACP,aAAa;IACb,MAAM;IACN,SAAS;IACT,yBAAyB;IACzB,wBAAwB;IACxB,uBAAuB;IACvB,2BAA2B;IAC3B,4BAA4B;IAC5B,4BAA4B;IAC5B,2BAA2B;IAC3B,2BAA2B;IAC3B,+BAA+B;IAC/B,+BAA+B;IAC/B,+BAA+B;IAC/B,+BAA+B;IAC/B,0BAA0B;IAC1B,qBAAqB;IACrB,2BAA2B;IAC3B,yBAAyB;IACzB,OAAO;IACP,IAAI;IACJ,cAAc;IACd,MAAM;IACN,eAAe;IACf,WAAW;IACX,cAAc;IACd,aAAa;IACb,aAAa;CACd,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {Prefix} from '../utils/Prefix.js';\nimport {createNameSpace} from '../utils/NameSpace.js';\n\nconst base = 'http://www.w3.org/ns/shacl#';\nexport const _ontologyResource: NodeReferenceValue = {id: base};\nPrefix.add('shacl', base);\n\nexport const ns = createNameSpace(base);\n\n//add your ontology nodes here\nconst _class = ns('class');\nconst datatype = ns('datatype');\nconst declare = ns('declare');\nconst _in = ns('in');\nconst maxCount = ns('maxCount');\nconst minCount = ns('minCount');\nconst inList = ns('inList');\nconst name = ns('name');\nconst description = ns('description');\nconst NodeShape = ns('NodeShape');\nconst optional = ns('optional');\nconst Parameter = ns('Parameter');\nconst PrefixDeclaration = ns('PrefixDeclaration');\nconst path = ns('path');\nconst property = ns('property');\nconst prefix = ns('prefix');\nconst PropertyShape = ns('PropertyShape');\nconst targetClass = ns('targetClass');\nconst targetNode = ns('targetNode');\nconst targetObjectsOf = ns('targetObjectsOf');\nconst node = ns('node');\nconst nodeKind = ns('nodeKind');\nconst Shape = ns('Shape');\n\nconst equals = ns('equals');\nconst disjoint = ns('disjoint');\nconst hasValue = ns('hasValue');\nconst defaultValue = ns('defaultValue');\nconst order = ns('order');\nconst group = ns('group');\nconst closed = ns('closed');\nconst ignoredProperties = ns('ignoredProperties');\n\nconst alternativePath = ns('alternativePath');\nconst inversePath = ns('inversePath');\nconst zeroOrMorePath = ns('zeroOrMorePath');\nconst oneOrMorePath = ns('oneOrMorePath');\nconst zeroOrOnePath = ns('zeroOrOnePath');\n\nconst BlankNode = ns('BlankNode');\nconst IRI = ns('IRI');\nconst Literal = ns('Literal');\nconst BlankNodeOrIRI = ns('BlankNodeOrIRI');\nconst BlankNodeOrLiteral = ns('BlankNodeOrLiteral');\nconst IRIOrLiteral = ns('IRIOrLiteral');\n\nexport const languageIn = ns('languageIn');\nexport const lessThan = ns('lessThan');\nexport const lessThanOrEquals = ns('lessThanOrEquals');\nexport const maxExclusive = ns('maxExclusive');\nexport const maxInclusive = ns('maxInclusive');\nexport const maxLength = ns('maxLength');\nexport const minExclusive = ns('minExclusive');\nexport const minInclusive = ns('minInclusive');\nexport const minLength = ns('minLength');\nexport const pattern = ns('pattern');\nexport const uniqueLang = ns('uniqueLang');\nexport const ValidationReport = ns('ValidationReport');\nexport const conforms = ns('conforms');\nexport const ValidationResult = ns('ValidationResult');\nexport const focusNode = ns('focusNode');\nexport const sourceShape = ns('sourceShape');\nexport const resultSeverity = ns('resultSeverity');\nexport const resultPath = ns('resultPath');\nexport const value = ns('value');\n/** `sh:message` — a custom message declared on a shape or constraint. */\nexport const message = ns('message');\n/** `sh:resultMessage` — the message carried by a validation result. */\nexport const resultMessage = ns('resultMessage');\n/** `sh:detail` — links a validation result to the results that explain it. */\nexport const detail = ns('detail');\nexport const Violation = ns('Violation');\nexport const AbstractResult = ns('AbstractResult');\nexport const sourceConstraintComponent = ns('sourceConstraintComponent');\nexport const ClassConstraintComponent = ns('ClassConstraintComponent');\nexport const NodeConstraintComponent = ns('NodeConstraintComponent');\nexport const DatatypeConstraintComponent = ns('DatatypeConstraintComponent');\nexport const MinLengthConstraintComponent = ns('MinLengthConstraintComponent');\nexport const MaxLengthConstraintComponent = ns('MaxLengthConstraintComponent');\nexport const MinInclusiveConstraintComponent = ns('MinInclusiveConstraintComponent');\nexport const MaxInclusiveConstraintComponent = ns('MaxInclusiveConstraintComponent');\nexport const MinExclusiveConstraintComponent = ns('MinExclusiveConstraintComponent');\nexport const MaxExclusiveConstraintComponent = ns('MaxExclusiveConstraintComponent');\nexport const PatternConstraintComponent = ns('PatternConstraintComponent');\nexport const InConstraintComponent = ns('InConstraintComponent');\nexport const MinCountConstraintComponent = ns('MinCountConstraintComponent');\nexport const MaxCountConstraintComponent = ns('MaxCountConstraintComponent');\nexport const NodeKindConstraintComponent = ns('NodeKindConstraintComponent');\nexport const ClosedConstraintComponent = ns('ClosedConstraintComponent');\nexport const Warning = ns('Warning');\nexport const Info = ns('Info');\nexport const result = ns('result');\n\n//make sure every node is also exported here\nexport const shacl = {\n  class: _class,\n  datatype,\n  declare,\n  in: _in,\n  maxCount,\n  minCount,\n  name,\n  description,\n  node,\n  NodeShape,\n  optional,\n  Parameter,\n  PrefixDeclaration,\n  path,\n  prefix,\n  property,\n  PropertyShape,\n  Shape,\n  targetClass,\n  targetNode,\n  targetObjectsOf,\n  BlankNode,\n  IRI,\n  Literal,\n  BlankNodeOrIRI,\n  BlankNodeOrLiteral,\n  IRIOrLiteral,\n  nodeKind,\n  inList,\n  equals,\n  disjoint,\n  hasValue,\n  defaultValue,\n  order,\n  group,\n  closed,\n  ignoredProperties,\n  languageIn,\n  lessThan,\n  lessThanOrEquals,\n  maxExclusive,\n  maxInclusive,\n  maxLength,\n  minExclusive,\n  minInclusive,\n  minLength,\n  pattern,\n  uniqueLang,\n  ValidationReport,\n  conforms,\n  ValidationResult,\n  focusNode,\n  sourceShape,\n  resultSeverity,\n  resultPath,\n  value,\n  message,\n  resultMessage,\n  detail,\n  Violation,\n  sourceConstraintComponent,\n  ClassConstraintComponent,\n  NodeConstraintComponent,\n  DatatypeConstraintComponent,\n  MinLengthConstraintComponent,\n  MaxLengthConstraintComponent,\n  MinCountConstraintComponent,\n  MaxCountConstraintComponent,\n  MinInclusiveConstraintComponent,\n  MaxInclusiveConstraintComponent,\n  MinExclusiveConstraintComponent,\n  MaxExclusiveConstraintComponent,\n  PatternConstraintComponent,\n  InConstraintComponent,\n  NodeKindConstraintComponent,\n  ClosedConstraintComponent,\n  Warning,\n  Info,\n  AbstractResult,\n  result,\n  alternativePath,\n  inversePath,\n  zeroOrMorePath,\n  oneOrMorePath,\n  zeroOrOnePath,\n};\n"]}
+{"version":3,"file":"shacl.js","sourceRoot":"","sources":["../../../src/ontologies/shacl.ts"],"names":[],"mappings":"AAMA,OAAO,EAAC,MAAM,EAAC,MAAM,oBAAoB,CAAC;AAC1C,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAEtD,MAAM,IAAI,GAAG,6BAA6B,CAAC;AAC3C,MAAM,CAAC,MAAM,iBAAiB,GAAuB,EAAC,EAAE,EAAE,IAAI,EAAC,CAAC;AAChE,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAE1B,MAAM,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;AAExC,8BAA8B;AAC9B,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC3B,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;AACrB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,iBAAiB,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AAClD,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AACpC,MAAM,eAAe,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;AAC9C,MAAM,mBAAmB,GAAG,EAAE,CAAC,qBAAqB,CAAC,CAAC;AACtD,MAAM,iBAAiB,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AAClD,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;AACpB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAE1B,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AAChC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AACxC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC1B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,iBAAiB,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AAElD,MAAM,eAAe,GAAG,EAAE,CAAC,iBAAiB,CAAC,CAAC;AAC9C,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AACtC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAC1C,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AAE1C,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AAClC,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;AACtB,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAC9B,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AAC5C,MAAM,kBAAkB,GAAG,EAAE,CAAC,oBAAoB,CAAC,CAAC;AACpD,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAExC,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC,kBAAkB,CAAC,CAAC;AACvD,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;AACjC,yEAAyE;AACzE,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,uEAAuE;AACvE,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;AACjD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AACnC,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC,2BAA2B,CAAC,CAAC;AACzE,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC,0BAA0B,CAAC,CAAC;AACvE,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC,yBAAyB,CAAC,CAAC;AACrE,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC,8BAA8B,CAAC,CAAC;AAC/E,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC,8BAA8B,CAAC,CAAC;AAC/E,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,CAAC,iCAAiC,CAAC,CAAC;AACrF,MAAM,CAAC,MAAM,0BAA0B,GAAG,EAAE,CAAC,4BAA4B,CAAC,CAAC;AAC3E,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC,uBAAuB,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC,6BAA6B,CAAC,CAAC;AAC7E,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC,2BAA2B,CAAC,CAAC;AACzE,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACrC,MAAM,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;AAEnC,4CAA4C;AAC5C,MAAM,CAAC,MAAM,KAAK,GAAG;IACnB,KAAK,EAAE,MAAM;IACb,QAAQ;IACR,OAAO;IACP,EAAE,EAAE,GAAG;IACP,QAAQ;IACR,QAAQ;IACR,IAAI;IACJ,WAAW;IACX,IAAI;IACJ,SAAS;IACT,QAAQ;IACR,SAAS;IACT,iBAAiB;IACjB,IAAI;IACJ,MAAM;IACN,QAAQ;IACR,aAAa;IACb,KAAK;IACL,WAAW;IACX,UAAU;IACV,eAAe;IACf,mBAAmB;IACnB,iBAAiB;IACjB,EAAE;IACF,SAAS;IACT,GAAG;IACH,OAAO;IACP,cAAc;IACd,kBAAkB;IAClB,YAAY;IACZ,QAAQ;IACR,MAAM;IACN,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,YAAY;IACZ,KAAK;IACL,KAAK;IACL,MAAM;IACN,iBAAiB;IACjB,UAAU;IACV,QAAQ;IACR,gBAAgB;IAChB,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,OAAO;IACP,UAAU;IACV,gBAAgB;IAChB,QAAQ;IACR,gBAAgB;IAChB,SAAS;IACT,WAAW;IACX,cAAc;IACd,UAAU;IACV,KAAK;IACL,OAAO;IACP,aAAa;IACb,MAAM;IACN,SAAS;IACT,yBAAyB;IACzB,wBAAwB;IACxB,uBAAuB;IACvB,2BAA2B;IAC3B,4BAA4B;IAC5B,4BAA4B;IAC5B,2BAA2B;IAC3B,2BAA2B;IAC3B,+BAA+B;IAC/B,+BAA+B;IAC/B,+BAA+B;IAC/B,+BAA+B;IAC/B,0BAA0B;IAC1B,qBAAqB;IACrB,2BAA2B;IAC3B,yBAAyB;IACzB,OAAO;IACP,IAAI;IACJ,cAAc;IACd,MAAM;IACN,eAAe;IACf,WAAW;IACX,cAAc;IACd,aAAa;IACb,aAAa;CACd,CAAC","sourcesContent":["/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at https://mozilla.org/MPL/2.0/.\n */\nimport type {NodeReferenceValue} from '../utils/NodeReference.js';\nimport {Prefix} from '../utils/Prefix.js';\nimport {createNameSpace} from '../utils/NameSpace.js';\n\nconst base = 'http://www.w3.org/ns/shacl#';\nexport const _ontologyResource: NodeReferenceValue = {id: base};\nPrefix.add('shacl', base);\n\nexport const ns = createNameSpace(base);\n\n//add your ontology nodes here\nconst _class = ns('class');\nconst datatype = ns('datatype');\nconst declare = ns('declare');\nconst _in = ns('in');\nconst maxCount = ns('maxCount');\nconst minCount = ns('minCount');\nconst inList = ns('inList');\nconst name = ns('name');\nconst description = ns('description');\nconst NodeShape = ns('NodeShape');\nconst optional = ns('optional');\nconst Parameter = ns('Parameter');\nconst PrefixDeclaration = ns('PrefixDeclaration');\nconst path = ns('path');\nconst property = ns('property');\nconst prefix = ns('prefix');\nconst PropertyShape = ns('PropertyShape');\nconst targetClass = ns('targetClass');\nconst targetNode = ns('targetNode');\nconst targetObjectsOf = ns('targetObjectsOf');\nconst qualifiedValueShape = ns('qualifiedValueShape');\nconst qualifiedMaxCount = ns('qualifiedMaxCount');\nconst or = ns('or');\nconst node = ns('node');\nconst nodeKind = ns('nodeKind');\nconst Shape = ns('Shape');\n\nconst equals = ns('equals');\nconst disjoint = ns('disjoint');\nconst hasValue = ns('hasValue');\nconst defaultValue = ns('defaultValue');\nconst order = ns('order');\nconst group = ns('group');\nconst closed = ns('closed');\nconst ignoredProperties = ns('ignoredProperties');\n\nconst alternativePath = ns('alternativePath');\nconst inversePath = ns('inversePath');\nconst zeroOrMorePath = ns('zeroOrMorePath');\nconst oneOrMorePath = ns('oneOrMorePath');\nconst zeroOrOnePath = ns('zeroOrOnePath');\n\nconst BlankNode = ns('BlankNode');\nconst IRI = ns('IRI');\nconst Literal = ns('Literal');\nconst BlankNodeOrIRI = ns('BlankNodeOrIRI');\nconst BlankNodeOrLiteral = ns('BlankNodeOrLiteral');\nconst IRIOrLiteral = ns('IRIOrLiteral');\n\nexport const languageIn = ns('languageIn');\nexport const lessThan = ns('lessThan');\nexport const lessThanOrEquals = ns('lessThanOrEquals');\nexport const maxExclusive = ns('maxExclusive');\nexport const maxInclusive = ns('maxInclusive');\nexport const maxLength = ns('maxLength');\nexport const minExclusive = ns('minExclusive');\nexport const minInclusive = ns('minInclusive');\nexport const minLength = ns('minLength');\nexport const pattern = ns('pattern');\nexport const uniqueLang = ns('uniqueLang');\nexport const ValidationReport = ns('ValidationReport');\nexport const conforms = ns('conforms');\nexport const ValidationResult = ns('ValidationResult');\nexport const focusNode = ns('focusNode');\nexport const sourceShape = ns('sourceShape');\nexport const resultSeverity = ns('resultSeverity');\nexport const resultPath = ns('resultPath');\nexport const value = ns('value');\n/** `sh:message` — a custom message declared on a shape or constraint. */\nexport const message = ns('message');\n/** `sh:resultMessage` — the message carried by a validation result. */\nexport const resultMessage = ns('resultMessage');\n/** `sh:detail` — links a validation result to the results that explain it. */\nexport const detail = ns('detail');\nexport const Violation = ns('Violation');\nexport const AbstractResult = ns('AbstractResult');\nexport const sourceConstraintComponent = ns('sourceConstraintComponent');\nexport const ClassConstraintComponent = ns('ClassConstraintComponent');\nexport const NodeConstraintComponent = ns('NodeConstraintComponent');\nexport const DatatypeConstraintComponent = ns('DatatypeConstraintComponent');\nexport const MinLengthConstraintComponent = ns('MinLengthConstraintComponent');\nexport const MaxLengthConstraintComponent = ns('MaxLengthConstraintComponent');\nexport const MinInclusiveConstraintComponent = ns('MinInclusiveConstraintComponent');\nexport const MaxInclusiveConstraintComponent = ns('MaxInclusiveConstraintComponent');\nexport const MinExclusiveConstraintComponent = ns('MinExclusiveConstraintComponent');\nexport const MaxExclusiveConstraintComponent = ns('MaxExclusiveConstraintComponent');\nexport const PatternConstraintComponent = ns('PatternConstraintComponent');\nexport const InConstraintComponent = ns('InConstraintComponent');\nexport const MinCountConstraintComponent = ns('MinCountConstraintComponent');\nexport const MaxCountConstraintComponent = ns('MaxCountConstraintComponent');\nexport const NodeKindConstraintComponent = ns('NodeKindConstraintComponent');\nexport const ClosedConstraintComponent = ns('ClosedConstraintComponent');\nexport const Warning = ns('Warning');\nexport const Info = ns('Info');\nexport const result = ns('result');\n\n//make sure every node is also exported here\nexport const shacl = {\n  class: _class,\n  datatype,\n  declare,\n  in: _in,\n  maxCount,\n  minCount,\n  name,\n  description,\n  node,\n  NodeShape,\n  optional,\n  Parameter,\n  PrefixDeclaration,\n  path,\n  prefix,\n  property,\n  PropertyShape,\n  Shape,\n  targetClass,\n  targetNode,\n  targetObjectsOf,\n  qualifiedValueShape,\n  qualifiedMaxCount,\n  or,\n  BlankNode,\n  IRI,\n  Literal,\n  BlankNodeOrIRI,\n  BlankNodeOrLiteral,\n  IRIOrLiteral,\n  nodeKind,\n  inList,\n  equals,\n  disjoint,\n  hasValue,\n  defaultValue,\n  order,\n  group,\n  closed,\n  ignoredProperties,\n  languageIn,\n  lessThan,\n  lessThanOrEquals,\n  maxExclusive,\n  maxInclusive,\n  maxLength,\n  minExclusive,\n  minInclusive,\n  minLength,\n  pattern,\n  uniqueLang,\n  ValidationReport,\n  conforms,\n  ValidationResult,\n  focusNode,\n  sourceShape,\n  resultSeverity,\n  resultPath,\n  value,\n  message,\n  resultMessage,\n  detail,\n  Violation,\n  sourceConstraintComponent,\n  ClassConstraintComponent,\n  NodeConstraintComponent,\n  DatatypeConstraintComponent,\n  MinLengthConstraintComponent,\n  MaxLengthConstraintComponent,\n  MinCountConstraintComponent,\n  MaxCountConstraintComponent,\n  MinInclusiveConstraintComponent,\n  MaxInclusiveConstraintComponent,\n  MinExclusiveConstraintComponent,\n  MaxExclusiveConstraintComponent,\n  PatternConstraintComponent,\n  InConstraintComponent,\n  NodeKindConstraintComponent,\n  ClosedConstraintComponent,\n  Warning,\n  Info,\n  AbstractResult,\n  result,\n  alternativePath,\n  inversePath,\n  zeroOrMorePath,\n  oneOrMorePath,\n  zeroOrOnePath,\n};\n"]}

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

@@ -3,9 +3,9 @@ import { Shape } from './Shape.js';
  * SHACL/RDF ordered-list cell shape (`rdf:List`).
  *
  * A list is a chain of cells: `first` holds the value, `rest` points to the next cell
- * (or `rdf:nil`). The cell is `dependent` (it has no independent existence) and `rest` is
- * a `contains` edge, so deleting/replacing a list cascade-cleans the whole spine — while
- * `first` is NOT a `contains` edge, so the list's *contents* (shared IRIs/values) are kept.
+ * (or `rdf:nil`). `rest` is a `contains` edge, so deleting / replacing a list's owner deletes
+ * the whole spine (`rdf:rest*`) — while `first` is NOT a `contains` edge, so the list's
+ * *contents* (shared IRIs / values) are kept.
  *
  * This module holds the class only, and must never import `package.js`: `utils/Package.ts`
  * imports it to register `List` by value (as it does NodeShape and PropertyShape) and to use

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

@@ -16,9 +16,9 @@ import { rdf } from '../ontologies/rdf.js';
  * SHACL/RDF ordered-list cell shape (`rdf:List`).
  *
  * A list is a chain of cells: `first` holds the value, `rest` points to the next cell
- * (or `rdf:nil`). The cell is `dependent` (it has no independent existence) and `rest` is
- * a `contains` edge, so deleting/replacing a list cascade-cleans the whole spine — while
- * `first` is NOT a `contains` edge, so the list's *contents* (shared IRIs/values) are kept.
+ * (or `rdf:nil`). `rest` is a `contains` edge, so deleting / replacing a list's owner deletes
+ * the whole spine (`rdf:rest*`) — while `first` is NOT a `contains` edge, so the list's
+ * *contents* (shared IRIs / values) are kept.
  *
  * This module holds the class only, and must never import `package.js`: `utils/Package.ts`
  * imports it to register `List` by value (as it does NodeShape and PropertyShape) and to use

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

@@ -1 +1 @@
-{"version":3,"file":"List.class.js","sourceRoot":"","sources":["../../../src/shapes/List.class.ts"],"names":[],"mappings":";;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,cAAc,EAAE,cAAc,EAAC,MAAM,YAAY,CAAC;AAC1D,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AAEzC;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,IAAkB,SAAQ,KAAK;IAI1C,IAAI,KAAK;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC;IACd,CAAC;;AAVM,gBAAW,GAAG,GAAG,CAAC,IAAI,CAAC;AAG9B;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,CAAC;iCAG9C;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;gCAG1E","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 {Shape} from './Shape.js';\nimport {linkedProperty, objectProperty} from './SHACL.js';\nimport {rdf} from '../ontologies/rdf.js';\n\n/**\n * SHACL/RDF ordered-list cell shape (`rdf:List`).\n *\n * A list is a chain of cells: `first` holds the value, `rest` points to the next cell\n * (or `rdf:nil`). The cell is `dependent` (it has no independent existence) and `rest` is\n * a `contains` edge, so deleting/replacing a list cascade-cleans the whole spine — while\n * `first` is NOT a `contains` edge, so the list's *contents* (shared IRIs/values) are kept.\n *\n * This module holds the class only, and must never import `package.js`: `utils/Package.ts`\n * imports it to register `List` by value (as it does NodeShape and PropertyShape) and to use\n * it as the value shape of `PropertyShape.in`. Importing `package.js` from here would be a\n * cycle, with `corePackage` still uninitialised when this module evaluates. The public module\n * is `List.ts`, which loads the registration.\n */\nexport class List<T = unknown> extends Shape {\n  static targetClass = rdf.List;\n\n  @linkedProperty({path: rdf.first, maxCount: 1})\n  get first(): T {\n    return null;\n  }\n\n  @objectProperty({path: rdf.rest, maxCount: 1, shape: List, contains: true})\n  get rest(): List<T> {\n    return null;\n  }\n}\n"]}
+{"version":3,"file":"List.class.js","sourceRoot":"","sources":["../../../src/shapes/List.class.ts"],"names":[],"mappings":";;;;;;AAAA;;;;GAIG;AACH,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,OAAO,EAAC,cAAc,EAAE,cAAc,EAAC,MAAM,YAAY,CAAC;AAC1D,OAAO,EAAC,GAAG,EAAC,MAAM,sBAAsB,CAAC;AAEzC;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,IAAkB,SAAQ,KAAK;IAI1C,IAAI,KAAK;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC;IACd,CAAC;;AAVM,gBAAW,GAAG,GAAG,CAAC,IAAI,CAAC;AAG9B;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAC,CAAC;iCAG9C;AAGD;IADC,cAAc,CAAC,EAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAC,CAAC;gCAG1E","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 {Shape} from './Shape.js';\nimport {linkedProperty, objectProperty} from './SHACL.js';\nimport {rdf} from '../ontologies/rdf.js';\n\n/**\n * SHACL/RDF ordered-list cell shape (`rdf:List`).\n *\n * A list is a chain of cells: `first` holds the value, `rest` points to the next cell\n * (or `rdf:nil`). `rest` is a `contains` edge, so deleting / replacing a list's owner deletes\n * the whole spine (`rdf:rest*`) — while `first` is NOT a `contains` edge, so the list's\n * *contents* (shared IRIs / values) are kept.\n *\n * This module holds the class only, and must never import `package.js`: `utils/Package.ts`\n * imports it to register `List` by value (as it does NodeShape and PropertyShape) and to use\n * it as the value shape of `PropertyShape.in`. Importing `package.js` from here would be a\n * cycle, with `corePackage` still uninitialised when this module evaluates. The public module\n * is `List.ts`, which loads the registration.\n */\nexport class List<T = unknown> extends Shape {\n  static targetClass = rdf.List;\n\n  @linkedProperty({path: rdf.first, maxCount: 1})\n  get first(): T {\n    return null;\n  }\n\n  @objectProperty({path: rdf.rest, maxCount: 1, shape: List, contains: true})\n  get rest(): List<T> {\n    return null;\n  }\n}\n"]}

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

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

package/lib/esm/shapes/PathList.js

@@ -15,8 +15,9 @@ import { objectProperty } from './SHACL.js';
 import { shacl } from '../ontologies/shacl.js';
 import { rdf } from '../ontologies/rdf.js';
 /**
- * A cell of the `rdf:List` inside a SHACL property path: the members of a sequence path, or the
- * operand of `sh:alternativePath`.
+ * A blank `rdf:List` cell of SHACL structure core writes: the members of a sequence path, the
+ * operand of `sh:alternativePath`, and the `sh:or` list of a generated single-owner constraint
+ * (`singleOwnerConstraint.ts`).
  *
  * Both properties are `sh:BlankNodeOrIRI`, so a cell written without an id is a blank node, and so
  * is an operator node (`PathNode`) held by `first`. That keeps a sequence path a blank list, which
@@ -26,15 +27,11 @@ import { rdf } from '../ontologies/rdf.js';
  * cannot be declared node-only, and making `List.rest` blank-capable would turn the tail cells of
  * every list built without ids into blank nodes. Both shapes target `rdf:List`; `List` is
  * registered first, so a lookup by `rdf:List` still returns `List`.
- *
- * `dependent` and the `contains` on `rest` keep removing the IRI-named, typed list cells of
- * versions before 2.30 through the typed cascade.
  */
 let PathList = class PathList extends Shape {
     /**
-     * A predicate IRI, or an operator node (`PathNode`). Not `contains`: ownership is decided per
-     * predicate across the registry, and `rdf:first` of every other list holds values the list
-     * does not own. The blank-node cascade follows it anyway, because it is blank-capable.
+     * A predicate IRI, or an operator node (`PathNode`). Not `contains`: a predicate IRI is
+     * shared. The blank-node cascade follows it, because it is blank-capable.
      */
     get first() {
         return null;
@@ -57,7 +54,7 @@ __decorate([
     })
 ], PathList.prototype, "rest", null);
 PathList = __decorate([
-    linkedShape({ name: 'PathList', dependent: true })
+    linkedShape({ name: 'PathList' })
 ], PathList);
 export { PathList };
 //# sourceMappingURL=PathList.js.map

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

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