@inklyre/oes-lint 0.1.0

package/README.md

@@ -0,0 +1,94 @@
+# @inklyre/oes-lint
+
+Referential-integrity linting for [OES](https://github.com/inklyre/oes) content, built on
+[`@inklyre/oes-core`](../core)'s `resolve()` rather than reimplementing a
+second tree-walker.
+
+## Install
+
+```bash
+npm install -D @inklyre/oes-lint
+```
+
+## CLI
+
+```bash
+npx oes lint ./my-course
+npx oes lint ./my-set --entry set.json
+npx oes lint ./my-course --json   # machine-readable output, e.g. for a GitHub Action
+```
+
+Exits `0` when no `"error"`-severity issue is found, `1` otherwise. The
+entry document (`course.json`/`set.json`/`module.json`/`lesson.json`) is
+auto-detected from the given directory unless `--entry` is passed.
+
+## GitHub Action
+
+Since OES content lives in git, lint-on-every-PR is a near-zero-friction
+way to keep a course/set repo trustworthy. Any repo can use this one's
+composite action without installing anything first:
+
+```yaml
+# .github/workflows/lint.yml, in a course/set repo (not this one)
+on: pull_request
+jobs:
+  lint:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: inklyre/oes/.github/actions/lint@main
+        with:
+          path: ./my-course
+```
+
+## What it checks
+
+Everything `resolve()` already catches while walking the tree:
+
+- **Dangling references** — a `path`/`*_url` that doesn't resolve, or a
+  document that fails schema validation.
+- **`content_hash` mismatches** — a declared hash that doesn't match the
+  referenced document's actual content.
+
+Plus checks that need a whole-tree or single-document view `resolve()`
+doesn't attempt on its own:
+
+- **Duplicate ids** — within any array addressed by `id`: `course.modules`,
+  a module's `lessons`, a lesson's `articles`/`video_lessons`/`practice_sets`,
+  a set's `questions`, a pool's `from`, and every question type's own
+  id-bearing array (`options`, `left`/`right`, `items`, `blanks`,
+  `test_cases`, `labels`).
+- **Pool `select` bounds** — a pool's `select` must be between 1 and
+  `from.length`; not expressible in JSON Schema since it relates two
+  sibling fields.
+- **Dangling answer cross-references** — an `mcq`/`msq` `answer`(s), a
+  `match` pair's `left_id`/`right_id`, or an `order`'s `correct_order`
+  pointing at an id that doesn't exist in the corresponding option array.
+  Only checked in self-practice mode: a secured `answer_key` means there's
+  no inline answer to check.
+- **`answer_key.file` existence** — checked directly by this package, not
+  by `resolve()`, which deliberately never fetches `answer_key` content at
+  all: a public/student-facing consumer built on
+  `resolveCourse`/`resolveSet` must never gain a path to the answer through
+  the shared resolver.
+
+## Programmatic API
+
+```ts
+import { fsSource } from "@inklyre/oes-core";
+import { lintCourse } from "@inklyre/oes-lint";
+
+const { issues, ok } = await lintCourse(fsSource("./my-course"));
+```
+
+`lintSet`, `lintLesson`, and `lintModule` are the equivalent entry points
+for linting a smaller subtree in isolation (e.g. a set-only repo, or an
+authoring tool previewing one lesson).
+
+## What this doesn't do
+
+- **Grading, or anything answer-key-content-aware beyond existence** —
+  this package checks the file exists, never what's inside it.
+- **Anything `resolve()` doesn't already cover as a side effect of
+  walking the tree** — this package adds checks, it doesn't re-implement
+  reference resolution.

package/dist/cli.js

@@ -0,0 +1,318 @@
+#!/usr/bin/env node
+
+// src/cli.ts
+import { existsSync } from "fs";
+import { join } from "path";
+import { fsSource } from "@inklyre/oes-core";
+
+// src/index.ts
+import { resolveCourse, resolveLesson, resolveModule, resolveSet } from "@inklyre/oes-core";
+
+// src/types.ts
+function lintResult(issues) {
+  return { issues, ok: !issues.some((issue) => issue.severity === "error") };
+}
+
+// src/tree.ts
+import { isOpfPoolEntry } from "@inklyre/oes-core";
+
+// src/rules/answer-references.ts
+function checkIdExists(id, pool, at, issues) {
+  if (!pool.some((item) => item.id === id)) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `References id "${id}", which does not exist among [${pool.map((i) => i.id).join(", ")}]`
+    });
+  }
+}
+function checkPermutation(order, items, at, issues) {
+  const itemIds = items.map((item) => item.id);
+  const itemIdSet = new Set(itemIds);
+  const orderIdSet = new Set(order);
+  const isValid = order.length === itemIds.length && orderIdSet.size === order.length && [...orderIdSet].every((id) => itemIdSet.has(id));
+  if (!isValid) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `Must be exactly a permutation of [${itemIds.join(", ")}], got [${order.join(", ")}]`
+    });
+  }
+}
+
+// src/rules/answer-key-file.ts
+async function checkAnswerKeyFile(resolved, at, issues) {
+  const file = resolved.question.answer_key?.file;
+  if (file === void 0) return;
+  try {
+    await resolved.source.fetch(file);
+  } catch (cause) {
+    issues.push({
+      rule: "answer-key-file-missing",
+      severity: "error",
+      at: `${at}.answer_key`,
+      message: `answer_key.file "${file}" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`
+    });
+  }
+}
+
+// src/rules/unique-ids.ts
+function checkUniqueIds(items, at, issues) {
+  const firstSeenAt = /* @__PURE__ */ new Map();
+  items.forEach((item, i) => {
+    const firstIndex = firstSeenAt.get(item.id);
+    if (firstIndex !== void 0) {
+      issues.push({
+        rule: "duplicate-id",
+        severity: "error",
+        at: `${at}[${i}]`,
+        message: `Duplicate id "${item.id}" (first seen at ${at}[${firstIndex}])`
+      });
+    } else {
+      firstSeenAt.set(item.id, i);
+    }
+  });
+}
+
+// src/question.ts
+async function lintQuestion(resolved, at, issues) {
+  const { question } = resolved;
+  const typeConfigAt = `${at}.type_config`;
+  const isSecured = question.answer_key !== void 0;
+  switch (question.type) {
+    case "mcq": {
+      const { options, answer } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured && answer !== void 0) {
+        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);
+      }
+      break;
+    }
+    case "msq": {
+      const { options, answers } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured) {
+        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));
+      }
+      break;
+    }
+    case "match": {
+      const { left, right, pairs } = question.type_config;
+      checkUniqueIds(left, `${typeConfigAt}.left`, issues);
+      checkUniqueIds(right, `${typeConfigAt}.right`, issues);
+      if (!isSecured) {
+        (pairs ?? []).forEach((pair, i) => {
+          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);
+          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);
+        });
+      }
+      break;
+    }
+    case "order": {
+      const { items, correct_order } = question.type_config;
+      checkUniqueIds(items, `${typeConfigAt}.items`, issues);
+      if (!isSecured && correct_order !== void 0) {
+        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);
+      }
+      break;
+    }
+    case "fill_blank":
+      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);
+      break;
+    case "code":
+      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);
+      break;
+    case "diagram":
+      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);
+      break;
+    case "numerical":
+    case "short_answer":
+    case "essay":
+    case "submission":
+      break;
+  }
+  await checkAnswerKeyFile(resolved, at, issues);
+}
+
+// src/rules/pool-bounds.ts
+function checkPoolBounds(entry, at, issues) {
+  if (entry.select < 1) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) must be at least 1`
+    });
+  } else if (entry.select > entry.from.length) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`
+    });
+  }
+  checkUniqueIds(entry.from, `${at}.from`, issues);
+}
+
+// src/tree.ts
+function resolveErrorsToIssues(errors) {
+  return errors.map(
+    (error) => ({
+      rule: error.message.includes("content_hash mismatch") ? "content-hash-mismatch" : "dangling-reference",
+      severity: "error",
+      at: error.at,
+      message: error.message
+    })
+  );
+}
+async function lintSetContent(set, questions, at, issues) {
+  checkUniqueIds(set.questions, `${at}.questions`, issues);
+  set.questions.forEach((entry, i) => {
+    if (isOpfPoolEntry(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);
+  });
+  for (const question of questions) {
+    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);
+  }
+}
+async function lintPracticeSets(sets, at, issues) {
+  for (const [i, set] of sets.entries()) {
+    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);
+  }
+}
+async function lintResolvedLesson(lesson, at, issues) {
+  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);
+  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);
+  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);
+  await lintPracticeSets(lesson.practice_sets, at, issues);
+}
+async function lintResolvedModule(module_, at, issues) {
+  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);
+  for (const [i, lesson] of module_.lessons.entries()) {
+    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);
+  }
+}
+async function lintResolvedCourse(course, issues) {
+  checkUniqueIds(course.course.modules, "course.modules", issues);
+  for (const [i, module_] of course.modules.entries()) {
+    await lintResolvedModule(module_, `course.modules[${i}]`, issues);
+  }
+}
+
+// src/index.ts
+async function lintCourse(source, location = "course.json") {
+  const { data, errors } = await resolveCourse(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedCourse(data, issues);
+  return lintResult(issues);
+}
+async function lintSet(source, location = "set.json") {
+  const { data, errors } = await resolveSet(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintSetContent(data.set, data.questions, "set", issues);
+  return lintResult(issues);
+}
+async function lintLesson(source, location = "lesson.json") {
+  const { data, errors } = await resolveLesson(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedLesson(data, "lesson", issues);
+  return lintResult(issues);
+}
+async function lintModule(source, location = "module.json") {
+  const { data, errors } = await resolveModule(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedModule(data, "module", issues);
+  return lintResult(issues);
+}
+
+// src/cli.ts
+var ENTRY_FILES = ["course.json", "set.json", "module.json", "lesson.json"];
+function isEntryFile(value) {
+  return ENTRY_FILES.includes(value);
+}
+function printUsage() {
+  console.error("Usage: oes lint <path> [--entry course.json|set.json|module.json|lesson.json] [--json]");
+}
+function detectEntry(dir) {
+  return ENTRY_FILES.find((file) => existsSync(join(dir, file)));
+}
+function runLint(entry, source) {
+  switch (entry) {
+    case "course.json":
+      return lintCourse(source, entry);
+    case "set.json":
+      return lintSet(source, entry);
+    case "module.json":
+      return lintModule(source, entry);
+    case "lesson.json":
+      return lintLesson(source, entry);
+  }
+}
+function printHuman(dir, entry, result) {
+  if (result.issues.length === 0) {
+    console.log(`\u2713 ${dir} (${entry}) \u2014 no issues found`);
+    return;
+  }
+  for (const issue of result.issues) {
+    const tag = issue.severity === "error" ? "error" : "warn ";
+    console.log(`${tag}  [${issue.rule}] ${issue.at}: ${issue.message}`);
+  }
+  const errorCount = result.issues.filter((issue) => issue.severity === "error").length;
+  const warningCount = result.issues.length - errorCount;
+  console.log(`
+${errorCount} error(s), ${warningCount} warning(s)`);
+}
+async function main() {
+  const args = process.argv.slice(2);
+  if (args[0] !== "lint") {
+    printUsage();
+    process.exitCode = 1;
+    return;
+  }
+  let dir;
+  let entryArg;
+  let json = false;
+  for (let i = 1; i < args.length; i++) {
+    const arg = args[i];
+    if (arg === "--entry") {
+      entryArg = args[++i];
+    } else if (arg === "--json") {
+      json = true;
+    } else if (dir === void 0) {
+      dir = arg;
+    } else {
+      printUsage();
+      process.exitCode = 1;
+      return;
+    }
+  }
+  if (dir === void 0) {
+    printUsage();
+    process.exitCode = 1;
+    return;
+  }
+  if (entryArg !== void 0 && !isEntryFile(entryArg)) {
+    console.error(`--entry must be one of: ${ENTRY_FILES.join(", ")}`);
+    process.exitCode = 1;
+    return;
+  }
+  const entry = entryArg ?? detectEntry(dir);
+  if (entry === void 0) {
+    console.error(`No ${ENTRY_FILES.join(", ")} found in ${dir}`);
+    process.exitCode = 1;
+    return;
+  }
+  const result = await runLint(entry, fsSource(dir));
+  if (json) {
+    console.log(JSON.stringify(result, null, 2));
+  } else {
+    printHuman(dir, entry, result);
+  }
+  process.exitCode = result.ok ? 0 : 1;
+}
+main().catch((cause) => {
+  console.error(cause);
+  process.exitCode = 1;
+});
+//# sourceMappingURL=cli.js.map

package/dist/cli.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/cli.ts","../src/index.ts","../src/types.ts","../src/tree.ts","../src/rules/answer-references.ts","../src/rules/answer-key-file.ts","../src/rules/unique-ids.ts","../src/question.ts","../src/rules/pool-bounds.ts"],"sourcesContent":["import { existsSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { fsSource } from \"@inklyre/oes-core\";\nimport type { LintResult } from \"./types.js\";\nimport { lintCourse, lintLesson, lintModule, lintSet } from \"./index.js\";\n\nconst ENTRY_FILES = [\"course.json\", \"set.json\", \"module.json\", \"lesson.json\"] as const;\ntype EntryFile = (typeof ENTRY_FILES)[number];\n\nfunction isEntryFile(value: string): value is EntryFile {\n  return (ENTRY_FILES as readonly string[]).includes(value);\n}\n\nfunction printUsage(): void {\n  console.error(\"Usage: oes lint <path> [--entry course.json|set.json|module.json|lesson.json] [--json]\");\n}\n\nfunction detectEntry(dir: string): EntryFile | undefined {\n  return ENTRY_FILES.find((file) => existsSync(join(dir, file)));\n}\n\nfunction runLint(entry: EntryFile, source: ReturnType<typeof fsSource>): Promise<LintResult> {\n  switch (entry) {\n    case \"course.json\":\n      return lintCourse(source, entry);\n    case \"set.json\":\n      return lintSet(source, entry);\n    case \"module.json\":\n      return lintModule(source, entry);\n    case \"lesson.json\":\n      return lintLesson(source, entry);\n  }\n}\n\nfunction printHuman(dir: string, entry: EntryFile, result: LintResult): void {\n  if (result.issues.length === 0) {\n    console.log(`✓ ${dir} (${entry}) — no issues found`);\n    return;\n  }\n  for (const issue of result.issues) {\n    const tag = issue.severity === \"error\" ? \"error\" : \"warn \";\n    console.log(`${tag}  [${issue.rule}] ${issue.at}: ${issue.message}`);\n  }\n  const errorCount = result.issues.filter((issue) => issue.severity === \"error\").length;\n  const warningCount = result.issues.length - errorCount;\n  console.log(`\\n${errorCount} error(s), ${warningCount} warning(s)`);\n}\n\nasync function main(): Promise<void> {\n  const args = process.argv.slice(2);\n  if (args[0] !== \"lint\") {\n    printUsage();\n    process.exitCode = 1;\n    return;\n  }\n\n  let dir: string | undefined;\n  let entryArg: string | undefined;\n  let json = false;\n  for (let i = 1; i < args.length; i++) {\n    const arg = args[i];\n    if (arg === \"--entry\") {\n      entryArg = args[++i];\n    } else if (arg === \"--json\") {\n      json = true;\n    } else if (dir === undefined) {\n      dir = arg;\n    } else {\n      printUsage();\n      process.exitCode = 1;\n      return;\n    }\n  }\n\n  if (dir === undefined) {\n    printUsage();\n    process.exitCode = 1;\n    return;\n  }\n  if (entryArg !== undefined && !isEntryFile(entryArg)) {\n    console.error(`--entry must be one of: ${ENTRY_FILES.join(\", \")}`);\n    process.exitCode = 1;\n    return;\n  }\n\n  const entry = entryArg ?? detectEntry(dir);\n  if (entry === undefined) {\n    console.error(`No ${ENTRY_FILES.join(\", \")} found in ${dir}`);\n    process.exitCode = 1;\n    return;\n  }\n\n  const result = await runLint(entry, fsSource(dir));\n\n  if (json) {\n    console.log(JSON.stringify(result, null, 2));\n  } else {\n    printHuman(dir, entry, result);\n  }\n  process.exitCode = result.ok ? 0 : 1;\n}\n\nmain().catch((cause) => {\n  console.error(cause);\n  process.exitCode = 1;\n});\n","import type { ContentSource } from \"@inklyre/oes-core\";\nimport { resolveCourse, resolveLesson, resolveModule, resolveSet } from \"@inklyre/oes-core\";\nimport type { LintIssue, LintResult } from \"./types.js\";\nimport { lintResult } from \"./types.js\";\nimport { lintResolvedCourse, lintResolvedLesson, lintResolvedModule, lintSetContent, resolveErrorsToIssues } from \"./tree.js\";\n\nexport type { LintIssue, LintResult, LintRule, LintSeverity } from \"./types.js\";\n\n/**\n * Lint a full course tree from a `course.json` entry point: every check\n * `resolve()` already makes (dangling references, `content_hash`\n * mismatches) plus everything only a whole-tree view can catch —\n * duplicate ids, pool `select` bounds, dangling answer cross-references,\n * `answer_key` file existence.\n */\nexport async function lintCourse(source: ContentSource, location = \"course.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveCourse(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedCourse(data, issues);\n  return lintResult(issues);\n}\n\n/** Lint a single practice set from a `set.json` entry point — for a set-only repo, outside any course. */\nexport async function lintSet(source: ContentSource, location = \"set.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveSet(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintSetContent(data.set, data.questions, \"set\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single lesson from a `lesson.json` entry point — for previewing/authoring one lesson in isolation. */\nexport async function lintLesson(source: ContentSource, location = \"lesson.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveLesson(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedLesson(data, \"lesson\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single module from a `module.json` entry point — for previewing/authoring one module in isolation. */\nexport async function lintModule(source: ContentSource, location = \"module.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveModule(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedModule(data, \"module\", issues);\n  return lintResult(issues);\n}\n","export type LintSeverity = \"error\" | \"warning\";\n\n/** Every check this package runs — used as `LintIssue.rule`, and as the rule name printed in CLI output. */\nexport type LintRule =\n  | \"dangling-reference\"\n  | \"content-hash-mismatch\"\n  | \"duplicate-id\"\n  | \"pool-select-bounds\"\n  | \"dangling-answer-reference\"\n  | \"answer-key-file-missing\";\n\nexport interface LintIssue {\n  rule: LintRule;\n  severity: LintSeverity;\n  /** Where in the tree this was found, e.g. `\"course.modules[0].lessons[1].practice_sets[0].questions[id=q1]\"`. */\n  at: string;\n  message: string;\n}\n\nexport interface LintResult {\n  issues: LintIssue[];\n  /** `false` iff at least one `\"error\"`-severity issue was found — a `\"warning\"` alone doesn't fail a lint run. */\n  ok: boolean;\n}\n\nexport function lintResult(issues: LintIssue[]): LintResult {\n  return { issues, ok: !issues.some((issue) => issue.severity === \"error\") };\n}\n","import { isOpfPoolEntry } from \"@inklyre/oes-core\";\nimport type {\n  OpfSet,\n  ResolvedCourse,\n  ResolvedLesson,\n  ResolvedModule,\n  ResolvedPracticeSet,\n  ResolvedQuestion,\n  ResolveError,\n} from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { lintQuestion } from \"./question.js\";\nimport { checkPoolBounds } from \"./rules/pool-bounds.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/** `resolveCourse`/`resolveSet`'s own errors (dangling references, `content_hash` mismatches) — already-detected issues, just relabeled into this package's shape. */\nexport function resolveErrorsToIssues(errors: ResolveError[]): LintIssue[] {\n  return errors.map(\n    (error): LintIssue => ({\n      rule: error.message.includes(\"content_hash mismatch\") ? \"content-hash-mismatch\" : \"dangling-reference\",\n      severity: \"error\",\n      at: error.at,\n      message: error.message,\n    })\n  );\n}\n\nexport async function lintSetContent(set: OpfSet, questions: ResolvedQuestion[], at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(set.questions, `${at}.questions`, issues);\n  set.questions.forEach((entry, i) => {\n    if (isOpfPoolEntry(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);\n  });\n  for (const question of questions) {\n    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);\n  }\n}\n\nasync function lintPracticeSets(sets: ResolvedPracticeSet[], at: string, issues: LintIssue[]): Promise<void> {\n  for (const [i, set] of sets.entries()) {\n    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedLesson(lesson: ResolvedLesson, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);\n  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);\n  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);\n  await lintPracticeSets(lesson.practice_sets, at, issues);\n}\n\nexport async function lintResolvedModule(module_: ResolvedModule, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);\n  for (const [i, lesson] of module_.lessons.entries()) {\n    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedCourse(course: ResolvedCourse, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(course.course.modules, \"course.modules\", issues);\n  for (const [i, module_] of course.modules.entries()) {\n    await lintResolvedModule(module_, `course.modules[${i}]`, issues);\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/** Flag `id` if it isn't one of `pool`'s ids — e.g. an `mcq`'s `answer` pointing at a nonexistent option. */\nexport function checkIdExists(id: string, pool: { id: string }[], at: string, issues: LintIssue[]): void {\n  if (!pool.some((item) => item.id === id)) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `References id \"${id}\", which does not exist among [${pool.map((i) => i.id).join(\", \")}]`,\n    });\n  }\n}\n\n/** Flag `order` if it isn't exactly a permutation of `items`' ids — every id present once, none missing, none extra. */\nexport function checkPermutation(order: string[], items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const itemIds = items.map((item) => item.id);\n  const itemIdSet = new Set(itemIds);\n  const orderIdSet = new Set(order);\n  const isValid =\n    order.length === itemIds.length &&\n    orderIdSet.size === order.length &&\n    [...orderIdSet].every((id) => itemIdSet.has(id));\n  if (!isValid) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `Must be exactly a permutation of [${itemIds.join(\", \")}], got [${order.join(\", \")}]`,\n    });\n  }\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\n\n/**\n * When `answer_key.file` is set, confirm the file actually exists —\n * independent of whether `resolve()` ever fetches it, since it\n * deliberately doesn't (a public/student-facing consumer built on\n * `resolveCourse`/`resolveSet` must never gain a path to the answer\n * through the shared resolver). Uses the question's own re-rooted\n * `source`, exposed on {@link ResolvedQuestion} for exactly this purpose.\n */\nexport async function checkAnswerKeyFile(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const file = resolved.question.answer_key?.file;\n  if (file === undefined) return;\n  try {\n    await resolved.source.fetch(file);\n  } catch (cause) {\n    issues.push({\n      rule: \"answer-key-file-missing\",\n      severity: \"error\",\n      at: `${at}.answer_key`,\n      message: `answer_key.file \"${file}\" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`,\n    });\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/**\n * Flag any id repeated within `items` — something no JSON Schema in this\n * repo enforces (schema validation is per-document, not \"unique across\n * this array\"), and a real authoring mistake wherever it happens: two\n * modules/lessons/options/pool candidates/etc. sharing one id makes that\n * id ambiguous to anything addressing by it.\n */\nexport function checkUniqueIds(items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const firstSeenAt = new Map<string, number>();\n  items.forEach((item, i) => {\n    const firstIndex = firstSeenAt.get(item.id);\n    if (firstIndex !== undefined) {\n      issues.push({\n        rule: \"duplicate-id\",\n        severity: \"error\",\n        at: `${at}[${i}]`,\n        message: `Duplicate id \"${item.id}\" (first seen at ${at}[${firstIndex}])`,\n      });\n    } else {\n      firstSeenAt.set(item.id, i);\n    }\n  });\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { checkIdExists, checkPermutation } from \"./rules/answer-references.js\";\nimport { checkAnswerKeyFile } from \"./rules/answer-key-file.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/**\n * Run every question-level rule: duplicate ids within the question's own\n * option/item/etc. arrays, dangling answer cross-references (only\n * meaningful in self-practice mode — a secured `answer_key` means the\n * answer isn't inline to check), and `answer_key.file` existence.\n */\nexport async function lintQuestion(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const { question } = resolved;\n  const typeConfigAt = `${at}.type_config`;\n  const isSecured = question.answer_key !== undefined;\n\n  switch (question.type) {\n    case \"mcq\": {\n      const { options, answer } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured && answer !== undefined) {\n        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);\n      }\n      break;\n    }\n    case \"msq\": {\n      const { options, answers } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured) {\n        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));\n      }\n      break;\n    }\n    case \"match\": {\n      const { left, right, pairs } = question.type_config;\n      checkUniqueIds(left, `${typeConfigAt}.left`, issues);\n      checkUniqueIds(right, `${typeConfigAt}.right`, issues);\n      if (!isSecured) {\n        (pairs ?? []).forEach((pair, i) => {\n          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);\n          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);\n        });\n      }\n      break;\n    }\n    case \"order\": {\n      const { items, correct_order } = question.type_config;\n      checkUniqueIds(items, `${typeConfigAt}.items`, issues);\n      if (!isSecured && correct_order !== undefined) {\n        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);\n      }\n      break;\n    }\n    case \"fill_blank\":\n      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);\n      break;\n    case \"code\":\n      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);\n      break;\n    case \"diagram\":\n      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);\n      break;\n    case \"numerical\":\n    case \"short_answer\":\n    case \"essay\":\n    case \"submission\":\n      break;\n  }\n\n  await checkAnswerKeyFile(resolved, at, issues);\n}\n","import type { OpfPoolQuestionEntry } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\nimport { checkUniqueIds } from \"./unique-ids.js\";\n\n/**\n * `select` must be between 1 and `from.length` — the schema can't enforce\n * this itself, since it's a relationship between two sibling fields\n * (see `OpfPoolQuestionEntry.select`'s own doc comment).\n */\nexport function checkPoolBounds(entry: OpfPoolQuestionEntry, at: string, issues: LintIssue[]): void {\n  if (entry.select < 1) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) must be at least 1`,\n    });\n  } else if (entry.select > entry.from.length) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`,\n    });\n  }\n  checkUniqueIds(entry.from, `${at}.from`, issues);\n}\n"],"mappings":";;;AAAA,SAAS,kBAAkB;AAC3B,SAAS,YAAY;AACrB,SAAS,gBAAgB;;;ACDzB,SAAS,eAAe,eAAe,eAAe,kBAAkB;;;ACwBjE,SAAS,WAAW,QAAiC;AAC1D,SAAO,EAAE,QAAQ,IAAI,CAAC,OAAO,KAAK,CAAC,UAAU,MAAM,aAAa,OAAO,EAAE;AAC3E;;;AC3BA,SAAS,sBAAsB;;;ACGxB,SAAS,cAAc,IAAY,MAAwB,IAAY,QAA2B;AACvG,MAAI,CAAC,KAAK,KAAK,CAAC,SAAS,KAAK,OAAO,EAAE,GAAG;AACxC,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,kBAAkB,EAAE,kCAAkC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA,IACjG,CAAC;AAAA,EACH;AACF;AAGO,SAAS,iBAAiB,OAAiB,OAAyB,IAAY,QAA2B;AAChH,QAAM,UAAU,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE;AAC3C,QAAM,YAAY,IAAI,IAAI,OAAO;AACjC,QAAM,aAAa,IAAI,IAAI,KAAK;AAChC,QAAM,UACJ,MAAM,WAAW,QAAQ,UACzB,WAAW,SAAS,MAAM,UAC1B,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,OAAO,UAAU,IAAI,EAAE,CAAC;AACjD,MAAI,CAAC,SAAS;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,qCAAqC,QAAQ,KAAK,IAAI,CAAC,WAAW,MAAM,KAAK,IAAI,CAAC;AAAA,IAC7F,CAAC;AAAA,EACH;AACF;;;ACpBA,eAAsB,mBAAmB,UAA4B,IAAY,QAAoC;AACnH,QAAM,OAAO,SAAS,SAAS,YAAY;AAC3C,MAAI,SAAS,OAAW;AACxB,MAAI;AACF,UAAM,SAAS,OAAO,MAAM,IAAI;AAAA,EAClC,SAAS,OAAO;AACd,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV,IAAI,GAAG,EAAE;AAAA,MACT,SAAS,oBAAoB,IAAI,wBAAwB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACjH,CAAC;AAAA,EACH;AACF;;;ACfO,SAAS,eAAe,OAAyB,IAAY,QAA2B;AAC7F,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,aAAa,YAAY,IAAI,KAAK,EAAE;AAC1C,QAAI,eAAe,QAAW;AAC5B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,UAAU;AAAA,QACV,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,QACd,SAAS,iBAAiB,KAAK,EAAE,oBAAoB,EAAE,IAAI,UAAU;AAAA,MACvE,CAAC;AAAA,IACH,OAAO;AACL,kBAAY,IAAI,KAAK,IAAI,CAAC;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;;;ACZA,eAAsB,aAAa,UAA4B,IAAY,QAAoC;AAC7G,QAAM,EAAE,SAAS,IAAI;AACrB,QAAM,eAAe,GAAG,EAAE;AAC1B,QAAM,YAAY,SAAS,eAAe;AAE1C,UAAQ,SAAS,MAAM;AAAA,IACrB,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,OAAO,IAAI,SAAS;AACrC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,aAAa,WAAW,QAAW;AACtC,sBAAc,QAAQ,SAAS,GAAG,YAAY,WAAW,MAAM;AAAA,MACjE;AACA;AAAA,IACF;AAAA,IACA,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,QAAQ,IAAI,SAAS;AACtC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,WAAW;AACd,SAAC,WAAW,CAAC,GAAG,QAAQ,CAAC,QAAQ,MAAM,cAAc,QAAQ,SAAS,GAAG,YAAY,YAAY,CAAC,KAAK,MAAM,CAAC;AAAA,MAChH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,MAAM,OAAO,MAAM,IAAI,SAAS;AACxC,qBAAe,MAAM,GAAG,YAAY,SAAS,MAAM;AACnD,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,WAAW;AACd,SAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,MAAM,MAAM;AACjC,wBAAc,KAAK,SAAS,MAAM,GAAG,YAAY,UAAU,CAAC,aAAa,MAAM;AAC/E,wBAAc,KAAK,UAAU,OAAO,GAAG,YAAY,UAAU,CAAC,cAAc,MAAM;AAAA,QACpF,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,OAAO,cAAc,IAAI,SAAS;AAC1C,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,aAAa,kBAAkB,QAAW;AAC7C,yBAAiB,eAAe,OAAO,GAAG,YAAY,kBAAkB,MAAM;AAAA,MAChF;AACA;AAAA,IACF;AAAA,IACA,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,YAAY,GAAG,YAAY,eAAe,MAAM;AACpF;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH;AAAA,EACJ;AAEA,QAAM,mBAAmB,UAAU,IAAI,MAAM;AAC/C;;;AC9DO,SAAS,gBAAgB,OAA6B,IAAY,QAA2B;AAClG,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM;AAAA,IAClC,CAAC;AAAA,EACH,WAAW,MAAM,SAAS,MAAM,KAAK,QAAQ;AAC3C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM,0BAA0B,MAAM,KAAK,MAAM;AAAA,IAC7E,CAAC;AAAA,EACH;AACA,iBAAe,MAAM,MAAM,GAAG,EAAE,SAAS,MAAM;AACjD;;;ALVO,SAAS,sBAAsB,QAAqC;AACzE,SAAO,OAAO;AAAA,IACZ,CAAC,WAAsB;AAAA,MACrB,MAAM,MAAM,QAAQ,SAAS,uBAAuB,IAAI,0BAA0B;AAAA,MAClF,UAAU;AAAA,MACV,IAAI,MAAM;AAAA,MACV,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AACF;AAEA,eAAsB,eAAe,KAAa,WAA+B,IAAY,QAAoC;AAC/H,iBAAe,IAAI,WAAW,GAAG,EAAE,cAAc,MAAM;AACvD,MAAI,UAAU,QAAQ,CAAC,OAAO,MAAM;AAClC,QAAI,eAAe,KAAK,EAAG,iBAAgB,OAAO,GAAG,EAAE,cAAc,CAAC,KAAK,MAAM;AAAA,EACnF,CAAC;AACD,aAAW,YAAY,WAAW;AAChC,UAAM,aAAa,UAAU,GAAG,EAAE,iBAAiB,SAAS,EAAE,KAAK,MAAM;AAAA,EAC3E;AACF;AAEA,eAAe,iBAAiB,MAA6B,IAAY,QAAoC;AAC3G,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACrC,UAAM,eAAe,IAAI,KAAK,IAAI,WAAW,GAAG,EAAE,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClF;AACF;AAEA,eAAsB,mBAAmB,QAAwB,IAAY,QAAoC;AAC/G,iBAAe,OAAO,OAAO,YAAY,CAAC,GAAG,GAAG,EAAE,aAAa,MAAM;AACrE,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,QAAM,iBAAiB,OAAO,eAAe,IAAI,MAAM;AACzD;AAEA,eAAsB,mBAAmB,SAAyB,IAAY,QAAoC;AAChH,iBAAe,QAAQ,OAAO,SAAS,GAAG,EAAE,YAAY,MAAM;AAC9D,aAAW,CAAC,GAAG,MAAM,KAAK,QAAQ,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,QAAQ,GAAG,EAAE,YAAY,CAAC,KAAK,MAAM;AAAA,EAChE;AACF;AAEA,eAAsB,mBAAmB,QAAwB,QAAoC;AACnG,iBAAe,OAAO,OAAO,SAAS,kBAAkB,MAAM;AAC9D,aAAW,CAAC,GAAG,OAAO,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,SAAS,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClE;AACF;;;AF/CA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,MAAM;AAC/C,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,QAAQ,QAAuB,WAAW,YAAiC;AAC/F,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,WAAW,QAAQ,QAAQ;AAC1D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,eAAe,KAAK,KAAK,KAAK,WAAW,OAAO,MAAM;AACtE,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;;;ADtCA,IAAM,cAAc,CAAC,eAAe,YAAY,eAAe,aAAa;AAG5E,SAAS,YAAY,OAAmC;AACtD,SAAQ,YAAkC,SAAS,KAAK;AAC1D;AAEA,SAAS,aAAmB;AAC1B,UAAQ,MAAM,wFAAwF;AACxG;AAEA,SAAS,YAAY,KAAoC;AACvD,SAAO,YAAY,KAAK,CAAC,SAAS,WAAW,KAAK,KAAK,IAAI,CAAC,CAAC;AAC/D;AAEA,SAAS,QAAQ,OAAkB,QAA0D;AAC3F,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO,WAAW,QAAQ,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,QAAQ,KAAK;AAAA,IAC9B,KAAK;AACH,aAAO,WAAW,QAAQ,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,WAAW,QAAQ,KAAK;AAAA,EACnC;AACF;AAEA,SAAS,WAAW,KAAa,OAAkB,QAA0B;AAC3E,MAAI,OAAO,OAAO,WAAW,GAAG;AAC9B,YAAQ,IAAI,UAAK,GAAG,KAAK,KAAK,0BAAqB;AACnD;AAAA,EACF;AACA,aAAW,SAAS,OAAO,QAAQ;AACjC,UAAM,MAAM,MAAM,aAAa,UAAU,UAAU;AACnD,YAAQ,IAAI,GAAG,GAAG,MAAM,MAAM,IAAI,KAAK,MAAM,EAAE,KAAK,MAAM,OAAO,EAAE;AAAA,EACrE;AACA,QAAM,aAAa,OAAO,OAAO,OAAO,CAAC,UAAU,MAAM,aAAa,OAAO,EAAE;AAC/E,QAAM,eAAe,OAAO,OAAO,SAAS;AAC5C,UAAQ,IAAI;AAAA,EAAK,UAAU,cAAc,YAAY,aAAa;AACpE;AAEA,eAAe,OAAsB;AACnC,QAAM,OAAO,QAAQ,KAAK,MAAM,CAAC;AACjC,MAAI,KAAK,CAAC,MAAM,QAAQ;AACtB,eAAW;AACX,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI,QAAQ,WAAW;AACrB,iBAAW,KAAK,EAAE,CAAC;AAAA,IACrB,WAAW,QAAQ,UAAU;AAC3B,aAAO;AAAA,IACT,WAAW,QAAQ,QAAW;AAC5B,YAAM;AAAA,IACR,OAAO;AACL,iBAAW;AACX,cAAQ,WAAW;AACnB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,QAAW;AACrB,eAAW;AACX,YAAQ,WAAW;AACnB;AAAA,EACF;AACA,MAAI,aAAa,UAAa,CAAC,YAAY,QAAQ,GAAG;AACpD,YAAQ,MAAM,2BAA2B,YAAY,KAAK,IAAI,CAAC,EAAE;AACjE,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,QAAQ,YAAY,YAAY,GAAG;AACzC,MAAI,UAAU,QAAW;AACvB,YAAQ,MAAM,MAAM,YAAY,KAAK,IAAI,CAAC,aAAa,GAAG,EAAE;AAC5D,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,SAAS,MAAM,QAAQ,OAAO,SAAS,GAAG,CAAC;AAEjD,MAAI,MAAM;AACR,YAAQ,IAAI,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC7C,OAAO;AACL,eAAW,KAAK,OAAO,MAAM;AAAA,EAC/B;AACA,UAAQ,WAAW,OAAO,KAAK,IAAI;AACrC;AAEA,KAAK,EAAE,MAAM,CAAC,UAAU;AACtB,UAAQ,MAAM,KAAK;AACnB,UAAQ,WAAW;AACrB,CAAC;","names":[]}

package/dist/index.cjs

@@ -0,0 +1,255 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  lintCourse: () => lintCourse,
+  lintLesson: () => lintLesson,
+  lintModule: () => lintModule,
+  lintSet: () => lintSet
+});
+module.exports = __toCommonJS(src_exports);
+var import_oes_core2 = require("@inklyre/oes-core");
+
+// src/types.ts
+function lintResult(issues) {
+  return { issues, ok: !issues.some((issue) => issue.severity === "error") };
+}
+
+// src/tree.ts
+var import_oes_core = require("@inklyre/oes-core");
+
+// src/rules/answer-references.ts
+function checkIdExists(id, pool, at, issues) {
+  if (!pool.some((item) => item.id === id)) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `References id "${id}", which does not exist among [${pool.map((i) => i.id).join(", ")}]`
+    });
+  }
+}
+function checkPermutation(order, items, at, issues) {
+  const itemIds = items.map((item) => item.id);
+  const itemIdSet = new Set(itemIds);
+  const orderIdSet = new Set(order);
+  const isValid = order.length === itemIds.length && orderIdSet.size === order.length && [...orderIdSet].every((id) => itemIdSet.has(id));
+  if (!isValid) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `Must be exactly a permutation of [${itemIds.join(", ")}], got [${order.join(", ")}]`
+    });
+  }
+}
+
+// src/rules/answer-key-file.ts
+async function checkAnswerKeyFile(resolved, at, issues) {
+  const file = resolved.question.answer_key?.file;
+  if (file === void 0) return;
+  try {
+    await resolved.source.fetch(file);
+  } catch (cause) {
+    issues.push({
+      rule: "answer-key-file-missing",
+      severity: "error",
+      at: `${at}.answer_key`,
+      message: `answer_key.file "${file}" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`
+    });
+  }
+}
+
+// src/rules/unique-ids.ts
+function checkUniqueIds(items, at, issues) {
+  const firstSeenAt = /* @__PURE__ */ new Map();
+  items.forEach((item, i) => {
+    const firstIndex = firstSeenAt.get(item.id);
+    if (firstIndex !== void 0) {
+      issues.push({
+        rule: "duplicate-id",
+        severity: "error",
+        at: `${at}[${i}]`,
+        message: `Duplicate id "${item.id}" (first seen at ${at}[${firstIndex}])`
+      });
+    } else {
+      firstSeenAt.set(item.id, i);
+    }
+  });
+}
+
+// src/question.ts
+async function lintQuestion(resolved, at, issues) {
+  const { question } = resolved;
+  const typeConfigAt = `${at}.type_config`;
+  const isSecured = question.answer_key !== void 0;
+  switch (question.type) {
+    case "mcq": {
+      const { options, answer } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured && answer !== void 0) {
+        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);
+      }
+      break;
+    }
+    case "msq": {
+      const { options, answers } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured) {
+        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));
+      }
+      break;
+    }
+    case "match": {
+      const { left, right, pairs } = question.type_config;
+      checkUniqueIds(left, `${typeConfigAt}.left`, issues);
+      checkUniqueIds(right, `${typeConfigAt}.right`, issues);
+      if (!isSecured) {
+        (pairs ?? []).forEach((pair, i) => {
+          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);
+          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);
+        });
+      }
+      break;
+    }
+    case "order": {
+      const { items, correct_order } = question.type_config;
+      checkUniqueIds(items, `${typeConfigAt}.items`, issues);
+      if (!isSecured && correct_order !== void 0) {
+        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);
+      }
+      break;
+    }
+    case "fill_blank":
+      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);
+      break;
+    case "code":
+      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);
+      break;
+    case "diagram":
+      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);
+      break;
+    case "numerical":
+    case "short_answer":
+    case "essay":
+    case "submission":
+      break;
+  }
+  await checkAnswerKeyFile(resolved, at, issues);
+}
+
+// src/rules/pool-bounds.ts
+function checkPoolBounds(entry, at, issues) {
+  if (entry.select < 1) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) must be at least 1`
+    });
+  } else if (entry.select > entry.from.length) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`
+    });
+  }
+  checkUniqueIds(entry.from, `${at}.from`, issues);
+}
+
+// src/tree.ts
+function resolveErrorsToIssues(errors) {
+  return errors.map(
+    (error) => ({
+      rule: error.message.includes("content_hash mismatch") ? "content-hash-mismatch" : "dangling-reference",
+      severity: "error",
+      at: error.at,
+      message: error.message
+    })
+  );
+}
+async function lintSetContent(set, questions, at, issues) {
+  checkUniqueIds(set.questions, `${at}.questions`, issues);
+  set.questions.forEach((entry, i) => {
+    if ((0, import_oes_core.isOpfPoolEntry)(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);
+  });
+  for (const question of questions) {
+    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);
+  }
+}
+async function lintPracticeSets(sets, at, issues) {
+  for (const [i, set] of sets.entries()) {
+    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);
+  }
+}
+async function lintResolvedLesson(lesson, at, issues) {
+  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);
+  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);
+  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);
+  await lintPracticeSets(lesson.practice_sets, at, issues);
+}
+async function lintResolvedModule(module_, at, issues) {
+  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);
+  for (const [i, lesson] of module_.lessons.entries()) {
+    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);
+  }
+}
+async function lintResolvedCourse(course, issues) {
+  checkUniqueIds(course.course.modules, "course.modules", issues);
+  for (const [i, module_] of course.modules.entries()) {
+    await lintResolvedModule(module_, `course.modules[${i}]`, issues);
+  }
+}
+
+// src/index.ts
+async function lintCourse(source, location = "course.json") {
+  const { data, errors } = await (0, import_oes_core2.resolveCourse)(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedCourse(data, issues);
+  return lintResult(issues);
+}
+async function lintSet(source, location = "set.json") {
+  const { data, errors } = await (0, import_oes_core2.resolveSet)(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintSetContent(data.set, data.questions, "set", issues);
+  return lintResult(issues);
+}
+async function lintLesson(source, location = "lesson.json") {
+  const { data, errors } = await (0, import_oes_core2.resolveLesson)(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedLesson(data, "lesson", issues);
+  return lintResult(issues);
+}
+async function lintModule(source, location = "module.json") {
+  const { data, errors } = await (0, import_oes_core2.resolveModule)(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedModule(data, "module", issues);
+  return lintResult(issues);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  lintCourse,
+  lintLesson,
+  lintModule,
+  lintSet
+});
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/types.ts","../src/tree.ts","../src/rules/answer-references.ts","../src/rules/answer-key-file.ts","../src/rules/unique-ids.ts","../src/question.ts","../src/rules/pool-bounds.ts"],"sourcesContent":["import type { ContentSource } from \"@inklyre/oes-core\";\nimport { resolveCourse, resolveLesson, resolveModule, resolveSet } from \"@inklyre/oes-core\";\nimport type { LintIssue, LintResult } from \"./types.js\";\nimport { lintResult } from \"./types.js\";\nimport { lintResolvedCourse, lintResolvedLesson, lintResolvedModule, lintSetContent, resolveErrorsToIssues } from \"./tree.js\";\n\nexport type { LintIssue, LintResult, LintRule, LintSeverity } from \"./types.js\";\n\n/**\n * Lint a full course tree from a `course.json` entry point: every check\n * `resolve()` already makes (dangling references, `content_hash`\n * mismatches) plus everything only a whole-tree view can catch —\n * duplicate ids, pool `select` bounds, dangling answer cross-references,\n * `answer_key` file existence.\n */\nexport async function lintCourse(source: ContentSource, location = \"course.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveCourse(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedCourse(data, issues);\n  return lintResult(issues);\n}\n\n/** Lint a single practice set from a `set.json` entry point — for a set-only repo, outside any course. */\nexport async function lintSet(source: ContentSource, location = \"set.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveSet(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintSetContent(data.set, data.questions, \"set\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single lesson from a `lesson.json` entry point — for previewing/authoring one lesson in isolation. */\nexport async function lintLesson(source: ContentSource, location = \"lesson.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveLesson(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedLesson(data, \"lesson\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single module from a `module.json` entry point — for previewing/authoring one module in isolation. */\nexport async function lintModule(source: ContentSource, location = \"module.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveModule(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedModule(data, \"module\", issues);\n  return lintResult(issues);\n}\n","export type LintSeverity = \"error\" | \"warning\";\n\n/** Every check this package runs — used as `LintIssue.rule`, and as the rule name printed in CLI output. */\nexport type LintRule =\n  | \"dangling-reference\"\n  | \"content-hash-mismatch\"\n  | \"duplicate-id\"\n  | \"pool-select-bounds\"\n  | \"dangling-answer-reference\"\n  | \"answer-key-file-missing\";\n\nexport interface LintIssue {\n  rule: LintRule;\n  severity: LintSeverity;\n  /** Where in the tree this was found, e.g. `\"course.modules[0].lessons[1].practice_sets[0].questions[id=q1]\"`. */\n  at: string;\n  message: string;\n}\n\nexport interface LintResult {\n  issues: LintIssue[];\n  /** `false` iff at least one `\"error\"`-severity issue was found — a `\"warning\"` alone doesn't fail a lint run. */\n  ok: boolean;\n}\n\nexport function lintResult(issues: LintIssue[]): LintResult {\n  return { issues, ok: !issues.some((issue) => issue.severity === \"error\") };\n}\n","import { isOpfPoolEntry } from \"@inklyre/oes-core\";\nimport type {\n  OpfSet,\n  ResolvedCourse,\n  ResolvedLesson,\n  ResolvedModule,\n  ResolvedPracticeSet,\n  ResolvedQuestion,\n  ResolveError,\n} from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { lintQuestion } from \"./question.js\";\nimport { checkPoolBounds } from \"./rules/pool-bounds.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/** `resolveCourse`/`resolveSet`'s own errors (dangling references, `content_hash` mismatches) — already-detected issues, just relabeled into this package's shape. */\nexport function resolveErrorsToIssues(errors: ResolveError[]): LintIssue[] {\n  return errors.map(\n    (error): LintIssue => ({\n      rule: error.message.includes(\"content_hash mismatch\") ? \"content-hash-mismatch\" : \"dangling-reference\",\n      severity: \"error\",\n      at: error.at,\n      message: error.message,\n    })\n  );\n}\n\nexport async function lintSetContent(set: OpfSet, questions: ResolvedQuestion[], at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(set.questions, `${at}.questions`, issues);\n  set.questions.forEach((entry, i) => {\n    if (isOpfPoolEntry(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);\n  });\n  for (const question of questions) {\n    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);\n  }\n}\n\nasync function lintPracticeSets(sets: ResolvedPracticeSet[], at: string, issues: LintIssue[]): Promise<void> {\n  for (const [i, set] of sets.entries()) {\n    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedLesson(lesson: ResolvedLesson, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);\n  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);\n  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);\n  await lintPracticeSets(lesson.practice_sets, at, issues);\n}\n\nexport async function lintResolvedModule(module_: ResolvedModule, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);\n  for (const [i, lesson] of module_.lessons.entries()) {\n    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedCourse(course: ResolvedCourse, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(course.course.modules, \"course.modules\", issues);\n  for (const [i, module_] of course.modules.entries()) {\n    await lintResolvedModule(module_, `course.modules[${i}]`, issues);\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/** Flag `id` if it isn't one of `pool`'s ids — e.g. an `mcq`'s `answer` pointing at a nonexistent option. */\nexport function checkIdExists(id: string, pool: { id: string }[], at: string, issues: LintIssue[]): void {\n  if (!pool.some((item) => item.id === id)) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `References id \"${id}\", which does not exist among [${pool.map((i) => i.id).join(\", \")}]`,\n    });\n  }\n}\n\n/** Flag `order` if it isn't exactly a permutation of `items`' ids — every id present once, none missing, none extra. */\nexport function checkPermutation(order: string[], items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const itemIds = items.map((item) => item.id);\n  const itemIdSet = new Set(itemIds);\n  const orderIdSet = new Set(order);\n  const isValid =\n    order.length === itemIds.length &&\n    orderIdSet.size === order.length &&\n    [...orderIdSet].every((id) => itemIdSet.has(id));\n  if (!isValid) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `Must be exactly a permutation of [${itemIds.join(\", \")}], got [${order.join(\", \")}]`,\n    });\n  }\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\n\n/**\n * When `answer_key.file` is set, confirm the file actually exists —\n * independent of whether `resolve()` ever fetches it, since it\n * deliberately doesn't (a public/student-facing consumer built on\n * `resolveCourse`/`resolveSet` must never gain a path to the answer\n * through the shared resolver). Uses the question's own re-rooted\n * `source`, exposed on {@link ResolvedQuestion} for exactly this purpose.\n */\nexport async function checkAnswerKeyFile(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const file = resolved.question.answer_key?.file;\n  if (file === undefined) return;\n  try {\n    await resolved.source.fetch(file);\n  } catch (cause) {\n    issues.push({\n      rule: \"answer-key-file-missing\",\n      severity: \"error\",\n      at: `${at}.answer_key`,\n      message: `answer_key.file \"${file}\" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`,\n    });\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/**\n * Flag any id repeated within `items` — something no JSON Schema in this\n * repo enforces (schema validation is per-document, not \"unique across\n * this array\"), and a real authoring mistake wherever it happens: two\n * modules/lessons/options/pool candidates/etc. sharing one id makes that\n * id ambiguous to anything addressing by it.\n */\nexport function checkUniqueIds(items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const firstSeenAt = new Map<string, number>();\n  items.forEach((item, i) => {\n    const firstIndex = firstSeenAt.get(item.id);\n    if (firstIndex !== undefined) {\n      issues.push({\n        rule: \"duplicate-id\",\n        severity: \"error\",\n        at: `${at}[${i}]`,\n        message: `Duplicate id \"${item.id}\" (first seen at ${at}[${firstIndex}])`,\n      });\n    } else {\n      firstSeenAt.set(item.id, i);\n    }\n  });\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { checkIdExists, checkPermutation } from \"./rules/answer-references.js\";\nimport { checkAnswerKeyFile } from \"./rules/answer-key-file.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/**\n * Run every question-level rule: duplicate ids within the question's own\n * option/item/etc. arrays, dangling answer cross-references (only\n * meaningful in self-practice mode — a secured `answer_key` means the\n * answer isn't inline to check), and `answer_key.file` existence.\n */\nexport async function lintQuestion(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const { question } = resolved;\n  const typeConfigAt = `${at}.type_config`;\n  const isSecured = question.answer_key !== undefined;\n\n  switch (question.type) {\n    case \"mcq\": {\n      const { options, answer } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured && answer !== undefined) {\n        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);\n      }\n      break;\n    }\n    case \"msq\": {\n      const { options, answers } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured) {\n        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));\n      }\n      break;\n    }\n    case \"match\": {\n      const { left, right, pairs } = question.type_config;\n      checkUniqueIds(left, `${typeConfigAt}.left`, issues);\n      checkUniqueIds(right, `${typeConfigAt}.right`, issues);\n      if (!isSecured) {\n        (pairs ?? []).forEach((pair, i) => {\n          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);\n          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);\n        });\n      }\n      break;\n    }\n    case \"order\": {\n      const { items, correct_order } = question.type_config;\n      checkUniqueIds(items, `${typeConfigAt}.items`, issues);\n      if (!isSecured && correct_order !== undefined) {\n        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);\n      }\n      break;\n    }\n    case \"fill_blank\":\n      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);\n      break;\n    case \"code\":\n      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);\n      break;\n    case \"diagram\":\n      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);\n      break;\n    case \"numerical\":\n    case \"short_answer\":\n    case \"essay\":\n    case \"submission\":\n      break;\n  }\n\n  await checkAnswerKeyFile(resolved, at, issues);\n}\n","import type { OpfPoolQuestionEntry } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\nimport { checkUniqueIds } from \"./unique-ids.js\";\n\n/**\n * `select` must be between 1 and `from.length` — the schema can't enforce\n * this itself, since it's a relationship between two sibling fields\n * (see `OpfPoolQuestionEntry.select`'s own doc comment).\n */\nexport function checkPoolBounds(entry: OpfPoolQuestionEntry, at: string, issues: LintIssue[]): void {\n  if (entry.select < 1) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) must be at least 1`,\n    });\n  } else if (entry.select > entry.from.length) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`,\n    });\n  }\n  checkUniqueIds(entry.from, `${at}.from`, issues);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,IAAAA,mBAAwE;;;ACwBjE,SAAS,WAAW,QAAiC;AAC1D,SAAO,EAAE,QAAQ,IAAI,CAAC,OAAO,KAAK,CAAC,UAAU,MAAM,aAAa,OAAO,EAAE;AAC3E;;;AC3BA,sBAA+B;;;ACGxB,SAAS,cAAc,IAAY,MAAwB,IAAY,QAA2B;AACvG,MAAI,CAAC,KAAK,KAAK,CAAC,SAAS,KAAK,OAAO,EAAE,GAAG;AACxC,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,kBAAkB,EAAE,kCAAkC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA,IACjG,CAAC;AAAA,EACH;AACF;AAGO,SAAS,iBAAiB,OAAiB,OAAyB,IAAY,QAA2B;AAChH,QAAM,UAAU,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE;AAC3C,QAAM,YAAY,IAAI,IAAI,OAAO;AACjC,QAAM,aAAa,IAAI,IAAI,KAAK;AAChC,QAAM,UACJ,MAAM,WAAW,QAAQ,UACzB,WAAW,SAAS,MAAM,UAC1B,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,OAAO,UAAU,IAAI,EAAE,CAAC;AACjD,MAAI,CAAC,SAAS;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,qCAAqC,QAAQ,KAAK,IAAI,CAAC,WAAW,MAAM,KAAK,IAAI,CAAC;AAAA,IAC7F,CAAC;AAAA,EACH;AACF;;;ACpBA,eAAsB,mBAAmB,UAA4B,IAAY,QAAoC;AACnH,QAAM,OAAO,SAAS,SAAS,YAAY;AAC3C,MAAI,SAAS,OAAW;AACxB,MAAI;AACF,UAAM,SAAS,OAAO,MAAM,IAAI;AAAA,EAClC,SAAS,OAAO;AACd,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV,IAAI,GAAG,EAAE;AAAA,MACT,SAAS,oBAAoB,IAAI,wBAAwB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACjH,CAAC;AAAA,EACH;AACF;;;ACfO,SAAS,eAAe,OAAyB,IAAY,QAA2B;AAC7F,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,aAAa,YAAY,IAAI,KAAK,EAAE;AAC1C,QAAI,eAAe,QAAW;AAC5B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,UAAU;AAAA,QACV,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,QACd,SAAS,iBAAiB,KAAK,EAAE,oBAAoB,EAAE,IAAI,UAAU;AAAA,MACvE,CAAC;AAAA,IACH,OAAO;AACL,kBAAY,IAAI,KAAK,IAAI,CAAC;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;;;ACZA,eAAsB,aAAa,UAA4B,IAAY,QAAoC;AAC7G,QAAM,EAAE,SAAS,IAAI;AACrB,QAAM,eAAe,GAAG,EAAE;AAC1B,QAAM,YAAY,SAAS,eAAe;AAE1C,UAAQ,SAAS,MAAM;AAAA,IACrB,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,OAAO,IAAI,SAAS;AACrC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,aAAa,WAAW,QAAW;AACtC,sBAAc,QAAQ,SAAS,GAAG,YAAY,WAAW,MAAM;AAAA,MACjE;AACA;AAAA,IACF;AAAA,IACA,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,QAAQ,IAAI,SAAS;AACtC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,WAAW;AACd,SAAC,WAAW,CAAC,GAAG,QAAQ,CAAC,QAAQ,MAAM,cAAc,QAAQ,SAAS,GAAG,YAAY,YAAY,CAAC,KAAK,MAAM,CAAC;AAAA,MAChH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,MAAM,OAAO,MAAM,IAAI,SAAS;AACxC,qBAAe,MAAM,GAAG,YAAY,SAAS,MAAM;AACnD,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,WAAW;AACd,SAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,MAAM,MAAM;AACjC,wBAAc,KAAK,SAAS,MAAM,GAAG,YAAY,UAAU,CAAC,aAAa,MAAM;AAC/E,wBAAc,KAAK,UAAU,OAAO,GAAG,YAAY,UAAU,CAAC,cAAc,MAAM;AAAA,QACpF,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,OAAO,cAAc,IAAI,SAAS;AAC1C,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,aAAa,kBAAkB,QAAW;AAC7C,yBAAiB,eAAe,OAAO,GAAG,YAAY,kBAAkB,MAAM;AAAA,MAChF;AACA;AAAA,IACF;AAAA,IACA,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,YAAY,GAAG,YAAY,eAAe,MAAM;AACpF;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH;AAAA,EACJ;AAEA,QAAM,mBAAmB,UAAU,IAAI,MAAM;AAC/C;;;AC9DO,SAAS,gBAAgB,OAA6B,IAAY,QAA2B;AAClG,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM;AAAA,IAClC,CAAC;AAAA,EACH,WAAW,MAAM,SAAS,MAAM,KAAK,QAAQ;AAC3C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM,0BAA0B,MAAM,KAAK,MAAM;AAAA,IAC7E,CAAC;AAAA,EACH;AACA,iBAAe,MAAM,MAAM,GAAG,EAAE,SAAS,MAAM;AACjD;;;ALVO,SAAS,sBAAsB,QAAqC;AACzE,SAAO,OAAO;AAAA,IACZ,CAAC,WAAsB;AAAA,MACrB,MAAM,MAAM,QAAQ,SAAS,uBAAuB,IAAI,0BAA0B;AAAA,MAClF,UAAU;AAAA,MACV,IAAI,MAAM;AAAA,MACV,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AACF;AAEA,eAAsB,eAAe,KAAa,WAA+B,IAAY,QAAoC;AAC/H,iBAAe,IAAI,WAAW,GAAG,EAAE,cAAc,MAAM;AACvD,MAAI,UAAU,QAAQ,CAAC,OAAO,MAAM;AAClC,YAAI,gCAAe,KAAK,EAAG,iBAAgB,OAAO,GAAG,EAAE,cAAc,CAAC,KAAK,MAAM;AAAA,EACnF,CAAC;AACD,aAAW,YAAY,WAAW;AAChC,UAAM,aAAa,UAAU,GAAG,EAAE,iBAAiB,SAAS,EAAE,KAAK,MAAM;AAAA,EAC3E;AACF;AAEA,eAAe,iBAAiB,MAA6B,IAAY,QAAoC;AAC3G,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACrC,UAAM,eAAe,IAAI,KAAK,IAAI,WAAW,GAAG,EAAE,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClF;AACF;AAEA,eAAsB,mBAAmB,QAAwB,IAAY,QAAoC;AAC/G,iBAAe,OAAO,OAAO,YAAY,CAAC,GAAG,GAAG,EAAE,aAAa,MAAM;AACrE,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,QAAM,iBAAiB,OAAO,eAAe,IAAI,MAAM;AACzD;AAEA,eAAsB,mBAAmB,SAAyB,IAAY,QAAoC;AAChH,iBAAe,QAAQ,OAAO,SAAS,GAAG,EAAE,YAAY,MAAM;AAC9D,aAAW,CAAC,GAAG,MAAM,KAAK,QAAQ,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,QAAQ,GAAG,EAAE,YAAY,CAAC,KAAK,MAAM;AAAA,EAChE;AACF;AAEA,eAAsB,mBAAmB,QAAwB,QAAoC;AACnG,iBAAe,OAAO,OAAO,SAAS,kBAAkB,MAAM;AAC9D,aAAW,CAAC,GAAG,OAAO,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,SAAS,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClE;AACF;;;AF/CA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,UAAM,gCAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,MAAM;AAC/C,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,QAAQ,QAAuB,WAAW,YAAiC;AAC/F,QAAM,EAAE,MAAM,OAAO,IAAI,UAAM,6BAAW,QAAQ,QAAQ;AAC1D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,eAAe,KAAK,KAAK,KAAK,WAAW,OAAO,MAAM;AACtE,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,UAAM,gCAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,UAAM,gCAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;","names":["import_oes_core"]}

package/dist/index.d.cts

@@ -0,0 +1,34 @@
+import { ContentSource } from '@inklyre/oes-core';
+
+type LintSeverity = "error" | "warning";
+/** Every check this package runs — used as `LintIssue.rule`, and as the rule name printed in CLI output. */
+type LintRule = "dangling-reference" | "content-hash-mismatch" | "duplicate-id" | "pool-select-bounds" | "dangling-answer-reference" | "answer-key-file-missing";
+interface LintIssue {
+    rule: LintRule;
+    severity: LintSeverity;
+    /** Where in the tree this was found, e.g. `"course.modules[0].lessons[1].practice_sets[0].questions[id=q1]"`. */
+    at: string;
+    message: string;
+}
+interface LintResult {
+    issues: LintIssue[];
+    /** `false` iff at least one `"error"`-severity issue was found — a `"warning"` alone doesn't fail a lint run. */
+    ok: boolean;
+}
+
+/**
+ * Lint a full course tree from a `course.json` entry point: every check
+ * `resolve()` already makes (dangling references, `content_hash`
+ * mismatches) plus everything only a whole-tree view can catch —
+ * duplicate ids, pool `select` bounds, dangling answer cross-references,
+ * `answer_key` file existence.
+ */
+declare function lintCourse(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single practice set from a `set.json` entry point — for a set-only repo, outside any course. */
+declare function lintSet(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single lesson from a `lesson.json` entry point — for previewing/authoring one lesson in isolation. */
+declare function lintLesson(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single module from a `module.json` entry point — for previewing/authoring one module in isolation. */
+declare function lintModule(source: ContentSource, location?: string): Promise<LintResult>;
+
+export { type LintIssue, type LintResult, type LintRule, type LintSeverity, lintCourse, lintLesson, lintModule, lintSet };

package/dist/index.d.ts

@@ -0,0 +1,34 @@
+import { ContentSource } from '@inklyre/oes-core';
+
+type LintSeverity = "error" | "warning";
+/** Every check this package runs — used as `LintIssue.rule`, and as the rule name printed in CLI output. */
+type LintRule = "dangling-reference" | "content-hash-mismatch" | "duplicate-id" | "pool-select-bounds" | "dangling-answer-reference" | "answer-key-file-missing";
+interface LintIssue {
+    rule: LintRule;
+    severity: LintSeverity;
+    /** Where in the tree this was found, e.g. `"course.modules[0].lessons[1].practice_sets[0].questions[id=q1]"`. */
+    at: string;
+    message: string;
+}
+interface LintResult {
+    issues: LintIssue[];
+    /** `false` iff at least one `"error"`-severity issue was found — a `"warning"` alone doesn't fail a lint run. */
+    ok: boolean;
+}
+
+/**
+ * Lint a full course tree from a `course.json` entry point: every check
+ * `resolve()` already makes (dangling references, `content_hash`
+ * mismatches) plus everything only a whole-tree view can catch —
+ * duplicate ids, pool `select` bounds, dangling answer cross-references,
+ * `answer_key` file existence.
+ */
+declare function lintCourse(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single practice set from a `set.json` entry point — for a set-only repo, outside any course. */
+declare function lintSet(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single lesson from a `lesson.json` entry point — for previewing/authoring one lesson in isolation. */
+declare function lintLesson(source: ContentSource, location?: string): Promise<LintResult>;
+/** Lint a single module from a `module.json` entry point — for previewing/authoring one module in isolation. */
+declare function lintModule(source: ContentSource, location?: string): Promise<LintResult>;
+
+export { type LintIssue, type LintResult, type LintRule, type LintSeverity, lintCourse, lintLesson, lintModule, lintSet };

package/dist/index.js

@@ -0,0 +1,227 @@
+// src/index.ts
+import { resolveCourse, resolveLesson, resolveModule, resolveSet } from "@inklyre/oes-core";
+
+// src/types.ts
+function lintResult(issues) {
+  return { issues, ok: !issues.some((issue) => issue.severity === "error") };
+}
+
+// src/tree.ts
+import { isOpfPoolEntry } from "@inklyre/oes-core";
+
+// src/rules/answer-references.ts
+function checkIdExists(id, pool, at, issues) {
+  if (!pool.some((item) => item.id === id)) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `References id "${id}", which does not exist among [${pool.map((i) => i.id).join(", ")}]`
+    });
+  }
+}
+function checkPermutation(order, items, at, issues) {
+  const itemIds = items.map((item) => item.id);
+  const itemIdSet = new Set(itemIds);
+  const orderIdSet = new Set(order);
+  const isValid = order.length === itemIds.length && orderIdSet.size === order.length && [...orderIdSet].every((id) => itemIdSet.has(id));
+  if (!isValid) {
+    issues.push({
+      rule: "dangling-answer-reference",
+      severity: "error",
+      at,
+      message: `Must be exactly a permutation of [${itemIds.join(", ")}], got [${order.join(", ")}]`
+    });
+  }
+}
+
+// src/rules/answer-key-file.ts
+async function checkAnswerKeyFile(resolved, at, issues) {
+  const file = resolved.question.answer_key?.file;
+  if (file === void 0) return;
+  try {
+    await resolved.source.fetch(file);
+  } catch (cause) {
+    issues.push({
+      rule: "answer-key-file-missing",
+      severity: "error",
+      at: `${at}.answer_key`,
+      message: `answer_key.file "${file}" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`
+    });
+  }
+}
+
+// src/rules/unique-ids.ts
+function checkUniqueIds(items, at, issues) {
+  const firstSeenAt = /* @__PURE__ */ new Map();
+  items.forEach((item, i) => {
+    const firstIndex = firstSeenAt.get(item.id);
+    if (firstIndex !== void 0) {
+      issues.push({
+        rule: "duplicate-id",
+        severity: "error",
+        at: `${at}[${i}]`,
+        message: `Duplicate id "${item.id}" (first seen at ${at}[${firstIndex}])`
+      });
+    } else {
+      firstSeenAt.set(item.id, i);
+    }
+  });
+}
+
+// src/question.ts
+async function lintQuestion(resolved, at, issues) {
+  const { question } = resolved;
+  const typeConfigAt = `${at}.type_config`;
+  const isSecured = question.answer_key !== void 0;
+  switch (question.type) {
+    case "mcq": {
+      const { options, answer } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured && answer !== void 0) {
+        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);
+      }
+      break;
+    }
+    case "msq": {
+      const { options, answers } = question.type_config;
+      checkUniqueIds(options, `${typeConfigAt}.options`, issues);
+      if (!isSecured) {
+        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));
+      }
+      break;
+    }
+    case "match": {
+      const { left, right, pairs } = question.type_config;
+      checkUniqueIds(left, `${typeConfigAt}.left`, issues);
+      checkUniqueIds(right, `${typeConfigAt}.right`, issues);
+      if (!isSecured) {
+        (pairs ?? []).forEach((pair, i) => {
+          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);
+          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);
+        });
+      }
+      break;
+    }
+    case "order": {
+      const { items, correct_order } = question.type_config;
+      checkUniqueIds(items, `${typeConfigAt}.items`, issues);
+      if (!isSecured && correct_order !== void 0) {
+        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);
+      }
+      break;
+    }
+    case "fill_blank":
+      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);
+      break;
+    case "code":
+      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);
+      break;
+    case "diagram":
+      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);
+      break;
+    case "numerical":
+    case "short_answer":
+    case "essay":
+    case "submission":
+      break;
+  }
+  await checkAnswerKeyFile(resolved, at, issues);
+}
+
+// src/rules/pool-bounds.ts
+function checkPoolBounds(entry, at, issues) {
+  if (entry.select < 1) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) must be at least 1`
+    });
+  } else if (entry.select > entry.from.length) {
+    issues.push({
+      rule: "pool-select-bounds",
+      severity: "error",
+      at,
+      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`
+    });
+  }
+  checkUniqueIds(entry.from, `${at}.from`, issues);
+}
+
+// src/tree.ts
+function resolveErrorsToIssues(errors) {
+  return errors.map(
+    (error) => ({
+      rule: error.message.includes("content_hash mismatch") ? "content-hash-mismatch" : "dangling-reference",
+      severity: "error",
+      at: error.at,
+      message: error.message
+    })
+  );
+}
+async function lintSetContent(set, questions, at, issues) {
+  checkUniqueIds(set.questions, `${at}.questions`, issues);
+  set.questions.forEach((entry, i) => {
+    if (isOpfPoolEntry(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);
+  });
+  for (const question of questions) {
+    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);
+  }
+}
+async function lintPracticeSets(sets, at, issues) {
+  for (const [i, set] of sets.entries()) {
+    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);
+  }
+}
+async function lintResolvedLesson(lesson, at, issues) {
+  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);
+  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);
+  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);
+  await lintPracticeSets(lesson.practice_sets, at, issues);
+}
+async function lintResolvedModule(module_, at, issues) {
+  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);
+  for (const [i, lesson] of module_.lessons.entries()) {
+    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);
+  }
+}
+async function lintResolvedCourse(course, issues) {
+  checkUniqueIds(course.course.modules, "course.modules", issues);
+  for (const [i, module_] of course.modules.entries()) {
+    await lintResolvedModule(module_, `course.modules[${i}]`, issues);
+  }
+}
+
+// src/index.ts
+async function lintCourse(source, location = "course.json") {
+  const { data, errors } = await resolveCourse(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedCourse(data, issues);
+  return lintResult(issues);
+}
+async function lintSet(source, location = "set.json") {
+  const { data, errors } = await resolveSet(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintSetContent(data.set, data.questions, "set", issues);
+  return lintResult(issues);
+}
+async function lintLesson(source, location = "lesson.json") {
+  const { data, errors } = await resolveLesson(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedLesson(data, "lesson", issues);
+  return lintResult(issues);
+}
+async function lintModule(source, location = "module.json") {
+  const { data, errors } = await resolveModule(source, location);
+  const issues = resolveErrorsToIssues(errors);
+  if (data) await lintResolvedModule(data, "module", issues);
+  return lintResult(issues);
+}
+export {
+  lintCourse,
+  lintLesson,
+  lintModule,
+  lintSet
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/types.ts","../src/tree.ts","../src/rules/answer-references.ts","../src/rules/answer-key-file.ts","../src/rules/unique-ids.ts","../src/question.ts","../src/rules/pool-bounds.ts"],"sourcesContent":["import type { ContentSource } from \"@inklyre/oes-core\";\nimport { resolveCourse, resolveLesson, resolveModule, resolveSet } from \"@inklyre/oes-core\";\nimport type { LintIssue, LintResult } from \"./types.js\";\nimport { lintResult } from \"./types.js\";\nimport { lintResolvedCourse, lintResolvedLesson, lintResolvedModule, lintSetContent, resolveErrorsToIssues } from \"./tree.js\";\n\nexport type { LintIssue, LintResult, LintRule, LintSeverity } from \"./types.js\";\n\n/**\n * Lint a full course tree from a `course.json` entry point: every check\n * `resolve()` already makes (dangling references, `content_hash`\n * mismatches) plus everything only a whole-tree view can catch —\n * duplicate ids, pool `select` bounds, dangling answer cross-references,\n * `answer_key` file existence.\n */\nexport async function lintCourse(source: ContentSource, location = \"course.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveCourse(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedCourse(data, issues);\n  return lintResult(issues);\n}\n\n/** Lint a single practice set from a `set.json` entry point — for a set-only repo, outside any course. */\nexport async function lintSet(source: ContentSource, location = \"set.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveSet(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintSetContent(data.set, data.questions, \"set\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single lesson from a `lesson.json` entry point — for previewing/authoring one lesson in isolation. */\nexport async function lintLesson(source: ContentSource, location = \"lesson.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveLesson(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedLesson(data, \"lesson\", issues);\n  return lintResult(issues);\n}\n\n/** Lint a single module from a `module.json` entry point — for previewing/authoring one module in isolation. */\nexport async function lintModule(source: ContentSource, location = \"module.json\"): Promise<LintResult> {\n  const { data, errors } = await resolveModule(source, location);\n  const issues: LintIssue[] = resolveErrorsToIssues(errors);\n  if (data) await lintResolvedModule(data, \"module\", issues);\n  return lintResult(issues);\n}\n","export type LintSeverity = \"error\" | \"warning\";\n\n/** Every check this package runs — used as `LintIssue.rule`, and as the rule name printed in CLI output. */\nexport type LintRule =\n  | \"dangling-reference\"\n  | \"content-hash-mismatch\"\n  | \"duplicate-id\"\n  | \"pool-select-bounds\"\n  | \"dangling-answer-reference\"\n  | \"answer-key-file-missing\";\n\nexport interface LintIssue {\n  rule: LintRule;\n  severity: LintSeverity;\n  /** Where in the tree this was found, e.g. `\"course.modules[0].lessons[1].practice_sets[0].questions[id=q1]\"`. */\n  at: string;\n  message: string;\n}\n\nexport interface LintResult {\n  issues: LintIssue[];\n  /** `false` iff at least one `\"error\"`-severity issue was found — a `\"warning\"` alone doesn't fail a lint run. */\n  ok: boolean;\n}\n\nexport function lintResult(issues: LintIssue[]): LintResult {\n  return { issues, ok: !issues.some((issue) => issue.severity === \"error\") };\n}\n","import { isOpfPoolEntry } from \"@inklyre/oes-core\";\nimport type {\n  OpfSet,\n  ResolvedCourse,\n  ResolvedLesson,\n  ResolvedModule,\n  ResolvedPracticeSet,\n  ResolvedQuestion,\n  ResolveError,\n} from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { lintQuestion } from \"./question.js\";\nimport { checkPoolBounds } from \"./rules/pool-bounds.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/** `resolveCourse`/`resolveSet`'s own errors (dangling references, `content_hash` mismatches) — already-detected issues, just relabeled into this package's shape. */\nexport function resolveErrorsToIssues(errors: ResolveError[]): LintIssue[] {\n  return errors.map(\n    (error): LintIssue => ({\n      rule: error.message.includes(\"content_hash mismatch\") ? \"content-hash-mismatch\" : \"dangling-reference\",\n      severity: \"error\",\n      at: error.at,\n      message: error.message,\n    })\n  );\n}\n\nexport async function lintSetContent(set: OpfSet, questions: ResolvedQuestion[], at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(set.questions, `${at}.questions`, issues);\n  set.questions.forEach((entry, i) => {\n    if (isOpfPoolEntry(entry)) checkPoolBounds(entry, `${at}.questions[${i}]`, issues);\n  });\n  for (const question of questions) {\n    await lintQuestion(question, `${at}.questions[id=${question.id}]`, issues);\n  }\n}\n\nasync function lintPracticeSets(sets: ResolvedPracticeSet[], at: string, issues: LintIssue[]): Promise<void> {\n  for (const [i, set] of sets.entries()) {\n    await lintSetContent(set.set, set.questions, `${at}.practice_sets[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedLesson(lesson: ResolvedLesson, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(lesson.lesson.articles ?? [], `${at}.articles`, issues);\n  checkUniqueIds(lesson.lesson.video_lessons ?? [], `${at}.video_lessons`, issues);\n  checkUniqueIds(lesson.lesson.practice_sets ?? [], `${at}.practice_sets`, issues);\n  await lintPracticeSets(lesson.practice_sets, at, issues);\n}\n\nexport async function lintResolvedModule(module_: ResolvedModule, at: string, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(module_.module.lessons, `${at}.lessons`, issues);\n  for (const [i, lesson] of module_.lessons.entries()) {\n    await lintResolvedLesson(lesson, `${at}.lessons[${i}]`, issues);\n  }\n}\n\nexport async function lintResolvedCourse(course: ResolvedCourse, issues: LintIssue[]): Promise<void> {\n  checkUniqueIds(course.course.modules, \"course.modules\", issues);\n  for (const [i, module_] of course.modules.entries()) {\n    await lintResolvedModule(module_, `course.modules[${i}]`, issues);\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/** Flag `id` if it isn't one of `pool`'s ids — e.g. an `mcq`'s `answer` pointing at a nonexistent option. */\nexport function checkIdExists(id: string, pool: { id: string }[], at: string, issues: LintIssue[]): void {\n  if (!pool.some((item) => item.id === id)) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `References id \"${id}\", which does not exist among [${pool.map((i) => i.id).join(\", \")}]`,\n    });\n  }\n}\n\n/** Flag `order` if it isn't exactly a permutation of `items`' ids — every id present once, none missing, none extra. */\nexport function checkPermutation(order: string[], items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const itemIds = items.map((item) => item.id);\n  const itemIdSet = new Set(itemIds);\n  const orderIdSet = new Set(order);\n  const isValid =\n    order.length === itemIds.length &&\n    orderIdSet.size === order.length &&\n    [...orderIdSet].every((id) => itemIdSet.has(id));\n  if (!isValid) {\n    issues.push({\n      rule: \"dangling-answer-reference\",\n      severity: \"error\",\n      at,\n      message: `Must be exactly a permutation of [${itemIds.join(\", \")}], got [${order.join(\", \")}]`,\n    });\n  }\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\n\n/**\n * When `answer_key.file` is set, confirm the file actually exists —\n * independent of whether `resolve()` ever fetches it, since it\n * deliberately doesn't (a public/student-facing consumer built on\n * `resolveCourse`/`resolveSet` must never gain a path to the answer\n * through the shared resolver). Uses the question's own re-rooted\n * `source`, exposed on {@link ResolvedQuestion} for exactly this purpose.\n */\nexport async function checkAnswerKeyFile(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const file = resolved.question.answer_key?.file;\n  if (file === undefined) return;\n  try {\n    await resolved.source.fetch(file);\n  } catch (cause) {\n    issues.push({\n      rule: \"answer-key-file-missing\",\n      severity: \"error\",\n      at: `${at}.answer_key`,\n      message: `answer_key.file \"${file}\" could not be read: ${cause instanceof Error ? cause.message : String(cause)}`,\n    });\n  }\n}\n","import type { LintIssue } from \"../types.js\";\n\n/**\n * Flag any id repeated within `items` — something no JSON Schema in this\n * repo enforces (schema validation is per-document, not \"unique across\n * this array\"), and a real authoring mistake wherever it happens: two\n * modules/lessons/options/pool candidates/etc. sharing one id makes that\n * id ambiguous to anything addressing by it.\n */\nexport function checkUniqueIds(items: { id: string }[], at: string, issues: LintIssue[]): void {\n  const firstSeenAt = new Map<string, number>();\n  items.forEach((item, i) => {\n    const firstIndex = firstSeenAt.get(item.id);\n    if (firstIndex !== undefined) {\n      issues.push({\n        rule: \"duplicate-id\",\n        severity: \"error\",\n        at: `${at}[${i}]`,\n        message: `Duplicate id \"${item.id}\" (first seen at ${at}[${firstIndex}])`,\n      });\n    } else {\n      firstSeenAt.set(item.id, i);\n    }\n  });\n}\n","import type { ResolvedQuestion } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"./types.js\";\nimport { checkIdExists, checkPermutation } from \"./rules/answer-references.js\";\nimport { checkAnswerKeyFile } from \"./rules/answer-key-file.js\";\nimport { checkUniqueIds } from \"./rules/unique-ids.js\";\n\n/**\n * Run every question-level rule: duplicate ids within the question's own\n * option/item/etc. arrays, dangling answer cross-references (only\n * meaningful in self-practice mode — a secured `answer_key` means the\n * answer isn't inline to check), and `answer_key.file` existence.\n */\nexport async function lintQuestion(resolved: ResolvedQuestion, at: string, issues: LintIssue[]): Promise<void> {\n  const { question } = resolved;\n  const typeConfigAt = `${at}.type_config`;\n  const isSecured = question.answer_key !== undefined;\n\n  switch (question.type) {\n    case \"mcq\": {\n      const { options, answer } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured && answer !== undefined) {\n        checkIdExists(answer, options, `${typeConfigAt}.answer`, issues);\n      }\n      break;\n    }\n    case \"msq\": {\n      const { options, answers } = question.type_config;\n      checkUniqueIds(options, `${typeConfigAt}.options`, issues);\n      if (!isSecured) {\n        (answers ?? []).forEach((answer, i) => checkIdExists(answer, options, `${typeConfigAt}.answers[${i}]`, issues));\n      }\n      break;\n    }\n    case \"match\": {\n      const { left, right, pairs } = question.type_config;\n      checkUniqueIds(left, `${typeConfigAt}.left`, issues);\n      checkUniqueIds(right, `${typeConfigAt}.right`, issues);\n      if (!isSecured) {\n        (pairs ?? []).forEach((pair, i) => {\n          checkIdExists(pair.left_id, left, `${typeConfigAt}.pairs[${i}].left_id`, issues);\n          checkIdExists(pair.right_id, right, `${typeConfigAt}.pairs[${i}].right_id`, issues);\n        });\n      }\n      break;\n    }\n    case \"order\": {\n      const { items, correct_order } = question.type_config;\n      checkUniqueIds(items, `${typeConfigAt}.items`, issues);\n      if (!isSecured && correct_order !== undefined) {\n        checkPermutation(correct_order, items, `${typeConfigAt}.correct_order`, issues);\n      }\n      break;\n    }\n    case \"fill_blank\":\n      checkUniqueIds(question.type_config.blanks, `${typeConfigAt}.blanks`, issues);\n      break;\n    case \"code\":\n      checkUniqueIds(question.type_config.test_cases, `${typeConfigAt}.test_cases`, issues);\n      break;\n    case \"diagram\":\n      checkUniqueIds(question.type_config.labels, `${typeConfigAt}.labels`, issues);\n      break;\n    case \"numerical\":\n    case \"short_answer\":\n    case \"essay\":\n    case \"submission\":\n      break;\n  }\n\n  await checkAnswerKeyFile(resolved, at, issues);\n}\n","import type { OpfPoolQuestionEntry } from \"@inklyre/oes-core\";\nimport type { LintIssue } from \"../types.js\";\nimport { checkUniqueIds } from \"./unique-ids.js\";\n\n/**\n * `select` must be between 1 and `from.length` — the schema can't enforce\n * this itself, since it's a relationship between two sibling fields\n * (see `OpfPoolQuestionEntry.select`'s own doc comment).\n */\nexport function checkPoolBounds(entry: OpfPoolQuestionEntry, at: string, issues: LintIssue[]): void {\n  if (entry.select < 1) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) must be at least 1`,\n    });\n  } else if (entry.select > entry.from.length) {\n    issues.push({\n      rule: \"pool-select-bounds\",\n      severity: \"error\",\n      at,\n      message: `select (${entry.select}) exceeds from.length (${entry.from.length})`,\n    });\n  }\n  checkUniqueIds(entry.from, `${at}.from`, issues);\n}\n"],"mappings":";AACA,SAAS,eAAe,eAAe,eAAe,kBAAkB;;;ACwBjE,SAAS,WAAW,QAAiC;AAC1D,SAAO,EAAE,QAAQ,IAAI,CAAC,OAAO,KAAK,CAAC,UAAU,MAAM,aAAa,OAAO,EAAE;AAC3E;;;AC3BA,SAAS,sBAAsB;;;ACGxB,SAAS,cAAc,IAAY,MAAwB,IAAY,QAA2B;AACvG,MAAI,CAAC,KAAK,KAAK,CAAC,SAAS,KAAK,OAAO,EAAE,GAAG;AACxC,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,kBAAkB,EAAE,kCAAkC,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA,IACjG,CAAC;AAAA,EACH;AACF;AAGO,SAAS,iBAAiB,OAAiB,OAAyB,IAAY,QAA2B;AAChH,QAAM,UAAU,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE;AAC3C,QAAM,YAAY,IAAI,IAAI,OAAO;AACjC,QAAM,aAAa,IAAI,IAAI,KAAK;AAChC,QAAM,UACJ,MAAM,WAAW,QAAQ,UACzB,WAAW,SAAS,MAAM,UAC1B,CAAC,GAAG,UAAU,EAAE,MAAM,CAAC,OAAO,UAAU,IAAI,EAAE,CAAC;AACjD,MAAI,CAAC,SAAS;AACZ,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,qCAAqC,QAAQ,KAAK,IAAI,CAAC,WAAW,MAAM,KAAK,IAAI,CAAC;AAAA,IAC7F,CAAC;AAAA,EACH;AACF;;;ACpBA,eAAsB,mBAAmB,UAA4B,IAAY,QAAoC;AACnH,QAAM,OAAO,SAAS,SAAS,YAAY;AAC3C,MAAI,SAAS,OAAW;AACxB,MAAI;AACF,UAAM,SAAS,OAAO,MAAM,IAAI;AAAA,EAClC,SAAS,OAAO;AACd,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV,IAAI,GAAG,EAAE;AAAA,MACT,SAAS,oBAAoB,IAAI,wBAAwB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACjH,CAAC;AAAA,EACH;AACF;;;ACfO,SAAS,eAAe,OAAyB,IAAY,QAA2B;AAC7F,QAAM,cAAc,oBAAI,IAAoB;AAC5C,QAAM,QAAQ,CAAC,MAAM,MAAM;AACzB,UAAM,aAAa,YAAY,IAAI,KAAK,EAAE;AAC1C,QAAI,eAAe,QAAW;AAC5B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,UAAU;AAAA,QACV,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,QACd,SAAS,iBAAiB,KAAK,EAAE,oBAAoB,EAAE,IAAI,UAAU;AAAA,MACvE,CAAC;AAAA,IACH,OAAO;AACL,kBAAY,IAAI,KAAK,IAAI,CAAC;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;;;ACZA,eAAsB,aAAa,UAA4B,IAAY,QAAoC;AAC7G,QAAM,EAAE,SAAS,IAAI;AACrB,QAAM,eAAe,GAAG,EAAE;AAC1B,QAAM,YAAY,SAAS,eAAe;AAE1C,UAAQ,SAAS,MAAM;AAAA,IACrB,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,OAAO,IAAI,SAAS;AACrC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,aAAa,WAAW,QAAW;AACtC,sBAAc,QAAQ,SAAS,GAAG,YAAY,WAAW,MAAM;AAAA,MACjE;AACA;AAAA,IACF;AAAA,IACA,KAAK,OAAO;AACV,YAAM,EAAE,SAAS,QAAQ,IAAI,SAAS;AACtC,qBAAe,SAAS,GAAG,YAAY,YAAY,MAAM;AACzD,UAAI,CAAC,WAAW;AACd,SAAC,WAAW,CAAC,GAAG,QAAQ,CAAC,QAAQ,MAAM,cAAc,QAAQ,SAAS,GAAG,YAAY,YAAY,CAAC,KAAK,MAAM,CAAC;AAAA,MAChH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,MAAM,OAAO,MAAM,IAAI,SAAS;AACxC,qBAAe,MAAM,GAAG,YAAY,SAAS,MAAM;AACnD,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,WAAW;AACd,SAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,MAAM,MAAM;AACjC,wBAAc,KAAK,SAAS,MAAM,GAAG,YAAY,UAAU,CAAC,aAAa,MAAM;AAC/E,wBAAc,KAAK,UAAU,OAAO,GAAG,YAAY,UAAU,CAAC,cAAc,MAAM;AAAA,QACpF,CAAC;AAAA,MACH;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,EAAE,OAAO,cAAc,IAAI,SAAS;AAC1C,qBAAe,OAAO,GAAG,YAAY,UAAU,MAAM;AACrD,UAAI,CAAC,aAAa,kBAAkB,QAAW;AAC7C,yBAAiB,eAAe,OAAO,GAAG,YAAY,kBAAkB,MAAM;AAAA,MAChF;AACA;AAAA,IACF;AAAA,IACA,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,YAAY,GAAG,YAAY,eAAe,MAAM;AACpF;AAAA,IACF,KAAK;AACH,qBAAe,SAAS,YAAY,QAAQ,GAAG,YAAY,WAAW,MAAM;AAC5E;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH;AAAA,EACJ;AAEA,QAAM,mBAAmB,UAAU,IAAI,MAAM;AAC/C;;;AC9DO,SAAS,gBAAgB,OAA6B,IAAY,QAA2B;AAClG,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM;AAAA,IAClC,CAAC;AAAA,EACH,WAAW,MAAM,SAAS,MAAM,KAAK,QAAQ;AAC3C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,MACV;AAAA,MACA,SAAS,WAAW,MAAM,MAAM,0BAA0B,MAAM,KAAK,MAAM;AAAA,IAC7E,CAAC;AAAA,EACH;AACA,iBAAe,MAAM,MAAM,GAAG,EAAE,SAAS,MAAM;AACjD;;;ALVO,SAAS,sBAAsB,QAAqC;AACzE,SAAO,OAAO;AAAA,IACZ,CAAC,WAAsB;AAAA,MACrB,MAAM,MAAM,QAAQ,SAAS,uBAAuB,IAAI,0BAA0B;AAAA,MAClF,UAAU;AAAA,MACV,IAAI,MAAM;AAAA,MACV,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AACF;AAEA,eAAsB,eAAe,KAAa,WAA+B,IAAY,QAAoC;AAC/H,iBAAe,IAAI,WAAW,GAAG,EAAE,cAAc,MAAM;AACvD,MAAI,UAAU,QAAQ,CAAC,OAAO,MAAM;AAClC,QAAI,eAAe,KAAK,EAAG,iBAAgB,OAAO,GAAG,EAAE,cAAc,CAAC,KAAK,MAAM;AAAA,EACnF,CAAC;AACD,aAAW,YAAY,WAAW;AAChC,UAAM,aAAa,UAAU,GAAG,EAAE,iBAAiB,SAAS,EAAE,KAAK,MAAM;AAAA,EAC3E;AACF;AAEA,eAAe,iBAAiB,MAA6B,IAAY,QAAoC;AAC3G,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACrC,UAAM,eAAe,IAAI,KAAK,IAAI,WAAW,GAAG,EAAE,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClF;AACF;AAEA,eAAsB,mBAAmB,QAAwB,IAAY,QAAoC;AAC/G,iBAAe,OAAO,OAAO,YAAY,CAAC,GAAG,GAAG,EAAE,aAAa,MAAM;AACrE,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,iBAAe,OAAO,OAAO,iBAAiB,CAAC,GAAG,GAAG,EAAE,kBAAkB,MAAM;AAC/E,QAAM,iBAAiB,OAAO,eAAe,IAAI,MAAM;AACzD;AAEA,eAAsB,mBAAmB,SAAyB,IAAY,QAAoC;AAChH,iBAAe,QAAQ,OAAO,SAAS,GAAG,EAAE,YAAY,MAAM;AAC9D,aAAW,CAAC,GAAG,MAAM,KAAK,QAAQ,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,QAAQ,GAAG,EAAE,YAAY,CAAC,KAAK,MAAM;AAAA,EAChE;AACF;AAEA,eAAsB,mBAAmB,QAAwB,QAAoC;AACnG,iBAAe,OAAO,OAAO,SAAS,kBAAkB,MAAM;AAC9D,aAAW,CAAC,GAAG,OAAO,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACnD,UAAM,mBAAmB,SAAS,kBAAkB,CAAC,KAAK,MAAM;AAAA,EAClE;AACF;;;AF/CA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,MAAM;AAC/C,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,QAAQ,QAAuB,WAAW,YAAiC;AAC/F,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,WAAW,QAAQ,QAAQ;AAC1D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,eAAe,KAAK,KAAK,KAAK,WAAW,OAAO,MAAM;AACtE,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;AAGA,eAAsB,WAAW,QAAuB,WAAW,eAAoC;AACrG,QAAM,EAAE,MAAM,OAAO,IAAI,MAAM,cAAc,QAAQ,QAAQ;AAC7D,QAAM,SAAsB,sBAAsB,MAAM;AACxD,MAAI,KAAM,OAAM,mBAAmB,MAAM,UAAU,MAAM;AACzD,SAAO,WAAW,MAAM;AAC1B;","names":[]}

package/package.json

@@ -0,0 +1,44 @@
+{
+  "name": "@inklyre/oes-lint",
+  "version": "0.1.0",
+  "description": "Referential-integrity linting for OES content: dangling references, duplicate ids, pool select bounds, answer cross-references, answer_key file existence, and content_hash mismatches.",
+  "license": "MIT",
+  "type": "module",
+  "main": "./dist/index.cjs",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "bin": {
+    "oes": "dist/cli.js"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "sideEffects": false,
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "typecheck": "tsc --noEmit",
+    "lint": "eslint src test",
+    "test": "vitest run",
+    "test:watch": "vitest"
+  },
+  "dependencies": {
+    "@inklyre/oes-core": "^0.2.1"
+  },
+  "devDependencies": {
+    "@eslint/js": "^9.18.0",
+    "@types/node": "^22.10.5",
+    "eslint": "^9.18.0",
+    "tsup": "^8.3.5",
+    "typescript": "^5.8.3",
+    "typescript-eslint": "^8.20.0",
+    "vitest": "^3.0.5"
+  }
+}