@hawkeyexl/manni 4.11.0 → 4.12.1

package/dist/chunk-EFW7CAG4.js

@@ -1,387 +0,0 @@
-#!/usr/bin/env node
-import {
-  GraphError,
-  NS,
-  PREFIXES,
-  byCodeUnit
-} from "./chunk-JROBZ7JA.js";
-import {
-  packageRoot
-} from "./chunk-TIUTIOFB.js";
-import {
-  errorMessage
-} from "./chunk-G3T47CFV.js";
-
-// src/graph/core/load.ts
-import { existsSync, readFileSync } from "node:fs";
-import { Parser, Store } from "n3";
-var XSD_STRING = `${NS.xsd}string`;
-function loadGraph(ttlPath) {
-  if (!existsSync(ttlPath)) {
-    throw new GraphError(
-      `Graph not found: ${ttlPath} \u2014 run \`manni graph build\` first.`
-    );
-  }
-  return parseGraph(readFileSync(ttlPath, "utf8"), ttlPath);
-}
-function parseGraph(turtle, label) {
-  const parser = new Parser({ format: "text/turtle" });
-  let quads;
-  try {
-    quads = parser.parse(turtle);
-  } catch (e) {
-    throw new GraphError(
-      `Failed to parse ${label}: ${errorMessage(e)}`
-    );
-  }
-  return new Store(quads);
-}
-function storeToQuads(store) {
-  return store.getQuads(null, null, null, null).map((q) => {
-    const o = q.object;
-    let term;
-    if (o.termType === "Literal") {
-      const dt = o.datatype.value;
-      term = dt && dt !== XSD_STRING ? { kind: "literal", value: o.value, datatype: dt } : { kind: "literal", value: o.value };
-    } else {
-      term = { kind: "iri", value: o.value };
-    }
-    return { s: q.subject.value, p: q.predicate.value, o: term };
-  });
-}
-function expandTerm(input) {
-  const colon = input.indexOf(":");
-  if (colon > 0) {
-    const prefix = input.slice(0, colon);
-    const ns = NS[prefix];
-    if (ns) return `${ns}${input.slice(colon + 1)}`;
-  }
-  return input;
-}
-function compactIri(iri) {
-  for (const [prefix, ns] of PREFIXES) {
-    if (iri.startsWith(ns) && iri.length > ns.length) {
-      return `${prefix}:${iri.slice(ns.length)}`;
-    }
-  }
-  return iri;
-}
-
-// src/graph/core/pkg.ts
-import { join } from "node:path";
-function bundledShapesPath(moduleUrl) {
-  return join(packageRoot(moduleUrl), "shapes", "graph", "shapes-1.0.0.ttl");
-}
-
-// src/graph/core/shacl.ts
-import { readFileSync as readFileSync2 } from "node:fs";
-import { DataFactory, Parser as Parser2, Store as Store2 } from "n3";
-import SHACLValidator from "rdf-validate-shacl";
-var FAMILY_SEVERITY = {
-  violation: "error",
-  warning: "warning",
-  info: "notice"
-};
-function finding(shaclSeverity, rest) {
-  return { severity: FAMILY_SEVERITY[shaclSeverity], shaclSeverity, ...rest };
-}
-var SEVERITY_RANK = {
-  violation: 0,
-  warning: 1,
-  info: 2
-};
-function loadShapes(paths) {
-  const store = new Store2();
-  for (const path of paths) {
-    let text;
-    try {
-      text = readFileSync2(path, "utf8");
-    } catch {
-      throw new GraphError(`Shapes file not found: ${path}`);
-    }
-    try {
-      store.addQuads(new Parser2({ format: "text/turtle" }).parse(text));
-    } catch (e) {
-      throw new GraphError(
-        `Failed to parse shapes ${path}: ${errorMessage(e)}`
-      );
-    }
-  }
-  return store;
-}
-function blameDocs(store, focus) {
-  const pathPred = DataFactory.namedNode(`${NS.graph}path`);
-  const pathOf = (iri) => store.getQuads(DataFactory.namedNode(iri), pathPred, null, null)[0]?.object.value;
-  const found = /* @__PURE__ */ new Set();
-  const visited = /* @__PURE__ */ new Set();
-  const walk = (iri, depth) => {
-    if (visited.has(iri)) return;
-    visited.add(iri);
-    const own = pathOf(iri);
-    if (own !== void 0) {
-      found.add(own);
-      return;
-    }
-    const hash = iri.indexOf("#");
-    if (hash !== -1) {
-      const base = pathOf(iri.slice(0, hash));
-      if (base !== void 0) {
-        found.add(base);
-        return;
-      }
-    }
-    if (depth === 0) return;
-    for (const quad of store.getQuads(null, null, DataFactory.namedNode(iri), null)) {
-      if (quad.subject.termType === "NamedNode") {
-        walk(quad.subject.value, depth - 1);
-      }
-    }
-  };
-  walk(focus, 2);
-  return [...found].sort();
-}
-function broaderEdges(store) {
-  const edges = [];
-  for (const q of store.getQuads(
-    null,
-    DataFactory.namedNode(`${NS.skos}broader`),
-    null,
-    null
-  )) {
-    if (q.object.termType === "NamedNode") {
-      edges.push({ s: q.subject.value, o: q.object.value });
-    }
-  }
-  for (const q of store.getQuads(
-    null,
-    DataFactory.namedNode(`${NS.skos}narrower`),
-    null,
-    null
-  )) {
-    if (q.object.termType === "NamedNode") {
-      edges.push({ s: q.object.value, o: q.subject.value });
-    }
-  }
-  return edges;
-}
-function broaderCycles(store) {
-  const adjacency = /* @__PURE__ */ new Map();
-  const selfLoops = /* @__PURE__ */ new Set();
-  for (const { s, o } of broaderEdges(store)) {
-    if (s === o) selfLoops.add(s);
-    const list = adjacency.get(s);
-    if (list) list.push(o);
-    else adjacency.set(s, [o]);
-    if (!adjacency.has(o)) adjacency.set(o, []);
-  }
-  for (const list of adjacency.values()) list.sort();
-  const index = /* @__PURE__ */ new Map();
-  const lowlink = /* @__PURE__ */ new Map();
-  const onStack = /* @__PURE__ */ new Set();
-  const stack = [];
-  const components = [];
-  let counter = 0;
-  const numberOf = (map, node) => {
-    const value = map.get(node);
-    if (value === void 0) {
-      throw new GraphError(
-        `internal: ${node} was visited before it was numbered`
-      );
-    }
-    return value;
-  };
-  const nodes = [...adjacency.keys()].sort();
-  for (const root of nodes) {
-    if (index.has(root)) continue;
-    const frames = [[root, 0]];
-    for (let frame = frames.at(-1); frame !== void 0; frame = frames.at(-1)) {
-      const [node, childIdx] = frame;
-      if (childIdx === 0) {
-        index.set(node, counter);
-        lowlink.set(node, counter);
-        counter += 1;
-        stack.push(node);
-        onStack.add(node);
-      }
-      const children = adjacency.get(node) ?? [];
-      const child = children[childIdx];
-      if (child !== void 0) {
-        frame[1] += 1;
-        if (!index.has(child)) {
-          frames.push([child, 0]);
-        } else if (onStack.has(child)) {
-          lowlink.set(
-            node,
-            Math.min(numberOf(lowlink, node), numberOf(index, child))
-          );
-        }
-      } else {
-        if (lowlink.get(node) === index.get(node)) {
-          const component = [];
-          let member;
-          do {
-            member = stack.pop();
-            if (member === void 0) break;
-            onStack.delete(member);
-            component.push(member);
-          } while (member !== node);
-          if (component.length > 1 || selfLoops.has(node)) {
-            components.push(component.sort());
-          }
-        }
-        frames.pop();
-        const parent = frames.at(-1);
-        if (parent) {
-          lowlink.set(
-            parent[0],
-            Math.min(numberOf(lowlink, parent[0]), numberOf(lowlink, node))
-          );
-        }
-      }
-    }
-  }
-  return components.sort((a, b) => (a[0] ?? "") < (b[0] ?? "") ? -1 : 1);
-}
-function broaderClosure(edges, start) {
-  const adjacency = /* @__PURE__ */ new Map();
-  for (const { s, o } of edges) {
-    const list = adjacency.get(s);
-    if (list) list.push(o);
-    else adjacency.set(s, [o]);
-  }
-  const seen = /* @__PURE__ */ new Set();
-  const queue = [...adjacency.get(start) ?? []];
-  for (let node = queue.shift(); node !== void 0; node = queue.shift()) {
-    if (seen.has(node)) continue;
-    seen.add(node);
-    queue.push(...adjacency.get(node) ?? []);
-  }
-  return seen;
-}
-function relatedConflicts(store) {
-  const edges = broaderEdges(store);
-  const direct = /* @__PURE__ */ new Map();
-  for (const e of edges) {
-    const targets = direct.get(e.s);
-    if (targets) targets.add(e.o);
-    else direct.set(e.s, /* @__PURE__ */ new Set([e.o]));
-  }
-  const findings = [];
-  for (const q of store.getQuads(
-    null,
-    DataFactory.namedNode(`${NS.skos}related`),
-    null,
-    null
-  )) {
-    if (q.object.termType !== "NamedNode") continue;
-    const s = q.subject.value;
-    const o = q.object.value;
-    if (direct.get(s)?.has(o)) continue;
-    const conflict = broaderClosure(edges, s).has(o) || broaderClosure(edges, o).has(s);
-    if (!conflict) continue;
-    findings.push(
-      finding("violation", {
-        message: `skos:related conflicts with skos:broaderTransitive between ${compactIri(s)} and ${compactIri(o)} \u2014 a concept cannot be both related to and an ancestor/descendant of another`,
-        focusNode: s,
-        path: `${NS.skos}related`,
-        docs: blameDocs(store, s)
-      })
-    );
-  }
-  return findings;
-}
-function cycleFindings(store) {
-  return broaderCycles(store).map(
-    (members) => finding("violation", {
-      message: `skos:broader cycle through ${members.map((m) => compactIri(m)).join(
-        ", "
-      )} (${members.map((m) => m).join(" \u2192 ")}) \u2014 a concept cannot be its own ancestor`,
-      // `broaderCycles` returns only components of at least one member, so
-      // the first is there; `?? ""` says that without asserting it.
-      focusNode: members[0] ?? "",
-      path: `${NS.skos}broader`,
-      docs: [...new Set(members.flatMap((m) => blameDocs(store, m)))].sort()
-    })
-  );
-}
-var CURATED_FIELDS = /* @__PURE__ */ new Set(["sections", "revision-of", "derived-from"]);
-var GRAPH_FILL_FRAGMENT = "#prov.graph-fill.";
-function curatedFieldFindings(store) {
-  const filledField = `${NS.graph}filledField`;
-  const pathPred = DataFactory.namedNode(`${NS.graph}path`);
-  const findings = [];
-  for (const q of store.getQuads(null, DataFactory.namedNode(filledField), null, null)) {
-    if (q.object.termType !== "Literal") continue;
-    const field = q.object.value;
-    if (!CURATED_FIELDS.has(field)) continue;
-    const node = q.subject.value;
-    const at = node.indexOf(GRAPH_FILL_FRAGMENT);
-    const fieldAt = node.lastIndexOf(".field.");
-    if (at === -1 || fieldAt <= at) continue;
-    const activity = node.slice(0, fieldAt);
-    const model = node.slice(at + GRAPH_FILL_FRAGMENT.length, fieldAt);
-    const docIri = activity.slice(0, activity.indexOf("#"));
-    const path = store.getQuads(DataFactory.namedNode(docIri), pathPred, null, null)[0]?.object.value;
-    findings.push(
-      finding("violation", {
-        message: `meta-provenance attributes /graph/${field} to ${model} \u2014 ${field} is curated by hand, never filled by a machine`,
-        focusNode: activity,
-        path: filledField,
-        docs: path === void 0 ? blameDocs(store, activity) : [path]
-      })
-    );
-  }
-  return findings;
-}
-function severityOf(iri) {
-  if (iri === "http://www.w3.org/ns/shacl#Warning") return "warning";
-  if (iri === "http://www.w3.org/ns/shacl#Info") return "info";
-  return "violation";
-}
-async function validateGraph(store, shapesPaths) {
-  const shapes = loadShapes(shapesPaths);
-  const validator = new SHACLValidator(shapes);
-  let report;
-  try {
-    report = await validator.validate(store);
-  } catch (e) {
-    throw new GraphError(
-      `SHACL validation failed: ${errorMessage(e)}`
-    );
-  }
-  const findings = [];
-  for (const result of report.results) {
-    const focus = result.focusNode?.value ?? "";
-    const path = result.path?.value;
-    const messages = result.message.map((m) => m.value).filter((m) => m.length > 0);
-    const message = messages.length > 0 ? messages.join("; ") : `constraint violated${path ? ` on ${compactIri(path)}` : ""}`;
-    findings.push(
-      finding(severityOf(result.severity?.value), {
-        message,
-        focusNode: focus,
-        ...path !== void 0 ? { path } : {},
-        docs: blameDocs(store, focus)
-      })
-    );
-  }
-  findings.push(
-    ...cycleFindings(store),
-    ...relatedConflicts(store),
-    ...curatedFieldFindings(store)
-  );
-  findings.sort(
-    (a, b) => SEVERITY_RANK[a.shaclSeverity] - SEVERITY_RANK[b.shaclSeverity] || byCodeUnit(a.focusNode, b.focusNode) || byCodeUnit(a.path ?? "", b.path ?? "") || byCodeUnit(a.message, b.message)
-  );
-  return findings;
-}
-
-export {
-  loadGraph,
-  parseGraph,
-  storeToQuads,
-  expandTerm,
-  compactIri,
-  bundledShapesPath,
-  validateGraph
-};
-//# sourceMappingURL=chunk-EFW7CAG4.js.map

package/dist/chunk-EFW7CAG4.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/graph/core/load.ts","../src/graph/core/pkg.ts","../src/graph/core/shacl.ts"],"sourcesContent":["/** Load a built .ttl into an in-memory N3 store for query/stats. */\nimport { existsSync, readFileSync } from \"node:fs\";\nimport { Parser, Store } from \"n3\";\nimport { errorMessage } from \"../../shared/errors.js\";\nimport { GraphError } from \"../types.js\";\nimport type { Quad, Term } from \"./derive.js\";\nimport { NS, PREFIXES } from \"./vocab.js\";\n\nconst XSD_STRING = `${NS.xsd}string`;\n\nexport function loadGraph(ttlPath: string): Store {\n  if (!existsSync(ttlPath)) {\n    throw new GraphError(\n      `Graph not found: ${ttlPath} — run \\`manni graph build\\` first.`,\n    );\n  }\n  return parseGraph(readFileSync(ttlPath, \"utf8\"), ttlPath);\n}\n\n/** Turtle already in memory into a store; `label` names it in an error. */\nexport function parseGraph(turtle: string, label: string): Store {\n  const parser = new Parser({ format: \"text/turtle\" });\n  let quads;\n  try {\n    quads = parser.parse(turtle);\n  } catch (e) {\n    throw new GraphError(\n      `Failed to parse ${label}: ${errorMessage(e)}`,\n    );\n  }\n  return new Store(quads);\n}\n\n/**\n * Convert an in-memory N3 store back to dockg's internal quad shape — the\n * bridge from the Turtle-reading Node side to the platform-neutral emitters and\n * runtime. A redundant `xsd:string` datatype is dropped so the result matches\n * what the JSON-LD path produces.\n */\nexport function storeToQuads(store: Store): Quad[] {\n  return store.getQuads(null, null, null, null).map((q) => {\n    const o = q.object;\n    let term: Term;\n    if (o.termType === \"Literal\") {\n      const dt = o.datatype.value;\n      term =\n        dt && dt !== XSD_STRING\n          ? { kind: \"literal\", value: o.value, datatype: dt }\n          : { kind: \"literal\", value: o.value };\n    } else {\n      term = { kind: \"iri\", value: o.value };\n    }\n    return { s: q.subject.value, p: q.predicate.value, o: term };\n  });\n}\n\n/** Expand `dcterms:references`-style prefixed names to full IRIs; pass through the rest. */\nexport function expandTerm(input: string): string {\n  const colon = input.indexOf(\":\");\n  if (colon > 0) {\n    const prefix = input.slice(0, colon);\n    const ns = (NS as Record<string, string>)[prefix];\n    if (ns) return `${ns}${input.slice(colon + 1)}`;\n  }\n  return input;\n}\n\n/** Compact a full IRI back to a prefixed name when a known namespace matches. */\nexport function compactIri(iri: string): string {\n  for (const [prefix, ns] of PREFIXES) {\n    if (iri.startsWith(ns) && iri.length > ns.length) {\n      return `${prefix}:${iri.slice(ns.length)}`;\n    }\n  }\n  return iri;\n}\n","/**\n * The one asset that ships with the package and is read by path at runtime: the\n * SHACL shapes. They live under `shapes/graph/` at the package root, listed in\n * `files`, and are reached through the shared package-root walk, which holds\n * both in the source tree (`src/graph/core/`) and in the bundle (`dist/`).\n *\n * The frontmatter schema is no longer one of them. The `graph` page vocabulary\n * is proposal 0023's draft, imported by `src/graph/schema.ts` and inlined by the\n * build, so nothing under `schemas/` is read at run time and nothing under it\n * is published (proposal 0051 §4).\n */\nimport { join } from \"node:path\";\nimport { packageRoot } from \"../../shared/package-root.js\";\n\n/** Absolute path of the bundled SHACL shapes `manni graph check` defaults to. */\nexport function bundledShapesPath(moduleUrl: string): string {\n  return join(packageRoot(moduleUrl), \"shapes\", \"graph\", \"shapes-1.0.0.ttl\");\n}\n","/**\n * Graph-level validation: run the published SHACL shapes over a built graph,\n * plus the two SKOS integrity checks core SHACL cannot express (broader\n * cycles, related⨯broaderTransitive disjointness). Every finding carries the\n * doc paths responsible, so writers get file names instead of bare IRIs.\n */\nimport { readFileSync } from \"node:fs\";\nimport { DataFactory, Parser, Store } from \"n3\";\nimport SHACLValidator from \"rdf-validate-shacl\";\nimport type { Term } from \"@rdfjs/types\";\nimport { errorMessage } from \"../../shared/errors.js\";\nimport type { Severity } from \"../../shared/severity.js\";\nimport { GraphError } from \"../types.js\";\nimport { compactIri } from \"./load.js\";\nimport { byCodeUnit } from \"./sort.js\";\nimport { NS } from \"./vocab.js\";\n\n/** SHACL's own scale, as `sh:severity` spells it. */\nexport type ShaclSeverity = \"violation\" | \"warning\" | \"info\";\n\nexport interface CheckFinding {\n  /**\n   * The family's scale (`src/shared/severity.ts`). SHACL's three levels map\n   * onto it one for one — violation to error, warning to warning, info to\n   * notice — and the source value stays in {@link shaclSeverity}, the way\n   * a11y keeps axe's `impact` (proposal 0035, stress test 10).\n   */\n  severity: Severity;\n  /** SHACL's own word for the same finding, kept for lookup. */\n  shaclSeverity: ShaclSeverity;\n  /** Human-readable description (IRIs compacted to prefixed names). */\n  message: string;\n  /** IRI of the node the finding is about. */\n  focusNode: string;\n  /** Predicate IRI involved, when the finding concerns one. */\n  path?: string;\n  /** graph:path of the docs responsible, sorted (empty when untraceable). */\n  docs: string[];\n}\n\n/**\n * SHACL's scale onto the family's. The one place the translation happens, so\n * no caller re-derives it: a finding is built through {@link finding} and\n * carries both words from there on.\n */\nconst FAMILY_SEVERITY: Record<ShaclSeverity, Severity> = {\n  violation: \"error\",\n  warning: \"warning\",\n  info: \"notice\",\n};\n\n/** A finding at `shaclSeverity`, carrying the family severity it maps to. */\nfunction finding(\n  shaclSeverity: ShaclSeverity,\n  rest: Omit<CheckFinding, \"severity\" | \"shaclSeverity\">,\n): CheckFinding {\n  return { severity: FAMILY_SEVERITY[shaclSeverity], shaclSeverity, ...rest };\n}\n\nconst SEVERITY_RANK: Record<ShaclSeverity, number> = {\n  violation: 0,\n  warning: 1,\n  info: 2,\n};\n\n/** Parse one or more shapes .ttl files into a single store. */\nexport function loadShapes(paths: string[]): Store {\n  const store = new Store();\n  for (const path of paths) {\n    let text: string;\n    try {\n      text = readFileSync(path, \"utf8\");\n    } catch {\n      throw new GraphError(`Shapes file not found: ${path}`);\n    }\n    try {\n      store.addQuads(new Parser({ format: \"text/turtle\" }).parse(text));\n    } catch (e) {\n      throw new GraphError(\n        `Failed to parse shapes ${path}: ${errorMessage(e)}`,\n      );\n    }\n  }\n  return store;\n}\n\n/**\n * Trace a focus node back to the doc(s) responsible: its own graph:path,\n * the path of its fragment-stripped base (sections, provenance fragments),\n * or — for shared nodes like concepts and agents — the paths of docs that\n * point at it, up to two hops back. Sorted and deduplicated.\n */\nexport function blameDocs(store: Store, focus: string): string[] {\n  const pathPred = DataFactory.namedNode(`${NS.graph}path`);\n  const pathOf = (iri: string): string | undefined =>\n    store.getQuads(DataFactory.namedNode(iri), pathPred, null, null)[0]?.object.value;\n\n  const found = new Set<string>();\n  const visited = new Set<string>();\n\n  const walk = (iri: string, depth: number): void => {\n    if (visited.has(iri)) return;\n    visited.add(iri);\n\n    const own = pathOf(iri);\n    if (own !== undefined) {\n      found.add(own);\n      return;\n    }\n    const hash = iri.indexOf(\"#\");\n    if (hash !== -1) {\n      const base = pathOf(iri.slice(0, hash));\n      if (base !== undefined) {\n        found.add(base);\n        return;\n      }\n    }\n    if (depth === 0) return;\n    for (const quad of store.getQuads(null, null, DataFactory.namedNode(iri), null)) {\n      if (quad.subject.termType === \"NamedNode\") {\n        walk(quad.subject.value, depth - 1);\n      }\n    }\n  };\n\n  walk(focus, 2);\n  return [...found].sort();\n}\n\ninterface Edge {\n  s: string;\n  o: string;\n}\n\n/** skos:broader edges, folding narrower in as its inverse. */\nfunction broaderEdges(store: Store): Edge[] {\n  const edges: Edge[] = [];\n  for (const q of store.getQuads(\n    null,\n    DataFactory.namedNode(`${NS.skos}broader`),\n    null,\n    null,\n  )) {\n    if (q.object.termType === \"NamedNode\") {\n      edges.push({ s: q.subject.value, o: q.object.value });\n    }\n  }\n  for (const q of store.getQuads(\n    null,\n    DataFactory.namedNode(`${NS.skos}narrower`),\n    null,\n    null,\n  )) {\n    if (q.object.termType === \"NamedNode\") {\n      edges.push({ s: q.object.value, o: q.subject.value });\n    }\n  }\n  return edges;\n}\n\n/**\n * Strongly connected components of the broader graph (iterative Tarjan —\n * no recursion, taxonomy depth can't blow the stack). Returns only real\n * cycles: components of 2+ nodes, or single nodes with a self-loop.\n */\nexport function broaderCycles(store: Store): string[][] {\n  const adjacency = new Map<string, string[]>();\n  const selfLoops = new Set<string>();\n  for (const { s, o } of broaderEdges(store)) {\n    if (s === o) selfLoops.add(s);\n    const list = adjacency.get(s);\n    if (list) list.push(o);\n    else adjacency.set(s, [o]);\n    if (!adjacency.has(o)) adjacency.set(o, []);\n  }\n  for (const list of adjacency.values()) list.sort();\n\n  const index = new Map<string, number>();\n  const lowlink = new Map<string, number>();\n  const onStack = new Set<string>();\n  const stack: string[] = [];\n  const components: string[][] = [];\n  let counter = 0;\n\n  /**\n   * A node's Tarjan number. Every node is stamped into both maps on the frame\n   * where `childIdx === 0`, before any edge out of it is followed, so a miss\n   * here is not a missing value but a broken traversal — which is worth\n   * saying rather than reading as `NaN` three lines later.\n   */\n  const numberOf = (map: Map<string, number>, node: string): number => {\n    const value = map.get(node);\n    if (value === undefined) {\n      throw new GraphError(\n        `internal: ${node} was visited before it was numbered`,\n      );\n    }\n    return value;\n  };\n\n  const nodes = [...adjacency.keys()].sort();\n  for (const root of nodes) {\n    if (index.has(root)) continue;\n    // Explicit work stack of [node, next-child-index] frames. The loop reads\n    // the top frame as its condition, so the frame is proven present by the\n    // same test that keeps the loop running.\n    const frames: Array<[string, number]> = [[root, 0]];\n    for (let frame = frames.at(-1); frame !== undefined; frame = frames.at(-1)) {\n      const [node, childIdx] = frame;\n      if (childIdx === 0) {\n        index.set(node, counter);\n        lowlink.set(node, counter);\n        counter += 1;\n        stack.push(node);\n        onStack.add(node);\n      }\n      const children = adjacency.get(node) ?? [];\n      // Reading the child *is* the bounds check: `adjacency` holds dense\n      // arrays of strings, so a hit is a child and a miss is the end of them.\n      const child = children[childIdx];\n      if (child !== undefined) {\n        frame[1] += 1;\n        if (!index.has(child)) {\n          frames.push([child, 0]);\n        } else if (onStack.has(child)) {\n          lowlink.set(\n            node,\n            Math.min(numberOf(lowlink, node), numberOf(index, child)),\n          );\n        }\n      } else {\n        if (lowlink.get(node) === index.get(node)) {\n          const component: string[] = [];\n          let member: string | undefined;\n          do {\n            member = stack.pop();\n            if (member === undefined) break;\n            onStack.delete(member);\n            component.push(member);\n          } while (member !== node);\n          if (component.length > 1 || selfLoops.has(node)) {\n            components.push(component.sort());\n          }\n        }\n        frames.pop();\n        const parent = frames.at(-1);\n        if (parent) {\n          lowlink.set(\n            parent[0],\n            Math.min(numberOf(lowlink, parent[0]), numberOf(lowlink, node)),\n          );\n        }\n      }\n    }\n  }\n  // A component always has a member — it is built by popping at least one —\n  // so `?? \"\"` is a spelling of that, not a fallback anyone can reach.\n  return components.sort((a, b) => ((a[0] ?? \"\") < (b[0] ?? \"\") ? -1 : 1));\n}\n\n/** Forward reachability over broader edges from each given start node. */\nfunction broaderClosure(edges: Edge[], start: string): Set<string> {\n  const adjacency = new Map<string, string[]>();\n  for (const { s, o } of edges) {\n    const list = adjacency.get(s);\n    if (list) list.push(o);\n    else adjacency.set(s, [o]);\n  }\n  const seen = new Set<string>();\n  const queue = [...(adjacency.get(start) ?? [])];\n  // Shifting *is* the emptiness test, so the queue is never read past its end.\n  for (let node = queue.shift(); node !== undefined; node = queue.shift()) {\n    if (seen.has(node)) continue;\n    seen.add(node);\n    queue.push(...(adjacency.get(node) ?? []));\n  }\n  return seen;\n}\n\n/**\n * SKOS S27: skos:related is disjoint with skos:broaderTransitive. The\n * one-hop case is already a SHACL sh:disjoint violation — skip it here so\n * one mistake doesn't produce two findings.\n */\nfunction relatedConflicts(store: Store): CheckFinding[] {\n  const edges = broaderEdges(store);\n  // Direct edges indexed by subject — no composite string keys (a joined\n  // key would need a separator character, and IRIs make any choice fragile).\n  const direct = new Map<string, Set<string>>();\n  for (const e of edges) {\n    const targets = direct.get(e.s);\n    if (targets) targets.add(e.o);\n    else direct.set(e.s, new Set([e.o]));\n  }\n  const findings: CheckFinding[] = [];\n  for (const q of store.getQuads(\n    null,\n    DataFactory.namedNode(`${NS.skos}related`),\n    null,\n    null,\n  )) {\n    if (q.object.termType !== \"NamedNode\") continue;\n    const s = q.subject.value;\n    const o = q.object.value;\n    if (direct.get(s)?.has(o)) continue; // covered by sh:disjoint\n    const conflict =\n      broaderClosure(edges, s).has(o) || broaderClosure(edges, o).has(s);\n    if (!conflict) continue;\n    findings.push(\n      finding(\"violation\", {\n        message: `skos:related conflicts with skos:broaderTransitive between ${compactIri(s)} and ${compactIri(o)} — a concept cannot be both related to and an ancestor/descendant of another`,\n        focusNode: s,\n        path: `${NS.skos}related`,\n        docs: blameDocs(store, s),\n      }),\n    );\n  }\n  return findings;\n}\n\nfunction cycleFindings(store: Store): CheckFinding[] {\n  return broaderCycles(store).map((members) =>\n    finding(\"violation\", {\n      message: `skos:broader cycle through ${members\n        .map((m) => compactIri(m))\n        .join(\n          \", \",\n        )} (${members.map((m) => m).join(\" → \")}) — a concept cannot be its own ancestor`,\n      // `broaderCycles` returns only components of at least one member, so\n      // the first is there; `?? \"\"` says that without asserting it.\n      focusNode: members[0] ?? \"\",\n      path: `${NS.skos}broader`,\n      docs: [...new Set(members.flatMap((m) => blameDocs(store, m)))].sort(),\n    }),\n  );\n}\n\n/**\n * The three `graph` fields a machine may never be attributed for. The old\n * `kg.provenance` schema enumerated the twelve *fillable* fields, which kept\n * these out; a free JSON Pointer cannot express that, so proposal 0046 stress\n * test 13 moved the guard into graph's harvest and, from there, to here.\n */\nconst CURATED_FIELDS = new Set([\"sections\", \"revision-of\", \"derived-from\"]);\n\n/** The fragment a `graph fill` activity's IRI carries, before its model slug. */\nconst GRAPH_FILL_FRAGMENT = \"#prov.graph-fill.\";\n\n/**\n * A machine attribution on a hand-curated field. `check` reads only the built\n * graph and `build` has no findings channel, so the store is where the fact is\n * read: the harvest has already put `graph:filledField \"sections\"` on a field\n * node under a `#prov.graph-fill.` activity.\n */\nfunction curatedFieldFindings(store: Store): CheckFinding[] {\n  const filledField = `${NS.graph}filledField`;\n  const pathPred = DataFactory.namedNode(`${NS.graph}path`);\n  const findings: CheckFinding[] = [];\n  for (const q of store.getQuads(null, DataFactory.namedNode(filledField), null, null)) {\n    if (q.object.termType !== \"Literal\") continue;\n    const field = q.object.value;\n    if (!CURATED_FIELDS.has(field)) continue;\n    const node = q.subject.value;\n    const at = node.indexOf(GRAPH_FILL_FRAGMENT);\n    const fieldAt = node.lastIndexOf(\".field.\");\n    if (at === -1 || fieldAt <= at) continue;\n    const activity = node.slice(0, fieldAt);\n    // The model the activity is for, from its own fragment. Naming it beats\n    // repeating the activity IRI, which the reporter already prints as the\n    // focus node ahead of this message.\n    const model = node.slice(at + GRAPH_FILL_FRAGMENT.length, fieldAt);\n    // These activities hang off no document edge, so `blameDocs` cannot walk\n    // back to one. The doc IRI is the activity's own, minus its fragment.\n    const docIri = activity.slice(0, activity.indexOf(\"#\"));\n    const path = store.getQuads(DataFactory.namedNode(docIri), pathPred, null, null)[0]\n      ?.object.value;\n    findings.push(\n      finding(\"violation\", {\n        message: `meta-provenance attributes /graph/${field} to ${model} — ${field} is curated by hand, never filled by a machine`,\n        focusNode: activity,\n        path: filledField,\n        docs: path === undefined ? blameDocs(store, activity) : [path],\n      }),\n    );\n  }\n  return findings;\n}\n\n/**\n * One validation result, with the nullability its library documents in code\n * rather than in its `.d.ts`.\n *\n * `rdf-validate-shacl` declares `path`, `focusNode` and `severity` as `Term`,\n * and every one of them is `…out(ns.sh.resultPath).term || null` at runtime. A\n * result with no path is ordinary — a node-shape constraint has none — so the\n * guards at the read site are the real contract and the declaration is the\n * optimistic one. Saying so once here is what keeps them from reading as\n * checks that cannot fail.\n */\ninterface ShaclResult {\n  message: Term[];\n  path: Term | null;\n  focusNode: Term | null;\n  severity: Term | null;\n}\n\nfunction severityOf(iri: string | undefined): ShaclSeverity {\n  if (iri === \"http://www.w3.org/ns/shacl#Warning\") return \"warning\";\n  if (iri === \"http://www.w3.org/ns/shacl#Info\") return \"info\";\n  return \"violation\";\n}\n\n/**\n * Validate a built graph against SHACL shapes files, merge in the TS-side\n * SKOS checks, and return deterministic, doc-blamed findings.\n */\nexport async function validateGraph(\n  store: Store,\n  shapesPaths: string[],\n): Promise<CheckFinding[]> {\n  const shapes = loadShapes(shapesPaths);\n  const validator = new SHACLValidator(shapes);\n  let report;\n  try {\n    report = await validator.validate(store);\n  } catch (e) {\n    throw new GraphError(\n      `SHACL validation failed: ${errorMessage(e)}`,\n    );\n  }\n\n  const findings: CheckFinding[] = [];\n  for (const result of report.results as ShaclResult[]) {\n    const focus = result.focusNode?.value ?? \"\";\n    const path = result.path?.value;\n    const messages = result.message\n      .map((m) => m.value)\n      .filter((m) => m.length > 0);\n    const message =\n      messages.length > 0\n        ? messages.join(\"; \")\n        : `constraint violated${path ? ` on ${compactIri(path)}` : \"\"}`;\n    findings.push(\n      finding(severityOf(result.severity?.value), {\n        message,\n        focusNode: focus,\n        ...(path !== undefined ? { path } : {}),\n        docs: blameDocs(store, focus),\n      }),\n    );\n  }\n\n  findings.push(\n    ...cycleFindings(store),\n    ...relatedConflicts(store),\n    ...curatedFieldFindings(store),\n  );\n\n  findings.sort(\n    (a, b) =>\n      SEVERITY_RANK[a.shaclSeverity] - SEVERITY_RANK[b.shaclSeverity] ||\n      byCodeUnit(a.focusNode, b.focusNode) ||\n      byCodeUnit(a.path ?? \"\", b.path ?? \"\") ||\n      byCodeUnit(a.message, b.message),\n  );\n  return findings;\n}\n"],"mappings":";;;;;;;;;;;;;;;AACA,SAAS,YAAY,oBAAoB;AACzC,SAAS,QAAQ,aAAa;AAM9B,IAAM,aAAa,GAAG,GAAG,GAAG;AAErB,SAAS,UAAU,SAAwB;AAChD,MAAI,CAAC,WAAW,OAAO,GAAG;AACxB,UAAM,IAAI;AAAA,MACR,oBAAoB,OAAO;AAAA,IAC7B;AAAA,EACF;AACA,SAAO,WAAW,aAAa,SAAS,MAAM,GAAG,OAAO;AAC1D;AAGO,SAAS,WAAW,QAAgB,OAAsB;AAC/D,QAAM,SAAS,IAAI,OAAO,EAAE,QAAQ,cAAc,CAAC;AACnD,MAAI;AACJ,MAAI;AACF,YAAQ,OAAO,MAAM,MAAM;AAAA,EAC7B,SAAS,GAAG;AACV,UAAM,IAAI;AAAA,MACR,mBAAmB,KAAK,KAAK,aAAa,CAAC,CAAC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,IAAI,MAAM,KAAK;AACxB;AAQO,SAAS,aAAa,OAAsB;AACjD,SAAO,MAAM,SAAS,MAAM,MAAM,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM;AACvD,UAAM,IAAI,EAAE;AACZ,QAAI;AACJ,QAAI,EAAE,aAAa,WAAW;AAC5B,YAAM,KAAK,EAAE,SAAS;AACtB,aACE,MAAM,OAAO,aACT,EAAE,MAAM,WAAW,OAAO,EAAE,OAAO,UAAU,GAAG,IAChD,EAAE,MAAM,WAAW,OAAO,EAAE,MAAM;AAAA,IAC1C,OAAO;AACL,aAAO,EAAE,MAAM,OAAO,OAAO,EAAE,MAAM;AAAA,IACvC;AACA,WAAO,EAAE,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,UAAU,OAAO,GAAG,KAAK;AAAA,EAC7D,CAAC;AACH;AAGO,SAAS,WAAW,OAAuB;AAChD,QAAM,QAAQ,MAAM,QAAQ,GAAG;AAC/B,MAAI,QAAQ,GAAG;AACb,UAAM,SAAS,MAAM,MAAM,GAAG,KAAK;AACnC,UAAM,KAAM,GAA8B,MAAM;AAChD,QAAI,GAAI,QAAO,GAAG,EAAE,GAAG,MAAM,MAAM,QAAQ,CAAC,CAAC;AAAA,EAC/C;AACA,SAAO;AACT;AAGO,SAAS,WAAW,KAAqB;AAC9C,aAAW,CAAC,QAAQ,EAAE,KAAK,UAAU;AACnC,QAAI,IAAI,WAAW,EAAE,KAAK,IAAI,SAAS,GAAG,QAAQ;AAChD,aAAO,GAAG,MAAM,IAAI,IAAI,MAAM,GAAG,MAAM,CAAC;AAAA,IAC1C;AAAA,EACF;AACA,SAAO;AACT;;;AChEA,SAAS,YAAY;AAId,SAAS,kBAAkB,WAA2B;AAC3D,SAAO,KAAK,YAAY,SAAS,GAAG,UAAU,SAAS,kBAAkB;AAC3E;;;ACXA,SAAS,gBAAAA,qBAAoB;AAC7B,SAAS,aAAa,UAAAC,SAAQ,SAAAC,cAAa;AAC3C,OAAO,oBAAoB;AAqC3B,IAAM,kBAAmD;AAAA,EACvD,WAAW;AAAA,EACX,SAAS;AAAA,EACT,MAAM;AACR;AAGA,SAAS,QACP,eACA,MACc;AACd,SAAO,EAAE,UAAU,gBAAgB,aAAa,GAAG,eAAe,GAAG,KAAK;AAC5E;AAEA,IAAM,gBAA+C;AAAA,EACnD,WAAW;AAAA,EACX,SAAS;AAAA,EACT,MAAM;AACR;AAGO,SAAS,WAAW,OAAwB;AACjD,QAAM,QAAQ,IAAIC,OAAM;AACxB,aAAW,QAAQ,OAAO;AACxB,QAAI;AACJ,QAAI;AACF,aAAOC,cAAa,MAAM,MAAM;AAAA,IAClC,QAAQ;AACN,YAAM,IAAI,WAAW,0BAA0B,IAAI,EAAE;AAAA,IACvD;AACA,QAAI;AACF,YAAM,SAAS,IAAIC,QAAO,EAAE,QAAQ,cAAc,CAAC,EAAE,MAAM,IAAI,CAAC;AAAA,IAClE,SAAS,GAAG;AACV,YAAM,IAAI;AAAA,QACR,0BAA0B,IAAI,KAAK,aAAa,CAAC,CAAC;AAAA,MACpD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAQO,SAAS,UAAU,OAAc,OAAyB;AAC/D,QAAM,WAAW,YAAY,UAAU,GAAG,GAAG,KAAK,MAAM;AACxD,QAAM,SAAS,CAAC,QACd,MAAM,SAAS,YAAY,UAAU,GAAG,GAAG,UAAU,MAAM,IAAI,EAAE,CAAC,GAAG,OAAO;AAE9E,QAAM,QAAQ,oBAAI,IAAY;AAC9B,QAAM,UAAU,oBAAI,IAAY;AAEhC,QAAM,OAAO,CAAC,KAAa,UAAwB;AACjD,QAAI,QAAQ,IAAI,GAAG,EAAG;AACtB,YAAQ,IAAI,GAAG;AAEf,UAAM,MAAM,OAAO,GAAG;AACtB,QAAI,QAAQ,QAAW;AACrB,YAAM,IAAI,GAAG;AACb;AAAA,IACF;AACA,UAAM,OAAO,IAAI,QAAQ,GAAG;AAC5B,QAAI,SAAS,IAAI;AACf,YAAM,OAAO,OAAO,IAAI,MAAM,GAAG,IAAI,CAAC;AACtC,UAAI,SAAS,QAAW;AACtB,cAAM,IAAI,IAAI;AACd;AAAA,MACF;AAAA,IACF;AACA,QAAI,UAAU,EAAG;AACjB,eAAW,QAAQ,MAAM,SAAS,MAAM,MAAM,YAAY,UAAU,GAAG,GAAG,IAAI,GAAG;AAC/E,UAAI,KAAK,QAAQ,aAAa,aAAa;AACzC,aAAK,KAAK,QAAQ,OAAO,QAAQ,CAAC;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,OAAK,OAAO,CAAC;AACb,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK;AACzB;AAQA,SAAS,aAAa,OAAsB;AAC1C,QAAM,QAAgB,CAAC;AACvB,aAAW,KAAK,MAAM;AAAA,IACpB;AAAA,IACA,YAAY,UAAU,GAAG,GAAG,IAAI,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,EACF,GAAG;AACD,QAAI,EAAE,OAAO,aAAa,aAAa;AACrC,YAAM,KAAK,EAAE,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,OAAO,MAAM,CAAC;AAAA,IACtD;AAAA,EACF;AACA,aAAW,KAAK,MAAM;AAAA,IACpB;AAAA,IACA,YAAY,UAAU,GAAG,GAAG,IAAI,UAAU;AAAA,IAC1C;AAAA,IACA;AAAA,EACF,GAAG;AACD,QAAI,EAAE,OAAO,aAAa,aAAa;AACrC,YAAM,KAAK,EAAE,GAAG,EAAE,OAAO,OAAO,GAAG,EAAE,QAAQ,MAAM,CAAC;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,cAAc,OAA0B;AACtD,QAAM,YAAY,oBAAI,IAAsB;AAC5C,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,EAAE,GAAG,EAAE,KAAK,aAAa,KAAK,GAAG;AAC1C,QAAI,MAAM,EAAG,WAAU,IAAI,CAAC;AAC5B,UAAM,OAAO,UAAU,IAAI,CAAC;AAC5B,QAAI,KAAM,MAAK,KAAK,CAAC;AAAA,QAChB,WAAU,IAAI,GAAG,CAAC,CAAC,CAAC;AACzB,QAAI,CAAC,UAAU,IAAI,CAAC,EAAG,WAAU,IAAI,GAAG,CAAC,CAAC;AAAA,EAC5C;AACA,aAAW,QAAQ,UAAU,OAAO,EAAG,MAAK,KAAK;AAEjD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,QAAkB,CAAC;AACzB,QAAM,aAAyB,CAAC;AAChC,MAAI,UAAU;AAQd,QAAM,WAAW,CAAC,KAA0B,SAAyB;AACnE,UAAM,QAAQ,IAAI,IAAI,IAAI;AAC1B,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI;AAAA,QACR,aAAa,IAAI;AAAA,MACnB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAC,GAAG,UAAU,KAAK,CAAC,EAAE,KAAK;AACzC,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,IAAI,EAAG;AAIrB,UAAM,SAAkC,CAAC,CAAC,MAAM,CAAC,CAAC;AAClD,aAAS,QAAQ,OAAO,GAAG,EAAE,GAAG,UAAU,QAAW,QAAQ,OAAO,GAAG,EAAE,GAAG;AAC1E,YAAM,CAAC,MAAM,QAAQ,IAAI;AACzB,UAAI,aAAa,GAAG;AAClB,cAAM,IAAI,MAAM,OAAO;AACvB,gBAAQ,IAAI,MAAM,OAAO;AACzB,mBAAW;AACX,cAAM,KAAK,IAAI;AACf,gBAAQ,IAAI,IAAI;AAAA,MAClB;AACA,YAAM,WAAW,UAAU,IAAI,IAAI,KAAK,CAAC;AAGzC,YAAM,QAAQ,SAAS,QAAQ;AAC/B,UAAI,UAAU,QAAW;AACvB,cAAM,CAAC,KAAK;AACZ,YAAI,CAAC,MAAM,IAAI,KAAK,GAAG;AACrB,iBAAO,KAAK,CAAC,OAAO,CAAC,CAAC;AAAA,QACxB,WAAW,QAAQ,IAAI,KAAK,GAAG;AAC7B,kBAAQ;AAAA,YACN;AAAA,YACA,KAAK,IAAI,SAAS,SAAS,IAAI,GAAG,SAAS,OAAO,KAAK,CAAC;AAAA,UAC1D;AAAA,QACF;AAAA,MACF,OAAO;AACL,YAAI,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,IAAI,GAAG;AACzC,gBAAM,YAAsB,CAAC;AAC7B,cAAI;AACJ,aAAG;AACD,qBAAS,MAAM,IAAI;AACnB,gBAAI,WAAW,OAAW;AAC1B,oBAAQ,OAAO,MAAM;AACrB,sBAAU,KAAK,MAAM;AAAA,UACvB,SAAS,WAAW;AACpB,cAAI,UAAU,SAAS,KAAK,UAAU,IAAI,IAAI,GAAG;AAC/C,uBAAW,KAAK,UAAU,KAAK,CAAC;AAAA,UAClC;AAAA,QACF;AACA,eAAO,IAAI;AACX,cAAM,SAAS,OAAO,GAAG,EAAE;AAC3B,YAAI,QAAQ;AACV,kBAAQ;AAAA,YACN,OAAO,CAAC;AAAA,YACR,KAAK,IAAI,SAAS,SAAS,OAAO,CAAC,CAAC,GAAG,SAAS,SAAS,IAAI,CAAC;AAAA,UAChE;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,SAAO,WAAW,KAAK,CAAC,GAAG,OAAQ,EAAE,CAAC,KAAK,OAAO,EAAE,CAAC,KAAK,MAAM,KAAK,CAAE;AACzE;AAGA,SAAS,eAAe,OAAe,OAA4B;AACjE,QAAM,YAAY,oBAAI,IAAsB;AAC5C,aAAW,EAAE,GAAG,EAAE,KAAK,OAAO;AAC5B,UAAM,OAAO,UAAU,IAAI,CAAC;AAC5B,QAAI,KAAM,MAAK,KAAK,CAAC;AAAA,QAChB,WAAU,IAAI,GAAG,CAAC,CAAC,CAAC;AAAA,EAC3B;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAQ,CAAC,GAAI,UAAU,IAAI,KAAK,KAAK,CAAC,CAAE;AAE9C,WAAS,OAAO,MAAM,MAAM,GAAG,SAAS,QAAW,OAAO,MAAM,MAAM,GAAG;AACvE,QAAI,KAAK,IAAI,IAAI,EAAG;AACpB,SAAK,IAAI,IAAI;AACb,UAAM,KAAK,GAAI,UAAU,IAAI,IAAI,KAAK,CAAC,CAAE;AAAA,EAC3C;AACA,SAAO;AACT;AAOA,SAAS,iBAAiB,OAA8B;AACtD,QAAM,QAAQ,aAAa,KAAK;AAGhC,QAAM,SAAS,oBAAI,IAAyB;AAC5C,aAAW,KAAK,OAAO;AACrB,UAAM,UAAU,OAAO,IAAI,EAAE,CAAC;AAC9B,QAAI,QAAS,SAAQ,IAAI,EAAE,CAAC;AAAA,QACvB,QAAO,IAAI,EAAE,GAAG,oBAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,EACrC;AACA,QAAM,WAA2B,CAAC;AAClC,aAAW,KAAK,MAAM;AAAA,IACpB;AAAA,IACA,YAAY,UAAU,GAAG,GAAG,IAAI,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,EACF,GAAG;AACD,QAAI,EAAE,OAAO,aAAa,YAAa;AACvC,UAAM,IAAI,EAAE,QAAQ;AACpB,UAAM,IAAI,EAAE,OAAO;AACnB,QAAI,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,EAAG;AAC3B,UAAM,WACJ,eAAe,OAAO,CAAC,EAAE,IAAI,CAAC,KAAK,eAAe,OAAO,CAAC,EAAE,IAAI,CAAC;AACnE,QAAI,CAAC,SAAU;AACf,aAAS;AAAA,MACP,QAAQ,aAAa;AAAA,QACnB,SAAS,8DAA8D,WAAW,CAAC,CAAC,QAAQ,WAAW,CAAC,CAAC;AAAA,QACzG,WAAW;AAAA,QACX,MAAM,GAAG,GAAG,IAAI;AAAA,QAChB,MAAM,UAAU,OAAO,CAAC;AAAA,MAC1B,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,OAA8B;AACnD,SAAO,cAAc,KAAK,EAAE;AAAA,IAAI,CAAC,YAC/B,QAAQ,aAAa;AAAA,MACnB,SAAS,8BAA8B,QACpC,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC,EACxB;AAAA,QACC;AAAA,MACF,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,UAAK,CAAC;AAAA;AAAA;AAAA,MAGzC,WAAW,QAAQ,CAAC,KAAK;AAAA,MACzB,MAAM,GAAG,GAAG,IAAI;AAAA,MAChB,MAAM,CAAC,GAAG,IAAI,IAAI,QAAQ,QAAQ,CAAC,MAAM,UAAU,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK;AAAA,IACvE,CAAC;AAAA,EACH;AACF;AAQA,IAAM,iBAAiB,oBAAI,IAAI,CAAC,YAAY,eAAe,cAAc,CAAC;AAG1E,IAAM,sBAAsB;AAQ5B,SAAS,qBAAqB,OAA8B;AAC1D,QAAM,cAAc,GAAG,GAAG,KAAK;AAC/B,QAAM,WAAW,YAAY,UAAU,GAAG,GAAG,KAAK,MAAM;AACxD,QAAM,WAA2B,CAAC;AAClC,aAAW,KAAK,MAAM,SAAS,MAAM,YAAY,UAAU,WAAW,GAAG,MAAM,IAAI,GAAG;AACpF,QAAI,EAAE,OAAO,aAAa,UAAW;AACrC,UAAM,QAAQ,EAAE,OAAO;AACvB,QAAI,CAAC,eAAe,IAAI,KAAK,EAAG;AAChC,UAAM,OAAO,EAAE,QAAQ;AACvB,UAAM,KAAK,KAAK,QAAQ,mBAAmB;AAC3C,UAAM,UAAU,KAAK,YAAY,SAAS;AAC1C,QAAI,OAAO,MAAM,WAAW,GAAI;AAChC,UAAM,WAAW,KAAK,MAAM,GAAG,OAAO;AAItC,UAAM,QAAQ,KAAK,MAAM,KAAK,oBAAoB,QAAQ,OAAO;AAGjE,UAAM,SAAS,SAAS,MAAM,GAAG,SAAS,QAAQ,GAAG,CAAC;AACtD,UAAM,OAAO,MAAM,SAAS,YAAY,UAAU,MAAM,GAAG,UAAU,MAAM,IAAI,EAAE,CAAC,GAC9E,OAAO;AACX,aAAS;AAAA,MACP,QAAQ,aAAa;AAAA,QACnB,SAAS,qCAAqC,KAAK,OAAO,KAAK,WAAM,KAAK;AAAA,QAC1E,WAAW;AAAA,QACX,MAAM;AAAA,QACN,MAAM,SAAS,SAAY,UAAU,OAAO,QAAQ,IAAI,CAAC,IAAI;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAoBA,SAAS,WAAW,KAAwC;AAC1D,MAAI,QAAQ,qCAAsC,QAAO;AACzD,MAAI,QAAQ,kCAAmC,QAAO;AACtD,SAAO;AACT;AAMA,eAAsB,cACpB,OACA,aACyB;AACzB,QAAM,SAAS,WAAW,WAAW;AACrC,QAAM,YAAY,IAAI,eAAe,MAAM;AAC3C,MAAI;AACJ,MAAI;AACF,aAAS,MAAM,UAAU,SAAS,KAAK;AAAA,EACzC,SAAS,GAAG;AACV,UAAM,IAAI;AAAA,MACR,4BAA4B,aAAa,CAAC,CAAC;AAAA,IAC7C;AAAA,EACF;AAEA,QAAM,WAA2B,CAAC;AAClC,aAAW,UAAU,OAAO,SAA0B;AACpD,UAAM,QAAQ,OAAO,WAAW,SAAS;AACzC,UAAM,OAAO,OAAO,MAAM;AAC1B,UAAM,WAAW,OAAO,QACrB,IAAI,CAAC,MAAM,EAAE,KAAK,EAClB,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC7B,UAAM,UACJ,SAAS,SAAS,IACd,SAAS,KAAK,IAAI,IAClB,sBAAsB,OAAO,OAAO,WAAW,IAAI,CAAC,KAAK,EAAE;AACjE,aAAS;AAAA,MACP,QAAQ,WAAW,OAAO,UAAU,KAAK,GAAG;AAAA,QAC1C;AAAA,QACA,WAAW;AAAA,QACX,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,QACrC,MAAM,UAAU,OAAO,KAAK;AAAA,MAC9B,CAAC;AAAA,IACH;AAAA,EACF;AAEA,WAAS;AAAA,IACP,GAAG,cAAc,KAAK;AAAA,IACtB,GAAG,iBAAiB,KAAK;AAAA,IACzB,GAAG,qBAAqB,KAAK;AAAA,EAC/B;AAEA,WAAS;AAAA,IACP,CAAC,GAAG,MACF,cAAc,EAAE,aAAa,IAAI,cAAc,EAAE,aAAa,KAC9D,WAAW,EAAE,WAAW,EAAE,SAAS,KACnC,WAAW,EAAE,QAAQ,IAAI,EAAE,QAAQ,EAAE,KACrC,WAAW,EAAE,SAAS,EAAE,OAAO;AAAA,EACnC;AACA,SAAO;AACT;","names":["readFileSync","Parser","Store","Store","readFileSync","Parser"]}