shacl-wasm-node 0.1.7

package/LICENSE-APACHE

@@ -0,0 +1,202 @@
+
+                                 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 2026 Peter Winstanley
+
+   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/LICENSE-MIT

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 pwin (Peter Winstanley)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,137 @@
+# shacl-wasm
+
+WebAssembly bindings for the `shacl` validation engine, for JavaScript hosts:
+Node, VS Code extensions, bundlers, and browsers.
+
+Dual-licensed under [MIT](LICENSE-MIT) or [Apache-2.0](LICENSE-APACHE), at your
+option. Copyright 2026 Peter Winstanley.
+
+## Why
+
+The JavaScript SHACL landscape thins out sharply once shapes use SHACL-SPARQL
+(`sh:sparql` constraints, `sh:target [ a sh:SPARQLTarget ]`). `rdf-validate-shacl`
+implements SHACL Core only and reports `conforms: true` against such shapes
+rather than failing loudly. `shacl-engine` does implement them, but has two
+behaviours that matter in practice:
+
+- some `sh:sparql` shapes make it throw
+  `Tried to bind variable ?this in a GROUP BY operator`, taking out every check
+  in that shapes file; and
+- it silently drops an `sh:severity` declared *inside* an `sh:sparql` block,
+  reporting every such result as `sh:Violation` whatever the shape says.
+
+This build has neither. `crates/shacl-wasm/verify.js` checks both against real
+shapes, including the ones that defeat `shacl-engine`.
+
+## Install / build
+
+There is no published npm package yet; build it from this repo:
+
+```sh
+cd crates/shacl-wasm
+node build.mjs            # both targets
+node build.mjs nodejs     # just pkg-node/
+```
+
+Outputs:
+
+| Directory     | `--target`  | For                                              |
+|---------------|-------------|--------------------------------------------------|
+| `pkg-node`    | `nodejs`    | `require()` consumers: Node, VS Code extension host |
+| `pkg-bundler` | `bundler`   | webpack / vite / rollup (ESM + separate `.wasm`) |
+
+Prerequisites: the `wasm32-unknown-unknown` target
+(`rustup target add wasm32-unknown-unknown`) and
+[`wasm-pack`](https://drager.github.io/wasm-pack/) (`cargo install wasm-pack`).
+
+`build.mjs` wraps `wasm-pack` to add what it cannot express itself: the two
+licence files (wasm-pack copies them into the output, but the `package.json` it
+generates has an explicit `files` array and npm's "always include a licence"
+rule does not match the suffixed `LICENSE-MIT`/`LICENSE-APACHE` names — verified
+with `npm pack --dry-run`), and the `repository` field.
+
+## Use
+
+```js
+const { Validator } = require('./pkg-node/shacl_wasm.js');
+
+// Compiling shapes is the expensive half, so compile once and reuse.
+const validator = Validator.fromTurtle(shapesTurtle, 'http://example.org/');
+
+const report = validator.validateTurtle(dataTurtle, 'http://example.org/');
+
+report.conforms;   // false when anything has a conformance-blocking severity
+report.length;     // number of results
+report.results;    // array of plain objects, see below
+report.toTurtle(); // the full SHACL report as a Turtle graph
+```
+
+Each entry of `report.results`:
+
+```js
+{
+  focusNode: 'http://example.org/bob',
+  path: 'http://example.org/name',        // null for node-level findings
+  value: null,                            // null for sh:minCount / sh:closed
+  severity: 'http://www.w3.org/ns/shacl#Warning',
+  sourceShape: 'http://example.org/PersonShape',
+  component: 'http://www.w3.org/ns/shacl#MinCountConstraintComponent',
+  message: 'Less than 1 values',
+}
+```
+
+Terms render the way RDF/JS's `.value` does — an IRI bare, a blank node as
+`_:label`, a literal as its lexical form — so this drops into code already
+written against an RDF/JS SHACL engine.
+
+Other entry points:
+
+```js
+Validator.fromText(text, format, base)                    // turtle|ntriples|nquads|trig|rdfxml|jsonld
+validator.validateText(text, format, base, inference)     // inference: "none" (default) | "rdfs"
+validator.shapeCount                                      // shapes compiled
+
+const { validateTurtle } = require('./pkg-node/shacl_wasm.js');
+validateTurtle(shapesTurtle, dataTurtle, base);           // one-shot, no reuse
+```
+
+`inference: "rdfs"` validates against the RDFS closure of the data, so a finding
+can depend on an entailed `rdf:type` rather than only an asserted one.
+
+## Notes on the wasm32 build
+
+Three things differ from a native build, each handled in this crate rather than
+asked of the caller:
+
+- **No threads.** The engine's Turtle parse splits across cores with rayon,
+  which cannot build for `wasm32-unknown-unknown`. This crate depends on
+  `shacl` with `default-features = false`, dropping the `parallel` feature; the
+  loader then takes the sequential whole-document path it already falls back to
+  whenever a document cannot be chunked safely. The two produce an identical
+  graph — `parallel_matches_sequential` in the engine pins that.
+- **No system clock.** SPARQL's `NOW()` reaches `oxsdatatypes`, whose default
+  clock is `std::time::SystemTime` — unimplemented on this target, so evaluating
+  any `sh:sparql` constraint panicked with `time not implemented on this
+  platform`. `oxsdatatypes` provides for this with a `js` feature that switches
+  to `js_sys::Date::now()`; this crate enables it for wasm32 only.
+- **No system entropy.** `oxrdf` mints blank node identifiers via `rand`, which
+  reaches `getrandom`. getrandom 0.3 has no default source on
+  `wasm32-unknown-unknown` and needs both its `wasm_js` feature (set here) and
+  the `getrandom_backend="wasm_js"` cfg (set for this target in the workspace
+  `.cargo/config.toml`) — its own `compile_error!` is explicit that the feature
+  alone is not enough.
+
+Native builds — the CLI, the Python extension module, the test suite — are
+unaffected by all three: `parallel` is still a default feature, and the other
+two are `cfg(target_arch = "wasm32")`-gated.
+
+## Verifying
+
+```sh
+node build.mjs nodejs && node verify.js
+```
+
+`verify.js` covers a basic `sh:minCount` violation, compiling all six shapes
+files from the Ontology Development Suite's check registry (including the two
+that crash `shacl-engine`), an `sh:severity` declared inside an `sh:sparql`
+block, and Turtle serialisation of the report.

package/package.json

@@ -0,0 +1,20 @@
+{
+  "name": "shacl-wasm-node",
+  "description": "WebAssembly bindings for the shacl validation engine (CommonJS, for Node and require())",
+  "version": "0.1.7",
+  "license": "MIT OR Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/pwin/SHACL_Engine.git"
+  },
+  "files": [
+    "shacl_wasm_bg.wasm",
+    "shacl_wasm.js",
+    "shacl_wasm.d.ts",
+    "LICENSE-APACHE",
+    "LICENSE-MIT"
+  ],
+  "main": "shacl_wasm.js",
+  "types": "shacl_wasm.d.ts",
+  "homepage": "https://github.com/pwin/SHACL_Engine"
+}

package/shacl_wasm.d.ts

@@ -0,0 +1,88 @@
+/* tslint:disable */
+/* eslint-disable */
+
+/**
+ * The outcome of one validation run.
+ */
+export class Report {
+    private constructor();
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * The full SHACL validation report as a Turtle graph -- what a SHACL
+     * processor is formally meant to return, for querying or diffing.
+     */
+    toTurtle(): string;
+    /**
+     * True when nothing in the report has a conformance-blocking severity
+     * (`sh:Violation`).
+     */
+    readonly conforms: boolean;
+    /**
+     * Number of results, blocking or not.
+     */
+    readonly length: number;
+    /**
+     * The results as an array of plain objects.
+     */
+    readonly results: any;
+}
+
+/**
+ * A compiled shapes graph, ready to validate data graphs against.
+ *
+ * `store` is the term store as it stood once the shapes were compiled, and is
+ * never mutated afterwards: each validation run clones it and grows its own
+ * copy. That is the pattern `TermStore`'s own documentation describes, and
+ * following it is what makes reuse actually pay.
+ *
+ * Parsing each data graph into one shared store instead — which this did at
+ * first — leaves every earlier run's terms behind, so the store grows without
+ * bound and the advertised path (compile once, validate many) is precisely the
+ * one that degrades. Measured on 100k instances / 400k triples: 23.7s sharing
+ * one store against 6.5s cloning per run, and the gap widens with every run.
+ */
+export class Validator {
+    private constructor();
+    free(): void;
+    [Symbol.dispose](): void;
+    /**
+     * Compiles a shapes graph in any format the engine can read: `turtle`,
+     * `ntriples`, `nquads`, `trig`, `rdfxml`, `jsonld`.
+     */
+    static fromText(text: string, format: string, base?: string | null): Validator;
+    /**
+     * Compiles a shapes graph given as Turtle.
+     */
+    static fromTurtle(text: string, base?: string | null): Validator;
+    /**
+     * Validates a data graph in any supported format.
+     *
+     * `inference` is `"none"` (default) or `"rdfs"`; the latter validates
+     * against the RDFS closure of the data, so a finding can depend on an
+     * entailed `rdf:type` rather than only an asserted one.
+     */
+    validateText(text: string, format: string, base?: string | null, inference?: string | null): Report;
+    /**
+     * Validates a data graph given as Turtle.
+     */
+    validateTurtle(text: string, base?: string | null, inference?: string | null): Report;
+    /**
+     * How many shapes were compiled. Zero usually means the shapes graph
+     * parsed but declared nothing the engine recognises as a shape.
+     */
+    readonly shapeCount: number;
+}
+
+/**
+ * Improves panic reporting from a bare `RuntimeError: unreachable` to the real
+ * Rust panic message and stack on `console.error`. Runs automatically on module
+ * load; the alternative is a genuinely undebuggable failure mode.
+ */
+export function start(): void;
+
+/**
+ * One-shot validation, for a caller with a single data graph that gains
+ * nothing from holding a compiled [`Validator`].
+ */
+export function validateTurtle(shapes: string, data: string, base?: string | null): Report;

package/shacl_wasm.js

@@ -0,0 +1,495 @@
+/* @ts-self-types="./shacl_wasm.d.ts" */
+
+/**
+ * The outcome of one validation run.
+ */
+class Report {
+    static __wrap(ptr) {
+        const obj = Object.create(Report.prototype);
+        obj.__wbg_ptr = ptr;
+        ReportFinalization.register(obj, obj.__wbg_ptr, obj);
+        return obj;
+    }
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+        ReportFinalization.unregister(this);
+        return ptr;
+    }
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_report_free(ptr, 0);
+    }
+    /**
+     * True when nothing in the report has a conformance-blocking severity
+     * (`sh:Violation`).
+     * @returns {boolean}
+     */
+    get conforms() {
+        const ret = wasm.report_conforms(this.__wbg_ptr);
+        return ret !== 0;
+    }
+    /**
+     * Number of results, blocking or not.
+     * @returns {number}
+     */
+    get length() {
+        const ret = wasm.report_length(this.__wbg_ptr);
+        return ret >>> 0;
+    }
+    /**
+     * The results as an array of plain objects.
+     * @returns {any}
+     */
+    get results() {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.report_results(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return takeObject(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * The full SHACL validation report as a Turtle graph -- what a SHACL
+     * processor is formally meant to return, for querying or diffing.
+     * @returns {string}
+     */
+    toTurtle() {
+        let deferred1_0;
+        let deferred1_1;
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            wasm.report_toTurtle(retptr, this.__wbg_ptr);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            deferred1_0 = r0;
+            deferred1_1 = r1;
+            return getStringFromWasm0(r0, r1);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+            wasm.__wbindgen_export3(deferred1_0, deferred1_1, 1);
+        }
+    }
+}
+if (Symbol.dispose) Report.prototype[Symbol.dispose] = Report.prototype.free;
+exports.Report = Report;
+
+/**
+ * A compiled shapes graph, ready to validate data graphs against.
+ *
+ * `store` is the term store as it stood once the shapes were compiled, and is
+ * never mutated afterwards: each validation run clones it and grows its own
+ * copy. That is the pattern `TermStore`'s own documentation describes, and
+ * following it is what makes reuse actually pay.
+ *
+ * Parsing each data graph into one shared store instead — which this did at
+ * first — leaves every earlier run's terms behind, so the store grows without
+ * bound and the advertised path (compile once, validate many) is precisely the
+ * one that degrades. Measured on 100k instances / 400k triples: 23.7s sharing
+ * one store against 6.5s cloning per run, and the gap widens with every run.
+ */
+class Validator {
+    static __wrap(ptr) {
+        const obj = Object.create(Validator.prototype);
+        obj.__wbg_ptr = ptr;
+        ValidatorFinalization.register(obj, obj.__wbg_ptr, obj);
+        return obj;
+    }
+    __destroy_into_raw() {
+        const ptr = this.__wbg_ptr;
+        this.__wbg_ptr = 0;
+        ValidatorFinalization.unregister(this);
+        return ptr;
+    }
+    free() {
+        const ptr = this.__destroy_into_raw();
+        wasm.__wbg_validator_free(ptr, 0);
+    }
+    /**
+     * Compiles a shapes graph in any format the engine can read: `turtle`,
+     * `ntriples`, `nquads`, `trig`, `rdfxml`, `jsonld`.
+     * @param {string} text
+     * @param {string} format
+     * @param {string | null} [base]
+     * @returns {Validator}
+     */
+    static fromText(text, format, base) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(text, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            const ptr1 = passStringToWasm0(format, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            var ptr2 = isLikeNone(base) ? 0 : passStringToWasm0(base, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len2 = WASM_VECTOR_LEN;
+            wasm.validator_fromText(retptr, ptr0, len0, ptr1, len1, ptr2, len2);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return Validator.__wrap(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Compiles a shapes graph given as Turtle.
+     * @param {string} text
+     * @param {string | null} [base]
+     * @returns {Validator}
+     */
+    static fromTurtle(text, base) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(text, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            var ptr1 = isLikeNone(base) ? 0 : passStringToWasm0(base, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len1 = WASM_VECTOR_LEN;
+            wasm.validator_fromTurtle(retptr, ptr0, len0, ptr1, len1);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return Validator.__wrap(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * How many shapes were compiled. Zero usually means the shapes graph
+     * parsed but declared nothing the engine recognises as a shape.
+     * @returns {number}
+     */
+    get shapeCount() {
+        const ret = wasm.validator_shapeCount(this.__wbg_ptr);
+        return ret >>> 0;
+    }
+    /**
+     * Validates a data graph in any supported format.
+     *
+     * `inference` is `"none"` (default) or `"rdfs"`; the latter validates
+     * against the RDFS closure of the data, so a finding can depend on an
+     * entailed `rdf:type` rather than only an asserted one.
+     * @param {string} text
+     * @param {string} format
+     * @param {string | null} [base]
+     * @param {string | null} [inference]
+     * @returns {Report}
+     */
+    validateText(text, format, base, inference) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(text, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            const ptr1 = passStringToWasm0(format, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            var ptr2 = isLikeNone(base) ? 0 : passStringToWasm0(base, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len2 = WASM_VECTOR_LEN;
+            var ptr3 = isLikeNone(inference) ? 0 : passStringToWasm0(inference, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len3 = WASM_VECTOR_LEN;
+            wasm.validator_validateText(retptr, this.__wbg_ptr, ptr0, len0, ptr1, len1, ptr2, len2, ptr3, len3);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return Report.__wrap(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+    /**
+     * Validates a data graph given as Turtle.
+     * @param {string} text
+     * @param {string | null} [base]
+     * @param {string | null} [inference]
+     * @returns {Report}
+     */
+    validateTurtle(text, base, inference) {
+        try {
+            const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+            const ptr0 = passStringToWasm0(text, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len0 = WASM_VECTOR_LEN;
+            var ptr1 = isLikeNone(base) ? 0 : passStringToWasm0(base, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len1 = WASM_VECTOR_LEN;
+            var ptr2 = isLikeNone(inference) ? 0 : passStringToWasm0(inference, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            var len2 = WASM_VECTOR_LEN;
+            wasm.validator_validateTurtle(retptr, this.__wbg_ptr, ptr0, len0, ptr1, len1, ptr2, len2);
+            var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+            var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+            var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+            if (r2) {
+                throw takeObject(r1);
+            }
+            return Report.__wrap(r0);
+        } finally {
+            wasm.__wbindgen_add_to_stack_pointer(16);
+        }
+    }
+}
+if (Symbol.dispose) Validator.prototype[Symbol.dispose] = Validator.prototype.free;
+exports.Validator = Validator;
+
+/**
+ * Improves panic reporting from a bare `RuntimeError: unreachable` to the real
+ * Rust panic message and stack on `console.error`. Runs automatically on module
+ * load; the alternative is a genuinely undebuggable failure mode.
+ */
+function start() {
+    wasm.start();
+}
+exports.start = start;
+
+/**
+ * One-shot validation, for a caller with a single data graph that gains
+ * nothing from holding a compiled [`Validator`].
+ * @param {string} shapes
+ * @param {string} data
+ * @param {string | null} [base]
+ * @returns {Report}
+ */
+function validateTurtle(shapes, data, base) {
+    try {
+        const retptr = wasm.__wbindgen_add_to_stack_pointer(-16);
+        const ptr0 = passStringToWasm0(shapes, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+        const len0 = WASM_VECTOR_LEN;
+        const ptr1 = passStringToWasm0(data, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+        const len1 = WASM_VECTOR_LEN;
+        var ptr2 = isLikeNone(base) ? 0 : passStringToWasm0(base, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+        var len2 = WASM_VECTOR_LEN;
+        wasm.validateTurtle(retptr, ptr0, len0, ptr1, len1, ptr2, len2);
+        var r0 = getDataViewMemory0().getInt32(retptr + 4 * 0, true);
+        var r1 = getDataViewMemory0().getInt32(retptr + 4 * 1, true);
+        var r2 = getDataViewMemory0().getInt32(retptr + 4 * 2, true);
+        if (r2) {
+            throw takeObject(r1);
+        }
+        return Report.__wrap(r0);
+    } finally {
+        wasm.__wbindgen_add_to_stack_pointer(16);
+    }
+}
+exports.validateTurtle = validateTurtle;
+function __wbg_get_imports() {
+    const import0 = {
+        __proto__: null,
+        __wbg_String_8564e559799eccda: function(arg0, arg1) {
+            const ret = String(getObject(arg1));
+            const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+            getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+        },
+        __wbg___wbindgen_throw_bb96b2010945f0bc: function(arg0, arg1) {
+            throw new Error(getStringFromWasm0(arg0, arg1));
+        },
+        __wbg_error_757e9472f8410341: function(arg0, arg1) {
+            let deferred0_0;
+            let deferred0_1;
+            try {
+                deferred0_0 = arg0;
+                deferred0_1 = arg1;
+                console.error(getStringFromWasm0(arg0, arg1));
+            } finally {
+                wasm.__wbindgen_export3(deferred0_0, deferred0_1, 1);
+            }
+        },
+        __wbg_getRandomValues_a608c4436c19407a: function() { return handleError(function (arg0, arg1) {
+            globalThis.crypto.getRandomValues(getArrayU8FromWasm0(arg0, arg1));
+        }, arguments); },
+        __wbg_new_116be93542d39019: function() {
+            const ret = new Array();
+            return addHeapObject(ret);
+        },
+        __wbg_new_227d7c05414eb861: function() {
+            const ret = new Error();
+            return addHeapObject(ret);
+        },
+        __wbg_new_ebe3e0f6837f0879: function() {
+            const ret = new Object();
+            return addHeapObject(ret);
+        },
+        __wbg_now_8b265300afd5f2b9: function() {
+            const ret = Date.now();
+            return ret;
+        },
+        __wbg_set_6be42768c690e380: function(arg0, arg1, arg2) {
+            getObject(arg0)[takeObject(arg1)] = takeObject(arg2);
+        },
+        __wbg_set_a80955eb93b145c6: function(arg0, arg1, arg2) {
+            getObject(arg0)[arg1 >>> 0] = takeObject(arg2);
+        },
+        __wbg_stack_3b0d974bbf31e44f: function(arg0, arg1) {
+            const ret = getObject(arg1).stack;
+            const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_export, wasm.__wbindgen_export2);
+            const len1 = WASM_VECTOR_LEN;
+            getDataViewMemory0().setInt32(arg0 + 4 * 1, len1, true);
+            getDataViewMemory0().setInt32(arg0 + 4 * 0, ptr1, true);
+        },
+        __wbindgen_cast_0000000000000001: function(arg0, arg1) {
+            // Cast intrinsic for `Ref(String) -> Externref`.
+            const ret = getStringFromWasm0(arg0, arg1);
+            return addHeapObject(ret);
+        },
+        __wbindgen_object_clone_ref: function(arg0) {
+            const ret = getObject(arg0);
+            return addHeapObject(ret);
+        },
+        __wbindgen_object_drop_ref: function(arg0) {
+            takeObject(arg0);
+        },
+    };
+    return {
+        __proto__: null,
+        "./shacl_wasm_bg.js": import0,
+    };
+}
+
+const ReportFinalization = (typeof FinalizationRegistry === 'undefined')
+    ? { register: () => {}, unregister: () => {} }
+    : new FinalizationRegistry(ptr => wasm.__wbg_report_free(ptr, 1));
+const ValidatorFinalization = (typeof FinalizationRegistry === 'undefined')
+    ? { register: () => {}, unregister: () => {} }
+    : new FinalizationRegistry(ptr => wasm.__wbg_validator_free(ptr, 1));
+
+function addHeapObject(obj) {
+    if (heap_next === heap.length) heap.push(heap.length + 1);
+    const idx = heap_next;
+    heap_next = heap[idx];
+
+    heap[idx] = obj;
+    return idx;
+}
+
+function dropObject(idx) {
+    if (idx < 1028) return;
+    heap[idx] = heap_next;
+    heap_next = idx;
+}
+
+function getArrayU8FromWasm0(ptr, len) {
+    ptr = ptr >>> 0;
+    return getUint8ArrayMemory0().subarray(ptr / 1, ptr / 1 + len);
+}
+
+let cachedDataViewMemory0 = null;
+function getDataViewMemory0() {
+    if (cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && cachedDataViewMemory0.buffer !== wasm.memory.buffer)) {
+        cachedDataViewMemory0 = new DataView(wasm.memory.buffer);
+    }
+    return cachedDataViewMemory0;
+}
+
+function getStringFromWasm0(ptr, len) {
+    return decodeText(ptr >>> 0, len);
+}
+
+let cachedUint8ArrayMemory0 = null;
+function getUint8ArrayMemory0() {
+    if (cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0) {
+        cachedUint8ArrayMemory0 = new Uint8Array(wasm.memory.buffer);
+    }
+    return cachedUint8ArrayMemory0;
+}
+
+function getObject(idx) { return heap[idx]; }
+
+function handleError(f, args) {
+    try {
+        return f.apply(this, args);
+    } catch (e) {
+        wasm.__wbindgen_export4(addHeapObject(e));
+    }
+}
+
+let heap = new Array(1024).fill(undefined);
+heap.push(undefined, null, true, false);
+
+let heap_next = heap.length;
+
+function isLikeNone(x) {
+    return x === undefined || x === null;
+}
+
+function passStringToWasm0(arg, malloc, realloc) {
+    if (realloc === undefined) {
+        const buf = cachedTextEncoder.encode(arg);
+        const ptr = malloc(buf.length, 1) >>> 0;
+        getUint8ArrayMemory0().subarray(ptr, ptr + buf.length).set(buf);
+        WASM_VECTOR_LEN = buf.length;
+        return ptr;
+    }
+
+    let len = arg.length;
+    let ptr = malloc(len, 1) >>> 0;
+
+    const mem = getUint8ArrayMemory0();
+
+    let offset = 0;
+
+    for (; offset < len; offset++) {
+        const code = arg.charCodeAt(offset);
+        if (code > 0x7F) break;
+        mem[ptr + offset] = code;
+    }
+    if (offset !== len) {
+        if (offset !== 0) {
+            arg = arg.slice(offset);
+        }
+        ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0;
+        const view = getUint8ArrayMemory0().subarray(ptr + offset, ptr + len);
+        const ret = cachedTextEncoder.encodeInto(arg, view);
+
+        offset += ret.written;
+        ptr = realloc(ptr, len, offset, 1) >>> 0;
+    }
+
+    WASM_VECTOR_LEN = offset;
+    return ptr;
+}
+
+function takeObject(idx) {
+    const ret = getObject(idx);
+    dropObject(idx);
+    return ret;
+}
+
+let cachedTextDecoder = new TextDecoder('utf-8', { ignoreBOM: true, fatal: true });
+cachedTextDecoder.decode();
+function decodeText(ptr, len) {
+    return cachedTextDecoder.decode(getUint8ArrayMemory0().subarray(ptr, ptr + len));
+}
+
+const cachedTextEncoder = new TextEncoder();
+
+if (!('encodeInto' in cachedTextEncoder)) {
+    cachedTextEncoder.encodeInto = function (arg, view) {
+        const buf = cachedTextEncoder.encode(arg);
+        view.set(buf);
+        return {
+            read: arg.length,
+            written: buf.length
+        };
+    };
+}
+
+let WASM_VECTOR_LEN = 0;
+
+const wasmPath = `${__dirname}/shacl_wasm_bg.wasm`;
+const wasmBytes = require('fs').readFileSync(wasmPath);
+const wasmModule = new WebAssembly.Module(wasmBytes);
+let wasmInstance = new WebAssembly.Instance(wasmModule, __wbg_get_imports());
+let wasm = wasmInstance.exports;
+wasm.__wbindgen_start();