@remnic/core 1.1.2 → 1.1.3

package/dist/chunk-AJA46VX5.js

@@ -0,0 +1,393 @@
+import {
+  DERIVED_FROM_MEMORY_ID_RE
+} from "./chunk-G7D6GZ5J.js";
+
+// src/training-export/date-parse.ts
+var DAYS_IN_MONTH = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
+function isLeapYear(year) {
+  return year % 4 === 0 && year % 100 !== 0 || year % 400 === 0;
+}
+function isCalendarDateValid(year, month, day) {
+  if (!Number.isInteger(year) || !Number.isInteger(month) || !Number.isInteger(day)) {
+    return false;
+  }
+  if (month < 1 || month > 12) return false;
+  if (day < 1) return false;
+  const maxDay = month === 2 && isLeapYear(year) ? 29 : DAYS_IN_MONTH[month];
+  return day <= maxDay;
+}
+function parseStrictCliDate(value, flagName) {
+  const shape = /^(\d{4})-(\d{2})-(\d{2})(?:T(\d{2}):(\d{2})(?::(\d{2})(?:\.(\d{1,9}))?)?(Z|[+-]\d{2}:\d{2})?)?$/;
+  const match = value.match(shape);
+  if (!match) {
+    throw new Error(
+      `Invalid ${flagName} value "${value}": expected ISO 8601 format (YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss[.sss][Z|\xB1HH:MM]).`
+    );
+  }
+  const year = Number(match[1]);
+  const month = Number(match[2]);
+  const day = Number(match[3]);
+  if (!isCalendarDateValid(year, month, day)) {
+    throw new Error(
+      `Invalid ${flagName} value "${value}": date components overflow (e.g. month has fewer days). Provide a valid calendar date.`
+    );
+  }
+  if (match[4] !== void 0) {
+    const hour = Number(match[4]);
+    const minute = Number(match[5]);
+    const second = match[6] !== void 0 ? Number(match[6]) : 0;
+    if (hour > 23 || minute > 59 || second > 59) {
+      throw new Error(
+        `Invalid ${flagName} value "${value}": time components out of range.`
+      );
+    }
+  }
+  const d = new Date(value);
+  if (!Number.isFinite(d.getTime())) {
+    throw new Error(
+      `Invalid ${flagName} value "${value}". Provide an ISO 8601 date string (YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss).`
+    );
+  }
+  return d;
+}
+
+// src/patterns-cli.ts
+var PATTERNS_OUTPUT_FORMATS = ["text", "markdown", "json"];
+function parsePatternsFormat(value) {
+  if (value === void 0 || value === null) return "text";
+  if (typeof value !== "string" || !PATTERNS_OUTPUT_FORMATS.includes(value)) {
+    throw new Error(
+      `--format expects one of ${PATTERNS_OUTPUT_FORMATS.join(", ")}; got ${JSON.stringify(value)}`
+    );
+  }
+  return value;
+}
+function parsePatternsLimit(value) {
+  if (value === void 0 || value === null) return void 0;
+  const parsed = typeof value === "number" ? value : Number(value);
+  if (!Number.isFinite(parsed) || !Number.isInteger(parsed) || parsed <= 0) {
+    throw new Error(
+      `--limit expects a positive integer; got ${JSON.stringify(value)}`
+    );
+  }
+  return parsed;
+}
+function parsePatternsCategory(value) {
+  if (value === void 0 || value === null) return void 0;
+  if (typeof value !== "string") {
+    throw new Error(
+      `--category expects a comma-separated list of category names; got ${JSON.stringify(value)}`
+    );
+  }
+  const parts = value.split(",").map((part) => part.trim()).filter((part) => part.length > 0);
+  if (parts.length === 0) {
+    throw new Error(
+      `--category expects at least one non-empty category name; got ${JSON.stringify(value)}`
+    );
+  }
+  const seen = /* @__PURE__ */ new Set();
+  const unique = [];
+  for (const part of parts) {
+    if (!seen.has(part)) {
+      seen.add(part);
+      unique.push(part);
+    }
+  }
+  return unique;
+}
+function parsePatternsSince(value) {
+  if (value === void 0 || value === null) return void 0;
+  if (typeof value !== "string" || value.trim().length === 0) {
+    throw new Error(
+      `--since expects an ISO 8601 timestamp (e.g. 2026-04-01T00:00:00Z); got ${JSON.stringify(value)}`
+    );
+  }
+  return parseStrictCliDate(value.trim(), "--since").toISOString();
+}
+function parsePatternsListOptions(options) {
+  const format = parsePatternsFormat(options.format);
+  const limit = parsePatternsLimit(options.limit);
+  const categories = parsePatternsCategory(options.category);
+  const sinceIso = parsePatternsSince(options.since);
+  return {
+    format,
+    ...limit !== void 0 ? { limit } : {},
+    ...categories !== void 0 ? { categories } : {},
+    ...sinceIso !== void 0 ? { sinceIso } : {}
+  };
+}
+function parsePatternsExplainOptions(rawId, options) {
+  if (typeof rawId !== "string" || rawId.trim().length === 0) {
+    throw new Error("patterns explain: <memoryId> is required and must be non-empty");
+  }
+  const format = parsePatternsFormat(options.format);
+  return { id: rawId.trim(), format };
+}
+var DEFAULT_LIST_LIMIT = 50;
+function collectPatternMemories(memories, opts) {
+  const sinceMs = opts.sinceIso !== void 0 ? Date.parse(opts.sinceIso) : void 0;
+  const categorySet = opts.categories !== void 0 ? new Set(opts.categories) : void 0;
+  const rows = [];
+  for (const memory of memories) {
+    const fm = memory.frontmatter;
+    const count = fm.reinforcement_count;
+    if (typeof count !== "number" || !Number.isInteger(count) || count <= 0) {
+      continue;
+    }
+    if (categorySet !== void 0 && !categorySet.has(fm.category)) {
+      continue;
+    }
+    if (sinceMs !== void 0) {
+      if (typeof fm.last_reinforced_at !== "string") continue;
+      const ts = Date.parse(fm.last_reinforced_at);
+      if (!Number.isFinite(ts) || ts < sinceMs) continue;
+    }
+    rows.push({
+      id: fm.id,
+      category: fm.category,
+      reinforcementCount: count,
+      ...fm.last_reinforced_at !== void 0 ? { lastReinforcedAt: fm.last_reinforced_at } : {},
+      status: fm.status ?? "active",
+      preview: extractPreview(memory.content),
+      path: memory.path
+    });
+  }
+  rows.sort((a, b) => {
+    if (b.reinforcementCount !== a.reinforcementCount) {
+      return b.reinforcementCount - a.reinforcementCount;
+    }
+    const aRaw = a.lastReinforcedAt ? Date.parse(a.lastReinforcedAt) : NaN;
+    const bRaw = b.lastReinforcedAt ? Date.parse(b.lastReinforcedAt) : NaN;
+    const aTs = Number.isFinite(aRaw) ? aRaw : 0;
+    const bTs = Number.isFinite(bRaw) ? bRaw : 0;
+    if (bTs !== aTs) return bTs - aTs;
+    if (a.id < b.id) return -1;
+    if (a.id > b.id) return 1;
+    return 0;
+  });
+  const limit = opts.limit ?? DEFAULT_LIST_LIMIT;
+  return rows.slice(0, limit);
+}
+function explainPatternMemory(memories, id) {
+  const canonical = memories.find((m) => m.frontmatter.id === id);
+  if (!canonical) return null;
+  const fm = canonical.frontmatter;
+  const count = fm.reinforcement_count;
+  if (typeof count !== "number" || !Number.isInteger(count) || count <= 0) {
+    return null;
+  }
+  const derivedFrom = (fm.derived_from ?? []).map(
+    (ref) => {
+      const lastColon = ref.lastIndexOf(":");
+      const pathLikeRef = looksLikeDerivedFromPath(ref);
+      if (lastColon >= 0) {
+        const path = ref.slice(0, lastColon);
+        const versionStr = ref.slice(lastColon + 1);
+        if (looksLikeDerivedFromPath(path) && /^\d+$/.test(versionStr)) {
+          return { ref, path, version: Number(versionStr) };
+        }
+        if (!pathLikeRef && DERIVED_FROM_MEMORY_ID_RE.test(ref)) {
+          return { ref, path: ref, version: null };
+        }
+        return { ref, path: ref, version: null, malformed: true };
+      }
+      if (DERIVED_FROM_MEMORY_ID_RE.test(ref)) {
+        return {
+          ref,
+          path: ref,
+          version: null
+        };
+      }
+      return { ref, path: ref, version: null, malformed: true };
+    }
+  );
+  const members = [];
+  for (const m of memories) {
+    if (m.frontmatter.supersededBy === id) {
+      members.push({
+        id: m.frontmatter.id,
+        status: m.frontmatter.status ?? "active",
+        ...m.frontmatter.supersededAt !== void 0 ? { supersededAt: m.frontmatter.supersededAt } : {},
+        path: m.path,
+        preview: extractPreview(m.content)
+      });
+    }
+  }
+  members.sort((a, b) => {
+    const aRaw = a.supersededAt ? Date.parse(a.supersededAt) : NaN;
+    const bRaw = b.supersededAt ? Date.parse(b.supersededAt) : NaN;
+    const aTs = Number.isFinite(aRaw) ? aRaw : 0;
+    const bTs = Number.isFinite(bRaw) ? bRaw : 0;
+    if (bTs !== aTs) return bTs - aTs;
+    if (a.id < b.id) return -1;
+    if (a.id > b.id) return 1;
+    return 0;
+  });
+  return {
+    id: fm.id,
+    category: fm.category,
+    reinforcementCount: count,
+    ...fm.last_reinforced_at !== void 0 ? { lastReinforcedAt: fm.last_reinforced_at } : {},
+    status: fm.status ?? "active",
+    ...fm.derived_via !== void 0 ? { derivedVia: fm.derived_via } : {},
+    canonicalContent: canonical.content.trim(),
+    canonicalPath: canonical.path,
+    derivedFrom,
+    clusterMembers: members
+  };
+}
+function renderPatternsList(rows, format) {
+  if (format === "json") {
+    return JSON.stringify({ rows }, null, 2);
+  }
+  if (rows.length === 0) {
+    if (format === "markdown") {
+      return "# Pattern memories\n\n_No reinforced patterns found._\n";
+    }
+    return "No reinforced patterns found.";
+  }
+  if (format === "markdown") {
+    const lines2 = ["# Pattern memories", ""];
+    lines2.push("| Count | ID | Category | Last reinforced | Preview |");
+    lines2.push("| --- | --- | --- | --- | --- |");
+    for (const row of rows) {
+      const last = row.lastReinforcedAt ?? "\u2014";
+      const preview = escapePipes(row.preview);
+      lines2.push(
+        `| ${row.reinforcementCount} | \`${row.id}\` | ${row.category} | ${last} | ${preview} |`
+      );
+    }
+    return lines2.join("\n") + "\n";
+  }
+  const lines = [];
+  lines.push(`Pattern memories (${rows.length}):`);
+  lines.push("");
+  for (const row of rows) {
+    const last = row.lastReinforcedAt ?? "\u2014";
+    lines.push(
+      `  [${row.reinforcementCount}x] ${row.id}  (${row.category}, last_reinforced=${last}, status=${row.status})`
+    );
+    if (row.preview.length > 0) {
+      lines.push(`        ${row.preview}`);
+    }
+    lines.push(`        path: ${row.path}`);
+  }
+  return lines.join("\n");
+}
+function renderPatternExplain(detail, format) {
+  if (format === "json") {
+    return JSON.stringify(detail, null, 2);
+  }
+  const last = detail.lastReinforcedAt ?? "\u2014";
+  const derivedVia = detail.derivedVia ?? "\u2014";
+  if (format === "markdown") {
+    const lines2 = [];
+    lines2.push(`# Pattern: \`${detail.id}\``);
+    lines2.push("");
+    lines2.push(`- **Reinforcement count:** ${detail.reinforcementCount}`);
+    lines2.push(`- **Last reinforced:** ${last}`);
+    lines2.push(`- **Category:** ${detail.category}`);
+    lines2.push(`- **Status:** ${detail.status}`);
+    lines2.push(`- **Derived via:** ${derivedVia}`);
+    lines2.push(`- **Path:** \`${detail.canonicalPath}\``);
+    lines2.push("");
+    lines2.push("## Canonical content");
+    lines2.push("");
+    lines2.push("```");
+    lines2.push(detail.canonicalContent);
+    lines2.push("```");
+    lines2.push("");
+    lines2.push(`## Derived from (${detail.derivedFrom.length})`);
+    lines2.push("");
+    if (detail.derivedFrom.length === 0) {
+      lines2.push("_No derived_from entries recorded._");
+    } else {
+      for (const entry of detail.derivedFrom) {
+        const versionStr = entry.version !== null ? ` v${entry.version}` : entry.malformed ? " (malformed)" : "";
+        lines2.push(`- \`${entry.path}\`${versionStr}`);
+      }
+    }
+    lines2.push("");
+    lines2.push(`## Cluster members (${detail.clusterMembers.length})`);
+    lines2.push("");
+    if (detail.clusterMembers.length === 0) {
+      lines2.push("_No superseded members reference this canonical._");
+    } else {
+      for (const member of detail.clusterMembers) {
+        const ts = member.supersededAt ?? "\u2014";
+        lines2.push(`- \`${member.id}\` (status=${member.status}, supersededAt=${ts})`);
+        if (member.preview.length > 0) {
+          lines2.push(`  - ${escapePipes(member.preview)}`);
+        }
+      }
+    }
+    return lines2.join("\n") + "\n";
+  }
+  const lines = [];
+  lines.push(`Pattern: ${detail.id}`);
+  lines.push(`  reinforcement_count: ${detail.reinforcementCount}`);
+  lines.push(`  last_reinforced_at: ${last}`);
+  lines.push(`  category:           ${detail.category}`);
+  lines.push(`  status:             ${detail.status}`);
+  lines.push(`  derived_via:        ${derivedVia}`);
+  lines.push(`  path:               ${detail.canonicalPath}`);
+  lines.push("");
+  lines.push("Canonical content:");
+  for (const line of detail.canonicalContent.split("\n")) {
+    lines.push(`  ${line}`);
+  }
+  lines.push("");
+  lines.push(`Derived from (${detail.derivedFrom.length}):`);
+  if (detail.derivedFrom.length === 0) {
+    lines.push("  (none)");
+  } else {
+    for (const entry of detail.derivedFrom) {
+      const versionStr = entry.version !== null ? ` v${entry.version}` : entry.malformed ? " (malformed)" : "";
+      lines.push(`  - ${entry.path}${versionStr}`);
+    }
+  }
+  lines.push("");
+  lines.push(`Cluster members (${detail.clusterMembers.length}):`);
+  if (detail.clusterMembers.length === 0) {
+    lines.push("  (none)");
+  } else {
+    for (const member of detail.clusterMembers) {
+      const ts = member.supersededAt ?? "\u2014";
+      lines.push(`  - ${member.id} (status=${member.status}, supersededAt=${ts})`);
+      if (member.preview.length > 0) {
+        lines.push(`      ${member.preview}`);
+      }
+    }
+  }
+  return lines.join("\n");
+}
+function extractPreview(content) {
+  const trimmed = content.trim();
+  if (trimmed.length === 0) return "";
+  const firstLine = trimmed.split("\n").find((line) => line.trim().length > 0) ?? "";
+  const collapsed = firstLine.trim().replace(/\s+/g, " ");
+  if (collapsed.length <= 120) return collapsed;
+  return collapsed.slice(0, 117) + "...";
+}
+function looksLikeDerivedFromPath(value) {
+  return value.includes("/") || value.includes(".");
+}
+function escapePipes(value) {
+  return value.replace(/\\/g, "\\\\").replace(/\|/g, "\\|");
+}
+
+export {
+  parseStrictCliDate,
+  PATTERNS_OUTPUT_FORMATS,
+  parsePatternsFormat,
+  parsePatternsLimit,
+  parsePatternsCategory,
+  parsePatternsSince,
+  parsePatternsListOptions,
+  parsePatternsExplainOptions,
+  collectPatternMemories,
+  explainPatternMemory,
+  renderPatternsList,
+  renderPatternExplain
+};
+//# sourceMappingURL=chunk-AJA46VX5.js.map

package/dist/chunk-AJA46VX5.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/training-export/date-parse.ts","../src/patterns-cli.ts"],"sourcesContent":["/**\n * Strict ISO 8601 date parsing for training-export CLI flags.\n *\n * Extracted from `cli.ts` so that both the canonical CLI (in\n * `@remnic/core`) and the thin front-end CLI (in `@remnic/cli`) can share\n * the same validator without duplicating the overflow/timezone rules.\n *\n * The parser rejects:\n *   - Non-ISO strings (e.g. \"12/25/2026\", \"Dec 25 2026\")\n *   - Calendar overflows (Feb 30, Feb 29 in non-leap years, Apr 31, etc.)\n *     regardless of timezone suffix\n *   - Out-of-range time components (hour >= 24, minute >= 60, second >= 60)\n *\n * Calendar overflow is validated structurally on the Y-M-D components, so\n * results are independent of the host's local timezone.\n */\n\n/**\n * Days in each month (1-indexed). February is 28 here; leap-year handling\n * is applied by `isCalendarDateValid` below.\n */\nconst DAYS_IN_MONTH = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\n\nfunction isLeapYear(year: number): boolean {\n  return (year % 4 === 0 && year % 100 !== 0) || year % 400 === 0;\n}\n\n/**\n * True iff `year-month-day` is a valid Gregorian calendar date. Input\n * numbers must be integer-valued; month is 1-12, day is 1-31 nominally.\n */\nexport function isCalendarDateValid(\n  year: number,\n  month: number,\n  day: number,\n): boolean {\n  if (\n    !Number.isInteger(year) ||\n    !Number.isInteger(month) ||\n    !Number.isInteger(day)\n  ) {\n    return false;\n  }\n  if (month < 1 || month > 12) return false;\n  if (day < 1) return false;\n  const maxDay = month === 2 && isLeapYear(year) ? 29 : DAYS_IN_MONTH[month];\n  return day <= maxDay;\n}\n\n/**\n * Parse a strict ISO 8601 date string, rejecting malformed inputs, calendar\n * overflows, and out-of-range time components with a descriptive error.\n *\n * Accepted forms:\n *   YYYY-MM-DD\n *   YYYY-MM-DDTHH:mm:ss                (naive / local time)\n *   YYYY-MM-DDTHH:mm:ss.sssZ           (UTC)\n *   YYYY-MM-DDTHH:mm:ss+HH:MM          (with timezone offset)\n *   YYYY-MM-DDTHH:mm:ss.sss-HH:MM      (with timezone offset)\n *\n * `flagName` is included in the error message so users can identify which\n * input failed (e.g. `--since` vs. `--until`).\n */\nexport function parseStrictCliDate(value: string, flagName: string): Date {\n  // 1. Shape check: must begin YYYY-MM-DD and use ISO 8601 structure.\n  //    This rejects \"12/25/2026\", \"December 25, 2026\", RFC 2822, etc.\n  const shape =\n    /^(\\d{4})-(\\d{2})-(\\d{2})(?:T(\\d{2}):(\\d{2})(?::(\\d{2})(?:\\.(\\d{1,9}))?)?(Z|[+-]\\d{2}:\\d{2})?)?$/;\n  const match = value.match(shape);\n  if (!match) {\n    throw new Error(\n      `Invalid ${flagName} value \"${value}\": expected ISO 8601 format (YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss[.sss][Z|±HH:MM]).`,\n    );\n  }\n\n  const year = Number(match[1]);\n  const month = Number(match[2]);\n  const day = Number(match[3]);\n\n  // 2. Structural calendar validation. This rejects Feb 31, Feb 29 in\n  //    non-leap years, Apr 31, etc. regardless of the timezone suffix, so\n  //    \"2026-02-31T00:00:00+05:30\" is rejected the same way as \"2026-02-31Z\".\n  if (!isCalendarDateValid(year, month, day)) {\n    throw new Error(\n      `Invalid ${flagName} value \"${value}\": date components overflow (e.g. month has fewer days). Provide a valid calendar date.`,\n    );\n  }\n\n  // 3. Optional time-component validation.\n  //    JavaScript's Date cannot represent a leap second: `:60` is silently\n  //    normalised to `:00` of the following minute, which would make a\n  //    \"strict\" validator return a different timestamp than the user\n  //    requested. Reject second == 60 outright so a strict parse cannot\n  //    round-trip to a different clock value.\n  if (match[4] !== undefined) {\n    const hour = Number(match[4]);\n    const minute = Number(match[5]);\n    const second = match[6] !== undefined ? Number(match[6]) : 0;\n    if (hour > 23 || minute > 59 || second > 59) {\n      throw new Error(\n        `Invalid ${flagName} value \"${value}\": time components out of range.`,\n      );\n    }\n  }\n\n  // 4. Finally parse via Date for the actual timestamp value. At this point\n  //    we've already validated structure and calendar correctness, so any\n  //    remaining NaN (extremely unlikely) still fails closed.\n  const d = new Date(value);\n  if (!Number.isFinite(d.getTime())) {\n    throw new Error(\n      `Invalid ${flagName} value \"${value}\". Provide an ISO 8601 date string (YYYY-MM-DD or YYYY-MM-DDTHH:mm:ss).`,\n    );\n  }\n\n  return d;\n}\n","/**\n * `remnic patterns` CLI helpers (issue #687 PR 4/4).\n *\n * Pure functions that:\n *\n *   1. Validate `--limit`, `--category`, `--since`, `--format` for\n *      `remnic patterns list` and `--format` for\n *      `remnic patterns explain <id>` (CLAUDE.md rules 14 + 51 — flags\n *      throw listed-options errors instead of silently defaulting).\n *\n *   2. Filter the memory corpus to canonical memories produced by the\n *      pattern-reinforcement maintenance job from issue #687 PR 2/4\n *      (`reinforcement_count > 0`) and sort them by reinforcement\n *      count, with `last_reinforced_at` (then `id`) as stable\n *      tiebreakers (CLAUDE.md rule 19).\n *\n *   3. Reconstruct a single canonical's full picture: its\n *      `derived_from` provenance chain (PR 2/4 stamps these), the\n *      cluster members it absorbed (memories pointing at it via\n *      `supersededBy`), and the canonical body so operators can read\n *      it inline.\n *\n *   4. Render `text` (default) / `markdown` / `json` output for both\n *      commands.  The CLI handler in `cli.ts` stays thin and delegates\n *      formatting here so HTTP / MCP surfaces (if added later) can\n *      reuse the same renderers (CLAUDE.md rule 22 — never fork\n *      formatting).\n */\n\nimport type { MemoryCategory, MemoryFile } from \"./types.js\";\nimport { DERIVED_FROM_MEMORY_ID_RE } from \"./consolidation-operator.js\";\nimport { parseStrictCliDate } from \"./training-export/date-parse.js\";\n\nexport const PATTERNS_OUTPUT_FORMATS = [\"text\", \"markdown\", \"json\"] as const;\nexport type PatternsOutputFormat = (typeof PATTERNS_OUTPUT_FORMATS)[number];\n\n// ───────────────────────────────────────────────────────────────────────────\n// Flag validation\n// ───────────────────────────────────────────────────────────────────────────\n\n/**\n * Validate `--format <fmt>`.  Throws a listed-options error for any\n * value not in `PATTERNS_OUTPUT_FORMATS`.  Returns `\"text\"` when the\n * value is `undefined` (no flag supplied).\n */\nexport function parsePatternsFormat(value: unknown): PatternsOutputFormat {\n  if (value === undefined || value === null) return \"text\";\n  if (\n    typeof value !== \"string\" ||\n    !(PATTERNS_OUTPUT_FORMATS as readonly string[]).includes(value)\n  ) {\n    throw new Error(\n      `--format expects one of ${PATTERNS_OUTPUT_FORMATS.join(\", \")}; got ${JSON.stringify(value)}`,\n    );\n  }\n  return value as PatternsOutputFormat;\n}\n\n/**\n * Validate `--limit <N>`.  Must be a positive integer.  Returns\n * `undefined` when the flag is absent (the caller falls back to a\n * default).\n */\nexport function parsePatternsLimit(value: unknown): number | undefined {\n  if (value === undefined || value === null) return undefined;\n  const parsed = typeof value === \"number\" ? value : Number(value);\n  if (!Number.isFinite(parsed) || !Number.isInteger(parsed) || parsed <= 0) {\n    throw new Error(\n      `--limit expects a positive integer; got ${JSON.stringify(value)}`,\n    );\n  }\n  return parsed;\n}\n\n/**\n * Validate `--category <list>`.  Accepts a comma-separated list of\n * non-empty trimmed tokens.  Returns the deduplicated list, or\n * `undefined` when no flag was supplied.  CLAUDE.md rules 14 + 51:\n * `--category` with no value or with a value that resolves to zero\n * tokens is rejected.\n */\nexport function parsePatternsCategory(value: unknown): string[] | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"string\") {\n    throw new Error(\n      `--category expects a comma-separated list of category names; got ${JSON.stringify(value)}`,\n    );\n  }\n  const parts = value\n    .split(\",\")\n    .map((part) => part.trim())\n    .filter((part) => part.length > 0);\n  if (parts.length === 0) {\n    throw new Error(\n      `--category expects at least one non-empty category name; got ${JSON.stringify(value)}`,\n    );\n  }\n  // Deduplicate while preserving first-seen order.\n  const seen = new Set<string>();\n  const unique: string[] = [];\n  for (const part of parts) {\n    if (!seen.has(part)) {\n      seen.add(part);\n      unique.push(part);\n    }\n  }\n  return unique;\n}\n\n/**\n * Validate `--since <ISO>`.  Delegates to `parseStrictCliDate` which\n * enforces a strict ISO 8601 shape and rejects calendar overflows and\n * non-ISO formats (e.g. \"12/25/2026\", \"Dec 25 2026\") that bare\n * `Date.parse()` would silently accept.  Returns the canonical ISO\n * string (round-trip through `toISOString`) so downstream comparisons\n * use a consistent form.\n */\nexport function parsePatternsSince(value: unknown): string | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"string\" || value.trim().length === 0) {\n    throw new Error(\n      `--since expects an ISO 8601 timestamp (e.g. 2026-04-01T00:00:00Z); got ${JSON.stringify(value)}`,\n    );\n  }\n  // parseStrictCliDate throws with a descriptive message on invalid input.\n  return parseStrictCliDate(value.trim(), \"--since\").toISOString();\n}\n\nexport interface ParsedPatternsListOptions {\n  format: PatternsOutputFormat;\n  limit?: number;\n  categories?: string[];\n  sinceIso?: string;\n}\n\nexport interface ParsedPatternsExplainOptions {\n  format: PatternsOutputFormat;\n}\n\n/**\n * Validate the full option bag for `remnic patterns list`.  Extracted\n * from the CLI handler so validation can be unit-tested without\n * booting an orchestrator (CLAUDE.md rules 14 + 51).\n */\nexport function parsePatternsListOptions(\n  options: Record<string, unknown>,\n): ParsedPatternsListOptions {\n  const format = parsePatternsFormat(options.format);\n  const limit = parsePatternsLimit(options.limit);\n  const categories = parsePatternsCategory(options.category);\n  const sinceIso = parsePatternsSince(options.since);\n  return {\n    format,\n    ...(limit !== undefined ? { limit } : {}),\n    ...(categories !== undefined ? { categories } : {}),\n    ...(sinceIso !== undefined ? { sinceIso } : {}),\n  };\n}\n\n/**\n * Validate `remnic patterns explain` options + positional id.  Throws\n * when `<memoryId>` is missing or empty.\n */\nexport function parsePatternsExplainOptions(\n  rawId: unknown,\n  options: Record<string, unknown>,\n): { id: string } & ParsedPatternsExplainOptions {\n  if (typeof rawId !== \"string\" || rawId.trim().length === 0) {\n    throw new Error(\"patterns explain: <memoryId> is required and must be non-empty\");\n  }\n  const format = parsePatternsFormat(options.format);\n  return { id: rawId.trim(), format };\n}\n\n// ───────────────────────────────────────────────────────────────────────────\n// Core list / explain behavior\n// ───────────────────────────────────────────────────────────────────────────\n\nexport interface PatternListRow {\n  id: string;\n  category: MemoryCategory;\n  reinforcementCount: number;\n  lastReinforcedAt?: string;\n  status: string;\n  /** First non-empty content line, trimmed to ~120 chars for the table. */\n  preview: string;\n  /** Full path on disk (relative to memoryDir) for operators who want to inspect the file. */\n  path: string;\n}\n\nconst DEFAULT_LIST_LIMIT = 50;\n\n/**\n * Filter, sort, and slice the memory corpus down to the rows the\n * `remnic patterns list` command should print.\n *\n * Rules (each one is exercised by `tests/cli/patterns.test.ts`):\n *\n *   - Memories without `reinforcement_count` (or with a count <= 0) are\n *     dropped — these are not pattern canonicals.\n *   - When `categories` is supplied, only memories whose\n *     `frontmatter.category` is in the list survive.\n *   - When `sinceIso` is supplied, only memories whose\n *     `last_reinforced_at` is `>= sinceIso` survive.  Memories without\n *     `last_reinforced_at` are dropped under `--since` (PR 2/4 always\n *     stamps the timestamp alongside the count, so a missing timestamp\n *     means a malformed file the operator should not see in this view).\n *   - Sort by `reinforcement_count DESC`, then `last_reinforced_at\n *     DESC`, then `id ASC` for a stable, deterministic order\n *     (CLAUDE.md rule 19).\n *   - Apply `limit` (default 50).\n */\nexport function collectPatternMemories(\n  memories: readonly MemoryFile[],\n  opts: ParsedPatternsListOptions,\n): PatternListRow[] {\n  const sinceMs =\n    opts.sinceIso !== undefined ? Date.parse(opts.sinceIso) : undefined;\n  const categorySet =\n    opts.categories !== undefined ? new Set(opts.categories) : undefined;\n\n  const rows: PatternListRow[] = [];\n  for (const memory of memories) {\n    const fm = memory.frontmatter;\n    const count = fm.reinforcement_count;\n    if (typeof count !== \"number\" || !Number.isInteger(count) || count <= 0) {\n      continue;\n    }\n    if (categorySet !== undefined && !categorySet.has(fm.category)) {\n      continue;\n    }\n    if (sinceMs !== undefined) {\n      if (typeof fm.last_reinforced_at !== \"string\") continue;\n      const ts = Date.parse(fm.last_reinforced_at);\n      if (!Number.isFinite(ts) || ts < sinceMs) continue;\n    }\n    rows.push({\n      id: fm.id,\n      category: fm.category,\n      reinforcementCount: count,\n      ...(fm.last_reinforced_at !== undefined\n        ? { lastReinforcedAt: fm.last_reinforced_at }\n        : {}),\n      status: fm.status ?? \"active\",\n      preview: extractPreview(memory.content),\n      path: memory.path,\n    });\n  }\n\n  rows.sort((a, b) => {\n    if (b.reinforcementCount !== a.reinforcementCount) {\n      return b.reinforcementCount - a.reinforcementCount;\n    }\n    // Guard NaN: malformed date strings make Date.parse return NaN, which\n    // breaks the sort contract (NaN comparator return == non-deterministic\n    // ordering).  Treat invalid/missing timestamps as 0 (oldest possible).\n    const aRaw = a.lastReinforcedAt ? Date.parse(a.lastReinforcedAt) : NaN;\n    const bRaw = b.lastReinforcedAt ? Date.parse(b.lastReinforcedAt) : NaN;\n    const aTs = Number.isFinite(aRaw) ? aRaw : 0;\n    const bTs = Number.isFinite(bRaw) ? bRaw : 0;\n    if (bTs !== aTs) return bTs - aTs;\n    if (a.id < b.id) return -1;\n    if (a.id > b.id) return 1;\n    return 0;\n  });\n\n  const limit = opts.limit ?? DEFAULT_LIST_LIMIT;\n  return rows.slice(0, limit);\n}\n\nexport interface PatternDerivedFromEntry {\n  /** Raw `\"<path>:<version>\"` reference exactly as stored in `derived_from`. */\n  ref: string;\n  /** Source memory id, or the path component for older `path:version` references. */\n  path: string;\n  /** Page-version number component for older `path:version` references. */\n  version: number | null;\n  /** True when an older path-version reference had an invalid version component. */\n  malformed?: boolean;\n}\n\nexport interface PatternClusterMember {\n  id: string;\n  status: string;\n  supersededAt?: string;\n  path: string;\n  preview: string;\n}\n\nexport interface PatternExplainDetail {\n  id: string;\n  category: MemoryCategory;\n  reinforcementCount: number;\n  lastReinforcedAt?: string;\n  status: string;\n  derivedVia?: string;\n  /** Full canonical body (frontmatter stripped). */\n  canonicalContent: string;\n  canonicalPath: string;\n  /** Parsed `derived_from` chain — empty when PR 2/4 did not stamp it. */\n  derivedFrom: PatternDerivedFromEntry[];\n  /** Memories whose `supersededBy === <id>`, sorted by `supersededAt DESC` then `id ASC`. */\n  clusterMembers: PatternClusterMember[];\n}\n\n/**\n * Build the structured detail object for a single canonical.  Returns\n * `null` when the memory is not found or has never been touched by\n * pattern reinforcement (i.e., no `reinforcement_count`).  The CLI\n * handler then prints a clean \"not a pattern\" error rather than\n * leaking an empty document.\n */\nexport function explainPatternMemory(\n  memories: readonly MemoryFile[],\n  id: string,\n): PatternExplainDetail | null {\n  const canonical = memories.find((m) => m.frontmatter.id === id);\n  if (!canonical) return null;\n  const fm = canonical.frontmatter;\n  const count = fm.reinforcement_count;\n  if (typeof count !== \"number\" || !Number.isInteger(count) || count <= 0) {\n    return null;\n  }\n\n  const derivedFrom: PatternDerivedFromEntry[] = (fm.derived_from ?? []).map(\n    (ref) => {\n      const lastColon = ref.lastIndexOf(\":\");\n      const pathLikeRef = looksLikeDerivedFromPath(ref);\n      if (lastColon >= 0) {\n        const path = ref.slice(0, lastColon);\n        const versionStr = ref.slice(lastColon + 1);\n        if (\n          looksLikeDerivedFromPath(path) &&\n          /^\\d+$/.test(versionStr)\n        ) {\n          return { ref, path, version: Number(versionStr) };\n        }\n        if (!pathLikeRef && DERIVED_FROM_MEMORY_ID_RE.test(ref)) {\n          return { ref, path: ref, version: null };\n        }\n        return { ref, path: ref, version: null, malformed: true };\n      }\n      if (DERIVED_FROM_MEMORY_ID_RE.test(ref)) {\n        return {\n          ref,\n          path: ref,\n          version: null,\n        };\n      }\n      return { ref, path: ref, version: null, malformed: true };\n    },\n  );\n\n  const members: PatternClusterMember[] = [];\n  for (const m of memories) {\n    if (m.frontmatter.supersededBy === id) {\n      members.push({\n        id: m.frontmatter.id,\n        status: m.frontmatter.status ?? \"active\",\n        ...(m.frontmatter.supersededAt !== undefined\n          ? { supersededAt: m.frontmatter.supersededAt }\n          : {}),\n        path: m.path,\n        preview: extractPreview(m.content),\n      });\n    }\n  }\n  members.sort((a, b) => {\n    // Guard NaN: same rationale as collectPatternMemories sort — malformed\n    // supersededAt strings must not produce a NaN return from the comparator.\n    const aRaw = a.supersededAt ? Date.parse(a.supersededAt) : NaN;\n    const bRaw = b.supersededAt ? Date.parse(b.supersededAt) : NaN;\n    const aTs = Number.isFinite(aRaw) ? aRaw : 0;\n    const bTs = Number.isFinite(bRaw) ? bRaw : 0;\n    if (bTs !== aTs) return bTs - aTs;\n    if (a.id < b.id) return -1;\n    if (a.id > b.id) return 1;\n    return 0;\n  });\n\n  return {\n    id: fm.id,\n    category: fm.category,\n    reinforcementCount: count,\n    ...(fm.last_reinforced_at !== undefined\n      ? { lastReinforcedAt: fm.last_reinforced_at }\n      : {}),\n    status: fm.status ?? \"active\",\n    ...(fm.derived_via !== undefined ? { derivedVia: fm.derived_via } : {}),\n    canonicalContent: canonical.content.trim(),\n    canonicalPath: canonical.path,\n    derivedFrom,\n    clusterMembers: members,\n  };\n}\n\n// ───────────────────────────────────────────────────────────────────────────\n// Renderers\n// ───────────────────────────────────────────────────────────────────────────\n\nexport function renderPatternsList(\n  rows: readonly PatternListRow[],\n  format: PatternsOutputFormat,\n): string {\n  if (format === \"json\") {\n    return JSON.stringify({ rows }, null, 2);\n  }\n  if (rows.length === 0) {\n    if (format === \"markdown\") {\n      return \"# Pattern memories\\n\\n_No reinforced patterns found._\\n\";\n    }\n    return \"No reinforced patterns found.\";\n  }\n  if (format === \"markdown\") {\n    const lines: string[] = [\"# Pattern memories\", \"\"];\n    lines.push(\"| Count | ID | Category | Last reinforced | Preview |\");\n    lines.push(\"| --- | --- | --- | --- | --- |\");\n    for (const row of rows) {\n      const last = row.lastReinforcedAt ?? \"—\";\n      const preview = escapePipes(row.preview);\n      lines.push(\n        `| ${row.reinforcementCount} | \\`${row.id}\\` | ${row.category} | ${last} | ${preview} |`,\n      );\n    }\n    return lines.join(\"\\n\") + \"\\n\";\n  }\n  // text\n  const lines: string[] = [];\n  lines.push(`Pattern memories (${rows.length}):`);\n  lines.push(\"\");\n  for (const row of rows) {\n    const last = row.lastReinforcedAt ?? \"—\";\n    lines.push(\n      `  [${row.reinforcementCount}x] ${row.id}  (${row.category}, last_reinforced=${last}, status=${row.status})`,\n    );\n    if (row.preview.length > 0) {\n      lines.push(`        ${row.preview}`);\n    }\n    lines.push(`        path: ${row.path}`);\n  }\n  return lines.join(\"\\n\");\n}\n\nexport function renderPatternExplain(\n  detail: PatternExplainDetail,\n  format: PatternsOutputFormat,\n): string {\n  if (format === \"json\") {\n    return JSON.stringify(detail, null, 2);\n  }\n  const last = detail.lastReinforcedAt ?? \"—\";\n  const derivedVia = detail.derivedVia ?? \"—\";\n  if (format === \"markdown\") {\n    const lines: string[] = [];\n    lines.push(`# Pattern: \\`${detail.id}\\``);\n    lines.push(\"\");\n    lines.push(`- **Reinforcement count:** ${detail.reinforcementCount}`);\n    lines.push(`- **Last reinforced:** ${last}`);\n    lines.push(`- **Category:** ${detail.category}`);\n    lines.push(`- **Status:** ${detail.status}`);\n    lines.push(`- **Derived via:** ${derivedVia}`);\n    lines.push(`- **Path:** \\`${detail.canonicalPath}\\``);\n    lines.push(\"\");\n    lines.push(\"## Canonical content\");\n    lines.push(\"\");\n    lines.push(\"```\");\n    lines.push(detail.canonicalContent);\n    lines.push(\"```\");\n    lines.push(\"\");\n    lines.push(`## Derived from (${detail.derivedFrom.length})`);\n    lines.push(\"\");\n    if (detail.derivedFrom.length === 0) {\n      lines.push(\"_No derived_from entries recorded._\");\n    } else {\n      for (const entry of detail.derivedFrom) {\n        const versionStr =\n          entry.version !== null\n            ? ` v${entry.version}`\n            : entry.malformed\n              ? \" (malformed)\"\n              : \"\";\n        lines.push(`- \\`${entry.path}\\`${versionStr}`);\n      }\n    }\n    lines.push(\"\");\n    lines.push(`## Cluster members (${detail.clusterMembers.length})`);\n    lines.push(\"\");\n    if (detail.clusterMembers.length === 0) {\n      lines.push(\"_No superseded members reference this canonical._\");\n    } else {\n      for (const member of detail.clusterMembers) {\n        const ts = member.supersededAt ?? \"—\";\n        lines.push(`- \\`${member.id}\\` (status=${member.status}, supersededAt=${ts})`);\n        if (member.preview.length > 0) {\n          lines.push(`  - ${escapePipes(member.preview)}`);\n        }\n      }\n    }\n    return lines.join(\"\\n\") + \"\\n\";\n  }\n  // text\n  const lines: string[] = [];\n  lines.push(`Pattern: ${detail.id}`);\n  lines.push(`  reinforcement_count: ${detail.reinforcementCount}`);\n  lines.push(`  last_reinforced_at: ${last}`);\n  lines.push(`  category:           ${detail.category}`);\n  lines.push(`  status:             ${detail.status}`);\n  lines.push(`  derived_via:        ${derivedVia}`);\n  lines.push(`  path:               ${detail.canonicalPath}`);\n  lines.push(\"\");\n  lines.push(\"Canonical content:\");\n  for (const line of detail.canonicalContent.split(\"\\n\")) {\n    lines.push(`  ${line}`);\n  }\n  lines.push(\"\");\n  lines.push(`Derived from (${detail.derivedFrom.length}):`);\n  if (detail.derivedFrom.length === 0) {\n    lines.push(\"  (none)\");\n  } else {\n    for (const entry of detail.derivedFrom) {\n      const versionStr =\n        entry.version !== null\n          ? ` v${entry.version}`\n          : entry.malformed\n            ? \" (malformed)\"\n            : \"\";\n      lines.push(`  - ${entry.path}${versionStr}`);\n    }\n  }\n  lines.push(\"\");\n  lines.push(`Cluster members (${detail.clusterMembers.length}):`);\n  if (detail.clusterMembers.length === 0) {\n    lines.push(\"  (none)\");\n  } else {\n    for (const member of detail.clusterMembers) {\n      const ts = member.supersededAt ?? \"—\";\n      lines.push(`  - ${member.id} (status=${member.status}, supersededAt=${ts})`);\n      if (member.preview.length > 0) {\n        lines.push(`      ${member.preview}`);\n      }\n    }\n  }\n  return lines.join(\"\\n\");\n}\n\n// ───────────────────────────────────────────────────────────────────────────\n// Internal helpers\n// ───────────────────────────────────────────────────────────────────────────\n\nfunction extractPreview(content: string): string {\n  const trimmed = content.trim();\n  if (trimmed.length === 0) return \"\";\n  const firstLine = trimmed.split(\"\\n\").find((line) => line.trim().length > 0) ?? \"\";\n  const collapsed = firstLine.trim().replace(/\\s+/g, \" \");\n  if (collapsed.length <= 120) return collapsed;\n  return collapsed.slice(0, 117) + \"...\";\n}\n\nfunction looksLikeDerivedFromPath(value: string): boolean {\n  return value.includes(\"/\") || value.includes(\".\");\n}\n\n/**\n * Escape characters that would break a Markdown table cell:\n *   - backslashes first (so the `\\|` escape below isn't double-escaped)\n *   - then pipe characters\n *\n * CodeQL \"Incomplete string escaping or encoding\": backslash must be\n * escaped before pipe so that a literal `\\` in content isn't\n * misinterpreted as part of a `\\|` escape sequence.\n */\nfunction escapePipes(value: string): string {\n  return value.replace(/\\\\/g, \"\\\\\\\\\").replace(/\\|/g, \"\\\\|\");\n}\n"],"mappings":";;;;;AAqBA,IAAM,gBAAgB,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAExE,SAAS,WAAW,MAAuB;AACzC,SAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ,KAAM,OAAO,QAAQ;AAChE;AAMO,SAAS,oBACd,MACA,OACA,KACS;AACT,MACE,CAAC,OAAO,UAAU,IAAI,KACtB,CAAC,OAAO,UAAU,KAAK,KACvB,CAAC,OAAO,UAAU,GAAG,GACrB;AACA,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,KAAK,QAAQ,GAAI,QAAO;AACpC,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,SAAS,UAAU,KAAK,WAAW,IAAI,IAAI,KAAK,cAAc,KAAK;AACzE,SAAO,OAAO;AAChB;AAgBO,SAAS,mBAAmB,OAAe,UAAwB;AAGxE,QAAM,QACJ;AACF,QAAM,QAAQ,MAAM,MAAM,KAAK;AAC/B,MAAI,CAAC,OAAO;AACV,UAAM,IAAI;AAAA,MACR,WAAW,QAAQ,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AAEA,QAAM,OAAO,OAAO,MAAM,CAAC,CAAC;AAC5B,QAAM,QAAQ,OAAO,MAAM,CAAC,CAAC;AAC7B,QAAM,MAAM,OAAO,MAAM,CAAC,CAAC;AAK3B,MAAI,CAAC,oBAAoB,MAAM,OAAO,GAAG,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,WAAW,QAAQ,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AAQA,MAAI,MAAM,CAAC,MAAM,QAAW;AAC1B,UAAM,OAAO,OAAO,MAAM,CAAC,CAAC;AAC5B,UAAM,SAAS,OAAO,MAAM,CAAC,CAAC;AAC9B,UAAM,SAAS,MAAM,CAAC,MAAM,SAAY,OAAO,MAAM,CAAC,CAAC,IAAI;AAC3D,QAAI,OAAO,MAAM,SAAS,MAAM,SAAS,IAAI;AAC3C,YAAM,IAAI;AAAA,QACR,WAAW,QAAQ,WAAW,KAAK;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAKA,QAAM,IAAI,IAAI,KAAK,KAAK;AACxB,MAAI,CAAC,OAAO,SAAS,EAAE,QAAQ,CAAC,GAAG;AACjC,UAAM,IAAI;AAAA,MACR,WAAW,QAAQ,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AAEA,SAAO;AACT;;;ACnFO,IAAM,0BAA0B,CAAC,QAAQ,YAAY,MAAM;AAY3D,SAAS,oBAAoB,OAAsC;AACxE,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MACE,OAAO,UAAU,YACjB,CAAE,wBAA8C,SAAS,KAAK,GAC9D;AACA,UAAM,IAAI;AAAA,MACR,2BAA2B,wBAAwB,KAAK,IAAI,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC;AAAA,IAC7F;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,mBAAmB,OAAoC;AACrE,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,QAAM,SAAS,OAAO,UAAU,WAAW,QAAQ,OAAO,KAAK;AAC/D,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,CAAC,OAAO,UAAU,MAAM,KAAK,UAAU,GAAG;AACxE,UAAM,IAAI;AAAA,MACR,2CAA2C,KAAK,UAAU,KAAK,CAAC;AAAA,IAClE;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,sBAAsB,OAAsC;AAC1E,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI;AAAA,MACR,oEAAoE,KAAK,UAAU,KAAK,CAAC;AAAA,IAC3F;AAAA,EACF;AACA,QAAM,QAAQ,MACX,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI;AAAA,MACR,gEAAgE,KAAK,UAAU,KAAK,CAAC;AAAA,IACvF;AAAA,EACF;AAEA,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAAmB,CAAC;AAC1B,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,WAAK,IAAI,IAAI;AACb,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACA,SAAO;AACT;AAUO,SAAS,mBAAmB,OAAoC;AACrE,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,GAAG;AAC1D,UAAM,IAAI;AAAA,MACR,0EAA0E,KAAK,UAAU,KAAK,CAAC;AAAA,IACjG;AAAA,EACF;AAEA,SAAO,mBAAmB,MAAM,KAAK,GAAG,SAAS,EAAE,YAAY;AACjE;AAkBO,SAAS,yBACd,SAC2B;AAC3B,QAAM,SAAS,oBAAoB,QAAQ,MAAM;AACjD,QAAM,QAAQ,mBAAmB,QAAQ,KAAK;AAC9C,QAAM,aAAa,sBAAsB,QAAQ,QAAQ;AACzD,QAAM,WAAW,mBAAmB,QAAQ,KAAK;AACjD,SAAO;AAAA,IACL;AAAA,IACA,GAAI,UAAU,SAAY,EAAE,MAAM,IAAI,CAAC;AAAA,IACvC,GAAI,eAAe,SAAY,EAAE,WAAW,IAAI,CAAC;AAAA,IACjD,GAAI,aAAa,SAAY,EAAE,SAAS,IAAI,CAAC;AAAA,EAC/C;AACF;AAMO,SAAS,4BACd,OACA,SAC+C;AAC/C,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,GAAG;AAC1D,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AACA,QAAM,SAAS,oBAAoB,QAAQ,MAAM;AACjD,SAAO,EAAE,IAAI,MAAM,KAAK,GAAG,OAAO;AACpC;AAkBA,IAAM,qBAAqB;AAsBpB,SAAS,uBACd,UACA,MACkB;AAClB,QAAM,UACJ,KAAK,aAAa,SAAY,KAAK,MAAM,KAAK,QAAQ,IAAI;AAC5D,QAAM,cACJ,KAAK,eAAe,SAAY,IAAI,IAAI,KAAK,UAAU,IAAI;AAE7D,QAAM,OAAyB,CAAC;AAChC,aAAW,UAAU,UAAU;AAC7B,UAAM,KAAK,OAAO;AAClB,UAAM,QAAQ,GAAG;AACjB,QAAI,OAAO,UAAU,YAAY,CAAC,OAAO,UAAU,KAAK,KAAK,SAAS,GAAG;AACvE;AAAA,IACF;AACA,QAAI,gBAAgB,UAAa,CAAC,YAAY,IAAI,GAAG,QAAQ,GAAG;AAC9D;AAAA,IACF;AACA,QAAI,YAAY,QAAW;AACzB,UAAI,OAAO,GAAG,uBAAuB,SAAU;AAC/C,YAAM,KAAK,KAAK,MAAM,GAAG,kBAAkB;AAC3C,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,QAAS;AAAA,IAC5C;AACA,SAAK,KAAK;AAAA,MACR,IAAI,GAAG;AAAA,MACP,UAAU,GAAG;AAAA,MACb,oBAAoB;AAAA,MACpB,GAAI,GAAG,uBAAuB,SAC1B,EAAE,kBAAkB,GAAG,mBAAmB,IAC1C,CAAC;AAAA,MACL,QAAQ,GAAG,UAAU;AAAA,MACrB,SAAS,eAAe,OAAO,OAAO;AAAA,MACtC,MAAM,OAAO;AAAA,IACf,CAAC;AAAA,EACH;AAEA,OAAK,KAAK,CAAC,GAAG,MAAM;AAClB,QAAI,EAAE,uBAAuB,EAAE,oBAAoB;AACjD,aAAO,EAAE,qBAAqB,EAAE;AAAA,IAClC;AAIA,UAAM,OAAO,EAAE,mBAAmB,KAAK,MAAM,EAAE,gBAAgB,IAAI;AACnE,UAAM,OAAO,EAAE,mBAAmB,KAAK,MAAM,EAAE,gBAAgB,IAAI;AACnE,UAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO;AAC3C,UAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO;AAC3C,QAAI,QAAQ,IAAK,QAAO,MAAM;AAC9B,QAAI,EAAE,KAAK,EAAE,GAAI,QAAO;AACxB,QAAI,EAAE,KAAK,EAAE,GAAI,QAAO;AACxB,WAAO;AAAA,EACT,CAAC;AAED,QAAM,QAAQ,KAAK,SAAS;AAC5B,SAAO,KAAK,MAAM,GAAG,KAAK;AAC5B;AA4CO,SAAS,qBACd,UACA,IAC6B;AAC7B,QAAM,YAAY,SAAS,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO,EAAE;AAC9D,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,KAAK,UAAU;AACrB,QAAM,QAAQ,GAAG;AACjB,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,UAAU,KAAK,KAAK,SAAS,GAAG;AACvE,WAAO;AAAA,EACT;AAEA,QAAM,eAA0C,GAAG,gBAAgB,CAAC,GAAG;AAAA,IACrE,CAAC,QAAQ;AACP,YAAM,YAAY,IAAI,YAAY,GAAG;AACrC,YAAM,cAAc,yBAAyB,GAAG;AAChD,UAAI,aAAa,GAAG;AAClB,cAAM,OAAO,IAAI,MAAM,GAAG,SAAS;AACnC,cAAM,aAAa,IAAI,MAAM,YAAY,CAAC;AAC1C,YACE,yBAAyB,IAAI,KAC7B,QAAQ,KAAK,UAAU,GACvB;AACA,iBAAO,EAAE,KAAK,MAAM,SAAS,OAAO,UAAU,EAAE;AAAA,QAClD;AACA,YAAI,CAAC,eAAe,0BAA0B,KAAK,GAAG,GAAG;AACvD,iBAAO,EAAE,KAAK,MAAM,KAAK,SAAS,KAAK;AAAA,QACzC;AACA,eAAO,EAAE,KAAK,MAAM,KAAK,SAAS,MAAM,WAAW,KAAK;AAAA,MAC1D;AACA,UAAI,0BAA0B,KAAK,GAAG,GAAG;AACvC,eAAO;AAAA,UACL;AAAA,UACA,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF;AACA,aAAO,EAAE,KAAK,MAAM,KAAK,SAAS,MAAM,WAAW,KAAK;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,UAAkC,CAAC;AACzC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,YAAY,iBAAiB,IAAI;AACrC,cAAQ,KAAK;AAAA,QACX,IAAI,EAAE,YAAY;AAAA,QAClB,QAAQ,EAAE,YAAY,UAAU;AAAA,QAChC,GAAI,EAAE,YAAY,iBAAiB,SAC/B,EAAE,cAAc,EAAE,YAAY,aAAa,IAC3C,CAAC;AAAA,QACL,MAAM,EAAE;AAAA,QACR,SAAS,eAAe,EAAE,OAAO;AAAA,MACnC,CAAC;AAAA,IACH;AAAA,EACF;AACA,UAAQ,KAAK,CAAC,GAAG,MAAM;AAGrB,UAAM,OAAO,EAAE,eAAe,KAAK,MAAM,EAAE,YAAY,IAAI;AAC3D,UAAM,OAAO,EAAE,eAAe,KAAK,MAAM,EAAE,YAAY,IAAI;AAC3D,UAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO;AAC3C,UAAM,MAAM,OAAO,SAAS,IAAI,IAAI,OAAO;AAC3C,QAAI,QAAQ,IAAK,QAAO,MAAM;AAC9B,QAAI,EAAE,KAAK,EAAE,GAAI,QAAO;AACxB,QAAI,EAAE,KAAK,EAAE,GAAI,QAAO;AACxB,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AAAA,IACL,IAAI,GAAG;AAAA,IACP,UAAU,GAAG;AAAA,IACb,oBAAoB;AAAA,IACpB,GAAI,GAAG,uBAAuB,SAC1B,EAAE,kBAAkB,GAAG,mBAAmB,IAC1C,CAAC;AAAA,IACL,QAAQ,GAAG,UAAU;AAAA,IACrB,GAAI,GAAG,gBAAgB,SAAY,EAAE,YAAY,GAAG,YAAY,IAAI,CAAC;AAAA,IACrE,kBAAkB,UAAU,QAAQ,KAAK;AAAA,IACzC,eAAe,UAAU;AAAA,IACzB;AAAA,IACA,gBAAgB;AAAA,EAClB;AACF;AAMO,SAAS,mBACd,MACA,QACQ;AACR,MAAI,WAAW,QAAQ;AACrB,WAAO,KAAK,UAAU,EAAE,KAAK,GAAG,MAAM,CAAC;AAAA,EACzC;AACA,MAAI,KAAK,WAAW,GAAG;AACrB,QAAI,WAAW,YAAY;AACzB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACA,MAAI,WAAW,YAAY;AACzB,UAAMA,SAAkB,CAAC,sBAAsB,EAAE;AACjD,IAAAA,OAAM,KAAK,uDAAuD;AAClE,IAAAA,OAAM,KAAK,iCAAiC;AAC5C,eAAW,OAAO,MAAM;AACtB,YAAM,OAAO,IAAI,oBAAoB;AACrC,YAAM,UAAU,YAAY,IAAI,OAAO;AACvC,MAAAA,OAAM;AAAA,QACJ,KAAK,IAAI,kBAAkB,QAAQ,IAAI,EAAE,QAAQ,IAAI,QAAQ,MAAM,IAAI,MAAM,OAAO;AAAA,MACtF;AAAA,IACF;AACA,WAAOA,OAAM,KAAK,IAAI,IAAI;AAAA,EAC5B;AAEA,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,qBAAqB,KAAK,MAAM,IAAI;AAC/C,QAAM,KAAK,EAAE;AACb,aAAW,OAAO,MAAM;AACtB,UAAM,OAAO,IAAI,oBAAoB;AACrC,UAAM;AAAA,MACJ,MAAM,IAAI,kBAAkB,MAAM,IAAI,EAAE,MAAM,IAAI,QAAQ,qBAAqB,IAAI,YAAY,IAAI,MAAM;AAAA,IAC3G;AACA,QAAI,IAAI,QAAQ,SAAS,GAAG;AAC1B,YAAM,KAAK,WAAW,IAAI,OAAO,EAAE;AAAA,IACrC;AACA,UAAM,KAAK,iBAAiB,IAAI,IAAI,EAAE;AAAA,EACxC;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEO,SAAS,qBACd,QACA,QACQ;AACR,MAAI,WAAW,QAAQ;AACrB,WAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;AAAA,EACvC;AACA,QAAM,OAAO,OAAO,oBAAoB;AACxC,QAAM,aAAa,OAAO,cAAc;AACxC,MAAI,WAAW,YAAY;AACzB,UAAMA,SAAkB,CAAC;AACzB,IAAAA,OAAM,KAAK,gBAAgB,OAAO,EAAE,IAAI;AACxC,IAAAA,OAAM,KAAK,EAAE;AACb,IAAAA,OAAM,KAAK,8BAA8B,OAAO,kBAAkB,EAAE;AACpE,IAAAA,OAAM,KAAK,0BAA0B,IAAI,EAAE;AAC3C,IAAAA,OAAM,KAAK,mBAAmB,OAAO,QAAQ,EAAE;AAC/C,IAAAA,OAAM,KAAK,iBAAiB,OAAO,MAAM,EAAE;AAC3C,IAAAA,OAAM,KAAK,sBAAsB,UAAU,EAAE;AAC7C,IAAAA,OAAM,KAAK,iBAAiB,OAAO,aAAa,IAAI;AACpD,IAAAA,OAAM,KAAK,EAAE;AACb,IAAAA,OAAM,KAAK,sBAAsB;AACjC,IAAAA,OAAM,KAAK,EAAE;AACb,IAAAA,OAAM,KAAK,KAAK;AAChB,IAAAA,OAAM,KAAK,OAAO,gBAAgB;AAClC,IAAAA,OAAM,KAAK,KAAK;AAChB,IAAAA,OAAM,KAAK,EAAE;AACb,IAAAA,OAAM,KAAK,oBAAoB,OAAO,YAAY,MAAM,GAAG;AAC3D,IAAAA,OAAM,KAAK,EAAE;AACb,QAAI,OAAO,YAAY,WAAW,GAAG;AACnC,MAAAA,OAAM,KAAK,qCAAqC;AAAA,IAClD,OAAO;AACL,iBAAW,SAAS,OAAO,aAAa;AACtC,cAAM,aACJ,MAAM,YAAY,OACd,KAAK,MAAM,OAAO,KAClB,MAAM,YACJ,iBACA;AACR,QAAAA,OAAM,KAAK,OAAO,MAAM,IAAI,KAAK,UAAU,EAAE;AAAA,MAC/C;AAAA,IACF;AACA,IAAAA,OAAM,KAAK,EAAE;AACb,IAAAA,OAAM,KAAK,uBAAuB,OAAO,eAAe,MAAM,GAAG;AACjE,IAAAA,OAAM,KAAK,EAAE;AACb,QAAI,OAAO,eAAe,WAAW,GAAG;AACtC,MAAAA,OAAM,KAAK,mDAAmD;AAAA,IAChE,OAAO;AACL,iBAAW,UAAU,OAAO,gBAAgB;AAC1C,cAAM,KAAK,OAAO,gBAAgB;AAClC,QAAAA,OAAM,KAAK,OAAO,OAAO,EAAE,cAAc,OAAO,MAAM,kBAAkB,EAAE,GAAG;AAC7E,YAAI,OAAO,QAAQ,SAAS,GAAG;AAC7B,UAAAA,OAAM,KAAK,OAAO,YAAY,OAAO,OAAO,CAAC,EAAE;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AACA,WAAOA,OAAM,KAAK,IAAI,IAAI;AAAA,EAC5B;AAEA,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,YAAY,OAAO,EAAE,EAAE;AAClC,QAAM,KAAK,0BAA0B,OAAO,kBAAkB,EAAE;AAChE,QAAM,KAAK,yBAAyB,IAAI,EAAE;AAC1C,QAAM,KAAK,yBAAyB,OAAO,QAAQ,EAAE;AACrD,QAAM,KAAK,yBAAyB,OAAO,MAAM,EAAE;AACnD,QAAM,KAAK,yBAAyB,UAAU,EAAE;AAChD,QAAM,KAAK,yBAAyB,OAAO,aAAa,EAAE;AAC1D,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,oBAAoB;AAC/B,aAAW,QAAQ,OAAO,iBAAiB,MAAM,IAAI,GAAG;AACtD,UAAM,KAAK,KAAK,IAAI,EAAE;AAAA,EACxB;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB,OAAO,YAAY,MAAM,IAAI;AACzD,MAAI,OAAO,YAAY,WAAW,GAAG;AACnC,UAAM,KAAK,UAAU;AAAA,EACvB,OAAO;AACL,eAAW,SAAS,OAAO,aAAa;AACtC,YAAM,aACJ,MAAM,YAAY,OACd,KAAK,MAAM,OAAO,KAClB,MAAM,YACJ,iBACA;AACR,YAAM,KAAK,OAAO,MAAM,IAAI,GAAG,UAAU,EAAE;AAAA,IAC7C;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,oBAAoB,OAAO,eAAe,MAAM,IAAI;AAC/D,MAAI,OAAO,eAAe,WAAW,GAAG;AACtC,UAAM,KAAK,UAAU;AAAA,EACvB,OAAO;AACL,eAAW,UAAU,OAAO,gBAAgB;AAC1C,YAAM,KAAK,OAAO,gBAAgB;AAClC,YAAM,KAAK,OAAO,OAAO,EAAE,YAAY,OAAO,MAAM,kBAAkB,EAAE,GAAG;AAC3E,UAAI,OAAO,QAAQ,SAAS,GAAG;AAC7B,cAAM,KAAK,SAAS,OAAO,OAAO,EAAE;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAMA,SAAS,eAAe,SAAyB;AAC/C,QAAM,UAAU,QAAQ,KAAK;AAC7B,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,YAAY,QAAQ,MAAM,IAAI,EAAE,KAAK,CAAC,SAAS,KAAK,KAAK,EAAE,SAAS,CAAC,KAAK;AAChF,QAAM,YAAY,UAAU,KAAK,EAAE,QAAQ,QAAQ,GAAG;AACtD,MAAI,UAAU,UAAU,IAAK,QAAO;AACpC,SAAO,UAAU,MAAM,GAAG,GAAG,IAAI;AACnC;AAEA,SAAS,yBAAyB,OAAwB;AACxD,SAAO,MAAM,SAAS,GAAG,KAAK,MAAM,SAAS,GAAG;AAClD;AAWA,SAAS,YAAY,OAAuB;AAC1C,SAAO,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,OAAO,KAAK;AAC1D;","names":["lines"]}