@thomasfosterau/effect-rdf 0.0.0-stage → 0.1.0

package/dist/ShExR-ByR4mCh-.mjs

@@ -0,0 +1,480 @@
+import { t as __exportAll } from "./rolldown-runtime-D8jQpDG7.mjs";
+import { B as isNamedNode, N as isBlankNode, Q as quad, T as blankNode, U as isResource, Y as literal, Z as namedNode, z as isLiteral } from "./Term-CFLG1qu4.mjs";
+import { A as objectsOf, C as list, E as match, m as fromIterable } from "./Dataset-BlmlcI7J.mjs";
+import { i as ShExRError } from "./ShExError-CVtq2NnM.mjs";
+import { O as ValueSetValueSchema } from "./ShExJ-COiPd9Xw.mjs";
+import * as Arr from "effect/Array";
+import * as MutableHashMap from "effect/MutableHashMap";
+import * as MutableHashSet from "effect/MutableHashSet";
+import * as Option from "effect/Option";
+import * as Predicate from "effect/Predicate";
+import * as Schema from "effect/Schema";
+import * as Effect from "effect/Effect";
+import * as Match from "effect/Match";
+import * as Order from "effect/Order";
+// src/shex/ShExR.ts
+/**
+* ShExR: the RDF representation of ShEx schemas (vocabulary
+* `http://www.w3.org/ns/shex#`). Reads a schema from a core `Dataset` and
+* writes a schema as RDF quads.
+*
+* @since 0.1.0
+*/
+var ShExR_exports = /* @__PURE__ */ __exportAll({
+	SX: () => SX,
+	fromDataset: () => fromDataset,
+	toDataset: () => toDataset,
+	toQuads: () => toQuads
+});
+/**
+* The ShEx vocabulary namespace.
+*
+* @since 0.1.0
+* @category constants
+*/
+const SX = "http://www.w3.org/ns/shex#";
+const RDF = "http://www.w3.org/1999/02/22-rdf-syntax-ns#";
+const XSD = "http://www.w3.org/2001/XMLSchema#";
+const sx = (local) => namedNode(SX + local);
+const rdfType = namedNode(`${RDF}type`);
+const rdfFirst = namedNode(`${RDF}first`);
+const rdfRest = namedNode(`${RDF}rest`);
+const rdfNil = namedNode(`${RDF}nil`);
+var Fail = class extends Error {};
+const integerFacetNames = [
+	"length",
+	"minlength",
+	"maxlength",
+	"totaldigits",
+	"fractiondigits"
+];
+const rangeFacetNames = [
+	"mininclusive",
+	"minexclusive",
+	"maxinclusive",
+	"maxexclusive"
+];
+const numericFacetNames = [
+	"length",
+	"minlength",
+	"maxlength",
+	"mininclusive",
+	"minexclusive",
+	"maxinclusive",
+	"maxexclusive",
+	"totaldigits",
+	"fractiondigits"
+];
+const valueSetTypes = MutableHashSet.make("IriStem", "IriStemRange", "LiteralStem", "LiteralStemRange", "Language", "LanguageStem", "LanguageStemRange");
+const decodeValueSetValue = Schema.decodeUnknownOption(ValueSetValueSchema);
+var Reader = class {
+	teDefined = MutableHashSet.empty();
+	teUses = MutableHashMap.empty();
+	expressionSites = MutableHashSet.empty();
+	dataset;
+	constructor(dataset) {
+		this.dataset = dataset;
+		match(dataset, { predicate: sx("expression") }).forEach((q) => {
+			this.countUse(q.object);
+			MutableHashSet.add(this.expressionSites, q.object.key);
+		});
+		match(dataset, { predicate: rdfFirst }).forEach((q) => this.countUse(q.object));
+	}
+	uses(t) {
+		return Option.getOrElse(MutableHashMap.get(this.teUses, t.key), () => 0);
+	}
+	countUse(t) {
+		MutableHashMap.set(this.teUses, t.key, this.uses(t) + 1);
+	}
+	fail(message) {
+		throw new Fail(message);
+	}
+	types(n) {
+		if (!isResource(n)) return [];
+		return objectsOf(this.dataset, n, rdfType).map((t) => isNamedNode(t) ? t.value : "");
+	}
+	hasType(n, local) {
+		return this.types(n).includes(SX + local);
+	}
+	one(n, p) {
+		if (!isResource(n)) return Option.none();
+		const os = objectsOf(this.dataset, n, sx(p));
+		if (os.length > 1) this.fail(`${n.key} has several sx:${p} values`);
+		return Arr.head(os);
+	}
+	/** The value of a required property. */
+	required(n, p, message) {
+		return Option.getOrElse(this.one(n, p), () => this.fail(message));
+	}
+	all(n, p) {
+		if (!isResource(n)) return [];
+		return objectsOf(this.dataset, n, sx(p));
+	}
+	list(n) {
+		return Option.match(n, {
+			onNone: () => [],
+			onSome: (head) => Option.getOrElse(list(this.dataset, head), () => this.fail(`${head.key} is not a well-formed RDF list`))
+		});
+	}
+	label(n) {
+		if (isNamedNode(n)) return n.value;
+		if (isBlankNode(n)) return `_:${n.value}`;
+		return this.fail(`${n.key} cannot be a label`);
+	}
+	iri(n, what) {
+		const t = Option.getOrUndefined(n);
+		if (!isNamedNode(t)) return this.fail(`expected an IRI for ${what}`);
+		return t.value;
+	}
+	str(n, what) {
+		const t = Option.getOrUndefined(n);
+		if (!isLiteral(t)) return this.fail(`expected a literal for ${what}`);
+		return t.value;
+	}
+	num(n, what) {
+		const v = Number(this.str(n, what));
+		if (Number.isNaN(v)) this.fail(`expected a number for ${what}`);
+		return v;
+	}
+	bool(n) {
+		return Option.exists(n, (t) => isLiteral(t) && (t.value === "true" || t.value === "1"));
+	}
+	objectValue(n) {
+		if (isNamedNode(n)) return n.value;
+		if (isLiteral(n)) {
+			if (n.language !== "") return {
+				value: n.value,
+				language: n.language
+			};
+			if (n.datatype.value === `${XSD}string`) return { value: n.value };
+			return {
+				value: n.value,
+				type: n.datatype.value
+			};
+		}
+		return this.fail(`${n.key} is not an IRI or literal`);
+	}
+	annotations(n) {
+		return Option.map(this.one(n, "annotation"), (l) => this.list(Option.some(l)).map((a) => ({
+			type: "Annotation",
+			predicate: this.iri(this.one(a, "predicate"), "sx:predicate"),
+			object: this.objectValue(this.required(a, "object", "annotation without sx:object"))
+		})));
+	}
+	meta(n, out) {
+		const acts = this.semActsOf(n, "semActs");
+		const annots = this.annotations(n);
+		if (Option.isSome(acts)) out.semActs = acts.value;
+		if (Option.isSome(annots)) out.annotations = annots.value;
+	}
+	/** A shape expression or a reference to a declaration. */
+	shapeDeclOrExpr(n) {
+		const types = this.types(n);
+		if (types.includes(`http://www.w3.org/ns/shex#ShapeDecl`) || Arr.isReadonlyArrayEmpty(types)) return this.label(n);
+		return this.shapeExpr(n);
+	}
+	shapeExpr(n) {
+		const types = this.types(n);
+		if (types.includes(`http://www.w3.org/ns/shex#ShapeOr`) || types.includes(`http://www.w3.org/ns/shex#ShapeAnd`)) return {
+			type: types.includes(`http://www.w3.org/ns/shex#ShapeOr`) ? "ShapeOr" : "ShapeAnd",
+			shapeExprs: this.list(this.one(n, "shapeExprs")).map((x) => this.shapeDeclOrExpr(x))
+		};
+		if (types.includes(`http://www.w3.org/ns/shex#ShapeNot`)) return {
+			type: "ShapeNot",
+			shapeExpr: this.shapeDeclOrExpr(this.required(n, "shapeExpr", "ShapeNot without sx:shapeExpr"))
+		};
+		if (types.includes(`http://www.w3.org/ns/shex#ShapeExternal`)) return { type: "ShapeExternal" };
+		if (types.includes(`http://www.w3.org/ns/shex#NodeConstraint`)) return this.nodeConstraint(n);
+		if (types.includes(`http://www.w3.org/ns/shex#Shape`)) return this.shape(n);
+		return this.fail(`${n.key} is not a shape expression`);
+	}
+	nodeConstraint(n) {
+		const nc = { type: "NodeConstraint" };
+		const kind = this.one(n, "nodeKind");
+		if (Option.isSome(kind)) {
+			const k = this.iri(kind, "sx:nodeKind").slice(26);
+			if (k !== "iri" && k !== "bnode" && k !== "literal" && k !== "nonliteral") this.fail(`unknown node kind ${kind.value.key}`);
+			nc.nodeKind = k;
+		}
+		const dt = this.one(n, "datatype");
+		if (Option.isSome(dt)) nc.datatype = this.iri(dt, "sx:datatype");
+		numericFacetNames.forEach((f) => {
+			const v = this.one(n, f);
+			if (Option.isSome(v)) nc[f] = this.num(v, `sx:${f}`);
+		});
+		const pattern = this.one(n, "pattern");
+		if (Option.isSome(pattern)) nc.pattern = this.str(pattern, "sx:pattern");
+		const flags = this.one(n, "flags");
+		if (Option.isSome(flags)) nc.flags = this.str(flags, "sx:flags");
+		const values = this.one(n, "values");
+		if (Option.isSome(values)) nc.values = this.list(values).map((v) => this.valueSetValue(v));
+		this.meta(n, nc);
+		return nc;
+	}
+	stem(n) {
+		if (this.hasType(n, "Wildcard")) return { type: "Wildcard" };
+		return isNamedNode(n) ? n.value : this.str(Option.some(n), "sx:stem");
+	}
+	valueSetValue(n) {
+		if (isLiteral(n)) return this.objectValue(n);
+		const found = Arr.findFirst(this.types(n).map((x) => x.slice(26)), (x) => MutableHashSet.has(valueSetTypes, x));
+		if (Option.isNone(found) || isNamedNode(n)) return this.objectValue(n);
+		const t = found.value;
+		const stem = () => this.stem(this.required(n, "stem", `${t} without sx:stem`));
+		const exclusions = () => this.list(this.one(n, "exclusion")).map((e) => isLiteral(e) || isNamedNode(e) ? e.value : {
+			type: (this.types(e)[0] ?? `http://www.w3.org/ns/shex#IriStem`).slice(26),
+			stem: this.str(this.one(e, "stem"), "sx:stem")
+		});
+		const decoded = (value) => Option.getOrElse(decodeValueSetValue(value), () => this.fail(`${n.key} is not a well-formed ${t}`));
+		return Match.value(t).pipe(Match.withReturnType(), Match.when(Match.is("IriStem", "LiteralStem", "LanguageStem"), (kind) => decoded({
+			type: kind,
+			stem: stem()
+		})), Match.when(Match.is("IriStemRange", "LiteralStemRange", "LanguageStemRange"), (kind) => decoded({
+			type: kind,
+			stem: stem(),
+			exclusions: exclusions()
+		})), Match.when("Language", () => ({
+			type: "Language",
+			languageTag: this.str(this.one(n, "languageTag"), "sx:languageTag")
+		})), Match.orElse((kind) => this.fail(`unknown value set value type ${kind}`)));
+	}
+	shape(n) {
+		const shape = { type: "Shape" };
+		const ext = this.one(n, "extends");
+		if (Option.isSome(ext)) shape.extends = this.list(ext).map((x) => this.shapeDeclOrExpr(x));
+		const closed = this.one(n, "closed");
+		if (Option.isSome(closed)) shape.closed = this.bool(closed);
+		const extra = this.all(n, "extra");
+		if (Arr.isReadonlyArrayNonEmpty(extra)) shape.extra = Arr.sort(extra.map((e) => this.iri(Option.some(e), "sx:extra")), Order.String);
+		const expr = this.one(n, "expression");
+		if (Option.isSome(expr)) shape.expression = this.tripleExpr(expr.value, true);
+		this.meta(n, shape);
+		return shape;
+	}
+	/**
+	* Reads a triple expression. A labelled expression used in several places
+	* is defined (with its `id`) at the first shape's `sx:expression` that
+	* uses it, or else at its first use, and referenced elsewhere.
+	*/
+	tripleExpr(n, viaExpression = false) {
+		const types = this.types(n);
+		const labelled = isNamedNode(n) || this.uses(n) > 1;
+		if (labelled) {
+			const label = this.label(n);
+			if (MutableHashSet.has(this.teDefined, label) || Arr.isReadonlyArrayEmpty(types)) return label;
+			if (!viaExpression && MutableHashSet.has(this.expressionSites, n.key)) return label;
+			MutableHashSet.add(this.teDefined, label);
+		}
+		let te;
+		if (types.includes(`http://www.w3.org/ns/shex#TripleConstraint`)) {
+			const tc = {
+				type: "TripleConstraint",
+				predicate: this.iri(this.one(n, "predicate"), "sx:predicate")
+			};
+			const inverse = this.one(n, "inverse");
+			if (Option.isSome(inverse)) tc.inverse = this.bool(inverse);
+			const ve = this.one(n, "valueExpr");
+			if (Option.isSome(ve)) tc.valueExpr = this.shapeDeclOrExpr(ve.value);
+			te = tc;
+		} else if (types.includes(`http://www.w3.org/ns/shex#EachOf`) || types.includes(`http://www.w3.org/ns/shex#OneOf`)) te = {
+			type: types.includes(`http://www.w3.org/ns/shex#EachOf`) ? "EachOf" : "OneOf",
+			expressions: this.list(this.one(n, "expressions")).map((x) => this.tripleExpr(x))
+		};
+		else return this.fail(`${n.key} is not a triple expression`);
+		const min = this.one(n, "min");
+		if (Option.isSome(min)) te.min = this.num(min, "sx:min");
+		const max = this.one(n, "max");
+		if (Option.isSome(max)) te.max = this.num(max, "sx:max");
+		this.meta(n, te);
+		return labelled ? {
+			id: this.label(n),
+			...te
+		} : te;
+	}
+	schema() {
+		const roots = match(this.dataset, {
+			predicate: rdfType,
+			object: sx("Schema")
+		});
+		const root = Option.getOrElse(Option.filter(Arr.head(roots), () => roots.length === 1), () => this.fail(`expected exactly one sx:Schema, found ${roots.length}`)).subject;
+		const schema = { type: "Schema" };
+		const imports = this.one(root, "imports");
+		if (Option.isSome(imports)) schema.imports = this.list(imports).map((i) => this.iri(Option.some(i), "sx:imports"));
+		const startActs = this.semActsOf(root, "startActs");
+		if (Option.isSome(startActs)) schema.startActs = startActs.value;
+		const start = this.one(root, "start");
+		if (Option.isSome(start)) schema.start = this.shapeDeclOrExpr(start.value);
+		const shapes = this.one(root, "shapes");
+		if (Option.isSome(shapes)) schema.shapes = this.list(shapes).map((d) => {
+			const decl = {
+				type: "ShapeDecl",
+				id: this.label(d),
+				shapeExpr: { type: "Shape" }
+			};
+			const abstract = this.one(d, "abstract");
+			if (Option.isSome(abstract) && this.bool(abstract)) decl.abstract = true;
+			const restricts = this.one(d, "restricts");
+			if (Option.isSome(restricts)) decl.restricts = this.list(restricts).map((x) => this.shapeDeclOrExpr(x));
+			decl.shapeExpr = this.shapeDeclOrExpr(this.required(d, "shapeExpr", `${d.key} has no sx:shapeExpr`));
+			return decl;
+		});
+		return schema;
+	}
+	semActsOf(n, p) {
+		return Option.map(this.one(n, p), (l) => this.list(Option.some(l)).map((a) => {
+			const act = {
+				type: "SemAct",
+				name: this.iri(this.one(a, "name"), "sx:name")
+			};
+			const code = this.one(a, "code");
+			if (Option.isSome(code)) act.code = this.str(code, "sx:code");
+			return act;
+		}));
+	}
+};
+/**
+* Reads the ShExR schema contained in a dataset (which must have exactly one
+* node of type `sx:Schema`).
+*
+* @since 0.1.0
+* @category reading
+*/
+const fromDataset = (dataset) => Effect.try({
+	try: () => new Reader(dataset).schema(),
+	catch: (e) => new ShExRError({ message: Predicate.hasProperty(e, "message") && Predicate.isString(e.message) ? e.message : String(e) })
+});
+const labelTerm = (label) => label.startsWith("_:") ? blankNode(label.slice(2)) : namedNode(label);
+const integerLiteral = (v) => literal(String(v), namedNode(`${XSD}integer`));
+const numericLiteral = (v) => Number.isInteger(v) ? integerLiteral(v) : literal(String(v), namedNode(`${XSD}decimal`));
+const booleanLiteral = (v) => literal(String(v), namedNode(`${XSD}boolean`));
+const objectValueTerm = (v) => Predicate.isString(v) ? namedNode(v) : v.language !== void 0 ? literal(v.value, v.language) : v.type !== void 0 ? literal(v.value, namedNode(v.type)) : literal(v.value);
+/**
+* Writes a schema as ShExR quads (in the default graph). Blank nodes are
+* generated for anonymous expressions.
+*
+* @since 0.1.0
+* @category writing
+*/
+const toQuads = (schema) => {
+	const quads = [];
+	const add = (s, p, o) => quads.push(quad(s, p, o));
+	const list = (items) => {
+		const cells = items.map(() => blankNode());
+		Arr.zip(cells, items).forEach(([cell, item], i) => {
+			add(cell, rdfFirst, item);
+			add(cell, rdfRest, cells[i + 1] ?? rdfNil);
+		});
+		return Option.getOrElse(Arr.head(cells), () => rdfNil);
+	};
+	const meta = (s, x) => {
+		if (x.semActs !== void 0) add(s, sx("semActs"), semActs(x.semActs));
+		if (x.annotations !== void 0) add(s, sx("annotation"), list(x.annotations.map((a) => {
+			const b = blankNode();
+			add(b, rdfType, sx("Annotation"));
+			add(b, sx("predicate"), namedNode(a.predicate));
+			add(b, sx("object"), objectValueTerm(a.object));
+			return b;
+		})));
+	};
+	const semActs = (acts) => list(acts.map((a) => {
+		const b = blankNode();
+		add(b, rdfType, sx("SemAct"));
+		add(b, sx("name"), namedNode(a.name));
+		if (a.code !== void 0) add(b, sx("code"), literal(a.code));
+		return b;
+	}));
+	const stem = (s, iri) => {
+		if (!Predicate.isString(s)) {
+			const b = blankNode();
+			add(b, rdfType, sx("Wildcard"));
+			return b;
+		}
+		return iri ? literal(s, namedNode(`${XSD}anyURI`)) : literal(s);
+	};
+	const valueSetValue = (v) => {
+		if (Predicate.isString(v) || !("type" in v) || "value" in v) return objectValueTerm(v);
+		const b = blankNode();
+		add(b, rdfType, sx(v.type));
+		Match.value(v).pipe(Match.discriminator("type")("Language", (member) => add(b, sx("languageTag"), literal(member.languageTag))), Match.discriminator("type")("IriStem", "LiteralStem", "LanguageStem", (member) => add(b, sx("stem"), stem(member.stem, false))), Match.orElse((member) => {
+			add(b, sx("stem"), stem(member.stem, false));
+			const stemType = member.type.replace("Range", "");
+			add(b, sx("exclusion"), list(Arr.map(member.exclusions, (e) => {
+				if (Predicate.isString(e)) return member.type === "IriStemRange" ? namedNode(e) : literal(e);
+				const x = blankNode();
+				add(x, rdfType, sx(stemType));
+				add(x, sx("stem"), literal(e.stem));
+				return x;
+			})));
+		}));
+		return b;
+	};
+	const shapeExpr = (e, subject) => {
+		if (Predicate.isString(e)) return labelTerm(e);
+		const s = subject ?? blankNode();
+		add(s, rdfType, sx(e.type));
+		Match.value(e).pipe(Match.discriminator("type")("ShapeAnd", "ShapeOr", (expr) => add(s, sx("shapeExprs"), list(expr.shapeExprs.map((x) => shapeExpr(x))))), Match.discriminator("type")("ShapeNot", (expr) => add(s, sx("shapeExpr"), shapeExpr(expr.shapeExpr))), Match.discriminator("type")("ShapeExternal", () => void 0), Match.discriminator("type")("NodeConstraint", (expr) => {
+			if (expr.nodeKind !== void 0) add(s, sx("nodeKind"), sx(expr.nodeKind));
+			if (expr.datatype !== void 0) add(s, sx("datatype"), namedNode(expr.datatype));
+			integerFacetNames.forEach((f) => {
+				const v = expr[f];
+				if (v !== void 0) add(s, sx(f), integerLiteral(v));
+			});
+			rangeFacetNames.forEach((f) => {
+				const v = expr[f];
+				if (v !== void 0) add(s, sx(f), numericLiteral(v));
+			});
+			if (expr.pattern !== void 0) add(s, sx("pattern"), literal(expr.pattern));
+			if (expr.flags !== void 0) add(s, sx("flags"), literal(expr.flags));
+			if (expr.values !== void 0) add(s, sx("values"), list(expr.values.map(valueSetValue)));
+			meta(s, expr);
+		}), Match.discriminator("type")("Shape", (expr) => {
+			if (expr.extends !== void 0) add(s, sx("extends"), list(expr.extends.map((x) => shapeExpr(x))));
+			if (expr.closed !== void 0) add(s, sx("closed"), booleanLiteral(expr.closed));
+			expr.extra?.forEach((p) => add(s, sx("extra"), namedNode(p)));
+			if (expr.expression !== void 0) add(s, sx("expression"), tripleExpr(expr.expression));
+			meta(s, expr);
+		}), Match.exhaustive);
+		return s;
+	};
+	const tripleExpr = (t) => {
+		if (Predicate.isString(t)) return labelTerm(t);
+		const s = t.id !== void 0 ? labelTerm(t.id) : blankNode();
+		add(s, rdfType, sx(t.type));
+		if (t.type === "TripleConstraint") {
+			if (t.inverse !== void 0) add(s, sx("inverse"), booleanLiteral(t.inverse));
+			add(s, sx("predicate"), namedNode(t.predicate));
+			if (t.valueExpr !== void 0) add(s, sx("valueExpr"), shapeExpr(t.valueExpr));
+		} else add(s, sx("expressions"), list(t.expressions.map(tripleExpr)));
+		if (t.min !== void 0) add(s, sx("min"), integerLiteral(t.min));
+		if (t.max !== void 0) add(s, sx("max"), integerLiteral(t.max));
+		meta(s, t);
+		return s;
+	};
+	const root = blankNode();
+	add(root, rdfType, sx("Schema"));
+	if (schema.imports !== void 0) add(root, sx("imports"), list(schema.imports.map((i) => namedNode(i))));
+	if (schema.startActs !== void 0) add(root, sx("startActs"), semActs(schema.startActs));
+	if (schema.start !== void 0) add(root, sx("start"), shapeExpr(schema.start));
+	if (schema.shapes !== void 0) {
+		const decls = schema.shapes.map((d) => {
+			const s = labelTerm(d.id);
+			add(s, rdfType, sx("ShapeDecl"));
+			if (d.abstract !== void 0) add(s, sx("abstract"), booleanLiteral(d.abstract));
+			if (d.restricts !== void 0) add(s, sx("restricts"), list(d.restricts.map((x) => shapeExpr(x))));
+			add(s, sx("shapeExpr"), shapeExpr(d.shapeExpr));
+			return s;
+		});
+		add(root, sx("shapes"), list(decls));
+	}
+	return quads;
+};
+/**
+* Writes a schema as a ShExR dataset.
+*
+* @since 0.1.0
+* @category writing
+*/
+const toDataset = (schema) => fromIterable(toQuads(schema));
+export { toQuads as a, toDataset as i, ShExR_exports as n, fromDataset as r, SX as t };
+
+//# sourceMappingURL=ShExR-ByR4mCh-.mjs.map

package/dist/ShExR-ByR4mCh-.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShExR-ByR4mCh-.mjs","names":["Term.namedNode","ShExJ.ValueSetValueSchema","Term.isResource","Dataset.objectsOf","Term.isNamedNode","Dataset.list","Term.isBlankNode","Term.isLiteral","Dataset.match","Term.blankNode","Term.literal","Term.quad","Dataset.fromIterable"],"sources":["../src/shex/ShExR.ts"],"sourcesContent":["/**\n * ShExR: the RDF representation of ShEx schemas (vocabulary\n * `http://www.w3.org/ns/shex#`). Reads a schema from a core `Dataset` and\n * writes a schema as RDF quads.\n *\n * @since 0.1.0\n */\nimport * as Arr from 'effect/Array';\nimport * as Effect from 'effect/Effect';\nimport * as Match from 'effect/Match';\nimport * as MutableHashMap from 'effect/MutableHashMap';\nimport * as MutableHashSet from 'effect/MutableHashSet';\nimport * as Option from 'effect/Option';\nimport * as Order from 'effect/Order';\nimport * as Predicate from 'effect/Predicate';\nimport * as Schema from 'effect/Schema';\nimport * as Dataset from '../Dataset.ts';\nimport * as Term from '../Term.ts';\nimport { ShExRError } from './ShExError.ts';\nimport * as ShExJ from './ShExJ.ts';\n\n/**\n * The ShEx vocabulary namespace.\n *\n * @since 0.1.0\n * @category constants\n */\nexport const SX = 'http://www.w3.org/ns/shex#';\nconst RDF = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';\nconst XSD = 'http://www.w3.org/2001/XMLSchema#';\n\nconst sx = (local: string) => Term.namedNode(SX + local);\nconst rdfType = Term.namedNode(`${RDF}type`);\nconst rdfFirst = Term.namedNode(`${RDF}first`);\nconst rdfRest = Term.namedNode(`${RDF}rest`);\nconst rdfNil = Term.namedNode(`${RDF}nil`);\n\ntype Mutable<T> = { -readonly [K in keyof T]: T[K] };\n\nclass Fail extends Error {}\n\nconst integerFacetNames = [\n  'length',\n  'minlength',\n  'maxlength',\n  'totaldigits',\n  'fractiondigits',\n] as const;\nconst rangeFacetNames = ['mininclusive', 'minexclusive', 'maxinclusive', 'maxexclusive'] as const;\n// In the order the reader has always read them.\nconst numericFacetNames = [\n  'length',\n  'minlength',\n  'maxlength',\n  'mininclusive',\n  'minexclusive',\n  'maxinclusive',\n  'maxexclusive',\n  'totaldigits',\n  'fractiondigits',\n] as const;\n\nconst valueSetTypes = MutableHashSet.make(\n  'IriStem',\n  'IriStemRange',\n  'LiteralStem',\n  'LiteralStemRange',\n  'Language',\n  'LanguageStem',\n  'LanguageStemRange',\n);\n\nconst decodeValueSetValue = Schema.decodeUnknownOption(ShExJ.ValueSetValueSchema);\n\n/** A stem or stem-range value as read, before it is checked against its kind. */\ninterface RawValueSetValue {\n  readonly type: string;\n  readonly stem: string | ShExJ.Wildcard;\n  readonly exclusions?: ReadonlyArray<string | { readonly type: string; readonly stem: string }>;\n}\n\n/** The fields a ShExJ object may carry its semantic actions and annotations in. */\ninterface Meta {\n  semActs?: ReadonlyArray<ShExJ.SemAct>;\n  annotations?: ReadonlyArray<ShExJ.Annotation>;\n}\n\n// -----------------------------------------------------------------------------\n// Reading\n// -----------------------------------------------------------------------------\n\nclass Reader {\n  readonly teDefined = MutableHashSet.empty<string>();\n  readonly teUses = MutableHashMap.empty<string, number>();\n\n  readonly expressionSites = MutableHashSet.empty<string>();\n\n  readonly dataset: Dataset.Dataset;\n  constructor(dataset: Dataset.Dataset) {\n    this.dataset = dataset;\n    Dataset.match(dataset, { predicate: sx('expression') }).forEach((q) => {\n      this.countUse(q.object);\n      MutableHashSet.add(this.expressionSites, q.object.key);\n    });\n    Dataset.match(dataset, { predicate: rdfFirst }).forEach((q) => this.countUse(q.object));\n  }\n\n  uses(t: Term.Term): number {\n    return Option.getOrElse(MutableHashMap.get(this.teUses, t.key), () => 0);\n  }\n\n  countUse(t: Term.Term): void {\n    MutableHashMap.set(this.teUses, t.key, this.uses(t) + 1);\n  }\n\n  fail(message: string): never {\n    throw new Fail(message);\n  }\n\n  types(n: Term.Term): ReadonlyArray<string> {\n    if (!Term.isResource(n)) return [];\n    return Dataset.objectsOf(this.dataset, n, rdfType).map((t) =>\n      Term.isNamedNode(t) ? t.value : '',\n    );\n  }\n\n  hasType(n: Term.Term, local: string): boolean {\n    return this.types(n).includes(SX + local);\n  }\n\n  one(n: Term.Term, p: string): Option.Option<Term.Object> {\n    if (!Term.isResource(n)) return Option.none();\n    const os = Dataset.objectsOf(this.dataset, n, sx(p));\n    if (os.length > 1) this.fail(`${n.key} has several sx:${p} values`);\n    return Arr.head(os);\n  }\n\n  /** The value of a required property. */\n  required(n: Term.Term, p: string, message: string): Term.Object {\n    return Option.getOrElse(this.one(n, p), () => this.fail(message));\n  }\n\n  all(n: Term.Term, p: string): ReadonlyArray<Term.Object> {\n    if (!Term.isResource(n)) return [];\n    return Dataset.objectsOf(this.dataset, n, sx(p));\n  }\n\n  list(n: Option.Option<Term.Object>): ReadonlyArray<Term.Object> {\n    return Option.match(n, {\n      onNone: () => [],\n      onSome: (head) =>\n        Option.getOrElse(Dataset.list(this.dataset, head), () =>\n          this.fail(`${head.key} is not a well-formed RDF list`),\n        ),\n    });\n  }\n\n  label(n: Term.Term): string {\n    if (Term.isNamedNode(n)) return n.value;\n    if (Term.isBlankNode(n)) return `_:${n.value}`;\n    return this.fail(`${n.key} cannot be a label`);\n  }\n\n  iri(n: Option.Option<Term.Term>, what: string): string {\n    const t = Option.getOrUndefined(n);\n    if (!Term.isNamedNode(t)) return this.fail(`expected an IRI for ${what}`);\n    return t.value;\n  }\n\n  str(n: Option.Option<Term.Term>, what: string): string {\n    const t = Option.getOrUndefined(n);\n    if (!Term.isLiteral(t)) return this.fail(`expected a literal for ${what}`);\n    return t.value;\n  }\n\n  num(n: Option.Option<Term.Term>, what: string): number {\n    const v = Number(this.str(n, what));\n    if (Number.isNaN(v)) this.fail(`expected a number for ${what}`);\n    return v;\n  }\n\n  bool(n: Option.Option<Term.Term>): boolean {\n    return Option.exists(n, (t) => Term.isLiteral(t) && (t.value === 'true' || t.value === '1'));\n  }\n\n  objectValue(n: Term.Term): ShExJ.ObjectValue {\n    if (Term.isNamedNode(n)) return n.value;\n    if (Term.isLiteral(n)) {\n      if (n.language !== '') return { value: n.value, language: n.language };\n      if (n.datatype.value === `${XSD}string`) return { value: n.value };\n      return { value: n.value, type: n.datatype.value };\n    }\n    return this.fail(`${n.key} is not an IRI or literal`);\n  }\n\n  annotations(n: Term.Term): Option.Option<ReadonlyArray<ShExJ.Annotation>> {\n    return Option.map(this.one(n, 'annotation'), (l) =>\n      this.list(Option.some(l)).map((a) => ({\n        type: 'Annotation',\n        predicate: this.iri(this.one(a, 'predicate'), 'sx:predicate'),\n        object: this.objectValue(this.required(a, 'object', 'annotation without sx:object')),\n      })),\n    );\n  }\n\n  meta(n: Term.Term, out: Meta): void {\n    const acts = this.semActsOf(n, 'semActs');\n    const annots = this.annotations(n);\n    if (Option.isSome(acts)) out.semActs = acts.value;\n    if (Option.isSome(annots)) out.annotations = annots.value;\n  }\n\n  /** A shape expression or a reference to a declaration. */\n  shapeDeclOrExpr(n: Term.Term): ShExJ.ShapeExprOrRef {\n    const types = this.types(n);\n    if (types.includes(`${SX}ShapeDecl`) || Arr.isReadonlyArrayEmpty(types)) return this.label(n);\n    return this.shapeExpr(n);\n  }\n\n  shapeExpr(n: Term.Term): ShExJ.ShapeExpr {\n    const types = this.types(n);\n    if (types.includes(`${SX}ShapeOr`) || types.includes(`${SX}ShapeAnd`)) {\n      const type = types.includes(`${SX}ShapeOr`) ? 'ShapeOr' : 'ShapeAnd';\n      return {\n        type,\n        shapeExprs: this.list(this.one(n, 'shapeExprs')).map((x) => this.shapeDeclOrExpr(x)),\n      };\n    }\n    if (types.includes(`${SX}ShapeNot`))\n      return {\n        type: 'ShapeNot',\n        shapeExpr: this.shapeDeclOrExpr(\n          this.required(n, 'shapeExpr', 'ShapeNot without sx:shapeExpr'),\n        ),\n      };\n    if (types.includes(`${SX}ShapeExternal`)) return { type: 'ShapeExternal' };\n    if (types.includes(`${SX}NodeConstraint`)) return this.nodeConstraint(n);\n    if (types.includes(`${SX}Shape`)) return this.shape(n);\n    return this.fail(`${n.key} is not a shape expression`);\n  }\n\n  nodeConstraint(n: Term.Term): ShExJ.NodeConstraint {\n    const nc: Mutable<ShExJ.NodeConstraint> = { type: 'NodeConstraint' };\n    const kind = this.one(n, 'nodeKind');\n    if (Option.isSome(kind)) {\n      const k = this.iri(kind, 'sx:nodeKind').slice(SX.length);\n      if (k !== 'iri' && k !== 'bnode' && k !== 'literal' && k !== 'nonliteral')\n        this.fail(`unknown node kind ${kind.value.key}`);\n      nc.nodeKind = k;\n    }\n    const dt = this.one(n, 'datatype');\n    if (Option.isSome(dt)) nc.datatype = this.iri(dt, 'sx:datatype');\n    numericFacetNames.forEach((f) => {\n      const v = this.one(n, f);\n      if (Option.isSome(v)) nc[f] = this.num(v, `sx:${f}`);\n    });\n    const pattern = this.one(n, 'pattern');\n    if (Option.isSome(pattern)) nc.pattern = this.str(pattern, 'sx:pattern');\n    const flags = this.one(n, 'flags');\n    if (Option.isSome(flags)) nc.flags = this.str(flags, 'sx:flags');\n    const values = this.one(n, 'values');\n    if (Option.isSome(values)) nc.values = this.list(values).map((v) => this.valueSetValue(v));\n    this.meta(n, nc);\n    return nc;\n  }\n\n  stem(n: Term.Term): string | ShExJ.Wildcard {\n    if (this.hasType(n, 'Wildcard')) return { type: 'Wildcard' };\n    return Term.isNamedNode(n) ? n.value : this.str(Option.some(n), 'sx:stem');\n  }\n\n  valueSetValue(n: Term.Term): ShExJ.ValueSetValue {\n    if (Term.isLiteral(n)) return this.objectValue(n);\n    const found = Arr.findFirst(\n      this.types(n).map((x) => x.slice(SX.length)),\n      (x) => MutableHashSet.has(valueSetTypes, x),\n    );\n    if (Option.isNone(found) || Term.isNamedNode(n)) return this.objectValue(n);\n    const t = found.value;\n    const stem = () => this.stem(this.required(n, 'stem', `${t} without sx:stem`));\n    const exclusions = () =>\n      this.list(this.one(n, 'exclusion')).map((e) =>\n        Term.isLiteral(e) || Term.isNamedNode(e)\n          ? e.value\n          : {\n              type: (this.types(e)[0] ?? `${SX}IriStem`).slice(SX.length),\n              stem: this.str(this.one(e, 'stem'), 'sx:stem'),\n            },\n      );\n    // The stem kinds carry a string stem, the stem-range kinds a stem and their exclusions.\n    const decoded = (value: RawValueSetValue): ShExJ.ValueSetValue =>\n      Option.getOrElse(decodeValueSetValue(value), () =>\n        this.fail(`${n.key} is not a well-formed ${t}`),\n      );\n    return Match.value(t).pipe(\n      Match.withReturnType<ShExJ.ValueSetValue>(),\n      Match.when(Match.is('IriStem', 'LiteralStem', 'LanguageStem'), (kind) =>\n        decoded({ type: kind, stem: stem() }),\n      ),\n      Match.when(Match.is('IriStemRange', 'LiteralStemRange', 'LanguageStemRange'), (kind) =>\n        decoded({ type: kind, stem: stem(), exclusions: exclusions() }),\n      ),\n      Match.when('Language', () => ({\n        type: 'Language',\n        languageTag: this.str(this.one(n, 'languageTag'), 'sx:languageTag'),\n      })),\n      Match.orElse((kind) => this.fail(`unknown value set value type ${kind}`)),\n    );\n  }\n\n  shape(n: Term.Term): ShExJ.Shape {\n    const shape: Mutable<ShExJ.Shape> = { type: 'Shape' };\n    const ext = this.one(n, 'extends');\n    if (Option.isSome(ext)) shape.extends = this.list(ext).map((x) => this.shapeDeclOrExpr(x));\n    const closed = this.one(n, 'closed');\n    if (Option.isSome(closed)) shape.closed = this.bool(closed);\n    const extra = this.all(n, 'extra');\n    if (Arr.isReadonlyArrayNonEmpty(extra))\n      shape.extra = Arr.sort(\n        extra.map((e) => this.iri(Option.some(e), 'sx:extra')),\n        Order.String,\n      );\n    const expr = this.one(n, 'expression');\n    if (Option.isSome(expr)) shape.expression = this.tripleExpr(expr.value, true);\n    this.meta(n, shape);\n    return shape;\n  }\n\n  /**\n   * Reads a triple expression. A labelled expression used in several places\n   * is defined (with its `id`) at the first shape's `sx:expression` that\n   * uses it, or else at its first use, and referenced elsewhere.\n   */\n  tripleExpr(n: Term.Term, viaExpression = false): ShExJ.TripleExprOrRef {\n    const types = this.types(n);\n    const labelled = Term.isNamedNode(n) || this.uses(n) > 1;\n    if (labelled) {\n      const label = this.label(n);\n      if (MutableHashSet.has(this.teDefined, label) || Arr.isReadonlyArrayEmpty(types))\n        return label;\n      if (!viaExpression && MutableHashSet.has(this.expressionSites, n.key)) return label;\n      MutableHashSet.add(this.teDefined, label);\n    }\n    let te: Mutable<ShExJ.TripleExpr>;\n    if (types.includes(`${SX}TripleConstraint`)) {\n      const tc: Mutable<ShExJ.TripleConstraint> = {\n        type: 'TripleConstraint',\n        predicate: this.iri(this.one(n, 'predicate'), 'sx:predicate'),\n      };\n      const inverse = this.one(n, 'inverse');\n      if (Option.isSome(inverse)) tc.inverse = this.bool(inverse);\n      const ve = this.one(n, 'valueExpr');\n      if (Option.isSome(ve)) tc.valueExpr = this.shapeDeclOrExpr(ve.value);\n      te = tc;\n    } else if (types.includes(`${SX}EachOf`) || types.includes(`${SX}OneOf`)) {\n      te = {\n        type: types.includes(`${SX}EachOf`) ? 'EachOf' : 'OneOf',\n        expressions: this.list(this.one(n, 'expressions')).map((x) => this.tripleExpr(x)),\n      };\n    } else return this.fail(`${n.key} is not a triple expression`);\n    const min = this.one(n, 'min');\n    if (Option.isSome(min)) te.min = this.num(min, 'sx:min');\n    const max = this.one(n, 'max');\n    if (Option.isSome(max)) te.max = this.num(max, 'sx:max');\n    this.meta(n, te);\n    // A labelled triple expression is the expression with its `id`.\n    return labelled ? { id: this.label(n), ...te } : te;\n  }\n\n  schema(): ShExJ.Schema {\n    const roots = Dataset.match(this.dataset, { predicate: rdfType, object: sx('Schema') });\n    const root = Option.getOrElse(\n      Option.filter(Arr.head(roots), () => roots.length === 1),\n      () => this.fail(`expected exactly one sx:Schema, found ${roots.length}`),\n    ).subject;\n    const schema: Mutable<ShExJ.Schema> = { type: 'Schema' };\n    const imports = this.one(root, 'imports');\n    if (Option.isSome(imports))\n      schema.imports = this.list(imports).map((i) => this.iri(Option.some(i), 'sx:imports'));\n    const startActs = this.semActsOf(root, 'startActs');\n    if (Option.isSome(startActs)) schema.startActs = startActs.value;\n    const start = this.one(root, 'start');\n    if (Option.isSome(start)) schema.start = this.shapeDeclOrExpr(start.value);\n    const shapes = this.one(root, 'shapes');\n    if (Option.isSome(shapes)) {\n      schema.shapes = this.list(shapes).map((d) => {\n        const decl: Mutable<ShExJ.ShapeDecl> = {\n          type: 'ShapeDecl',\n          id: this.label(d),\n          shapeExpr: { type: 'Shape' },\n        };\n        const abstract = this.one(d, 'abstract');\n        if (Option.isSome(abstract) && this.bool(abstract)) decl.abstract = true;\n        const restricts = this.one(d, 'restricts');\n        if (Option.isSome(restricts))\n          decl.restricts = this.list(restricts).map((x) => this.shapeDeclOrExpr(x));\n        decl.shapeExpr = this.shapeDeclOrExpr(\n          this.required(d, 'shapeExpr', `${d.key} has no sx:shapeExpr`),\n        );\n        return decl;\n      });\n    }\n    return schema;\n  }\n\n  semActsOf(n: Term.Term, p: string): Option.Option<ReadonlyArray<ShExJ.SemAct>> {\n    return Option.map(this.one(n, p), (l) =>\n      this.list(Option.some(l)).map((a) => {\n        const act: Mutable<ShExJ.SemAct> = {\n          type: 'SemAct',\n          name: this.iri(this.one(a, 'name'), 'sx:name'),\n        };\n        const code = this.one(a, 'code');\n        if (Option.isSome(code)) act.code = this.str(code, 'sx:code');\n        return act;\n      }),\n    );\n  }\n}\n\n/**\n * Reads the ShExR schema contained in a dataset (which must have exactly one\n * node of type `sx:Schema`).\n *\n * @since 0.1.0\n * @category reading\n */\nexport const fromDataset = (dataset: Dataset.Dataset): Effect.Effect<ShExJ.Schema, ShExRError> =>\n  Effect.try({\n    try: () => new Reader(dataset).schema(),\n    catch: (e) =>\n      new ShExRError({\n        message:\n          Predicate.hasProperty(e, 'message') && Predicate.isString(e.message)\n            ? e.message\n            : String(e),\n      }),\n  });\n\n// -----------------------------------------------------------------------------\n// Writing\n// -----------------------------------------------------------------------------\n\nconst labelTerm = (label: string): Term.NamedNode | Term.BlankNode =>\n  label.startsWith('_:') ? Term.blankNode(label.slice(2)) : Term.namedNode(label);\n\nconst integerLiteral = (v: number) => Term.literal(String(v), Term.namedNode(`${XSD}integer`));\n\nconst numericLiteral = (v: number) =>\n  Number.isInteger(v)\n    ? integerLiteral(v)\n    : Term.literal(String(v), Term.namedNode(`${XSD}decimal`));\n\nconst booleanLiteral = (v: boolean) => Term.literal(String(v), Term.namedNode(`${XSD}boolean`));\n\nconst objectValueTerm = (v: ShExJ.ObjectValue): Term.Object =>\n  Predicate.isString(v)\n    ? Term.namedNode(v)\n    : v.language !== undefined\n      ? Term.literal(v.value, v.language)\n      : v.type !== undefined\n        ? Term.literal(v.value, Term.namedNode(v.type))\n        : Term.literal(v.value);\n\n/**\n * Writes a schema as ShExR quads (in the default graph). Blank nodes are\n * generated for anonymous expressions.\n *\n * @since 0.1.0\n * @category writing\n */\nexport const toQuads = (schema: ShExJ.Schema): ReadonlyArray<Term.Quad> => {\n  const quads: Array<Term.Quad> = [];\n  const add = (s: Term.Subject, p: Term.NamedNode, o: Term.Object) =>\n    quads.push(Term.quad(s, p, o));\n  const list = (items: ReadonlyArray<Term.Object>): Term.Object => {\n    const cells = items.map(() => Term.blankNode());\n    Arr.zip(cells, items).forEach(([cell, item], i) => {\n      add(cell, rdfFirst, item);\n      add(cell, rdfRest, cells[i + 1] ?? rdfNil);\n    });\n    return Option.getOrElse(Arr.head(cells), (): Term.Object => rdfNil);\n  };\n  const meta = (\n    s: Term.Subject,\n    x: { semActs?: ReadonlyArray<ShExJ.SemAct>; annotations?: ReadonlyArray<ShExJ.Annotation> },\n  ) => {\n    if (x.semActs !== undefined) add(s, sx('semActs'), semActs(x.semActs));\n    if (x.annotations !== undefined)\n      add(\n        s,\n        sx('annotation'),\n        list(\n          x.annotations.map((a) => {\n            const b = Term.blankNode();\n            add(b, rdfType, sx('Annotation'));\n            add(b, sx('predicate'), Term.namedNode(a.predicate));\n            add(b, sx('object'), objectValueTerm(a.object));\n            return b;\n          }),\n        ),\n      );\n  };\n  const semActs = (acts: ReadonlyArray<ShExJ.SemAct>) =>\n    list(\n      acts.map((a) => {\n        const b = Term.blankNode();\n        add(b, rdfType, sx('SemAct'));\n        add(b, sx('name'), Term.namedNode(a.name));\n        if (a.code !== undefined) add(b, sx('code'), Term.literal(a.code));\n        return b;\n      }),\n    );\n  const stem = (s: string | ShExJ.Wildcard, iri: boolean): Term.Object => {\n    if (!Predicate.isString(s)) {\n      const b = Term.blankNode();\n      add(b, rdfType, sx('Wildcard'));\n      return b;\n    }\n    return iri ? Term.literal(s, Term.namedNode(`${XSD}anyURI`)) : Term.literal(s);\n  };\n  const valueSetValue = (v: ShExJ.ValueSetValue): Term.Object => {\n    if (Predicate.isString(v) || !('type' in v) || 'value' in v)\n      // SAFETY: a value without `type`, or with a `value`, is an object value in ShExJ.\n      return objectValueTerm(v);\n    const b = Term.blankNode();\n    add(b, rdfType, sx(v.type));\n    Match.value(v).pipe(\n      Match.discriminator('type')('Language', (member) =>\n        add(b, sx('languageTag'), Term.literal(member.languageTag)),\n      ),\n      Match.discriminator('type')('IriStem', 'LiteralStem', 'LanguageStem', (member) =>\n        add(b, sx('stem'), stem(member.stem, false)),\n      ),\n      Match.orElse((member) => {\n        add(b, sx('stem'), stem(member.stem, false));\n        const stemType = member.type.replace('Range', '');\n        add(\n          b,\n          sx('exclusion'),\n          list(\n            Arr.map(member.exclusions, (e) => {\n              if (Predicate.isString(e))\n                return member.type === 'IriStemRange' ? Term.namedNode(e) : Term.literal(e);\n              const x = Term.blankNode();\n              add(x, rdfType, sx(stemType));\n              add(x, sx('stem'), Term.literal(e.stem));\n              return x;\n            }),\n          ),\n        );\n      }),\n    );\n    return b;\n  };\n  const shapeExpr = (e: ShExJ.ShapeExprOrRef, subject?: Term.Subject): Term.Object => {\n    if (Predicate.isString(e)) return labelTerm(e);\n    const s = subject ?? Term.blankNode();\n    add(s, rdfType, sx(e.type));\n    Match.value(e).pipe(\n      Match.discriminator('type')('ShapeAnd', 'ShapeOr', (expr) =>\n        add(s, sx('shapeExprs'), list(expr.shapeExprs.map((x) => shapeExpr(x)))),\n      ),\n      Match.discriminator('type')('ShapeNot', (expr) =>\n        add(s, sx('shapeExpr'), shapeExpr(expr.shapeExpr)),\n      ),\n      Match.discriminator('type')('ShapeExternal', () => undefined),\n      Match.discriminator('type')('NodeConstraint', (expr) => {\n        if (expr.nodeKind !== undefined) add(s, sx('nodeKind'), sx(expr.nodeKind));\n        if (expr.datatype !== undefined) add(s, sx('datatype'), Term.namedNode(expr.datatype));\n        integerFacetNames.forEach((f) => {\n          const v = expr[f];\n          if (v !== undefined) add(s, sx(f), integerLiteral(v));\n        });\n        rangeFacetNames.forEach((f) => {\n          const v = expr[f];\n          if (v !== undefined) add(s, sx(f), numericLiteral(v));\n        });\n        if (expr.pattern !== undefined) add(s, sx('pattern'), Term.literal(expr.pattern));\n        if (expr.flags !== undefined) add(s, sx('flags'), Term.literal(expr.flags));\n        if (expr.values !== undefined) add(s, sx('values'), list(expr.values.map(valueSetValue)));\n        meta(s, expr);\n      }),\n      Match.discriminator('type')('Shape', (expr) => {\n        if (expr.extends !== undefined)\n          add(s, sx('extends'), list(expr.extends.map((x) => shapeExpr(x))));\n        if (expr.closed !== undefined) add(s, sx('closed'), booleanLiteral(expr.closed));\n        expr.extra?.forEach((p) => add(s, sx('extra'), Term.namedNode(p)));\n        if (expr.expression !== undefined) add(s, sx('expression'), tripleExpr(expr.expression));\n        meta(s, expr);\n      }),\n      Match.exhaustive,\n    );\n    return s;\n  };\n  const tripleExpr = (t: ShExJ.TripleExprOrRef): Term.Object => {\n    if (Predicate.isString(t)) return labelTerm(t);\n    const s = t.id !== undefined ? labelTerm(t.id) : Term.blankNode();\n    add(s, rdfType, sx(t.type));\n    if (t.type === 'TripleConstraint') {\n      if (t.inverse !== undefined) add(s, sx('inverse'), booleanLiteral(t.inverse));\n      add(s, sx('predicate'), Term.namedNode(t.predicate));\n      if (t.valueExpr !== undefined) add(s, sx('valueExpr'), shapeExpr(t.valueExpr));\n    } else {\n      add(s, sx('expressions'), list(t.expressions.map(tripleExpr)));\n    }\n    if (t.min !== undefined) add(s, sx('min'), integerLiteral(t.min));\n    if (t.max !== undefined) add(s, sx('max'), integerLiteral(t.max));\n    meta(s, t);\n    return s;\n  };\n  const root = Term.blankNode();\n  add(root, rdfType, sx('Schema'));\n  if (schema.imports !== undefined)\n    add(root, sx('imports'), list(schema.imports.map((i) => Term.namedNode(i))));\n  if (schema.startActs !== undefined) add(root, sx('startActs'), semActs(schema.startActs));\n  if (schema.start !== undefined) add(root, sx('start'), shapeExpr(schema.start));\n  if (schema.shapes !== undefined) {\n    const decls = schema.shapes.map((d) => {\n      const s = labelTerm(d.id);\n      add(s, rdfType, sx('ShapeDecl'));\n      if (d.abstract !== undefined) add(s, sx('abstract'), booleanLiteral(d.abstract));\n      if (d.restricts !== undefined)\n        add(s, sx('restricts'), list(d.restricts.map((x) => shapeExpr(x))));\n      add(s, sx('shapeExpr'), shapeExpr(d.shapeExpr));\n      return s;\n    });\n    add(root, sx('shapes'), list(decls));\n  }\n  return quads;\n};\n\n/**\n * Writes a schema as a ShExR dataset.\n *\n * @since 0.1.0\n * @category writing\n */\nexport const toDataset = (schema: ShExJ.Schema): Dataset.Dataset =>\n  Dataset.fromIterable(toQuads(schema));\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,MAAa,KAAK;AAClB,MAAM,MAAM;AACZ,MAAM,MAAM;AAEZ,MAAM,MAAM,UAAkBA,UAAe,KAAK,KAAK;AACvD,MAAM,UAAUA,UAAe,GAAG,IAAI,KAAK;AAC3C,MAAM,WAAWA,UAAe,GAAG,IAAI,MAAM;AAC7C,MAAM,UAAUA,UAAe,GAAG,IAAI,KAAK;AAC3C,MAAM,SAASA,UAAe,GAAG,IAAI,IAAI;AAIzC,IAAM,OAAN,cAAmB,MAAM,CAAC;AAE1B,MAAM,oBAAoB;CACxB;CACA;CACA;CACA;CACA;AACF;AACA,MAAM,kBAAkB;CAAC;CAAgB;CAAgB;CAAgB;AAAc;AAEvF,MAAM,oBAAoB;CACxB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,gBAAgB,eAAe,KACnC,WACA,gBACA,eACA,oBACA,YACA,gBACA,mBACF;AAEA,MAAM,sBAAsB,OAAO,oBAAoBC,mBAAyB;AAmBhF,IAAM,SAAN,MAAa;CACX,YAAqB,eAAe,MAAc;CAClD,SAAkB,eAAe,MAAsB;CAEvD,kBAA2B,eAAe,MAAc;CAExD;CACA,YAAY,SAA0B;EACpC,KAAK,UAAU;EACf,MAAc,SAAS,EAAE,WAAW,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,MAAM;GACrE,KAAK,SAAS,EAAE,MAAM;GACtB,eAAe,IAAI,KAAK,iBAAiB,EAAE,OAAO,GAAG;EACvD,CAAC;EACD,MAAc,SAAS,EAAE,WAAW,SAAS,CAAC,CAAC,CAAC,SAAS,MAAM,KAAK,SAAS,EAAE,MAAM,CAAC;CACxF;CAEA,KAAK,GAAsB;EACzB,OAAO,OAAO,UAAU,eAAe,IAAI,KAAK,QAAQ,EAAE,GAAG,SAAS,CAAC;CACzE;CAEA,SAAS,GAAoB;EAC3B,eAAe,IAAI,KAAK,QAAQ,EAAE,KAAK,KAAK,KAAK,CAAC,IAAI,CAAC;CACzD;CAEA,KAAK,SAAwB;EAC3B,MAAM,IAAI,KAAK,OAAO;CACxB;CAEA,MAAM,GAAqC;EACzC,IAAI,CAACC,WAAgB,CAAC,GAAG,OAAO,CAAC;EACjC,OAAOC,UAAkB,KAAK,SAAS,GAAG,OAAO,CAAC,CAAC,KAAK,MACtDC,YAAiB,CAAC,IAAI,EAAE,QAAQ,EAClC;CACF;CAEA,QAAQ,GAAc,OAAwB;EAC5C,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,KAAK,KAAK;CAC1C;CAEA,IAAI,GAAc,GAAuC;EACvD,IAAI,CAACF,WAAgB,CAAC,GAAG,OAAO,OAAO,KAAK;EAC5C,MAAM,KAAKC,UAAkB,KAAK,SAAS,GAAG,GAAG,CAAC,CAAC;EACnD,IAAI,GAAG,SAAS,GAAG,KAAK,KAAK,GAAG,EAAE,IAAI,kBAAkB,EAAE,QAAQ;EAClE,OAAO,IAAI,KAAK,EAAE;CACpB;;CAGA,SAAS,GAAc,GAAW,SAA8B;EAC9D,OAAO,OAAO,UAAU,KAAK,IAAI,GAAG,CAAC,SAAS,KAAK,KAAK,OAAO,CAAC;CAClE;CAEA,IAAI,GAAc,GAAuC;EACvD,IAAI,CAACD,WAAgB,CAAC,GAAG,OAAO,CAAC;EACjC,OAAOC,UAAkB,KAAK,SAAS,GAAG,GAAG,CAAC,CAAC;CACjD;CAEA,KAAK,GAA2D;EAC9D,OAAO,OAAO,MAAM,GAAG;GACrB,cAAc,CAAC;GACf,SAAS,SACP,OAAO,UAAUE,KAAa,KAAK,SAAS,IAAI,SAC9C,KAAK,KAAK,GAAG,KAAK,IAAI,+BAA+B,CACvD;EACJ,CAAC;CACH;CAEA,MAAM,GAAsB;EAC1B,IAAID,YAAiB,CAAC,GAAG,OAAO,EAAE;EAClC,IAAIE,YAAiB,CAAC,GAAG,OAAO,KAAK,EAAE;EACvC,OAAO,KAAK,KAAK,GAAG,EAAE,IAAI,mBAAmB;CAC/C;CAEA,IAAI,GAA6B,MAAsB;EACrD,MAAM,IAAI,OAAO,eAAe,CAAC;EACjC,IAAI,CAACF,YAAiB,CAAC,GAAG,OAAO,KAAK,KAAK,uBAAuB,MAAM;EACxE,OAAO,EAAE;CACX;CAEA,IAAI,GAA6B,MAAsB;EACrD,MAAM,IAAI,OAAO,eAAe,CAAC;EACjC,IAAI,CAACG,UAAe,CAAC,GAAG,OAAO,KAAK,KAAK,0BAA0B,MAAM;EACzE,OAAO,EAAE;CACX;CAEA,IAAI,GAA6B,MAAsB;EACrD,MAAM,IAAI,OAAO,KAAK,IAAI,GAAG,IAAI,CAAC;EAClC,IAAI,OAAO,MAAM,CAAC,GAAG,KAAK,KAAK,yBAAyB,MAAM;EAC9D,OAAO;CACT;CAEA,KAAK,GAAsC;EACzC,OAAO,OAAO,OAAO,IAAI,MAAMA,UAAe,CAAC,MAAM,EAAE,UAAU,UAAU,EAAE,UAAU,IAAI;CAC7F;CAEA,YAAY,GAAiC;EAC3C,IAAIH,YAAiB,CAAC,GAAG,OAAO,EAAE;EAClC,IAAIG,UAAe,CAAC,GAAG;GACrB,IAAI,EAAE,aAAa,IAAI,OAAO;IAAE,OAAO,EAAE;IAAO,UAAU,EAAE;GAAS;GACrE,IAAI,EAAE,SAAS,UAAU,GAAG,IAAI,SAAS,OAAO,EAAE,OAAO,EAAE,MAAM;GACjE,OAAO;IAAE,OAAO,EAAE;IAAO,MAAM,EAAE,SAAS;GAAM;EAClD;EACA,OAAO,KAAK,KAAK,GAAG,EAAE,IAAI,0BAA0B;CACtD;CAEA,YAAY,GAA8D;EACxE,OAAO,OAAO,IAAI,KAAK,IAAI,GAAG,YAAY,IAAI,MAC5C,KAAK,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO;GACpC,MAAM;GACN,WAAW,KAAK,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG,cAAc;GAC5D,QAAQ,KAAK,YAAY,KAAK,SAAS,GAAG,UAAU,8BAA8B,CAAC;EACrF,EAAE,CACJ;CACF;CAEA,KAAK,GAAc,KAAiB;EAClC,MAAM,OAAO,KAAK,UAAU,GAAG,SAAS;EACxC,MAAM,SAAS,KAAK,YAAY,CAAC;EACjC,IAAI,OAAO,OAAO,IAAI,GAAG,IAAI,UAAU,KAAK;EAC5C,IAAI,OAAO,OAAO,MAAM,GAAG,IAAI,cAAc,OAAO;CACtD;;CAGA,gBAAgB,GAAoC;EAClD,MAAM,QAAQ,KAAK,MAAM,CAAC;EAC1B,IAAI,MAAM,SAAS,qCAAgB,KAAK,IAAI,qBAAqB,KAAK,GAAG,OAAO,KAAK,MAAM,CAAC;EAC5F,OAAO,KAAK,UAAU,CAAC;CACzB;CAEA,UAAU,GAA+B;EACvC,MAAM,QAAQ,KAAK,MAAM,CAAC;EAC1B,IAAI,MAAM,SAAS,mCAAc,KAAK,MAAM,SAAS,oCAAe,GAElE,OAAO;GACL,MAFW,MAAM,SAAS,mCAAc,IAAI,YAAY;GAGxD,YAAY,KAAK,KAAK,KAAK,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,MAAM,KAAK,gBAAgB,CAAC,CAAC;EACrF;EAEF,IAAI,MAAM,SAAS,oCAAe,GAChC,OAAO;GACL,MAAM;GACN,WAAW,KAAK,gBACd,KAAK,SAAS,GAAG,aAAa,+BAA+B,CAC/D;EACF;EACF,IAAI,MAAM,SAAS,yCAAoB,GAAG,OAAO,EAAE,MAAM,gBAAgB;EACzE,IAAI,MAAM,SAAS,0CAAqB,GAAG,OAAO,KAAK,eAAe,CAAC;EACvE,IAAI,MAAM,SAAS,iCAAY,GAAG,OAAO,KAAK,MAAM,CAAC;EACrD,OAAO,KAAK,KAAK,GAAG,EAAE,IAAI,2BAA2B;CACvD;CAEA,eAAe,GAAoC;EACjD,MAAM,KAAoC,EAAE,MAAM,iBAAiB;EACnE,MAAM,OAAO,KAAK,IAAI,GAAG,UAAU;EACnC,IAAI,OAAO,OAAO,IAAI,GAAG;GACvB,MAAM,IAAI,KAAK,IAAI,MAAM,aAAa,CAAC,CAAC,MAAM,EAAS;GACvD,IAAI,MAAM,SAAS,MAAM,WAAW,MAAM,aAAa,MAAM,cAC3D,KAAK,KAAK,qBAAqB,KAAK,MAAM,KAAK;GACjD,GAAG,WAAW;EAChB;EACA,MAAM,KAAK,KAAK,IAAI,GAAG,UAAU;EACjC,IAAI,OAAO,OAAO,EAAE,GAAG,GAAG,WAAW,KAAK,IAAI,IAAI,aAAa;EAC/D,kBAAkB,SAAS,MAAM;GAC/B,MAAM,IAAI,KAAK,IAAI,GAAG,CAAC;GACvB,IAAI,OAAO,OAAO,CAAC,GAAG,GAAG,KAAK,KAAK,IAAI,GAAG,MAAM,GAAG;EACrD,CAAC;EACD,MAAM,UAAU,KAAK,IAAI,GAAG,SAAS;EACrC,IAAI,OAAO,OAAO,OAAO,GAAG,GAAG,UAAU,KAAK,IAAI,SAAS,YAAY;EACvE,MAAM,QAAQ,KAAK,IAAI,GAAG,OAAO;EACjC,IAAI,OAAO,OAAO,KAAK,GAAG,GAAG,QAAQ,KAAK,IAAI,OAAO,UAAU;EAC/D,MAAM,SAAS,KAAK,IAAI,GAAG,QAAQ;EACnC,IAAI,OAAO,OAAO,MAAM,GAAG,GAAG,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,cAAc,CAAC,CAAC;EACzF,KAAK,KAAK,GAAG,EAAE;EACf,OAAO;CACT;CAEA,KAAK,GAAuC;EAC1C,IAAI,KAAK,QAAQ,GAAG,UAAU,GAAG,OAAO,EAAE,MAAM,WAAW;EAC3D,OAAOH,YAAiB,CAAC,IAAI,EAAE,QAAQ,KAAK,IAAI,OAAO,KAAK,CAAC,GAAG,SAAS;CAC3E;CAEA,cAAc,GAAmC;EAC/C,IAAIG,UAAe,CAAC,GAAG,OAAO,KAAK,YAAY,CAAC;EAChD,MAAM,QAAQ,IAAI,UAChB,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,MAAM,EAAS,CAAC,IAC1C,MAAM,eAAe,IAAI,eAAe,CAAC,CAC5C;EACA,IAAI,OAAO,OAAO,KAAK,KAAKH,YAAiB,CAAC,GAAG,OAAO,KAAK,YAAY,CAAC;EAC1E,MAAM,IAAI,MAAM;EAChB,MAAM,aAAa,KAAK,KAAK,KAAK,SAAS,GAAG,QAAQ,GAAG,EAAE,iBAAiB,CAAC;EAC7E,MAAM,mBACJ,KAAK,KAAK,KAAK,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,MACvCG,UAAe,CAAC,KAAKH,YAAiB,CAAC,IACnC,EAAE,QACF;GACE,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,oCAAM,CAAU,MAAM,EAAS;GAC1D,MAAM,KAAK,IAAI,KAAK,IAAI,GAAG,MAAM,GAAG,SAAS;EAC/C,CACN;EAEF,MAAM,WAAW,UACf,OAAO,UAAU,oBAAoB,KAAK,SACxC,KAAK,KAAK,GAAG,EAAE,IAAI,wBAAwB,GAAG,CAChD;EACF,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,KACpB,MAAM,eAAoC,GAC1C,MAAM,KAAK,MAAM,GAAG,WAAW,eAAe,cAAc,IAAI,SAC9D,QAAQ;GAAE,MAAM;GAAM,MAAM,KAAK;EAAE,CAAC,CACtC,GACA,MAAM,KAAK,MAAM,GAAG,gBAAgB,oBAAoB,mBAAmB,IAAI,SAC7E,QAAQ;GAAE,MAAM;GAAM,MAAM,KAAK;GAAG,YAAY,WAAW;EAAE,CAAC,CAChE,GACA,MAAM,KAAK,mBAAmB;GAC5B,MAAM;GACN,aAAa,KAAK,IAAI,KAAK,IAAI,GAAG,aAAa,GAAG,gBAAgB;EACpE,EAAE,GACF,MAAM,QAAQ,SAAS,KAAK,KAAK,gCAAgC,MAAM,CAAC,CAC1E;CACF;CAEA,MAAM,GAA2B;EAC/B,MAAM,QAA8B,EAAE,MAAM,QAAQ;EACpD,MAAM,MAAM,KAAK,IAAI,GAAG,SAAS;EACjC,IAAI,OAAO,OAAO,GAAG,GAAG,MAAM,UAAU,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,MAAM,KAAK,gBAAgB,CAAC,CAAC;EACzF,MAAM,SAAS,KAAK,IAAI,GAAG,QAAQ;EACnC,IAAI,OAAO,OAAO,MAAM,GAAG,MAAM,SAAS,KAAK,KAAK,MAAM;EAC1D,MAAM,QAAQ,KAAK,IAAI,GAAG,OAAO;EACjC,IAAI,IAAI,wBAAwB,KAAK,GACnC,MAAM,QAAQ,IAAI,KAChB,MAAM,KAAK,MAAM,KAAK,IAAI,OAAO,KAAK,CAAC,GAAG,UAAU,CAAC,GACrD,MAAM,MACR;EACF,MAAM,OAAO,KAAK,IAAI,GAAG,YAAY;EACrC,IAAI,OAAO,OAAO,IAAI,GAAG,MAAM,aAAa,KAAK,WAAW,KAAK,OAAO,IAAI;EAC5E,KAAK,KAAK,GAAG,KAAK;EAClB,OAAO;CACT;;;;;;CAOA,WAAW,GAAc,gBAAgB,OAA8B;EACrE,MAAM,QAAQ,KAAK,MAAM,CAAC;EAC1B,MAAM,WAAWA,YAAiB,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI;EACvD,IAAI,UAAU;GACZ,MAAM,QAAQ,KAAK,MAAM,CAAC;GAC1B,IAAI,eAAe,IAAI,KAAK,WAAW,KAAK,KAAK,IAAI,qBAAqB,KAAK,GAC7E,OAAO;GACT,IAAI,CAAC,iBAAiB,eAAe,IAAI,KAAK,iBAAiB,EAAE,GAAG,GAAG,OAAO;GAC9E,eAAe,IAAI,KAAK,WAAW,KAAK;EAC1C;EACA,IAAI;EACJ,IAAI,MAAM,SAAS,4CAAuB,GAAG;GAC3C,MAAM,KAAsC;IAC1C,MAAM;IACN,WAAW,KAAK,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG,cAAc;GAC9D;GACA,MAAM,UAAU,KAAK,IAAI,GAAG,SAAS;GACrC,IAAI,OAAO,OAAO,OAAO,GAAG,GAAG,UAAU,KAAK,KAAK,OAAO;GAC1D,MAAM,KAAK,KAAK,IAAI,GAAG,WAAW;GAClC,IAAI,OAAO,OAAO,EAAE,GAAG,GAAG,YAAY,KAAK,gBAAgB,GAAG,KAAK;GACnE,KAAK;EACP,OAAO,IAAI,MAAM,SAAS,kCAAa,KAAK,MAAM,SAAS,iCAAY,GACrE,KAAK;GACH,MAAM,MAAM,SAAS,kCAAa,IAAI,WAAW;GACjD,aAAa,KAAK,KAAK,KAAK,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,KAAK,WAAW,CAAC,CAAC;EAClF;OACK,OAAO,KAAK,KAAK,GAAG,EAAE,IAAI,4BAA4B;EAC7D,MAAM,MAAM,KAAK,IAAI,GAAG,KAAK;EAC7B,IAAI,OAAO,OAAO,GAAG,GAAG,GAAG,MAAM,KAAK,IAAI,KAAK,QAAQ;EACvD,MAAM,MAAM,KAAK,IAAI,GAAG,KAAK;EAC7B,IAAI,OAAO,OAAO,GAAG,GAAG,GAAG,MAAM,KAAK,IAAI,KAAK,QAAQ;EACvD,KAAK,KAAK,GAAG,EAAE;EAEf,OAAO,WAAW;GAAE,IAAI,KAAK,MAAM,CAAC;GAAG,GAAG;EAAG,IAAI;CACnD;CAEA,SAAuB;EACrB,MAAM,QAAQI,MAAc,KAAK,SAAS;GAAE,WAAW;GAAS,QAAQ,GAAG,QAAQ;EAAE,CAAC;EACtF,MAAM,OAAO,OAAO,UAClB,OAAO,OAAO,IAAI,KAAK,KAAK,SAAS,MAAM,WAAW,CAAC,SACjD,KAAK,KAAK,yCAAyC,MAAM,QAAQ,CACzE,CAAC,CAAC;EACF,MAAM,SAAgC,EAAE,MAAM,SAAS;EACvD,MAAM,UAAU,KAAK,IAAI,MAAM,SAAS;EACxC,IAAI,OAAO,OAAO,OAAO,GACvB,OAAO,UAAU,KAAK,KAAK,OAAO,CAAC,CAAC,KAAK,MAAM,KAAK,IAAI,OAAO,KAAK,CAAC,GAAG,YAAY,CAAC;EACvF,MAAM,YAAY,KAAK,UAAU,MAAM,WAAW;EAClD,IAAI,OAAO,OAAO,SAAS,GAAG,OAAO,YAAY,UAAU;EAC3D,MAAM,QAAQ,KAAK,IAAI,MAAM,OAAO;EACpC,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,QAAQ,KAAK,gBAAgB,MAAM,KAAK;EACzE,MAAM,SAAS,KAAK,IAAI,MAAM,QAAQ;EACtC,IAAI,OAAO,OAAO,MAAM,GACtB,OAAO,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM;GAC3C,MAAM,OAAiC;IACrC,MAAM;IACN,IAAI,KAAK,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,QAAQ;GAC7B;GACA,MAAM,WAAW,KAAK,IAAI,GAAG,UAAU;GACvC,IAAI,OAAO,OAAO,QAAQ,KAAK,KAAK,KAAK,QAAQ,GAAG,KAAK,WAAW;GACpE,MAAM,YAAY,KAAK,IAAI,GAAG,WAAW;GACzC,IAAI,OAAO,OAAO,SAAS,GACzB,KAAK,YAAY,KAAK,KAAK,SAAS,CAAC,CAAC,KAAK,MAAM,KAAK,gBAAgB,CAAC,CAAC;GAC1E,KAAK,YAAY,KAAK,gBACpB,KAAK,SAAS,GAAG,aAAa,GAAG,EAAE,IAAI,qBAAqB,CAC9D;GACA,OAAO;EACT,CAAC;EAEH,OAAO;CACT;CAEA,UAAU,GAAc,GAAuD;EAC7E,OAAO,OAAO,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,MACjC,KAAK,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM;GACnC,MAAM,MAA6B;IACjC,MAAM;IACN,MAAM,KAAK,IAAI,KAAK,IAAI,GAAG,MAAM,GAAG,SAAS;GAC/C;GACA,MAAM,OAAO,KAAK,IAAI,GAAG,MAAM;GAC/B,IAAI,OAAO,OAAO,IAAI,GAAG,IAAI,OAAO,KAAK,IAAI,MAAM,SAAS;GAC5D,OAAO;EACT,CAAC,CACH;CACF;AACF;;;;;;;;AASA,MAAa,eAAe,YAC1B,OAAO,IAAI;CACT,WAAW,IAAI,OAAO,OAAO,CAAC,CAAC,OAAO;CACtC,QAAQ,MACN,IAAI,WAAW,EACb,SACE,UAAU,YAAY,GAAG,SAAS,KAAK,UAAU,SAAS,EAAE,OAAO,IAC/D,EAAE,UACF,OAAO,CAAC,EAChB,CAAC;AACL,CAAC;AAMH,MAAM,aAAa,UACjB,MAAM,WAAW,IAAI,IAAIC,UAAe,MAAM,MAAM,CAAC,CAAC,IAAIT,UAAe,KAAK;AAEhF,MAAM,kBAAkB,MAAcU,QAAa,OAAO,CAAC,GAAGV,UAAe,GAAG,IAAI,QAAQ,CAAC;AAE7F,MAAM,kBAAkB,MACtB,OAAO,UAAU,CAAC,IACd,eAAe,CAAC,IAChBU,QAAa,OAAO,CAAC,GAAGV,UAAe,GAAG,IAAI,QAAQ,CAAC;AAE7D,MAAM,kBAAkB,MAAeU,QAAa,OAAO,CAAC,GAAGV,UAAe,GAAG,IAAI,QAAQ,CAAC;AAE9F,MAAM,mBAAmB,MACvB,UAAU,SAAS,CAAC,IAChBA,UAAe,CAAC,IAChB,EAAE,aAAa,KAAA,IACbU,QAAa,EAAE,OAAO,EAAE,QAAQ,IAChC,EAAE,SAAS,KAAA,IACTA,QAAa,EAAE,OAAOV,UAAe,EAAE,IAAI,CAAC,IAC5CU,QAAa,EAAE,KAAK;;;;;;;;AAS9B,MAAa,WAAW,WAAmD;CACzE,MAAM,QAA0B,CAAC;CACjC,MAAM,OAAO,GAAiB,GAAmB,MAC/C,MAAM,KAAKC,KAAU,GAAG,GAAG,CAAC,CAAC;CAC/B,MAAM,QAAQ,UAAmD;EAC/D,MAAM,QAAQ,MAAM,UAAUF,UAAe,CAAC;EAC9C,IAAI,IAAI,OAAO,KAAK,CAAC,CAAC,SAAS,CAAC,MAAM,OAAO,MAAM;GACjD,IAAI,MAAM,UAAU,IAAI;GACxB,IAAI,MAAM,SAAS,MAAM,IAAI,MAAM,MAAM;EAC3C,CAAC;EACD,OAAO,OAAO,UAAU,IAAI,KAAK,KAAK,SAAsB,MAAM;CACpE;CACA,MAAM,QACJ,GACA,MACG;EACH,IAAI,EAAE,YAAY,KAAA,GAAW,IAAI,GAAG,GAAG,SAAS,GAAG,QAAQ,EAAE,OAAO,CAAC;EACrE,IAAI,EAAE,gBAAgB,KAAA,GACpB,IACE,GACA,GAAG,YAAY,GACf,KACE,EAAE,YAAY,KAAK,MAAM;GACvB,MAAM,IAAIA,UAAe;GACzB,IAAI,GAAG,SAAS,GAAG,YAAY,CAAC;GAChC,IAAI,GAAG,GAAG,WAAW,GAAGT,UAAe,EAAE,SAAS,CAAC;GACnD,IAAI,GAAG,GAAG,QAAQ,GAAG,gBAAgB,EAAE,MAAM,CAAC;GAC9C,OAAO;EACT,CAAC,CACH,CACF;CACJ;CACA,MAAM,WAAW,SACf,KACE,KAAK,KAAK,MAAM;EACd,MAAM,IAAIS,UAAe;EACzB,IAAI,GAAG,SAAS,GAAG,QAAQ,CAAC;EAC5B,IAAI,GAAG,GAAG,MAAM,GAAGT,UAAe,EAAE,IAAI,CAAC;EACzC,IAAI,EAAE,SAAS,KAAA,GAAW,IAAI,GAAG,GAAG,MAAM,GAAGU,QAAa,EAAE,IAAI,CAAC;EACjE,OAAO;CACT,CAAC,CACH;CACF,MAAM,QAAQ,GAA4B,QAA8B;EACtE,IAAI,CAAC,UAAU,SAAS,CAAC,GAAG;GAC1B,MAAM,IAAID,UAAe;GACzB,IAAI,GAAG,SAAS,GAAG,UAAU,CAAC;GAC9B,OAAO;EACT;EACA,OAAO,MAAMC,QAAa,GAAGV,UAAe,GAAG,IAAI,OAAO,CAAC,IAAIU,QAAa,CAAC;CAC/E;CACA,MAAM,iBAAiB,MAAwC;EAC7D,IAAI,UAAU,SAAS,CAAC,KAAK,EAAE,UAAU,MAAM,WAAW,GAExD,OAAO,gBAAgB,CAAC;EAC1B,MAAM,IAAID,UAAe;EACzB,IAAI,GAAG,SAAS,GAAG,EAAE,IAAI,CAAC;EAC1B,MAAM,MAAM,CAAC,CAAC,CAAC,KACb,MAAM,cAAc,MAAM,CAAC,CAAC,aAAa,WACvC,IAAI,GAAG,GAAG,aAAa,GAAGC,QAAa,OAAO,WAAW,CAAC,CAC5D,GACA,MAAM,cAAc,MAAM,CAAC,CAAC,WAAW,eAAe,iBAAiB,WACrE,IAAI,GAAG,GAAG,MAAM,GAAG,KAAK,OAAO,MAAM,KAAK,CAAC,CAC7C,GACA,MAAM,QAAQ,WAAW;GACvB,IAAI,GAAG,GAAG,MAAM,GAAG,KAAK,OAAO,MAAM,KAAK,CAAC;GAC3C,MAAM,WAAW,OAAO,KAAK,QAAQ,SAAS,EAAE;GAChD,IACE,GACA,GAAG,WAAW,GACd,KACE,IAAI,IAAI,OAAO,aAAa,MAAM;IAChC,IAAI,UAAU,SAAS,CAAC,GACtB,OAAO,OAAO,SAAS,iBAAiBV,UAAe,CAAC,IAAIU,QAAa,CAAC;IAC5E,MAAM,IAAID,UAAe;IACzB,IAAI,GAAG,SAAS,GAAG,QAAQ,CAAC;IAC5B,IAAI,GAAG,GAAG,MAAM,GAAGC,QAAa,EAAE,IAAI,CAAC;IACvC,OAAO;GACT,CAAC,CACH,CACF;EACF,CAAC,CACH;EACA,OAAO;CACT;CACA,MAAM,aAAa,GAAyB,YAAwC;EAClF,IAAI,UAAU,SAAS,CAAC,GAAG,OAAO,UAAU,CAAC;EAC7C,MAAM,IAAI,WAAWD,UAAe;EACpC,IAAI,GAAG,SAAS,GAAG,EAAE,IAAI,CAAC;EAC1B,MAAM,MAAM,CAAC,CAAC,CAAC,KACb,MAAM,cAAc,MAAM,CAAC,CAAC,YAAY,YAAY,SAClD,IAAI,GAAG,GAAG,YAAY,GAAG,KAAK,KAAK,WAAW,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,CACzE,GACA,MAAM,cAAc,MAAM,CAAC,CAAC,aAAa,SACvC,IAAI,GAAG,GAAG,WAAW,GAAG,UAAU,KAAK,SAAS,CAAC,CACnD,GACA,MAAM,cAAc,MAAM,CAAC,CAAC,uBAAuB,KAAA,CAAS,GAC5D,MAAM,cAAc,MAAM,CAAC,CAAC,mBAAmB,SAAS;GACtD,IAAI,KAAK,aAAa,KAAA,GAAW,IAAI,GAAG,GAAG,UAAU,GAAG,GAAG,KAAK,QAAQ,CAAC;GACzE,IAAI,KAAK,aAAa,KAAA,GAAW,IAAI,GAAG,GAAG,UAAU,GAAGT,UAAe,KAAK,QAAQ,CAAC;GACrF,kBAAkB,SAAS,MAAM;IAC/B,MAAM,IAAI,KAAK;IACf,IAAI,MAAM,KAAA,GAAW,IAAI,GAAG,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;GACtD,CAAC;GACD,gBAAgB,SAAS,MAAM;IAC7B,MAAM,IAAI,KAAK;IACf,IAAI,MAAM,KAAA,GAAW,IAAI,GAAG,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;GACtD,CAAC;GACD,IAAI,KAAK,YAAY,KAAA,GAAW,IAAI,GAAG,GAAG,SAAS,GAAGU,QAAa,KAAK,OAAO,CAAC;GAChF,IAAI,KAAK,UAAU,KAAA,GAAW,IAAI,GAAG,GAAG,OAAO,GAAGA,QAAa,KAAK,KAAK,CAAC;GAC1E,IAAI,KAAK,WAAW,KAAA,GAAW,IAAI,GAAG,GAAG,QAAQ,GAAG,KAAK,KAAK,OAAO,IAAI,aAAa,CAAC,CAAC;GACxF,KAAK,GAAG,IAAI;EACd,CAAC,GACD,MAAM,cAAc,MAAM,CAAC,CAAC,UAAU,SAAS;GAC7C,IAAI,KAAK,YAAY,KAAA,GACnB,IAAI,GAAG,GAAG,SAAS,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC;GACnE,IAAI,KAAK,WAAW,KAAA,GAAW,IAAI,GAAG,GAAG,QAAQ,GAAG,eAAe,KAAK,MAAM,CAAC;GAC/E,KAAK,OAAO,SAAS,MAAM,IAAI,GAAG,GAAG,OAAO,GAAGV,UAAe,CAAC,CAAC,CAAC;GACjE,IAAI,KAAK,eAAe,KAAA,GAAW,IAAI,GAAG,GAAG,YAAY,GAAG,WAAW,KAAK,UAAU,CAAC;GACvF,KAAK,GAAG,IAAI;EACd,CAAC,GACD,MAAM,UACR;EACA,OAAO;CACT;CACA,MAAM,cAAc,MAA0C;EAC5D,IAAI,UAAU,SAAS,CAAC,GAAG,OAAO,UAAU,CAAC;EAC7C,MAAM,IAAI,EAAE,OAAO,KAAA,IAAY,UAAU,EAAE,EAAE,IAAIS,UAAe;EAChE,IAAI,GAAG,SAAS,GAAG,EAAE,IAAI,CAAC;EAC1B,IAAI,EAAE,SAAS,oBAAoB;GACjC,IAAI,EAAE,YAAY,KAAA,GAAW,IAAI,GAAG,GAAG,SAAS,GAAG,eAAe,EAAE,OAAO,CAAC;GAC5E,IAAI,GAAG,GAAG,WAAW,GAAGT,UAAe,EAAE,SAAS,CAAC;GACnD,IAAI,EAAE,cAAc,KAAA,GAAW,IAAI,GAAG,GAAG,WAAW,GAAG,UAAU,EAAE,SAAS,CAAC;EAC/E,OACE,IAAI,GAAG,GAAG,aAAa,GAAG,KAAK,EAAE,YAAY,IAAI,UAAU,CAAC,CAAC;EAE/D,IAAI,EAAE,QAAQ,KAAA,GAAW,IAAI,GAAG,GAAG,KAAK,GAAG,eAAe,EAAE,GAAG,CAAC;EAChE,IAAI,EAAE,QAAQ,KAAA,GAAW,IAAI,GAAG,GAAG,KAAK,GAAG,eAAe,EAAE,GAAG,CAAC;EAChE,KAAK,GAAG,CAAC;EACT,OAAO;CACT;CACA,MAAM,OAAOS,UAAe;CAC5B,IAAI,MAAM,SAAS,GAAG,QAAQ,CAAC;CAC/B,IAAI,OAAO,YAAY,KAAA,GACrB,IAAI,MAAM,GAAG,SAAS,GAAG,KAAK,OAAO,QAAQ,KAAK,MAAMT,UAAe,CAAC,CAAC,CAAC,CAAC;CAC7E,IAAI,OAAO,cAAc,KAAA,GAAW,IAAI,MAAM,GAAG,WAAW,GAAG,QAAQ,OAAO,SAAS,CAAC;CACxF,IAAI,OAAO,UAAU,KAAA,GAAW,IAAI,MAAM,GAAG,OAAO,GAAG,UAAU,OAAO,KAAK,CAAC;CAC9E,IAAI,OAAO,WAAW,KAAA,GAAW;EAC/B,MAAM,QAAQ,OAAO,OAAO,KAAK,MAAM;GACrC,MAAM,IAAI,UAAU,EAAE,EAAE;GACxB,IAAI,GAAG,SAAS,GAAG,WAAW,CAAC;GAC/B,IAAI,EAAE,aAAa,KAAA,GAAW,IAAI,GAAG,GAAG,UAAU,GAAG,eAAe,EAAE,QAAQ,CAAC;GAC/E,IAAI,EAAE,cAAc,KAAA,GAClB,IAAI,GAAG,GAAG,WAAW,GAAG,KAAK,EAAE,UAAU,KAAK,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC;GACpE,IAAI,GAAG,GAAG,WAAW,GAAG,UAAU,EAAE,SAAS,CAAC;GAC9C,OAAO;EACT,CAAC;EACD,IAAI,MAAM,GAAG,QAAQ,GAAG,KAAK,KAAK,CAAC;CACrC;CACA,OAAO;AACT;;;;;;;AAQA,MAAa,aAAa,WACxBY,aAAqB,QAAQ,MAAM,CAAC"}

package/dist/ShExR-CqONNNBz.d.mts

@@ -0,0 +1,40 @@
+import { _ as Quad } from "./Term-B_4ezyXq.mjs";
+import { n as Dataset } from "./Dataset-DS3ESOcO.mjs";
+import { i as ShExRError } from "./ShExError-BeYFD9rv.mjs";
+import { M as Schema } from "./ShExJ-C1u_wgyD.mjs";
+import * as Effect from "effect/Effect";
+declare namespace ShExR_d_exports {
+  export { SX, fromDataset, toDataset, toQuads };
+}
+/**
+ * The ShEx vocabulary namespace.
+ *
+ * @since 0.1.0
+ * @category constants
+ */
+declare const SX = "http://www.w3.org/ns/shex#";
+/**
+ * Reads the ShExR schema contained in a dataset (which must have exactly one
+ * node of type `sx:Schema`).
+ *
+ * @since 0.1.0
+ * @category reading
+ */
+declare const fromDataset: (dataset: Dataset) => Effect.Effect<Schema, ShExRError>;
+/**
+ * Writes a schema as ShExR quads (in the default graph). Blank nodes are
+ * generated for anonymous expressions.
+ *
+ * @since 0.1.0
+ * @category writing
+ */
+declare const toQuads: (schema: Schema) => ReadonlyArray<Quad>;
+/**
+ * Writes a schema as a ShExR dataset.
+ *
+ * @since 0.1.0
+ * @category writing
+ */
+declare const toDataset: (schema: Schema) => Dataset;
+export { toQuads as a, toDataset as i, ShExR_d_exports as n, fromDataset as r, SX as t };
+//# sourceMappingURL=ShExR-CqONNNBz.d.mts.map