@metreeca/keep-sparql 0.10.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,106 @@
+# @metreeca/keep-sparql
+
+[![npm](https://img.shields.io/npm/v/@metreeca/keep-sparql)](https://www.npmjs.com/package/@metreeca/keep-sparql)
+
+SPARQL 1.1 repository connector for the [@metreeca/keep](https://github.com/metreeca/keep) model-driven linked data
+storage framework.
+
+Translates @metreeca/keep storage operations into SPARQL queries and updates against a pluggable graph backend.
+Application developers can pick one of the [ready-made connectors](https://github.com/metreeca/wire#installation) or
+implement the [@metreeca/wire-sparql](https://github.com/metreeca/wire/tree/main/packages/wire-sparql) `Repository`
+interface to support a new SPARQL backend.
+
+> [!IMPORTANT]
+> **Transaction Isolation** — Determined by the supplied `Repository`. The framework defers transaction semantics
+> to the backend; each connector documents the level it provides on its factory function.
+
+# Installation
+
+Install the framework together with a backend connector from the
+[@metreeca/wire](https://github.com/metreeca/wire) SPARQL connector collection:
+
+```shell
+npm install @metreeca/keep-sparql
+npm install @metreeca/wire-sparql-oxigraph    # or another backend connector
+```
+
+# Usage
+
+> [!NOTE]
+>
+> This section introduces essential concepts; for complete coverage, see the
+> [API reference](https://metreeca.github.io/keep/modules/_metreeca_keep-sparql.html).
+
+## Wiring a Store
+
+Pass any [@metreeca/wire-sparql](https://github.com/metreeca/wire/tree/main/packages/wire-sparql) `Repository` connector
+to
+`createSPARQLStore` to obtain a fully functional `Store`:
+
+```typescript
+import { createSPARQLStore } from "@metreeca/keep-sparql";
+import { createOxiRepository } from "@metreeca/wire-sparql-oxigraph";
+
+const store = createSPARQLStore(createOxiRepository());
+
+const product = await store.lookup({
+	entry: "http://example.com/products/1",
+	shape: ProductShape,
+	model: {
+		name: "",
+		price: 0
+	}
+});
+```
+
+## Implementing a Connector
+
+A backend connector is a [@metreeca/wire-sparql](https://github.com/metreeca/wire/tree/main/packages/wire-sparql)
+`Repository`: implement `ask`, `select`, `construct`, `update`, `execute`, and optionally `close`, lifting backend node
+values into the shared `Term` representation with the `reference`, `tagged`, and `typed` constructors.
+`@metreeca/keep-sparql` then wraps any such connector into a `Store` via `createSPARQLStore`.
+
+See [@metreeca/wire-sparql-oxigraph](https://github.com/metreeca/wire/tree/main/packages/wire-sparql-oxigraph) for a
+complete reference connector.
+
+# Verified Backends
+
+This SPARQL connector has been exercised against the
+[@metreeca/keep-suite](https://github.com/metreeca/keep/tree/main/packages/keep-suite) conformance suite on the backends
+and versions below.
+
+| Engine                       | Version                                                  | Storage       |
+|------------------------------|----------------------------------------------------------|---------------|
+| [Eclipse RDF4J][rdf4j]       | 5.3.1                                                    | MemoryStore   |
+| [Eclipse RDF4J][rdf4j]       | 5.3.1                                                    | NativeStore   |
+| [Eclipse RDF4J][rdf4j]       | 5.3.1                                                    | LmdbStore     |
+| [Apache Jena Fuseki][fuseki] | 6.1.0                                                    | MemoryDataset |
+| [Apache Jena Fuseki][fuseki] | 6.1.0                                                    | TDB1          |
+| [Apache Jena Fuseki][fuseki] | 6.1.0                                                    | TDB2          |
+| [Oxigraph][oxigraph]         | 0.5.8                                                    | in-memory     |
+| [Oxigraph][oxigraph]         | 0.5.8                                                    | disk          |
+| [QLever][qlever]             | [*upcoming*](https://github.com/metreeca/keep/issues/8)  | disk          |
+| [Fluree][fluree]             | [*upcoming*](https://github.com/metreeca/keep/issues/13) | disk          |
+| [Virtuoso][virtuoso]         | [*upcoming*](https://github.com/metreeca/keep/issues/9)  | disk          |
+
+[rdf4j]: https://rdf4j.org/
+
+[fuseki]: https://jena.apache.org/
+
+[oxigraph]: https://oxigraph.org/
+
+[qlever]: https://qlever.dev/
+
+[virtuoso]: https://virtuoso.openlinksw.com/
+
+[fluree]: https://flur.ee/
+
+# Support
+
+- open an [issue](https://github.com/metreeca/keep/issues) to report a problem or to suggest a new feature
+- start a [discussion](https://github.com/metreeca/keep/discussions) to ask a how-to question or to share an idea
+
+# License
+
+This project is licensed under the Apache 2.0 License –
+see [LICENSE](https://github.com/metreeca/keep?tab=Apache-2.0-1-ov-file) file for details.

package/dist/_/_decode.d.ts

@@ -0,0 +1,20 @@
+import type { Value } from "@metreeca/qest/resource";
+import type { Term } from "@metreeca/trio";
+import type { Tuple, Variable } from "@metreeca/wire-sparql";
+export declare function column(variable: Variable, tuples: readonly Tuple[]): readonly Term[];
+/**
+ * Coerces a scalar solution {@link Term} back to the QEST {@link Value} it stands for, the read-side dual of the
+ * encoder's write-value typing (§3.3). An IRI keeps its reference identity; a literal collapses to its transport
+ * type: an `xsd:boolean` to a boolean, a numeric datatype to a number, and every other datatype (including the
+ * `xsd:string` a plain literal carries) to its lexical string, so the many-to-one egress mapping discards the
+ * processing-type distinctions not carried on the wire.
+ *
+ * @param value The solution term to coerce, an IRI reference or a plain/typed literal
+ *
+ * @returns The decoded value: a reference, boolean, number, or string
+ *
+ * @throws {RangeError} If `value` is a blank node or a language-tagged literal, neither of which surfaces as a
+ * scalar value (a localised property is decoded through the broker, not here)
+ */
+export declare function termToValue(value: Term): Value;
+//# sourceMappingURL=_decode.d.ts.map

package/dist/_/_decode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_decode.d.ts","sourceRoot":"","sources":["../../src/_/_decode.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAE7D,wBAAgB,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,KAAK,EAAE,GAAG,SAAS,IAAI,EAAE,CAEpF;AAKD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,GAAG,KAAK,CA0B9C"}

package/dist/_/_decode.js

@@ -0,0 +1,55 @@
+/*
+ * Copyright © 2025-2026 Metreeca srl
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { isNumeric, xsd } from "@metreeca/core/datatype";
+export function column(variable, tuples) {
+    return tuples.flatMap(tuple => tuple[variable] ?? []);
+}
+////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+/**
+ * Coerces a scalar solution {@link Term} back to the QEST {@link Value} it stands for, the read-side dual of the
+ * encoder's write-value typing (§3.3). An IRI keeps its reference identity; a literal collapses to its transport
+ * type: an `xsd:boolean` to a boolean, a numeric datatype to a number, and every other datatype (including the
+ * `xsd:string` a plain literal carries) to its lexical string, so the many-to-one egress mapping discards the
+ * processing-type distinctions not carried on the wire.
+ *
+ * @param value The solution term to coerce, an IRI reference or a plain/typed literal
+ *
+ * @returns The decoded value: a reference, boolean, number, or string
+ *
+ * @throws {RangeError} If `value` is a blank node or a language-tagged literal, neither of which surfaces as a
+ * scalar value (a localised property is decoded through the broker, not here)
+ */
+export function termToValue(value) {
+    if (value.kind === "blank") {
+        throw new RangeError(`unsupported blank node <_:${value.label}>`);
+    }
+    else if (value.kind === "named") {
+        return value.iri;
+    }
+    else if (value.kind === "tagged") {
+        throw new RangeError(`unsupported language-tagged literal <${value.text}@${value.language}>`);
+    }
+    else if (value.datatype === xsd.boolean) {
+        return value.text === "true";
+    }
+    else if (isNumeric(value.datatype)) {
+        return Number(value.text);
+    }
+    else {
+        return value.text;
+    }
+}
+//# sourceMappingURL=_decode.js.map

package/dist/_/_decode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_decode.js","sourceRoot":"","sources":["../../src/_/_decode.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,yBAAyB,CAAC;AAKzD,MAAM,UAAU,MAAM,CAAC,QAAkB,EAAE,MAAwB;IAClE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AACvD,CAAC;AAGD,wHAAwH;AAExH;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CAAC,KAAW;IACtC,IAAK,KAAK,CAAC,IAAI,KAAK,OAAO,EAAG,CAAC;QAE9B,MAAM,IAAI,UAAU,CAAC,6BAA6B,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAEnE,CAAC;SAAM,IAAK,KAAK,CAAC,IAAI,KAAK,OAAO,EAAG,CAAC;QAErC,OAAO,KAAK,CAAC,GAAG,CAAC;IAElB,CAAC;SAAM,IAAK,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAG,CAAC;QAEtC,MAAM,IAAI,UAAU,CAAC,wCAAwC,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;IAE/F,CAAC;SAAM,IAAK,KAAK,CAAC,QAAQ,KAAK,GAAG,CAAC,OAAO,EAAG,CAAC;QAE7C,OAAO,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;IAE9B,CAAC;SAAM,IAAK,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAG,CAAC;QAExC,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE3B,CAAC;SAAM,CAAC;QAEP,OAAO,KAAK,CAAC,IAAI,CAAC;IAEnB,CAAC;AACF,CAAC"}

package/dist/_/_encode.d.ts

@@ -0,0 +1,112 @@
+import { type Property } from "@metreeca/blue/resource";
+import type { RangeShape, ValuesShape } from "@metreeca/blue/value";
+import { type Literal, type Value, type Values } from "@metreeca/qest/resource";
+import { Options, type Transform } from "@metreeca/qest/template";
+import { type Blank, type Named, type Term } from "@metreeca/trio";
+import type { SPARQL, Variable } from "@metreeca/wire-sparql";
+/**
+ * The RDF {@link Term} of a comparison bound (`<` / `>` / `<=` / `>=`), typed against the {@link RangeShape |
+ * shape} variant it resolves to so the comparison resolves in the target's processing type (§5.7.1).
+ * {@link getBoundVariant} routes the bound, relaxing the value-domain facets a bound need not satisfy. A
+ * string variant carrying the `sh:IRI` datatype (an id / type entry, or a reference-ranged property) renders
+ * an IRI node rather than a literal, told apart from an IRI-shaped literal (a `url`) by datatype alone.
+ */
+export declare function boundToTerm(value: Literal, shape: RangeShape): Term;
+/**
+ * Flattens the options of a set-matching or focus constraint to individual match {@link Term | terms}: a
+ * localised dictionary set expands to one language-tagged term per language tag (its value, or every element of
+ * its value array), a scalar option maps to its term typed by the {@link RangeShape | shape} variant it
+ * fits, and an option array maps element-wise. A `null` scalar survives as the absent-value option
+ * (§5.7.3).
+ */
+export declare function optionsToTerms(value: Options, shape: RangeShape): readonly (null | Term)[];
+/**
+ * Types an operand against its resolved {@link ValuesShape | shape} (§5.7.1). A string shape carrying the
+ * `sh:IRI` datatype (an id / type entry, or a reference-ranged property) renders an IRI node rather than a
+ * literal, told apart from an IRI-shaped literal (a `url`) by datatype alone.
+ */
+export declare function valueToTerm(value: Value, shape: ValuesShape): Term;
+/**
+ * Types a property's write value(s) to the RDF {@link Term | terms} to store, flattening a single value or
+ * a value set against the resolved {@link ValuesShape | shape} variant (§5.7.1).
+ *
+ * Each element is typed by the variant it fits: a boolean, number, or string operand to its datatype-typed
+ * literal (a string shape carrying the `sh:IRI` datatype renders an IRI node instead, as in
+ * {@link valueToTerm}); a localised dictionary to one plain or language-tagged term per tag (§6); a reference to
+ * its IRI as-is; and a nested resource to its declared id when present (a captive resource with its own
+ * identity), else a freshly skolemised IRI addressing the embedded sub-resource. Values not fitting the
+ * variant are dropped.
+ */
+export declare function valuesToTerms(values: Values, shape: ValuesShape): readonly Term[];
+/**
+ * The stored edge connecting `source` to `target` through a {@link Property | property}'s declared
+ * predicate. Renders the forward direction when the property declares one and `source` may stand in
+ * subject position, else the reverse direction when `target` may; both directions carry the value, so
+ * either connects the pair. Yields the empty fragment when neither applies.
+ */
+export declare function link([source, property, target]: readonly [Variable | Term, Property, Variable | Term]): SPARQL;
+/**
+ * Generates the SPARQL triple pattern rendering a {@link Property | property}'s forward direction.
+ *
+ * Emits `subject forward object` when the property declares a `forward` predicate; an undeclared
+ * forward direction contributes no pattern, yielding the empty fragment. The reverse-direction
+ * counterpart is {@link reverse}.
+ *
+ * @param edge The edge to render, as a `[subject, property, object]` tuple
+ *
+ * @returns The generated triple pattern, or the empty fragment when the property declares no forward
+ * predicate
+ *
+ * @see {@link https://www.w3.org/TR/sparql11-query/#QSynTriples SPARQL 1.1 Triple Patterns}
+ */
+export declare function forward([subject, property, object]: readonly [Variable | Blank | Named, Property, Variable | Term]): SPARQL;
+/**
+ * Generates the SPARQL triple pattern rendering a {@link Property | property}'s reverse direction.
+ *
+ * Emits `subject reverse object`, flipping object and subject, when the property declares a `reverse`
+ * predicate; an undeclared reverse direction contributes no pattern, yielding the empty fragment. The
+ * subject lands in the triple's object position, so it is constrained to an IRI {@link Reference}. The
+ * forward-direction counterpart is {@link forward}.
+ *
+ * @param edge The edge to render, as a `[object, property, subject]` tuple
+ *
+ * @returns The generated triple pattern, or the empty fragment when the property declares no reverse
+ * predicate
+ *
+ * @see {@link https://www.w3.org/TR/sparql11-query/#QSynTriples SPARQL 1.1 Triple Patterns}
+ */
+export declare function reverse([object, property, subject]: readonly [Variable | Term, Property, Variable | Blank | Named]): SPARQL;
+/**
+ * The gate binding a union shape's discriminator only for members belonging to it (union.md §Model).
+ *
+ * A classed node shape is gated by its stored `rdf:type` triple; a plain-string literal by a
+ * datatype/kind `filter` (boolean datatype, numeric test, or plain string); a localised `dictionary` shape by
+ * the language-tagged literal test, disjoint from the plain string; a classless node shape by the bare
+ * IRI-kind test. Under the modeller's disjointness guarantee (union.md §State) at most one shape's arm
+ * binds a given value.
+ *
+ * @param anchor The shape's value variable
+ * @param shape The shape to gate on
+ *
+ * @returns The gating triple pattern or `filter`
+ */
+export declare function membership(anchor: Variable, shape: ValuesShape): SPARQL;
+/**
+ * The SPARQL expression applying a transform `pipe` to a value variable.
+ *
+ * Composes the pipe right-to-left (`reduceRight`), so the pipe's trailing transform applies to `anchor`
+ * first and each earlier transform wraps the running expression, leaving the leading transform
+ * outermost; an empty pipe yields the bare variable. Each {@link Transform} maps to its SPARQL aggregate
+ * (`count`/`sum`/`min`/`max`/`avg`, with the empty-set patch keeping `avg` over no rows unbound rather
+ * than erroring, Appendix A.4.3) or scalar function (string, numeric, and date-part).
+ *
+ * @param anchor The value variable the pipe transforms
+ * @param pipe The transforms to compose, leading (outermost) first
+ *
+ * @returns The SPARQL expression applying `pipe` to `anchor`, or the bare `anchor` variable when `pipe`
+ * is empty
+ *
+ * @see {@link https://www.w3.org/TR/sparql11-query/#aggregates SPARQL 1.1 Aggregates}
+ */
+export declare function expression(anchor: Variable, pipe: readonly Transform[]): SPARQL;
+//# sourceMappingURL=_encode.d.ts.map

package/dist/_/_encode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_encode.d.ts","sourceRoot":"","sources":["../../src/_/_encode.ts"],"names":[],"mappings":"AAiBA,OAAO,EAA6B,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAEnF,OAAO,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAIpE,OAAO,EAAe,KAAK,OAAO,EAAkB,KAAK,KAAK,EAAE,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAC7G,OAAO,EAAE,OAAO,EAAE,KAAK,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,KAAK,KAAK,EAAS,KAAK,KAAK,EAAe,KAAK,IAAI,EAAS,MAAM,gBAAgB,CAAC;AAC9F,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAyC9D;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAQnE;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,GAAG,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,CAsB1F;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CA8BlE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,SAAS,IAAI,EAAE,CAsDjF;AAKD;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,QAAQ,GAAG,IAAI,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,MAAM,CAU9G;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,OAAO,CACtB,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,QAAQ,GAAG,KAAK,GAAG,KAAK,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC,GACzF,MAAM,CAER;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,OAAO,CACtB,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC,QAAQ,GAAG,IAAI,EAAE,QAAQ,EAAE,QAAQ,GAAG,KAAK,GAAG,KAAK,CAAC,GACzF,MAAM,CAER;AAGD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,GAAG,MAAM,CA2CvE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,SAAS,EAAE,GAAG,MAAM,CAwF/E"}