@_linked/core 2.30.1 → 2.32.0

package/CHANGELOG.md

@@ -1,5 +1,72 @@
 # Changelog
 
+## 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
+
+- [#336](https://github.com/linked-fw/core/pull/336) [`742d0a2`](https://github.com/linked-fw/core/commit/742d0a24496a84cdb6c14cb8eb6b9e705998df33) Thanks [@flyon](https://github.com/flyon)! - A nested create is now written as a blank node when the **property** that holds it allows blank nodes through its `nodeKind`. This replaces the `__blank: true` node-data key added in 2.30.0, which is removed.
+  
+  **Minting follows the property's `nodeKind`:**
+  
+  | `nodeKind` | nested value without an id | with an id |
+  |---|---|---|
+  | unset, `shacl.IRI` (the `objectProperty` default), `shacl.IRIOrLiteral` | IRI (as before) | IRI |
+  | `shacl.BlankNodeOrIRI` | blank node | IRI |
+  | `shacl.BlankNode`, `shacl.BlankNodeOrLiteral` | blank node | error |
+  | `shacl.Literal` | error | error |
+  
+  ```ts
+  @objectProperty({path: ex.geo, shape: GeoPoint, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI})
+  declare geo: GeoPoint;
+  
+  // <place1> ex:geo _:b0 . _:b0 ex:lat "52.1" .
+  await Place.create({geo: {lat: '52.1'}}).withId(place1);
+  ```
+  
+  A blank node is written with its field triples only, without `rdf:type`. Nothing about it is sent in DSL-JSON: the side that runs the mutation decides from its own shapes. **Upgrade the side that lowers mutations (the server) first:** a 2.30.x server lowering DSL-JSON from this version writes complex `sh:path` values as IRI nodes again, since the `__blank` key it read is no longer sent.
+  
+  **Blank values are deleted with what holds them.** Deleting the subject (by id, `.all()`, `.where()`), replacing or unsetting the property, deleting or replacing an owned (`contains`) child, and the containment cascade delete the blank value and the blank nodes below it, following only blank-capable properties. Only blank nodes are deleted, never an IRI the structure refers to, and `contains` is no longer needed for it. This replaces the `contains`-based blank-node cleanup of 2.30.0 and the bulk deletes' blank-node cleanup.
+  
+  **Refused with an error** (not supported yet): an `update` / `upsert` / `updateWhere` whose new value would be a blank node, and an id of the form `_:…` used to link, `update().for()` or delete by id.
+  
+  **Shape sync is unchanged.** `PropertyShape.path` and the path operator slots are declared `shacl.BlankNodeOrIRI`, and path lists use a new `PathList` shape (`@_linked/core/shapes/PathList`), so sync writes the same blank `sh:path` structure as 2.30.0, byte for byte (pinned by a test against the 2.30.0 output). `PathNode.alternativePath` now declares `PathList` as its value shape; `List`, `rdfList()` and `sh:in` lists are unchanged.
+  
+  **Removed:** `__blank` on `NodeDescriptionValue`, `IRNodeData.blank`, and the `__blank` DSL-JSON key. Only shape sync used it. A `__blank` key in mutation data is now rejected as an undeclared property.
+  
+  See README "Blank-node values (`nodeKind`)" and `docs/architecture/owned-values.md`.
+
 ## 2.30.1
 
 ### Patch 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,33 +362,32 @@ 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. 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:
+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, 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.
 
-```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 }
-}
-```
- Read a stored path's structure in the same query that finds it (`?ps sh:path ?p .
+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.
 
-Nested node-data in a `create` may carry `__blank: true` to be written that way: a fresh blank
-node with only its field triples and no `rdf:type`. It is meant for RDF syntax such as SHACL
-paths, has no id (combining it with `__id`/`id` throws), cannot be the created root, and is
-refused in `update`/`upsert`, whose INSERT runs once per WHERE solution.
 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
@@ -393,21 +403,58 @@ 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.
+**`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`)
+
+Every node core writes is IRI-named unless the **property** that holds it says otherwise. A
+nested create is written as a blank node when its property's `nodeKind` allows blank nodes:
+
+| `nodeKind` of the property | nested value without an id | with an id |
+|---|---|---|
+| unset, `shacl.IRI` (the `objectProperty` default), `shacl.IRIOrLiteral` | IRI (minted) | IRI |
+| `shacl.BlankNodeOrIRI` | blank node | IRI |
+| `shacl.BlankNode` | blank node | error |
+| `shacl.BlankNodeOrLiteral` | blank node | error |
+| `shacl.Literal` | error | error |
 
 ```typescript
-@linkedShape({dependent: true})
-export class ListCell extends Shape { /* ... */ }
+@linkedShape
+export class Place extends Shape {
+  static targetClass = ex.Place;
+
+  @objectProperty({path: ex.geo, shape: GeoPoint, maxCount: 1, nodeKind: shacl.BlankNodeOrIRI})
+  declare geo: GeoPoint;
+}
+
+// <place1> ex:geo _:b0 . _:b0 ex:lat "52.1" .
+await Place.create({geo: {lat: '52.1'}}).withId(place1);
 ```
 
-> 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*.
+A blank node is written with its field triples only, without `rdf:type`: its shape is the one the
+property declares. Nothing about it travels in DSL-JSON; the side that runs the mutation decides
+from its own copy of the shape. Core uses this for SHACL paths: `PropertyShape.path`, the
+`PathNode` slots and `PathList.first` / `.rest` are `sh:BlankNodeOrIRI`, so a predicate path (an
+`{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, 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.
+
+Not supported yet, and refused with an error rather than written wrongly:
+
+- an `update` / `upsert` / `updateWhere` whose new value would be a blank node (its INSERT runs
+  once per WHERE solution, so the node would be written several times). Create it with its
+  parent, or give it an id under `sh:BlankNodeOrIRI`;
+- addressing a blank node by id: linking `{id: '_:b0'}`, `update().for('_:b0')`, deleting
+  `{id: '_:b0'}`. Change it through the property that holds it.
+
+A select returns a blank value as its store label (Fuseki: `b0`), valid only within that result.
 
 ## Queries: Create, Select, Update, Delete
 
@@ -988,7 +1035,7 @@ const deleted = await Person.delete({id: 'https://my.app/node1'});
 // Delete multiple nodes
 const deleted = await Person.delete([{id: 'https://my.app/node1'}, {id: 'https://my.app/node2'}]);
 
-// Delete all instances of a shape (with blank node cleanup)
+// Delete all instances of a shape (with their blank-node values)
 await Person.deleteAll();
 
 // Conditional delete

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');

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,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"]}

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/queries/IRMutation.js

@@ -84,7 +84,7 @@ const toFieldUpdate = (field, collector) => {
     };
 };
 const toNodeData = (description, collector) => {
-    return Object.assign(Object.assign({ shape: description.shape.id, fields: description.fields.map((f) => toFieldUpdate(f, collector)) }, (description.__id ? { id: description.__id } : {})), (description.__blank ? { blank: true } : {}));
+    return Object.assign({ shape: description.shape.id, fields: description.fields.map((f) => toFieldUpdate(f, collector)) }, (description.__id ? { id: description.__id } : {}));
 };
 /** Builds an IRCreateMutation from a create factory's internal description. */
 export const buildCanonicalCreateMutationIR = (query) => {

package/lib/esm/queries/IRMutation.js.map

@@ -1 +1 @@
-{"version":3,"file":"IRMutation.js","sourceRoot":"","sources":["../../../src/queries/IRMutation.ts"],"names":[],"mappings":"AACA,OAAO,EAML,sBAAsB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAC,gBAAgB,EAAE,qBAAqB,EAAC,MAAM,kCAAkC,CAAC;AAiBzF,OAAO,EAAC,uBAAuB,EAAC,MAAM,cAAc,CAAC;AAmBrD;;;GAGG;AACH,MAAM,wBAAwB,GAAG,CAC/B,OAA6B,EAC7B,OAAe,EACT,EAAE;;IACR,KAAK,MAAM,KAAK,IAAI,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,mCAAI,EAAE,EAAE,CAAC;QAC1C,iFAAiF;QACjF,4CAA4C;QAC5C,IAAI,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CACb,+DAA+D,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,OAAO,KAAK;gBAC9F,6FAA6F;gBAC7F,4EAA4E;gBAC5E,mDAAmD,CACtD,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAOF,MAAM,eAAe,GAAG,CAAC,KAAyB,EAAsB,EAAE,CAAC,CAAC;IAC1E,EAAE,EAAE,KAAK,CAAC,EAAE;CACb,CAAC,CAAC;AAEH,MAAM,iBAAiB,GAAG,CAAC,KAA2B,EAA0B,EAAE;IAChF,OAAO;QACL,GAAG,EAAE,KAAK,CAAC,IAAI;YACb,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAkC,CAAC,CAAC;YAC5E,CAAC,CAAC,SAAS;QACb,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;KACvF,CAAC;AACJ,CAAC,CAAC;AAEF,wEAAwE;AACxE,MAAM,sBAAsB,GAAG,sBAAsB,CAAC;AAOtD;;;;GAIG;AACH,MAAM,UAAU,wBAAwB;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,uBAAuB,CAC5B,GAAG,EAAE,CAAC,UAAU,OAAO,EAAE,IAAI,EAC7B,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAsB,EAAE,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAC,CAAC,CACnE,CAAC;AACJ,CAAC;AAED,MAAM,kBAAkB,GAAG,CACzB,KAAgC,EAChC,SAA8B,EAChB,EAAE;IAChB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,qBAAqB,CAC1B,KAAK,CAAC,EAAE,EACR,KAAK,CAAC,KAAK,EACX,sBAAsB;QACtB,wEAAwE;QACxE,qGAAqG;QACrG,yFAAyF;QACzF,SAAS;YACP,CAAC,CAAC,SAAS,CAAC,OAAO;YACnB,CAAC,CAAC,CAAC,UAAU,EAAE,gBAAgB,EAAE,EAAE;gBAC/B,uEAAuE;gBACvE,OAAO,sBAAsB,CAAC;YAChC,CAAC,CACN,CAAC;IACJ,CAAC;IAED,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS;QAC1B,KAAK,YAAY,IAAI,EACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,IAAI,IAAK,KAA4B,EAAE,CAAC;QAC1C,OAAO,eAAe,CAAC,KAA2B,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,UAAU,CAAC,KAA6B,CAAC,CAAC;AACnD,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CACnB,KAAsB,EACtB,SAA8B,EAChB,EAAE;IAChB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,IAAI,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AAC9C,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CACpB,KAA6C,EAC7C,SAA8B,EACf,EAAE;IACjB,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;QACvB,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC;KAC1C,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CACjB,WAAiC,EACjC,SAA8B,EAClB,EAAE;IACd,qCACE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,EAC3B,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAC/D,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,WAAW,CAAC,IAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAChD,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAC,KAAK,EAAE,IAAa,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EACtD;AACJ,CAAC,CAAC;AAEF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC;KACpC,CAAC;AACJ,CAAC,CAAC;AAEF,gFAAgF;AAChF,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,EAAE,EAAE,KAAK,CAAC,EAAE,EACZ,IAAI,IACD,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,wBAAwB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,EAAE,EAAE,KAAK,CAAC,EAAE,EACZ,IAAI,IACD,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC;AAEF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAC,CAAC,CAAC;KAC1C,CAAC;AACJ,CAAC,CAAC;AAMF,4EAA4E;AAC5E,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAC/C,KAA6B,EACR,EAAE;IACvB,OAAO;QACL,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;KACtB,CAAC;AACJ,CAAC,CAAC;AAQF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,mCAAmC,GAAG,CACjD,KAA+B,EACR,EAAE;IACzB,OAAO;QACL,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,aAAa,EAAE,KAAK,CAAC,aAAa;KACnC,CAAC;AACJ,CAAC,CAAC;AASF,sFAAsF;AACtF,MAAM,CAAC,MAAM,mCAAmC,GAAG,CACjD,KAA+B,EACR,EAAE;IACzB,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,IAAI,EACJ,KAAK,EAAE,KAAK,CAAC,KAAK,EAClB,aAAa,EAAE,KAAK,CAAC,aAAa,IAC/B,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC","sourcesContent":["import type {NodeShapeData} from '../shapes/SHACL.js';\nimport {\n  type NodeDescriptionValue,\n  NodeReferenceValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  isSetModificationValue,\n} from './QueryFactory.js';\nimport {isExpressionNode, resolveExpressionRefs} from '../expressions/ExpressionNode.js';\nimport type {\n  IRCreateMutation,\n  IRDeleteMutation,\n  IRDeleteAllMutation,\n  IRDeleteWhereMutation,\n  IRUpdateWhereMutation,\n  IRFieldValue,\n  IRNodeData,\n  IRFieldUpdate,\n  IRSetModificationValue,\n  IRUpdateMutation,\n  IRUpsertMutation,\n  IRExpression,\n  IRGraphPattern,\n  IRTraversalPattern,\n} from './IntermediateRepresentation.js';\nimport {createTraversalResolver} from './IRLower.js';\n\ntype CreateMutationInput = {\n  shape: NodeShapeData;\n  description: NodeDescriptionValue;\n};\n\ntype UpdateMutationInput = {\n  id: string;\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n};\n\ntype UpsertMutationInput = {\n  id: string;\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n};\n\n/**\n * Throws if any field of an upsert carries an expression. Named per offending property so\n * the caller is not left decoding an unbound-variable mystery further down the pipeline.\n */\nconst assertNoExpressionFields = (\n  updates: NodeDescriptionValue,\n  shapeId: string,\n): void => {\n  for (const field of updates?.fields ?? []) {\n    // Mirrors how `toSingleFieldValue` recognises an expression, so the guard cannot\n    // drift from the lowering it is protecting.\n    if (isExpressionNode(field.val)) {\n      throw new Error(\n        `upsert does not support expression-valued fields (property \"${field.prop.id}\" of ${shapeId}). ` +\n          `An expression reads the node's current value, which does not exist when upsert creates it, ` +\n          `and the property would be silently skipped. Pass a concrete value, or use ` +\n          `update().for({id}) if the node is known to exist.`,\n      );\n    }\n  }\n};\n\ntype DeleteMutationInput = {\n  shape: NodeShapeData;\n  ids: NodeReferenceValue[];\n};\n\nconst toNodeReference = (value: NodeReferenceValue): NodeReferenceValue => ({\n  id: value.id,\n});\n\nconst toSetModification = (value: SetModificationValue): IRSetModificationValue => {\n  return {\n    add: value.$add\n      ? value.$add.map((item) => toFieldValue(item as unknown as PropUpdateValue))\n      : undefined,\n    remove: value.$remove ? value.$remove.map((item) => toNodeReference(item)) : undefined,\n  };\n};\n\n/** Alias used as the mutation subject for expression ref resolution. */\nconst MUTATION_SUBJECT_ALIAS = '__mutation_subject__';\n\nexport type TraversalCollector = {\n  resolve: (fromAlias: string, propertyShapeId: string) => string;\n  patterns: IRTraversalPattern[];\n};\n\n/**\n * Create a traversal collector for mutation expressions. Uses `__trav_N__` alias\n * prefixes to avoid collision with query aliases (a0, a1...) and the mutation\n * subject placeholder. Delegates to the shared createTraversalResolver factory.\n */\nexport function createTraversalCollector(): TraversalCollector {\n  let counter = 0;\n  return createTraversalResolver(\n    () => `__trav_${counter++}__`,\n    (from, to, property): IRTraversalPattern => ({from, property, to}),\n  );\n}\n\nconst toSingleFieldValue = (\n  value: SinglePropertyUpdateValue,\n  collector?: TraversalCollector,\n): IRFieldValue => {\n  if (value === undefined) {\n    return undefined;\n  }\n\n  // ExpressionNode → resolve refs and extract IRExpression\n  if (isExpressionNode(value)) {\n    return resolveExpressionRefs(\n      value.ir,\n      value._refs,\n      MUTATION_SUBJECT_ALIAS,\n      // In mutation context, all property segments are on the subject entity.\n      // For single-segment refs (e.g. p.age), the property_expr already has the property as its .property.\n      // For multi-segment refs (e.g. p.bestFriend.name), this creates intermediate traversals.\n      collector\n        ? collector.resolve\n        : (_fromAlias, _propertyShapeId) => {\n            // No collector provided — multi-segment traversals cannot be resolved.\n            return MUTATION_SUBJECT_ALIAS;\n          },\n    );\n  }\n\n  if (\n    typeof value === 'string' ||\n    typeof value === 'number' ||\n    typeof value === 'boolean' ||\n    value instanceof Date\n  ) {\n    return value;\n  }\n\n  if ('id' in (value as NodeReferenceValue)) {\n    return toNodeReference(value as NodeReferenceValue);\n  }\n\n  return toNodeData(value as NodeDescriptionValue);\n};\n\nconst toFieldValue = (\n  value: PropUpdateValue,\n  collector?: TraversalCollector,\n): IRFieldValue => {\n  if (Array.isArray(value)) {\n    return value.map((item) => toSingleFieldValue(item, collector));\n  }\n\n  if (isSetModificationValue(value)) {\n    return toSetModification(value);\n  }\n\n  return toSingleFieldValue(value, collector);\n};\n\nconst toFieldUpdate = (\n  field: NodeDescriptionValue['fields'][number],\n  collector?: TraversalCollector,\n): IRFieldUpdate => {\n  return {\n    property: field.prop.id,\n    value: toFieldValue(field.val, collector),\n  };\n};\n\nconst toNodeData = (\n  description: NodeDescriptionValue,\n  collector?: TraversalCollector,\n): IRNodeData => {\n  return {\n    shape: description.shape.id,\n    fields: description.fields.map((f) => toFieldUpdate(f, collector)),\n    ...(description.__id ? {id: description.__id} : {}),\n    ...(description.__blank ? {blank: true as const} : {}),\n  };\n};\n\n/** Builds an IRCreateMutation from a create factory's internal description. */\nexport const buildCanonicalCreateMutationIR = (\n  query: CreateMutationInput,\n): IRCreateMutation => {\n  return {\n    kind: 'create',\n    shape: query.shape.id,\n    data: toNodeData(query.description),\n  };\n};\n\n/** Builds an IRUpdateMutation from an update factory's internal description. */\nexport const buildCanonicalUpdateMutationIR = (\n  query: UpdateMutationInput,\n): IRUpdateMutation => {\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'update',\n    shape: query.shape.id,\n    id: query.id,\n    data,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n\n/**\n * Builds an IRUpsertMutation — an update that also asserts the node's type, so it is\n * correct whether or not the node exists.\n *\n * Rejects expression-valued fields. An expression such as `age: p.age.plus(1)` lowers to\n * a BIND over the node's current value; when the node does not exist that ref is unbound,\n * and SPARQL drops any INSERT triple containing an unbound variable. The write would\n * report success and store nothing for that property — precisely the silent-wrong-write\n * this primitive exists to remove, so it is refused rather than documented.\n */\nexport const buildCanonicalUpsertMutationIR = (\n  query: UpsertMutationInput,\n): IRUpsertMutation => {\n  assertNoExpressionFields(query.updates, query.shape.id);\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'upsert',\n    shape: query.shape.id,\n    id: query.id,\n    data,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n\n/** Builds an IRDeleteMutation from a delete factory's internal description. */\nexport const buildCanonicalDeleteMutationIR = (\n  query: DeleteMutationInput,\n): IRDeleteMutation => {\n  return {\n    kind: 'delete',\n    shape: query.shape.id,\n    ids: query.ids.map((id) => ({id: id.id})),\n  };\n};\n\ntype DeleteAllMutationInput = {\n  shape: NodeShapeData;\n};\n\n/** Builds an IRDeleteAllMutation — delete all instances of a shape type. */\nexport const buildCanonicalDeleteAllMutationIR = (\n  query: DeleteAllMutationInput,\n): IRDeleteAllMutation => {\n  return {\n    kind: 'delete_all',\n    shape: query.shape.id,\n  };\n};\n\ntype DeleteWhereMutationInput = {\n  shape: NodeShapeData;\n  where: IRExpression;\n  wherePatterns: IRGraphPattern[];\n};\n\n/** Builds an IRDeleteWhereMutation — delete instances matching a condition. */\nexport const buildCanonicalDeleteWhereMutationIR = (\n  query: DeleteWhereMutationInput,\n): IRDeleteWhereMutation => {\n  return {\n    kind: 'delete_where',\n    shape: query.shape.id,\n    where: query.where,\n    wherePatterns: query.wherePatterns,\n  };\n};\n\ntype UpdateWhereMutationInput = {\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n  where?: IRExpression;\n  wherePatterns?: IRGraphPattern[];\n};\n\n/** Builds an IRUpdateWhereMutation — update instances matching a condition or all. */\nexport const buildCanonicalUpdateWhereMutationIR = (\n  query: UpdateWhereMutationInput,\n): IRUpdateWhereMutation => {\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'update_where',\n    shape: query.shape.id,\n    data,\n    where: query.where,\n    wherePatterns: query.wherePatterns,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n"]}
+{"version":3,"file":"IRMutation.js","sourceRoot":"","sources":["../../../src/queries/IRMutation.ts"],"names":[],"mappings":"AACA,OAAO,EAML,sBAAsB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAC,gBAAgB,EAAE,qBAAqB,EAAC,MAAM,kCAAkC,CAAC;AAiBzF,OAAO,EAAC,uBAAuB,EAAC,MAAM,cAAc,CAAC;AAmBrD;;;GAGG;AACH,MAAM,wBAAwB,GAAG,CAC/B,OAA6B,EAC7B,OAAe,EACT,EAAE;;IACR,KAAK,MAAM,KAAK,IAAI,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,mCAAI,EAAE,EAAE,CAAC;QAC1C,iFAAiF;QACjF,4CAA4C;QAC5C,IAAI,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CACb,+DAA+D,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,OAAO,KAAK;gBAC9F,6FAA6F;gBAC7F,4EAA4E;gBAC5E,mDAAmD,CACtD,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAOF,MAAM,eAAe,GAAG,CAAC,KAAyB,EAAsB,EAAE,CAAC,CAAC;IAC1E,EAAE,EAAE,KAAK,CAAC,EAAE;CACb,CAAC,CAAC;AAEH,MAAM,iBAAiB,GAAG,CAAC,KAA2B,EAA0B,EAAE;IAChF,OAAO;QACL,GAAG,EAAE,KAAK,CAAC,IAAI;YACb,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAkC,CAAC,CAAC;YAC5E,CAAC,CAAC,SAAS;QACb,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;KACvF,CAAC;AACJ,CAAC,CAAC;AAEF,wEAAwE;AACxE,MAAM,sBAAsB,GAAG,sBAAsB,CAAC;AAOtD;;;;GAIG;AACH,MAAM,UAAU,wBAAwB;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,uBAAuB,CAC5B,GAAG,EAAE,CAAC,UAAU,OAAO,EAAE,IAAI,EAC7B,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAsB,EAAE,CAAC,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAC,CAAC,CACnE,CAAC;AACJ,CAAC;AAED,MAAM,kBAAkB,GAAG,CACzB,KAAgC,EAChC,SAA8B,EAChB,EAAE;IAChB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAI,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,qBAAqB,CAC1B,KAAK,CAAC,EAAE,EACR,KAAK,CAAC,KAAK,EACX,sBAAsB;QACtB,wEAAwE;QACxE,qGAAqG;QACrG,yFAAyF;QACzF,SAAS;YACP,CAAC,CAAC,SAAS,CAAC,OAAO;YACnB,CAAC,CAAC,CAAC,UAAU,EAAE,gBAAgB,EAAE,EAAE;gBAC/B,uEAAuE;gBACvE,OAAO,sBAAsB,CAAC;YAChC,CAAC,CACN,CAAC;IACJ,CAAC;IAED,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,QAAQ;QACzB,OAAO,KAAK,KAAK,SAAS;QAC1B,KAAK,YAAY,IAAI,EACrB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,IAAI,IAAK,KAA4B,EAAE,CAAC;QAC1C,OAAO,eAAe,CAAC,KAA2B,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,UAAU,CAAC,KAA6B,CAAC,CAAC;AACnD,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CACnB,KAAsB,EACtB,SAA8B,EAChB,EAAE;IAChB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,IAAI,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AAC9C,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CACpB,KAA6C,EAC7C,SAA8B,EACf,EAAE;IACjB,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;QACvB,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC;KAC1C,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CACjB,WAAiC,EACjC,SAA8B,EAClB,EAAE;IACd,uBACE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,EAC3B,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAC/D,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAC,EAAE,EAAE,WAAW,CAAC,IAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EACnD;AACJ,CAAC,CAAC;AAEF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC;KACpC,CAAC;AACJ,CAAC,CAAC;AAEF,gFAAgF;AAChF,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,EAAE,EAAE,KAAK,CAAC,EAAE,EACZ,IAAI,IACD,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,wBAAwB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,EAAE,EAAE,KAAK,CAAC,EAAE,EACZ,IAAI,IACD,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC;AAEF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAC5C,KAA0B,EACR,EAAE;IACpB,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAC,CAAC,CAAC;KAC1C,CAAC;AACJ,CAAC,CAAC;AAMF,4EAA4E;AAC5E,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAC/C,KAA6B,EACR,EAAE;IACvB,OAAO;QACL,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;KACtB,CAAC;AACJ,CAAC,CAAC;AAQF,+EAA+E;AAC/E,MAAM,CAAC,MAAM,mCAAmC,GAAG,CACjD,KAA+B,EACR,EAAE;IACzB,OAAO;QACL,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE;QACrB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,aAAa,EAAE,KAAK,CAAC,aAAa;KACnC,CAAC;AACJ,CAAC,CAAC;AASF,sFAAsF;AACtF,MAAM,CAAC,MAAM,mCAAmC,GAAG,CACjD,KAA+B,EACR,EAAE;IACzB,MAAM,SAAS,GAAG,wBAAwB,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAClD,uBACE,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,EACrB,IAAI,EACJ,KAAK,EAAE,KAAK,CAAC,KAAK,EAClB,aAAa,EAAE,KAAK,CAAC,aAAa,IAC/B,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC/B,CAAC,CAAC,EAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,EAAC;QACzC,CAAC,CAAC,EAAE,CAAC,EACP;AACJ,CAAC,CAAC","sourcesContent":["import type {NodeShapeData} from '../shapes/SHACL.js';\nimport {\n  type NodeDescriptionValue,\n  NodeReferenceValue,\n  type PropUpdateValue,\n  type SetModificationValue,\n  type SinglePropertyUpdateValue,\n  isSetModificationValue,\n} from './QueryFactory.js';\nimport {isExpressionNode, resolveExpressionRefs} from '../expressions/ExpressionNode.js';\nimport type {\n  IRCreateMutation,\n  IRDeleteMutation,\n  IRDeleteAllMutation,\n  IRDeleteWhereMutation,\n  IRUpdateWhereMutation,\n  IRFieldValue,\n  IRNodeData,\n  IRFieldUpdate,\n  IRSetModificationValue,\n  IRUpdateMutation,\n  IRUpsertMutation,\n  IRExpression,\n  IRGraphPattern,\n  IRTraversalPattern,\n} from './IntermediateRepresentation.js';\nimport {createTraversalResolver} from './IRLower.js';\n\ntype CreateMutationInput = {\n  shape: NodeShapeData;\n  description: NodeDescriptionValue;\n};\n\ntype UpdateMutationInput = {\n  id: string;\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n};\n\ntype UpsertMutationInput = {\n  id: string;\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n};\n\n/**\n * Throws if any field of an upsert carries an expression. Named per offending property so\n * the caller is not left decoding an unbound-variable mystery further down the pipeline.\n */\nconst assertNoExpressionFields = (\n  updates: NodeDescriptionValue,\n  shapeId: string,\n): void => {\n  for (const field of updates?.fields ?? []) {\n    // Mirrors how `toSingleFieldValue` recognises an expression, so the guard cannot\n    // drift from the lowering it is protecting.\n    if (isExpressionNode(field.val)) {\n      throw new Error(\n        `upsert does not support expression-valued fields (property \"${field.prop.id}\" of ${shapeId}). ` +\n          `An expression reads the node's current value, which does not exist when upsert creates it, ` +\n          `and the property would be silently skipped. Pass a concrete value, or use ` +\n          `update().for({id}) if the node is known to exist.`,\n      );\n    }\n  }\n};\n\ntype DeleteMutationInput = {\n  shape: NodeShapeData;\n  ids: NodeReferenceValue[];\n};\n\nconst toNodeReference = (value: NodeReferenceValue): NodeReferenceValue => ({\n  id: value.id,\n});\n\nconst toSetModification = (value: SetModificationValue): IRSetModificationValue => {\n  return {\n    add: value.$add\n      ? value.$add.map((item) => toFieldValue(item as unknown as PropUpdateValue))\n      : undefined,\n    remove: value.$remove ? value.$remove.map((item) => toNodeReference(item)) : undefined,\n  };\n};\n\n/** Alias used as the mutation subject for expression ref resolution. */\nconst MUTATION_SUBJECT_ALIAS = '__mutation_subject__';\n\nexport type TraversalCollector = {\n  resolve: (fromAlias: string, propertyShapeId: string) => string;\n  patterns: IRTraversalPattern[];\n};\n\n/**\n * Create a traversal collector for mutation expressions. Uses `__trav_N__` alias\n * prefixes to avoid collision with query aliases (a0, a1...) and the mutation\n * subject placeholder. Delegates to the shared createTraversalResolver factory.\n */\nexport function createTraversalCollector(): TraversalCollector {\n  let counter = 0;\n  return createTraversalResolver(\n    () => `__trav_${counter++}__`,\n    (from, to, property): IRTraversalPattern => ({from, property, to}),\n  );\n}\n\nconst toSingleFieldValue = (\n  value: SinglePropertyUpdateValue,\n  collector?: TraversalCollector,\n): IRFieldValue => {\n  if (value === undefined) {\n    return undefined;\n  }\n\n  // ExpressionNode → resolve refs and extract IRExpression\n  if (isExpressionNode(value)) {\n    return resolveExpressionRefs(\n      value.ir,\n      value._refs,\n      MUTATION_SUBJECT_ALIAS,\n      // In mutation context, all property segments are on the subject entity.\n      // For single-segment refs (e.g. p.age), the property_expr already has the property as its .property.\n      // For multi-segment refs (e.g. p.bestFriend.name), this creates intermediate traversals.\n      collector\n        ? collector.resolve\n        : (_fromAlias, _propertyShapeId) => {\n            // No collector provided — multi-segment traversals cannot be resolved.\n            return MUTATION_SUBJECT_ALIAS;\n          },\n    );\n  }\n\n  if (\n    typeof value === 'string' ||\n    typeof value === 'number' ||\n    typeof value === 'boolean' ||\n    value instanceof Date\n  ) {\n    return value;\n  }\n\n  if ('id' in (value as NodeReferenceValue)) {\n    return toNodeReference(value as NodeReferenceValue);\n  }\n\n  return toNodeData(value as NodeDescriptionValue);\n};\n\nconst toFieldValue = (\n  value: PropUpdateValue,\n  collector?: TraversalCollector,\n): IRFieldValue => {\n  if (Array.isArray(value)) {\n    return value.map((item) => toSingleFieldValue(item, collector));\n  }\n\n  if (isSetModificationValue(value)) {\n    return toSetModification(value);\n  }\n\n  return toSingleFieldValue(value, collector);\n};\n\nconst toFieldUpdate = (\n  field: NodeDescriptionValue['fields'][number],\n  collector?: TraversalCollector,\n): IRFieldUpdate => {\n  return {\n    property: field.prop.id,\n    value: toFieldValue(field.val, collector),\n  };\n};\n\nconst toNodeData = (\n  description: NodeDescriptionValue,\n  collector?: TraversalCollector,\n): IRNodeData => {\n  return {\n    shape: description.shape.id,\n    fields: description.fields.map((f) => toFieldUpdate(f, collector)),\n    ...(description.__id ? {id: description.__id} : {}),\n  };\n};\n\n/** Builds an IRCreateMutation from a create factory's internal description. */\nexport const buildCanonicalCreateMutationIR = (\n  query: CreateMutationInput,\n): IRCreateMutation => {\n  return {\n    kind: 'create',\n    shape: query.shape.id,\n    data: toNodeData(query.description),\n  };\n};\n\n/** Builds an IRUpdateMutation from an update factory's internal description. */\nexport const buildCanonicalUpdateMutationIR = (\n  query: UpdateMutationInput,\n): IRUpdateMutation => {\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'update',\n    shape: query.shape.id,\n    id: query.id,\n    data,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n\n/**\n * Builds an IRUpsertMutation — an update that also asserts the node's type, so it is\n * correct whether or not the node exists.\n *\n * Rejects expression-valued fields. An expression such as `age: p.age.plus(1)` lowers to\n * a BIND over the node's current value; when the node does not exist that ref is unbound,\n * and SPARQL drops any INSERT triple containing an unbound variable. The write would\n * report success and store nothing for that property — precisely the silent-wrong-write\n * this primitive exists to remove, so it is refused rather than documented.\n */\nexport const buildCanonicalUpsertMutationIR = (\n  query: UpsertMutationInput,\n): IRUpsertMutation => {\n  assertNoExpressionFields(query.updates, query.shape.id);\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'upsert',\n    shape: query.shape.id,\n    id: query.id,\n    data,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n\n/** Builds an IRDeleteMutation from a delete factory's internal description. */\nexport const buildCanonicalDeleteMutationIR = (\n  query: DeleteMutationInput,\n): IRDeleteMutation => {\n  return {\n    kind: 'delete',\n    shape: query.shape.id,\n    ids: query.ids.map((id) => ({id: id.id})),\n  };\n};\n\ntype DeleteAllMutationInput = {\n  shape: NodeShapeData;\n};\n\n/** Builds an IRDeleteAllMutation — delete all instances of a shape type. */\nexport const buildCanonicalDeleteAllMutationIR = (\n  query: DeleteAllMutationInput,\n): IRDeleteAllMutation => {\n  return {\n    kind: 'delete_all',\n    shape: query.shape.id,\n  };\n};\n\ntype DeleteWhereMutationInput = {\n  shape: NodeShapeData;\n  where: IRExpression;\n  wherePatterns: IRGraphPattern[];\n};\n\n/** Builds an IRDeleteWhereMutation — delete instances matching a condition. */\nexport const buildCanonicalDeleteWhereMutationIR = (\n  query: DeleteWhereMutationInput,\n): IRDeleteWhereMutation => {\n  return {\n    kind: 'delete_where',\n    shape: query.shape.id,\n    where: query.where,\n    wherePatterns: query.wherePatterns,\n  };\n};\n\ntype UpdateWhereMutationInput = {\n  shape: NodeShapeData;\n  updates: NodeDescriptionValue;\n  where?: IRExpression;\n  wherePatterns?: IRGraphPattern[];\n};\n\n/** Builds an IRUpdateWhereMutation — update instances matching a condition or all. */\nexport const buildCanonicalUpdateWhereMutationIR = (\n  query: UpdateWhereMutationInput,\n): IRUpdateWhereMutation => {\n  const collector = createTraversalCollector();\n  const data = toNodeData(query.updates, collector);\n  return {\n    kind: 'update_where',\n    shape: query.shape.id,\n    data,\n    where: query.where,\n    wherePatterns: query.wherePatterns,\n    ...(collector.patterns.length > 0\n      ? {traversalPatterns: collector.patterns}\n      : {}),\n  };\n};\n"]}

package/lib/esm/queries/IntermediateRepresentation.d.ts

@@ -280,11 +280,6 @@ export type IRNodeData = {
     shape: string;
     fields: IRFieldUpdate[];
     id?: string;
-    /**
-     * A nested node written as a fresh blank node with only its field triples: no IRI, no
-     * `rdf:type` (see `NodeDescriptionValue.__blank`). Never set together with `id`.
-     */
-    blank?: true;
 };
 export type IRFieldUpdate = {
     property: string;