@hawkeyexl/manni 4.11.0 → 4.12.0

package/dist/chunk-4VBSTXN6.js

@@ -1,392 +0,0 @@
-#!/usr/bin/env node
-import {
-  DEFAULT_ABSTRACT_MAX_LENGTH,
-  DEFAULT_TERM_BASELINE_PATH,
-  TERM_RULES,
-  TermError,
-  languageKey,
-  loadTerms
-} from "./chunk-J6IDQGJL.js";
-import {
-  TERM_RELATION_FIELDS
-} from "./chunk-6HWBRZIN.js";
-import {
-  isErrorSeverity,
-  resolveBaselineRequest,
-  settleBaseline
-} from "./chunk-VSEBFHAY.js";
-
-// src/term/commands/check.ts
-import { existsSync } from "node:fs";
-
-// src/term/core/severity.ts
-var RULE_ID_PREFIX = "manni:term";
-var DEFAULT_SEVERITY = {
-  "undefined-term": "error",
-  "duplicate-id": "error",
-  "label-collision": "error",
-  "alt-label-collision": "error",
-  "dangling-reference": "error",
-  "broader-cycle": "error",
-  "see-not-empty": "error",
-  "asymmetric-hierarchy": "warning",
-  "abstract-too-long": "notice",
-  "unused-term": "notice"
-};
-function ruleId(rule) {
-  return `${RULE_ID_PREFIX}/${rule}`;
-}
-function proseRuleId(check) {
-  return `${RULE_ID_PREFIX}/prose/${check}`;
-}
-function isTermRule(value) {
-  return TERM_RULES.includes(value);
-}
-function resolveSeverity(overrides) {
-  return { ...DEFAULT_SEVERITY, ...overrides };
-}
-function foldValeSeverity(severity) {
-  return severity === "suggestion" ? "notice" : severity;
-}
-
-// src/term/core/check.ts
-var REFERENCE_FIELDS = TERM_RELATION_FIELDS;
-function checkTermSet(set, opts = {}) {
-  const levels = resolveSeverity(opts.severity);
-  const maxLength = opts.abstractMaxLength ?? DEFAULT_ABSTRACT_MAX_LENGTH;
-  const { terms } = set;
-  const drafts = [];
-  const fold = (value) => value.toLowerCase();
-  const where = (t) => `${t.location.file}:${String(t.location.line)}`;
-  const onEntry = (t, rule, message, field) => ({
-    rule,
-    message,
-    file: t.location.file,
-    line: (field === void 0 ? void 0 : t.location.fieldLines[field]) ?? t.location.line,
-    id: t.id,
-    ...field === void 0 ? {} : { field }
-  });
-  const byLabel = /* @__PURE__ */ new Map();
-  const byId = /* @__PURE__ */ new Map();
-  const inLanguage = /* @__PURE__ */ new Map();
-  const labelled = /* @__PURE__ */ new Map();
-  const claim = (map, key, index) => {
-    if (!map.has(key)) map.set(key, index);
-  };
-  terms.forEach((t, index) => {
-    claim(byLabel, fold(t.record.label), index);
-    const group = labelled.get(fold(t.record.label));
-    if (group === void 0) labelled.set(fold(t.record.label), [index]);
-    else group.push(index);
-    claim(byId, fold(t.id), index);
-    claim(inLanguage, `${languageKey(t)} label ${fold(t.record.label)}`, index);
-    claim(inLanguage, `${languageKey(t)} id ${fold(t.id)}`, index);
-  });
-  const clash = (t, a, other, b) => fold(a) === fold(b) && (languageKey(t) === languageKey(other) || a !== b);
-  const collider = (t, index, value, before) => {
-    for (const otherIndex of labelled.get(fold(value)) ?? []) {
-      if (otherIndex === index || before && otherIndex > index) continue;
-      const other = terms[otherIndex];
-      if (other !== void 0 && clash(t, value, other, other.record.label)) return other;
-    }
-    return void 0;
-  };
-  const resolveReference = (from, value) => inLanguage.get(`${languageKey(from)} label ${fold(value)}`) ?? inLanguage.get(`${languageKey(from)} id ${fold(value)}`) ?? byLabel.get(fold(value)) ?? byId.get(fold(value));
-  const referenced = /* @__PURE__ */ new Set();
-  for (const reference of set.references) {
-    const label = fold(reference.label);
-    referenced.add(label);
-    if (byLabel.has(label)) continue;
-    let message = `concepts: "${reference.label}" names no entry.`;
-    const synonym = terms.find((t) => (t.record["alt-labels"] ?? []).some((alt) => fold(alt) === label));
-    if (synonym !== void 0) {
-      message += ` "${synonym.record.label}" lists it as an alt-label.`;
-    }
-    drafts.push({
-      rule: "undefined-term",
-      message,
-      file: reference.file,
-      ...reference.line === void 0 ? {} : { line: reference.line }
-    });
-  }
-  const usedIds = new Set(terms.filter((t) => referenced.has(fold(t.record.label))).map((t) => fold(t.id)));
-  const sharing = /* @__PURE__ */ new Map();
-  for (const t of terms) {
-    const id = `${languageKey(t)} ${fold(t.id)}`;
-    const group = sharing.get(id);
-    if (group === void 0) sharing.set(id, [t]);
-    else group.push(t);
-  }
-  for (const group of sharing.values()) {
-    if (group.length < 2) continue;
-    for (const t of group) {
-      const others = group.filter((other) => other !== t).map(where);
-      drafts.push(onEntry(t, "duplicate-id", `id: "${t.id}" is also used by ${others.join(", ")}`));
-    }
-  }
-  terms.forEach((t, index) => {
-    const firstTerm = collider(t, index, t.record.label, true);
-    if (firstTerm !== void 0) {
-      drafts.push(
-        onEntry(
-          t,
-          "label-collision",
-          `"${t.record.label}" is claimed by ${where(firstTerm)} as "${firstTerm.record.label}"`,
-          "label"
-        )
-      );
-    }
-    for (const alt of t.record["alt-labels"] ?? []) {
-      const owner = collider(t, index, alt, false);
-      if (owner !== void 0) {
-        drafts.push(
-          onEntry(t, "alt-label-collision", `alt-labels: "${alt}" is the label of ${where(owner)}`, "alt-labels")
-        );
-      }
-    }
-    for (const field of REFERENCE_FIELDS) {
-      for (const value of referenceValues(t, field)) {
-        if (resolveReference(t, value) === void 0) {
-          drafts.push(onEntry(t, "dangling-reference", `${field}: "${value}" names no entry`, field));
-        }
-      }
-    }
-    if (t.record.see !== void 0 && t.record.definition !== void 0) {
-      drafts.push(
-        onEntry(t, "see-not-empty", `see: "${t.record.see}" redirects this entry, so remove its definition`, "see")
-      );
-    }
-    const abstract = t.record.abstract;
-    if (abstract !== void 0 && abstract.length > maxLength) {
-      drafts.push(
-        onEntry(
-          t,
-          "abstract-too-long",
-          `abstract: ${String(abstract.length)} characters is over the limit of ${String(maxLength)}, so shorten it`,
-          "abstract"
-        )
-      );
-    }
-    if (!usedIds.has(fold(t.id))) {
-      drafts.push(onEntry(t, "unused-term", "no page's concepts: names this term"));
-    }
-  });
-  const edges = (field) => terms.map((t) => {
-    const targets = /* @__PURE__ */ new Set();
-    for (const value of referenceValues(t, field)) {
-      const target = resolveReference(t, value);
-      if (target !== void 0) targets.add(target);
-    }
-    return targets;
-  });
-  const broader = edges("broader");
-  const narrower = edges("narrower");
-  terms.forEach((t, index) => {
-    for (const parent of broader[index] ?? []) {
-      const parentTerm = terms[parent];
-      if (parentTerm !== void 0 && !(narrower[parent]?.has(index) ?? false)) {
-        drafts.push(
-          onEntry(
-            parentTerm,
-            "asymmetric-hierarchy",
-            `narrower: omits "${t.record.label}", which lists this entry as broader`,
-            "narrower"
-          )
-        );
-      }
-    }
-    for (const child of narrower[index] ?? []) {
-      const childTerm = terms[child];
-      if (childTerm !== void 0 && !(broader[child]?.has(index) ?? false)) {
-        drafts.push(
-          onEntry(
-            childTerm,
-            "asymmetric-hierarchy",
-            `broader: omits "${t.record.label}", which lists this entry as narrower`,
-            "broader"
-          )
-        );
-      }
-    }
-  });
-  for (const [start, path] of broaderCycles(broader)) {
-    const startTerm = terms[start];
-    if (startTerm === void 0) continue;
-    const labels = [...path, start].map((index) => terms[index]?.record.label ?? "");
-    drafts.push(onEntry(startTerm, "broader-cycle", `broader: ${labels.join(" > ")}`, "broader"));
-  }
-  const findings = [];
-  for (const draft of drafts) {
-    const level = levels[draft.rule];
-    if (level === "off") continue;
-    findings.push({
-      rule: draft.rule,
-      ruleId: ruleId(draft.rule),
-      severity: level,
-      message: draft.message,
-      file: draft.file,
-      ...draft.line === void 0 ? {} : { line: draft.line },
-      ...draft.id === void 0 ? {} : { id: draft.id },
-      ...draft.field === void 0 ? {} : { field: draft.field }
-    });
-  }
-  return findings.sort(compareFindings);
-}
-function referenceValues(t, field) {
-  const value = t.record[field];
-  if (value === void 0) return [];
-  return typeof value === "string" ? [value] : value;
-}
-function broaderCycles(broader) {
-  const cycles = [];
-  for (let start = 0; start < broader.length; start++) {
-    const path = [start];
-    const onPath = /* @__PURE__ */ new Set([start]);
-    const walk = (node) => {
-      for (const next of broader[node] ?? []) {
-        if (next === start) {
-          cycles.push([start, [...path]]);
-        } else if (next > start && !onPath.has(next)) {
-          path.push(next);
-          onPath.add(next);
-          walk(next);
-          path.pop();
-          onPath.delete(next);
-        }
-      }
-    };
-    walk(start);
-  }
-  return cycles;
-}
-function compareText(a, b) {
-  return a < b ? -1 : a > b ? 1 : 0;
-}
-function compareFindings(a, b) {
-  return compareText(a.file, b.file) || (a.line ?? 0) - (b.line ?? 0) || compareText(a.ruleId, b.ruleId) || compareText(a.message, b.message);
-}
-
-// src/term/commands/findings.ts
-var FINDING_FORMATS = ["pretty", "json", "github", "sarif", "junit"];
-var JUNIT_CLASSNAME = "manni.term";
-var LINE_REFERENCE = /:\d+\b/g;
-function toFieldError(finding) {
-  const keyword = finding.ruleId.startsWith(`${RULE_ID_PREFIX}/`) ? finding.ruleId.slice(RULE_ID_PREFIX.length + 1) : finding.ruleId;
-  const { field } = finding;
-  const subject = [finding.id ?? "", field ?? "", finding.message.replace(LINE_REFERENCE, "")].join("\0");
-  const error = {
-    schema: RULE_ID_PREFIX,
-    instancePath: field === void 0 ? "" : `/${field}`,
-    message: finding.message,
-    keyword,
-    subject,
-    severity: finding.severity
-  };
-  if (finding.line !== void 0) error.line = finding.line;
-  return error;
-}
-function toResults(set, findings) {
-  const origin = /* @__PURE__ */ new Map();
-  const byFile = /* @__PURE__ */ new Map();
-  for (const term of set.terms) {
-    if (!byFile.has(term.location.file)) byFile.set(term.location.file, []);
-  }
-  for (const finding of findings) {
-    const error = toFieldError(finding);
-    origin.set(error, finding);
-    const list = byFile.get(finding.file) ?? [];
-    list.push(error);
-    byFile.set(finding.file, list);
-  }
-  const results = [...byFile.keys()].sort().map((file) => {
-    const errors = byFile.get(file) ?? [];
-    return { file, format: "term", ok: !errors.some(isErrorSeverity), schemas: [RULE_ID_PREFIX], errors };
-  });
-  return { results, origin };
-}
-function summarize(results, baseline) {
-  const failed = results.filter((r) => !r.ok).length;
-  const count = (keep) => results.reduce((n, r) => n + r.errors.filter(keep).length, 0);
-  const warnings = count((e) => e.severity === "warning");
-  const notices = count((e) => e.severity === "notice");
-  return {
-    files: results.length,
-    passed: results.length - failed,
-    failed,
-    errors: count(isErrorSeverity),
-    ...warnings > 0 ? { warnings } : {},
-    ...notices > 0 ? { notices } : {},
-    ...baseline ? { baseline } : {}
-  };
-}
-function reportedFindings(results, origin) {
-  const kept = [];
-  for (const result of results) {
-    for (const error of result.errors) {
-      const finding = origin.get(error);
-      if (finding !== void 0) kept.push(finding);
-    }
-  }
-  return kept.sort(compareFindings2);
-}
-function compareFindings2(a, b) {
-  if (a.file !== b.file) return a.file < b.file ? -1 : 1;
-  const lineA = a.line ?? 0;
-  const lineB = b.line ?? 0;
-  if (lineA !== lineB) return lineA - lineB;
-  if (a.ruleId !== b.ruleId) return a.ruleId < b.ruleId ? -1 : 1;
-  return a.message < b.message ? -1 : a.message > b.message ? 1 : 0;
-}
-
-// src/term/commands/check.ts
-async function runCheck(opts) {
-  const { cwd, run, set } = await loadTerms(opts);
-  const config = run.config;
-  const findings = checkTermSet(set, {
-    ...config?.severity === void 0 ? {} : { severity: config.severity },
-    ...config?.abstractMaxLength === void 0 ? {} : { abstractMaxLength: config.abstractMaxLength }
-  });
-  const { results, origin } = toResults(set, findings);
-  const frame = { cwd, base: run.configDir ?? cwd, runBase: run.base };
-  let request = resolveBaselineRequest(
-    opts.baseline === true ? { baseline: true } : {},
-    config?.baseline,
-    run.configDir,
-    cwd,
-    { current: DEFAULT_TERM_BASELINE_PATH }
-  );
-  if (request !== null && !existsSync(request.absPath)) {
-    if (opts.baseline !== true) {
-      throw new TermError(
-        `Baseline "${request.label}" not found. Record one with \`manni term check --baseline\`.`
-      );
-    }
-    request = { ...request, write: true };
-  }
-  const { results: reported, baseline } = await settleBaseline(results, request, frame);
-  return {
-    findings: reportedFindings(reported, origin),
-    results: reported,
-    summary: summarize(reported, baseline),
-    frame,
-    terms: set.terms.length,
-    references: set.references.length,
-    ...baseline === void 0 ? {} : { baseline },
-    found: findings.length,
-    cwd
-  };
-}
-
-export {
-  RULE_ID_PREFIX,
-  proseRuleId,
-  isTermRule,
-  foldValeSeverity,
-  FINDING_FORMATS,
-  JUNIT_CLASSNAME,
-  toResults,
-  summarize,
-  reportedFindings,
-  runCheck
-};
-//# sourceMappingURL=chunk-4VBSTXN6.js.map

package/dist/chunk-4VBSTXN6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/term/commands/check.ts","../src/term/core/severity.ts","../src/term/core/check.ts","../src/term/commands/findings.ts"],"sourcesContent":["/**\n * `manni term check`: the referential integrity of the set (proposal 0052 § 7),\n * with the baseline ratchet meta and cite use.\n *\n * `--baseline` is one flag for both halves of the ratchet. When the baseline\n * file is not there yet, the run records one and exits 0: that is how a docset\n * whose terms were never checked ramps in. When it is there, the run fails only\n * on findings it does not hold. A configured `term.baseline` compares without\n * the flag, as `cite.baseline` does.\n */\nimport { existsSync } from \"node:fs\";\nimport { resolveBaselineRequest, settleBaseline } from \"../../meta/internal.js\";\nimport { checkTermSet } from \"../core/check.js\";\nimport { DEFAULT_TERM_BASELINE_PATH } from \"../core/config.js\";\nimport { TermError } from \"../errors.js\";\nimport { reportedFindings, summarize, toResults, type TermReport } from \"./findings.js\";\nimport { loadTerms, type TermCommandOptions } from \"./run.js\";\n\nexport interface CheckOptions extends TermCommandOptions {\n  /** `--baseline`. */\n  baseline?: boolean;\n}\n\nexport async function runCheck(opts: CheckOptions): Promise<TermReport> {\n  const { cwd, run, set } = await loadTerms(opts);\n  const config = run.config;\n  const findings = checkTermSet(set, {\n    ...(config?.severity === undefined ? {} : { severity: config.severity }),\n    ...(config?.abstractMaxLength === undefined ? {} : { abstractMaxLength: config.abstractMaxLength }),\n  });\n  const { results, origin } = toResults(set, findings);\n\n  // Fingerprints must not depend on where the command was run from.\n  const frame = { cwd, base: run.configDir ?? cwd, runBase: run.base };\n  let request = resolveBaselineRequest(\n    opts.baseline === true ? { baseline: true } : {},\n    config?.baseline,\n    run.configDir,\n    cwd,\n    { current: DEFAULT_TERM_BASELINE_PATH },\n  );\n  if (request !== null && !existsSync(request.absPath)) {\n    if (opts.baseline !== true) {\n      throw new TermError(\n        `Baseline \"${request.label}\" not found. Record one with \\`manni term check --baseline\\`.`,\n      );\n    }\n    request = { ...request, write: true };\n  }\n  const { results: reported, baseline } = await settleBaseline(results, request, frame);\n\n  return {\n    findings: reportedFindings(reported, origin),\n    results: reported,\n    summary: summarize(reported, baseline),\n    frame,\n    terms: set.terms.length,\n    references: set.references.length,\n    ...(baseline === undefined ? {} : { baseline }),\n    found: findings.length,\n    cwd,\n  };\n}\n","/**\n * Rule ids and levels for the term tool (proposal 0052). `check` findings are\n * `manni:term/<rule>`. A `lint` finding keeps Vale's own rule name,\n * `manni:term/prose/<Style.Rule>`, in the shape lint's proposal 0050 set for\n * its prose job, because that is the name Vale's documentation uses.\n */\nimport type { Severity } from \"../../shared/severity.js\";\nimport { TERM_RULES, type TermRule, type TermSeverity, type ValeSeverity } from \"../types.js\";\n\nexport const RULE_ID_PREFIX = \"manni:term\";\n\nexport const DEFAULT_SEVERITY: Readonly<Record<TermRule, TermSeverity>> = {\n  \"undefined-term\": \"error\",\n  \"duplicate-id\": \"error\",\n  \"label-collision\": \"error\",\n  \"alt-label-collision\": \"error\",\n  \"dangling-reference\": \"error\",\n  \"broader-cycle\": \"error\",\n  \"see-not-empty\": \"error\",\n  \"asymmetric-hierarchy\": \"warning\",\n  \"abstract-too-long\": \"notice\",\n  \"unused-term\": \"notice\",\n};\n\nexport function ruleId(rule: TermRule): string {\n  return `${RULE_ID_PREFIX}/${rule}`;\n}\n\nexport function proseRuleId(check: string): string {\n  return `${RULE_ID_PREFIX}/prose/${check}`;\n}\n\nexport function isTermRule(value: string): value is TermRule {\n  return (TERM_RULES as readonly string[]).includes(value);\n}\n\n/** The defaults with config's overrides laid over them. */\nexport function resolveSeverity(\n  overrides?: Partial<Record<TermRule, TermSeverity>>,\n): Record<TermRule, TermSeverity> {\n  return { ...DEFAULT_SEVERITY, ...overrides };\n}\n\n/**\n * Vale's scale onto the family's. A finding keeps Vale's own value beside the\n * folded one, as an a11y violation keeps axe's `impact`.\n */\nexport function foldValeSeverity(severity: ValeSeverity): Severity {\n  return severity === \"suggestion\" ? \"notice\" : severity;\n}\n","/**\n * `term check`'s rules (proposal 0052 § 7): the referential integrity of a term\n * set. Pure: it reads records and references and returns findings, so the\n * command core owns every file and the rules are tested on sets built inline.\n *\n * Every label comparison ignores case, because the Vale style `write -f vale`\n * renders is a `swap` map keyed on the lowercased term. Two labels that differ\n * only in case collide there silently, so they collide here out loud. Ids\n * compare ignoring case too, because references resolve them that way.\n *\n * A set may hold one term per language, joined on `id` (proposal 0084). A term\n * with no language counts as `en`, and languages compare ignoring case. Across\n * languages, two labels collide only when they differ in spelling but not in\n * case: `API` in en and de is one word, `Kubernetes`/`kubernetes` is a clash.\n */\nimport { TERM_RELATION_FIELDS } from \"../../shared/reference-fields.js\";\nimport { DEFAULT_ABSTRACT_MAX_LENGTH } from \"./config.js\";\nimport { languageKey as language } from \"./writers/render-util.js\";\nimport { resolveSeverity, ruleId } from \"./severity.js\";\nimport type { Term, TermField, TermFinding, TermRule, TermSet, TermSeverity } from \"../types.js\";\n\nexport interface CheckTermSetOptions {\n  severity?: Partial<Record<TermRule, TermSeverity>>;\n  /** Default `DEFAULT_ABSTRACT_MAX_LENGTH`. */\n  abstractMaxLength?: number;\n}\n\n/** The fields whose values name other entries. */\nconst REFERENCE_FIELDS = TERM_RELATION_FIELDS;\ntype ReferenceField = (typeof REFERENCE_FIELDS)[number];\n\ninterface Draft {\n  rule: TermRule;\n  message: string;\n  file: string;\n  line?: number;\n  id?: string;\n  field?: TermField;\n}\n\nexport function checkTermSet(set: TermSet, opts: CheckTermSetOptions = {}): TermFinding[] {\n  const levels = resolveSeverity(opts.severity);\n  const maxLength = opts.abstractMaxLength ?? DEFAULT_ABSTRACT_MAX_LENGTH;\n  const { terms } = set;\n  const drafts: Draft[] = [];\n\n  const fold = (value: string): string => value.toLowerCase();\n  const where = (t: Term): string => `${t.location.file}:${String(t.location.line)}`;\n  const onEntry = (t: Term, rule: TermRule, message: string, field?: TermField): Draft => ({\n    rule,\n    message,\n    file: t.location.file,\n    line: (field === undefined ? undefined : t.location.fieldLines[field]) ?? t.location.line,\n    id: t.id,\n    ...(field === undefined ? {} : { field }),\n  });\n\n  // The first entry claiming each folded label, and each folded id, overall\n  // and per language.\n  const byLabel = new Map<string, number>();\n  const byId = new Map<string, number>();\n  const inLanguage = new Map<string, number>();\n  // Every entry per folded label, in set order, for the collision rules.\n  const labelled = new Map<string, number[]>();\n  const claim = (map: Map<string, number>, key: string, index: number): void => {\n    if (!map.has(key)) map.set(key, index);\n  };\n  terms.forEach((t, index) => {\n    claim(byLabel, fold(t.record.label), index);\n    const group = labelled.get(fold(t.record.label));\n    if (group === undefined) labelled.set(fold(t.record.label), [index]);\n    else group.push(index);\n    claim(byId, fold(t.id), index);\n    claim(inLanguage, `${language(t)} label ${fold(t.record.label)}`, index);\n    claim(inLanguage, `${language(t)} id ${fold(t.id)}`, index);\n  });\n  /** Whether `t`'s label `a` collides with `other`'s label `b`: within a language when they fold alike, across languages only when their spelling differs too. */\n  const clash = (t: Term, a: string, other: Term, b: string): boolean =>\n    fold(a) === fold(b) && (language(t) === language(other) || a !== b);\n  /** The first entry other than `index` whose label collides with `value` on `t`, among those `before` allows. */\n  const collider = (t: Term, index: number, value: string, before: boolean): Term | undefined => {\n    for (const otherIndex of labelled.get(fold(value)) ?? []) {\n      if (otherIndex === index || (before && otherIndex > index)) continue;\n      const other = terms[otherIndex];\n      if (other !== undefined && clash(t, value, other, other.record.label)) return other;\n    }\n    return undefined;\n  };\n\n  // A same-language label, then a same-language id, then any language.\n  const resolveReference = (from: Term, value: string): number | undefined =>\n    inLanguage.get(`${language(from)} label ${fold(value)}`) ??\n    inLanguage.get(`${language(from)} id ${fold(value)}`) ??\n    byLabel.get(fold(value)) ??\n    byId.get(fold(value));\n\n  // undefined-term, and the folded labels some page names, for unused-term.\n  const referenced = new Set<string>();\n  for (const reference of set.references) {\n    const label = fold(reference.label);\n    referenced.add(label);\n    if (byLabel.has(label)) continue;\n    let message = `concepts: \"${reference.label}\" names no entry.`;\n    const synonym = terms.find((t) => (t.record[\"alt-labels\"] ?? []).some((alt) => fold(alt) === label));\n    if (synonym !== undefined) {\n      message += ` \"${synonym.record.label}\" lists it as an alt-label.`;\n    }\n    drafts.push({\n      rule: \"undefined-term\",\n      message,\n      file: reference.file,\n      ...(reference.line === undefined ? {} : { line: reference.line }),\n    });\n  }\n\n  // unused-term: a term is used when a page names any term sharing its id.\n  const usedIds = new Set(terms.filter((t) => referenced.has(fold(t.record.label))).map((t) => fold(t.id)));\n\n  // duplicate-id: ignoring case, as references resolve ids, on every entry\n  // sharing the id in one language.\n  const sharing = new Map<string, Term[]>();\n  for (const t of terms) {\n    const id = `${language(t)} ${fold(t.id)}`;\n    const group = sharing.get(id);\n    if (group === undefined) sharing.set(id, [t]);\n    else group.push(t);\n  }\n  for (const group of sharing.values()) {\n    if (group.length < 2) continue;\n    for (const t of group) {\n      const others = group.filter((other) => other !== t).map(where);\n      drafts.push(onEntry(t, \"duplicate-id\", `id: \"${t.id}\" is also used by ${others.join(\", \")}`));\n    }\n  }\n\n  terms.forEach((t, index) => {\n    // label-collision: on each later entry, naming the first.\n    const firstTerm = collider(t, index, t.record.label, true);\n    if (firstTerm !== undefined) {\n      drafts.push(\n        onEntry(\n          t,\n          \"label-collision\",\n          `\"${t.record.label}\" is claimed by ${where(firstTerm)} as \"${firstTerm.record.label}\"`,\n          \"label\",\n        ),\n      );\n    }\n\n    // alt-label-collision: an alt-label that is another entry's label.\n    for (const alt of t.record[\"alt-labels\"] ?? []) {\n      const owner = collider(t, index, alt, false);\n      if (owner !== undefined) {\n        drafts.push(\n          onEntry(t, \"alt-label-collision\", `alt-labels: \"${alt}\" is the label of ${where(owner)}`, \"alt-labels\"),\n        );\n      }\n    }\n\n    // dangling-reference: one finding per value that resolves to nothing.\n    for (const field of REFERENCE_FIELDS) {\n      for (const value of referenceValues(t, field)) {\n        if (resolveReference(t, value) === undefined) {\n          drafts.push(onEntry(t, \"dangling-reference\", `${field}: \"${value}\" names no entry`, field));\n        }\n      }\n    }\n\n    // see-not-empty: a redirect carries no definition.\n    if (t.record.see !== undefined && t.record.definition !== undefined) {\n      drafts.push(\n        onEntry(t, \"see-not-empty\", `see: \"${t.record.see}\" redirects this entry, so remove its definition`, \"see\"),\n      );\n    }\n\n    // abstract-too-long.\n    const abstract = t.record.abstract;\n    if (abstract !== undefined && abstract.length > maxLength) {\n      drafts.push(\n        onEntry(\n          t,\n          \"abstract-too-long\",\n          `abstract: ${String(abstract.length)} characters is over the limit of ${String(maxLength)}, so shorten it`,\n          \"abstract\",\n        ),\n      );\n    }\n\n    // unused-term: no reference names the label of any term sharing the id.\n    if (!usedIds.has(fold(t.id))) {\n      drafts.push(onEntry(t, \"unused-term\", \"no page's concepts: names this term\"));\n    }\n  });\n\n  // The resolved hierarchy, one edge per pair.\n  const edges = (field: \"broader\" | \"narrower\"): Set<number>[] =>\n    terms.map((t) => {\n      const targets = new Set<number>();\n      for (const value of referenceValues(t, field)) {\n        const target = resolveReference(t, value);\n        if (target !== undefined) targets.add(target);\n      }\n      return targets;\n    });\n  const broader = edges(\"broader\");\n  const narrower = edges(\"narrower\");\n\n  // asymmetric-hierarchy: each missing half, on the entry that should carry it.\n  terms.forEach((t, index) => {\n    for (const parent of broader[index] ?? []) {\n      const parentTerm = terms[parent];\n      if (parentTerm !== undefined && !(narrower[parent]?.has(index) ?? false)) {\n        drafts.push(\n          onEntry(\n            parentTerm,\n            \"asymmetric-hierarchy\",\n            `narrower: omits \"${t.record.label}\", which lists this entry as broader`,\n            \"narrower\",\n          ),\n        );\n      }\n    }\n    for (const child of narrower[index] ?? []) {\n      const childTerm = terms[child];\n      if (childTerm !== undefined && !(broader[child]?.has(index) ?? false)) {\n        drafts.push(\n          onEntry(\n            childTerm,\n            \"asymmetric-hierarchy\",\n            `broader: omits \"${t.record.label}\", which lists this entry as narrower`,\n            \"broader\",\n          ),\n        );\n      }\n    }\n  });\n\n  // broader-cycle: every elementary cycle once, found from its earliest entry.\n  for (const [start, path] of broaderCycles(broader)) {\n    const startTerm = terms[start];\n    if (startTerm === undefined) continue;\n    const labels = [...path, start].map((index) => terms[index]?.record.label ?? \"\");\n    drafts.push(onEntry(startTerm, \"broader-cycle\", `broader: ${labels.join(\" > \")}`, \"broader\"));\n  }\n\n  const findings: TermFinding[] = [];\n  for (const draft of drafts) {\n    const level = levels[draft.rule];\n    if (level === \"off\") continue;\n    findings.push({\n      rule: draft.rule,\n      ruleId: ruleId(draft.rule),\n      severity: level,\n      message: draft.message,\n      file: draft.file,\n      ...(draft.line === undefined ? {} : { line: draft.line }),\n      ...(draft.id === undefined ? {} : { id: draft.id }),\n      ...(draft.field === undefined ? {} : { field: draft.field }),\n    });\n  }\n  return findings.sort(compareFindings);\n}\n\nfunction referenceValues(t: Term, field: ReferenceField): string[] {\n  const value = t.record[field];\n  if (value === undefined) return [];\n  return typeof value === \"string\" ? [value] : value;\n}\n\n/**\n * Each elementary cycle of the `broader` graph, as its start and the path from\n * it. A search from `start` only visits later entries, so a cycle is found\n * exactly once, from the entry of it that comes first in set order.\n */\nfunction broaderCycles(broader: readonly Set<number>[]): [number, number[]][] {\n  const cycles: [number, number[]][] = [];\n  for (let start = 0; start < broader.length; start++) {\n    const path: number[] = [start];\n    const onPath = new Set<number>([start]);\n    const walk = (node: number): void => {\n      for (const next of broader[node] ?? []) {\n        if (next === start) {\n          cycles.push([start, [...path]]);\n        } else if (next > start && !onPath.has(next)) {\n          path.push(next);\n          onPath.add(next);\n          walk(next);\n          path.pop();\n          onPath.delete(next);\n        }\n      }\n    };\n    walk(start);\n  }\n  return cycles;\n}\n\nfunction compareText(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction compareFindings(a: TermFinding, b: TermFinding): number {\n  return (\n    compareText(a.file, b.file) ||\n    (a.line ?? 0) - (b.line ?? 0) ||\n    compareText(a.ruleId, b.ruleId) ||\n    compareText(a.message, b.message)\n  );\n}\n","/**\n * The report `check` and `lint` share, and the bridge from term findings to\n * meta's `ValidationResult`, so the SARIF and JUnit renderers and the baseline\n * ratchet work unchanged, as cite's adapter does for citations.\n *\n * FieldError: schema `manni:term` (a builtin-shaped ref, so fingerprints and\n * rule ids never depend on where the command ran), keyword = the rule id after\n * `manni:term/`, instancePath `/<field>` when the finding concerns one field\n * and `\"\"` when it concerns none (`undefined-term`, `duplicate-id`,\n * `unused-term`). A check finding and a lint finding carry the field the same\n * way. The subject is the entry, the field, and what the finding says, with any\n * `file:line` taken out: a line moves when a page is edited above the entry,\n * and a moved finding is not a new one.\n */\nimport {\n  isErrorSeverity,\n  type BaselineSummary,\n  type FieldError,\n  type FingerprintContext,\n  type RunSummary,\n  type ValidationResult,\n} from \"../../meta/index.js\";\nimport { RULE_ID_PREFIX } from \"../core/severity.js\";\nimport type { TermFinding, TermSet } from \"../types.js\";\n\nexport const FINDING_FORMATS = [\"pretty\", \"json\", \"github\", \"sarif\", \"junit\"] as const;\nexport type FindingFormat = (typeof FINDING_FORMATS)[number];\n\n/** JUnit `classname` for the term tool's findings. */\nexport const JUNIT_CLASSNAME = \"manni.term\";\n\n/** What `check` and `lint` return. */\nexport interface TermReport {\n  /** The findings reported: a baselined one is not among them. */\n  findings: TermFinding[];\n  /** The same findings as meta's results, for SARIF and JUnit. One per file. */\n  results: ValidationResult[];\n  summary: RunSummary;\n  frame: FingerprintContext;\n  /** Entries in the set. */\n  terms: number;\n  /** `concepts:` values the run read. */\n  references: number;\n  /** How a baseline shaped the run, when one did. */\n  baseline?: BaselineSummary;\n  /** Findings before the baseline, for the line a recording run prints. */\n  found: number;\n  /** Where the run stood, for the paths the reporters print. */\n  cwd: string;\n}\n\nconst LINE_REFERENCE = /:\\d+\\b/g;\n\nfunction toFieldError(finding: TermFinding): FieldError {\n  const keyword = finding.ruleId.startsWith(`${RULE_ID_PREFIX}/`)\n    ? finding.ruleId.slice(RULE_ID_PREFIX.length + 1)\n    : finding.ruleId;\n  const { field } = finding;\n  const subject = [finding.id ?? \"\", field ?? \"\", finding.message.replace(LINE_REFERENCE, \"\")].join(\"\\u0000\");\n  const error: FieldError = {\n    schema: RULE_ID_PREFIX,\n    instancePath: field === undefined ? \"\" : `/${field}`,\n    message: finding.message,\n    keyword,\n    subject,\n    severity: finding.severity,\n  };\n  if (finding.line !== undefined) error.line = finding.line;\n  return error;\n}\n\n/**\n * One result per file: every file a term was read from, clean or not, and\n * every file a finding sits in. `origin` maps each error back to its finding.\n */\nexport function toResults(\n  set: TermSet,\n  findings: readonly TermFinding[],\n): { results: ValidationResult[]; origin: Map<FieldError, TermFinding> } {\n  const origin = new Map<FieldError, TermFinding>();\n  const byFile = new Map<string, FieldError[]>();\n  for (const term of set.terms) {\n    if (!byFile.has(term.location.file)) byFile.set(term.location.file, []);\n  }\n  for (const finding of findings) {\n    const error = toFieldError(finding);\n    origin.set(error, finding);\n    const list = byFile.get(finding.file) ?? [];\n    list.push(error);\n    byFile.set(finding.file, list);\n  }\n  const results = [...byFile.keys()].sort().map((file): ValidationResult => {\n    const errors = byFile.get(file) ?? [];\n    return { file, format: \"term\", ok: !errors.some(isErrorSeverity), schemas: [RULE_ID_PREFIX], errors };\n  });\n  return { results, origin };\n}\n\n/** The run summary meta's renderers read, from results a baseline may have thinned. */\nexport function summarize(results: readonly ValidationResult[], baseline?: BaselineSummary): RunSummary {\n  const failed = results.filter((r) => !r.ok).length;\n  const count = (keep: (e: FieldError) => boolean): number =>\n    results.reduce((n, r) => n + r.errors.filter(keep).length, 0);\n  const warnings = count((e) => e.severity === \"warning\");\n  const notices = count((e) => e.severity === \"notice\");\n  return {\n    files: results.length,\n    passed: results.length - failed,\n    failed,\n    errors: count(isErrorSeverity),\n    ...(warnings > 0 ? { warnings } : {}),\n    ...(notices > 0 ? { notices } : {}),\n    ...(baseline ? { baseline } : {}),\n  };\n}\n\n/** The findings still reported once a baseline has thinned the results. */\nexport function reportedFindings(\n  results: readonly ValidationResult[],\n  origin: ReadonlyMap<FieldError, TermFinding>,\n): TermFinding[] {\n  const kept: TermFinding[] = [];\n  for (const result of results) {\n    for (const error of result.errors) {\n      const finding = origin.get(error);\n      if (finding !== undefined) kept.push(finding);\n    }\n  }\n  return kept.sort(compareFindings);\n}\n\nfunction compareFindings(a: TermFinding, b: TermFinding): number {\n  if (a.file !== b.file) return a.file < b.file ? -1 : 1;\n  const lineA = a.line ?? 0;\n  const lineB = b.line ?? 0;\n  if (lineA !== lineB) return lineA - lineB;\n  if (a.ruleId !== b.ruleId) return a.ruleId < b.ruleId ? -1 : 1;\n  return a.message < b.message ? -1 : a.message > b.message ? 1 : 0;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAUA,SAAS,kBAAkB;;;ACDpB,IAAM,iBAAiB;AAEvB,IAAM,mBAA6D;AAAA,EACxE,kBAAkB;AAAA,EAClB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,wBAAwB;AAAA,EACxB,qBAAqB;AAAA,EACrB,eAAe;AACjB;AAEO,SAAS,OAAO,MAAwB;AAC7C,SAAO,GAAG,cAAc,IAAI,IAAI;AAClC;AAEO,SAAS,YAAY,OAAuB;AACjD,SAAO,GAAG,cAAc,UAAU,KAAK;AACzC;AAEO,SAAS,WAAW,OAAkC;AAC3D,SAAQ,WAAiC,SAAS,KAAK;AACzD;AAGO,SAAS,gBACd,WACgC;AAChC,SAAO,EAAE,GAAG,kBAAkB,GAAG,UAAU;AAC7C;AAMO,SAAS,iBAAiB,UAAkC;AACjE,SAAO,aAAa,eAAe,WAAW;AAChD;;;ACrBA,IAAM,mBAAmB;AAYlB,SAAS,aAAa,KAAc,OAA4B,CAAC,GAAkB;AACxF,QAAM,SAAS,gBAAgB,KAAK,QAAQ;AAC5C,QAAM,YAAY,KAAK,qBAAqB;AAC5C,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,SAAkB,CAAC;AAEzB,QAAM,OAAO,CAAC,UAA0B,MAAM,YAAY;AAC1D,QAAM,QAAQ,CAAC,MAAoB,GAAG,EAAE,SAAS,IAAI,IAAI,OAAO,EAAE,SAAS,IAAI,CAAC;AAChF,QAAM,UAAU,CAAC,GAAS,MAAgB,SAAiB,WAA8B;AAAA,IACvF;AAAA,IACA;AAAA,IACA,MAAM,EAAE,SAAS;AAAA,IACjB,OAAO,UAAU,SAAY,SAAY,EAAE,SAAS,WAAW,KAAK,MAAM,EAAE,SAAS;AAAA,IACrF,IAAI,EAAE;AAAA,IACN,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,EACzC;AAIA,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,OAAO,oBAAI,IAAoB;AACrC,QAAM,aAAa,oBAAI,IAAoB;AAE3C,QAAM,WAAW,oBAAI,IAAsB;AAC3C,QAAM,QAAQ,CAAC,KAA0B,KAAa,UAAwB;AAC5E,QAAI,CAAC,IAAI,IAAI,GAAG,EAAG,KAAI,IAAI,KAAK,KAAK;AAAA,EACvC;AACA,QAAM,QAAQ,CAAC,GAAG,UAAU;AAC1B,UAAM,SAAS,KAAK,EAAE,OAAO,KAAK,GAAG,KAAK;AAC1C,UAAM,QAAQ,SAAS,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC;AAC/C,QAAI,UAAU,OAAW,UAAS,IAAI,KAAK,EAAE,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC;AAAA,QAC9D,OAAM,KAAK,KAAK;AACrB,UAAM,MAAM,KAAK,EAAE,EAAE,GAAG,KAAK;AAC7B,UAAM,YAAY,GAAG,YAAS,CAAC,CAAC,UAAU,KAAK,EAAE,OAAO,KAAK,CAAC,IAAI,KAAK;AACvE,UAAM,YAAY,GAAG,YAAS,CAAC,CAAC,OAAO,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK;AAAA,EAC5D,CAAC;AAED,QAAM,QAAQ,CAAC,GAAS,GAAW,OAAa,MAC9C,KAAK,CAAC,MAAM,KAAK,CAAC,MAAM,YAAS,CAAC,MAAM,YAAS,KAAK,KAAK,MAAM;AAEnE,QAAM,WAAW,CAAC,GAAS,OAAe,OAAe,WAAsC;AAC7F,eAAW,cAAc,SAAS,IAAI,KAAK,KAAK,CAAC,KAAK,CAAC,GAAG;AACxD,UAAI,eAAe,SAAU,UAAU,aAAa,MAAQ;AAC5D,YAAM,QAAQ,MAAM,UAAU;AAC9B,UAAI,UAAU,UAAa,MAAM,GAAG,OAAO,OAAO,MAAM,OAAO,KAAK,EAAG,QAAO;AAAA,IAChF;AACA,WAAO;AAAA,EACT;AAGA,QAAM,mBAAmB,CAAC,MAAY,UACpC,WAAW,IAAI,GAAG,YAAS,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,EAAE,KACvD,WAAW,IAAI,GAAG,YAAS,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,EAAE,KACpD,QAAQ,IAAI,KAAK,KAAK,CAAC,KACvB,KAAK,IAAI,KAAK,KAAK,CAAC;AAGtB,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,aAAa,IAAI,YAAY;AACtC,UAAM,QAAQ,KAAK,UAAU,KAAK;AAClC,eAAW,IAAI,KAAK;AACpB,QAAI,QAAQ,IAAI,KAAK,EAAG;AACxB,QAAI,UAAU,cAAc,UAAU,KAAK;AAC3C,UAAM,UAAU,MAAM,KAAK,CAAC,OAAO,EAAE,OAAO,YAAY,KAAK,CAAC,GAAG,KAAK,CAAC,QAAQ,KAAK,GAAG,MAAM,KAAK,CAAC;AACnG,QAAI,YAAY,QAAW;AACzB,iBAAW,KAAK,QAAQ,OAAO,KAAK;AAAA,IACtC;AACA,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN;AAAA,MACA,MAAM,UAAU;AAAA,MAChB,GAAI,UAAU,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,UAAU,KAAK;AAAA,IACjE,CAAC;AAAA,EACH;AAGA,QAAM,UAAU,IAAI,IAAI,MAAM,OAAO,CAAC,MAAM,WAAW,IAAI,KAAK,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC,CAAC;AAIxG,QAAM,UAAU,oBAAI,IAAoB;AACxC,aAAW,KAAK,OAAO;AACrB,UAAM,KAAK,GAAG,YAAS,CAAC,CAAC,IAAI,KAAK,EAAE,EAAE,CAAC;AACvC,UAAM,QAAQ,QAAQ,IAAI,EAAE;AAC5B,QAAI,UAAU,OAAW,SAAQ,IAAI,IAAI,CAAC,CAAC,CAAC;AAAA,QACvC,OAAM,KAAK,CAAC;AAAA,EACnB;AACA,aAAW,SAAS,QAAQ,OAAO,GAAG;AACpC,QAAI,MAAM,SAAS,EAAG;AACtB,eAAW,KAAK,OAAO;AACrB,YAAM,SAAS,MAAM,OAAO,CAAC,UAAU,UAAU,CAAC,EAAE,IAAI,KAAK;AAC7D,aAAO,KAAK,QAAQ,GAAG,gBAAgB,QAAQ,EAAE,EAAE,qBAAqB,OAAO,KAAK,IAAI,CAAC,EAAE,CAAC;AAAA,IAC9F;AAAA,EACF;AAEA,QAAM,QAAQ,CAAC,GAAG,UAAU;AAE1B,UAAM,YAAY,SAAS,GAAG,OAAO,EAAE,OAAO,OAAO,IAAI;AACzD,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,QACL;AAAA,UACE;AAAA,UACA;AAAA,UACA,IAAI,EAAE,OAAO,KAAK,mBAAmB,MAAM,SAAS,CAAC,QAAQ,UAAU,OAAO,KAAK;AAAA,UACnF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,eAAW,OAAO,EAAE,OAAO,YAAY,KAAK,CAAC,GAAG;AAC9C,YAAM,QAAQ,SAAS,GAAG,OAAO,KAAK,KAAK;AAC3C,UAAI,UAAU,QAAW;AACvB,eAAO;AAAA,UACL,QAAQ,GAAG,uBAAuB,gBAAgB,GAAG,qBAAqB,MAAM,KAAK,CAAC,IAAI,YAAY;AAAA,QACxG;AAAA,MACF;AAAA,IACF;AAGA,eAAW,SAAS,kBAAkB;AACpC,iBAAW,SAAS,gBAAgB,GAAG,KAAK,GAAG;AAC7C,YAAI,iBAAiB,GAAG,KAAK,MAAM,QAAW;AAC5C,iBAAO,KAAK,QAAQ,GAAG,sBAAsB,GAAG,KAAK,MAAM,KAAK,oBAAoB,KAAK,CAAC;AAAA,QAC5F;AAAA,MACF;AAAA,IACF;AAGA,QAAI,EAAE,OAAO,QAAQ,UAAa,EAAE,OAAO,eAAe,QAAW;AACnE,aAAO;AAAA,QACL,QAAQ,GAAG,iBAAiB,SAAS,EAAE,OAAO,GAAG,oDAAoD,KAAK;AAAA,MAC5G;AAAA,IACF;AAGA,UAAM,WAAW,EAAE,OAAO;AAC1B,QAAI,aAAa,UAAa,SAAS,SAAS,WAAW;AACzD,aAAO;AAAA,QACL;AAAA,UACE;AAAA,UACA;AAAA,UACA,aAAa,OAAO,SAAS,MAAM,CAAC,oCAAoC,OAAO,SAAS,CAAC;AAAA,UACzF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,QAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,EAAE,CAAC,GAAG;AAC5B,aAAO,KAAK,QAAQ,GAAG,eAAe,qCAAqC,CAAC;AAAA,IAC9E;AAAA,EACF,CAAC;AAGD,QAAM,QAAQ,CAAC,UACb,MAAM,IAAI,CAAC,MAAM;AACf,UAAM,UAAU,oBAAI,IAAY;AAChC,eAAW,SAAS,gBAAgB,GAAG,KAAK,GAAG;AAC7C,YAAM,SAAS,iBAAiB,GAAG,KAAK;AACxC,UAAI,WAAW,OAAW,SAAQ,IAAI,MAAM;AAAA,IAC9C;AACA,WAAO;AAAA,EACT,CAAC;AACH,QAAM,UAAU,MAAM,SAAS;AAC/B,QAAM,WAAW,MAAM,UAAU;AAGjC,QAAM,QAAQ,CAAC,GAAG,UAAU;AAC1B,eAAW,UAAU,QAAQ,KAAK,KAAK,CAAC,GAAG;AACzC,YAAM,aAAa,MAAM,MAAM;AAC/B,UAAI,eAAe,UAAa,EAAE,SAAS,MAAM,GAAG,IAAI,KAAK,KAAK,QAAQ;AACxE,eAAO;AAAA,UACL;AAAA,YACE;AAAA,YACA;AAAA,YACA,oBAAoB,EAAE,OAAO,KAAK;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,eAAW,SAAS,SAAS,KAAK,KAAK,CAAC,GAAG;AACzC,YAAM,YAAY,MAAM,KAAK;AAC7B,UAAI,cAAc,UAAa,EAAE,QAAQ,KAAK,GAAG,IAAI,KAAK,KAAK,QAAQ;AACrE,eAAO;AAAA,UACL;AAAA,YACE;AAAA,YACA;AAAA,YACA,mBAAmB,EAAE,OAAO,KAAK;AAAA,YACjC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AAGD,aAAW,CAAC,OAAO,IAAI,KAAK,cAAc,OAAO,GAAG;AAClD,UAAM,YAAY,MAAM,KAAK;AAC7B,QAAI,cAAc,OAAW;AAC7B,UAAM,SAAS,CAAC,GAAG,MAAM,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,KAAK,GAAG,OAAO,SAAS,EAAE;AAC/E,WAAO,KAAK,QAAQ,WAAW,iBAAiB,YAAY,OAAO,KAAK,KAAK,CAAC,IAAI,SAAS,CAAC;AAAA,EAC9F;AAEA,QAAM,WAA0B,CAAC;AACjC,aAAW,SAAS,QAAQ;AAC1B,UAAM,QAAQ,OAAO,MAAM,IAAI;AAC/B,QAAI,UAAU,MAAO;AACrB,aAAS,KAAK;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,QAAQ,OAAO,MAAM,IAAI;AAAA,MACzB,UAAU;AAAA,MACV,SAAS,MAAM;AAAA,MACf,MAAM,MAAM;AAAA,MACZ,GAAI,MAAM,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,MAAM,KAAK;AAAA,MACvD,GAAI,MAAM,OAAO,SAAY,CAAC,IAAI,EAAE,IAAI,MAAM,GAAG;AAAA,MACjD,GAAI,MAAM,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,MAAM,MAAM;AAAA,IAC5D,CAAC;AAAA,EACH;AACA,SAAO,SAAS,KAAK,eAAe;AACtC;AAEA,SAAS,gBAAgB,GAAS,OAAiC;AACjE,QAAM,QAAQ,EAAE,OAAO,KAAK;AAC5B,MAAI,UAAU,OAAW,QAAO,CAAC;AACjC,SAAO,OAAO,UAAU,WAAW,CAAC,KAAK,IAAI;AAC/C;AAOA,SAAS,cAAc,SAAuD;AAC5E,QAAM,SAA+B,CAAC;AACtC,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACnD,UAAM,OAAiB,CAAC,KAAK;AAC7B,UAAM,SAAS,oBAAI,IAAY,CAAC,KAAK,CAAC;AACtC,UAAM,OAAO,CAAC,SAAuB;AACnC,iBAAW,QAAQ,QAAQ,IAAI,KAAK,CAAC,GAAG;AACtC,YAAI,SAAS,OAAO;AAClB,iBAAO,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AAAA,QAChC,WAAW,OAAO,SAAS,CAAC,OAAO,IAAI,IAAI,GAAG;AAC5C,eAAK,KAAK,IAAI;AACd,iBAAO,IAAI,IAAI;AACf,eAAK,IAAI;AACT,eAAK,IAAI;AACT,iBAAO,OAAO,IAAI;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AACA,SAAK,KAAK;AAAA,EACZ;AACA,SAAO;AACT;AAEA,SAAS,YAAY,GAAW,GAAmB;AACjD,SAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAEA,SAAS,gBAAgB,GAAgB,GAAwB;AAC/D,SACE,YAAY,EAAE,MAAM,EAAE,IAAI,MACzB,EAAE,QAAQ,MAAM,EAAE,QAAQ,MAC3B,YAAY,EAAE,QAAQ,EAAE,MAAM,KAC9B,YAAY,EAAE,SAAS,EAAE,OAAO;AAEpC;;;AC3RO,IAAM,kBAAkB,CAAC,UAAU,QAAQ,UAAU,SAAS,OAAO;AAIrE,IAAM,kBAAkB;AAsB/B,IAAM,iBAAiB;AAEvB,SAAS,aAAa,SAAkC;AACtD,QAAM,UAAU,QAAQ,OAAO,WAAW,GAAG,cAAc,GAAG,IAC1D,QAAQ,OAAO,MAAM,eAAe,SAAS,CAAC,IAC9C,QAAQ;AACZ,QAAM,EAAE,MAAM,IAAI;AAClB,QAAM,UAAU,CAAC,QAAQ,MAAM,IAAI,SAAS,IAAI,QAAQ,QAAQ,QAAQ,gBAAgB,EAAE,CAAC,EAAE,KAAK,IAAQ;AAC1G,QAAM,QAAoB;AAAA,IACxB,QAAQ;AAAA,IACR,cAAc,UAAU,SAAY,KAAK,IAAI,KAAK;AAAA,IAClD,SAAS,QAAQ;AAAA,IACjB;AAAA,IACA;AAAA,IACA,UAAU,QAAQ;AAAA,EACpB;AACA,MAAI,QAAQ,SAAS,OAAW,OAAM,OAAO,QAAQ;AACrD,SAAO;AACT;AAMO,SAAS,UACd,KACA,UACuE;AACvE,QAAM,SAAS,oBAAI,IAA6B;AAChD,QAAM,SAAS,oBAAI,IAA0B;AAC7C,aAAW,QAAQ,IAAI,OAAO;AAC5B,QAAI,CAAC,OAAO,IAAI,KAAK,SAAS,IAAI,EAAG,QAAO,IAAI,KAAK,SAAS,MAAM,CAAC,CAAC;AAAA,EACxE;AACA,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,aAAa,OAAO;AAClC,WAAO,IAAI,OAAO,OAAO;AACzB,UAAM,OAAO,OAAO,IAAI,QAAQ,IAAI,KAAK,CAAC;AAC1C,SAAK,KAAK,KAAK;AACf,WAAO,IAAI,QAAQ,MAAM,IAAI;AAAA,EAC/B;AACA,QAAM,UAAU,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,SAA2B;AACxE,UAAM,SAAS,OAAO,IAAI,IAAI,KAAK,CAAC;AACpC,WAAO,EAAE,MAAM,QAAQ,QAAQ,IAAI,CAAC,OAAO,KAAK,eAAe,GAAG,SAAS,CAAC,cAAc,GAAG,OAAO;AAAA,EACtG,CAAC;AACD,SAAO,EAAE,SAAS,OAAO;AAC3B;AAGO,SAAS,UAAU,SAAsC,UAAwC;AACtG,QAAM,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE;AAC5C,QAAM,QAAQ,CAAC,SACb,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,OAAO,IAAI,EAAE,QAAQ,CAAC;AAC9D,QAAM,WAAW,MAAM,CAAC,MAAM,EAAE,aAAa,SAAS;AACtD,QAAM,UAAU,MAAM,CAAC,MAAM,EAAE,aAAa,QAAQ;AACpD,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf,QAAQ,QAAQ,SAAS;AAAA,IACzB;AAAA,IACA,QAAQ,MAAM,eAAe;AAAA,IAC7B,GAAI,WAAW,IAAI,EAAE,SAAS,IAAI,CAAC;AAAA,IACnC,GAAI,UAAU,IAAI,EAAE,QAAQ,IAAI,CAAC;AAAA,IACjC,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,EACjC;AACF;AAGO,SAAS,iBACd,SACA,QACe;AACf,QAAM,OAAsB,CAAC;AAC7B,aAAW,UAAU,SAAS;AAC5B,eAAW,SAAS,OAAO,QAAQ;AACjC,YAAM,UAAU,OAAO,IAAI,KAAK;AAChC,UAAI,YAAY,OAAW,MAAK,KAAK,OAAO;AAAA,IAC9C;AAAA,EACF;AACA,SAAO,KAAK,KAAKA,gBAAe;AAClC;AAEA,SAASA,iBAAgB,GAAgB,GAAwB;AAC/D,MAAI,EAAE,SAAS,EAAE,KAAM,QAAO,EAAE,OAAO,EAAE,OAAO,KAAK;AACrD,QAAM,QAAQ,EAAE,QAAQ;AACxB,QAAM,QAAQ,EAAE,QAAQ;AACxB,MAAI,UAAU,MAAO,QAAO,QAAQ;AACpC,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO,EAAE,SAAS,EAAE,SAAS,KAAK;AAC7D,SAAO,EAAE,UAAU,EAAE,UAAU,KAAK,EAAE,UAAU,EAAE,UAAU,IAAI;AAClE;;;AHnHA,eAAsB,SAAS,MAAyC;AACtE,QAAM,EAAE,KAAK,KAAK,IAAI,IAAI,MAAM,UAAU,IAAI;AAC9C,QAAM,SAAS,IAAI;AACnB,QAAM,WAAW,aAAa,KAAK;AAAA,IACjC,GAAI,QAAQ,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,OAAO,SAAS;AAAA,IACtE,GAAI,QAAQ,sBAAsB,SAAY,CAAC,IAAI,EAAE,mBAAmB,OAAO,kBAAkB;AAAA,EACnG,CAAC;AACD,QAAM,EAAE,SAAS,OAAO,IAAI,UAAU,KAAK,QAAQ;AAGnD,QAAM,QAAQ,EAAE,KAAK,MAAM,IAAI,aAAa,KAAK,SAAS,IAAI,KAAK;AACnE,MAAI,UAAU;AAAA,IACZ,KAAK,aAAa,OAAO,EAAE,UAAU,KAAK,IAAI,CAAC;AAAA,IAC/C,QAAQ;AAAA,IACR,IAAI;AAAA,IACJ;AAAA,IACA,EAAE,SAAS,2BAA2B;AAAA,EACxC;AACA,MAAI,YAAY,QAAQ,CAAC,WAAW,QAAQ,OAAO,GAAG;AACpD,QAAI,KAAK,aAAa,MAAM;AAC1B,YAAM,IAAI;AAAA,QACR,aAAa,QAAQ,KAAK;AAAA,MAC5B;AAAA,IACF;AACA,cAAU,EAAE,GAAG,SAAS,OAAO,KAAK;AAAA,EACtC;AACA,QAAM,EAAE,SAAS,UAAU,SAAS,IAAI,MAAM,eAAe,SAAS,SAAS,KAAK;AAEpF,SAAO;AAAA,IACL,UAAU,iBAAiB,UAAU,MAAM;AAAA,IAC3C,SAAS;AAAA,IACT,SAAS,UAAU,UAAU,QAAQ;AAAA,IACrC;AAAA,IACA,OAAO,IAAI,MAAM;AAAA,IACjB,YAAY,IAAI,WAAW;AAAA,IAC3B,GAAI,aAAa,SAAY,CAAC,IAAI,EAAE,SAAS;AAAA,IAC7C,OAAO,SAAS;AAAA,IAChB;AAAA,EACF;AACF;","names":["compareFindings"]}